Lines Matching refs:next
63 * the next expected SSN to be present in the stream queue, we deliver any
82 p = s->next;
103 (*head)->prev = (*head)->next = NULL;
121 t->next = *head;
139 * 4a. p may now border p->next from less; if so, coalesce those
144 for (p = *head; ; p = p->next) {
150 t->next = p;
156 p->prev->next = t;
178 if (p->next != NULL && (tsn + 1) == p->next->begin) {
179 /* 4a: coalesce p and p->next */
180 t = p->next;
182 p->next = t->next;
183 if (t->next != NULL)
184 t->next->prev = p;
191 if (p->next == NULL) {
196 t->next = NULL;
200 p->next = t;
223 for (p = *head; p->next; p = p->next) {
236 p = p->next;
243 p->prev->next = NULL;
252 for (p = *head; p != NULL; p = p->next)
862 * the next deliverable tsn. When the next deliverable
1071 * If partial delivery did take place but the next arriving
1072 * fragment was not the next to be delivered, or partial
1074 * tail. The next fragment due to be delivered still has to
1304 dprint(2, ("data_chunk: acking next %x\n", tsn)); \
1337 for (sp = sctp->sctp_sack_info; sp; sp = sp->next) {
1359 * Check for buffer space. Note if this is the next expected TSN
1474 * Unless message is the next for delivery to the ulp, queue complete
1593 * the next ssn and the partial message must have the
1594 * same ssn as the next expected message..
1779 for (sp = sctp->sctp_sack_info; sp; sp = sp->next) {
2231 * have sent partial message only for the next in sequence,
2347 mblk_t *next;
2354 next = dmp->b_next;
2391 dmp->b_next = next;
2406 if (next != NULL)
2407 next->b_prev = NULL;
2408 instr->istr_msgs = next;
2615 * Move to the next message in the transmit list
3016 /* Go to the next chunk of the current message */
3019 * Move to the next message in the transmit list