Struct twiggy_ir::Items
[−]
[src]
pub struct Items { /* fields omitted */ }The architecture- and target-independent internal representation of functions, sections, etc in a file that is being size profiled.
Constructed with ItemsBuilder.
Methods
impl Items[src]
ⓘImportant traits for Iter<'a>pub fn iter(&self) -> Iter[src]
Iterate over all of the IR items.
ⓘImportant traits for Neighbors<'a>pub fn neighbors(&self, id: Id) -> Neighbors[src]
Iterate over an item's neighbors.
ⓘImportant traits for Predecessors<'a>pub fn predecessors(&self, id: Id) -> Predecessors[src]
Iterate over an item's neighbors.
pub fn size(&self) -> u32[src]
The size of the total binary, containing all items.
pub fn meta_root(&self) -> Id[src]
Get the id of the "meta root" which is a single root item with edges to all of the real roots.
pub fn compute_predecessors(&mut self)[src]
Force computation of predecessors.
pub fn compute_dominator_tree(&mut self)[src]
Force computation of the dominator tree.
pub fn dominator_tree(&self) -> &BTreeMap<Id, Vec<Id>>[src]
Get a reference to the dominator tree.
Must have already called compute_dominator_tree.
pub fn compute_retained_sizes(&mut self)[src]
Force computation of the retained sizes of each IR item.
pub fn retained_size(&self, id: Id) -> u32[src]
Get the given item's retained size.
Trait Implementations
impl GraphBase for Items[src]
impl Visitable for Items[src]
type Map = HashSet<Id>
The associated map type
fn visit_map(&self) -> Self::Map[src]
Create a new visitor map
fn reset_map(&self, map: &mut Self::Map)[src]
Reset the visitor map (and resize to new size of graph if needed)
impl<'a> IntoNeighbors for &'a Items[src]
type Neighbors = Neighbors<'a>
fn neighbors(self, id: Id) -> Self::Neighbors[src]
Return an iterator of the neighbors of node a.
impl NodeCount for Items[src]
fn node_count(&self) -> usize[src]
impl Debug for Items[src]
fn fmt(&self, __arg_0: &mut Formatter) -> Result[src]
Formats the value using the given formatter. Read more