Home
last modified time | relevance | path

Searched refs:nodes (Results 276 - 300 of 925) sorted by relevance

1...<<11121314151617181920>>...37

/third_party/icu/icu4c/source/common/
H A Dstringtriebuilder.cpp39 StringTrieBuilder::StringTrieBuilder() : nodes(NULL) {} in StringTrieBuilder()
50 nodes=uhash_openSize(hashStringTrieNode, equalStringTrieNodes, NULL, in createCompactBuilder()
53 if(nodes==NULL) { in createCompactBuilder()
56 uhash_setKeyDeleter(nodes, uprv_deleteUObject); in createCompactBuilder()
63 uhash_close(nodes); in deleteCompactBuilder()
64 nodes=NULL; in deleteCompactBuilder()
165 // Write the sub-nodes in reverse order: The jump lengths are deltas from in writeBranchSubNode()
195 // Write the split-branch nodes. in writeBranchSubNode()
309 // Create the split-branch nodes. in makeBranchSubNode()
328 const UHashElement *old=uhash_find(nodes, newNod in registerNode()
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dstringtriebuilder.cpp39 StringTrieBuilder::StringTrieBuilder() : nodes(nullptr) {} in StringTrieBuilder()
50 nodes=uhash_openSize(hashStringTrieNode, equalStringTrieNodes, nullptr, in createCompactBuilder()
53 if(nodes==nullptr) { in createCompactBuilder()
56 uhash_setKeyDeleter(nodes, uprv_deleteUObject); in createCompactBuilder()
63 uhash_close(nodes); in deleteCompactBuilder()
64 nodes=nullptr; in deleteCompactBuilder()
165 // Write the sub-nodes in reverse order: The jump lengths are deltas from in writeBranchSubNode()
195 // Write the split-branch nodes. in writeBranchSubNode()
309 // Create the split-branch nodes. in makeBranchSubNode()
328 const UHashElement *old=uhash_find(nodes, newNod in registerNode()
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dstringtriebuilder.cpp39 StringTrieBuilder::StringTrieBuilder() : nodes(NULL) {} in StringTrieBuilder()
50 nodes=uhash_openSize(hashStringTrieNode, equalStringTrieNodes, NULL, in createCompactBuilder()
53 if(nodes==NULL) { in createCompactBuilder()
56 uhash_setKeyDeleter(nodes, uprv_deleteUObject); in createCompactBuilder()
63 uhash_close(nodes); in deleteCompactBuilder()
64 nodes=NULL; in deleteCompactBuilder()
165 // Write the sub-nodes in reverse order: The jump lengths are deltas from in writeBranchSubNode()
195 // Write the split-branch nodes. in writeBranchSubNode()
309 // Create the split-branch nodes. in makeBranchSubNode()
328 const UHashElement *old=uhash_find(nodes, newNod in registerNode()
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Droot-tree.c88 l = path->nodes[0]; in btrfs_find_root()
148 l = path->nodes[0]; in btrfs_update_root()
179 l = path->nodes[0]; in btrfs_update_root()
191 btrfs_mark_buffer_dirty(path->nodes[0]); in btrfs_update_root()
234 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
241 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
343 leaf = path->nodes[0]; in btrfs_del_root_ref()
419 leaf = path->nodes[0]; in btrfs_add_root_ref()
H A Dsend.c837 ii = btrfs_item_ptr(path->nodes[0], path->slots[0], in __get_inode_info()
840 *size = btrfs_inode_size(path->nodes[0], ii); in __get_inode_info()
842 *gen = btrfs_inode_generation(path->nodes[0], ii); in __get_inode_info()
844 *mode = btrfs_inode_mode(path->nodes[0], ii); in __get_inode_info()
846 *uid = btrfs_inode_uid(path->nodes[0], ii); in __get_inode_info()
848 *gid = btrfs_inode_gid(path->nodes[0], ii); in __get_inode_info()
850 *rdev = btrfs_inode_rdev(path->nodes[0], ii); in __get_inode_info()
888 struct extent_buffer *eb = path->nodes[0]; in iterate_inode_ref()
1036 eb = path->nodes[0]; in iterate_dir_item()
1159 btrfs_item_key_to_cpu(p->nodes[ in get_inode_path()
[all...]
H A Dqgroup.c375 l = path->nodes[0]; in btrfs_read_qgroup_config()
469 l = path->nodes[0]; in btrfs_read_qgroup_config()
601 btrfs_mark_buffer_dirty(path->nodes[0]); in add_qgroup_relation_item()
670 leaf = path->nodes[0]; in add_qgroup_item()
689 leaf = path->nodes[0]; in add_qgroup_item()
778 l = path->nodes[0]; in update_qgroup_limit_item()
824 l = path->nodes[0]; in update_qgroup_info_item()
866 l = path->nodes[0]; in update_qgroup_status_item()
907 leaf = path->nodes[0]; in btrfs_clean_quota_tree()
1032 leaf = path->nodes[ in btrfs_quota_enable()
[all...]
H A Dtree-defrag.c80 * leafs from path->nodes[1], so set lowest_level to 1 to avoid later in btrfs_defrag_leaves()
90 if (!path->nodes[1]) { in btrfs_defrag_leaves()
101 path->nodes[1], 0, in btrfs_defrag_leaves()
117 path->slots[1] = btrfs_header_nritems(path->nodes[1]); in btrfs_defrag_leaves()
/kernel/linux/linux-6.6/fs/btrfs/
H A Droot-tree.c91 l = path->nodes[0]; in btrfs_find_root()
151 l = path->nodes[0]; in btrfs_update_root()
182 l = path->nodes[0]; in btrfs_update_root()
194 btrfs_mark_buffer_dirty(trans, path->nodes[0]); in btrfs_update_root()
237 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
244 leaf = path->nodes[0]; in btrfs_find_orphan_roots()
358 leaf = path->nodes[0]; in btrfs_del_root_ref()
434 leaf = path->nodes[0]; in btrfs_add_root_ref()
H A Dqgroup.c400 l = path->nodes[0]; in btrfs_read_qgroup_config()
494 l = path->nodes[0]; in btrfs_read_qgroup_config()
626 btrfs_mark_buffer_dirty(trans, path->nodes[0]); in add_qgroup_relation_item()
695 leaf = path->nodes[0]; in add_qgroup_item()
714 leaf = path->nodes[0]; in add_qgroup_item()
803 l = path->nodes[0]; in update_qgroup_limit_item()
849 l = path->nodes[0]; in update_qgroup_info_item()
891 l = path->nodes[0]; in update_qgroup_status_item()
931 leaf = path->nodes[0]; in btrfs_clean_quota_tree()
1062 leaf = path->nodes[ in btrfs_quota_enable()
[all...]
/foundation/window/window_manager/wmserver/test/unittest/
H A Daccessibility_connection_test.cpp69 std::vector<sptr<WindowNode>> nodes; in HWTEST_F() local
70 nodes.emplace_back(windowNode1); in HWTEST_F()
72 accessibilityConnection_->FillAccessibilityWindowInfo(nodes, focusedWindow, infos); in HWTEST_F()
/kernel/linux/linux-5.10/drivers/clk/zynqmp/
H A Dclk-gate-zynqmp.c103 * @nodes: Clock topology node
110 const struct clock_topology *nodes) in zynqmp_clk_register_gate()
124 init.flags = nodes->flag; in zynqmp_clk_register_gate()
129 gate->flags = nodes->type_flag; in zynqmp_clk_register_gate()
107 zynqmp_clk_register_gate(const char *name, u32 clk_id, const char * const *parents, u8 num_parents, const struct clock_topology *nodes) zynqmp_clk_register_gate() argument
/kernel/linux/linux-6.6/drivers/clk/zynqmp/
H A Dclk-gate-zynqmp.c103 * @nodes: Clock topology node
110 const struct clock_topology *nodes) in zynqmp_clk_register_gate()
125 init.flags = zynqmp_clk_map_common_ccf_flags(nodes->flag); in zynqmp_clk_register_gate()
131 gate->flags = nodes->type_flag; in zynqmp_clk_register_gate()
107 zynqmp_clk_register_gate(const char *name, u32 clk_id, const char * const *parents, u8 num_parents, const struct clock_topology *nodes) zynqmp_clk_register_gate() argument
/third_party/mesa3d/docs/_exts/
H A Dnir.py23 import docutils.nodes namespace
29 from sphinx.util.nodes import make_refnode
92 params += docutils.nodes.Text(nir_alu_type_name(t, s) + ' ')
/third_party/ltp/testcases/kernel/syscalls/move_pages/
H A Dmove_pages05.c129 int nodes[N_TEST_PAGES]; in main() local
148 nodes[i] = to_node; in main()
172 ret = numa_move_pages(0, N_TEST_PAGES, pages, nodes, in main()
H A Dmove_pages11.c129 int nodes[TEST_PAGES]; in main() local
142 nodes[i] = to_node; in main()
168 ret = numa_move_pages(0, TEST_PAGES, pages, nodes, in main()
H A Dmove_pages03.c128 int nodes[TEST_PAGES]; in main() local
141 nodes[i] = to_node; in main()
165 ret = numa_move_pages(0, TEST_PAGES, pages, nodes, in main()
/third_party/node/deps/v8/src/compiler/
H A Dgraph.h25 // Marks are used during traversal of the graph to distinguish states of nodes.
30 // NodeIds are identifying numbers for nodes that can be used to index auxiliary
41 // the original start and end nodes of the graph, and resets them when you
68 // Factory template for nodes with static input counts.
74 Node* NewNode(const Operator* op, Nodes... nodes) { in NewNode() argument
75 std::array<Node*, sizeof...(nodes)> nodes_arr{ in NewNode()
76 {static_cast<Node*>(nodes)...}}; in NewNode()
113 // A graph decorator can be used to add behavior to the creation of nodes
/third_party/python/Lib/distutils/command/
H A Dcheck.py13 from docutils import nodes namespace
25 return nodes.system_message(message, level=level,
140 document = nodes.document(settings, reporter, source=source_path)
/kernel/linux/linux-5.10/drivers/interconnect/qcom/
H A Dmsm8974.c201 * struct msm8974_icc_node - Qualcomm specific interconnect nodes
204 * @links: an array of nodes where we can go next while traversing
223 struct msm8974_icc_node **nodes; member
258 .nodes = msm8974_bimc_nodes,
341 .nodes = msm8974_cnoc_nodes,
394 .nodes = msm8974_mnoc_nodes,
429 .nodes = msm8974_onoc_nodes,
492 .nodes = msm8974_pnoc_nodes,
549 .nodes = msm8974_snoc_nodes,
562 * Setting the bandwidth requests for some nodes fail in msm8974_icc_rpm_smd_send()
[all...]
H A Dsdm845.c196 .nodes = aggre1_noc_nodes,
224 .nodes = aggre2_noc_nodes,
285 .nodes = config_noc_nodes,
301 .nodes = dc_noc_nodes,
319 .nodes = gladiator_noc_nodes,
354 .nodes = mem_noc_nodes,
388 .nodes = mmss_noc_nodes,
434 .nodes = system_noc_nodes,
455 qnodes = desc->nodes; in qnoc_probe()
462 data = devm_kzalloc(&pdev->dev, struct_size(data, nodes, num_node in qnoc_probe()
[all...]
H A Dmsm8916.c133 * struct msm8916_icc_node - Qualcomm specific interconnect nodes
136 * @links: an array of nodes where we can go next while traversing
155 struct msm8916_icc_node **nodes; member
287 .nodes = msm8916_snoc_nodes,
304 .nodes = msm8916_bimc_nodes,
362 .nodes = msm8916_pcnoc_nodes,
380 list_for_each_entry(n, &provider->nodes, node_list) in msm8916_icc_set()
453 qnodes = desc->nodes; in msm8916_qnoc_probe()
460 data = devm_kzalloc(dev, struct_size(data, nodes, num_nodes), in msm8916_qnoc_probe()
480 INIT_LIST_HEAD(&provider->nodes); in msm8916_qnoc_probe()
[all...]
/third_party/node/deps/v8/third_party/jinja2/
H A Dcompiler.py2 """Compiles nodes from the parser into Python code."""
11 from . import nodes namespace
25 from .nodes import EvalContext
82 if not isinstance(node, nodes.Template):
83 raise TypeError("Can't compile non template nodes")
113 def find_undeclared(nodes, names):
119 for node in nodes:
374 def blockvisit(self, nodes, frame):
375 """Visit a list of nodes as block in a frame. If the current frame
380 for node in nodes
[all...]
/third_party/skia/third_party/externals/jinja2/
H A Dcompiler.py2 """Compiles nodes from the parser into Python code."""
11 from . import nodes namespace
25 from .nodes import EvalContext
82 if not isinstance(node, nodes.Template):
83 raise TypeError("Can't compile non template nodes")
113 def find_undeclared(nodes, names):
119 for node in nodes:
374 def blockvisit(self, nodes, frame):
375 """Visit a list of nodes as block in a frame. If the current frame
380 for node in nodes
[all...]
/kernel/linux/linux-5.10/fs/dlm/
H A Dmember.c160 /* for any nodes that do not support slots, we will not have set memb->slot
397 /* all nodes revert to weight of 1 if all have weight 0 */ in make_member_array()
518 if (rv->nodes[i].nodeid == nodeid) in find_config_node()
519 return &rv->nodes[i]; in find_config_node()
562 node = &rv->nodes[i]; in dlm_recover_members()
586 log_rinfo(ls, "dlm_recover_members %d nodes", ls->ls_num_nodes); in dlm_recover_members()
590 /* Userspace guarantees that dlm_ls_stop() has completed on all nodes before
672 struct dlm_config_node *nodes = NULL; in dlm_ls_start() local
679 error = dlm_config_nodes(ls->ls_name, &nodes, &count); in dlm_ls_start()
694 rv->nodes in dlm_ls_start()
[all...]
/kernel/linux/linux-6.6/fs/dlm/
H A Dmember.c156 /* for any nodes that do not support slots, we will not have set memb->slot
420 /* all nodes revert to weight of 1 if all have weight 0 */ in make_member_array()
542 if (rv->nodes[i].nodeid == nodeid) in find_config_node()
543 return &rv->nodes[i]; in find_config_node()
591 node = &rv->nodes[i]; in dlm_recover_members()
611 log_rinfo(ls, "dlm_recover_members %d nodes", ls->ls_num_nodes); in dlm_recover_members()
615 /* Userspace guarantees that dlm_ls_stop() has completed on all nodes before
706 struct dlm_config_node *nodes = NULL; in dlm_ls_start() local
713 error = dlm_config_nodes(ls->ls_name, &nodes, &count); in dlm_ls_start()
728 rv->nodes in dlm_ls_start()
[all...]

Completed in 31 milliseconds

1...<<11121314151617181920>>...37