| /external/llvm/include/llvm/Analysis/ |
| BranchProbabilityInfo.h | 28 // Default weight value. Used when we don't have information about the edge.
31 // weight to an edge that may have siblings with non-zero weights. This can
32 // be handled various ways, but it's probably fine for an edge with unknown
36 typedef std::pair<const BasicBlock *, const BasicBlock *> Edge;
38 DenseMap<Edge, uint32_t> Weights;
62 // A 'Hot' edge is an edge which probability is >= 80%.
|
| ProfileInfo.h | 57 typedef std::pair<const BType*, const BType*> Edge;
58 typedef std::pair<Edge, double> EdgeWeight;
59 typedef std::map<Edge, double> EdgeWeights;
65 // blocks is executed. As a special case, we also hold an edge from the
86 // getFunction() - Returns the Function for an Edge, checking for validity.
87 static const FType* getFunction(Edge e) {
93 assert(0 && "Invalid ProfileInfo::Edge");
97 // getEdge() - Creates an Edge from two BasicBlocks.
98 static Edge getEdge(const BType *Src, const BType *Dest) {
113 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 | 242 /// Edge type.
243 typedef std::pair<BlockT*, BlockT*> Edge;
264 /// 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 --------===//
454 unsigned Edge = 0;
463 Edge);
471 ConstantInt::get(Type::getInt64Ty(*Ctx), Edge),
472 ConstantInt::get(Type::getInt64Ty(*Ctx), Edge + 1));
486 Edge += Successors;
529 // the whole-Module pred edge# between the time we set it and the time we next
542 unsigned Edge = 0;
551 Edge + i);
556 Edge += Successors
[all...] |
| /external/skia/include/utils/ |
| SkBoundaryPatch.h | 10 enum Edge {
16 // Edge index goes clockwise around the boundary, beginning at the "top"
17 virtual SkPoint eval(Edge, SkScalar unitInterval) = 0;
42 virtual SkPoint eval(Edge, SkScalar);
51 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/gpu/include/ |
| GrDrawTarget.h | 60 * a single draw call when performing edge antialiasing. This is used for
139 class Edge {
141 Edge() {}
142 Edge(float x, float y, float z) : fX(x), fY(y), fZ(z) {}
143 GrPoint intersect(const Edge& other) {
189 Edge fEdgeAAEdges[kMaxEdges];
557 * Sets the edge data required for edge antialiasing.
559 * @param edges 3 * 6 float values, representing the edge
562 void setEdgeAAData(const Edge* edges, int numEdges)
[all...] |
| /external/skia/src/core/ |
| SkRegion_path.cpp | 326 struct Edge {
337 Edge* fNext;
354 static void find_link(Edge* base, Edge* stop) {
357 if (base->fFlags == Edge::kCompleteLink) {
367 Edge* e = base;
368 if ((base->fFlags & Edge::kY0Link) == 0) {
371 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) {
374 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link);
381 if ((base->fFlags & Edge::kY1Link) == 0)
[all...] |
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 39 typedef std::pair<const BasicBlock *, const BasicBlock *> Edge;
64 // Probability of the edge BB2->BB1 = 124 / (124 + 4) = 0.96875
65 // Probability of the edge BB2->BB3 = 4 / (124 + 4) = 0.03125
80 // the edge.
83 // Minimum weight of an edge. Please note, that weight is NEVER 0.
179 // Calculate Edge Weights using "Return Heuristics". Predict a successor which
219 // Calculate Edge Weights using "Pointer Heuristics". Predict a comparsion
254 // Calculate Edge Weights using "Loop Branch Heuristics". Predict backedges
468 // Return edge's weight. If can't find it, return DEFAULT_WEIGHT value.
471 Edge E(Src, Dst)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SCCP.cpp | 210 typedef std::pair<BasicBlock*, BasicBlock*> Edge;
211 DenseSet<Edge> KnownFeasibleEdges;
434 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second)
435 return; // This edge is already known to be executable!
438 // If the destination is already executable, we just made an *edge*
441 DEBUG(dbgs() << "Marking Edge Executable: " << Source->getName()
456 // isEdgeFeasible - Return true if the control flow edge from the 'From' basic
617 // isEdgeFeasible - Return true if the control flow edge from the 'From' basic
626 // Check to make sure this edge itself is actually feasible now.
635 // undef conditions mean that neither edge is feasible yet
[all...] |
| GVN.cpp | [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/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGRRList.cpp | 194 /// WillCreateCycle - Returns true if adding an edge from SU to TargetSU will
200 /// AddPred - adds a predecessor edge to SUnit SU.
208 /// RemovePred - removes a predecessor edge from SUnit SU.
209 /// This returns true if an edge was removed.
[all...] |
| /external/opencv/cvaux/src/ |
| cvlee.cpp | 199 // (site is an edge of polygon or a reflex vertex).
[all...] |
| /prebuilt/common/asm/ |
| asm-3.1.jar | |
| /prebuilt/common/jarjar/ |
| jarjar-1.0rc8.jar | |
| /prebuilt/common/eclipse/ |
| org.eclipse.jface_3.4.2.M20090107-0800.jar | |
| /prebuilt/common/groovy/ |
| groovy-all-1.7.0.jar | |
