/external/mockito/cglib-and-asm/src/org/mockito/asm/ |
H A D | Edge.java | 37 class Edge {
class 46 * More precisely any {@link Edge} whose {@link #info} is strictly positive
74 Edge next;
|
H A D | Label.java | 162 * the graph, as a linked list of Edge objects.
223 * are stored in a linked list of {@link Edge Edge} objects, linked to each
224 * other by their {@link Edge#next} field.
226 Edge successors;
486 Edge e = new Edge();
502 Edge e = successors;
|
/external/chromium_org/cc/resources/ |
H A D | layer_quad.h | 23 class Edge { class in class:cc::LayerQuad 25 Edge() : x_(0), y_(0), z_(0) {} function in class:cc::LayerQuad::Edge 26 Edge(const gfx::PointF& p, const gfx::PointF& q); 60 gfx::PointF Intersect(const Edge& e) const { 72 LayerQuad(const Edge& left, 73 const Edge& top, 74 const Edge& right, 75 const Edge& bottom); 78 Edge left() const { return left_; } 79 Edge to [all...] |
H A D | layer_quad.cc | 12 LayerQuad::Edge::Edge(const gfx::PointF& p, const gfx::PointF& q) { function in class:cc::LayerQuad::Edge 24 left_ = Edge(quad.p4(), quad.p1()); 25 right_ = Edge(quad.p2(), quad.p3()); 26 top_ = Edge(quad.p1(), quad.p2()); 27 bottom_ = Edge(quad.p3(), quad.p4()); 36 LayerQuad::LayerQuad(const Edge& left, 37 const Edge& top, 38 const Edge& right, 39 const Edge [all...] |
H A D | task_graph_runner.h | 64 struct Edge { struct in struct:cc::TaskGraph 65 typedef std::vector<Edge> Vector; 67 Edge(const Task* task, Task* dependent) function in struct:cc::TaskGraph::Edge 81 Edge::Vector edges;
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.h | 32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get()) 40 class Edge class in class:nv50_ir::Graph 53 Edge(Node *dst, Node *src, Type kind); 54 ~Edge() { unlink(); } 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) 87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]); 95 inline Edge *getEdge() const { return e; } 96 inline Edge [all...] |
H A D | nv50_ir_graph.cpp | 53 void Graph::Edge::unlink() 73 const char *Graph::Edge::typeStr() const 95 void Graph::Node::attach(Node *node, Edge::Type kind) 97 Edge *edge = new Edge(this, node, kind); 125 if (kind == Edge::UNKNOWN) 158 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) function in class:nv50_ir::Graph::Edge 187 if (ei.getType() == Edge::BACK || ei.getType() == Edge [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.h | 32 #define ITER_EDGE(x) reinterpret_cast<Graph::Edge *>((x).get()) 40 class Edge class in class:nv50_ir::Graph 53 Edge(Node *dst, Node *src, Type kind); 54 ~Edge() { unlink(); } 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) 87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]); 95 inline Edge *getEdge() const { return e; } 96 inline Edge [all...] |
H A D | nv50_ir_graph.cpp | 53 void Graph::Edge::unlink() 73 const char *Graph::Edge::typeStr() const 95 void Graph::Node::attach(Node *node, Edge::Type kind) 97 Edge *edge = new Edge(this, node, kind); 125 if (kind == Edge::UNKNOWN) 158 Graph::Edge::Edge(Node *org, Node *tgt, Type kind) function in class:nv50_ir::Graph::Edge 187 if (ei.getType() == Edge::BACK || ei.getType() == Edge [all...] |
/external/chromium_org/third_party/skia/include/utils/ |
H A D | SkBoundaryPatch.h | 19 enum Edge { enum in class:SkBoundary 25 // Edge index goes clockwise around the boundary, beginning at the "top" 26 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0; 54 virtual SkPoint eval(Edge, SkScalar); 63 virtual SkPoint eval(Edge, SkScalar);
|
/external/skia/include/utils/ |
H A D | SkBoundaryPatch.h | 19 enum Edge { enum in class:SkBoundary 25 // Edge index goes clockwise around the boundary, beginning at the "top" 26 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0; 54 virtual SkPoint eval(Edge, SkScalar); 63 virtual SkPoint eval(Edge, SkScalar);
|
/external/chromium_org/v8/src/compiler/ |
H A 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);
|
H A D | generic-node.h | 91 class Edge; 160 class GenericNode<B, S>::Edge { 174 explicit Edge(typename GenericNode<B, S>::Input* input) : input_(input) {} 189 typename GenericNode<B, S>::Edge edge() { 190 return typename GenericNode::Edge(GetInput()); 232 typename GenericNode<B, S>::Edge edge() { 233 return typename GenericNode::Edge(CurrentInput());
|
H A D | node-properties-inl.h | 109 // Edge kinds. 111 inline bool NodeProperties::IsInputRange(Node::Edge edge, int first, int num) { 119 inline bool NodeProperties::IsValueEdge(Node::Edge edge) { 125 inline bool NodeProperties::IsContextEdge(Node::Edge edge) { 131 inline bool NodeProperties::IsEffectEdge(Node::Edge edge) { 137 inline bool NodeProperties::IsControlEdge(Node::Edge edge) {
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRegion_path.cpp | 370 struct Edge { struct 381 Edge* fNext; 398 static void find_link(Edge* base, Edge* stop) { 401 if (base->fFlags == Edge::kCompleteLink) { 411 Edge* e = base; 412 if ((base->fFlags & Edge::kY0Link) == 0) { 415 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { 418 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); 425 if ((base->fFlags & Edge 399 SkASSERT(base < stop); if (base->fFlags == Edge::kCompleteLink) argument [all...] |
/external/skia/src/core/ |
H A D | SkRegion_path.cpp | 370 struct Edge { struct 381 Edge* fNext; 398 static void find_link(Edge* base, Edge* stop) { 401 if (base->fFlags == Edge::kCompleteLink) { 411 Edge* e = base; 412 if ((base->fFlags & Edge::kY0Link) == 0) { 415 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { 418 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); 425 if ((base->fFlags & Edge 399 SkASSERT(base < stop); if (base->fFlags == Edge::kCompleteLink) argument [all...] |
/external/chromium_org/tools/clang/blink_gc_plugin/ |
H A D | Edge.h | 14 class Edge; 51 typedef std::deque<Edge*> Context; 53 Edge* Parent() { return context_.empty() ? 0 : context_.front(); } 54 void Enter(Edge* e) { return context_.push_front(e); } 72 class Edge { class 77 virtual ~Edge() {} 97 class Value : public Edge { 112 class PtrEdge : public Edge { 115 Edge* ptr() { return ptr_; } 117 PtrEdge(Edge* pt [all...] |
H A D | RecordInfo.h | 15 #include "Edge.h" 52 FieldPoint(clang::FieldDecl* field, Edge* edge) 55 return edge_->NeedsTracing(Edge::kRecursive); 58 Edge* edge() { return edge_; } 62 Edge* edge_; 99 TracingStatus NeedsTracing(Edge::NeedsTracingOption); 111 Edge* CreateEdge(const clang::Type* type);
|
H A D | RecordInfo.cpp | 344 if (Edge* edge = CreateEdge(field->getType().getTypePtrOrNull())) { 345 fields_status = fields_status.LUB(edge->NeedsTracing(Edge::kRecursive)); 454 TracingStatus RecordInfo::NeedsTracing(Edge::NeedsTracingOption option) { 466 if (option == Edge::kRecursive) 472 Edge* RecordInfo::CreateEdge(const Type* type) { 478 if (Edge* ptr = CreateEdge(type->getPointeeType().getTypePtrOrNull())) 493 if (Edge* ptr = CreateEdge(args[0])) 499 if (Edge* ptr = CreateEdge(args[0])) 505 if (Edge* ptr = CreateEdge(args[0])) 511 if (Edge* pt [all...] |
/external/opencv/cvaux/src/ |
H A D | enmin.cpp | 81 // struct Edge is used for storing edges of graph 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* )tempEdgePt [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge; typedef in class:llvm::MaximumSpanningTree 31 typedef std::pair<Edge, double> EdgeWeight; 34 typedef std::vector<Edge> MaxSpanTree; 80 Edge e = (*EWi).first; 89 Edge e = (*EWi).first;
|
/external/llvm/include/llvm/Analysis/ |
H A D | BranchProbabilityInfo.h | 117 typedef std::pair<const BasicBlock *, unsigned> Edge; typedef in class:llvm::BranchProbabilityInfo 127 DenseMap<Edge, uint32_t> Weights;
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | SampleProfile.cpp | 111 typedef std::pair<BasicBlock *, BasicBlock *> Edge; typedef in namespace:__anon26332 112 typedef DenseMap<Edge, unsigned> EdgeWeightMap; 138 void printEdgeWeight(raw_ostream &OS, Edge E); 147 unsigned visitEdge(Edge E, unsigned *NumUnknownEdges, Edge *UnknownEdge); 184 /// Edge weights are computed by propagating basic block weights in 192 SmallSet<Edge, 128> VisitedEdges; 341 /// \param E Edge to print. 342 void SampleFunctionProfile::printEdgeWeight(raw_ostream &OS, Edge E) { 729 /// \param E Edge t [all...] |
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkBoundaryPatch.cpp | 65 SkPoint SkLineBoundary::eval(Edge e, SkScalar t) { 70 SkPoint SkCubicBoundary::eval(Edge e, SkScalar t) {
|
/external/skia/src/utils/ |
H A D | SkBoundaryPatch.cpp | 65 SkPoint SkLineBoundary::eval(Edge e, SkScalar t) { 70 SkPoint SkCubicBoundary::eval(Edge e, SkScalar t) {
|