/external/mockito/cglib-and-asm/src/org/mockito/asm/ |
Edge.java | 33 * An edge in the control flow graph of a method body. See {@link Label Label}.
37 class Edge {
40 * Denotes a normal control flow graph edge.
45 * Denotes a control flow graph edge corresponding to an exception handler.
46 * More precisely any {@link Edge} whose {@link #info} is strictly positive
54 * Information about this control flow graph edge. If
56 * stack size in the basic block from which this edge originates. This size
57 * is equal to the stack size at the "jump" instruction to which this edge
60 * this field is the kind of this control flow graph edge (i.e. NORMAL or
66 * The successor block of the basic block from which this edge originates. [all...] |
/external/guice/extensions/grapher/src/com/google/inject/grapher/ |
Edge.java | 22 * Edge in a guice dependency graph. 27 public abstract class Edge { 31 protected Edge(NodeId fromId, NodeId toId) { 45 if (!(obj instanceof Edge)) { 48 Edge other = (Edge) obj; 57 * Returns a copy of the edge with new node IDs. 61 * @return copy of the edge with the new node IDs 63 public abstract Edge copy(NodeId fromId, NodeId toId);
|
DefaultEdgeCreator.java | 36 * Default edge creator. 42 @Override public Iterable<Edge> getEdges(Iterable<Binding<?>> bindings) { 43 List<Edge> edges = Lists.newArrayList(); 55 extends DefaultBindingTargetVisitor<Object, Collection<Edge>> { 58 * Returns a dependency edge for each {@link Dependency} in the binding. These will be from the 65 private <T extends Binding<?> & HasDependencies> Collection<Edge> newDependencyEdges( 67 ImmutableList.Builder<Edge> builder = ImmutableList.builder(); 79 @Override public Collection<Edge> visit(ConstructorBinding<?> binding) { 88 @Override public Collection<Edge> visit(ConvertedConstantBinding<?> binding) { 89 return ImmutableList.<Edge>of(new BindingEdge(NodeId.newTypeId(binding.getKey()) [all...] |
EdgeCreator.java | 31 Iterable<Edge> getEdges(Iterable<Binding<?>> bindings);
|
BindingEdge.java | 22 * Edge that connects an interface to the type or instance that is bound to implement it. 27 public class BindingEdge extends Edge { 29 * Classification for what kind of binding this edge represents. 67 @Override public Edge copy(NodeId fromId, NodeId toId) {
|
DependencyEdge.java | 23 * Edge from a class or {@link InjectionPoint} to the interface node that will satisfy the 29 public class DependencyEdge extends Edge { 62 @Override public Edge copy(NodeId fromId, NodeId toId) {
|
/external/skia/include/utils/ |
SkBoundaryPatch.h | 19 enum Edge { 25 // Edge index goes clockwise around the boundary, beginning at the "top" 26 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0; 54 virtual SkPoint eval(Edge, SkScalar); 63 virtual SkPoint eval(Edge, SkScalar);
|
/hardware/bsp/intel/peripheral/libupm/src/grove/ |
javaupm_grove.i | 10 %apply int {mraa::Edge}
|
/hardware/bsp/intel/peripheral/libupm/src/ttp223/ |
javaupm_ttp223.i | 10 %apply int {mraa::Edge}
|
ttp223.h | 103 void installISR(mraa::Edge level, IsrCallback *cb); 105 void installISR(mraa::Edge level, void (*isr)(void *), void *arg); 115 void installISR(mraa::Edge level, void (*isr)(void *), void *arg);
|
ttp223.cxx | 63 void TTP223::installISR(mraa::Edge level, IsrCallback *cb) 69 void TTP223::installISR(mraa::Edge level, void (*isr)(void *), void *arg)
|
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/ |
btConvexHullComputer.h | 31 class Edge 51 const Edge* getNextEdgeOfVertex() const // clockwise list of all edges of a vertex 56 const Edge* getNextEdgeOfFace() const // counter-clockwise list of all edges of a face 61 const Edge* getReverseEdge() const 72 btAlignedObjectArray<Edge> edges; 74 // Faces of the convex hull. Each entry is an index into the "edges" array pointing to an edge of the face. Faces are planar n-gons
|
/external/v8/src/compiler/ |
verifier.h | 15 class Edge; 42 // (effect, control or frame state) to be used as an input for {edge}. 43 static void VerifyEdgeInputReplacement(const Edge& edge, 47 static void VerifyEdgeInputReplacement(const Edge& edge,
|
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
nv50_ir_graph.h | 32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get()) 40 class Edge 53 Edge(Node *dst, Node *src, Type kind); 54 ~Edge() { unlink(); } 67 Edge *next[2]; // next edge outgoing/incident from/to origin/target 68 Edge *prev[2]; 79 EdgeIterator(Graph::Edge *first, int dir, bool reverse) 87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]); 95 inline Edge *getEdge() const { return e; [all...] |
nv50_ir_graph.cpp | 53 void Graph::Edge::unlink() 73 const char *Graph::Edge::typeStr() const 95 void Graph::Node::attach(Node *node, Edge::Type kind) 97 Edge *edge = new Edge(this, node, kind); local 101 edge->next[0] = this->out; 102 edge->prev[0] = this->out->prev[0]; 103 edge->prev[0]->next[0] = edge; 356 Graph::Edge *edge; local [all...] |
/hardware/bsp/intel/peripheral/libmraa/examples/java/ |
Isr.java | 26 import mraa.Edge; 45 gpio.isr(Edge.EDGE_RISING, callback);
|
/external/llvm/lib/CodeGen/ |
MachineDominators.cpp | 78 for (CriticalEdge &Edge : CriticalEdgesToSplit) { 80 MachineBasicBlock *Succ = Edge.ToBB; 84 if (PredBB == Edge.NewBB) 100 "critical edge split has more " 114 for (CriticalEdge &Edge : CriticalEdgesToSplit) { 116 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB); 122 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode);
|
/system/update_engine/payload_generator/ |
cycle_breaker.h | 28 // the edge with the least weight is cut. Longer term we may wish to do 46 void BreakCycles(const Graph& graph, std::set<Edge>* out_cut_edges); 62 std::set<Edge> cut_edges_;
|
/external/libgdx/extensions/gdx-bullet/jni/swig-src/linearmath/com/badlogic/gdx/physics/bullet/linearmath/ |
btConvexHullComputer.java | 60 static public class Edge extends BulletBase { 63 protected Edge(final String className, long cPtr, boolean cMemoryOwn) { 68 /** Construct a new Edge, normally you should not need this constructor it's intended for low-level usage. */ 69 public Edge(long cPtr, boolean cMemoryOwn) { 70 this("Edge", cPtr, cMemoryOwn); 81 public static long getCPtr(Edge obj) { 111 public btConvexHullComputer.Edge getNextEdgeOfVertex() { 113 return (cPtr == 0) ? null : new btConvexHullComputer.Edge(cPtr, false); 116 public btConvexHullComputer.Edge getNextEdgeOfFace() { 118 return (cPtr == 0) ? null : new btConvexHullComputer.Edge(cPtr, false) [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge; 31 typedef std::pair<Edge, double> EdgeWeight; 34 typedef std::vector<Edge> MaxSpanTree; 50 // Equal edge weights: break ties by comparing block sizes. 80 Edge e = (*EWi).first; 89 Edge e = (*EWi).first; 93 // So we know now that the edge is not already in a subtree, so we push 94 // the edge to the MST.
|
/external/llvm/lib/Analysis/ |
CFLAliasAnalysis.cpp | 16 // memory location, and each edge is an action that happened on that memory 21 // the edge labels (actions) conforms to a context-free grammar. 122 // The edge used when we have an edge going from some handle to a Value. 128 // The edge used when our edge goes from a value to a handle that may have 136 struct Edge { 137 // \brief Which value the edge is coming from 140 // \brief Which value the edge is pointing to 143 // \brief Edge weigh [all...] |
/hardware/bsp/intel/peripheral/libupm/src/mpu9150/ |
javaupm_mpu9150.i | 12 %apply int {mraa::Edge};
|
/external/libgdx/extensions/gdx-box2d/gdx-box2d/src/com/badlogic/gdx/physics/box2d/ |
Shape.java | 33 Circle, Edge, Polygon, Chain,
|
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/com/badlogic/gdx/physics/box2d/ |
Shape.java | 28 Circle, Polygon, Edge, Chain,
|
/external/v8/tools/turbolizer/ |
edge.js | 11 var Edge = function(target, index, source, type) { 20 Edge.prototype.stringID = function() { 24 Edge.prototype.isVisible = function() { 28 Edge.prototype.getInputHorizontalPosition = function(graph) { 48 Edge.prototype.generatePath = function(graph) { 75 Edge.prototype.isBackEdge = function() {
|