Home
last modified time | relevance | path

Searched refs:n_list (Results 1 – 14 of 14) 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_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_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_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()
326 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_gcd_weight()
354 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_mh_shift_weight()
512 .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.c420 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
435 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
469 list_for_each_entry_rcu(d, &svc->destinations, n_list) { in is_overloaded()
543 .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.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),
H A Dip_vs_ctl.c1033 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_lookup_dest()
1424 list_add_rcu(&dest->n_list, &svc->destinations); in __ip_vs_update_dest()
1674 list_del_rcu(&dest->n_list); in __ip_vs_unlink_dest()
2094 list_for_each_entry_safe(dest, nxt, &svc->destinations, n_list) { in __ip_vs_del_service()
2302 n_list) { in ip_vs_dst_event()
2332 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_zero_service()
3072 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_info_seq_show()
3705 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_get_dest_entries()
4401 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { in ip_vs_genl_dump_dests()
/linux/net/rds/
H A Drecv.c533 struct rds_notifier, n_list); in rds_notify_queue_get()
534 list_move(&notifier->n_list, &copy); in rds_notify_queue_get()
543 notifier = list_entry(copy.next, struct rds_notifier, n_list); in rds_notify_queue_get()
555 list_del_init(&notifier->n_list); in rds_notify_queue_get()
H A Dsend.c605 list_add_tail(&notifier->n_list, &rs->rs_notify_queue); in rds_rdma_send_complete()
641 list_add_tail(&notifier->n_list, &rs->rs_notify_queue); in rds_atomic_send_complete()
670 list_add_tail(&ro->op_notifier->n_list, &rs->rs_notify_queue); in __rds_send_complete()
677 list_add_tail(&ao->op_notifier->n_list, &rs->rs_notify_queue); in __rds_send_complete()
742 list_add_tail(&notifier->n_list, in rds_send_remove_from_sock()
H A Drds.h530 struct list_head n_list; member
/linux/fs/btrfs/
H A Ddelayed-inode.c64 INIT_LIST_HEAD(&delayed_node->n_list); in btrfs_init_delayed_node()
206 list_add_tail(&node->n_list, &root->node_list); in btrfs_queue_delayed_node()
226 list_del_init(&node->n_list); in btrfs_dequeue_delayed_node()
242 struct btrfs_delayed_node, n_list); in btrfs_first_delayed_node()
267 } else if (list_is_last(&node->n_list, &delayed_root->node_list)) in btrfs_next_delayed_node()
270 p = node->n_list.next; in btrfs_next_delayed_node()
272 next = list_entry(p, struct btrfs_delayed_node, n_list); in btrfs_next_delayed_node()
/linux/include/net/
H A Dip_vs.h976 struct list_head n_list; /* for the dests in the service */ member
1021 struct list_head n_list; /* d-linked list head */ member
1045 struct list_head n_list; /* d-linked list head */ member