tag | line | file | source code |
free_list | 57 | fs/buffer.c | static struct buffer_head * free_list[NR_SIZES] = {NULL, }; |
free_list | 356 | fs/buffer.c | if(!free_list[isize]) |
free_list | 360 | fs/buffer.c | free_list[isize] = NULL; |
free_list | 364 | fs/buffer.c | if (free_list[isize] == bh) |
free_list | 365 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
free_list | 420 | fs/buffer.c | if(!free_list[isize]) { |
free_list | 421 | fs/buffer.c | free_list[isize] = bh; |
free_list | 426 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
free_list | 427 | fs/buffer.c | bh->b_prev_free = free_list[isize]->b_prev_free; |
free_list | 428 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
free_list | 429 | fs/buffer.c | free_list[isize]->b_prev_free = bh; |
free_list | 771 | fs/buffer.c | while(!free_list[isize]) refill_freelist(size); |
free_list | 776 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1309 | fs/buffer.c | insert_point = free_list[isize]; |
free_list | 1330 | fs/buffer.c | free_list[isize] = bh; |
free_list | 1493 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1495 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
free_list | 1678 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1680 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
free_list | 1805 | fs/buffer.c | if (!free_list[isize]) |
free_list | 25 | fs/nfs/nfsiod.c | static struct nfsiod_req * free_list = NULL; |
free_list | 44 | fs/nfs/nfsiod.c | if (!(req = free_list)) { |
free_list | 48 | fs/nfs/nfsiod.c | free_list = req->rq_next; |
free_list | 53 | fs/nfs/nfsiod.c | req->rq_next = free_list; |
free_list | 54 | fs/nfs/nfsiod.c | free_list = req; |
free_list | 70 | fs/nfs/nfsiod.c | req->rq_next = free_list; |
free_list | 71 | fs/nfs/nfsiod.c | free_list = req; |
free_list | 107 | fs/nfs/nfsiod.c | req->rq_next = free_list; |
free_list | 108 | fs/nfs/nfsiod.c | free_list = req; |