| /external/replicaisland/tools/ |
| D | ExtractPoints.js | 75 var edge = new Object; variable
77 edge.startX = firstPoint.anchor[0];
78 edge.startY = firstPoint.anchor[1];
80 edge.endX = lastPoint.anchor[0];
81 edge.endY = lastPoint.anchor[1];
83 var normalX = -(edge.endY - edge.startY);
84 var normalY = edge.endX - edge.startX;
90 edge.normalX = normalX;
91 edge.normalY = normalY;
102 totalX += edge.endX;
[all …]
|
| /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 | 64 SkRegion::RunType append(SkRegion::RunType top, const VEdge* edge);
92 SkRegion::RunType Accumulator::append(SkRegion::RunType currY, const VEdge* edge) {
99 int winding = edge->fWinding;
103 if (edge->fTop > currY) {
104 nextY = SkMin32(nextY, edge->fTop);
108 *row++ = edge->fX;
109 TRACE_ROW(SkDebugf("Y %d [%d", currY, edge->fX);)
110 edge = edge->fNext;
112 if (edge->fTop > currY) {
113 nextY = SkMin32(nextY, edge->fTop);
[all …]
|
| D | SkScan_Path.cpp | 28 static void validate_sort(const SkEdge* edge) { in validate_sort() argument
31 while (edge->fFirstY != SK_MaxS32) { in validate_sort()
32 edge->validate(); in validate_sort()
33 SkASSERT(y <= edge->fFirstY); in validate_sort()
35 y = edge->fFirstY; in validate_sort()
36 edge = edge->fNext; in validate_sort()
40 #define validate_sort(edge) argument
43 static inline void remove_edge(SkEdge* edge) { in remove_edge() argument
44 edge->fPrev->fNext = edge->fNext; in remove_edge()
45 edge->fNext->fPrev = edge->fPrev; in remove_edge()
[all …]
|
| D | SkEdgeBuilder.cpp | 26 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); in addLine() local
27 if (edge->setLine(pts[0], pts[1], fShiftUp)) { in addLine()
28 fList.push(edge); in addLine()
35 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); in addQuad() local
36 if (edge->setQuadratic(pts, fShiftUp)) { in addQuad()
37 fList.push(edge); in addQuad()
44 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); in addCubic() local
45 if (edge->setCubic(pts, NULL, fShiftUp)) { in addCubic()
46 fList.push(edge); in addCubic()
100 SkEdge* edge = reinterpret_cast<SkEdge*>(storage); in buildPoly() local
[all …]
|
| /external/skia/legacy/src/core/ |
| D | SkRegion_rects.cpp | 64 SkRegion::RunType append(SkRegion::RunType top, const VEdge* edge);
92 SkRegion::RunType Accumulator::append(SkRegion::RunType currY, const VEdge* edge) {
99 int winding = edge->fWinding;
103 if (edge->fTop > currY) {
104 nextY = SkMin32(nextY, edge->fTop);
108 *row++ = edge->fX;
109 TRACE_ROW(SkDebugf("Y %d [%d", currY, edge->fX);)
110 edge = edge->fNext;
112 if (edge->fTop > currY) {
113 nextY = SkMin32(nextY, edge->fTop);
[all …]
|
| D | SkScan_Path.cpp | 23 static void validate_sort(const SkEdge* edge) { in validate_sort() argument
26 while (edge->fFirstY != SK_MaxS32) { in validate_sort()
27 edge->validate(); in validate_sort()
28 SkASSERT(y <= edge->fFirstY); in validate_sort()
30 y = edge->fFirstY; in validate_sort()
31 edge = edge->fNext; in validate_sort()
35 #define validate_sort(edge) argument
38 static inline void remove_edge(SkEdge* edge) { in remove_edge() argument
39 edge->fPrev->fNext = edge->fNext; in remove_edge()
40 edge->fNext->fPrev = edge->fPrev; in remove_edge()
[all …]
|
| D | SkEdgeBuilder.cpp | 24 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); in addLine() local
25 if (edge->setLine(pts[0], pts[1], NULL, fShiftUp)) { in addLine()
26 fList.push(edge); in addLine()
33 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); in addQuad() local
34 if (edge->setQuadratic(pts, fShiftUp)) { in addQuad()
35 fList.push(edge); in addQuad()
42 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); in addCubic() local
43 if (edge->setCubic(pts, NULL, fShiftUp)) { in addCubic()
44 fList.push(edge); in addCubic()
|
| D | SkRegion_path.cpp | 388 static int extract_path(Edge* edge, Edge* stop, SkPath* path) { in extract_path() argument
389 while (0 == edge->fFlags) { in extract_path()
390 edge++; // skip over "used" edges in extract_path()
393 SkASSERT(edge < stop); in extract_path()
395 Edge* base = edge; in extract_path()
396 Edge* prev = edge; in extract_path()
397 edge = edge->fNext; in extract_path()
398 SkASSERT(edge != base); in extract_path()
404 if (prev->fX != edge->fX || prev->fY1 != edge->fY0) { // skip collinear in extract_path()
406 path->lineTo(SkIntToScalar(edge->fX), SkIntToScalar(edge->fY0)); // H in extract_path()
[all …]
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | PathProfiling.cpp | 240 void unlinkEdge(BallLarusEdge* edge);
243 void makeEdgeSpanning(BLInstrumentationEdge* edge);
246 void pushInitializationFromEdge(BLInstrumentationEdge* edge);
249 void pushCountersFromEdge(BLInstrumentationEdge* edge);
287 ConstantInt* createIncrementConstant(BLInstrumentationEdge* edge);
330 BLInstrumentationEdge* edge,
335 bool splitCritical(BLInstrumentationEdge* edge, BLInstrumentationDag* dag);
390 const BLInstrumentationEdge& edge)
393 const BLInstrumentationEdge& edge) { in operator <<() argument
394 os << "[" << edge.getSource()->getName() << " -> " in operator <<()
[all …]
|
| /external/llvm/test/Analysis/BranchProbabilityInfo/ |
| D | loop.ll | 12 ; CHECK: edge entry -> do.body probability is 16 / 16 = 100%
18 ; CHECK: edge do.body -> do.body1 probability is 124 / 124 = 100%
26 ; CHECK: edge do.body1 -> do.body1 probability is 124 / 128
27 ; CHECK: edge do.body1 -> do.end probability is 4 / 128
34 ; CHECK: edge do.end -> do.body probability is 124 / 128
35 ; CHECK: edge do.end -> do.end5 probability is 4 / 128
46 ; CHECK: edge entry -> for.body.lr.ph probability is 20 / 32
47 ; CHECK: edge entry -> for.end6 probability is 12 / 32
52 ; CHECK: edge for.body.lr.ph -> for.body probability is 16 / 16 = 100%
58 ; CHECK: edge for.body -> for.body3 probability is 62 / 124 = 50%
[all …]
|
| D | basic.ll | 7 ; CHECK: edge entry -> body probability is 16 / 16 = 100%
18 ; CHECK: edge body -> exit probability is 4 / 128
19 ; CHECK: edge body -> body probability is 124 / 128
30 ; CHECK: edge entry -> then probability is 64 / 68
31 ; CHECK: edge entry -> else probability is 4 / 68
35 ; CHECK: edge then -> exit probability is 16 / 16 = 100%
39 ; CHECK: edge else -> exit probability is 16 / 16 = 100%
55 ; CHECK: edge entry -> case_a probability is 4 / 80
56 ; CHECK: edge entry -> case_b probability is 4 / 80
57 ; CHECK: edge entry -> case_c probability is 64 / 80
[all …]
|
| D | noreturn.ll | 11 ; CHECK: edge entry -> exit probability is 1048575 / 1048576
12 ; CHECK: edge entry -> abort probability is 1 / 1048576
29 ; CHECK: edge entry -> exit probability is 1048575 / 1048579
30 ; CHECK: edge entry -> case_a probability is 1 / 1048579
31 ; CHECK: edge entry -> case_b probability is 1 / 1048579
32 ; CHECK: edge entry -> case_c probability is 1 / 1048579
33 ; CHECK: edge entry -> case_d probability is 1 / 1048579
58 ; CHECK: edge entry -> exit probability is 1048575 / 1048576
59 ; CHECK: edge entry -> dom probability is 1 / 1048576
64 ; CHECK: edge dom -> idom1 probability is 1 / 2
[all …]
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| D | FASerializer.java | 124 Transition edge = (Transition) s.transition(i); in walkFANormalizingStateNumbers() local
125 walkFANormalizingStateNumbers(edge.target); // keep walkin' in walkFANormalizingStateNumbers()
129 if ( edge instanceof RuleClosureTransition ) { in walkFANormalizingStateNumbers()
130 walkFANormalizingStateNumbers(((RuleClosureTransition) edge).followState); in walkFANormalizingStateNumbers()
152 Transition edge = (Transition) s.transition(i); in walkSerializingFA() local
155 if ( edge.isAction() ) { in walkSerializingFA()
158 else if ( edge.isEpsilon() ) { in walkSerializingFA()
161 else if ( edge.isSemanticPredicate() ) { in walkSerializingFA()
162 buf.append("-{"+edge.label.getSemanticContext()+"}?->"); in walkSerializingFA()
166 if ( edge.target instanceof DFAState ) { in walkSerializingFA()
[all …]
|
| D | DOTGenerator.java | 133 Transition edge = (Transition) s.transition(i); in walkCreatingDFADOT() local
139 if ( edge.target instanceof DFAState && in walkCreatingDFADOT()
140 ((DFAState)edge.target).getAcceptStateReachable()!=DFA.REACHABLE_YES ) in walkCreatingDFADOT()
146 st.add("label", getEdgeLabel(edge)); in walkCreatingDFADOT()
148 st.add("target", getStateLabel(edge.target)); in walkCreatingDFADOT()
151 walkCreatingDFADOT(dot, (DFAState)edge.target); // keep walkin' in walkCreatingDFADOT()
208 Transition edge = (Transition) s.transition(i); in walkRuleNFACreatingDOT() local
209 if ( edge instanceof RuleClosureTransition ) { in walkRuleNFACreatingDOT()
210 RuleClosureTransition rr = ((RuleClosureTransition)edge); in walkRuleNFACreatingDOT()
226 if ( edge.isAction() ) { in walkRuleNFACreatingDOT()
[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 …]
|
| /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 …]
|
| /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/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()
|