Home
last modified time | relevance | path

Searched refs:nodes (Results 201 - 225 of 823) sorted by relevance

12345678910>>...33

/third_party/node/deps/openssl/openssl/crypto/x509/
H A Dpcy_lib.c67 if (level->nodes) in X509_policy_level_node_count()
68 n += sk_X509_POLICY_NODE_num(level->nodes); in X509_policy_level_node_count()
81 return sk_X509_POLICY_NODE_value(level->nodes, i); in X509_policy_level_get0_node()
/third_party/openssl/crypto/x509/
H A Dpcy_lib.c67 if (level->nodes) in X509_policy_level_node_count()
68 n += sk_X509_POLICY_NODE_num(level->nodes); in X509_policy_level_node_count()
81 return sk_X509_POLICY_NODE_value(level->nodes, i); in X509_policy_level_get0_node()
/kernel/linux/linux-5.10/tools/testing/selftests/net/
H A Dreuseport_bpf_numa.c231 int *rcv_fd, nodes; in main() local
236 nodes = numa_max_node() + 1; in main()
238 rcv_fd = calloc(nodes, sizeof(int)); in main()
243 test(rcv_fd, nodes, AF_INET, SOCK_DGRAM); in main()
246 test(rcv_fd, nodes, AF_INET6, SOCK_DGRAM); in main()
249 test(rcv_fd, nodes, AF_INET, SOCK_STREAM); in main()
252 test(rcv_fd, nodes, AF_INET6, SOCK_STREAM); in main()
/kernel/linux/linux-6.6/drivers/interconnect/qcom/
H A Dosm-l3.c49 * struct qcom_osm_l3_node - Qualcomm specific interconnect nodes
51 * @links: an array of nodes where we can go next while traversing
65 const struct qcom_osm_l3_node * const *nodes; member
103 .nodes = osm_l3_nodes,
111 .nodes = epss_l3_nodes,
119 .nodes = epss_l3_nodes,
230 qnodes = desc->nodes; in qcom_osm_l3_probe()
233 data = devm_kzalloc(&pdev->dev, struct_size(data, nodes, num_nodes), GFP_KERNEL); in qcom_osm_l3_probe()
264 data->nodes[i] = node; in qcom_osm_l3_probe()
/kernel/linux/linux-6.6/tools/testing/selftests/net/
H A Dreuseport_bpf_numa.c235 int *rcv_fd, nodes; in main() local
240 nodes = numa_max_node() + 1; in main()
242 rcv_fd = calloc(nodes, sizeof(int)); in main()
247 test(rcv_fd, nodes, AF_INET, SOCK_DGRAM); in main()
250 test(rcv_fd, nodes, AF_INET6, SOCK_DGRAM); in main()
253 test(rcv_fd, nodes, AF_INET, SOCK_STREAM); in main()
256 test(rcv_fd, nodes, AF_INET6, SOCK_STREAM); in main()
/test/xts/hats/ai/nnrt/hdi/v2_0/nnrtFunctionTest_additional/src/
H A Dhdi_device_test.cpp292 for (auto &node : iModel->nodes) { in HWTEST_F()
323 for (auto &node : iModel->nodes) { in HWTEST_F()
354 for (auto &node : iModel->nodes) { in HWTEST_F()
385 for (auto &node : iModel->nodes) { in HWTEST_F()
416 for (auto &node : iModel->nodes) { in HWTEST_F()
447 for (auto &node : iModel->nodes) { in HWTEST_F()
478 for (auto &node : iModel->nodes) { in HWTEST_F()
509 for (auto &node : iModel->nodes) { in HWTEST_F()
540 for (auto &node : iModel->nodes) { in HWTEST_F()
571 for (auto &node : iModel->nodes) { in HWTEST_F()
[all...]
/kernel/linux/linux-6.6/drivers/clk/zynqmp/
H A Dclk-mux-zynqmp.c127 * @nodes: Clock topology node
134 const struct clock_topology *nodes) in zynqmp_clk_register_mux()
146 if (nodes->type_flag & CLK_MUX_READ_ONLY) in zynqmp_clk_register_mux()
151 init.flags = zynqmp_clk_map_common_ccf_flags(nodes->flag); in zynqmp_clk_register_mux()
155 mux->flags = zynqmp_clk_map_mux_ccf_flags(nodes->type_flag); in zynqmp_clk_register_mux()
131 zynqmp_clk_register_mux(const char *name, u32 clk_id, const char * const *parents, u8 num_parents, const struct clock_topology *nodes) zynqmp_clk_register_mux() argument
H A Dclkc.c65 * @node: Clock topology nodes
66 * @num_nodes: Number of nodes present in topology
125 const struct clock_topology *nodes)
255 * other nodes, master should call same API in loop with new
257 * index 0 which will return nodes 0,1 and 2. Next call, index
258 * should be 3 which will return nodes 3,4 and 5 and so on.
306 * @nodes: Clock topology node
313 const struct clock_topology *nodes) in zynqmp_clk_register_fixed_factor()
332 flag = zynqmp_clk_map_common_ccf_flags(nodes->flag); in zynqmp_clk_register_fixed_factor()
406 * @nnodes: Number of nodes
310 zynqmp_clk_register_fixed_factor(const char *name, u32 clk_id, const char * const *parents, u8 num_parents, const struct clock_topology *nodes) zynqmp_clk_register_fixed_factor() argument
593 struct clock_topology *nodes; zynqmp_register_clk_topology() local
[all...]
/third_party/ltp/testcases/kernel/syscalls/migrate_pages/
H A Dmigrate_pages03.c42 static int *nodes; variable
55 if (get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes) < 0) in setup()
71 set_bit(new_nodes[0], nodes[0], 1); in setup()
72 set_bit(new_nodes[1], nodes[1], 1); in setup()
/kernel/linux/linux-5.10/drivers/clk/zynqmp/
H A Dclkc.c64 * @node: Clock topology nodes
65 * @num_nodes: Number of nodes present in topology
124 const struct clock_topology *nodes)
250 * other nodes, master should call same API in loop with new
252 * index 0 which will return nodes 0,1 and 2. Next call, index
253 * should be 3 which will return nodes 3,4 and 5 and so on.
281 * @nodes: Clock topology node
288 const struct clock_topology *nodes) in zynqmp_clk_register_fixed_factor()
308 nodes->flag, mult, in zynqmp_clk_register_fixed_factor()
378 * @nnodes: Number of nodes
285 zynqmp_clk_register_fixed_factor(const char *name, u32 clk_id, const char * const *parents, u8 num_parents, const struct clock_topology *nodes) zynqmp_clk_register_fixed_factor() argument
565 struct clock_topology *nodes; zynqmp_register_clk_topology() local
[all...]
/kernel/linux/linux-5.10/drivers/interconnect/qcom/
H A Dqcs404.c121 * struct qcom_icc_node - Qualcomm specific interconnect nodes
124 * @links: an array of nodes where we can go next while traversing
143 struct qcom_icc_node **nodes; member
244 .nodes = qcs404_bimc_nodes,
298 .nodes = qcs404_pcnoc_nodes,
326 .nodes = qcs404_snoc_nodes,
347 list_for_each_entry(n, &provider->nodes, node_list) in qcom_icc_set()
420 qnodes = desc->nodes; in qnoc_probe()
427 data = devm_kzalloc(dev, struct_size(data, nodes, num_nodes), in qnoc_probe()
447 INIT_LIST_HEAD(&provider->nodes); in qnoc_probe()
[all...]
H A Dsm8250.c220 .nodes = aggre1_noc_nodes,
250 .nodes = aggre2_noc_nodes,
267 .nodes = compute_noc_nodes,
333 .nodes = config_noc_nodes,
349 .nodes = dc_noc_nodes,
383 .nodes = gem_noc_nodes,
399 .nodes = ipa_virt_nodes,
416 .nodes = mc_virt_nodes,
446 .nodes = mmss_noc_nodes,
472 .nodes
[all...]
H A Dsm8150.c206 .nodes = aggre1_noc_nodes,
241 .nodes = aggre2_noc_nodes,
259 .nodes = camnoc_virt_nodes,
276 .nodes = compute_noc_nodes,
344 .nodes = config_noc_nodes,
360 .nodes = dc_noc_nodes,
395 .nodes = gem_noc_nodes,
411 .nodes = ipa_virt_nodes,
428 .nodes = mc_virt_nodes,
458 .nodes
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Ddir-item.c43 leaf = path->nodes[0]; in insert_with_overflow()
83 leaf = path->nodes[0]; in btrfs_insert_xattr_item()
95 btrfs_mark_buffer_dirty(path->nodes[0]); in btrfs_insert_xattr_item()
144 leaf = path->nodes[0]; in btrfs_insert_dir_item()
249 leaf = path->nodes[0]; in btrfs_check_dir_item_collision()
314 leaf = path->nodes[0]; in btrfs_search_dir_index_item()
324 leaf = path->nodes[0]; in btrfs_search_dir_index_item()
382 leaf = path->nodes[0]; in btrfs_match_dir_item_name()
418 leaf = path->nodes[0]; in btrfs_delete_one_dir_name()
/kernel/linux/linux-6.6/mm/
H A Dmemory-tiers.c23 /* All the nodes that are part of all the lower memory tiers. */
53 * Node 0 & 1 are CPU + DRAM nodes, node 2 & 3 are PMEM nodes.
72 * Node 0 & 1 are CPU + DRAM nodes, node 2 is memory-only DRAM node.
88 * Node 0 is CPU + DRAM nodes, Node 1 is HBM node, node 2 is PMEM node.
115 nodemask_t nodes = NODE_MASK_NONE; in get_memtier_nodemask() local
119 nodes_or(nodes, nodes, memtype->nodes); in get_memtier_nodemask()
121 return nodes; in get_memtier_nodemask()
[all...]
/third_party/node/deps/cares/src/lib/
H A Dares_getaddrinfo.c277 status = ares_append_ai_node(AF_INET, port, 0, &addr4, &ai->nodes); in fake_addrinfo()
291 status = ares_append_ai_node(AF_INET6, port, 0, &addr6, &ai->nodes); in fake_addrinfo()
320 ai->nodes->ai_socktype = hints->ai_socktype; in fake_addrinfo()
321 ai->nodes->ai_protocol = hints->ai_protocol; in fake_addrinfo()
333 if (!(hquery->hints.ai_flags & ARES_AI_NOSORT) && hquery->ai->nodes) { in end_hquery()
334 sentinel.ai_next = hquery->ai->nodes; in end_hquery()
336 hquery->ai->nodes = sentinel.ai_next; in end_hquery()
338 next = hquery->ai->nodes; in end_hquery()
511 if (addinfostatus == ARES_EBADRESP && hquery->ai->nodes) { in host_callback()
518 } else if (hquery->ai->nodes) { in host_callback()
[all...]
H A Dares__addrinfo2hostent.c76 if (family == AF_UNSPEC && ai->nodes) { in ares__addrinfo2hostent()
77 family = ai->nodes->ai_family; in ares__addrinfo2hostent()
90 next = ai->nodes; in ares__addrinfo2hostent()
164 for (next = ai->nodes; next != NULL; next = next->ai_next) { in ares__addrinfo2hostent()
243 for (next = ai->nodes; next != NULL; next = next->ai_next) { in ares__addrinfo2addrttl()
/third_party/ltp/testcases/kernel/syscalls/move_pages/
H A Dmove_pages12.c116 int *nodes, *status; in do_child() local
121 nodes = SAFE_MALLOC(sizeof(int) * test_pages); in do_child()
130 nodes[j] = node1; in do_child()
132 nodes[j] = node2; in do_child()
137 pages, nodes, status, MPOL_MF_MOVE_ALL)); in do_child()
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DRangeTreeConverterTest.java46 assertThat(nfa.nodes()).hasSize(4); in testSimple()
60 assertThat(nfa.nodes()).hasSize(4); in testWithOptionalEdge()
74 assertThat(nfa.nodes()).hasSize(4); in testWithEpsilon()
77 // One of the out nodes should be the terminal. in testWithEpsilon()
93 assertThat(nfa.nodes()).hasSize(5); in testMultiplePathsWithCommonTail()
113 assertThat(nfa.nodes()).hasSize(3); in testOptionalTopLevelGroup_bug_69101586()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dsend.c100 * maple tree's internal nodes, is 24K.
166 * don't operate on stale extent buffers for nodes (level >= 1) or on
946 ii = btrfs_item_ptr(path->nodes[0], path->slots[0], in get_inode_info()
948 info->size = btrfs_inode_size(path->nodes[0], ii); in get_inode_info()
949 info->gen = btrfs_inode_generation(path->nodes[0], ii); in get_inode_info()
950 info->mode = btrfs_inode_mode(path->nodes[0], ii); in get_inode_info()
951 info->uid = btrfs_inode_uid(path->nodes[0], ii); in get_inode_info()
952 info->gid = btrfs_inode_gid(path->nodes[0], ii); in get_inode_info()
953 info->rdev = btrfs_inode_rdev(path->nodes[0], ii); in get_inode_info()
954 info->nlink = btrfs_inode_nlink(path->nodes[ in get_inode_info()
[all...]
/kernel/linux/linux-5.10/lib/
H A Dobjagg.c506 * only roots and leafs nodes. Leaf nodes are called deltas.
507 * But in general, this can be easily extended for intermediate nodes.
509 * nodes.
705 struct objagg_tmp_node *nodes; member
737 struct objagg_tmp_node *node = &graph->nodes[index]; in objagg_tmp_graph_node_weight()
741 /* Node weight is sum of node users and all other nodes users in objagg_tmp_graph_node_weight()
748 node = &graph->nodes[j]; in objagg_tmp_graph_node_weight()
765 node = &graph->nodes[i]; in objagg_tmp_graph_node_max_weight()
791 graph->nodes in objagg_tmp_graph_create()
[all...]
/kernel/linux/linux-6.6/lib/
H A Dobjagg.c506 * only roots and leafs nodes. Leaf nodes are called deltas.
507 * But in general, this can be easily extended for intermediate nodes.
509 * nodes.
705 struct objagg_tmp_node *nodes; member
737 struct objagg_tmp_node *node = &graph->nodes[index]; in objagg_tmp_graph_node_weight()
741 /* Node weight is sum of node users and all other nodes users in objagg_tmp_graph_node_weight()
748 node = &graph->nodes[j]; in objagg_tmp_graph_node_weight()
765 node = &graph->nodes[i]; in objagg_tmp_graph_node_max_weight()
790 graph->nodes in objagg_tmp_graph_create()
[all...]
/kernel/linux/linux-5.10/drivers/gpu/drm/amd/amdgpu/
H A Dta_xgmi_if.h92 struct ta_xgmi_node_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member
97 struct ta_xgmi_node_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member
102 struct ta_xgmi_node_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member
/kernel/linux/linux-5.10/drivers/interconnect/imx/
H A Dimx8mm.c35 static struct imx_icc_node_desc nodes[] = { variable
86 return imx_icc_register(pdev, nodes, ARRAY_SIZE(nodes)); in imx8mm_icc_probe()
H A Dimx8mq.c33 static struct imx_icc_node_desc nodes[] = { variable
85 return imx_icc_register(pdev, nodes, ARRAY_SIZE(nodes)); in imx8mq_icc_probe()

Completed in 22 milliseconds

12345678910>>...33