tag | line | file | source code |
nlist | 24 | arch/i386/boot/compressed/piggyback.c | struct nlist var_names[2] = /* Symbol table */ |
nlist | 140 | fs/buffer.c | int nlist, ncount; |
nlist | 153 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) |
nlist | 156 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 158 | fs/buffer.c | for (i = nr_buffers_type[nlist]*2 ; i-- > 0 ; bh = next) { |
nlist | 159 | fs/buffer.c | if(bh->b_list != nlist) goto repeat1; |
nlist | 161 | fs/buffer.c | if(!lru_list[nlist]) break; |
nlist | 180 | fs/buffer.c | printk("Weird - unlocked, clean and not uptodate buffer on list %d %x %lu\n", nlist, bh->b_dev, bh->b_blocknr); |
nlist | 194 | fs/buffer.c | if(nlist != BUF_DIRTY) { |
nlist | 195 | fs/buffer.c | printk("[%d %x %ld] ", nlist, bh->b_dev, bh->b_blocknr); |
nlist | 257 | fs/buffer.c | int nlist; |
nlist | 260 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) { |
nlist | 261 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 262 | fs/buffer.c | for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bh->b_next_free) { |
nlist | 453 | fs/buffer.c | int i, nlist; |
nlist | 476 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) { |
nlist | 477 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 478 | fs/buffer.c | for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bhnext) { |
nlist | 1276 | fs/buffer.c | int nlist; |
nlist | 1286 | fs/buffer.c | for(nlist = 0; nlist < NR_SIZES; nlist++) |
nlist | 1288 | fs/buffer.c | total_lav += buffers_lav[nlist]; |
nlist | 1289 | fs/buffer.c | if(nr_buffers_size[nlist]) n_sizes++; |
nlist | 1290 | fs/buffer.c | total_n_buffers += nr_buffers_size[nlist]; |
nlist | 1291 | fs/buffer.c | total_n_buffers -= nr_buffers_st[nlist][BUF_SHARED]; |
nlist | 1300 | fs/buffer.c | for(nlist = 0; nlist < NR_SIZES; nlist++) |
nlist | 1302 | fs/buffer.c | if(nlist == isize) continue; |
nlist | 1303 | fs/buffer.c | if(nr_buffers_size[nlist] && |
nlist | 1304 | fs/buffer.c | bdf_prm.b_un.lav_const * buffers_lav[nlist]*total_n_buffers < |
nlist | 1305 | fs/buffer.c | total_lav * (nr_buffers_size[nlist] - nr_buffers_st[nlist][BUF_SHARED])) |
nlist | 1306 | fs/buffer.c | if(shrink_specific_buffers(6, bufferindex_size[nlist])) |
nlist | 1335 | fs/buffer.c | int nlist; |
nlist | 1361 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) { |
nlist | 1363 | fs/buffer.c | if(priority > 3 && nlist == BUF_SHARED) continue; |
nlist | 1364 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 1366 | fs/buffer.c | i = nr_buffers_type[nlist] >> priority; |
nlist | 1369 | fs/buffer.c | if(bh->b_list != nlist) goto repeat1; |
nlist | 1401 | fs/buffer.c | int nlist, isize; |
nlist | 1407 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) { |
nlist | 1409 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 1421 | fs/buffer.c | } while (bh != lru_list[nlist]); |
nlist | 1423 | fs/buffer.c | nlist, found, used, lastused, locked, dirty, shared); |
nlist | 1429 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) |
nlist | 1430 | fs/buffer.c | printk("%7d ", nr_buffers_st[isize][nlist]); |
nlist | 1687 | fs/buffer.c | int nlist; |
nlist | 1696 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) |
nlist | 1698 | fs/buffer.c | for(nlist = BUF_DIRTY; nlist <= BUF_DIRTY; nlist++) |
nlist | 1704 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 1706 | fs/buffer.c | for (i = nr_buffers_type[nlist]; i-- > 0; bh = next) { |
nlist | 1708 | fs/buffer.c | if(bh->b_list != nlist) goto repeat; |
nlist | 1710 | fs/buffer.c | if(!lru_list[nlist]) { |
nlist | 1716 | fs/buffer.c | if (nlist == BUF_DIRTY && !bh->b_dirt && !bh->b_lock) |
nlist | 1730 | fs/buffer.c | if(nlist != BUF_DIRTY) ncount++; |
nlist | 1762 | fs/buffer.c | int nlist; |
nlist | 1803 | fs/buffer.c | for(nlist = 0; nlist < NR_LIST; nlist++) |
nlist | 1805 | fs/buffer.c | for(nlist = BUF_DIRTY; nlist <= BUF_DIRTY; nlist++) |
nlist | 1810 | fs/buffer.c | bh = lru_list[nlist]; |
nlist | 1812 | fs/buffer.c | for (i = nr_buffers_type[nlist]; i-- > 0 && ndirty < bdf_prm.b_un.ndirty; |
nlist | 1815 | fs/buffer.c | if(bh->b_list != nlist) goto repeat; |
nlist | 1817 | fs/buffer.c | if(!lru_list[nlist]) { |
nlist | 1823 | fs/buffer.c | if (nlist == BUF_DIRTY && !bh->b_dirt && !bh->b_lock) |
nlist | 1838 | fs/buffer.c | if(nlist != BUF_DIRTY) ncount++; |
nlist | 162 | include/linux/a.out.h | struct nlist *n_next; |