uvm_physseg_graph
static struct uvm_physseg_graph uvm_physseg_graph __read_mostly;
if (uvm_physseg_graph.nentries == 1)
RB_TREE_FOREACH(current_ps, &(uvm_physseg_graph.rb_tree)) {
rb_tree_remove_node(&(uvm_physseg_graph.rb_tree), upm);
uvm_physseg_graph.nentries--;
current_ps = rb_tree_insert_node(&(uvm_physseg_graph.rb_tree), ps);
uvm_physseg_graph.nentries++;
RB_TREE_FOREACH(current_ps, &(uvm_physseg_graph.rb_tree)) {
current_ps = rb_tree_insert_node(&(uvm_physseg_graph.rb_tree), ps);
uvm_physseg_graph.nentries++;
rb_tree_init(&(uvm_physseg_graph.rb_tree), &uvm_physseg_tree_ops);
uvm_physseg_graph.nentries = 0;
return (uvm_physseg_t) rb_tree_iterate(&(uvm_physseg_graph.rb_tree), upm,
return (uvm_physseg_t) rb_tree_iterate(&(uvm_physseg_graph.rb_tree), upm,
return (uvm_physseg_t) RB_TREE_MAX(&(uvm_physseg_graph.rb_tree));
return (uvm_physseg_t) RB_TREE_MIN(&(uvm_physseg_graph.rb_tree));
(uvm_physseg_t) RB_TREE_MAX(&(uvm_physseg_graph.rb_tree));
ps = rb_tree_find_node(&(uvm_physseg_graph.rb_tree), &pframe);
return uvm_physseg_graph.nentries;
return uvm_physseg_graph.nentries;