| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| D | DefaultEdgeCreator.java | 42 @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 …]
|
| D | Edge.java | 27 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/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.
355 struct Edge { struct
357 Edge(Vertex* top, Vertex* bottom, int winding, Type type) in Edge() argument
384 Edge* fLeft; // The linked list of edges in the active edge list. argument
[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.
355 struct Edge { struct
357 Edge(Vertex* top, Vertex* bottom, int winding, Type type) in Edge() function
384 Edge* fLeft; // The linked list of edges in the active edge list. argument
[all …]
|
| /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/tensorflow/tensorflow/contrib/tensorrt/segment/ |
| D | segment.cc | 36 bool CanContractEdge(const tensorflow::Edge* edge, in CanContractEdge()
71 void ContractEdge(tensorflow::Edge* edge, tensorflow::Graph* graph, in ContractEdge()
72 std::vector<const tensorflow::Edge*>* remove_edges) { in ContractEdge()
80 std::vector<const tensorflow::Edge*> in_edges(dst->in_edges().begin(), in ContractEdge()
82 for (const tensorflow::Edge* in_edge : in_edges) { in ContractEdge()
84 tensorflow::Edge* e = const_cast<tensorflow::Edge*>(in_edge); in ContractEdge()
94 std::vector<const tensorflow::Edge*> out_edges(dst->out_edges().begin(), in ContractEdge()
96 for (const tensorflow::Edge* out_edge : out_edges) { in ContractEdge()
97 tensorflow::Edge* e = const_cast<tensorflow::Edge*>(out_edge); in ContractEdge()
170 std::set<const tensorflow::Edge*> contract_edges; in SegmentGraph()
[all …]
|
| /external/v8/tools/clang/blink_gc_plugin/ |
| D | Edge.h | 16 class Edge; variable
63 typedef std::deque<Edge*> Context;
65 Edge* Parent() { return context_.empty() ? 0 : context_.front(); } in Parent()
66 void Enter(Edge* e) { return context_.push_front(e); } in Enter()
87 class Edge {
92 virtual ~Edge() {} in ~Edge()
111 class Value : public Edge {
126 class PtrEdge : public Edge {
129 Edge* ptr() { return ptr_; } in ptr()
131 PtrEdge(Edge* ptr) : ptr_(ptr) { in PtrEdge()
[all …]
|
| D | RecordInfo.h | 55 FieldPoint(clang::FieldDecl* field, Edge* edge) in FieldPoint()
58 return edge_->NeedsTracing(Edge::kRecursive); in NeedsTracing()
61 Edge* edge() { return edge_; } in edge()
65 Edge* edge_;
115 TracingStatus NeedsTracing(Edge::NeedsTracingOption);
131 Edge* CreateEdge(const clang::Type* type);
132 Edge* CreateEdgeFromOriginalType(const clang::Type* type);
|
| /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/skia/src/core/ |
| D | SkRegion_path.cpp | 378 struct Edge { struct
389 Edge* fNext; argument
406 static void find_link(Edge* base, Edge* stop) { in find_link() argument
409 if (base->fFlags == Edge::kCompleteLink) { in find_link()
419 Edge* e = base; in find_link()
420 if ((base->fFlags & Edge::kY0Link) == 0) { in find_link()
423 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { in find_link()
426 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); in find_link()
433 if ((base->fFlags & Edge::kY1Link) == 0) { in find_link()
436 if ((e->fFlags & Edge::kY0Link) == 0 && y1 == e->fY0) { in find_link()
[all …]
|
| /external/skqp/src/core/ |
| D | SkRegion_path.cpp | 378 struct Edge { struct
389 Edge* fNext; argument
406 static void find_link(Edge* base, Edge* stop) { in find_link() argument
409 if (base->fFlags == Edge::kCompleteLink) { in find_link()
419 Edge* e = base; in find_link()
420 if ((base->fFlags & Edge::kY0Link) == 0) { in find_link()
423 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { in find_link()
426 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); in find_link()
433 if ((base->fFlags & Edge::kY1Link) == 0) { in find_link()
436 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/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/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/tensorflow/tensorflow/core/graph/ |
| D | graph.h | 57 class Edge; variable
175 Status input_edge(int idx, const Edge** e) const;
179 Status input_edges(std::vector<const Edge*>* edges) const;
295 class Edge {
318 Edge() {} in Edge() function
333 const std::vector<Edge*>& edges_;
336 explicit GraphEdgesIterable(const std::vector<Edge*>& edges) in GraphEdgesIterable()
339 typedef Edge* value_type;
434 const Edge* AddEdge(Node* source, int x, Node* dest, int y);
446 const Edge* AddControlEdge(Node* source, Node* dest,
[all …]
|
| D | graph.cc | 195 Status Node::input_edge(int idx, const Edge** e) const { in input_edge()
211 for (const Edge* edge : in_edges()) { in input_edge()
222 Status Node::input_edges(std::vector<const Edge*>* input_edges) const { in input_edges()
226 for (const Edge* edge : in_edges()) { in input_edges()
247 const Edge* e; in input_node()
376 const Edge* Graph::AddEdge(Node* source, int x, Node* dest, int y) { in AddEdge()
388 Edge* e = nullptr; in AddEdge()
390 e = new (arena_.Alloc(sizeof(Edge))) Edge; // placement new in AddEdge()
407 void Graph::RemoveEdge(const Edge* e) { in RemoveEdge()
417 Edge* del = const_cast<Edge*>(e); in RemoveEdge()
[all …]
|
| D | edgeset_test.cc | 35 edges_ = new Edge[n]; in MakeEdgeSet()
47 std::vector<const Edge*> modelv(model_.begin(), model_.end()); in CheckSame()
48 std::vector<const Edge*> esetv(eset_->begin(), eset_->end()); in CheckSame()
57 Edge nonexistent_;
58 Edge* edges_;
60 std::set<const Edge*> model_;
|
| D | mkl_tfconversion_pass.cc | 117 Status InsertConversionNodeOnEdge(std::unique_ptr<Graph>* g, Edge*);
140 std::unique_ptr<Graph>* g, Edge* e) { in InsertConversionNodeOnEdge()
209 std::vector<const Edge*> edges; in InsertInputConversionNode()
246 std::vector<const Edge*> edges_to_remove; in InsertInputConversionNode()
247 for (const Edge* e : n->in_edges()) { in InsertInputConversionNode()
253 for (const Edge* e : edges_to_remove) { in InsertInputConversionNode()
302 std::vector<Edge*> candidate_edges; in RunPass()
304 for (const Edge* e : (*g)->edges()) { in RunPass()
339 candidate_edges.push_back(const_cast<Edge*>(e)); in RunPass()
344 for (Edge* e : candidate_edges) { in RunPass()
|
| /external/v8/tools/turbolizer/ |
| D | edge.js | 11 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/v8/src/compiler/ |
| D | node.h | 19 class Edge; variable
120 typedef Edge value_type;
298 friend class Edge; variable
324 typedef Edge value_type;
368 class Edge final {
378 bool operator==(const Edge& other) { return input_ptr_ == other.input_ptr_; }
379 bool operator!=(const Edge& other) { return !(*this == other); }
395 Edge(Node::Use* use, Node** input_ptr) : use_(use), input_ptr_(input_ptr) { in Edge() function
436 typedef Edge value_type;
437 typedef Edge* pointer;
[all …]
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | memory_types.cc | 49 const std::function<Status(const Edge*, MemoryType, MemoryType)>& fn) { in ProcessMemoryTypes() argument
77 for (const Edge* e : g->edges()) { in ProcessMemoryTypes()
95 device_type, g, [g](const Edge* e, MemoryType sm, MemoryType dm) { in ValidateMemoryTypes()
114 static string GetTensorName(const Edge* edge) { in GetTensorName()
121 const string& device_name, bool host, const Edge* edge) { in Send()
135 const string& device_name, bool host, const Edge* edge) { in Recv()
152 const Edge* edge; in EnsureMemoryTypes()
158 device_type, g, [g, &edges](const Edge* e, MemoryType sm, MemoryType dm) { in EnsureMemoryTypes()
179 const Edge* e = item.edge; in EnsureMemoryTypes()
|
| /external/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 23 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge()
25 LazyCallGraph::Edge::Kind EK) { in addEdge()
39 Edges.emplace_back(LazyCallGraph::Edge(F, EK)); in addEdge()
45 SmallVectorImpl<LazyCallGraph::Edge> &Edges, in findReferences()
51 addEdge(Edges, EdgeIndexMap, *F, LazyCallGraph::Edge::Ref); in findReferences()
81 addEdge(Edges, EdgeIndexMap, *Callee, LazyCallGraph::Edge::Call); in Node()
96 void LazyCallGraph::Node::insertEdgeInternal(Function &Target, Edge::Kind EK) { in insertEdgeInternal()
104 void LazyCallGraph::Node::insertEdgeInternal(Node &TargetN, Edge::Kind EK) { in insertEdgeInternal()
109 void LazyCallGraph::Node::setEdgeKind(Function &TargetF, Edge::Kind EK) { in setEdgeKind()
118 Edges[IndexMapI->second] = Edge(); in removeEdgeInternal()
[all …]
|