Home
last modified time | relevance | path

Searched refs:nodes (Results 101 - 125 of 375) sorted by relevance

12345678910>>...15

/third_party/skia/third_party/externals/icu/source/i18n/
H A Dcollationbuilder.cpp212 rootPrimaryIndexes(errorCode), nodes(errorCode) { in CollationBuilder()
324 int64_t node = nodes.elementAti(index); in addReset()
326 // then skip backwards over this and further "weaker" nodes. in addReset()
329 node = nodes.elementAti(index); in addReset()
359 // Tailor after the last node between adjacent root nodes. in addReset()
361 node = nodes.elementAti(index); in addReset()
374 node = nodes.elementAti(index); in addReset()
396 node = nodes.elementAti(i); in addReset()
410 // Skip weaker nodes and same-level tailored nodes in addReset()
827 binarySearchForRootPrimaryNode(const int32_t *rootPrimaryIndexes, int32_t length, const int64_t *nodes, uint32_t p) binarySearchForRootPrimaryNode() argument
[all...]
/third_party/node/test/common/
H A Dheap.js21 const nodes =
22 readHeapInfo(dump.nodes, meta.node_fields, meta.node_types, dump.strings);
26 for (const node of nodes) {
34 while (edgeIndex === nodes[fromNodeIndex].edge_count) {
38 const toNode = nodes[to_node / meta.node_fields.length];
39 const fromNode = nodes[fromNodeIndex];
51 for (const node of nodes) {
55 return nodes;
/third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/
H A DIntermRebuild.h16 // Walks the tree to rebuild nodes.
27 // - If multiple nodes are returned, children and post visits of the returned nodes are not
36 // If supplied, the nodes are spliced children at the spot of the original child.
45 // without modifying the visited nodes.
107 BaseResult(std::vector<TIntermNode *> &&nodes);
111 static BaseResult Multi(std::vector<TIntermNode *> &&nodes);
116 std::vector<TIntermNode *> nodes; in Multi() local
119 nodes.push_back(*nodesCurr); in Multi()
121 return std::move(nodes); in Multi()
150 Multi(std::vector<TIntermNode *> &&nodes) Multi() argument
183 Multi(std::vector<TIntermNode *> &&nodes) Multi() argument
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/
H A DIntermRebuild.h16 // Walks the tree to rebuild nodes.
27 // - If multiple nodes are returned, children and post visits of the returned nodes are not
36 // If supplied, the nodes are spliced children at the spot of the original child.
45 // without modifying the visited nodes.
107 BaseResult(std::vector<TIntermNode *> &&nodes);
111 static BaseResult Multi(std::vector<TIntermNode *> &&nodes);
116 std::vector<TIntermNode *> nodes; in Multi() local
119 nodes.push_back(*nodesCurr); in Multi()
121 return std::move(nodes); in Multi()
150 Multi(std::vector<TIntermNode *> &&nodes) Multi() argument
183 Multi(std::vector<TIntermNode *> &&nodes) Multi() argument
[all...]
/third_party/node/deps/npm/lib/utils/
H A Dsbom-spdx.js22 const spdxOutput = ({ npm, nodes, packageType }) => {
23 const rootNode = nodes.find(node => node.isRoot)
24 const childNodes = nodes.filter(node => !node.isRoot && !node.isLink)
31 for (let node of nodes) {
42 // Filter out edges that are linking to nodes not in the list
43 .filter(edge => nodes.find(n => n === edge.to))
50 const extraRelationships = nodes.filter(node => node.extraneous)
90 /* For workspace nodes, use the location from their linkNode */
H A Dsbom-cyclonedx.js29 const cyclonedxOutput = ({ npm, nodes, packageType, packageLockOnly }) => {
30 const rootNode = nodes.find(node => node.isRoot)
31 const childNodes = nodes.filter(node => !node.isRoot && !node.isLink)
36 for (let node of nodes) {
45 deps.push(toCyclonedxDependency(node, nodes))
170 const toCyclonedxDependency = (node, nodes) => {
174 // Filter out edges that are linking to nodes not in the list
175 .filter(edge => nodes.find(n => n === edge.to))
/third_party/ninja/src/
H A Dninja.cc100 /// Loaded state (rules, nodes).
379 vector<Node*> nodes; in ToolGraph() local
381 if (!CollectTargetsFromArgs(argc, argv, &nodes, &err)) { in ToolGraph()
388 for (vector<Node*>::const_iterator n = nodes.begin(); n != nodes.end(); ++n) in ToolGraph()
481 int ToolTargetsList(const vector<Node*>& nodes, int depth, int indent) { in ToolTargetsList() argument
482 for (vector<Node*>::const_iterator n = nodes.begin(); in ToolTargetsList()
483 n != nodes.end(); in ToolTargetsList()
548 vector<Node*> nodes; in ToolDeps() local
550 for (vector<Node*>::const_iterator ni = deps_log_.nodes() in ToolDeps()
588 vector<Node*> nodes; ToolMissingDeps() local
753 vector<Node*> nodes; ToolCommands() local
811 vector<Node*> nodes; ToolInputs() local
[all...]
/third_party/ltp/testcases/kernel/syscalls/migrate_pages/
H A Dmigrate_pages02.c44 static int *nodes, nodeA, nodeB; variable
85 set_bit(old_nodes, nodes[i], 1); in migrate_to_node()
269 ret = get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes); in setup()
274 tst_brk(TCONF, "at least 2 allowed NUMA nodes" in setup()
277 * find 2 nodes, which can hold NODE_MIN_FREEMEM bytes in setup()
287 p = numa_alloc_onnode(NODE_MIN_FREEMEM, nodes[i]); in setup()
294 if (addr_on_node(p + j) != nodes[i]) in setup()
302 nodeA = nodes[i]; in setup()
304 nodeB = nodes[i]; in setup()
311 tst_brk(TCONF, "at least 2 NUMA nodes wit in setup()
[all...]
H A Dmigrate_pages03.c42 static int *nodes; variable
55 if (get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes) < 0) in setup()
71 set_bit(new_nodes[0], nodes[0], 1); in setup()
72 set_bit(new_nodes[1], nodes[1], 1); in setup()
/third_party/node/deps/ngtcp2/ngtcp2/lib/
H A Dngtcp2_ksl.c154 memcpy(rblk->nodes, blk->nodes + ksl->nodelen * (blk->n - rblk->n), in ksl_split_blk()
167 * into 2 adjacent nodes. The new node is always inserted at the
185 memmove(blk->nodes + (i + 2) * ksl->nodelen, in ksl_split_node()
186 blk->nodes + (i + 1) * ksl->nodelen, in ksl_split_node()
246 * of nodes contained by |blk| is strictly less than
255 memmove(blk->nodes + (i + 1) * ksl->nodelen, blk->nodes + i * ksl->nodelen, in ksl_insert_node()
270 for (i = 0, node = (ngtcp2_ksl_node *)(void *)blk->nodes; in ksl_bsearch()
367 memmove(blk->nodes in ksl_remove_node()
[all...]
/third_party/node/deps/ngtcp2/nghttp3/lib/
H A Dnghttp3_ksl.c155 memcpy(rblk->nodes, blk->nodes + ksl->nodelen * (blk->n - rblk->n), in ksl_split_blk()
168 * into 2 adjacent nodes. The new node is always inserted at the
186 memmove(blk->nodes + (i + 2) * ksl->nodelen, in ksl_split_node()
187 blk->nodes + (i + 1) * ksl->nodelen, in ksl_split_node()
251 * of nodes contained by |blk| is strictly less than
260 memmove(blk->nodes + (i + 1) * ksl->nodelen, blk->nodes + i * ksl->nodelen, in ksl_insert_node()
276 for (i = 0, node = (nghttp3_ksl_node *)(void *)blk->nodes; in ksl_bsearch()
373 memmove(blk->nodes in ksl_remove_node()
[all...]
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DNfaFlattenerTest.java175 TreeSet<Node> nodes = new TreeSet<>(ordering); in testNodeOrdering_bug_65250963()
176 nodes.add(INITIAL); in testNodeOrdering_bug_65250963()
177 nodes.add(TERMINAL); in testNodeOrdering_bug_65250963()
178 nodes.add(a); in testNodeOrdering_bug_65250963()
179 nodes.add(b); in testNodeOrdering_bug_65250963()
180 nodes.add(c); in testNodeOrdering_bug_65250963()
181 nodes.add(d); in testNodeOrdering_bug_65250963()
182 assertThat(nodes).containsExactly(INITIAL, a, c, d, b, TERMINAL).inOrder(); in testNodeOrdering_bug_65250963()
/third_party/skia/third_party/externals/swiftshader/third_party/marl/include/marl/
H A Ddag.h106 // Indices for all downstream nodes.
122 // calls notify() and possibly invoke() for all the dependee nodes.
125 // nodes is the full list of the nodes in the graph.
126 // nodes[0] is always the root node, which has no dependencies (ins).
127 containers::vector<Node, NumReservedNodes> nodes; member in marl::DAGBase
132 // for nodes that have at least 2 dependencies (ins) - because of this the
133 // number of entries in initialCounters may be fewer than nodes.
151 Node* node = &nodes[nodeIdx]; in notify()
165 Node* node = &nodes[nodeId in invoke()
[all...]
/third_party/python/Doc/tools/extensions/
H A Dsuspicious.py48 from docutils import nodes namespace
220 class SuspiciousVisitor(nodes.GenericNodeVisitor):
225 nodes.GenericNodeVisitor.__init__(self, document)
229 if isinstance(node, (nodes.Text, nodes.image)): # direct text containers
251 raise nodes.SkipNode
/third_party/node/tools/inspector_protocol/jinja2/
H A Doptimizer.py19 from jinja2 import nodes namespace
39 return nodes.Const.from_untrusted(node.as_const(eval_ctx),
42 except nodes.Impossible:
/third_party/curl/lib/
H A Dhostip.c415 struct Curl_addrinfo **nodes; in Curl_shuffle_addr() local
418 nodes = malloc(num_addrs*sizeof(*nodes)); in Curl_shuffle_addr()
419 if(nodes) { in Curl_shuffle_addr()
425 nodes[0] = *addr; in Curl_shuffle_addr()
427 nodes[i] = nodes[i-1]->ai_next; in Curl_shuffle_addr()
436 swap_tmp = nodes[rnd[i] % (i + 1)]; in Curl_shuffle_addr()
437 nodes[rnd[i] % (i + 1)] = nodes[ in Curl_shuffle_addr()
[all...]
/third_party/mesa3d/docs/_exts/
H A Dformatting.py6 import docutils.nodes namespace
15 signode += docutils.nodes.Text(' ')
17 signode += docutils.nodes.Text(', ')
/third_party/ltp/testcases/kernel/syscalls/move_pages/
H A Dmove_pages07.c90 int nodes[TEST_PAGES]; in main() local
102 nodes[i] = to_node; in main()
106 ret = numa_move_pages(ipid, TEST_PAGES, pages, nodes, in main()
H A Dmove_pages06.c90 int nodes[TEST_PAGES]; in main() local
102 nodes[i] = to_node; in main()
104 ret = numa_move_pages(0, TEST_PAGES, pages, nodes, in main()
H A Dmove_pages10.c90 int nodes[TEST_PAGES]; in main() local
101 nodes[i] = to_node; in main()
103 ret = numa_move_pages(0, TEST_PAGES, pages, nodes, in main()
H A Dmove_pages09.c89 int nodes[TEST_PAGES]; in main() local
100 nodes[i] = from_node; in main()
102 ret = numa_move_pages(0, TEST_PAGES, pages, nodes, in main()
/third_party/node/deps/openssl/openssl/crypto/x509/
H A Dpcy_lib.c67 if (level->nodes) in X509_policy_level_node_count()
68 n += sk_X509_POLICY_NODE_num(level->nodes); in X509_policy_level_node_count()
81 return sk_X509_POLICY_NODE_value(level->nodes, i); in X509_policy_level_get0_node()
/third_party/openssl/crypto/x509/
H A Dpcy_lib.c67 if (level->nodes) in X509_policy_level_node_count()
68 n += sk_X509_POLICY_NODE_num(level->nodes); in X509_policy_level_node_count()
81 return sk_X509_POLICY_NODE_value(level->nodes, i); in X509_policy_level_get0_node()
/third_party/node/deps/cares/src/lib/
H A Dares_getaddrinfo.c277 status = ares_append_ai_node(AF_INET, port, 0, &addr4, &ai->nodes); in fake_addrinfo()
291 status = ares_append_ai_node(AF_INET6, port, 0, &addr6, &ai->nodes); in fake_addrinfo()
320 ai->nodes->ai_socktype = hints->ai_socktype; in fake_addrinfo()
321 ai->nodes->ai_protocol = hints->ai_protocol; in fake_addrinfo()
333 if (!(hquery->hints.ai_flags & ARES_AI_NOSORT) && hquery->ai->nodes) { in end_hquery()
334 sentinel.ai_next = hquery->ai->nodes; in end_hquery()
336 hquery->ai->nodes = sentinel.ai_next; in end_hquery()
338 next = hquery->ai->nodes; in end_hquery()
511 if (addinfostatus == ARES_EBADRESP && hquery->ai->nodes) { in host_callback()
518 } else if (hquery->ai->nodes) { in host_callback()
[all...]
H A Dares__addrinfo2hostent.c76 if (family == AF_UNSPEC && ai->nodes) { in ares__addrinfo2hostent()
77 family = ai->nodes->ai_family; in ares__addrinfo2hostent()
90 next = ai->nodes; in ares__addrinfo2hostent()
164 for (next = ai->nodes; next != NULL; next = next->ai_next) { in ares__addrinfo2hostent()
243 for (next = ai->nodes; next != NULL; next = next->ai_next) { in ares__addrinfo2addrttl()

Completed in 25 milliseconds

12345678910>>...15