tag	line	file	source code
nlist	24	arch/i386/boot/compressed/piggyback.c	struct nlist var_names[2] = /* Symbol table */
nlist	145	fs/buffer.c	int nlist, ncount;
nlist	158	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++)
nlist	161	fs/buffer.c	bh = lru_list[nlist];
nlist	163	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; i-- > 0 ; bh = next) {
nlist	164	fs/buffer.c	if(bh->b_list != nlist) goto repeat1;
nlist	166	fs/buffer.c	if(!lru_list[nlist]) break;
nlist	198	fs/buffer.c	if(nlist != BUF_DIRTY) {
nlist	199	fs/buffer.c	printk("[%d %s %ld] ", nlist,
nlist	263	fs/buffer.c	int nlist;
nlist	266	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++) {
nlist	267	fs/buffer.c	bh = lru_list[nlist];
nlist	268	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bh->b_next_free) {
nlist	473	fs/buffer.c	int i, nlist;
nlist	496	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++) {
nlist	497	fs/buffer.c	bh = lru_list[nlist];
nlist	498	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bhnext) {
nlist	1396	fs/buffer.c	int nlist;
nlist	1406	fs/buffer.c	for(nlist = 0; nlist < NR_SIZES; nlist++)
nlist	1408	fs/buffer.c	total_lav += buffers_lav[nlist];
nlist	1409	fs/buffer.c	if(nr_buffers_size[nlist]) n_sizes++;
nlist	1410	fs/buffer.c	total_n_buffers += nr_buffers_size[nlist];
nlist	1411	fs/buffer.c	total_n_buffers -= nr_buffers_st[nlist][BUF_SHARED];
nlist	1420	fs/buffer.c	for(nlist = 0; nlist < NR_SIZES; nlist++)
nlist	1422	fs/buffer.c	if(nlist == isize) continue;
nlist	1423	fs/buffer.c	if(nr_buffers_size[nlist] &&
nlist	1424	fs/buffer.c	bdf_prm.b_un.lav_const * buffers_lav[nlist]*total_n_buffers <
nlist	1425	fs/buffer.c	total_lav * (nr_buffers_size[nlist] - nr_buffers_st[nlist][BUF_SHARED]))
nlist	1426	fs/buffer.c	if(shrink_specific_buffers(6, bufferindex_size[nlist]))
nlist	1460	fs/buffer.c	int nlist;
nlist	1488	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++) {
nlist	1490	fs/buffer.c	if(priority > 2 && nlist == BUF_SHARED) continue;
nlist	1491	fs/buffer.c	i = nr_buffers_type[nlist];
nlist	1494	fs/buffer.c	bh = next_to_age[nlist];
nlist	1497	fs/buffer.c	next_to_age[nlist] = bh->b_next_free;
nlist	1503	fs/buffer.c	if(bh->b_list != nlist) goto repeat1;
nlist	1541	fs/buffer.c	int nlist, isize;
nlist	1547	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++) {
nlist	1549	fs/buffer.c	bh = lru_list[nlist];
nlist	1561	fs/buffer.c	} while (bh != lru_list[nlist]);
nlist	1563	fs/buffer.c	nlist, found, used, lastused, locked, dirty, shared);
nlist	1569	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++)
nlist	1570	fs/buffer.c	printk("%7d ", nr_buffers_st[isize][nlist]);
nlist	1828	fs/buffer.c	int nlist;
nlist	1837	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++)
nlist	1839	fs/buffer.c	for(nlist = BUF_DIRTY; nlist <= BUF_DIRTY; nlist++)
nlist	1845	fs/buffer.c	bh = lru_list[nlist];
nlist	1847	fs/buffer.c	for (i = nr_buffers_type[nlist]; i-- > 0; bh = next) {
nlist	1849	fs/buffer.c	if(bh->b_list != nlist) goto repeat;
nlist	1851	fs/buffer.c	if(!lru_list[nlist]) {
nlist	1857	fs/buffer.c	if (nlist == BUF_DIRTY && !bh->b_dirt && !bh->b_lock)
nlist	1871	fs/buffer.c	if(nlist != BUF_DIRTY) ncount++;
nlist	1903	fs/buffer.c	int nlist;
nlist	1944	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++)
nlist	1946	fs/buffer.c	for(nlist = BUF_DIRTY; nlist <= BUF_DIRTY; nlist++)
nlist	1951	fs/buffer.c	bh = lru_list[nlist];
nlist	1953	fs/buffer.c	for (i = nr_buffers_type[nlist]; i-- > 0 && ndirty < bdf_prm.b_un.ndirty;
nlist	1956	fs/buffer.c	if(bh->b_list != nlist) goto repeat;
nlist	1958	fs/buffer.c	if(!lru_list[nlist]) {
nlist	1964	fs/buffer.c	if (nlist == BUF_DIRTY && !bh->b_dirt && !bh->b_lock)
nlist	1979	fs/buffer.c	if(nlist != BUF_DIRTY) ncount++;
nlist	156	include/linux/a.out.h	struct nlist *n_next;