tag | line | file | source code |
nlist | 24 | arch/i386/boot/compressed/piggyback.c | struct nlist var_names[2] = /* Symbol table */ |
nlist | 157 | fs/buffer.c | int nlist, ncount; |
nlist | 170 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) |
nlist | 173 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 175 | fs/buffer.c | for (i = nr_buffers_type[nlist]*2 ; i-- > 0 ; bh = next) { |
nlist | 176 | fs/buffer.c | if(bh->b_list != nlist) goto repeat1; |
nlist | 178 | fs/buffer.c | if(!lru_list[nlist]) break; |
nlist | 210 | fs/buffer.c | if(nlist != BUF_DIRTY) { |
nlist | 211 | fs/buffer.c | printk("[%d %s %ld] ", nlist, |
nlist | 292 | fs/buffer.c | int nlist; |
nlist | 295 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) { |
nlist | 296 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 297 | fs/buffer.c | for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bh->b_next_free) { |
nlist | 504 | fs/buffer.c | int i, nlist; |
nlist | 530 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) { |
nlist | 531 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 532 | fs/buffer.c | for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bhnext) { |
nlist | 1421 | fs/buffer.c | int nlist; |
nlist | 1431 | fs/buffer.c | for(nlist = 0; nlist < NR_SIZES; nlist++) |
nlist | 1433 | fs/buffer.c | total_lav += buffers_lav[nlist]; |
nlist | 1434 | fs/buffer.c | if(nr_buffers_size[nlist]) n_sizes++; |
nlist | 1435 | fs/buffer.c | total_n_buffers += nr_buffers_size[nlist]; |
nlist | 1436 | fs/buffer.c | total_n_buffers -= nr_buffers_st[nlist][BUF_SHARED]; |
nlist | 1445 | fs/buffer.c | for(nlist = 0; nlist < NR_SIZES; nlist++) |
nlist | 1447 | fs/buffer.c | if(nlist == isize) continue; |
nlist | 1448 | fs/buffer.c | if(nr_buffers_size[nlist] && |
nlist | 1449 | fs/buffer.c | bdf_prm.b_un.lav_const * buffers_lav[nlist]*total_n_buffers < |
nlist | 1450 | fs/buffer.c | total_lav * (nr_buffers_size[nlist] - nr_buffers_st[nlist][BUF_SHARED])) |
nlist | 1451 | fs/buffer.c | if(shrink_specific_buffers(6, bufferindex_size[nlist])) |
nlist | 1472 | fs/buffer.c | int nlist; |
nlist | 1501 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) { |
nlist | 1503 | fs/buffer.c | if(priority > 2 && nlist == BUF_SHARED) continue; |
nlist | 1504 | fs/buffer.c | i = nr_buffers_type[nlist]; |
nlist | 1507 | fs/buffer.c | bh = next_to_age[nlist]; |
nlist | 1510 | fs/buffer.c | next_to_age[nlist] = bh->b_next_free; |
nlist | 1516 | fs/buffer.c | if(bh->b_list != nlist) goto repeat1; |
nlist | 1556 | fs/buffer.c | int nlist, isize; |
nlist | 1562 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) { |
nlist | 1564 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 1578 | fs/buffer.c | } while (bh != lru_list[nlist]); |
nlist | 1581 | fs/buffer.c | nlist, found, used, lastused, locked, protected, dirty, shared); |
nlist | 1587 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) |
nlist | 1588 | fs/buffer.c | printk("%7d ", nr_buffers_st[isize][nlist]); |
nlist | 1833 | fs/buffer.c | int nlist; |
nlist | 1842 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) |
nlist | 1844 | fs/buffer.c | for(nlist = BUF_DIRTY; nlist <= BUF_DIRTY; nlist++) |
nlist | 1850 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 1852 | fs/buffer.c | for (i = nr_buffers_type[nlist]; i-- > 0; bh = next) { |
nlist | 1854 | fs/buffer.c | if(bh->b_list != nlist) goto repeat; |
nlist | 1856 | fs/buffer.c | if(!lru_list[nlist]) { |
nlist | 1862 | fs/buffer.c | if (nlist == BUF_DIRTY && !buffer_dirty(bh) && !buffer_locked(bh)) |
nlist | 1876 | fs/buffer.c | if(nlist != BUF_DIRTY) ncount++; |
nlist | 1946 | fs/buffer.c | int nlist; |
nlist | 1978 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) |
nlist | 1980 | fs/buffer.c | for(nlist = BUF_DIRTY; nlist <= BUF_DIRTY; nlist++) |
nlist | 1985 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 1987 | fs/buffer.c | for (i = nr_buffers_type[nlist]; i-- > 0 && ndirty < bdf_prm.b_un.ndirty; |
nlist | 1990 | fs/buffer.c | if(bh->b_list != nlist) goto repeat; |
nlist | 1992 | fs/buffer.c | if(!lru_list[nlist]) { |
nlist | 1998 | fs/buffer.c | if (nlist == BUF_DIRTY && !buffer_dirty(bh) && !buffer_locked(bh)) |
nlist | 2013 | fs/buffer.c | if(nlist != BUF_DIRTY) ncount++; |
nlist | 158 | include/linux/a.out.h | struct nlist *n_next; |