Home
last modified time | relevance | path

Searched refs:Edge (Results 1 – 25 of 122) sorted by relevance

12345

/external/guice/extensions/grapher/src/com/google/inject/grapher/
DDefaultEdgeCreator.java42 @Override public Iterable<Edge> getEdges(Iterable<Binding<?>> bindings) { in getEdges()
43 List<Edge> edges = Lists.newArrayList(); in getEdges()
55 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()
79 @Override public Collection<Edge> visit(ConstructorBinding<?> binding) { in visit()
88 @Override public Collection<Edge> visit(ConvertedConstantBinding<?> binding) { in visit()
89 return ImmutableList.<Edge>of(new BindingEdge(NodeId.newTypeId(binding.getKey()), in visit()
100 @Override public Collection<Edge> visit(InstanceBinding<?> binding) { in visit()
101 return new ImmutableList.Builder<Edge>() in visit()
[all …]
DEdge.java27 public abstract class Edge { class
31 protected Edge(NodeId fromId, NodeId toId) { in Edge() method in Edge
45 if (!(obj instanceof Edge)) { in equals()
48 Edge other = (Edge) obj; in equals()
63 public abstract Edge copy(NodeId fromId, NodeId toId); in copy()
/external/mesa3d/src/gallium/drivers/nv50/codegen/
Dnv50_ir_graph.h32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get())
40 class Edge
53 Edge(Node *dst, Node *src, Type kind);
54 ~Edge() { unlink(); } in ~Edge()
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) in EdgeIterator()
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]); in next()
95 inline Edge *getEdge() const { return e; } in getEdge()
96 inline Edge::Type getType() { return e ? e->getType() : Edge::UNKNOWN; } in getType()
[all …]
Dnv50_ir_graph.cpp53 void Graph::Edge::unlink() in unlink()
73 const char *Graph::Edge::typeStr() const in typeStr()
95 void Graph::Node::attach(Node *node, Edge::Type kind) in attach()
97 Edge *edge = new Edge(this, node, kind); in attach()
125 if (kind == Edge::UNKNOWN) in attach()
158 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) in Edge() function in nv50_ir::Graph::Edge
187 if (ei.getType() == Edge::BACK || ei.getType() == Edge::DUMMY) in reachableBy()
299 case Graph::Edge::TREE: in search()
300 case Graph::Edge::FORWARD: in search()
301 case Graph::Edge::DUMMY: in search()
[all …]
/external/opencv/cvaux/src/
Denmin.cpp86 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* )tempEdgePtr ) -> destVtx =
266 ( ( Edge* )newEdgePtr ) -> weight +=
[all …]
/external/llvm/lib/Analysis/
DCFLAliasAnalysis.cpp136 struct Edge { struct
151 Edge(Value *From, Value *To, EdgeType W, StratifiedAttrs A) in Edge() argument
158 SmallVectorImpl<Edge> &Output;
161 GetEdgesVisitor(CFLAAResult &AA, SmallVectorImpl<Edge> &Output) in GetEdgesVisitor()
170 Output.push_back(Edge(Ptr, Ptr, EdgeType::Assign, AttrUnknown)); in visitPtrToIntInst()
175 Output.push_back(Edge(Ptr, Ptr, EdgeType::Assign, AttrUnknown)); in visitIntToPtrInst()
180 Edge(&Inst, Inst.getOperand(0), EdgeType::Assign, AttrNone)); in visitCastInst()
186 Output.push_back(Edge(&Inst, Op1, EdgeType::Assign, AttrNone)); in visitBinaryOperator()
187 Output.push_back(Edge(&Inst, Op2, EdgeType::Assign, AttrNone)); in visitBinaryOperator()
193 Output.push_back(Edge(Ptr, Val, EdgeType::Dereference, AttrNone)); in visitAtomicCmpXchgInst()
[all …]
/external/skia/src/gpu/
DGrTessellator.cpp93 struct Edge;
151 Edge* fFirstEdgeAbove; // Linked list of edges above this vertex.
152 Edge* fLastEdgeAbove; // "
153 Edge* fFirstEdgeBelow; // Linked list of edges below this vertex.
154 Edge* fLastEdgeBelow; // "
209 Edge* fHead;
210 Edge* fTail;
231 struct Edge { struct
232 Edge(Vertex* top, Vertex* bottom, int winding) in Edge() function
249 Edge* fLeft; // The linked list of edges in the active edge list. argument
[all …]
/external/skia/src/core/
DSkRegion_path.cpp380 struct Edge { struct
391 Edge* fNext; argument
408 static void find_link(Edge* base, Edge* stop) { in find_link() argument
411 if (base->fFlags == Edge::kCompleteLink) { in find_link()
421 Edge* e = base; in find_link()
422 if ((base->fFlags & Edge::kY0Link) == 0) { in find_link()
425 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { in find_link()
428 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); in find_link()
435 if ((base->fFlags & Edge::kY1Link) == 0) { in find_link()
438 if ((e->fFlags & Edge::kY0Link) == 0 && y1 == e->fY0) { in find_link()
[all …]
/external/libgdx/extensions/gdx-bullet/jni/swig-src/linearmath/com/badlogic/gdx/physics/bullet/linearmath/
DbtConvexHullComputer.java60 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
81 public static long getCPtr(Edge obj) { in getCPtr()
111 public btConvexHullComputer.Edge getNextEdgeOfVertex() { in getNextEdgeOfVertex()
113 return (cPtr == 0) ? null : new btConvexHullComputer.Edge(cPtr, false); in getNextEdgeOfVertex()
116 public btConvexHullComputer.Edge getNextEdgeOfFace() { in getNextEdgeOfFace()
118 return (cPtr == 0) ? null : new btConvexHullComputer.Edge(cPtr, false); in getNextEdgeOfFace()
121 public btConvexHullComputer.Edge getReverseEdge() { in getReverseEdge()
123 return (cPtr == 0) ? null : new btConvexHullComputer.Edge(cPtr, false); in getReverseEdge()
[all …]
/external/llvm/lib/CodeGen/
DMachineDominators.cpp78 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
80 MachineBasicBlock *Succ = Edge.ToBB; in applySplitCriticalEdges()
84 if (PredBB == Edge.NewBB) in applySplitCriticalEdges()
114 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
116 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB); in applySplitCriticalEdges()
122 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode); in applySplitCriticalEdges()
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/
DbtConvexHullComputer.cpp428 class Edge;
436 Edge* edges;
507 class Edge class in btConvexHullInternal
510 Edge* next;
511 Edge* prev;
512 Edge* reverse;
517 ~Edge() in ~Edge()
526 void link(Edge* n) in link()
763 Pool<Edge> edgePool;
773 …static Orientation getOrientation(const Edge* prev, const Edge* next, const Point32& s, const Poin…
[all …]
DbtConvexHullComputer.h31 class Edge
51 const Edge* getNextEdgeOfVertex() const // clockwise list of all edges of a vertex in getNextEdgeOfVertex()
56 const Edge* getNextEdgeOfFace() const // counter-clockwise list of all edges of a face in getNextEdgeOfFace()
61 const Edge* getReverseEdge() const in getReverseEdge()
72 btAlignedObjectArray<Edge> edges;
/external/v8/tools/turbolizer/
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) {
75 Edge.prototype.isBackEdge = function() {
/external/skia/include/utils/
DSkBoundaryPatch.h19 enum Edge { enum
26 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0;
54 virtual SkPoint eval(Edge, SkScalar);
63 virtual SkPoint eval(Edge, SkScalar);
/external/v8/src/compiler/
Dnode.h18 class Edge; variable
112 typedef Edge value_type;
148 typedef Edge value_type;
322 friend class Edge; variable
350 class Edge final {
360 bool operator==(const Edge& other) { return input_ptr_ == other.input_ptr_; }
361 bool operator!=(const Edge& other) { return !(*this == other); }
376 Edge(Node::Use* use, Node** input_ptr) : use_(use), input_ptr_(input_ptr) { in Edge() function
392 typedef Edge value_type;
393 typedef Edge* pointer;
[all …]
Dnode-properties.h52 static bool IsValueEdge(Edge edge);
53 static bool IsContextEdge(Edge edge);
54 static bool IsFrameStateEdge(Edge edge);
55 static bool IsEffectEdge(Edge edge);
56 static bool IsControlEdge(Edge edge);
163 static inline bool IsInputRange(Edge edge, int first, int count);
Dverifier.h15 class Edge; variable
43 static void VerifyEdgeInputReplacement(const Edge& edge,
47 static void VerifyEdgeInputReplacement(const Edge& edge, in VerifyEdgeInputReplacement()
Dnode-properties.cc86 bool NodeProperties::IsValueEdge(Edge edge) { in IsValueEdge()
94 bool NodeProperties::IsContextEdge(Edge edge) { in IsContextEdge()
102 bool NodeProperties::IsFrameStateEdge(Edge edge) { in IsFrameStateEdge()
110 bool NodeProperties::IsEffectEdge(Edge edge) { in IsEffectEdge()
118 bool NodeProperties::IsControlEdge(Edge edge) { in IsControlEdge()
128 for (Edge const edge : node->use_edges()) { in IsExceptionalCall()
209 for (Edge edge : node->use_edges()) { in ReplaceUses()
271 for (Edge const edge : node->use_edges()) { in CollectControlProjections()
427 bool NodeProperties::IsInputRange(Edge edge, int first, int num) { in IsInputRange()
/external/llvm/lib/Transforms/Instrumentation/
DMaximumSpanningTree.h30 typedef std::pair<const T*, const T*> Edge; typedef
31 typedef std::pair<Edge, double> EdgeWeight;
34 typedef std::vector<Edge> MaxSpanTree;
80 Edge e = (*EWi).first; in MaximumSpanningTree()
89 Edge e = (*EWi).first; in MaximumSpanningTree()
DCFGMST.h36 template <class Edge, class BBInfo> class CFGMST {
42 std::vector<std::unique_ptr<Edge>> AllEdges;
134 [](const std::unique_ptr<Edge> &Edge1, in sortEdgesByWeight()
135 const std::unique_ptr<Edge> &Edge2) { in sortEdgesByWeight()
185 Edge &addEdge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W) { in addEdge()
199 AllEdges.emplace_back(new Edge(Src, Dest, W)); in addEdge()
/external/guice/extensions/grapher/test/com/google/inject/grapher/
DAbstractInjectorGrapherTest.java49 final Set<Edge> edges = Sets.newHashSet();
134 Set<Edge> expectedEdges = ImmutableSet.<Edge>of( in testLinkedAndInstanceBindings()
159 Set<Edge> expectedEdges = ImmutableSet.<Edge>of( in testProviderBindings()
179 Set<Edge> expectedEdges = ImmutableSet.<Edge>of( in testGraphWithGivenRoot()
/external/llvm/lib/IR/
DGCOV.cpp184 GCOVEdge *Edge = Edges.back().get(); in readGCNO() local
185 Blocks[BlockNo]->addDstEdge(Edge); in readGCNO()
186 Blocks[Dst]->addSrcEdge(Edge); in readGCNO()
404 for (const GCOVEdge *Edge : SrcEdges) in dump() local
405 dbgs() << Edge->Src.Number << " (" << Edge->Count << "), "; in dump()
410 for (const GCOVEdge *Edge : DstEdges) in dump() local
411 dbgs() << Edge->Dst.Number << " (" << Edge->Count << "), "; in dump()
721 for (const GCOVEdge *Edge : Block.dsts()) { in printBranchInfo() local
722 BranchCounts.push_back(Edge->Count); in printBranchInfo()
723 TotalCounts += Edge->Count; in printBranchInfo()
[all …]
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/
DbtAxisSweep3.h47 class Edge
85 …Edge* m_pEdges[3]; // edge arrays for the 3 axes (each array has m_maxHandles * 2 + 2 sentine…
217 Edge* pEdge = m_pEdges[axis] + i; in debugPrintAxis()
407 m_pEdgesRawPtr[i] = btAlignedAlloc(sizeof(Edge)*maxHandles*2,16); in btAxisSweep3Internal()
408 m_pEdges[i] = new(m_pEdgesRawPtr[i]) Edge[maxHandles * 2]; in btAxisSweep3Internal()
587 Edge* pEdges = m_pEdges[axis]; in removeHandle()
810 Edge* pEdge = m_pEdges[axis] + edge; in sortMinDown()
811 Edge* pPrev = pEdge - 1; in sortMinDown()
842 Edge swap = *pEdge; in sortMinDown()
861 Edge* pEdge = m_pEdges[axis] + edge; in sortMinUp()
[all …]
/external/mockito/cglib-and-asm/src/org/mockito/asm/
DLabel.java226 Edge successors;
486 Edge e = new Edge(); in visitSubroutine()
502 Edge e = successors; in visitSubroutine()
DEdge.java37 class Edge { class
74 Edge next;

12345