Home
last modified time | relevance | path

Searched refs:nodes (Results 501 - 525 of 899) sorted by relevance

1...<<21222324252627282930>>...36

/third_party/skia/third_party/externals/swiftshader/src/Vulkan/
H A DVkDescriptorPool.hpp53 std::set<Node> nodes; member in vk::DescriptorPool
/third_party/typescript/tests/baselines/reference/
H A DneverInference.js15 nodes: Node<T>
/third_party/python/Doc/tools/extensions/
H A Dglossary_search.py12 from docutils.nodes import definition_list_item
/kernel/linux/linux-5.10/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_vm.c1662 * @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 Damdgpu_xgmi.c156 * 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 Dscrub.c424 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 Ddelayed-inode.c184 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 Dslientswitch_test.cpp475 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 Dns.c19 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()
/kernel/linux/linux-5.10/fs/ubifs/
H A Drecovery.c447 * 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...]
/kernel/linux/linux-6.6/fs/ubifs/
H A Drecovery.c447 * 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...]
/kernel/linux/linux-5.10/fs/hpfs/
H A Danode.c406 int i, j, nodes; in hpfs_truncate_btree() local
428 nodes = btree->n_used_nodes + btree->n_free_nodes; in hpfs_truncate_btree()
438 btree->n_free_nodes = nodes - btree->n_used_nodes; in hpfs_truncate_btree()
453 nodes = btree->n_used_nodes + btree->n_free_nodes; in hpfs_truncate_btree()
472 btree->n_free_nodes = nodes - btree->n_used_nodes; in hpfs_truncate_btree()
/kernel/linux/linux-5.10/fs/dlm/
H A Dconfig.c26 * /config/dlm/<cluster>/spaces/<space>/nodes/<node>/nodeid
27 * /config/dlm/<cluster>/spaces/<space>/nodes/<node>/weight
456 config_group_init_type_name(&nds->ns_group, "nodes", &nodes_type); in make_space()
839 struct dlm_config_node *nodes, *node; in dlm_config_nodes() local
855 nodes = kcalloc(count, sizeof(struct dlm_config_node), GFP_NOFS); in dlm_config_nodes()
856 if (!nodes) { in dlm_config_nodes()
861 node = nodes; in dlm_config_nodes()
873 *nodes_out = nodes; in dlm_config_nodes()
/kernel/linux/linux-6.6/fs/hpfs/
H A Danode.c406 int i, j, nodes; in hpfs_truncate_btree() local
428 nodes = btree->n_used_nodes + btree->n_free_nodes; in hpfs_truncate_btree()
438 btree->n_free_nodes = nodes - btree->n_used_nodes; in hpfs_truncate_btree()
453 nodes = btree->n_used_nodes + btree->n_free_nodes; in hpfs_truncate_btree()
472 btree->n_free_nodes = nodes - btree->n_used_nodes; in hpfs_truncate_btree()
/kernel/linux/linux-6.6/fs/dlm/
H A Dconfig.c27 * /config/dlm/<cluster>/spaces/<space>/nodes/<node>/nodeid
28 * /config/dlm/<cluster>/spaces/<space>/nodes/<node>/weight
477 config_group_init_type_name(&nds->ns_group, "nodes", &nodes_type); in make_space()
869 struct dlm_config_node *nodes, *node; in dlm_config_nodes() local
885 nodes = kcalloc(count, sizeof(struct dlm_config_node), GFP_NOFS); in dlm_config_nodes()
886 if (!nodes) { in dlm_config_nodes()
891 node = nodes; in dlm_config_nodes()
903 *nodes_out = nodes; in dlm_config_nodes()
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_priv.h361 struct kfd_node *nodes[MAX_KFD_NODES]; member
1132 return dev->nodes[0]; in kfd_node_by_irq_ids()
1135 if (kfd_irq_is_from_node(dev->nodes[i], node_id, vmid)) in kfd_node_by_irq_ids()
1136 return dev->nodes[i]; in kfd_node_by_irq_ids()
1505 return (node == node->kfd->nodes[0]); in kfd_is_first_node()
/third_party/ffmpeg/libavcodec/
H A Dvp6.c256 /* nodes must ascend by count, but with descending symbol order */
266 Node nodes[2*VP6_MAX_HUFF_SIZE], *tmp = &nodes[size]; in vp6_build_huff_tree() local
274 nodes[map[2*i ]].count = a + !a; in vp6_build_huff_tree()
275 nodes[map[2*i+1]].count = b + !b; in vp6_build_huff_tree()
281 nodes, vp6_huff_cmp, in vp6_build_huff_tree()
/third_party/node/deps/v8/third_party/jinja2/
H A Denvironment.py13 from . import nodes namespace
48 from .nodes import EvalContext
525 tree of nodes is used by the compiler to convert the template into
680 body = [nodes.Assign(nodes.Name("result", "store"), expr, lineno=1)]
681 template = self.from_string(nodes.Template(body, lineno=1))
/third_party/node/tools/inspector_protocol/jinja2/
H A Denvironment.py15 from jinja2 import nodes namespace
24 from jinja2.nodes import EvalContext
482 tree of nodes is used by the compiler to convert the template into
634 body = [nodes.Assign(nodes.Name('result', 'store'), expr, lineno=1)]
635 template = self.from_string(nodes.Template(body, lineno=1))
/third_party/ninja/src/
H A Dmanifest_parser_test.cc1053 EXPECT_EQ("could not determine root nodes of build graph", err); in TEST_F()
1068 vector<Node*> nodes = state.DefaultNodes(&err); in TEST_F() local
1070 ASSERT_EQ(3u, nodes.size()); in TEST_F()
1071 EXPECT_EQ("a", nodes[0]->path()); in TEST_F()
1072 EXPECT_EQ("b", nodes[1]->path()); in TEST_F()
1073 EXPECT_EQ("c", nodes[2]->path()); in TEST_F()
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-regalloc.cc42 // Conditional control nodes don't cause holes themselves. So, the nearest in NearestPostDominatingHole()
90 // Compute, for all forward control nodes (i.e. excluding Return and JumpLoop) a
113 // tree, up to nodes which are holes (in this example, A, D, F and H).
302 node_it_ = block->nodes().begin(); in AllocateRegisters()
303 for (; node_it_ != block->nodes().end(); ++node_it_) { in AllocateRegisters()
573 (*block_it_)->nodes().Add(gap_move); in AddMoveBeforeCurrentNode()
574 node_it_ = (*block_it_)->nodes().end(); in AddMoveBeforeCurrentNode()
576 DCHECK_NE(node_it_, (*block_it_)->nodes().end()); in AddMoveBeforeCurrentNode()
/third_party/skia/third_party/externals/jinja2/
H A Denvironment.py13 from . import nodes namespace
48 from .nodes import EvalContext
525 tree of nodes is used by the compiler to convert the template into
680 body = [nodes.Assign(nodes.Name("result", "store"), expr, lineno=1)]
681 template = self.from_string(nodes.Template(body, lineno=1))
/third_party/protobuf/src/google/protobuf/util/
H A Dfield_mask_util.cc265 // by all leaf nodes descended from "node" to mask.
269 // Merge all leaf nodes of a sub-tree to another tree.
364 std::vector<Node*> nodes(parts.size()); in RemovePath()
369 nodes[i] = node; in RemovePath()
377 // If add any new nodes, cleanup. in RemovePath()
403 delete nodes[i]->children[parts[i]]; in RemovePath()
404 nodes[i]->children.erase(parts[i]); in RemovePath()
405 if (!nodes[i]->children.empty()) { in RemovePath()
432 // Now we found a matching node with the given path. Add all leaf nodes in IntersectPath()
/foundation/arkui/ace_engine/frameworks/core/components_ng/base/
H A Dinspector.h53 static void GetOffScreenTreeNodes(InspectorTreeMap& nodes);
/foundation/window/window_manager/wmserver/include/
H A Ddisplay_zoom_controller.h36 void ClearZoomTransform(std::vector<sptr<WindowNode>> nodes);

Completed in 32 milliseconds

1...<<21222324252627282930>>...36