Home
last modified time | relevance | path

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

/linux/net/netfilter/ipvs/
H A Dip_vs_wrr.c74 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
95 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_max_weight()
116 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_init_svc()
143 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_dest_changed()
178 n_list) { in ip_vs_wrr_schedule()
195 &last->n_list == &svc->destinations) in ip_vs_wrr_schedule()
201 &last->n_list != &svc->destinations) { in ip_vs_wrr_schedule()
242 .n_list = LIST_HEAD_INIT(ip_vs_wrr_scheduler.n_list),
H A Dip_vs_rr.c41 if (p == &dest->n_list) in ip_vs_rr_del_dest()
63 last = dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_rr_schedule()
68 n_list) { in ip_vs_rr_schedule()
88 svc->sched_data = &dest->n_list; in ip_vs_rr_schedule()
104 .n_list = LIST_HEAD_INIT(ip_vs_rr_scheduler.n_list),
H A Dip_vs_sched.c86 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in ip_vs_sched_getbyname()
186 if (!list_empty(&scheduler->n_list)) { in register_ip_vs_scheduler()
198 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in register_ip_vs_scheduler()
210 list_add(&scheduler->n_list, &ip_vs_schedulers); in register_ip_vs_scheduler()
230 if (list_empty(&scheduler->n_list)) { in unregister_ip_vs_scheduler()
240 list_del(&scheduler->n_list); in unregister_ip_vs_scheduler()
H A Dip_vs_pe.c28 list_for_each_entry_rcu(pe, &ip_vs_pe, n_list) { in __ip_vs_pe_getbyname()
77 list_for_each_entry(tmp, &ip_vs_pe, n_list) { in register_ip_vs_pe()
87 list_add_rcu(&pe->n_list, &ip_vs_pe); in register_ip_vs_pe()
101 list_del_rcu(&pe->n_list); in unregister_ip_vs_pe()
H A Dip_vs_wlc.c49 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
64 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
92 .n_list = LIST_HEAD_INIT(ip_vs_wlc_scheduler.n_list),
H A Dip_vs_sed.c77 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
92 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
120 .n_list = LIST_HEAD_INIT(ip_vs_sed_scheduler.n_list),
H A Dip_vs_twos.c54 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_twos_schedule()
77 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_twos_schedule()
121 .n_list = LIST_HEAD_INIT(ip_vs_twos_scheduler.n_list),
H A Dip_vs_fo.c31 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_fo_schedule()
56 .n_list = LIST_HEAD_INIT(ip_vs_fo_scheduler.n_list),
H A Dip_vs_lc.c40 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
69 .n_list = LIST_HEAD_INIT(ip_vs_lc_scheduler.n_list),
H A Dip_vs_ovf.c34 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_ovf_schedule()
63 .n_list = LIST_HEAD_INIT(ip_vs_ovf_scheduler.n_list),
H A Dip_vs_nq.c73 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
119 .n_list = LIST_HEAD_INIT(ip_vs_nq_scheduler.n_list),
H A Dip_vs_mh.c140 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_mh_permutate()
208 new_dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_mh_populate()
327 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_gcd_weight()
355 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_shift_weight()
514 .n_list = LIST_HEAD_INIT(ip_vs_mh_scheduler.n_list),
H A Dip_vs_dh.c118 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_dh_reassign()
247 .n_list = LIST_HEAD_INIT(ip_vs_dh_scheduler.n_list),
H A Dip_vs_lblc.c416 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
431 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
465 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
539 .n_list = LIST_HEAD_INIT(ip_vs_lblc_scheduler.n_list),
H A Dip_vs_sh.c185 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_sh_reassign()
352 .n_list = LIST_HEAD_INIT(ip_vs_sh_scheduler.n_list),
H A Dip_vs_lblcr.c579 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
595 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
629 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
725 .n_list = LIST_HEAD_INIT(ip_vs_lblcr_scheduler.n_list),
H A Dip_vs_pe_sip.c165 .n_list = LIST_HEAD_INIT(ip_vs_sip_pe.n_list),
/linux/fs/btrfs/
H A Ddelayed-inode.c64 INIT_LIST_HEAD(&delayed_node->n_list); in btrfs_init_delayed_node()
204 list_add_tail(&node->n_list, &root->node_list); in btrfs_queue_delayed_node()
224 list_del_init(&node->n_list); in btrfs_dequeue_delayed_node()
240 struct btrfs_delayed_node, n_list); in btrfs_first_delayed_node()
265 } else if (list_is_last(&node->n_list, &delayed_root->node_list)) in btrfs_next_delayed_node()
268 p = node->n_list.next; in btrfs_next_delayed_node()
270 next = list_entry(p, struct btrfs_delayed_node, n_list); in btrfs_next_delayed_node()
H A Ddelayed-inode.h73 struct list_head n_list; member
/linux/include/net/
H A Dip_vs.h718 struct list_head n_list; /* for the dests in the service */ member
761 struct list_head n_list; /* d-linked list head */ member
785 struct list_head n_list; /* d-linked list head */ member