Home
last modified time | relevance | path

Searched refs:EdgeIterator (Results 1 – 12 of 12) sorted by relevance

/external/mesa3d/src/gallium/drivers/nv50/codegen/
Dnv50_ir_graph.h75 class EdgeIterator : public Iterator
78 EdgeIterator() : e(0), t(0), d(0), rev(false) { } in EdgeIterator() function
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse) in EdgeIterator() function
115 inline EdgeIterator outgoing(bool reverse = false) const;
116 inline EdgeIterator incident(bool reverse = false) const;
207 Graph::EdgeIterator Graph::Node::outgoing(bool reverse) const in outgoing()
209 return EdgeIterator(out, 0, reverse); in outgoing()
212 Graph::EdgeIterator Graph::Node::incident(bool reverse) const in incident()
214 return EdgeIterator(in, 1, reverse); in incident()
220 for (EdgeIterator ei = incident(); !ei.end(); ei.next()) in incidentCountFwd()
Dnv50_ir_ssa.cpp101 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { in buildDFS()
144 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) { in build()
194 EdgeIterator succIt, chldIt; in findDominanceFrontiers()
229 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in buildLiveSetsPreSSA()
270 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in buildDefSetsPreSSA()
488 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in search()
494 for (Graph::EdgeIterator ei = sb->cfg.incident(); !ei.end(); ei.next()) { in search()
509 for (Graph::EdgeIterator ei = bb->dom.outgoing(); !ei.end(); ei.next()) in search()
Dnv50_ir_graph.cpp131 EdgeIterator ei = this->outgoing(); in detach()
186 for (EdgeIterator ei = pos->outgoing(); !ei.end(); ei.next()) { in reachableBy()
225 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) in search()
297 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { in search()
408 for (EdgeIterator ei = c->outgoing(); !ei.end(); ei.next()) { in findLightestPathWeight()
Dnv50_ir_ra.cpp319 for (Graph::EdgeIterator ei = p->cfg.outgoing(); !ei.end(); ei.next()) in needNewElseBlock()
342 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in visit()
364 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in visit()
462 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in buildLiveSets()
520 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in collectLiveValues()
547 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in visit()
636 static inline RIG_Node *get(const Graph::EdgeIterator& ei) in get()
680 inline void checkInterference(const RIG_Node *, Graph::EdgeIterator&);
730 for (Graph::EdgeIterator ei = nodes[i].outgoing(); !ei.end(); ei.next()) in printNodeInfo()
732 for (Graph::EdgeIterator ei = nodes[i].incident(); !ei.end(); ei.next()) in printNodeInfo()
[all …]
Dnv50_ir_bb.cpp102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) { in clone()
371 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next()) in initiatesSimpleConditional()
517 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in printCFGraph()
Dnv50_ir_print.cpp591 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) in visit()
607 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) in visit()
Dnv50_ir_peephole.cpp1900 Graph::EdgeIterator ei = bb->cfg.outgoing(); in tryPropagateBranch()
1975 Graph::EdgeIterator ei = bb->cfg.outgoing(); in tryPredicateConditional()
Dnv50_ir_emit_nv50.cpp1848 for (Graph::EdgeIterator ei = func->cfgExit->incident(); in replaceExitWithModifier()
/external/llvm/include/llvm/Support/
DGCOV.h307 typedef SmallVectorImpl<GCOVEdge *>::const_iterator EdgeIterator; typedef
334 EdgeIterator src_begin() const { return SrcEdges.begin(); } in src_begin()
335 EdgeIterator src_end() const { return SrcEdges.end(); } in src_end()
336 iterator_range<EdgeIterator> srcs() const { in srcs()
340 EdgeIterator dst_begin() const { return DstEdges.begin(); } in dst_begin()
341 EdgeIterator dst_end() const { return DstEdges.end(); } in dst_end()
342 iterator_range<EdgeIterator> dsts() const { in dsts()
/external/llvm/lib/Analysis/
DCFLAliasAnalysis.cpp618 struct EdgeIterator : public std::iterator<std::forward_iterator_tag, struct in __anondc6bc0680111::WeightedBidirectionalGraph
620 EdgeIterator(const typename std::vector<Edge>::const_iterator &Iter) in EdgeIterator() function
623 EdgeIterator(NodeImpl &Impl) : Current(Impl.begin()) {} in EdgeIterator() argument
625 EdgeIterator &operator++() { in operator ++() argument
630 EdgeIterator operator++(int) { in operator ++() argument
631 EdgeIterator Copy(Current); in operator ++()
641 bool operator==(const EdgeIterator &Other) const { in operator ==() argument
645 bool operator!=(const EdgeIterator &Other) const { in operator !=() argument
659 EdgeIterator begin() { return EdgeIterator(BeginIter); } in begin()
661 EdgeIterator end() { return EdgeIterator(EndIter); } in end()
/external/mesa3d/src/gallium/drivers/nvc0/codegen/
Dnv50_ir_lowering_nvc0.cpp412 for (Graph::EdgeIterator ei = n->incident(); !ei.end(); ei.next()) { in insertTextureBarriers()
507 Graph::EdgeIterator ei = bb->cfg.incident(); in tryReplaceContWithBra()
531 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in propagateJoin()
Dnv50_ir_emit_nvc0.cpp2048 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) { in visit()
2087 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) { in visit()