Home
last modified time | relevance | path

Searched refs:IteratorRef (Results 1 – 8 of 8) sorted by relevance

/external/mesa3d/src/gallium/drivers/nouveau/codegen/
Dnv50_ir_graph.cpp40 for (IteratorRef it = safeIteratorDFS(); !it->end(); it->next()) in ~Graph()
243 IteratorRef Graph::iteratorDFS(bool preorder) in iteratorDFS()
245 return IteratorRef(new DFSIterator(this, preorder)); in iteratorDFS()
248 IteratorRef Graph::safeIteratorDFS(bool preorder) in safeIteratorDFS()
264 for (IteratorRef it = graph->iteratorDFS(); !it->end(); it->next()) in CFGIterator()
327 IteratorRef Graph::iteratorCFG() in iteratorCFG()
329 return IteratorRef(new CFGIterator(this)); in iteratorCFG()
332 IteratorRef Graph::safeIteratorCFG() in safeIteratorCFG()
351 for (IteratorRef it = iteratorDFS(true); !it->end(); it->next()) { in classifyEdges()
Dnv50_ir_graph.h159 IteratorRef iteratorDFS(bool preorder = true);
160 IteratorRef iteratorCFG();
163 IteratorRef safeIteratorDFS(bool preorder = true);
164 IteratorRef safeIteratorCFG();
Dnv50_ir_bb.cpp421 for (IteratorRef it = cfg.iteratorCFG(); !it->end(); it->next()) { in orderInstructions()
463 for (IteratorRef it = prog->calls.iteratorDFS(false); in doRun()
483 IteratorRef bbIter; in doRun()
520 for (IteratorRef it = cfg.iteratorDFS(); !it->end(); it->next()) { in printCFGraph()
Dnv50_ir_util.h98 typedef std::unique_ptr<Iterator> IteratorRef; typedef
100 typedef std::auto_ptr<Iterator> IteratorRef; typedef
Dnv50_ir_ssa.cpp84 for (IteratorRef it = cfg->iteratorDFS(true); !it->end(); it->next(), ++i) { in DominatorTree()
194 for (IteratorRef dtIt = iteratorDFS(false); !dtIt->end(); dtIt->next()) { in findDominanceFrontiers()
Dnv50_ir_target.cpp258 for (IteratorRef it = func->cfg.iteratorCFG(); !it->end(); it->next()) in prepareEmission()
Dnv50_ir_ra.cpp1879 for (IteratorRef it = prog->calls.iteratorDFS(false); in exec()
Dnv50_ir_lowering_nvc0.cpp608 IteratorRef bi = fn->cfg.iteratorCFG(); in insertTextureBarriers()