| /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/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
40 List<Node> edges; // points at which nodes? field in class:Graph.Node
45 if ( edges==null ) edges = new ArrayList<Node>();
46 if ( !edges.contains(n) ) edges.add(n);
99 if ( n.edges!=null ) {
100 for (Iterator it = n.edges.iterator(); it.hasNext();) {
|
| /external/opencv/cvaux/src/ |
| cvdpstereo.cpp | 108 uchar* edges = (uchar*)cvAlloc(sizeof(uchar)*imgW*imgH); local
158 edges[y*imgW] = edges[y*imgW+1] = edges[y*imgW+2] = 2;
159 edges[y*imgW+imgW-1] = edges[y*imgW+imgW-2] = edges[y*imgW+imgW-3] = 1;
162 edges[y*imgW+j] = 0;
167 edges[y*imgW+j] |= 1;
172 edges[y*imgW+j] |= 2
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 111 EdgeList edges; member in class:PBQP::Graph
128 assert(findEdge(e.getNode1(), e.getNode2()) == edges.end() &&
131 EdgeItr edgeItr = edges.insert(edges.end(), e);
162 /// This will clear the current graph, erasing any nodes and edges added,
193 /// \brief Get the number of edges in the graph.
194 /// @return Number of edges in the graph.
265 EdgeItr edgesBegin() { return edges.begin(); }
268 EdgeItr edgesEnd() { return edges.end(); }
272 /// @return Begin iterator for the set of edges connected to the given node
[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/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 2417 pANTLR3_BITSET edges; local
[all...] |
| /external/bison/src/ |
| ielr.c | 125 edges rather than an array because it is possible that
127 that we could end up with redundant edges. With the
128 possibility of redundant edges, it's hard to know ahead of
242 * follow (that is, it's computed by internal and successor edges) of goto
245 * successor follow edges. \c edge_counts has not been updated.
286 fprintf (stderr, "always follow edges:\n");
346 goto_number **edges; local
351 &edges, &edge_counts);
352 ielr_compute_follow_kernel_items (ritem_sees_lookahead_set, edges,
356 ielr_compute_always_follows (&edges, edge_counts, always_followsp)
[all...] |
| /external/eigen/Eigen/src/Core/arch/AltiVec/ |
| PacketMath.h | 306 Packet16uc MSQ, LSQ, edges; local
311 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
312 edges=vec_perm(LSQ,MSQ,edgeAlign); // extract the edges
314 MSQ = vec_perm(edges,(Packet16uc)from,align); // misalign the data (MSQ)
315 LSQ = vec_perm((Packet16uc)from,edges,align); // misalign the data (LSQ)
324 Packet16uc MSQ, LSQ, edges; local
329 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
330 edges=vec_perm(LSQ, MSQ, edgeAlign); // extract the edges
[all...] |
| /external/freetype/src/autofit/ |
| afhints.c | 77 AF_Edge edges; local
97 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) )
103 edges = axis->edges;
104 edge = edges + axis->num_edges;
106 while ( edge > edges )
343 /* Dump the array of linked edges. */
357 AF_Edge edges = axis->edges; local
358 AF_Edge limit = edges + axis->num_edges
895 AF_Edge edges = axis->edges; local
[all...] |
| 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...] |
| afcjk.c | 914 /* We begin by generating a sorted table of edges for the current */
923 /* Note that the edges table is sorted along the segment/edge */
945 AF_Edge edge = axis->edges + ee;
1044 AF_Edge edges = axis->edges; local
1045 AF_Edge edge_limit = edges + axis->num_edges;
1049 for ( edge = edges; edge < edge_limit; edge++ )
1062 for ( edge = edges; edge < edge_limit; edge++ )
1673 AF_Edge edges = axis->edges; local
2017 AF_Edge edges = axis->edges; local
[all...] |
| aflatin.c | 1036 /* Link segments to edges, using feature analysis for selection. */
1081 /* We begin by generating a sorted table of edges for the current */
1090 /* Note that the table of edges is sorted along the segment/edge */
1113 /* A special case for serif edges: If they are smaller than */
1193 AF_Edge edges = axis->edges; local
1804 AF_Edge edges = axis->edges; local
[all...] |
| aflatin2.c | 1082 /* We will begin by generating a sorted table of edges for the */
1091 /* Note that the edges table is sorted along the segment/edge */
1203 AF_Edge edges = axis->edges; local
1811 AF_Edge edges = axis->edges; local
[all...] |
| /external/libpcap/ |
| optimize.c | 149 struct edge **edges; variable in typeref:struct:edge
1400 target = fold_edge(ep->succ, edges[k]);
[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
|
| /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/opencv/cv/src/ |
| cvhough.cpp | 858 CvMat *edges = 0; local
876 CV_CALL( edges = cvCreateMat( img->rows, img->cols, CV_8UC1 ));
877 CV_CALL( cvCanny( img, edges, MAX(canny_threshold/2,1), canny_threshold, 3 ));
903 const uchar* edges_row = edges->data.ptr + y*edges->step;
[all...] |
| /external/opencv/cxcore/src/ |
| cxdatastructs.cpp | 2881 CvSet *edges = 0; local
[all...] |
| cxdrawing.cpp | 61 icvCollectPolyEdges( CvMat* img, CvSeq* v, CvContour* edges,
66 icvFillEdgeCollection( CvMat* img, CvContour* edges, const void* color );
943 CvContour* edges;
948 CV_CALL( edges = (CvContour*)cvCreateSeq( 0, sizeof(CvContour), sizeof(CvPolyEdge), st ));
954 CV_CALL( icvCollectPolyEdges( img, &vtx, edges, color, line_type, XY_SHIFT ));
955 CV_CALL( icvFillEdgeCollection( img, edges, color ));
999 int edges = npts;
2423 CvContour* edges = 0; local
[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
|
| model.h | 124 int numedges; // are backwards edges
352 medge_t *edges; member in struct:model_s
|
| /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/webkit/Source/WebCore/rendering/ |
| RenderBoxModelObject.cpp | 1343 BorderEdge edges[4] = { local
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| PositionController.java | 671 int edges = getImageAtEdges(); local
672 if ((velocityX > 0 && (edges & IMAGE_AT_LEFT_EDGE) != 0) ||
673 (velocityX < 0 && (edges & IMAGE_AT_RIGHT_EDGE) != 0)) {
676 if ((velocityY > 0 && (edges & IMAGE_AT_TOP_EDGE) != 0) ||
677 (velocityY < 0 && (edges & IMAGE_AT_BOTTOM_EDGE) != 0)) {
1217 int edges = 0; local
[all...] |
