Home
last modified time | relevance | path

Searched refs:nodes (Results 176 - 200 of 924) sorted by relevance

12345678910>>...37

/kernel/linux/linux-6.6/drivers/gpu/drm/nouveau/nvkm/core/
H A Dmm.c26 #define node(root, dir) ((root)->nl_entry.dir == &mm->nodes) ? NULL : \
36 list_for_each_entry(node, &mm->nodes, nl_entry) { in nvkm_mm_dump()
246 prev = list_last_entry(&mm->nodes, typeof(*node), nl_entry); in nvkm_mm_init()
255 list_add_tail(&node->nl_entry, &mm->nodes); in nvkm_mm_init()
259 INIT_LIST_HEAD(&mm->nodes); in nvkm_mm_init()
275 list_add_tail(&node->nl_entry, &mm->nodes); in nvkm_mm_init()
286 int nodes = 0; in nvkm_mm_fini() local
291 list_for_each_entry(node, &mm->nodes, nl_entry) { in nvkm_mm_fini()
293 if (++nodes > mm->heap_nodes) { in nvkm_mm_fini()
300 list_for_each_entry_safe(node, temp, &mm->nodes, nl_entr in nvkm_mm_fini()
[all...]
/third_party/icu/icu4c/source/i18n/
H A Dcollationbuilder.cpp206 rootPrimaryIndexes(errorCode), nodes(errorCode) { in CollationBuilder()
326 int64_t node = nodes.elementAti(index); in addReset()
328 // then skip backwards over this and further "weaker" nodes. in addReset()
331 node = nodes.elementAti(index); in addReset()
361 // Tailor after the last node between adjacent root nodes. in addReset()
363 node = nodes.elementAti(index); in addReset()
376 node = nodes.elementAti(index); in addReset()
398 node = nodes.elementAti(i); in addReset()
412 // Skip weaker nodes and same-level tailored nodes in addReset()
833 binarySearchForRootPrimaryNode(const int32_t *rootPrimaryIndexes, int32_t length, const int64_t *nodes, uint32_t p) binarySearchForRootPrimaryNode() argument
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dcollationbuilder.cpp206 rootPrimaryIndexes(errorCode), nodes(errorCode) { in CollationBuilder()
326 int64_t node = nodes.elementAti(index); in addReset()
328 // then skip backwards over this and further "weaker" nodes. in addReset()
331 node = nodes.elementAti(index); in addReset()
361 // Tailor after the last node between adjacent root nodes. in addReset()
363 node = nodes.elementAti(index); in addReset()
376 node = nodes.elementAti(index); in addReset()
398 node = nodes.elementAti(i); in addReset()
412 // Skip weaker nodes and same-level tailored nodes in addReset()
833 binarySearchForRootPrimaryNode(const int32_t *rootPrimaryIndexes, int32_t length, const int64_t *nodes, uint32_t p) binarySearchForRootPrimaryNode() argument
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dcollationbuilder.cpp212 rootPrimaryIndexes(errorCode), nodes(errorCode) { in CollationBuilder()
324 int64_t node = nodes.elementAti(index); in addReset()
326 // then skip backwards over this and further "weaker" nodes. in addReset()
329 node = nodes.elementAti(index); in addReset()
359 // Tailor after the last node between adjacent root nodes. in addReset()
361 node = nodes.elementAti(index); in addReset()
374 node = nodes.elementAti(index); in addReset()
396 node = nodes.elementAti(i); in addReset()
410 // Skip weaker nodes and same-level tailored nodes in addReset()
827 binarySearchForRootPrimaryNode(const int32_t *rootPrimaryIndexes, int32_t length, const int64_t *nodes, uint32_t p) binarySearchForRootPrimaryNode() argument
[all...]
/kernel/linux/linux-6.6/Documentation/sphinx/
H A Dkerneldoc.py37 from docutils import nodes, statemachine namespace
125 return [nodes.error(None, nodes.paragraph(text = "kernel-doc missing"))]
145 node = nodes.section()
153 return [nodes.error(None, nodes.paragraph(text = "kernel-doc missing"))]
/third_party/node/deps/npm/lib/utils/
H A Dsbom-spdx.js22 const spdxOutput = ({ npm, nodes, packageType }) => {
23 const rootNode = nodes.find(node => node.isRoot)
24 const childNodes = nodes.filter(node => !node.isRoot && !node.isLink)
31 for (let node of nodes) {
42 // Filter out edges that are linking to nodes not in the list
43 .filter(edge => nodes.find(n => n === edge.to))
50 const extraRelationships = nodes.filter(node => node.extraneous)
90 /* For workspace nodes, use the location from their linkNode */
H A Dsbom-cyclonedx.js29 const cyclonedxOutput = ({ npm, nodes, packageType, packageLockOnly }) => {
30 const rootNode = nodes.find(node => node.isRoot)
31 const childNodes = nodes.filter(node => !node.isRoot && !node.isLink)
36 for (let node of nodes) {
45 deps.push(toCyclonedxDependency(node, nodes))
170 const toCyclonedxDependency = (node, nodes) => {
174 // Filter out edges that are linking to nodes not in the list
175 .filter(edge => nodes.find(n => n === edge.to))
/kernel/linux/linux-5.10/drivers/interconnect/imx/
H A Dimx.c169 list_for_each_entry_safe(node, tmp, &provider->nodes, node_list) in imx_icc_unregister_nodes()
192 provider_data->nodes[node->id] = node; in imx_icc_register_nodes()
212 static int get_max_node_id(struct imx_icc_node_desc *nodes, int nodes_count) in get_max_node_id() argument
217 if (nodes[i].id > ret) in get_max_node_id()
218 ret = nodes[i].id; in get_max_node_id()
224 struct imx_icc_node_desc *nodes, int nodes_count) in imx_icc_register()
232 /* icc_onecell_data is indexed by node_id, unlike nodes param */ in imx_icc_register()
233 num_nodes = get_max_node_id(nodes, nodes_count) + 1; in imx_icc_register()
234 data = devm_kzalloc(dev, struct_size(data, nodes, num_nodes), in imx_icc_register()
256 ret = imx_icc_register_nodes(provider, nodes, nodes_coun in imx_icc_register()
223 imx_icc_register(struct platform_device *pdev, struct imx_icc_node_desc *nodes, int nodes_count) imx_icc_register() argument
[all...]
/kernel/linux/linux-6.6/drivers/interconnect/imx/
H A Dimx.c212 list_for_each_entry_safe(node, tmp, &provider->nodes, node_list) in imx_icc_unregister_nodes()
238 provider_data->nodes[node->id] = node; in imx_icc_register_nodes()
258 static int get_max_node_id(struct imx_icc_node_desc *nodes, int nodes_count) in get_max_node_id() argument
263 if (nodes[i].id > ret) in get_max_node_id()
264 ret = nodes[i].id; in get_max_node_id()
270 struct imx_icc_node_desc *nodes, int nodes_count, in imx_icc_register()
280 /* icc_onecell_data is indexed by node_id, unlike nodes param */ in imx_icc_register()
281 num_nodes = get_max_node_id(nodes, nodes_count) + 1; in imx_icc_register()
282 data = devm_kzalloc(dev, struct_size(data, nodes, num_nodes), in imx_icc_register()
312 ret = imx_icc_register_nodes(imx_provider, nodes, nodes_coun in imx_icc_register()
269 imx_icc_register(struct platform_device *pdev, struct imx_icc_node_desc *nodes, int nodes_count, struct imx_icc_noc_setting *settings) imx_icc_register() argument
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/
H A DIntermRebuild.h16 // Walks the tree to rebuild nodes.
27 // - If multiple nodes are returned, children and post visits of the returned nodes are not
36 // If supplied, the nodes are spliced children at the spot of the original child.
45 // without modifying the visited nodes.
107 BaseResult(std::vector<TIntermNode *> &&nodes);
111 static BaseResult Multi(std::vector<TIntermNode *> &&nodes);
116 std::vector<TIntermNode *> nodes; in Multi() local
119 nodes.push_back(*nodesCurr); in Multi()
121 return std::move(nodes); in Multi()
150 Multi(std::vector<TIntermNode *> &&nodes) Multi() argument
183 Multi(std::vector<TIntermNode *> &&nodes) Multi() argument
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/
H A DIntermRebuild.h16 // Walks the tree to rebuild nodes.
27 // - If multiple nodes are returned, children and post visits of the returned nodes are not
36 // If supplied, the nodes are spliced children at the spot of the original child.
45 // without modifying the visited nodes.
107 BaseResult(std::vector<TIntermNode *> &&nodes);
111 static BaseResult Multi(std::vector<TIntermNode *> &&nodes);
116 std::vector<TIntermNode *> nodes; in Multi() local
119 nodes.push_back(*nodesCurr); in Multi()
121 return std::move(nodes); in Multi()
150 Multi(std::vector<TIntermNode *> &&nodes) Multi() argument
183 Multi(std::vector<TIntermNode *> &&nodes) Multi() argument
[all...]
/base/hiviewdfx/hicollie/frameworks/native/thread_sampler/
H A Dsample_stack_printer.cpp168 std::vector<SampleStackItem*> nodes; in Print() local
169 nodes.push_back(root_); in Print()
171 while (!nodes.empty()) { in Print()
172 SampleStackItem* back = nodes.back(); in Print()
176 nodes.pop_back(); in Print()
180 nodes.push_back(sibling); in Print()
184 nodes.push_back(child); in Print()
/kernel/linux/linux-5.10/drivers/clk/zynqmp/
H A Ddivider.c239 * @nodes: Clock topology node
247 const struct clock_topology *nodes) in zynqmp_clk_register_divider()
262 init.flags = nodes->flag & ~CLK_FRAC; in zynqmp_clk_register_divider()
267 div->is_frac = !!((nodes->flag & CLK_FRAC) | in zynqmp_clk_register_divider()
268 (nodes->custom_type_flag & CUSTOM_FLAG_CLK_FRAC)); in zynqmp_clk_register_divider()
269 div->flags = nodes->type_flag; in zynqmp_clk_register_divider()
272 div->div_type = nodes->type; in zynqmp_clk_register_divider()
278 div->max_div = zynqmp_clk_get_max_divisor(clk_id, nodes->type); in zynqmp_clk_register_divider()
243 zynqmp_clk_register_divider(const char *name, u32 clk_id, const char * const *parents, u8 num_parents, const struct clock_topology *nodes) zynqmp_clk_register_divider() argument
H A Dclk-mux-zynqmp.c100 * @nodes: Clock topology node
107 const struct clock_topology *nodes) in zynqmp_clk_register_mux()
119 if (nodes->type_flag & CLK_MUX_READ_ONLY) in zynqmp_clk_register_mux()
123 init.flags = nodes->flag; in zynqmp_clk_register_mux()
126 mux->flags = nodes->type_flag; in zynqmp_clk_register_mux()
104 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
/third_party/ltp/testcases/kernel/syscalls/migrate_pages/
H A Dmigrate_pages02.c44 static int *nodes, nodeA, nodeB; variable
85 set_bit(old_nodes, nodes[i], 1); in migrate_to_node()
269 ret = get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes); in setup()
274 tst_brk(TCONF, "at least 2 allowed NUMA nodes" in setup()
277 * find 2 nodes, which can hold NODE_MIN_FREEMEM bytes in setup()
287 p = numa_alloc_onnode(NODE_MIN_FREEMEM, nodes[i]); in setup()
294 if (addr_on_node(p + j) != nodes[i]) in setup()
302 nodeA = nodes[i]; in setup()
304 nodeB = nodes[i]; in setup()
311 tst_brk(TCONF, "at least 2 NUMA nodes wit in setup()
[all...]
/foundation/ability/ability_base/interfaces/kits/native/view_data/src/
H A Dview_data.cpp28 constexpr const char* VIEW_DATA_NODES = "nodes";
59 nodes.clear(); in FromJsonString()
66 nodes.emplace_back(pageNodeInfo); in FromJsonString()
78 auto size = nodes.size() > NODES_SIZE_LIMIT ? NODES_SIZE_LIMIT : nodes.size(); in ToJsonString()
80 jsonNodes.emplace_back(nodes[i].ToJsonString()); in ToJsonString()
/kernel/linux/linux-6.6/drivers/interconnect/qcom/
H A Dsa8775p.c1879 .nodes = { &ebi },
1885 .nodes = { &qxm_crypto_0, &qxm_crypto_1 },
1892 .nodes = { &qnm_gemnoc_cnoc, &qnm_gemnoc_pcie },
1898 .nodes = { &qhs_ahb2phy0, &qhs_ahb2phy1,
1941 .nodes = { &qhs_qup0, &qhs_qup1,
1948 .nodes = { &xs_pcie_0, &xs_pcie_1 },
1954 .nodes = { &qxm_dsp0 },
1960 .nodes = { &qxm_dsp1 },
1967 .nodes = { &ebi },
1974 .nodes
[all...]
H A Dqdu1000.c774 .nodes = { &ebi },
780 .nodes = { &qxm_crypto },
786 .nodes = { &qhm_qpic, &qhm_qspi,
814 .nodes = { &ebi },
820 .nodes = { &qup0_core_slave, &qup1_core_slave },
826 .nodes = { &qns_llcc },
832 .nodes = { &alm_sys_tcu, &chm_apps,
844 .nodes = { &qns_gemnoc_sf },
850 .nodes = { &qhm_gic, &qxm_pimem,
859 .nodes
[all...]
H A Dsc8280xp.c1717 .nodes = { &ebi },
1723 .nodes = { &qxm_crypto },
1730 .nodes = { &qnm_gemnoc_cnoc,
1745 .nodes = { &qhs_ahb2phy0,
1818 .nodes = { &qhs_qspi,
1828 .nodes = { &qxs_imem,
1838 .nodes = { &ebi },
1845 .nodes = { &qnm_camnoc_hf,
1856 .nodes = { &qnm_rot_0,
1870 .nodes
[all...]
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/amdgpu/
H A Dta_xgmi_if.h98 struct ta_xgmi_node_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member
103 struct ta_xgmi_node_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member
108 struct ta_xgmi_peer_link_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member
113 struct ta_xgmi_node_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member
/kernel/linux/linux-5.10/drivers/base/test/
H A Dproperty-entry-test.c366 static const struct software_node nodes[] = { in pe_test_reference() local
374 .node = &nodes[0], in pe_test_reference()
378 .node = &nodes[1], in pe_test_reference()
385 PROPERTY_ENTRY_REF("ref-1", &nodes[0]), in pe_test_reference()
386 PROPERTY_ENTRY_REF("ref-2", &nodes[1], 1, 2), in pe_test_reference()
395 error = software_node_register_nodes(nodes); in pe_test_reference()
404 KUNIT_EXPECT_PTR_EQ(test, to_software_node(ref.fwnode), &nodes[0]); in pe_test_reference()
415 KUNIT_EXPECT_PTR_EQ(test, to_software_node(ref.fwnode), &nodes[1]); in pe_test_reference()
423 KUNIT_EXPECT_PTR_EQ(test, to_software_node(ref.fwnode), &nodes[1]); in pe_test_reference()
438 KUNIT_EXPECT_PTR_EQ(test, to_software_node(ref.fwnode), &nodes[ in pe_test_reference()
[all...]
/third_party/ninja/src/
H A Dninja.cc100 /// Loaded state (rules, nodes).
379 vector<Node*> nodes; in ToolGraph() local
381 if (!CollectTargetsFromArgs(argc, argv, &nodes, &err)) { in ToolGraph()
388 for (vector<Node*>::const_iterator n = nodes.begin(); n != nodes.end(); ++n) in ToolGraph()
481 int ToolTargetsList(const vector<Node*>& nodes, int depth, int indent) { in ToolTargetsList() argument
482 for (vector<Node*>::const_iterator n = nodes.begin(); in ToolTargetsList()
483 n != nodes.end(); in ToolTargetsList()
548 vector<Node*> nodes; in ToolDeps() local
550 for (vector<Node*>::const_iterator ni = deps_log_.nodes() in ToolDeps()
588 vector<Node*> nodes; ToolMissingDeps() local
753 vector<Node*> nodes; ToolCommands() local
811 vector<Node*> nodes; ToolInputs() local
[all...]
/third_party/node/deps/ngtcp2/ngtcp2/lib/
H A Dngtcp2_ksl.c154 memcpy(rblk->nodes, blk->nodes + ksl->nodelen * (blk->n - rblk->n), in ksl_split_blk()
167 * into 2 adjacent nodes. The new node is always inserted at the
185 memmove(blk->nodes + (i + 2) * ksl->nodelen, in ksl_split_node()
186 blk->nodes + (i + 1) * ksl->nodelen, in ksl_split_node()
246 * of nodes contained by |blk| is strictly less than
255 memmove(blk->nodes + (i + 1) * ksl->nodelen, blk->nodes + i * ksl->nodelen, in ksl_insert_node()
270 for (i = 0, node = (ngtcp2_ksl_node *)(void *)blk->nodes; in ksl_bsearch()
367 memmove(blk->nodes in ksl_remove_node()
[all...]
/third_party/node/deps/ngtcp2/nghttp3/lib/
H A Dnghttp3_ksl.c155 memcpy(rblk->nodes, blk->nodes + ksl->nodelen * (blk->n - rblk->n), in ksl_split_blk()
168 * into 2 adjacent nodes. The new node is always inserted at the
186 memmove(blk->nodes + (i + 2) * ksl->nodelen, in ksl_split_node()
187 blk->nodes + (i + 1) * ksl->nodelen, in ksl_split_node()
251 * of nodes contained by |blk| is strictly less than
260 memmove(blk->nodes + (i + 1) * ksl->nodelen, blk->nodes + i * ksl->nodelen, in ksl_insert_node()
276 for (i = 0, node = (nghttp3_ksl_node *)(void *)blk->nodes; in ksl_bsearch()
373 memmove(blk->nodes in ksl_remove_node()
[all...]
/base/msdp/device_status/services/interaction/drag/src/
H A Ddrag_drawing.cpp190 if (g_drawingInfo.nodes.size() <= DRAG_STYLE_INDEX) { in CheckNodesValid()
191 FI_HILOGE("The index is out of bounds, node size is %{public}zu", g_drawingInfo.nodes.size()); in CheckNodesValid()
193 } else if (g_drawingInfo.nodes.empty() || g_drawingInfo.nodes[DRAG_STYLE_INDEX] == nullptr) { in CheckNodesValid()
198 (g_drawingInfo.nodes.size() < MOUSE_NODE_MIN_COUNT)) { in CheckNodesValid()
199 FI_HILOGE("Nodes size invalid when mouse type, node size:%{public}zu", g_drawingInfo.nodes.size()); in CheckNodesValid()
203 (g_drawingInfo.nodes.size() < TOUCH_NODE_MIN_COUNT)) { in CheckNodesValid()
204 FI_HILOGE("Nodes size invalid when touchscreen type, node size:%{public}zu", g_drawingInfo.nodes.size()); in CheckNodesValid()
272 FI_HILOGE("Init drag animation data or check nodes valid failed"); in Init()
275 if (g_drawingInfo.nodes in Init()
[all...]

Completed in 23 milliseconds

12345678910>>...37