| /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...] |
| basic-block.h | 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge and associated BLOCK. */
54 /* The index number corresponding to this edge in the edge vector
64 DEF_VEC_P(edge); variable
65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
74 #define EDGE_FAKE 16 /* Not a real edge (profile.c) *
[all...] |
| tree-flow.h | 396 /* Location to track pending stmt for edge insertion. */
424 extern edge find_taken_edge (basic_block, tree);
433 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
434 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
436 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned,
441 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
461 void remove_edge_and_dominated_blocks (edge);
[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...] |
| basic-block.h | 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge and associated BLOCK. */
54 /* The index number corresponding to this edge in the edge vector
64 DEF_VEC_P(edge); variable
65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
74 #define EDGE_FAKE 16 /* Not a real edge (profile.c) *
[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...] |
| basic-block.h | 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge and associated BLOCK. */
54 /* The index number corresponding to this edge in the edge vector
64 DEF_VEC_P(edge); variable
65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
74 #define EDGE_FAKE 16 /* Not a real edge (profile.c) *
[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...] |
| basic-block.h | 35 /* Control flow edge information. */
37 /* The two blocks at the ends of the edge. */
41 /* Instructions queued on the edge. */
50 /* Location of any goto implicit in the edge and associated BLOCK. */
54 /* The index number corresponding to this edge in the edge vector
64 DEF_VEC_P(edge); variable
65 DEF_VEC_ALLOC_P(edge,gc);
66 DEF_VEC_ALLOC_P(edge,heap);
74 #define EDGE_FAKE 16 /* Not a real edge (profile.c) *
[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...] |
| /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...] |
| /dalvik/dx/tests/086-ssa-edge-split/ |
| run | 18 dx --dump --width=1000 --ssa-blocks --ssa-step=edge-split Blort.class
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| FASerializer.java | 97 // and then ordered by edge labels then by target state number :)
124 Transition edge = (Transition) s.transition(i); local
125 walkFANormalizingStateNumbers(edge.target); // keep walkin'
128 // to it, but don't "draw" an edge.
129 if ( edge instanceof RuleClosureTransition ) {
130 walkFANormalizingStateNumbers(((RuleClosureTransition) edge).followState);
150 // depth first walk each transition, printing its edge first
152 Transition edge = (Transition) s.transition(i); local
155 if ( edge.isAction() ) {
158 else if ( edge.isEpsilon() )
[all...] |
| /external/skia/legacy/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...] |
| SkScan_Path.cpp | 23 static void validate_sort(const SkEdge* edge) {
26 while (edge->fFirstY != SK_MaxS32) {
27 edge->validate();
28 SkASSERT(y <= edge->fFirstY);
30 y = edge->fFirstY;
31 edge = edge->fNext;
35 #define validate_sort(edge)
38 static inline void remove_edge(SkEdge* edge) {
39 edge->fPrev->fNext = edge->fNext
439 SkEdge* edge = sort_edges(list, count, &last); local
638 SkEdge* edge = sort_edges(list, count, &last); 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...] |
| SkScan_Path.cpp | 28 static void validate_sort(const SkEdge* edge) {
31 while (edge->fFirstY != SK_MaxS32) {
32 edge->validate();
33 SkASSERT(y <= edge->fFirstY);
35 y = edge->fFirstY;
36 edge = edge->fNext;
40 #define validate_sort(edge)
43 static inline void remove_edge(SkEdge* edge) {
44 edge->fPrev->fNext = edge->fNext
470 SkEdge* edge = sort_edges(list, count, &last); local
674 SkEdge* edge = sort_edges(list, count, &last); local
[all...] |
| SkEdgeBuilder.cpp | 26 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local
27 if (edge->setLine(pts[0], pts[1], fShiftUp)) {
28 fList.push(edge);
30 // TODO: unallocate edge from storage...
35 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local
36 if (edge->setQuadratic(pts, fShiftUp)) {
37 fList.push(edge);
39 // TODO: unallocate edge from storage...
44 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local
45 if (edge->setCubic(pts, NULL, fShiftUp))
100 SkEdge* edge = reinterpret_cast<SkEdge*>(storage); local
[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...] |
| /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...] |
| afcjk.c | 916 /* an edge in our table that corresponds to its position. */
918 /* If no edge is found, we create and insert a new edge in the */
919 /* sorted table. Otherwise, we simply add the segment to the edge's */
921 /* edge's properties. */
923 /* Note that the edges table is sorted along the segment/edge */
942 /* look for an edge corresponding to the segment */
945 AF_Edge edge = axis->edges + ee; local
949 if ( edge->dir != seg->dir )
952 dist = seg->pos - edge->fpos
993 AF_Edge edge; local
1046 AF_Edge edge; local
1175 AF_Edge edge = axis->edges; local
1676 AF_Edge edge; local
2019 AF_Edge edge; local
[all...] |
| /external/opencv/cvaux/src/ |
| cvsubdiv2.cpp | 59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i); local
61 if( edge && CV_IS_SET_ELEM( edge ))
65 CvSubdiv2DEdge e = (CvSubdiv2DEdge)edge + j;
107 draw_subdiv_facet( CvSubdiv2D * subdiv, IplImage * dst, IplImage * src, CvSubdiv2DEdge edge )
109 CvSubdiv2DEdge t = edge;
120 while( t != edge && count < subdiv->quad_edges * 4 );
128 t = edge;
142 CvSubdiv2DPoint *pt = cvSubdiv2DEdgeDst( cvSubdiv2DRotateEdge( edge, 1 ));
173 CvQuadEdge2D *edge = (CvQuadEdge2D *) cvGetSetElem( subdiv->edges, i ) local
[all...] |
| /external/webkit/Source/WebCore/rendering/ |
| RenderFrameSet.h | 44 bool preventResize(FrameEdge edge) const { return m_preventResize[edge]; }
45 bool allowBorder(FrameEdge edge) const { return m_allowBorder[edge]; }
47 void setPreventResize(FrameEdge edge, bool preventResize) { m_preventResize[edge] = preventResize; }
48 void setAllowBorder(FrameEdge edge, bool allowBorder) { m_allowBorder[edge] = allowBorder; }
|
| /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...] |
