Home
last modified time | relevance | path

Searched refs:edges (Results 1 – 25 of 31) 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()
221 edge = fpl->edges + i++; in unix_add_edges()
250 struct unix_edge *edge = fpl->edges + i++; in unix_del_edges()
256 receiver = fpl->edges[0].successor; in unix_del_edges()
299 fpl->edges = kvmalloc_objs(*fpl->edges, fpl->count_unix, in unix_prepare_fpl()
301 if (!fpl->edges) in unix_prepare_fpl()
318 kvfree(fpl->edges); in unix_destroy_fpl()
347 list_for_each_entry(edge, &vertex->edges, vertex_entry) { in unix_vertex_dead()
[all …]
/linux/drivers/iio/humidity/
H A Ddht11.c84 struct {s64 ts; int value; } edges[DHT11_EDGES_PER_READ]; member
99 dht11->edges[i].ts - dht11->edges[i - 1].ts, in dht11_edges_print()
100 str_high_low(dht11->edges[i - 1].value)); in dht11_edges_print()
126 t = dht11->edges[offset + 2 * i + 2].ts - in dht11_decode()
127 dht11->edges[offset + 2 * i + 1].ts; in dht11_decode()
128 if (!dht11->edges[offset + 2 * i + 1].value) { in dht11_decode()
175 dht11->edges[dht11->num_edges].ts = ktime_get_boottime_ns(); in dht11_handle_irq()
176 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".
/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/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
H A Dsysfs.rst118 for "rising" and "falling" edges will follow this
/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/admin-guide/blockdev/drbd/
H A Ddrbd-connection-state-overview.dot57 // edges
/linux/fs/btrfs/
H A Drelocation.c297 struct btrfs_backref_edge *edges[], int *index) in walk_up_backref() argument
305 edges[idx++] = edge; in walk_up_backref()
317 struct btrfs_backref_edge *edges[], int *index) in walk_down_backref() argument
324 edge = edges[idx - 1]; in walk_down_backref()
332 edges[idx - 1] = edge; in walk_down_backref()
2095 struct btrfs_backref_edge *edges[]) in select_reloc_root() argument
2102 next = walk_up_backref(node, edges, &index); in select_reloc_root()
2174 next = edges[index]->node[UPPER]; in select_reloc_root()
2194 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root() local
2200 next = walk_up_backref(next, edges, &index); in select_one_root()
[all …]
/linux/net/core/
H A Dscm.c97 fpl->edges = NULL; in scm_fp_copy()
448 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.
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/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/drivers/gpio/
H A Dgpio-pca953x.c959 DECLARE_BITMAP(edges, MAX_LINE); in pca953x_irq_pending()
1006 bitmap_or(edges, old_stat, cur_stat, gc->ngpio); in pca953x_irq_pending()
1007 bitmap_and(pending, edges, trigger, gc->ngpio); in pca953x_irq_pending()
/linux/Documentation/iio/
H A Dad4030.rst126 requirements, an offset is added between the rising edges of PWM0 and PWM1 to
/linux/Documentation/hwmon/
H A Dadm9240.rst77 edges of the fan tacho inputs.
/linux/sound/soc/
H A Dsoc-dapm.c551 if (!list_empty(&w->edges[dir])) in dapm_update_widget_flags()
696 list_add(&path->list_node[dir], &path->node[dir]->edges[dir]); in dapm_add_path()
1350 if (list_empty(&w->edges[dir])) { in dapm_new_mux()
3902 INIT_LIST_HEAD(&w->edges[dir]);
4097 if (WARN_ON(list_empty(&w->edges[SND_SOC_DAPM_DIR_OUT]) || in dapm_dai_link_event()
4098 list_empty(&w->edges[SND_SOC_DAPM_DIR_IN]))) in dapm_dai_link_event()

12