Home
last modified time | relevance | path

Searched refs:nodes (Results 1 - 25 of 375) sorted by relevance

12345678910>>...15

/third_party/node/tools/gyp/pylib/gyp/
H A Dinput_test.py15 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
[all...]
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/
H A Dinput_test.py15 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
[all...]
/third_party/skia/third_party/externals/spirv-tools/test/util/
H A Dilist_test.cpp49 TestNode nodes[10]; in TEST() local
52 nodes[i].data_ = i; in TEST()
53 list.push_back(&nodes[i]); in TEST()
63 // nodes to build the list.
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[1 in TEST() local
89 TestNode nodes[10]; TEST() local
96 TestNode nodes[10]; TEST() local
103 TestNode nodes[10]; TEST() local
113 TestNode nodes[10]; TEST() local
123 TestNode nodes[10]; TEST() local
135 TestNode nodes[10]; TEST() local
150 TestNode nodes[10]; TEST() local
165 TestNode nodes[10]; TEST() local
178 TestNode nodes[10]; TEST() local
191 TestNode nodes[10]; TEST() local
204 TestNode nodes[10]; TEST() local
217 TestNode nodes[10]; TEST() local
230 TestNode nodes[10]; TEST() local
243 TestNode nodes[10]; TEST() local
256 TestNode nodes[10]; TEST() local
274 TestNode nodes[10]; TEST() local
291 TestNode nodes[10]; TEST() local
308 TestNode nodes[10]; TEST() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/util/
H A Dilist_test.cpp49 TestNode nodes[10]; in TEST() local
52 nodes[i].data_ = i; in TEST()
53 list.push_back(&nodes[i]); in TEST()
63 // nodes to build the list.
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[1 in TEST() local
89 TestNode nodes[10]; TEST() local
96 TestNode nodes[10]; TEST() local
103 TestNode nodes[10]; TEST() local
113 TestNode nodes[10]; TEST() local
123 TestNode nodes[10]; TEST() local
135 TestNode nodes[10]; TEST() local
150 TestNode nodes[10]; TEST() local
165 TestNode nodes[10]; TEST() local
178 TestNode nodes[10]; TEST() local
191 TestNode nodes[10]; TEST() local
204 TestNode nodes[10]; TEST() local
217 TestNode nodes[10]; TEST() local
230 TestNode nodes[10]; TEST() local
243 TestNode nodes[10]; TEST() local
256 TestNode nodes[10]; TEST() local
274 TestNode nodes[10]; TEST() local
291 TestNode nodes[10]; TEST() local
308 TestNode nodes[10]; TEST() local
[all...]
/third_party/spirv-tools/test/util/
H A Dilist_test.cpp49 TestNode nodes[10]; in TEST() local
52 nodes[i].data_ = i; in TEST()
53 list.push_back(&nodes[i]); in TEST()
63 // nodes to build the list.
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[1 in TEST() local
89 TestNode nodes[10]; TEST() local
96 TestNode nodes[10]; TEST() local
103 TestNode nodes[10]; TEST() local
113 TestNode nodes[10]; TEST() local
123 TestNode nodes[10]; TEST() local
135 TestNode nodes[10]; TEST() local
150 TestNode nodes[10]; TEST() local
165 TestNode nodes[10]; TEST() local
178 TestNode nodes[10]; TEST() local
191 TestNode nodes[10]; TEST() local
204 TestNode nodes[10]; TEST() local
217 TestNode nodes[10]; TEST() local
230 TestNode nodes[10]; TEST() local
243 TestNode nodes[10]; TEST() local
256 TestNode nodes[10]; TEST() local
274 TestNode nodes[10]; TEST() local
291 TestNode nodes[10]; TEST() local
308 TestNode nodes[10]; TEST() local
[all...]
/third_party/jinja2/
H A Dparser.py1 """Parse tokens from the lexer into nodes for the compiler."""
5 from . import nodes namespace
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
[all...]
H A Dmeta.py6 from . import nodes namespace
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
[all...]
H A Dext.py9 from . import nodes namespace
117 def parse(self, parser: "Parser") -> t.Union[nodes.Node, t.List[nodes.Node]]:
121 list of multiple nodes.
127 ) -> nodes.ExtensionAttribute:
135 return nodes.ExtensionAttribute(self.identifier, name, lineno=lineno)
140 args: t.Optional[t.List[nodes.Expr]] = None,
141 kwargs: t.Optional[t.List[nodes.Keyword]] = None,
142 dyn_args: t.Optional[nodes.Expr] = None,
143 dyn_kwargs: t.Optional[nodes
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles_test.cc77 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, Edge argument
136 CheckEdges(Nodes *nodes, Edges *edges, const IdMap &id, GraphCycles *gc) CheckEdges() argument
169 RandomNode(RandomEngine* rng, Nodes *nodes) RandomNode() argument
193 Nodes nodes; TEST() local
[all...]
/third_party/ffmpeg/libavformat/
H A Dconcat.c42 struct concat_nodes *nodes; ///< list of nodes to concat member
43 size_t length; ///< number of cat'ed nodes
53 struct concat_nodes *nodes = data->nodes; in concat_close() local
56 err |= ffurl_closep(&nodes[i].uc); in concat_close()
58 av_freep(&data->nodes); in concat_close()
72 struct concat_nodes *nodes; in concat_open() local
85 if (!(nodes = av_realloc_array(NULL, len, sizeof(*nodes)))) in concat_open()
138 struct concat_nodes *nodes = data->nodes; concat_read() local
163 struct concat_nodes *nodes = data->nodes; concat_seek() local
245 struct concat_nodes *nodes; concatf_open() local
[all...]
/third_party/ltp/libs/libltpnuma/
H A Dtst_numa.c20 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
67 inc_counter(unsigned int node, struct tst_nodemap *nodes) inc_counter() argument
79 tst_nodemap_count_pages(struct tst_nodemap *nodes, void *ptr, size_t size) tst_nodemap_count_pages() argument
184 struct tst_nodemap *nodes; tst_get_nodemap() local
[all...]
/third_party/ltp/testcases/kernel/syscalls/set_mempolicy/
H A Dset_mempolicy01.c27 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()
37 tst_brk(TCONF, "Test requires at least two NUMA memory nodes"); in setup()
41 * has multiple NUMA nodes, the test matrix combination grows exponentially in setup()
44 * Here reset the maximum runtime according to the NUMA nodes. in setup()
46 tst_set_max_runtime(test.max_runtime * (1 << nodes->cnt/16)); in setup()
51 tst_nodemap_free(nodes); in cleanup()
82 tst_nodemap_reset_counters(nodes); in verify_mempolicy()
83 alloc_fault_count(nodes, NUL in verify_mempolicy()
[all...]
H A Dset_mempolicy04.c14 * divideable by the number of nodes, which will not happen even if we tried
39 static struct tst_nodemap *nodes; variable
47 nodes = tst_get_nodemap(TST_NUMA_MEM, node_min_pages * page_size / 1024); in setup()
48 if (nodes->cnt <= 1) in setup()
49 tst_brk(TCONF, "Test requires at least two NUMA memory nodes"); in setup()
54 tst_nodemap_free(nodes); in cleanup()
64 tst_nodemap_reset_counters(nodes); in alloc_and_check()
68 * be evenly distributed among the nodes. in alloc_and_check()
71 for (j = 1; j <= nodes->cnt; j++) { in alloc_and_check()
74 alloc_fault_count(nodes, pat in alloc_and_check()
[all...]
H A Dset_mempolicy02.c9 * The test tries different subsets of memory nodes, sets the mask with
10 * memopolicy, and checks that the memory was interleaved between the nodes
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()
38 tst_brk(TCONF, "Test requires at least two NUMA memory nodes"); 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 in alloc_and_check()
[all...]
H A Dset_mempolicy03.c28 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()
36 tst_brk(TCONF, "Test requires at least two NUMA memory nodes"); 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 in verify_mempolicy()
[all...]
/third_party/ffmpeg/libavcodec/
H A Dhuffman.c119 Node *nodes, int node, in get_tree_codes()
124 s = nodes[node].sym; in get_tree_codes()
125 if (s != HNODE || (no_zero_count && !nodes[node].count)) { in get_tree_codes()
133 get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0, pfx, pl, in get_tree_codes()
136 get_tree_codes(bits, lens, xlat, nodes, nodes[node].n0 + 1, pfx, pl, in get_tree_codes()
141 static int build_huff_tree(VLC *vlc, Node *nodes, int head, int flags, int nb_bits) in build_huff_tree() argument
149 get_tree_codes(bits, lens, xlat, nodes, head, 0, 0, in build_huff_tree()
156 * nodes siz
118 get_tree_codes(uint32_t *bits, int16_t *lens, uint8_t *xlat, Node *nodes, int node, uint32_t pfx, int pl, int *pos, int no_zero_count) get_tree_codes() argument
159 ff_huff_build_tree(void *logctx, VLC *vlc, int nb_codes, int nb_bits, Node *nodes, HuffCmp cmp, int flags) ff_huff_build_tree() argument
[all...]
H A Dmvha.c60 Node *nodes, int node, in get_tree_codes()
65 s = nodes[node].sym; in get_tree_codes()
74 get_tree_codes(bits, lens, xlat, nodes, nodes[node].l, pfx, pl, in get_tree_codes()
77 get_tree_codes(bits, lens, xlat, nodes, nodes[node].r, pfx, pl, in get_tree_codes()
85 Node nodes[512]; in build_vlc() local
94 nodes[i].count = s->prob[i]; in build_vlc()
95 nodes[i].sym = s->symb[i]; in build_vlc()
96 nodes[ in build_vlc()
59 get_tree_codes(uint32_t *bits, int16_t *lens, uint8_t *xlat, Node *nodes, int node, uint32_t pfx, int pl, int *pos) get_tree_codes() argument
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dcommon-node-cache.cc24 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/ltp/testcases/kernel/syscalls/mbind/
H A Dmbind03.c26 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()
34 tst_brk(TCONF, "Test requires at least two NUMA memory nodes"); 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 in verify_policy()
[all...]
H A Dmbind04.c26 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()
36 tst_brk(TCONF, "Test requires at least two NUMA memory nodes"); 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 in verify_policy()
[all...]
/third_party/node/deps/cares/src/lib/
H A Dares__addrinfo_localhost.c59 struct ares_addrinfo_node **nodes) in ares_append_ai_node()
63 node = ares__append_addrinfo_node(nodes); in ares_append_ai_node()
111 struct ares_addrinfo_node **nodes) in ares__default_loopback_addrs()
118 status = ares_append_ai_node(AF_INET6, port, 0, &addr6, nodes); in ares__default_loopback_addrs()
127 status = ares_append_ai_node(AF_INET, port, 0, &addr4, nodes); in ares__default_loopback_addrs()
138 struct ares_addrinfo_node **nodes) in ares__system_loopback_addrs()
146 *nodes = NULL; in ares__system_loopback_addrs()
161 &table->Table[i].Address.Ipv4.sin_addr, nodes); in ares__system_loopback_addrs()
165 &table->Table[i].Address.Ipv6.sin6_addr, nodes); in ares__system_loopback_addrs()
176 if (*nodes in ares__system_loopback_addrs()
57 ares_append_ai_node(int aftype, unsigned short port, unsigned int ttl, const void *adata, struct ares_addrinfo_node **nodes) ares_append_ai_node() argument
110 ares__default_loopback_addrs(int aftype, unsigned short port, struct ares_addrinfo_node **nodes) ares__default_loopback_addrs() argument
137 ares__system_loopback_addrs(int aftype, unsigned short port, struct ares_addrinfo_node **nodes) ares__system_loopback_addrs() argument
203 struct ares_addrinfo_node *nodes = NULL; ares__addrinfo_localhost() local
[all...]
/third_party/ltp/testcases/kernel/syscalls/move_pages/
H A Dmove_pages_support.c52 * alloc_pages_on_nodes() - allocate pages on specified NUMA nodes
55 * @nodes: array of NUMA nodes
57 * A page will be allocated in each node specified by @nodes, and the
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]; alloc_pages_on_node() local
169 verify_pages_on_nodes(void **pages, int *status, unsigned int num, int *nodes) verify_pages_on_nodes() argument
220 int nodes[num]; verify_pages_linear() local
252 int nodes[num]; verify_pages_on_node() local
275 int nodes[num]; alloc_shared_pages_on_node() local
[all...]
/third_party/ltp/testcases/kernel/mem/ksm/
H A Dksm06.c12 * node are merged, otherwise pages from all nodes can be merged
47 static struct tst_nodemap *nodes; variable
59 memory = SAFE_MALLOC(nodes->cnt * sizeof(char *)); in test_ksm()
60 for (i = 0; i < nodes->cnt; i++) { in test_ksm()
69 numa_bitmask_setbit(bm, nodes->map[i]); in test_ksm()
75 numa_bitmask_clearbit(bm, nodes->map[i]); in test_ksm()
88 nr_pages * nodes->cnt); in test_ksm()
98 "%ld", nr_pages * nodes->cnt); in test_ksm()
102 ksm_group_check(1, 1, nr_pages * nodes->cnt - 1, 0, 0, 0, in test_ksm()
103 nr_pages * nodes in test_ksm()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DSpillPlacement.cpp77 /// value can change when linked nodes change, but convergence is very fast
102 // Undecided nodes (Value==0) go on the stack. in preferReg()
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()
[all...]
/third_party/python/Lib/lib2to3/
H A Dpatcomp.py100 nodes = node.children
101 if len(nodes) >= 3 and nodes[1].type == token.EQUAL:
102 name = nodes[0].value
103 nodes = nodes[2:]
105 if len(nodes) >= 2 and nodes[-1].type == self.syms.Repeater:
106 repeat = nodes[-1]
107 nodes
[all...]

Completed in 12 milliseconds

12345678910>>...15