Cross Reference: /art/compiler/sea

Lines Matching refs:set
79     std::set<Region*> processedNodes;
104       // For all other predecessors p of b, if idom is not set,
160   // Iterate until the reaching definitions set doesn't change anymore.
292   std::map<int, std::set<Region*> > blocks;
293   // The set @globals records registers whose use
295   std::set<int> globals;
298     std::set<int> var_kill;
314       blocks.insert(std::pair<int, std::set<Region*> >(reg_def, std::set<Region*>()));
315       std::set<Region*>* reg_def_blocks = &(blocks.find(reg_def)->second);
321   for (std::set<int>::const_iterator globals_it = globals.begin();
324     // Copy the set, because we will modify the worklist as we go.
325     std::set<Region*> worklist((*(blocks.find(global))).second);
326     for (std::set<Region*>::const_iterator b_it = worklist.begin();
328       std::set<Region*>* df = (*b_it)->GetDominanceFrontier();
329       for (std::set<Region*>::const_iterator df_it = df->begin(); df_it != df->end(); df_it++) {
388   const std::set<Region*>* dominated_nodes = crt_region->GetIDominatedSet();
389   for (std::set<Region*>::const_iterator dominated_nodes_it = dominated_nodes->begin();
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 =
515     // The definitions from the reaching set of the predecessor
517     // otherwise the defs from the reaching set are still good.
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));
529     // with the accumulated set from all predecessors so far (from new_reaching).
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*>*>(
547   // we can compare sizes instead of using set comparison.
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();
666   std::vector<int> uses;  // Using vector<> instead of set<> because order matters.