Home
last modified time | relevance | path

Searched refs:nodes (Results 876 - 900 of 907) sorted by relevance

1...<<31323334353637

/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()
/kernel/linux/linux-5.10/drivers/md/
H A Dmd.c6267 mddev->bitmap_info.nodes = 0; in md_clean()
6881 * check whether the device shows up in other nodes in md_add_new_disk()
7461 if (mddev->bitmap_info.nodes) { in update_array_info()
7470 mddev->bitmap_info.nodes = 0; in update_array_info()
8466 int md_setup_cluster(struct mddev *mddev, int nodes) in md_setup_cluster() argument
8480 ret = md_cluster_ops->join(mddev, nodes); in md_setup_cluster()
9060 * so other nodes are informed. It should be harmless for normal in md_do_sync()
/kernel/linux/linux-6.6/drivers/md/
H A Dmd.c6278 mddev->bitmap_info.nodes = 0; in md_clean()
6897 * check whether the device shows up in other nodes in md_add_new_disk()
7493 if (mddev->bitmap_info.nodes) { in update_array_info()
7502 mddev->bitmap_info.nodes = 0; in update_array_info()
8528 int md_setup_cluster(struct mddev *mddev, int nodes) in md_setup_cluster() argument
8542 ret = md_cluster_ops->join(mddev, nodes); in md_setup_cluster()
9184 * so other nodes are informed. It should be harmless for normal in md_do_sync()
/kernel/linux/linux-5.10/include/linux/
H A Dsyscalls.h928 const int __user *nodes,
/kernel/linux/linux-6.6/drivers/memory/tegra/
H A Dtegra30-emc.c1478 list_for_each_entry(node, &provider->nodes, node_list) { in emc_of_icc_xlate_extended()
1487 * SRC and DST nodes should have matching TAG in order to have in emc_of_icc_xlate_extended()
/kernel/linux/linux-6.6/include/linux/
H A Dsyscalls.h822 const int __user *nodes,
/third_party/node/tools/gyp/pylib/gyp/
H A Dxcode_emulation.py1881 "Xcode environment variables are cyclically dependent: " + str(e.nodes)
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/
H A Dxcode_emulation.py1875 "Xcode environment variables are cyclically dependent: " + str(e.nodes)
/third_party/node/deps/v8/src/regexp/
H A Dregexp-compiler-tonode.cc1135 ZoneList<RegExpTree*>* children = nodes(); in RationalizeConsecutiveAtoms()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
H A DAMDILCFGStructurizer.cpp893 for (auto *MBB : nodes(MF)) { in orderBlocks()
/third_party/glfw/deps/
H A Dnuklear.h10590 /* we allocate two extra nodes so optimal user-node-count is 'width' not 'width+2' */
10616 /* so that num_nodes is always enough nodes. */ in nk_rp_setup_allow_out_of_mem()
10626 struct nk_rp_node *nodes, int num_nodes) in nk_rp_init_target()
10634 nodes[i].next = &nodes[i+1]; in nk_rp_init_target()
10635 nodes[i].next = 0; in nk_rp_init_target()
10638 context->free_head = &nodes[0]; in nk_rp_init_target()
10816 /* let 'cur' point to the remaining nodes needing to be */ in nk_rp__skyline_pack_rectangle()
10828 /* from here, traverse cur and free the nodes, until we get to one */ in nk_rp__skyline_pack_rectangle()
10970 void *nodes; member
10625 nk_rp_init_target(struct nk_rp_context *context, int width, int height, struct nk_rp_node *nodes, int num_nodes) nk_rp_init_target() argument
12263 struct nk_rp_node *nodes = (struct nk_rp_node*) nk_tt_PackBegin() local
[all...]
/foundation/arkui/ace_engine/adapter/ohos/entrance/
H A Dace_container.cpp1550 viewData.nodes = nodeInfos; in OverwritePageNodeInfo()
1573 for (const auto& info : viewData.nodes) { in GetFocusedElementRect()
/kernel/linux/linux-6.6/mm/
H A Dhugetlb.c1426 /* Fallback to all nodes if page==NULL */ in dequeue_hugetlb_folio_vma()
2256 * persistent huge pages more or less balanced over allowed nodes.
2273 * nodes with surplus pages. in remove_pool_huge_page()
2491 /* Fallback to all nodes if page==NULL */ in alloc_buddy_hugetlb_folio_with_mpol()
2657 * evenly across all nodes with memory. Iterate across these nodes in return_unused_surplus_pages()
2659 * when the nodes with surplus pages have no free pages. in return_unused_surplus_pages()
2661 * on-line nodes with memory and will handle the hstate accounting. in return_unused_surplus_pages()
4176 * devices of nodes that have memory. All on-line nodes shoul
[all...]
/third_party/mesa3d/src/intel/vulkan/
H A Danv_device.c739 const char *primary_path = drm_device->nodes[DRM_NODE_PRIMARY]; in anv_physical_device_try_create()
740 const char *path = drm_device->nodes[DRM_NODE_RENDER]; in anv_physical_device_try_create()
/third_party/node/deps/v8/src/compiler/
H A Dbytecode-graph-builder.cc82 // to visiting bytecodes, and is later passed as input to other nodes that
120 Node* NewNode(const Operator* op, Node* n0, Args... nodes) { in NewNode() argument
121 Node* buffer[] = {n0, nodes...}; in NewNode()
125 // Helpers to create new control nodes.
169 // by dedicated {Checkpoint} nodes that are wired into the effect chain.
346 // Builds loop exit nodes for every exited loop between the current bytecode
364 // new nodes.
505 // Control nodes that exit the function body.
527 // register file. The environment performs SSA-renaming of all tracked nodes at
537 // inputs to nodes representin
[all...]
H A Dwasm-compiler.cc547 // Initialize parameter nodes. in Start()
790 // We handle caching of the instance cache nodes manually, and we may reload in StackCheck()
792 // Therefore, we use plain Load nodes which are not subject to load in StackCheck()
821 // to use {effect} instead. We exclude Projection nodes: Projections pointing in PatchInStackCheckIfNeeded()
3515 // We handle caching of the instance cache nodes manually, and we may reload in InitInstanceCache()
3517 // Therefore, we use plain Load nodes which are not subject to load in InitInstanceCache()
5473 std::initializer_list<Node**> nodes, wasm::WasmCodePosition position) { in MemTypeToUintPtrOrOOBTrap()
5475 for (Node** node : nodes) { in MemTypeToUintPtrOrOOBTrap()
5482 for (Node** node : nodes) { in MemTypeToUintPtrOrOOBTrap()
5855 // Wire up the control/effect nodes
5472 MemTypeToUintPtrOrOOBTrap( std::initializer_list<Node**> nodes, wasm::WasmCodePosition position) MemTypeToUintPtrOrOOBTrap() argument
[all...]
H A Deffect-control-linearizer.cc465 // a constant). Note that there may be more Phi nodes hanging off the Merge, in TryCloneBranch()
467 // EffectPhi nodes whose uses have either the IfTrue or IfFalse as control in TryCloneBranch()
489 // The resulting graph (modulo the Phi and EffectPhi nodes) looks like this: in TryCloneBranch()
522 // Check/collect other Phi/EffectPhi nodes hanging off the Merge. in TryCloneBranch()
526 // We cannot currently deal with non-Phi/EffectPhi nodes hanging off the in TryCloneBranch()
527 // Merge. Ideally, we would just clone the nodes (and everything that in TryCloneBranch()
532 // Right now we can only handle Phi/EffectPhi nodes whose uses are in TryCloneBranch()
600 // Fix up IfTrue and IfFalse and kill all dead nodes. in TryCloneBranch()
871 // nodes inside the region (i.e. ignore the absence of kNoWrite on in ProcessNode()
884 // Special treatment for checkpoint nodes in ProcessNode()
5289 AdaptOverloadedFastCallResult nodes = AdaptOverloadedFastCallArgument( LowerFastApiCall() local
[all...]
/third_party/mesa3d/src/microsoft/compiler/
H A Dnir_to_dxil.c1512 const struct dxil_mdnode *nodes[] = { in emit_entrypoint() local
1519 return dxil_get_metadata_node(&ctx->mod, nodes, in emit_entrypoint()
1520 ARRAY_SIZE(nodes)); in emit_entrypoint()
5203 /* PHI nodes are difficult to get right when tracking the types: in prepare_phi_values()
/third_party/skia/third_party/externals/imgui/
H A Dimgui_demo.cpp491 "a window or a block. Tree nodes can be automatically expanded.\n" in ShowDemoWindow()
762 if (ImGui::TreeNode("Advanced, with Selectable nodes")) in ShowDemoWindowWidgets()
765 "This is a more typical looking tree with selectable nodes.\n" in ShowDemoWindowWidgets()
2999 ImGui::Checkbox("Tree nodes", &show_tree_nodes); // Will grow contents size and display highlight over full width in ShowDemoWindowLayout()
3607 HelpMarker("Disable the indenting of tree nodes so demo tables can use the full window width.");
4629 static const MyTreeNode nodes[] = local
4642 MyTreeNode::DisplayNode(&nodes[0], nodes);
6808 // Text and Tree nodes are less high than framed widgets, using AlignTextToFramePadding() we add vertical spacing to make the tree lines equal high.
/kernel/linux/linux-5.10/fs/ubifs/
H A Ddebug.c697 pr_err("LEB %-7d free %-8d dirty %-8d used %-8d free + dirty %-8d dark %-4d dead %-4d nodes fit %-3d flags %#-4x (", in ubifs_dump_lprop()
851 pr_err("LEB %d has %d nodes ending at %d\n", lnum, in ubifs_dump_leb()
854 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_dump_leb()
1261 ubifs_err(c, "2 xent/dent nodes with the same name"); in dbg_check_key_order()
1305 /* Only dirty zbranch may have no on-flash nodes */ in dbg_check_znode()
1621 /* Iterate over all indexing nodes */ in dbg_walk_index()
2277 * o makes sure that all leaf nodes exist and their CRCs are correct;
2281 * The function reads whole indexing tree and all nodes, so it is pretty
2313 * dbg_check_data_nodes_order - check that list of data nodes is sorted.
2315 * @head: the list of nodes ('struc
[all...]
/kernel/linux/linux-6.6/fs/ubifs/
H A Ddebug.c697 pr_err("LEB %-7d free %-8d dirty %-8d used %-8d free + dirty %-8d dark %-4d dead %-4d nodes fit %-3d flags %#-4x (", in ubifs_dump_lprop()
851 pr_err("LEB %d has %d nodes ending at %d\n", lnum, in ubifs_dump_leb()
854 list_for_each_entry(snod, &sleb->nodes, list) { in ubifs_dump_leb()
1261 ubifs_err(c, "2 xent/dent nodes with the same name"); in dbg_check_key_order()
1305 /* Only dirty zbranch may have no on-flash nodes */ in dbg_check_znode()
1621 /* Iterate over all indexing nodes */ in dbg_walk_index()
2277 * o makes sure that all leaf nodes exist and their CRCs are correct;
2281 * The function reads whole indexing tree and all nodes, so it is pretty
2313 * dbg_check_data_nodes_order - check that list of data nodes is sorted.
2315 * @head: the list of nodes ('struc
[all...]
/kernel/linux/linux-6.6/tools/perf/
H A Dbuiltin-record.c3791 spec[s] = topo->nodes[s].cpus; in record__init_thread_numa_masks()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DNewGVN.cpp614 // DFS number zero. However, it's possible in the case of phi nodes
1264 // This must be an instruction because we are only called from phi nodes
1713 // other members are all phi nodes (as they do not compute anything, they are
1719 // It's cycle free if it's size 1 or the SCC is *only* phi nodes.
1737 // Evaluate PHI nodes symbolically and create an expression result.
1781 // In LLVM's non-standard representation of phi nodes, it's possible to have
1782 // phi nodes with cycles (IE dependent on other phis that are .... dependent
2448 // impact predicates. Otherwise, only mark the phi nodes as touched, as
2629 // translate everything back through phi nodes. We actually expect some lookups
2757 // with rewriting existing phi nodes
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil_build_ast.c135 cil_list_append(prev->nodes, CIL_NODE, node); in cil_add_decl_to_symtab()
5463 struct cil_tree_node *node = args->arg->nodes->head->data; in cil_destroy_args()
/foundation/graphic/graphic_3d/lume/Lume_3D/src/ecs/systems/
H A Drender_system.cpp2452 if (!descs.postProcess.nodes.empty()) {

Completed in 163 milliseconds

1...<<31323334353637