tag | line | file | source code |
b_next_free | 165 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 268 | fs/buffer.c | for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bh->b_next_free) { |
b_next_free | 298 | fs/buffer.c | if (!(bh->b_prev_free) || !(bh->b_next_free)) |
b_next_free | 302 | fs/buffer.c | bh->b_prev_free->b_next_free = bh->b_next_free; |
b_next_free | 303 | fs/buffer.c | bh->b_next_free->b_prev_free = bh->b_prev_free; |
b_next_free | 306 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_next_free | 310 | fs/buffer.c | next_to_age[bh->b_list] = bh->b_next_free; |
b_next_free | 314 | fs/buffer.c | bh->b_next_free = bh->b_prev_free = NULL; |
b_next_free | 320 | fs/buffer.c | if (!(bh->b_prev_free) || !(bh->b_next_free)) |
b_next_free | 327 | fs/buffer.c | if(bh->b_next_free == bh) |
b_next_free | 330 | fs/buffer.c | bh->b_prev_free->b_next_free = bh->b_next_free; |
b_next_free | 331 | fs/buffer.c | bh->b_next_free->b_prev_free = bh->b_prev_free; |
b_next_free | 333 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
b_next_free | 335 | fs/buffer.c | bh->b_next_free = bh->b_prev_free = NULL; |
b_next_free | 356 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_next_free | 358 | fs/buffer.c | next_to_age[bh->b_list] = bh->b_next_free; |
b_next_free | 373 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_next_free | 375 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_next_free | 394 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
b_next_free | 396 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
b_next_free | 413 | fs/buffer.c | if (bh->b_next_free) panic("VFS: buffer LRU pointers corrupted"); |
b_next_free | 414 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_next_free | 416 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_next_free | 500 | fs/buffer.c | bhnext = bh->b_next_free; |
b_next_free | 577 | fs/buffer.c | tmp = bh->b_next_free; |
b_next_free | 624 | fs/buffer.c | candidate[i] = bh->b_next_free; |
b_next_free | 649 | fs/buffer.c | tmp = bh->b_next_free; |
b_next_free | 927 | fs/buffer.c | bh->b_next_free = unused_list; |
b_next_free | 943 | fs/buffer.c | bh->b_next_free = unused_list; /* only make link */ |
b_next_free | 956 | fs/buffer.c | unused_list = bh->b_next_free; |
b_next_free | 957 | fs/buffer.c | bh->b_next_free = NULL; |
b_next_free | 1259 | fs/buffer.c | tmp->b_next_free = insert_point->b_next_free; |
b_next_free | 1261 | fs/buffer.c | insert_point->b_next_free->b_prev_free = tmp; |
b_next_free | 1262 | fs/buffer.c | insert_point->b_next_free = tmp; |
b_next_free | 1265 | fs/buffer.c | tmp->b_next_free = tmp; |
b_next_free | 1455 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
b_next_free | 1478 | fs/buffer.c | next_to_age[nlist] = bh->b_next_free; |
b_next_free | 1541 | fs/buffer.c | bh = bh->b_next_free; |
b_next_free | 1631 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
b_next_free | 1831 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 1938 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 147 | include/linux/fs.h | struct buffer_head * b_next_free; |