tag | line | file | source code |
b_list | 164 | fs/buffer.c | if(bh->b_list != nlist) goto repeat1; |
b_list | 307 | fs/buffer.c | if (lru_list[bh->b_list] == bh) |
b_list | 308 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_list | 309 | fs/buffer.c | if (lru_list[bh->b_list] == bh) |
b_list | 310 | fs/buffer.c | lru_list[bh->b_list] = NULL; |
b_list | 311 | fs/buffer.c | if (next_to_age[bh->b_list] == bh) |
b_list | 312 | fs/buffer.c | next_to_age[bh->b_list] = bh->b_next_free; |
b_list | 313 | fs/buffer.c | if (next_to_age[bh->b_list] == bh) |
b_list | 314 | fs/buffer.c | next_to_age[bh->b_list] = NULL; |
b_list | 347 | fs/buffer.c | nr_buffers_type[bh->b_list]--; |
b_list | 348 | fs/buffer.c | nr_buffers_st[BUFSIZE_INDEX(bh->b_size)][bh->b_list]--; |
b_list | 357 | fs/buffer.c | if (bh == lru_list[bh->b_list]) { |
b_list | 358 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_list | 359 | fs/buffer.c | if (next_to_age[bh->b_list] == bh) |
b_list | 360 | fs/buffer.c | next_to_age[bh->b_list] = bh->b_next_free; |
b_list | 368 | fs/buffer.c | if(!lru_list[bh->b_list]) { |
b_list | 369 | fs/buffer.c | lru_list[bh->b_list] = bh; |
b_list | 370 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free = bh; |
b_list | 372 | fs/buffer.c | if (!next_to_age[bh->b_list]) |
b_list | 373 | fs/buffer.c | next_to_age[bh->b_list] = bh; |
b_list | 375 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_list | 376 | fs/buffer.c | bh->b_prev_free = lru_list[bh->b_list]->b_prev_free; |
b_list | 377 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_list | 378 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free = bh; |
b_list | 409 | fs/buffer.c | if(!lru_list[bh->b_list]) { |
b_list | 410 | fs/buffer.c | lru_list[bh->b_list] = bh; |
b_list | 413 | fs/buffer.c | if (!next_to_age[bh->b_list]) |
b_list | 414 | fs/buffer.c | next_to_age[bh->b_list] = bh; |
b_list | 416 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_list | 417 | fs/buffer.c | bh->b_prev_free = lru_list[bh->b_list]->b_prev_free; |
b_list | 418 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_list | 419 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free = bh; |
b_list | 420 | fs/buffer.c | nr_buffers_type[bh->b_list]++; |
b_list | 421 | fs/buffer.c | nr_buffers_st[BUFSIZE_INDEX(bh->b_size)][bh->b_list]++; |
b_list | 785 | fs/buffer.c | else if (buf->b_list == BUF_SHARED) |
b_list | 790 | fs/buffer.c | if(dispose != buf->b_list) { |
b_list | 797 | fs/buffer.c | buf->b_list = dispose; |
b_list | 1124 | fs/buffer.c | bh->b_list = BUF_CLEAN; |
b_list | 1494 | fs/buffer.c | if(bh->b_list != nlist) goto repeat1; |
b_list | 1682 | fs/buffer.c | bh->b_list = BUF_CLEAN; |
b_list | 1837 | fs/buffer.c | if(bh->b_list != nlist) goto repeat; |
b_list | 1944 | fs/buffer.c | if(bh->b_list != nlist) goto repeat; |
b_list | 135 | include/linux/fs.h | unsigned int b_list; /* List that this buffer appears */ |
b_list | 486 | include/linux/fs.h | if (bh->b_list == BUF_DIRTY) |
b_list | 495 | include/linux/fs.h | if (bh->b_list != BUF_DIRTY) |
b_list | 758 | mm/swap.c | if (tmp->b_list == BUF_SHARED |