Home
last modified time | relevance | path

Searched refs:nodes (Results 226 - 250 of 381) sorted by relevance

12345678910>>...16

/third_party/node/deps/cares/src/lib/
H A Dares_parse_aaaa_reply.c97 ares__freeaddrinfo_nodes(ai.nodes); in ares_parse_aaaa_reply()
H A Dares_parse_a_reply.c96 ares__freeaddrinfo_nodes(ai.nodes); in ares_parse_a_reply()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DSpillPlacement.h49 Node *nodes = nullptr; member in llvm::SpillPlacement
69 /// List of nodes that need to be updated in ::iterate.
130 /// Return true is there are any positive nodes.
/third_party/skia/third_party/externals/swiftshader/src/Vulkan/
H A DVkDescriptorPool.hpp53 std::set<Node> nodes; member in vk::DescriptorPool
/third_party/typescript/tests/baselines/reference/
H A DneverInference.js15 nodes: Node<T>
/third_party/python/Doc/tools/extensions/
H A Dglossary_search.py12 from docutils.nodes import definition_list_item
/third_party/ffmpeg/libavcodec/
H A Dvp6.c256 /* nodes must ascend by count, but with descending symbol order */
266 Node nodes[2*VP6_MAX_HUFF_SIZE], *tmp = &nodes[size]; in vp6_build_huff_tree() local
274 nodes[map[2*i ]].count = a + !a; in vp6_build_huff_tree()
275 nodes[map[2*i+1]].count = b + !b; in vp6_build_huff_tree()
281 nodes, vp6_huff_cmp, in vp6_build_huff_tree()
/third_party/node/deps/v8/third_party/jinja2/
H A Denvironment.py13 from . import nodes namespace
48 from .nodes import EvalContext
525 tree of nodes is used by the compiler to convert the template into
680 body = [nodes.Assign(nodes.Name("result", "store"), expr, lineno=1)]
681 template = self.from_string(nodes.Template(body, lineno=1))
H A Dvisitor.py2 """API for traversing the AST nodes. Implemented by the compiler and
5 from .nodes import Node
13 Per default the visitor functions for the nodes are ``'visit_'`` +
42 """Walks the abstract syntax tree and allows modifications of nodes.
/third_party/node/tools/inspector_protocol/jinja2/
H A Denvironment.py15 from jinja2 import nodes namespace
24 from jinja2.nodes import EvalContext
482 tree of nodes is used by the compiler to convert the template into
634 body = [nodes.Assign(nodes.Name('result', 'store'), expr, lineno=1)]
635 template = self.from_string(nodes.Template(body, lineno=1))
H A Dvisitor.py6 This module implements a visitor for the nodes.
11 from jinja2.nodes import Node
19 Per default the visitor functions for the nodes are ``'visit_'`` +
48 """Walks the abstract syntax tree and allows modifications of nodes.
/third_party/ninja/src/
H A Dmanifest_parser_test.cc1053 EXPECT_EQ("could not determine root nodes of build graph", err); in TEST_F()
1068 vector<Node*> nodes = state.DefaultNodes(&err); in TEST_F() local
1070 ASSERT_EQ(3u, nodes.size()); in TEST_F()
1071 EXPECT_EQ("a", nodes[0]->path()); in TEST_F()
1072 EXPECT_EQ("b", nodes[1]->path()); in TEST_F()
1073 EXPECT_EQ("c", nodes[2]->path()); in TEST_F()
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-regalloc.cc42 // Conditional control nodes don't cause holes themselves. So, the nearest in NearestPostDominatingHole()
90 // Compute, for all forward control nodes (i.e. excluding Return and JumpLoop) a
113 // tree, up to nodes which are holes (in this example, A, D, F and H).
302 node_it_ = block->nodes().begin(); in AllocateRegisters()
303 for (; node_it_ != block->nodes().end(); ++node_it_) { in AllocateRegisters()
573 (*block_it_)->nodes().Add(gap_move); in AddMoveBeforeCurrentNode()
574 node_it_ = (*block_it_)->nodes().end(); in AddMoveBeforeCurrentNode()
576 DCHECK_NE(node_it_, (*block_it_)->nodes().end()); in AddMoveBeforeCurrentNode()
H A Dmaglev-basic-block.h43 Node::List& nodes() { return nodes_; } in nodes() function in v8::internal::maglev::BasicBlock
/third_party/skia/third_party/externals/jinja2/
H A Denvironment.py13 from . import nodes namespace
48 from .nodes import EvalContext
525 tree of nodes is used by the compiler to convert the template into
680 body = [nodes.Assign(nodes.Name("result", "store"), expr, lineno=1)]
681 template = self.from_string(nodes.Template(body, lineno=1))
H A Dvisitor.py2 """API for traversing the AST nodes. Implemented by the compiler and
5 from .nodes import Node
13 Per default the visitor functions for the nodes are ``'visit_'`` +
42 """Walks the abstract syntax tree and allows modifications of nodes.
/third_party/protobuf/src/google/protobuf/util/
H A Dfield_mask_util.cc265 // by all leaf nodes descended from "node" to mask.
269 // Merge all leaf nodes of a sub-tree to another tree.
364 std::vector<Node*> nodes(parts.size()); in RemovePath()
369 nodes[i] = node; in RemovePath()
377 // If add any new nodes, cleanup. in RemovePath()
403 delete nodes[i]->children[parts[i]]; in RemovePath()
404 nodes[i]->children.erase(parts[i]); in RemovePath()
405 if (!nodes[i]->children.empty()) { in RemovePath()
432 // Now we found a matching node with the given path. Add all leaf nodes in IntersectPath()
/third_party/icu/icu4j/tools/build/src/com/ibm/icu/dev/tool/coverage/
H A DJacocoReportCheck.java153 NodeList nodes = doc.getElementsByTagName("report"); in parseReport()
154 for (int idx = 0; idx < nodes.getLength(); idx++) { in parseReport()
155 Node node = nodes.item(idx); in parseReport()
/third_party/node/src/
H A Dheap_utils.cc109 Local<Array> nodes = Array::New(isolate_, nodes_.size()); in CreateObject() local
150 if (nodes->Set(context, i++, obj).IsNothing()) in CreateObject()
200 return handle_scope.Escape(nodes); in CreateObject()
/third_party/mesa3d/src/loader/
H A Dloader.c186 fd = loader_open_device(device->nodes[DRM_NODE_RENDER]); in loader_open_render_node()
224 render_node = strdup(dev_ptr->nodes[DRM_NODE_RENDER]); in loader_get_render_node()
402 fd = loader_open_device(devices[i]->nodes[DRM_NODE_RENDER]); in loader_get_user_preferred_fd()
/third_party/node/deps/npm/node_modules/yallist/
H A Dyallist.js323 Yallist.prototype.splice = function (start, deleteCount, ...nodes) {
348 for (var i = 0; i < nodes.length; i++) {
349 walker = insert(this, walker, nodes[i])
/third_party/jinja2/
H A Dvisitor.py1 """API for traversing the AST nodes. Implemented by the compiler and
6 from .nodes import Node
21 Per default the visitor functions for the nodes are ``'visit_'`` +
51 """Walks the abstract syntax tree and allows modifications of nodes.
/third_party/node/deps/openssl/openssl/crypto/x509/
H A Dpcy_local.h88 /* This structure represents the relationship between nodes */
95 /* Number of child nodes */
102 /* nodes at this level */
103 STACK_OF(X509_POLICY_NODE) *nodes; member
114 /* The number of nodes in the tree */
116 /* The maximum number of nodes in the tree */
123 * Extra policy data when additional nodes (not from the certificate) are
/third_party/openssl/crypto/x509/
H A Dpcy_local.h88 /* This structure represents the relationship between nodes */
95 /* Number of child nodes */
102 /* nodes at this level */
103 STACK_OF(X509_POLICY_NODE) *nodes; member
114 /* The number of nodes in the tree */
116 /* The maximum number of nodes in the tree */
123 * Extra policy data when additional nodes (not from the certificate) are
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DGraphTraits.h54 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
70 // Return total number of nodes in the graph
105 // Provide iterator ranges for the graph traits nodes and children
108 nodes(const GraphType &G) { in nodes() function

Completed in 28 milliseconds

12345678910>>...16