| /external/skia/src/gpu/ |
| D | GrTriangulator.h | 47 struct Edge;
140 Edge* makeEdge(Vertex* prev, Vertex* next, EdgeType type, const Comparator&) const;
141 void setTop(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current,
143 void setBottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current,
145 void mergeEdgesAbove(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current,
147 void mergeEdgesBelow(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current,
149 Edge* makeConnectingEdge(Vertex* prev, Vertex* next, EdgeType, const Comparator&,
152 static void FindEnclosingEdges(Vertex* v, EdgeList* edges, Edge** left, Edge** right);
153 void mergeCollinearEdges(Edge* edge, EdgeList* activeEdges, Vertex** current,
155 bool splitEdge(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current,
[all …]
|
| D | GrTriangulator.cpp | 32 using Edge = GrTriangulator::Edge; typedef
152 bool GrTriangulator::Edge::intersect(const Edge& other, SkPoint* p, uint8_t* alpha) const { in intersect()
197 void GrTriangulator::EdgeList::insert(Edge* edge, Edge* prev, Edge* next) { in insert()
198 list_insert<Edge, &Edge::fLeft, &Edge::fRight>(edge, prev, next, &fHead, &fTail); in insert()
201 void GrTriangulator::EdgeList::remove(Edge* edge) { in remove()
204 list_remove<Edge, &Edge::fLeft, &Edge::fRight>(edge, &fHead, &fTail); in remove()
207 void GrTriangulator::MonotonePoly::addEdge(Edge* edge) { in addEdge()
210 list_insert<Edge, &Edge::fRightPolyPrev, &Edge::fRightPolyNext>( in addEdge()
215 list_insert<Edge, &Edge::fLeftPolyPrev, &Edge::fLeftPolyNext>( in addEdge()
223 Edge* e = monotonePoly->fFirstEdge; in emitMonotonePoly()
[all …]
|
| /external/libcups/data/ |
| D | media.defs | 24 #media "A0.Transverse/A0 Long Edge" 3370 2384
26 #media "A1.Transverse/A1 Long Edge" 2384 1684
28 #media "A2.Transverse/A2 Long Edge" 1684 1191
30 #media "A3.Transverse/A3 Long Edge" 1191 842
32 #media "A3Extra.Transverse/A3 Oversize Long Edge" 913 1262
33 #media "A3Rotated/A3 Long Edge" 1191 842
37 #media "A4Rotated/A4 Long Edge" 842 595
39 #media "A4.Transverse/A4 Long Edge" 842 595
42 #media "A5Rotated/A5 Long Edge" 595 420
43 #media "A5.Transverse/A5 Long Edge" 595 420
[all …]
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| D | DefaultEdgeCreator.java | 43 public Iterable<Edge> getEdges(Iterable<Binding<?>> bindings) { in getEdges()
44 List<Edge> edges = Lists.newArrayList(); in getEdges()
56 extends DefaultBindingTargetVisitor<Object, Collection<Edge>> {
65 private <T extends Binding<?> & HasDependencies> Collection<Edge> newDependencyEdges( in newDependencyEdges()
67 ImmutableList.Builder<Edge> builder = ImmutableList.builder(); in newDependencyEdges()
80 public Collection<Edge> visit(ConstructorBinding<?> binding) { in visit()
90 public Collection<Edge> visit(ConvertedConstantBinding<?> binding) { in visit()
91 return ImmutableList.<Edge>of( in visit()
105 public Collection<Edge> visit(InstanceBinding<?> binding) { in visit()
106 return new ImmutableList.Builder<Edge>() in visit()
[all …]
|
| D | Edge.java | 27 public abstract class Edge { class
31 protected Edge(NodeId fromId, NodeId toId) { in Edge() method in Edge
46 if (!(obj instanceof Edge)) { in equals()
49 Edge other = (Edge) obj; in equals()
65 public abstract Edge copy(NodeId fromId, NodeId toId); in copy()
|
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| D | nv50_ir_graph.h | 32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
40 class Edge
52 Edge(Node *dst, Node *src, Type kind);
53 ~Edge() { unlink(); } in ~Edge()
66 Edge *next[2]; // next edge outgoing/incident from/to origin/target
67 Edge *prev[2];
78 EdgeIterator(Graph::Edge *first, int dir, bool reverse) in EdgeIterator()
86 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]); in next()
94 inline Edge *getEdge() const { return e; } in getEdge()
95 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()
94 void Graph::Node::attach(Node *node, Edge::Type kind) in attach()
96 Edge *edge = new Edge(this, node, kind); in attach()
124 if (kind == Edge::UNKNOWN) in attach()
157 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) in Edge() function in nv50_ir::Graph::Edge
186 if (ei.getType() == Edge::BACK) in reachableBy()
301 case Graph::Edge::TREE: in search()
302 case Graph::Edge::FORWARD: in search()
306 case Graph::Edge::BACK: in search()
[all …]
|
| /external/llvm-project/mlir/include/mlir/Analysis/ |
| D | CallGraph.h | 43 class Edge {
75 bool operator==(const Edge &edge) const {
80 Edge(CallGraphNode *node, Kind kind) : targetAndKind(node, kind) {} in Edge() function
81 explicit Edge(llvm::PointerIntPair<CallGraphNode *, 2, Kind> targetAndKind) in Edge() function
110 using iterator = SmallVectorImpl<Edge>::const_iterator;
121 DenseMapInfo<llvm::PointerIntPair<CallGraphNode *, 2, Edge::Kind>>;
123 static Edge getEmptyKey() { return Edge(BaseInfo::getEmptyKey()); } in getEmptyKey()
124 static Edge getTombstoneKey() { return Edge(BaseInfo::getTombstoneKey()); } in getTombstoneKey()
125 static unsigned getHashValue(const Edge &edge) { in getHashValue()
128 static bool isEqual(const Edge &lhs, const Edge &rhs) { return lhs == rhs; } in isEqual()
[all …]
|
| /external/skqp/src/gpu/ |
| D | GrTessellator.cpp | 102 struct Edge;
163 Edge* fFirstEdgeAbove; // Linked list of edges above this vertex.
164 Edge* fLastEdgeAbove; // "
165 Edge* fFirstEdgeBelow; // Linked list of edges below this vertex.
166 Edge* fLastEdgeBelow; // "
167 Edge* fLeftEnclosingEdge; // Nearest edge in the AEL left of this vertex.
168 Edge* fRightEnclosingEdge; // Nearest edge in the AEL right of this vertex.
340 struct Edge { struct
342 Edge(Vertex* top, Vertex* bottom, int winding, Type type) in Edge() argument
369 Edge* fLeft; // The linked list of edges in the active edge list. argument
[all …]
|
| /external/llvm-project/mlir/test/Analysis/ |
| D | test-callgraph.mlir | 14 // CHECK-NEXT: Call-Edge{{.*}}External-Node
21 // CHECK-NEXT: Call-Edge{{.*}}func_c
28 // CHECK-DAG: Call-Edge{{.*}}func_c
29 // CHECK-DAG: Call-Edge{{.*}}func_d
30 // CHECK-DAG: Call-Edge{{.*}}func_e
39 // CHECK: Child-Edge{{.*}}test.functional_region_op
40 // CHECK: Call-Edge{{.*}}test.functional_region_op
43 // CHECK: Call-Edge{{.*}}func_f
66 // CHECK: Call-Edge{{.*}}func_a
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| D | resource_util.cc | 59 StatusOr<absl::InlinedVector<const Edge*, 1>> OutputEdgesByIndex(const Node& n, in OutputEdgesByIndex()
61 absl::InlinedVector<const Edge*, 1> res; in OutputEdgesByIndex()
68 for (const Edge* o : n.out_edges()) { in OutputEdgesByIndex()
86 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in PropagateFromStackOrTensorArraySourceOp() argument
90 for (const Edge* o : n.out_edges()) { in PropagateFromStackOrTensorArraySourceOp()
102 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in PropagateFromArgOp() argument
118 for (const Edge* o : n.out_edges()) { in PropagateFromArgOp()
137 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in UpdateResourceUsageFromFunctionBodyAnalysis() argument
154 const Edge* e; in UpdateResourceUsageFromFunctionBodyAnalysis()
169 absl::InlinedVector<const Edge*, 1> outs; in UpdateResourceUsageFromFunctionBodyAnalysis()
[all …]
|
| /external/skia/src/core/ |
| D | SkRegion_path.cpp | 391 struct Edge { struct
402 Edge* fNext; argument
419 static void find_link(Edge* base, Edge* stop) { in find_link() argument
422 if (base->fFlags == Edge::kCompleteLink) { in find_link()
432 Edge* e = base; in find_link()
433 if ((base->fFlags & Edge::kY0Link) == 0) { in find_link()
436 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { in find_link()
439 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); in find_link()
446 if ((base->fFlags & Edge::kY1Link) == 0) { in find_link()
449 if ((e->fFlags & Edge::kY0Link) == 0 && y1 == e->fY0) { in find_link()
[all …]
|
| /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
423 if (base->fFlags == Edge::kCompleteLink) { in find_link()
433 Edge* e = base; in find_link()
434 if ((base->fFlags & Edge::kY0Link) == 0) { in find_link()
437 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { in find_link()
440 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); in find_link()
447 if ((base->fFlags & Edge::kY1Link) == 0) { in find_link()
450 if ((e->fFlags & Edge::kY0Link) == 0 && y1 == e->fY0) { in find_link()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/ExecutionEngine/JITLink/ |
| D | EHFrameSupportImpl.h | 43 EHFrameEdgeFixer(StringRef EHFrameSectionName, Edge::Kind FDEToCIE,
44 Edge::Kind FDEToPCBegin, Edge::Kind FDEToLSDA);
64 EdgeTarget(const Edge &E) : Target(&E.getTarget()), Addend(E.getAddend()) {} in EdgeTarget()
67 Edge::AddendT Addend = 0;
70 using BlockEdgeMap = DenseMap<Edge::OffsetT, EdgeTarget>;
104 Edge::Kind FDEToCIE;
105 Edge::Kind FDEToPCBegin;
106 Edge::Kind FDEToLSDA;
|
| /external/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
| D | EHFrameSupportImpl.h | 43 EHFrameEdgeFixer(StringRef EHFrameSectionName, Edge::Kind FDEToCIE,
44 Edge::Kind FDEToPCBegin, Edge::Kind FDEToLSDA);
64 EdgeTarget(const Edge &E) : Target(&E.getTarget()), Addend(E.getAddend()) {} in EdgeTarget()
67 Edge::AddendT Addend = 0;
70 using BlockEdgeMap = DenseMap<Edge::OffsetT, EdgeTarget>;
104 Edge::Kind FDEToCIE;
105 Edge::Kind FDEToPCBegin;
106 Edge::Kind FDEToLSDA;
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/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
249 bool MarkEdgeExecutable(const Edge& edge) { in MarkEdgeExecutable()
254 bool IsEdgeExecutable(const Edge& edge) const { in IsEdgeExecutable()
265 void AddControlEdge(const Edge& e);
297 std::unordered_map<BasicBlock*, std::vector<Edge>> bb_preds_;
302 std::unordered_map<BasicBlock*, std::vector<Edge>> bb_succs_;
305 std::set<Edge> executable_edges_;
|
| /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
249 bool MarkEdgeExecutable(const Edge& edge) { in MarkEdgeExecutable()
254 bool IsEdgeExecutable(const Edge& edge) const { in IsEdgeExecutable()
265 void AddControlEdge(const Edge& e);
297 std::unordered_map<BasicBlock*, std::vector<Edge>> bb_preds_;
302 std::unordered_map<BasicBlock*, std::vector<Edge>> bb_succs_;
305 std::set<Edge> executable_edges_;
|
| /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
249 bool MarkEdgeExecutable(const Edge& edge) { in MarkEdgeExecutable()
254 bool IsEdgeExecutable(const Edge& edge) const { in IsEdgeExecutable()
265 void AddControlEdge(const Edge& e);
297 std::unordered_map<BasicBlock*, std::vector<Edge>> bb_preds_;
302 std::unordered_map<BasicBlock*, std::vector<Edge>> bb_succs_;
305 std::set<Edge> executable_edges_;
|
| /external/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 137 class Edge {
142 Edge();
143 explicit Edge(Function &F, Kind K);
144 explicit Edge(Node &N, Kind K);
186 typedef SmallVector<Edge, 4> EdgeVectorT;
187 typedef SmallVectorImpl<Edge> EdgeVectorImplT;
215 void insertEdgeInternal(Function &ChildF, Edge::Kind EK);
218 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);
221 void setEdgeKind(Function &ChildF, Edge::Kind EK);
244 const Edge &operator[](int i) const { return Edges[i]; }
[all …]
|
| /external/llvm-project/llvm/test/tools/llvm-profdata/ |
| D | overlap.test | 9 MAINFUNC: Edge profile overlap: 100.000%
10 MAINFUNC: Edge profile base count sum: 200000
11 MAINFUNC: Edge profile test count sum: 20000
17 OVERLAP: Edge profile overlap: 60.000%
18 OVERLAP: Mismatched count percentage (Edge): 20.000%
19 OVERLAP: Percentage of Edge profile only in test_profile: 20.000%
20 OVERLAP: Edge profile base count sum: 500000
21 OVERLAP: Edge profile test count sum: 50000
|
| /external/rust/crates/plotters-backend/src/rasterizer/ |
| D | polygon.rs | 6 struct Edge { struct
13 impl Edge { impl
14 fn horizontal_sweep(mut from: BackendCoord, mut to: BackendCoord) -> Option<Edge> { in horizontal_sweep() argument
23 Some(Edge { in horizontal_sweep()
31 fn vertical_sweep(from: BackendCoord, to: BackendCoord) -> Option<Edge> { in vertical_sweep() argument
32 Edge::horizontal_sweep((from.1, from.0), (to.1, to.0)) 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
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | MachineDominators.cpp | 101 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
103 MachineBasicBlock *Succ = Edge.ToBB; in applySplitCriticalEdges()
107 if (PredBB == Edge.NewBB) in applySplitCriticalEdges()
137 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
139 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB); in applySplitCriticalEdges()
145 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode); in applySplitCriticalEdges()
|
| /external/llvm-project/llvm/lib/CodeGen/ |
| D | MachineDominators.cpp | 101 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
103 MachineBasicBlock *Succ = Edge.ToBB; in applySplitCriticalEdges()
107 if (PredBB == Edge.NewBB) in applySplitCriticalEdges()
137 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
139 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB); in applySplitCriticalEdges()
145 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode); in applySplitCriticalEdges()
|
| /external/llvm-project/llvm/lib/Target/X86/ |
| D | ImmutableGraph.h | 47 class Edge {
62 const Edge *Edges;
68 const Edge *edges_begin() const { return Edges; } in edges_begin()
73 const Edge *edges_end() const { return (this + 1)->Edges; } in edges_end()
74 ArrayRef<Edge> edges() const { in edges()
80 ImmutableGraph(std::unique_ptr<Node[]> Nodes, std::unique_ptr<Edge[]> Edges, in ImmutableGraph()
94 ArrayRef<Edge> edges() const { return makeArrayRef(Edges.get(), EdgesSize); } in edges()
95 const Edge *edges_begin() const { return edges().begin(); } in edges_begin()
96 const Edge *edges_end() const { return edges().end(); } in edges_end()
106 size_type getEdgeIndex(const Edge &E) const { in getEdgeIndex()
[all …]
|
| /external/rust/crates/bindgen/src/ir/ |
| D | traversal.rs | 15 pub struct Edge { struct
20 impl Edge { argument
22 pub fn new(to: ItemId, kind: EdgeKind) -> Edge { in new() argument
23 Edge { to, kind } in new()
27 impl Into<ItemId> for Edge { implementation
185 fn should_follow(&self, ctx: &BindgenContext, edge: Edge) -> bool; in should_follow()
188 impl TraversalPredicate for for<'a> fn(&'a BindgenContext, Edge) -> bool {
189 fn should_follow(&self, ctx: &BindgenContext, edge: Edge) -> bool { in should_follow()
197 pub fn all_edges(_: &BindgenContext, _: Edge) -> bool { in all_edges()
206 pub fn only_inner_type_edges(_: &BindgenContext, edge: Edge) -> bool { in only_inner_type_edges()
[all …]
|