Lines Matching defs:next
256 static u_int32_t inaddr_hashp; /* next largest prime */
444 ipq[i].next = ipq[i].prev = &ipq[i];
509 * Generate the next largest prime greater than inaddr_nhash.
669 * try to reassemble. Process options. Pass to next level.
1245 for (fp = ipq[sum].next; fp != &ipq[sum]; fp = fp->next)
1470 int i, next;
1628 next = 0;
1630 if (GETIP(q)->ip_off != next) {
1637 next += GETIP(q)->ip_len;
1653 if (next + (IP_VHL_HL(ip->ip_vhl) << 2) > IP_MAXPACKET) {
1703 ip->ip_len = next;
1764 fp = ipq[i].next;
1769 fp = fp->next;
1784 (ipq[i].next != &ipq[i])) {
1785 OSAddAtomic(ipq[i].next->ipq_nfrags, &ipstat.ips_fragdropped);
1786 ip_freef(ipq[i].next);
1803 while (ipq[i].next != &ipq[i]) {
1804 OSAddAtomic(ipq[i].next->ipq_nfrags, &ipstat.ips_fragdropped);
1805 ip_freef(ipq[i].next);
1870 * Record interface address and bring up next address
1871 * component. If strictly routed make sure next
1896 * Loose routing, and not at next destination
2103 * Given address of next destination (final or next hop),