| /external/llvm/include/llvm/Analysis/ |
| 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
|
| LoopInfoImpl.h | 97 getExitEdges(SmallVectorImpl<Edge> &ExitEdges) const {
110 ExitEdges.push_back(Edge(*BI, *I));
114 /// loop has a preheader if there is only one edge to the header of the loop
|
| /external/skia/src/utils/ |
| SkBoundaryPatch.cpp | 67 SkPoint SkLineBoundary::eval(Edge e, SkScalar t) {
72 SkPoint SkCubicBoundary::eval(Edge e, SkScalar t) {
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| 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 --------===//
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/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 310 Graph::Edge *e = cfg.outgoing(true).getEdge();
322 this->cfg.attach(&bb->cfg, Graph::Edge::TREE);
365 Graph::Edge::Type eR;
375 // IF block is out edge to the right
376 if (eR == Graph::Edge::CROSS || eR == Graph::Edge::BACK)
520 case Graph::Edge::TREE:
523 case Graph::Edge::FORWARD:
526 case Graph::Edge::CROSS:
529 case Graph::Edge::BACK
[all...] |
| nv50_ir_from_sm4.cpp | [all...] |
| nv50_ir_from_tgsi.cpp | [all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 310 Graph::Edge *e = cfg.outgoing(true).getEdge();
322 this->cfg.attach(&bb->cfg, Graph::Edge::TREE);
365 Graph::Edge::Type eR;
375 // IF block is out edge to the right
376 if (eR == Graph::Edge::CROSS || eR == Graph::Edge::BACK)
520 case Graph::Edge::TREE:
523 case Graph::Edge::FORWARD:
526 case Graph::Edge::CROSS:
529 case Graph::Edge::BACK
[all...] |
| nv50_ir_from_sm4.cpp | [all...] |
| nv50_ir_from_tgsi.cpp | [all...] |
| /external/chromium_org/chrome/browser/ui/window_sizer/ |
| window_sizer.h | 132 // The edge of the screen to check for out-of-bounds.
133 enum Edge { TOP, LEFT, BOTTOM, RIGHT };
|
| /external/chromium_org/third_party/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/chromium_org/third_party/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/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
| 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/chromium_org/content/browser/android/ |
| edge_effect.cc | 44 // How much dragging should effect the height of the edge image.
77 gfx::Transform ComputeTransform(EdgeEffect::Edge edge,
79 switch (edge) {
104 EdgeEffect::Edge edge,
110 layer->SetTransform(ComputeTransform(edge, size, height));
117 EdgeEffect::EdgeEffect(scoped_refptr<cc::Layer> edge,
119 : edge_(edge)
229 // The edge should always be at least partially visible, regardles
[all...] |
| /external/llvm/lib/Analysis/ |
| 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...] |
| BranchProbabilityInfo.cpp | 53 // Probability of the edge BB2->BB1 = 124 / (124 + 4) = 0.96875
54 // Probability of the edge BB2->BB3 = 4 / (124 + 4) = 0.03125
109 // the edge.
112 // Minimum weight of an edge. Please note, that weight is NEVER 0.
120 /// \brief Calculate edge weights for successors lead to unreachable.
210 /// \brief Calculate edge weights for edges leading to cold blocks.
271 // Calculate Edge Weights using "Pointer Heuristics". Predict a comparsion
304 // Calculate Edge Weights using "Loop Branch Heuristics". Predict backedges
566 /// Get the raw edge weight for the edge. If can't find it, retur
[all...] |
| /external/chromium_org/ash/wm/workspace/ |
| snap_sizer.cc | 30 // . The mouse is against the edge of the screen and the mouse is moved
71 Edge edge,
74 edge_(edge),
91 void SnapSizer::SnapWindow(aura::Window* window, SnapSizer::Edge edge) {
94 internal::SnapSizer sizer(window, gfx::Point(), edge,
|
| /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/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 "
|
| AggressiveAntiDepBreaker.cpp | 278 // Find the predecessor edge with the greatest depth.
285 // In the case of a latency tie, prefer an anti-dependency edge over
794 const SDep *Edge = Edges[i];
795 SUnit *NextSU = Edge->getSUnit();
797 if ((Edge->getKind() != SDep::Anti) &&
798 (Edge->getKind() != SDep::Output)) continue;
800 unsigned AntiDepReg = Edge->getReg();
881 DEBUG(dbgs() << "\tBreaking anti-dependence edge on "
[all...] |
| /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;
|
