| /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/skia/legacy/include/utils/ |
| SkBoundaryPatch.h | 17 enum Edge {
23 // Edge index goes clockwise around the boundary, beginning at the "top"
24 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0;
49 virtual SkPoint eval(Edge, SkScalar);
58 virtual SkPoint eval(Edge, SkScalar);
|
| /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...] |
| 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'
|
| /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.
|
| OptimalEdgeProfiling.cpp | 1 //===- OptimalEdgeProfiling.cpp - Insert counters for opt. edge profiling -===//
10 // This pass instruments the specified program with counters for edge profiling.
11 // Edge profiling can give a reasonable approximation of the hot paths through a
15 #define DEBUG_TYPE "insert-optimal-edge-profiling"
49 return "Optimal Edge Profiler";
55 INITIALIZE_PASS_BEGIN(OptimalEdgeProfiler, "insert-optimal-edge-profiling",
56 "Insert optimal instrumentation for edge profiling",
60 INITIALIZE_PASS_END(OptimalEdgeProfiler, "insert-optimal-edge-profiling",
61 "Insert optimal instrumentation for edge profiling",
68 inline static void printEdgeCounter(ProfileInfo::Edge e
150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry); local
173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0); local
184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); local
[all...] |
| GCOVProfiling.cpp | 1 //===- GCOVProfiling.cpp - Insert edge counters for gcov profiling --------===//
483 unsigned Edge = 0;
492 Edge);
498 Builder.getInt64(Edge),
499 Builder.getInt64(Edge + 1));
512 Edge += Successors;
595 // the whole-Module pred edge# between the time we set it and the time we next
608 unsigned Edge = 0;
617 Edge + i);
622 Edge += Successors
[all...] |
| /external/skia/legacy/src/core/ |
| SkRegion_path.cpp | 318 struct Edge {
329 Edge* fNext;
346 static void find_link(Edge* base, Edge* stop) {
349 if (base->fFlags == Edge::kCompleteLink) {
359 Edge* e = base;
360 if ((base->fFlags & Edge::kY0Link) == 0) {
363 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) {
366 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link);
373 if ((base->fFlags & Edge::kY1Link) == 0)
[all...] |
| /external/skia/src/core/ |
| SkRegion_path.cpp | 333 struct Edge {
344 Edge* fNext;
361 static void find_link(Edge* base, Edge* stop) {
364 if (base->fFlags == Edge::kCompleteLink) {
374 Edge* e = base;
375 if ((base->fFlags & Edge::kY0Link) == 0) {
378 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) {
381 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link);
388 if ((base->fFlags & Edge::kY1Link) == 0)
[all...] |
| /external/llvm/lib/Analysis/ |
| ProfileEstimatorPass.cpp | 38 std::map<Edge,double> MinimalWeight;
71 void inline printEdgeWeight(Edge);
101 static void inline printEdgeError(ProfileInfo::Edge e, const char *M) {
102 DEBUG(dbgs() << "-- Edge " << e << " is not calculated, " << M << "\n");
105 void inline ProfileEstimatorPass::printEdgeWeight(Edge E) {
106 DEBUG(dbgs() << "-- Weight of Edge " << E << ":"
116 // flow, once an edge has a flow assigned this flow is never changed again,
134 Edge edge = getEdge(*bbi,BB); local
135 double w = getEdgeWeight(edge);
205 Edge edge = getEdge(Latch,0); local
267 Edge edge = getEdge(BB,0); local
273 Edge edge = getEdge(BB,*bbi); local
341 Edge edge = getEdge(0,entry); local
[all...] |
| ProfileInfoLoaderPass.cpp | 42 std::set<Edge> SpanningTree;
61 // recurseBasicBlock() - Calculates the edge weights for as much basic
64 virtual void readEdgeOrRemember(Edge, Edge&, unsigned &, double &);
65 virtual void readEdge(ProfileInfo::Edge, std::vector<unsigned>&);
97 void LoaderPass::readEdgeOrRemember(Edge edge, Edge &tocalc,
100 if ((w = getEdgeWeight(edge)) == MissingValue) {
101 tocalc = edge;
[all...] |
| ProfileInfo.cpp | 75 Edge e = getEdge(0, BB);
79 // the sum of the edge frequencies from the incoming edges.
102 Edge e = getEdge(BB,0);
183 void ProfileInfoT<Function,BasicBlock>::addEdgeWeight(Edge e, double w) {
185 assert (oldw != MissingValue && "Adding weight to Edge with no previous weight");
186 DEBUG(dbgs() << "Adding to Edge " << e
212 void ProfileInfoT<Function,BasicBlock>::removeEdge(Edge e) {
223 replaceEdge(const Edge &oldedge, const Edge &newedge) {
260 Edge e = getEdge(BB,*Succ)
[all...] |
| ProfileDataLoaderPass.cpp | 65 virtual void readEdge(unsigned, ProfileData&, ProfileData::Edge,
92 /// readEdge - Take the value from a profile counter and assign it to an edge.
94 ProfileData &PB, ProfileData::Edge e,
102 DEBUG(dbgs() << "-- Read Edge Counter for " << e
107 /// matchEdges - Link every profile counter with an edge.
131 /// edge into branch weights for each conditional branch (a branch with 2 or
152 ProfileData::Edge edge = PB.getEdge(BB, TI->getSuccessor(s)); local
153 Weights[s] = (uint32_t)PB.getEdgeWeight(edge);
154 DEBUG(dbgs() << "---- Edge '" << edge << "' has weight
[all...] |
| ProfileVerifierPass.cpp | 86 double ReadOrAssert(typename ProfileInfoT<FType, BType>::Edge);
105 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(*bbi,BB);
108 dbgs() << "calculated in-edge " << E << ": "
120 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(BB,*bbi);
123 dbgs() << "calculated out-edge " << E << ": "
201 double ProfileVerifierPassT<FType, BType>::ReadOrAssert(typename ProfileInfoT<FType, BType>::Edge E) {
204 dbgs() << "Edge " << E << " in Function "
206 ASSERTMESSAGE("Edge has missing value");
210 dbgs() << "Edge " << E << " in Function "
212 ASSERTMESSAGE("Edge has negative value")
[all...] |
| /external/opencv/cvaux/src/ |
| enmin.cpp | 81 // struct Edge is used for storing edges of graph
82 // weight - weight of the edge ( maximum flow via the edge )
83 // flow - current flow via the edge
86 struct Edge
198 getSizeForGraph( Edge ),
231 /* adding edge oriented from alpha vertex to current vertex */
233 ( ( Edge* )newEdgePtr ) -> weight = dFunc( leftLine,
238 ( ( Edge* )newEdgePtr ) -> flow = 0;
245 ( ( Edge* )newEdgePtr ) -> weight +
[all...] |
| /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/skia/legacy/src/utils/ |
| SkBoundaryPatch.cpp | 65 SkPoint SkLineBoundary::eval(Edge e, SkScalar t) {
70 SkPoint SkCubicBoundary::eval(Edge e, SkScalar t) {
|
| /external/skia/src/utils/ |
| SkBoundaryPatch.cpp | 67 SkPoint SkLineBoundary::eval(Edge e, SkScalar t) {
72 SkPoint SkCubicBoundary::eval(Edge e, SkScalar t) {
|
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
| 3d-cube.js | 300 // anti-clockwise edge check
301 Q.Edge = [[0,1,2],[3,2,6],[7,6,5],[4,5,1],[4,0,3],[1,5,6]];
305 for (var i = 0; i < Q.Edge.length; i++) Q.Normal[i] = CalcNormal(Q[Q.Edge[i][0]].V, Q[Q.Edge[i][1]].V, Q[Q.Edge[i][2]].V);
|
| /external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
| 3d-cube.js | 300 // anti-clockwise edge check
301 Q.Edge = [[0,1,2],[3,2,6],[7,6,5],[4,5,1],[4,0,3],[1,5,6]];
305 for (var i = 0; i < Q.Edge.length; i++) Q.Normal[i] = CalcNormal(Q[Q.Edge[i][0]].V, Q[Q.Edge[i][1]].V, Q[Q.Edge[i][2]].V);
|
| /external/llvm/lib/CodeGen/ |
| CriticalAntiDepBreaker.cpp | 129 // Find the predecessor edge with the greatest depth.
135 // In the case of a latency tie, prefer an anti-dependency edge over
486 // fix that remaining critical edge too. This is a little more involved,
513 // edge per instruction. Note that we'd have to be able to break all of
517 if (const SDep *Edge = CriticalPathStep(CriticalPathSU)) {
518 const SUnit *NextSU = Edge->getSUnit();
521 if (Edge->getKind() == SDep::Anti) {
522 AntiDepReg = Edge->getReg();
610 DEBUG(dbgs() << "Breaking anti-dependence edge on "
|
| /system/core/libpixelflinger/ |
| trap.cpp | 604 // the following routine fills a triangle via edge stepping, which
631 struct Edge
633 int32_t x; // edge position in 16.16 coordinates
640 edge_dump( Edge* edge )
643 edge->y_top, edge->y_top/float(TRI_ONE),
644 edge->y_bot, edge->y_bot/float(TRI_ONE),
645 edge->x, edge->x/float(FIXED_ONE)
672 Edge* edge = edges + *pcount; local
862 AAEdge* edge = edges + *pcount; local
[all...] |
| /external/llvm/tools/llvm-prof/ |
| llvm-prof.cpp | 105 std::vector<std::pair<ProfileInfo::Edge, double> > SuccCounts;
115 OS << "\t;;; Out-edge counts:";
152 std::map<ProfileInfo::Edge, unsigned> EdgeFreqs;
|
