| /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
|
| /external/skia/src/gpu/ |
| D | GrTessellatingPathRenderer.cpp | 233 struct Edge { struct
234 Edge(Vertex* top, Vertex* bottom, int winding) in Edge() argument
248 int fWinding; // 1 == edge goes downward; -1 = edge goes upward.
249 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt).
250 Vertex* fBottom; // The bottom vertex in vertex-sort-order.
251 Edge* fLeft; // The linked list of edges in the active edge list.
252 Edge* fRight; // "
253 Edge* fPrevEdgeAbove; // The linked list of edges in the bottom Vertex's "edges above".
254 Edge* fNextEdgeAbove; // "
255 Edge* fPrevEdgeBelow; // The linked list of edges in the top Vertex's "edges below".
[all …]
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_deadlock_detector.h | 396 struct Edge { struct
410 Edge edges_[BV::kSize * 32]; argument
|
| /external/llvm/lib/Analysis/ |
| D | CFLAliasAnalysis.cpp | 126 struct Edge { struct
128 Value *From;
131 Value *To;
134 EdgeType Weight;
139 StratifiedAttrs AdditionalAttrs;
141 Edge(Value *From, Value *To, EdgeType W, StratifiedAttrs A) in Edge() argument
587 struct Edge { struct in __anon9968a6080111::WeightedBidirectionalGraph
588 EdgeTypeT Weight;
589 Node Other;
591 Edge(const EdgeTypeT &W, const Node &N) : Weight(W), Other(N) {} in Edge() function
[all …]
|
| D | ValueTracking.cpp | 630 BasicBlockEdge Edge(BI->getParent(), BB0); in computeKnownBitsFromDominatingCondition() local
664 BasicBlockEdge Edge(BI->getParent(), BB0); in computeKnownBitsFromDominatingCondition() local
|
| /external/mockito/cglib-and-asm/src/org/mockito/asm/ |
| D | Edge.java | 37 class Edge { class
|
| /external/skia/include/utils/ |
| D | SkBoundaryPatch.h | 19 enum Edge { enum
|
| /external/llvm/include/llvm/Analysis/ |
| D | BranchProbabilityInfo.h | 121 typedef std::pair<const BasicBlock *, unsigned> Edge; typedef
|
| D | SparsePropagation.h | 131 typedef std::pair<BasicBlock*,BasicBlock*> Edge; typedef
|
| D | LoopInfo.h | 214 typedef std::pair<const BlockT*, const BlockT*> Edge; typedef
|
| /external/llvm/lib/IR/ |
| D | GCOV.cpp | 184 GCOVEdge *Edge = Edges.back().get(); in readGCNO() local
404 for (const GCOVEdge *Edge : SrcEdges) in dump() local
410 for (const GCOVEdge *Edge : DstEdges) in dump() local
721 for (const GCOVEdge *Edge : Block.dsts()) { in printBranchInfo() local
|
| /external/v8/src/compiler/ |
| D | generic-node.h | 91 class Edge; variable
174 explicit Edge(typename GenericNode<B, S>::Input* input) : input_(input) {} in Edge() function
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge; typedef
|
| D | GCOVProfiling.cpp | 601 unsigned Edge = 0; in emitProfileArcs() local
723 unsigned Edge = 0; in buildEdgeLookupTable() local
|
| /external/llvm/include/llvm/Support/ |
| D | GCOV.h | 319 void addSrcEdge(GCOVEdge *Edge) { in addSrcEdge()
323 void addDstEdge(GCOVEdge *Edge) { in addDstEdge()
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| D | nv50_ir_graph.cpp | 158 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) in Edge() function in nv50_ir::Graph::Edge
|
| /external/llvm/lib/CodeGen/ |
| D | CriticalAntiDepBreaker.cpp | 540 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) { in BreakAntiDependencies() local
|
| D | AggressiveAntiDepBreaker.cpp | 822 const SDep *Edge = Edges[i]; in BreakAntiDependencies() local
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | SampleProfile.cpp | 68 typedef std::pair<BasicBlock *, BasicBlock *> Edge; typedef
|
| D | SCCP.cpp | 206 typedef std::pair<BasicBlock*, BasicBlock*> Edge; typedef in __anon2dc3d53e0211::SCCPSolver
|
| D | GVN.cpp | 2671 std::pair<TerminatorInst*, unsigned> Edge = toSplit.pop_back_val(); in splitCriticalEdges() local
|
| /external/opencv/cvaux/src/ |
| D | cvlee.cpp | 2526 CvVoronoiEdgeInt Edge = {NULL,NULL,NULL,NULL,NULL,NULL,NULL,NULL}; in _cvConstructEdges() local
3081 CvVoronoiEdgeInt Edge = {NULL,pNode,pSite_right,NULL,NULL,NULL,NULL,NULL}; in _cvFindOppositSiteCW() local
3136 CvVoronoiEdgeInt Edge = {NULL,pNode,pSite_left,NULL,NULL,NULL,NULL}; in _cvFindOppositSiteCCW() local
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| D | MallocChecker.cpp | 2608 } else if (Optional<BlockEdge> Edge = ProgLoc.getAs<BlockEdge>()) { in VisitNode() local
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGRRList.cpp | 2884 SDep Edge = PredSU->Succs[i]; in PrescheduleNodesWithMultipleUses() local
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | LoopVectorize.cpp | 2977 std::pair<BasicBlock*, BasicBlock*> Edge(Src, Dst); in createEdgeMask() local
|