/external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
D | propagator.h | 33 struct Edge { struct 34 Edge(BasicBlock* b1, BasicBlock* b2) : source(b1), dest(b2) { in Edge() argument 40 bool operator<(const Edge& o) const { argument
|
/external/deqp-deps/SPIRV-Tools/source/opt/ |
D | propagator.h | 33 struct Edge { struct 34 Edge(BasicBlock* b1, BasicBlock* b2) : source(b1), dest(b2) { in Edge() argument 40 bool operator<(const Edge& o) const { argument
|
/external/skqp/src/core/ |
D | SkRegion_path.cpp | 392 struct Edge { struct 403 Edge* fNext; argument 420 static void find_link(Edge* base, Edge* stop) { in find_link() argument
|
/external/skia/src/core/ |
D | SkRegion_path.cpp | 392 struct Edge { struct 403 Edge* fNext; argument 420 static void find_link(Edge* base, Edge* stop) { in find_link() argument
|
/external/guice/extensions/grapher/src/com/google/inject/grapher/ |
D | Edge.java | 27 public abstract class Edge { class 31 protected Edge(NodeId fromId, NodeId toId) { in Edge() method in Edge
|
/external/tensorflow/tensorflow/core/grappler/ |
D | graph_view.h | 96 struct Edge { struct 97 Edge(OutputPort s, InputPort d) : src(s), dst(d) {} in Edge() function 104 friend H AbslHashValue(H h, const Edge& e) { in AbslHashValue() argument 108 OutputPort src; 109 InputPort dst;
|
/external/compiler-rt/lib/sanitizer_common/ |
D | sanitizer_deadlock_detector.h | 396 struct Edge { struct 410 Edge edges_[BV::kSize * 32]; argument
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/IR/ |
D | ModuleSummaryIndex.cpp | 117 struct Edge { struct 118 uint64_t SrcMod; 119 int Hotness; 120 GlobalValue::GUID Src; 121 GlobalValue::GUID Dst;
|
/external/skia/src/gpu/ |
D | GrTessellator.cpp | 340 struct Edge { struct 341 enum class Type { kInner, kOuter, kConnector }; 342 Edge(Vertex* top, Vertex* bottom, int winding, Type type) in Edge() function 365 int fWinding; // 1 == edge goes downward; -1 = edge goes upward. 366 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt). 367 Vertex* fBottom; // The bottom vertex in vertex-sort-order. 368 Type fType; 369 Edge* fLeft; // The linked list of edges in the active edge list. 370 Edge* fRight; // " 371 Edge* fPrevEdgeAbove; // The linked list of edges in the bottom Vertex's "edges above". [all …]
|
/external/skqp/src/gpu/ |
D | GrTessellator.cpp | 340 struct Edge { struct 341 enum class Type { kInner, kOuter, kConnector }; 342 Edge(Vertex* top, Vertex* bottom, int winding, Type type) in Edge() function 365 int fWinding; // 1 == edge goes downward; -1 = edge goes upward. 366 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt). 367 Vertex* fBottom; // The bottom vertex in vertex-sort-order. 368 Type fType; 369 Edge* fLeft; // The linked list of edges in the active edge list. 370 Edge* fRight; // " 371 Edge* fPrevEdgeAbove; // The linked list of edges in the bottom Vertex's "edges above". [all …]
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
D | BranchProbabilityInfo.h | 36 typedef std::pair<const BasicBlock *, const BasicBlock *> Edge; typedef
|
/external/v8/tools/turbolizer/src/ |
D | edge.ts | 13 export class Edge { class
|
/external/v8/src/compiler/ |
D | verifier.h | 16 class Edge; variable
|
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
D | MaximumSpanningTree.h | 54 typedef std::pair<const T*, const T*> Edge; typedef
|
/external/pdfium/xfa/fwl/ |
D | fwl_widgethit.h | 28 Edge, enumerator
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/ProfileData/ |
D | GCOV.cpp | 191 GCOVEdge *Edge = Edges.back().get(); in readGCNO() local 420 for (const GCOVEdge *Edge : SrcEdges) in print() local 426 for (const GCOVEdge *Edge : DstEdges) in print() local 747 for (const GCOVEdge *Edge : Block.dsts()) { in printBranchInfo() local
|
/external/llvm/lib/IR/ |
D | GCOV.cpp | 185 GCOVEdge *Edge = Edges.back().get(); in readGCNO() local 409 for (const GCOVEdge *Edge : SrcEdges) in dump() local 415 for (const GCOVEdge *Edge : DstEdges) in dump() local 725 for (const GCOVEdge *Edge : Block.dsts()) { in printBranchInfo() local
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Instrumentation/ |
D | MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge; typedef
|
/external/llvm/include/llvm/Analysis/ |
D | BranchProbabilityInfo.h | 125 typedef std::pair<const BasicBlock *, unsigned> Edge; typedef
|
D | LazyCallGraph.h | 912 inline LazyCallGraph::Edge::Edge() : Value() {} in Edge() function 913 inline LazyCallGraph::Edge::Edge(Function &F, Kind K) : Value(&F, K) {} in Edge() function 914 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} in Edge() function
|
/external/llvm/lib/Transforms/Instrumentation/ |
D | MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge; typedef
|
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/IR/ |
D | CFGBuilder.h | 69 Arc Edge; member
|
/external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
D | graphcycles_test.cc | 36 struct Edge { struct 40 typedef std::vector<Edge> Edges; argument
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
D | CFLGraph.h | 63 struct Edge { struct 68 using EdgeList = std::vector<Edge>; argument
|
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
D | BranchProbabilityInfo.h | 170 using Edge = std::pair<const BasicBlock *, unsigned>; variable
|