Lines Matching defs:sequence
70 #define MPHDRLEN_SSN 4 /* ditto with short sequence numbers */
141 u32 nxseq; /* next sequence number to send */
183 u32 lastseq; /* MP: last sequence # received */
251 /* Compare multilink sequence numbers (assumed to be 32 bits wide) */
2054 u32 sequence;
2428 /* Decode sequence number and begin/end bits */
2448 * Expand sequence number to 32 bits, making it as close
2456 PPP_MP_CB(skb)->sequence = seq;
2472 * last sequence number received on each channel. Because of
2473 * the increasing sequence number rule, we know that any fragment
2492 if (seq_before(ppp->minseq, PPP_MP_CB(mskb)->sequence))
2493 ppp->minseq = PPP_MP_CB(mskb)->sequence;
2516 * The queue is ordered by increasing sequence number.
2523 u32 seq = PPP_MP_CB(skb)->sequence;
2528 if (seq_before(seq, PPP_MP_CB(p)->sequence))
2536 * We go through increasing sequence numbers until we find a
2537 * complete packet, or we get to the sequence number for a fragment
2557 if (seq_before(PPP_MP_CB(p)->sequence, seq)) {
2561 PPP_MP_CB(p)->sequence, seq);
2566 if (PPP_MP_CB(p)->sequence != seq) {
2575 seq = seq_before(minseq, PPP_MP_CB(p)->sequence)?
2576 minseq + 1: PPP_MP_CB(p)->sequence;
2630 PPP_MP_CB(p)->sequence);
2645 if (PPP_MP_CB(head)->sequence != ppp->nextseq) {
2652 PPP_MP_CB(p)->sequence);
2661 PPP_MP_CB(head)->sequence-1);
2688 ppp->nextseq = PPP_MP_CB(tail)->sequence + 1;