Home
last modified time | relevance | path

Searched refs:node (Results 1526 - 1550 of 2502) sorted by relevance

1...<<61626364656667686970>>...101

/third_party/node/test/addons/force-context-aware/
H A Dbinding.cc1 #include <node.h>
/third_party/musl/src/search/
H A Dtsearch.h7 struct node { struct
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DRBBIRuleScanner.java178 // The openParen node is a dummy operation type with a low in doParseActions()
195 // The top of the node stack has the $variable ref node. in doParseActions()
198 // node in doParseActions()
199 // that precedes the $variableReference node on the stack. in doParseActions()
206 // Push a new start-of-expression node; needed to keep parse of the in doParseActions()
216 // node. in doParseActions()
225 // in the root of the node for the right-hand-side expression. in doParseActions()
234 // node. in doParseActions()
238 // Make a symbol table entry for the $variableRef node in doParseActions()
628 findSetFor(String s, RBBINode node, UnicodeSet setToAdopt) findSetFor() argument
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DRBBIRuleScanner.java179 // The openParen node is a dummy operation type with a low in doParseActions()
196 // The top of the node stack has the $variable ref node. in doParseActions()
199 // node in doParseActions()
200 // that precedes the $variableReference node on the stack. in doParseActions()
207 // Push a new start-of-expression node; needed to keep parse of the in doParseActions()
217 // node. in doParseActions()
226 // in the root of the node for the right-hand-side expression. in doParseActions()
235 // node. in doParseActions()
239 // Make a symbol table entry for the $variableRef node in doParseActions()
629 findSetFor(String s, RBBINode node, UnicodeSet setToAdopt) findSetFor() argument
[all...]
/third_party/mesa3d/src/nouveau/codegen/
H A Dnv50_ir_ssa.cpp98 void DominatorTree::buildDFS(Graph::Node *node) in buildDFS() argument
100 SEMI(node->tag) = node->tag; in buildDFS()
102 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) { in buildDFS()
105 PARENT(ei.getNode()->tag) = node->tag; in buildDFS()
/third_party/node/deps/v8/src/interpreter/
H A Dbytecode-array-builder.h607 // Either attach deferred source info to node, or emit it as a nop bytecode
608 // if node already have valid source info.
609 void AttachOrEmitDeferredSourceInfo(BytecodeNode* node);
612 void Write(BytecodeNode* node);
613 void WriteJump(BytecodeNode* node, BytecodeLabel* label);
614 void WriteJumpLoop(BytecodeNode* node, BytecodeLoopHeader* loop_header);
615 void WriteSwitch(BytecodeNode* node, BytecodeJumpTable* label);
/third_party/skia/src/pdf/
H A DSkPDFDocument.cpp145 // the number of leaves below the node as "Count." The leaves are passed in generate_page_tree()
166 if (n != 1 && index + 1 == n) { // No need to create a new node. in generate_page_tree()
174 PageTreeNode& node = vec[index++]; in generate_page_tree() local
175 node.fNode->insertRef("Parent", parent); in generate_page_tree()
176 kids_list->appendRef(doc->emit(*node.fNode, node.fReservedRef)); in generate_page_tree()
177 descendantCount += node.fPageObjectDescendantCount; in generate_page_tree()
/third_party/python/Lib/test/
H A Dtest_minidom.py59 def checkWholeText(self, node, s):
60 t = node.wholeText
115 , "testInsertBefore -- node properly placed in tree")
127 , "testInsertBefore -- node properly placed in tree")
140 , "testInsertBefore -- node properly placed in tree")
342 node = child.getAttributeNode("spam")
345 self.assertIs(node, child.removeAttributeNode(node))
496 node = el.setAttribute("abc", "def")
497 self.confirm(str(node)
[all...]
H A Dtest_unparse.py133 # Ensure the comparisons start at an AST node
178 def check_invalid(self, node, raises=ValueError):
179 with self.subTest(node=node):
180 self.assertRaises(raises, ast.unparse, node)
575 # first node but aren't docstrings to make sure we don't have
/third_party/f2fs-tools/fsck/
H A Dmkquota.c135 static void quota_dnode_free(dnode_t *node, void *UNUSED(context)) in quota_dnode_free() argument
137 void *ptr = node ? dnode_get(node) : 0; in quota_dnode_free()
140 free(node); in quota_dnode_free()
/third_party/mesa3d/src/compiler/nir/
H A Dnir_lower_io_arrays_to_elements.c382 exec_node_remove(&var->node); in nir_lower_io_arrays_to_elements_no_indirects()
391 exec_node_remove(&var->node); in nir_lower_io_arrays_to_elements_no_indirects()
422 exec_node_remove(&var->node); in nir_lower_io_arrays_to_elements()
430 exec_node_remove(&var->node); in nir_lower_io_arrays_to_elements()
/third_party/mesa3d/src/gallium/drivers/r600/sfn/
H A Dsfn_shader.h150 bool process_cf_node(nir_cf_node *node);
151 bool process_if(nir_if *node);
152 bool process_loop(nir_loop *node);
153 bool process_block(nir_block *node);
/third_party/node/src/
H A Dinspector_io.cc9 #include "node.h"
20 namespace node { namespace
58 buffer[5], // node in GenerateID()
103 node::ContainerOf(&RequestQueueData::async_, async); in RequestQueueData()
208 class InspectorIoDelegate: public node::inspector::SocketServerDelegate {
379 node::ContainerOf(&RequestQueueData::async_, async); in CloseAndFree()
384 } // namespace node
H A Dconnect_wrap.cc4 namespace node { namespace
16 } // namespace node
H A Dnode_sea.h11 namespace node { namespace
18 } // namespace node
H A Dnode_shadow_realm.cc3 namespace node { namespace
16 } // namespace node
H A Dnode_shadow_realm.h8 namespace node { namespace
15 } // namespace node
/third_party/node/deps/v8/src/codegen/
H A Dtnode.h119 // Value type of a Turbofan node with two results.
374 static TNode UncheckedCast(compiler::Node* node) { return TNode(node); } in UncheckedCast() argument
377 explicit TNode(compiler::Node* node) : node_(node) { LazyTemplateChecks(); } in TNode() argument
/third_party/python/Tools/i18n/
H A Dpygettext.py358 for value in filter(lambda node: isinstance(node, ast.FormattedValue),
360 for call in filter(lambda node: isinstance(node, ast.Call),
/third_party/skia/third_party/externals/angle2/src/tests/compiler_tests/
H A DInitOutputVariables_test.cpp115 bool visitBinary(Visit visit, TIntermBinary *node) override
117 if (node->getOp() == EOpAssign && IsZero(node->getRight()))
119 mCandidateLValues.push_back(node->getLeft());
/third_party/toybox/toys/net/
H A Dnetstat.c232 static int scan_pids(struct dirtree *node) in scan_pids() argument
239 if (!node->parent) return DIRTREE_RECURSE; in scan_pids()
240 if (!(pid = atol(node->name))) return 0; in scan_pids()
246 if (-1==(dirfd = openat(dirtree_parentfd(node), s, O_RDONLY))) return 0; in scan_pids()
/third_party/vixl/src/aarch64/
H A Ddecoder-aarch64.cc57 void Decoder::AddDecodeNode(const DecodeNode& node) { in AddDecodeNode() argument
58 if (decode_nodes_.count(node.GetName()) == 0) { in AddDecodeNode()
59 decode_nodes_.insert(std::make_pair(node.GetName(), node)); in AddDecodeNode()
66 auto msg = String("Can't find decode node ", GetAllocator().Adapter()) + name.data() + ".\n"; in GetDecodeNode()
77 // Add a node for each instruction form named, identified by having no '_' in ConstructDecodeGraph()
78 // prefix on the node name. in ConstructDecodeGraph()
88 // Add an "unallocated" node, used when an instruction encoding is not in ConstructDecodeGraph()
427 // try to optimise the node to exploit that. in TryCompileOptimisedDecodeTable()
454 // Create a compiled node tha in TryCompileOptimisedDecodeTable()
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/
H A Dutil.cpp801 bool IsInShaderStorageBlock(TIntermTyped *node)
803 TIntermSwizzle *swizzleNode = node->getAsSwizzleNode();
809 TIntermBinary *binaryNode = node->getAsBinaryNode();
824 const TType &type = node->getType();
/third_party/node/src/permission/
H A Dchild_process_permission.cc6 namespace node { namespace
23 } // namespace node
H A Dworker_permission.cc6 namespace node { namespace
22 } // namespace node

Completed in 20 milliseconds

1...<<61626364656667686970>>...101