58 RB_GENERATE(mmtree, mm_share, next, mm_compare)  in RB_GENERATE()  argument
61 mm_make_entry(struct mm_master *mm, struct mmtree *head,  in RB_GENERATE()
73 	tmp2 = RB_INSERT(mmtree, head, tmp);  in RB_GENERATE()
119 mm_freelist(struct mm_master *mmalloc, struct mmtree *head)  in mm_freelist()
124 		next = RB_NEXT(mmtree, head, mms);  in mm_freelist()
125 		RB_REMOVE(mmtree, head, mms);  in mm_freelist()
181 	RB_FOREACH(mms, mmtree, &mm->rb_free) {  in mm_malloc()
199 		RB_REMOVE(mmtree, &mm->rb_free, mms);  in mm_malloc()
217 	mms = RB_FIND(mmtree, &mm->rb_allocated, &tmp);  in mm_free()
225 	RB_REMOVE(mmtree, &mm->rb_allocated, mms);  in mm_free()
226 	if (RB_INSERT(mmtree, &mm->rb_free, mms) != NULL)  in mm_free()
255 		RB_REMOVE(mmtree, &mm->rb_free, mms);  in mm_free()
267 	mms = RB_NEXT(mmtree, &mm->rb_free, prev);  in mm_free()
278 	RB_REMOVE(mmtree, &mm->rb_free, mms);  in mm_free()
287 mm_sync_list(struct mmtree *oldtree, struct mmtree *newtree,  in mm_sync_list()
294 	RB_FOREACH(mms, mmtree, oldtree) {  in mm_sync_list()
301 		RB_INSERT(mmtree, newtree, new);  in mm_sync_list()
311 	struct mmtree rb_free, rb_allocated;  in mm_share_sync()