| tag | line | file | source code |
|---|
| candidate | 557 | fs/buffer.c | struct buffer_head * candidate[NR_LIST]; |
| candidate | 605 | fs/buffer.c | candidate[i] = NULL; |
| candidate | 637 | fs/buffer.c | if(!buffers[i]) candidate[i] = NULL; /* Nothing on this list */ |
| candidate | 638 | fs/buffer.c | else candidate[i] = bh; |
| candidate | 639 | fs/buffer.c | if(candidate[i] && candidate[i]->b_count) panic("Here is the problem"); |
| candidate | 649 | fs/buffer.c | if(!candidate[i]) continue; |
| candidate | 650 | fs/buffer.c | if(candidate[i]->b_lru_time < best_time){ |
| candidate | 651 | fs/buffer.c | best_time = candidate[i]->b_lru_time; |
| candidate | 659 | fs/buffer.c | bh = candidate[i]; |
| candidate | 660 | fs/buffer.c | candidate[i] = bh->b_next_free; |
| candidate | 661 | fs/buffer.c | if(candidate[i] == bh) candidate[i] = NULL; /* Got last one */ |
| candidate | 679 | fs/buffer.c | if(buffers[i] == 0) candidate[i] = NULL; |
| candidate | 683 | fs/buffer.c | if(candidate[i] && buffers[i] > 0){ |
| candidate | 685 | fs/buffer.c | for (bh = candidate[i]; buffers[i] > 0; bh = tmp, buffers[i]--) { |
| candidate | 711 | fs/buffer.c | if(!buffers[i]) candidate[i] = NULL; /* Nothing here */ |
| candidate | 712 | fs/buffer.c | else candidate[i] = bh; |
| candidate | 713 | fs/buffer.c | if(candidate[i] && candidate[i]->b_count) |