Home
last modified time | relevance | path

Searched refs:node1 (Results 1 – 12 of 12) sorted by relevance

/linux/tools/testing/selftests/drivers/net/netdevsim/
H A Ddevlink.sh883 local node1="$DL_HANDLE/$node1_name"
884 rate_node_add "$node1"
885 check_err $? "Failed to add node $node1"
892 rate_attr_tx_rate_check $node1 tx_share $node_tx_share \
893 $DEBUGFS_DIR/rate_nodes/${node1##*/}/tx_share
896 rate_attr_tx_rate_check $node1 tx_max $node_tx_max \
897 $DEBUGFS_DIR/rate_nodes/${node1##*/}/tx_max
901 rate_attr_tc_bw_check $node1 "$tc_bw" \
902 "$DEBUGFS_DIR"/rate_nodes/"${node1##*/}"
905 rate_node_del "$node1"
[all...]
/linux/drivers/pci/hotplug/
H A Dcpqphp_ctrl.c815 struct pci_resource *node1; in cpqhp_resource_sort_and_combine() local
837 node1 = *head; in cpqhp_resource_sort_and_combine()
839 node1->next = (*head)->next; in cpqhp_resource_sort_and_combine()
840 (*head)->next = node1; in cpqhp_resource_sort_and_combine()
844 node1 = (*head); in cpqhp_resource_sort_and_combine()
846 while (node1->next && node1->next->next) { in cpqhp_resource_sort_and_combine()
847 if (node1->next->base > node1->next->next->base) { in cpqhp_resource_sort_and_combine()
849 node2 = node1->next; in cpqhp_resource_sort_and_combine()
850 node1->next = node1->next->next; in cpqhp_resource_sort_and_combine()
851 node1 = node1->next; in cpqhp_resource_sort_and_combine()
[all …]
/linux/lib/
H A Dunion_find.c33 void uf_union(struct uf_node *node1, struct uf_node *node2) in uf_union() argument
35 struct uf_node *root1 = uf_find(node1); in uf_union()
/linux/drivers/scsi/aic7xxx/aicasm/
H A Daicasm_symbol.c300 symbol_node_t *node1, *node2; in symlist_free() local
302 node1 = SLIST_FIRST(symlist); in symlist_free()
303 while (node1 != NULL) { in symlist_free()
304 node2 = SLIST_NEXT(node1, links); in symlist_free()
305 free(node1); in symlist_free()
306 node1 = node2; in symlist_free()
/linux/tools/verification/rvgen/rvgen/
H A Dltl2ba.py211 node1 = GraphNode(node.incoming,
219 return node2.expand(node1.expand(node_set))
233 node1 = GraphNode(node.incoming,
241 return node2.expand(node1.expand(node_set))
255 node1 = GraphNode(node.incoming,
263 return node2.expand(node1.expand(node_set))
/linux/include/linux/
H A Dunion_find.h39 void uf_union(struct uf_node *node1, struct uf_node *node2);
H A Drculist.h637 struct hlist_node *node1 = left->first; in hlists_swap_heads_rcu() local
641 rcu_assign_pointer(right->first, node1); in hlists_swap_heads_rcu()
643 WRITE_ONCE(node1->pprev, &right->first); in hlists_swap_heads_rcu()
/linux/tools/testing/selftests/alsa/
H A Dpcm-test.c125 snd_config_t *pcm_config, *node1, *node2; in missing_devices() local
133 node1 = snd_config_iterator_entry(i1); in missing_devices()
134 device = device_from_id(node1); in missing_devices()
137 if (snd_config_get_type(node1) != SND_CONFIG_TYPE_COMPOUND) in missing_devices()
139 snd_config_for_each(i2, next2, node1) { in missing_devices()
/linux/net/ipv4/
H A Dfib_trie.c554 struct key_vector *node0, *node1; in inflate() local
591 node1 = tnode_new(inode->key | m, inode->pos, inode->bits - 1); in inflate()
592 if (!node1) in inflate()
596 tnode_free_append(tn, node1); in inflate()
603 put_child(node1, --j, get_child(inode, --k)); in inflate()
605 put_child(node1, --j, get_child(inode, --k)); in inflate()
610 NODE_INIT_PARENT(node1, tn); in inflate()
614 put_child(tn, 2 * i + 1, node1); in inflate()
648 struct key_vector *node1 = get_child(oldtnode, --i); in halve() local
653 if (!node1 || !node0) { in halve()
[all …]
/linux/samples/damon/
H A DKconfig38 node0 is for DDR5 DRAMs connected via DIMM, while node1 is for DDR4
/linux/tools/perf/
H A Dbuiltin-kmem.c203 int node1, node2; in evsel__process_alloc_event()
205 node1 = cpu__get_node((struct perf_cpu){.cpu = sample->cpu}); in evsel__process_alloc_event()
212 if ((node2 != NUMA_NO_NODE) && (node1 != node2)) in evsel__process_alloc_event()
202 int node1, node2; evsel__process_alloc_event() local
/linux/Documentation/filesystems/
H A Dproc.rst716 node locality page counters (N0 == node0, N1 == node1, ...) and the kernel page