#include <OrderedInstructions.hpp>

Public Member Functions
	OrderedBasicBlock (const blocRef &BasicB)

bool	dominates (const struct gimple_node A, const struct gimple_node B)
	Find out whether `A` dominates `B`, meaning whether `A` comes before `B` in `BB`. More...

Private Member Functions
bool	instComesBefore (const struct gimple_node A, const struct gimple_node B)
	Given no cached results, find if `A` comes before `B` in `BB`. More...

Private Attributes
CustomMap< const struct gimple_node *, unsigned >	NumberedInsts
	Map a instruction to its position in a BasicBlock. More...

std::list< tree_nodeRef >::const_iterator	LastInstFound
	Keep track of last instruction inserted into `NumberedInsts`. More...

unsigned	NextInstPos
	The position/number to tag the next instruction to be found. More...

const std::list< tree_nodeRef > &	BBInst
	The source BasicBlock instruction list. More...

const blocRef	BB
	The source BasicBlock to map. More...

Detailed Description

Definition at line 57 of file OrderedInstructions.hpp.

Constructor & Destructor Documentation

◆ OrderedBasicBlock()

OrderedBasicBlock::OrderedBasicBlock ( const blocRef & BasicB )

explicit

Definition at line 82 of file OrderedInstructions.cpp.

References GET_CONST_NODE, NumberedInsts, and U.

Member Function Documentation

◆ dominates()

bool OrderedBasicBlock::dominates	(	const struct gimple_node *	A,
		const struct gimple_node *	B
	)

Find out whether A dominates B, meaning whether A comes before B in BB.

This is a simplification that considers cached instruction positions and ignores other basic blocks, being only relevant to compare relative instructions positions inside BB. Returns false for A == B.

Definition at line 92 of file OrderedInstructions.cpp.

References BB, gimple_node::bb_index, tree_node::get_kind(), instComesBefore(), NumberedInsts, and THROW_ASSERT.

Here is the call graph for this function: