tag | line | file | source code |
b_next_free | 160 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 262 | fs/buffer.c | for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bh->b_next_free) { |
b_next_free | 292 | fs/buffer.c | if (!(bh->b_prev_free) || !(bh->b_next_free)) |
b_next_free | 295 | fs/buffer.c | bh->b_prev_free->b_next_free = bh->b_next_free; |
b_next_free | 296 | fs/buffer.c | bh->b_next_free->b_prev_free = bh->b_prev_free; |
b_next_free | 299 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_next_free | 302 | fs/buffer.c | bh->b_next_free = bh->b_prev_free = NULL; |
b_next_free | 308 | fs/buffer.c | if (!(bh->b_prev_free) || !(bh->b_next_free)) |
b_next_free | 314 | fs/buffer.c | if(bh->b_next_free == bh) |
b_next_free | 317 | fs/buffer.c | bh->b_prev_free->b_next_free = bh->b_next_free; |
b_next_free | 318 | fs/buffer.c | bh->b_next_free->b_prev_free = bh->b_prev_free; |
b_next_free | 320 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
b_next_free | 322 | fs/buffer.c | bh->b_next_free = bh->b_prev_free = NULL; |
b_next_free | 343 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_next_free | 355 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_next_free | 357 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_next_free | 377 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
b_next_free | 379 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
b_next_free | 395 | fs/buffer.c | if (bh->b_next_free) panic("VFS: buffer LRU pointers corrupted"); |
b_next_free | 396 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_next_free | 398 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_next_free | 480 | fs/buffer.c | bhnext = bh->b_next_free; |
b_next_free | 557 | fs/buffer.c | tmp = bh->b_next_free; |
b_next_free | 604 | fs/buffer.c | candidate[i] = bh->b_next_free; |
b_next_free | 628 | fs/buffer.c | tmp = bh->b_next_free; |
b_next_free | 890 | fs/buffer.c | bh->b_next_free = unused_list; |
b_next_free | 906 | fs/buffer.c | bh->b_next_free = unused_list; /* only make link */ |
b_next_free | 919 | fs/buffer.c | unused_list = bh->b_next_free; |
b_next_free | 920 | fs/buffer.c | bh->b_next_free = NULL; |
b_next_free | 1193 | fs/buffer.c | tmp->b_next_free = insert_point->b_next_free; |
b_next_free | 1195 | fs/buffer.c | insert_point->b_next_free->b_prev_free = tmp; |
b_next_free | 1196 | fs/buffer.c | insert_point->b_next_free = tmp; |
b_next_free | 1199 | fs/buffer.c | tmp->b_next_free = tmp; |
b_next_free | 1349 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
b_next_free | 1367 | fs/buffer.c | for ( ; i-- > 0 ; bh = bh->b_next_free) { |
b_next_free | 1420 | fs/buffer.c | bh = bh->b_next_free; |
b_next_free | 1510 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
b_next_free | 1709 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 1816 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 150 | include/linux/fs.h | struct buffer_head * b_next_free; |