Home
last modified time | relevance | path

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

12

/linux/drivers/iio/humidity/
H A Ddht11.c86 struct {s64 ts; int value; } edges[DHT11_EDGES_PER_READ]; member
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()
177 dht11->edges[dht11->num_edges].ts = ktime_get_boottime_ns(); in dht11_handle_irq()
178 dht11->edges[dht11->num_edges++].value = in dht11_handle_irq()
/linux/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
143 rising edges.
H A Dsysfs-bus-iio-adc-stm3211 - "both-edges".
H A 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:
/linux/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 …]
/linux/tools/memory-model/
H A 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/lib/
H A 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()
/linux/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
/linux/Documentation/userspace-api/gpio/
H A Dgpio-get-lineevent-ioctl.rst41 value and may receive events when edges are detected on the line, as
73 and falling edges.
H A 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
/linux/fs/btrfs/
H A Drelocation.c192 struct btrfs_backref_edge *edges[], int *index) in walk_up_backref() argument
200 edges[idx++] = edge; in walk_up_backref()
212 struct btrfs_backref_edge *edges[], int *index) in walk_down_backref() argument
219 edge = edges[idx - 1]; in walk_down_backref()
227 edges[idx - 1] = edge; in walk_down_backref()
1954 struct btrfs_backref_edge *edges[]) in select_reloc_root() argument
1961 next = walk_up_backref(node, edges, &index); in select_reloc_root()
2033 next = edges[index]->node[UPPER]; in select_reloc_root()
2053 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root() local
2059 next = walk_up_backref(next, edges, &index); in select_one_root()
[all …]
/linux/Documentation/input/devices/
H A Drotary-encoder.rst12 and by triggering on falling and rising edges, the turn direction can
76 able to fire on both edges.
/linux/Documentation/devicetree/bindings/gpio/
H A Dabilis,tb10x-gpio.txt14 - #interrupt-cells: Should be <1>. Interrupts are triggered on both edges.
/linux/net/core/
H A Dscm.c95 fpl->edges = NULL; in scm_fp_copy()
400 new_fpl->edges = NULL; in scm_fp_dup()
/linux/include/net/
H A Daf_unix.h30 struct list_head edges; member
/linux/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
/linux/Documentation/admin-guide/blockdev/drbd/
H A Ddrbd-connection-state-overview.dot57 // edges
/linux/Documentation/locking/
H A 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.
H A 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/include/sound/
H A Dsoc-dapm.h670 struct list_head edges[2]; member
790 list_for_each_entry(p, &w->edges[dir], list_node[dir])
805 list_for_each_entry_safe(p, next_p, &w->edges[dir], list_node[dir])
/linux/drivers/counter/
H A DKconfig133 It can be used to timestamp events (falling/rising edges) detected
/linux/Documentation/dev-tools/
H A Dgpio-sloppy-logic-analyzer.rst71 sample at least at 800kHz. However, falling edges of both signals in an I2C
/linux/Documentation/trace/rv/
H A Ddeterministic_automata.rst33 vertices (nodes) and edges, which is very intuitive for *operating system*
/linux/sound/soc/
H A Dsoc-dapm.c1048 if (list_empty(&w->edges[dir])) { in dapm_new_mux()
2849 if (!list_empty(&w->edges[dir])) in dapm_update_widget_flags()
2988 list_add(&path->list_node[dir], &path->node[dir]->edges[dir]); in snd_soc_dapm_add_path()
3807 INIT_LIST_HEAD(&w->edges[dir]); in snd_soc_dapm_new_control_unlocked()
4003 if (WARN_ON(list_empty(&w->edges[SND_SOC_DAPM_DIR_OUT]) || in snd_soc_dai_link_event()
4004 list_empty(&w->edges[SND_SOC_DAPM_DIR_IN]))) in snd_soc_dai_link_event()
/linux/Documentation/hwmon/
H A Dadm9240.rst77 edges of the fan tacho inputs.

12