Home
last modified time | relevance | path

Searched refs:nodes (Results 776 - 800 of 907) sorted by relevance

1...<<31323334353637

/foundation/arkui/ace_engine/test/unittest/core/common/recorder/
H A Devent_recorder_test.cpp915 std::unordered_map<std::string, std::string> nodes; in HWTEST_F() local
916 Recorder::NodeDataCache::Get().GetNodeData("", nodes); in HWTEST_F()
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/common/src/
H A Ddb_common.cpp569 // insert all nodes into res in InsertNodesByScore()
590 std::list<std::string> DBCommon::GenerateNodesByNodeWeight(const std::vector<std::string> &nodes, in GenerateNodesByNodeWeight() argument
597 for (const auto &node : nodes) { in GenerateNodesByNodeWeight()
602 // find all node which can be reached by param nodes in GenerateNodesByNodeWeight()
/kernel/linux/linux-5.10/net/tipc/
H A Dname_table.c139 * subtree. If not, it has lower > end, then nodes on in service_range_match_first()
666 /* tipc_nametbl_lookup_dst_nodes - find broadcast destination nodes
667 * - Creates list of nodes that overlap the given multicast address
671 u32 upper, struct tipc_nlist *nodes) in tipc_nametbl_lookup_dst_nodes()
685 tipc_nlist_add(nodes, p->node); in tipc_nametbl_lookup_dst_nodes()
670 tipc_nametbl_lookup_dst_nodes(struct net *net, u32 type, u32 lower, u32 upper, struct tipc_nlist *nodes) tipc_nametbl_lookup_dst_nodes() argument
/kernel/linux/linux-5.10/fs/btrfs/tests/
H A Dinode-tests.c29 path.nodes[0] = leaf; in insert_extent()
59 path.nodes[0] = leaf; in insert_inode_item_key()
/kernel/linux/linux-5.10/fs/jffs2/
H A Dgc.c214 finished checking all its nodes */ in jffs2_garbage_collect_pass()
298 pr_warn("eep. End of raw list while still supposedly nodes to GC\n"); in jffs2_garbage_collect_pass()
368 We can just copy any pristine nodes, but have in jffs2_garbage_collect_pass()
401 the alloc_sem() (for marking nodes invalid) so we must in jffs2_garbage_collect_pass()
445 the only valid nodes in the block, followed by erasure, in jffs2_garbage_collect_pass()
447 held _all_ the nodes of that inode.... never been seen but in jffs2_garbage_collect_pass()
549 frag->node->raw = f->inocache->nodes; in jffs2_garbage_collect_live()
901 /* On a medium where we can't actually mark nodes obsolete in jffs2_garbage_collect_deletion_dirent()
924 for (raw = f->inocache->nodes; raw != (void *)f->inocache; raw = raw->next_in_ino) { in jffs2_garbage_collect_deletion_dirent()
1189 circles dirtying the nodes i in jffs2_garbage_collect_dnode()
[all...]
/kernel/linux/linux-6.6/fs/jffs2/
H A Dgc.c214 finished checking all its nodes */ in jffs2_garbage_collect_pass()
298 pr_warn("eep. End of raw list while still supposedly nodes to GC\n"); in jffs2_garbage_collect_pass()
368 We can just copy any pristine nodes, but have in jffs2_garbage_collect_pass()
401 the alloc_sem() (for marking nodes invalid) so we must in jffs2_garbage_collect_pass()
445 the only valid nodes in the block, followed by erasure, in jffs2_garbage_collect_pass()
447 held _all_ the nodes of that inode.... never been seen but in jffs2_garbage_collect_pass()
549 frag->node->raw = f->inocache->nodes; in jffs2_garbage_collect_live()
901 /* On a medium where we can't actually mark nodes obsolete in jffs2_garbage_collect_deletion_dirent()
924 for (raw = f->inocache->nodes; raw != (void *)f->inocache; raw = raw->next_in_ino) { in jffs2_garbage_collect_deletion_dirent()
1189 circles dirtying the nodes i in jffs2_garbage_collect_dnode()
[all...]
/kernel/linux/linux-6.6/fs/btrfs/tests/
H A Dinode-tests.c30 path.nodes[0] = leaf; in insert_extent()
64 path.nodes[0] = leaf; in insert_inode_item_key()
/kernel/linux/linux-6.6/net/tipc/
H A Dname_table.c142 * subtree. If not, it has lower > end, then nodes on in service_range_match_first()
672 * Used on nodes which have received a multicast/broadcast message
700 /* tipc_nametbl_lookup_mcast_nodes(): look up all destination nodes matching
702 * Used on nodes which are sending out a multicast/broadcast message
703 * Returns a list of nodes, including own node if applicable
706 struct tipc_nlist *nodes) in tipc_nametbl_lookup_mcast_nodes()
720 tipc_nlist_add(nodes, p->sk.node); in tipc_nametbl_lookup_mcast_nodes()
705 tipc_nametbl_lookup_mcast_nodes(struct net *net, struct tipc_uaddr *ua, struct tipc_nlist *nodes) tipc_nametbl_lookup_mcast_nodes() argument
/third_party/mesa3d/src/egl/drivers/dri2/
H A Dplatform_android.c1485 /* Handle control nodes using __DRI_DRI2_LOADER extension and GEM names
1625 dri2_dpy->fd = loader_open_device(device->nodes[node_type]);
1628 __func__, device->nodes[node_type]);
/third_party/mesa3d/src/freedreno/vulkan/
H A Dtu_drm.c627 const char *primary_path = drm_device->nodes[DRM_NODE_PRIMARY]; in tu_drm_device_init()
628 const char *path = drm_device->nodes[DRM_NODE_RENDER]; in tu_drm_device_init()
788 mesa_logi("Found %d drm nodes", max_devices); in tu_enumerate_devices()
/third_party/mesa3d/src/panfrost/vulkan/
H A Dpanvk_device.c253 const char *path = drm_device->nodes[DRM_NODE_RENDER]; in panvk_physical_device_init()
316 master_fd = open(drm_device->nodes[DRM_NODE_PRIMARY], O_RDWR | O_CLOEXEC); in panvk_physical_device_init()
395 panvk_logi("Found %d drm nodes", max_devices); in panvk_enumerate_devices()
/third_party/node/deps/v8/src/compiler/
H A Dwasm-compiler.h210 // Abstracts details of building TurboFan graph nodes for wasm to separate
335 Node* Return(base::Vector<Node*> nodes);
425 // Utilities to manipulate sets of instance cache nodes.
706 void MemTypeToUintPtrOrOOBTrap(std::initializer_list<Node**> nodes,
721 // This type is used to collect control/effect nodes we need to merge at the
724 // control nodes to merge; the EffectPhi needs an additional input.
H A Dscheduler.cc54 // Reserve 10% more space for nodes if node splitting is enabled to try to in ComputeSchedule()
90 // Nothing to do for control nodes that have been already fixed in in InitializePlacement()
110 // Control nodes that were not control-reachable from end may float. in InitializePlacement()
126 // We only update control nodes from {kUnknown} to {kFixed}. Ideally, we in UpdatePlacement()
152 // Control nodes force coupled uses to be placed. in UpdatePlacement()
187 // Tracking use counts for fixed nodes is useless. in IncrementUnscheduledUseCount()
190 // Use count for coupled nodes is summed up on their control. in IncrementUnscheduledUseCount()
206 // Tracking use counts for fixed nodes is useless. in DecrementUnscheduledUseCount()
209 // Use count for coupled nodes is summed up on their control. in DecrementUnscheduledUseCount()
252 // basic blocks for control nodes
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dzoned.c313 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { in calculate_emulated_zone_size()
324 leaf = path->nodes[0]; in calculate_emulated_zone_size()
1265 btrfs_item_key_to_cpu(path->nodes[0], &found_key, path->slots[0]); in calculate_alloc_pointer()
H A Dfree-space-cache.c104 leaf = path->nodes[0]; in __lookup_free_space_inode()
182 leaf = path->nodes[0]; in __create_free_space_inode()
211 leaf = path->nodes[0]; in __create_free_space_inode()
768 leaf = path->nodes[0]; in __load_free_space_cache()
1166 leaf = path->nodes[0]; in update_cache_item()
2804 * Since the allocation info of tree-log nodes are not recorded in btrfs_remove_free_space()
2811 * Advance the pointer not to overwrite the tree-log nodes. in btrfs_remove_free_space()
/third_party/mesa3d/src/virtio/vulkan/
H A Dvn_renderer_virtgpu.c1596 name = dev->nodes[i]; in virtgpu_open_device()
1605 const char *primary_path = dev->nodes[DRM_NODE_PRIMARY]; in virtgpu_open_device()
1606 const char *node_path = dev->nodes[DRM_NODE_RENDER]; in virtgpu_open_device()
/third_party/selinux/libsepol/cil/src/
H A Dcil_copy_ast.c2029 if (orig->flavor == CIL_BLOCK && DATUM(data)->nodes->head != NULL) { in __cil_copy_node_helper()
2036 cil_list_append(DATUM(new->data)->nodes, CIL_NODE, new); in __cil_copy_node_helper()
2039 if (DATUM(data)->nodes->head && FLAVOR(data) != orig->flavor) { in __cil_copy_node_helper()
/kernel/linux/linux-5.10/sound/pci/hda/
H A Dpatch_hdmi.c1983 int i, nodes; in hdmi_parse_codec() local
1986 nodes = snd_hda_get_sub_nodes(codec, codec->core.afg, &start_nid); in hdmi_parse_codec()
1987 if (!start_nid || nodes < 0) { in hdmi_parse_codec()
1988 codec_warn(codec, "HDMI: failed to get afg sub nodes\n"); in hdmi_parse_codec()
2001 for (i = 0; i < nodes; i++) { in hdmi_parse_codec()
2014 for (i = 0; i < nodes; i++) { in hdmi_parse_codec()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dfree-space-cache.c73 leaf = path->nodes[0]; in __lookup_free_space_inode()
155 leaf = path->nodes[0]; in __create_free_space_inode()
184 leaf = path->nodes[0]; in __create_free_space_inode()
701 leaf = path->nodes[0]; in __load_free_space_cache()
1040 leaf = path->nodes[0]; in update_cache_item()
/kernel/linux/linux-6.6/sound/pci/hda/
H A Dpatch_hdmi.c2009 int i, nodes; in hdmi_parse_codec() local
2012 nodes = snd_hda_get_sub_nodes(codec, codec->core.afg, &start_nid); in hdmi_parse_codec()
2013 if (!start_nid || nodes < 0) { in hdmi_parse_codec()
2014 codec_warn(codec, "HDMI: failed to get afg sub nodes\n"); in hdmi_parse_codec()
2030 for (i = 0; i < nodes; i++) { in hdmi_parse_codec()
2043 for (i = 0; i < nodes; i++) { in hdmi_parse_codec()
/foundation/arkui/ace_engine/frameworks/core/components_ng/manager/drag_drop/
H A Ddrag_drop_manager.h240 void NotifyDragRegisterFrameNode(std::unordered_map<int32_t, WeakPtr<FrameNode>> nodes, DragEventType dragEventType,
/kernel/linux/linux-5.10/drivers/acpi/acpica/
H A Daclocal.h1211 u32 nodes; member
/kernel/linux/linux-5.10/drivers/md/bcache/
H A Dbcache.h63 * contain metadata (including btree nodes).
111 * free smaller than a bucket - so, that's how big our btree nodes are.
116 * bucket's gen for deleting btree nodes when we rewrite/split a node.)
118 * Anyways, btree nodes are big - big enough to be inefficient with a textbook
121 * The way this is solved is that btree nodes are internally log structured; we
150 * wrapping around. It also merges adjacent btree nodes if they're empty enough.
164 * nodes in the btree, and those writes will be mostly empty (appending at most
173 * For simplicity, we only journal updates to leaf nodes; updates to parent
174 * nodes are rare enough (since our leaf nodes ar
476 size_t nodes; global() member
[all...]
/kernel/linux/linux-5.10/fs/ubifs/
H A Dlog.c349 * reference nodes for all journal heads which will define new journal after
350 * the commit has been finished. The commit start and reference nodes are
637 * needed for commit. This function rewrites the reference nodes in the log
638 * omitting duplicates, and failed CS nodes, and leaving no gaps.
663 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_consolidate_log()
/kernel/linux/linux-6.6/drivers/memory/tegra/
H A Dtegra20.c400 list_for_each_entry(node, &mc->provider.nodes, node_list) { in tegra20_mc_of_icc_xlate_extended()

Completed in 58 milliseconds

1...<<31323334353637