| /external/skia/src/gpu/gl/ |
| GrGpuGLShaders.cpp | 605 GrDrawState::Edge edges[GrDrawState::kMaxEdges]; local
606 // Flip the edges in Y
610 edges[i] = this->getDrawState().getAAEdges()[i];
611 float b = edges[i].fY;
612 edges[i].fY = -b;
613 edges[i].fZ += b * height;
615 GL_CALL(Uniform3fv(uni, count, &edges[0].fX));
[all...] |
| /external/libpcap/ |
| optimize.c | 149 struct edge **edges; variable in typeref:struct:edge
1400 target = fold_edge(ep->succ, edges[k]);
[all...] |
| /external/opencv/cxcore/src/ |
| cxdatastructs.cpp | 2881 CvSet *edges = 0; local
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/C/ |
| C.stg | [all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 409 * A vector of vectors of edges, built by calling the addEdge method()
414 pANTLR3_BITSET * edges; member in struct:ANTLR3_TOPO_struct
425 * as a stack and each time we descend a node to one of its edges we
435 * A flag that indicates the algorithm found a cycle in the edges
452 * One more than the largest node index that is contained in edges/sorted.
465 * while building these edges, it is perfectly OK to add nodes out of
466 * sequence. So, if you have edges:
|
| /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/freetype/src/autofit/ |
| afhints.h | 36 /* i.e., vertical segments & edges */
38 /* i.e., horizontal segments & edges */
80 * Edges
83 * edges. An edge corresponds to a single position on the main
87 * The auto-hinter first tries to grid fit edges, then to align
88 * segments on the edges unless it detects that they form a serif.
91 * edges; they are specific to a script.
173 * to be interpolated linearly between their two closest edges, even if
198 * alignment of edges and strong points, thus weak points are processed
299 FT_Fixed scale; /* used to speed up interpolation between edges */
324 AF_Edge edges; \/* edges array *\/ member in struct:AF_AxisHintsRec_
[all...] |
| /external/quake/quake/src/QW/client/ |
| 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...] |
| /external/quake/quake/src/WinQuake/ |
| 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...] |
| /gdk/samples/quake/jni/ |
| gl_model.h | 132 int numedges; // are backwards edges
383 medge_t *edges; member in struct:model_s
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| GuidelineHandler.java | 114 * is a constraint between two horizontal edges)
121 * is a constraint between two vertical edges)
132 * All horizontal segments in the relative layout - top and bottom edges, baseline
133 * edges, and top and bottom edges offset by the applicable margins in each direction
138 * All vertical segments in the relative layout - left and right edges, and left and
139 * right edges offset by the applicable margins in each direction
145 * they only match other center edges.
151 * since they only match other center edges.
309 /** Records the matchable outside edges for the given node to the potential match list *
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| PhotoView.java | [all...] |
| /packages/apps/Camera/jni/feature_mos/src/mosaic/ |
| Delaunay.cpp | 40 int CDelaunay::triangulate(SEdgeVector **edges, int n_sites, int width, int height)
47 *edges = ev;
608 // Throw out any edges that are too far apart
|
| /packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/ |
| Delaunay.cpp | 40 int CDelaunay::triangulate(SEdgeVector **edges, int n_sites, int width, int height)
47 *edges = ev;
608 // Throw out any edges that are too far apart
|
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| basic-block.h | 131 /* The edges into and out of the block. */
302 /* Number of edges in this flow graph. */
512 /* Number of edges in the compressed edge list. */
592 /* Iterator object for edges. */
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
914 /* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
916 find_fallthru_edge (VEC(edge,gc) *edges)
921 FOR_EACH_EDGE (e, ei, edges)
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| basic-block.h | 131 /* The edges into and out of the block. */
302 /* Number of edges in this flow graph. */
512 /* Number of edges in the compressed edge list. */
592 /* Iterator object for edges. */
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
914 /* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
916 find_fallthru_edge (VEC(edge,gc) *edges)
921 FOR_EACH_EDGE (e, ei, edges)
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| basic-block.h | 131 /* The edges into and out of the block. */
302 /* Number of edges in this flow graph. */
512 /* Number of edges in the compressed edge list. */
592 /* Iterator object for edges. */
701 vector of predecessor or successor edges. It must not be used when
884 /* Return true when one of the predecessor edges of BB is marked with EDGE_EH. */
899 /* Return true when one of the predecessor edges of BB is marked with EDGE_ABNORMAL. */
914 /* Return the fallthru edge in EDGES if it exists, NULL otherwise. */
916 find_fallthru_edge (VEC(edge,gc) *edges)
921 FOR_EACH_EDGE (e, ei, edges)
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| PlistDiagnostics.cpp | 177 // Emit edges.
178 Indent(o, indent) << "<key>edges</key>\n";
|
| /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]];
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| Grammar.java | 293 /** The NFA that represents the grammar with edges labelled with tokens
486 * incident edges can have synpreds. Same is try for
1206 List<IntervalSet> edges = new ArrayList<IntervalSet>(); local
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.ant.core_3.2.200.v20100427.jar | |
