| /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/opencv3/modules/imgproc/src/ |
| D | subdivision2d.cpp | 46 int Subdiv2D::nextEdge(int edge) const in nextEdge()
48 CV_DbgAssert((size_t)(edge >> 2) < qedges.size()); in nextEdge()
49 return qedges[edge >> 2].next[edge & 3]; in nextEdge()
52 int Subdiv2D::rotateEdge(int edge, int rotate) const in rotateEdge() argument
54 return (edge & ~3) + ((edge + rotate) & 3); in rotateEdge()
57 int Subdiv2D::symEdge(int edge) const in symEdge()
59 return edge ^ 2; in symEdge()
62 int Subdiv2D::getEdge(int edge, int nextEdgeType) const in getEdge() argument
64 CV_DbgAssert((size_t)(edge >> 2) < qedges.size()); in getEdge()
65 edge = qedges[edge >> 2].next[(edge + nextEdgeType) & 3]; in getEdge()
[all …]
|
| /external/skia/src/gpu/ |
| D | GrTessellator.cpp | 645 void remove_edge(Edge* edge, EdgeList* edges) { in remove_edge() argument
646 LOG("removing edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID); in remove_edge()
647 SkASSERT(edge->isActive(edges)); in remove_edge()
648 remove<Edge, &Edge::fLeft, &Edge::fRight>(edge, &edges->fHead, &edges->fTail); in remove_edge()
651 void insert_edge(Edge* edge, Edge* prev, EdgeList* edges) { in insert_edge() argument
652 LOG("inserting edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID); in insert_edge()
653 SkASSERT(!edge->isActive(edges)); in insert_edge()
655 insert<Edge, &Edge::fLeft, &Edge::fRight>(edge, prev, next, &edges->fHead, &edges->fTail); in insert_edge()
677 void find_enclosing_edges(Edge* edge, EdgeList* edges, Comparator& c, Edge** left, Edge** right) { in find_enclosing_edges() argument
681 if ((c.sweep_gt(edge->fTop->fPoint, next->fTop->fPoint) && next->isRightOf(edge->fTop)) || in find_enclosing_edges()
[all …]
|
| /external/skia/src/core/ |
| D | SkEdgeBuilder.cpp | 25 SkEdgeBuilder::Combine SkEdgeBuilder::CombineVertical(const SkEdge* edge, SkEdge* last) { in CombineVertical() argument
26 if (last->fCurveCount || last->fDX || edge->fX != last->fX) { in CombineVertical()
29 if (edge->fWinding == last->fWinding) { in CombineVertical()
30 if (edge->fLastY + 1 == last->fFirstY) { in CombineVertical()
31 last->fFirstY = edge->fFirstY; in CombineVertical()
34 if (edge->fFirstY == last->fLastY + 1) { in CombineVertical()
35 last->fLastY = edge->fLastY; in CombineVertical()
40 if (edge->fFirstY == last->fFirstY) { in CombineVertical()
41 if (edge->fLastY == last->fLastY) { in CombineVertical()
44 if (edge->fLastY < last->fLastY) { in CombineVertical()
[all …]
|
| D | SkScan_Path.cpp | 24 static void validate_sort(const SkEdge* edge) { in validate_sort() argument
27 while (edge->fFirstY != SK_MaxS32) { in validate_sort()
28 edge->validate(); in validate_sort()
29 SkASSERT(y <= edge->fFirstY); in validate_sort()
31 y = edge->fFirstY; in validate_sort()
32 edge = edge->fNext; in validate_sort()
36 #define validate_sort(edge) argument
39 static inline void remove_edge(SkEdge* edge) { in remove_edge() argument
40 edge->fPrev->fNext = edge->fNext; in remove_edge()
41 edge->fNext->fPrev = edge->fPrev; in remove_edge()
[all …]
|
| /external/llvm/test/Analysis/BranchProbabilityInfo/ |
| D | loop.ll | 12 ; CHECK: edge entry -> do.body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
18 ; CHECK: edge do.body -> do.body1 probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
26 ; CHECK: edge do.body1 -> do.body1 probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
27 ; CHECK: edge do.body1 -> do.end probability is 0x04000000 / 0x80000000 = 3.12%
34 ; CHECK: edge do.end -> do.body probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
35 ; CHECK: edge do.end -> do.end5 probability is 0x04000000 / 0x80000000 = 3.12%
46 ; CHECK: edge entry -> for.body.lr.ph probability is 0x50000000 / 0x80000000 = 62.50%
47 ; CHECK: edge entry -> for.end6 probability is 0x30000000 / 0x80000000 = 37.50%
52 ; CHECK: edge for.body.lr.ph -> for.body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
58 ; CHECK: edge for.body -> for.body3 probability is 0x50000000 / 0x80000000 = 62.50%
[all …]
|
| D | basic.ll | 7 ; CHECK: edge entry -> body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
18 ; CHECK: edge body -> exit probability is 0x04000000 / 0x80000000 = 3.12%
19 ; CHECK: edge body -> body probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
30 ; CHECK: edge entry -> then probability is 0x78787878 / 0x80000000 = 94.12% [HOT edge]
31 ; CHECK: edge entry -> else probability is 0x07878788 / 0x80000000 = 5.88%
35 ; CHECK: edge then -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
39 ; CHECK: edge else -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
55 ; CHECK: edge entry -> case_a probability is 0x06666666 / 0x80000000 = 5.00%
56 ; CHECK: edge entry -> case_b probability is 0x06666666 / 0x80000000 = 5.00%
57 ; CHECK: edge entry -> case_c probability is 0x66666666 / 0x80000000 = 80.00%
[all …]
|
| D | noreturn.ll | 11 ; CHECK: edge entry -> exit probability is 0x7ffff800 / 0x80000000 = 100.00% [HOT edge]
12 ; CHECK: edge entry -> abort probability is 0x00000800 / 0x80000000 = 0.00%
29 ; CHECK: edge entry -> exit probability is 0x7fffe000 / 0x80000000 = 100.00% [HOT edge]
30 ; CHECK: edge entry -> case_a probability is 0x00000800 / 0x80000000 = 0.00%
31 ; CHECK: edge entry -> case_b probability is 0x00000800 / 0x80000000 = 0.00%
32 ; CHECK: edge entry -> case_c probability is 0x00000800 / 0x80000000 = 0.00%
33 ; CHECK: edge entry -> case_d probability is 0x00000800 / 0x80000000 = 0.00%
58 ; CHECK: edge entry -> exit probability is 0x7ffff800 / 0x80000000 = 100.00% [HOT edge]
59 ; CHECK: edge entry -> dom probability is 0x00000800 / 0x80000000 = 0.00%
64 ; CHECK: edge dom -> idom1 probability is 0x40000000 / 0x80000000 = 50.00%
[all …]
|
| /external/freetype/src/autofit/ |
| D | aflatin2.c | 1160 AF_Edge edge = axis->edges + ee; in af_latin2_hints_compute_edges() local
1164 dist = seg->pos - edge->fpos; in af_latin2_hints_compute_edges()
1168 if ( dist < edge_distance_threshold && edge->dir == seg->dir ) in af_latin2_hints_compute_edges()
1170 found = edge; in af_latin2_hints_compute_edges()
1177 AF_Edge edge; in af_latin2_hints_compute_edges() local
1183 memory, &edge ); in af_latin2_hints_compute_edges()
1188 FT_ZERO( edge ); in af_latin2_hints_compute_edges()
1190 edge->first = seg; in af_latin2_hints_compute_edges()
1191 edge->last = seg; in af_latin2_hints_compute_edges()
1192 edge->dir = seg->dir; in af_latin2_hints_compute_edges()
[all …]
|
| D | aflatin.c | 1596 AF_Edge edge = axis->edges + ee; in af_latin_hints_compute_edges() local
1600 dist = seg->pos - edge->fpos; in af_latin_hints_compute_edges()
1604 if ( dist < edge_distance_threshold && edge->dir == seg->dir ) in af_latin_hints_compute_edges()
1606 found = edge; in af_latin_hints_compute_edges()
1613 AF_Edge edge; in af_latin_hints_compute_edges() local
1620 memory, &edge ); in af_latin_hints_compute_edges()
1625 FT_ZERO( edge ); in af_latin_hints_compute_edges()
1627 edge->first = seg; in af_latin_hints_compute_edges()
1628 edge->last = seg; in af_latin_hints_compute_edges()
1629 edge->dir = seg->dir; in af_latin_hints_compute_edges()
[all …]
|
| D | afcjk.c | 962 AF_Edge edge = axis->edges + ee; in af_cjk_hints_compute_edges() local
966 if ( edge->dir != seg->dir ) in af_cjk_hints_compute_edges()
969 dist = seg->pos - edge->fpos; in af_cjk_hints_compute_edges()
982 AF_Segment seg1 = edge->first; in af_cjk_hints_compute_edges()
998 } while ( ( seg1 = seg1->edge_next ) != edge->first ); in af_cjk_hints_compute_edges()
1005 found = edge; in af_cjk_hints_compute_edges()
1011 AF_Edge edge; in af_cjk_hints_compute_edges() local
1018 memory, &edge ); in af_cjk_hints_compute_edges()
1023 FT_ZERO( edge ); in af_cjk_hints_compute_edges()
1025 edge->first = seg; in af_cjk_hints_compute_edges()
[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/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| D | Graph.py | 98 edge = self.next_edge
110 self.nodes[tail_id][0].append(edge)
111 self.nodes[head_id][1].append(edge)
116 self.edges[edge] = (head_id, tail_id, edge_data)
121 def hide_edge(self, edge): argument
127 head_id, tail_id, edge_data = self.hidden_edges[edge] = self.edges[edge]
128 self.nodes[tail_id][0].remove(edge)
129 self.nodes[head_id][1].remove(edge)
130 del self.edges[edge]
132 raise GraphError('Invalid edge %s' % edge)
[all …]
|
| /external/opencv3/modules/java/src/ |
| D | imgproc+Subdiv2D.java | 129 public int getEdge(int edge, int nextEdgeType) in getEdge() argument
132 int retVal = getEdge_0(nativeObj, edge, nextEdgeType); in getEdge()
143 public int nextEdge(int edge) in nextEdge() argument
146 int retVal = nextEdge_0(nativeObj, edge); in nextEdge()
157 public int rotateEdge(int edge, int rotate) in rotateEdge() argument
160 int retVal = rotateEdge_0(nativeObj, edge, rotate); in rotateEdge()
171 public int symEdge(int edge) in symEdge() argument
174 int retVal = symEdge_0(nativeObj, edge); in symEdge()
185 public int edgeOrg(int edge, Point orgpt) in edgeOrg() argument
188 int retVal = edgeOrg_0(nativeObj, edge, orgpt_out); in edgeOrg()
[all …]
|
| /external/mesa3d/src/glsl/builtins/ir/ |
| D | step.ir | 4 (declare (in) float edge)
6 ((return (expression float b2f (expression bool >= (var_ref x) (var_ref edge))))))
10 (declare (in) float edge)
13 …ign (x) (var_ref t) (expression float b2f (expression bool >= (swiz x (var_ref x))(var_ref edge))))
14 …ign (y) (var_ref t) (expression float b2f (expression bool >= (swiz y (var_ref x))(var_ref edge))))
19 (declare (in) float edge)
22 …ign (x) (var_ref t) (expression float b2f (expression bool >= (swiz x (var_ref x))(var_ref edge))))
23 …ign (y) (var_ref t) (expression float b2f (expression bool >= (swiz y (var_ref x))(var_ref edge))))
24 …ign (z) (var_ref t) (expression float b2f (expression bool >= (swiz z (var_ref x))(var_ref edge))))
29 (declare (in) float edge)
[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 …]
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| D | nv50_ir_graph.cpp | 97 Edge *edge = new Edge(this, node, kind); in attach() local
101 edge->next[0] = this->out; in attach()
102 edge->prev[0] = this->out->prev[0]; in attach()
103 edge->prev[0]->next[0] = edge; in attach()
104 this->out->prev[0] = edge; in attach()
106 this->out = edge; in attach()
109 edge->next[1] = node->in; in attach()
110 edge->prev[1] = node->in->prev[1]; in attach()
111 edge->prev[1]->next[1] = edge; in attach()
112 node->in->prev[1] = edge; in attach()
[all …]
|
| /external/v8/src/compiler/ |
| D | node-properties.cc | 85 bool NodeProperties::IsValueEdge(Edge edge) { in IsValueEdge() argument
86 Node* const node = edge.from(); in IsValueEdge()
87 return IsInputRange(edge, FirstValueIndex(node), in IsValueEdge()
93 bool NodeProperties::IsContextEdge(Edge edge) { in IsContextEdge() argument
94 Node* const node = edge.from(); in IsContextEdge()
95 return IsInputRange(edge, FirstContextIndex(node), in IsContextEdge()
101 bool NodeProperties::IsFrameStateEdge(Edge edge) { in IsFrameStateEdge() argument
102 Node* const node = edge.from(); in IsFrameStateEdge()
103 return IsInputRange(edge, FirstFrameStateIndex(node), in IsFrameStateEdge()
109 bool NodeProperties::IsEffectEdge(Edge edge) { in IsEffectEdge() argument
[all …]
|
| /external/pdfium/third_party/freetype/src/cff/ |
| D | cf2hints.c | 321 csCoord >= hintmap->edge[i + 1].csCoord ) in cf2_hintmap_map()
325 while ( i > 0 && csCoord < hintmap->edge[i].csCoord ) in cf2_hintmap_map()
330 if ( i == 0 && csCoord < hintmap->edge[0].csCoord ) in cf2_hintmap_map()
333 return FT_MulFix( csCoord - hintmap->edge[0].csCoord, in cf2_hintmap_map()
335 hintmap->edge[0].dsCoord; in cf2_hintmap_map()
343 return FT_MulFix( csCoord - hintmap->edge[i].csCoord, in cf2_hintmap_map()
344 hintmap->edge[i].scale ) + in cf2_hintmap_map()
345 hintmap->edge[i].dsCoord; in cf2_hintmap_map()
383 FT_Bool isPair = cf2_hint_isPair( &hintmap->edge[i] ); in cf2_hintmap_adjustHints()
390 FT_ASSERT( cf2_hint_isValid( &hintmap->edge[i] ) ); in cf2_hintmap_adjustHints()
[all …]
|
| /external/freetype/src/cff/ |
| D | cf2hints.c | 321 csCoord >= hintmap->edge[i + 1].csCoord ) in cf2_hintmap_map()
325 while ( i > 0 && csCoord < hintmap->edge[i].csCoord ) in cf2_hintmap_map()
330 if ( i == 0 && csCoord < hintmap->edge[0].csCoord ) in cf2_hintmap_map()
333 return FT_MulFix( csCoord - hintmap->edge[0].csCoord, in cf2_hintmap_map()
335 hintmap->edge[0].dsCoord; in cf2_hintmap_map()
343 return FT_MulFix( csCoord - hintmap->edge[i].csCoord, in cf2_hintmap_map()
344 hintmap->edge[i].scale ) + in cf2_hintmap_map()
345 hintmap->edge[i].dsCoord; in cf2_hintmap_map()
383 FT_Bool isPair = cf2_hint_isPair( &hintmap->edge[i] ); in cf2_hintmap_adjustHints()
390 FT_ASSERT( cf2_hint_isValid( &hintmap->edge[i] ) ); in cf2_hintmap_adjustHints()
[all …]
|
| /external/opencv3/modules/stitching/include/opencv2/stitching/detail/ |
| D | util_inl.hpp | 60 std::list<GraphEdge>::const_iterator edge = edges_[i].begin(); in forEach() local
61 for (; edge != edges_[i].end(); ++edge) in forEach()
62 body(*edge); in forEach()
82 std::list<GraphEdge>::const_iterator edge = edges_[vertex].begin(); in walkBreadthFirst() local
83 for (; edge != edges_[vertex].end(); ++edge) in walkBreadthFirst()
85 if (!was[edge->to]) in walkBreadthFirst()
87 body(*edge); in walkBreadthFirst()
88 was[edge->to] = true; in walkBreadthFirst()
89 vertices.push(edge->to); in walkBreadthFirst()
|
| /external/libavc/common/ |
| D | ih264_deblk_edge_filters.c | 115 WORD8 i = 0, edge; in ih264_deblk_luma_vert_bs4() local
126 for(edge = 0; edge < 4; edge++, pu1_src += blk_strd) in ih264_deblk_luma_vert_bs4()
236 WORD8 i = 0, edge; in ih264_deblk_luma_horz_bs4() local
248 for(edge = 0; edge < 4; edge++, pu1_src += 4, pu1_p3 += 4) in ih264_deblk_luma_horz_bs4()
358 WORD8 i = 0, edge; in ih264_deblk_chroma_vert_bs4_bp() local
365 for(edge = 0; edge < 4; in ih264_deblk_chroma_vert_bs4_bp()
366 edge++, pu1_src_u += blk_strd, pu1_src_v += blk_strd) in ih264_deblk_chroma_vert_bs4_bp()
450 WORD8 i = 0, edge; in ih264_deblk_chroma_horz_bs4_bp() local
459 for(edge = 0; edge < 4; edge++, pu1_src_u += 4, pu1_p1_u += 4, in ih264_deblk_chroma_horz_bs4_bp()
543 WORD8 i = 0, edge; in ih264_deblk_luma_vert_bslt4() local
[all …]
|
| /external/opencv3/modules/features2d/src/ |
| D | mser.cpp | 701 MSCREdge* edge, in preprocessMSER_8uC3() argument
753 *total += edge->chi = *dxptr; in preprocessMSER_8uC3()
755 edge->left = nodeptr; in preprocessMSER_8uC3()
756 edge->right = nodeptr+1; in preprocessMSER_8uC3()
757 edge++; in preprocessMSER_8uC3()
763 *total += edge->chi = *dxptr; in preprocessMSER_8uC3()
765 edge->left = nodeptr; in preprocessMSER_8uC3()
766 edge->right = nodeptr+1; in preprocessMSER_8uC3()
767 edge++; in preprocessMSER_8uC3()
777 *total += edge->chi = *dyptr; in preprocessMSER_8uC3()
[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/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/ |
| D | GraphvizGrapher.java | 84 for (GraphvizEdge edge : edges) { in postProcess()
85 renderEdge(edge); in postProcess()
166 protected void renderEdge(GraphvizEdge edge) { in renderEdge() argument
167 Map<String, String> attrs = getEdgeAttributes(edge); in renderEdge()
169 String tailId = getEdgeEndPoint(nodes.get(edge.getTailNodeId()).getIdentifier(), in renderEdge()
170 edge.getTailPortId(), edge.getTailCompassPoint()); in renderEdge()
172 String headId = getEdgeEndPoint(nodes.get(edge.getHeadNodeId()).getIdentifier(), in renderEdge()
173 edge.getHeadPortId(), edge.getHeadCompassPoint()); in renderEdge()
178 protected Map<String, String> getEdgeAttributes(GraphvizEdge edge) { in getEdgeAttributes() argument
181 attrs.put("arrowhead", getArrowString(edge.getArrowHead())); in getEdgeAttributes()
[all …]
|