Lines Matching refs:InstructionNode
38 std::vector<InstructionNode*>* instructions = region->GetInstructions();
39 for (std::vector<InstructionNode*>::const_iterator cit = instructions->begin();
232 sea_ir::InstructionNode* last_node = NULL;
233 sea_ir::InstructionNode* node = NULL;
236 std::vector<InstructionNode*> sea_instructions_for_dalvik =
237 sea_ir::InstructionNode::Create(inst);
238 for (std::vector<InstructionNode*>::const_iterator cit = sea_instructions_for_dalvik.begin();
278 utils::ScopedHashtable<int, InstructionNode*> scoped_table;
299 std::vector<InstructionNode*>* instructions = (*region_it)->GetInstructions();
300 for (std::vector<InstructionNode*>::iterator inst_it = instructions->begin();
349 utils::ScopedHashtable<int, InstructionNode*>* scoped_table) {
359 std::vector<InstructionNode*>* instructions = crt_region->GetInstructions();
360 for (std::vector<InstructionNode*>::const_iterator instructions_it = instructions->begin();
362 InstructionNode* current_instruction = (*instructions_it);
368 InstructionNode* definition = scoped_table->Lookup(current_used_reg);
467 void Region::AddChild(sea_ir::InstructionNode* instruction) {
481 for (std::vector<InstructionNode*>::const_iterator inst_it = instructions_.begin();
484 std::map<int, InstructionNode*>::iterator res = de_defs_.find(reg_no);
486 de_defs_.insert(std::pair<int, InstructionNode*>(reg_no, *inst_it));
491 for (std::map<int, sea_ir::InstructionNode*>::const_iterator cit = de_defs_.begin();
497 const std::map<int, sea_ir::InstructionNode*>* Region::GetDownExposedDefs() const {
501 std::map<int, std::set<sea_ir::InstructionNode*>* >* Region::GetReachingDefs() {
506 std::map<int, std::set<sea_ir::InstructionNode*>* > new_reaching;
510 std::map<int, std::set<sea_ir::InstructionNode*>* > reaching_defs;
511 std::map<int, std::set<sea_ir::InstructionNode*>* >* pred_reaching =
513 const std::map<int, InstructionNode*>* de_defs = (*pred_it)->GetDownExposedDefs();
518 for (std::map<int, InstructionNode*>::const_iterator de_def = de_defs->begin();
520 std::set<InstructionNode*>* solo_def;
521 solo_def = new std::set<InstructionNode*>();
524 std::pair<int const, std::set<InstructionNode*>*>(de_def->first, solo_def));
530 std::map<int, std::set<sea_ir::InstructionNode*>*>::iterator reaching_it =
533 std::map<int, std::set<sea_ir::InstructionNode*>*>::iterator crt_entry =
539 std::pair<int, std::set<sea_ir::InstructionNode*>*>(
551 std::map<int, std::set<sea_ir::InstructionNode*>*>::iterator reaching_it =
560 std::map<int, std::set<sea_ir::InstructionNode*>*>::iterator reaching_it = new_reaching.begin();
586 const utils::ScopedHashtable<int, InstructionNode*>* scoped_table, Region* predecessor) {
598 InstructionNode* definition = scoped_table->Lookup(reg_no);
603 std::vector<InstructionNode*> InstructionNode::Create(const art::Instruction* in) {
604 std::vector<InstructionNode*> sea_instructions;
637 sea_instructions.push_back(new InstructionNode(in));
642 void InstructionNode::MarkAsDEDef() {
646 int InstructionNode::GetResultRegister() const {
653 std::vector<int> InstructionNode::GetDefinitions() const {
665 std::vector<int> InstructionNode::GetUses() const {
