tag	line	file	source code
nlist	24	arch/i386/boot/compressed/piggyback.c	struct nlist var_names[2] = /* Symbol table */
nlist	152	fs/buffer.c	int nlist, ncount;
nlist	165	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++)
nlist	168	fs/buffer.c	bh = lru_list[nlist];
nlist	170	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; i-- > 0 ; bh = next) {
nlist	171	fs/buffer.c	if(bh->b_list != nlist) goto repeat1;
nlist	173	fs/buffer.c	if(!lru_list[nlist]) break;
nlist	205	fs/buffer.c	if(nlist != BUF_DIRTY) {
nlist	206	fs/buffer.c	printk("[%d %s %ld] ", nlist,
nlist	287	fs/buffer.c	int nlist;
nlist	290	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++) {
nlist	291	fs/buffer.c	bh = lru_list[nlist];
nlist	292	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bh->b_next_free) {
nlist	499	fs/buffer.c	int i, nlist;
nlist	522	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++) {
nlist	523	fs/buffer.c	bh = lru_list[nlist];
nlist	524	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bhnext) {
nlist	1350	fs/buffer.c	int nlist;
nlist	1360	fs/buffer.c	for(nlist = 0; nlist < NR_SIZES; nlist++)
nlist	1362	fs/buffer.c	total_lav += buffers_lav[nlist];
nlist	1363	fs/buffer.c	if(nr_buffers_size[nlist]) n_sizes++;
nlist	1364	fs/buffer.c	total_n_buffers += nr_buffers_size[nlist];
nlist	1365	fs/buffer.c	total_n_buffers -= nr_buffers_st[nlist][BUF_SHARED];
nlist	1374	fs/buffer.c	for(nlist = 0; nlist < NR_SIZES; nlist++)
nlist	1376	fs/buffer.c	if(nlist == isize) continue;
nlist	1377	fs/buffer.c	if(nr_buffers_size[nlist] &&
nlist	1378	fs/buffer.c	bdf_prm.b_un.lav_const * buffers_lav[nlist]*total_n_buffers <
nlist	1379	fs/buffer.c	total_lav * (nr_buffers_size[nlist] - nr_buffers_st[nlist][BUF_SHARED]))
nlist	1380	fs/buffer.c	if(shrink_specific_buffers(6, bufferindex_size[nlist]))
nlist	1401	fs/buffer.c	int nlist;
nlist	1430	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++) {
nlist	1432	fs/buffer.c	if(priority > 2 && nlist == BUF_SHARED) continue;
nlist	1433	fs/buffer.c	i = nr_buffers_type[nlist];
nlist	1436	fs/buffer.c	bh = next_to_age[nlist];
nlist	1439	fs/buffer.c	next_to_age[nlist] = bh->b_next_free;
nlist	1445	fs/buffer.c	if(bh->b_list != nlist) goto repeat1;
nlist	1485	fs/buffer.c	int nlist, isize;
nlist	1491	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++) {
nlist	1493	fs/buffer.c	bh = lru_list[nlist];
nlist	1507	fs/buffer.c	} while (bh != lru_list[nlist]);
nlist	1510	fs/buffer.c	nlist, found, used, lastused, locked, protected, dirty, shared);
nlist	1516	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++)
nlist	1517	fs/buffer.c	printk("%7d ", nr_buffers_st[isize][nlist]);
nlist	1762	fs/buffer.c	int nlist;
nlist	1771	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++)
nlist	1773	fs/buffer.c	for(nlist = BUF_DIRTY; nlist <= BUF_DIRTY; nlist++)
nlist	1779	fs/buffer.c	bh = lru_list[nlist];
nlist	1781	fs/buffer.c	for (i = nr_buffers_type[nlist]; i-- > 0; bh = next) {
nlist	1783	fs/buffer.c	if(bh->b_list != nlist) goto repeat;
nlist	1785	fs/buffer.c	if(!lru_list[nlist]) {
nlist	1791	fs/buffer.c	if (nlist == BUF_DIRTY && !buffer_dirty(bh) && !buffer_locked(bh))
nlist	1805	fs/buffer.c	if(nlist != BUF_DIRTY) ncount++;
nlist	1875	fs/buffer.c	int nlist;
nlist	1907	fs/buffer.c	for(nlist = 0; nlist < NR_LIST; nlist++)
nlist	1909	fs/buffer.c	for(nlist = BUF_DIRTY; nlist <= BUF_DIRTY; nlist++)
nlist	1914	fs/buffer.c	bh = lru_list[nlist];
nlist	1916	fs/buffer.c	for (i = nr_buffers_type[nlist]; i-- > 0 && ndirty < bdf_prm.b_un.ndirty;
nlist	1919	fs/buffer.c	if(bh->b_list != nlist) goto repeat;
nlist	1921	fs/buffer.c	if(!lru_list[nlist]) {
nlist	1927	fs/buffer.c	if (nlist == BUF_DIRTY && !buffer_dirty(bh) && !buffer_locked(bh))
nlist	1942	fs/buffer.c	if(nlist != BUF_DIRTY) ncount++;
nlist	158	include/linux/a.out.h	struct nlist *n_next;