Searched refs:nodes (Results 101 - 125 of 253) sorted by relevance

1234567891011

/linux-master/include/linux/
H A Dmemory-tiers.h32 nodemask_t nodes; member in struct:memory_dev_type
H A Dmmzone.h1258 * total * PAGE_SIZE * #nodes = /proc/meminfo/HardwareCorrupted.
1284 * node_zonelists contains references to all zones in all nodes.
1576 * for_each_online_pgdat - helper macro to iterate over all online nodes
1620 nodemask_t *nodes);
1626 * @nodes: An optional nodemask to filter the zonelist with
1639 nodemask_t *nodes)
1641 if (likely(!nodes && zonelist_zone_idx(z) <= highest_zoneidx))
1643 return __next_zones_zonelist(z, highest_zoneidx, nodes);
1650 * @nodes: An optional nodemask to filter the zonelist with
1665 nodemask_t *nodes)
1637 next_zones_zonelist(struct zoneref *z, enum zone_type highest_zoneidx, nodemask_t *nodes) argument
1663 first_zones_zonelist(struct zonelist *zonelist, enum zone_type highest_zoneidx, nodemask_t *nodes) argument
1708 movable_only_nodes(nodemask_t *nodes) argument
[all...]
/linux-master/fs/ubifs/
H A Dscan.c13 * determining what nodes are in an eraseblock. The scan is used to replay the
138 INIT_LIST_HEAD(&sleb->nodes);
150 * Note, we ignore integrity errors (EBASMSG) because all the nodes are
205 * nodes.
213 list_add_tail(&snod->list, &sleb->nodes);
359 head = &sleb->nodes;
H A Dgc.c14 * nodes) or not. For non-index LEBs, garbage collection finds a LEB which
15 * contains a lot of dirty space (obsolete nodes), and copies the non-obsolete
16 * nodes to the journal, at which point the garbage-collected LEB is free to be
17 * reused. For index LEBs, garbage collection marks the non-obsolete index nodes
19 * to be reused. Garbage collection will cause the number of dirty index nodes
33 * the UBIFS nodes GC deals with. Large nodes make GC waste more space. Indeed,
34 * if GC move data from LEB A to LEB B and nodes in LEB A are large, GC would
35 * have to waste large pieces of free space at the end of LEB B, because nodes
36 * from LEB A would not fit. And the worst situation is when all nodes ar
[all...]
/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);
/linux-master/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_device.c606 knode = kfd->nodes[i];
613 kfd->nodes[i] = NULL;
674 "KFD num nodes cannot be 0, num_xcc_in_node: %d\n",
783 dev_info(kfd_device, "Total number of KFD nodes to be created: %d\n",
786 /* Allocate the KFD nodes */
850 kfd->nodes[i] = node;
885 /* Cleanup KFD nodes */
906 node = kfd->nodes[i];
914 kfd_signal_reset_event(kfd->nodes[i]);
935 ret = kfd_resume(kfd->nodes[
[all...]
/linux-master/tools/perf/bench/
H A Dnuma.c209 "bind the first N tasks to these specific memory nodes (the rest is unbound)",
225 * To get number of numa nodes present.
743 printf("\nTest not applicable, system has only %d nodes.\n", g->p.nr_nodes);
917 * Count the number of nodes a process's threads
927 int nodes; local
932 for (nodes = 0; nodes < g->p.nr_nodes; nodes++)
933 node_present[nodes] = 0;
952 nodes
1002 unsigned int nodes = count_process_nodes(p); local
1026 int *nodes; local
[all...]
/linux-master/fs/btrfs/
H A Dqgroup.c432 l = path->nodes[0];
531 l = path->nodes[0];
668 btrfs_mark_buffer_dirty(trans, path->nodes[0]);
737 leaf = path->nodes[0];
756 leaf = path->nodes[0];
845 l = path->nodes[0];
891 l = path->nodes[0];
933 l = path->nodes[0];
973 leaf = path->nodes[0];
1107 leaf = path->nodes[
[all...]
H A Dextent-tree.c152 btrfs_item_key_to_cpu(path->nodes[0], &key,
162 leaf = path->nodes[0];
478 leaf = path->nodes[0];
488 leaf = path->nodes[0];
545 leaf = path->nodes[0];
572 leaf = path->nodes[0];
607 leaf = path->nodes[0];
651 leaf = path->nodes[0];
751 if (!path->nodes[level])
754 btrfs_header_nritems(path->nodes[leve
[all...]
H A Dref-verify.c440 struct extent_buffer *leaf = path->nodes[0];
508 struct extent_buffer *leaf = path->nodes[0];
567 eb = btrfs_read_node_slot(path->nodes[level],
572 path->nodes[level-1] = eb;
592 if (!path->nodes[l])
597 btrfs_header_nritems(path->nodes[l])) {
602 btrfs_tree_unlock_rw(path->nodes[l], path->locks[l]);
603 free_extent_buffer(path->nodes[l]);
604 path->nodes[l] = NULL;
1002 path->nodes[leve
[all...]
H A Dreflink.c199 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
206 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
219 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
226 if (btrfs_file_extent_type(path->nodes[0], ei) ==
279 write_extent_buffer(path->nodes[0], inline_data,
280 btrfs_item_ptr_offset(path->nodes[0],
392 btrfs_item_key_to_cpu(path->nodes[0], &key,
398 nritems = btrfs_header_nritems(path->nodes[0]);
406 nritems = btrfs_header_nritems(path->nodes[0]);
408 leaf = path->nodes[
[all...]
H A Drelocation.c157 /* size of relocated tree nodes */
187 * walk up backref nodes until reach node presents tree root
208 * walk down backref nodes to find start of next reference path
263 * detached nodes are used to avoid unnecessary backref
265 * so the detached nodes are no longer useful.
282 * some nodes can be left in the pending list if there were
283 * errors during processing the pending nodes.
376 * For useless nodes, do two major clean ups:
378 * - Cleanup the children edges and nodes
382 * - Freeing up leaves (level 0), keeps nodes detache
[all...]
/linux-master/mm/
H A Dworkingset.c611 * create excessive amounts of shadow nodes. To keep a lid on this,
612 * track shadow nodes and reclaim them when they grow way past the
623 * Track non-empty nodes that contain only shadow entries;
626 * Avoid acquiring the list_lru lock when the nodes are
650 unsigned long nodes; local
653 nodes = list_lru_shrink_count(&shadow_nodes, sc);
654 if (!nodes)
658 * Approximate a reasonable limit for the nodes
699 if (nodes <= max_nodes)
701 return nodes
[all...]
/linux-master/drivers/interconnect/qcom/
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...]
/linux-master/fs/btrfs/tests/
H A Dfree-space-tree-tests.c41 flags = btrfs_free_space_flags(path->nodes[0], info);
42 extent_count = btrfs_free_space_extent_count(path->nodes[0], info);
54 while (++path->slots[0] < btrfs_header_nritems(path->nodes[0])) {
55 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
84 if (btrfs_header_nritems(path->nodes[0]) != num_extents + 1 ||
89 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
124 flags = btrfs_free_space_flags(path->nodes[0], info);
/linux-master/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_psp.c1365 if (mirror_top_info->nodes[j].node_id != src_node_id)
1368 mirror_top_info->nodes[j].num_hops = dst_num_hops;
1375 mirror_top_info->nodes[j].num_links = dst_num_links;
1410 topology_info_input->nodes[i].node_id = topology->nodes[i].node_id;
1411 topology_info_input->nodes[i].num_hops = topology->nodes[i].num_hops;
1412 topology_info_input->nodes[i].is_sharing_enabled = topology->nodes[i].is_sharing_enabled;
1413 topology_info_input->nodes[
[all...]
/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...]
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/en/
H A Dptp.c32 struct mlx5e_ptp_port_ts_cqe_tracker *nodes; member in struct:mlx5e_ptp_port_ts_cqe_list
41 struct mlx5e_ptp_port_ts_cqe_tracker *tracker = &list->nodes[metadata];
53 struct mlx5e_ptp_port_ts_cqe_tracker *tracker = &list->nodes[metadata];
191 if (likely(pending_cqe_list->nodes[metadata_id].inuse)) {
389 cqe_list->nodes = kvzalloc_node(array_size(db_sz, sizeof(*cqe_list->nodes)),
391 if (!cqe_list->nodes)
404 cqe_list->nodes[md].metadata_id = md;
421 kvfree(cqe_list->nodes);
443 kvfree(ptpsq->ts_cqe_pending_list->nodes);
[all...]
/linux-master/drivers/interconnect/
H A Dcore.c55 list_for_each_entry(n, &provider->nodes, node_list) {
117 /* draw nodes */
118 list_for_each_entry(n, &provider->nodes, node_list)
122 list_for_each_entry(n, &provider->nodes, node_list)
133 list_for_each_entry(n, &provider->nodes, node_list)
157 list_for_each_entry(n, &provider->nodes, node_list) {
346 * multiple interconnect nodes. A single cell is used as an index into
347 * an array of icc nodes specified in the icc_onecell_data struct when
361 return icc_data->nodes[idx];
888 * icc_link_create() - create a link between two nodes
[all...]
/linux-master/include/trace/events/
H A Dbcache.h298 TP_PROTO(unsigned nodes),
299 TP_ARGS(nodes),
302 __field(unsigned, nodes )
306 __entry->nodes = nodes;
309 TP_printk("coalesced %u nodes", __entry->nodes)
/linux-master/drivers/md/bcache/
H A Dbtree.c17 * Indexing is done via a btree; nodes are not necessarily fully sorted, rather
367 * flush, and writes appending to leaf nodes aren't blocking anything so
689 * It's _really_ critical that we don't free too many btree nodes - we
909 * We can only have one thread cannibalizing other cached btree nodes at a time,
937 * the list. Check if there's any freed nodes there:
1236 * ptr_invalid() can't return true for the keys that mark btree nodes as
1315 gc->nodes++;
1364 unsigned int i, nodes = 0, keys = 0, blocks; local
1378 while (nodes < GC_MERGE_NODES && !IS_ERR_OR_NULL(r[nodes]
[all...]
/linux-master/drivers/scsi/elx/efct/
H A Defct_xport.h121 /* 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 Dipu3.h20 * 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/net/tipc/
H A Dname_table.h97 * - used by name_distr to send bulk updates to new nodes
120 struct tipc_nlist *nodes);
/linux-master/certs/
H A DMakefile48 cmd_gen_key = openssl req -new -nodes -utf8 -$(CONFIG_MODULE_SIG_HASH) -days 36500 \

Completed in 557 milliseconds

1234567891011