| tag | line | file | source code |
|---|
| candidate | 498 | fs/buffer.c | struct buffer_head * candidate[NR_LIST]; |
| candidate | 546 | fs/buffer.c | candidate[i] = NULL; |
| candidate | 578 | fs/buffer.c | if(!buffers[i]) candidate[i] = NULL; /* Nothing on this list */ |
| candidate | 579 | fs/buffer.c | else candidate[i] = bh; |
| candidate | 580 | fs/buffer.c | if(candidate[i] && candidate[i]->b_count) panic("Here is the problem"); |
| candidate | 590 | fs/buffer.c | if(!candidate[i]) continue; |
| candidate | 591 | fs/buffer.c | if(candidate[i]->b_lru_time < best_time){ |
| candidate | 592 | fs/buffer.c | best_time = candidate[i]->b_lru_time; |
| candidate | 600 | fs/buffer.c | bh = candidate[i]; |
| candidate | 601 | fs/buffer.c | candidate[i] = bh->b_next_free; |
| candidate | 602 | fs/buffer.c | if(candidate[i] == bh) candidate[i] = NULL; /* Got last one */ |
| candidate | 617 | fs/buffer.c | if(buffers[i] == 0) candidate[i] = NULL; |
| candidate | 621 | fs/buffer.c | if(candidate[i] && buffers[i] > 0){ |
| candidate | 623 | fs/buffer.c | for (bh = candidate[i]; buffers[i] > 0; bh = tmp, buffers[i]--) { |
| candidate | 649 | fs/buffer.c | if(!buffers[i]) candidate[i] = NULL; /* Nothing here */ |
| candidate | 650 | fs/buffer.c | else candidate[i] = bh; |
| candidate | 651 | fs/buffer.c | if(candidate[i] && candidate[i]->b_count) |