| tag | line | file | source code |
|---|
| candidate | 502 | fs/buffer.c | struct buffer_head * candidate[NR_LIST]; |
| candidate | 550 | fs/buffer.c | candidate[i] = NULL; |
| candidate | 582 | fs/buffer.c | if(!buffers[i]) candidate[i] = NULL; /* Nothing on this list */ |
| candidate | 583 | fs/buffer.c | else candidate[i] = bh; |
| candidate | 584 | fs/buffer.c | if(candidate[i] && candidate[i]->b_count) panic("Here is the problem"); |
| candidate | 594 | fs/buffer.c | if(!candidate[i]) continue; |
| candidate | 595 | fs/buffer.c | if(candidate[i]->b_lru_time < best_time){ |
| candidate | 596 | fs/buffer.c | best_time = candidate[i]->b_lru_time; |
| candidate | 604 | fs/buffer.c | bh = candidate[i]; |
| candidate | 605 | fs/buffer.c | candidate[i] = bh->b_next_free; |
| candidate | 606 | fs/buffer.c | if(candidate[i] == bh) candidate[i] = NULL; /* Got last one */ |
| candidate | 621 | fs/buffer.c | if(buffers[i] == 0) candidate[i] = NULL; |
| candidate | 625 | fs/buffer.c | if(candidate[i] && buffers[i] > 0){ |
| candidate | 627 | fs/buffer.c | for (bh = candidate[i]; buffers[i] > 0; bh = tmp, buffers[i]--) { |
| candidate | 653 | fs/buffer.c | if(!buffers[i]) candidate[i] = NULL; /* Nothing here */ |
| candidate | 654 | fs/buffer.c | else candidate[i] = bh; |
| candidate | 655 | fs/buffer.c | if(candidate[i] && candidate[i]->b_count) |