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()
860 	struct pending_reservation *pr = NULL;  in ext4_es_insert_extent()  local
898 	if ((err1 || err2 || err3) && revise_pending && !pr)  in ext4_es_insert_extent()
899 		pr = __alloc_pending(true);  in ext4_es_insert_extent()
925 		err3 = __revise_pending(inode, lblk, len, &pr);  in ext4_es_insert_extent()
928 		if (pr) {  in ext4_es_insert_extent()
929 			__free_pending(pr);  in ext4_es_insert_extent()
930 			pr = NULL;  in ext4_es_insert_extent()
1203 	struct pending_reservation *pr = NULL;  in __pr_tree_search()  local
1206 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __pr_tree_search()
1207 		if (lclu < pr->lclu)  in __pr_tree_search()
1209 		else if (lclu > pr->lclu)  in __pr_tree_search()
1212 			return pr;  in __pr_tree_search()
1214 	if (pr && lclu < pr->lclu)  in __pr_tree_search()
1215 		return pr;  in __pr_tree_search()
1216 	if (pr && lclu > pr->lclu) {  in __pr_tree_search()
1217 		node = rb_next(&pr->rb_node);  in __pr_tree_search()
1245 	struct pending_reservation *pr;  in get_rsvd()  local
1338 			pr = __pr_tree_search(&tree->root, first_lclu);  in get_rsvd()
1339 			while (pr && pr->lclu <= last_lclu) {  in get_rsvd()
1341 				node = rb_next(&pr->rb_node);  in get_rsvd()
1342 				rb_erase(&pr->rb_node, &tree->root);  in get_rsvd()
1343 				__free_pending(pr);  in get_rsvd()
1346 				pr = rb_entry(node, struct pending_reservation,  in get_rsvd()
1867 	struct pending_reservation *pr;  in ext4_print_pending_tree()  local
1873 		pr = rb_entry(node, struct pending_reservation, rb_node);  in ext4_print_pending_tree()
1874 		printk(KERN_DEBUG " %u", pr->lclu);  in ext4_print_pending_tree()
1917 	struct pending_reservation *pr = NULL;  in __get_pending()  local
1923 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __get_pending()
1924 		if (lclu < pr->lclu)  in __get_pending()
1926 		else if (lclu > pr->lclu)  in __get_pending()
1928 		else if (lclu == pr->lclu)  in __get_pending()
1929 			return pr;  in __get_pending()
1952 	struct pending_reservation *pr;  in __insert_pending()  local
1960 		pr = rb_entry(parent, struct pending_reservation, rb_node);  in __insert_pending()
1962 		if (lclu < pr->lclu) {  in __insert_pending()
1964 		} else if (lclu > pr->lclu) {  in __insert_pending()
1973 		pr = __alloc_pending(false);  in __insert_pending()
1974 		if (!pr) {  in __insert_pending()
1979 		pr = *prealloc;  in __insert_pending()
1982 	pr->lclu = lclu;  in __insert_pending()
1984 	rb_link_node(&pr->rb_node, parent, p);  in __insert_pending()
1985 	rb_insert_color(&pr->rb_node, &tree->root);  in __insert_pending()
2003 	struct pending_reservation *pr;  in __remove_pending()  local
2006 	pr = __get_pending(inode, EXT4_B2C(sbi, lblk));  in __remove_pending()
2007 	if (pr != NULL) {  in __remove_pending()
2009 		rb_erase(&pr->rb_node, &tree->root);  in __remove_pending()
2010 		__free_pending(pr);  in __remove_pending()
2074 	struct pending_reservation *pr = NULL;  in ext4_es_insert_delayed_block()  local
2094 	if ((err1 || err2 || err3) && allocated && !pr)  in ext4_es_insert_delayed_block()
2095 		pr = __alloc_pending(true);  in ext4_es_insert_delayed_block()
2119 		err3 = __insert_pending(inode, lblk, &pr);  in ext4_es_insert_delayed_block()
2122 		if (pr) {  in ext4_es_insert_delayed_block()
2123 			__free_pending(pr);  in ext4_es_insert_delayed_block()
2124 			pr = NULL;  in ext4_es_insert_delayed_block()