Sliding protocols c code explanation?
It's a ring buffer containment test. There are a limited number of ordering permutations of 3 positions within a linear memory space, and only 5 of those permutations have position b after or equal to position a and before position c when the linear space is joined at the ends. The condition in the code simply verifies that one of those 5 permutations is in effect.