| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| D | DefaultEdgeCreator.java | 43 public Iterable<Edge> getEdges(Iterable<Binding<?>> bindings) { in getEdges()
44 List<Edge> edges = Lists.newArrayList(); in getEdges()
56 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()
80 public Collection<Edge> visit(ConstructorBinding<?> binding) { in visit()
90 public Collection<Edge> visit(ConvertedConstantBinding<?> binding) { in visit()
91 return ImmutableList.<Edge>of( in visit()
105 public Collection<Edge> visit(InstanceBinding<?> binding) { in visit()
106 return new ImmutableList.Builder<Edge>() in visit()
[all …]
|
| D | Edge.java | 27 public abstract class Edge { class
31 protected Edge(NodeId fromId, NodeId toId) { in Edge() method in Edge
46 if (!(obj instanceof Edge)) { in equals()
49 Edge other = (Edge) obj; in equals()
65 public abstract Edge copy(NodeId fromId, NodeId toId); in copy()
|
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| D | 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(); } 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 …]
|
| D | nv50_ir_graph.cpp | 53 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()
302 case Graph::Edge::TREE: in search()
303 case Graph::Edge::FORWARD: in search()
304 case Graph::Edge::DUMMY: in search()
[all …]
|
| /external/skia/src/gpu/ |
| D | GrTessellator.cpp | 102 struct Edge;
163 Edge* fFirstEdgeAbove; // Linked list of edges above this vertex.
164 Edge* fLastEdgeAbove; // "
165 Edge* fFirstEdgeBelow; // Linked list of edges below this vertex.
166 Edge* fLastEdgeBelow; // "
167 Edge* fLeftEnclosingEdge; // Nearest edge in the AEL left of this vertex.
168 Edge* fRightEnclosingEdge; // Nearest edge in the AEL right of this vertex.
340 struct Edge { struct
342 Edge(Vertex* top, Vertex* bottom, int winding, Type type) in Edge() function
369 Edge* fLeft; // The linked list of edges in the active edge list. argument
[all …]
|
| /external/skqp/src/gpu/ |
| D | GrTessellator.cpp | 102 struct Edge;
163 Edge* fFirstEdgeAbove; // Linked list of edges above this vertex.
164 Edge* fLastEdgeAbove; // "
165 Edge* fFirstEdgeBelow; // Linked list of edges below this vertex.
166 Edge* fLastEdgeBelow; // "
167 Edge* fLeftEnclosingEdge; // Nearest edge in the AEL left of this vertex.
168 Edge* fRightEnclosingEdge; // Nearest edge in the AEL right of this vertex.
340 struct Edge { struct
342 Edge(Vertex* top, Vertex* bottom, int winding, Type type) in Edge() function
369 Edge* fLeft; // The linked list of edges in the active edge list. argument
[all …]
|
| /external/v8/tools/clang/blink_gc_plugin/ |
| D | Edge.h | 16 class Edge; variable
60 typedef std::deque<Edge*> Context;
62 Edge* Parent() { return context_.empty() ? 0 : context_.front(); } in Parent()
63 void Enter(Edge* e) { return context_.push_front(e); } in Enter()
83 class Edge {
88 virtual ~Edge() {} in ~Edge()
106 class Value : public Edge {
121 class PtrEdge : public Edge {
124 Edge* ptr() { return ptr_; } in ptr()
126 PtrEdge(Edge* ptr) : ptr_(ptr) { in PtrEdge()
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| D | ProfileEstimatorPass.cpp | 38 std::map<Edge,double> MinimalWeight;
71 void inline printEdgeWeight(Edge);
101 static void inline printEdgeError(ProfileInfo::Edge e, const char *M) { in printEdgeError()
105 void inline ProfileEstimatorPass::printEdgeWeight(Edge E) { in printEdgeWeight()
134 Edge edge = getEdge(*bbi,BB); in recurseBasicBlock()
158 SmallVector<Edge, 8> ExitEdges; in recurseBasicBlock()
159 SmallVector<Edge, 8> Edges; in recurseBasicBlock()
183 std::set<Edge> ProcessedExits; in recurseBasicBlock()
184 for (SmallVector<Edge, 8>::iterator ei = ExitEdges.begin(), in recurseBasicBlock()
205 Edge edge = getEdge(Latch,0); in recurseBasicBlock()
[all …]
|
| D | ProfileInfo.cpp | 75 Edge e = getEdge(0, BB); in getExecutionCount()
102 Edge e = getEdge(BB,0); in getExecutionCount()
183 void ProfileInfoT<Function,BasicBlock>::addEdgeWeight(Edge e, double w) { in addEdgeWeight()
212 void ProfileInfoT<Function,BasicBlock>::removeEdge(Edge e) { in removeEdge()
223 replaceEdge(const Edge &oldedge, const Edge &newedge) { in replaceEdge()
260 Edge e = getEdge(BB,*Succ); in GetPath()
282 divertFlow(const Edge &oldedge, const Edge &newedge) { in divertFlow()
300 Edge e = getEdge(Parent,BB); in divertFlow()
325 Edge e, newedge; in replaceAllUses()
352 Edge newedge = getEdge(DestBB, DestBB); in replaceAllUses()
[all …]
|
| D | ProfileInfoLoaderPass.cpp | 42 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, in readEdgeOrRemember()
126 Edge tocalc; in recurseBasicBlock()
132 void LoaderPass::readEdge(ProfileInfo::Edge e, in readEdge()
200 for (std::set<Edge>::iterator ei = SpanningTree.begin(), in runOnModule()
211 for (std::set<Edge>::iterator ei = SpanningTree.begin(), in runOnModule()
|
| /external/skqp/src/core/ |
| D | SkRegion_path.cpp | 392 struct Edge { struct
403 Edge* fNext; argument
420 static void find_link(Edge* base, Edge* stop) { in find_link() argument
423 if (base->fFlags == Edge::kCompleteLink) { in find_link()
433 Edge* e = base; in find_link()
434 if ((base->fFlags & Edge::kY0Link) == 0) { in find_link()
437 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { in find_link()
440 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); in find_link()
447 if ((base->fFlags & Edge::kY1Link) == 0) { in find_link()
450 if ((e->fFlags & Edge::kY0Link) == 0 && y1 == e->fY0) { in find_link()
[all …]
|
| /external/skia/src/core/ |
| D | SkRegion_path.cpp | 392 struct Edge { struct
403 Edge* fNext; argument
420 static void find_link(Edge* base, Edge* stop) { in find_link() argument
423 if (base->fFlags == Edge::kCompleteLink) { in find_link()
433 Edge* e = base; in find_link()
434 if ((base->fFlags & Edge::kY0Link) == 0) { in find_link()
437 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { in find_link()
440 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); in find_link()
447 if ((base->fFlags & Edge::kY1Link) == 0) { in find_link()
450 if ((e->fFlags & Edge::kY0Link) == 0 && y1 == e->fY0) { in find_link()
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 137 class Edge {
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 &operator[](int i) const { return Edges[i]; }
[all …]
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | build_xla_ops_pass.cc | 49 std::vector<const Edge*> out_edges(old_node->out_edges().begin(), in MoveOutgoingEdges()
51 for (const Edge* edge : out_edges) { in MoveOutgoingEdges()
84 std::vector<const Edge*> data_edges; in MergeOutgoingDataEdges()
86 [](const Edge* e) { return !e->IsControlEdge(); }); in MergeOutgoingDataEdges()
88 for (const Edge* e : data_edges) { in MergeOutgoingDataEdges()
113 std::vector<const Edge*> ctrl_edges; in MergeOutgoingControlEdges()
115 [](const Edge* e) { return e->IsControlEdge(); }); in MergeOutgoingControlEdges()
143 for (const Edge* e : ctrl_edges) { in MergeOutgoingControlEdges()
156 Output IncomingEdgeAsOutput(const Edge* e) { in IncomingEdgeAsOutput()
176 std::vector<const Edge*> input_edges_vector; in GetXlaClusterInfo()
[all …]
|
| D | increase_dynamism_for_auto_jit_pass.cc | 96 const Edge* slice_input_edge; in GetSliceInputs()
98 const Edge* slice_size_edge; in GetSliceInputs()
100 const Edge* slice_begin_edge; in GetSliceInputs()
149 const std::vector<const Edge*>& control_deps) in ConstantCache()
158 for (const Edge* e : control_deps_) { in Get1DHostConstant()
168 std::vector<const Edge*> control_deps_;
174 std::vector<const Edge*> control_deps, Output* size) { in ComputeSliceSize()
224 for (const Edge* e : control_deps) { in ComputeSliceSize()
257 std::vector<const Edge*> old_size_ctrl_deps; in ConvertTensorFlowSliceToStaticShapedSlice()
260 [](const Edge* e) { return e->IsControlEdge(); }); in ConvertTensorFlowSliceToStaticShapedSlice()
[all …]
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | propagator.h | 33 struct Edge { struct
34 Edge(BasicBlock* b1, BasicBlock* b2) : source(b1), dest(b2) { in Edge() argument
40 bool operator<(const Edge& o) const { argument
249 bool MarkEdgeExecutable(const Edge& edge) { in MarkEdgeExecutable()
254 bool IsEdgeExecutable(const Edge& edge) const { in IsEdgeExecutable()
265 void AddControlEdge(const Edge& e);
297 std::unordered_map<BasicBlock*, std::vector<Edge>> bb_preds_;
302 std::unordered_map<BasicBlock*, std::vector<Edge>> bb_succs_;
305 std::set<Edge> executable_edges_;
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | propagator.h | 33 struct Edge { struct
34 Edge(BasicBlock* b1, BasicBlock* b2) : source(b1), dest(b2) { in Edge() argument
40 bool operator<(const Edge& o) const { argument
249 bool MarkEdgeExecutable(const Edge& edge) { in MarkEdgeExecutable()
254 bool IsEdgeExecutable(const Edge& edge) const { in IsEdgeExecutable()
265 void AddControlEdge(const Edge& e);
297 std::unordered_map<BasicBlock*, std::vector<Edge>> bb_preds_;
302 std::unordered_map<BasicBlock*, std::vector<Edge>> bb_succs_;
305 std::set<Edge> executable_edges_;
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| D | ProfileInfo.h | 57 typedef std::pair<const BType*, const BType*> Edge; typedef
58 typedef std::pair<Edge, double> EdgeWeight;
59 typedef std::map<Edge, double> EdgeWeights;
87 static const FType* getFunction(Edge e) { in getFunction()
98 static Edge getEdge(const BType *Src, const BType *Dest) { in getEdge()
113 double getEdgeWeight(Edge e) const { in getEdgeWeight()
124 void setEdgeWeight(Edge e, double w) { in setEdgeWeight()
131 void addEdgeWeight(Edge e, double w);
142 void removeEdge(Edge e);
144 void replaceEdge(const Edge &, const Edge &);
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 135 class Edge {
140 Edge();
141 explicit Edge(Node &N, Kind K);
191 using VectorT = SmallVector<Edge, 4>;
192 using VectorImplT = SmallVectorImpl<Edge>;
261 Edge &operator[](int i) { return Edges[i]; }
262 Edge &operator[](Node &N) {
269 Edge *lookup(Node &N) { in lookup()
301 void insertEdgeInternal(Node &ChildN, Edge::Kind EK);
304 void setEdgeKind(Node &ChildN, Edge::Kind EK);
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | MachineDominators.cpp | 94 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
96 MachineBasicBlock *Succ = Edge.ToBB; in applySplitCriticalEdges()
100 if (PredBB == Edge.NewBB) in applySplitCriticalEdges()
130 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
132 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB); in applySplitCriticalEdges()
138 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode); in applySplitCriticalEdges()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | MachineDominators.cpp | 104 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
106 MachineBasicBlock *Succ = Edge.ToBB; in applySplitCriticalEdges()
110 if (PredBB == Edge.NewBB) in applySplitCriticalEdges()
140 for (CriticalEdge &Edge : CriticalEdgesToSplit) { in applySplitCriticalEdges()
142 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB); in applySplitCriticalEdges()
148 DT->changeImmediateDominator(DT->getNode(Edge.ToBB), NewDTNode); in applySplitCriticalEdges()
|
| /external/tensorflow/tensorflow/core/graph/ |
| D | graph.cc | 238 Status Node::input_edge(int idx, const Edge** e) const { in input_edge()
254 for (const Edge* edge : in_edges()) { in input_edge()
265 Status Node::input_edges(std::vector<const Edge*>* input_edges) const { in input_edges()
269 for (const Edge* edge : in_edges()) { in input_edges()
290 const Edge* e; in input_node()
308 const Edge* e; in input_tensor()
459 const Edge* Graph::AddEdge(Node* source, int x, Node* dest, int y) { in AddEdge()
471 Edge* e = nullptr; in AddEdge()
473 e = new (arena_.Alloc(sizeof(Edge))) Edge; // placement new in AddEdge()
490 void Graph::RemoveEdge(const Edge* e) { in RemoveEdge()
[all …]
|
| D | graph.h | 57 class Edge; variable
191 Status input_edge(int idx, const Edge** e) const;
195 Status input_edges(std::vector<const Edge*>* edges) const;
354 class Edge {
377 Edge() {} in Edge() function
392 const std::vector<Edge*>& edges_;
395 explicit GraphEdgesIterable(const std::vector<Edge*>& edges) in GraphEdgesIterable()
398 typedef Edge* value_type;
493 const Edge* AddEdge(Node* source, int x, Node* dest, int y);
505 const Edge* AddControlEdge(Node* source, Node* dest,
[all …]
|
| D | edgeset_test.cc | 33 edges_ = new Edge[n]; in MakeEdgeSet()
45 std::vector<const Edge*> modelv(model_.begin(), model_.end()); in CheckSame()
46 std::vector<const Edge*> esetv(eset_.begin(), eset_.end()); in CheckSame()
56 Edge nonexistent_;
57 Edge* edges_;
59 std::set<const Edge*> model_;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 44 Edge::Kind EK) { in insertEdgeInternal()
49 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()
58 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
63 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge()
65 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { in addEdge()
70 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
109 LazyCallGraph::Edge::Call); in populateSlow()
123 LazyCallGraph::Edge::Ref); in populateSlow()
131 LazyCallGraph::Edge::Ref); in populateSlow()
173 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref); in LazyCallGraph()
[all …]
|