tag	line	file	source code
b_next_free	165	fs/buffer.c	next = bh->b_next_free;
b_next_free	268	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bh->b_next_free) {
b_next_free	300	fs/buffer.c	if (!(bh->b_prev_free) || !(bh->b_next_free))
b_next_free	304	fs/buffer.c	bh->b_prev_free->b_next_free = bh->b_next_free;
b_next_free	305	fs/buffer.c	bh->b_next_free->b_prev_free = bh->b_prev_free;
b_next_free	308	fs/buffer.c	lru_list[bh->b_list] = bh->b_next_free;
b_next_free	312	fs/buffer.c	next_to_age[bh->b_list] = bh->b_next_free;
b_next_free	316	fs/buffer.c	bh->b_next_free = bh->b_prev_free = NULL;
b_next_free	322	fs/buffer.c	if (!(bh->b_prev_free) || !(bh->b_next_free))
b_next_free	329	fs/buffer.c	if(bh->b_next_free == bh)
b_next_free	332	fs/buffer.c	bh->b_prev_free->b_next_free = bh->b_next_free;
b_next_free	333	fs/buffer.c	bh->b_next_free->b_prev_free = bh->b_prev_free;
b_next_free	335	fs/buffer.c	free_list[isize] = bh->b_next_free;
b_next_free	337	fs/buffer.c	bh->b_next_free = bh->b_prev_free = NULL;
b_next_free	358	fs/buffer.c	lru_list[bh->b_list] = bh->b_next_free;
b_next_free	360	fs/buffer.c	next_to_age[bh->b_list] = bh->b_next_free;
b_next_free	375	fs/buffer.c	bh->b_next_free = lru_list[bh->b_list];
b_next_free	377	fs/buffer.c	lru_list[bh->b_list]->b_prev_free->b_next_free = bh;
b_next_free	396	fs/buffer.c	bh->b_next_free = free_list[isize];
b_next_free	398	fs/buffer.c	free_list[isize]->b_prev_free->b_next_free = bh;
b_next_free	415	fs/buffer.c	if (bh->b_next_free) panic("VFS: buffer LRU pointers corrupted");
b_next_free	416	fs/buffer.c	bh->b_next_free = lru_list[bh->b_list];
b_next_free	418	fs/buffer.c	lru_list[bh->b_list]->b_prev_free->b_next_free = bh;
b_next_free	501	fs/buffer.c	bhnext = bh->b_next_free;
b_next_free	580	fs/buffer.c	tmp = bh->b_next_free;
b_next_free	627	fs/buffer.c	candidate[i] = bh->b_next_free;
b_next_free	652	fs/buffer.c	tmp = bh->b_next_free;
b_next_free	941	fs/buffer.c	bh->b_next_free = unused_list;
b_next_free	957	fs/buffer.c	bh->b_next_free = unused_list;  /* only make link */
b_next_free	970	fs/buffer.c	unused_list = bh->b_next_free;
b_next_free	971	fs/buffer.c	bh->b_next_free = NULL;
b_next_free	1272	fs/buffer.c	tmp->b_next_free = insert_point->b_next_free;
b_next_free	1274	fs/buffer.c	insert_point->b_next_free->b_prev_free = tmp;
b_next_free	1275	fs/buffer.c	insert_point->b_next_free = tmp;
b_next_free	1278	fs/buffer.c	tmp->b_next_free = tmp;
b_next_free	1465	fs/buffer.c	for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) {
b_next_free	1488	fs/buffer.c	next_to_age[nlist] = bh->b_next_free;
b_next_free	1551	fs/buffer.c	bh = bh->b_next_free;
b_next_free	1641	fs/buffer.c	for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) {
b_next_free	1838	fs/buffer.c	next = bh->b_next_free;
b_next_free	1945	fs/buffer.c	next = bh->b_next_free;
b_next_free	144	include/linux/fs.h	struct buffer_head * b_next_free;