| /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) {
|
| /device/linaro/bootloader/edk2/Vlv2DeviceRefCodePkg/AcpiTablesPCAT/ |
| IoTVirtualDevice.asl | 66 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO2",) {0}
71 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO2",) {1}
76 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO2",) {2}
98 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {62}
103 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {63}
108 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {65}
113 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {64}
118 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {94}
123 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {95}
128 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {54}
[all...] |
| RhProxy.asl | 78 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO2",) {0}
83 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO2",) {1}
88 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO2",) {2}
110 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {62}
115 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {63}
120 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {65}
125 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {64}
130 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {94}
135 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {95}
140 GpioInt(Edge, ActiveBoth, SharedAndWake, PullNone, 0,"\\_SB.GPO0",) {54}
[all...] |
| /external/v8/src/compiler/ |
| verifier.h | 16 class Edge;
43 // (effect, control or frame state) to be used as an input for {edge}.
44 static void VerifyEdgeInputReplacement(const Edge& edge,
48 static void VerifyEdgeInputReplacement(const Edge& edge,
|
| /external/mesa3d/src/gallium/drivers/nouveau/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;
366 Graph::Edge *edge; local
[all...] |
| /external/pdfium/xfa/fxfa/parser/ |
| cxfa_line.cpp | 20 return CXFA_Edge(m_pNode->GetChild(0, XFA_Element::Edge));
|
| /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/v8/tools/clang/blink_gc_plugin/ |
| Edge.h | 16 class Edge;
46 // Recursive edge visitor. The traversed path is accessible in context.
63 typedef std::deque<Edge*> Context;
65 Edge* Parent() { return context_.empty() ? 0 : context_.front(); }
66 void Enter(Edge* e) { return context_.push_front(e); }
87 class Edge {
92 virtual ~Edge() {}
110 // A value edge is a direct edge to some type, eg, part-object edges.
111 class Value : public Edge {
[all...] |
| /external/pdfium/xfa/fwl/ |
| fwl_widgethit.h | 28 Edge,
|
| /external/skia/src/gpu/ |
| GrTessellator.cpp | 42 * Stages (4) and (5) use an active edge list -- a list of all edges for which the
51 * not exact and may violate the mesh topology or active edge list ordering. We
55 * A) Intersections may cause a shortened edge to no longer be ordered with respect to its
58 * B) Intersections may cause an edge to violate the left-to-right ordering of the
59 * active edge list. This is handled by detecting potential violations and rewinding
60 * the active edge list to the vertex before they occur (rewind() during merging,
65 * currently uses a linked list for the active edge list, rather than a 2-3 tree as the
70 * are O(1), since we know the adjacent edge in the active edge list based on the topology.
96 struct Edge;
1041 Edge* edge = new_edge(prev, next, type, c, alloc); local
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineDominators.cpp | 94 for (CriticalEdge &Edge : CriticalEdgesToSplit) {
96 MachineBasicBlock *Succ = Edge.ToBB;
100 if (PredBB == Edge.NewBB)
116 "critical edge split has more "
130 for (CriticalEdge &Edge : CriticalEdgesToSplit) {
132 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB);
138 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode);
|
| /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/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| ProfileInfo.h | 57 typedef std::pair<const BType*, const BType*> Edge;
58 typedef std::pair<Edge, double> EdgeWeight;
59 typedef std::map<Edge, double> EdgeWeights;
65 // blocks is executed. As a special case, we also hold an edge from the
86 // getFunction() - Returns the Function for an Edge, checking for validity.
87 static const FType* getFunction(Edge e) {
93 assert(0 && "Invalid ProfileInfo::Edge");
97 // getEdge() - Creates an Edge from two BasicBlocks.
98 static Edge getEdge(const BType *Src, const BType *Dest) {
113 double getEdgeWeight(Edge e) const
[all...] |
| BranchProbabilityInfo.h | 28 // Default weight value. Used when we don't have information about the edge.
31 // weight to an edge that may have siblings with non-zero weights. This can
32 // be handled various ways, but it's probably fine for an edge with unknown
36 typedef std::pair<const BasicBlock *, const BasicBlock *> Edge;
38 DenseMap<Edge, uint32_t> Weights;
62 // A 'Hot' edge is an edge which probability is >= 80%.
|
| /external/r8/src/main/java/com/android/tools/r8/ir/optimize/ |
| InliningInfo.java | 17 static class Edge {
22 public Edge(Type type, DexMethod declared, Node inlinee) {
68 final List<Edge> edges = new ArrayList<>();
75 edges.add(new Edge(type, target.method, new Inlining(target)));
79 edges.add(new Edge(invoke.getType(), invoke.getInvokedMethod(), new NotInlining(reason)));
85 for (Edge edge : edges) {
87 edge.appendOn(buffer);
|
| /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) {
77 Edge.prototype.isBackEdge = function() {
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| ProfileEstimatorPass.cpp | 38 std::map<Edge,double> MinimalWeight;
71 void inline printEdgeWeight(Edge);
101 static void inline printEdgeError(ProfileInfo::Edge e, const char *M) {
102 DEBUG(dbgs() << "-- Edge " << e << " is not calculated, " << M << "\n");
105 void inline ProfileEstimatorPass::printEdgeWeight(Edge E) {
106 DEBUG(dbgs() << "-- Weight of Edge " << E << ":"
116 // flow, once an edge has a flow assigned this flow is never changed again,
134 Edge edge = getEdge(*bbi,BB); local
135 double w = getEdgeWeight(edge);
205 Edge edge = getEdge(Latch,0); local
267 Edge edge = getEdge(BB,0); local
273 Edge edge = getEdge(BB,*bbi); local
341 Edge edge = getEdge(0,entry); local
[all...] |
| /external/opencv/cvaux/src/ |
| enmin.cpp | 81 // struct Edge is used for storing edges of graph
82 // weight - weight of the edge ( maximum flow via the edge )
83 // flow - current flow via the edge
86 struct Edge
198 getSizeForGraph( Edge ),
231 /* adding edge oriented from alpha vertex to current vertex */
233 ( ( Edge* )newEdgePtr ) -> weight = dFunc( leftLine,
238 ( ( Edge* )newEdgePtr ) -> flow = 0;
245 ( ( Edge* )newEdgePtr ) -> weight +
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
| MaximumSpanningTree.h | 54 typedef std::pair<const T*, const T*> Edge;
55 typedef std::pair<Edge, double> EdgeWeight;
58 typedef std::vector<Edge> MaxSpanTree;
77 Edge e = (*EWi).first;
86 Edge e = (*EWi).first;
90 // So we know now that the edge is not already in a subtree, so we push
91 // the edge to the MST.
|
| /external/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 28 /// potential-call-edge graph.
64 /// by an edge in the graph, do not invalidate a bottom-up traversal of the SCC
65 /// DAG. That is, no optimizations will delete, remove, or add an edge such
79 /// an indirect call edge. Another way to think about it is that it represents
82 /// of a function to be an edge in the call graph because this might be
91 /// form even a potential call edge from a function body which may dynamically
135 /// node. This allows the edge structure itself to be a very compact data
137 class Edge {
139 /// The kind of edge in the graph.
142 Edge();
[all...] |
