| /external/skia/src/core/ |
| D | SkRegion_path.cpp | 380 struct Edge { struct
391 Edge* fNext; argument
408 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/libgdx/extensions/gdx-bullet/jni/swig-src/linearmath/com/badlogic/gdx/physics/bullet/linearmath/ |
| D | btConvexHullComputer.java | 60 static public class Edge extends BulletBase { class in btConvexHullComputer
63 protected Edge(final String className, long cPtr, boolean cMemoryOwn) { in Edge() method in btConvexHullComputer.Edge
69 public Edge(long cPtr, boolean cMemoryOwn) { in Edge() method in btConvexHullComputer.Edge
126 public Edge() { in Edge() method in btConvexHullComputer.Edge
|
| /external/skia/src/gpu/ |
| D | GrTessellator.cpp | 231 struct Edge { struct
232 Edge(Vertex* top, Vertex* bottom, int winding) in Edge() argument
246 int fWinding; // 1 == edge goes downward; -1 = edge goes upward.
247 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt).
248 Vertex* fBottom; // The bottom vertex in vertex-sort-order.
249 Edge* fLeft; // The linked list of edges in the active edge list.
250 Edge* fRight; // "
251 Edge* fPrevEdgeAbove; // The linked list of edges in the bottom Vertex's "edges above".
252 Edge* fNextEdgeAbove; // "
253 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 | 136 struct Edge { struct
138 Value *From;
141 Value *To;
144 EdgeType Weight;
149 StratifiedAttrs AdditionalAttrs;
151 Edge(Value *From, Value *To, EdgeType W, StratifiedAttrs A) in Edge() argument
504 struct Edge { struct in __anon9e0591c90111::WeightedBidirectionalGraph
505 EdgeTypeT Weight;
506 Node Other;
508 Edge(const EdgeTypeT &W, const Node &N) : Weight(W), Other(N) {} in Edge() argument
[all …]
|
| /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/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/com/badlogic/gdx/physics/box2d/ |
| D | Shape.java | 28 Circle, Polygon, Edge, Chain, enumConstant
|
| /external/v8/src/compiler/ |
| D | verifier.h | 15 class Edge; variable
|
| D | node.h | 18 class Edge; variable
322 friend class Edge; variable
376 Edge(Node::Use* use, Node** input_ptr) : use_(use), input_ptr_(input_ptr) { in Edge() function
|
| /external/libgdx/extensions/gdx-bullet/jni/swig-src/collision/com/badlogic/gdx/physics/bullet/collision/ |
| D | btAxisSweep3InternalInt.java | 61 static public class Edge extends BulletBase { class in btAxisSweep3InternalInt
64 protected Edge(final String className, long cPtr, boolean cMemoryOwn) { in Edge() method in btAxisSweep3InternalInt.Edge
70 public Edge(long cPtr, boolean cMemoryOwn) { in Edge() method in btAxisSweep3InternalInt.Edge
124 public Edge() { in Edge() method in btAxisSweep3InternalInt.Edge
|
| D | btAxisSweep3InternalShort.java | 61 static public class Edge extends BulletBase { class in btAxisSweep3InternalShort
64 protected Edge(final String className, long cPtr, boolean cMemoryOwn) { in Edge() method in btAxisSweep3InternalShort.Edge
70 public Edge(long cPtr, boolean cMemoryOwn) { in Edge() method in btAxisSweep3InternalShort.Edge
124 public Edge() { in Edge() method in btAxisSweep3InternalShort.Edge
|
| /external/v8/tools/turbolizer/ |
| D | edge.js | 11 var Edge = function(target, index, source, type) { class
|
| /external/llvm/include/llvm/Analysis/ |
| D | BranchProbabilityInfo.h | 128 typedef std::pair<const BasicBlock *, unsigned> Edge; typedef
|
| D | SparsePropagation.h | 128 typedef std::pair<BasicBlock*,BasicBlock*> Edge; typedef
|
| D | LoopInfo.h | 222 typedef std::pair<const BlockT*, const BlockT*> Edge; typedef
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/src/com/badlogic/gdx/physics/box2d/ |
| D | Shape.java | 33 Circle, Edge, Polygon, Chain, enumConstant
|
| /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/llvm/lib/Transforms/Instrumentation/ |
| D | MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge; typedef
|
| D | GCOVProfiling.cpp | 607 unsigned Edge = 0; in emitProfileArcs() local
729 unsigned Edge = 0; in buildEdgeLookupTable() local
|
| /external/llvm/include/llvm/Support/ |
| D | GCOV.h | 324 void addSrcEdge(GCOVEdge *Edge) { in addSrcEdge()
328 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 | 539 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) { in BreakAntiDependencies() local
|
| D | AggressiveAntiDepBreaker.cpp | 830 const SDep *Edge = Edges[i]; in BreakAntiDependencies() local
|