tag | line | file | source code |
free_list | 46 | fs/buffer.c | static struct buffer_head * free_list[NR_SIZES] = {NULL, }; |
free_list | 309 | fs/buffer.c | if(!free_list[isize]) |
free_list | 313 | fs/buffer.c | free_list[isize] = NULL; |
free_list | 317 | fs/buffer.c | if (free_list[isize] == bh) |
free_list | 318 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
free_list | 369 | fs/buffer.c | if(!free_list[isize]) { |
free_list | 370 | fs/buffer.c | free_list[isize] = bh; |
free_list | 375 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
free_list | 376 | fs/buffer.c | bh->b_prev_free = free_list[isize]->b_prev_free; |
free_list | 377 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
free_list | 378 | fs/buffer.c | free_list[isize]->b_prev_free = bh; |
free_list | 707 | fs/buffer.c | while(!free_list[isize]) refill_freelist(size); |
free_list | 712 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1170 | fs/buffer.c | insert_point = free_list[isize]; |
free_list | 1191 | fs/buffer.c | free_list[isize] = bh; |
free_list | 1327 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1329 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
free_list | 1483 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1485 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
free_list | 1614 | fs/buffer.c | if (!free_list[isize]) |