tag | line | file | source code |
free_list | 53 | fs/buffer.c | static struct buffer_head * free_list[NR_SIZES] = {NULL, }; |
free_list | 330 | fs/buffer.c | if(!free_list[isize]) |
free_list | 334 | fs/buffer.c | free_list[isize] = NULL; |
free_list | 338 | fs/buffer.c | if (free_list[isize] == bh) |
free_list | 339 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
free_list | 394 | fs/buffer.c | if(!free_list[isize]) { |
free_list | 395 | fs/buffer.c | free_list[isize] = bh; |
free_list | 400 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
free_list | 401 | fs/buffer.c | bh->b_prev_free = free_list[isize]->b_prev_free; |
free_list | 402 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
free_list | 403 | fs/buffer.c | free_list[isize]->b_prev_free = bh; |
free_list | 742 | fs/buffer.c | while(!free_list[isize]) refill_freelist(size); |
free_list | 747 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1204 | fs/buffer.c | insert_point = free_list[isize]; |
free_list | 1225 | fs/buffer.c | free_list[isize] = bh; |
free_list | 1402 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1404 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
free_list | 1585 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1587 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
free_list | 1717 | fs/buffer.c | if (!free_list[isize]) |