/aosp_15_r20/external/skia/src/gpu/ganesh/geometry/ |
H A D | GrTriangulator.h | 406 struct GrTriangulator::Edge { struct 407 Edge(Vertex* top, Vertex* bottom, int winding, EdgeType type) in Edge() argument 431 EdgeType fType; argument 432 Edge* fLeft; // The linked list of edges in the active edge list. argument 433 Edge* fRight; // " argument 434 Edge* fPrevEdgeAbove; // The linked list of edges in the bottom Vertex's "edges above". argument 435 Edge* fNextEdgeAbove; // " argument 436 Edge* fPrevEdgeBelow; // The linked list of edges in the top Vertex's "edges below". argument 437 Edge* fNextEdgeBelow; // " argument 440 Edge* fLeftPolyPrev; argument [all …]
|
/aosp_15_r20/external/rust/android-crates-io/crates/plotters-backend/src/rasterizer/ |
D | polygon.rs | 6 struct Edge { struct 13 impl Edge { argument 14 fn horizontal_sweep(mut from: BackendCoord, mut to: BackendCoord) -> Option<Edge> { in horizontal_sweep() 31 fn vertical_sweep(from: BackendCoord, to: BackendCoord) -> Option<Edge> { in vertical_sweep() 50 impl PartialOrd for Edge { implementation 56 impl PartialEq for Edge { implementation 62 impl Eq for Edge {} implementation 64 impl Ord for Edge { implementation
|
/aosp_15_r20/external/swiftshader/third_party/llvm-16.0/llvm/lib/Transforms/Utils/ |
H A D | SampleProfileInference.cpp | 113 for (auto &Edge : Edges[Src]) { in run() local 163 for (const auto &Edge : Edges[Src]) { in getFlow() local 173 for (const auto &Edge : Edges[Src]) { in getFlow() local 220 auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex]; in computeAugmentingPathCapacity() local 270 auto &Edge = Edges[Src][EdgeIdx]; in findAugmentingPath() local 298 auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex]; in augmentFlowAlongPath() local 346 auto &Edge = Edges[NodeIdx][EdgeIdx]; in findAugmentingDAG() local 386 for (auto &Edge : Edges[Src]) { in findAugmentingDAG() local 409 for (auto &Edge : AugmentingEdges[Src]) { in augmentFlowAlongDAG() local 422 for (auto &Edge : AugmentingEdges[Src]) { in augmentFlowAlongDAG() local [all …]
|
/aosp_15_r20/external/pytorch/torch/csrc/autograd/ |
H A D | edge.h | 14 struct Edge { struct 15 Edge() noexcept : function(nullptr), input_nr(0) {} in Edge() argument 17 Edge(std::shared_ptr<Node> function_, uint32_t input_nr_) noexcept in Edge() argument 26 bool operator==(const Edge& other) const noexcept { argument 48 struct hash<torch::autograd::Edge> { argument
|
/aosp_15_r20/prebuilts/go/linux-x86/src/internal/profile/ |
D | graph.go | 206 func (em *EdgeMap) Add(e *Edge) { 210 func (em *EdgeMap) Delete(e *Edge) { 221 type Edge struct { struct 222 Src, Dest *Node 224 Weight, WeightDiv int64 228 Residual bool 230 Inline bool 235 func (e *Edge) WeightValue() int64 {
|
/aosp_15_r20/external/skia/src/core/ |
H A D | SkRegion_path.cpp | 445 struct Edge { struct 456 Edge* fNext; argument 473 static void find_link(Edge* base, Edge* stop) { in find_link() argument
|
/aosp_15_r20/external/pytorch/c10/util/ |
H A D | NetworkFlow.cpp | 28 struct Edge { struct 29 size_t u, v; 30 int64_t capacity; 31 int64_t flow; 32 size_t other_idx; // reverse edge 34 int64_t residual_capacity() const { in residual_capacity()
|
H A D | NetworkFlow.h | 39 struct Edge { struct 51 std::vector<Edge> edges; argument
|
/aosp_15_r20/external/swiftshader/third_party/llvm-16.0/llvm/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 178 struct Edge { struct 181 const BasicBlock *SrcBB; 182 const BasicBlock *DestBB; 183 uint64_t Weight; 184 BasicBlock *Place = nullptr; 185 uint32_t SrcNumber, DstNumber; 186 bool InMST = false; 187 bool Removed = false; 188 bool IsCritical = false; 190 Edge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W = 1) in Edge() function [all …]
|
/aosp_15_r20/external/tensorflow/tensorflow/lite/delegates/gpu/common/memory_management/ |
H A D | min_cost_flow_assignment.cc | 145 struct Edge { struct in tflite::gpu::__anonde0fea1b0111::MinCostFlowSolver 146 Edge(size_t dst, int cap, int cost) : dst(dst), cap(cap), cost(cost) {} in Edge() argument 148 size_t dst; 149 int cap; 150 int cost;
|
/aosp_15_r20/external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
H A 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
|
/aosp_15_r20/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() function 40 bool operator<(const Edge& o) const { argument
|
/aosp_15_r20/external/angle/third_party/spirv-tools/src/source/opt/ |
H A 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
|
/aosp_15_r20/prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
D | block.go | 97 type Edge struct { struct 99 b *Block 104 i int 107 func (e Edge) Block() *Block { 110 func (e Edge) Index() int { 113 func (e Edge) String() string {
|
/aosp_15_r20/prebuilts/go/linux-x86/src/cmd/vendor/github.com/google/pprof/internal/graph/ |
D | graph.go | 256 type Edge struct { struct 257 Src, Dest *Node 259 Weight, WeightDiv int64 263 Residual bool 265 Inline bool 270 func (e *Edge) WeightValue() int64 { 915 func isRedundantEdge(e *Edge) bool {
|
/aosp_15_r20/external/tensorflow/tensorflow/core/grappler/ |
H A 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;
|
/aosp_15_r20/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_deadlock_detector.h | 396 struct Edge { struct 410 Edge edges_[BV::kSize * 32]; argument
|
/aosp_15_r20/external/rust/android-crates-io/crates/bindgen/ir/ |
D | traversal.rs | 15 pub(crate) struct Edge { struct 17 kind: EdgeKind, argument 20 impl Edge { implementation 22 pub(crate) fn new(to: ItemId, kind: EdgeKind) -> Edge { in new()
|
/aosp_15_r20/external/tensorflow/tensorflow/compiler/tf2xla/ |
H A D | resource_util.cc | 86 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in PropagateFromStackOrTensorArraySourceOp() 102 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in PropagateFromArgOp() 137 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in UpdateResourceUsageFromFunctionBodyAnalysis() 186 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in PropagateThroughCallOp() 229 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in PropagateThroughIdentityOp()
|
/aosp_15_r20/external/swiftshader/third_party/llvm-10.0/llvm/lib/IR/ |
H A D | ModuleSummaryIndex.cpp | 269 struct Edge { struct 270 uint64_t SrcMod; 271 int Hotness; 272 GlobalValue::GUID Src; 273 GlobalValue::GUID Dst;
|
/aosp_15_r20/external/swiftshader/third_party/llvm-16.0/llvm/lib/IR/ |
H A D | ModuleSummaryIndex.cpp | 383 struct Edge { struct 384 uint64_t SrcMod; 385 int Hotness; 386 GlobalValue::GUID Src; 387 GlobalValue::GUID Dst;
|
/aosp_15_r20/prebuilts/rust/linux-x86/1.81.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
H A D | search.rs | 38 Edge(usize), enumerator 93 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>, in search_tree_for_bifurcation() 161 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_lower_bound_edge() 175 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_upper_bound_edge()
|
/aosp_15_r20/prebuilts/rust/linux-musl-x86/1.81.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
H A D | search.rs | 38 Edge(usize), enumerator 93 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>, in search_tree_for_bifurcation() 161 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_lower_bound_edge() 175 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_upper_bound_edge()
|
/aosp_15_r20/prebuilts/rust/linux-musl-x86/1.80.1/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
H A D | search.rs | 38 Edge(usize), enumerator 93 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>, in search_tree_for_bifurcation() 161 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_lower_bound_edge() 175 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_upper_bound_edge()
|
/aosp_15_r20/prebuilts/rust/linux-x86/1.80.1/lib/rustlib/src/rust/library/alloc/src/collections/btree/ |
H A D | search.rs | 38 Edge(usize), enumerator 93 Handle<NodeRef<BorrowType, K, V, marker::Leaf>, marker::Edge>, in search_tree_for_bifurcation() 161 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_lower_bound_edge() 175 ) -> (Handle<Self, marker::Edge>, SearchBound<&'r Q>) in find_upper_bound_edge()
|