| /third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/ |
| D | input_test.py | 15 self.nodes = {}
17 self.nodes[x] = gyp.input.DependencyGraphNode(x)
24 for label, node in self.nodes.items():
28 self._create_dependency(self.nodes["a"], self.nodes["b"])
29 self._create_dependency(self.nodes["b"], self.nodes["c"])
30 self._create_dependency(self.nodes["c"], self.nodes["d"])
32 for label, node in self.nodes.items():
36 self._create_dependency(self.nodes["a"], self.nodes["b"])
37 self._create_dependency(self.nodes["a"], self.nodes["c"])
38 self._create_dependency(self.nodes["b"], self.nodes["c"])
[all …]
|
| /third_party/node/tools/gyp/pylib/gyp/ |
| D | input_test.py | 15 self.nodes = {}
17 self.nodes[x] = gyp.input.DependencyGraphNode(x)
24 for label, node in self.nodes.items():
28 self._create_dependency(self.nodes["a"], self.nodes["b"])
29 self._create_dependency(self.nodes["b"], self.nodes["c"])
30 self._create_dependency(self.nodes["c"], self.nodes["d"])
32 for label, node in self.nodes.items():
36 self._create_dependency(self.nodes["a"], self.nodes["b"])
37 self._create_dependency(self.nodes["a"], self.nodes["c"])
38 self._create_dependency(self.nodes["b"], self.nodes["c"])
[all …]
|
| /third_party/spirv-tools/test/util/ |
| D | ilist_test.cpp | 49 TestNode nodes[10]; in TEST() local
52 nodes[i].data_ = i; in TEST()
53 list.push_back(&nodes[i]); in TEST()
64 TestList BuildList(TestNode nodes[], int n) { in BuildList() argument
67 nodes[i].data_ = i; in BuildList()
68 list.push_back(&nodes[i]); in BuildList()
75 TestNode nodes[10]; in TEST() local
76 TestList list = BuildList(nodes, 10); in TEST()
82 TestNode nodes[10]; in TEST() local
83 TestList list = BuildList(nodes, 10); in TEST()
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/test/util/ |
| D | ilist_test.cpp | 49 TestNode nodes[10]; in TEST() local
52 nodes[i].data_ = i; in TEST()
53 list.push_back(&nodes[i]); in TEST()
64 TestList BuildList(TestNode nodes[], int n) { in BuildList() argument
67 nodes[i].data_ = i; in BuildList()
68 list.push_back(&nodes[i]); in BuildList()
75 TestNode nodes[10]; in TEST() local
76 TestList list = BuildList(nodes, 10); in TEST()
82 TestNode nodes[10]; in TEST() local
83 TestList list = BuildList(nodes, 10); in TEST()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/util/ |
| D | ilist_test.cpp | 49 TestNode nodes[10]; in TEST() local
52 nodes[i].data_ = i; in TEST()
53 list.push_back(&nodes[i]); in TEST()
64 TestList BuildList(TestNode nodes[], int n) { in BuildList() argument
67 nodes[i].data_ = i; in BuildList()
68 list.push_back(&nodes[i]); in BuildList()
75 TestNode nodes[10]; in TEST() local
76 TestList list = BuildList(nodes, 10); in TEST()
82 TestNode nodes[10]; in TEST() local
83 TestList list = BuildList(nodes, 10); in TEST()
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 77 static void PrintGCEdges(Nodes *nodes, const IdMap &id, GraphCycles *gc) { in PrintGCEdges() argument
79 for (int a : *nodes) { in PrintGCEdges()
80 for (int b : *nodes) { in PrintGCEdges()
89 static void PrintTransitiveClosure(Nodes *nodes, Edges *edges) { in PrintTransitiveClosure() argument
91 for (int a : *nodes) { in PrintTransitiveClosure()
92 for (int b : *nodes) { in PrintTransitiveClosure()
102 static void PrintGCTransitiveClosure(Nodes *nodes, const IdMap &id, in PrintGCTransitiveClosure() argument
105 for (int a : *nodes) { in PrintGCTransitiveClosure()
106 for (int b : *nodes) { in PrintGCTransitiveClosure()
115 static void CheckTransitiveClosure(Nodes *nodes, Edges *edges, const IdMap &id, in CheckTransitiveClosure() argument
[all …]
|
| /third_party/ffmpeg/libavformat/ |
| D | concat.c | 38 struct concat_nodes *nodes; ///< list of nodes to concat member
49 struct concat_nodes *nodes = data->nodes; in concat_close() local
52 err |= ffurl_closep(&nodes[i].uc); in concat_close()
54 av_freep(&data->nodes); in concat_close()
67 struct concat_nodes *nodes; in concat_open() local
80 if (!(nodes = av_realloc_array(NULL, len, sizeof(*nodes)))) in concat_open()
83 data->nodes = nodes; in concat_open()
110 nodes[i].uc = uc; in concat_open()
111 nodes[i].size = size; in concat_open()
119 else if (!(nodes = av_realloc(nodes, data->length * sizeof(*nodes)))) { in concat_open()
[all …]
|
| /third_party/jinja2/ |
| D | parser.py | 5 from . import nodes
15 _ImportInclude = t.TypeVar("_ImportInclude", nodes.Import, nodes.Include)
16 _MacroCall = t.TypeVar("_MacroCall", nodes.Macro, nodes.CallBlock)
36 _math_nodes: t.Dict[str, t.Type[nodes.Expr]] = {
37 "add": nodes.Add,
38 "sub": nodes.Sub,
39 "mul": nodes.Mul,
40 "div": nodes.Div,
41 "floordiv": nodes.FloorDiv,
42 "mod": nodes.Mod,
[all …]
|
| D | meta.py | 6 from . import nodes
33 def find_undeclared_variables(ast: nodes.Template) -> t.Set[str]:
57 _ref_types = (nodes.Extends, nodes.FromImport, nodes.Import, nodes.Include)
58 _RefType = t.Union[nodes.Extends, nodes.FromImport, nodes.Import, nodes.Include]
61 def find_referenced_templates(ast: nodes.Template) -> t.Iterator[t.Optional[str]]:
79 template: nodes.Expr = node.template # type: ignore
81 if not isinstance(template, nodes.Const):
83 if isinstance(template, (nodes.Tuple, nodes.List)):
87 if isinstance(template_name, nodes.Const):
103 elif isinstance(node, nodes.Include) and isinstance(
|
| /third_party/ltp/libs/libltpnuma/ |
| D | tst_numa.c | 20 void tst_nodemap_print_counters(struct tst_nodemap *nodes) in tst_nodemap_print_counters() argument
24 for (i = 0; i < nodes->cnt; i++) { in tst_nodemap_print_counters()
26 nodes->map[i], nodes->counters[i]); in tst_nodemap_print_counters()
30 void tst_nodemap_reset_counters(struct tst_nodemap *nodes) in tst_nodemap_reset_counters() argument
32 size_t arr_size = sizeof(unsigned int) * nodes->cnt; in tst_nodemap_reset_counters()
34 if (!nodes->counters) in tst_nodemap_reset_counters()
35 nodes->counters = SAFE_MALLOC(arr_size); in tst_nodemap_reset_counters()
37 memset(nodes->counters, 0, arr_size); in tst_nodemap_reset_counters()
40 void tst_nodemap_free(struct tst_nodemap *nodes) in tst_nodemap_free() argument
42 free(nodes->counters); in tst_nodemap_free()
[all …]
|
| /third_party/node/deps/npm/node_modules/@npmcli/query/lib/ |
| D | index.js | 17 for (const selectorAstNode of astNode.nodes) {
18 const [firstAstNode] = selectorAstNode.nodes
24 const lastSelectorAstNode = astNode.nodes.pop()
25 const [attributeAstNode] = lastSelectorAstNode.nodes
62 astNode.nodes.length = 0
75 newRootNode.nodes = [...astNode.nodes]
79 astNode.nodes.length = 0
80 for (const currAstNode of newRootNode.nodes) {
92 const children = astNode.nodes.shift().nodes
98 if (astNode.nodes.length === 2) {
[all …]
|
| /third_party/ltp/testcases/kernel/syscalls/set_mempolicy/ |
| D | set_mempolicy04.c | 39 static struct tst_nodemap *nodes; variable
45 nodes = tst_get_nodemap(TST_NUMA_MEM, 20 * FILES * page_size / 1024); in setup()
46 if (nodes->cnt <= 1) in setup()
52 tst_nodemap_free(nodes); in cleanup()
62 tst_nodemap_reset_counters(nodes); in alloc_and_check()
69 for (j = 1; j <= nodes->cnt; j++) { in alloc_and_check()
72 alloc_fault_count(nodes, path, size * page_size); in alloc_and_check()
77 for (i = 0; i < nodes->cnt; i++) { in alloc_and_check()
79 float min_pages = 1.00 * total_pages / nodes->cnt - treshold; in alloc_and_check()
80 float max_pages = 1.00 * total_pages / nodes->cnt + treshold; in alloc_and_check()
[all …]
|
| D | set_mempolicy01.c | 27 static struct tst_nodemap *nodes; variable
35 nodes = tst_get_nodemap(TST_NUMA_MEM, 2 * PAGES_ALLOCATED * page_size / 1024); in setup()
36 if (nodes->cnt <= 1) in setup()
42 tst_nodemap_free(nodes); in cleanup()
73 tst_nodemap_reset_counters(nodes); in verify_mempolicy()
74 alloc_fault_count(nodes, NULL, PAGES_ALLOCATED * page_size); in verify_mempolicy()
75 tst_nodemap_print_counters(nodes); in verify_mempolicy()
77 for (i = 0; i < nodes->cnt; i++) { in verify_mempolicy()
78 if (nodes->map[i] == node) { in verify_mempolicy()
79 if (nodes->counters[i] == PAGES_ALLOCATED) { in verify_mempolicy()
[all …]
|
| D | set_mempolicy03.c | 28 static struct tst_nodemap *nodes; variable
34 nodes = tst_get_nodemap(TST_NUMA_MEM, 2 * PAGES_ALLOCATED * page_size / 1024); in setup()
35 if (nodes->cnt <= 1) in setup()
41 tst_nodemap_free(nodes); in cleanup()
65 tst_nodemap_reset_counters(nodes); in verify_mempolicy()
66 alloc_fault_count(nodes, MNTPOINT "/numa-test-file", PAGES_ALLOCATED * page_size); in verify_mempolicy()
68 for (i = 0; i < nodes->cnt; i++) { in verify_mempolicy()
69 if (nodes->map[i] == node) { in verify_mempolicy()
70 if (nodes->counters[i] == PAGES_ALLOCATED) { in verify_mempolicy()
75 node, nodes->counters[i], PAGES_ALLOCATED); in verify_mempolicy()
[all …]
|
| D | set_mempolicy02.c | 30 static struct tst_nodemap *nodes; variable
36 nodes = tst_get_nodemap(TST_NUMA_MEM, 2 * ALLOC_ON_NODE * page_size / 1024); in setup()
37 if (nodes->cnt <= 1) in setup()
43 tst_nodemap_free(nodes); in cleanup()
56 tst_nodemap_reset_counters(nodes); in alloc_and_check()
57 alloc_fault_count(nodes, NULL, size * page_size); in alloc_and_check()
59 for (i = 0; i < nodes->cnt; i++) { in alloc_and_check()
60 if (nodes->counters[i] == exp_alloc[i]) { in alloc_and_check()
62 prefix, nodes->map[i], exp_alloc[i]); in alloc_and_check()
65 prefix, nodes->map[i], nodes->counters[i], in alloc_and_check()
[all …]
|
| /third_party/ltp/testcases/kernel/syscalls/mbind/ |
| D | mbind03.c | 26 static struct tst_nodemap *nodes; variable
32 nodes = tst_get_nodemap(TST_NUMA_MEM, 2 * page_size / 1024); in setup()
33 if (nodes->cnt <= 1) in setup()
39 tst_nodemap_free(nodes); in cleanup()
51 tst_nodemap_reset_counters(nodes); in verify_policy()
53 tst_nodemap_count_pages(nodes, ptr, size); in verify_policy()
54 tst_nodemap_print_counters(nodes); in verify_policy()
56 for (i = 0; i < nodes->cnt; i++) { in verify_policy()
57 if (!nodes->counters[i]) { in verify_policy()
58 node = nodes->map[i]; in verify_policy()
[all …]
|
| D | mbind04.c | 26 static struct tst_nodemap *nodes; variable
34 nodes = tst_get_nodemap(TST_NUMA_MEM, 2 * PAGES_ALLOCATED * page_size / 1024); in setup()
35 if (nodes->cnt <= 1) in setup()
41 tst_nodemap_free(nodes); in cleanup()
78 tst_nodemap_reset_counters(nodes); in verify_policy()
80 tst_nodemap_count_pages(nodes, ptr, size); in verify_policy()
85 for (i = 0; i < nodes->cnt; i++) { in verify_policy()
86 if (nodes->map[i] == node) { in verify_policy()
87 if (nodes->counters[i] == PAGES_ALLOCATED) { in verify_policy()
92 prefix, node, nodes->counters[i], in verify_policy()
[all …]
|
| /third_party/ffmpeg/libavcodec/ |
| D | huffman.c | 117 Node *nodes, int node, in get_tree_codes() argument
122 s = nodes[node].sym; in get_tree_codes()
123 if (s != HNODE || (no_zero_count && !nodes[node].count)) { in get_tree_codes()
131 get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0, pfx, pl, in get_tree_codes()
134 get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0 + 1, pfx, pl, in get_tree_codes()
139 static int build_huff_tree(VLC *vlc, Node *nodes, int head, int flags, int nb_bits) in build_huff_tree() argument
147 get_tree_codes(bits, lens, xlat, nodes, head, 0, 0, in build_huff_tree()
158 Node *nodes, HuffCmp cmp, int flags) in ff_huff_build_tree() argument
165 nodes[i].sym = i; in ff_huff_build_tree()
166 nodes[i].n0 = -2; in ff_huff_build_tree()
[all …]
|
| D | mvha.c | 58 Node *nodes, int node, in get_tree_codes() argument
63 s = nodes[node].sym; in get_tree_codes()
72 get_tree_codes(bits, lens, xlat, nodes, nodes[node].l, pfx, pl, in get_tree_codes()
75 get_tree_codes(bits, lens, xlat, nodes, nodes[node].r, pfx, pl, in get_tree_codes()
83 Node nodes[512]; in build_vlc() local
92 nodes[i].count = s->prob[i]; in build_vlc()
93 nodes[i].sym = s->symb[i]; in build_vlc()
94 nodes[i].n0 = -2; in build_vlc()
95 nodes[i].l = i; in build_vlc()
96 nodes[i].r = i; in build_vlc()
[all …]
|
| /third_party/node/deps/v8/src/compiler/ |
| D | common-node-cache.cc | 24 void CommonNodeCache::GetCachedNodes(ZoneVector<Node*>* nodes) { in GetCachedNodes() argument
25 int32_constants_.GetCachedNodes(nodes); in GetCachedNodes()
26 int64_constants_.GetCachedNodes(nodes); in GetCachedNodes()
27 tagged_index_constants_.GetCachedNodes(nodes); in GetCachedNodes()
28 float32_constants_.GetCachedNodes(nodes); in GetCachedNodes()
29 float64_constants_.GetCachedNodes(nodes); in GetCachedNodes()
30 external_constants_.GetCachedNodes(nodes); in GetCachedNodes()
31 pointer_constants_.GetCachedNodes(nodes); in GetCachedNodes()
32 number_constants_.GetCachedNodes(nodes); in GetCachedNodes()
33 heap_constants_.GetCachedNodes(nodes); in GetCachedNodes()
[all …]
|
| /third_party/python/Doc/tools/extensions/ |
| D | pyspecific.py | 21 from docutils import nodes, utils
31 from sphinx.util.nodes import split_explicit_title
62 refnode = nodes.reference(text, text, refuri=ISSUE_URI % issue)
72 refnode = nodes.reference(title, title, refuri=SOURCE_URI % target)
89 pnode = nodes.compound(classes=['impl-detail'])
92 add_text = nodes.strong(label, label)
95 pnode.append(nodes.paragraph('', '', *(n + m)))
97 if pnode.children and isinstance(pnode[0], nodes.paragraph):
98 content = nodes.inline(pnode[0].rawsource, translatable=True)
102 pnode[0].replace_self(nodes.paragraph('', '', content,
[all …]
|
| /third_party/node/deps/cares/src/lib/ |
| D | ares__addrinfo_localhost.c | 42 struct ares_addrinfo_node **nodes) in ares_append_ai_node() argument
46 node = ares__append_addrinfo_node(nodes); in ares_append_ai_node()
100 struct ares_addrinfo_node **nodes) in ares__default_loopback_addrs() argument
108 status = ares_append_ai_node(AF_INET6, port, 0, &addr6, nodes); in ares__default_loopback_addrs()
119 status = ares_append_ai_node(AF_INET, port, 0, &addr4, nodes); in ares__default_loopback_addrs()
132 struct ares_addrinfo_node **nodes) in ares__system_loopback_addrs() argument
139 *nodes = NULL; in ares__system_loopback_addrs()
156 nodes); in ares__system_loopback_addrs()
162 nodes); in ares__system_loopback_addrs()
176 if (*nodes == NULL) in ares__system_loopback_addrs()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | SpillPlacement.cpp | 156 bool update(const Node nodes[], const BlockFrequency &Threshold) { in update()
161 if (nodes[I->second].Value == -1) in update()
163 else if (nodes[I->second].Value == 1) in update()
186 const Node nodes[]) const { in getDissentingNeighbors()
191 if (Value != nodes[n].Value) in getDissentingNeighbors()
202 assert(!nodes && "Leaking node array"); in runOnMachineFunction()
203 nodes = new Node[bundles->getNumBundles()]; in runOnMachineFunction()
221 delete[] nodes; in releaseMemory()
222 nodes = nullptr; in releaseMemory()
232 nodes[n].clear(Threshold); in activate()
[all …]
|
| /third_party/ltp/testcases/kernel/syscalls/move_pages/ |
| D | move_pages_support.c | 63 int alloc_pages_on_nodes(void **pages, unsigned int num, int *nodes) in alloc_pages_on_nodes() argument
78 pages[i] = numa_alloc_onnode(onepage, nodes[i]); in alloc_pages_on_nodes()
82 "%d failed", nodes[i]); in alloc_pages_on_nodes()
112 int nodes[num]; in alloc_pages_linear() local
127 nodes[i] = allowed_nodes[n]; in alloc_pages_linear()
135 return alloc_pages_on_nodes(pages, num, nodes); in alloc_pages_linear()
153 int nodes[num]; in alloc_pages_on_node() local
156 nodes[i] = node; in alloc_pages_on_node()
158 return alloc_pages_on_nodes(pages, num, nodes); in alloc_pages_on_node()
169 verify_pages_on_nodes(void **pages, int *status, unsigned int num, int *nodes) in verify_pages_on_nodes() argument
[all …]
|
| /third_party/node/deps/brotli/c/enc/ |
| D | backward_references_hq.c | 248 static BROTLI_INLINE void UpdateZopfliNode(ZopfliNode* nodes, size_t pos, in UpdateZopfliNode() argument
251 ZopfliNode* next = &nodes[pos + len]; in UpdateZopfliNode()
303 const ZopfliNode* nodes, in ComputeMinimumCopyLength() argument
311 while (pos + len <= num_bytes && nodes[pos + len].u.cost <= min_cost) { in ComputeMinimumCopyLength()
333 const ZopfliNode* nodes) { in ComputeDistanceShortcut() argument
334 const size_t clen = ZopfliNodeCopyLength(&nodes[pos]); in ComputeDistanceShortcut()
335 const size_t ilen = nodes[pos].dcode_insert_length & 0x7FFFFFF; in ComputeDistanceShortcut()
336 const size_t dist = ZopfliNodeCopyDistance(&nodes[pos]); in ComputeDistanceShortcut()
346 ZopfliNodeDistanceCode(&nodes[pos]) > 0) { in ComputeDistanceShortcut()
349 return nodes[pos - clen - ilen].u.shortcut; in ComputeDistanceShortcut()
[all …]
|