99 struct backref_cache {  struct
167 	struct backref_cache backref_cache;  member
196 static void remove_backref_node(struct backref_cache *cache,
207 static void backref_cache_init(struct backref_cache *cache)  in backref_cache_init()
218 static void backref_cache_cleanup(struct backref_cache *cache)  in backref_cache_cleanup()
246 static struct backref_node *alloc_backref_node(struct backref_cache *cache)  in alloc_backref_node()
261 static void free_backref_node(struct backref_cache *cache,  in free_backref_node()
270 static struct backref_edge *alloc_backref_edge(struct backref_cache *cache)  in alloc_backref_edge()
280 static void free_backref_edge(struct backref_cache *cache,  in free_backref_edge()
408 static void drop_backref_node(struct backref_cache *tree,  in drop_backref_node()
424 static void remove_backref_node(struct backref_cache *cache,  in remove_backref_node()
462 static void update_backref_node(struct backref_cache *cache,  in update_backref_node()
477 				struct backref_cache *cache)  in update_backref_cache()
683 	struct backref_cache *cache = &rc->backref_cache;
1192 	struct backref_cache *cache = &rc->backref_cache;
2490 				      &rc->backref_cache.changed);
2507 		rc->backref_cache.path[next->level] = next;
2656 	rc->backref_cache.path[node->level] = node;
2759 		list_move_tail(&node->list, &rc->backref_cache.changed);
2784 	struct backref_cache *cache = &rc->backref_cache;
2926 			list_add_tail(&node->list, &rc->backref_cache.changed);
2941 		remove_backref_node(&rc->backref_cache, node);
3940 		if (update_backref_cache(trans, &rc->backref_cache)) {
4014 				rc->backref_cache.last_trans = trans->transid - 1;
4069 	backref_cache_cleanup(&rc->backref_cache);
4180 	backref_cache_init(&rc->backref_cache);
4557 		node = rc->backref_cache.path[level];
4568 				       &rc->backref_cache.pending[level]);