| /external/chromium_org/cc/resources/ |
| 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...] |
| 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...] |
| /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/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/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/llvm/include/llvm/Analysis/ |
| 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...] |
| 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...] |