tag	line	file	source code
next	38	drivers/block/blk.h	struct request * next;
next	277	drivers/block/blk.h	CURRENT = req->next;
next	201	drivers/block/genhd.c	for (p = gendisk_head ; p ; p=p->next) {
next	739	drivers/block/hd.c	hd_gendisk.next = gendisk_head;
next	156	drivers/block/ll_rw_blk.c	req->next = NULL;
next	166	drivers/block/ll_rw_blk.c	for ( ; tmp->next ; tmp = tmp->next) {
next	168	drivers/block/ll_rw_blk.c	!IN_ORDER(tmp,tmp->next)) &&
next	169	drivers/block/ll_rw_blk.c	IN_ORDER(req,tmp->next))
next	172	drivers/block/ll_rw_blk.c	req->next = tmp->next;
next	173	drivers/block/ll_rw_blk.c	tmp->next = req;
next	237	drivers/block/ll_rw_blk.c	req = req->next;
next	270	drivers/block/ll_rw_blk.c	req = req->next;
next	302	drivers/block/ll_rw_blk.c	req->next = NULL;
next	333	drivers/block/ll_rw_blk.c	req->next = NULL;
next	402	drivers/block/ll_rw_blk.c	plug.next = NULL;
next	418	drivers/block/ll_rw_blk.c	dev->current_request = plug.next;
next	468	drivers/block/ll_rw_blk.c	req->next = NULL;
next	482	drivers/block/ll_rw_blk.c	req->next = NULL;
next	124	drivers/block/xd.c	xd_gendisk.next = gendisk_head;
next	423	drivers/net/8390.c	if (rx_frame.next != next_frame
next	424	drivers/net/8390.c	&& rx_frame.next != next_frame + 1
next	425	drivers/net/8390.c	&& rx_frame.next != next_frame - num_rx_pages
next	426	drivers/net/8390.c	&& rx_frame.next != next_frame + 1 - num_rx_pages) {
next	437	drivers/net/8390.c	rx_frame.next);
next	462	drivers/net/8390.c	dev->name, rx_frame.status, rx_frame.next,
next	467	drivers/net/8390.c	next_frame = rx_frame.next;
next	156	drivers/net/8390.h	unsigned char next;   /* pointer to next packet. */
next	349	drivers/net/depca.c	while (dev->next != (struct device *)NULL) {
next	350	drivers/net/depca.c	if (dev->next->base_addr == 0xffe0) break;
next	351	drivers/net/depca.c	dev = dev->next;         /* walk through eth device list */
next	360	drivers/net/depca.c	if (dev->next == (struct device *)NULL) {
next	361	drivers/net/depca.c	dev->next = (struct device *)kmalloc(sizeof(struct device) + 8,
next	373	drivers/net/depca.c	if ((dev->next != (struct device *)NULL) &&
next	375	drivers/net/depca.c	dev = dev->next;         /* point to the new device */
next	379	drivers/net/depca.c	dev->next = (struct device *)NULL; /* mark the end of list */
next	127	drivers/net/net_init.c	while ((*old_devp)->next)
next	128	drivers/net/net_init.c	old_devp = & (*old_devp)->next;
next	129	drivers/net/net_init.c	(*old_devp)->next = dev;
next	130	drivers/net/net_init.c	dev->next = 0;
next	136	drivers/net/slhc.c	ts[i].next = &(ts[i - 1]);
next	138	drivers/net/slhc.c	ts[0].next = &(ts[comp->tslot_limit]);
next	225	drivers/net/slhc.c	register struct cstate *cs = lcs->next;
next	289	drivers/net/slhc.c	cs = cs->next;
next	317	drivers/net/slhc.c	lcs->next = cs->next;
next	318	drivers/net/slhc.c	cs->next = ocs->next;
next	319	drivers/net/slhc.c	ocs->next = cs;
next	126	drivers/net/slhc.h	struct cstate *next;  /* next in ring (xmit) */
next	864	drivers/scsi/NCR5380.c	instance=instance->next) {
next	972	drivers/scsi/NCR5380.c	the_template); instance = instance->next)
next	163	drivers/scsi/hosts.c	while(shpnt->next != sh) shpnt = shpnt->next;
next	164	drivers/scsi/hosts.c	shpnt->next = shpnt->next->next;
next	185	drivers/scsi/hosts.c	retval->next = NULL;
next	201	drivers/scsi/hosts.c	while(shpnt->next) shpnt = shpnt->next;
next	202	drivers/scsi/hosts.c	shpnt->next = retval;
next	208	drivers/scsi/hosts.h	struct Scsi_Host * next;
next	206	drivers/scsi/scsi.c	SCmd.next = NULL;
next	208	drivers/scsi/scsi.c	for (shpnt = scsi_hostlist; shpnt; shpnt = shpnt->next)
next	550	drivers/scsi/scsi.c	SCpnt = SCpnt->next;
next	637	drivers/scsi/scsi.c	SCpnt = SCpnt->next;
next	686	drivers/scsi/scsi.c	*reqp = req->next;
next	1370	drivers/scsi/scsi.c	SCpnt1 = SCpnt1->next;
next	1414	drivers/scsi/scsi.c	for(host = scsi_hostlist; host; host = host->next) {
next	1425	drivers/scsi/scsi.c	SCpnt =  SCpnt->next;
next	1471	drivers/scsi/scsi.c	for(host = scsi_hostlist; host; host = host->next) {
next	1476	drivers/scsi/scsi.c	SCpnt =  SCpnt->next;
next	1632	drivers/scsi/scsi.c	SCpnt->next = host->host_queue;
next	344	drivers/scsi/scsi.h	struct scsi_cmnd *next, *prev;
next	364	drivers/scsi/sd.c	req = req->next;
next	368	drivers/scsi/sd.c	CURRENT = CURRENT->next;
next	370	drivers/scsi/sd.c	req1->next = req->next;
next	1021	drivers/scsi/sd.c	sd_gendisk.next = gendisk_head;
next	325	drivers/scsi/sr.c	req = req->next;
next	329	drivers/scsi/sr.c	CURRENT = CURRENT->next;
next	331	drivers/scsi/sr.c	req1->next = req->next;
next	161	drivers/scsi/wd7000.c	scb = scbfree;  scbfree = scb->next;
next	162	drivers/scsi/wd7000.c	memset(scb, 0, sizeof(Scb));  scb->next = NULL;
next	178	drivers/scsi/wd7000.c	scb->next = scbfree;  scbfree = scb;
next	193	drivers/scsi/wd7000.c	for (i = 0;  i < MAX_SCBS-1;  i++)  scbs[i].next = &(scbs[i+1]);
next	194	drivers/scsi/wd7000.c	scbs[MAX_SCBS-1].next = NULL;
next	142	drivers/scsi/wd7000.h	struct scb *next;             /* for lists of scbs */
next	161	fs/buffer.c	struct buffer_head * bh, *next;
next	177	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; i-- > 0 ; bh = next) {
next	179	fs/buffer.c	next = bh->b_next_free;
next	1753	fs/buffer.c	struct buffer_head * bh, *next;
next	1770	fs/buffer.c	for (i = nr_buffers_type[nlist]; i-- > 0; bh = next) {
next	1773	fs/buffer.c	next = bh->b_next_free;
next	1828	fs/buffer.c	struct buffer_head * bh, *next;
next	1871	fs/buffer.c	bh = next) {
next	1874	fs/buffer.c	next = bh->b_next_free;
next	78	fs/ext/freelists.c	efb->next = sb->u.ext_sb.s_firstfreeblocknumber;
next	110	fs/ext/freelists.c	printk("ext_new_block: block empty, skipping to %d\n", efb->next);
next	113	fs/ext/freelists.c	sb->u.ext_sb.s_firstfreeblocknumber = efb->next;
next	160	fs/ext/freelists.c	block = efb->next;
next	168	fs/ext/freelists.c	block = efb->next;
next	233	fs/ext/freelists.c	efi->next = sb->u.ext_sb.s_firstfreeinodenumber;
next	269	fs/ext/freelists.c	printk("ext_free_inode: inode empty, skipping to %d\n", efi->next);
next	272	fs/ext/freelists.c	if (efi->next > sb->u.ext_sb.s_ninodes) {
next	273	fs/ext/freelists.c	printk ("efi->next = %d\n", efi->next);
next	276	fs/ext/freelists.c	sb->u.ext_sb.s_firstfreeinodenumber = efi->next;
next	277	fs/ext/freelists.c	block = 2 + (((unsigned long) efi->next) - 1) / EXT_INODES_PER_BLOCK;
next	321	fs/ext/freelists.c	ino = efi->next;
next	336	fs/ext/freelists.c	ino = efi->next;
next	34	fs/ext2/dcache.c	struct dir_cache_entry * next;
next	65	fs/ext2/dcache.c	dcache[0].next = &dcache[1];
next	69	fs/ext2/dcache.c	dcache[i].next = &dcache[i + 1];
next	73	fs/ext2/dcache.c	dcache[i].next = NULL;
next	107	fs/ext2/dcache.c	for (p = first; p != NULL; p = p->next)
next	119	fs/ext2/dcache.c	p->next = first;
next	147	fs/ext2/dcache.c	p->prev->next = p->next;
next	149	fs/ext2/dcache.c	first = p->next;
next	150	fs/ext2/dcache.c	if (p->next)
next	151	fs/ext2/dcache.c	p->next->prev = p->prev;
next	155	fs/ext2/dcache.c	p->next = NULL;
next	187	fs/ext2/dcache.c	p2 = p->next;
next	191	fs/ext2/dcache.c	p->next = first_free;
next	282	fs/ext2/dcache.c	first_free = p->next;
next	290	fs/ext2/dcache.c	last->next = NULL;
next	330	fs/ext2/dcache.c	p->next = first_free;
next	164	fs/inode.c	struct inode * inode, * next;
next	167	fs/inode.c	next = first_inode;
next	169	fs/inode.c	inode = next;
next	170	fs/inode.c	next = inode->i_next;  /* clear_inode() changes the queues.. */
next	271	fs/inode.c	struct inode * inode, * next;
next	274	fs/inode.c	next = first_inode;
next	276	fs/inode.c	inode = next;
next	277	fs/inode.c	next = inode->i_next;    /* clear_inode() changes the queues.. */
next	23	fs/msdos/fat.c	int first,last,next,copy;
next	50	fs/msdos/fat.c	next = CF_LE_W(((unsigned short *) data)[(first &
next	52	fs/msdos/fat.c	if (next >= 0xfff7) next = -1;
next	58	fs/msdos/fat.c	if (nr & 1) next = ((*p_first >> 4) | (*p_last << 4)) & 0xfff;
next	59	fs/msdos/fat.c	else next = (*p_first+(*p_last << 8)) & 0xfff;
next	60	fs/msdos/fat.c	if (next >= 0xff7) next = -1;
next	100	fs/msdos/fat.c	return next;
next	113	fs/msdos/fat.c	cache[count].next = count == FAT_CACHE-1 ? NULL :
next	128	fs/msdos/fat.c	for (walk = fat_cache; walk; walk = walk->next)
next	149	fs/msdos/fat.c	for (walk = fat_cache; walk; walk = walk->next) {
next	168	fs/msdos/fat.c	for (walk = fat_cache; walk->next; walk = (last = walk)->next)
next	178	fs/msdos/fat.c	last->next = walk->next;
next	179	fs/msdos/fat.c	walk->next = fat_cache;
next	190	fs/msdos/fat.c	last->next = NULL;
next	191	fs/msdos/fat.c	walk->next = fat_cache;
next	206	fs/msdos/fat.c	for (walk = fat_cache; walk; walk = walk->next)
next	216	fs/msdos/fat.c	for (walk = fat_cache; walk; walk = walk->next)
next	111	fs/msdos/namei.c	struct inode *next;
next	146	fs/msdos/namei.c	next = MSDOS_I(*result)->i_old;
next	148	fs/msdos/namei.c	if (!(*result = iget(next->i_sb,next->i_ino))) {
next	46	fs/super.c	if (fs->next)
next	52	fs/super.c	tmp = &(*tmp)->next;
next	65	fs/super.c	*tmp = fs->next;
next	66	fs/super.c	fs->next = NULL;
next	69	fs/super.c	tmp = &(*tmp)->next;
next	83	fs/super.c	fs = fs->next;
next	551	fs/super.c	for (fs_type = file_systems ; fs_type ; fs_type = fs_type->next) {
next	28	include/linux/ext_fs.h	unsigned long next;
next	34	include/linux/ext_fs.h	unsigned long next;
next	319	include/linux/fs.h	struct file_system_type * next;
next	46	include/linux/genhd.h	struct gendisk *next;
next	106	include/linux/mm.h	struct mem_list * next;
next	21	include/linux/module.h	struct module *next;
next	96	include/linux/msdos_fs.h	struct fat_cache *next; /* next cache entry */
next	77	include/linux/net.h	struct socket    *next;
next	74	include/linux/netdevice.h	struct device      *next;
next	147	include/linux/netdevice.h	struct packet_type  *next;
next	419	include/linux/sched.h	if (wait->next) {
next	423	include/linux/sched.h	printk("add_wait_queue (%08x): wait->next = %08x\n",pc,(unsigned long) wait->next);
next	429	include/linux/sched.h	wait->next = wait;
next	432	include/linux/sched.h	wait->next = (*p)->next;
next	433	include/linux/sched.h	(*p)->next = wait;
next	452	include/linux/sched.h	((*p = wait->next) == wait)) {
next	456	include/linux/sched.h	while (tmp->next != wait) {
next	457	include/linux/sched.h	tmp = tmp->next;
next	463	include/linux/sched.h	tmp->next = wait->next;
next	465	include/linux/sched.h	wait->next = NULL;
next	488	include/linux/sched.h	entry->wait.next = NULL;
next	30	include/linux/skbuff.h	struct sk_buff    * volatile next;
next	39	include/linux/skbuff.h	struct sk_buff    * volatile next;
next	119	include/linux/skbuff.h	return (list->next != list)? list->next : NULL;
next	77	include/linux/timer.h	struct timer_list *next;
next	11	include/linux/wait.h	struct wait_queue * next;
next	267	init/main.c	char *next;
next	276	init/main.c	next = line;
next	277	init/main.c	while ((line = next) != NULL) {
next	278	init/main.c	if ((next = strchr(line,' ')) != NULL)
next	279	init/main.c	*next++ = 0;
next	60	kernel/module.c	mp->next = module_list;
next	191	kernel/module.c	for (mp = module_list ; mp ; mp = mp->next) {
next	217	kernel/module.c	mpp = &mp->next;
next	220	kernel/module.c	mpp = &mp->next;
next	222	kernel/module.c	*mpp = mp->next;
next	245	kernel/module.c	for (mp = module_list ; mp ; mp = mp->next) {
next	166	kernel/sched.c	struct task_struct * next;
next	226	kernel/sched.c	next = p = &init_task;
next	231	kernel/sched.c	c = p->counter, next = p;
next	238	kernel/sched.c	if(current != next)
next	240	kernel/sched.c	switch_to(next);
next	282	kernel/sched.c	if (!tmp->next) {
next	289	kernel/sched.c	tmp = tmp->next;
next	308	kernel/sched.c	if (!tmp->next) {
next	315	kernel/sched.c	tmp = tmp->next;
next	369	kernel/sched.c	timer->next = NULL;
next	376	kernel/sched.c	timer->next = *p;
next	380	kernel/sched.c	p = &(*p)->next;
next	397	kernel/sched.c	if ((*p = timer->next) != NULL)
next	404	kernel/sched.c	p = &(*p)->next;
next	530	kernel/sched.c	next_timer = next_timer->next;
next	71	mm/kmalloc.c	struct page_descriptor *next;
next	205	mm/kmalloc.c	sizes[order].firstfree = page->next;
next	206	mm/kmalloc.c	page->next = NULL;
next	264	mm/kmalloc.c	page->next = sizes[order].firstfree;
next	295	mm/kmalloc.c	(((long)(page->next)) & ~PAGE_MASK) ||
next	299	mm/kmalloc.c	p, page->next, page->order);
next	319	mm/kmalloc.c	if (page->next)
next	325	mm/kmalloc.c	page->next = sizes[order].firstfree;
next	338	mm/kmalloc.c	sizes[order].firstfree = page->next;
next	343	mm/kmalloc.c	(pg2 != NULL) && (pg2->next != page);
next	344	mm/kmalloc.c	pg2=pg2->next)
next	347	mm/kmalloc.c	pg2->next = page->next;
next	1087	mm/memory.c	free_area_list[tmp].prev = free_area_list[tmp].next = &free_area_list[tmp];
next	394	mm/mmap.c	struct vm_area_struct *prev, *next;
next	401	mm/mmap.c	prev = mpnt, mpnt = next)
next	405	mm/mmap.c	next = mpnt->vm_next;
next	491	mm/swap.c	entry->next = head->next;
next	492	mm/swap.c	entry->next->prev = entry;
next	493	mm/swap.c	head->next = entry;
next	498	mm/swap.c	entry->next->prev = entry->prev;
next	499	mm/swap.c	entry->prev->next = entry->next;
next	574	mm/swap.c	do { struct mem_list *next = queue->next; \
next	575	mm/swap.c	if (queue != next) { \
next	576	mm/swap.c	queue->next = next->next; \
next	577	mm/swap.c	next->next->prev = queue; \
next	578	mm/swap.c	mark_used((unsigned long) next, new_order); \
next	581	mm/swap.c	EXPAND(next, order, new_order); \
next	582	mm/swap.c	return (unsigned long) next; \
next	645	mm/swap.c	for (tmp = free_area_list[order].next ; tmp != free_area_list + order ; tmp = tmp->next) {
next	23	mm/vmalloc.c	struct vm_struct * next;
next	138	mm/vmalloc.c	for (p = &vmlist ; (tmp = *p) ; p = &tmp->next) {
next	140	mm/vmalloc.c	*p = tmp->next;
next	162	mm/vmalloc.c	area->next = NULL;
next	163	mm/vmalloc.c	for (p = &vmlist; (tmp = *p) ; p = &tmp->next) {
next	169	mm/vmalloc.c	area->next = *p;
next	184	mm/vmalloc.c	for (p = &vmlist; (tmp = *p) ; p = &tmp->next) {
next	66	net/inet/arp.c	struct arp_table    *next;      /* Linked entry list     */
next	200	net/inet/arp.c	*pentry = entry->next;  /* remove from list */
next	207	net/inet/arp.c	pentry = &entry->next;  /* go to next entry */
next	369	net/inet/arp.c	*pentry = entry->next;  /* delete from linked list */
next	375	net/inet/arp.c	pentry = &(*pentry)->next;
next	446	net/inet/arp.c	*pentry = entry->next;
next	452	net/inet/arp.c	pentry = &entry->next;
next	534	net/inet/arp.c	proxy_entry = proxy_entry->next;
next	544	net/inet/arp.c	for (entry = arp_tables[hash]; entry != NULL; entry = entry->next)
next	602	net/inet/arp.c	entry->next = arp_tables[hash];
next	660	net/inet/arp.c	for (entry = arp_tables[hash]; entry != NULL; entry = entry->next)
next	706	net/inet/arp.c	entry->next = arp_tables[hash];
next	754	net/inet/arp.c	for (entry = arp_tables[i]; entry; entry = entry->next)
next	797	net/inet/arp.c	for (entry = arp_tables[hash]; entry != NULL; entry = entry->next)
next	872	net/inet/arp.c	for (entry = arp_tables[hash]; entry != NULL; entry = entry->next)
next	892	net/inet/arp.c	entry->next = arp_tables[hash];
next	157	net/inet/datagram.c	if(!skb->next && !skb->prev)  /* Been dequeued by someone - ie its read */
next	108	net/inet/dev.c	pt->next = ptype_base;
next	128	net/inet/dev.c	for (p1 = ptype_base; p1 != NULL; p1 = p1->next)
next	144	net/inet/dev.c	pt->next=NULL;
next	152	net/inet/dev.c	for(p1=ptype_base;p1->next!=NULL;p1=p1->next);
next	156	net/inet/dev.c	p1->next=pt;
next	188	net/inet/dev.c	ptype_base = pt->next;
next	201	net/inet/dev.c	for (pt1 = ptype_base; pt1->next != NULL; pt1 = pt1->next)
next	203	net/inet/dev.c	if (pt1->next == pt )
next	208	net/inet/dev.c	pt1->next = pt->next;
next	212	net/inet/dev.c	if (pt1->next->type == pt->type && pt->type != htons(ETH_P_ALL))
next	213	net/inet/dev.c	lpt = pt1->next;
next	231	net/inet/dev.c	for (dev = dev_base; dev != NULL; dev = dev->next)
next	344	net/inet/dev.c	if (skb->next != NULL)
next	550	net/inet/dev.c	for (dev = dev_base; dev != NULL; dev = dev->next)
next	670	net/inet/dev.c	for (ptype = ptype_base; ptype != NULL; ptype = ptype->next)
next	830	net/inet/dev.c	for (dev = dev_base; dev != NULL; dev = dev->next)
next	921	net/inet/dev.c	for (dev = dev_base; dev != NULL; dev = dev->next)
next	1280	net/inet/dev.c	for (dev = dev_base; dev != NULL; dev=dev->next)
next	1289	net/inet/dev.c	dev_base = dev->next;
next	1291	net/inet/dev.c	dev2->next = dev->next;
next	73	net/inet/dev.h	struct device      *next;
next	152	net/inet/dev.h	struct packet_type  *next;
next	143	net/inet/devinet.c	for (dev = dev_base; dev != NULL; dev = dev->next)
next	208	net/inet/devinet.c	for (dev = dev_base; dev != NULL; dev = dev->next)
next	227	net/inet/devinet.c	for (dev = dev_base; dev; dev = dev->next)
next	237	net/inet/devinet.c	for (dev = dev_base; dev; dev = dev->next)
next	68	net/inet/eth.c	d=d->next;
next	295	net/inet/icmp.c	nextip = (struct inet_protocol *) ipprot->next;
next	676	net/inet/ip.c	for(qp = ipqueue; qp != NULL; qplast = qp, qp = qp->next)
next	712	net/inet/ip.c	ipqueue = qp->next;
next	718	net/inet/ip.c	qp->prev->next = qp->next;
next	719	net/inet/ip.c	if (qp->next != NULL)
next	720	net/inet/ip.c	qp->next->prev = qp->prev;
next	728	net/inet/ip.c	xp = fp->next;
next	847	net/inet/ip.c	qp->next = ipqueue;
next	848	net/inet/ip.c	if (qp->next != NULL)
next	849	net/inet/ip.c	qp->next->prev = qp;
next	877	net/inet/ip.c	fp = fp->next;
next	945	net/inet/ip.c	fp = fp->next;
next	968	net/inet/ip.c	struct ipfrag *prev, *next;
next	1049	net/inet/ip.c	for(next = qp->fragments; next != NULL; next = next->next)
next	1051	net/inet/ip.c	if (next->offset > offset)
next	1053	net/inet/ip.c	prev = next;
next	1074	net/inet/ip.c	for(; next != NULL; next = tfp)
next	1076	net/inet/ip.c	tfp = next->next;
next	1077	net/inet/ip.c	if (next->offset >= end)
next	1080	net/inet/ip.c	i = end - next->offset;      /* overlap is 'i' bytes */
next	1081	net/inet/ip.c	next->len -= i;        /* so reduce size of  */
next	1082	net/inet/ip.c	next->offset += i;      /* next fragment  */
next	1083	net/inet/ip.c	next->ptr += i;
next	1089	net/inet/ip.c	if (next->len <= 0)
next	1092	net/inet/ip.c	next, next->len));
next	1093	net/inet/ip.c	if (next->prev != NULL)
next	1094	net/inet/ip.c	next->prev->next = next->next;
next	1096	net/inet/ip.c	qp->fragments = next->next;
next	1098	net/inet/ip.c	if (tfp->next != NULL)
next	1099	net/inet/ip.c	next->next->prev = next->prev;
next	1101	net/inet/ip.c	kfree_skb(next->skb,FREE_READ);
next	1102	net/inet/ip.c	kfree_s(next, sizeof(struct ipfrag));
next	1125	net/inet/ip.c	tfp->next = next;
next	1127	net/inet/ip.c	prev->next = tfp;
next	1131	net/inet/ip.c	if (next != NULL)
next	1132	net/inet/ip.c	next->prev = tfp;
next	1678	net/inet/ip.c	for (ipprot = (struct inet_protocol *)inet_protos[hash];ipprot != NULL;ipprot=(struct inet_protocol *)ipprot->next)
next	1834	net/inet/ip.c	if (skb->next != NULL)
next	47	net/inet/ip.h	struct ipfrag    *next;    /* linked list pointers      */
next	60	net/inet/ip.h	struct ipq  *next;    /* linked list pointers      */
next	73	net/inet/ipx.c	ipx_socket_list=s->next;
next	77	net/inet/ipx.c	while(s && s->next)
next	79	net/inet/ipx.c	if(s->next==sk)
next	81	net/inet/ipx.c	s->next=sk->next;
next	85	net/inet/ipx.c	s=s->next;
next	93	net/inet/ipx.c	sk->next=ipx_socket_list;
next	108	net/inet/ipx.c	s=s->next;
next	145	net/inet/ipx.c	for (s = ipx_socket_list; s != NULL; s = s->next)
next	203	net/inet/ipx.c	r=r->next;
next	227	net/inet/ipx.c	rt->next=ipx_router_list;
next	252	net/inet/ipx.c	rt->next=ipx_router_list;
next	268	net/inet/ipx.c	ipx_router_list=r->next;
next	271	net/inet/ipx.c	while(r->next!=NULL)
next	273	net/inet/ipx.c	if(r->next->net==net)
next	275	net/inet/ipx.c	ipx_route *d=r->next;
next	276	net/inet/ipx.c	r->next=d->next;
next	280	net/inet/ipx.c	r=r->next;
next	318	net/inet/ipx.c	for (rt = ipx_router_list; rt != NULL; rt = rt->next)
next	485	net/inet/ipx.c	sk->next=NULL;
next	52	net/inet/ipx.h	struct ipx_route *next;
next	105	net/inet/proc.c	sp = sp->next;
next	93	net/inet/protocol.c	for (p = inet_protos[hash] ; p != NULL; p=p->next) {
next	108	net/inet/protocol.c	prot ->next = inet_protos[hash];
next	113	net/inet/protocol.c	p2 = (struct inet_protocol *) prot->next;
next	119	net/inet/protocol.c	p2 = (struct inet_protocol *) prot->next;
next	133	net/inet/protocol.c	inet_protos[hash] = (struct inet_protocol *) inet_protos[hash]->next;
next	144	net/inet/protocol.c	if (p->next != NULL && p->next == prot) {
next	150	net/inet/protocol.c	p->next = prot->next;
next	154	net/inet/protocol.c	if (p->next != NULL && p->next->protocol == prot->protocol) {
next	158	net/inet/protocol.c	p = (struct inet_protocol *) p->next;
next	43	net/inet/protocol.h	struct inet_protocol *next;
next	418	net/inet/route.c	for (dev2 = dev_base ; dev2 != NULL ; dev2 = dev2->next)
next	56	net/inet/skbuff.c	if (!skb->next || !skb->prev) {
next	60	net/inet/skbuff.c	if (skb->next->magic_debug_cookie != SK_HEAD_SKB
next	61	net/inet/skbuff.c	&& skb->next->magic_debug_cookie != SK_GOOD_SKB) {
next	74	net/inet/skbuff.c	struct sk_buff *skb2 = skb->next;
next	82	net/inet/skbuff.c	skb2 = skb2->next;
next	88	net/inet/skbuff.c	if (skb->next != NULL && skb->next->magic_debug_cookie != SK_HEAD_SKB
next	89	net/inet/skbuff.c	&& skb->next->magic_debug_cookie != SK_GOOD_SKB) {
next	133	net/inet/skbuff.c	list->next = (struct sk_buff *)list;
next	155	net/inet/skbuff.c	if (newsk->next || newsk->prev)
next	159	net/inet/skbuff.c	newsk->next = list->next;
next	162	net/inet/skbuff.c	newsk->next->prev = newsk;
next	163	net/inet/skbuff.c	newsk->prev->next = newsk;
next	181	net/inet/skbuff.c	if (newsk->next || newsk->prev)
next	187	net/inet/skbuff.c	newsk->next = list;
next	190	net/inet/skbuff.c	newsk->next->prev = newsk;
next	191	net/inet/skbuff.c	newsk->prev->next = newsk;
next	212	net/inet/skbuff.c	result = list->next;
next	218	net/inet/skbuff.c	result->next->prev = list;
next	219	net/inet/skbuff.c	list->next = result->next;
next	221	net/inet/skbuff.c	result->next = NULL;
next	241	net/inet/skbuff.c	if(!old->next || !old->prev)
next	243	net/inet/skbuff.c	if(newsk->next || newsk->prev)
next	249	net/inet/skbuff.c	newsk->next = old;
next	252	net/inet/skbuff.c	newsk->prev->next = newsk;
next	269	net/inet/skbuff.c	if(!old->next || !old->prev)
next	271	net/inet/skbuff.c	if(newsk->next || newsk->prev)
next	279	net/inet/skbuff.c	newsk->next = old->next;
next	280	net/inet/skbuff.c	newsk->next->prev = newsk;
next	281	net/inet/skbuff.c	old->next = newsk;
next	302	net/inet/skbuff.c	if(skb->prev && skb->next)
next	304	net/inet/skbuff.c	skb->next->prev = skb->prev;
next	305	net/inet/skbuff.c	skb->prev->next = skb->next;
next	306	net/inet/skbuff.c	skb->next = NULL;
next	337	net/inet/skbuff.c	orig = list->next;
next	353	net/inet/skbuff.c	if (list->next != orig)  /* List changed go around another time */
next	367	net/inet/skbuff.c	newsk->next = NULL;
next	401	net/inet/skbuff.c	if (skb->next)
next	458	net/inet/skbuff.c	skb->prev = skb->next = NULL;
next	118	net/inet/sock.c	printk(" next = %p\n", sk->next);
next	142	net/inet/sock.c	printk("  prev = %p, next = %p\n", skb->prev, skb->next);
next	158	net/inet/sock.c	sk=sk->next) {
next	189	net/inet/sock.c	sk = sk->next;
next	223	net/inet/sock.c	sk->next = NULL;
next	245	net/inet/sock.c	for(sk2 = sk1; sk2 != NULL; sk2=sk2->next) {
next	248	net/inet/sock.c	sk->next = sk->prot->sock_array[num];
next	253	net/inet/sock.c	sk->next = sk2;
next	254	net/inet/sock.c	sk1->next= sk;
next	262	net/inet/sock.c	sk->next = NULL;
next	263	net/inet/sock.c	sk1->next = sk;
next	284	net/inet/sock.c	sk1->prot->sock_array[sk1->num &(SOCK_ARRAY_SIZE -1)] = sk1->next;
next	289	net/inet/sock.c	while(sk2 && sk2->next != sk1) {
next	290	net/inet/sock.c	sk2 = sk2->next;
next	294	net/inet/sock.c	sk2->next = sk1->next;
next	357	net/inet/sock.c	if (skb->next  && skb->prev) {
next	850	net/inet/sock.c	sk->next = NULL;
next	1017	net/inet/sock.c	sk2 != NULL; sk2 = sk2->next) {
next	1648	net/inet/sock.c	s != NULL; s = s->next)
next	1819	net/inet/sock.c	tmp = (struct inet_protocol *) p->next;
next	90	net/inet/sock.h	struct sock      *next;
next	324	net/inet/tcp.c	skb = skb->next;
next	597	net/inet/tcp.c	if (skb->next != NULL) {
next	602	net/inet/tcp.c	if (before(sk->window_seq, sk->write_queue.next->h.seq) &&
next	1416	net/inet/tcp.c	skb = skb->next;
next	1598	net/inet/tcp.c	if (buff->next != NULL)
next	2187	net/inet/tcp.c	if (buff->next != NULL)
next	2350	net/inet/tcp.c	if (skb->next != NULL) {
next	2418	net/inet/tcp.c	! before (sk->window_seq, sk->write_queue.next->h.seq)) {
next	2523	net/inet/tcp.c	if (oskb->next)
next	2538	net/inet/tcp.c	if (after (sk->window_seq+1, sk->write_queue.next->h.seq) &&
next	2541	net/inet/tcp.c	before(sk->write_queue.next->h.seq, sk->rcv_ack_seq + 1))
next	2545	net/inet/tcp.c	} else if (before(sk->window_seq, sk->write_queue.next->h.seq) &&
next	2763	net/inet/tcp.c	for(skb2 = skb->next;
next	2765	net/inet/tcp.c	skb2 = skb2->next) {
next	107	net/inet/timer.c	before(sk->window_seq, sk->write_queue.next->h.seq) &&
next	251	net/socket.c	nextsock = peersock->next;
next	387	net/socket.c	mysock->next = NULL;
next	391	net/socket.c	while (last->next) last = last->next;
next	392	net/socket.c	last->next = mysock;
next	417	net/socket.c	servsock->iconn = mysock->next;
next	419	net/socket.c	while (last->next != mysock) last = last->next;
next	420	net/socket.c	last->next = mysock->next;
next	549	net/unix/sock.c	sock->iconn = clientsock->next;
next	550	net/unix/sock.c	clientsock->next = NULL;