tag	line	file	source code
nlist	24	arch/i386/boot/compressed/piggyback.c	struct nlist var_names[2] = /* Symbol table */
nlist	156	fs/buffer.c	int nlist, ncount;
nlist	169	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++)
nlist	172	fs/buffer.c	bh = lru_list[nlist];
nlist	174	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; i-- > 0 ; bh = next) {
nlist	175	fs/buffer.c	if(bh->b_list != nlist) goto repeat1;
nlist	177	fs/buffer.c	if(!lru_list[nlist]) break;
nlist	209	fs/buffer.c	if(nlist != BUF_DIRTY) {
nlist	210	fs/buffer.c	printk("[%d %s %ld] ", nlist,
nlist	291	fs/buffer.c	int nlist;
nlist	294	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++) {
nlist	295	fs/buffer.c	bh = lru_list[nlist];
nlist	296	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bh->b_next_free) {
nlist	503	fs/buffer.c	int i, nlist;
nlist	529	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++) {
nlist	530	fs/buffer.c	bh = lru_list[nlist];
nlist	531	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bhnext) {
nlist	1428	fs/buffer.c	int nlist;
nlist	1438	fs/buffer.c	for(nlist = 0; nlist < NR_SIZES; nlist++)
nlist	1440	fs/buffer.c	total_lav += buffers_lav[nlist];
nlist	1441	fs/buffer.c	if(nr_buffers_size[nlist]) n_sizes++;
nlist	1442	fs/buffer.c	total_n_buffers += nr_buffers_size[nlist];
nlist	1443	fs/buffer.c	total_n_buffers -= nr_buffers_st[nlist][BUF_SHARED];
nlist	1452	fs/buffer.c	for(nlist = 0; nlist < NR_SIZES; nlist++)
nlist	1454	fs/buffer.c	if(nlist == isize) continue;
nlist	1455	fs/buffer.c	if(nr_buffers_size[nlist] &&
nlist	1456	fs/buffer.c	bdf_prm.b_un.lav_const * buffers_lav[nlist]*total_n_buffers <
nlist	1457	fs/buffer.c	total_lav * (nr_buffers_size[nlist] - nr_buffers_st[nlist][BUF_SHARED]))
nlist	1458	fs/buffer.c	if(shrink_specific_buffers(6, bufferindex_size[nlist]))
nlist	1479	fs/buffer.c	int nlist;
nlist	1508	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++) {
nlist	1510	fs/buffer.c	if(priority > 2 && nlist == BUF_SHARED) continue;
nlist	1511	fs/buffer.c	i = nr_buffers_type[nlist];
nlist	1514	fs/buffer.c	bh = next_to_age[nlist];
nlist	1517	fs/buffer.c	next_to_age[nlist] = bh->b_next_free;
nlist	1523	fs/buffer.c	if(bh->b_list != nlist) goto repeat1;
nlist	1563	fs/buffer.c	int nlist, isize;
nlist	1569	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++) {
nlist	1571	fs/buffer.c	bh = lru_list[nlist];
nlist	1586	fs/buffer.c	} while (bh != lru_list[nlist]);
nlist	1589	fs/buffer.c	nlist, found, used, lastused,
nlist	1596	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++)
nlist	1597	fs/buffer.c	printk("%7d ", nr_buffers_st[isize][nlist]);
nlist	1837	fs/buffer.c	int nlist;
nlist	1846	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++)
nlist	1848	fs/buffer.c	for(nlist = BUF_DIRTY; nlist <= BUF_DIRTY; nlist++)
nlist	1854	fs/buffer.c	bh = lru_list[nlist];
nlist	1856	fs/buffer.c	for (i = nr_buffers_type[nlist]; i-- > 0; bh = next) {
nlist	1858	fs/buffer.c	if(bh->b_list != nlist) goto repeat;
nlist	1860	fs/buffer.c	if(!lru_list[nlist]) {
nlist	1866	fs/buffer.c	if (nlist == BUF_DIRTY && !buffer_dirty(bh) && !buffer_locked(bh))
nlist	1880	fs/buffer.c	if(nlist != BUF_DIRTY) ncount++;
nlist	1950	fs/buffer.c	int nlist;
nlist	1982	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++)
nlist	1984	fs/buffer.c	for(nlist = BUF_DIRTY; nlist <= BUF_DIRTY; nlist++)
nlist	1989	fs/buffer.c	bh = lru_list[nlist];
nlist	1991	fs/buffer.c	for (i = nr_buffers_type[nlist]; i-- > 0 && ndirty < bdf_prm.b_un.ndirty;
nlist	1994	fs/buffer.c	if(bh->b_list != nlist) goto repeat;
nlist	1996	fs/buffer.c	if(!lru_list[nlist]) {
nlist	2002	fs/buffer.c	if (nlist == BUF_DIRTY && !buffer_dirty(bh) && !buffer_locked(bh))
nlist	2017	fs/buffer.c	if(nlist != BUF_DIRTY) ncount++;
nlist	158	include/linux/a.out.h	struct nlist *n_next;