| /external/opencv/cvaux/src/ |
| D | cvdpstereo.cpp | 110 uchar* edges = (uchar*)cvAlloc(sizeof(uchar)*imgW*imgH); in icvFindStereoCorrespondenceByBirchfieldDP() local
160 edges[y*imgW] = edges[y*imgW+1] = edges[y*imgW+2] = 2; in icvFindStereoCorrespondenceByBirchfieldDP()
161 edges[y*imgW+imgW-1] = edges[y*imgW+imgW-2] = edges[y*imgW+imgW-3] = 1; in icvFindStereoCorrespondenceByBirchfieldDP()
164 edges[y*imgW+j] = 0; in icvFindStereoCorrespondenceByBirchfieldDP()
169 edges[y*imgW+j] |= 1; in icvFindStereoCorrespondenceByBirchfieldDP()
174 edges[y*imgW+j] |= 2; in icvFindStereoCorrespondenceByBirchfieldDP()
196 uchar* _edges = edges + y*imgW + x; in icvFindStereoCorrespondenceByBirchfieldDP()
329 edges[y*imgW+x] |= 4; in icvFindStereoCorrespondenceByBirchfieldDP()
330 edges[(y+1)*imgW+x] |= 4; in icvFindStereoCorrespondenceByBirchfieldDP()
331 edges[(y-1)*imgW+x] |= 4; in icvFindStereoCorrespondenceByBirchfieldDP()
[all …]
|
| D | decomppoly.cpp | 328 int* edges,
344 if( edges[ mainEdgeIdx * 2 ] == vtxIdx ) {
347 x0_end = contour[ edges[ mainEdgeIdx * 2 + 1 ] ].x;
348 y0_end = contour[ edges[ mainEdgeIdx * 2 + 1 ] ].y;
359 x0_end = contour[ edges[ mainEdgeIdx * 2 ] ].x;
360 y0_end = contour[ edges[ mainEdgeIdx * 2 ] ].y;
368 ( edges[ i * 2 ] == vtxIdx || edges[ i * 2 + 1 ] == vtxIdx ) )
373 if( edges[ i * 2 ] == vtxIdx ) {
374 x1_left = x1_right = contour[ edges[ i * 2 + 1 ] ].x;
375 y1_left = y1_right = contour[ edges[ i * 2 + 1 ] ].y;
[all …]
|
| D | cvsubdiv2.cpp | 47 int i, j, total = subdiv->edges->total; in icvSubdiv2DCheck()
59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i); in icvSubdiv2DCheck()
166 int i, total = subdiv->edges->total; in icvDrawMosaic()
173 CvQuadEdge2D *edge = (CvQuadEdge2D *) cvGetSetElem( subdiv->edges, i ); in icvDrawMosaic()
|
| /external/freetype/src/autofit/ |
| D | afhints.c | 107 AF_Edge edges; in af_axis_hints_new_edge() local
112 if ( axis->edges == NULL ) in af_axis_hints_new_edge()
114 axis->edges = axis->embedded.edges; in af_axis_hints_new_edge()
135 if ( axis->edges == axis->embedded.edges ) in af_axis_hints_new_edge()
137 if ( FT_NEW_ARRAY( axis->edges, new_max ) ) in af_axis_hints_new_edge()
139 ft_memcpy( axis->edges, axis->embedded.edges, in af_axis_hints_new_edge()
140 sizeof ( axis->embedded.edges ) ); in af_axis_hints_new_edge()
144 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) ) in af_axis_hints_new_edge()
151 edges = axis->edges; in af_axis_hints_new_edge()
152 edge = edges + axis->num_edges; in af_axis_hints_new_edge()
[all …]
|
| D | aflatin2.c | 1176 AF_Edge edge = axis->edges + ee; in af_latin2_hints_compute_edges()
1246 AF_Edge edges = axis->edges; in af_latin2_hints_compute_edges() local
1247 AF_Edge edge_limit = edges + axis->num_edges; in af_latin2_hints_compute_edges()
1251 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin2_hints_compute_edges()
1264 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin2_hints_compute_edges()
1406 AF_Edge edge = axis->edges; in af_latin2_hints_compute_blue_edges()
1825 stem_edge-hints->axis[dim].edges, stem_edge->opos / 64.0, in af_latin2_align_linked_edge()
1857 AF_Edge edges = axis->edges; in af_latin2_hint_edges() local
1858 AF_Edge edge_limit = edges + axis->num_edges; in af_latin2_hint_edges()
1874 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin2_hint_edges()
[all …]
|
| D | aflatin.c | 1851 AF_Edge edge = axis->edges + ee; in af_latin_hints_compute_edges()
1922 AF_Edge edges = axis->edges; in af_latin_hints_compute_edges() local
1923 AF_Edge edge_limit = edges + axis->num_edges; in af_latin_hints_compute_edges()
1927 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin_hints_compute_edges()
1940 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin_hints_compute_edges()
2089 AF_Edge edge = axis->edges; in af_latin_hints_compute_blue_edges()
2517 stem_edge - hints->axis[dim].edges, stem_edge->opos / 64.0, in af_latin_align_linked_edge()
2554 AF_Edge edges = axis->edges; in af_latin_hint_edges() local
2555 AF_Edge edge_limit = edges + axis->num_edges; in af_latin_hint_edges()
2575 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin_hint_edges()
[all …]
|
| D | afcjk.c | 1039 AF_Edge edge = axis->edges + ee; in af_cjk_hints_compute_edges()
1141 AF_Edge edges = axis->edges; in af_cjk_hints_compute_edges() local
1142 AF_Edge edge_limit = edges + axis->num_edges; in af_cjk_hints_compute_edges()
1146 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hints_compute_edges()
1159 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hints_compute_edges()
1276 AF_Edge edge = axis->edges; in af_cjk_hints_compute_blue_edges()
1625 stem_edge - hints->axis[dim].edges, stem_edge->fpos, in af_cjk_align_linked_edge()
1794 AF_Edge edges = axis->edges; in af_cjk_hint_edges() local
1795 AF_Edge edge_limit = edges + axis->num_edges; in af_cjk_hint_edges()
1817 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hint_edges()
[all …]
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| D | Graph.java | 40 List<Node> edges; // points at which nodes? field in Graph.Node
45 if ( edges==null ) edges = new ArrayList<Node>(); in addEdge()
46 if ( !edges.contains(n) ) edges.add(n); in addEdge()
99 if ( n.edges!=null ) { in DFS()
100 for (Iterator it = n.edges.iterator(); it.hasNext();) { in DFS()
|
| /external/skia/src/gpu/effects/ |
| D | GrConvexPolyEffect.cpp | 280 SkScalar edges[3 * kMaxEdges]; in Create() local
299 edges[3 * n] = v.fY; in Create()
300 edges[3 * n + 1] = -v.fX; in Create()
302 edges[3 * n] = -v.fY; in Create()
303 edges[3 * n + 1] = v.fX; in Create()
306 edges[3 * n + 2] = -(edges[3 * n] * p.fX + edges[3 * n + 1] * p.fY); in Create()
313 return Create(type, n, edges); in Create()
338 GrConvexPolyEffect::GrConvexPolyEffect(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]) in GrConvexPolyEffect() argument
344 memcpy(fEdges, edges, 3 * n * sizeof(SkScalar)); in GrConvexPolyEffect()
369 SkScalar edges[kMaxEdges * 3]; in TestCreate() local
[all …]
|
| D | GrConvexPolyEffect.h | 42 const SkScalar edges[]) { in Create() argument
46 return SkNEW_ARGS(GrConvexPolyEffect, (edgeType, n, edges)); in Create()
77 GrConvexPolyEffect(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]);
|
| /external/opencv/cv/src/ |
| D | cvstereogc.cpp | 134 static int64 icvGCMaxFlow( GCVtx* vtx, int nvtx, GCEdge* edges, GCVtx**& _orphans, int& _maxOrphans… in icvGCMaxFlow() argument
179 for( ei = v->first; ei != 0; ei = edges[ei].next ) in icvGCMaxFlow()
181 if( edges[ei^vt].weight == 0 ) in icvGCMaxFlow()
183 u = edges[ei].dst; in icvGCMaxFlow()
224 min_weight = edges[e0].weight; in icvGCMaxFlow()
229 for( v = edges[e0^k].dst;; v = edges[ei].dst ) in icvGCMaxFlow()
233 weight = edges[ei^k].weight; in icvGCMaxFlow()
243 edges[e0].weight -= min_weight; in icvGCMaxFlow()
244 edges[e0^1].weight += min_weight; in icvGCMaxFlow()
250 for( v = edges[e0^k].dst;; v = edges[ei].dst ) in icvGCMaxFlow()
[all …]
|
| D | cvsubdivision2d.cpp | 88 edge = (CvQuadEdge2D*)cvSetNew( (CvSet*)subdiv->edges ); in cvSubdiv2DMakeEdge()
182 cvSetRemoveByPtr( (CvSet*)(subdiv->edges), quadedge ); in cvSubdiv2DDeleteEdge()
533 cvClearSet( (CvSet *) (subdiv->edges) ); in cvInitSubdivDelaunay2D()
585 total = subdiv->edges->total; in cvClearSubdivVoronoi2D()
586 elem_size = subdiv->edges->elem_size; in cvClearSubdivVoronoi2D()
588 cvStartReadSeq( (CvSeq *) (subdiv->edges), &reader, 0 ); in cvClearSubdivVoronoi2D()
640 total = subdiv->edges->total; in cvCalcSubdivVoronoi2D()
641 elem_size = subdiv->edges->elem_size; in cvCalcSubdivVoronoi2D()
645 cvStartReadSeq( (CvSeq *) (subdiv->edges), &reader, 0 ); in cvCalcSubdivVoronoi2D()
|
| /external/replicaisland/tools/ |
| D | ExtractPoints.js | 67 tile.edges = new Array(); variable
111 tile.edges.push(edge);
142 for (var y = 0; y < tile.edges.length; y++) {
143 var edge = tile.edges[y];
224 for (var y = 0; y < tile.edges.length; y++) {
225 var edge = tile.edges[y];
236 for (var y = 0; y < tile.edges.length; y++) {
237 var edge = tile.edges[y];
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| D | antlr3collections.c | 2298 topo->edges = NULL; // No edges added yet in antlr3TopoNew()
2336 if (topo->edges == NULL) in addEdge()
2340 topo->edges = ANTLR3_CALLOC(sizeof(pANTLR3_BITSET) * (maxEdge + 1), 1); in addEdge()
2341 if (topo->edges == NULL) in addEdge()
2354 topo->edges = ANTLR3_REALLOC(topo->edges, sizeof(pANTLR3_BITSET) * (maxEdge + 1)); in addEdge()
2355 if (topo->edges == NULL) in addEdge()
2364 *((topo->edges) + i) = NULL; in addEdge()
2383 edgeDeps = *((topo->edges) + edge); in addEdge()
2390 *((topo->edges) + edge) = edgeDeps; in addEdge()
2417 pANTLR3_BITSET edges; in DFS() local
[all …]
|
| /external/skia/src/core/ |
| D | SkDistanceFieldGen.cpp | 66 static void init_glyph_data(DFData* data, unsigned char* edges, const unsigned char* image, in init_glyph_data() argument
72 edges += (pad*dataWidth + pad); in init_glyph_data()
95 *edges = 255; // using 255 makes for convenient debug rendering in init_glyph_data()
99 ++edges; in init_glyph_data()
102 edges += 2*pad; in init_glyph_data()
148 static void init_distances(DFData* data, unsigned char* edges, int width, int height) { in init_distances() argument
156 if (*edges) { in init_distances()
187 ++edges; in init_distances()
|
| D | SkRegion_path.cpp | 504 SkTDArray<Edge> edges; in getBoundaryPath() local
507 Edge* edge = edges.append(2); in getBoundaryPath()
511 qsort(edges.begin(), edges.count(), sizeof(Edge), SkCastForQSort(EdgeProc)); in getBoundaryPath()
513 int count = edges.count(); in getBoundaryPath()
514 Edge* start = edges.begin(); in getBoundaryPath()
|
| /external/opencv/cxcore/src/ |
| D | cxdrawing.cpp | 61 icvCollectPolyEdges( CvMat* img, CvSeq* v, CvContour* edges,
66 icvFillEdgeCollection( CvMat* img, CvContour* edges, const void* color );
943 CvContour* edges; in icvEllipseEx() local
948 CV_CALL( edges = (CvContour*)cvCreateSeq( 0, sizeof(CvContour), sizeof(CvPolyEdge), st )); in icvEllipseEx()
954 CV_CALL( icvCollectPolyEdges( img, &vtx, edges, color, line_type, XY_SHIFT )); in icvEllipseEx()
955 CV_CALL( icvFillEdgeCollection( img, edges, color )); in icvEllipseEx()
999 int edges = npts; in icvFillConvexPoly() local
1087 if( ty > y || edges == 0 ) in icvFillConvexPoly()
1092 edges--; in icvFillConvexPoly()
1149 icvCollectPolyEdges( CvMat* img, CvSeq* v, CvContour* edges, in icvCollectPolyEdges() argument
[all …]
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
| D | dot.stg | 33 dfa(decisionRanks,states,edges,rankdir,startState,useBox) ::= <<
38 <edges; separator="\n">
42 nfa(decisionRanks,states,edges,rankdir,startState) ::= <<
47 <edges; separator="\n">
|
| /external/llvm/test/Analysis/LazyCallGraph/ |
| D | basic.ll | 6 ; CHECK-LABEL: Call edges in function: f
13 ; A bunch more functions just to make it easier to test several call edges at once.
54 ; CHECK-LABEL: Call edges in function: test0
67 ; CHECK-LABEL: Call edges in function: test1
111 ; CHECK-LABEL: Call edges in function: test2
|
| /external/llvm/test/Analysis/BlockFrequencyInfo/ |
| D | double_exit.ll | 15 ; Pseudo-edges = exit
28 ; Pseudo-edges = outer.inc @ 1/5, exit @ 1/5
88 ; Pseudo-edges = exit
101 ; Pseudo-edges = outer.inc
114 ; Pseudo-edges = middle.inc @ 1/5, outer.inc @ 1/5
|
| /external/valgrind/coregrind/ |
| D | m_transtab.c | 137 } edges; member
149 } edges; member
511 return VG_(sizeXA)(iea->edges.var); in InEdgeArr__size()
522 VG_(deleteXA)(iea->edges.var); in InEdgeArr__makeEmpty()
523 iea->edges.var = NULL; in InEdgeArr__makeEmpty()
536 return (InEdge*)VG_(indexXA)(iea->edges.var, i); in InEdgeArr__index()
539 return &iea->edges.fixed[i]; in InEdgeArr__index()
548 VG_(removeIndexXA)(iea->edges.var, i); in InEdgeArr__deleteIndex()
552 iea->edges.fixed[i] = iea->edges.fixed[i+1]; in InEdgeArr__deleteIndex()
563 VG_(addToXA)(iea->edges.var, ie); in InEdgeArr__add()
[all …]
|
| /external/eigen/Eigen/src/Core/arch/AltiVec/ |
| D | PacketMath.h | 309 Packet16uc MSQ, LSQ, edges;
315 edges=vec_perm(LSQ,MSQ,edgeAlign); // extract the edges
317 MSQ = vec_perm(edges,(Packet16uc)from,align); // misalign the data (MSQ)
318 LSQ = vec_perm((Packet16uc)from,edges,align); // misalign the data (LSQ)
327 Packet16uc MSQ, LSQ, edges;
333 edges=vec_perm(LSQ, MSQ, edgeAlign); // extract the edges
335 MSQ = vec_perm(edges, (Packet16uc) from, align); // misalign the data (MSQ)
336 LSQ = vec_perm((Packet16uc) from, edges, align); // misalign the data (LSQ)
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2003-06-25-Reoptimizer1.txt | 7 back-edges and insert llvm_first_trigger() function call which takes
30 How do we keep track of which edges to instrument, and which edges are
34 region and mark reachable edges.
37 region IGNORING back edges, and mark the edges which are reachable in
41 3) Mark BBs which end in edges that exit the hot region; we need to
|
| /external/valgrind/auxprogs/ |
| D | DotToScc.hs | 34 = do edges <- read_dot_file dot_file_name
35 let sccs = gen_sccs edges
57 let edges = [(s,d) | Just (s,d) <- map maybe_mk_edge linez] function
58 return edges
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| D | DotTreeGenerator.cs | 104 var edges = DefineEdges( tree, adaptor ); in ToDot()
111 foreach ( var s in edges ) in ToDot()
|