/external/chromium_org/cc/resources/ |
layer_quad.cc | 12 LayerQuad::Edge::Edge(gfx::PointF p, 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(gfx::PointF p, 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...] |
/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/chromium_org/ui/views/win/ |
appbar.h | 26 enum Edge {
|
/external/llvm/include/llvm/Analysis/ |
BranchProbabilityInfo.h | 30 /// probabilities of each "edge" in the function's CFG where such an edge is 32 /// probability of an edge from one block is always relative to the 36 /// identify an edge, since we can have multiple edges from Src to Dst. 51 /// \brief Get an edge's probability, relative to other out-edges of the Src. 54 /// (0%) and one (100%) of this edge executing, relative to other edges 66 /// \brief Test if an edge is hot relative to other out-edges of the Src. 68 /// Check whether this edge out of the source block is 'hot'. We define hot 78 /// \brief Print an edge's probability. 80 /// Retrieves an edge's probability similarly to \see getEdgeProbability, bu [all...] |
ProfileDataLoader.h | 39 /// An edge is defined by its source and sink basic blocks. 43 // The profiling information defines an Edge by its source and sink basic 45 typedef std::pair<const BType*, const BType*> Edge; 48 typedef DenseMap<Edge, unsigned> EdgeWeights; 53 /// As a special case, we also hold an edge from the null BasicBlock to the 58 /// getFunction() - Returns the Function for an Edge. 59 static const FType *getFunction(Edge e) { 62 && "A ProfileData::Edge can not be between two functions"); 63 assert(e.second && "A ProfileData::Edge must have a real sink"); 67 /// getEdge() - Creates an Edge between two BasicBlocks [all...] |
ProfileInfo.h | 58 typedef std::pair<const BType*, const BType*> Edge; 59 typedef std::pair<Edge, double> EdgeWeight; 60 typedef std::map<Edge, double> EdgeWeights; 66 // blocks is executed. As a special case, we also hold an edge from the 87 // getFunction() - Returns the Function for an Edge, checking for validity. 88 static const FType* getFunction(Edge e) { 93 llvm_unreachable("Invalid ProfileInfo::Edge"); 96 // getEdge() - Creates an Edge from two BasicBlocks. 97 static Edge getEdge(const BType *Src, const BType *Dest) { 112 double getEdgeWeight(Edge e) const [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 | 204 /// Edge type. 205 typedef std::pair<const BlockT*, const BlockT*> Edge; 208 void getExitEdges(SmallVectorImpl<Edge> &ExitEdges) const; 211 /// loop has a preheader if there is only one edge to the header of the loop
|
/external/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/chromium/chrome/browser/ui/ |
window_sizer.h | 136 // The edge of the screen to check for out-of-bounds. 137 enum Edge { TOP, LEFT, BOTTOM, RIGHT }; 160 // Returns true if the specified position is "offscreen" for the given edge, 161 // meaning that it's outside all work areas in the direction of that edge. 162 bool PositionIsOffscreen(int position, Edge edge) const;
|
/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/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
PolygonShape.h | 41 Edge, 46 OffsetPolygonEdge(const FloatPolygonEdge& edge, const FloatSize& offset) 47 : m_vertex1(edge.vertex1() + offset) 48 , m_vertex2(edge.vertex2() + offset) 49 , m_edgeIndex(edge.edgeIndex()) 50 , m_basis(Edge)
|
/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 --------===// 517 unsigned Edge = 0; 526 Edge); 532 Builder.getInt64(Edge), 533 Builder.getInt64(Edge + 1)); 546 Edge += Successors; 625 // the whole-Module pred edge# between the time we set it and the time we next 638 unsigned Edge = 0; 647 Edge + i); 652 Edge += Successors [all...] |
/external/chromium_org/ash/wm/workspace/ |
snap_sizer.h | 27 enum Edge { 42 Edge edge, 47 static void SnapWindow(wm::WindowState* window_state, Edge edge); 65 // Returns the target bounds based on the edge and the provided |size_index|. 84 // Returns the target bounds based on the edge and |size_index_|. 87 // Returns true if the specified point is along the edge of the screen. 93 const Edge edge_;
|
/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/content/browser/android/ |
edge_effect.h | 27 enum Edge { 35 EdgeEffect(scoped_refptr<cc::Layer> edge, scoped_refptr<cc::Layer> glow); 46 void ApplyToLayers(gfx::SizeF size, Edge edge);
|
/external/chromium_org/third_party/skia/src/core/ |
SkRegion_path.cpp | 365 struct Edge { 376 Edge* fNext; 393 static void find_link(Edge* base, Edge* stop) { 396 if (base->fFlags == Edge::kCompleteLink) { 406 Edge* e = base; 407 if ((base->fFlags & Edge::kY0Link) == 0) { 410 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { 413 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); 420 if ((base->fFlags & Edge::kY1Link) == 0) [all...] |
/external/skia/src/core/ |
SkRegion_path.cpp | 365 struct Edge { 376 Edge* fNext; 393 static void find_link(Edge* base, Edge* stop) { 396 if (base->fFlags == Edge::kCompleteLink) { 406 Edge* e = base; 407 if ((base->fFlags & Edge::kY0Link) == 0) { 410 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) { 413 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link); 420 if ((base->fFlags & Edge::kY1Link) == 0) [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/graphics/ |
GraphicsContext.h | 328 enum Edge {
|