| /kernel/linux/linux-5.10/tools/perf/ |
| H A D | builtin-c2c.c | 87 unsigned long **nodes; member
1062 bitmap_and(set, c2c_he->cpuset, c2c.nodes[node], c2c.cpus_cnt); in node_entry()
1988 unsigned long **nodes; in setup_nodes() local
2002 nodes = zalloc(sizeof(unsigned long *) * c2c.nodes_cnt); in setup_nodes()
2003 if (!nodes) in setup_nodes()
2006 c2c.nodes = nodes; in setup_nodes()
2025 nodes[node] = set; in setup_nodes()
2764 pr_err("Failed setup nodes\n"); in perf_c2c__report()
|
| /kernel/linux/linux-6.6/tools/perf/ |
| H A D | builtin-c2c.c | 91 unsigned long **nodes; member
1204 bitmap_and(set, c2c_he->cpuset, c2c.nodes[node], c2c.cpus_cnt); in node_entry()
2282 unsigned long **nodes; in setup_nodes() local
2297 nodes = zalloc(sizeof(unsigned long *) * c2c.nodes_cnt); in setup_nodes()
2298 if (!nodes) in setup_nodes()
2301 c2c.nodes = nodes; in setup_nodes()
2320 nodes[node] = set; in setup_nodes()
2435 fprintf(out, " Load hits on peer cache or nodes : %10d\n", stats->lcl_peer + stats->rmt_peer); in print_shared_cacheline_info()
3115 pr_err("Failed setup nodes\ in perf_c2c__report()
[all...] |
| /foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/common/include/ |
| H A D | db_common.h | 114 static std::list<std::string> GenerateNodesByNodeWeight(const std::vector<std::string> &nodes,
|
| /foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/framework/include/store/ |
| H A D | general_value.h | 153 virtual void SetQueryNodes(const std::string& tableName, QueryNodes&& nodes) {}; in SetQueryNodes()
|
| /kernel/linux/linux-5.10/scripts/ |
| H A D | dev-needs.sh | 29 -g list the dependencies as edges and nodes for graphviz
|
| /kernel/linux/linux-5.10/include/linux/ |
| H A D | radix-tree.h | 29 /* nodes->parent points to next preallocated node */
30 struct radix_tree_node *nodes; member
154 * delete nodes running concurrently with it may affect its result such that
|
| H A D | mempolicy.h | 51 nodemask_t nodes; /* interleave/bind */ member
55 nodemask_t cpuset_mems_allowed; /* relative to these nodes */
|
| /kernel/linux/linux-5.10/fs/btrfs/tests/ |
| H A D | extent-buffer-tests.c | 51 path->nodes[0] = eb = alloc_dummy_extent_buffer(fs_info, nodesize); in test_btrfs_split_item()
|
| /kernel/linux/linux-5.10/fs/dlm/ |
| H A D | recoverd.c | 72 * Add or remove nodes from the lockspace's ls_nodes list. in ls_recover()
99 * nodes their master rsb names that hash to us. in ls_recover()
133 * Clear lkb's for departed nodes. in ls_recover()
140 * departed nodes. in ls_recover()
197 * rebuild and will be resent by the requesting nodes. in ls_recover()
269 kfree(rv->nodes); in do_ls_recovery()
|
| /kernel/linux/linux-6.6/drivers/android/ |
| H A D | binder_internal.h | 177 * @rb_node: element for proc->nodes tree
228 * Bookkeeping structure for binder nodes.
298 * struct binder_ref - struct to track references on nodes
333 * @nodes: rbtree of binder nodes associated with
405 struct rb_root nodes; member
561 * @fbo: binder object (nodes and refs)
|
| /kernel/linux/linux-6.6/fs/dlm/ |
| H A D | recoverd.c | 72 * Add or remove nodes from the lockspace's ls_nodes list. in ls_recover()
103 * nodes their master rsb names that hash to us. in ls_recover()
138 * Clear lkb's for departed nodes. in ls_recover()
145 * departed nodes. in ls_recover()
202 * rebuild and will be resent by the requesting nodes. in ls_recover()
295 kfree(rv->nodes); in do_ls_recovery()
|
| /kernel/linux/linux-6.6/include/linux/ |
| H A D | radix-tree.h | 31 /* nodes->parent points to next preallocated node */
32 struct radix_tree_node *nodes; member
156 * delete nodes running concurrently with it may affect its result such that
|
| /kernel/linux/linux-6.6/scripts/ |
| H A D | dev-needs.sh | 29 -g list the dependencies as edges and nodes for graphviz
|
| /third_party/PyYAML/lib/yaml/ |
| H A D | resolver.py | 5 from .nodes import *
46 # any _value_ of sequence and mapping nodes. `True` matches against
|
| /third_party/ninja/src/ |
| H A D | missing_deps.cc | 30 /// ImplicitDepLoader variant that stores dep nodes into the given output
96 ProcessNodeDeps(node, deps->nodes, deps->node_count); in ProcessNode()
155 std::cout << "Processed " << seen_.size() << " nodes.\n"; in PrintStats()
|
| /third_party/node/deps/cares/src/tools/ |
| H A D | ahost.c | 248 for (node = result->nodes; node != NULL; node = node->ai_next) { in ai_callback()
|
| /third_party/mesa3d/src/intel/dev/ |
| H A D | intel_dev_info.c | 106 const char *path = devices[i]->nodes[DRM_NODE_RENDER]; in main()
|
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
| H A D | TrailingPathOptimizer.java | 66 // This is just a way to find a node from which we can start generating new nodes. in optimize()
67 Node lastAddedNode = out.nodes().stream().max(naturalOrder()).get(); in optimize()
121 * node at which the AnyPath value starts from. Edges and nodes are removed from the graph,
123 * set of nodes that need to be reconnected).
184 /** Adds the given "AnyPath" into the graph, generating new nodes and edges as necessary. */
|
| /third_party/mbedtls/tests/data_files/ |
| H A D | Makefile | 91 $(OPENSSL) req -x509 -new -nodes -key $(test_ca_key_file_rsa) -passin "pass:$(test_ca_pwd_rsa)" -set_serial 3 -config $(test_ca_config_file) -sha1 -days 3653 -utf8 -subj "/C=NL/O=PolarSSL/CN=PolarSSL Test CA" -out $@
95 $(OPENSSL) req -x509 -new -nodes -key $(test_ca_key_file_rsa) -passin "pass:$(test_ca_pwd_rsa)" -set_serial 3 -config $(test_ca_config_file) -sha1 -days 3653 -subj "/C=NL/O=PolarSSL/CN=PolarSSL Test CA" -out $@
99 $(OPENSSL) req -x509 -new -nodes -key $(test_ca_key_file_rsa) -passin "pass:$(test_ca_pwd_rsa)" -set_serial 3 -config $(test_ca_config_file) -sha1 -days 3653 -subj "/C=NL/O=PolarSSL/CN=PolarSSL Test CA" -out $@
462 -sha256 -days 3650 -nodes \
532 $(OPENSSL) req -x509 -outform der -nodes -days 7300 -newkey rsa:2048 -key $< -out $@ -addext "subjectAltName = URI:urn:example.com:5ff40f78-9210-494f-8206-c2c082f0609c" -extensions 'v3_req' -subj "/C=UK/O=Mbed TLS/CN=Mbed TLS URI SAN"
535 $(OPENSSL) req -x509 -outform der -nodes -days 7300 -newkey rsa:2048 -key $< -out $@ -addext "subjectAltName = URI:urn:example.com:5ff40f78-9210-494f-8206-c2c082f0609c, URI:urn:example.com:5ff40f78-9210-494f-8206-abcde1234567" -extensions 'v3_req' -subj "/C=UK/O=Mbed TLS/CN=Mbed TLS URI SAN"
658 $(OPENSSL) req -x509 -nodes -days 7300 -key server2.key -outform DER -out $@ -config authorityKeyId_subjectKeyId.conf -extensions 'v3_req' -set_serial 593828494303792449134898749208168108403991951034
661 $(OPENSSL) req -x509 -nodes -days 7300 -key server2.key -outform DER -out $@ -config authorityKeyId_subjectKeyId.conf -extensions 'v3_req_authorityKeyId_no_keyid' -set_serial 593828494303792449134898749208168108403991951034
664 $(OPENSSL) req -x509 -nodes -days 7300 -key server2.key -outform DER -out $@ -config authorityKeyId_subjectKeyId.conf -extensions 'v3_req_authorityKeyId_no_issuer'
667 $(OPENSSL) req -x509 -nodes
[all...] |
| /foundation/arkui/ace_engine/frameworks/bridge/common/dom/ |
| H A D | dom_list.cpp | 896 auto nodes = accessibilityNode->GetChildList(); in UpdateAccessibilityOrder() local
901 nodes.begin(), nodes.end(), [nodeId = item->GetNodeId()](const RefPtr<AccessibilityNode>& node) { in UpdateAccessibilityOrder()
904 if (it != nodes.end()) { in UpdateAccessibilityOrder()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | dev-replace.c | 132 eb = path->nodes[0]; in btrfs_init_dev_replace()
382 btrfs_item_size(path->nodes[0], path->slots[0]) < sizeof(*ptr)) { in btrfs_run_dev_replace()
416 eb = path->nodes[0]; in btrfs_run_dev_replace()
515 struct extent_buffer *leaf = path->nodes[0]; in mark_block_group_to_copy()
|
| /kernel/linux/linux-6.6/arch/x86/events/amd/ |
| H A D | ibs.c | 1350 int nodes; in setup_ibs_ctl() local
1353 nodes = 0; in setup_ibs_ctl()
1361 ++nodes; in setup_ibs_ctl()
1373 if (!nodes) { in setup_ibs_ctl()
1384 * success we initialize all nodes with this offset. This updates then
|
| /third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/ |
| H A D | build-ideal-tree.js | 115 // don't hold onto references for nodes that are garbage collected.
191 // from there, we start adding nodes to it to satisfy the deps requested
421 // update.names request by queueing nodes dependent on those named.
429 const nodes = this.workspaceNodes(tree, this.options.workspaces)
431 nodes.push(tree)
433 const appliedRequests = nodes.map(
445 // named nodes to the buildIdealTree queue.
450 // global updates only update the globalTop nodes, but we need to know
575 for (const node of vuln.nodes) {
602 // XXX: how to handle top nodes tha
[all...] |
| /foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/test/unittest/common/storage/ |
| H A D | distributeddb_storage_query_sync_test.cpp | 1277 std::list<QueryObjNode> nodes; in HWTEST_F() local
1279 nodes.push_back(node); in HWTEST_F()
1282 QueryObject queryObj(nodes, key, keys); in HWTEST_F()
1299 std::list<QueryObjNode> nodes; in HWTEST_F() local
1301 nodes.push_back(node); in HWTEST_F()
1304 QuerySyncObject querySyncObj1(nodes, key, keys); in HWTEST_F()
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/hisilicon/hns3/hns3pf/ |
| H A D | hclge_tm.c | 1725 struct hclge_tm_nodes_cmd *nodes; in hclge_tm_get_qset_num() local
1743 nodes = (struct hclge_tm_nodes_cmd *)desc.data; in hclge_tm_get_qset_num()
1744 *qset_num = le16_to_cpu(nodes->qset_num); in hclge_tm_get_qset_num()
1750 struct hclge_tm_nodes_cmd *nodes; in hclge_tm_get_pri_num() local
1767 nodes = (struct hclge_tm_nodes_cmd *)desc.data; in hclge_tm_get_pri_num()
1768 *pri_num = nodes->pri_num; in hclge_tm_get_pri_num()
|