| /third_party/ltp/testcases/kernel/include/ |
| H A D | numa_helper.h | 34 int get_allowed_nodes_arr(int flag, int *num_nodes, int **nodes);
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx5/core/en/ |
| H A D | ptp.c | 32 struct mlx5e_ptp_port_ts_cqe_tracker *nodes; member
41 struct mlx5e_ptp_port_ts_cqe_tracker *tracker = &list->nodes[metadata]; in mlx5e_ptp_port_ts_cqe_list_add()
53 struct mlx5e_ptp_port_ts_cqe_tracker *tracker = &list->nodes[metadata]; in mlx5e_ptp_port_ts_cqe_list_remove()
191 if (likely(pending_cqe_list->nodes[metadata_id].inuse)) { in mlx5e_ptp_handle_ts_cqe()
389 cqe_list->nodes = kvzalloc_node(array_size(db_sz, sizeof(*cqe_list->nodes)), in mlx5e_ptp_alloc_traffic_db()
391 if (!cqe_list->nodes) in mlx5e_ptp_alloc_traffic_db()
404 cqe_list->nodes[md].metadata_id = md; in mlx5e_ptp_alloc_traffic_db()
421 kvfree(cqe_list->nodes); in mlx5e_ptp_alloc_traffic_db()
443 kvfree(ptpsq->ts_cqe_pending_list->nodes); in mlx5e_ptp_free_traffic_db()
[all...] |
| /foundation/window/window_manager/wmserver/src/ |
| H A D | window_controller.cpp | 298 std::vector<sptr<WindowNode>> nodes; in NotifyAfterAddWindow() local
299 nodes.emplace_back(node); in NotifyAfterAddWindow()
302 nodes.emplace_back(child); in NotifyAfterAddWindow()
305 for (auto& iter : nodes) { in NotifyAfterAddWindow()
311 accessibilityConnection_->NotifyAccessibilityWindowInfo(node->GetDisplayId(), nodes, in NotifyAfterAddWindow()
609 std::vector<sptr<WindowNode>> nodes; in RemoveWindowNode()
610 nodes.emplace_back(windowNode); in RemoveWindowNode()
612 nodes.emplace_back(child); in RemoveWindowNode()
614 for (auto& iter : nodes) { in RemoveWindowNode()
620 displayZoomController_->ClearZoomTransform(nodes); in RemoveWindowNode()
668 std::vector<sptr<WindowNode>> nodes; DestroyWindow() local
[all...] |
| /foundation/ability/ability_base/interfaces/kits/native/view_data/include/ |
| H A D | view_data.h | 27 // nodes has a limit size
29 // nodes has a limit size
36 std::vector<PageNodeInfo> nodes; member
|
| /kernel/linux/linux-5.10/tools/perf/util/ |
| H A D | cputopo.h | 25 struct numa_topology_node nodes[]; member
|
| H A D | cputopo.c | 324 tp = zalloc(sizeof(*tp) + sizeof(tp->nodes[0])*nr); in numa_topology__new()
331 if (load_numa_node(&tp->nodes[i], node_map->map[i])) { in numa_topology__new()
350 zfree(&tp->nodes[i].cpus); in numa_topology__delete()
|
| /third_party/ffmpeg/libavcodec/ |
| H A D | huffman.h | 45 Node *nodes, HuffCmp cmp, int flags);
|
| H A D | fraps.c | 78 * Comparator - our nodes should ascend by count
97 Node nodes[512]; in fraps2_decode_plane() local
100 nodes[i].count = bytestream_get_le32(&src); in fraps2_decode_plane()
103 nodes, huff_cmp, in fraps2_decode_plane()
|
| /foundation/graphic/graphic_3d/lume/LumeRender/api/render/nodecontext/ |
| H A D | intf_render_node_graph_manager.h | 62 /** Render nodes */
63 BASE_NS::vector<RenderNodeDesc> nodes; member
86 /** Render nodes */
87 BASE_NS::vector<RenderNodeDescInfo> nodes; member
105 * With dynamic render node graphs render nodes can be inserted or erased.
|
| /foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/framework/test/ |
| H A D | store_test.cpp | 58 * @tc.desc: Set and query nodes.
70 QueryNodes nodes{ in HWTEST_F()
74 query.SetQueryNodes(tableName, std::move(nodes)); in HWTEST_F()
|
| /kernel/linux/linux-5.10/Documentation/sphinx/ |
| H A D | kernel_abi.py | 44 from docutils import nodes, statemachine namespace
142 node = nodes.section()
|
| /test/xts/acts/ |
| H A D | get_dependency.py | 86 def get_all_dependencies(nodes, dependencies):
101 for node in nodes:
|
| /third_party/ltp/testcases/kernel/controllers/cpuset/cpuset_memory_spread_test/ |
| H A D | cpuset_memory_spread_testset.sh | 37 # In general, the cache hog will use more than 10000 kb slab space on the nodes
38 # on which it is running. The other nodes' slab space has littler change.(less
290 while read spread cpus nodes exp_nodes
292 base_test "$spread" "$cpus" "$nodes" "$exp_nodes"
301 # while read spread cpus nodes exp_nodes
|
| /third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/mutators/ |
| H A D | differential_fuzz_mutator.js | 136 printVariables(path, nodes) {
138 for (const node of nodes) {
176 // original source files. We detect the dummy no-op nodes that were
|
| /third_party/node/deps/v8/src/maglev/ |
| H A D | maglev-graph-processor.h | 27 // // A function that processes the graph before the nodes are walked.
30 // // A function that processes the graph after the nodes are walked.
33 // // A function that processes each basic block before its nodes are walked.
98 for (node_it_ = block->nodes().begin(); node_it_ != block->nodes().end(); in ProcessGraph()
|
| /third_party/python/Lib/ |
| H A D | graphlib.py | 21 # List of successor nodes. The list can contain duplicated elements as
33 of nodes, such that each node is, in the graph, an immediate predecessor of the
42 """Provides functionality to topologically sort a graph of hashable nodes"""
90 still be used to obtain as many nodes as possible until cycles block more
92 therefore no more nodes can be added using "add".
103 # nodes as possible before cycles block more progress
106 raise CycleError(f"nodes are in a cycle", cycle)
109 """Return a tuple of all the nodes that are ready.
111 Initially it returns all nodes with no predecessors; once those are marked
112 as processed by calling "done", further calls will return all new nodes tha
[all...] |
| /third_party/vk-gl-cts/scripts/log/ |
| H A D | log_to_xml.py | 101 def findFirstElementByName (nodes, name):
102 for node in nodes:
|
| /third_party/vk-gl-cts/framework/common/ |
| H A D | tcuLibDrm.cpp | 122 int res = stat(devices[i]->nodes[j], &statBuf); in findDeviceNode()
130 return devices[i]->nodes[j]; in findDeviceNode()
|
| /kernel/linux/linux-6.6/fs/ntfs3/ |
| H A D | index.c | 661 struct indx_node *n = fnd->nodes[i]; in fnd_clear()
667 fnd->nodes[i] = NULL; in fnd_clear()
678 if (i < 0 || i >= ARRAY_SIZE(fnd->nodes)) in fnd_push()
680 fnd->nodes[i] = n; in fnd_push()
692 n = fnd->nodes[i]; in fnd_pop()
693 fnd->nodes[i] = NULL; in fnd_pop()
1230 n = fnd->nodes[level - 1]; in indx_find_sort()
1292 n = fnd->nodes[level - 1]; in indx_find_sort()
1368 n = fnd->nodes[fnd->level - 1]; in indx_find_raw()
1789 struct indx_node *n1 = fnd->nodes[leve in indx_insert_into_buffer()
[all...] |
| /foundation/arkui/ace_engine/frameworks/core/components/split_container/ |
| H A D | render_split_container.cpp | 69 std::list<MagicLayoutNode> nodes; in InitProperties() local
70 nodes.emplace_back(node); in InitProperties()
71 magicNodes_[idx] = nodes; in InitProperties()
|
| /foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/data_share/data/ |
| H A D | template_data.cpp | 41 std::vector<PredicateTemplateNode> nodes;
in ToTemplate() local
43 nodes.emplace_back(predicate.key, predicate.selectSql);
in ToTemplate()
45 return Template(nodes, scheduler);
in ToTemplate()
|
| /kernel/linux/linux-5.10/fs/ubifs/ |
| H A D | scan.c | 13 * determining what nodes are in an eraseblock. The scan is used to replay the
138 INIT_LIST_HEAD(&sleb->nodes); in ubifs_start_scan()
150 * Note, we ignore integrity errors (EBASMSG) because all the nodes are in ubifs_start_scan()
205 * nodes. in ubifs_add_snod()
213 list_add_tail(&snod->list, &sleb->nodes); in ubifs_add_snod()
359 head = &sleb->nodes; in ubifs_scan_destroy()
|
| /kernel/linux/linux-6.6/fs/ubifs/ |
| H A D | scan.c | 13 * determining what nodes are in an eraseblock. The scan is used to replay the
138 INIT_LIST_HEAD(&sleb->nodes); in ubifs_start_scan()
150 * Note, we ignore integrity errors (EBASMSG) because all the nodes are in ubifs_start_scan()
205 * nodes. in ubifs_add_snod()
213 list_add_tail(&snod->list, &sleb->nodes); in ubifs_add_snod()
359 head = &sleb->nodes; in ubifs_scan_destroy()
|
| /test/xts/hats/ai/nnrt/hdi/v1_0/nnrtFunctionTest/src/ |
| H A D | hdi_device_test.cpp | 161 * @tc.name : 模型算子支持查询，nodes为空
173 // set nodes to empty in HWTEST_F()
174 iModel->nodes = {}; in HWTEST_F()
188 * @tc.name : 模型算子支持查询，nodes中存在NodeType为-1
201 for (auto &node : iModel->nodes) { in HWTEST_F()
220 * @tc.name : 模型算子支持查询，nodes中存在NodeType为10000
233 for (auto &node : iModel->nodes) { in HWTEST_F()
|
| /test/xts/hats/ai/nnrt/hdi/v2_0/nnrtFunctionTest/src/ |
| H A D | hdi_device_test.cpp | 161 * @tc.name : 模型算子支持查询，nodes为空
173 // set nodes to empty in HWTEST_F()
174 iModel->nodes = {}; in HWTEST_F()
188 * @tc.name : 模型算子支持查询，nodes中存在NodeType为-1
201 for (auto &node : iModel->nodes) { in HWTEST_F()
220 * @tc.name : 模型算子支持查询，nodes中存在NodeType为10000
233 for (auto &node : iModel->nodes) { in HWTEST_F()
|