| /external/chromium_org/cc/resources/ |
| layer_quad.cc | 12 LayerQuad::Edge::Edge(const gfx::PointF& p, const gfx::PointF& q) {
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& bottom
[all...] |
| layer_quad.h | 23 class Edge {
25 Edge() : x_(0), y_(0), z_(0) {}
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 top() const { return top_;
[all...] |
| task_graph_runner.h | 64 struct Edge {
65 typedef std::vector<Edge> Vector;
67 Edge(const Task* task, Task* dependent)
81 Edge::Vector edges;
|
| /external/mockito/cglib-and-asm/src/org/mockito/asm/ |
| Edge.java | 33 * An edge in the control flow graph of a method body. See {@link Label Label}.
37 class Edge {
40 * Denotes a normal control flow graph edge.
45 * Denotes a control flow graph edge corresponding to an exception handler.
46 * More precisely any {@link Edge} whose {@link #info} is strictly positive
54 * Information about this control flow graph edge. If
56 * stack size in the basic block from which this edge originates. This size
57 * is equal to the stack size at the "jump" instruction to which this edge
60 * this field is the kind of this control flow graph edge (i.e. NORMAL or
66 * The successor block of the basic block from which this edge originates.
[all...] |
| /external/chromium_org/chrome/tools/ |
| history-viz.py | 82 class Edge(object):
83 """Represents an edge in the history graph, connecting two pages.
85 If a link is traversed twice, it is one Edge with two entries in
109 # edge['chain'] = chain
161 edges = {} # Map of urlid->urlid->Edge.
168 edge = edges[src][dst] = edges[src].get(dst, Edge(src, dst))
172 edge.transitions.append(trans)
211 for dst, edge in dsts.items():
213 label = [] # Label for the edge
[all...] |
| /external/chromium_org/third_party/skia/include/utils/ |
| SkBoundaryPatch.h | 19 enum Edge {
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/ |
| BranchProbabilityInfo.h | 31 /// probabilities of each "edge" in the function's CFG where such an edge is
33 /// probability of an edge from one block is always relative to the
37 /// identify an edge, since we can have multiple edges from Src to Dst.
52 /// \brief Get an edge's probability, relative to other out-edges of the Src.
55 /// (0%) and one (100%) of this edge executing, relative to other edges
67 /// \brief Test if an edge is hot relative to other out-edges of the Src.
69 /// Check whether this edge out of the source block is 'hot'. We define hot
79 /// \brief Print an edge's probability.
81 /// Retrieves an edge's probability similarly to \see getEdgeProbability, bu
[all...] |
| SparsePropagation.h | 131 typedef std::pair<BasicBlock*,BasicBlock*> Edge;
132 std::set<Edge> KnownFeasibleEdges;
165 /// isEdgeFeasible - Return true if the control flow edge from the 'From'
|
| LoopInfo.h | 208 /// Edge type.
209 typedef std::pair<const BlockT*, const BlockT*> Edge;
212 void getExitEdges(SmallVectorImpl<Edge> &ExitEdges) const;
215 /// loop has a preheader if there is only one edge to the header of the loop
|
| /external/chromium_org/chrome/browser/ui/window_sizer/ |
| window_sizer.h | 119 // The edge of the screen to check for out-of-bounds.
120 enum Edge { TOP, LEFT, BOTTOM, RIGHT };
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| MaximumSpanningTree.h | 30 typedef std::pair<const T*, const T*> Edge;
31 typedef std::pair<Edge, double> EdgeWeight;
34 typedef std::vector<Edge> MaxSpanTree;
50 // Equal edge weights: break ties by comparing block sizes.
80 Edge e = (*EWi).first;
89 Edge e = (*EWi).first;
93 // So we know now that the edge is not already in a subtree, so we push
94 // the edge to the MST.
|
| GCOVProfiling.cpp | 1 //===- GCOVProfiling.cpp - Insert edge counters for gcov profiling --------===//
603 unsigned Edge = 0;
611 Edge);
618 Builder.getInt64(Edge),
619 Builder.getInt64(Edge + 1));
633 Edge += Successors;
711 // the whole-Module pred edge# between the time we set it and the time we next
724 unsigned Edge = 0;
733 Edge + i);
738 Edge += Successors
[all...] |
| /external/chromium_org/content/browser/android/ |
| overscroll_glow.h | 29 enum Edge { EDGE_TOP = 0, EDGE_LEFT, EDGE_BOTTOM, EDGE_RIGHT, EDGE_COUNT };
31 // Allows lazy creation of the edge effects.
|
| /external/llvm/lib/IR/ |
| GCOV.cpp | 159 GCOVEdge *Edge = Edges.back().get();
160 Blocks[BlockNo]->addDstEdge(Edge);
161 Blocks[Dst]->addSrcEdge(Edge);
162 if (!Buff.readInt(Dummy)) return false; // Edge flag
263 // required to combine the edge counts that are contained in the GCDA file.
329 /// addCount - Add to block counter while storing the edge count. If the
362 const GCOVEdge *Edge = *I;
363 dbgs() << Edge->Src.Number << " (" << Edge->Count << "), ";
370 const GCOVEdge *Edge = *I
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| 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(); }
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;
[all...] |
| 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); local
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
356 Graph::Edge *edge; local
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| 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(); }
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;
[all...] |
| 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); local
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
356 Graph::Edge *edge; local
[all...] |
| /external/chromium_org/tools/clang/blink_gc_plugin/ |
| Edge.h | 14 class Edge;
37 // Recursive edge visitor. The traversed path is accessible in context.
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 {
77 virtual ~Edge() {}
96 // A value edge is a direct edge to some type, eg, part-object edges.
97 class Value : public Edge {
[all...] |
| process-graph.py | 102 new_edge = Edge(**e)
103 edge = self.edges.get(new_edge.key)
104 if edge:
105 # If an edge exist, its kind is the strongest of the two.
106 edge.kind = max(edge.kind, new_edge.kind)
125 class Edge:
133 # The label does not uniquely determine an edge from a node. We
136 # edge to a particular type. For example, if the field A::m_f
138 # strong edge with key m_f#B from A to B
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/ |
| HeapSnapshotCommon.js | 146 WebInspector.HeapSnapshotCommon.Edge = function(name, node, type, edgeIndex)
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkRegion_path.cpp | 370 struct Edge {
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::kY1Link) == 0)
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| 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 {
406 Edge edges_[BV::kSize * 32];
|
| /external/chromium_org/third_party/WebKit/Source/platform/graphics/ |
| GraphicsContext.h | 367 enum Edge {
|
| /external/llvm/lib/Transforms/Scalar/ |
| SCCP.cpp | 206 typedef std::pair<BasicBlock*, BasicBlock*> Edge;
207 DenseSet<Edge> KnownFeasibleEdges;
423 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second)
424 return; // This edge is already known to be executable!
427 // If the destination is already executable, we just made an *edge*
430 DEBUG(dbgs() << "Marking Edge Executable: " << Source->getName()
445 // isEdgeFeasible - Return true if the control flow edge from the 'From' basic
580 // isEdgeFeasible - Return true if the control flow edge from the 'From' basic
589 // Check to make sure this edge itself is actually feasible now.
598 // undef conditions mean that neither edge is feasible yet
[all...] |
