tag | line | file | source code |
b_next_free | 176 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 275 | fs/buffer.c | bh = bh->b_next_free) { |
b_next_free | 375 | fs/buffer.c | if (!(bh->b_prev_free) || !(bh->b_next_free)) |
b_next_free | 378 | fs/buffer.c | bh->b_prev_free->b_next_free = bh->b_next_free; |
b_next_free | 379 | fs/buffer.c | bh->b_next_free->b_prev_free = bh->b_prev_free; |
b_next_free | 382 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_next_free | 385 | fs/buffer.c | bh->b_next_free = bh->b_prev_free = NULL; |
b_next_free | 391 | fs/buffer.c | if (!(bh->b_prev_free) || !(bh->b_next_free)) |
b_next_free | 397 | fs/buffer.c | if(bh->b_next_free == bh) |
b_next_free | 400 | fs/buffer.c | bh->b_prev_free->b_next_free = bh->b_next_free; |
b_next_free | 401 | fs/buffer.c | bh->b_next_free->b_prev_free = bh->b_prev_free; |
b_next_free | 403 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
b_next_free | 405 | fs/buffer.c | bh->b_next_free = bh->b_prev_free = NULL; |
b_next_free | 426 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_next_free | 438 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_next_free | 440 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_next_free | 460 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
b_next_free | 462 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
b_next_free | 478 | fs/buffer.c | if (bh->b_next_free) panic("VFS: buffer LRU pointers corrupted"); |
b_next_free | 479 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_next_free | 481 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_next_free | 563 | fs/buffer.c | bhnext = bh->b_next_free; |
b_next_free | 640 | fs/buffer.c | tmp = bh->b_next_free; |
b_next_free | 687 | fs/buffer.c | candidate[i] = bh->b_next_free; |
b_next_free | 711 | fs/buffer.c | tmp = bh->b_next_free; |
b_next_free | 974 | fs/buffer.c | bh->b_next_free = unused_list; |
b_next_free | 990 | fs/buffer.c | bh->b_next_free = unused_list; /* only make link */ |
b_next_free | 1003 | fs/buffer.c | unused_list = bh->b_next_free; |
b_next_free | 1004 | fs/buffer.c | bh->b_next_free = NULL; |
b_next_free | 1266 | fs/buffer.c | tmp->b_next_free = insert_point->b_next_free; |
b_next_free | 1268 | fs/buffer.c | insert_point->b_next_free->b_prev_free = tmp; |
b_next_free | 1269 | fs/buffer.c | insert_point->b_next_free = tmp; |
b_next_free | 1272 | fs/buffer.c | tmp->b_next_free = tmp; |
b_next_free | 1419 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
b_next_free | 1437 | fs/buffer.c | for ( ; i-- > 0 ; bh = bh->b_next_free) { |
b_next_free | 1488 | fs/buffer.c | bh = bh->b_next_free; |
b_next_free | 1575 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
b_next_free | 1770 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 1871 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 149 | include/linux/fs.h | struct buffer_head * b_next_free; |