Home
last modified time | relevance | path

Searched defs:Edge (Results 1 – 25 of 70) sorted by relevance

123

/third_party/ninja/src/
Dgraph.h172 struct Edge { struct
179 Edge() in Edge() argument
210 const Rule* rule_ = nullptr;
211 Pool* pool_ = nullptr;
212 std::vector<Node*> inputs_;
213 std::vector<Node*> outputs_;
214 std::vector<Node*> validations_;
215 Node* dyndep_ = nullptr;
216 BindingEnv* env_ = nullptr;
217 VisitMark mark_ = VisitNone;
[all …]
/third_party/skia/src/gpu/geometry/
DGrTriangulator.h378 struct GrTriangulator::Edge { struct
379 Edge(Vertex* top, Vertex* bottom, int winding, EdgeType type) in Edge() function
403 EdgeType fType; argument
404 Edge* fLeft; // The linked list of edges in the active edge list. argument
405 Edge* fRight; // " argument
406 Edge* fPrevEdgeAbove; // The linked list of edges in the bottom Vertex's "edges above". argument
407 Edge* fNextEdgeAbove; // " argument
408 Edge* fPrevEdgeBelow; // The linked list of edges in the top Vertex's "edges below". argument
409 Edge* fNextEdgeBelow; // " argument
412 Edge* fLeftPolyPrev; argument
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
Dpropagator.h33 struct Edge { struct
34 Edge(BasicBlock* b1, BasicBlock* b2) : source(b1), dest(b2) { in Edge() argument
40 bool operator<(const Edge& o) const { argument
/third_party/spirv-tools/source/opt/
Dpropagator.h33 struct Edge { struct
34 Edge(BasicBlock* b1, BasicBlock* b2) : source(b1), dest(b2) { in Edge() argument
40 bool operator<(const Edge& o) const { argument
/third_party/skia/third_party/externals/spirv-tools/source/opt/
Dpropagator.h33 struct Edge { struct
34 Edge(BasicBlock* b1, BasicBlock* b2) : source(b1), dest(b2) { in Edge() function
40 bool operator<(const Edge& o) const { argument
/third_party/skia/src/core/
DSkRegion_path.cpp391 struct Edge { struct
402 Edge* fNext; argument
419 static void find_link(Edge* base, Edge* stop) { in find_link() argument
/third_party/rust/crates/bindgen/bindgen/ir/
Dtraversal.rs15 pub struct Edge { struct
17 kind: EdgeKind, argument
20 impl Edge { argument
22 pub fn new(to: ItemId, kind: EdgeKind) -> Edge { in new()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/LTO/
DSummaryBasedOptimizations.cpp51 auto GetCallSiteRelFreq = [](FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts()
74 auto GetProfileCount = [&](ValueInfo V, FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/
DModuleSummaryIndex.cpp269 struct Edge { struct
270 uint64_t SrcMod;
271 int Hotness;
272 GlobalValue::GUID Src;
273 GlobalValue::GUID Dst;
/third_party/node/deps/v8/src/compiler/
Dverifier.h16 class Edge; variable
Dnode.h20 class Edge; variable
302 friend class Edge; variable
449 Edge(Node::Use* use, ZoneNodePtr* input_ptr) in Edge() function
/third_party/skia/tests/
DTriangulatingPathRendererTests.cpp797 struct Edge { struct
798 Edge reverse() const { return {fP1, fP0}; } in reverse() argument
802 static bool operator<(const Edge& a, const Edge& b) { in operator <() argument
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/
DMaximumSpanningTree.h29 typedef std::pair<const T*, const T*> Edge; typedef
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc35 struct Edge { struct
36 int from;
37 int to;
/third_party/node/deps/v8/tools/turbolizer/src/
Dedge.ts10 export class Edge { class
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ProfileData/
DGCOV.cpp189 GCOVEdge *Edge = Edges.back().get(); in readGCNO() local
416 for (const GCOVEdge *Edge : SrcEdges) in print() local
422 for (const GCOVEdge *Edge : DstEdges) in print() local
865 for (const GCOVEdge *Edge : Block.dsts()) { in printBranchInfo() local
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DCFLGraph.h61 struct Edge { struct
66 using EdgeList = std::vector<Edge>; argument
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DBranchProbabilityInfo.h170 using Edge = std::pair<const BasicBlock *, unsigned>; variable
DLazyCallGraph.h1211 inline LazyCallGraph::Edge::Edge() : Value() {} in Edge() function
1212 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} in Edge() function
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/
Dprintable.js129 class Edge { class
Dedge.js36 class Edge { class
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/
DSyntheticCountsPropagation.cpp109 const CallGraphNode::CallRecord &Edge) { in run()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
DLoopUnrollPeel.cpp576 for (auto Edge : ExitEdges) in cloneLoopBlocks() local
636 for (auto Edge : ExitEdges) { in peelLoop() local
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
Dcord_rep_btree.h533 inline CordRep* CordRepBtree::Edge(size_t index) const { in Edge() function
539 inline CordRep* CordRepBtree::Edge(EdgeType edge_type) const { in Edge() function
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ProfileData/
DGCOV.h336 void addSrcEdge(GCOVEdge *Edge) { in addSrcEdge()
341 void addDstEdge(GCOVEdge *Edge) { in addDstEdge()

123