/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;
|
/external/chromium_org/cc/resources/ |
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 | 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 | 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/chrome/tools/ |
H A D | history-viz.py | 82 class Edge(object): class in inherits:object 85 If a link is traversed twice, it is one Edge with two entries in 161 edges = {} # Map of urlid->urlid->Edge. 168 edge = edges[src][dst] = edges[src].get(dst, Edge(src, dst))
|
/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/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;
|
H A D | SparsePropagation.h | 131 typedef std::pair<BasicBlock*,BasicBlock*> Edge; typedef in class:llvm::SparseSolver 132 std::set<Edge> KnownFeasibleEdges;
|
H A D | LoopInfo.h | 208 /// Edge type. 209 typedef std::pair<const BlockT*, const BlockT*> Edge; typedef in class:llvm::LoopBase 212 void getExitEdges(SmallVectorImpl<Edge> &ExitEdges) const;
|
/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/chrome/browser/ui/window_sizer/ |
H A D | window_sizer.h | 120 enum Edge { TOP, LEFT, BOTTOM, RIGHT }; enum in class:WindowSizer
|
/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/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/content/browser/android/ |
H A D | edge_effect.h | 28 enum Edge { enum in class:content::EdgeEffect 48 Edge edge,
|
/external/llvm/lib/IR/ |
H A D | GCOV.cpp | 159 GCOVEdge *Edge = Edges.back().get(); local 160 Blocks[BlockNo]->addDstEdge(Edge); 161 Blocks[Dst]->addSrcEdge(Edge); 162 if (!Buff.readInt(Dummy)) return false; // Edge flag 362 const GCOVEdge *Edge = *I; 363 dbgs() << Edge->Src.Number << " (" << Edge->Count << "), "; 370 const GCOVEdge *Edge = *I; 371 dbgs() << Edge->Dst.Number << " (" << Edge [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 | process-graph.py | 102 new_edge = Edge(**e) 125 class Edge: class in inherits: 202 new_edge = Edge( 212 sub_edge = Edge(
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/ |
H A D | HeapSnapshotCommon.js | 146 WebInspector.HeapSnapshotCommon.Edge = function(name, node, type, edgeIndex)
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRegion_path.cpp | 363 struct Edge { struct 374 Edge* fNext; 391 static void find_link(Edge* base, Edge* stop) { 394 if (base->fFlags == Edge::kCompleteLink) { 404 Edge* e = base; 405 if ((base->fFlags & Edge::kY0Link) == 0) { 408 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { 411 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); 418 if ((base->fFlags & Edge 392 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/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_deadlock_detector.h | 249 Edge e = {(u16)added_edges[i], (u16)cur_idx, 254 // Printf("Edge%zd: %u %zd=>%zd in T%d\n", 392 struct Edge { struct in class:__sanitizer::DeadlockDetector 406 Edge edges_[BV::kSize * 32];
|
/external/chromium_org/third_party/WebKit/Source/platform/graphics/ |
H A D | GraphicsContext.h | 356 enum Edge { enum in class:WebCore::GraphicsContext
|