Lines Matching refs:sequence
70 #define MPHDRLEN_SSN 4 /* ditto with short sequence numbers */
141 u32 nxseq; /* next sequence number to send */
185 u32 lastseq; /* MP: last sequence # received */
253 /* Compare multilink sequence numbers (assumed to be 32 bits wide) */
2187 u32 sequence;
2599 /* Decode sequence number and begin/end bits */
2619 * Expand sequence number to 32 bits, making it as close
2627 PPP_MP_CB(skb)->sequence = seq;
2643 * last sequence number received on each channel. Because of
2644 * the increasing sequence number rule, we know that any fragment
2663 if (seq_before(ppp->minseq, PPP_MP_CB(mskb)->sequence))
2664 ppp->minseq = PPP_MP_CB(mskb)->sequence;
2687 * The queue is ordered by increasing sequence number.
2694 u32 seq = PPP_MP_CB(skb)->sequence;
2699 if (seq_before(seq, PPP_MP_CB(p)->sequence))
2707 * We go through increasing sequence numbers until we find a
2708 * complete packet, or we get to the sequence number for a fragment
2728 if (seq_before(PPP_MP_CB(p)->sequence, seq)) {
2732 PPP_MP_CB(p)->sequence, seq);
2737 if (PPP_MP_CB(p)->sequence != seq) {
2746 seq = seq_before(minseq, PPP_MP_CB(p)->sequence)?
2747 minseq + 1: PPP_MP_CB(p)->sequence;
2801 PPP_MP_CB(p)->sequence);
2816 if (PPP_MP_CB(head)->sequence != ppp->nextseq) {
2823 PPP_MP_CB(p)->sequence);
2832 PPP_MP_CB(head)->sequence-1);
2859 ppp->nextseq = PPP_MP_CB(tail)->sequence + 1;