Home
last modified time | relevance | path

Searched full:edges (Results 1 – 25 of 194) sorted by relevance

12345678

/linux-6.12.1/drivers/iio/humidity/
Ddht11.c36 * Note that when reading the sensor actually 84 edges are detected, but
86 struct {s64 ts; int value; } edges[DHT11_EDGES_PER_READ]; member
98 dev_dbg(dht11->dev, "%d edges detected:\n", dht11->num_edges); in dht11_edges_print()
101 dht11->edges[i].ts - dht11->edges[i - 1].ts, in dht11_edges_print()
102 dht11->edges[i - 1].value ? "high" : "low"); in dht11_edges_print()
128 t = dht11->edges[offset + 2 * i + 2].ts - in dht11_decode()
129 dht11->edges[offset + 2 * i + 1].ts; in dht11_decode()
130 if (!dht11->edges[offset + 2 * i + 1].value) { in dht11_decode()
169 * IRQ handler called on GPIO edges
177 dht11->edges[dht11->num_edges].ts = ktime_get_boottime_ns(); in dht11_handle_irq()
[all …]
/linux-6.12.1/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
143 rising edges.
Dsysfs-bus-counter208 Rising edges on signal A updates the respective count.
212 If direction is forward, rising edges on quadrature pair
214 is backward, falling edges on quadrature pair signal A
219 If direction is forward, rising edges on quadrature pair
221 is backward, falling edges on quadrature pair signal B
293 both edges:
Dsysfs-bus-iio-adc-stm3211 - "both-edges".
/linux-6.12.1/net/unix/
Dgarbage.c148 INIT_LIST_HEAD(&vertex->edges); in unix_add_edge()
156 list_add_tail(&edge->vertex_entry, &vertex->edges); in unix_add_edge()
206 edge = fpl->edges + i++; in unix_add_edges()
236 struct unix_edge *edge = fpl->edges + i++; in unix_del_edges()
242 receiver = fpl->edges[0].successor; in unix_del_edges()
286 fpl->edges = kvmalloc_array(fpl->count_unix, sizeof(*fpl->edges), in unix_prepare_fpl()
288 if (!fpl->edges) in unix_prepare_fpl()
303 kvfree(fpl->edges); in unix_destroy_fpl()
313 list_for_each_entry(edge, &vertex->edges, vertex_entry) { in unix_vertex_dead()
329 edge = list_first_entry(&vertex->edges, typeof(*edge), vertex_entry); in unix_vertex_dead()
[all …]
/linux-6.12.1/tools/memory-model/
Dlock.cat94 * Compute the relation containing these possible edges.
98 (* Compute set of sets of possible rfe edges for LF events *)
102 * to a set of single edges
116 * Compute the relation containing these possible edges.
122 (* Compute set of sets of possible rf edges for RU events *)
124 (* Convert the possible-rf-ru relation for e to a set of single edges *)
/linux-6.12.1/drivers/net/ieee802154/
Dmac802154_hwsim.c78 struct list_head edges; member
267 list_for_each_entry_rcu(e, &current_phy->edges, list) { in hwsim_hw_xmit()
380 if (list_empty(&phy->edges)) { in append_radio_msg()
392 list_for_each_entry_rcu(e, &phy->edges, list) { in append_radio_msg()
614 list_for_each_entry_rcu(e, &phy_v0->edges, list) { in hwsim_new_edge_nl()
628 list_add_rcu(&e->list, &phy_v0->edges); in hwsim_new_edge_nl()
631 * edges list has not the changes yet. in hwsim_new_edge_nl()
667 list_for_each_entry_rcu(e, &phy_v0->edges, list) { in hwsim_del_edge_nl()
723 list_for_each_entry_rcu(e, &phy_v0->edges, list) { in hwsim_set_edge_lqi()
847 /* going to all phy edges and remove phy from it */ in hwsim_edge_unsubscribe_me()
[all …]
Dmac802154_hwsim.h13 * @MAC802154_HWSIM_CMD_GET_EDGE: fetch information about existing edges
15 * @MAC802154_HWSIM_CMD_DEL_EDGE: delete edges between radios
41 * @MAC802154_HWSIM_ATTR_EDGE: nested attribute of edges
/linux-6.12.1/drivers/media/rc/img-ir/
Dimg-ir-raw.c8 * signal edges are reported and decoded by generic software decoders.
62 * The raw decoders expect to get a final sample even if there are no edges, in
63 * order to be assured of the final space. If there are no edges for a certain
76 * for double edges. in img_ir_echo_timer()
/linux-6.12.1/Documentation/devicetree/bindings/pinctrl/
Dqcom,lpass-lpi-common.yaml54 1: Higher Slew rate (faster edges)
55 2: Lower Slew rate (slower edges)
/linux-6.12.1/Documentation/driver-api/
Dgeneric-counter.rst77 * Both Edges:
107 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
174 | Data: Position | Both Edges ___
178 | | Both Edges ___
/linux-6.12.1/Documentation/devicetree/bindings/soc/qcom/
Dqcom,smd.yaml18 Using the top-level SMD node is deprecated. Instead, the SMD edges are defined
35 edges are not important.
/linux-6.12.1/Documentation/userspace-api/gpio/
Dgpio-v2-get-line-ioctl.rst36 edges are detected on the line, all of which are described in more detail in
77 and falling edges. Requesting edge detection from a line that does not support
89 the edges returned by gpio-v2-line-event-read.rst. If not
Dgpio-get-lineevent-ioctl.rst41 value and may receive events when edges are detected on the line, as
73 and falling edges.
/linux-6.12.1/drivers/staging/media/atomisp/pci/isp/kernels/cnr/cnr_2/
Dia_css_cnr2_types.h26 * If you see blurred color on vertical edges,
28 * If you see blurred color on horizontal edges,
/linux-6.12.1/drivers/net/wireless/ath/carl9170/
Dphy.c1074 /* check if we hit one of the edges */ in carl9170_interpolate_s32()
1218 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()
[all …]
/linux-6.12.1/Documentation/devicetree/bindings/remoteproc/
Dqcom,smd-edge.yaml14 some sort - or in SMD language an "edge". The name of the edges are not
17 In turn, subnodes of the "edges" represent devices tied to SMD channels on
/linux-6.12.1/tools/gpio/
Dgpio-event-mon.c150 " -r Listen for rising edges\n" in print_usage()
151 " -f Listen for falling edges\n" in print_usage()
237 "falling edges\n"); in main()
/linux-6.12.1/drivers/extcon/
Dextcon-gpio.c96 * away after handling, what we are looking for are falling edges in gpio_extcon_probe()
97 * if the signal is active low, and rising edges if the signal is in gpio_extcon_probe()
/linux-6.12.1/fs/btrfs/
Dbackref.h327 /* List of upper level edges, which link this node to its parents */
329 /* List of lower level edges, which link this node to its children */
375 * Also, build_backref_tree() uses list[UPPER] for pending edges, before
406 /* List of unchecked backref edges during backref cache build */
/linux-6.12.1/include/linux/mfd/
Dstm32-timers.h109 #define TIM_SMCR_SMS_ENCODER_MODE_1 1 /* counts TI1FP1 edges, depending on TI2FP2 level */
110 #define TIM_SMCR_SMS_ENCODER_MODE_2 2 /* counts TI2FP2 edges, depending on TI1FP1 level */
111 #define TIM_SMCR_SMS_ENCODER_MODE_3 3 /* counts on both TI1FP1 and TI2FP2 edges */
/linux-6.12.1/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-6.12.1/Documentation/devicetree/bindings/iio/dac/
Dadi,ad5755.yaml41 Channel C and Channel D clock on opposite edges.
43 Channel B and Channel D clock on opposite edges.
/linux-6.12.1/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.
/linux-6.12.1/lib/
Dobjagg.c710 unsigned long *edges; member
725 __set_bit(edge_index, graph->edges); in objagg_tmp_graph_edge_set()
734 return test_bit(edge_index, graph->edges); in objagg_tmp_graph_is_edge()
798 graph->edges = bitmap_zalloc(nodes_count * nodes_count, GFP_KERNEL); in objagg_tmp_graph_create()
799 if (!graph->edges) in objagg_tmp_graph_create()
836 bitmap_free(graph->edges); in objagg_tmp_graph_destroy()

12345678