Struct twiggy_ir::Items

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

Important traits for Iter<'a>

impl<'a> Iterator for Iter<'a> type Item = &'a Item;

pub fn iter(&self) -> Iter

Iterate over all of the IR items.

Important traits for Neighbors<'a>

impl<'a> Iterator for Neighbors<'a> type Item = Id;

pub fn neighbors(&self, id: Id) -> Neighbors

Iterate over an item's neighbors.

Important traits for Predecessors<'a>

impl<'a> Iterator for Predecessors<'a> type Item = Id;

pub fn predecessors(&self, id: Id) -> Predecessors

Iterate over an item's predecessors.

pub fn size(&self) -> u32

The size of the total binary, containing all items.

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)

Force computation of predecessors.

pub fn compute_dominators(&mut self)

Compute dominators for each item.

pub fn immediate_dominators(&self) -> &BTreeMap<Id, Id>

Get a refercence to immediate dominators

pub fn compute_dominator_tree(&mut self)

Force computation of the dominator tree.

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)

Force computation of the retained sizes of each IR item.

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>

Get an item with the given name.

Trait Implementations

impl GraphBase for Items

type EdgeId = ()

edge identifier

type NodeId = Id

node identifier

impl Visitable for Items

type Map = HashSet<Id>

The associated map type

fn visit_map(&self) -> Self::Map

Create a new visitor map

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

type Neighbors = Neighbors<'a>

fn neighbors(self, id: Id) -> Self::Neighbors

Return an iterator of the neighbors of node a.

impl NodeCount for Items

fn node_count(&self) -> usize

impl Debug for Items

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Index<Id> for Items

type Output = Item

The returned type after indexing.

fn index(&self, id: Id) -> &Item

Performs the indexing (container[index]) operation.