Home
last modified time | relevance | path

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

12345

/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/wagyu/0.4.3/include/mapbox/geometry/wagyu/
H A Dlocal_minimum_util.hpp27 void start_list_on_local_maximum(edge_list<T>& edges) { in start_list_on_local_maximum() argument
28 if (edges.size() <= 2) { in start_list_on_local_maximum()
32 auto prev_edge = edges.end(); in start_list_on_local_maximum()
35 auto edge = edges.begin(); in start_list_on_local_maximum()
39 while (edge != edges.end()) { in start_list_on_local_maximum()
58 std::rotate(edges.begin(), edge, edges.end()); in start_list_on_local_maximum()
62 bound<T> create_bound_towards_minimum(edge_list<T>& edges) { in create_bound_towards_minimum() argument
63 if (edges.size() == 1) { in create_bound_towards_minimum()
64 if (is_horizontal(edges.front())) { in create_bound_towards_minimum()
65 reverse_horizontal(edges.front()); in create_bound_towards_minimum()
[all …]
H A Dbuild_edges.hpp29 bool build_edge_list(mapbox::geometry::linear_ring<T2> const& path_geometry, edge_list<T1>& edges) { in build_edge_list() argument
66 if (edges.empty()) { in build_edge_list()
83 if (!edges.empty()) { in build_edge_list()
84 edges.pop_back(); // remove previous edge (pt1) in build_edge_list()
86 if (!edges.empty()) { in build_edge_list()
87 auto const& back_top = edges.back().top; in build_edge_list()
90 auto const& back_bot = edges.back().bot; in build_edge_list()
113 if (edges.empty()) { in build_edge_list()
116 edges.emplace_back(pt2, pt3); in build_edge_list()
125 if (edges.empty()) { in build_edge_list()
[all …]
H A Dwagyu.hpp80 if (!lm.left_bound.edges.empty()) { in get_bounds()
82 min = lm.left_bound.edges.front().top; in get_bounds()
83 max = lm.left_bound.edges.back().bot; in get_bounds()
86 min.y = std::min(min.y, lm.left_bound.edges.front().top.y); in get_bounds()
87 max.y = std::max(max.y, lm.left_bound.edges.back().bot.y); in get_bounds()
88 max.x = std::max(max.x, lm.left_bound.edges.back().top.x); in get_bounds()
89 min.x = std::min(min.x, lm.left_bound.edges.back().top.x); in get_bounds()
91 for (auto const& e : lm.left_bound.edges) { in get_bounds()
96 if (!lm.right_bound.edges.empty()) { in get_bounds()
98 min = lm.right_bound.edges.front().top; in get_bounds()
[all …]
H A Dbound.hpp22 edge_list<T> edges; member
37 : edges(), in bound()
38 current_edge(edges.end()), in bound()
39 next_edge(edges.end()), in bound()
53 : edges(std::move(b.edges)), in bound()
H A Dsnap_rounding.hpp108 while (current_edge != current_bound.edges.end() && current_edge->top.y == top_y) { in process_hot_pixel_edges_at_top_of_scanbeam()
117 if (current_edge == current_bound.edges.end()) { in process_hot_pixel_edges_at_top_of_scanbeam()
136 add_to_hot_pixels((*lm)->left_bound.edges.front().bot, manager); in insert_local_minima_into_ABL_hot_pixel()
139 left_bound.current_edge = left_bound.edges.begin(); in insert_local_minima_into_ABL_hot_pixel()
142 right_bound.current_edge = right_bound.edges.begin(); in insert_local_minima_into_ABL_hot_pixel()
176 reserve += lm.left_bound.edges.size() + 2; in build_hot_pixels()
177 reserve += lm.right_bound.edges.size() + 2; in build_hot_pixels()
H A Dprocess_horizontal.hpp66 (*horz_bound)->next_edge != (*horz_bound)->edges.end() && in process_horizontal_left_to_right()
114 if ((*horz_bound)->next_edge != (*horz_bound)->edges.end()) { in process_horizontal_left_to_right()
176 (*horz_bound)->next_edge != (*horz_bound)->edges.end() && in process_horizontal_right_to_left()
219 if ((*horz_bound)->next_edge != (*horz_bound)->edges.end()) { in process_horizontal_right_to_left()
H A Dlocal_minimum.hpp92 for (auto const& e : lm->left_bound.edges) { in output_all_edges()
101 for (auto const& e : lm->right_bound.edges) { in output_all_edges()
H A Dedge.hpp104 edge_list<T> const& edges) { in operator <<() argument
107 for (auto const& e : edges) { in operator <<()
H A Dactive_bound_list.hpp120 return bnd.next_edge == bnd.edges.end() && bnd.current_edge->top.y == y; in is_maxima()
130 return bnd.next_edge != bnd.edges.end() && bnd.current_edge->top.y == y; in is_intermediate()
152 if (current_edge != bnd.edges.end()) { in next_edge_in_bound()
/OK3568_Linux_fs/kernel/drivers/iio/humidity/
H A Ddht11.c87 struct {s64 ts; int value; } edges[DHT11_EDGES_PER_READ]; member
102 dht11->edges[i].ts - dht11->edges[i - 1].ts, in dht11_edges_print()
103 dht11->edges[i - 1].value ? "high" : "low"); in dht11_edges_print()
129 t = dht11->edges[offset + 2 * i + 2].ts - in dht11_decode()
130 dht11->edges[offset + 2 * i + 1].ts; in dht11_decode()
131 if (!dht11->edges[offset + 2 * i + 1].value) { in dht11_decode()
178 dht11->edges[dht11->num_edges].ts = ktime_get_boottime_ns(); in dht11_handle_irq()
179 dht11->edges[dht11->num_edges++].value = in dht11_handle_irq()
/OK3568_Linux_fs/kernel/Documentation/ABI/testing/
H A Dsysfs-bus-iio-timer-stm3237 OC4REF rising or falling edges generate pulses.
39 OC6REF rising or falling edges generate pulses.
41 OC4REF or OC6REF rising edges generate pulses.
43 OC4REF rising or OC6REF falling edges generate
46 OC5REF or OC6REF rising edges generate pulses.
48 OC5REF rising or OC6REF falling edges generate
151 rising edges.
H A Dsysfs-bus-counter117 Rising edges on signal A updates the respective count.
121 If direction is forward, rising edges on quadrature pair
123 is backward, falling edges on quadrature pair signal A
128 If direction is forward, rising edges on quadrature pair
130 is backward, falling edges on quadrature pair signal B
193 both edges:
H A Dsysfs-bus-iio-adc-stm3211 - "both-edges".
/OK3568_Linux_fs/kernel/drivers/net/ieee802154/
H A Dmac802154_hwsim.c75 struct list_head edges; member
120 list_for_each_entry_rcu(e, &current_phy->edges, list) { in hwsim_hw_xmit()
217 if (list_empty(&phy->edges)) { in append_radio_msg()
229 list_for_each_entry_rcu(e, &phy->edges, list) { in append_radio_msg()
451 list_for_each_entry_rcu(e, &phy_v0->edges, list) { in hwsim_new_edge_nl()
465 list_add_rcu(&e->list, &phy_v0->edges); in hwsim_new_edge_nl()
504 list_for_each_entry_rcu(e, &phy_v0->edges, list) { in hwsim_del_edge_nl()
560 list_for_each_entry_rcu(e, &phy_v0->edges, list) { in hwsim_set_edge_lqi()
683 list_for_each_entry_rcu(e, &tmp->edges, list) { in hwsim_edge_unsubscribe_me()
705 list_add_rcu(&e->list, &phy->edges); in hwsim_subscribe_all_others()
[all …]
/OK3568_Linux_fs/kernel/drivers/net/wireless/ath/carl9170/
H A Dphy.c1218 u32 freq, struct ar9170_calctl_edges edges[]) in carl9170_get_max_edge_power() argument
1229 if (edges[i].channel == 0xff) in carl9170_get_max_edge_power()
1231 if (f == edges[i].channel) { in carl9170_get_max_edge_power()
1233 rc = edges[i].power_flags & ~AR9170_CALCTL_EDGE_FLAGS; in carl9170_get_max_edge_power()
1236 if (i > 0 && f < edges[i].channel) { in carl9170_get_max_edge_power()
1237 if (f > edges[i - 1].channel && in carl9170_get_max_edge_power()
1238 edges[i - 1].power_flags & in carl9170_get_max_edge_power()
1241 rc = edges[i - 1].power_flags & in carl9170_get_max_edge_power()
1249 if (f > edges[i - 1].channel && in carl9170_get_max_edge_power()
1250 edges[i - 1].power_flags & AR9170_CALCTL_EDGE_FLAGS) { in carl9170_get_max_edge_power()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dcfg-flags.def1 /* Flags on basic blocks and edges.
21 edges. Source files define DEF_BASIC_BLOCK_FLAG or DEF_EDGE_FLAG
109 edges are fallthru edges. In cfgrtl mode, this flag really means
119 ABNORMAL_CALL edges also have ABNORMAL set.
123 /* Exception edge. Exception handling edges represent possible control
125 EH edges also have ABNORMAL set for the RTL CFG. */
129 to prevent merging away edges to the post-landing-pad basic block.
138 /* A back edge, marked in a depth-first search of the CFG. Back edges
162 SIBCALL edges also have ABNORMAL set.
H A Dprofile.h69 extern gcov_type sum_edge_counts (vec<edge, va_gc> *edges);
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dcfg-flags.def1 /* Flags on basic blocks and edges.
21 edges. Source files define DEF_BASIC_BLOCK_FLAG or DEF_EDGE_FLAG
109 edges are fallthru edges. In cfgrtl mode, this flag really means
119 ABNORMAL_CALL edges also have ABNORMAL set.
123 /* Exception edge. Exception handling edges represent possible control
125 EH edges also have ABNORMAL set for the RTL CFG. */
129 to prevent merging away edges to the post-landing-pad basic block.
138 /* A back edge, marked in a depth-first search of the CFG. Back edges
162 SIBCALL edges also have ABNORMAL set.
H A Dprofile.h69 extern gcov_type sum_edge_counts (vec<edge, va_gc> *edges);
/OK3568_Linux_fs/kernel/lib/
H A Dobjagg.c707 unsigned long *edges; member
722 __set_bit(edge_index, graph->edges); in objagg_tmp_graph_edge_set()
731 return test_bit(edge_index, graph->edges); in objagg_tmp_graph_is_edge()
798 graph->edges = kzalloc(alloc_size, GFP_KERNEL); in objagg_tmp_graph_create()
799 if (!graph->edges) in objagg_tmp_graph_create()
836 kfree(graph->edges); in objagg_tmp_graph_destroy()
/OK3568_Linux_fs/kernel/scripts/
H A Ddev-needs.sh29 -g list the dependencies as edges and nodes for graphviz
30 -t list the dependencies as edges for tsort
/OK3568_Linux_fs/kernel/fs/btrfs/
H A Drelocation.c183 struct btrfs_backref_edge *edges[], int *index) in walk_up_backref() argument
191 edges[idx++] = edge; in walk_up_backref()
203 struct btrfs_backref_edge *edges[], int *index) in walk_down_backref() argument
210 edge = edges[idx - 1]; in walk_down_backref()
218 edges[idx - 1] = edge; in walk_down_backref()
2038 struct btrfs_backref_edge *edges[]) in select_reloc_root() argument
2047 next = walk_up_backref(next, edges, &index); in select_reloc_root()
2075 next = walk_down_backref(edges, &index); in select_reloc_root()
2088 next = edges[index]->node[UPPER]; in select_reloc_root()
2108 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root() local
[all …]
/OK3568_Linux_fs/kernel/Documentation/devicetree/bindings/soc/qcom/
H A Dqcom,smd.txt15 processor of some sort - or in SMD language an "edge". The name of the edges
61 In turn, subnodes of the "edges" represent devices tied to SMD channels on that
/OK3568_Linux_fs/kernel/Documentation/devicetree/bindings/iio/dac/
H A Dad5755.txt27 Channel C and Channel D clock on opposite edges.
29 Channel B and Channel D clock on opposite edges.
/OK3568_Linux_fs/kernel/Documentation/driver-api/
H A Dgeneric-counter.rst107 Rising edges on signal A updates the respective count. The input level
115 If direction is forward, rising edges on quadrature pair signal A
117 edges on quadrature pair signal A updates the respective count.
121 If direction is forward, rising edges on quadrature pair signal B
123 edges on quadrature pair signal B updates the respective count.
145 a counter device which simply accumulates a count of rising edges on a

12345