Searched refs:nodes (Results 126 - 150 of 256) sorted by last modified time

1234567891011

/linux-master/fs/btrfs/
H A Dctree.h39 * 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
/linux-master/drivers/net/ethernet/hisilicon/hns3/hns3pf/
H A Dhclge_tm.c1725 struct hclge_tm_nodes_cmd *nodes; local
1743 nodes = (struct hclge_tm_nodes_cmd *)desc.data;
1744 *qset_num = le16_to_cpu(nodes->qset_num);
1750 struct hclge_tm_nodes_cmd *nodes; local
1767 nodes = (struct hclge_tm_nodes_cmd *)desc.data;
1768 *pri_num = nodes->pri_num;
/linux-master/drivers/md/bcache/
H A Dbcache.h63 * contain metadata (including btree nodes).
111 * free smaller than a bucket - so, that's how big our btree nodes are.
116 * bucket's gen for deleting btree nodes when we rewrite/split a node.)
118 * Anyways, btree nodes are big - big enough to be inefficient with a textbook
121 * The way this is solved is that btree nodes are internally log structured; we
150 * wrapping around. It also merges adjacent btree nodes if they're empty enough.
164 * nodes in the btree, and those writes will be mostly empty (appending at most
173 * For simplicity, we only journal updates to leaf nodes; updates to parent
174 * nodes are rare enough (since our leaf nodes ar
484 size_t nodes; member in struct:gc_stat
[all...]
/linux-master/arch/x86/kernel/apic/
H A Dapic_numachip.c147 u32 nodes = 1; local
151 /* Account for nodes per socket in multi-core-module processors */
154 nodes = ((val >> 3) & 7) + 1;
157 c->topo.pkg_id = node / nodes;
/linux-master/Documentation/sphinx/
H A Dkerneldoc.py37 from docutils import nodes, statemachine namespace
125 return [nodes.error(None, nodes.paragraph(text = "kernel-doc missing"))]
145 node = nodes.section()
153 return [nodes.error(None, nodes.paragraph(text = "kernel-doc missing"))]
H A Dtranslations.py11 from docutils import nodes namespace
31 class LanguagesNode(nodes.Element):
64 pxref += nodes.Text(lang_name)
77 # Iterate over the child nodes; any resolved links will have
78 # the type 'nodes.reference', while unresolved links will be
79 # type 'nodes.Text'.
81 isinstance(xref, nodes.reference), node.children))
89 node.replace_self(nodes.raw('', html_content, format='html'))
H A Dkernel_feat.py40 from docutils import nodes, statemachine namespace
117 node = nodes.section()
/linux-master/drivers/interconnect/qcom/
H A Dsm8650.c1165 .nodes = { &ebi },
1171 .nodes = { &qxm_crypto },
1179 .nodes = { &qsm_cfg, &qhs_ahb2phy0,
1215 .nodes = { &qnm_nsp, &qns_nsp_gemnoc },
1221 .nodes = { &qnm_lpass_lpinoc, &qns_lpass_aggnoc },
1228 .nodes = { &ebi },
1234 .nodes = { &qns_mem_noc_hf },
1241 .nodes = { &qnm_camnoc_hf, &qnm_camnoc_icp,
1252 .nodes = { &qup0_core_slave },
1260 .nodes
[all...]
H A Dsc8180x.c1350 .nodes = { &slv_ebi }
1357 .nodes = { &slv_ebi }
1364 .nodes = { &slv_qns_llcc }
1370 .nodes = { &slv_qns_mem_noc_hf }
1377 .nodes = { &slv_qns_cdsp_mem_noc }
1383 .nodes = { &mas_qxm_crypto }
1390 .nodes = { &mas_qnm_snoc,
1452 .nodes = { &mas_qxm_camnoc_hf0_uncomp,
1464 .nodes = { &mas_qup_core_0,
1472 .nodes
[all...]
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 Dqcs404.c987 .nodes = qcs404_bimc_nodes,
1042 .nodes = qcs404_pcnoc_nodes,
1071 .nodes = qcs404_snoc_nodes,
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 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,
H A Dosm-l3.c49 * struct qcom_osm_l3_node - Qualcomm specific interconnect nodes
51 * @links: an array of nodes where we can go next while traversing
65 const struct qcom_osm_l3_node * const *nodes; member in struct:qcom_osm_l3_desc
103 .nodes = osm_l3_nodes,
111 .nodes = epss_l3_nodes,
119 .nodes = epss_l3_nodes,
228 qnodes = desc->nodes;
231 data = devm_kzalloc(&pdev->dev, struct_size(data, nodes, num_nodes), GFP_KERNEL);
262 data->nodes[i] = node;
H A Dmsm8974.c202 * struct msm8974_icc_node - Qualcomm specific interconnect nodes
205 * @links: an array of nodes where we can go next while traversing
224 struct msm8974_icc_node * const *nodes; member in struct:msm8974_icc_desc
259 .nodes = msm8974_bimc_nodes,
342 .nodes = msm8974_cnoc_nodes,
395 .nodes = msm8974_mnoc_nodes,
430 .nodes = msm8974_onoc_nodes,
493 .nodes = msm8974_pnoc_nodes,
550 .nodes = msm8974_snoc_nodes,
563 * Setting the bandwidth requests for some nodes fail
[all...]
H A Dmsm8939.c1284 .nodes = msm8939_snoc_nodes,
1305 .nodes = msm8939_snoc_mm_nodes,
1334 .nodes = msm8939_bimc_nodes,
1406 .nodes = msm8939_pcnoc_nodes,
H A Dicc-rpm.c321 * qcom_icc_bus_aggregate - calculate bus clock rates by traversing all nodes
333 * Iterate nodes on the provider, aggregate bandwidth requests for
336 list_for_each_entry(node, &provider->nodes, node_list) {
469 qnodes = desc->nodes;
502 data = devm_kzalloc(dev, struct_size(data, nodes, num_nodes),
598 data->nodes[i] = node;
H A Dmsm8916.c1231 .nodes = msm8916_snoc_nodes,
1260 .nodes = msm8916_bimc_nodes,
1330 .nodes = msm8916_pcnoc_nodes,
H A Dicc-rpm.h93 * struct qcom_icc_node - Qualcomm specific interconnect nodes
96 * @links: an array of nodes where we can go next while traversing
129 struct qcom_icc_node * const *nodes; member in struct:qcom_icc_desc
/linux-master/tools/perf/util/
H A Dheader.c702 struct numa_topology_node *n = &tp->nodes[i];
957 struct hybrid_topology_node *n = &tp->nodes[i];
1411 struct memory_node *nodes = NULL; local
1437 reallocarray(nodes, cnt + 4, sizeof(*nodes));
1440 pr_err("Failed to write MEM_TOPOLOGY, size %zd nodes\n", size);
1444 nodes = new_nodes;
1447 ret = memory_node__read(&nodes[cnt], idx);
1455 *nodesp = nodes;
1456 qsort(nodes, cn
1481 struct memory_node *nodes = NULL; local
2255 struct memory_node *nodes; local
2720 struct numa_node *nodes, *n; local
2986 struct memory_node *nodes; local
3081 struct hybrid_node *nodes, *n; local
[all...]
H A Dcputopo.c406 tp = zalloc(sizeof(*tp) + sizeof(tp->nodes[0])*nr);
413 if (load_numa_node(&tp->nodes[i], perf_cpu_map__cpu(node_map, i).cpu)) {
432 zfree(&tp->nodes[i].cpus);
480 tp = zalloc(sizeof(*tp) + sizeof(tp->nodes[0]) * nr);
486 if (load_hybrid_node(&tp->nodes[i], pmu)) {
501 zfree(&tp->nodes[i].pmu_name);
502 zfree(&tp->nodes[i].cpus);
/linux-master/drivers/dma/
H A Duniphier-xdmac.c83 struct uniphier_xdmac_desc_node nodes[] __counted_by(nr_node);
140 src_addr = xd->nodes[xd->cur_node].src;
141 dst_addr = xd->nodes[xd->cur_node].dst;
142 its = xd->nodes[xd->cur_node].burst_size;
143 tnum = xd->nodes[xd->cur_node].nr_burst;
295 xd = kzalloc(struct_size(xd, nodes, nr), GFP_NOWAIT);
302 xd->nodes[i].src = src;
303 xd->nodes[i].dst = dst;
304 xd->nodes[i].burst_size = burst_size;
305 xd->nodes[
[all...]
/linux-master/fs/ubifs/
H A Dreplay.c41 * sorts the replay list in nodes sequence number order, and then inserts all
584 * with the authentication nodes on this LEB. Authentication nodes are written
588 * because a powercut happened when some nodes were written but not the
589 * corresponding authentication node. This function returns the number of nodes
605 list_for_each_entry(snod, &sleb->nodes, list) {
637 * A powercut can happen when some nodes were written, but not yet
643 dbg_mnt("%d unauthenticated nodes found on LEB %d, Ignoring them",
647 dbg_mnt("%d unauthenticated nodes found on non-last LEB %d",
663 * This function replays bud @bud, recovers it if needed, and adds all nodes
[all...]
H A Dauth.c55 * @inhash: input hash of previous nodes
210 snod = list_first_entry(&sleb->nodes, struct ubifs_scan_node, list);
/linux-master/drivers/interconnect/imx/
H A Dimx8mp.c185 static struct imx_icc_node_desc nodes[] = { variable in typeref:struct:imx_icc_node_desc
239 return imx_icc_register(pdev, nodes, ARRAY_SIZE(nodes), noc_setting_nodes);

Completed in 251 milliseconds

1234567891011