Home
last modified time | relevance | path

Searched refs:rings (Results 1 – 25 of 134) sorted by relevance

123456

/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/wagyu/0.4.3/include/mapbox/geometry/wagyu/
H A Dprocess_horizontal.hpp20 ring_manager<T>& rings, in process_horizontal_left_to_right() argument
33 auto hp_itr = rings.current_hp_itr; in process_horizontal_left_to_right()
34 while (hp_itr != rings.hot_pixels.end() && in process_horizontal_left_to_right()
50 while (hp_itr != rings.hot_pixels.end() && hp_itr->y == scanline_y && in process_horizontal_left_to_right()
54 add_point_to_ring(*(*horz_bound), *hp_itr, rings); in process_horizontal_left_to_right()
75 rings); in process_horizontal_left_to_right()
83 (*horz_bound)->current_edge->top, rings, active_bounds); in process_horizontal_left_to_right()
95 cliptype, subject_fill_type, clip_fill_type, rings, active_bounds); in process_horizontal_left_to_right()
103 while (hp_itr != rings.hot_pixels.end() && hp_itr->y == scanline_y && in process_horizontal_left_to_right()
105 add_point_to_ring(*(*horz_bound), *hp_itr, rings); in process_horizontal_left_to_right()
[all …]
H A Dring_util.hpp33 ring_manager<T>& rings) { in set_hole_state() argument
54 rings.children.push_back(bnd.ring); in set_hole_state()
62 void update_current_hp_itr(T scanline_y, ring_manager<T>& rings) { in update_current_hp_itr() argument
63 while (rings.current_hp_itr->y > scanline_y) { in update_current_hp_itr()
64 ++rings.current_hp_itr; in update_current_hp_itr()
167 ring_manager<T>& rings, in hot_pixel_set_left_to_right() argument
192 point_ptr<T> new_point = create_new_point(bnd.ring, *itr, op, rings); in hot_pixel_set_left_to_right()
204 ring_manager<T>& rings, in hot_pixel_set_right_to_left() argument
229 point_ptr<T> new_point = create_new_point(bnd.ring, *itr, op, rings); in hot_pixel_set_right_to_left()
237 void sort_hot_pixels(ring_manager<T>& rings) { in sort_hot_pixels() argument
[all …]
H A Dring.hpp164 std::deque<ring<T>> rings; member
177 rings(), in ring_manager()
184 void preallocate_point_memory(ring_manager<T>& rings, std::size_t size) { in preallocate_point_memory() argument
185 rings.storage.reserve(size); in preallocate_point_memory()
186 rings.all_points.reserve(size); in preallocate_point_memory()
191 manager.rings.emplace_back(); in create_new_ring()
192 ring_ptr<T> result = &manager.rings.back(); in create_new_ring()
199 create_new_point(ring_ptr<T> r, mapbox::geometry::point<T> const& pt, ring_manager<T>& rings) { in create_new_point() argument
201 if (rings.storage.size() < rings.storage.capacity()) { in create_new_point()
202 rings.storage.emplace_back(r, pt); in create_new_point()
[all …]
H A Dintersect_util.hpp119 ring_manager<T>& rings, in intersect_bounds() argument
198 add_local_maximum_point(b1, b2, pt, rings, active_bounds); in intersect_bounds()
200 add_point(b1, active_bounds, pt, rings); in intersect_bounds()
201 add_point(b2, active_bounds, pt, rings); in intersect_bounds()
207 add_point(b1, active_bounds, pt, rings); in intersect_bounds()
215 add_point(b2, active_bounds, pt, rings); in intersect_bounds()
249 add_local_minimum_point(b1, b2, active_bounds, pt, rings); in intersect_bounds()
254 add_local_minimum_point(b1, b2, active_bounds, pt, rings); in intersect_bounds()
260 add_local_minimum_point(b1, b2, active_bounds, pt, rings); in intersect_bounds()
266 add_local_minimum_point(b1, b2, active_bounds, pt, rings); in intersect_bounds()
[all …]
H A Dbuild_result.hpp37 ring_vector<T1>const& rings, in build_result_polygons() argument
39 for (auto r : rings) { in build_result_polygons()
66 ring_manager<T1>const& rings, in build_result() argument
68 build_result_polygons(solution, rings.children, reverse_output); in build_result()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/overlay/
H A Daggregate_operations.hpp54 std::set<ring_with_direction> rings; member
63 for (std::set<ring_with_direction>::const_iterator it = rings.begin(); in all_equal()
64 it != rings.end(); ++it) in all_equal()
86 for (std::set<ring_with_direction>::const_iterator it = rings.begin(); in has_only()
87 it != rings.end(); ++it) in has_only()
103 for (std::set<ring_with_direction>::const_iterator it = rings.begin(); in has_only_both()
104 it != rings.end(); ++it) in has_only_both()
117 for (std::set<ring_with_direction>::const_iterator it = rings.begin(); in is_isolated()
118 it != rings.end(); ++it) in is_isolated()
132 for (std::set<ring_with_direction>::const_iterator it = rings.begin(); in has_unique_region_id()
[all …]
H A Dtraversal_intersection_patterns.hpp39 curr.rings.size() == 2 in check_pairs()
42 && next.rings.size() == 2 in check_pairs()
77 && incoming.rings.size() == 1 in intersection_pattern_common_interior1()
87 && outgoing.rings.size() == 1 in intersection_pattern_common_interior1()
134 && incoming.rings.size() == 2 in intersection_pattern_common_interior2()
144 && outgoing.rings.size() == 2 in intersection_pattern_common_interior2()
203 && incoming.rings.size() == 1 in intersection_pattern_common_interior3()
213 && outgoing.rings.size() == 2 in intersection_pattern_common_interior3()
218 && last.rings.size() == 1 in intersection_pattern_common_interior3()
268 && incoming.rings.size() == 2 in intersection_pattern_common_interior4()
[all …]
H A Doverlay.hpp235 ring_container_type rings; in return_if_one_input_is_empty() local
236 assign_parents(geometry1, geometry2, rings, all_of_one_of_them, strategy); in return_if_one_input_is_empty()
237 return add_rings<GeometryOut>(all_of_one_of_them, geometry1, geometry2, rings, out); in return_if_one_input_is_empty()
339 ring_container_type rings; in apply() local
345 turns, rings, in apply()
372 it = boost::begin(rings); in apply()
373 it != boost::end(rings); in apply()
382 assign_parents(geometry1, geometry2, rings, selected_ring_properties, strategy); in apply()
384 return add_rings<GeometryOut>(selected_ring_properties, geometry1, geometry2, rings, out); in apply()
H A Dselect_rings.hpp120 rings = interior_rings(polygon); in apply() local
122 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
140 rings = interior_rings(polygon); in apply() local
142 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
H A Dtraversal_ring_creator.hpp255 Rings& rings, std::size_t& finalized_ring_size, in traverse_with_operation()
287 rings.push_back(ring); in traverse_with_operation()
297 rings, ring, m_turns, start_turn, in traverse_with_operation()
307 void iterate(Rings& rings, std::size_t& finalized_ring_size, in iterate()
331 rings, finalized_ring_size, state); in iterate()
338 rings, finalized_ring_size, state); in iterate()
H A Dbacktrack_check_si.hpp122 Rings& rings, in apply() argument
148 rings.resize(size_at_start); in apply()
172 Rings& rings, typename boost::range_value<Rings>::type& ring, in apply() argument
184 rings.resize(size_at_start); in apply()
H A Dtraverse.hpp72 Turns& turns, Rings& rings, in apply() argument
99 std::size_t finalized_ring_size = boost::size(rings); in apply()
103 trav.iterate(rings, finalized_ring_size, state); in apply()
/OK3568_Linux_fs/kernel/drivers/net/wireless/broadcom/brcm80211/brcmfmac/
H A Dflowring.c142 if (flow->rings[i] == NULL) in brcmf_flowring_create()
160 flow->rings[i] = ring; in brcmf_flowring_create()
172 ring = flow->rings[flowid]; in brcmf_flowring_tid()
192 ring = flow->rings[flowid]; in brcmf_flowring_block()
201 if ((flow->rings[i]) && (i != flowid)) { in brcmf_flowring_block()
202 ring = flow->rings[i]; in brcmf_flowring_block()
212 flow->rings[flowid]->blocked = blocked; in brcmf_flowring_block()
236 ring = flow->rings[flowid]; in brcmf_flowring_delete()
247 flow->rings[flowid] = NULL; in brcmf_flowring_delete()
264 ring = flow->rings[flowid]; in brcmf_flowring_enqueue()
[all …]
/OK3568_Linux_fs/kernel/net/9p/
H A Dtrans_xen.c81 struct xen_9pfs_dataring *rings; member
158 ring = &priv->rings[num]; in p9_xen_request()
303 if (!priv->rings[i].intf) in xen_9pfs_front_free()
305 if (priv->rings[i].irq > 0) in xen_9pfs_front_free()
306 unbind_from_irqhandler(priv->rings[i].irq, priv->dev); in xen_9pfs_front_free()
307 if (priv->rings[i].data.in) { in xen_9pfs_front_free()
309 j < (1 << priv->rings[i].intf->ring_order); in xen_9pfs_front_free()
313 ref = priv->rings[i].intf->ref[j]; in xen_9pfs_front_free()
316 free_pages_exact(priv->rings[i].data.in, in xen_9pfs_front_free()
317 1UL << (priv->rings[i].intf->ring_order + in xen_9pfs_front_free()
[all …]
/OK3568_Linux_fs/kernel/tools/testing/selftests/net/
H A Dpsock_fanout.c221 static int sock_fanout_read(int fds[], char *rings[], const int expect[]) in sock_fanout_read() argument
225 ret[0] = sock_fanout_read_ring(fds[0], rings[0]); in sock_fanout_read()
226 ret[1] = sock_fanout_read_ring(fds[1], rings[1]); in sock_fanout_read()
348 char *rings[2]; in test_datapath() local
367 rings[0] = sock_fanout_open_ring(fds[0]); in test_datapath()
368 rings[1] = sock_fanout_open_ring(fds[1]); in test_datapath()
371 sock_fanout_read(fds, rings, expect0); in test_datapath()
376 ret = sock_fanout_read(fds, rings, expect1); in test_datapath()
381 ret |= sock_fanout_read(fds, rings, expect2); in test_datapath()
383 if (munmap(rings[1], RING_NUM_FRAMES * getpagesize()) || in test_datapath()
[all …]
/OK3568_Linux_fs/kernel/tools/lib/bpf/
H A Dringbuf.c36 struct ring *rings; member
82 tmp = libbpf_reallocarray(rb->rings, rb->ring_cnt + 1, sizeof(*rb->rings)); in ring_buffer__add()
85 rb->rings = tmp; in ring_buffer__add()
92 r = &rb->rings[rb->ring_cnt]; in ring_buffer__add()
155 ringbuf_unmap_ring(rb, &rb->rings[i]); in ring_buffer__free()
160 free(rb->rings); in ring_buffer__free()
263 struct ring *ring = &rb->rings[i]; in ring_buffer__consume()
290 struct ring *ring = &rb->rings[ring_id]; in ring_buffer__poll()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/src/mbgl/tile/
H A Dgeometry_tile_data.cpp39 GeometryCollection fixupPolygons(const GeometryCollection& rings) { in fixupPolygons() argument
44 for (const auto& ring : rings) { in fixupPolygons()
54 std::vector<GeometryCollection> classifyRings(const GeometryCollection& rings) { in classifyRings() argument
57 std::size_t len = rings.size(); in classifyRings()
60 polygons.push_back(rings); in classifyRings()
68 double area = signedArea(rings[i]); in classifyRings()
81 polygon.push_back(rings[i]); in classifyRings()
/OK3568_Linux_fs/kernel/Documentation/mhi/
H A Dmhi.rst58 Transfer rings: Used by the host to schedule work items for a channel. The
59 transfer rings are organized as a circular queue of Transfer Descriptors (TD).
64 Event rings: Used by the device to send completion and state transition messages
70 Command rings: Used by the host to send MHI commands to the device. The command
71 rings are organized as a circular queue of Command Descriptors (CD).
81 Two unidirectional channels with their associated transfer rings form a
87 Transfer rings
91 Transfer Descriptors (TD). TDs are managed through transfer rings, which are
101 Below is the basic usage of transfer rings:
110 buffer information, increments the WP to the next element and rings the
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/
H A Dfor_each.hpp166 rings = interior_rings(poly); in apply() local
169 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
185 rings = interior_rings(poly); in apply() local
188 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
H A Dreverse.hpp61 rings = interior_rings(polygon); in apply() local
64 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/
H A Dcalculate_sum.hpp35 static inline ReturnType sum_interior_rings(Rings const& rings, Strategy const& strategy) in sum_interior_rings() argument
39 it = boost::begin(rings); it != boost::end(rings); ++it) in sum_interior_rings()
H A Dcounting.hpp70 rings = interior_rings(poly); in apply() local
72 it = boost::begin(rings); it != boost::end(rings); ++it) in apply()
/OK3568_Linux_fs/kernel/Documentation/networking/
H A Daf_xdp.rst24 syscall. Associated with each XSK are two rings: the RX ring and the
26 packets on the TX ring. These rings are registered and sized with the
28 to have at least one of these rings for each socket. An RX or TX
37 one of the rings references a frame by referencing its addr. The addr
42 UMEM also has two rings: the FILL ring and the COMPLETION ring. The
50 TX ring. In summary, the RX and FILL rings are used for the RX path
51 and the TX and COMPLETION rings are used for the TX path.
59 corresponding two rings, sets the XDP_SHARED_UMEM flag in the bind
65 process has to create its own socket with associated RX and TX rings,
67 reason that there is only one set of FILL and COMPLETION rings per
[all …]
/OK3568_Linux_fs/kernel/drivers/soc/ti/
H A Dk3-ringacc.c201 struct k3_ring *rings; member
309 !(ringacc->rings[id].flags & K3_RING_FLAG_SHARED)) in k3_ringacc_request_ring()
311 else if (ringacc->rings[id].flags & K3_RING_FLAG_SHARED) in k3_ringacc_request_ring()
323 ringacc->rings[id].proxy_id = proxy_id; in k3_ringacc_request_ring()
332 ringacc->rings[id].use_count++; in k3_ringacc_request_ring()
334 return &ringacc->rings[id]; in k3_ringacc_request_ring()
1157 ringacc->rings = devm_kzalloc(dev, in k3_ringacc_init()
1158 sizeof(*ringacc->rings) * in k3_ringacc_init()
1168 if (!ringacc->rings || !ringacc->rings_inuse || !ringacc->proxy_inuse) in k3_ringacc_init()
1172 ringacc->rings[i].rt = base_rt + in k3_ringacc_init()
[all …]
/OK3568_Linux_fs/kernel/drivers/block/xen-blkback/
H A Dxenbus.c84 if (!blkif->rings || !blkif->rings[0].irq || !blkif->vbd.bdev) in xen_update_blkif_status()
110 ring = &blkif->rings[i]; in xen_update_blkif_status()
124 ring = &blkif->rings[i]; in xen_update_blkif_status()
134 blkif->rings = kcalloc(blkif->nr_rings, sizeof(struct xen_blkif_ring), in xen_blkif_alloc_rings()
136 if (!blkif->rings) in xen_blkif_alloc_rings()
140 struct xen_blkif_ring *ring = &blkif->rings[r]; in xen_blkif_alloc_rings()
274 struct xen_blkif_ring *ring = &blkif->rings[r]; in xen_blkif_disconnect()
338 kfree(blkif->rings); in xen_blkif_disconnect()
339 blkif->rings = NULL; in xen_blkif_disconnect()
389 if (!blkif->rings) \
[all …]

123456