Home
last modified time | relevance | path

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

12

/linux/net/unix/
H A Dgarbage.c78 struct list_head edges; member
163 INIT_LIST_HEAD(&vertex->edges); in unix_add_edge()
171 list_add_tail(&edge->vertex_entry, &vertex->edges); in unix_add_edge()
220 edge = fpl->edges + i++; in unix_add_edges()
249 struct unix_edge *edge = fpl->edges + i++; in unix_del_edges()
255 receiver = fpl->edges[0].successor; in unix_del_edges()
298 fpl->edges = kvmalloc_objs(*fpl->edges, fpl->count_unix, in unix_prepare_fpl()
300 if (!fpl->edges) in unix_prepare_fpl()
317 kvfree(fpl->edges); in unix_destroy_fpl()
346 list_for_each_entry(edge, &vertex->edges, vertex_entry) { in unix_vertex_dead()
[all …]
/linux/drivers/iio/humidity/
H A Ddht11.c85 struct {s64 ts; int value; } edges[DHT11_EDGES_PER_READ]; member
100 dht11->edges[i].ts - dht11->edges[i - 1].ts, in dht11_edges_print()
101 str_high_low(dht11->edges[i - 1].value)); in dht11_edges_print()
127 t = dht11->edges[offset + 2 * i + 2].ts - in dht11_decode()
128 dht11->edges[offset + 2 * i + 1].ts; in dht11_decode()
129 if (!dht11->edges[offset + 2 * i + 1].value) { in dht11_decode()
176 dht11->edges[dht11->num_edges].ts = ktime_get_boottime_ns(); in dht11_handle_irq()
177 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-counter216 Rising edges on signal A updates the respective count.
220 If direction is forward, rising edges on quadrature pair
222 is backward, falling edges on quadrature pair signal A
227 If direction is forward, rising edges on quadrature pair
229 is backward, falling edges on quadrature pair signal B
301 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/drivers/net/ieee802154/
H A 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()
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()
849 list_for_each_entry_rcu(e, &tmp->edges, list) { in hwsim_edge_unsubscribe_me()
871 list_add_rcu(&e->list, &phy->edges); in hwsim_subscribe_all_others()
[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/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/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/arch/arm64/boot/dts/st/
H A Dstm32mp25-pinctrl.dtsi41 st,io-sync = "data on both edges";
57 st,io-sync = "data on both edges";
147 st,io-sync = "data on both edges";
170 st,io-sync = "data on both edges";
/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/include/net/
H A Dscm.h38 struct unix_edge *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/fs/btrfs/
H A Drelocation.c204 struct btrfs_backref_edge *edges[], int *index) in walk_up_backref() argument
212 edges[idx++] = edge; in walk_up_backref()
224 struct btrfs_backref_edge *edges[], int *index) in walk_down_backref() argument
231 edge = edges[idx - 1]; in walk_down_backref()
239 edges[idx - 1] = edge; in walk_down_backref()
1967 struct btrfs_backref_edge *edges[]) in select_reloc_root() argument
1974 next = walk_up_backref(node, edges, &index); in select_reloc_root()
2046 next = edges[index]->node[UPPER]; in select_reloc_root()
2066 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root() local
2072 next = walk_up_backref(next, edges, &index); in select_one_root()
[all …]
/linux/Documentation/admin-guide/blockdev/drbd/
H A Ddrbd-connection-state-overview.dot57 // edges
/linux/net/core/
H A Dscm.c97 fpl->edges = NULL; in scm_fp_copy()
420 new_fpl->edges = NULL; in scm_fp_dup()
/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.
/linux/include/sound/
H A Dsoc-dapm.h558 /* widget input and output edges */ member
559 struct list_head edges[2];
718 list_for_each_entry(p, &w->edges[dir], list_node[dir])
733 list_for_each_entry_safe(p, next_p, &w->edges[dir], list_node[dir])
/linux/drivers/gpio/
H A Dgpio-pca953x.c953 DECLARE_BITMAP(edges, MAX_LINE); in pca953x_irq_pending()
1000 bitmap_or(edges, old_stat, cur_stat, gc->ngpio); in pca953x_irq_pending()
1001 bitmap_and(pending, edges, trigger, gc->ngpio); in pca953x_irq_pending()
/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/drivers/counter/
H A DKconfig133 It can be used to timestamp events (falling/rising edges) detected
/linux/Documentation/trace/rv/
H A Ddeterministic_automata.rst33 vertices (nodes) and edges, which is very intuitive for *operating system*

12