Home
last modified time | relevance | path

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

/linux-4.4.14/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_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_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_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_dh.c123 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_dh_reassign()
252 .n_list = LIST_HEAD_INIT(ip_vs_dh_scheduler.n_list),
Dip_vs_lblc.c419 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
434 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
468 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
542 .n_list = LIST_HEAD_INIT(ip_vs_lblc_scheduler.n_list),
Dip_vs_sh.c190 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_sh_reassign()
357 .n_list = LIST_HEAD_INIT(ip_vs_sh_scheduler.n_list),
Dip_vs_pe_sip.c151 .n_list = LIST_HEAD_INIT(ip_vs_sip_pe.n_list),
Dip_vs_lblcr.c582 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
598 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
632 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
728 .n_list = LIST_HEAD_INIT(ip_vs_lblcr_scheduler.n_list),
Dip_vs_ctl.c582 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lookup_dest()
844 list_add_rcu(&dest->n_list, &svc->destinations); in __ip_vs_update_dest()
1073 list_del_rcu(&dest->n_list); in __ip_vs_unlink_dest()
1399 list_for_each_entry_safe(dest, nxt, &svc->destinations, n_list) { in __ip_vs_del_service()
1538 n_list) { in ip_vs_dst_event()
1547 n_list) { in ip_vs_dst_event()
1572 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_zero_service()
2037 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_info_seq_show()
2553 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_get_dest_entries()
3221 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_genl_dump_dests()
/linux-4.4.14/net/rds/
Drecv.c322 struct rds_notifier, n_list); in rds_notify_queue_get()
323 list_move(&notifier->n_list, &copy); in rds_notify_queue_get()
332 notifier = list_entry(copy.next, struct rds_notifier, n_list); in rds_notify_queue_get()
344 list_del_init(&notifier->n_list); in rds_notify_queue_get()
Dsend.c482 list_add_tail(&notifier->n_list, &rs->rs_notify_queue); in rds_rdma_send_complete()
518 list_add_tail(&notifier->n_list, &rs->rs_notify_queue); in rds_atomic_send_complete()
547 list_add_tail(&ro->op_notifier->n_list, &rs->rs_notify_queue); in __rds_send_complete()
554 list_add_tail(&ao->op_notifier->n_list, &rs->rs_notify_queue); in __rds_send_complete()
655 list_add_tail(&notifier->n_list, in rds_send_remove_from_sock()
Drds.h398 struct list_head n_list; member
/linux-4.4.14/fs/btrfs/
Ddelayed-inode.h60 struct list_head n_list; member
Ddelayed-inode.c63 INIT_LIST_HEAD(&delayed_node->n_list); in btrfs_init_delayed_node()
180 list_add_tail(&node->n_list, &root->node_list); in btrfs_queue_delayed_node()
197 list_del_init(&node->n_list); in btrfs_dequeue_delayed_node()
216 node = list_entry(p, struct btrfs_delayed_node, n_list); in btrfs_first_delayed_node()
238 } else if (list_is_last(&node->n_list, &delayed_root->node_list)) in btrfs_next_delayed_node()
241 p = node->n_list.next; in btrfs_next_delayed_node()
243 next = list_entry(p, struct btrfs_delayed_node, n_list); in btrfs_next_delayed_node()
/linux-4.4.14/include/net/
Dip_vs.h660 struct list_head n_list; /* for the dests in the service */ member
698 struct list_head n_list; /* d-linked list head */ member
722 struct list_head n_list; /* d-linked list head */ member