| /external/llvm/include/llvm/Analysis/ |
| BranchProbabilityInfo.h | 30 /// probabilities of each "edge" in the function's CFG where such an edge is
48 /// \brief Get an edge's probability, relative to other out-edges of the Src.
51 /// (0%) and one (100%) of this edge executing, relative to other edges
57 /// \brief Test if an edge is hot relative to other out-edges of the Src.
59 /// Check whether this edge out of the source block is 'hot'. We define hot
69 /// \brief Print an edge's probability.
71 /// Retrieves an edge's probability similarly to \see getEdgeProbability, but
77 /// \brief Get the raw edge weight calculated for the block pair.
79 /// This returns the raw edge weight. It is guaranteed to fall between 1 an
[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 | 241 /// Edge type.
242 typedef std::pair<BlockT*, BlockT*> Edge;
263 /// loop has a preheader if there is only one edge to the header of the loop
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| MaximumSpanningTree.h | 54 typedef std::pair<const T*, const T*> Edge;
55 typedef std::pair<Edge, double> EdgeWeight;
58 typedef std::vector<Edge> MaxSpanTree;
77 Edge e = (*EWi).first;
86 Edge e = (*EWi).first;
90 // So we know now that the edge is not already in a subtree, so we push
91 // the edge to the MST.
|
| GCOVProfiling.cpp | 1 //===- GCOVProfiling.cpp - Insert edge counters for gcov profiling --------===//
455 unsigned Edge = 0;
464 Edge);
472 ConstantInt::get(Type::getInt64Ty(*Ctx), Edge),
473 ConstantInt::get(Type::getInt64Ty(*Ctx), Edge + 1));
487 Edge += Successors;
530 // the whole-Module pred edge# between the time we set it and the time we next
543 unsigned Edge = 0;
552 Edge + i);
557 Edge += Successors
[all...] |
| /external/skia/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/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/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/llvm/lib/Transforms/Scalar/ |
| SCCP.cpp | 205 typedef std::pair<BasicBlock*, BasicBlock*> Edge;
206 DenseSet<Edge> KnownFeasibleEdges;
429 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second)
430 return; // This edge is already known to be executable!
433 // If the destination is already executable, we just made an *edge*
436 DEBUG(dbgs() << "Marking Edge Executable: " << Source->getName()
451 // isEdgeFeasible - Return true if the control flow edge from the 'From' basic
585 // isEdgeFeasible - Return true if the control flow edge from the 'From' basic
594 // Check to make sure this edge itself is actually feasible now.
603 // undef conditions mean that neither edge is feasible yet
[all...] |
| GVN.cpp | [all...] |
| /external/skia/src/gpu/ |
| GrDrawState.h | 529 // @name Edge AA
530 // There are two ways to perform antialiasing using edge equations. One
531 // is to specify an (linear or quadratic) edge eq per-vertex. This requires
541 * the edge type requires fewer than 4.
559 * Determines the interpretation per-vertex edge data when the
572 * a single draw call when performing edge antialiasing. This is used for
582 class Edge {
584 Edge() {}
585 Edge(float x, float y, float z) : fX(x), fY(y), fZ(z) {}
586 GrPoint intersect(const Edge& other)
[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/opencv/cvaux/src/ |
| cvlee.cpp | 199 // (site is an edge of polygon or a reflex vertex).
[all...] |
| /prebuilt/common/asm/ |
| asm-4.0.jar | |
| /prebuilts/tools/common/asm-tools/ |
| asm-4.0.jar | |
| /external/dexmaker/lib/ |
| jarjar.jar | |
| /prebuilt/common/jarjar/ |
| jarjar-1.0rc8.jar | |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.objectweb.asm_3.2.0.v200909071300.jar | |
| org.eclipse.jface_3.6.1.M20100825-0800.jar | |
| /prebuilts/tools/common/lombok-ast/ |
| lombok-ast-0.2.jar | |
| /prebuilts/tools/common/eclipse/ |
| org.eclipse.jface_3.4.2.M20090107-0800.jar | |
| org.eclipse.jface_3.6.2.M20110210-1200.jar | |
| /prebuilt/common/groovy/ |
| groovy-all-1.7.0.jar | |
