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]
impl Items
ⓘImportant traits for Iter<'a>pub fn iter(&self) -> Iter
[src]
pub fn iter(&self) -> Iter
Iterate over all of the IR items.
ⓘImportant traits for Neighbors<'a>pub fn neighbors(&self, id: Id) -> Neighbors
[src]
pub fn neighbors(&self, id: Id) -> Neighbors
Iterate over an item's neighbors.
ⓘImportant traits for Predecessors<'a>pub fn predecessors(&self, id: Id) -> Predecessors
[src]
pub fn predecessors(&self, id: Id) -> Predecessors
Iterate over an item's predecessors.
pub fn size(&self) -> u32
[src]
pub fn size(&self) -> u32
The size of the total binary, containing all items.
pub fn meta_root(&self) -> Id
[src]
pub fn meta_root(&self) -> Id
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]
pub fn compute_predecessors(&mut self)
Force computation of predecessors.
pub fn compute_dominators(&mut self)
[src]
pub fn compute_dominators(&mut self)
Compute dominators for each item.
pub fn immediate_dominators(&self) -> &BTreeMap<Id, Id>
[src]
pub fn immediate_dominators(&self) -> &BTreeMap<Id, Id>
Get a refercence to immediate dominators
pub fn compute_dominator_tree(&mut self)
[src]
pub fn compute_dominator_tree(&mut self)
Force computation of the dominator tree.
pub fn dominator_tree(&self) -> &BTreeMap<Id, Vec<Id>>
[src]
pub fn dominator_tree(&self) -> &BTreeMap<Id, Vec<Id>>
Get a reference to the dominator tree.
Must have already called compute_dominator_tree
.
pub fn compute_retained_sizes(&mut self)
[src]
pub fn compute_retained_sizes(&mut self)
Force computation of the retained sizes of each IR item.
pub fn retained_size(&self, id: Id) -> u32
[src]
pub fn retained_size(&self, id: Id) -> u32
Get the given item's retained size.
pub fn get_item_by_name(&self, name: &str) -> Option<&Item>
[src]
pub fn get_item_by_name(&self, name: &str) -> Option<&Item>
Get an item with the given name.
Trait Implementations
impl GraphBase for Items
[src]
impl GraphBase for Items
impl Visitable for Items
[src]
impl Visitable for Items
type Map = HashSet<Id>
The associated map type
fn visit_map(&self) -> Self::Map
[src]
fn visit_map(&self) -> Self::Map
Create a new visitor map
fn reset_map(&self, map: &mut Self::Map)
[src]
fn reset_map(&self, map: &mut Self::Map)
Reset the visitor map (and resize to new size of graph if needed)
impl<'a> IntoNeighbors for &'a Items
[src]
impl<'a> IntoNeighbors for &'a Items
type Neighbors = Neighbors<'a>
fn neighbors(self, id: Id) -> Self::Neighbors
[src]
fn neighbors(self, id: Id) -> Self::Neighbors
Return an iterator of the neighbors of node a
.
impl NodeCount for Items
[src]
impl NodeCount for Items
fn node_count(&self) -> usize
[src]
fn node_count(&self) -> usize
impl Debug for Items
[src]
impl Debug for Items
fn fmt(&self, f: &mut Formatter) -> Result
[src]
fn fmt(&self, f: &mut Formatter) -> Result
Formats the value using the given formatter. Read more
impl Index<Id> for Items
[src]
impl Index<Id> for Items