Searched refs:edges (Results 1 - 9 of 9) sorted by relevance

/linux-master/drivers/iio/humidity/
H A 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 in struct:dht11
98 dev_dbg(dht11->dev, "%d edges detected:\n", dht11->num_edges);
101 dht11->edges[i].ts - dht11->edges[i - 1].ts,
102 dht11->edges[i - 1].value ? "high" : "low");
128 t = dht11->edges[offset + 2 * i + 2].ts -
129 dht11->edges[offset + 2 * i + 1].ts;
130 if (!dht11->edges[offset + 2 * i + 1].value) {
169 * IRQ handler called on GPIO edges
[all...]
/linux-master/drivers/net/ieee802154/
H A Dmac802154_hwsim.c78 struct list_head edges; member in struct:hwsim_phy
267 list_for_each_entry_rcu(e, &current_phy->edges, list) {
380 if (list_empty(&phy->edges)) {
392 list_for_each_entry_rcu(e, &phy->edges, list) {
614 list_for_each_entry_rcu(e, &phy_v0->edges, list) {
628 list_add_rcu(&e->list, &phy_v0->edges);
631 * edges list has not the changes yet.
667 list_for_each_entry_rcu(e, &phy_v0->edges, list) {
723 list_for_each_entry_rcu(e, &phy_v0->edges, list) {
847 /* going to all phy edges an
[all...]
/linux-master/drivers/net/wireless/ath/carl9170/
H A Dphy.c1074 /* check if we hit one of the edges */
1218 u32 freq, struct ar9170_calctl_edges edges[])
1229 if (edges[i].channel == 0xff)
1231 if (f == edges[i].channel) {
1233 rc = edges[i].power_flags & ~AR9170_CALCTL_EDGE_FLAGS;
1236 if (i > 0 && f < edges[i].channel) {
1237 if (f > edges[i - 1].channel &&
1238 edges[i - 1].power_flags &
1241 rc = edges[i - 1].power_flags &
1249 if (f > edges[
1217 carl9170_get_max_edge_power(struct ar9170 *ar, u32 freq, struct ar9170_calctl_edges edges[]) argument
1259 carl9170_get_heavy_clip(struct ar9170 *ar, u32 freq, enum carl9170_bw bw, struct ar9170_calctl_edges edges[]) argument
[all...]
/linux-master/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-master/lib/
H A Dobjagg.c707 unsigned long *edges; member in struct:objagg_tmp_graph
722 __set_bit(edge_index, graph->edges);
731 return test_bit(edge_index, graph->edges);
795 graph->edges = bitmap_zalloc(nodes_count * nodes_count, GFP_KERNEL);
796 if (!graph->edges)
833 bitmap_free(graph->edges);
/linux-master/fs/btrfs/
H A Drelocation.c191 struct btrfs_backref_edge *edges[], int *index)
199 edges[idx++] = edge;
211 struct btrfs_backref_edge *edges[], int *index)
218 edge = edges[idx - 1];
226 edges[idx - 1] = edge;
378 * - Cleanup the children edges and nodes
414 /* Cleanup the lower edges */
516 /* Finish the upper linkage of newly added edges/nodes */
2156 struct btrfs_backref_edge *edges[])
2166 next = walk_up_backref(next, edges,
189 walk_up_backref( struct btrfs_backref_node *node, struct btrfs_backref_edge *edges[], int *index) argument
210 walk_down_backref( struct btrfs_backref_edge *edges[], int *index) argument
2153 select_reloc_root(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_backref_node *node, struct btrfs_backref_edge *edges[]) argument
2283 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; local
2326 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; local
2409 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; local
2608 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; local
[all...]
/linux-master/include/sound/
H A Dsoc-dapm.h669 /* widget input and output edges */
670 struct list_head edges[2]; member in struct:snd_soc_dapm_widget
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-master/sound/soc/
H A Dsoc-dapm.c1049 if (list_empty(&w->edges[dir])) {
2799 if (!list_empty(&w->edges[dir]))
2938 list_add(&path->list_node[dir], &path->node[dir]->edges[dir]);
3757 INIT_LIST_HEAD(&w->edges[dir]);
3961 if (WARN_ON(list_empty(&w->edges[SND_SOC_DAPM_DIR_OUT]) ||
3962 list_empty(&w->edges[SND_SOC_DAPM_DIR_IN])))
/linux-master/sound/soc/intel/avs/
H A Dpcm.c49 dp = list_first_entry_or_null(&dw->edges[dir], typeof(*dp), list_node[dir]);

Completed in 205 milliseconds