| /external/chromium_org/cc/resources/ |
| D | layer_quad.h | 23 class Edge {
25 Edge() : x_(0), y_(0), z_(0) {} in Edge() function
26 Edge(const gfx::PointF& p, const gfx::PointF& q);
60 gfx::PointF Intersect(const Edge& e) const { in Intersect()
72 LayerQuad(const Edge& left,
73 const Edge& top,
74 const Edge& right,
75 const Edge& bottom);
78 Edge left() const { return left_; } in left()
79 Edge top() const { return top_; } in top()
[all …]
|
| D | layer_quad.cc | 12 LayerQuad::Edge::Edge(const gfx::PointF& p, const gfx::PointF& q) { in Edge() function in cc::LayerQuad::Edge
24 left_ = Edge(quad.p4(), quad.p1()); in LayerQuad()
25 right_ = Edge(quad.p2(), quad.p3()); in LayerQuad()
26 top_ = Edge(quad.p1(), quad.p2()); in LayerQuad()
27 bottom_ = Edge(quad.p3(), quad.p4()); in LayerQuad()
36 LayerQuad::LayerQuad(const Edge& left, in LayerQuad()
37 const Edge& top, in LayerQuad()
38 const Edge& right, in LayerQuad()
39 const Edge& bottom) in LayerQuad()
|
| D | task_graph_runner.h | 64 struct Edge { struct
65 typedef std::vector<Edge> Vector; argument
67 Edge(const Task* task, Task* dependent) in Edge() function
81 Edge::Vector edges;
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/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()
299 case Graph::Edge::TREE: in search()
300 case Graph::Edge::FORWARD: in search()
301 case Graph::Edge::DUMMY: in search()
[all …]
|
| D | nv50_ir_bb.cpp | 310 Graph::Edge *e = cfg.outgoing(true).getEdge(); in splitCommon()
322 this->cfg.attach(&bb->cfg, Graph::Edge::TREE); in splitCommon()
365 Graph::Edge::Type eR; in initiatesSimpleConditional()
376 if (eR == Graph::Edge::CROSS || eR == Graph::Edge::BACK) in initiatesSimpleConditional()
520 case Graph::Edge::TREE: in printCFGraph()
523 case Graph::Edge::FORWARD: in printCFGraph()
526 case Graph::Edge::CROSS: in printCFGraph()
529 case Graph::Edge::BACK: in printCFGraph()
532 case Graph::Edge::DUMMY: in printCFGraph()
|
| /external/mesa3d/src/gallium/drivers/nv50/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()
299 case Graph::Edge::TREE: in search()
300 case Graph::Edge::FORWARD: in search()
301 case Graph::Edge::DUMMY: in search()
[all …]
|
| D | nv50_ir_bb.cpp | 310 Graph::Edge *e = cfg.outgoing(true).getEdge(); in splitCommon()
322 this->cfg.attach(&bb->cfg, Graph::Edge::TREE); in splitCommon()
365 Graph::Edge::Type eR; in initiatesSimpleConditional()
376 if (eR == Graph::Edge::CROSS || eR == Graph::Edge::BACK) in initiatesSimpleConditional()
520 case Graph::Edge::TREE: in printCFGraph()
523 case Graph::Edge::FORWARD: in printCFGraph()
526 case Graph::Edge::CROSS: in printCFGraph()
529 case Graph::Edge::BACK: in printCFGraph()
532 case Graph::Edge::DUMMY: in printCFGraph()
|
| /external/opencv/cvaux/src/ |
| D | enmin.cpp | 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* )tempEdgePtr ) -> destVtx =
266 ( ( Edge* )newEdgePtr ) -> weight +=
[all …]
|
| /external/chromium_org/tools/clang/blink_gc_plugin/ |
| D | Edge.h | 14 class Edge; variable
51 typedef std::deque<Edge*> Context;
53 Edge* Parent() { return context_.empty() ? 0 : context_.front(); } in Parent()
54 void Enter(Edge* e) { return context_.push_front(e); } in Enter()
72 class Edge {
77 virtual ~Edge() {} in ~Edge()
97 class Value : public Edge {
112 class PtrEdge : public Edge {
115 Edge* ptr() { return ptr_; } in ptr()
117 PtrEdge(Edge* ptr) : ptr_(ptr) { in PtrEdge()
[all …]
|
| D | RecordInfo.h | 52 FieldPoint(clang::FieldDecl* field, Edge* edge) in FieldPoint()
55 return edge_->NeedsTracing(Edge::kRecursive); in NeedsTracing()
58 Edge* edge() { return edge_; } in edge()
62 Edge* edge_;
99 TracingStatus NeedsTracing(Edge::NeedsTracingOption);
111 Edge* CreateEdge(const clang::Type* type);
|
| D | RecordInfo.cpp | 344 if (Edge* edge = CreateEdge(field->getType().getTypePtrOrNull())) { in CollectFields()
345 fields_status = fields_status.LUB(edge->NeedsTracing(Edge::kRecursive)); in CollectFields()
454 TracingStatus RecordInfo::NeedsTracing(Edge::NeedsTracingOption option) { in NeedsTracing()
466 if (option == Edge::kRecursive) in NeedsTracing()
472 Edge* RecordInfo::CreateEdge(const Type* type) { in CreateEdge()
478 if (Edge* ptr = CreateEdge(type->getPointeeType().getTypePtrOrNull())) in CreateEdge()
493 if (Edge* ptr = CreateEdge(args[0])) in CreateEdge()
499 if (Edge* ptr = CreateEdge(args[0])) in CreateEdge()
505 if (Edge* ptr = CreateEdge(args[0])) in CreateEdge()
511 if (Edge* ptr = CreateEdge(args[0])) in CreateEdge()
[all …]
|
| /external/skia/src/core/ |
| D | SkRegion_path.cpp | 370 struct Edge { struct
381 Edge* fNext; argument
398 static void find_link(Edge* base, Edge* stop) { in find_link() argument
401 if (base->fFlags == Edge::kCompleteLink) { in find_link()
411 Edge* e = base; in find_link()
412 if ((base->fFlags & Edge::kY0Link) == 0) { in find_link()
415 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { in find_link()
418 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); in find_link()
425 if ((base->fFlags & Edge::kY1Link) == 0) { in find_link()
428 if ((e->fFlags & Edge::kY0Link) == 0 && y1 == e->fY0) { in find_link()
[all …]
|
| /external/chromium_org/third_party/skia/src/core/ |
| D | SkRegion_path.cpp | 370 struct Edge { struct
381 Edge* fNext; argument
398 static void find_link(Edge* base, Edge* stop) { in find_link() argument
401 if (base->fFlags == Edge::kCompleteLink) { in find_link()
411 Edge* e = base; in find_link()
412 if ((base->fFlags & Edge::kY0Link) == 0) { in find_link()
415 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { in find_link()
418 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); in find_link()
425 if ((base->fFlags & Edge::kY1Link) == 0) { in find_link()
428 if ((e->fFlags & Edge::kY0Link) == 0 && y1 == e->fY0) { in find_link()
[all …]
|
| /external/chromium_org/v8/src/compiler/ |
| D | node-properties.h | 28 static inline bool IsValueEdge(Node::Edge edge);
29 static inline bool IsContextEdge(Node::Edge edge);
30 static inline bool IsEffectEdge(Node::Edge edge);
31 static inline bool IsControlEdge(Node::Edge edge);
57 static inline bool IsInputRange(Node::Edge edge, int first, int count);
|
| D | generic-node.h | 91 class Edge; variable
160 class GenericNode<B, S>::Edge {
174 explicit Edge(typename GenericNode<B, S>::Input* input) : input_(input) {} in Edge() function
189 typename GenericNode<B, S>::Edge edge() { in edge()
190 return typename GenericNode::Edge(GetInput()); in edge()
232 typename GenericNode<B, S>::Edge edge() { in edge()
233 return typename GenericNode::Edge(CurrentInput()); in edge()
|
| D | node-properties-inl.h | 111 inline bool NodeProperties::IsInputRange(Node::Edge edge, int first, int num) { in IsInputRange()
119 inline bool NodeProperties::IsValueEdge(Node::Edge edge) { in IsValueEdge()
125 inline bool NodeProperties::IsContextEdge(Node::Edge edge) { in IsContextEdge()
131 inline bool NodeProperties::IsEffectEdge(Node::Edge edge) { in IsEffectEdge()
137 inline bool NodeProperties::IsControlEdge(Node::Edge edge) { in IsControlEdge()
|
| /external/chromium_org/third_party/skia/include/utils/ |
| D | SkBoundaryPatch.h | 19 enum Edge { enum
26 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0;
54 virtual SkPoint eval(Edge, SkScalar);
63 virtual SkPoint eval(Edge, SkScalar);
|
| /external/skia/include/utils/ |
| D | SkBoundaryPatch.h | 19 enum Edge { enum
26 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0;
54 virtual SkPoint eval(Edge, SkScalar);
63 virtual SkPoint eval(Edge, SkScalar);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | MaximumSpanningTree.h | 30 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()
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | SampleProfile.cpp | 111 typedef std::pair<BasicBlock *, BasicBlock *> Edge; typedef
112 typedef DenseMap<Edge, unsigned> EdgeWeightMap;
138 void printEdgeWeight(raw_ostream &OS, Edge E);
147 unsigned visitEdge(Edge E, unsigned *NumUnknownEdges, Edge *UnknownEdge);
192 SmallSet<Edge, 128> VisitedEdges;
342 void SampleFunctionProfile::printEdgeWeight(raw_ostream &OS, Edge E) { in printEdgeWeight()
734 unsigned SampleFunctionProfile::visitEdge(Edge E, unsigned *NumUnknownEdges, in visitEdge()
735 Edge *UnknownEdge) { in visitEdge()
770 Edge UnknownEdge, SelfReferentialEdge; in propagateThroughEdges()
775 Edge E = std::make_pair(Predecessors[BB][I], BB); in propagateThroughEdges()
[all …]
|
| /external/llvm/lib/IR/ |
| D | GCOV.cpp | 159 GCOVEdge *Edge = Edges.back().get(); in readGCNO() local
160 Blocks[BlockNo]->addDstEdge(Edge); in readGCNO()
161 Blocks[Dst]->addSrcEdge(Edge); in readGCNO()
362 const GCOVEdge *Edge = *I; in dump() local
363 dbgs() << Edge->Src.Number << " (" << Edge->Count << "), "; in dump()
370 const GCOVEdge *Edge = *I; in dump() local
371 dbgs() << Edge->Dst.Number << " (" << Edge->Count << "), "; in dump()
696 const GCOVEdge *Edge = *I; in printBranchInfo() local
697 BranchCounts.push_back(Edge->Count); in printBranchInfo()
698 TotalCounts += Edge->Count; in printBranchInfo()
[all …]
|
| /external/mockito/cglib-and-asm/src/org/mockito/asm/ |
| D | Edge.java | 37 class Edge { class
74 Edge next;
|
| D | Label.java | 226 Edge successors;
486 Edge e = new Edge(); in visitSubroutine()
502 Edge e = successors; in visitSubroutine()
|