tag | line | file | source code |
b_list | 175 | fs/buffer.c | if(bh->b_list != nlist) goto repeat1; |
b_list | 336 | fs/buffer.c | if (lru_list[bh->b_list] == bh) |
b_list | 337 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_list | 338 | fs/buffer.c | if (lru_list[bh->b_list] == bh) |
b_list | 339 | fs/buffer.c | lru_list[bh->b_list] = NULL; |
b_list | 340 | fs/buffer.c | if (next_to_age[bh->b_list] == bh) |
b_list | 341 | fs/buffer.c | next_to_age[bh->b_list] = bh->b_next_free; |
b_list | 342 | fs/buffer.c | if (next_to_age[bh->b_list] == bh) |
b_list | 343 | fs/buffer.c | next_to_age[bh->b_list] = NULL; |
b_list | 376 | fs/buffer.c | nr_buffers_type[bh->b_list]--; |
b_list | 377 | fs/buffer.c | nr_buffers_st[BUFSIZE_INDEX(bh->b_size)][bh->b_list]--; |
b_list | 386 | fs/buffer.c | if (bh == lru_list[bh->b_list]) { |
b_list | 387 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_list | 388 | fs/buffer.c | if (next_to_age[bh->b_list] == bh) |
b_list | 389 | fs/buffer.c | next_to_age[bh->b_list] = bh->b_next_free; |
b_list | 397 | fs/buffer.c | if(!lru_list[bh->b_list]) { |
b_list | 398 | fs/buffer.c | lru_list[bh->b_list] = bh; |
b_list | 399 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free = bh; |
b_list | 401 | fs/buffer.c | if (!next_to_age[bh->b_list]) |
b_list | 402 | fs/buffer.c | next_to_age[bh->b_list] = bh; |
b_list | 404 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_list | 405 | fs/buffer.c | bh->b_prev_free = lru_list[bh->b_list]->b_prev_free; |
b_list | 406 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_list | 407 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free = bh; |
b_list | 438 | fs/buffer.c | if(!lru_list[bh->b_list]) { |
b_list | 439 | fs/buffer.c | lru_list[bh->b_list] = bh; |
b_list | 442 | fs/buffer.c | if (!next_to_age[bh->b_list]) |
b_list | 443 | fs/buffer.c | next_to_age[bh->b_list] = bh; |
b_list | 445 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_list | 446 | fs/buffer.c | bh->b_prev_free = lru_list[bh->b_list]->b_prev_free; |
b_list | 447 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_list | 448 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free = bh; |
b_list | 449 | fs/buffer.c | nr_buffers_type[bh->b_list]++; |
b_list | 450 | fs/buffer.c | nr_buffers_st[BUFSIZE_INDEX(bh->b_size)][bh->b_list]++; |
b_list | 819 | fs/buffer.c | else if (buf->b_list == BUF_SHARED) |
b_list | 824 | fs/buffer.c | if(dispose != buf->b_list) { |
b_list | 831 | fs/buffer.c | buf->b_list = dispose; |
b_list | 1107 | fs/buffer.c | next->b_list = BUF_CLEAN; |
b_list | 1523 | fs/buffer.c | if(bh->b_list != nlist) goto repeat1; |
b_list | 1719 | fs/buffer.c | bh->b_list = BUF_CLEAN; |
b_list | 1858 | fs/buffer.c | if(bh->b_list != nlist) goto repeat; |
b_list | 1994 | fs/buffer.c | if(bh->b_list != nlist) goto repeat; |
b_list | 169 | include/linux/fs.h | unsigned int b_list; /* List that this buffer appears */ |
b_list | 535 | include/linux/fs.h | if (bh->b_list == BUF_DIRTY) |
b_list | 544 | include/linux/fs.h | if (bh->b_list != BUF_DIRTY) |
b_list | 118 | mm/page_alloc.c | if (tmp->b_list == BUF_SHARED |