/linux-master/drivers/net/wireless/ath/ath9k/ |
H A D | dynack.c | 129 list_for_each_entry(an, &da->nodes, list) 332 list_add_tail(&an->list, &da->nodes); 373 list_for_each_entry(an, &da->nodes, list) 395 INIT_LIST_HEAD(&da->nodes);
|
/linux-master/drivers/net/wireless/broadcom/brcm80211/brcmfmac/ |
H A D | fwsignal.c | 447 struct brcmf_fws_mac_descriptor nodes[BRCMF_FWS_MAC_DESC_TABLE_SIZE]; member in struct:brcmf_fws_macdesc_table 736 entry = &fws->desc.nodes[0]; 737 for (i = 0; i < ARRAY_SIZE(fws->desc.nodes); i++) { 847 /* cleanup individual nodes */ 848 table = &fws->desc.nodes[0]; 849 for (i = 0; i < ARRAY_SIZE(fws->desc.nodes); i++) 997 entry = &fws->desc.nodes[mac_handle & 0x1F]; 1054 entry = &fws->desc.nodes[mac_handle & 0x1F]; 1128 entry = &fws->desc.nodes[data[1] & 0x1F];
|
/linux-master/drivers/platform/surface/ |
H A D | surface_aggregator_registry.c | 407 const struct software_node **nodes; local 412 nodes = (const struct software_node **)acpi_device_get_match_data(&pdev->dev); 413 if (!nodes) 427 status = software_node_register_node_group(nodes); 433 software_node_unregister_node_group(nodes); 442 software_node_unregister_node_group(nodes); 445 platform_set_drvdata(pdev, nodes); 451 const struct software_node **nodes = platform_get_drvdata(pdev); local 455 software_node_unregister_node_group(nodes);
|
/linux-master/drivers/scsi/elx/efct/ |
H A D | efct_xport.h | 121 /* number of allocated nodes */ 125 /* array of pointers to nodes */ 126 struct efc_node **nodes; member in struct:efct_xport
|
/linux-master/drivers/staging/media/ipu3/ |
H A D | ipu3-v4l2.c | 32 imgu_pipe->nodes[IMGU_NODE_IN].vdev_fmt.fmt.pix_mp.width; 34 imgu_pipe->nodes[IMGU_NODE_IN].vdev_fmt.fmt.pix_mp.height; 43 try_fmt->code = imgu_pipe->nodes[i].pad_fmt.code; 79 imgu_pipe->queue_enabled[i] = imgu_pipe->nodes[i].enabled; 87 /* No need to reconfig meta nodes */ 91 &imgu_pipe->nodes[node].vdev_fmt.fmt.pix_mp : NULL; 96 if (imgu_pipe->nodes[IMGU_NODE_VF].enabled) 137 fmt->format = imgu_pipe->nodes[pad].pad_fmt; 166 mf = &imgu_pipe->nodes[pad].pad_fmt; 293 imgu_pipe->nodes[pa [all...] |
H A D | ipu3.c | 121 if (!imgu_pipe->nodes[IMGU_NODE_VF].enabled && 129 meta = &imgu_pipe->nodes[node].vdev_fmt.fmt.meta; 130 mpix = &imgu_pipe->nodes[node].vdev_fmt.fmt.pix_mp; 215 list_for_each_entry(buf, &imgu_pipe->nodes[node].buffers, vid_buf.list) { 250 !imgu_pipe->nodes[IMGU_NODE_VF].enabled) { 255 imgu_pipe->nodes[node].enabled) { 260 if (list_empty(&imgu_pipe->nodes[node].buffers)) 263 ivb = list_first_entry(&imgu_pipe->nodes[node].buffers, 331 &imgu_pipe->nodes[node].buffers, 355 fmt = &imgu->imgu_pipe[pipe].nodes[IMGU_NODE_I [all...] |
H A D | ipu3.h | 20 * master queue, the driver queues a buffer also to all other active nodes. 21 * If user space hasn't provided a buffer to all other video nodes first, 108 struct imgu_video_device nodes[IMGU_NODE_NUM]; member in struct:imgu_media_pipe
|
/linux-master/drivers/staging/rtl8712/ |
H A D | rtl871x_event.h | 88 struct event_node nodes[C2HEVENT_SZ]; member in struct:c2hevent_queue
|
/linux-master/drivers/target/iscsi/ |
H A D | iscsi_target_stat.c | 154 CONFIGFS_ATTR_RO(iscsi_stat_instance_, nodes);
|
/linux-master/drivers/vfio/ |
H A D | vfio_main.c | 986 /* Empty list or no nodes to combine */ 1013 struct interval_tree_node *nodes; local 1038 nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node), 1040 if (!nodes) 1060 nodes[i].start = range.iova; 1061 nodes[i].last = range.iova + range.length - 1; 1062 if (interval_tree_iter_first(&root, nodes[i].start, 1063 nodes[i].last)) { 1068 interval_tree_insert(nodes + i, &root); 1082 kfree(nodes); [all...] |
/linux-master/fs/bcachefs/ |
H A D | btree_node_scan.c | 41 static void found_btree_nodes_to_text(struct printbuf *out, struct bch_fs *c, found_btree_nodes nodes) argument 44 darray_for_each(nodes, i) { 101 * Given two found btree nodes, if their sequence numbers are equal, take the 176 if (darray_push(&f->nodes, n)) 313 prt_str(&buf, "overlapping btree nodes with same seq! halting\n "); 333 if (f->nodes.nr) 342 if (!f->nodes.nr) { 343 bch_err(c, "%s: no btree nodes found", __func__); 350 prt_printf(&buf, "%s: nodes found:\n", __func__); 351 found_btree_nodes_to_text(&buf, c, f->nodes); [all...] |
H A D | btree_node_scan_types.h | 28 found_btree_nodes nodes; member in struct:find_btree_nodes
|
/linux-master/fs/btrfs/ |
H A D | backref.c | 488 eb = path->nodes[level]; 505 eb = path->nodes[0]; 516 eb = path->nodes[0]; 605 * other tree nodes. This happens when qgroups does backref walks when 677 eb = path->nodes[level]; 684 eb = path->nodes[level]; 728 * New backrefs (i.e., for parent nodes) are added to the appropriate 1026 leaf = path->nodes[0]; 1162 leaf = path->nodes[0]; 1293 * If the node at this level is shared, than all nodes belo [all...] |
H A D | block-group.c | 751 leaf = path->nodes[0]; 783 leaf = path->nodes[0]; 1981 leaf = path->nodes[0]; 2501 leaf = path->nodes[0]; 2628 leaf = path->nodes[0]; 3078 leaf = path->nodes[0]; 3494 * allocate new block groups as a result of COWing nodes of the root 4218 * needing it, as we might not need to COW all nodes/leafs from
|
H A D | ctree.c | 217 if (!p->nodes[i]) 220 btrfs_tree_unlock_rw(p->nodes[i], p->locks[i]); 223 free_extent_buffer(p->nodes[i]); 224 p->nodes[i] = NULL; 780 * leaves and nodes. 907 * node level balancing, used to make sure nodes are in proper order for 928 mid = path->nodes[level]; 936 parent = path->nodes[level + 1]; 979 path->nodes[level] = NULL; 1136 path->nodes[leve [all...] |
H A D | ctree.h | 39 * 2) It also triggers readahead for nodes; 41 * will still trigger readahead for other nodes and leaves that follow 52 * level 0 is always the leaf, and nodes[1...BTRFS_MAX_LEVEL] will point 59 struct extent_buffer *nodes[BTRFS_MAX_LEVEL]; member in struct:btrfs_path 69 * and to force calls to keep space in the nodes 229 * Xarray that keeps track of delayed nodes of every inode, protected 617 * it while holding a write lock on a leaf and often on upper level nodes
|
H A D | defrag.c | 504 * leafs from path->nodes[1], so set lowest_level to 1 to avoid later 514 if (!path->nodes[1]) { 525 path->nodes[1], 0, 541 path->slots[1] = btrfs_header_nritems(path->nodes[1]); 617 * will not visit leaves and nodes with a generation smaller than given 658 if (path.slots[0] >= btrfs_header_nritems(path.nodes[0])) { 664 ASSERT(btrfs_header_nritems(path.nodes[0])); 665 path.slots[0] = btrfs_header_nritems(path.nodes[0]) - 1; 667 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]); 675 btrfs_item_key_to_cpu(path.nodes[ [all...] |
H A D | delayed-inode.c | 46 delayed_root->nodes = 0; 189 root->nodes++; 201 root->nodes--; 767 data_ptr = btrfs_item_ptr(path->nodes[0], path->slots[0], char); 768 write_extent_buffer(path->nodes[0], &curr->data, 853 struct extent_buffer *leaf = path->nodes[0]; 1038 leaf = path->nodes[0]; 1068 leaf = path->nodes[0]; 1188 ASSERT(path->nodes[0] == NULL); 2164 * nodes) an [all...] |
H A D | delayed-inode.h | 36 * Used for delayed nodes which is waiting to be dealt with by the 43 int nodes; /* for delayed nodes */ member in struct:btrfs_delayed_root 58 * Used to add the node into the prepare list, the nodes in this list
|
H A D | dev-replace.c | 129 eb = path->nodes[0]; 381 btrfs_item_size(path->nodes[0], path->slots[0]) < sizeof(*ptr)) { 415 eb = path->nodes[0]; 514 struct extent_buffer *leaf = path->nodes[0];
|
H A D | dir-item.c | 45 leaf = path->nodes[0]; 84 leaf = path->nodes[0]; 96 btrfs_mark_buffer_dirty(trans, path->nodes[0]); 147 leaf = path->nodes[0]; 275 leaf = path->nodes[0]; 392 leaf = path->nodes[0]; 428 leaf = path->nodes[0];
|
H A D | disk-io.c | 2158 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { 2168 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 4316 * and then a transaction commit runs the same delayed nodes 4317 * before any delayed worker has done something with the nodes. 4932 l = path->nodes[0];
|
H A D | export.c | 191 leaf = path->nodes[0]; 268 leaf = path->nodes[0];
|
H A D | extent-tree.c | 150 btrfs_item_key_to_cpu(path->nodes[0], &key, 160 leaf = path->nodes[0]; 474 leaf = path->nodes[0]; 485 leaf = path->nodes[0]; 542 leaf = path->nodes[0]; 569 leaf = path->nodes[0]; 603 leaf = path->nodes[0]; 647 leaf = path->nodes[0]; 747 if (!path->nodes[level]) 750 btrfs_header_nritems(path->nodes[leve [all...] |
H A D | extent_io.c | 1608 * btree nodes/leafs whose content on disk is invalid - either garbage 2772 struct extent_buffer *clone = path->nodes[0]; 2778 if (path->slots[0] < btrfs_header_nritems(path->nodes[0])) 2797 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); 2813 clone->start = path->nodes[0]->start; 2815 copy_extent_buffer_full(clone, path->nodes[0]); 2819 path->nodes[0] = clone; 2852 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0] - 1); 2857 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { 2862 btrfs_item_key_to_cpu(path->nodes[ [all...] |