uvm_tree          237 uvm/uvm_map.c  RB_PROTOTYPE(uvm_tree, vm_map_entry, rb_entry, uvm_compare);
uvm_tree          239 uvm/uvm_map.c  RB_GENERATE(uvm_tree, vm_map_entry, rb_entry, uvm_compare);
uvm_tree          294 uvm/uvm_map.c  	tmp = RB_INSERT(uvm_tree, &(map)->rbhead, entry);
uvm_tree          310 uvm/uvm_map.c  	RB_REMOVE(uvm_tree, &(map)->rbhead, entry);
uvm_tree          330 uvm/uvm_map.c  	RB_FOREACH(tmp, uvm_tree, &map->rbhead) {
uvm_tree          340 uvm/uvm_map.c  	RB_FOREACH(tmp, uvm_tree, &map->rbhead) {
uvm_tree          364 uvm/uvm_map.c  		trtmp = RB_FIND(uvm_tree, &map->rbhead, tmp);
uvm_tree          217 uvm/uvm_map.h  	RB_HEAD(uvm_tree, vm_map_entry) rbhead;	/* Tree for entries */