tag | line | file | source code |
b_next_free | 179 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 278 | fs/buffer.c | bh = bh->b_next_free) { |
b_next_free | 384 | fs/buffer.c | if (!(bh->b_prev_free) || !(bh->b_next_free)) |
b_next_free | 387 | fs/buffer.c | bh->b_prev_free->b_next_free = bh->b_next_free; |
b_next_free | 388 | fs/buffer.c | bh->b_next_free->b_prev_free = bh->b_prev_free; |
b_next_free | 391 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_next_free | 394 | fs/buffer.c | bh->b_next_free = bh->b_prev_free = NULL; |
b_next_free | 400 | fs/buffer.c | if (!(bh->b_prev_free) || !(bh->b_next_free)) |
b_next_free | 406 | fs/buffer.c | if(bh->b_next_free == bh) |
b_next_free | 409 | fs/buffer.c | bh->b_prev_free->b_next_free = bh->b_next_free; |
b_next_free | 410 | fs/buffer.c | bh->b_next_free->b_prev_free = bh->b_prev_free; |
b_next_free | 412 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
b_next_free | 414 | fs/buffer.c | bh->b_next_free = bh->b_prev_free = NULL; |
b_next_free | 435 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_next_free | 447 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_next_free | 449 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_next_free | 469 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
b_next_free | 471 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
b_next_free | 487 | fs/buffer.c | if (bh->b_next_free) panic("VFS: buffer LRU pointers corrupted"); |
b_next_free | 488 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_next_free | 490 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_next_free | 572 | fs/buffer.c | bhnext = bh->b_next_free; |
b_next_free | 649 | fs/buffer.c | tmp = bh->b_next_free; |
b_next_free | 696 | fs/buffer.c | candidate[i] = bh->b_next_free; |
b_next_free | 720 | fs/buffer.c | tmp = bh->b_next_free; |
b_next_free | 983 | fs/buffer.c | bh->b_next_free = unused_list; |
b_next_free | 999 | fs/buffer.c | bh->b_next_free = unused_list; /* only make link */ |
b_next_free | 1012 | fs/buffer.c | unused_list = bh->b_next_free; |
b_next_free | 1013 | fs/buffer.c | bh->b_next_free = NULL; |
b_next_free | 1275 | fs/buffer.c | tmp->b_next_free = insert_point->b_next_free; |
b_next_free | 1277 | fs/buffer.c | insert_point->b_next_free->b_prev_free = tmp; |
b_next_free | 1278 | fs/buffer.c | insert_point->b_next_free = tmp; |
b_next_free | 1281 | fs/buffer.c | tmp->b_next_free = tmp; |
b_next_free | 1428 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
b_next_free | 1446 | fs/buffer.c | for ( ; i-- > 0 ; bh = bh->b_next_free) { |
b_next_free | 1497 | fs/buffer.c | bh = bh->b_next_free; |
b_next_free | 1584 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
b_next_free | 1779 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 1880 | fs/buffer.c | next = bh->b_next_free; |
b_next_free | 150 | include/linux/fs.h | struct buffer_head * b_next_free; |