tag | line | file | source code |
free_list | 65 | fs/buffer.c | static struct buffer_head * free_list[NR_SIZES] = {NULL, }; |
free_list | 397 | fs/buffer.c | if(!free_list[isize]) |
free_list | 401 | fs/buffer.c | free_list[isize] = NULL; |
free_list | 405 | fs/buffer.c | if (free_list[isize] == bh) |
free_list | 406 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
free_list | 457 | fs/buffer.c | if(!free_list[isize]) { |
free_list | 458 | fs/buffer.c | free_list[isize] = bh; |
free_list | 463 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
free_list | 464 | fs/buffer.c | bh->b_prev_free = free_list[isize]->b_prev_free; |
free_list | 465 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
free_list | 466 | fs/buffer.c | free_list[isize]->b_prev_free = bh; |
free_list | 795 | fs/buffer.c | while(!free_list[isize]) refill_freelist(size); |
free_list | 800 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1263 | fs/buffer.c | insert_point = free_list[isize]; |
free_list | 1284 | fs/buffer.c | free_list[isize] = bh; |
free_list | 1420 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1422 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
free_list | 1576 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1578 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
free_list | 1709 | fs/buffer.c | if (!free_list[isize]) |