| /third_party/node/deps/openssl/openssl/crypto/x509/ |
| H A D | pcy_local.h | 88 /* 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 D | pcy_local.h | 88 /* 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/jinja2/ |
| H A D | visitor.py | 2 """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/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| H A D | GraphTraits.h | 54 // 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
|
| /third_party/typescript/tests/baselines/reference/ |
| H A D | inferenceDoesNotAddUndefinedOrNull.js | 5 forEachChild<T>(cbNode: (node: Node) => T | undefined, cbNodeArray?: (nodes: NodeArray<Node>) => T | undefined): T | undefined;
|
| /third_party/libdrm/tests/amdgpu/ |
| H A D | amdgpu_stress.c | 107 fd = open(devices[i]->nodes[DRM_NODE_RENDER], O_RDWR | O_CLOEXEC); in amdgpu_open_device()
117 devices[i]->nodes[DRM_NODE_RENDER], in amdgpu_open_device()
|
| H A D | amdgpu_test.c | 355 devices[i]->nodes[drm_node], in amdgpu_open_devices()
366 devices[i]->nodes[drm_node], in amdgpu_open_devices()
627 * only device nodes in /dev/dri/ */ in amdgpu_node_is_drm()
|
| /third_party/rust/crates/regex/regex-syntax/src/ast/ |
| H A D | visitor.rs | 37 /// nodes.
43 /// `Ast` nodes.
48 /// This method is called between child nodes of an
56 /// before descending into child nodes.
66 /// after descending into child nodes.
76 /// before descending into child nodes.
86 /// after descending into child nodes.
94 /// This method is called between the left hand and right hand child nodes
126 /// A stack of `Ast` nodes. This is roughly analogous to the call stack
149 /// The remaining child nodes t
[all...] |
| /third_party/ffmpeg/libavcodec/ |
| H A D | truemotion2.c | 108 int nodes; ///< total number of nodes in tree member
157 huff.nodes = get_bits(&ctx->gb, 17); in tm2_build_huff_table()
167 if ((huff.nodes <= 0) || (huff.nodes > 0x10000)) { in tm2_build_huff_table()
169 "nodes: %i\n", huff.nodes); in tm2_build_huff_table()
176 /* allocate space for codes - it is exactly ceil(nodes / 2) entries */ in tm2_build_huff_table()
177 huff.max_num = (huff.nodes + 1) >> 1; in tm2_build_huff_table()
|
| /third_party/ninja/src/ |
| H A D | build_test.cc | 283 // Mark all the out* nodes dirty
in TEST_F()
994 // added nodes, but not phony edges to the graph.
in TEST_F()
997 // Verify that nodes for blah.h and bar.h were added and that they
in TEST_F()
2304 EXPECT_EQ("in1", out1_deps->nodes[0]->path());
in TEST_F()
2309 EXPECT_EQ("in1", out2_deps->nodes[0]->path());
in TEST_F()
2333 EXPECT_EQ("in1", out1_deps->nodes[0]->path());
in TEST_F()
2334 EXPECT_EQ("in2", out1_deps->nodes[1]->path());
in TEST_F()
2339 EXPECT_EQ("in1", out2_deps->nodes[0]->path());
in TEST_F()
2340 EXPECT_EQ("in2", out2_deps->nodes[1]->path());
in TEST_F()
2364 EXPECT_EQ("in1", out1_deps->nodes[ in TEST_F()
[all...] |
| /third_party/node/deps/v8/src/compiler/ |
| H A D | code-assembler.cc | 1079 // implicit nodes are target and optionally context. in CallStubN()
1200 Node* nodes[] = {target, args...}; in TailCallBytecodeDispatch() local
1201 CHECK_EQ(descriptor.GetParameterCount() + 1, arraysize(nodes)); in TailCallBytecodeDispatch()
1202 raw_assembler()->TailCallN(call_descriptor, arraysize(nodes), nodes); in TailCallBytecodeDispatch()
1221 Node* nodes[] = {code, function, new_target, arg_count, context}; in TailCallJSCode() local
1222 CHECK_EQ(descriptor.GetParameterCount() + 2, arraysize(nodes)); in TailCallJSCode()
1223 raw_assembler()->TailCallN(call_descriptor, arraysize(nodes), nodes); in TailCallJSCode()
1526 // merge and phi nodes hav in MergeVariables()
[all...] |
| H A D | common-node-cache.h | 22 // Bundles various caches for common nodes.
85 // Return all nodes from the cache.
86 void GetCachedNodes(ZoneVector<Node*>* nodes);
|
| H A D | state-values-utils.h | 43 // ValueArray - array of nodes ({node} has to be nullptr).
69 Node* GetValuesNodeFromCache(Node** nodes, size_t count,
100 // Returns the number of empty nodes that were skipped over.
|
| H A D | js-graph.h | 77 // Adds all the cached nodes to the given list.
78 void GetCachedNodes(NodeVector* nodes);
80 // Cached global nodes.
|
| H A D | raw-machine-assembler.cc | 270 // Create control merge nodes and effect phis for all predecessor blocks. in MakeReschedulable()
332 // Fix-up loop backedges and re-structure control flow so that loop nodes have in MakeReschedulable()
755 base::SmallVector<Node*, kNumCArgs> nodes(args.size() + 1); in CallCFunctionImpl()
756 nodes[0] = function; in CallCFunctionImpl()
758 args.begin(), args.end(), std::next(nodes.begin()), in CallCFunctionImpl()
763 static_cast<int>(nodes.size()), nodes.begin()); in CallCFunctionImpl()
866 // The raw machine assembler nodes do not have effect and control inputs, in MakeNode()
|
| /third_party/python/Lib/lib2to3/ |
| H A D | btm_matcher.py | 5 leaves to the root of the AST and returns a set of nodes for further
6 matching. This reduces significantly the number of candidate nodes."""
33 self.nodes = [self.root]
91 recheck the nodes
|
| /third_party/rust/crates/regex/regex-syntax/src/hir/ |
| H A D | visitor.rs | 27 /// nodes.
33 /// `Hir` nodes.
38 /// This method is called between child nodes of an alternation.
66 /// A stack of `Hir` nodes. This is roughly analogous to the call stack
85 /// The remaining child nodes to visit (which may be empty).
93 /// The remaining child nodes to visit (which may be empty).
140 // Otherwise, we've finished visiting all the child nodes for in visit()
148 /// and only if there are child nodes in the HIR). Otherwise, return None.
|
| /third_party/PyYAML/lib/yaml/ |
| H A D | composer.py | 6 from .nodes import *
|
| H A D | serializer.py | 6 from .nodes import *
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/scripts/ |
| H A D | extdependency.py | 47 def nodes(self): member in DiGraph
48 """Iterate over the nodes in the graph."""
53 Iterate over the nodes reachable from the given start node, excluding
60 # All nodes seen during traversal.
63 # The stack of nodes that need visiting.
85 # Set of adjacent of nodes.
143 # Walk a list of the leaf nodes (version and extension
|
| /third_party/alsa-utils/topology/nhlt/intel/ssp/ |
| H A D | ssp-debug.c | 214 fprintf(stdout, "aux sync node_id %u\n", sync->nodes[j].node_id); in ssp_print_internal()
215 fprintf(stdout, "aux sync sampling_rate %u\n", sync->nodes[j].sampling_rate); in ssp_print_internal()
|
| /third_party/PyYAML/tests/lib/ |
| H A D | test_yaml_ext.py | 53 def new_serialize_all(nodes, stream=None, Dumper=yaml.CDumper, **kwds):
54 return old_serialize_all(nodes, stream, Dumper, **kwds)
|
| /third_party/node/deps/v8/src/maglev/ |
| H A D | maglev-graph-builder.h | 43 block->nodes().RevalidateTail(); in Build()
166 // DCHECK(!current_block_->nodes().is_empty()); in VisitSingleBytecode()
178 // Clear new nodes for the next VisitFoo in VisitSingleBytecode()
200 current_block_->nodes().Add(node); in AddNode()
266 // We shouldn't be moving newly created nodes between registers. in MoveNodeBetweenRegisters()
330 // We should only set register values to nodes that were newly created in in StoreRegister()
331 // this Visit. Existing nodes should be moved between registers with in StoreRegister()
|
| /third_party/node/deps/v8/src/regexp/experimental/ |
| H A D | experimental-compiler.cc | 59 for (RegExpTree* child : *node->nodes()) {
377 for (RegExpTree* child : *node->nodes()) {
|
| /third_party/vk-gl-cts/external/openglcts/modules/common/ |
| H A D | glcShaderLibrary.cpp | 1159 vector<tcu::TestNode*> nodes = parser.parse(&buf[0]); in loadShaderFile() local
1161 return nodes; in loadShaderFile()
|