| /art/test/084-class-init/ |
| info.txt | 1 Test class initialization edge cases and race conditions.
|
| /dalvik/tests/084-class-init/ |
| info.txt | 1 Test class initialization edge cases and race conditions.
|
| /external/pixman/pixman/ |
| pixman-edge-accessors.c | 4 #include "pixman-edge.c"
|
| /external/chromium_org/third_party/mesa/src/src/glsl/builtins/ir/ |
| step.ir | 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 (x) (var_ref t) (expression float b2f (expression bool >= (swiz x (var_ref x))(var_ref edge))))
14 (assign (y) (var_ref t) (expression float b2f (expression bool >= (swiz y (var_ref x))(var_ref edge))))
19 (declare (in) float edge)
22 (assign (x) (var_ref t) (expression float b2f (expression bool >= (swiz x (var_ref x))(var_ref edge))))
23 (assign (y) (var_ref t) (expression float b2f (expression bool >= (swiz y (var_ref x))(var_ref edge))))
24 (assign (z) (var_ref t) (expression float b2f (expression bool >= (swiz z (var_ref x))(var_ref edge))))
29 (declare (in) float edge)
[all...] |
| /external/mesa3d/src/glsl/builtins/ir/ |
| step.ir | 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 (x) (var_ref t) (expression float b2f (expression bool >= (swiz x (var_ref x))(var_ref edge))))
14 (assign (y) (var_ref t) (expression float b2f (expression bool >= (swiz y (var_ref x))(var_ref edge))))
19 (declare (in) float edge)
22 (assign (x) (var_ref t) (expression float b2f (expression bool >= (swiz x (var_ref x))(var_ref edge))))
23 (assign (y) (var_ref t) (expression float b2f (expression bool >= (swiz y (var_ref x))(var_ref edge))))
24 (assign (z) (var_ref t) (expression float b2f (expression bool >= (swiz z (var_ref x))(var_ref edge))))
29 (declare (in) float edge)
[all...] |
| /prebuilts/gcc/darwin-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/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...] |
| /external/chromium_org/ash/wm/workspace/ |
| magnetism_matcher_unittest.cc | 12 // Trivial test case verifying assertions on left edge.
18 MatchedEdge edge; local
21 initial_bounds.y() - distance - 10, 2, 3), &edge));
25 &edge));
26 EXPECT_EQ(MAGNETISM_EDGE_LEFT, edge.primary_edge);
27 EXPECT_EQ(SECONDARY_MAGNETISM_EDGE_LEADING, edge.secondary_edge);
32 &edge));
33 EXPECT_EQ(MAGNETISM_EDGE_LEFT, edge.primary_edge);
34 EXPECT_EQ(SECONDARY_MAGNETISM_EDGE_NONE, edge.secondary_edge);
37 // Trivial test case verifying assertions on bottom edge
43 MatchedEdge edge; local
72 MatchedEdge edge; local
101 MatchedEdge edge; local
124 MatchedEdge edge; local
149 MatchedEdge edge; local
[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/chromium_org/cc/resources/ |
| layer_quad.h | 23 class Edge {
25 Edge() : x_(0), y_(0), z_(0) {}
26 Edge(gfx::PointF p, gfx::PointF q);
60 gfx::PointF Intersect(const Edge& e) const {
72 LayerQuad(const Edge& left,
73 const Edge& top,
74 const Edge& right,
75 const Edge& bottom);
78 Edge left() const { return left_; }
79 Edge top() const { return top_;
[all...] |
| layer_quad.cc | 12 LayerQuad::Edge::Edge(gfx::PointF p, gfx::PointF q) {
24 left_ = Edge(quad.p4(), quad.p1());
25 right_ = Edge(quad.p2(), quad.p3());
26 top_ = Edge(quad.p1(), quad.p2());
27 bottom_ = Edge(quad.p3(), quad.p4());
36 LayerQuad::LayerQuad(const Edge& left,
37 const Edge& top,
38 const Edge& right,
39 const Edge& bottom
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
95 void Graph::Node::attach(Node *node, Edge::Type kind)
97 Edge *edge = new Edge(this, node, kind); local
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
356 Graph::Edge *edge; local
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 53 void Graph::Edge::unlink()
73 const char *Graph::Edge::typeStr() const
95 void Graph::Node::attach(Node *node, Edge::Type kind)
97 Edge *edge = new Edge(this, node, kind); local
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
356 Graph::Edge *edge; local
[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/chromium_org/third_party/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...] |
| /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...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 28 /** the edge of the dragged node that is matched */
31 /** the "other" edge that the dragged edge is matched with */
32 public final Segment edge; field in class:Match
50 * @param edge the "other" edge that the dragged edge is matched with
51 * @param with the edge of the dragged node that is matched
55 public Match(GuidelineHandler handler, Segment edge, Segment with,
59 this.edge = edge
[all...] |
| /external/llvm/test/Analysis/BranchProbabilityInfo/ |
| 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...] |
| /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.
107 // instrumentation that will end up on each edge.
114 // Sets the target node of this edge. Required to split edges.
117 // Get/set whether edge is in the spanning tree.
121 // Get/ set whether this edge will be instrumented with a path number
126 // Get/set whether this edge will be instrumented with a path counter
133 // Get/set the path number increment that this edge will be instrumented
141 // Get/set whether the edge has been instrumented
650 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/chromium_org/ui/views/win/ |
| appbar.cc | 20 void GetEdgesOnWorkerThread(HMONITOR monitor, int* edge) {
22 *edge = 0;
24 *edge = Appbar::EDGE_LEFT;
26 *edge = Appbar::EDGE_TOP;
28 *edge = Appbar::EDGE_RIGHT;
30 *edge = Appbar::EDGE_BOTTOM;
47 // in us thinking there is no auto-hide edges. By returning at least one edge
53 int* edge = new int; local
58 base::Unretained(edge)),
64 base::Owned(edge)),
[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...] |
| /external/freetype/src/autofit/ |
| aflatin.c | 858 /* we are already on an edge, try to locate its start */
892 /* we are just leaving an edge; record a new segment! */
1189 AF_Edge edge = axis->edges + ee; local
1206 AF_Edge edge; local
1262 AF_Edge edge; local
1425 AF_Edge edge = axis->edges; local
1872 AF_Edge edge; local
[all...] |
