Home
last modified time | relevance | path

Searched refs:nodes (Results 176 - 200 of 524) sorted by relevance

12345678910>>...21

/foundation/graphic/graphic_3d/lume/scenewidgetplugin/plugin/src/
H A Dnode_impl.cpp815 // When nodes are deserialized, it is possible that the construction order in SetPathWithoutNode()
1023 // 1) on engine queue introspect children nodes in BuildChildren()
1040 // 2) on app queue instantiate nodes in BuildChildren()
1095 BASE_NS::vector<META_NS::IContainable::Ptr> nodes; in GetGlobalTransform() local
1096 nodes.push_back(GetSelf<META_NS::IContainable>()); in GetGlobalTransform()
1097 auto current = nodes.back()->GetParent(); in GetGlobalTransform()
1099 nodes.push_back(containable); in GetGlobalTransform()
1100 current = nodes.back()->GetParent(); in GetGlobalTransform()
1103 for (size_t ix = nodes.size(); ix != 0; ix--) { in GetGlobalTransform()
1104 ret = ret * META_NS::GetValue(interface_pointer_cast<INode>(nodes[i in GetGlobalTransform()
1113 BASE_NS::vector<META_NS::IContainable::Ptr> nodes; SetGlobalTransform() 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...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dreflink.c195 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { in clone_copy_inline_extent()
202 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in clone_copy_inline_extent()
215 ei = btrfs_item_ptr(path->nodes[0], path->slots[0], in clone_copy_inline_extent()
222 if (btrfs_file_extent_type(path->nodes[0], ei) == in clone_copy_inline_extent()
271 write_extent_buffer(path->nodes[0], inline_data, in clone_copy_inline_extent()
272 btrfs_item_ptr_offset(path->nodes[0], in clone_copy_inline_extent()
385 btrfs_item_key_to_cpu(path->nodes[0], &key, in btrfs_clone()
391 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
399 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
401 leaf = path->nodes[ in btrfs_clone()
[all...]
H A Dref-verify.c437 struct extent_buffer *leaf = path->nodes[0]; in process_extent_item()
501 struct extent_buffer *leaf = path->nodes[0]; in process_leaf()
563 block_bytenr = btrfs_node_blockptr(path->nodes[level], in walk_down_tree()
565 gen = btrfs_node_ptr_generation(path->nodes[level], in walk_down_tree()
567 btrfs_node_key_to_cpu(path->nodes[level], &first_key, in walk_down_tree()
579 path->nodes[level-1] = eb; in walk_down_tree()
598 if (!path->nodes[l]) in walk_up_tree()
603 btrfs_header_nritems(path->nodes[l])) { in walk_up_tree()
608 btrfs_tree_unlock_rw(path->nodes[l], path->locks[l]); in walk_up_tree()
609 free_extent_buffer(path->nodes[ in walk_up_tree()
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dreflink.c200 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { in clone_copy_inline_extent()
207 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in clone_copy_inline_extent()
220 ei = btrfs_item_ptr(path->nodes[0], path->slots[0], in clone_copy_inline_extent()
227 if (btrfs_file_extent_type(path->nodes[0], ei) == in clone_copy_inline_extent()
280 write_extent_buffer(path->nodes[0], inline_data, in clone_copy_inline_extent()
281 btrfs_item_ptr_offset(path->nodes[0], in clone_copy_inline_extent()
393 btrfs_item_key_to_cpu(path->nodes[0], &key, in btrfs_clone()
399 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
407 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
409 leaf = path->nodes[ in btrfs_clone()
[all...]
H A Dref-verify.c440 struct extent_buffer *leaf = path->nodes[0]; in process_extent_item()
505 struct extent_buffer *leaf = path->nodes[0]; in process_leaf()
564 eb = btrfs_read_node_slot(path->nodes[level], in walk_down_tree()
569 path->nodes[level-1] = eb; in walk_down_tree()
589 if (!path->nodes[l]) in walk_up_tree()
594 btrfs_header_nritems(path->nodes[l])) { in walk_up_tree()
599 btrfs_tree_unlock_rw(path->nodes[l], path->locks[l]); in walk_up_tree()
600 free_extent_buffer(path->nodes[l]); in walk_up_tree()
601 path->nodes[l] = NULL; in walk_up_tree()
999 path->nodes[leve in btrfs_build_ref_tree()
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Dmmzone.h1276 * total * PAGE_SIZE * #nodes = /proc/meminfo/HardwareCorrupted.
1302 * node_zonelists contains references to all zones in all nodes.
1614 * for_each_online_pgdat - helper macro to iterate over all online nodes
1658 nodemask_t *nodes);
1664 * @nodes: An optional nodemask to filter the zonelist with
1677 nodemask_t *nodes) in next_zones_zonelist()
1679 if (likely(!nodes && zonelist_zone_idx(z) <= highest_zoneidx)) in next_zones_zonelist()
1681 return __next_zones_zonelist(z, highest_zoneidx, nodes); in next_zones_zonelist()
1688 * @nodes: An optional nodemask to filter the zonelist with
1703 nodemask_t *nodes) in first_zones_zonelist()
1675 next_zones_zonelist(struct zoneref *z, enum zone_type highest_zoneidx, nodemask_t *nodes) next_zones_zonelist() argument
1701 first_zones_zonelist(struct zonelist *zonelist, enum zone_type highest_zoneidx, nodemask_t *nodes) first_zones_zonelist() argument
1746 movable_only_nodes(nodemask_t *nodes) movable_only_nodes() argument
[all...]
/kernel/linux/linux-6.6/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()
157 list_for_each_entry(n, &provider->nodes, node_list) { in node_find_by_name()
342 * multiple interconnect nodes. A single cell is used as an index into
343 * an array of icc nodes specified in the icc_onecell_data struct when
357 return icc_data->nodes[idx]; in of_icc_xlate_onecell()
880 * icc_link_create() - create a link between two nodes
[all...]
/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...]
/foundation/graphic/graphic_3d/lume/Lume_3D/src/util/
H A Drender_util.cpp101 for (auto& rnRef : desc.nodes) { in FillCameraDescsData()
125 for (auto& rnRef : desc.nodes) { in FillCameraPostProcessDescsData()
290 if (!desc.nodes.empty()) { in GetRenderNodeGraphDescs()
313 if (!ppDesc.nodes.empty()) { in GetRenderNodeGraphDescs()
345 for (auto& rnRef : desc.nodes) { in GetRenderNodeGraphDesc()
369 for (auto& rnRef : desc.nodes) { in GetRenderNodeGraphDesc()
/kernel/linux/linux-6.6/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)
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_psp.c1348 if (mirror_top_info->nodes[j].node_id != src_node_id) in psp_xgmi_reflect_topology_info()
1351 mirror_top_info->nodes[j].num_hops = dst_num_hops; in psp_xgmi_reflect_topology_info()
1358 mirror_top_info->nodes[j].num_links = dst_num_links; in psp_xgmi_reflect_topology_info()
1393 topology_info_input->nodes[i].node_id = topology->nodes[i].node_id; in psp_xgmi_get_topology_info()
1394 topology_info_input->nodes[i].num_hops = topology->nodes[i].num_hops; in psp_xgmi_get_topology_info()
1395 topology_info_input->nodes[i].is_sharing_enabled = topology->nodes[i].is_sharing_enabled; in psp_xgmi_get_topology_info()
1396 topology_info_input->nodes[ in psp_xgmi_get_topology_info()
[all...]
/foundation/arkui/ace_engine/frameworks/core/common/recorder/
H A Dnode_data_cache.cpp174 void NodeDataCache::GetNodeData(const std::string& pageUrl, std::unordered_map<std::string, std::string>& nodes) in GetNodeData() argument
184 for (auto nodeIter = nodes.begin(); nodeIter != nodes.end(); nodeIter++) { in GetNodeData()
187 nodes[it->first] = it->second; in GetNodeData()
/foundation/arkui/ace_engine/frameworks/core/components_ng/syntax/
H A Dfor_each_node.cpp23 void MakeNodeMapById(const std::list<RefPtr<UINode>>& nodes, const std::list<std::string>& ids, in MakeNodeMapById() argument
26 ACE_DCHECK(ids.size() == nodes.size()); in MakeNodeMapById()
28 auto nodeIter = nodes.begin(); in MakeNodeMapById()
29 while (idsIter != ids.end() && nodeIter != nodes.end()) { in MakeNodeMapById()
209 // Collect IDs of removed nodes starting from 'oldNode' (incl.) in FinishRepeatRender()
/foundation/ai/neural_network_runtime/example/drivers/nnrt/v2_0/hdi_cpu_service/src/
H A Dnnrt_device_service.cpp71 size_t nodeSize = model.nodes.size(); in GetSupportedOperation()
72 auto nodes = model.nodes; in GetSupportedOperation() local
76 ops[i] = regInstance.IsNodeTypeExist(nodes[i].nodeType); in GetSupportedOperation()
287 if (model.nodes.empty()) { in ValidateModel()
288 HDF_LOGE("Model has no nodes."); in ValidateModel()
343 for (auto& node : model.nodes) { in TransModelToGraph()
349 metaGraph->nodes.emplace_back(std::move(transNode)); in TransModelToGraph()
/kernel/linux/linux-5.10/drivers/base/
H A Dswnode.c3 * Software nodes for the firmware node framework.
695 * software_node_register_nodes - Register an array of software nodes
696 * @nodes: Zero terminated array of software nodes to be registered
698 * Register multiple software nodes at once.
700 int software_node_register_nodes(const struct software_node *nodes) in software_node_register_nodes() argument
705 for (i = 0; nodes[i].name; i++) { in software_node_register_nodes()
706 ret = software_node_register(&nodes[i]); in software_node_register_nodes()
708 software_node_unregister_nodes(nodes); in software_node_register_nodes()
718 * software_node_unregister_nodes - Unregister an array of software nodes
728 software_node_unregister_nodes(const struct software_node *nodes) software_node_unregister_nodes() argument
[all...]
/kernel/linux/linux-5.10/arch/x86/kernel/apic/
H A Dapic_numachip.c173 u32 nodes = 1; in fixup_cpu_id() local
177 /* Account for nodes per socket in multi-core-module processors */ in fixup_cpu_id()
180 nodes = ((val >> 3) & 7) + 1; in fixup_cpu_id()
183 c->phys_proc_id = node / nodes; in fixup_cpu_id()
/kernel/linux/linux-6.6/arch/x86/kernel/apic/
H A Dapic_numachip.c162 u32 nodes = 1; in fixup_cpu_id() local
166 /* Account for nodes per socket in multi-core-module processors */ in fixup_cpu_id()
169 nodes = ((val >> 3) & 7) + 1; in fixup_cpu_id()
172 c->phys_proc_id = node / nodes; in fixup_cpu_id()
/kernel/linux/linux-6.6/drivers/interconnect/imx/
H A Dimx8mp.c185 static struct imx_icc_node_desc nodes[] = { variable
239 return imx_icc_register(pdev, nodes, ARRAY_SIZE(nodes), noc_setting_nodes); in imx8mp_icc_probe()
/kernel/linux/linux-5.10/fs/ubifs/
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...]
/kernel/linux/linux-6.6/fs/ubifs/
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...]
/kernel/linux/linux-5.10/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 in do_btree_node_write()
668 * It's _really_ critical that we don't free too many btree nodes - we in bch_mca_scan()
883 * We can only have one thread cannibalizing other cached btree nodes at a time,
911 * the list. Check if there's any freed nodes there: in mca_alloc()
1210 * ptr_invalid() can't return true for the keys that mark btree nodes as in __bch_btree_mark_key()
1289 gc->nodes++; in btree_gc_mark_node()
1338 unsigned int i, nodes = 0, keys = 0, blocks; in btree_gc_coalesce() local
1352 while (nodes < GC_MERGE_NODES && !IS_ERR_OR_NULL(r[nodes] in btree_gc_coalesce()
[all...]
/kernel/linux/linux-6.6/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 in do_btree_node_write()
689 * It's _really_ critical that we don't free too many btree nodes - we in bch_mca_scan()
904 * We can only have one thread cannibalizing other cached btree nodes at a time,
932 * the list. Check if there's any freed nodes there: in mca_alloc()
1231 * ptr_invalid() can't return true for the keys that mark btree nodes as in __bch_btree_mark_key()
1310 gc->nodes++; in btree_gc_mark_node()
1359 unsigned int i, nodes = 0, keys = 0, blocks; in btree_gc_coalesce() local
1373 while (nodes < GC_MERGE_NODES && !IS_ERR_OR_NULL(r[nodes] in btree_gc_coalesce()
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_device.c581 knode = kfd->nodes[i]; in kfd_cleanup_nodes()
588 kfd->nodes[i] = NULL; in kfd_cleanup_nodes()
649 "KFD num nodes cannot be 0, num_xcc_in_node: %d\n", in kgd2kfd_device_init()
758 dev_info(kfd_device, "Total number of KFD nodes to be created: %d\n", in kgd2kfd_device_init()
761 /* Allocate the KFD nodes */ in kgd2kfd_device_init()
825 kfd->nodes[i] = node; in kgd2kfd_device_init()
860 /* Cleanup KFD nodes */ in kgd2kfd_device_exit()
881 node = kfd->nodes[i]; in kgd2kfd_pre_reset()
889 kfd_signal_reset_event(kfd->nodes[i]); in kgd2kfd_pre_reset()
910 ret = kfd_resume(kfd->nodes[ in kgd2kfd_post_reset()
[all...]
/kernel/linux/linux-6.6/Documentation/sphinx/
H A Dkernel_feat.py40 from docutils import nodes, statemachine namespace
117 node = nodes.section()

Completed in 31 milliseconds

12345678910>>...21