tag	line	file	source code
next	257	drivers/block/blk.h	CURRENT = req->next;
next	202	drivers/block/genhd.c	for (p = gendisk_head ; p ; p=p->next) {
next	1079	drivers/block/hd.c	hd_gendisk.next = gendisk_head;
next	153	drivers/block/ll_rw_blk.c	req->next = NULL;
next	163	drivers/block/ll_rw_blk.c	for ( ; tmp->next ; tmp = tmp->next) {
next	165	drivers/block/ll_rw_blk.c	!IN_ORDER(tmp,tmp->next)) &&
next	166	drivers/block/ll_rw_blk.c	IN_ORDER(req,tmp->next))
next	169	drivers/block/ll_rw_blk.c	req->next = tmp->next;
next	170	drivers/block/ll_rw_blk.c	tmp->next = req;
next	236	drivers/block/ll_rw_blk.c	req = req->next;
next	269	drivers/block/ll_rw_blk.c	req = req->next;
next	301	drivers/block/ll_rw_blk.c	req->next = NULL;
next	333	drivers/block/ll_rw_blk.c	req->next = NULL;
next	401	drivers/block/ll_rw_blk.c	plug.next = NULL;
next	417	drivers/block/ll_rw_blk.c	dev->current_request = plug.next;
next	468	drivers/block/ll_rw_blk.c	req->next = NULL;
next	481	drivers/block/ll_rw_blk.c	req->next = NULL;
next	124	drivers/block/xd.c	xd_gendisk.next = gendisk_head;
next	523	drivers/char/serial.c	goto next;
next	536	drivers/char/serial.c	next:
next	607	drivers/char/serial.c	goto next;
next	619	drivers/char/serial.c	next:
next	218	drivers/char/tty_io.c	for (p = tty_drivers; p; p = p->next) {
next	1021	drivers/char/tty_io.c	for (tq=tq_timer, prev=0; tq; prev=tq, tq=tq->next) {
next	1024	drivers/char/tty_io.c	prev->next = tq->next;
next	1026	drivers/char/tty_io.c	tq_timer = tq->next;
next	1547	drivers/char/tty_io.c	driver->next = tty_drivers;
next	421	drivers/net/8390.c	if (rx_frame.next != next_frame
next	422	drivers/net/8390.c	&& rx_frame.next != next_frame + 1
next	423	drivers/net/8390.c	&& rx_frame.next != next_frame - num_rx_pages
next	424	drivers/net/8390.c	&& rx_frame.next != next_frame + 1 - num_rx_pages) {
next	435	drivers/net/8390.c	rx_frame.next);
next	460	drivers/net/8390.c	dev->name, rx_frame.status, rx_frame.next,
next	465	drivers/net/8390.c	next_frame = rx_frame.next;
next	156	drivers/net/8390.h	unsigned char next;   /* pointer to next packet. */
next	89	drivers/net/apricot.c	struct i596_cmd *next;
next	98	drivers/net/apricot.c	struct i596_tbd *next;
next	112	drivers/net/apricot.c	struct i596_rfd *next;
next	218	drivers/net/apricot.c	lp->rx[i].next = &lp->rx[0];
next	223	drivers/net/apricot.c	lp->rx[i].next = &lp->rx[i+1];
next	353	drivers/net/apricot.c	lp->scb.rfd=lp->scb.rfd->next;
next	376	drivers/net/apricot.c	cmd->next = (struct i596_cmd *) -1;
next	381	drivers/net/apricot.c	lp->cmd_tail->next = cmd;
next	442	drivers/net/apricot.c	lp->cmd_head = lp->cmd_head->next;
next	457	drivers/net/apricot.c	ptr->next = (struct i596_cmd * ) -1;
next	465	drivers/net/apricot.c	ptr->next = (struct i596_cmd * ) -1;
next	470	drivers/net/apricot.c	ptr->next = (struct i596_cmd * ) -1;
next	584	drivers/net/apricot.c	tx_cmd->tbd->next = (struct i596_tbd *) -1;
next	732	drivers/net/apricot.c	lp->cmd_head = lp->cmd_head->next;
next	759	drivers/net/apricot.c	ptr->next = (struct i596_cmd * ) -1;
next	767	drivers/net/apricot.c	ptr->next = (struct i596_cmd * ) -1;
next	793	drivers/net/apricot.c	ptr->next = (struct i596_cmd * ) -1;
next	803	drivers/net/apricot.c	ptr = ptr->next;
next	911	drivers/net/apricot.c	if (lp->set_conf.next != (struct i596_cmd * ) -1) return;
next	1350	drivers/net/depca.c	while (dev->next != NULL) {
next	1351	drivers/net/depca.c	if (dev->next->base_addr == 0xffe0) break;
next	1352	drivers/net/depca.c	dev = dev->next;         /* walk through eth device list */
next	1360	drivers/net/depca.c	if (dev->next == NULL) {
next	1361	drivers/net/depca.c	dev->next = (struct device *)kmalloc(sizeof(struct device) + 8,
next	1363	drivers/net/depca.c	if (dev->next == NULL) {
next	1374	drivers/net/depca.c	if ((dev->next != NULL) &&
next	1376	drivers/net/depca.c	dev = dev->next;      /* point to the new device */
next	1380	drivers/net/depca.c	dev->next = NULL;      /* mark the end of list */
next	126	drivers/net/net_init.c	while ((*old_devp)->next)
next	127	drivers/net/net_init.c	old_devp = & (*old_devp)->next;
next	128	drivers/net/net_init.c	(*old_devp)->next = dev;
next	129	drivers/net/net_init.c	dev->next = 0;
next	222	drivers/net/net_init.c	while (d->next)
next	223	drivers/net/net_init.c	d = d->next;
next	224	drivers/net/net_init.c	d->next = dev;
next	228	drivers/net/net_init.c	dev->next = NULL;
next	255	drivers/net/net_init.c	dev_base = dev->next;
next	257	drivers/net/net_init.c	while (d && (d->next != dev))
next	258	drivers/net/net_init.c	d = d->next;
next	260	drivers/net/net_init.c	if (d && (d->next == dev)) {
next	261	drivers/net/net_init.c	d->next = dev->next;
next	632	drivers/net/ni52.c	p->xmit_buffs[i]->next = 0xffff;
next	678	drivers/net/ni52.c	rfd[i].next = make16(rfd + (i+1) % NUM_RECV_FRAMES);
next	692	drivers/net/ni52.c	rbd[i].next = make16((rbd + (i+1) % NUM_RECV_BUFFS));
next	824	drivers/net/ni52.c	rbd1 = (struct rbd_struct *) make32(rbd1->next);
next	825	drivers/net/ni52.c	for(;rbd1 != rbd_first;rbd1 = (struct rbd_struct *)  make32(rbd1->next))
next	838	drivers/net/ni52.c	rfd1 = (struct rfd_struct *) make32(rfd1->next);
next	839	drivers/net/ni52.c	for(;rfd1 != p->rfd_top;rfd1 = (struct rfd_struct *)  make32(rfd1->next))
next	853	drivers/net/ni52.c	p->rfd_top = (struct rfd_struct *) make32(p->rfd_top->next);
next	860	drivers/net/ni52.c	for(totlen=0; !(rbd->status & RBD_LAST); rbd=(struct rbd_struct *) make32(rbd->next)) {
next	122	drivers/net/ni52.h	unsigned short next;    /* linkoffset to next RFD */
next	142	drivers/net/ni52.h	unsigned short next;    /* pointeroffset to next RBD */
next	276	drivers/net/ni52.h	unsigned short next;          /* pointeroffset to next TBD */
next	2056	drivers/net/sk_g16.c	(int) dev->next, (int) dev->init);
next	143	drivers/net/slhc.c	ts[i].next = &(ts[i - 1]);
next	145	drivers/net/slhc.c	ts[0].next = &(ts[comp->tslot_limit]);
next	232	drivers/net/slhc.c	register struct cstate *cs = lcs->next;
next	292	drivers/net/slhc.c	cs = cs->next;
next	319	drivers/net/slhc.c	lcs->next = cs->next;
next	320	drivers/net/slhc.c	cs->next = ocs->next;
next	321	drivers/net/slhc.c	ocs->next = cs;
next	126	drivers/net/slhc.h	struct cstate *next;  /* next in ring (xmit) */
next	438	drivers/scsi/53c7,8xx.c	(search->irq != host->irq); search=search->next);
next	1364	drivers/scsi/53c7,8xx.c	cmd->prev->next = cmd->next;
next	1366	drivers/scsi/53c7,8xx.c	if (cmd->next)
next	1367	drivers/scsi/53c7,8xx.c	cmd->next->prev = cmd->prev;
next	1370	drivers/scsi/53c7,8xx.c	hostdata->running_list = cmd->next;
next	1423	drivers/scsi/53c7,8xx.c	bp = bp->next);
next	1934	drivers/scsi/53c7,8xx.c	bp; prev = (struct NCR53c7x0_break **) &(bp->next),
next	1935	drivers/scsi/53c7,8xx.c	bp = (struct NCR53c7x0_break *) bp->next);
next	1949	drivers/scsi/53c7,8xx.c	*prev = bp->next;
next	1976	drivers/scsi/53c7,8xx.c	bp; bp = (struct NCR53c7x0_break *) bp->next); {
next	2021	drivers/scsi/53c7,8xx.c	bp->next = hostdata->breakpoints;
next	2022	drivers/scsi/53c7,8xx.c	hostdata->breakpoints = bp->next;
next	2046	drivers/scsi/53c7,8xx.c	(host->hostt == the_template); --dev, host = host->next)
next	2384	drivers/scsi/53c7,8xx.c	tmp->next = NULL;
next	2680	drivers/scsi/53c7,8xx.c	tmp->next = hostdata->running_list;
next	2743	drivers/scsi/53c7,8xx.c	tmp->next; tmp = (struct NCR53c7x0_cmd *) tmp->next);
next	2744	drivers/scsi/53c7,8xx.c	tmp->next = tmp;
next	2945	drivers/scsi/53c7,8xx.c	for (host = first_host; host; host = hostdata->next ?
next	2946	drivers/scsi/53c7,8xx.c	hostdata->next : NULL) {
next	2998	drivers/scsi/53c7,8xx.c	&(cmd->next), cmd = (struct NCR53c7x0_cmd *) cmd->next) {
next	3025	drivers/scsi/53c7,8xx.c	cmd->prev->next = cmd->next;
next	3027	drivers/scsi/53c7,8xx.c	*cmd_prev_ptr = cmd->next;
next	3093	drivers/scsi/53c7,8xx.c	cmd = (struct NCR53c7x0_cmd *)(cmd->next));
next	3651	drivers/scsi/53c7,8xx.c	curr && curr->cmd != cmd; prev = &(curr->next), curr = curr->next);
next	3654	drivers/scsi/53c7,8xx.c	*prev = curr->next;
next	3657	drivers/scsi/53c7,8xx.c	curr->prev->next = curr->next;
next	3681	drivers/scsi/53c7,8xx.c	curr && curr->cmd != cmd; prev = &(curr->next), curr = curr->next);
next	953	drivers/scsi/53c7,8xx.h	struct NCR53c7x0_cmd *next, *prev;  /* Linux maintained lists */
next	975	drivers/scsi/53c7,8xx.h	struct NCR53c7x0_break *next;
next	1013	drivers/scsi/53c7,8xx.h	struct Scsi_Host *next;    /* next of this type */
next	936	drivers/scsi/NCR5380.c	instance->hostt == the_template; instance=instance->next) {
next	1044	drivers/scsi/NCR5380.c	the_template); instance = instance->next)
next	913	drivers/scsi/aha152x.c	Scsi_Cmnd *ptr, *prev, *next;
next	949	drivers/scsi/aha152x.c	next = (Scsi_Cmnd *) ptr->host_scribble;
next	955	drivers/scsi/aha152x.c	ptr = next;
next	187	drivers/scsi/hosts.c	while(shpnt->next != sh) shpnt = shpnt->next;
next	188	drivers/scsi/hosts.c	shpnt->next = shpnt->next->next;
next	211	drivers/scsi/hosts.c	retval->next = NULL;
next	227	drivers/scsi/hosts.c	while(shpnt->next) shpnt = shpnt->next;
next	228	drivers/scsi/hosts.c	shpnt->next = retval;
next	237	drivers/scsi/hosts.c	if(sdpnt->next) panic("Device already registered");
next	238	drivers/scsi/hosts.c	sdpnt->next = scsi_devicelist;
next	274	drivers/scsi/hosts.c	tpnt->next = scsi_hosts;
next	53	drivers/scsi/hosts.h	struct SHT * next;
next	226	drivers/scsi/hosts.h	struct Scsi_Host * next;
next	284	drivers/scsi/hosts.h	struct Scsi_Device_Template * next;
next	231	drivers/scsi/scsi.c	SCmd.next = NULL;
next	236	drivers/scsi/scsi.c	while(SDtail->next) SDtail = SDtail->next;
next	253	drivers/scsi/scsi.c	SDpnt->next = NULL;
next	389	drivers/scsi/scsi.c	for(sdtpnt = scsi_devicelist; sdtpnt; sdtpnt = sdtpnt->next)
next	466	drivers/scsi/scsi.c	SDtail->next = SDpnt;
next	488	drivers/scsi/scsi.c	for(sdtpnt = scsi_devicelist; sdtpnt; sdtpnt = sdtpnt->next)
next	576	drivers/scsi/scsi.c	SCpnt = SCpnt->next;
next	664	drivers/scsi/scsi.c	SCpnt = SCpnt->next;
next	713	drivers/scsi/scsi.c	*reqp = req->next;
next	1478	drivers/scsi/scsi.c	SCpnt1 = SCpnt1->next;
next	1551	drivers/scsi/scsi.c	for(host = scsi_hostlist; host; host = host->next) {
next	1552	drivers/scsi/scsi.c	for(SCpnt = host->host_queue; SCpnt; SCpnt = SCpnt->next)
next	1604	drivers/scsi/scsi.c	for(host = scsi_hostlist; host; host = host->next)
next	1605	drivers/scsi/scsi.c	for(SCpnt = host->host_queue; SCpnt; SCpnt = SCpnt->next)
next	1760	drivers/scsi/scsi.c	for (shpnt = scsi_hostlist; shpnt; shpnt = shpnt->next)
next	1763	drivers/scsi/scsi.c	for(sdtpnt = scsi_devicelist; sdtpnt; sdtpnt = sdtpnt->next)
next	1766	drivers/scsi/scsi.c	for (SDpnt=scsi_devices; SDpnt; SDpnt = SDpnt->next) {
next	1769	drivers/scsi/scsi.c	for(sdtpnt = scsi_devicelist; sdtpnt; sdtpnt = sdtpnt->next)
next	1787	drivers/scsi/scsi.c	SCpnt->next = host->host_queue;
next	1797	drivers/scsi/scsi.c	for (SDpnt=scsi_devices; SDpnt; SDpnt = SDpnt->next) {
next	1830	drivers/scsi/scsi.c	for(sdtpnt = scsi_devicelist; sdtpnt; sdtpnt = sdtpnt->next)
next	1890	drivers/scsi/scsi.c	for(shpnt = scsi_hosts; shpnt; shpnt = shpnt->next)
next	1891	drivers/scsi/scsi.c	for(SCpnt=shpnt->host_queue; SCpnt; SCpnt = SCpnt->next)
next	1929	drivers/scsi/scsi.c	req = req->next;
next	269	drivers/scsi/scsi.h	struct scsi_device * next; /* Used for linked list */
next	423	drivers/scsi/scsi.h	struct scsi_cmnd *next, *prev;
next	380	drivers/scsi/sd.c	req = req->next;
next	384	drivers/scsi/sd.c	CURRENT = CURRENT->next;
next	386	drivers/scsi/sd.c	req1->next = req->next;
next	1056	drivers/scsi/sd.c	sd_gendisk.next = gendisk_head;
next	342	drivers/scsi/sr.c	req = req->next;
next	346	drivers/scsi/sr.c	CURRENT = CURRENT->next;
next	348	drivers/scsi/sr.c	req1->next = req->next;
next	1772	drivers/scsi/st.c	for (; SDp; SDp = SDp->next)
next	1783	drivers/scsi/st.c	SDp = SDp->next;
next	343	drivers/scsi/wd7000.c	struct scb *next;             /* for lists of scbs */
next	634	drivers/scsi/wd7000.c	for (i = 0; i < needed; i++)  { p = scbfree;  scbfree = p->next; }
next	635	drivers/scsi/wd7000.c	p->next = NULL;
next	653	drivers/scsi/wd7000.c	scb->next = scbfree;  scbfree = scb;
next	671	drivers/scsi/wd7000.c	scbs[i].next = &(scbs[i+1]);  scbs[i].SCpnt = NULL;
next	673	drivers/scsi/wd7000.c	scbs[MAX_SCBS-1].next = NULL;
next	142	fs/buffer.c	struct buffer_head * bh, *next;
next	158	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; i-- > 0 ; bh = next) {
next	160	fs/buffer.c	next = bh->b_next_free;
next	1661	fs/buffer.c	struct buffer_head * bh, *next;
next	1678	fs/buffer.c	for (i = nr_buffers_type[nlist]; i-- > 0; bh = next) {
next	1681	fs/buffer.c	next = bh->b_next_free;
next	1736	fs/buffer.c	struct buffer_head * bh, *next;
next	1779	fs/buffer.c	bh = next) {
next	1782	fs/buffer.c	next = bh->b_next_free;
next	35	fs/dcache.c	struct dir_cache_entry * next;
next	115	fs/dcache.c	if (de->h.next) {
next	116	fs/dcache.c	de->h.next->h.prev = de->h.prev;
next	117	fs/dcache.c	de->h.prev->h.next = de->h.next;
next	118	fs/dcache.c	de->h.next = NULL;
next	124	fs/dcache.c	de->h.next = hash->next;
next	126	fs/dcache.c	hash->next->h.prev = de;
next	127	fs/dcache.c	hash->next = de;
next	135	fs/dcache.c	struct dir_cache_entry * de = hash->next;
next	137	fs/dcache.c	for (de = hash->next ; de != (struct dir_cache_entry *) hash ; de = de->h.next) {
next	250	fs/dcache.c	hash_table[i].next = hash_table[i].next =
next	74	fs/exec.c	if (fmt->next)
next	79	fs/exec.c	tmp = &(*tmp)->next;
next	91	fs/exec.c	*tmp = fmt->next;
next	94	fs/exec.c	tmp = &(*tmp)->next;
next	293	fs/exec.c	for (fmt = formats ; fmt ; fmt = fmt->next) {
next	726	fs/exec.c	for (fmt = formats ; fmt ; fmt = fmt->next) {
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 = %ld\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	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	24	fs/msdos/fat.c	int first,last,next,copy;
next	51	fs/msdos/fat.c	next = CF_LE_W(((unsigned short *) data)[(first &
next	53	fs/msdos/fat.c	if (next >= 0xfff7) next = -1;
next	59	fs/msdos/fat.c	if (nr & 1) next = ((*p_first >> 4) | (*p_last << 4)) & 0xfff;
next	60	fs/msdos/fat.c	else next = (*p_first+(*p_last << 8)) & 0xfff;
next	61	fs/msdos/fat.c	if (next >= 0xff7) next = -1;
next	101	fs/msdos/fat.c	return next;
next	114	fs/msdos/fat.c	cache[count].next = count == FAT_CACHE-1 ? NULL :
next	129	fs/msdos/fat.c	for (walk = fat_cache; walk; walk = walk->next)
next	150	fs/msdos/fat.c	for (walk = fat_cache; walk; walk = walk->next) {
next	169	fs/msdos/fat.c	for (walk = fat_cache; walk->next; walk = (last = walk)->next)
next	179	fs/msdos/fat.c	last->next = walk->next;
next	180	fs/msdos/fat.c	walk->next = fat_cache;
next	191	fs/msdos/fat.c	last->next = NULL;
next	192	fs/msdos/fat.c	walk->next = fat_cache;
next	207	fs/msdos/fat.c	for (walk = fat_cache; walk; walk = walk->next)
next	217	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	49	fs/super.c	if (fs->next)
next	55	fs/super.c	tmp = &(*tmp)->next;
next	68	fs/super.c	*tmp = fs->next;
next	69	fs/super.c	fs->next = NULL;
next	72	fs/super.c	tmp = &(*tmp)->next;
next	87	fs/super.c	for (tmp = file_systems ; tmp ; tmp = tmp->next) {
next	105	fs/super.c	tmp = tmp->next;
next	124	fs/super.c	for (tmp = file_systems ; tmp ; tmp = tmp->next)
next	167	fs/super.c	tmp = tmp->next;
next	181	fs/super.c	fs = fs->next;
next	659	fs/super.c	for (fs_type = file_systems ; fs_type ; fs_type = fs_type->next) {
next	32	include/linux/binfmts.h	struct linux_binfmt * next;
next	25	include/linux/blkdev.h	struct request * next;
next	28	include/linux/ext_fs.h	unsigned long next;
next	34	include/linux/ext_fs.h	unsigned long next;
next	346	include/linux/fs.h	struct file_system_type * next;
next	46	include/linux/genhd.h	struct gendisk *next;
next	124	include/linux/mm.h	struct mem_list * next;
next	28	include/linux/module.h	struct module_ref *next;
next	48	include/linux/module.h	struct module *next;
next	95	include/linux/msdos_fs.h	struct fat_cache *next; /* next cache entry */
next	77	include/linux/net.h	struct socket    *next;
next	70	include/linux/netdevice.h	struct device      *next;
next	154	include/linux/netdevice.h	struct packet_type  *next;
next	41	include/linux/personality.h	struct exec_domain *next;
next	463	include/linux/sched.h	if (wait->next) {
next	467	include/linux/sched.h	printk("add_wait_queue (%08x): wait->next = %08x\n",pc,(unsigned long) wait->next);
next	473	include/linux/sched.h	wait->next = wait;
next	476	include/linux/sched.h	wait->next = (*p)->next;
next	477	include/linux/sched.h	(*p)->next = wait;
next	496	include/linux/sched.h	((*p = wait->next) == wait)) {
next	500	include/linux/sched.h	while (tmp->next != wait) {
next	501	include/linux/sched.h	tmp = tmp->next;
next	507	include/linux/sched.h	tmp->next = wait->next;
next	509	include/linux/sched.h	wait->next = NULL;
next	532	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	126	include/linux/skbuff.h	return (list->next != list)? list->next : NULL;
next	73	include/linux/timer.h	struct timer_list *next;
next	85	include/linux/timer.h	timer->next = NULL;
next	49	include/linux/tqueue.h	struct tq_struct *next;    /* linked list of active bh's */
next	99	include/linux/tqueue.h	bh_pointer->next = *bh_list;
next	113	include/linux/tqueue.h	bh_pointer->next = *bh_list;
next	129	include/linux/tqueue.h	bh_pointer->next = *bh_list;
next	155	include/linux/tqueue.h	save_p = p -> next;
next	146	include/linux/tty_driver.h	struct tty_driver *next;
next	13	include/linux/wait.h	struct wait_queue * next;
next	289	init/main.c	char *next;
next	298	init/main.c	next = line;
next	299	init/main.c	while ((line = next) != NULL) {
next	300	init/main.c	if ((next = strchr(line,' ')) != NULL)
next	301	init/main.c	*next++ = 0;
next	39	kernel/exec_domain.c	for (it=exec_domains; it; it=it->next)
next	55	kernel/exec_domain.c	if (it->next)
next	57	kernel/exec_domain.c	for (tmp=exec_domains; tmp; tmp=tmp->next)
next	60	kernel/exec_domain.c	it->next = exec_domains;
next	72	kernel/exec_domain.c	*tmp = it->next;
next	73	kernel/exec_domain.c	it->next = NULL;
next	76	kernel/exec_domain.c	tmp = &(*tmp)->next;
next	365	kernel/exit.c	struct vm_area_struct * next = mpnt->vm_next;
next	371	kernel/exit.c	mpnt = next;
next	147	kernel/module.c	mp->next = module_list;
next	243	kernel/module.c	ref->next = ref->module->ref;
next	313	kernel/module.c	for (mp = module_list; mp; mp = mp->next) {
next	327	kernel/module.c	for (mp = module_list; mp; mp = mp->next) {
next	377	kernel/module.c	for (mp = module_list ; mp ; mp = mp->next) {
next	393	kernel/module.c	for (step = module_list; step; step = step->next) {
next	394	kernel/module.c	for (prev = ref = step->ref; ref; ref = prev->next) {
next	397	kernel/module.c	step->ref = ref->next;
next	399	kernel/module.c	prev->next = ref->next;
next	424	kernel/module.c	mpp = &mp->next;
next	428	kernel/module.c	mpp = &mp->next;
next	430	kernel/module.c	*mpp = mp->next;
next	461	kernel/module.c	for (mp = module_list ; mp && mp->next; mp = mp->next) {
next	493	kernel/module.c	for (; ref; ref = ref->next) {
next	497	kernel/module.c	if (ref->next)
next	518	kernel/module.c	for (mp = module_list; mp; mp = mp->next) {
next	171	kernel/sched.c	struct task_struct * next;
next	231	kernel/sched.c	next = p = &init_task;
next	236	kernel/sched.c	c = p->counter, next = p;
next	243	kernel/sched.c	if (current == next)
next	246	kernel/sched.c	switch_to(next);
next	288	kernel/sched.c	if (!tmp->next) {
next	296	kernel/sched.c	tmp = tmp->next;
next	315	kernel/sched.c	if (!tmp->next) {
next	323	kernel/sched.c	tmp = tmp->next;
next	381	kernel/sched.c	if (timer->next || timer->prev) {
next	392	kernel/sched.c	p = p->next;
next	394	kernel/sched.c	timer->next = p;
next	397	kernel/sched.c	timer->prev->next = timer;
next	410	kernel/sched.c	while ((p = p->next) != &timer_head) {
next	412	kernel/sched.c	timer->next->prev = timer->prev;
next	413	kernel/sched.c	timer->prev->next = timer->next;
next	414	kernel/sched.c	timer->next = timer->prev = NULL;
next	420	kernel/sched.c	if (timer->next || timer->prev)
next	428	kernel/sched.c	if (timer->next) {
next	429	kernel/sched.c	timer->next->prev = timer->prev;
next	430	kernel/sched.c	timer->prev->next = timer->next;
next	431	kernel/sched.c	timer->next = timer->prev = NULL;
next	561	kernel/sched.c	while ((timer = timer_head.next) != &timer_head && timer->expires < jiffies) {
next	564	kernel/sched.c	timer->next->prev = timer->prev;
next	565	kernel/sched.c	timer->prev->next = timer->next;
next	566	kernel/sched.c	timer->next = timer->prev = NULL;
next	700	kernel/sched.c	if (timer_head.next->expires < jiffies)
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	657	mm/memory.c	struct vm_area_struct * next;
next	664	mm/memory.c	next = vma->vm_next;
next	665	mm/memory.c	if (!next || vma->vm_end != next->vm_start)
next	667	mm/memory.c	vma = next;
next	387	mm/mmap.c	struct vm_area_struct *prev, *next;
next	394	mm/mmap.c	prev = mpnt, mpnt = next)
next	396	mm/mmap.c	next = mpnt->vm_next;
next	494	mm/swap.c	entry->next = head->next;
next	495	mm/swap.c	entry->next->prev = entry;
next	496	mm/swap.c	head->next = entry;
next	501	mm/swap.c	entry->next->prev = entry->prev;
next	502	mm/swap.c	entry->prev->next = entry->next;
next	585	mm/swap.c	do { struct mem_list *next = queue->next; \
next	586	mm/swap.c	if (queue != next) { \
next	587	mm/swap.c	queue->next = next->next; \
next	588	mm/swap.c	next->next->prev = queue; \
next	589	mm/swap.c	mark_used((unsigned long) next, new_order); \
next	592	mm/swap.c	EXPAND(next, order, new_order); \
next	593	mm/swap.c	return (unsigned long) next; \
next	656	mm/swap.c	for (tmp = free_area_list[order].next ; tmp != free_area_list + order ; tmp = tmp->next) {
next	943	mm/swap.c	free_area_list[i].prev = free_area_list[i].next = &free_area_list[i];
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	72	net/inet/af_inet.c	sk != NULL;  sk=sk->next)
next	113	net/inet/af_inet.c	sk = sk->next;
next	148	net/inet/af_inet.c	sk->next = NULL;
next	171	net/inet/af_inet.c	for(sk2 = sk1; sk2 != NULL; sk2=sk2->next)
next	177	net/inet/af_inet.c	sk->next = sk->prot->sock_array[num];
next	182	net/inet/af_inet.c	sk->next = sk2;
next	183	net/inet/af_inet.c	sk1->next= sk;
next	191	net/inet/af_inet.c	sk->next = NULL;
next	192	net/inet/af_inet.c	sk1->next = sk;
next	215	net/inet/af_inet.c	sk1->prot->sock_array[sk1->num &(SOCK_ARRAY_SIZE -1)] = sk1->next;
next	220	net/inet/af_inet.c	while(sk2 && sk2->next != sk1)
next	222	net/inet/af_inet.c	sk2 = sk2->next;
next	227	net/inet/af_inet.c	sk2->next = sk1->next;
next	298	net/inet/af_inet.c	if (skb->next  && skb->prev) {
next	620	net/inet/af_inet.c	sk->next = NULL;
next	793	net/inet/af_inet.c	sk2 != NULL; sk2 = sk2->next)
next	1264	net/inet/af_inet.c	s != NULL; s = s->next)
next	1345	net/inet/af_inet.c	struct inet_protocol *tmp = (struct inet_protocol *) p->next;
next	71	net/inet/arp.c	struct arp_table    *next;      /* Linked entry list     */
next	205	net/inet/arp.c	*pentry = entry->next;  /* remove from list */
next	212	net/inet/arp.c	pentry = &entry->next;  /* go to next entry */
next	277	net/inet/arp.c	*pentry = entry->next;  /* remove from list */
next	284	net/inet/arp.c	pentry = &entry->next;  /* go to next entry */
next	417	net/inet/arp.c	*pentry = entry->next;  /* delete from linked list */
next	423	net/inet/arp.c	pentry = &(*pentry)->next;
next	501	net/inet/arp.c	*pentry = entry->next;
next	507	net/inet/arp.c	pentry = &entry->next;
next	661	net/inet/arp.c	proxy_entry = proxy_entry->next)
next	699	net/inet/arp.c	for(entry=arp_tables[hash];entry;entry=entry->next)
next	756	net/inet/arp.c	entry->next = arp_tables[hash];
next	797	net/inet/arp.c	for (entry = arp_tables[hash]; entry != NULL; entry = entry->next)
next	851	net/inet/arp.c	entry->next = arp_tables[hash];
next	904	net/inet/arp.c	for(entry=arp_tables[i]; entry!=NULL; entry=entry->next)
next	967	net/inet/arp.c	for (entry = arp_tables[hash]; entry != NULL; entry = entry->next)
next	1039	net/inet/arp.c	for (entry = arp_tables[hash]; entry != NULL; entry = entry->next)
next	1060	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	13	net/inet/datalink.h	struct datalink_proto  *next;
next	115	net/inet/dev.c	pt->next = ptype_base;
next	135	net/inet/dev.c	for (p1 = ptype_base; p1 != NULL; p1 = p1->next)
next	151	net/inet/dev.c	pt->next=NULL;
next	159	net/inet/dev.c	for(p1=ptype_base;p1->next!=NULL;p1=p1->next);
next	163	net/inet/dev.c	p1->next=pt;
next	195	net/inet/dev.c	ptype_base = pt->next;
next	208	net/inet/dev.c	for (pt1 = ptype_base; pt1->next != NULL; pt1 = pt1->next)
next	210	net/inet/dev.c	if (pt1->next == pt )
next	215	net/inet/dev.c	pt1->next = pt->next;
next	219	net/inet/dev.c	if (pt1->next->type == pt->type && pt->type != htons(ETH_P_ALL))
next	220	net/inet/dev.c	lpt = pt1->next;
next	238	net/inet/dev.c	for (dev = dev_base; dev != NULL; dev = dev->next)
next	371	net/inet/dev.c	if (skb->next != NULL)
next	427	net/inet/dev.c	for (nitcount = dev_nit, ptype = ptype_base; nitcount > 0 && ptype != NULL; ptype = ptype->next)
next	610	net/inet/dev.c	for (dev = dev_base; dev != NULL; dev = dev->next)
next	730	net/inet/dev.c	for (ptype = ptype_base; ptype != NULL; ptype = ptype->next)
next	900	net/inet/dev.c	for (dev = dev_base; dev != NULL; dev = dev->next)
next	991	net/inet/dev.c	for (dev = dev_base; dev != NULL; dev = dev->next)
next	1449	net/inet/dev.c	for (dev = dev_base; dev != NULL; dev=dev->next)
next	1458	net/inet/dev.c	dev_base = dev->next;
next	1460	net/inet/dev.c	dev2->next = dev->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	70	net/inet/eth.c	d=d->next;
next	268	net/inet/icmp.c	nextip = (struct inet_protocol *) ipprot->next;
next	605	net/inet/ip.c	for(qp = ipqueue; qp != NULL; qplast = qp, qp = qp->next)
next	641	net/inet/ip.c	ipqueue = qp->next;
next	647	net/inet/ip.c	qp->prev->next = qp->next;
next	648	net/inet/ip.c	if (qp->next != NULL)
next	649	net/inet/ip.c	qp->next->prev = qp->prev;
next	657	net/inet/ip.c	xp = fp->next;
next	774	net/inet/ip.c	qp->next = ipqueue;
next	775	net/inet/ip.c	if (qp->next != NULL)
next	776	net/inet/ip.c	qp->next->prev = qp;
next	804	net/inet/ip.c	fp = fp->next;
next	872	net/inet/ip.c	fp = fp->next;
next	895	net/inet/ip.c	struct ipfrag *prev, *next;
next	976	net/inet/ip.c	for(next = qp->fragments; next != NULL; next = next->next)
next	978	net/inet/ip.c	if (next->offset > offset)
next	980	net/inet/ip.c	prev = next;
next	1000	net/inet/ip.c	for(; next != NULL; next = tfp)
next	1002	net/inet/ip.c	tfp = next->next;
next	1003	net/inet/ip.c	if (next->offset >= end)
next	1006	net/inet/ip.c	i = end - next->offset;      /* overlap is 'i' bytes */
next	1007	net/inet/ip.c	next->len -= i;        /* so reduce size of  */
next	1008	net/inet/ip.c	next->offset += i;      /* next fragment  */
next	1009	net/inet/ip.c	next->ptr += i;
next	1015	net/inet/ip.c	if (next->len <= 0)
next	1017	net/inet/ip.c	if (next->prev != NULL)
next	1018	net/inet/ip.c	next->prev->next = next->next;
next	1020	net/inet/ip.c	qp->fragments = next->next;
next	1022	net/inet/ip.c	if (tfp->next != NULL)
next	1023	net/inet/ip.c	next->next->prev = next->prev;
next	1025	net/inet/ip.c	kfree_skb(next->skb,FREE_READ);
next	1026	net/inet/ip.c	kfree_s(next, sizeof(struct ipfrag));
next	1048	net/inet/ip.c	tfp->next = next;
next	1050	net/inet/ip.c	prev->next = tfp;
next	1054	net/inet/ip.c	if (next != NULL)
next	1055	net/inet/ip.c	next->prev = tfp;
next	1569	net/inet/ip.c	for (ipprot = (struct inet_protocol *)inet_protos[hash];ipprot != NULL;ipprot=(struct inet_protocol *)ipprot->next)
next	1715	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	83	net/inet/ipx.c	ipx_socket_list=s->next;
next	87	net/inet/ipx.c	while(s && s->next)
next	89	net/inet/ipx.c	if(s->next==sk)
next	91	net/inet/ipx.c	s->next=sk->next;
next	95	net/inet/ipx.c	s=s->next;
next	103	net/inet/ipx.c	sk->next=ipx_socket_list;
next	118	net/inet/ipx.c	s=s->next;
next	155	net/inet/ipx.c	for (s = ipx_socket_list; s != NULL; s = s->next)
next	246	net/inet/ipx.c	r=r->next;
next	315	net/inet/ipx.c	rt->next=ipx_router_list;
next	342	net/inet/ipx.c	rt->next=ipx_router_list;
next	363	net/inet/ipx.c	*r = tmp->next;
next	378	net/inet/ipx.c	*r = tmp->next;
next	385	net/inet/ipx.c	r = &tmp->next;
next	397	net/inet/ipx.c	*r = tmp->next;
next	402	net/inet/ipx.c	r = &tmp->next;
next	439	net/inet/ipx.c	for (rt = ipx_router_list; rt != NULL; rt = rt->next)
next	584	net/inet/ipx.c	sk->next=NULL;
next	57	net/inet/ipx.h	struct ipx_route *next;
next	16	net/inet/p8022.c	proto = proto->next)
next	92	net/inet/p8022.c	proto->next = p8022_list;
next	106	net/inet/proc.c	sp = sp->next;
next	92	net/inet/protocol.c	for (p = inet_protos[hash] ; p != NULL; p=p->next) {
next	106	net/inet/protocol.c	prot ->next = inet_protos[hash];
next	111	net/inet/protocol.c	p2 = (struct inet_protocol *) prot->next;
next	117	net/inet/protocol.c	p2 = (struct inet_protocol *) prot->next;
next	131	net/inet/protocol.c	inet_protos[hash] = (struct inet_protocol *) inet_protos[hash]->next;
next	142	net/inet/protocol.c	if (p->next != NULL && p->next == prot) {
next	148	net/inet/protocol.c	p->next = prot->next;
next	152	net/inet/protocol.c	if (p->next != NULL && p->next->protocol == prot->protocol) {
next	156	net/inet/protocol.c	p = (struct inet_protocol *) p->next;
next	43	net/inet/protocol.h	struct inet_protocol *next;
next	67	net/inet/rarp.c	struct rarp_table  *next;             /* Linked entry list           */
next	147	net/inet/rarp.c	*pentry = entry->next;
next	152	net/inet/rarp.c	pentry = &entry->next;
next	230	net/inet/rarp.c	for (entry = rarp_tables; entry != NULL; entry = entry->next)
next	309	net/inet/rarp.c	for (entry = rarp_tables; entry != NULL; entry = entry->next)
next	332	net/inet/rarp.c	entry->next = rarp_tables;
next	376	net/inet/rarp.c	for (entry = rarp_tables; entry != NULL; entry = entry->next)
next	471	net/inet/rarp.c	for(entry=rarp_tables; entry!=NULL; entry=entry->next)
next	406	net/inet/route.c	for (dev2 = dev_base ; dev2 != NULL ; dev2 = dev2->next)
next	75	net/inet/skbuff.c	if (!skb->next || !skb->prev) {
next	79	net/inet/skbuff.c	if (skb->next->magic_debug_cookie != SK_HEAD_SKB
next	80	net/inet/skbuff.c	&& skb->next->magic_debug_cookie != SK_GOOD_SKB) {
next	93	net/inet/skbuff.c	struct sk_buff *skb2 = skb->next;
next	101	net/inet/skbuff.c	skb2 = skb2->next;
next	107	net/inet/skbuff.c	if (skb->next != NULL && skb->next->magic_debug_cookie != SK_HEAD_SKB
next	108	net/inet/skbuff.c	&& skb->next->magic_debug_cookie != SK_GOOD_SKB) {
next	152	net/inet/skbuff.c	list->next = (struct sk_buff *)list;
next	173	net/inet/skbuff.c	if (newsk->next || newsk->prev)
next	177	net/inet/skbuff.c	newsk->next = list->next;
next	180	net/inet/skbuff.c	newsk->next->prev = newsk;
next	181	net/inet/skbuff.c	newsk->prev->next = newsk;
next	198	net/inet/skbuff.c	if (newsk->next || newsk->prev)
next	204	net/inet/skbuff.c	newsk->next = list;
next	207	net/inet/skbuff.c	newsk->next->prev = newsk;
next	208	net/inet/skbuff.c	newsk->prev->next = newsk;
next	229	net/inet/skbuff.c	result = list->next;
next	235	net/inet/skbuff.c	result->next->prev = list;
next	236	net/inet/skbuff.c	list->next = result->next;
next	238	net/inet/skbuff.c	result->next = NULL;
next	258	net/inet/skbuff.c	if(!old->next || !old->prev)
next	260	net/inet/skbuff.c	if(newsk->next || newsk->prev)
next	266	net/inet/skbuff.c	newsk->next = old;
next	269	net/inet/skbuff.c	newsk->prev->next = newsk;
next	285	net/inet/skbuff.c	if(!old->next || !old->prev)
next	287	net/inet/skbuff.c	if(newsk->next || newsk->prev)
next	295	net/inet/skbuff.c	newsk->next = old->next;
next	296	net/inet/skbuff.c	newsk->next->prev = newsk;
next	297	net/inet/skbuff.c	old->next = newsk;
next	317	net/inet/skbuff.c	if(skb->prev && skb->next)
next	319	net/inet/skbuff.c	skb->next->prev = skb->prev;
next	320	net/inet/skbuff.c	skb->prev->next = skb->next;
next	321	net/inet/skbuff.c	skb->next = NULL;
next	354	net/inet/skbuff.c	if (skb->next)
next	435	net/inet/skbuff.c	skb->prev = skb->next = NULL;
next	90	net/inet/sock.h	struct sock      *next;
next	376	net/inet/tcp.c	skb = skb->next;
next	668	net/inet/tcp.c	if (skb->next != NULL)
next	674	net/inet/tcp.c	if (before(sk->window_seq, sk->write_queue.next->h.seq) &&
next	1482	net/inet/tcp.c	skb = skb->next;
next	1698	net/inet/tcp.c	if (buff->next != NULL)
next	2365	net/inet/tcp.c	if (buff->next != NULL)
next	2591	net/inet/tcp.c	if (skb->next != NULL)
next	2674	net/inet/tcp.c	! before (sk->window_seq, sk->write_queue.next->h.seq))
next	2801	net/inet/tcp.c	if (oskb->next)
next	2829	net/inet/tcp.c	if (after (sk->window_seq+1, sk->write_queue.next->h.seq) &&
next	2832	net/inet/tcp.c	before(sk->write_queue.next->h.seq, sk->rcv_ack_seq + 1))
next	2838	net/inet/tcp.c	else if (before(sk->window_seq, sk->write_queue.next->h.seq) &&
next	3207	net/inet/tcp.c	for(skb2 = skb->next;
next	3209	net/inet/tcp.c	skb2 = skb2->next)
next	114	net/inet/timer.c	before(sk->window_seq, sk->write_queue.next->h.seq) &&
next	326	net/socket.c	nextsock = peersock->next;
next	509	net/socket.c	mysock->next = NULL;
next	515	net/socket.c	while (last->next)
next	516	net/socket.c	last = last->next;
next	517	net/socket.c	last->next = mysock;
next	545	net/socket.c	servsock->iconn = mysock->next;
next	548	net/socket.c	while (last->next != mysock)
next	549	net/socket.c	last = last->next;
next	550	net/socket.c	last->next = mysock->next;
next	561	net/unix/sock.c	sock->iconn = clientsock->next;
next	562	net/unix/sock.c	clientsock->next = NULL;