Home
last modified time | relevance | path

Searched refs:nodes (Results 126 - 150 of 442) sorted by relevance

12345678910>>...18

/kernel/linux/linux-6.6/drivers/interconnect/qcom/
H A Dicc-rpmh.c153 qn = bcm->nodes[i]; in qcom_icc_bcm_init()
178 qnodes = desc->nodes; in qcom_icc_rpmh_probe()
185 data = devm_kzalloc(dev, struct_size(data, nodes, num_nodes), GFP_KERNEL); in qcom_icc_rpmh_probe()
229 data->nodes[i] = node; in qcom_icc_rpmh_probe()
H A Dmsm8974.c200 * struct msm8974_icc_node - Qualcomm specific interconnect nodes
203 * @links: an array of nodes where we can go next while traversing
222 struct msm8974_icc_node * const *nodes; member
257 .nodes = msm8974_bimc_nodes,
340 .nodes = msm8974_cnoc_nodes,
393 .nodes = msm8974_mnoc_nodes,
428 .nodes = msm8974_onoc_nodes,
491 .nodes = msm8974_pnoc_nodes,
548 .nodes = msm8974_snoc_nodes,
561 * Setting the bandwidth requests for some nodes fail in msm8974_icc_rpm_smd_send()
[all...]
/test/xts/hats/ai/nnrt/hdi/v2_0/nnrtFunctionTest_additional/src/
H A Dhdi_model_prepare_test.cpp1769 for (auto &node : iModel->nodes) { in HWTEST_F()
1811 for (auto &node : iModel->nodes) { in HWTEST_F()
1853 for (auto &node : iModel->nodes) { in HWTEST_F()
1895 for (auto &node : iModel->nodes) { in HWTEST_F()
1937 for (auto &node : iModel->nodes) { in HWTEST_F()
1979 for (auto &node : iModel->nodes) { in HWTEST_F()
2021 for (auto &node : iModel->nodes) { in HWTEST_F()
2063 for (auto &node : iModel->nodes) { in HWTEST_F()
2105 for (auto &node : iModel->nodes) { in HWTEST_F()
2147 for (auto &node : iModel->nodes) { in HWTEST_F()
[all...]
/kernel/linux/linux-5.10/fs/btrfs/tests/
H A Dfree-space-tree-tests.c40 flags = btrfs_free_space_flags(path->nodes[0], info); in __check_free_space_extents()
41 extent_count = btrfs_free_space_extent_count(path->nodes[0], info); in __check_free_space_extents()
53 while (++path->slots[0] < btrfs_header_nritems(path->nodes[0])) { in __check_free_space_extents()
54 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in __check_free_space_extents()
83 if (btrfs_header_nritems(path->nodes[0]) != num_extents + 1 || in __check_free_space_extents()
88 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in __check_free_space_extents()
123 flags = btrfs_free_space_flags(path->nodes[0], info); in check_free_space_extents()
H A Dqgroup-tests.c47 leaf = path->nodes[0]; in insert_normal_tree_ref()
97 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in add_tree_ref()
99 refs = btrfs_extent_refs(path->nodes[0], item); in add_tree_ref()
100 btrfs_set_extent_refs(path->nodes[0], item, refs + 1); in add_tree_ref()
181 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in remove_extent_ref()
183 refs = btrfs_extent_refs(path->nodes[0], item); in remove_extent_ref()
184 btrfs_set_extent_refs(path->nodes[0], item, refs - 1); in remove_extent_ref()
/kernel/linux/linux-6.6/fs/btrfs/tests/
H A Dfree-space-tree-tests.c41 flags = btrfs_free_space_flags(path->nodes[0], info); in __check_free_space_extents()
42 extent_count = btrfs_free_space_extent_count(path->nodes[0], info); in __check_free_space_extents()
54 while (++path->slots[0] < btrfs_header_nritems(path->nodes[0])) { in __check_free_space_extents()
55 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in __check_free_space_extents()
84 if (btrfs_header_nritems(path->nodes[0]) != num_extents + 1 || in __check_free_space_extents()
89 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in __check_free_space_extents()
124 flags = btrfs_free_space_flags(path->nodes[0], info); in check_free_space_extents()
H A Dqgroup-tests.c48 leaf = path->nodes[0]; in insert_normal_tree_ref()
97 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in add_tree_ref()
99 refs = btrfs_extent_refs(path->nodes[0], item); in add_tree_ref()
100 btrfs_set_extent_refs(path->nodes[0], item, refs + 1); in add_tree_ref()
179 item = btrfs_item_ptr(path->nodes[0], path->slots[0], in remove_extent_ref()
181 refs = btrfs_extent_refs(path->nodes[0], item); in remove_extent_ref()
182 btrfs_set_extent_refs(path->nodes[0], item, refs - 1); in remove_extent_ref()
/kernel/linux/linux-6.6/fs/btrfs/
H A Ddir-item.c45 leaf = path->nodes[0]; in insert_with_overflow()
84 leaf = path->nodes[0]; in btrfs_insert_xattr_item()
96 btrfs_mark_buffer_dirty(trans, path->nodes[0]); in btrfs_insert_xattr_item()
147 leaf = path->nodes[0]; in btrfs_insert_dir_item()
275 leaf = path->nodes[0]; in btrfs_check_dir_item_collision()
392 leaf = path->nodes[0]; in btrfs_match_dir_item_name()
428 leaf = path->nodes[0]; in btrfs_delete_one_dir_name()
H A Duuid-tree.c56 eb = path->nodes[0]; in btrfs_uuid_tree_lookup()
119 eb = path->nodes[0]; in btrfs_uuid_tree_add()
128 eb = path->nodes[0]; in btrfs_uuid_tree_add()
189 eb = path->nodes[0]; in btrfs_uuid_tree_remove()
328 leaf = path->nodes[0]; in btrfs_uuid_tree_iterate()
H A Dextent-tree.c151 btrfs_item_key_to_cpu(path->nodes[0], &key, in btrfs_lookup_extent_info()
161 leaf = path->nodes[0]; in btrfs_lookup_extent_info()
468 leaf = path->nodes[0]; in lookup_extent_data_ref()
478 leaf = path->nodes[0]; in lookup_extent_data_ref()
535 leaf = path->nodes[0]; in insert_extent_data_ref()
562 leaf = path->nodes[0]; in insert_extent_data_ref()
597 leaf = path->nodes[0]; in remove_extent_data_ref()
641 leaf = path->nodes[0]; in extent_data_ref_count()
741 if (!path->nodes[level]) in find_next_key()
744 btrfs_header_nritems(path->nodes[leve in find_next_key()
[all...]
H A Drelocation.c150 /* size of relocated tree nodes */
191 * walk up backref nodes until reach node presents tree root
212 * walk down backref nodes to find start of next reference path
267 * detached nodes are used to avoid unnecessary backref in update_backref_cache()
269 * so the detached nodes are no longer useful. in update_backref_cache()
286 * some nodes can be left in the pending list if there were in update_backref_cache()
287 * errors during processing the pending nodes. in update_backref_cache()
381 * For useless nodes, do two major clean ups:
383 * - Cleanup the children edges and nodes
387 * - Freeing up leaves (level 0), keeps nodes detache
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Dcputopo.c406 tp = zalloc(sizeof(*tp) + sizeof(tp->nodes[0])*nr); in numa_topology__new()
413 if (load_numa_node(&tp->nodes[i], perf_cpu_map__cpu(node_map, i).cpu)) { in numa_topology__new()
432 zfree(&tp->nodes[i].cpus); in numa_topology__delete()
480 tp = zalloc(sizeof(*tp) + sizeof(tp->nodes[0]) * nr); in hybrid_topology__new()
486 if (load_hybrid_node(&tp->nodes[i], pmu)) { in hybrid_topology__new()
501 zfree(&tp->nodes[i].pmu_name); in hybrid_topology__delete()
502 zfree(&tp->nodes[i].cpus); in hybrid_topology__delete()
H A Dmem2node.c49 struct memory_node *n, *nodes = &env->memory_nodes[0]; in mem2node__init() local
58 n = &nodes[i]; in mem2node__init()
69 n = &nodes[i]; in mem2node__init()
100 WARN_ONCE(j == 0, "No memory nodes, is CONFIG_MEMORY_HOTPLUG enabled?\n")) in mem2node__init()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dlocking.c489 * Set all locked nodes in the path to blocking locks. This should be done
497 if (!p->nodes[i] || !p->locks[i]) in btrfs_set_path_blocking()
505 btrfs_set_lock_blocking_read(p->nodes[i]); in btrfs_set_path_blocking()
508 btrfs_set_lock_blocking_write(p->nodes[i]); in btrfs_set_path_blocking()
518 * btrfs_search_slot will keep the lock held on higher nodes in a few corner
531 if (!path->nodes[i]) in btrfs_unlock_up_safe()
535 btrfs_tree_unlock_rw(path->nodes[i], path->locks[i]); in btrfs_unlock_up_safe()
H A Duuid-tree.c53 eb = path->nodes[0]; in btrfs_uuid_tree_lookup()
116 eb = path->nodes[0]; in btrfs_uuid_tree_add()
125 eb = path->nodes[0]; in btrfs_uuid_tree_add()
187 eb = path->nodes[0]; in btrfs_uuid_tree_remove()
326 leaf = path->nodes[0]; in btrfs_uuid_tree_iterate()
H A Drelocation.c138 /* size of relocated tree nodes */
179 * walk up backref nodes until reach node presents tree root
200 * walk down backref nodes to find start of next reference path
255 * detached nodes are used to avoid unnecessary backref in update_backref_cache()
257 * so the detached nodes are no longer useful. in update_backref_cache()
274 * some nodes can be left in the pending list if there were in update_backref_cache()
275 * errors during processing the pending nodes. in update_backref_cache()
369 * For useless nodes, do two major clean ups:
371 * - Cleanup the children edges and nodes
375 * - Freeing up leaves (level 0), keeps nodes detache
[all...]
H A Dbackref.c438 eb = path->nodes[level]; in add_all_parents()
455 eb = path->nodes[0]; in add_all_parents()
466 eb = path->nodes[0]; in add_all_parents()
556 * other tree nodes. This happens when qgroups does backref walks when in resolve_indirect_ref()
628 eb = path->nodes[level]; in resolve_indirect_ref()
635 eb = path->nodes[level]; in resolve_indirect_ref()
680 * New backrefs (i.e., for parent nodes) are added to the appropriate
982 leaf = path->nodes[0]; in add_inline_refs()
1107 leaf = path->nodes[0]; in add_keyed_refs()
1304 leaf = path->nodes[
[all...]
/kernel/linux/linux-5.10/mm/
H A Dworkingset.c488 * create excessive amounts of shadow nodes. To keep a lid on this,
489 * track shadow nodes and reclaim them when they grow way past the
498 * Track non-empty nodes that contain only shadow entries; in workingset_update_node()
501 * Avoid acquiring the list_lru lock when the nodes are in workingset_update_node()
524 unsigned long nodes; in count_shadow_nodes() local
527 nodes = list_lru_shrink_count(&shadow_nodes, sc); in count_shadow_nodes()
530 * Approximate a reasonable limit for the nodes in count_shadow_nodes()
572 if (!nodes) in count_shadow_nodes()
575 if (nodes <= max_nodes) in count_shadow_nodes()
577 return nodes in count_shadow_nodes()
[all...]
/kernel/linux/linux-5.10/security/selinux/ss/
H A Dconditional.h36 struct cond_expr_node *nodes; member
46 struct avtab_node **nodes; member
/kernel/linux/linux-6.6/security/selinux/ss/
H A Dconditional.h36 struct cond_expr_node *nodes; member
46 struct avtab_node **nodes; member
/kernel/linux/linux-5.10/drivers/staging/media/ipu3/
H A Dipu3-v4l2.c32 imgu_pipe->nodes[IMGU_NODE_IN].vdev_fmt.fmt.pix_mp.width; in imgu_subdev_open()
34 imgu_pipe->nodes[IMGU_NODE_IN].vdev_fmt.fmt.pix_mp.height; in imgu_subdev_open()
43 try_fmt->code = imgu_pipe->nodes[i].pad_fmt.code; in imgu_subdev_open()
79 imgu_pipe->queue_enabled[i] = imgu_pipe->nodes[i].enabled; in imgu_subdev_s_stream()
87 /* No need to reconfig meta nodes */ in imgu_subdev_s_stream()
91 &imgu_pipe->nodes[node].vdev_fmt.fmt.pix_mp : NULL; in imgu_subdev_s_stream()
96 if (imgu_pipe->nodes[IMGU_NODE_VF].enabled) in imgu_subdev_s_stream()
137 fmt->format = imgu_pipe->nodes[pad].pad_fmt; in imgu_subdev_get_fmt()
166 mf = &imgu_pipe->nodes[pad].pad_fmt; in imgu_subdev_set_fmt()
285 imgu_pipe->nodes[pa in imgu_link_setup()
[all...]
/kernel/linux/linux-6.6/drivers/staging/media/ipu3/
H A Dipu3-v4l2.c32 imgu_pipe->nodes[IMGU_NODE_IN].vdev_fmt.fmt.pix_mp.width; in imgu_subdev_open()
34 imgu_pipe->nodes[IMGU_NODE_IN].vdev_fmt.fmt.pix_mp.height; in imgu_subdev_open()
43 try_fmt->code = imgu_pipe->nodes[i].pad_fmt.code; in imgu_subdev_open()
79 imgu_pipe->queue_enabled[i] = imgu_pipe->nodes[i].enabled; in imgu_subdev_s_stream()
87 /* No need to reconfig meta nodes */ in imgu_subdev_s_stream()
91 &imgu_pipe->nodes[node].vdev_fmt.fmt.pix_mp : NULL; in imgu_subdev_s_stream()
96 if (imgu_pipe->nodes[IMGU_NODE_VF].enabled) in imgu_subdev_s_stream()
137 fmt->format = imgu_pipe->nodes[pad].pad_fmt; in imgu_subdev_get_fmt()
166 mf = &imgu_pipe->nodes[pad].pad_fmt; in imgu_subdev_set_fmt()
293 imgu_pipe->nodes[pa in imgu_link_setup()
[all...]
/kernel/linux/linux-5.10/tools/perf/util/
H A Dmem2node.c49 struct memory_node *n, *nodes = &env->memory_nodes[0]; in mem2node__init() local
58 n = &nodes[i]; in mem2node__init()
69 n = &nodes[i]; in mem2node__init()
/kernel/linux/linux-6.6/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); in parse_setup_node_list()
917 * Count the number of nodes a process's threads
927 int nodes; in count_process_nodes() local
932 for (nodes = 0; nodes < g->p.nr_nodes; nodes++) in count_process_nodes()
933 node_present[nodes] = 0; in count_process_nodes()
952 nodes in count_process_nodes()
1002 unsigned int nodes = count_process_nodes(p); calc_convergence_compression() local
1026 int *nodes; calc_convergence() local
[all...]
/kernel/linux/linux-5.10/drivers/interconnect/
H A Dcore.c55 list_for_each_entry(n, &provider->nodes, node_list) { in icc_summary_show()
117 /* draw nodes */ in icc_graph_show()
118 list_for_each_entry(n, &provider->nodes, node_list) in icc_graph_show()
122 list_for_each_entry(n, &provider->nodes, node_list) in icc_graph_show()
133 list_for_each_entry(n, &provider->nodes, node_list) in icc_graph_show()
327 * multiple interconnect nodes. A single cell is used as an index into
328 * an array of icc nodes specified in the icc_onecell_data struct when
342 return icc_data->nodes[idx]; in of_icc_xlate_onecell()
865 * icc_link_create() - create a link between two nodes
869 * Create a link between two nodes
[all...]

Completed in 51 milliseconds

12345678910>>...18