Home
last modified time | relevance | path

Searched refs:nodes (Results 751 - 775 of 924) sorted by relevance

1...<<31323334353637

/kernel/linux/linux-6.6/fs/jffs2/
H A Dnodemgmt.c53 * jffs2_reserve_space - request physical space to write nodes to flash
113 * of nodes. in jffs2_reserve_space()
132 * don't know, if unchecked size contains obsoleted nodes, which could give us some in jffs2_reserve_space()
134 * of nodes. in jffs2_reserve_space()
494 * Should only be used to report nodes for which space has been allocated
512 /* Allow non-obsolete nodes only to be added at the end of c->nextblock, in jffs2_add_physical_node_ref()
513 if c->nextblock is set. Note that wbuf.c will file obsolete nodes in jffs2_add_physical_node_ref()
609 function without actually obliterating any nodes or freeing in jffs2_mark_node_obsolete()
681 obliterate nodes that look obsolete. If they weren't in jffs2_mark_node_obsolete()
797 obsolete dirent nodes t in jffs2_mark_node_obsolete()
[all...]
H A Dnodelist.c220 /* Skip all the nodes which are completed before this one starts */ in jffs2_add_frag_to_fragtree()
383 /* If we now share a page with other nodes, mark either previous in jffs2_add_full_dnode_to_inode()
563 /* Pass 'c' argument to indicate that nodes should be marked obsolete as
627 ref->next_in_ino = ic->nodes; in jffs2_link_node_ref()
628 ic->nodes = ref; in jffs2_link_node_ref()
691 /* Calculate totlen from surrounding nodes or eraseblock */
H A Dnodelist.h78 scan the nodes which are listed for it and build up a proper map of
79 which nodes are currently valid. JFFSv1 always used to keep that whole
129 /* flash_offset & 3 always has to be zero, because nodes are
141 /* Dirent nodes should be REF_PRISTINE only if they are not a deletion
148 copied. If you need to do anything different to GC inode-less nodes, then
155 dirent nodes) would take more space than this does. We also keep
167 struct jffs2_raw_node_ref *nodes; member
225 we're actually building up the original map of which nodes go where,
/kernel/linux/linux-6.6/fs/ubifs/
H A Dorphan.c37 * the commit is run, are written to the orphan area in 1 or more orphan nodes.
399 * write_orph_nodes - write orphan nodes until there are no more to commit.
403 * This function writes orphan nodes for all the orphans to commit. On success,
645 list_for_each_entry(snod, &sleb->nodes, list) { in do_kill_orphans()
662 * row, the commit number written on orphan nodes will continue in do_kill_orphans()
767 * Orph nodes always start at c->orph_first and are written to each in kill_orphans()
769 * but may contain out of date orphan nodes if the unmap didn't go in kill_orphans()
772 * there are orphan nodes from the next commit (i.e. the commit did not in kill_orphans()
959 list_for_each_entry(snod, &sleb->nodes, list) { in dbg_read_orphans()
1046 dbg_cmt("total number of leaf nodes i in dbg_check_orphans()
[all...]
H A Dauth.c56 * @inhash: input hash of previous nodes
211 snod = list_first_entry(&sleb->nodes, struct ubifs_scan_node, list); in ubifs_sb_verify_signature()
/third_party/mesa3d/src/egl/drivers/dri2/
H A Dplatform_ohos.c1038 /* Handle control nodes using __DRI_DRI2_LOADER extension and GEM names in ohos_load_driver()
1183 dri2_dpy->fd = loader_open_device(device->nodes[node_type]); in ohos_open_device()
1187 __func__, device->nodes[node_type]); in ohos_open_device()
/foundation/arkui/ace_engine/adapter/ohos/osal/
H A Djs_accessibility_manager.cpp750 std::queue<NG::UINode*>& nodes, RefPtr<NG::FrameNode>& result) in FindFrameNodeByAccessibilityId()
761 nodes.push(Referenced::RawPtr(child)); in FindFrameNodeByAccessibilityId()
772 std::queue<NG::UINode*> nodes; in GetFramenodeByAccessibilityId() local
773 nodes.push(Referenced::RawPtr(root)); in GetFramenodeByAccessibilityId()
776 while (!nodes.empty()) { in GetFramenodeByAccessibilityId()
777 auto current = nodes.front(); in GetFramenodeByAccessibilityId()
778 nodes.pop(); in GetFramenodeByAccessibilityId()
783 if (FindFrameNodeByAccessibilityId(id, children, nodes, frameNodeResult)) { in GetFramenodeByAccessibilityId()
788 if (FindFrameNodeByAccessibilityId(id, children, nodes, frameNodeResult)) { in GetFramenodeByAccessibilityId()
799 if (FindFrameNodeByAccessibilityId(id, children, nodes, frameNodeResul in GetFramenodeByAccessibilityId()
749 FindFrameNodeByAccessibilityId(int64_t id, const std::list<RefPtr<NG::UINode>>& children, std::queue<NG::UINode*>& nodes, RefPtr<NG::FrameNode>& result) FindFrameNodeByAccessibilityId() argument
3963 std::queue<RefPtr<NG::UINode>> nodes; FindNodeFromRootByExtensionId() local
[all...]
/foundation/ai/neural_network_runtime/frameworks/native/neural_network_runtime/
H A Dlite_graph_to_hdi_model_v2_0.cpp1011 std::vector<OHOS::HDI::Nnrt::V2_0::Node> nodes; in LiteGraph_To_HDIModel() local
1015 // nodes in LiteGraph_To_HDIModel()
1032 nodes.emplace_back(tmp); in LiteGraph_To_HDIModel()
1083 retModel->nodes = nodes; in LiteGraph_To_HDIModel()
H A Dlite_graph_to_hdi_model_v1_0.cpp1010 std::vector<OHOS::HDI::Nnrt::V1_0::Node> nodes; in LiteGraph_To_HDIModel() local
1014 // nodes in LiteGraph_To_HDIModel()
1031 nodes.emplace_back(tmp); in LiteGraph_To_HDIModel()
1082 retModel->nodes = nodes; in LiteGraph_To_HDIModel()
/kernel/linux/linux-5.10/fs/ocfs2/cluster/
H A Dheartbeat.c56 * - o2hb_quorum_region_bitmap tracks live regions that have seen all nodes
404 printk(KERN_NOTICE "o2hb: all nodes hb write hung, maybe region %s (%s) is down.\n", in o2hb_nego_timeout()
863 * live nodes heartbeat on it. In other words, the region has been in o2hb_set_quorum_device()
864 * added to all nodes. in o2hb_set_quorum_device()
973 /* dead nodes only come to life after some number of in o2hb_check_slot()
984 mlog(ML_HEARTBEAT, "o2hb: Add node %d to live nodes " in o2hb_check_slot()
1000 /* We want to be sure that all nodes agree on the in o2hb_check_slot()
1023 /* live nodes only go dead after enough consequtive missed in o2hb_check_slot()
1036 "nodes bitmap\n", slot->ds_node_num); in o2hb_check_slot()
1068 static int o2hb_highest_node(unsigned long *nodes, in argument
1073 o2hb_lowest_node(unsigned long *nodes, int numbits) o2hb_lowest_node() argument
[all...]
/kernel/linux/linux-6.6/fs/ocfs2/cluster/
H A Dheartbeat.c54 * - o2hb_quorum_region_bitmap tracks live regions that have seen all nodes
400 printk(KERN_NOTICE "o2hb: all nodes hb write hung, maybe region %s (%pg) is down.\n", in o2hb_nego_timeout()
856 * live nodes heartbeat on it. In other words, the region has been in o2hb_set_quorum_device()
857 * added to all nodes. in o2hb_set_quorum_device()
966 /* dead nodes only come to life after some number of in o2hb_check_slot()
977 mlog(ML_HEARTBEAT, "o2hb: Add node %d to live nodes " in o2hb_check_slot()
993 /* We want to be sure that all nodes agree on the in o2hb_check_slot()
1016 /* live nodes only go dead after enough consequtive missed in o2hb_check_slot()
1029 "nodes bitmap\n", slot->ds_node_num); in o2hb_check_slot()
1061 static int o2hb_highest_node(unsigned long *nodes, in argument
1066 o2hb_lowest_node(unsigned long *nodes, int numbits) o2hb_lowest_node() argument
[all...]
/third_party/alsa-utils/topology/nhlt/intel/ssp/
H A Dssp-process.c678 node->node_id = aux->sync.nodes[i].node_id; in ssp_calculate_intern_ext()
679 node->sampling_rate = aux->sync.nodes[i].sampling_rate; in ssp_calculate_intern_ext()
1175 ssp->ssp_prm[di].aux_cfg[hwi].sync.nodes[count].node_id = node_id; in ssp_node_set_params()
1176 ssp->ssp_prm[di].aux_cfg[hwi].sync.nodes[count].sampling_rate = sampling_rate; in ssp_node_set_params()
/third_party/mesa3d/src/imagination/vulkan/
H A Dpvr_device.c309 const char *path = drm_render_device->nodes[DRM_NODE_RENDER]; in pvr_physical_device_init()
364 primary_path = drm_primary_device->nodes[DRM_NODE_PRIMARY]; in pvr_physical_device_init()
540 drm_render_device->nodes[DRM_NODE_RENDER]); in pvr_enumerate_devices()
546 drm_primary_device->nodes[DRM_NODE_PRIMARY]); in pvr_enumerate_devices()
/kernel/linux/linux-6.6/drivers/android/
H A Dbinder.c22 * (proc->threads, proc->waiting_threads, proc->nodes)
734 struct rb_node *n = proc->nodes.rb_node; in binder_get_node_ilocked()
775 struct rb_node **p = &proc->nodes.rb_node; in binder_init_node_ilocked()
807 rb_insert_color(&node->rb_node, &proc->nodes); in binder_init_node_ilocked()
947 rb_erase(&node->rb_node, &proc->nodes); in binder_dec_node_nilocked()
1006 * print nodes)
4606 rb_erase(&node->rb_node, &proc->nodes); in binder_thread_read()
5296 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) { in binder_ioctl_get_node_debug_info()
5991 int threads, nodes, incoming_refs, outgoing_refs, active_transactions; in binder_deferred_release() local
6029 nodes in binder_deferred_release()
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dscrub.c672 eb = swarn->path->nodes[0]; in scrub_print_warning_inode()
766 eb = path->nodes[0]; in scrub_print_warning()
2831 l = path->nodes[0]; in scrub_raid56_parity()
3184 l = path->nodes[0]; in scrub_stripe()
3453 btrfs_header_nritems(path->nodes[0])) { in scrub_enumerate_chunks()
3466 l = path->nodes[0]; in scrub_enumerate_chunks()
H A Dprops.c138 leaf = path->nodes[0]; in iterate_object_props()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dblock-group.c751 leaf = path->nodes[0]; in load_extent_tree_free()
783 leaf = path->nodes[0]; in load_extent_tree_free()
1984 leaf = path->nodes[0]; in read_bg_from_eb()
2514 leaf = path->nodes[0]; in btrfs_read_block_groups()
2641 leaf = path->nodes[0]; in insert_dev_extent()
3066 leaf = path->nodes[0]; in update_block_group_item()
3483 * allocate new block groups as a result of COWing nodes of the root in btrfs_write_dirty_block_groups()
4219 * needing it, as we might not need to COW all nodes/leafs from in reserve_chunk_space()
H A Dprops.c168 leaf = path->nodes[0]; in iterate_object_props()
H A Dctree.h67 * 2) It also triggers readahead for nodes;
69 * will still trigger readahead for other nodes and leaves that follow
80 * level 0 is always the leaf, and nodes[1...BTRFS_MAX_LEVEL] will point
87 struct extent_buffer *nodes[BTRFS_MAX_LEVEL]; member
97 * and to force calls to keep space in the nodes
250 * radix tree that keeps track of delayed nodes of every inode,
607 * it while holding a write lock on a leaf and often on upper level nodes
/third_party/libdrm/
H A Dxf86drm.c3277 * only device nodes in /dev/dri/ */ in drmNodeIsDRM()
3414 * only device nodes in /dev/dri/ */ in drmGetMinorNameForFD()
4019 device->nodes = (char **)ptr; in drmDeviceAlloc()
4024 device->nodes[i] = ptr; in drmDeviceAlloc()
4028 memcpy(device->nodes[type], node, max_node_length); in drmDeviceAlloc()
4468 memcpy(local_devices[i]->nodes[node_type], in drmFoldDuplicatedDevices()
4469 local_devices[j]->nodes[node_type], drmGetMaxNodeName()); in drmFoldDuplicatedDevices()
4490 if (stat(device->nodes[i], &sbuf) == 0 && in drm_device_has_rdev()
4500 * 3x64 devices nodes. That's 64 for each of primary, control and
4501 * render nodes
[all...]
/foundation/graphic/graphic_3d/lume/Lume_3D/src/gltf/
H A Dgltf2_data_structures.h675 // The skeleton nodes, used as joints in this skin.
717 BASE_NS::vector<Node*> nodes; member
/kernel/linux/linux-5.10/fs/jffs2/
H A Dnodelist.h78 scan the nodes which are listed for it and build up a proper map of
79 which nodes are currently valid. JFFSv1 always used to keep that whole
129 /* flash_offset & 3 always has to be zero, because nodes are
141 /* Dirent nodes should be REF_PRISTINE only if they are not a deletion
148 copied. If you need to do anything different to GC inode-less nodes, then
155 dirent nodes) would take more space than this does. We also keep
167 struct jffs2_raw_node_ref *nodes; member
225 we're actually building up the original map of which nodes go where,
/kernel/linux/linux-5.10/fs/dlm/
H A Ddlm_internal.h135 struct dlm_config_node *nodes; member
173 * Some internal flags are shared between the master and process nodes;
368 /* dlm_header is first element of all structs sent between nodes */
557 struct list_head ls_nodes; /* current nodes in ls */
559 int ls_num_nodes; /* number of nodes in ls */
/kernel/linux/linux-5.10/fs/ubifs/
H A Dauth.c57 * @inhash: input hash of previous nodes
212 snod = list_first_entry(&sleb->nodes, struct ubifs_scan_node, list); in ubifs_sb_verify_signature()
/kernel/linux/linux-6.6/fs/dlm/
H A Ddlm_internal.h132 struct dlm_config_node *nodes; member
169 * Some internal flags are shared between the master and process nodes;
367 /* dlm_header is first element of all structs sent between nodes */
580 struct list_head ls_nodes; /* current nodes in ls */
582 int ls_num_nodes; /* number of nodes in ls */

Completed in 56 milliseconds

1...<<31323334353637