Searched refs:nodes (Results 151 - 175 of 253) sorted by relevance

1234567891011

/linux-master/drivers/net/ethernet/wangxun/txgbe/
H A Dtxgbe_type.h188 struct txgbe_nodes nodes; member in struct:txgbe
/linux-master/drivers/interconnect/qcom/
H A Dbcm-voter.c72 node = bcm->nodes[i];
101 node = bcm->nodes[i];
244 * qcom_icc_bcm_voter_add - queues up the bcm nodes that require updates
271 * through multiple commit requests and bcm nodes are removed only when the
H A Dqcm2290.c100 /* Master nodes */
677 /* Slave nodes */
1199 .nodes = qcm2290_bimc_nodes,
1257 .nodes = qcm2290_cnoc_nodes,
1300 .nodes = qcm2290_snoc_nodes,
1316 .nodes = qcm2290_qup_virt_nodes,
1331 .nodes = qcm2290_mmnrt_virt_nodes,
1348 .nodes = qcm2290_mmrt_virt_nodes,
H A Dsm6115.c1217 .nodes = bimc_nodes,
1288 .nodes = config_noc_nodes,
1333 .nodes = sys_noc_nodes,
1349 .nodes = clk_virt_nodes,
1365 .nodes = mmnrt_virt_nodes,
1381 .nodes = mmrt_virt_nodes,
H A Dqcs404.c987 .nodes = qcs404_bimc_nodes,
1042 .nodes = qcs404_pcnoc_nodes,
1071 .nodes = qcs404_snoc_nodes,
H A Dsdm660.c1512 .nodes = sdm660_a2noc_nodes,
1541 .nodes = sdm660_bimc_nodes,
1597 .nodes = sdm660_cnoc_nodes,
1619 .nodes = sdm660_gnoc_nodes,
1659 .nodes = sdm660_mnoc_nodes,
1698 .nodes = sdm660_snoc_nodes,
H A Dmsm8996.c1817 .nodes = a0noc_nodes,
1840 .nodes = a1noc_nodes,
1862 .nodes = a2noc_nodes,
1891 .nodes = bimc_nodes,
1951 .nodes = cnoc_nodes,
2005 .nodes = mnoc_nodes,
2045 .nodes = pnoc_nodes,
2090 .nodes = snoc_nodes,
/linux-master/fs/btrfs/
H A Dexport.c191 leaf = path->nodes[0];
268 leaf = path->nodes[0];
H A Dscrub.c423 eb = swarn->path->nodes[0];
513 eb = path->nodes[0];
1336 struct btrfs_fs_info *fs_info = path->nodes[0]->fs_info;
1340 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
1380 if (path->nodes[0])
1415 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
1445 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
1450 *size_ret = path->nodes[0]->fs_info->nodesize;
1453 ei = btrfs_item_ptr(path->nodes[0], path->slots[0], struct btrfs_extent_item);
1454 *flags_ret = btrfs_extent_flags(path->nodes[
[all...]
H A Ddelayed-inode.c46 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 Dinode.c178 eb = warn->path.nodes[0];
279 eb = path.nodes[0];
548 leaf = path->nodes[0];
1858 * if path->nodes[0] is NULL or not if it needs to use the path afterwards.
1870 struct extent_buffer *leaf = path->nodes[0];
2028 leaf = path->nodes[0];
2038 leaf = path->nodes[0];
2045 leaf = path->nodes[0];
2126 if (!path->nodes[0])
2940 leaf = path->nodes[
[all...]
/linux-master/lib/
H A Dradix-tree.c60 * Per-cpu pool of preloaded nodes
265 ret = rtp->nodes;
266 rtp->nodes = ret->parent;
296 * Must only free zeroed nodes into the slab. We can be left with
344 node->parent = rtp->nodes;
345 rtp->nodes = node;
592 * Until there is more than one item in the tree, no nodes are
648 * Free any nodes below this node. The tree is presumed to not need
743 * Until there is more than one item in the tree, no nodes are
813 * must manage lifetimes of leaf nodes (e
[all...]
/linux-master/fs/hpfs/
H A Danode.c406 int i, j, nodes; local
428 nodes = btree->n_used_nodes + btree->n_free_nodes;
438 btree->n_free_nodes = nodes - btree->n_used_nodes;
453 nodes = btree->n_used_nodes + btree->n_free_nodes;
472 btree->n_free_nodes = nodes - btree->n_used_nodes;
/linux-master/fs/dlm/
H A Dconfig.c27 * /config/dlm/<cluster>/spaces/<space>/nodes/<node>/nodeid
28 * /config/dlm/<cluster>/spaces/<space>/nodes/<node>/weight
477 config_group_init_type_name(&nds->ns_group, "nodes", &nodes_type);
869 struct dlm_config_node *nodes, *node; local
885 nodes = kcalloc(count, sizeof(struct dlm_config_node), GFP_NOFS);
886 if (!nodes) {
891 node = nodes;
903 *nodes_out = nodes;
/linux-master/drivers/md/bcache/
H A Dsysfs.c618 size_t nodes; member in struct:bset_stats_op
626 op->nodes++;
645 "btree nodes: %zu\n"
652 op.nodes,
715 (c->gc_stats.nodes ?: 1) * btree_bytes(c));
746 sysfs_print(btree_nodes, c->gc_stats.nodes);
/linux-master/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_priv.h361 struct kfd_node *nodes[MAX_KFD_NODES]; member in struct:kfd_dev
1132 return dev->nodes[0];
1135 if (kfd_irq_is_from_node(dev->nodes[i], node_id, vmid))
1136 return dev->nodes[i];
1512 return (node == node->kfd->nodes[0]);
/linux-master/arch/powerpc/lib/
H A Dqspinlock.c26 struct qnode nodes[MAX_NODES]; member in struct:qnodes
275 struct qnode *qnode = &qnodesp->nodes[idx];
554 node = &qnodesp->nodes[idx];
/linux-master/drivers/md/
H A Dmd-bitmap.c502 sb->nodes = cpu_to_le32(bitmap->mddev->bitmap_info.nodes);
606 bitmap->mddev->bitmap_info.nodes = 0;
620 int nodes = 0; local
698 * Setup nodes/clustername only if bitmap version is
702 nodes = le32_to_cpu(sb->nodes);
721 if (!nodes && (events < bitmap->mddev->events)) {
738 if (err == 0 && nodes && (bitmap->cluster_slot < 0)) {
741 err = md_setup_cluster(bitmap->mddev, nodes);
[all...]
H A Dmd.h505 int nodes; /* Maximum number of nodes in the cluster */ member in struct:mddev::__anon467
777 extern int md_setup_cluster(struct mddev *mddev, int nodes);
857 return mddev->cluster_info && mddev->bitmap_info.nodes > 1;
/linux-master/drivers/misc/sgi-gru/
H A Dgrufile.c170 info.nodes = num_online_nodes();
171 info.blades = info.nodes / nodesperblade;
/linux-master/tools/testing/selftests/mm/
H A Drun_vmtests.sh55 ksm tests that do not require >=2 NUMA nodes
57 ksm tests that require >=2 NUMA nodes
380 # KSM test with 2 NUMA nodes and merge_across_nodes = 1
382 # KSM test with 2 NUMA nodes and merge_across_nodes = 0
/linux-master/arch/x86/include/asm/uv/
H A Duv_mmrs.h2931 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_0_u::uvh_node_present_0_s
2936 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_0_u::uvyh_node_present_0_s
2941 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_0_u::uv5h_node_present_0_s
2963 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_1_u::uvh_node_present_1_s
2968 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_1_u::uvyh_node_present_1_s
2973 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_1_u::uv5h_node_present_1_s
3003 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_table_u::uvh_node_present_table_s
3008 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_table_u::uvxh_node_present_table_s
3013 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_table_u::uv4h_node_present_table_s
3018 unsigned long nodes member in struct:uvh_node_present_table_u::uv3h_node_present_table_s
3023 unsigned long nodes:64; /* RW */ member in struct:uvh_node_present_table_u::uv2h_node_present_table_s
[all...]
/linux-master/scripts/
H A Ddev-needs.sh29 -g list the dependencies as edges and nodes for graphviz
/linux-master/sound/pci/hda/
H A Dhda_proc.c779 int i, nodes; local
795 nodes = snd_hda_get_sub_nodes(codec, fg, &nid);
796 if (! nid || nodes < 0) {
806 for (i = 0; i < nodes; i++, nid++) {
/linux-master/include/linux/
H A Dradix-tree.h31 /* nodes->parent points to next preallocated node */
32 struct radix_tree_node *nodes; member in struct:radix_tree_preload
156 * delete nodes running concurrently with it may affect its result such that

Completed in 533 milliseconds

1234567891011