Home
last modified time | relevance | path

Searched refs:nodes (Results 301 - 325 of 958) sorted by relevance

1...<<11121314151617181920>>...39

/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...]
/third_party/skia/third_party/externals/freetype/src/base/
H A Dftdbgmem.c115 FT_Long nodes; member
260 new_size = ft_mem_closest_prime( table->nodes ); in ft_mem_table_resize()
352 table->nodes = 0; in ft_mem_table_destroy()
547 table->nodes++; in ft_mem_table_set()
554 if ( table->nodes * 3 < table->size || in ft_mem_table_set()
555 table->size * 3 < table->nodes ) in ft_mem_table_set()
612 table->nodes--; in ft_mem_table_remove()
621 if ( table->nodes * 3 < table->size || in ft_mem_table_remove()
622 table->size * 3 < table->nodes ) in ft_mem_table_remove()
/arkcompiler/ets_frontend/es2panda/ir/
H A DastDump.h123 std::vector<const ir::AstNode *> nodes; in Property() local
124 nodes.reserve(array.size()); in Property()
127 nodes.push_back(it); in Property()
130 value_ = std::move(nodes); in Property()
/foundation/graphic/graphic_3d/lume/metaobject/src/serialization/backend/
H A Djson_input.cpp108 BASE_NS::vector<ISerNode::Ptr> nodes; in ImportArray() local
109 nodes.reserve(arr.size()); in ImportArray()
112 nodes.emplace_back(BASE_NS::move(n)); in ImportArray()
117 return ISerNode::Ptr(new ArrayNode(BASE_NS::move(nodes))); in ImportArray()
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/test/
H A Ddata_share_subscriber_managers_test.cpp108 std::vector<PredicateTemplateNode> nodes; in HWTEST_F() local
109 nodes.emplace_back(node1); in HWTEST_F()
110 nodes.emplace_back(node2); in HWTEST_F()
111 Template tpl(nodes, "select name1 as name from TBL00"); in HWTEST_F()
/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()
/third_party/node/test/fixtures/wpt/resources/
H A Dcheck-layout-th.js210 console.error("You must provide a CSS selector of nodes to check.");
213 var nodes = document.querySelectorAll(selectorList);
214 nodes = Array.prototype.slice.call(nodes);
216 Array.prototype.forEach.call(nodes, function(node) {
H A Dcheck-layout.js205 document.body.appendChild(document.createTextNode("You must provide a CSS selector of nodes to check."));
208 var nodes = document.querySelectorAll(selectorList);
209 nodes = Array.prototype.slice.call(nodes);
210 nodes.reverse();
212 Array.prototype.forEach.call(nodes, function(node) {
/third_party/ltp/testcases/kernel/syscalls/migrate_pages/
H A Dmigrate_pages01.c124 int *nodes; in test_invalid_nodes() local
130 ret = get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes); in test_invalid_nodes()
135 /* get first node which is not in nodes */ in test_invalid_nodes()
137 if (invalid_node != nodes[i]) in test_invalid_nodes()
153 tst_resm(TCONF, "All possible nodes are present"); in test_invalid_nodes()
156 free(nodes); in test_invalid_nodes()
/third_party/mesa3d/src/util/tests/
H A Drb_tree_test.cpp210 struct rb_test_node nodes[ARRAY_SIZE(test_numbers)]; in TEST() local
216 nodes[i].key = test_numbers[i]; in TEST()
217 rb_tree_insert(&tree, &nodes[i].node, rb_test_node_cmp); in TEST()
224 rb_tree_remove(&tree, &nodes[i].node); in TEST()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dextent-tree.c161 btrfs_item_key_to_cpu(path->nodes[0], &key, in btrfs_lookup_extent_info()
171 leaf = path->nodes[0]; in btrfs_lookup_extent_info()
476 leaf = path->nodes[0]; in lookup_extent_data_ref()
486 leaf = path->nodes[0]; in lookup_extent_data_ref()
543 leaf = path->nodes[0]; in insert_extent_data_ref()
570 leaf = path->nodes[0]; in insert_extent_data_ref()
604 leaf = path->nodes[0]; in remove_extent_data_ref()
649 leaf = path->nodes[0]; in extent_data_ref_count()
750 if (!path->nodes[level]) in find_next_key()
753 btrfs_header_nritems(path->nodes[leve in find_next_key()
[all...]
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()
/third_party/ffmpeg/libavcodec/
H A Dproresenc_kostya.c228 struct TrellisNode *nodes; member
852 td->nodes[trellis_node + q].prev_node = -1; in find_slice_quant()
853 td->nodes[trellis_node + q].quant = q; in find_slice_quant()
920 td->nodes[trellis_node + max_quant + 1].quant = overquant; in find_slice_quant()
929 bits = td->nodes[prev].bits + slice_bits[q]; in find_slice_quant()
934 if (td->nodes[prev].score < SCORE_LIMIT && error < SCORE_LIMIT) in find_slice_quant()
935 new_score = td->nodes[prev].score + error; in find_slice_quant()
938 if (td->nodes[cur].prev_node == -1 || in find_slice_quant()
939 td->nodes[cur].score >= new_score) { in find_slice_quant()
941 td->nodes[cu in find_slice_quant()
[all...]
/third_party/node/tools/inspector_protocol/jinja2/
H A Dcompiler.py6 Compiles nodes into python code.
15 from jinja2 import nodes namespace
16 from jinja2.nodes import EvalContext
77 if not isinstance(node, nodes.Template):
78 raise TypeError('Can\'t compile non template nodes')
108 def find_undeclared(nodes, names):
114 for node in nodes:
371 def blockvisit(self, nodes, frame):
372 """Visit a list of nodes as block in a frame. If the current frame
377 for node in nodes
[all...]
/arkcompiler/ets_frontend/ets2panda/compiler/lowering/ets/
H A DrecordLowering.cpp151 std::vector<ir::AstNode *> nodes; in CreateStatement() local
153 nodes.push_back(ident); in CreateStatement()
157 nodes.push_back(key); in CreateStatement()
161 nodes.push_back(value); in CreateStatement()
165 auto statements = parser->CreateFormattedStatements(src, nodes); in CreateStatement()
/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-6.6/fs/btrfs/
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()
/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...]

Completed in 45 milliseconds

1...<<11121314151617181920>>...39