1412 					struct ceph_cap_flush *cf)  in __add_cap_flushing_to_inode()  argument
1422 		if (cf->tid < other->tid)  in __add_cap_flushing_to_inode()
1424 		else if (cf->tid > other->tid)  in __add_cap_flushing_to_inode()
1430 	rb_link_node(&cf->i_node, parent, p);  in __add_cap_flushing_to_inode()
1431 	rb_insert_color(&cf->i_node, &ci->i_cap_flush_tree);  in __add_cap_flushing_to_inode()
1435 				       struct ceph_cap_flush *cf)  in __add_cap_flushing_to_mdsc()  argument
1445 		if (cf->tid < other->tid)  in __add_cap_flushing_to_mdsc()
1447 		else if (cf->tid > other->tid)  in __add_cap_flushing_to_mdsc()
1453 	rb_link_node(&cf->g_node, parent, p);  in __add_cap_flushing_to_mdsc()
1454 	rb_insert_color(&cf->g_node, &mdsc->cap_flush_tree);  in __add_cap_flushing_to_mdsc()
1462 void ceph_free_cap_flush(struct ceph_cap_flush *cf)  in ceph_free_cap_flush()  argument
1464 	if (cf)  in ceph_free_cap_flush()
1465 		kmem_cache_free(ceph_cap_flush_cachep, cf);  in ceph_free_cap_flush()
1472 		struct ceph_cap_flush *cf =  in __get_oldest_flush_tid()  local
1474 		return cf->tid;  in __get_oldest_flush_tid()
1491 	struct ceph_cap_flush *cf = NULL;  in __mark_caps_flushing()  local
1507 	swap(cf, ci->i_prealloc_cap_flush);  in __mark_caps_flushing()
1508 	cf->caps = flushing;  in __mark_caps_flushing()
1513 	cf->tid = ++mdsc->last_cap_flush_tid;  in __mark_caps_flushing()
1514 	__add_cap_flushing_to_mdsc(mdsc, cf);  in __mark_caps_flushing()
1520 		dout(" inode %p now flushing tid %llu\n", inode, cf->tid);  in __mark_caps_flushing()
1524 		     inode, cf->tid);  in __mark_caps_flushing()
1528 	__add_cap_flushing_to_inode(ci, cf);  in __mark_caps_flushing()
1530 	*flush_tid = cf->tid;  in __mark_caps_flushing()
1889 			struct ceph_cap_flush *cf =  in try_flush_caps()  local
1891 			flush_tid = cf->tid;  in try_flush_caps()
1910 	struct ceph_cap_flush *cf;  in caps_are_flushed()  local
1917 		cf = rb_entry(n, struct ceph_cap_flush, i_node);  in caps_are_flushed()
1918 		if (cf->tid <= flush_tid)  in caps_are_flushed()
2125 	struct ceph_cap_flush *cf;  in __kick_flushing_caps()  local
2146 			cf = rb_entry(n, struct ceph_cap_flush, i_node);  in __kick_flushing_caps()
2147 			if (cf->tid >= first_tid)  in __kick_flushing_caps()
2155 		cf = rb_entry(n, struct ceph_cap_flush, i_node);  in __kick_flushing_caps()
2157 		first_tid = cf->tid + 1;  in __kick_flushing_caps()
2160 		     cap, cf->tid, ceph_cap_string(cf->caps));  in __kick_flushing_caps()
2165 				      cf->caps, cf->tid, oldest_flush_tid);  in __kick_flushing_caps()
3010 	struct ceph_cap_flush *cf;  in handle_cap_flush_ack()  local
3020 		cf = rb_entry(n, struct ceph_cap_flush, i_node);  in handle_cap_flush_ack()
3021 		n = rb_next(&cf->i_node);  in handle_cap_flush_ack()
3022 		if (cf->tid == flush_tid)  in handle_cap_flush_ack()
3023 			cleaned = cf->caps;  in handle_cap_flush_ack()
3024 		if (cf->tid <= flush_tid) {  in handle_cap_flush_ack()
3025 			rb_erase(&cf->i_node, &ci->i_cap_flush_tree);  in handle_cap_flush_ack()
3026 			list_add_tail(&cf->list, &to_remove);  in handle_cap_flush_ack()
3028 			cleaned &= ~cf->caps;  in handle_cap_flush_ack()
3048 		list_for_each_entry(cf, &to_remove, list)  in handle_cap_flush_ack()
3049 			rb_erase(&cf->g_node, &mdsc->cap_flush_tree);  in handle_cap_flush_ack()
3052 		cf = n ? rb_entry(n, struct ceph_cap_flush, g_node) : NULL;  in handle_cap_flush_ack()
3053 		if (!cf || cf->tid > flush_tid)  in handle_cap_flush_ack()
3089 		cf = list_first_entry(&to_remove,  in handle_cap_flush_ack()
3091 		list_del(&cf->list);  in handle_cap_flush_ack()
3092 		ceph_free_cap_flush(cf);  in handle_cap_flush_ack()