[krbdev.mit.edu #7879] git commit

[Greg Hudson via RT]

Rewrite GSS sequence state tracking code

Replace util_ordering.c with a new file util_seqstate.c, implemented
using a bitmap of previously received sequence numbers instead of a
20-element circular queue.  This approach has slightly different
limitations--it can check for replays for values within 64 of the
expected next number, where the old code could check within the range
of the last 20 received numbers regardless of how far apart they are.
The new approach should work as well or better for any realistic
packet reordering scenario.

https://github.com/krb5/krb5/commit/cb3db58b1942998a5e2c4d46c21ca0554e769a8c
Author: Greg Hudson <ghudson at mit.edu>
Commit: cb3db58b1942998a5e2c4d46c21ca0554e769a8c
Branch: master
 src/lib/gssapi/generic/Makefile.in     |   10 +-
 src/lib/gssapi/generic/deps            |    8 +-
 src/lib/gssapi/generic/t_seqstate.c    |   15 ++-
 src/lib/gssapi/generic/util_ordering.c |  259 --------------------------------
 src/lib/gssapi/generic/util_seqstate.c |  163 ++++++++++++++++++++
 src/util/gss-kernel-lib/Makefile.in    |    8 +-
 src/util/gss-kernel-lib/deps           |    4 +-
 7 files changed, 190 insertions(+), 277 deletions(-)