| tag | line | file | source code |
|---|
| b_list | 172 | fs/buffer.c | if(bh->b_list != nlist) goto repeat1; |
| b_list | 333 | fs/buffer.c | if (lru_list[bh->b_list] == bh) |
| b_list | 334 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
| b_list | 335 | fs/buffer.c | if (lru_list[bh->b_list] == bh) |
| b_list | 336 | fs/buffer.c | lru_list[bh->b_list] = NULL; |
| b_list | 337 | fs/buffer.c | if (next_to_age[bh->b_list] == bh) |
| b_list | 338 | fs/buffer.c | next_to_age[bh->b_list] = bh->b_next_free; |
| b_list | 339 | fs/buffer.c | if (next_to_age[bh->b_list] == bh) |
| b_list | 340 | fs/buffer.c | next_to_age[bh->b_list] = NULL; |
| b_list | 373 | fs/buffer.c | nr_buffers_type[bh->b_list]--; |
| b_list | 374 | fs/buffer.c | nr_buffers_st[BUFSIZE_INDEX(bh->b_size)][bh->b_list]--; |
| b_list | 383 | fs/buffer.c | if (bh == lru_list[bh->b_list]) { |
| b_list | 384 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
| b_list | 385 | fs/buffer.c | if (next_to_age[bh->b_list] == bh) |
| b_list | 386 | fs/buffer.c | next_to_age[bh->b_list] = bh->b_next_free; |
| b_list | 394 | fs/buffer.c | if(!lru_list[bh->b_list]) { |
| b_list | 395 | fs/buffer.c | lru_list[bh->b_list] = bh; |
| b_list | 396 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free = bh; |
| b_list | 398 | fs/buffer.c | if (!next_to_age[bh->b_list]) |
| b_list | 399 | fs/buffer.c | next_to_age[bh->b_list] = bh; |
| b_list | 401 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
| b_list | 402 | fs/buffer.c | bh->b_prev_free = lru_list[bh->b_list]->b_prev_free; |
| b_list | 403 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
| b_list | 404 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free = bh; |
| b_list | 435 | fs/buffer.c | if(!lru_list[bh->b_list]) { |
| b_list | 436 | fs/buffer.c | lru_list[bh->b_list] = bh; |
| b_list | 439 | fs/buffer.c | if (!next_to_age[bh->b_list]) |
| b_list | 440 | fs/buffer.c | next_to_age[bh->b_list] = bh; |
| b_list | 442 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
| b_list | 443 | fs/buffer.c | bh->b_prev_free = lru_list[bh->b_list]->b_prev_free; |
| b_list | 444 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
| b_list | 445 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free = bh; |
| b_list | 446 | fs/buffer.c | nr_buffers_type[bh->b_list]++; |
| b_list | 447 | fs/buffer.c | nr_buffers_st[BUFSIZE_INDEX(bh->b_size)][bh->b_list]++; |
| b_list | 816 | fs/buffer.c | else if (buf->b_list == BUF_SHARED) |
| b_list | 821 | fs/buffer.c | if(dispose != buf->b_list) { |
| b_list | 828 | fs/buffer.c | buf->b_list = dispose; |
| b_list | 1086 | fs/buffer.c | next->b_list = BUF_CLEAN; |
| b_list | 1503 | fs/buffer.c | if(bh->b_list != nlist) goto repeat1; |
| b_list | 1697 | fs/buffer.c | bh->b_list = BUF_CLEAN; |
| b_list | 1841 | fs/buffer.c | if(bh->b_list != nlist) goto repeat; |
| b_list | 1977 | fs/buffer.c | if(bh->b_list != nlist) goto repeat; |
| b_list | 168 | include/linux/fs.h | unsigned int b_list; /* List that this buffer appears */ |
| b_list | 533 | include/linux/fs.h | if (bh->b_list == BUF_DIRTY) |
| b_list | 542 | include/linux/fs.h | if (bh->b_list != BUF_DIRTY) |
| b_list | 85 | mm/page_alloc.c | if (tmp->b_list == BUF_SHARED |