| /kernel/linux/linux-5.10/drivers/gpu/drm/amd/amdkfd/ |
| H A D | kfd_chardev.c | 934 uint32_t nodes = 0; in kfd_ioctl_get_process_apertures_new() local 940 /* Return number of nodes, so that user space can alloacate in kfd_ioctl_get_process_apertures_new() 959 * nodes, but not more than args->num_of_nodes as that is in kfd_ioctl_get_process_apertures_new() 978 pa[nodes].gpu_id = pdd->dev->id; in kfd_ioctl_get_process_apertures_new() 979 pa[nodes].lds_base = pdd->lds_base; in kfd_ioctl_get_process_apertures_new() 980 pa[nodes].lds_limit = pdd->lds_limit; in kfd_ioctl_get_process_apertures_new() 981 pa[nodes].gpuvm_base = pdd->gpuvm_base; in kfd_ioctl_get_process_apertures_new() 982 pa[nodes].gpuvm_limit = pdd->gpuvm_limit; in kfd_ioctl_get_process_apertures_new() 983 pa[nodes].scratch_base = pdd->scratch_base; in kfd_ioctl_get_process_apertures_new() 984 pa[nodes] in kfd_ioctl_get_process_apertures_new() [all...] |
| /kernel/linux/linux-5.10/kernel/power/ |
| H A D | snapshot.c | 329 * two linked lists for the nodes of the tree, one for the inner nodes and 330 * one for the leave nodes. The linked leave nodes are used for fast linear 343 * struct rtree_node is a wrapper struct to link the nodes 358 struct list_head nodes; /* Radix Tree inner nodes */ member 397 * This function is used to allocate inner nodes as well as the 398 * leave nodes of the radix tree. It also adds the node to the 423 * The leave nodes nee 1172 unsigned int rtree, nodes; snapshot_additional_pages() local [all...] |
| /kernel/linux/linux-6.6/kernel/power/ |
| H A D | snapshot.c | 363 * two linked lists for the nodes of the tree, one for the inner nodes and 364 * one for the leave nodes. The linked leave nodes are used for fast linear 377 * struct rtree_node is a wrapper struct to link the nodes 392 struct list_head nodes; /* Radix Tree inner nodes */ member 436 * This function is used to allocate inner nodes as well as the 437 * leave nodes of the radix tree. It also adds the node to the 462 * The leave nodes nee 1228 unsigned int rtree, nodes; snapshot_additional_pages() local [all...] |
| /kernel/linux/linux-5.10/drivers/md/ |
| H A D | md-cluster.h | 13 int (*join)(struct mddev *mddev, int nodes);
|
| /kernel/linux/linux-5.10/drivers/misc/sgi-gru/ |
| H A D | grulib.h | 148 int nodes; member
|
| /kernel/linux/linux-5.10/drivers/net/wireless/ath/ath9k/ |
| H A D | dynack.h | 64 * @nodes: ath_node linked list 74 struct list_head nodes; member
|
| /kernel/linux/linux-6.6/drivers/misc/sgi-gru/ |
| H A D | grulib.h | 148 int nodes; member
|
| /kernel/linux/linux-6.6/include/linux/ |
| H A D | memory-tiers.h | 29 nodemask_t nodes; member
|
| /kernel/linux/linux-6.6/drivers/net/wireless/ath/ath9k/ |
| H A D | dynack.h | 64 * @nodes: ath_node linked list 74 struct list_head nodes; member
|
| /kernel/linux/linux-6.6/drivers/interconnect/imx/ |
| H A D | imx.h | 103 struct imx_icc_node_desc *nodes,
|
| /kernel/linux/linux-6.6/drivers/md/ |
| H A D | md-cluster.h | 13 int (*join)(struct mddev *mddev, int nodes);
|
| /third_party/node/deps/cares/src/lib/ |
| H A D | ares_parse_aaaa_reply.c | 97 ares__freeaddrinfo_nodes(ai.nodes); in ares_parse_aaaa_reply()
|
| H A D | ares_parse_a_reply.c | 96 ares__freeaddrinfo_nodes(ai.nodes); in ares_parse_a_reply()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| H A D | SpillPlacement.h | 49 Node *nodes = nullptr; member in llvm::SpillPlacement 69 /// List of nodes that need to be updated in ::iterate. 130 /// Return true is there are any positive nodes.
|
| /third_party/skia/third_party/externals/swiftshader/src/Vulkan/ |
| H A D | VkDescriptorPool.hpp | 53 std::set<Node> nodes; member in vk::DescriptorPool
|
| /third_party/typescript/tests/baselines/reference/ |
| H A D | neverInference.js | 15 nodes: Node<T>
|
| /third_party/python/Doc/tools/extensions/ |
| H A D | glossary_search.py | 12 from docutils.nodes import definition_list_item
|
| /kernel/linux/linux-5.10/drivers/gpu/drm/amd/amdgpu/ |
| H A D | amdgpu_vm.c | 1662 * @nodes: array of drm_mm_nodes with the MC addresses 1678 struct drm_mm_node *nodes, in amdgpu_vm_bo_split_mapping() 1699 if (nodes) { in amdgpu_vm_bo_split_mapping() 1700 while (pfn >= nodes->size) { in amdgpu_vm_bo_split_mapping() 1701 pfn -= nodes->size; in amdgpu_vm_bo_split_mapping() 1702 ++nodes; in amdgpu_vm_bo_split_mapping() 1712 if (nodes) { in amdgpu_vm_bo_split_mapping() 1713 addr = nodes->start << PAGE_SHIFT; in amdgpu_vm_bo_split_mapping() 1714 max_entries = min((nodes->size - pfn) * in amdgpu_vm_bo_split_mapping() 1755 if (nodes in amdgpu_vm_bo_split_mapping() 1671 amdgpu_vm_bo_split_mapping(struct amdgpu_device *adev, struct dma_resv *resv, dma_addr_t *pages_addr, struct amdgpu_vm *vm, struct amdgpu_bo_va_mapping *mapping, uint64_t flags, struct amdgpu_device *bo_adev, struct drm_mm_node *nodes, struct dma_fence **fence) amdgpu_vm_bo_split_mapping() argument 1786 struct drm_mm_node *nodes; amdgpu_vm_bo_update() local [all...] |
| H A D | amdgpu_xgmi.c | 156 * created which contains the hive ID and the list of nodes. 483 if (top->nodes[i].node_id == peer_adev->gmc.xgmi.node_id) in amdgpu_xgmi_get_hops_count() 484 return top->nodes[i].num_hops & num_hops_mask; in amdgpu_xgmi_get_hops_count() 540 top_info->nodes[count++].node_id = entry->node_id; in amdgpu_xgmi_add_device() 551 top_info->nodes[count - 1].node_id = in amdgpu_xgmi_add_device()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | scrub.c | 424 eb = swarn->path->nodes[0]; in scrub_print_warning_inode() 514 eb = path->nodes[0]; in scrub_print_common_warning() 1337 struct btrfs_fs_info *fs_info = path->nodes[0]->fs_info; in compare_extent_item_range() 1341 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in compare_extent_item_range() 1381 if (path->nodes[0]) in find_first_extent_item() 1409 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in find_first_extent_item() 1423 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { in find_first_extent_item() 1442 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in get_extent_info() 1447 *size_ret = path->nodes[0]->fs_info->nodesize; in get_extent_info() 1450 ei = btrfs_item_ptr(path->nodes[ in get_extent_info() [all...] |
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | delayed-inode.c | 184 root->nodes++; in btrfs_queue_delayed_node() 196 root->nodes--; in btrfs_dequeue_delayed_node() 711 BUG_ON(!path->nodes[0]); in btrfs_batch_insert_items() 713 leaf = path->nodes[0]; in btrfs_batch_insert_items() 746 * to sleep, so we set all locked nodes in the path to blocking locks in btrfs_batch_insert_items() 817 leaf = path->nodes[0]; in btrfs_insert_delayed_item() 861 btrfs_mark_buffer_dirty(path->nodes[0]); in btrfs_insert_delayed_items() 884 BUG_ON(!path->nodes[0]); in btrfs_batch_delete_items() 886 leaf = path->nodes[0]; in btrfs_batch_delete_items() 1040 leaf = path->nodes[ in __btrfs_update_delayed_inode() [all...] |
| /foundation/distributeddatamgr/data_share/test/native/unittest/mediadatashare_test/src/ |
| H A D | slientswitch_test.cpp | 475 std::vector<PredicateTemplateNode> nodes; in GetTemplate() local 476 nodes.emplace_back(node1); in GetTemplate() 477 nodes.emplace_back(node2); in GetTemplate() 478 Template tpl(nodes, "select name1 as name from TBL00"); in GetTemplate()
|
| /kernel/linux/linux-6.6/net/qrtr/ |
| H A D | ns.c | 19 static DEFINE_XARRAY(nodes); 76 node = xa_load(&nodes, node_id); in node_get() 88 if (xa_store(&nodes, node_id, node, GFP_KERNEL)) { in node_get() 547 xa_for_each(&nodes, node_idx, node) { in ctrl_cmd_new_lookup()
|
| /device/soc/rockchip/common/sdk_linux/fs/ubifs/ |
| H A D | recovery.c | 470 * no_more_nodes - determine if there are no more nodes in a buffer. 520 if (!list_empty(&sleb->nodes)) { in fix_unclean_leb() 523 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list); in fix_unclean_leb() 577 * drop_last_group - drop the last group of nodes. 579 * @offs: offset of dropped nodes is returned here 582 * group of nodes of the scanned LEB. 586 while (!list_empty(&sleb->nodes)) { in drop_last_group() 590 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, list); in drop_last_group() 607 * @offs: offset of dropped nodes is returned here 616 if (!list_empty(&sleb->nodes)) { in drop_last_node() [all...] |
| /kernel/linux/linux-5.10/fs/ubifs/ |
| H A D | recovery.c | 447 * no_more_nodes - determine if there are no more nodes in a buffer. 497 if (!list_empty(&sleb->nodes)) { in fix_unclean_leb() 500 snod = list_entry(sleb->nodes.prev, in fix_unclean_leb() 555 * drop_last_group - drop the last group of nodes. 557 * @offs: offset of dropped nodes is returned here 560 * group of nodes of the scanned LEB. 564 while (!list_empty(&sleb->nodes)) { in drop_last_group() 568 snod = list_entry(sleb->nodes.prev, struct ubifs_scan_node, in drop_last_group() 586 * @offs: offset of dropped nodes is returned here 595 if (!list_empty(&sleb->nodes)) { in drop_last_node() [all...] |