/third_party/node/tools/gyp/pylib/gyp/ |
H A 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 [all...] |
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/ |
H A 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 [all...] |
/third_party/skia/third_party/externals/spirv-tools/test/util/ |
H A 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() 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 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() 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 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() 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...] |
/foundation/graphic/graphic_2d/rosen/modules/render_service_client/test/ |
H A D | render_service_client_node_demo.cpp | 29 std::vector<std::shared_ptr<RSCanvasNode>> nodes; variable 40 nodes.emplace_back(RSCanvasNode::Create()); in Init() 41 nodes[0]->SetBounds(400, 200, 400, 400); in Init() 42 nodes[0]->SetFrame(400, 200, 400, 400); in Init() 43 nodes[0]->SetBackgroundColor(SK_ColorBLUE); in Init() 45 nodes.emplace_back(RSCanvasNode::Create()); in Init() 46 nodes[1]->SetBounds(400, 650, 400, 400); in Init() 47 nodes[1]->SetFrame(400, 650, 400, 400); in Init() 48 nodes[1]->SetBackgroundColor(SK_ColorBLUE); in Init() 50 nodes in Init() [all...] |
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
H A 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, 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/jinja2/ |
H A D | parser.py | 1 """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 D | meta.py | 6 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...] |
/kernel/linux/linux-6.6/lib/ |
H A D | interval_tree.c | 21 * Roll nodes[1] into nodes[0] by advancing nodes[1] to the end of a contiguous 22 * span of nodes. This makes nodes[0]->last the end of that contiguous used span 23 * indexes that started at the original nodes[1]->start. nodes[1] is now the 24 * first node starting the next used span. A hole span is between nodes[0]->last 25 * and nodes[1]->start. nodes[ [all...] |
/third_party/ffmpeg/libavformat/ |
H A D | concat.c | 42 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 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 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 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() 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 D | set_mempolicy04.c | 14 * 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 D | set_mempolicy02.c | 9 * 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 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() 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/node/deps/v8/src/compiler/ |
H A 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/ffmpeg/libavcodec/ |
H A D | huffman.c | 119 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...] |
/third_party/ltp/testcases/kernel/syscalls/mbind/ |
H A 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() 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 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() 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...] |
/kernel/linux/linux-5.10/drivers/gpu/drm/selftests/ |
H A D | test-drm_mm.c | 268 struct drm_mm_node nodes[2]; in igt_debug() local 271 /* Create a small drm_mm with a couple of nodes and a few holes, and in igt_debug() 277 memset(nodes, 0, sizeof(nodes)); in igt_debug() 278 nodes[0].start = 512; in igt_debug() 279 nodes[0].size = 1024; in igt_debug() 280 ret = drm_mm_reserve_node(&mm, &nodes[0]); in igt_debug() 283 nodes[0].start, nodes[0].size); in igt_debug() 287 nodes[ in igt_debug() 376 struct drm_mm_node tmp, *nodes, *node, *next; __igt_reserve() local 574 struct drm_mm_node *nodes, *node, *next; __igt_insert() local 881 struct drm_mm_node *nodes, *node, *next; __igt_insert_range() local 1037 prepare_igt_frag(struct drm_mm *mm, struct drm_mm_node *nodes, unsigned int num_insert, const struct insert_mode *mode) prepare_igt_frag() argument 1063 get_insert_time(struct drm_mm *mm, unsigned int num_insert, struct drm_mm_node *nodes, const struct insert_mode *mode) get_insert_time() argument 1087 struct drm_mm_node *nodes, *node, *next; igt_frag() local 1158 struct drm_mm_node *nodes, *node, *next; igt_align() local 1304 evict_nodes(struct drm_mm_scan *scan, struct evict_node *nodes, unsigned int *order, unsigned int count, bool use_color, struct list_head *evict_list) evict_nodes() argument 1351 evict_nothing(struct drm_mm *mm, unsigned int total_size, struct evict_node *nodes) evict_nothing() argument 1398 evict_everything(struct drm_mm *mm, unsigned int total_size, struct evict_node *nodes) evict_everything() argument 1447 evict_something(struct drm_mm *mm, u64 range_start, u64 range_end, struct evict_node *nodes, unsigned int *order, unsigned int count, unsigned int size, unsigned int alignment, const struct insert_mode *mode) evict_something() argument 1524 struct evict_node *nodes; igt_evict() local 1637 struct evict_node *nodes; igt_evict_range() local 1738 struct drm_mm_node *nodes, *node, *next; igt_topdown() local 1852 struct drm_mm_node *nodes, *node, *next; igt_bottomup() local 2189 evict_color(struct drm_mm *mm, u64 range_start, u64 range_end, struct evict_node *nodes, unsigned int *order, unsigned int count, unsigned int size, unsigned int alignment, unsigned long color, const struct insert_mode *mode) evict_color() argument 2265 struct evict_node *nodes; igt_color_evict() local 2368 struct evict_node *nodes; igt_color_evict_range() local [all...] |
/third_party/node/deps/cares/src/lib/ |
H A D | ares__addrinfo_localhost.c | 59 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/mem/ksm/ |
H A D | ksm06.c | 12 * 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/ltp/testcases/kernel/syscalls/move_pages/ |
H A D | move_pages_support.c | 52 * 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...] |
/kernel/linux/linux-6.6/drivers/net/ethernet/wangxun/txgbe/ |
H A D | txgbe_phy.c | 25 struct txgbe_nodes *nodes = &txgbe->nodes; in txgbe_swnodes_register() local 32 snprintf(nodes->gpio_name, sizeof(nodes->gpio_name), "txgbe_gpio-%x", id); in txgbe_swnodes_register() 33 snprintf(nodes->i2c_name, sizeof(nodes->i2c_name), "txgbe_i2c-%x", id); in txgbe_swnodes_register() 34 snprintf(nodes->sfp_name, sizeof(nodes->sfp_name), "txgbe_sfp-%x", id); in txgbe_swnodes_register() 35 snprintf(nodes->phylink_name, sizeof(nodes in txgbe_swnodes_register() [all...] |