Home
last modified time | relevance | path

Searched refs:edges (Results 1 – 25 of 215) sorted by relevance

123456789

/external/dropbear/libtomcrypt/src/pk/asn1/der/set/
Dder_encode_setof.c66 struct edge *edges; in der_encode_setof() local
89 edges = XCALLOC(inlen, sizeof(*edges)); in der_encode_setof()
90 if (edges == NULL) { in der_encode_setof()
112 edges[x].start = ptr; in der_encode_setof()
120 edges[x].size = y; in der_encode_setof()
123 edges[x].size = 0; in der_encode_setof()
125 edges[x].size = (edges[x].size << 8) | ((unsigned long)ptr[z++]); in der_encode_setof()
130 edges[x].size += z; in der_encode_setof()
131 ptr += edges[x].size; in der_encode_setof()
136 XQSORT(edges, inlen, sizeof(*edges), &qsort_helper); in der_encode_setof()
[all …]
/external/chromium_org/tools/gyp/tools/
Dgraphviz.py27 edges = json.load(file)
37 target_edges[src] = edges[src]
38 to_visit.extend(edges[src])
43 def WriteGraph(edges): argument
49 for src, dst in edges.items():
79 for src, dsts in edges.items():
93 edges = LoadEdges('dump.json', sys.argv[1:])
95 WriteGraph(edges)
/external/opencv/cvaux/src/
Dcvdpstereo.cpp108 uchar* edges = (uchar*)cvAlloc(sizeof(uchar)*imgW*imgH); in icvFindStereoCorrespondenceByBirchfieldDP() local
158 edges[y*imgW] = edges[y*imgW+1] = edges[y*imgW+2] = 2; in icvFindStereoCorrespondenceByBirchfieldDP()
159 edges[y*imgW+imgW-1] = edges[y*imgW+imgW-2] = edges[y*imgW+imgW-3] = 1; in icvFindStereoCorrespondenceByBirchfieldDP()
162 edges[y*imgW+j] = 0; in icvFindStereoCorrespondenceByBirchfieldDP()
167 edges[y*imgW+j] |= 1; in icvFindStereoCorrespondenceByBirchfieldDP()
172 edges[y*imgW+j] |= 2; in icvFindStereoCorrespondenceByBirchfieldDP()
194 uchar* _edges = edges + y*imgW + x; in icvFindStereoCorrespondenceByBirchfieldDP()
327 edges[y*imgW+x] |= 4; in icvFindStereoCorrespondenceByBirchfieldDP()
328 edges[(y+1)*imgW+x] |= 4; in icvFindStereoCorrespondenceByBirchfieldDP()
329 edges[(y-1)*imgW+x] |= 4; in icvFindStereoCorrespondenceByBirchfieldDP()
[all …]
Ddecomppoly.cpp328 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 …]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
DGraph.java40 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/chromium_org/third_party/WebKit/Source/devtools/front_end/
DJSHeapSnapshot.js73 createEdge: function(edges, edgeIndex) argument
75 return new WebInspector.JSHeapSnapshotEdge(this, edges, edgeIndex);
125 for (var iter = this.rootNode().edges(); iter.hasNext(); iter.next()) {
131 for (var innerIter = node.edges(); innerIter.hasNext(); innerIter.next()) {
177 for (var iter = node.edges(); iter.hasNext(); iter.next()) {
192 for (var iter = node.edges(); iter.hasNext(); iter.next()) {
218 for (var iter = this.rootNode().edges(); iter.hasNext(); iter.next()) {
231 for (var iter = gcRoots.edges(); iter.hasNext(); iter.next()) {
233 for (var iter2 = subRoot.edges(); iter2.hasNext(); iter2.next())
237 for (var iter = this.rootNode().edges(); iter.hasNext(); iter.next())
[all …]
/external/chromium_org/third_party/WebKit/Source/core/rendering/
DRenderBoxModelObject.cpp1497 static inline bool colorsMatchAtCorner(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[]) in colorsMatchAtCorner() argument
1499 if (edges[side].shouldRender() != edges[adjacentSide].shouldRender()) in colorsMatchAtCorner()
1502 if (!edgesShareColor(edges[side], edges[adjacentSide])) in colorsMatchAtCorner()
1505 return !borderStyleHasUnmatchedColorsAtCorner(edges[side].style, side, adjacentSide); in colorsMatchAtCorner()
1509 …line bool colorNeedsAntiAliasAtCorner(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[]) in colorNeedsAntiAliasAtCorner() argument
1511 if (!edges[side].color.hasAlpha()) in colorNeedsAntiAliasAtCorner()
1514 if (edges[side].shouldRender() != edges[adjacentSide].shouldRender()) in colorNeedsAntiAliasAtCorner()
1517 if (!edgesShareColor(edges[side], edges[adjacentSide])) in colorNeedsAntiAliasAtCorner()
1520 return borderStyleHasUnmatchedColorsAtCorner(edges[side].style, side, adjacentSide); in colorNeedsAntiAliasAtCorner()
1524 static inline bool willBeOverdrawn(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[]) in willBeOverdrawn() argument
[all …]
/external/chromium_org/tools/gyp/pylib/gyp/generator/
Ddump_dependency_json.py62 edges = {}
69 if target in edges:
71 edges[target] = []
74 edges[target].append(dep)
79 json.dump(edges, f)
/external/chromium_org/third_party/freetype/src/autofit/
Dafhints.c88 AF_Edge edges; in af_axis_hints_new_edge() local
108 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) ) in af_axis_hints_new_edge()
114 edges = axis->edges; in af_axis_hints_new_edge()
115 edge = edges + axis->num_edges; in af_axis_hints_new_edge()
117 while ( edge > edges ) in af_axis_hints_new_edge()
259 AF_Edge edges = axis->edges; in af_glyph_hints_dump_segments() local
288 AF_INDEX_NUM( seg->edge, edges ), in af_glyph_hints_dump_segments()
377 AF_Edge edges = axis->edges; in af_glyph_hints_dump_edges() local
378 AF_Edge limit = edges + axis->num_edges; in af_glyph_hints_dump_edges()
395 for ( edge = edges; edge < limit; edge++ ) in af_glyph_hints_dump_edges()
[all …]
Daflatin.c1189 AF_Edge edge = axis->edges + ee; in af_latin_hints_compute_edges()
1260 AF_Edge edges = axis->edges; in af_latin_hints_compute_edges() local
1261 AF_Edge edge_limit = edges + axis->num_edges; in af_latin_hints_compute_edges()
1265 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin_hints_compute_edges()
1278 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin_hints_compute_edges()
1425 AF_Edge edge = axis->edges; in af_latin_hints_compute_blue_edges()
1832 stem_edge-hints->axis[dim].edges, stem_edge->opos / 64.0, in af_latin_align_linked_edge()
1869 AF_Edge edges = axis->edges; in af_latin_hint_edges() local
1870 AF_Edge edge_limit = edges + axis->num_edges; in af_latin_hint_edges()
1889 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin_hint_edges()
[all …]
Daflatin2.c1164 AF_Edge edge = axis->edges + ee; in af_latin2_hints_compute_edges()
1233 AF_Edge edges = axis->edges; in af_latin2_hints_compute_edges() local
1234 AF_Edge edge_limit = edges + axis->num_edges; in af_latin2_hints_compute_edges()
1238 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin2_hints_compute_edges()
1251 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin2_hints_compute_edges()
1393 AF_Edge edge = axis->edges; in af_latin2_hints_compute_blue_edges()
1809 stem_edge-hints->axis[dim].edges, stem_edge->opos / 64.0, in af_latin2_align_linked_edge()
1841 AF_Edge edges = axis->edges; in af_latin2_hint_edges() local
1842 AF_Edge edge_limit = edges + axis->num_edges; in af_latin2_hint_edges()
1858 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin2_hint_edges()
[all …]
Dafcjk.c949 AF_Edge edge = axis->edges + ee; in af_cjk_hints_compute_edges()
1049 AF_Edge edges = axis->edges; in af_cjk_hints_compute_edges() local
1050 AF_Edge edge_limit = edges + axis->num_edges; in af_cjk_hints_compute_edges()
1054 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hints_compute_edges()
1067 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hints_compute_edges()
1180 AF_Edge edge = axis->edges; in af_cjk_hints_compute_blue_edges()
1678 AF_Edge edges = axis->edges; in af_cjk_hint_edges() local
1679 AF_Edge edge_limit = edges + axis->num_edges; in af_cjk_hint_edges()
1695 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hint_edges()
1724 edge1-edges, edge1->fpos, edge1->opos / 64.0, blue->fit / 64.0, in af_cjk_hint_edges()
[all …]
/external/freetype/src/autofit/
Dafhints.c88 AF_Edge edges; in af_axis_hints_new_edge() local
108 if ( FT_RENEW_ARRAY( axis->edges, old_max, new_max ) ) in af_axis_hints_new_edge()
114 edges = axis->edges; in af_axis_hints_new_edge()
115 edge = edges + axis->num_edges; in af_axis_hints_new_edge()
117 while ( edge > edges ) in af_axis_hints_new_edge()
259 AF_Edge edges = axis->edges; in af_glyph_hints_dump_segments() local
288 AF_INDEX_NUM( seg->edge, edges ), in af_glyph_hints_dump_segments()
377 AF_Edge edges = axis->edges; in af_glyph_hints_dump_edges() local
378 AF_Edge limit = edges + axis->num_edges; in af_glyph_hints_dump_edges()
395 for ( edge = edges; edge < limit; edge++ ) in af_glyph_hints_dump_edges()
[all …]
Daflatin.c1189 AF_Edge edge = axis->edges + ee; in af_latin_hints_compute_edges()
1260 AF_Edge edges = axis->edges; in af_latin_hints_compute_edges() local
1261 AF_Edge edge_limit = edges + axis->num_edges; in af_latin_hints_compute_edges()
1265 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin_hints_compute_edges()
1278 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin_hints_compute_edges()
1425 AF_Edge edge = axis->edges; in af_latin_hints_compute_blue_edges()
1832 stem_edge-hints->axis[dim].edges, stem_edge->opos / 64.0, in af_latin_align_linked_edge()
1869 AF_Edge edges = axis->edges; in af_latin_hint_edges() local
1870 AF_Edge edge_limit = edges + axis->num_edges; in af_latin_hint_edges()
1889 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin_hint_edges()
[all …]
Daflatin2.c1164 AF_Edge edge = axis->edges + ee; in af_latin2_hints_compute_edges()
1233 AF_Edge edges = axis->edges; in af_latin2_hints_compute_edges() local
1234 AF_Edge edge_limit = edges + axis->num_edges; in af_latin2_hints_compute_edges()
1238 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin2_hints_compute_edges()
1251 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin2_hints_compute_edges()
1393 AF_Edge edge = axis->edges; in af_latin2_hints_compute_blue_edges()
1809 stem_edge-hints->axis[dim].edges, stem_edge->opos / 64.0, in af_latin2_align_linked_edge()
1841 AF_Edge edges = axis->edges; in af_latin2_hint_edges() local
1842 AF_Edge edge_limit = edges + axis->num_edges; in af_latin2_hint_edges()
1858 for ( edge = edges; edge < edge_limit; edge++ ) in af_latin2_hint_edges()
[all …]
Dafcjk.c949 AF_Edge edge = axis->edges + ee; in af_cjk_hints_compute_edges()
1049 AF_Edge edges = axis->edges; in af_cjk_hints_compute_edges() local
1050 AF_Edge edge_limit = edges + axis->num_edges; in af_cjk_hints_compute_edges()
1054 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hints_compute_edges()
1067 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hints_compute_edges()
1180 AF_Edge edge = axis->edges; in af_cjk_hints_compute_blue_edges()
1678 AF_Edge edges = axis->edges; in af_cjk_hint_edges() local
1679 AF_Edge edge_limit = edges + axis->num_edges; in af_cjk_hint_edges()
1695 for ( edge = edges; edge < edge_limit; edge++ ) in af_cjk_hint_edges()
1724 edge1-edges, edge1->fpos, edge1->opos / 64.0, blue->fit / 64.0, in af_cjk_hint_edges()
[all …]
/external/chromium_org/ash/wm/workspace/
Dmagnetism_matcher.cc25 uint32 edges) { in CanMatchSecondaryEdge() argument
48 return (edges & secondary_as_magnetism_edge) != 0; in CanMatchSecondaryEdge()
125 MagnetismMatcher::MagnetismMatcher(const gfx::Rect& bounds, uint32 edges) in MagnetismMatcher() argument
126 : edges_(edges) { in MagnetismMatcher()
127 if (edges & MAGNETISM_EDGE_TOP) in MagnetismMatcher()
129 if (edges & MAGNETISM_EDGE_LEFT) in MagnetismMatcher()
131 if (edges & MAGNETISM_EDGE_BOTTOM) { in MagnetismMatcher()
135 if (edges & MAGNETISM_EDGE_RIGHT) in MagnetismMatcher()
/external/chromium/chrome/browser/profiles/
Dprofile_dependency_manager.cc89 EdgeMap edges(edges_); in BuildDestructionOrder() local
96 edges.equal_range(node); in BuildDestructionOrder()
102 edges.erase(temp); in BuildDestructionOrder()
105 for (EdgeMap::iterator jt = edges.begin(); jt != edges.end(); ++jt) { in BuildDestructionOrder()
117 if (edges.size()) { in BuildDestructionOrder()
/external/chromium_org/chrome/tools/
Dhistory-viz.py161 edges = {} # Map of urlid->urlid->Edge.
167 edges[src] = edges.get(src, {})
168 edge = edges[src][dst] = edges[src].get(dst, Edge(src, dst))
174 return urls, edges
178 urls, edges = LoadHistory(sys.argv[1])
210 for src, dsts in edges.items():
/external/oprofile/events/ppc64/cell-be/
Dunit_masks17 0x000 Count edges [mandatory]
27 0x000 Count edges [mandatory]
38 0x000 Count edges [mandatory]
44 0x000 Count edges [optional ]
57 0x000 Count edges [mandatory]
63 0x000 Count edges [optional ]
90 0x0000 Count edges [optional ]
105 0x0000 Count edges [optional ]
122 0x0000 Count edges [optional ]
/external/chromium_org/third_party/WebKit/Source/platform/geometry/
DRoundedRect.cpp99 void RoundedRect::Radii::includeLogicalEdges(const RoundedRect::Radii& edges, bool isHorizontal, bo… in includeLogicalEdges() argument
103 m_bottomLeft = edges.bottomLeft(); in includeLogicalEdges()
105 m_topRight = edges.topRight(); in includeLogicalEdges()
106 m_topLeft = edges.topLeft(); in includeLogicalEdges()
111 m_topRight = edges.topRight(); in includeLogicalEdges()
113 m_bottomLeft = edges.bottomLeft(); in includeLogicalEdges()
114 m_bottomRight = edges.bottomRight(); in includeLogicalEdges()
164 void RoundedRect::includeLogicalEdges(const Radii& edges, bool isHorizontal, bool includeLogicalLef… in includeLogicalEdges() argument
166 … m_radii.includeLogicalEdges(edges, isHorizontal, includeLogicalLeftEdge, includeLogicalRightEdge); in includeLogicalEdges()
/external/skia/src/core/
DSkRegion_rects.cpp46 static void SetFromRect(VEdge edges[], const SkIRect& r) {
47 edges[0].fX = r.fLeft;
48 edges[0].fTop = r.fTop;
49 edges[0].fBottom = r.fBottom;
50 edges[0].fWinding = -1;
52 edges[1].fX = r.fRight;
53 edges[1].fTop = r.fTop;
54 edges[1].fBottom = r.fBottom;
55 edges[1].fWinding = 1;
/external/chromium_org/third_party/skia/src/core/
DSkRegion_rects.cpp46 static void SetFromRect(VEdge edges[], const SkIRect& r) {
47 edges[0].fX = r.fLeft;
48 edges[0].fTop = r.fTop;
49 edges[0].fBottom = r.fBottom;
50 edges[0].fWinding = -1;
52 edges[1].fX = r.fRight;
53 edges[1].fTop = r.fTop;
54 edges[1].fBottom = r.fBottom;
55 edges[1].fWinding = 1;
/external/chromium_org/components/browser_context_keyed_service/
Ddependency_graph.cc85 EdgeMap edges(edges_); in BuildConstructionOrder() local
92 edges.equal_range(node); in BuildConstructionOrder()
98 edges.erase(temp); in BuildConstructionOrder()
101 for (EdgeMap::iterator jt = edges.begin(); jt != edges.end(); ++jt) { in BuildConstructionOrder()
113 if (!edges.empty()) { in BuildConstructionOrder()
/external/pixman/pixman/
Dpixman-vmx.c179 edges = vec_perm (tmp4, tmp3, dest ## _mask); \
180 tmp3 = vec_perm ((vector unsigned char)v ## dest, edges, store_mask); \
181 tmp1 = vec_perm (edges, (vector unsigned char)v ## dest, store_mask); \
192 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, in vmx_combine_over_u_no_mask() local
231 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, in vmx_combine_over_u_mask() local
287 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, in vmx_combine_over_reverse_u_no_mask() local
325 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, in vmx_combine_over_reverse_u_mask() local
380 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, in vmx_combine_in_u_no_mask() local
416 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, in vmx_combine_in_u_mask() local
469 vector unsigned char tmp1, tmp2, tmp3, tmp4, edges, in vmx_combine_in_reverse_u_no_mask() local
[all …]

123456789