tag	line	file	source code
b_next_free	176	fs/buffer.c	next = bh->b_next_free;
b_next_free	296	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bh->b_next_free) {
b_next_free	329	fs/buffer.c	if (!(bh->b_prev_free) || !(bh->b_next_free))
b_next_free	333	fs/buffer.c	bh->b_prev_free->b_next_free = bh->b_next_free;
b_next_free	334	fs/buffer.c	bh->b_next_free->b_prev_free = bh->b_prev_free;
b_next_free	337	fs/buffer.c	lru_list[bh->b_list] = bh->b_next_free;
b_next_free	341	fs/buffer.c	next_to_age[bh->b_list] = bh->b_next_free;
b_next_free	345	fs/buffer.c	bh->b_next_free = bh->b_prev_free = NULL;
b_next_free	351	fs/buffer.c	if (!(bh->b_prev_free) || !(bh->b_next_free))
b_next_free	358	fs/buffer.c	if(bh->b_next_free == bh)
b_next_free	361	fs/buffer.c	bh->b_prev_free->b_next_free = bh->b_next_free;
b_next_free	362	fs/buffer.c	bh->b_next_free->b_prev_free = bh->b_prev_free;
b_next_free	364	fs/buffer.c	free_list[isize] = bh->b_next_free;
b_next_free	366	fs/buffer.c	bh->b_next_free = bh->b_prev_free = NULL;
b_next_free	387	fs/buffer.c	lru_list[bh->b_list] = bh->b_next_free;
b_next_free	389	fs/buffer.c	next_to_age[bh->b_list] = bh->b_next_free;
b_next_free	404	fs/buffer.c	bh->b_next_free = lru_list[bh->b_list];
b_next_free	406	fs/buffer.c	lru_list[bh->b_list]->b_prev_free->b_next_free = bh;
b_next_free	425	fs/buffer.c	bh->b_next_free = free_list[isize];
b_next_free	427	fs/buffer.c	free_list[isize]->b_prev_free->b_next_free = bh;
b_next_free	444	fs/buffer.c	if (bh->b_next_free) panic("VFS: buffer LRU pointers corrupted");
b_next_free	445	fs/buffer.c	bh->b_next_free = lru_list[bh->b_list];
b_next_free	447	fs/buffer.c	lru_list[bh->b_list]->b_prev_free->b_next_free = bh;
b_next_free	533	fs/buffer.c	bhnext = bh->b_next_free;
b_next_free	612	fs/buffer.c	tmp = bh->b_next_free;
b_next_free	659	fs/buffer.c	candidate[i] = bh->b_next_free;
b_next_free	686	fs/buffer.c	tmp = bh->b_next_free;
b_next_free	968	fs/buffer.c	bh->b_next_free = unused_list;
b_next_free	1000	fs/buffer.c	bh->b_next_free = unused_list;  /* only make link */
b_next_free	1028	fs/buffer.c	reuse_list = bh->b_next_free;
b_next_free	1044	fs/buffer.c	unused_list = bh->b_next_free;
b_next_free	1045	fs/buffer.c	bh->b_next_free = NULL;
b_next_free	1160	fs/buffer.c	next->b_next_free = reuse_list;
b_next_free	1233	fs/buffer.c	tmp->b_next_free = reuse_list;
b_next_free	1313	fs/buffer.c	tmp->b_next_free = insert_point->b_next_free;
b_next_free	1315	fs/buffer.c	insert_point->b_next_free->b_prev_free = tmp;
b_next_free	1316	fs/buffer.c	insert_point->b_next_free = tmp;
b_next_free	1319	fs/buffer.c	tmp->b_next_free = tmp;
b_next_free	1493	fs/buffer.c	for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) {
b_next_free	1517	fs/buffer.c	next_to_age[nlist] = bh->b_next_free;
b_next_free	1585	fs/buffer.c	bh = bh->b_next_free;
b_next_free	1678	fs/buffer.c	for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) {
b_next_free	1859	fs/buffer.c	next = bh->b_next_free;
b_next_free	1995	fs/buffer.c	next = bh->b_next_free;
b_next_free	164	include/linux/fs.h	struct buffer_head * b_next_free;