Home
last modified time | relevance | path

Searched refs:nodes (Results 901 - 925 of 958) sorted by relevance

1...<<313233343536373839

/kernel/linux/linux-5.10/fs/jffs2/
H A Dscan.c266 pr_notice("Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n"); in jffs2_scan_medium()
933 /* We can't summarise nodes we don't grok */ in jffs2_scan_eraseblock()
984 ic->nodes = (void *)ic; in jffs2_scan_make_ino_cache()
H A Dwbuf.c156 /* It has to have had some nodes or we couldn't be here */ in jffs2_block_refile()
272 /* Recover from failure to write wbuf. Recover the nodes up to the
318 /* All nodes were obsolete. Nothing to recover. */ in jffs2_wbuf_recover()
319 jffs2_dbg(1, "No non-obsolete nodes to be recovered. Just filing block bad\n"); in jffs2_wbuf_recover()
332 dbg_noderef("wbuf recover %08x-%08x (%d bytes in %d nodes)\n", in jffs2_wbuf_recover()
375 /* It wasn't. Go on and try to recover nodes complete in the wbuf */ in jffs2_wbuf_recover()
377 dbg_noderef("wbuf now recover %08x-%08x (%d bytes in %d nodes)\n", in jffs2_wbuf_recover()
489 struct jffs2_raw_node_ref **p = &ic->nodes; in jffs2_wbuf_recover()
/kernel/linux/linux-5.10/fs/ubifs/
H A Dlprops.c1113 list_for_each_entry(snod, &sleb->nodes, list) { in scan_check_cb()
1160 * nodes from an uncompleted commit due to an in scan_check_cb()
H A Dubifs.h96 * There is no notion of truncation key because truncation nodes do not exist
98 * keys for truncation nodes because the code becomes simpler. So we define
147 /* Maximum number of data nodes to bulk-read */
237 * Dirty flag bits (lpt_drty_flgs) for LPT special nodes.
293 * @list: list of scanned nodes
314 * @nodes_cnt: number of nodes scanned
315 * @nodes: list of struct ubifs_scan_node
322 struct list_head nodes; member
453 * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash)
606 * @nbranch: branches to child nodes
[all...]
/kernel/linux/linux-6.6/drivers/memory/tegra/
H A Dtegra20-emc.c960 list_for_each_entry(node, &provider->nodes, node_list) { in emc_of_icc_xlate_extended()
969 * SRC and DST nodes should have matching TAG in order to have in emc_of_icc_xlate_extended()
H A Dtegra124-emc.c1295 list_for_each_entry(node, &provider->nodes, node_list) { in emc_of_icc_xlate_extended()
1304 * SRC and DST nodes should have matching TAG in order to have in emc_of_icc_xlate_extended()
/kernel/linux/linux-6.6/fs/jffs2/
H A Dscan.c266 pr_notice("Cowardly refusing to erase blocks on filesystem with no valid JFFS2 nodes\n"); in jffs2_scan_medium()
933 /* We can't summarise nodes we don't grok */ in jffs2_scan_eraseblock()
984 ic->nodes = (void *)ic; in jffs2_scan_make_ino_cache()
H A Dwbuf.c156 /* It has to have had some nodes or we couldn't be here */ in jffs2_block_refile()
272 /* Recover from failure to write wbuf. Recover the nodes up to the
318 /* All nodes were obsolete. Nothing to recover. */ in jffs2_wbuf_recover()
319 jffs2_dbg(1, "No non-obsolete nodes to be recovered. Just filing block bad\n"); in jffs2_wbuf_recover()
332 dbg_noderef("wbuf recover %08x-%08x (%d bytes in %d nodes)\n", in jffs2_wbuf_recover()
375 /* It wasn't. Go on and try to recover nodes complete in the wbuf */ in jffs2_wbuf_recover()
377 dbg_noderef("wbuf now recover %08x-%08x (%d bytes in %d nodes)\n", in jffs2_wbuf_recover()
489 struct jffs2_raw_node_ref **p = &ic->nodes; in jffs2_wbuf_recover()
/kernel/linux/linux-6.6/fs/ntfs3/
H A Dntfs_fs.h410 struct indx_node *nodes[20]; member
/kernel/linux/linux-6.6/fs/ubifs/
H A Dlprops.c1113 list_for_each_entry(snod, &sleb->nodes, list) { in scan_check_cb()
1160 * nodes from an uncompleted commit due to an in scan_check_cb()
H A Dubifs.h98 * There is no notion of truncation key because truncation nodes do not exist
100 * keys for truncation nodes because the code becomes simpler. So we define
149 /* Maximum number of data nodes to bulk-read */
246 * Dirty flag bits (lpt_drty_flgs) for LPT special nodes.
302 * @list: list of scanned nodes
323 * @nodes_cnt: number of nodes scanned
324 * @nodes: list of struct ubifs_scan_node
331 struct list_head nodes; member
462 * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash)
615 * @nbranch: branches to child nodes
[all...]
/third_party/jinja2/
H A Dfilters.py32 from .nodes import EvalContext
/third_party/mesa3d/src/broadcom/compiler/
H A Dv3d_compiler.h817 struct v3d_ra_node_info nodes;
/third_party/mesa3d/src/intel/common/tests/
H A Dmi_builder_test.cpp181 fd = open(devices[i]->nodes[DRM_NODE_RENDER], O_RDWR | O_CLOEXEC); in SetUp()
/third_party/skia/third_party/externals/tint/tools/src/cmd/get-test-plan/
H A Dmain.go117 in addition to nodes containing a nowrap or an algorithm tag eg. <tr algorithm=...>`)
/third_party/typescript/lib/
H A DtypingsInstaller.js2634 function assertEachNode(nodes, test, message, stackCrawlMark) {
2636 assert(test === undefined || ts.every(nodes, test), message || "Unexpected node.", function () { return "Node array did not pass test '".concat(getFunctionName(test), "'."); }, stackCrawlMark || assertEachNode);
4311 // Parse tree nodes
4475 // Top-level nodes
4480 // JSDoc nodes
4524 // Transformation nodes
4920 // Build symbol name using any nodes needed, instead of just components of an entity name
7257 for (var _i = 0, _a = profile.nodes; _i < _a.length; _i++) {
[all...]
H A Dtsc.js2227 function assertEachNode(nodes, test, message, stackCrawlMark) {
2229 assert(test === undefined || ts.every(nodes, test), message || "Unexpected node.", function () { return "Node array did not pass test '".concat(getFunctionName(test), "'."); }, stackCrawlMark || assertEachNode);
4640 for (var _i = 0, _a = profile.nodes; _i < _a.length; _i++) {
12053 function createDiagnosticForNodeArray(sourceFile, nodes, message, arg0, arg1, arg2, arg3) {
12054 var start = ts.skipTrivia(sourceFile.text, nodes.pos);
12055 return createFileDiagnostic(sourceFile, start, nodes.end - start, message, arg0, arg1, arg2, arg3);
[all...]
/kernel/linux/linux-6.6/fs/f2fs/
H A Dsegment.c448 unsigned int nodes = get_pages(sbi, F2FS_DIRTY_NODES); in excess_dirty_threshold() local
456 nodes >= threshold || meta >= threshold || in excess_dirty_threshold()
459 return dents + qdata + nodes + meta + imeta > global_threshold; in excess_dirty_threshold()
/kernel/linux/linux-6.6/fs/btrfs/
H A Ddisk-io.c2126 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { in load_global_roots_objectid()
2136 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]); in load_global_roots_objectid()
4358 * and then a transaction commit runs the same delayed nodes in close_ctree()
4359 * before any delayed worker has done something with the nodes. in close_ctree()
4983 l = path->nodes[0]; in btrfs_init_root_free_objectid()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dctree.h334 * all non-leaf blocks are nodes, they hold only keys and pointers to
350 * level 0 is always the leaf, and nodes[1...BTRFS_MAX_LEVEL] will point
358 struct extent_buffer *nodes[BTRFS_MAX_LEVEL]; member
368 * and to force calls to keep space in the nodes
1118 * radix tree that keeps track of delayed nodes of every inode,
2530 * Use this if we would be adding new items, as we could split nodes as we cow
2540 * Doing a truncate or a modification won't result in new nodes or leaves, just
2789 if (p->slots[0] >= btrfs_header_nritems(p->nodes[0])) in btrfs_next_old_item()
/kernel/linux/linux-6.6/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_chardev.c769 /* Return number of nodes, so that user space can alloacate in kfd_ioctl_get_process_apertures_new()
778 * nodes, but not more than args->num_of_nodes as that is in kfd_ioctl_get_process_apertures_new()
1539 args->gpu_id = dmabuf_adev->kfd.dev->nodes[xcp_id]->id; in kfd_ioctl_get_dmabuf_info()
1541 args->gpu_id = dmabuf_adev->kfd.dev->nodes[0]->id; in kfd_ioctl_get_dmabuf_info()
2248 /* create the vm using render nodes for kfd pdd */ in criu_restore_devices()
H A Dkfd_svm.c1998 if (adev->kfd.dev->nodes[i]->xcp) in svm_range_set_max_pages()
1999 id = adev->kfd.dev->nodes[i]->xcp->id; in svm_range_set_max_pages()
3978 * regardless of the various gpu nodes. Of the remaining attributes, in svm_range_get_info()
/third_party/node/deps/v8/src/profiler/
H A Dheap-snapshot-generator.cc2418 const std::vector<std::unique_ptr<Node>>& nodes() { return nodes_; } in nodes() function in v8::internal::EmbedderGraphImpl
2505 // For V8 nodes only we can add a lookup. in MergeNodeIntoEntry()
2557 for (const auto& node : graph.nodes()) { in IterateAndExtractReferences()
2558 // Only add embedder nodes as V8 nodes have been added already by the in IterateAndExtractReferences()
2719 writer_->AddString("\"nodes\":["); in SerializeImpl()
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Dbtree.h21 // size nodes (usually 256 bytes) and doesn't store child pointers for leaf
22 // nodes. The result is that a btree_set<int32_t> may use much less memory per
34 // rebalancing of btree nodes. And even without these operations, insertions
274 // nodes, which have overhead of at least a pointer + 4 bytes (for storing
466 // and leaf nodes in the btree, though the nodes are allocated in such a way
467 // that the children array is only valid in internal nodes.
514 // // logic to allow for floating storage within nodes.
520 // // [1, kNodeSlots] for root leaf nodes, kNodeSlots for non-root leaf
521 // // nodes, an
1394 size_type nodes() const { nodes() function in absl::container_internal::btree
[all...]
/foundation/arkui/ace_engine/frameworks/core/pipeline_ng/
H A Dpipeline_context.cpp351 // SomeTimes, customNode->Update may add some dirty custom nodes to dirtyNodes_, in FlushDirtyNodeUpdate()
3968 auto nodes = FrameNode::GetNodesById(onVisibleAreaChangeNodeIds_); in HandleVisibleAreaChangeEvent() local
3969 for (auto&& frameNode : nodes) { in HandleVisibleAreaChangeEvent()
3997 auto nodes = FrameNode::GetNodesById(onAreaChangeNodeIds_); in HandleOnAreaChangeEvent() local
3998 for (auto&& frameNode : nodes) { in HandleOnAreaChangeEvent()

Completed in 129 milliseconds

1...<<313233343536373839