Home
last modified time | relevance | path

Searched refs:nodes (Results 226 - 250 of 899) sorted by relevance

12345678910>>...36

/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()
H A Dimx8mn.c32 static struct imx_icc_node_desc nodes[] = { variable
75 return imx_icc_register(pdev, nodes, ARRAY_SIZE(nodes)); in imx8mn_icc_probe()
/kernel/linux/linux-5.10/drivers/interconnect/qcom/
H A Dicc-rpmh.h50 * struct qcom_icc_node - Qualcomm specific interconnect nodes
52 * @links: an array of nodes where we can go next while traversing
76 * struct qcom_icc_bcm - Qualcomm specific hardware accelerator nodes
92 * @nodes: list of qcom_icc_nodes that this BCM encapsulates
108 struct qcom_icc_node *nodes[]; member
112 struct qcom_icc_node **nodes; member
117 struct qcom_icc_node **nodes; member
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...]
/kernel/linux/linux-6.6/drivers/interconnect/qcom/
H A Dicc-rpmh.h50 * struct qcom_icc_node - Qualcomm specific interconnect nodes
52 * @links: an array of nodes where we can go next while traversing
76 * struct qcom_icc_bcm - Qualcomm specific hardware accelerator nodes
92 * @nodes: list of qcom_icc_nodes that this BCM encapsulates
108 struct qcom_icc_node *nodes[]; member
112 struct qcom_icc_node **nodes; member
117 struct qcom_icc_node * const *nodes; member
/kernel/linux/linux-6.6/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), NULL); in imx8mm_icc_probe()
H A Dimx8mn.c32 static struct imx_icc_node_desc nodes[] = { variable
75 return imx_icc_register(pdev, nodes, ARRAY_SIZE(nodes), NULL); in imx8mn_icc_probe()
H A Dimx8mq.c33 static struct imx_icc_node_desc nodes[] = { variable
85 return imx_icc_register(pdev, nodes, ARRAY_SIZE(nodes), NULL); in imx8mq_icc_probe()
/third_party/ltp/testcases/kernel/syscalls/move_pages/
H A Dmove_pages02.c34 * 3. Retrieve the NUMA nodes of the moved pages.
90 int nodes[TEST_PAGES]; in main() local
101 nodes[i] = to_node; in main()
104 numa_move_pages(0, TEST_PAGES, pages, nodes, status, in main()
H A Dmove_pages04.c106 int nodes[TEST_PAGES]; in main() local
126 nodes[i] = to_node; in main()
128 ret = numa_move_pages(0, TEST_PAGES, pages, nodes, in main()
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/python/Lib/lib2to3/fixes/
H A Dfix_except.py30 def find_excepts(nodes):
31 for i, n in enumerate(nodes):
34 yield (n, nodes[i+2])
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/rdb/
H A Drdb_cloud.cpp77 auto [nodes, status] = ConvertQuery(extend); in Query()
79 if (status == GeneralError::E_OK && !nodes.empty()) { in Query()
81 query.SetQueryNodes(tableName, std::move(nodes)); in Query()
221 std::vector<DistributedDB::QueryNode> nodes; in ConvertQuery() local
224 nodes = DistributedDB::RelationalStoreManager::ParserQueryNodes(*bytes, status); in ConvertQuery()
230 return { ConvertQuery(std::move(nodes)), GeneralError::E_OK }; in ConvertQuery()
233 RdbCloud::QueryNodes RdbCloud::ConvertQuery(RdbCloud::DBQueryNodes&& nodes) in ConvertQuery() argument
236 queryNodes.reserve(nodes.size()); in ConvertQuery()
237 for (auto& node : nodes) { in ConvertQuery()
/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/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/drivers/clk/zynqmp/
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...]
/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...]
/foundation/communication/dsoftbus/core/common/include/
H A Dsoftbus_queue.h62 uintptr_t nodes[0]; /* queue nodes */ member
127 queue->nodes[producerHead & mask] = (uintptr_t)node; in QueueSingleProducerEnqueue()
185 queue->nodes[producerHead & mask] = (uintptr_t)node; in QueueMultiProducerEnqueue()
243 /* Prevent the read of queue->nodes before the read of ProdTail. */ in QueueSingleConsumerDequeue()
246 *node = (void *)(queue->nodes[consumerHead & mask]); in QueueSingleConsumerDequeue()
304 /* Prevent the read of queue->nodes before the read of ProdTail. */ in QueueMultiConsumerDequeue()
307 *node = (void *)(queue->nodes[consumerHead & mask]); in QueueMultiConsumerDequeue()
/third_party/node/deps/cares/src/lib/
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()
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...]
/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()
/third_party/ltp/testcases/kernel/syscalls/set_mempolicy/
H A Dset_mempolicy.h10 static inline void alloc_fault_count(struct tst_nodemap *nodes, in alloc_fault_count() argument
17 tst_nodemap_count_pages(nodes, ptr, size); in alloc_fault_count()
/foundation/graphic/graphic_3d/lume/scenewidgetplugin/plugin/src/
H A Dhierarchy_controller.cpp129 BASE_NS::vector<INode::Ptr> nodes; in GetAllNodes() local
130 auto add = [&nodes](const INode::Ptr& node) { nodes.push_back(node); }; in GetAllNodes()
135 return nodes; in GetAllNodes()

Completed in 11 milliseconds

12345678910>>...36