Searched refs:Edge (Results 1 - 25 of 142) sorted by relevance

123456

/external/guice/extensions/grapher/src/com/google/inject/grapher/
H A DEdge.java22 * Edge in a guice dependency graph.
27 public abstract class Edge { class
31 protected Edge(NodeId fromId, NodeId toId) { method in class:Edge
45 if (!(obj instanceof Edge)) {
48 Edge other = (Edge) obj;
63 public abstract Edge copy(NodeId fromId, NodeId toId);
H A DDefaultEdgeCreator.java42 @Override public Iterable<Edge> getEdges(Iterable<Binding<?>> bindings) {
43 List<Edge> edges = Lists.newArrayList();
55 extends DefaultBindingTargetVisitor<Object, Collection<Edge>> {
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()),
100 @Override public Collection<Edge> visit(InstanceBinding<?> binding) {
101 return new ImmutableList.Builder<Edge>()
[all...]
H A DEdgeCreator.java31 Iterable<Edge> getEdges(Iterable<Binding<?>> bindings);
H A DBindingEdge.java22 * Edge that connects an interface to the type or instance that is bound to implement it.
27 public class BindingEdge extends Edge {
67 @Override public Edge copy(NodeId fromId, NodeId toId) {
H A DDependencyEdge.java23 * 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/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.h32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
40 class Edge class in class:nv50_ir::Graph
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; }
96 inline Edge
[all...]
H A Dnv50_ir_graph.cpp53 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);
125 if (kind == Edge::UNKNOWN)
158 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) function in class:nv50_ir::Graph::Edge
187 if (ei.getType() == Edge::BACK || ei.getType() == Edge
[all...]
/external/pdfium/xfa/fxfa/parser/
H A Dcxfa_line.cpp20 return CXFA_Edge(m_pNode->GetChild(0, XFA_Element::Edge));
/external/v8/src/compiler/
H A Dverifier.h16 class Edge;
44 static void VerifyEdgeInputReplacement(const Edge& edge,
48 static void VerifyEdgeInputReplacement(const Edge& edge,
H A Dnode-properties.h51 // Edge kinds.
53 static bool IsValueEdge(Edge edge);
54 static bool IsContextEdge(Edge edge);
55 static bool IsFrameStateEdge(Edge edge);
56 static bool IsEffectEdge(Edge edge);
57 static bool IsControlEdge(Edge edge);
152 static inline bool IsInputRange(Edge edge, int first, int count);
/external/skia/src/gpu/
H A DGrTessellator.cpp98 struct Edge;
158 Edge* fFirstEdgeAbove; // Linked list of edges above this vertex.
159 Edge* fLastEdgeAbove; // "
160 Edge* fFirstEdgeBelow; // Linked list of edges below this vertex.
161 Edge* fLastEdgeBelow; // "
311 * An Edge joins a top Vertex to a bottom Vertex. Edge ordering for the list of "edges above" and
313 * Note that an Edge will give occasionally dist() != 0 for its own endpoints (because floating
328 struct Edge { struct in namespace:__anon17043
330 Edge(Verte function in struct:__anon17043::Edge
[all...]
/external/v8/tools/clang/blink_gc_plugin/
H A DEdge.h16 class Edge;
60 typedef std::deque<Edge*> Context;
62 Edge* Parent() { return context_.empty() ? 0 : context_.front(); }
63 void Enter(Edge* e) { return context_.push_front(e); }
83 class Edge { class
88 virtual ~Edge() {}
107 class Value : public Edge {
122 class PtrEdge : public Edge {
125 Edge* ptr() { return ptr_; }
127 PtrEdge(Edge* pt
[all...]
/external/pdfium/xfa/fwl/
H A Dfwl_widgethit.h28 Edge, member in class:FWL_WidgetHit
/external/llvm/lib/CodeGen/
H A DMachineDominators.cpp94 for (CriticalEdge &Edge : CriticalEdgesToSplit) {
96 MachineBasicBlock *Succ = Edge.ToBB;
100 if (PredBB == Edge.NewBB)
130 for (CriticalEdge &Edge : CriticalEdgesToSplit) {
132 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB);
138 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode);
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
H A DProfileInfo.h57 typedef std::pair<const BType*, const BType*> Edge; typedef in class:llvm::ProfileInfoT
58 typedef std::pair<Edge, double> EdgeWeight;
59 typedef std::map<Edge, double> EdgeWeights;
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 {
124 void setEdgeWeight(Edge
[all...]
H A DBranchProbabilityInfo.h36 typedef std::pair<const BasicBlock *, const BasicBlock *> Edge; typedef in class:llvm::BranchProbabilityInfo
38 DenseMap<Edge, uint32_t> Weights;
/external/v8/tools/turbolizer/
H A Dedge.js11 var Edge = function(target, index, source, type) { class
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/
H A DProfileEstimatorPass.cpp38 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 << ":"
134 Edge edge = getEdge(*bbi,BB);
158 SmallVector<Edge, 8> ExitEdges;
159 SmallVector<Edge, 8> Edges;
183 std::set<Edge> ProcessedExit
[all...]
H A DProfileInfoLoaderPass.cpp42 std::set<Edge> SpanningTree;
64 virtual void readEdgeOrRemember(Edge, Edge&, unsigned &, double &);
65 virtual void readEdge(ProfileInfo::Edge, std::vector<unsigned>&);
97 void LoaderPass::readEdgeOrRemember(Edge edge, Edge &tocalc,
126 Edge tocalc;
132 void LoaderPass::readEdge(ProfileInfo::Edge e,
143 DEBUG(dbgs() << "--Read Edge Counter for " << e
200 for (std::set<Edge>
[all...]
H A DProfileInfo.cpp75 Edge e = getEdge(0, BB);
102 Edge e = getEdge(BB,0);
183 void ProfileInfoT<Function,BasicBlock>::addEdgeWeight(Edge e, double w) {
185 assert (oldw != MissingValue && "Adding weight to Edge with no previous weight");
186 DEBUG(dbgs() << "Adding to Edge " << e
212 void ProfileInfoT<Function,BasicBlock>::removeEdge(Edge e) {
223 replaceEdge(const Edge &oldedge, const Edge &newedge) {
260 Edge e = getEdge(BB,*Succ);
282 divertFlow(const Edge
[all...]
/external/opencv/cvaux/src/
H A Denmin.cpp81 // struct Edge is used for storing edges of graph
86 struct Edge
198 getSizeForGraph( Edge ),
233 ( ( Edge* )newEdgePtr ) -> weight = dFunc( leftLine,
238 ( ( Edge* )newEdgePtr ) -> flow = 0;
245 ( ( Edge* )newEdgePtr ) -> weight +=
252 ( ( Edge* )tempEdgePtr ) -> weight = vFunc( alpha, beta );
253 ( ( Edge* )tempEdgePtr ) -> flow = 0;
254 ( ( Edge* )tempEdgePtr ) -> srcVtx =
256 ( ( Edge* )tempEdgePt
[all...]
/external/llvm/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h30 typedef std::pair<const T*, const T*> Edge; typedef in class:llvm::MaximumSpanningTree
31 typedef std::pair<Edge, double> EdgeWeight;
34 typedef std::vector<Edge> MaxSpanTree;
80 Edge e = (*EWi).first;
89 Edge e = (*EWi).first;
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/
H A DMaximumSpanningTree.h54 typedef std::pair<const T*, const T*> Edge; typedef in class:llvm::MaximumSpanningTree
55 typedef std::pair<Edge, double> EdgeWeight;
58 typedef std::vector<Edge> MaxSpanTree;
77 Edge e = (*EWi).first;
86 Edge e = (*EWi).first;
/external/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h137 class Edge { class in class:llvm::LazyCallGraph
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
912 inline LazyCallGraph::Edge::Edge() : Value() {} function in class:llvm::LazyCallGraph::LazyCallGraph::Edge
913 inline LazyCallGraph::Edge::Edge(Function &F, Kind K) : Value(&F, K) {} function in class:llvm::LazyCallGraph::LazyCallGraph::Edge
914 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} function in class:llvm::LazyCallGraph::LazyCallGraph::Edge
[all...]
/external/skia/src/core/
H A DSkRegion_path.cpp383 struct Edge { struct
394 Edge* fNext;
411 static void find_link(Edge* base, Edge* stop) {
414 if (base->fFlags == Edge::kCompleteLink) {
424 Edge* e = base;
425 if ((base->fFlags & Edge::kY0Link) == 0) {
428 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) {
431 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link);
438 if ((base->fFlags & Edge
412 SkASSERT(base < stop); if (base->fFlags == Edge::kCompleteLink) argument
[all...]

Completed in 583 milliseconds

123456