mirror of https://github.com/OISF/suricata
stream/segments: speed up inserts
Don't try to do a 'fast path' by checking RB_MAX. RB_MAX walks the tree which means it can be quite expensive. This cost would be paid for virtually every data segment. The actual insert that follows would walk the tree again. Instead, simply insert it. There is a slight cost of the unnecessary overlap check, but this is much less than the tree walk in a full tree.pull/3479/head
parent
f4ff33969e
commit
51ce03e76a
Loading…
Reference in New Issue