298 		struct sk_buff *xp = fp->next;  in ip_frag_reinit()
320 	struct sk_buff *prev, *next;  in ip_frag_queue()  local
388 		next = NULL;  in ip_frag_queue()
392 	for (next = qp->q.fragments; next != NULL; next = next->next) {  in ip_frag_queue()
393 		if (FRAG_CB(next)->offset >= offset)  in ip_frag_queue()
395 		prev = next;  in ip_frag_queue()
421 	while (next && FRAG_CB(next)->offset < end) {  in ip_frag_queue()
422 		int i = end - FRAG_CB(next)->offset; /* overlap is 'i' bytes */  in ip_frag_queue()
424 		if (i < next->len) {  in ip_frag_queue()
428 			if (!pskb_pull(next, i))  in ip_frag_queue()
430 			FRAG_CB(next)->offset += i;  in ip_frag_queue()
432 			if (next->ip_summed != CHECKSUM_UNNECESSARY)  in ip_frag_queue()
433 				next->ip_summed = CHECKSUM_NONE;  in ip_frag_queue()
436 			struct sk_buff *free_it = next;  in ip_frag_queue()
441 			next = next->next;  in ip_frag_queue()
444 				prev->next = next;  in ip_frag_queue()
446 				qp->q.fragments = next;  in ip_frag_queue()
457 	skb->next = next;  in ip_frag_queue()
458 	if (!next)  in ip_frag_queue()
461 		prev->next = skb;  in ip_frag_queue()
523 		head = prev->next;  in ip_frag_reasm()
528 		fp->next = head->next;  in ip_frag_reasm()
529 		if (!fp->next)  in ip_frag_reasm()
531 		prev->next = fp;  in ip_frag_reasm()
534 		head->next = qp->q.fragments->next;  in ip_frag_reasm()
565 		clone->next = head->next;  in ip_frag_reasm()
566 		head->next = clone;  in ip_frag_reasm()
582 	for (fp = head->next; fp;) {  in ip_frag_reasm()
585 		struct sk_buff *next = fp->next;  in ip_frag_reasm()  local
602 		fp = next;  in ip_frag_reasm()
606 	head->next = NULL;  in ip_frag_reasm()