Home
last modified time | relevance | path

Searched refs:nodes (Results 326 - 350 of 899) sorted by relevance

1...<<11121314151617181920>>...36

/kernel/linux/linux-6.6/drivers/interconnect/qcom/
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...]
/third_party/ffmpeg/tools/python/
H A Dconvert_from_tensorflow.py59 def __init__(self, graph_def, nodes, outfile, dump4tb):
61 self.nodes = nodes
168 # conv2d with dilation > 1 generates tens of nodes, not easy to parse them, so use this tricky method.
407 for node in self.nodes:
411 # conv2d with dilation generates very complex nodes, so handle it in special
463 for node in self.nodes:
469 for node in self.nodes:
473 for node in self.nodes:
482 for node in self.nodes
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
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...]
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...]
/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/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()
100 WARN_ONCE(j == 0, "No memory nodes, is CONFIG_MEMORY_HOTPLUG enabled?\n")) in mem2node__init()
/third_party/skia/third_party/externals/freetype/src/cache/
H A Dftcmru.h36 * Note that it is possible to pre-allocate the element list nodes.
124 FTC_MruNode nodes; member
166 FTC_MruNode* _pfirst = &(list)->nodes; \
220 FTC_MruNode _first = (list)->nodes; \
/kernel/linux/linux-6.6/fs/btrfs/
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...]
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...]
/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-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...]
/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...]
/foundation/window/window_manager/wmserver/test/unittest/
H A Dwindow_display_zoom_controller_test.cpp100 std::vector<sptr<WindowNode>> nodes; in HWTEST_F() local
101 displayController_->ClearZoomTransform(nodes); in HWTEST_F()
/kernel/linux/linux-5.10/drivers/gpu/drm/nouveau/include/nvkm/core/
H A Dmm.h21 struct list_head nodes; member
48 list_for_each_entry(node, &mm->nodes, nl_entry) { in nvkm_mm_heap_size()
/kernel/linux/linux-6.6/drivers/gpu/drm/nouveau/include/nvkm/core/
H A Dmm.h21 struct list_head nodes; member
48 list_for_each_entry(node, &mm->nodes, nl_entry) { in nvkm_mm_heap_size()
/third_party/node/deps/brotli/c/enc/
H A Dbackward_references_hq.h74 On return, the nodes[0..num_bytes] array will have the following
76 For each i in [1..num_bytes], if nodes[i].cost < kInfinity, then
77 (1) nodes[i].copy_length() >= 2
78 (2) nodes[i].command_length() <= i and
79 (3) nodes[i - nodes[i].command_length()].cost < kInfinity */
84 const int* dist_cache, Hasher* hasher, ZopfliNode* nodes);
87 const size_t num_bytes, const size_t block_start, const ZopfliNode* nodes,
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dbackward_references_hq.h74 On return, the nodes[0..num_bytes] array will have the following
76 For each i in [1..num_bytes], if nodes[i].cost < kInfinity, then
77 (1) nodes[i].copy_length() >= 2
78 (2) nodes[i].command_length() <= i and
79 (3) nodes[i - nodes[i].command_length()].cost < kInfinity */
84 const int* dist_cache, Hasher* hasher, ZopfliNode* nodes);
87 const size_t num_bytes, const size_t block_start, const ZopfliNode* nodes,
/third_party/selinux/libsepol/cil/src/
H A Dcil_symtab.h39 struct cil_list *nodes; member
46 #define NODE(n) ((struct cil_tree_node *)(DATUM(n)->nodes->head->data))
/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()

Completed in 34 milliseconds

1...<<11121314151617181920>>...36