tag | line | file | source code |
b_list | 164 | fs/buffer.c | if(bh->b_list != nlist) goto repeat1; |
b_list | 305 | fs/buffer.c | if (lru_list[bh->b_list] == bh) |
b_list | 306 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_list | 307 | fs/buffer.c | if (lru_list[bh->b_list] == bh) |
b_list | 308 | fs/buffer.c | lru_list[bh->b_list] = NULL; |
b_list | 309 | fs/buffer.c | if (next_to_age[bh->b_list] == bh) |
b_list | 310 | fs/buffer.c | next_to_age[bh->b_list] = bh->b_next_free; |
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] = NULL; |
b_list | 345 | fs/buffer.c | nr_buffers_type[bh->b_list]--; |
b_list | 346 | fs/buffer.c | nr_buffers_st[BUFSIZE_INDEX(bh->b_size)][bh->b_list]--; |
b_list | 355 | fs/buffer.c | if (bh == lru_list[bh->b_list]) { |
b_list | 356 | fs/buffer.c | lru_list[bh->b_list] = bh->b_next_free; |
b_list | 357 | fs/buffer.c | if (next_to_age[bh->b_list] == bh) |
b_list | 358 | fs/buffer.c | next_to_age[bh->b_list] = bh->b_next_free; |
b_list | 366 | fs/buffer.c | if(!lru_list[bh->b_list]) { |
b_list | 367 | fs/buffer.c | lru_list[bh->b_list] = bh; |
b_list | 368 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free = bh; |
b_list | 370 | fs/buffer.c | if (!next_to_age[bh->b_list]) |
b_list | 371 | fs/buffer.c | next_to_age[bh->b_list] = bh; |
b_list | 373 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_list | 374 | fs/buffer.c | bh->b_prev_free = lru_list[bh->b_list]->b_prev_free; |
b_list | 375 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_list | 376 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free = bh; |
b_list | 407 | fs/buffer.c | if(!lru_list[bh->b_list]) { |
b_list | 408 | fs/buffer.c | lru_list[bh->b_list] = bh; |
b_list | 411 | fs/buffer.c | if (!next_to_age[bh->b_list]) |
b_list | 412 | fs/buffer.c | next_to_age[bh->b_list] = bh; |
b_list | 414 | fs/buffer.c | bh->b_next_free = lru_list[bh->b_list]; |
b_list | 415 | fs/buffer.c | bh->b_prev_free = lru_list[bh->b_list]->b_prev_free; |
b_list | 416 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free->b_next_free = bh; |
b_list | 417 | fs/buffer.c | lru_list[bh->b_list]->b_prev_free = bh; |
b_list | 418 | fs/buffer.c | nr_buffers_type[bh->b_list]++; |
b_list | 419 | fs/buffer.c | nr_buffers_st[BUFSIZE_INDEX(bh->b_size)][bh->b_list]++; |
b_list | 786 | fs/buffer.c | else if (buf->b_list == BUF_SHARED) |
b_list | 791 | fs/buffer.c | if(dispose != buf->b_list) { |
b_list | 798 | fs/buffer.c | buf->b_list = dispose; |
b_list | 1130 | fs/buffer.c | bh->b_list = BUF_CLEAN; |
b_list | 1503 | fs/buffer.c | if(bh->b_list != nlist) goto repeat1; |
b_list | 1694 | fs/buffer.c | bh->b_list = BUF_CLEAN; |
b_list | 1849 | fs/buffer.c | if(bh->b_list != nlist) goto repeat; |
b_list | 1956 | fs/buffer.c | if(bh->b_list != nlist) goto repeat; |
b_list | 129 | include/linux/fs.h | unsigned char b_list; /* List that this buffer appears */ |
b_list | 452 | include/linux/fs.h | if(bh->b_list == BUF_DIRTY) refile_buffer(bh); |
b_list | 461 | include/linux/fs.h | if(bh->b_list != BUF_DIRTY) refile_buffer(bh); |
b_list | 763 | mm/swap.c | if (tmp->b_list == BUF_SHARED |