| /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
52 Edge(Node *dst, Node *src, Type kind);
53 ~Edge() { unlink(); } in ~Edge()
66 Edge *next[2]; // next edge outgoing/incident from/to origin/target
67 Edge *prev[2];
78 EdgeIterator(Graph::Edge *first, int dir, bool reverse) in EdgeIterator()
86 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]); in next()
94 inline Edge *getEdge() const { return e; } in getEdge()
95 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()
94 void Graph::Node::attach(Node *node, Edge::Type kind) in attach()
96 Edge *edge = new Edge(this, node, kind); in attach()
124 if (kind == Edge::UNKNOWN) in attach()
157 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) in Edge() function in nv50_ir::Graph::Edge
186 if (ei.getType() == Edge::BACK) in reachableBy()
301 case Graph::Edge::TREE: in search()
302 case Graph::Edge::FORWARD: in search()
306 case Graph::Edge::BACK: in search()
[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() argument
369 Edge* fLeft; // The linked list of edges in the active edge list. argument
[all …]
|
| /external/skia/src/gpu/ |
| D | GrTessellator.cpp | 106 struct Edge;
168 Edge* fFirstEdgeAbove; // Linked list of edges above this vertex.
169 Edge* fLastEdgeAbove; // "
170 Edge* fFirstEdgeBelow; // Linked list of edges below this vertex.
171 Edge* fLastEdgeBelow; // "
172 Edge* fLeftEnclosingEdge; // Nearest edge in the AEL left of this vertex.
173 Edge* fRightEnclosingEdge; // Nearest edge in the AEL right of this vertex.
346 struct Edge { struct
348 Edge(Vertex* top, Vertex* bottom, int winding, Type type) in Edge() function
373 Edge* fLeft; // The linked list of edges in the active edge list. argument
[all …]
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| D | resource_util.cc | 59 StatusOr<absl::InlinedVector<const Edge*, 1>> OutputEdgesByIndex(const Node& n, in OutputEdgesByIndex()
61 absl::InlinedVector<const Edge*, 1> res; in OutputEdgesByIndex()
68 for (const Edge* o : n.out_edges()) { in OutputEdgesByIndex()
86 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in PropagateFromStackOrTensorArraySourceOp() argument
90 for (const Edge* o : n.out_edges()) { in PropagateFromStackOrTensorArraySourceOp()
102 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in PropagateFromArgOp() argument
118 for (const Edge* o : n.out_edges()) { in PropagateFromArgOp()
137 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in UpdateResourceUsageFromFunctionBodyAnalysis() argument
154 const Edge* e; in UpdateResourceUsageFromFunctionBodyAnalysis()
169 absl::InlinedVector<const Edge*, 1> outs; in UpdateResourceUsageFromFunctionBodyAnalysis()
[all …]
|
| D | rearrange_function_argument.cc | 110 std::vector<const Edge*> input_edges; in ReorderInputEdges()
111 for (const Edge* e : n->in_edges()) { in ReorderInputEdges()
117 for (const Edge* e : input_edges) { in ReorderInputEdges()
135 std::vector<const Edge*> output_edges; in ReorderOutputEdges()
136 for (const Edge* e : n->out_edges()) { in ReorderOutputEdges()
142 for (const Edge* e : output_edges) { in ReorderOutputEdges()
152 const Edge* input_edge; in ReorderOutputEdges()
193 const Edge* e; in CalculateRetvalRearrange()
231 std::vector<const Edge*> out_edges; in RearrangeOutputEdges()
232 for (const Edge* e : n->out_edges()) { in RearrangeOutputEdges()
[all …]
|
| D | functionalize_while.cc | 78 std::vector<const Edge*> sorted_edges(n->in_edges().begin(), in CopySubgraph()
81 [](const Edge* a, const Edge* b) { in CopySubgraph()
88 for (const Edge* e : sorted_edges) { in CopySubgraph()
229 std::vector<const Edge*> edges(arg.enter->out_edges().begin(), in FunctionalizeLoop()
243 for (Edge const* e : arg.enter->in_edges()) { in FunctionalizeLoop()
270 for (const Edge* edge : frame->loop_cond->out_edges()) { in FunctionalizeLoop()
288 const Edge* enter_merge = nullptr; in FunctionalizeLoop()
289 for (const Edge* e : arg.enter->out_edges()) { in FunctionalizeLoop()
338 for (const Edge* edge : arg.merge->out_edges()) { in FunctionalizeLoop()
362 std::deque<const Edge*> possible_exit; in FunctionalizeLoop()
[all …]
|
| /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/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/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() function
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_;
|
| D | propagator.cpp | 20 void SSAPropagator::AddControlEdge(const Edge& edge) { in AddControlEdge()
67 return IsEdgeExecutable(Edge(in_bb, phi_bb)); in IsPhiArgExecutable()
126 AddControlEdge(Edge(ctx_->get_instr_block(instr), dest_bb)); in Simulate()
214 Edge(ctx_->cfg()->pseudo_entry_block(), fn->entry().get())); in Initialize()
221 bb_succs_[&block].push_back(Edge(&block, succ_bb)); in Initialize()
222 bb_preds_[succ_bb].push_back(Edge(succ_bb, &block)); in Initialize()
226 Edge(&block, ctx_->cfg()->pseudo_exit_block())); in Initialize()
228 Edge(ctx_->cfg()->pseudo_exit_block(), &block)); in Initialize()
|
| /external/angle/third_party/spirv-tools/src/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/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/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/compiler/jit/ |
| D | build_xla_ops_pass.cc | 66 std::vector<const Edge*> out_edges(old_node->out_edges().begin(), in MoveOutgoingEdges()
68 for (const Edge* edge : out_edges) { in MoveOutgoingEdges()
125 std::vector<const Edge*> data_edges; in MergeOutgoingDataEdges()
127 [](const Edge* e) { return !e->IsControlEdge(); }); in MergeOutgoingDataEdges()
129 for (const Edge* e : data_edges) { in MergeOutgoingDataEdges()
181 std::vector<const Edge*> ctrl_edges; in MergeOutgoingControlEdges()
183 [](const Edge* e) { return e->IsControlEdge(); }); in MergeOutgoingControlEdges()
211 for (const Edge* e : ctrl_edges) { in MergeOutgoingControlEdges()
224 Output IncomingEdgeAsOutput(const Edge* e) { in IncomingEdgeAsOutput()
244 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/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/tensorflow/tensorflow/core/graph/ |
| D | graph.h | 59 class Edge; variable
210 Status input_edge(int idx, const Edge** e) const;
214 Status input_edges(std::vector<const Edge*>* edges) const;
380 class Edge {
403 Edge() {} in Edge() function
418 const std::vector<Edge*>& edges_;
421 explicit GraphEdgesIterable(const std::vector<Edge*>& edges) in GraphEdgesIterable()
424 typedef Edge* value_type;
519 const Edge* AddEdge(Node* source, int x, Node* dest, int y);
531 const Edge* AddControlEdge(Node* source, Node* dest,
[all …]
|
| D | graph.cc | 254 Status Node::input_edge(int idx, const Edge** e) const { in input_edge()
270 for (const Edge* edge : in_edges()) { in input_edge()
281 Status Node::input_edges(std::vector<const Edge*>* input_edges) const { in input_edges()
285 for (const Edge* edge : in_edges()) { in input_edges()
306 const Edge* e; in input_node()
324 const Edge* e; in input_tensor()
474 for (const Edge* e : node->in_edges_) { in RemoveNode()
481 for (const Edge* e : node->out_edges_) { in RemoveNode()
491 const Edge* Graph::AddEdge(Node* source, int x, Node* dest, int y) { in AddEdge()
503 Edge* e = nullptr; in AddEdge()
[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/tensorflow/tensorflow/core/common_runtime/ |
| D | memory_types.cc | 50 const std::function<Status(const Edge*, MemoryType, MemoryType)>& fn) { in ProcessMemoryTypes() argument
78 for (const Edge* e : g->edges()) { in ProcessMemoryTypes()
96 device_type, g, [](const Edge* e, MemoryType sm, MemoryType dm) { in ValidateMemoryTypes()
116 static string GetTensorName(const Edge* edge) { in GetTensorName()
123 const string& device_name, bool host, const Edge* edge) { in Send()
137 const string& device_name, bool host, const Edge* edge) { in Recv()
154 const Edge* edge; in EnsureMemoryTypes()
160 device_type, g, [&edges](const Edge* e, MemoryType sm, MemoryType dm) { in EnsureMemoryTypes()
181 const Edge* e = item.edge; in EnsureMemoryTypes()
|