| /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/freetype/src/autofit/ |
| 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...] |
| 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
757 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 | 1066 /* We will begin by generating a sorted table of edges for the */
1075 /* Note that the edges table is sorted along the segment/edge */
1097 /* A special case for serif edges: If they are smaller than */
1118 AF_Edge edge = axis->edges + ee;
1186 AF_Edge edges = axis->edges; local
1790 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_
|
| /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...] |
| /external/skia/src/core/ |
| 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();
|
| /external/quake/quake/src/QW/client/ |
| model.h | 124 int numedges; // are backwards edges
352 medge_t *edges; member in struct:model_s
|
| gl_model.h | 136 int numedges; // are backwards edges
386 medge_t *edges;
member in struct:model_s
|
| 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...] |
| gl_warp.c | 157 // convert edges back to a normal polygon
165 vec = loadmodel->vertexes[loadmodel->edges[lindex].v[0]].position;
167 vec = loadmodel->vertexes[loadmodel->edges[-lindex].v[1]].position;
|
| gl_model.c | 622 loadmodel->edges = out;
722 v = &loadmodel->vertexes[loadmodel->edges[e].v[0]];
724 v = &loadmodel->vertexes[loadmodel->edges[-e].v[1]];
[all...] |
| model.c | 613 loadmodel->edges = out;
713 v = &loadmodel->vertexes[loadmodel->edges[e].v[0]];
715 v = &loadmodel->vertexes[loadmodel->edges[-e].v[1]];
[all...] |
| /external/quake/quake/src/WinQuake/ |
| model.h | 113 int numedges; // are backwards edges
335 medge_t *edges; member in struct:model_s
|
| gl_model.h | 132 int numedges; // are backwards edges
383 medge_t *edges; member in struct:model_s
|
| 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...] |
| gl_warp.cpp | 158 // convert edges back to a normal polygon
166 vec = loadmodel->vertexes[loadmodel->edges[lindex].v[0]].position;
168 vec = loadmodel->vertexes[loadmodel->edges[-lindex].v[1]].position;
|
| gl_model.cpp | 622 loadmodel->edges = out;
722 v = &loadmodel->vertexes[loadmodel->edges[e].v[0]];
724 v = &loadmodel->vertexes[loadmodel->edges[-e].v[1]];
[all...] |
| /external/libpcap/ |
| optimize.c | 149 struct edge **edges; variable in typeref:struct:edge
1400 target = fold_edge(ep->succ, edges[k]);
[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...] |
| vcg.c | 116 g->edges = G_EDGES;
486 /* FIXME: Unallocate nodes and edges if required. */
816 if (g->edges != G_EDGES)
817 fprintf (fout, "\tedges:\t%s\n", get_decision_str (g->edges));
|
| /external/quake/quake/src/QW/server/ |
| model.c | 552 loadmodel->edges = out;
650 v = &loadmodel->vertexes[loadmodel->edges[e].v[0]];
652 v = &loadmodel->vertexes[loadmodel->edges[-e].v[1]];
|
