rb_entry          237 uvm/uvm_map.c  RB_PROTOTYPE(uvm_tree, vm_map_entry, rb_entry, uvm_compare);
rb_entry          239 uvm/uvm_map.c  RB_GENERATE(uvm_tree, vm_map_entry, rb_entry, uvm_compare);
rb_entry          262 uvm/uvm_map.c  	if (RB_LEFT(entry, rb_entry)) {
rb_entry          263 uvm/uvm_map.c  		tmp = RB_LEFT(entry, rb_entry)->space;
rb_entry          268 uvm/uvm_map.c  	if (RB_RIGHT(entry, rb_entry)) {
rb_entry          269 uvm/uvm_map.c  		tmp = RB_RIGHT(entry, rb_entry)->space;
rb_entry          284 uvm/uvm_map.c  	} while ((entry = RB_PARENT(entry, rb_entry)) != NULL);
rb_entry          309 uvm/uvm_map.c  	parent = RB_PARENT(entry, rb_entry);
rb_entry          368 uvm/uvm_map.c  			    RB_PARENT(tmp, rb_entry));
rb_entry         1027 uvm/uvm_map.c  				cur = RB_RIGHT(cur, rb_entry);
rb_entry         1029 uvm/uvm_map.c  				cur = RB_LEFT(cur, rb_entry);
rb_entry         1234 uvm/uvm_map.c  			else if ((child = RB_RIGHT(tmp, rb_entry)) != NULL &&
rb_entry         1239 uvm/uvm_map.c  			child = RB_RIGHT(tmp, rb_entry);
rb_entry         1241 uvm/uvm_map.c  			child = RB_LEFT(tmp, rb_entry);
rb_entry         1245 uvm/uvm_map.c  			child = RB_RIGHT(tmp, rb_entry);
rb_entry         1277 uvm/uvm_map.c  	tmp = RB_RIGHT(prev, rb_entry);
rb_entry         1280 uvm/uvm_map.c  		child = RB_LEFT(tmp, rb_entry);
rb_entry         1287 uvm/uvm_map.c  		tmp = RB_RIGHT(tmp, rb_entry);
rb_entry          136 uvm/uvm_map.h  	RB_ENTRY(vm_map_entry)	rb_entry;	/* tree information */