Home
last modified time | relevance | path

Searched refs:n_list (Results 1 – 23 of 23) sorted by relevance

/Linux-v4.19/net/netfilter/ipvs/
Dip_vs_wrr.c80 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
101 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_max_weight()
122 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_init_svc()
149 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_dest_changed()
184 n_list) { in ip_vs_wrr_schedule()
201 &last->n_list == &svc->destinations) in ip_vs_wrr_schedule()
207 &last->n_list != &svc->destinations) { in ip_vs_wrr_schedule()
248 .n_list = LIST_HEAD_INIT(ip_vs_wrr_scheduler.n_list),
Dip_vs_rr.c47 if (p == &dest->n_list) in ip_vs_rr_del_dest()
69 last = dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_rr_schedule()
74 n_list) { in ip_vs_rr_schedule()
94 svc->sched_data = &dest->n_list; in ip_vs_rr_schedule()
110 .n_list = LIST_HEAD_INIT(ip_vs_rr_scheduler.n_list),
Dip_vs_sched.c92 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in ip_vs_sched_getbyname()
191 if (!list_empty(&scheduler->n_list)) { in register_ip_vs_scheduler()
203 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in register_ip_vs_scheduler()
215 list_add(&scheduler->n_list, &ip_vs_schedulers); in register_ip_vs_scheduler()
235 if (list_empty(&scheduler->n_list)) { in unregister_ip_vs_scheduler()
245 list_del(&scheduler->n_list); in unregister_ip_vs_scheduler()
Dip_vs_pe.c28 list_for_each_entry_rcu(pe, &ip_vs_pe, n_list) { in __ip_vs_pe_getbyname()
76 list_for_each_entry(tmp, &ip_vs_pe, n_list) { in register_ip_vs_pe()
86 list_add_rcu(&pe->n_list, &ip_vs_pe); in register_ip_vs_pe()
100 list_del_rcu(&pe->n_list); in unregister_ip_vs_pe()
Dip_vs_wlc.c55 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
70 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
98 .n_list = LIST_HEAD_INIT(ip_vs_wlc_scheduler.n_list),
Dip_vs_sed.c83 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
98 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
126 .n_list = LIST_HEAD_INIT(ip_vs_sed_scheduler.n_list),
Dip_vs_fo.c37 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_fo_schedule()
62 .n_list = LIST_HEAD_INIT(ip_vs_fo_scheduler.n_list),
Dip_vs_ovf.c40 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_ovf_schedule()
69 .n_list = LIST_HEAD_INIT(ip_vs_ovf_scheduler.n_list),
Dip_vs_lc.c46 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
75 .n_list = LIST_HEAD_INIT(ip_vs_lc_scheduler.n_list),
Dip_vs_nq.c79 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
125 .n_list = LIST_HEAD_INIT(ip_vs_nq_scheduler.n_list),
Dip_vs_mh.c141 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_mh_permutate()
210 new_dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_mh_populate()
329 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_gcd_weight()
357 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_shift_weight()
516 .n_list = LIST_HEAD_INIT(ip_vs_mh_scheduler.n_list),
Dip_vs_dh.c124 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_dh_reassign()
253 .n_list = LIST_HEAD_INIT(ip_vs_dh_scheduler.n_list),
Dip_vs_lblc.c422 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
437 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
471 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
545 .n_list = LIST_HEAD_INIT(ip_vs_lblc_scheduler.n_list),
Dip_vs_sh.c191 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_sh_reassign()
358 .n_list = LIST_HEAD_INIT(ip_vs_sh_scheduler.n_list),
Dip_vs_pe_sip.c165 .n_list = LIST_HEAD_INIT(ip_vs_sip_pe.n_list),
Dip_vs_lblcr.c585 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
601 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
635 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
731 .n_list = LIST_HEAD_INIT(ip_vs_lblcr_scheduler.n_list),
Dip_vs_ctl.c608 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lookup_dest()
876 list_add_rcu(&dest->n_list, &svc->destinations); in __ip_vs_update_dest()
1104 list_del_rcu(&dest->n_list); in __ip_vs_unlink_dest()
1441 list_for_each_entry_safe(dest, nxt, &svc->destinations, n_list) { in __ip_vs_del_service()
1581 n_list) { in ip_vs_dst_event()
1590 n_list) { in ip_vs_dst_event()
1615 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_zero_service()
2084 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_info_seq_show()
2565 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_get_dest_entries()
3246 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_genl_dump_dests()
/Linux-v4.19/net/rds/
Drecv.c481 struct rds_notifier, n_list); in rds_notify_queue_get()
482 list_move(&notifier->n_list, &copy); in rds_notify_queue_get()
491 notifier = list_entry(copy.next, struct rds_notifier, n_list); in rds_notify_queue_get()
503 list_del_init(&notifier->n_list); in rds_notify_queue_get()
Dsend.c508 list_add_tail(&notifier->n_list, &rs->rs_notify_queue); in rds_rdma_send_complete()
544 list_add_tail(&notifier->n_list, &rs->rs_notify_queue); in rds_atomic_send_complete()
573 list_add_tail(&ro->op_notifier->n_list, &rs->rs_notify_queue); in __rds_send_complete()
580 list_add_tail(&ao->op_notifier->n_list, &rs->rs_notify_queue); in __rds_send_complete()
645 list_add_tail(&notifier->n_list, in rds_send_remove_from_sock()
Drds.h485 struct list_head n_list; member
/Linux-v4.19/fs/btrfs/
Ddelayed-inode.h47 struct list_head n_list; member
Ddelayed-inode.c48 INIT_LIST_HEAD(&delayed_node->n_list); in btrfs_init_delayed_node()
178 list_add_tail(&node->n_list, &root->node_list); in btrfs_queue_delayed_node()
195 list_del_init(&node->n_list); in btrfs_dequeue_delayed_node()
214 node = list_entry(p, struct btrfs_delayed_node, n_list); in btrfs_first_delayed_node()
236 } else if (list_is_last(&node->n_list, &delayed_root->node_list)) in btrfs_next_delayed_node()
239 p = node->n_list.next; in btrfs_next_delayed_node()
241 next = list_entry(p, struct btrfs_delayed_node, n_list); in btrfs_next_delayed_node()
/Linux-v4.19/include/net/
Dip_vs.h656 struct list_head n_list; /* for the dests in the service */ member
695 struct list_head n_list; /* d-linked list head */ member
719 struct list_head n_list; /* d-linked list head */ member