| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| D | nv50_ir_graph.h | 32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
40 class Edge
53 Edge(Node *dst, Node *src, Type kind);
54 ~Edge() { unlink(); } in ~Edge()
67 Edge *next[2]; // next edge outgoing/incident from/to origin/target
68 Edge *prev[2];
79 EdgeIterator(Graph::Edge *first, int dir, bool reverse) in EdgeIterator()
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]); in next()
95 inline Edge *getEdge() const { return e; } in getEdge()
96 inline Edge::Type getType() { return e ? e->getType() : Edge::UNKNOWN; } in getType()
[all …]
|
| D | nv50_ir_graph.cpp | 53 void Graph::Edge::unlink() in unlink()
73 const char *Graph::Edge::typeStr() const in typeStr()
95 void Graph::Node::attach(Node *node, Edge::Type kind) in attach()
97 Edge *edge = new Edge(this, node, kind); in attach()
125 if (kind == Edge::UNKNOWN) in attach()
158 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) in Edge() function in nv50_ir::Graph::Edge
187 if (ei.getType() == Edge::BACK || ei.getType() == Edge::DUMMY) in reachableBy()
299 case Graph::Edge::TREE: in search()
300 case Graph::Edge::FORWARD: in search()
301 case Graph::Edge::DUMMY: in search()
[all …]
|
| D | nv50_ir_bb.cpp | 310 Graph::Edge *e = cfg.outgoing(true).getEdge(); in splitCommon()
322 this->cfg.attach(&bb->cfg, Graph::Edge::TREE); in splitCommon()
365 Graph::Edge::Type eR; in initiatesSimpleConditional()
376 if (eR == Graph::Edge::CROSS || eR == Graph::Edge::BACK) in initiatesSimpleConditional()
520 case Graph::Edge::TREE: in printCFGraph()
523 case Graph::Edge::FORWARD: in printCFGraph()
526 case Graph::Edge::CROSS: in printCFGraph()
529 case Graph::Edge::BACK: in printCFGraph()
532 case Graph::Edge::DUMMY: in printCFGraph()
|
| /external/opencv/cvaux/src/ |
| D | enmin.cpp | 86 struct Edge
198 getSizeForGraph( Edge ),
233 ( ( Edge* )newEdgePtr ) -> weight = dFunc( leftLine,
238 ( ( Edge* )newEdgePtr ) -> flow = 0;
245 ( ( Edge* )newEdgePtr ) -> weight +=
252 ( ( Edge* )tempEdgePtr ) -> weight = vFunc( alpha, beta );
253 ( ( Edge* )tempEdgePtr ) -> flow = 0;
254 ( ( Edge* )tempEdgePtr ) -> srcVtx =
256 ( ( Edge* )tempEdgePtr ) -> destVtx =
266 ( ( Edge* )newEdgePtr ) -> weight +=
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | CFLAliasAnalysis.cpp | 126 struct Edge { struct
141 Edge(Value *From, Value *To, EdgeType W, StratifiedAttrs A) in Edge() argument
263 SmallVectorImpl<Edge> &Output;
266 GetEdgesVisitor(CFLAliasAnalysis &AA, SmallVectorImpl<Edge> &Output) in GetEdgesVisitor()
275 Output.push_back(Edge(Ptr, Ptr, EdgeType::Assign, AttrUnknown)); in visitPtrToIntInst()
280 Output.push_back(Edge(Ptr, Ptr, EdgeType::Assign, AttrUnknown)); in visitIntToPtrInst()
285 Edge(&Inst, Inst.getOperand(0), EdgeType::Assign, AttrNone)); in visitCastInst()
291 Output.push_back(Edge(&Inst, Op1, EdgeType::Assign, AttrNone)); in visitBinaryOperator()
292 Output.push_back(Edge(&Inst, Op2, EdgeType::Assign, AttrNone)); in visitBinaryOperator()
298 Output.push_back(Edge(Ptr, Val, EdgeType::Dereference, AttrNone)); in visitAtomicCmpXchgInst()
[all …]
|
| /external/skia/src/gpu/ |
| D | GrTessellatingPathRenderer.cpp | 95 struct Edge;
153 Edge* fFirstEdgeAbove; // Linked list of edges above this vertex.
154 Edge* fLastEdgeAbove; // "
155 Edge* fFirstEdgeBelow; // Linked list of edges below this vertex.
156 Edge* fLastEdgeBelow; // "
211 Edge* fHead;
212 Edge* fTail;
233 struct Edge { struct
234 Edge(Vertex* top, Vertex* bottom, int winding) in Edge() function
251 Edge* fLeft; // The linked list of edges in the active edge list. argument
[all …]
|
| /external/skia/src/core/ |
| D | SkRegion_path.cpp | 379 struct Edge { struct
390 Edge* fNext; argument
407 static void find_link(Edge* base, Edge* stop) { in find_link() argument
410 if (base->fFlags == Edge::kCompleteLink) { in find_link()
420 Edge* e = base; in find_link()
421 if ((base->fFlags & Edge::kY0Link) == 0) { in find_link()
424 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { in find_link()
427 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); in find_link()
434 if ((base->fFlags & Edge::kY1Link) == 0) { in find_link()
437 if ((e->fFlags & Edge::kY0Link) == 0 && y1 == e->fY0) { in find_link()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | MachineDominators.cpp | 78 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
80 MachineBasicBlock *Succ = Edge.ToBB; in applySplitCriticalEdges()
84 if (PredBB == Edge.NewBB) in applySplitCriticalEdges()
114 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
116 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB); in applySplitCriticalEdges()
122 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode); in applySplitCriticalEdges()
|
| D | CriticalAntiDepBreaker.cpp | 540 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) { in BreakAntiDependencies() local
541 const SUnit *NextSU = Edge->getSUnit(); in BreakAntiDependencies()
544 if (Edge->getKind() == SDep::Anti) { in BreakAntiDependencies()
545 AntiDepReg = Edge->getReg(); in BreakAntiDependencies()
|
| /external/v8/src/compiler/ |
| D | node-properties.h | 28 static inline bool IsValueEdge(Node::Edge edge);
29 static inline bool IsContextEdge(Node::Edge edge);
30 static inline bool IsEffectEdge(Node::Edge edge);
31 static inline bool IsControlEdge(Node::Edge edge);
57 static inline bool IsInputRange(Node::Edge edge, int first, int count);
|
| D | generic-node.h | 91 class Edge; variable
160 class GenericNode<B, S>::Edge {
174 explicit Edge(typename GenericNode<B, S>::Input* input) : input_(input) {} in Edge() function
189 typename GenericNode<B, S>::Edge edge() { in edge()
190 return typename GenericNode::Edge(GetInput()); in edge()
232 typename GenericNode<B, S>::Edge edge() { in edge()
233 return typename GenericNode::Edge(CurrentInput()); in edge()
|
| D | node-properties-inl.h | 111 inline bool NodeProperties::IsInputRange(Node::Edge edge, int first, int num) { in IsInputRange()
119 inline bool NodeProperties::IsValueEdge(Node::Edge edge) { in IsValueEdge()
125 inline bool NodeProperties::IsContextEdge(Node::Edge edge) { in IsContextEdge()
131 inline bool NodeProperties::IsEffectEdge(Node::Edge edge) { in IsEffectEdge()
137 inline bool NodeProperties::IsControlEdge(Node::Edge edge) { in IsControlEdge()
|
| /external/skia/include/utils/ |
| D | SkBoundaryPatch.h | 19 enum Edge { enum
26 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0;
54 virtual SkPoint eval(Edge, SkScalar);
63 virtual SkPoint eval(Edge, SkScalar);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge; typedef
31 typedef std::pair<Edge, double> EdgeWeight;
34 typedef std::vector<Edge> MaxSpanTree;
80 Edge e = (*EWi).first; in MaximumSpanningTree()
89 Edge e = (*EWi).first; in MaximumSpanningTree()
|
| D | GCOVProfiling.cpp | 601 unsigned Edge = 0; in emitProfileArcs() local
609 Edge); in emitProfileArcs()
616 Builder.getInt64(Edge), in emitProfileArcs()
617 Builder.getInt64(Edge + 1)); in emitProfileArcs()
632 Edge += Successors; in emitProfileArcs()
723 unsigned Edge = 0; in buildEdgeLookupTable() local
732 Edge + i); in buildEdgeLookupTable()
737 Edge += Successors; in buildEdgeLookupTable()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | SampleProfile.cpp | 68 typedef std::pair<BasicBlock *, BasicBlock *> Edge; typedef
69 typedef DenseMap<Edge, unsigned> EdgeWeightMap;
108 void printEdgeWeight(raw_ostream &OS, Edge E);
117 unsigned visitEdge(Edge E, unsigned *NumUnknownEdges, Edge *UnknownEdge);
141 SmallSet<Edge, 128> VisitedEdges;
183 void SampleProfileLoader::printEdgeWeight(raw_ostream &OS, Edge E) { in printEdgeWeight()
410 unsigned SampleProfileLoader::visitEdge(Edge E, unsigned *NumUnknownEdges, in visitEdge()
411 Edge *UnknownEdge) { in visitEdge()
446 Edge UnknownEdge, SelfReferentialEdge; in propagateThroughEdges()
451 Edge E = std::make_pair(Pred, BB); in propagateThroughEdges()
[all …]
|
| /external/llvm/lib/IR/ |
| D | GCOV.cpp | 184 GCOVEdge *Edge = Edges.back().get(); in readGCNO() local
185 Blocks[BlockNo]->addDstEdge(Edge); in readGCNO()
186 Blocks[Dst]->addSrcEdge(Edge); in readGCNO()
404 for (const GCOVEdge *Edge : SrcEdges) in dump() local
405 dbgs() << Edge->Src.Number << " (" << Edge->Count << "), "; in dump()
410 for (const GCOVEdge *Edge : DstEdges) in dump() local
411 dbgs() << Edge->Dst.Number << " (" << Edge->Count << "), "; in dump()
721 for (const GCOVEdge *Edge : Block.dsts()) { in printBranchInfo() local
722 BranchCounts.push_back(Edge->Count); in printBranchInfo()
723 TotalCounts += Edge->Count; in printBranchInfo()
[all …]
|
| /external/mockito/cglib-and-asm/src/org/mockito/asm/ |
| D | Label.java | 226 Edge successors;
486 Edge e = new Edge(); in visitSubroutine()
502 Edge e = successors; in visitSubroutine()
|
| D | Edge.java | 37 class Edge { class
74 Edge next;
|
| D | MethodWriter.java | 865 addSuccessor(Edge.NORMAL, label); in visitJumpInsn()
963 addSuccessor(Edge.NORMAL, label); in visitLabel()
1101 addSuccessor(Edge.NORMAL, dflt); in visitSwitchInsn()
1104 addSuccessor(Edge.NORMAL, labels[i]); in visitSwitchInsn()
1223 Edge b = new Edge(); in visitMaxs()
1267 Edge e = l.successors; in visitMaxs()
1320 Edge b = new Edge(); in visitMaxs()
1321 b.info = Edge.EXCEPTION; in visitMaxs()
1406 Edge b = l.successors; in visitMaxs()
1416 l.inputStackTop = b.info == Edge.EXCEPTION ? 1 : start in visitMaxs()
[all …]
|
| /external/llvm/include/llvm/Support/ |
| D | GCOV.h | 319 void addSrcEdge(GCOVEdge *Edge) { in addSrcEdge() argument
320 assert(&Edge->Dst == this); // up to caller to ensure edge is valid in addSrcEdge()
321 SrcEdges.push_back(Edge); in addSrcEdge()
323 void addDstEdge(GCOVEdge *Edge) { in addDstEdge() argument
324 assert(&Edge->Src == this); // up to caller to ensure edge is valid in addDstEdge()
326 if (DstEdges.size() && DstEdges.back()->Dst.Number > Edge->Dst.Number) in addDstEdge()
328 DstEdges.push_back(Edge); in addDstEdge()
|
| /external/llvm/include/llvm/Analysis/ |
| D | BranchProbabilityInfo.h | 121 typedef std::pair<const BasicBlock *, unsigned> Edge; typedef
131 DenseMap<Edge, uint32_t> Weights;
|
| D | SparsePropagation.h | 131 typedef std::pair<BasicBlock*,BasicBlock*> Edge; typedef
132 std::set<Edge> KnownFeasibleEdges;
|
| /external/skia/src/utils/ |
| D | SkBoundaryPatch.cpp | 65 SkPoint SkLineBoundary::eval(Edge e, SkScalar t) { in eval()
70 SkPoint SkCubicBoundary::eval(Edge e, SkScalar t) { in eval()
|
| /external/jmonkeyengine/engine/src/core-effects/Common/MatDefs/Post/ |
| D | CartoonEdge.j3md | 1 MaterialDef Cartoon Edge {
|