Home
last modified time | relevance | path

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

1...<<31323334353637

/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()
H A Dcil_binary.c244 struct cil_tree_node *node = cil_common->datum.nodes->head->data; in cil_common_to_policydb()
/foundation/graphic/graphic_3d/lume/Lume_3D/src/ecs/systems/
H A Drender_system.cpp2452 if (!descs.postProcess.nodes.empty()) {
/kernel/linux/linux-5.10/fs/btrfs/
H A Dextent_io.c3801 * btree nodes/leafs whose content on disk is invalid - either garbage in set_btree_ioerr()
4731 btrfs_item_key_to_cpu(path->nodes[0], &found_key, path->slots[0]); in extent_fiemap()
H A Ddisk-io.c136 * Lock-nesting across peer nodes is always done with the immediate parent
4177 * and then a transaction commit runs the same delayed nodes in close_ctree()
4178 * before any delayed worker has done something with the nodes. in close_ctree()
4824 l = path->nodes[0]; in btrfs_find_highest_objectid()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Object/
H A DMachOObjectFile.cpp2810 // Equal if all nodes in both stacks match. in operator ==()
3019 for (const NodeState &node : nodes()) { in pushDownUntilBottom()
3045 // traversal where the iterator contains a stack of parent nodes along with a
3051 // node may have child nodes too.
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/AsmParser/
H A DLLParser.cpp4807 /// ::= !DIMacroFile(line: 9, file: !2, nodes: !3)
4813 OPTIONAL(nodes, MDField, );
4818 (Context, type.Val, line.Val, file.Val, nodes.Val));
/kernel/linux/linux-6.6/tools/testing/radix-tree/
H A Dmaple.c88 * check_new_node() - Check the creation of new nodes and error path
96 struct maple_node *nodes[100]; in check_new_node() local
103 /* Try allocating 3 nodes */ in check_new_node()
106 /* request 3 nodes to be allocated. */ in check_new_node()
146 /* Allocate 3 nodes, will fail. */ in check_new_node()
148 /* Drop the lock and allocate 3 nodes. */ in check_new_node()
257 nodes[j] = mas_pop_node(&mas); in check_new_node()
263 mas_push_node(&mas, nodes[j]); in check_new_node()
282 /* Drop the lock and allocate the nodes. */ in check_new_node()
[all...]
/third_party/skia/third_party/externals/sfntly/java/lib/
H A Dicu4j-4_8_1_1.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/ibm/ com/ibm/icu/ com/ibm/icu/impl/ ...

Completed in 115 milliseconds

1...<<31323334353637