462 static inline void __free_pending(struct pending_reservation *pr)  in __free_pending()  argument
464 	kmem_cache_free(ext4_pending_cachep, pr);  in __free_pending()
861 	struct pending_reservation *pr = NULL;  in ext4_es_insert_extent()  local
899 	if ((err1 || err2 || err3) && revise_pending && !pr)  in ext4_es_insert_extent()
900 		pr = __alloc_pending(true);  in ext4_es_insert_extent()
926 		err3 = __revise_pending(inode, lblk, len, &pr);  in ext4_es_insert_extent()
929 		if (pr) {  in ext4_es_insert_extent()
930 			__free_pending(pr);  in ext4_es_insert_extent()
931 			pr = NULL;  in ext4_es_insert_extent()
1204 	struct pending_reservation *pr = NULL;  in __pr_tree_search()  local
1207 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __pr_tree_search()
1208 		if (lclu < pr->lclu)  in __pr_tree_search()
1210 		else if (lclu > pr->lclu)  in __pr_tree_search()
1213 			return pr;  in __pr_tree_search()
1215 	if (pr && lclu < pr->lclu)  in __pr_tree_search()
1216 		return pr;  in __pr_tree_search()
1217 	if (pr && lclu > pr->lclu) {  in __pr_tree_search()
1218 		node = rb_next(&pr->rb_node);  in __pr_tree_search()
1246 	struct pending_reservation *pr;  in get_rsvd()  local
1339 			pr = __pr_tree_search(&tree->root, first_lclu);  in get_rsvd()
1340 			while (pr && pr->lclu <= last_lclu) {  in get_rsvd()
1342 				node = rb_next(&pr->rb_node);  in get_rsvd()
1343 				rb_erase(&pr->rb_node, &tree->root);  in get_rsvd()
1344 				__free_pending(pr);  in get_rsvd()
1347 				pr = rb_entry(node, struct pending_reservation,  in get_rsvd()
1869 	struct pending_reservation *pr;  in ext4_print_pending_tree()  local
1875 		pr = rb_entry(node, struct pending_reservation, rb_node);  in ext4_print_pending_tree()
1876 		printk(KERN_DEBUG " %u", pr->lclu);  in ext4_print_pending_tree()
1919 	struct pending_reservation *pr = NULL;  in __get_pending()  local
1925 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __get_pending()
1926 		if (lclu < pr->lclu)  in __get_pending()
1928 		else if (lclu > pr->lclu)  in __get_pending()
1930 		else if (lclu == pr->lclu)  in __get_pending()
1931 			return pr;  in __get_pending()
1954 	struct pending_reservation *pr;  in __insert_pending()  local
1962 		pr = rb_entry(parent, struct pending_reservation, rb_node);  in __insert_pending()
1964 		if (lclu < pr->lclu) {  in __insert_pending()
1966 		} else if (lclu > pr->lclu) {  in __insert_pending()
1975 		pr = __alloc_pending(false);  in __insert_pending()
1976 		if (!pr) {  in __insert_pending()
1981 		pr = *prealloc;  in __insert_pending()
1984 	pr->lclu = lclu;  in __insert_pending()
1986 	rb_link_node(&pr->rb_node, parent, p);  in __insert_pending()
1987 	rb_insert_color(&pr->rb_node, &tree->root);  in __insert_pending()
2005 	struct pending_reservation *pr;  in __remove_pending()  local
2008 	pr = __get_pending(inode, EXT4_B2C(sbi, lblk));  in __remove_pending()
2009 	if (pr != NULL) {  in __remove_pending()
2011 		rb_erase(&pr->rb_node, &tree->root);  in __remove_pending()
2012 		__free_pending(pr);  in __remove_pending()
2076 	struct pending_reservation *pr = NULL;  in ext4_es_insert_delayed_block()  local
2096 	if ((err1 || err2 || err3) && allocated && !pr)  in ext4_es_insert_delayed_block()
2097 		pr = __alloc_pending(true);  in ext4_es_insert_delayed_block()
2121 		err3 = __insert_pending(inode, lblk, &pr);  in ext4_es_insert_delayed_block()
2124 		if (pr) {  in ext4_es_insert_delayed_block()
2125 			__free_pending(pr);  in ext4_es_insert_delayed_block()
2126 			pr = NULL;  in ext4_es_insert_delayed_block()