tag	line	file	source code
b_next_free	177	fs/buffer.c	next = bh->b_next_free;
b_next_free	297	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bh->b_next_free) {
b_next_free	330	fs/buffer.c	if (!(bh->b_prev_free) || !(bh->b_next_free))
b_next_free	334	fs/buffer.c	bh->b_prev_free->b_next_free = bh->b_next_free;
b_next_free	335	fs/buffer.c	bh->b_next_free->b_prev_free = bh->b_prev_free;
b_next_free	338	fs/buffer.c	lru_list[bh->b_list] = bh->b_next_free;
b_next_free	342	fs/buffer.c	next_to_age[bh->b_list] = bh->b_next_free;
b_next_free	346	fs/buffer.c	bh->b_next_free = bh->b_prev_free = NULL;
b_next_free	352	fs/buffer.c	if (!(bh->b_prev_free) || !(bh->b_next_free))
b_next_free	359	fs/buffer.c	if(bh->b_next_free == bh)
b_next_free	362	fs/buffer.c	bh->b_prev_free->b_next_free = bh->b_next_free;
b_next_free	363	fs/buffer.c	bh->b_next_free->b_prev_free = bh->b_prev_free;
b_next_free	365	fs/buffer.c	free_list[isize] = bh->b_next_free;
b_next_free	367	fs/buffer.c	bh->b_next_free = bh->b_prev_free = NULL;
b_next_free	388	fs/buffer.c	lru_list[bh->b_list] = bh->b_next_free;
b_next_free	390	fs/buffer.c	next_to_age[bh->b_list] = bh->b_next_free;
b_next_free	405	fs/buffer.c	bh->b_next_free = lru_list[bh->b_list];
b_next_free	407	fs/buffer.c	lru_list[bh->b_list]->b_prev_free->b_next_free = bh;
b_next_free	426	fs/buffer.c	bh->b_next_free = free_list[isize];
b_next_free	428	fs/buffer.c	free_list[isize]->b_prev_free->b_next_free = bh;
b_next_free	445	fs/buffer.c	if (bh->b_next_free) panic("VFS: buffer LRU pointers corrupted");
b_next_free	446	fs/buffer.c	bh->b_next_free = lru_list[bh->b_list];
b_next_free	448	fs/buffer.c	lru_list[bh->b_list]->b_prev_free->b_next_free = bh;
b_next_free	534	fs/buffer.c	bhnext = bh->b_next_free;
b_next_free	613	fs/buffer.c	tmp = bh->b_next_free;
b_next_free	660	fs/buffer.c	candidate[i] = bh->b_next_free;
b_next_free	687	fs/buffer.c	tmp = bh->b_next_free;
b_next_free	969	fs/buffer.c	bh->b_next_free = unused_list;
b_next_free	1001	fs/buffer.c	bh->b_next_free = unused_list;  /* only make link */
b_next_free	1026	fs/buffer.c	reuse_list = bh->b_next_free;
b_next_free	1041	fs/buffer.c	unused_list = bh->b_next_free;
b_next_free	1042	fs/buffer.c	bh->b_next_free = NULL;
b_next_free	1154	fs/buffer.c	next->b_next_free = reuse_list;
b_next_free	1226	fs/buffer.c	tmp->b_next_free = reuse_list;
b_next_free	1306	fs/buffer.c	tmp->b_next_free = insert_point->b_next_free;
b_next_free	1308	fs/buffer.c	insert_point->b_next_free->b_prev_free = tmp;
b_next_free	1309	fs/buffer.c	insert_point->b_next_free = tmp;
b_next_free	1312	fs/buffer.c	tmp->b_next_free = tmp;
b_next_free	1486	fs/buffer.c	for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) {
b_next_free	1510	fs/buffer.c	next_to_age[nlist] = bh->b_next_free;
b_next_free	1577	fs/buffer.c	bh = bh->b_next_free;
b_next_free	1669	fs/buffer.c	for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) {
b_next_free	1855	fs/buffer.c	next = bh->b_next_free;
b_next_free	1991	fs/buffer.c	next = bh->b_next_free;
b_next_free	163	include/linux/fs.h	struct buffer_head * b_next_free;