tag	line	file	source code
b_next_free	173	fs/buffer.c	next = bh->b_next_free;
b_next_free	293	fs/buffer.c	for (i = nr_buffers_type[nlist]*2 ; --i > 0 ; bh = bh->b_next_free) {
b_next_free	326	fs/buffer.c	if (!(bh->b_prev_free) || !(bh->b_next_free))
b_next_free	330	fs/buffer.c	bh->b_prev_free->b_next_free = bh->b_next_free;
b_next_free	331	fs/buffer.c	bh->b_next_free->b_prev_free = bh->b_prev_free;
b_next_free	334	fs/buffer.c	lru_list[bh->b_list] = bh->b_next_free;
b_next_free	338	fs/buffer.c	next_to_age[bh->b_list] = bh->b_next_free;
b_next_free	342	fs/buffer.c	bh->b_next_free = bh->b_prev_free = NULL;
b_next_free	348	fs/buffer.c	if (!(bh->b_prev_free) || !(bh->b_next_free))
b_next_free	355	fs/buffer.c	if(bh->b_next_free == bh)
b_next_free	358	fs/buffer.c	bh->b_prev_free->b_next_free = bh->b_next_free;
b_next_free	359	fs/buffer.c	bh->b_next_free->b_prev_free = bh->b_prev_free;
b_next_free	361	fs/buffer.c	free_list[isize] = bh->b_next_free;
b_next_free	363	fs/buffer.c	bh->b_next_free = bh->b_prev_free = NULL;
b_next_free	384	fs/buffer.c	lru_list[bh->b_list] = bh->b_next_free;
b_next_free	386	fs/buffer.c	next_to_age[bh->b_list] = bh->b_next_free;
b_next_free	401	fs/buffer.c	bh->b_next_free = lru_list[bh->b_list];
b_next_free	403	fs/buffer.c	lru_list[bh->b_list]->b_prev_free->b_next_free = bh;
b_next_free	422	fs/buffer.c	bh->b_next_free = free_list[isize];
b_next_free	424	fs/buffer.c	free_list[isize]->b_prev_free->b_next_free = bh;
b_next_free	441	fs/buffer.c	if (bh->b_next_free) panic("VFS: buffer LRU pointers corrupted");
b_next_free	442	fs/buffer.c	bh->b_next_free = lru_list[bh->b_list];
b_next_free	444	fs/buffer.c	lru_list[bh->b_list]->b_prev_free->b_next_free = bh;
b_next_free	530	fs/buffer.c	bhnext = bh->b_next_free;
b_next_free	609	fs/buffer.c	tmp = bh->b_next_free;
b_next_free	656	fs/buffer.c	candidate[i] = bh->b_next_free;
b_next_free	683	fs/buffer.c	tmp = bh->b_next_free;
b_next_free	967	fs/buffer.c	bh->b_next_free = unused_list;
b_next_free	983	fs/buffer.c	bh->b_next_free = unused_list;  /* only make link */
b_next_free	1008	fs/buffer.c	reuse_list = bh->b_next_free;
b_next_free	1023	fs/buffer.c	unused_list = bh->b_next_free;
b_next_free	1024	fs/buffer.c	bh->b_next_free = NULL;
b_next_free	1136	fs/buffer.c	next->b_next_free = reuse_list;
b_next_free	1208	fs/buffer.c	tmp->b_next_free = reuse_list;
b_next_free	1292	fs/buffer.c	tmp->b_next_free = insert_point->b_next_free;
b_next_free	1294	fs/buffer.c	insert_point->b_next_free->b_prev_free = tmp;
b_next_free	1295	fs/buffer.c	insert_point->b_next_free = tmp;
b_next_free	1298	fs/buffer.c	tmp->b_next_free = tmp;
b_next_free	1473	fs/buffer.c	for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) {
b_next_free	1497	fs/buffer.c	next_to_age[nlist] = bh->b_next_free;
b_next_free	1564	fs/buffer.c	bh = bh->b_next_free;
b_next_free	1656	fs/buffer.c	for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) {
b_next_free	1842	fs/buffer.c	next = bh->b_next_free;
b_next_free	1978	fs/buffer.c	next = bh->b_next_free;
b_next_free	162	include/linux/fs.h	struct buffer_head * b_next_free;