tag | line | file | source code |
free_list | 45 | fs/buffer.c | static struct buffer_head * free_list[NR_SIZES] = {NULL, }; |
free_list | 308 | fs/buffer.c | if(!free_list[isize]) |
free_list | 312 | fs/buffer.c | free_list[isize] = NULL; |
free_list | 316 | fs/buffer.c | if (free_list[isize] == bh) |
free_list | 317 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
free_list | 368 | fs/buffer.c | if(!free_list[isize]) { |
free_list | 369 | fs/buffer.c | free_list[isize] = bh; |
free_list | 374 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
free_list | 375 | fs/buffer.c | bh->b_prev_free = free_list[isize]->b_prev_free; |
free_list | 376 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
free_list | 377 | fs/buffer.c | free_list[isize]->b_prev_free = bh; |
free_list | 706 | fs/buffer.c | while(!free_list[isize]) refill_freelist(size); |
free_list | 711 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1185 | fs/buffer.c | insert_point = free_list[isize]; |
free_list | 1206 | fs/buffer.c | free_list[isize] = bh; |
free_list | 1342 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1344 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
free_list | 1498 | fs/buffer.c | bh = free_list[isize]; |
free_list | 1500 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
free_list | 1629 | fs/buffer.c | if (!free_list[isize]) |