PoC for algorithm to parse weird boundaries in FU-A packets in an RTSP stream.

Original project for which this PoC is made: retina

Cases for PoC and status outlined below.

• Single pkt
  • boundary at start
  • boundary in middle
• Multiple pkts
  • boundary across pkts only
  • boundary across pkts AND in middle of same pkt

Note: Definition of Boundary (as of now): Consecutive 0x00s >= 3

[A - boundary - B]

[ [A], [B] ]

[boundary - A]

[ [A] ]

Not possible for a single pkt, as boundary at the end could mean that the boundary is either extended to next pkt, or that the boundary ends at the end of this pkt.

However, we won't know until we start reading the next pkt, hence this case will be covered by multiple pkt flow.

[ [A], [B - boundary], [boundary - C] ]

[ [A], [B], [C] ]

[ [A], [B - boundary], [boundary - C - boundary - D] ]

[ [A], [B], [C], [D] ]