Home
last modified time | relevance | path

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

12

/Linux-v5.15/drivers/iio/humidity/
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()
/Linux-v5.15/Documentation/ABI/testing/
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.
Dsysfs-bus-counter118 Rising edges on signal A updates the respective count.
122 If direction is forward, rising edges on quadrature pair
124 is backward, falling edges on quadrature pair signal A
129 If direction is forward, rising edges on quadrature pair
131 is backward, falling edges on quadrature pair signal B
203 both edges:
Dsysfs-bus-iio-adc-stm3211 - "both-edges".
/Linux-v5.15/drivers/net/ieee802154/
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 …]
/Linux-v5.15/drivers/net/wireless/ath/carl9170/
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 …]
/Linux-v5.15/scripts/
Ddev-needs.sh29 -g list the dependencies as edges and nodes for graphviz
30 -t list the dependencies as edges for tsort
/Linux-v5.15/lib/
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()
/Linux-v5.15/Documentation/devicetree/bindings/soc/qcom/
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
Dqcom,glink.txt5 of edges can be described by the binding; the GLINK RPM edge and a SMEM based
/Linux-v5.15/Documentation/devicetree/bindings/spi/
Dspi-synquacer.txt13 - socionext,set-aces: boolean, if same active clock edges field to be set.
/Linux-v5.15/fs/btrfs/
Drelocation.c184 struct btrfs_backref_edge *edges[], int *index) in walk_up_backref() argument
192 edges[idx++] = edge; in walk_up_backref()
204 struct btrfs_backref_edge *edges[], int *index) in walk_down_backref() argument
211 edge = edges[idx - 1]; in walk_down_backref()
219 edges[idx - 1] = edge; in walk_down_backref()
2108 struct btrfs_backref_edge *edges[]) in select_reloc_root() argument
2118 next = walk_up_backref(next, edges, &index); in select_reloc_root()
2196 next = walk_down_backref(edges, &index); in select_reloc_root()
2215 next = edges[index]->node[UPPER]; in select_reloc_root()
2235 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root() local
[all …]
/Linux-v5.15/Documentation/driver-api/
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
/Linux-v5.15/Documentation/input/devices/
Drotary-encoder.rst12 and by triggering on falling and rising edges, the turn direction can
76 able to fire on both edges.
/Linux-v5.15/Documentation/devicetree/bindings/gpio/
Dabilis,tb10x-gpio.txt14 - #interrupt-cells: Should be <1>. Interrupts are triggered on both edges.
/Linux-v5.15/Documentation/admin-guide/blockdev/drbd/
Ddrbd-connection-state-overview.dot57 // edges
/Linux-v5.15/Documentation/devicetree/bindings/i2c/
Di2c-s3c2410.txt16 - samsung,i2c-sda-delay: Delay (in ns) applied to data line (SDA) edges.
/Linux-v5.15/Documentation/locking/
Dww-mutex-design.rst236 e.g. when adjusting edges in a graph where each node has its own ww_mutex lock,
237 and edges can only be changed when holding the locks of all involved nodes. w/w
241 a graph from a starting point and then iteratively discovering new edges and
242 locking down the nodes those edges connect to.
Dlockdep-design.rst531 With the above combination for simplification, there are 4 types of dependency edges
567 We use -(xN)-> to represent edges that are either -(EN)-> or -(SN)->, the
570 A "path" is a series of conjunct dependency edges in the graph. And we define a
572 in the path, as the path that doesn't have two conjunct edges (dependencies) as
/Linux-v5.15/include/sound/
Dsoc-dapm.h658 struct list_head edges[2]; member
781 list_for_each_entry(p, &w->edges[dir], list_node[dir])
796 list_for_each_entry_safe(p, next_p, &w->edges[dir], list_node[dir])
/Linux-v5.15/scripts/gcc-plugins/
DKconfig30 E = the number of edges
/Linux-v5.15/tools/memory-model/
Dlock.cat85 * Given an LF event r, compute the possible rfe edges for that event
/Linux-v5.15/Documentation/hwmon/
Dadm9240.rst77 edges of the fan tacho inputs.
/Linux-v5.15/Documentation/devicetree/bindings/memory-controllers/
Domap-gpmc.txt37 rising/falling edges on the GPMC_WAIT pins.
/Linux-v5.15/sound/soc/
Dsoc-dapm.c1043 if (list_empty(&w->edges[dir])) { in dapm_new_mux()
2752 if (!list_empty(&w->edges[dir])) in dapm_update_widget_flags()
2893 list_add(&path->list_node[dir], &widgets[dir]->edges[dir]); in snd_soc_dapm_add_path()
3735 INIT_LIST_HEAD(&w->edges[dir]); in snd_soc_dapm_new_control_unlocked()
3929 if (WARN_ON(list_empty(&w->edges[SND_SOC_DAPM_DIR_OUT]) || in snd_soc_dai_link_event()
3930 list_empty(&w->edges[SND_SOC_DAPM_DIR_IN]))) in snd_soc_dai_link_event()

12