tag | line | file | source code |
next | 83 | fs/ext/freelists.c | efb->next = (unsigned long) sb->u.ext_sb.s_zmap[0]; |
next | 114 | fs/ext/freelists.c | printk("ext_new_block: block empty, skipping to %d\n", efb->next); |
next | 117 | fs/ext/freelists.c | sb->u.ext_sb.s_zmap[0] = (struct buffer_head *) efb->next; |
next | 161 | fs/ext/freelists.c | block = efb->next; |
next | 169 | fs/ext/freelists.c | block = efb->next; |
next | 227 | fs/ext/freelists.c | efi->next = (unsigned long) inode->i_sb->u.ext_sb.s_imap[0]; |
next | 266 | fs/ext/freelists.c | printk("ext_free_inode: inode empty, skipping to %d\n", efi->next); |
next | 269 | fs/ext/freelists.c | if (efi->next > inode->i_sb->u.ext_sb.s_ninodes) { |
next | 270 | fs/ext/freelists.c | printk ("efi->next = %d\n", efi->next); |
next | 273 | fs/ext/freelists.c | inode->i_sb->u.ext_sb.s_imap[0] = (struct buffer_head *) efi->next; |
next | 274 | fs/ext/freelists.c | block = 2 + (((unsigned long) efi->next) - 1) / EXT_INODES_PER_BLOCK; |
next | 315 | fs/ext/freelists.c | ino = efi->next; |
next | 330 | fs/ext/freelists.c | ino = efi->next; |
next | 22 | fs/msdos/fat.c | int first,last,next,copy; |
next | 47 | fs/msdos/fat.c | next = ((unsigned short *) data)[(first & (SECTOR_SIZE-1)) |
next | 49 | fs/msdos/fat.c | if (next >= 0xfff8) next = -1; |
next | 55 | fs/msdos/fat.c | if (this & 1) next = ((*p_first >> 4) | (*p_last << 4)) & 0xfff; |
next | 56 | fs/msdos/fat.c | else next = (*p_first+(*p_last << 8)) & 0xfff; |
next | 57 | fs/msdos/fat.c | if (next >= 0xff8) next = -1; |
next | 97 | fs/msdos/fat.c | return next; |
next | 110 | fs/msdos/fat.c | cache[count].next = count == FAT_CACHE-1 ? NULL : |
next | 124 | fs/msdos/fat.c | for (walk = fat_cache; walk; walk = walk->next) |
next | 142 | fs/msdos/fat.c | for (walk = fat_cache; walk; walk = walk->next) { |
next | 160 | fs/msdos/fat.c | for (walk = fat_cache; walk->next; walk = (last = walk)->next) |
next | 167 | fs/msdos/fat.c | last->next = walk->next; |
next | 168 | fs/msdos/fat.c | walk->next = fat_cache; |
next | 179 | fs/msdos/fat.c | last->next = NULL; |
next | 180 | fs/msdos/fat.c | walk->next = fat_cache; |
next | 195 | fs/msdos/fat.c | for (walk = fat_cache; walk; walk = walk->next) |
next | 205 | fs/msdos/fat.c | for (walk = fat_cache; walk; walk = walk->next) |
next | 108 | fs/msdos/namei.c | struct inode *next; |
next | 144 | fs/msdos/namei.c | next = (struct inode *) ((*result)->i_data[D_OLD]); |
next | 146 | fs/msdos/namei.c | if (!(*result = iget(next->i_dev,next->i_ino))) |
next | 40 | include/linux/ext_fs.h | unsigned long next; |
next | 46 | include/linux/ext_fs.h | unsigned long next; |
next | 46 | include/linux/genhd.h | struct gendisk *next; |
next | 82 | include/linux/msdos_fs.h | struct fat_cache *next; /* next cache entry */ |
next | 315 | include/linux/sched.h | wait->next = *p; |
next | 317 | include/linux/sched.h | while (tmp->next) |
next | 318 | include/linux/sched.h | if ((tmp = tmp->next)->next == *p) |
next | 320 | include/linux/sched.h | *p = tmp->next = wait; |
next | 331 | include/linux/sched.h | if ((*p = wait->next) == wait) |
next | 334 | include/linux/sched.h | while (tmp && tmp->next != wait) |
next | 335 | include/linux/sched.h | tmp = tmp->next; |
next | 337 | include/linux/sched.h | tmp->next = wait->next; |
next | 338 | include/linux/sched.h | wait->next = NULL; |
next | 11 | include/linux/wait.h | struct wait_queue * next; |
next | 34 | kernel/blk_drv/blk.h | struct request * next; |
next | 212 | kernel/blk_drv/blk.h | CURRENT = req->next; |
next | 182 | kernel/blk_drv/genhd.c | for (p = gendisk_head ; p ; p=p->next) { |
next | 600 | kernel/blk_drv/hd.c | hd_gendisk.next = gendisk_head; |
next | 112 | kernel/blk_drv/ll_rw_blk.c | req->next = NULL; |
next | 122 | kernel/blk_drv/ll_rw_blk.c | for ( ; tmp->next ; tmp = tmp->next) { |
next | 124 | kernel/blk_drv/ll_rw_blk.c | if (tmp->next->bh) |
next | 129 | kernel/blk_drv/ll_rw_blk.c | !IN_ORDER(tmp,tmp->next)) && |
next | 130 | kernel/blk_drv/ll_rw_blk.c | IN_ORDER(req,tmp->next)) |
next | 133 | kernel/blk_drv/ll_rw_blk.c | req->next = tmp->next; |
next | 134 | kernel/blk_drv/ll_rw_blk.c | tmp->next = req; |
next | 173 | kernel/blk_drv/ll_rw_blk.c | while (req = req->next) { |
next | 222 | kernel/blk_drv/ll_rw_blk.c | req->next = NULL; |
next | 262 | kernel/blk_drv/ll_rw_blk.c | req->next = NULL; |
next | 299 | kernel/blk_drv/ll_rw_blk.c | request[i].next = NULL; |
next | 349 | kernel/blk_drv/ll_rw_blk.c | req->next = NULL; |
next | 42 | kernel/blk_drv/scsi/hosts.h | struct scsi_cmnd *next, *prev; |
next | 419 | kernel/blk_drv/scsi/sd.c | sd_gendisk.next = gendisk_head; |
next | 126 | kernel/fork.c | p->wait.next = NULL; |
next | 129 | kernel/sched.c | int i,next,c; |
next | 151 | kernel/sched.c | next = 0; |
next | 158 | kernel/sched.c | c = (*p)->counter, next = i; |
next | 166 | kernel/sched.c | switch_to(next); |
next | 198 | kernel/sched.c | struct wait_queue *tmp, *next; |
next | 202 | kernel/sched.c | if (!q || !(next = *q)) |
next | 206 | kernel/sched.c | tmp = next; |
next | 207 | kernel/sched.c | next = tmp->next; |
next | 217 | kernel/sched.c | tmp->next = NULL; |
next | 218 | kernel/sched.c | } while (next && next != *q); |
next | 230 | kernel/sched.c | if (current->wait.next) |
next | 316 | kernel/sched.c | struct timer_list * next; |
next | 338 | kernel/sched.c | p->next = next_timer; |
next | 340 | kernel/sched.c | while (p->next && p->next->jiffies < p->jiffies) { |
next | 341 | kernel/sched.c | p->jiffies -= p->next->jiffies; |
next | 343 | kernel/sched.c | p->fn = p->next->fn; |
next | 344 | kernel/sched.c | p->next->fn = fn; |
next | 346 | kernel/sched.c | p->jiffies = p->next->jiffies; |
next | 347 | kernel/sched.c | p->next->jiffies = jiffies; |
next | 348 | kernel/sched.c | p = p->next; |
next | 448 | kernel/sched.c | next_timer = next_timer->next; |
next | 54 | lib/malloc.c | struct bucket_desc *next; |
next | 106 | lib/malloc.c | bdesc->next = bdesc+1; |
next | 113 | lib/malloc.c | bdesc->next = free_bucket_desc; |
next | 139 | lib/malloc.c | for (bdesc = bdir->chain; bdesc; bdesc = bdesc->next) |
next | 153 | lib/malloc.c | free_bucket_desc = bdesc->next; |
next | 165 | lib/malloc.c | bdesc->next = bdir->chain; /* OK, link it in! */ |
next | 196 | lib/malloc.c | for (bdesc = bdir->chain; bdesc; bdesc = bdesc->next) { |
next | 213 | lib/malloc.c | if ((prev && (prev->next != bdesc)) || |
next | 215 | lib/malloc.c | for (prev = bdir->chain; prev; prev = prev->next) |
next | 216 | lib/malloc.c | if (prev->next == bdesc) |
next | 219 | lib/malloc.c | prev->next = bdesc->next; |
next | 223 | lib/malloc.c | bdir->chain = bdesc->next; |
next | 226 | lib/malloc.c | bdesc->next = free_bucket_desc; |
next | 35 | net/kern_sock.h | struct socket *next; |
next | 208 | net/socket.c | nextsock = peersock->next; |
next | 364 | net/socket.c | mysock->next = NULL; |
next | 369 | net/socket.c | while (last->next) |
next | 370 | net/socket.c | last = last->next; |
next | 371 | net/socket.c | last->next = mysock; |
next | 395 | net/socket.c | servsock->iconn = mysock->next; |
next | 397 | net/socket.c | while (last->next != mysock) |
next | 398 | net/socket.c | last = last->next; |
next | 399 | net/socket.c | last->next = mysock->next; |
next | 619 | net/socket.c | sock->iconn = clientsock->next; |
next | 620 | net/socket.c | clientsock->next = NULL; |