Home
last modified time | relevance | path

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

/third_party/mesa3d/src/nouveau/codegen/
H A Dnv50_ir_graph.cpp40 for (IteratorRef it = safeIteratorDFS(); !it->end(); it->next()) in ~Graph()
244 IteratorRef Graph::iteratorDFS(bool preorder) in iteratorDFS()
246 return IteratorRef(new DFSIterator(this, preorder)); in iteratorDFS()
249 IteratorRef Graph::safeIteratorDFS(bool preorder) in safeIteratorDFS()
265 for (IteratorRef it = graph->iteratorDFS(); !it->end(); it->next()) in CFGIterator()
328 IteratorRef Graph::iteratorCFG() in iteratorCFG()
330 return IteratorRef(new CFGIterator(this)); in iteratorCFG()
333 IteratorRef Graph::safeIteratorCFG() in safeIteratorCFG()
352 for (IteratorRef it = iteratorDFS(true); !it->end(); it->next()) { in classifyEdges()
H A Dnv50_ir_graph.h159 IteratorRef iteratorDFS(bool preorder = true);
160 IteratorRef iteratorCFG();
163 IteratorRef safeIteratorDFS(bool preorder = true);
164 IteratorRef safeIteratorCFG();
H A 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()
H A 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()
H A Dnv50_ir_target.cpp260 for (IteratorRef it = func->cfg.iteratorCFG(); !it->end(); it->next()) in prepareEmission()
H A Dnv50_ir_util.h97 typedef std::unique_ptr<Iterator> IteratorRef; typedef
H A Dnv50_ir_ra.cpp1895 for (IteratorRef it = prog->calls.iteratorDFS(false); in exec()
H A Dnv50_ir_lowering_nvc0.cpp608 IteratorRef bi = fn->cfg.iteratorCFG(); in insertTextureBarriers()

Completed in 19 milliseconds