Home
last modified time | relevance | path

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

/linux/net/netfilter/ipvs/
H A Dip_vs_wrr.c75 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
96 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_max_weight()
117 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_init_svc()
144 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list); in ip_vs_wrr_dest_changed()
179 n_list) { in ip_vs_wrr_schedule()
196 &last->n_list == &svc->destinations) in ip_vs_wrr_schedule()
202 &last->n_list != &svc->destinations) { in ip_vs_wrr_schedule()
243 .n_list = LIST_HEAD_INIT(ip_vs_wrr_scheduler.n_list),
H A Dip_vs_rr.c42 if (p == &dest->n_list) in ip_vs_rr_del_dest()
64 last = dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_rr_schedule()
69 n_list) { in ip_vs_rr_schedule()
89 svc->sched_data = &dest->n_list; in ip_vs_rr_schedule()
105 .n_list = LIST_HEAD_INIT(ip_vs_rr_scheduler.n_list),
H A Dip_vs_sched.c87 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in ip_vs_sched_getbyname()
187 if (!list_empty(&scheduler->n_list)) { in register_ip_vs_scheduler()
199 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in register_ip_vs_scheduler()
211 list_add(&scheduler->n_list, &ip_vs_schedulers); in register_ip_vs_scheduler()
231 if (list_empty(&scheduler->n_list)) { in unregister_ip_vs_scheduler()
241 list_del(&scheduler->n_list); in unregister_ip_vs_scheduler()
H A Dip_vs_pe.c29 list_for_each_entry_rcu(pe, &ip_vs_pe, n_list) { in __ip_vs_pe_getbyname()
78 list_for_each_entry(tmp, &ip_vs_pe, n_list) { in register_ip_vs_pe()
88 list_add_rcu(&pe->n_list, &ip_vs_pe); in register_ip_vs_pe()
102 list_del_rcu(&pe->n_list); in unregister_ip_vs_pe()
H A Dip_vs_wlc.c50 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
65 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
93 .n_list = LIST_HEAD_INIT(ip_vs_wlc_scheduler.n_list),
H A Dip_vs_sed.c78 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
93 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
121 .n_list = LIST_HEAD_INIT(ip_vs_sed_scheduler.n_list),
H A Dip_vs_twos.c55 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_twos_schedule()
78 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_twos_schedule()
122 .n_list = LIST_HEAD_INIT(ip_vs_twos_scheduler.n_list),
H A Dip_vs_fo.c32 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_fo_schedule()
57 .n_list = LIST_HEAD_INIT(ip_vs_fo_scheduler.n_list),
H A Dip_vs_lc.c41 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
70 .n_list = LIST_HEAD_INIT(ip_vs_lc_scheduler.n_list),
H A Dip_vs_ovf.c35 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_ovf_schedule()
64 .n_list = LIST_HEAD_INIT(ip_vs_ovf_scheduler.n_list),
H A Dip_vs_nq.c74 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
120 .n_list = LIST_HEAD_INIT(ip_vs_nq_scheduler.n_list),
H A Dip_vs_mh.c141 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_mh_permutate()
209 new_dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_mh_populate()
328 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_gcd_weight()
356 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_shift_weight()
515 .n_list = LIST_HEAD_INIT(ip_vs_mh_scheduler.n_list),
H A Dip_vs_dh.c119 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_dh_reassign()
248 .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.c186 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_sh_reassign()
353 .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.c166 .n_list = LIST_HEAD_INIT(ip_vs_sip_pe.n_list),
/linux/net/rds/
H A Drecv.c482 struct rds_notifier, n_list); in rds_notify_queue_get()
483 list_move(&notifier->n_list, &copy); in rds_notify_queue_get()
492 notifier = list_entry(copy.next, struct rds_notifier, n_list); in rds_notify_queue_get()
504 list_del_init(&notifier->n_list); in rds_notify_queue_get()
H A Dsend.c517 list_add_tail(&notifier->n_list, &rs->rs_notify_queue); in rds_rdma_send_complete()
553 list_add_tail(&notifier->n_list, &rs->rs_notify_queue); in rds_atomic_send_complete()
582 list_add_tail(&ro->op_notifier->n_list, &rs->rs_notify_queue); in __rds_send_complete()
589 list_add_tail(&ao->op_notifier->n_list, &rs->rs_notify_queue); in __rds_send_complete()
654 list_add_tail(&notifier->n_list, in rds_send_remove_from_sock()
H A Drds.h498 struct list_head n_list; member
/linux/fs/btrfs/
H A Ddelayed-inode.c63 INIT_LIST_HEAD(&delayed_node->n_list); in btrfs_init_delayed_node()
186 list_add_tail(&node->n_list, &root->node_list); in btrfs_queue_delayed_node()
203 list_del_init(&node->n_list); in btrfs_dequeue_delayed_node()
222 node = list_entry(p, struct btrfs_delayed_node, n_list); in btrfs_first_delayed_node()
244 } else if (list_is_last(&node->n_list, &delayed_root->node_list)) in btrfs_next_delayed_node()
247 p = node->n_list.next; in btrfs_next_delayed_node()
249 next = list_entry(p, struct btrfs_delayed_node, n_list); in btrfs_next_delayed_node()
/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