460 static inline void __free_pending(struct pending_reservation *pr)  in __free_pending()  argument
462 	kmem_cache_free(ext4_pending_cachep, pr);  in __free_pending()
857 	struct pending_reservation *pr = NULL;  in ext4_es_insert_extent()  local
895 	if ((err1 || err2 || err3) && revise_pending && !pr)  in ext4_es_insert_extent()
896 		pr = __alloc_pending(true);  in ext4_es_insert_extent()
922 		err3 = __revise_pending(inode, lblk, len, &pr);  in ext4_es_insert_extent()
925 		if (pr) {  in ext4_es_insert_extent()
926 			__free_pending(pr);  in ext4_es_insert_extent()
927 			pr = NULL;  in ext4_es_insert_extent()
1200 	struct pending_reservation *pr = NULL;  in __pr_tree_search()  local
1203 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __pr_tree_search()
1204 		if (lclu < pr->lclu)  in __pr_tree_search()
1206 		else if (lclu > pr->lclu)  in __pr_tree_search()
1209 			return pr;  in __pr_tree_search()
1211 	if (pr && lclu < pr->lclu)  in __pr_tree_search()
1212 		return pr;  in __pr_tree_search()
1213 	if (pr && lclu > pr->lclu) {  in __pr_tree_search()
1214 		node = rb_next(&pr->rb_node);  in __pr_tree_search()
1242 	struct pending_reservation *pr;  in get_rsvd()  local
1335 			pr = __pr_tree_search(&tree->root, first_lclu);  in get_rsvd()
1336 			while (pr && pr->lclu <= last_lclu) {  in get_rsvd()
1338 				node = rb_next(&pr->rb_node);  in get_rsvd()
1339 				rb_erase(&pr->rb_node, &tree->root);  in get_rsvd()
1340 				__free_pending(pr);  in get_rsvd()
1343 				pr = rb_entry(node, struct pending_reservation,  in get_rsvd()
1868 	struct pending_reservation *pr;  in ext4_print_pending_tree()  local
1874 		pr = rb_entry(node, struct pending_reservation, rb_node);  in ext4_print_pending_tree()
1875 		printk(KERN_DEBUG " %u", pr->lclu);  in ext4_print_pending_tree()
1916 	struct pending_reservation *pr = NULL;  in __get_pending()  local
1922 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __get_pending()
1923 		if (lclu < pr->lclu)  in __get_pending()
1925 		else if (lclu > pr->lclu)  in __get_pending()
1927 		else if (lclu == pr->lclu)  in __get_pending()
1928 			return pr;  in __get_pending()
1951 	struct pending_reservation *pr;  in __insert_pending()  local
1959 		pr = rb_entry(parent, struct pending_reservation, rb_node);  in __insert_pending()
1961 		if (lclu < pr->lclu) {  in __insert_pending()
1963 		} else if (lclu > pr->lclu) {  in __insert_pending()
1972 		pr = __alloc_pending(false);  in __insert_pending()
1973 		if (!pr) {  in __insert_pending()
1978 		pr = *prealloc;  in __insert_pending()
1981 	pr->lclu = lclu;  in __insert_pending()
1983 	rb_link_node(&pr->rb_node, parent, p);  in __insert_pending()
1984 	rb_insert_color(&pr->rb_node, &tree->root);  in __insert_pending()
2002 	struct pending_reservation *pr;  in __remove_pending()  local
2005 	pr = __get_pending(inode, EXT4_B2C(sbi, lblk));  in __remove_pending()
2006 	if (pr != NULL) {  in __remove_pending()
2008 		rb_erase(&pr->rb_node, &tree->root);  in __remove_pending()
2009 		__free_pending(pr);  in __remove_pending()
2071 	struct pending_reservation *pr = NULL;  in ext4_es_insert_delayed_block()  local
2091 	if ((err1 || err2 || err3) && allocated && !pr)  in ext4_es_insert_delayed_block()
2092 		pr = __alloc_pending(true);  in ext4_es_insert_delayed_block()
2116 		err3 = __insert_pending(inode, lblk, &pr);  in ext4_es_insert_delayed_block()
2119 		if (pr) {  in ext4_es_insert_delayed_block()
2120 			__free_pending(pr);  in ext4_es_insert_delayed_block()
2121 			pr = NULL;  in ext4_es_insert_delayed_block()