| /external/freetype/src/autofit/ |
| D | aflatin.c | 1122 AF_Edge edge = axis->edges + ee; in af_latin_hints_compute_edges() local
1126 dist = seg->pos - edge->fpos; in af_latin_hints_compute_edges()
1130 if ( dist < edge_distance_threshold && edge->dir == seg->dir ) in af_latin_hints_compute_edges()
1132 found = edge; in af_latin_hints_compute_edges()
1139 AF_Edge edge; in af_latin_hints_compute_edges() local
1146 memory, &edge ); in af_latin_hints_compute_edges()
1151 FT_ZERO( edge ); in af_latin_hints_compute_edges()
1153 edge->first = seg; in af_latin_hints_compute_edges()
1154 edge->last = seg; in af_latin_hints_compute_edges()
1155 edge->dir = seg->dir; in af_latin_hints_compute_edges()
[all …]
|
| D | aflatin2.c | 1134 AF_Edge edge = axis->edges + ee; in af_latin2_hints_compute_edges() local
1138 dist = seg->pos - edge->fpos; in af_latin2_hints_compute_edges()
1142 if ( dist < edge_distance_threshold && edge->dir == seg->dir ) in af_latin2_hints_compute_edges()
1144 found = edge; in af_latin2_hints_compute_edges()
1151 AF_Edge edge; in af_latin2_hints_compute_edges() local
1157 memory, &edge ); in af_latin2_hints_compute_edges()
1162 FT_ZERO( edge ); in af_latin2_hints_compute_edges()
1164 edge->first = seg; in af_latin2_hints_compute_edges()
1165 edge->last = seg; in af_latin2_hints_compute_edges()
1166 edge->fpos = seg->pos; in af_latin2_hints_compute_edges()
[all …]
|
| D | afcjk.c | 945 AF_Edge edge = axis->edges + ee; in af_cjk_hints_compute_edges() local
949 if ( edge->dir != seg->dir ) in af_cjk_hints_compute_edges()
952 dist = seg->pos - edge->fpos; in af_cjk_hints_compute_edges()
965 AF_Segment seg1 = edge->first; in af_cjk_hints_compute_edges()
980 } while ( ( seg1 = seg1->edge_next ) != edge->first ); in af_cjk_hints_compute_edges()
987 found = edge; in af_cjk_hints_compute_edges()
993 AF_Edge edge; in af_cjk_hints_compute_edges() local
1000 memory, &edge ); in af_cjk_hints_compute_edges()
1005 FT_ZERO( edge ); in af_cjk_hints_compute_edges()
1007 edge->first = seg; in af_cjk_hints_compute_edges()
[all …]
|
| D | afhints.c | 76 AF_Edge edge = NULL; in af_axis_hints_new_edge() local
84 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) ); in af_axis_hints_new_edge()
104 edge = edges + axis->num_edges; in af_axis_hints_new_edge()
106 while ( edge > edges ) in af_axis_hints_new_edge()
108 if ( edge[-1].fpos < fpos ) in af_axis_hints_new_edge()
113 if ( edge[-1].fpos == fpos && dir == axis->major_dir ) in af_axis_hints_new_edge()
116 edge[0] = edge[-1]; in af_axis_hints_new_edge()
117 edge--; in af_axis_hints_new_edge()
122 FT_ZERO( edge ); in af_axis_hints_new_edge()
123 edge->fpos = (FT_Short)fpos; in af_axis_hints_new_edge()
[all …]
|
| /external/opencv/cv/src/ |
| D | cvsubdivision2d.cpp | 78 CvQuadEdge2D *edge = 0; in cvSubdiv2DMakeEdge() local
88 edge = (CvQuadEdge2D*)cvSetNew( (CvSet*)subdiv->edges ); in cvSubdiv2DMakeEdge()
91 memset( edge->pt, 0, sizeof( edge->pt )); in cvSubdiv2DMakeEdge()
92 edgehandle = (CvSubdiv2DEdge) edge; in cvSubdiv2DMakeEdge()
94 edge->next[0] = edgehandle; in cvSubdiv2DMakeEdge()
95 edge->next[1] = edgehandle + 3; in cvSubdiv2DMakeEdge()
96 edge->next[2] = edgehandle + 2; in cvSubdiv2DMakeEdge()
97 edge->next[3] = edgehandle + 1; in cvSubdiv2DMakeEdge()
143 cvSubdiv2DSetEdgePoints( CvSubdiv2DEdge edge, in cvSubdiv2DSetEdgePoints() argument
146 CvQuadEdge2D *quadedge = (CvQuadEdge2D *) (edge & ~3); in cvSubdiv2DSetEdgePoints()
[all …]
|
| /external/skia/src/core/ |
| D | SkRegion_rects.cpp | 57 SkRegion::RunType append(SkRegion::RunType top, const VEdge* edge);
85 SkRegion::RunType Accumulator::append(SkRegion::RunType currY, const VEdge* edge) {
92 int winding = edge->fWinding;
96 if (edge->fTop > currY) {
97 nextY = SkMin32(nextY, edge->fTop);
101 *row++ = edge->fX;
102 TRACE_ROW(SkDebugf("Y %d [%d", currY, edge->fX);)
103 edge = edge->fNext;
105 if (edge->fTop > currY) {
106 nextY = SkMin32(nextY, edge->fTop);
[all …]
|
| D | SkScan_Path.cpp | 33 static void validate_sort(const SkEdge* edge) { in validate_sort() argument
36 while (edge->fFirstY != SK_MaxS32) { in validate_sort()
37 edge->validate(); in validate_sort()
38 SkASSERT(y <= edge->fFirstY); in validate_sort()
40 y = edge->fFirstY; in validate_sort()
41 edge = edge->fNext; in validate_sort()
45 #define validate_sort(edge) argument
48 static inline void remove_edge(SkEdge* edge) { in remove_edge() argument
49 edge->fPrev->fNext = edge->fNext; in remove_edge()
50 edge->fNext->fPrev = edge->fPrev; in remove_edge()
[all …]
|
| D | SkEdgeBuilder.cpp | 17 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); in addLine() local
18 if (edge->setLine(pts[0], pts[1], NULL, fShiftUp)) { in addLine()
19 fList.push(edge); in addLine()
26 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); in addQuad() local
27 if (edge->setQuadratic(pts, fShiftUp)) { in addQuad()
28 fList.push(edge); in addQuad()
35 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); in addCubic() local
36 if (edge->setCubic(pts, NULL, fShiftUp)) { in addCubic()
37 fList.push(edge); in addCubic()
|
| D | SkRegion_path.cpp | 396 static int extract_path(Edge* edge, Edge* stop, SkPath* path) { in extract_path() argument
397 while (0 == edge->fFlags) { in extract_path()
398 edge++; // skip over "used" edges in extract_path()
401 SkASSERT(edge < stop); in extract_path()
403 Edge* base = edge; in extract_path()
404 Edge* prev = edge; in extract_path()
405 edge = edge->fNext; in extract_path()
406 SkASSERT(edge != base); in extract_path()
412 if (prev->fX != edge->fX || prev->fY1 != edge->fY0) { // skip collinear in extract_path()
414 path->lineTo(SkIntToScalar(edge->fX), SkIntToScalar(edge->fY0)); // H in extract_path()
[all …]
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | PathProfiling.cpp | 241 void unlinkEdge(BallLarusEdge* edge);
244 void makeEdgeSpanning(BLInstrumentationEdge* edge);
247 void pushInitializationFromEdge(BLInstrumentationEdge* edge);
250 void pushCountersFromEdge(BLInstrumentationEdge* edge);
288 ConstantInt* createIncrementConstant(BLInstrumentationEdge* edge);
331 BLInstrumentationEdge* edge,
336 bool splitCritical(BLInstrumentationEdge* edge, BLInstrumentationDag* dag);
391 const BLInstrumentationEdge& edge)
394 const BLInstrumentationEdge& edge) { in operator <<() argument
395 os << "[" << edge.getSource()->getName() << " -> " in operator <<()
[all …]
|
| D | OptimalEdgeProfiling.cpp | 150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry); in runOnModule() local
151 if (!std::binary_search(MST.begin(), MST.end(), edge)) { in runOnModule()
152 printEdgeCounter(edge, entry, i); in runOnModule()
173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0); in runOnModule() local
174 if (!std::binary_search(MST.begin(), MST.end(), edge)) { in runOnModule()
175 printEdgeCounter(edge, BB, i); in runOnModule()
184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); in runOnModule() local
185 if (!std::binary_search(MST.begin(), MST.end(), edge)) { in runOnModule()
198 printEdgeCounter(edge, BB, i); in runOnModule()
202 printEdgeCounter(edge, Succ, i); in runOnModule()
|
| /external/mesa3d/src/glsl/builtins/ir/ |
| D | step | 4 (declare (in) float edge)
6 ((return (expression float b2f (expression bool >= (var_ref x) (var_ref edge))))))
10 (declare (in) float edge)
13 …1)) (x) (var_ref t) (expression float b2f (expression bool >= (swiz x (var_ref x))(var_ref edge))))
14 …1)) (y) (var_ref t) (expression float b2f (expression bool >= (swiz y (var_ref x))(var_ref edge))))
19 (declare (in) float edge)
22 …1)) (x) (var_ref t) (expression float b2f (expression bool >= (swiz x (var_ref x))(var_ref edge))))
23 …1)) (y) (var_ref t) (expression float b2f (expression bool >= (swiz y (var_ref x))(var_ref edge))))
24 …1)) (z) (var_ref t) (expression float b2f (expression bool >= (swiz z (var_ref x))(var_ref edge))))
29 (declare (in) float edge)
[all …]
|
| /external/quake/quake/src/WinQuake/ |
| D | r_edge.cpp | 31 this breaks spans at every edge, even hidden ones (bad)
71 void R_LeadingEdge (edge_t *edge);
72 void R_LeadingEdgeBackwards (edge_t *edge);
73 void R_TrailingEdge (surf_t *surf, edge_t *edge);
336 void R_LeadingEdgeBackwards (edge_t *edge) in R_LeadingEdgeBackwards() argument
343 surf = &surfaces[edge->surfs[1]]; in R_LeadingEdgeBackwards()
386 iu = edge->u >> 20; in R_LeadingEdgeBackwards()
416 void R_TrailingEdge (surf_t *surf, edge_t *edge) in R_TrailingEdge() argument
432 iu = edge->u >> 20; in R_TrailingEdge()
460 void R_LeadingEdge (edge_t *edge) in R_LeadingEdge() argument
[all …]
|
| D | r_draw.cpp | 82 edge_t *edge, *pcheck; in R_EmitEdge() local
184 edge = edge_p++; in R_EmitEdge()
186 edge->owner = r_pedge; in R_EmitEdge()
188 edge->nearzi = lzi0; in R_EmitEdge()
196 edge->surfs[0] = surface_p - surfaces; in R_EmitEdge()
197 edge->surfs[1] = 0; in R_EmitEdge()
208 edge->surfs[0] = 0; in R_EmitEdge()
209 edge->surfs[1] = surface_p - surfaces; in R_EmitEdge()
215 edge->u_step = u_step*0x100000; in R_EmitEdge()
216 edge->u = u*0x100000 + 0xFFFFF; in R_EmitEdge()
[all …]
|
| /external/quake/quake/src/QW/client/ |
| D | r_edge.c | 31 this breaks spans at every edge, even hidden ones (bad)
71 void R_LeadingEdge (edge_t *edge);
72 void R_LeadingEdgeBackwards (edge_t *edge);
73 void R_TrailingEdge (surf_t *surf, edge_t *edge);
336 void R_LeadingEdgeBackwards (edge_t *edge) in R_LeadingEdgeBackwards() argument
343 surf = &surfaces[edge->surfs[1]]; in R_LeadingEdgeBackwards()
386 iu = edge->u >> 20; in R_LeadingEdgeBackwards()
416 void R_TrailingEdge (surf_t *surf, edge_t *edge) in R_TrailingEdge() argument
432 iu = edge->u >> 20; in R_TrailingEdge()
460 void R_LeadingEdge (edge_t *edge) in R_LeadingEdge() argument
[all …]
|
| D | r_draw.c | 82 edge_t *edge, *pcheck; in R_EmitEdge() local
184 edge = edge_p++; in R_EmitEdge()
186 edge->owner = r_pedge; in R_EmitEdge()
188 edge->nearzi = lzi0; in R_EmitEdge()
196 edge->surfs[0] = surface_p - surfaces; in R_EmitEdge()
197 edge->surfs[1] = 0; in R_EmitEdge()
208 edge->surfs[0] = 0; in R_EmitEdge()
209 edge->surfs[1] = surface_p - surfaces; in R_EmitEdge()
215 edge->u_step = u_step*0x100000; in R_EmitEdge()
216 edge->u = u*0x100000 + 0xFFFFF; in R_EmitEdge()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | ProfileEstimatorPass.cpp | 134 Edge edge = getEdge(*bbi,BB); in recurseBasicBlock() local
135 double w = getEdgeWeight(edge); in recurseBasicBlock()
143 printEdgeError(edge, "but is backedge, continuing"); in recurseBasicBlock()
149 printEdgeError(edge, "returning"); in recurseBasicBlock()
205 Edge edge = getEdge(Latch,0); in recurseBasicBlock() local
206 EdgeInformation[BB->getParent()][edge] = BBWeight; in recurseBasicBlock()
207 printEdgeWeight(edge); in recurseBasicBlock()
208 edge = getEdge(Latch, BB); in recurseBasicBlock()
209 EdgeInformation[BB->getParent()][edge] = BBWeight * ExecCount; in recurseBasicBlock()
210 printEdgeWeight(edge); in recurseBasicBlock()
[all …]
|
| /external/opencv/cvaux/src/ |
| D | cvsubdiv2.cpp | 59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i); in icvSubdiv2DCheck() local
61 if( edge && CV_IS_SET_ELEM( edge )) in icvSubdiv2DCheck()
65 CvSubdiv2DEdge e = (CvSubdiv2DEdge)edge + j; in icvSubdiv2DCheck()
107 draw_subdiv_facet( CvSubdiv2D * subdiv, IplImage * dst, IplImage * src, CvSubdiv2DEdge edge ) in draw_subdiv_facet() argument
109 CvSubdiv2DEdge t = edge; in draw_subdiv_facet()
120 while( t != edge && count < subdiv->quad_edges * 4 ); in draw_subdiv_facet()
128 t = edge; in draw_subdiv_facet()
142 CvSubdiv2DPoint *pt = cvSubdiv2DEdgeDst( cvSubdiv2DRotateEdge( edge, 1 )); in draw_subdiv_facet()
173 CvQuadEdge2D *edge = (CvQuadEdge2D *) cvGetSetElem( subdiv->edges, i ); in icvDrawMosaic() local
175 if( edge && CV_IS_SET_ELEM( edge )) in icvDrawMosaic()
[all …]
|
| /external/llvm/test/CodeGen/ARM/ |
| D | 2007-05-23-BadPreIndexedStore.ll | 19 %edge.230.0.rec = shl i32 %indvar, 1 ; <i32> [#uses=3]
20 …%edge.230.0 = getelementptr %struct.shape_edge_t* null, i32 %edge.230.0.rec ; <%struct.shape_edge…
21 %edge.230.0.sum6970 = or i32 %edge.230.0.rec, 1 ; <i32> [#uses=2]
22 …%tmp154 = getelementptr %struct.shape_edge_t* null, i32 %edge.230.0.sum6970 ; <%struct.shape_edge…
23 …%tmp11.i5 = getelementptr %struct.shape_edge_t* null, i32 %edge.230.0.sum6970, i32 0 ; <%struct.s…
24 store %struct.shape_edge_t* %edge.230.0, %struct.shape_edge_t** %tmp11.i5
26 %tmp16254.0.rec = add i32 %edge.230.0.rec, 2 ; <i32> [#uses=1]
|
| /external/bison/src/ |
| D | vcg.h | 322 struct edge struct
432 struct edge *next; argument
439 typedef struct edge edge; typedef
924 edge edge; member
932 edge *edge_list;
941 void new_edge (edge *e);
944 void add_edge (graph *g, edge *e);
955 void open_edge (edge *e, FILE *fout);
956 void output_edge (edge *e, FILE *fout);
|
| /external/webkit/Source/WebCore/rendering/ |
| D | RenderFrameSet.h | 44 bool preventResize(FrameEdge edge) const { return m_preventResize[edge]; } in preventResize()
45 bool allowBorder(FrameEdge edge) const { return m_allowBorder[edge]; } in allowBorder()
47 …void setPreventResize(FrameEdge edge, bool preventResize) { m_preventResize[edge] = preventResize;… in setPreventResize()
48 void setAllowBorder(FrameEdge edge, bool allowBorder) { m_allowBorder[edge] = allowBorder; } in setAllowBorder()
|
| /external/opencv/cxcore/src/ |
| D | cxdatastructs.cpp | 2979 CvGraphEdge *edge = vtx->first; in cvGraphRemoveVtxByPtr() local
2980 if( !edge ) in cvGraphRemoveVtxByPtr()
2982 cvGraphRemoveEdgeByPtr( graph, edge->vtx[0], edge->vtx[1] ); in cvGraphRemoveVtxByPtr()
3014 CvGraphEdge *edge = vtx->first; in cvGraphRemoveVtx() local
3017 if( !edge ) in cvGraphRemoveVtx()
3019 cvGraphRemoveEdgeByPtr( graph, edge->vtx[0], edge->vtx[1] ); in cvGraphRemoveVtx()
3036 CvGraphEdge *edge = 0; in cvFindGraphEdgeByPtr() local
3056 edge = start_vtx->first; in cvFindGraphEdgeByPtr()
3057 for( ; edge; edge = edge->next[ofs] ) in cvFindGraphEdgeByPtr()
3059 ofs = start_vtx == edge->vtx[1]; in cvFindGraphEdgeByPtr()
[all …]
|
| /external/skia/samplecode/ |
| D | SamplePatch.cpp | 84 static void eval_sheet(const SkPoint edge[], int nu, int nv, int iu, int iv, in eval_sheet() argument
99 SkScalar x0 = SkScalarMul(UV, edge[TL].fX) + SkScalarMul(uV, edge[TR].fX) + in eval_sheet()
100 SkScalarMul(Uv, edge[BL].fX) + SkScalarMul(uv, edge[BR].fX); in eval_sheet()
101 SkScalar y0 = SkScalarMul(UV, edge[TL].fY) + SkScalarMul(uV, edge[TR].fY) + in eval_sheet()
102 SkScalarMul(Uv, edge[BL].fY) + SkScalarMul(uv, edge[BR].fY); in eval_sheet()
104 SkScalar x = SkScalarMul(SK_Scalar1 - v, edge[TL+iu].fX) + in eval_sheet()
105 SkScalarMul(u, edge[TR+iv].fX) + in eval_sheet()
106 SkScalarMul(v, edge[BR+nu-iu].fX) + in eval_sheet()
107 SkScalarMul(SK_Scalar1 - u, edge[BL+nv-iv].fX) - x0; in eval_sheet()
108 SkScalar y = SkScalarMul(SK_Scalar1 - v, edge[TL+iu].fY) + in eval_sheet()
[all …]
|
| /external/webkit/Source/WebCore/inspector/front-end/ |
| D | HeapSnapshot.js | 163 WebInspector.HeapSnapshotEdgeIterator = function(edge) argument
165 this.edge = edge;
171 this.edge.edgeIndex = 0;
176 return this.edge.edgeIndex < this.edge._edges.length;
181 return this.edge.edgeIndex;
186 this.edge.edgeIndex = newIndex;
191 return this.edge;
196 this.edge.edgeIndex += this.edge._snapshot._edgeFieldsCount;
624 var edge = edgesIter.edge;
625 var nodeIndex = edge.nodeIndex;
[all …]
|
| /external/webkit/Source/WebCore/platform/graphics/ |
| D | IntRect.h | 113 void shiftXEdgeTo(int edge) in shiftXEdgeTo() argument
115 int delta = edge - x(); in shiftXEdgeTo()
116 setX(edge); in shiftXEdgeTo()
119 void shiftMaxXEdgeTo(int edge) in shiftMaxXEdgeTo() argument
121 int delta = edge - maxX(); in shiftMaxXEdgeTo()
124 void shiftYEdgeTo(int edge) in shiftYEdgeTo() argument
126 int delta = edge - y(); in shiftYEdgeTo()
127 setY(edge); in shiftYEdgeTo()
130 void shiftMaxYEdgeTo(int edge) in shiftMaxYEdgeTo() argument
132 int delta = edge - maxY(); in shiftMaxYEdgeTo()
|