/linux-master/tools/testing/selftests/net/tcp_ao/lib/ |
H A D | setup.c | 77 struct dlist_t *next; member in struct:dlist_t 89 p->next = destructors_list; 98 struct dlist_t *p = destructors_list->next;
|
H A D | proc.c | 16 struct netstat *next; member in struct:netstat 29 ns = ns->next; 50 ret->next = ns; 198 ns = ns->next; 225 nsb = nsb->next; 249 nsb = nsb->next; 250 nsa = nsa->next; 267 ns = ns->next;
|
/linux-master/tools/testing/selftests/ |
H A D | kselftest_harness.h | 779 item->next = NULL; \ 784 item->next = NULL; \ 786 item->prev->next = item; \ 789 item->next = head; \ 790 item->next->prev = item; \ 808 struct __fixture_metadata *prev, *next; member in struct:__fixture_metadata 818 struct __test_xfail *prev, *next; member in struct:__test_xfail 860 struct __fixture_variant_metadata *prev, *next; member in struct:__fixture_variant_metadata 887 struct __test_metadata *prev, *next; member in struct:__test_metadata 1042 for (f = __fixture_list; f; f = f->next) { [all...] |
/linux-master/tools/perf/util/ |
H A D | annotate.c | 438 * Actual navigation will come next, with further understanding of how 1541 * to the next branch. 2300 * can associate it with the instructions till the next one. 2386 struct annotation_line *al, *next; local 2396 next = annotation_line__next(al, ¬es->src->source); 2397 end = next ? next->offset : len; 2553 struct rb_node *next; local 2556 next = rb_next(node); 2560 node = next; 3783 struct disasm_line *next; local [all...] |
/linux-master/net/unix/ |
H A D | af_unix.c | 3389 .next = unix_seq_next, 3522 * done with seq_show(), so advance to the next sk in 3585 .next = bpf_iter_unix_seq_next,
|
/linux-master/net/sched/ |
H A D | sch_generic.c | 153 struct sk_buff *next = skb->next; local 168 skb = next; 193 skb->next = nskb; 219 skb->next = nskb; 226 /* Note that dequeue_skb can possibly return a SKB list (via skb->next). 665 .next = (struct sk_buff *)&noop_qdisc.gso_skb, 671 .next = (struct sk_buff *)&noop_qdisc.skb_bad_txq, 1245 /* Delay activation until next carrier-on event */
|
/linux-master/net/netfilter/ |
H A D | nft_set_rbtree.c | 312 struct rb_node *node, *next, *parent, **p, *first = NULL; local 353 for (node = first; node != NULL; node = next) { 354 next = rb_next(node); 629 struct rb_node *node, *next; local 639 for (node = rb_first(&priv->root); node ; node = next) { 640 next = rb_next(node);
|
H A D | nft_set_hash.c | 687 struct hlist_node *next; local 691 hlist_for_each_entry_safe(he, next, &priv->table[i], node) {
|
H A D | nf_tables_api.c | 307 struct nft_hook *hook, *next; local 309 list_for_each_entry_safe(hook, next, hook_list, list) { 2084 struct nft_hook *hook, *next; local 2096 list_for_each_entry_safe(hook, next, 2169 struct nft_hook *hook, *next; local 2203 list_for_each_entry_safe(hook, next, hook_list, list) { 2344 struct nft_hook *h, *next; local 2346 list_for_each_entry_safe(h, next, &hook->list, list) { 2599 struct nft_hook *h, *next; local 2629 list_for_each_entry_safe(h, next, 3411 const struct nft_expr *expr, *next; local 3805 struct nft_expr *expr, *next; local 5311 struct nft_set_elem_catchall *next, *catchall; local 6735 struct nft_set_elem_catchall *catchall, *next; local 8405 struct nft_hook *hook, *next; local 8427 struct nft_hook *hook, *hook2, *next; local 8479 struct nft_hook *hook, *next; local 8493 struct nft_hook *hook, *next; local 8696 struct nft_hook *this, *next; local 9056 struct nft_hook *hook, *next; local 9529 struct nft_trans *trans, *next; local 9638 struct nft_trans *trans, *next; local 9802 struct nft_trans_gc *trans, *next; local 9942 struct nft_set_elem_catchall *catchall, *next; local 9972 struct nft_module_request *req, *next; local 10115 struct nft_set *set, *next; local 10146 struct nft_trans *trans, *next; local 10455 struct nft_module_request *req, *next; local 10505 struct nft_set *set, *next; local 10520 struct nft_trans *trans, *next; local [all...] |
/linux-master/net/ipv4/ |
H A D | fib_frontend.c | 1041 goto next; 1049 next:
|
/linux-master/net/core/ |
H A D | dev.c | 559 * will see the new packet type (until the next received packet). 3140 skb->next = __this_cpu_read(softnet_data.completion_queue); 3544 struct sk_buff *next = skb->next; local 3547 rc = xmit_one(skb, dev, txq, next != NULL); 3549 skb->next = next; 3553 skb = next; 3653 struct sk_buff *next, *head = NULL, *tail; local 3655 for (; skb != NULL; skb = next) { 5580 struct sk_buff *skb, *next; local 5612 struct sk_buff *skb, *next; local 5666 struct sk_buff *skb, *next; local 5751 struct sk_buff *skb, *next; local 5928 struct softnet_data *next = remsd->rps_ipi_next; local 6172 struct sk_buff *skb, *next; local 7078 struct net_device *udev, *next, *now, *dev_stack[MAX_NEST_DEV + 1]; local 7127 struct net_device *udev, *next, *now, *dev_stack[MAX_NEST_DEV + 1]; local 7301 struct net_device *ldev, *next, *now, *dev_stack[MAX_NEST_DEV + 1]; local 7348 struct net_device *ldev, *next, *now, *dev_stack[MAX_NEST_DEV + 1]; local 7486 struct net_device *ldev, *next, *now, *dev_stack[MAX_NEST_DEV + 1]; local [all...] |
/linux-master/net/bridge/ |
H A D | br_private.h | 347 struct net_bridge_port_group __rcu *next; member in struct:net_bridge_port_group 997 struct net_bridge_port_group __rcu *next,
|
/linux-master/mm/ |
H A D | shmem.c | 108 pgoff_t next; /* the next page offset to be fallocated */ member in struct:shmem_falloc 621 LIST_HEAD(list), *pos, *next; local 633 list_for_each_safe(pos, next, &sbinfo->shrinklist) { 642 goto next; 649 goto next; 653 next: 660 list_for_each_safe(pos, next, &to_remove) { 667 list_for_each_safe(pos, next, &list) { 1378 struct shmem_inode_info *info, *next; local [all...] |
H A D | page_owner.c | 41 struct stack *next; member in struct:stack 129 dummy_stack.next = &failure_stack; 185 stack->next = NULL; 188 stack->next = stack_list; 736 /* Record the next PFN to read in the file offset */ 887 stack = stack->next; 927 .next = stack_next,
|
H A D | memory-failure.c | 497 struct to_kill *tk, *next; local 499 list_for_each_entry_safe(tk, next, to_kill, nd) { 525 struct to_kill *tk, *next; local 527 list_for_each_entry_safe(tk, next, to_kill, nd) { 1105 * The EIO will be only reported on the next IO 1902 struct raw_hwp_page *p, *next; local 1906 llist_for_each_entry_safe(p, next, head, node) { 1921 struct raw_hwp_page *p, *next; local 1932 llist_for_each_entry_safe(p, next, head->first, node) { 2327 * handle the page next roun [all...] |
H A D | madvise.c | 349 unsigned long next = pmd_addr_end(addr, end); local 375 if (next - addr != HPAGE_PMD_SIZE) { 630 unsigned long next; local 632 next = pmd_addr_end(addr, end); 634 if (madvise_free_huge_pmd(tlb, vma, pmd, addr, next)) 885 * adjacent next vma that we'll walk 886 * next. userfaultfd_remove() will generate an
|
H A D | hugetlb.c | 1465 * next node from which to allocate, handling wrap at end of node 1484 * next node id whether or not we find a free huge page to free so 1485 * that the next attempt to free addresses the next node. 1828 node = node->next; 2373 * Remove huge page from pool from next node to free. Attempt to keep 2393 folio = list_entry(h->hugepage_freelists[node].next, 3314 /* allocate from next node when distributing huge pages */ 3719 struct folio *folio, *next; local 3721 list_for_each_entry_safe(folio, next, free [all...] |
H A D | huge_memory.c | 1803 pmd_t *pmd, unsigned long addr, unsigned long next) 1842 if (next - addr != HPAGE_PMD_SIZE) { 2715 /* Check if we need to split end next. */ 2719 * If we're also updating the next vma vm_start, 2723 struct vm_area_struct *next = find_vma(vma->vm_mm, vma->vm_end); local 2724 unsigned long nstart = next->vm_start; 2726 split_huge_pmd_if_needed(next, nstart); 3320 struct folio *folio, *next; local 3330 list_for_each_entry_safe(folio, next, &ds_queue->split_queue, 3344 list_for_each_entry_safe(folio, next, 1802 madvise_free_huge_pmd(struct mmu_gather *tlb, struct vm_area_struct *vma, pmd_t *pmd, unsigned long addr, unsigned long next) argument [all...] |
H A D | gup.c | 309 struct page *next = nth_page(start, i); local 310 struct folio *folio = page_folio(next); 315 folio_nr_pages(folio) - folio_page_idx(folio, next)); 391 * next writeback cycle. This is harmless. 1105 unsigned long now, next; 1118 now = jiffies; next = next_warn; 1119 if (next && time_before(now, next)) 1804 continue; /* continue at next VMA */ 2856 unsigned long next; local 3008 unsigned long next; local 3047 unsigned long next; local 3075 unsigned long next; local 3100 unsigned long next; local [all...] |
/linux-master/lib/ |
H A D | bootconfig.c | 43 * simply a key word or a value. A key node may have a next key node or/and 44 * a child node (both key and value). A value node may have a next value 163 * xbc_node_get_next() - Get the next sibling XBC node 166 * Return the NEXT sibling node of @node. If the node has no next sibling, 173 return node->next ? &xbc_nodes[node->next] : NULL; 334 * xbc_node_find_next_leaf() - Find the next leaf node under given node 338 * Search the next leaf node (which means the terminal key node) of @node 340 * Return the next node or NULL if next lea 345 struct xbc_node *next; local 615 char *next; local 699 char *next; local [all...] |
/linux-master/kernel/ |
H A D | fork.c | 1163 tsk->wake_q.next = NULL;
|
/linux-master/init/ |
H A D | main.c | 428 /* parse_args() stops at the next param of '--' and returns an address */ 1111 struct list_head next; member in struct:blacklist_entry 1138 list_add(&entry->next, &blacklisted_initcalls); 1163 list_for_each_entry(entry, &blacklisted_initcalls, next) {
|
/linux-master/include/net/ |
H A D | sch_generic.h | 33 struct qdisc_rate_table *next; member in struct:qdisc_rate_table 86 * dequeueing next packet. 287 struct Qdisc_ops *next; member in struct:Qdisc_ops 407 struct tcf_proto __rcu *next; member in struct:tcf_proto 988 skb->next = NULL; 989 last->next = skb; 1008 skb->next = qh->head; 1021 qh->head = skb->next; 1025 skb->next = NULL; 1079 skb->next [all...] |
/linux-master/include/linux/ |
H A D | bootconfig.h | 52 uint16_t next; member in struct:xbc_node
|
/linux-master/fs/fuse/ |
H A D | file.c | 420 struct fuse_writepage_args *next; member in struct:fuse_writepage_args 1799 struct fuse_writepage_args *aux, *next; variable in typeref:struct: 1840 for (aux = wpa->next; aux; aux = next) { 1841 next = aux->next; 1842 aux->next = NULL; 1866 wpa = list_entry(fi->queued_writes.next, 1930 while (wpa->next) { 1933 struct fuse_writepage_args *next local [all...] |