24 #ifndef _JIT_COMPILER2_MATCHER
25 #define _JIT_COMPILER2_MATCHER
95 Instruction*
createProxy(Instruction*
op,
unsigned pos, Instruction* operand,
bool dependency);
103 void lowerTree(Instruction* p,
int goalnt);
104 void lowerRule(Instruction* inst, RuleId
id);
std::set< Key, Compare, Allocator< Key > > type
GlobalSchedule TODO: more info.
static const ExcludeSetTy excluded_nodes
This Instruction mark the start of a basic block.
Instruction * NODEPTR_TYPE
alloc::set< Instruction * >::type InstSetTy
alloc::unordered_map< Instruction *, shared_ptr< STATE_TYPE > >::type InstToStateLabelTy
InstToStateLabelTy state_labels
alloc::unordered_map< int, shared_ptr< Instruction > >::type ProxyMapByInstTy
std::list< T, Allocator< T > > type
void printDependencies(Instruction *inst)
void dumpCover(Instruction *p, int goalnt, int indent)
Instruction * getOperand(Instruction *op, unsigned pos)
bool checkIsNodeExcluded(Instruction *inst)
Instruction * createProxy(Instruction *op, unsigned pos, Instruction *operand, bool dependency)
alloc::unordered_map< Instruction *, shared_ptr< InstSetTy > >::type DependencyMapTy
Matcher(GlobalSchedule *sched, BeginInst *BI, LoweringVisitor *LV)
alloc::list< Instruction * >::type InstListTy
alloc::set< Instruction::InstID >::type ExcludeSetTy
struct burm_state STATE_TYPE
void lowerRule(Instruction *inst, RuleId id)
void lowerTree(Instruction *p, int goalnt)
alloc::unordered_map< Instruction *, shared_ptr< ProxyMapByInstTy > >::type ProxyMapTy