| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/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 | 121 /* Control flow edge information. */
124 /* The two blocks at the ends of the edge. */
128 /* Instructions queued on the edge. */
137 /* Location of any goto implicit in the edge and associated BLOCK. */
141 /* The index number corresponding to this edge in the edge vector
151 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
153 DEF_VEC_P(edge); variable
154 DEF_VEC_ALLOC_P(edge,gc);
155 DEF_VEC_ALLOC_P(edge,heap)
[all...] |
| tree-flow.h | 37 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
547 edge ep_edge;
682 /* Location to track pending stmt for edge insertion. */
710 extern edge find_taken_edge (basic_block, tree);
719 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
720 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
722 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned
[all...] |
| /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...] |
| basic-block.h | 121 /* Control flow edge information. */
124 /* The two blocks at the ends of the edge. */
128 /* Instructions queued on the edge. */
137 /* Location of any goto implicit in the edge and associated BLOCK. */
141 /* The index number corresponding to this edge in the edge vector
151 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
153 DEF_VEC_P(edge); variable
154 DEF_VEC_ALLOC_P(edge,gc);
155 DEF_VEC_ALLOC_P(edge,heap)
[all...] |
| tree-flow.h | 37 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
547 edge ep_edge;
682 /* Location to track pending stmt for edge insertion. */
710 extern edge find_taken_edge (basic_block, tree);
719 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
720 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
722 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned
[all...] |
| /dalvik/dx/tests/086-ssa-edge-split/ |
| run | 18 dx --dump --width=1000 --ssa-blocks --ssa-step=edge-split Blort.class
|
| /external/skia/src/core/ |
| SkScan_Path.cpp | 33 static void validate_sort(const SkEdge* edge)
37 while (edge->fFirstY != SK_MaxS32)
39 edge->validate();
40 SkASSERT(y <= edge->fFirstY);
42 y = edge->fFirstY;
43 edge = edge->fNext;
47 #define validate_sort(edge)
50 static inline void remove_edge(SkEdge* edge)
52 edge->fPrev->fNext = edge->fNext
516 SkEdge* edge = sort_edges(list, count, &last); local
675 SkEdge* edge = sort_edges(list, count, &last); local
[all...] |
| SkEdgeBuilder.cpp | 17 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local
18 if (edge->setLine(pts[0], pts[1], NULL, fShiftUp)) {
19 fList.push(edge);
21 // TODO: unallocate edge from storage...
26 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local
27 if (edge->setQuadratic(pts, fShiftUp)) {
28 fList.push(edge);
30 // TODO: unallocate edge from storage...
35 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local
36 if (edge->setCubic(pts, NULL, fShiftUp))
[all...] |
| 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/freetype/src/autofit/ |
| afcjk.c | 351 /* an edge in our table that corresponds to its position. */
353 /* If no edge is found, we create and insert a new edge in the */
354 /* sorted table. Otherwise, we simply add the segment to the edge's */
356 /* edge's properties. */
358 /* Note that the edges table is sorted along the segment/edge */
377 /* look for an edge corresponding to the segment */
380 AF_Edge edge = axis->edges + ee; local
384 if ( edge->dir != seg->dir )
387 dist = seg->pos - edge->fpos
428 AF_Edge edge; local
481 AF_Edge edge; local
1024 AF_Edge edge; local
1280 AF_Edge edge; local
[all...] |
| aflatin.c | 724 /* we are already on an edge, try to locate its start */
758 /* we are just leaving an edge; record a new segment! */
1004 /* to find an edge in our table that corresponds to its position. */
1006 /* If no edge is found, we create and insert a new edge in the */
1007 /* sorted table. Otherwise, we simply add the segment to the edge's */
1009 /* edge's properties. */
1011 /* Note that the edges table is sorted along the segment/edge */
1039 /* look for an edge corresponding to the segment */
1042 AF_Edge edge = axis->edges + ee local
1059 AF_Edge edge; local
1114 AF_Edge edge; local
1268 AF_Edge edge = axis->edges; local
1707 AF_Edge edge; local
[all...] |
| aflatin2.c | 720 /* already on an edge ?, backtrack to find its start */
1068 /* to find an edge in our table that corresponds to its position. */
1070 /* If no edge is found, we create and insert a new edge in the */
1071 /* sorted table. Otherwise, we simply add the segment to the edge's */
1073 /* edge's properties. */
1075 /* Note that the edges table is sorted along the segment/edge */
1115 /* look for an edge corresponding to the segment */
1118 AF_Edge edge = axis->edges + ee; local
1135 AF_Edge edge; local
1188 AF_Edge edge; local
1342 AF_Edge edge = axis->edges; local
1792 AF_Edge edge; local
[all...] |
| afhints.c | 72 AF_Edge edge = NULL; local
80 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) );
100 edge = edges + axis->num_edges;
102 while ( edge > edges )
104 if ( edge[-1].fpos < fpos )
107 /* we want the edge with same position and minor direction */
109 if ( edge[-1].fpos == fpos && dir == axis->major_dir )
112 edge[0] = edge[-1];
113 edge--
274 AF_Edge edge; local
688 AF_Edge edge = seg->edge; local
715 AF_Edge edge = seg->edge; local
770 AF_Edge edge; local
[all...] |
| /external/webkit/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/quake/quake/src/QW/client/ |
| r_edge.c | 31 this breaks spans at every edge, even hidden ones (bad)
71 void R_LeadingEdge (edge_t *edge);
72 void R_LeadingEdgeBackwards (edge_t *edge);
73 void R_TrailingEdge (surf_t *surf, edge_t *edge);
169 sentinel at the end (actually, this is the active edge table starting at
270 // pull the edge out of the edge list
274 // find out where the edge goes in the edge list
282 // put the edge back into the edge lis
590 edge_t *edge; local
629 edge_t *edge; local
[all...] |
| r_draw.c | 82 edge_t *edge, *pcheck; local
169 // create the edge
179 return; // horizontal edge
184 edge = edge_p++;
186 edge->owner = r_pedge;
188 edge->nearzi = lzi0;
192 // trailing edge (go from p1 to p2)
196 edge->surfs[0] = surface_p - surfaces;
197 edge->surfs[1] = 0;
204 // leading edge (go from p2 to p1
[all...] |
| /external/quake/quake/src/WinQuake/ |
| r_edge.cpp | 31 this breaks spans at every edge, even hidden ones (bad)
71 void R_LeadingEdge (edge_t *edge);
72 void R_LeadingEdgeBackwards (edge_t *edge);
73 void R_TrailingEdge (surf_t *surf, edge_t *edge);
169 sentinel at the end (actually, this is the active edge table starting at
270 // pull the edge out of the edge list
274 // find out where the edge goes in the edge list
282 // put the edge back into the edge list
590 edge_t *edge; local
629 edge_t *edge; local
[all...] |
| r_draw.cpp | 82 edge_t *edge, *pcheck;
local
169 // create the edge
179 return; // horizontal edge
184 edge = edge_p++;
186 edge->owner = r_pedge;
188 edge->nearzi = lzi0;
192 // trailing edge (go from p1 to p2)
196 edge->surfs[0] = surface_p - surfaces;
197 edge->surfs[1] = 0;
204 // leading edge (go from p2 to p1)
[all...] |
| /external/dropbear/libtomcrypt/src/pk/asn1/der/set/ |
| der_encode_setof.c | 20 struct edge { struct
27 struct edge *A = (struct edge *)a, *B = (struct edge *)b;
66 struct edge *edges;
|
| /external/bison/src/ |
| vcg.h | 177 hidden by folding or edge classes) does not have fixed specified
191 ignored, if they are in conflict with near edge specifications.
294 | Edge attributs list. Structure that describes an edge. |
297 /* VCG Edge type. */
322 /* The struct edge itself. */ struct
323 struct edge
326 /* Edge type.
327 Default is normal edge. */
330 /* Sourcename is the title of the source node of the edge
439 typedef struct edge edge; typedef in typeref:struct:edge
924 edge edge; member in struct:graph
[all...] |
| lalr.c | 173 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); local
193 edge[nedges++] = map_goto (stateno, sym);
201 memcpy (reads[i], edge, nedges * sizeof edge[0]);
213 free (edge);
232 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); local
274 edge[nedges++] = map_goto (states1[--length],
289 includes[i][j] = edge[j]
[all...] |
| /bootable/bootloader/legacy/arch_msm7k/ |
| vic.c | 95 void irq_install(unsigned n, irq_handler func, int edge)
103 if(edge) {
|
| /external/libpcap/ |
| gencode.h | 221 struct edge { struct
227 struct edge *next; /* link list of incoming edges for a node */
240 struct edge et;
241 struct edge ef;
246 struct edge *in_edges;
|
| /frameworks/base/core/java/android/gesture/ |
| Gesture.java | 142 public Path toPath(int width, int height, int edge, int numSample) {
143 return toPath(null, width, height, edge, numSample);
146 public Path toPath(Path path, int width, int height, int edge, int numSample) {
153 path.addPath(strokes.get(i).toPath(width - 2 * edge, height - 2 * edge, numSample));
180 * @param edge the edge
185 public Bitmap toBitmap(int width, int height, int edge, int numSample, int color) {
189 canvas.translate(edge, edge);
[all...] |
