| /dalvik/tests/084-class-init/ |
| info.txt | 1 Test class initialization edge cases and race conditions.
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| cfghooks.h | 39 /* Redirect edge E to the given basic block B and update underlying program
40 representation. Returns edge representing redirected branch (that may not
42 if edge is not easily redirectable for whatever reason. */
43 edge (*redirect_edge_and_branch) (edge e, basic_block b);
46 newly created forwarder basic block is returned. The edge must
48 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
50 /* Returns true if it is possible to remove the edge by redirecting it
51 to the destination of the other edge going from its source. */
70 /* Predict edge E using PREDICTOR to given PROBABILITY. *
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| cfghooks.h | 39 /* Redirect edge E to the given basic block B and update underlying program
40 representation. Returns edge representing redirected branch (that may not
42 if edge is not easily redirectable for whatever reason. */
43 edge (*redirect_edge_and_branch) (edge e, basic_block b);
46 newly created forwarder basic block is returned. The edge must
48 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
50 /* Returns true if it is possible to remove the edge by redirecting it
51 to the destination of the other edge going from its source. */
70 /* Predict edge E using PREDICTOR to given PROBABILITY. *
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| cfghooks.h | 39 /* Redirect edge E to the given basic block B and update underlying program
40 representation. Returns edge representing redirected branch (that may not
42 if edge is not easily redirectable for whatever reason. */
43 edge (*redirect_edge_and_branch) (edge e, basic_block b);
46 newly created forwarder basic block is returned. The edge must
48 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
50 /* Returns true if it is possible to remove the edge by redirecting it
51 to the destination of the other edge going from its source. */
70 /* Predict edge E using PREDICTOR to given PROBABILITY. *
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| cfghooks.h | 39 /* Redirect edge E to the given basic block B and update underlying program
40 representation. Returns edge representing redirected branch (that may not
42 if edge is not easily redirectable for whatever reason. */
43 edge (*redirect_edge_and_branch) (edge e, basic_block b);
46 newly created forwarder basic block is returned. The edge must
48 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
50 /* Returns true if it is possible to remove the edge by redirecting it
51 to the destination of the other edge going from its source. */
70 /* Predict edge E using PREDICTOR to given PROBABILITY. *
[all...] |
| /cts/tests/tests/webkitsecurity/assets/ |
| number-parsing-crash.js | 2 "This tests edge cases of number parsing."
|
| /external/mesa3d/src/glsl/builtins/ir/ |
| step | 4 (declare (in) float edge)
6 ((return (expression float b2f (expression bool >= (var_ref x) (var_ref edge))))))
10 (declare (in) float edge)
13 (assign (constant bool (1)) (x) (var_ref t) (expression float b2f (expression bool >= (swiz x (var_ref x))(var_ref edge))))
14 (assign (constant bool (1)) (y) (var_ref t) (expression float b2f (expression bool >= (swiz y (var_ref x))(var_ref edge))))
19 (declare (in) float edge)
22 (assign (constant bool (1)) (x) (var_ref t) (expression float b2f (expression bool >= (swiz x (var_ref x))(var_ref edge))))
23 (assign (constant bool (1)) (y) (var_ref t) (expression float b2f (expression bool >= (swiz y (var_ref x))(var_ref edge))))
24 (assign (constant bool (1)) (z) (var_ref t) (expression float b2f (expression bool >= (swiz z (var_ref x))(var_ref edge))))
29 (declare (in) float edge)
[all...] |
| /external/replicaisland/tools/ |
| ExtractPoints.js | 27 * edge calculation for debugging purposes.
75 var edge = new Object;
77 edge.startX = firstPoint.anchor[0];
78 edge.startY = firstPoint.anchor[1];
80 edge.endX = lastPoint.anchor[0];
81 edge.endY = lastPoint.anchor[1];
83 var normalX = -(edge.endY - edge.startY);
84 var normalY = edge.endX - edge.startX
[all...] |
| /external/opencv/cv/src/ |
| cvsubdivision2d.cpp | 72 * Quad Edge algebra *
78 CvQuadEdge2D *edge = 0; local
88 edge = (CvQuadEdge2D*)cvSetNew( (CvSet*)subdiv->edges );
91 memset( edge->pt, 0, sizeof( edge->pt ));
92 edgehandle = (CvSubdiv2DEdge) edge;
94 edge->next[0] = edgehandle;
95 edge->next[1] = edgehandle + 3;
96 edge->next[2] = edgehandle + 2;
97 edge->next[3] = edgehandle + 1
254 CvSubdiv2DEdge edge = 0; local
734 CvSubdiv2DEdge edge; local
[all...] |
| /external/skia/src/core/ |
| SkRegion_rects.cpp | 64 SkRegion::RunType append(SkRegion::RunType top, const VEdge* edge);
92 SkRegion::RunType Accumulator::append(SkRegion::RunType currY, const VEdge* edge) {
99 int winding = edge->fWinding;
103 if (edge->fTop > currY) {
104 nextY = SkMin32(nextY, edge->fTop);
108 *row++ = edge->fX;
109 TRACE_ROW(SkDebugf("Y %d [%d", currY, edge->fX);)
110 edge = edge->fNext;
112 if (edge->fTop > currY)
[all...] |
| SkEdgeBuilder.cpp | 24 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local
25 if (edge->setLine(pts[0], pts[1], NULL, fShiftUp)) {
26 fList.push(edge);
28 // TODO: unallocate edge from storage...
33 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local
34 if (edge->setQuadratic(pts, fShiftUp)) {
35 fList.push(edge);
37 // TODO: unallocate edge from storage...
42 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local
43 if (edge->setCubic(pts, NULL, fShiftUp))
[all...] |
| /external/llvm/test/Analysis/BranchProbabilityInfo/ |
| basic.ll | 7 ; CHECK: edge entry -> body probability is 16 / 16 = 100%
18 ; CHECK: edge body -> exit probability is 4 / 128
19 ; CHECK: edge body -> body probability is 124 / 128
30 ; CHECK: edge entry -> then probability is 64 / 68
31 ; CHECK: edge entry -> else probability is 4 / 68
35 ; CHECK: edge then -> exit probability is 16 / 16 = 100%
39 ; CHECK: edge else -> exit probability is 16 / 16 = 100%
55 ; CHECK: edge entry -> case_a probability is 4 / 80
56 ; CHECK: edge entry -> case_b probability is 4 / 80
57 ; CHECK: edge entry -> case_c probability is 64 / 8
[all...] |
| noreturn.ll | 11 ; CHECK: edge entry -> exit probability is 1048575 / 1048576
12 ; CHECK: edge entry -> abort probability is 1 / 1048576
29 ; CHECK: edge entry -> exit probability is 1048575 / 1048579
30 ; CHECK: edge entry -> case_a probability is 1 / 1048579
31 ; CHECK: edge entry -> case_b probability is 1 / 1048579
32 ; CHECK: edge entry -> case_c probability is 1 / 1048579
33 ; CHECK: edge entry -> case_d probability is 1 / 1048579
58 ; CHECK: edge entry -> exit probability is 1048575 / 1048576
59 ; CHECK: edge entry -> dom probability is 1 / 1048576
64 ; CHECK: edge dom -> idom1 probability is 1 /
[all...] |
| loop.ll | 12 ; CHECK: edge entry -> do.body probability is 16 / 16 = 100%
18 ; CHECK: edge do.body -> do.body1 probability is 124 / 124 = 100%
26 ; CHECK: edge do.body1 -> do.body1 probability is 124 / 128
27 ; CHECK: edge do.body1 -> do.end probability is 4 / 128
34 ; CHECK: edge do.end -> do.body probability is 124 / 128
35 ; CHECK: edge do.end -> do.end5 probability is 4 / 128
46 ; CHECK: edge entry -> for.body.lr.ph probability is 20 / 32
47 ; CHECK: edge entry -> for.end6 probability is 12 / 32
52 ; CHECK: edge for.body.lr.ph -> for.body probability is 16 / 16 = 100%
58 ; CHECK: edge for.body -> for.body3 probability is 62 / 124 = 50
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 26 /** the edge of the dragged node that is matched */
29 /** the "other" edge that the dragged edge is matched with */
30 public final Segment edge; field in class:Match
48 * @param edge the "other" edge that the dragged edge is matched with
49 * @param with the edge of the dragged node that is matched
53 public Match(GuidelineHandler handler, Segment edge, Segment with,
57 this.edge = edge
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| PathProfiling.cpp | 28 // v->w, insert edge ENTRY->w and edge v->EXIT.
33 // Chord - An edge not in the spanning tree.
108 // instrumentation that will end up on each edge.
115 // Sets the target node of this edge. Required to split edges.
118 // Get/set whether edge is in the spanning tree.
122 // Get/ set whether this edge will be instrumented with a path number
127 // Get/set whether this edge will be instrumented with a path counter
134 // Get/set the path number increment that this edge will be instrumented
142 // Get/set whether the edge has been instrumented
651 BallLarusEdge* edge; local
[all...] |
| 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...] |
| /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...] |
| PathNumbering.cpp | 114 // Add an edge to the predecessor list.
115 void BallLarusNode::addPredEdge(BallLarusEdge* edge) {
116 _predEdges.push_back(edge);
119 // Remove an edge from the predecessor list.
120 void BallLarusNode::removePredEdge(BallLarusEdge* edge) {
121 removeEdge(_predEdges, edge);
124 // Add an edge to the successor list.
125 void BallLarusNode::addSuccEdge(BallLarusEdge* edge) {
126 _succEdges.push_back(edge);
129 // Remove an edge from the successor list
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| PathNumbering.h | 87 // Add an edge to the predecessor list.
88 void addPredEdge(BallLarusEdge* edge);
90 // Remove an edge from the predecessor list.
91 void removePredEdge(BallLarusEdge* edge);
93 // Add an edge to the successor list.
94 void addSuccEdge(BallLarusEdge* edge);
96 // Remove an edge from the successor list.
97 void removeSuccEdge(BallLarusEdge* edge);
123 // Removes an edge from an edgeVector. Used by removePredEdge and
128 // Represents an edge in the Dag. For an edge, v -> w, v is the source, an
[all...] |
| 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...] |
| /external/llvm/test/CodeGen/ARM/ |
| 2007-05-23-BadPreIndexedStore.ll | 19 %edge.230.0.rec = shl i32 %indvar, 1 ; <i32> [#uses=3]
20 %edge.230.0 = getelementptr %struct.shape_edge_t* null, i32 %edge.230.0.rec ; <%struct.shape_edge_t*> [#uses=1]
21 %edge.230.0.sum6970 = or i32 %edge.230.0.rec, 1 ; <i32> [#uses=2]
22 %tmp154 = getelementptr %struct.shape_edge_t* null, i32 %edge.230.0.sum6970 ; <%struct.shape_edge_t*> [#uses=1]
23 %tmp11.i5 = getelementptr %struct.shape_edge_t* null, i32 %edge.230.0.sum6970, i32 0 ; <%struct.shape_edge_t**> [#uses=1]
24 store %struct.shape_edge_t* %edge.230.0, %struct.shape_edge_t** %tmp11.i5
26 %tmp16254.0.rec = add i32 %edge.230.0.rec, 2 ; <i32> [#uses=1]
|
| /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/freetype/src/autofit/ |
| aflatin.c | 791 /* we are already on an edge, try to locate its start */
825 /* we are just leaving an edge; record a new segment! */
1083 /* an edge in our table that corresponds to its position. */
1085 /* If no edge is found, we create and insert a new edge in the */
1086 /* sorted table. Otherwise, we simply add the segment to the edge's */
1088 /* edge's properties. */
1090 /* Note that the table of edges is sorted along the segment/edge */
1095 /* assure that edge distance threshold is at most 0.25px */
1122 AF_Edge edge = axis->edges + ee; local
1139 AF_Edge edge; local
1195 AF_Edge edge; local
1358 AF_Edge edge = axis->edges; local
1807 AF_Edge edge; local
[all...] |
| aflatin2.c | 737 /* already on an edge ?, backtrack to find its start */
1084 /* to find an edge in our table that corresponds to its position. */
1086 /* If no edge is found, we create and insert a new edge in the */
1087 /* sorted table. Otherwise, we simply add the segment to the edge's */
1089 /* edge's properties. */
1091 /* Note that the edges table is sorted along the segment/edge */
1134 AF_Edge edge = axis->edges + ee; local
1151 AF_Edge edge; local
1205 AF_Edge edge; local
1363 AF_Edge edge = axis->edges; local
1813 AF_Edge edge; local
[all...] |
