tag | line | file | source code |
b_next_free | 160 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 259 | fs/buffer.c | bh = bh->b_next_free) { |
b_next_free | 286 | fs/buffer.c | if (!(bh->b_prev_free) || !(bh->b_next_free)) |
b_next_free | 289 | fs/buffer.c | bh->b_prev_free->b_next_free = bh->b_next_free; |
b_next_free | 290 | fs/buffer.c | bh->b_next_free->b_prev_free = bh->b_prev_free; |
b_next_free | 293 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_next_free | 296 | fs/buffer.c | bh->b_next_free = bh->b_prev_free = NULL; |
b_next_free | 302 | fs/buffer.c | if (!(bh->b_prev_free) || !(bh->b_next_free)) |
b_next_free | 308 | fs/buffer.c | if(bh->b_next_free == bh) |
b_next_free | 311 | fs/buffer.c | bh->b_prev_free->b_next_free = bh->b_next_free; |
b_next_free | 312 | fs/buffer.c | bh->b_next_free->b_prev_free = bh->b_prev_free; |
b_next_free | 314 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
b_next_free | 316 | fs/buffer.c | bh->b_next_free = bh->b_prev_free = NULL; |
b_next_free | 337 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_next_free | 349 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_next_free | 351 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_next_free | 371 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
b_next_free | 373 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
b_next_free | 389 | fs/buffer.c | if (bh->b_next_free) panic("VFS: buffer LRU pointers corrupted"); |
b_next_free | 390 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_next_free | 392 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_next_free | 474 | fs/buffer.c | bhnext = bh->b_next_free; |
b_next_free | 551 | fs/buffer.c | tmp = bh->b_next_free; |
b_next_free | 598 | fs/buffer.c | candidate[i] = bh->b_next_free; |
b_next_free | 622 | fs/buffer.c | tmp = bh->b_next_free; |
b_next_free | 885 | fs/buffer.c | bh->b_next_free = unused_list; |
b_next_free | 901 | fs/buffer.c | bh->b_next_free = unused_list; /* only make link */ |
b_next_free | 914 | fs/buffer.c | unused_list = bh->b_next_free; |
b_next_free | 915 | fs/buffer.c | bh->b_next_free = NULL; |
b_next_free | 1177 | fs/buffer.c | tmp->b_next_free = insert_point->b_next_free; |
b_next_free | 1179 | fs/buffer.c | insert_point->b_next_free->b_prev_free = tmp; |
b_next_free | 1180 | fs/buffer.c | insert_point->b_next_free = tmp; |
b_next_free | 1183 | fs/buffer.c | tmp->b_next_free = tmp; |
b_next_free | 1330 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
b_next_free | 1348 | fs/buffer.c | for ( ; i-- > 0 ; bh = bh->b_next_free) { |
b_next_free | 1399 | fs/buffer.c | bh = bh->b_next_free; |
b_next_free | 1486 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
b_next_free | 1681 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 1782 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 150 | include/linux/fs.h | struct buffer_head * b_next_free; |