| /external/dropbear/libtomcrypt/src/pk/asn1/der/set/ |
| der_encode_setof.c | 66 struct edge *edges; local
88 /* allocate edges */
89 edges = XCALLOC(inlen, sizeof(*edges));
90 if (edges == NULL) {
108 /* scan for edges */
112 edges[x].start = ptr;
120 edges[x].size = y;
123 edges[x].size = 0;
125 edges[x].size = (edges[x].size << 8) | ((unsigned long)ptr[z++])
[all...] |
| /external/bison/src/ |
| vcg.h | 229 (with k ? 0) means that the graph part that is reachable via edges
306 /* Structs enum definitions for edges. */
357 edges of a class less or equal to a constant k specify folding
369 the incoming and outgoing edges. One can think of rubberbands instead
370 of edges that pull a node into its position. The priority of an edges
394 at the source node (the backarrow head). Normal edges only have the
410 lines long, and outgoing edges are related to label lines. (E.g.,
422 level the edge has to be drawn. Other edges which do not have this
453 we want to express that an edge points to a subgraph. Such edges
858 enum decision edges; member in struct:graph
[all...] |
| print_graph.c | 118 | Output in graph_obstack edges specifications in incidence with |
165 | edges. |
188 /* Output the edges. */
219 /* Output nodes and edges. */
|
| /external/freetype/src/autofit/ |
| afhints.c | 73 AF_Edge edges; local
93 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) )
99 edges = axis->edges;
100 edge = edges + axis->num_edges;
102 while ( edge > edges )
272 AF_Edge edges = axis->edges; local
273 AF_Edge limit = edges + axis->num_edges;
278 * note: AF_DIMENSION_HORZ corresponds to _vertical_ edges
880 AF_Edge edges = axis->edges; local
[all...] |
| afcjk.c | 349 /* We begin by generating a sorted table of edges for the current */
358 /* Note that the edges table is sorted along the segment/edge */
380 AF_Edge edge = axis->edges + ee;
479 AF_Edge edges = axis->edges; local
480 AF_Edge edge_limit = edges + axis->num_edges;
484 for ( edge = edges; edge < edge_limit; edge++ )
497 for ( edge = edges; edge < edge_limit; edge++ )
1021 AF_Edge edges = axis->edges; local
1278 AF_Edge edges = axis->edges; local
[all...] |
| aflatin.c | 1002 /* We will begin by generating a sorted table of edges for the */
1011 /* Note that the edges table is sorted along the segment/edge */
1033 /* A special case for serif edges: If they are smaller than */
1042 AF_Edge edge = axis->edges + ee;
1112 AF_Edge edges = axis->edges; local
1704 AF_Edge edges = axis->edges; local
[all...] |
| aflatin2.c | 1065 /* We will begin by generating a sorted table of edges for the */
1074 /* Note that the edges table is sorted along the segment/edge */
1096 /* A special case for serif edges: If they are smaller than */
1117 AF_Edge edge = axis->edges + ee;
1185 AF_Edge edges = axis->edges; local
1789 AF_Edge edges = axis->edges; local
[all...] |
| afhints.h | 36 /* i.e., vertical segments & edges */
38 /* i.e., horizontal segments & edges */
155 FT_Fixed scale; /* used to speed up interpolation between edges */
181 AF_Edge edges; member in struct:AF_AxisHintsRec_
|
| /external/webkit/WebCore/manual-tests/ |
| select-webkit-appearance-off-narrow-select.html | 26 <p>The options in this selects should have padding on both the left and the right, the edges of
27 the text should not be pressed against the edges of the opened select.</p>
|
| /system/core/libpixelflinger/ |
| trap.cpp | 32 // enable to see triangles edges
650 triangle_dump_edges( Edge* edges,
654 for ( ; count > 0; count--, edges++ )
655 edge_dump( edges );
663 Edge* edges,
672 Edge* edge = edges + *pcount;
728 // sort the edges horizontally
765 Edge edges[3]; local
770 edge_setup( edges, &num_edges, v0, v1, ymin, ymax );
771 edge_setup( edges, &num_edges, v0, v2, ymin, ymax )
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| cfghooks.h | 41 be equivalent to E in the case of duplicate edges being removed) or NULL
45 /* Same as the above but allows redirecting of fallthru edges. In that case
73 /* Return true if the one of outgoing edges is already predicted by
99 /* Add fake edges to the function exit for any non constant and non noreturn
131 /* Given a condition BB extract the true/false taken/not taken edges
|
| /external/skia/src/core/ |
| SkBlitter_Sprite.cpp | 77 and respect that by blending the edges of the bitmap against the device. To support
80 (which does respect soft edges).
|
| SkRegion_path.cpp | 398 edge++; // skip over "used" edges
447 SkTDArray<Edge> edges;
450 Edge* edge = edges.append(2);
454 SkQSort(edges.begin(), edges.count(), sizeof(Edge), (SkQSortCompareProc)EdgeProc);
456 int count = edges.count();
457 Edge* start = edges.begin();
|
| /frameworks/base/test-runner/src/android/test/ |
| ViewAsserts.java | 128 * Assert that two views are right aligned, that is that their right edges
146 * Assert that two views are right aligned, that is that their right edges
165 * Assert that two views are left aligned, that is that their left edges
183 * Assert that two views are left aligned, that is that their left edges
202 * Assert that two views are bottom aligned, that is that their bottom edges
220 * Assert that two views are bottom aligned, that is that their bottom edges
239 * Assert that two views are top aligned, that is that their top edges
257 * Assert that two views are top aligned, that is that their top edges
|
| /external/quake/quake/src/QW/client/ |
| r_draw.c | 160 // for right edges, all we want is the effect on 1/z
172 // we cache unclipped horizontal edges as fully clipped
218 // we need to do this to avoid stepping off the edges if a very nearly
282 // we don't cache clipped edges
313 // we do cache fully clipped edges
323 // we don't cache partially clipped edges
403 // ditto if not enough edges left, or switch to auxedges if possible
424 // push the edges through
429 pedges = currententity->model->edges;
530 // FIXME: share clipped edges
[all...] |
| r_bsp.c | 180 // clip edges to BSP plane
224 // split into two edges, one on each side, and remember entering
229 Con_Printf ("Out of edges for bmodel\n");
267 // if anything was clipped, reconstitute and add the edges along the clip
273 Con_Printf ("Out of edges for bmodel\n");
343 pedges = pmodel->edges;
358 // copy the edges to bedges, flipping if necessary so always
360 // FIXME: if edges and vertices get caches, these assignments must move
392 pbedge[j-1].pnext = NULL; // mark end of edges
398 Sys_Error ("no edges in bmodel")
[all...] |
| render.h | 77 float fvrectx_adj, fvrecty_adj; // left and top edges, for clamping
81 // right and bottom edges, for clamping
|
| /external/quake/quake/src/WinQuake/ |
| r_draw.cpp | 160 // for right edges, all we want is the effect on 1/z
172 // we cache unclipped horizontal edges as fully clipped
218 // we need to do this to avoid stepping off the edges if a very nearly
282 // we don't cache clipped edges
313 // we do cache fully clipped edges
323 // we don't cache partially clipped edges
403 // ditto if not enough edges left, or switch to auxedges if possible
424 // push the edges through
429 pedges = currententity->model->edges;
530 // FIXME: share clipped edges?
[all...] |
| r_bsp.cpp | 180 // clip edges to BSP plane
224 // split into two edges, one on each side, and remember entering
229 Con_Printf ("Out of edges for bmodel\n");
267 // if anything was clipped, reconstitute and add the edges along the clip
273 Con_Printf ("Out of edges for bmodel\n");
343 pedges = pmodel->edges;
358 // copy the edges to bedges, flipping if necessary so always
360 // FIXME: if edges and vertices get caches, these assignments must move
392 pbedge[j-1].pnext = NULL; // mark end of edges
398 Sys_Error ("no edges in bmodel");
[all...] |
| render.h | 83 float fvrectx_adj, fvrecty_adj; // left and top edges, for clamping
87 // right and bottom edges, for clamping
|
| /external/jpeg/ |
| transupp.h | 55 * image edges are padded out to the next iMCU boundary with junk data; but
56 * no padding is possible at the top and left edges. If we were to flip
65 * right and bottom edges completely cleanly. flip_h can flip partial iMCUs
76 * followed by -rot 180 -trim trims both edges.)
|
| jpegtran.1 | 113 rather than having a strange-looking strip along the right and/or bottom edges
132 trims both edges.
|
| /external/skia/tests/ |
| ClipperTest.cpp | 48 // edges
67 // extended edges
|
| /frameworks/base/core/tests/coretests/src/android/widget/focus/ |
| LinearLayoutGridTest.java | 29 * right button's left. Same goes for top and bottom edges.
|
| /frameworks/base/core/java/android/view/ |
| Display.java | 65 * along the edges of the display that reduce the amount of application
75 * along the edges of the display that reduce the amount of application
|
