Home
last modified time | relevance | path

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

/linux-3.4.99/net/netfilter/ipvs/
Dip_vs_pe.c41 list_for_each_entry(pe, &ip_vs_pe, n_list) { in __ip_vs_pe_getbyname()
88 if (!list_empty(&pe->n_list)) { in register_ip_vs_pe()
99 list_for_each_entry(tmp, &ip_vs_pe, n_list) { in register_ip_vs_pe()
109 list_add(&pe->n_list, &ip_vs_pe); in register_ip_vs_pe()
122 if (list_empty(&pe->n_list)) { in unregister_ip_vs_pe()
130 list_del(&pe->n_list); in unregister_ip_vs_pe()
Dip_vs_sched.c97 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in ip_vs_sched_getbyname()
197 if (!list_empty(&scheduler->n_list)) { in register_ip_vs_scheduler()
209 list_for_each_entry(sched, &ip_vs_schedulers, n_list) { in register_ip_vs_scheduler()
221 list_add(&scheduler->n_list, &ip_vs_schedulers); in register_ip_vs_scheduler()
241 if (list_empty(&scheduler->n_list)) { in unregister_ip_vs_scheduler()
251 list_del(&scheduler->n_list); in unregister_ip_vs_scheduler()
Dip_vs_wlc.c54 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
69 list_for_each_entry_continue(dest, &svc->destinations, n_list) { in ip_vs_wlc_schedule()
96 .n_list = LIST_HEAD_INIT(ip_vs_wlc_scheduler.n_list),
Dip_vs_sed.c82 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
97 list_for_each_entry_continue(dest, &svc->destinations, n_list) { in ip_vs_sed_schedule()
124 .n_list = LIST_HEAD_INIT(ip_vs_sed_scheduler.n_list),
Dip_vs_wrr.c49 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_gcd_weight()
70 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_wrr_max_weight()
176 dest = list_entry(mark->cl, struct ip_vs_dest, n_list); in ip_vs_wrr_schedule()
212 .n_list = LIST_HEAD_INIT(ip_vs_wrr_scheduler.n_list),
Dip_vs_lc.c45 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_lc_schedule()
74 .n_list = LIST_HEAD_INIT(ip_vs_lc_scheduler.n_list),
Dip_vs_nq.c78 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_nq_schedule()
123 .n_list = LIST_HEAD_INIT(ip_vs_nq_scheduler.n_list),
Dip_vs_rr.c67 dest = list_entry(q, struct ip_vs_dest, n_list); in ip_vs_rr_schedule()
95 .n_list = LIST_HEAD_INIT(ip_vs_rr_scheduler.n_list),
Dip_vs_dh.c115 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_dh_assign()
248 .n_list = LIST_HEAD_INIT(ip_vs_dh_scheduler.n_list),
Dip_vs_sh.c119 dest = list_entry(p, struct ip_vs_dest, n_list); in ip_vs_sh_assign()
262 .n_list = LIST_HEAD_INIT(ip_vs_sh_scheduler.n_list),
Dip_vs_lblc.c411 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
426 list_for_each_entry_continue(dest, &svc->destinations, n_list) { in __ip_vs_lblc_schedule()
460 list_for_each_entry(d, &svc->destinations, n_list) { in is_overloaded()
540 .n_list = LIST_HEAD_INIT(ip_vs_lblc_scheduler.n_list),
Dip_vs_pe_sip.c148 .n_list = LIST_HEAD_INIT(ip_vs_sip_pe.n_list),
Dip_vs_lblcr.c580 list_for_each_entry(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
596 list_for_each_entry_continue(dest, &svc->destinations, n_list) { in __ip_vs_lblcr_schedule()
630 list_for_each_entry(d, &svc->destinations, n_list) { in is_overloaded()
734 .n_list = LIST_HEAD_INIT(ip_vs_lblcr_scheduler.n_list),
Dip_vs_ctl.c596 list_for_each_entry(dest, &svc->destinations, n_list) { in ip_vs_lookup_dest()
663 list_for_each_entry_safe(dest, nxt, &ipvs->dest_trash, n_list) { in ip_vs_trash_get_dest()
691 list_del(&dest->n_list); in ip_vs_trash_get_dest()
717 list_for_each_entry_safe(dest, nxt, &ipvs->dest_trash, n_list) { in ip_vs_trash_cleanup()
718 list_del(&dest->n_list); in ip_vs_trash_cleanup()
825 list_add(&dest->n_list, &svc->destinations); in __ip_vs_update_dest()
955 list_del(&dest->n_list); in ip_vs_add_dest()
1054 list_add(&dest->n_list, &ipvs->dest_trash); in __ip_vs_del_dest()
1072 list_del(&dest->n_list); in __ip_vs_unlink_dest()
1386 list_for_each_entry_safe(dest, nxt, &svc->destinations, n_list) { in __ip_vs_del_service()
[all …]
/linux-3.4.99/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.c440 list_add_tail(&notifier->n_list, &rs->rs_notify_queue); in rds_rdma_send_complete()
476 list_add_tail(&notifier->n_list, &rs->rs_notify_queue); in rds_atomic_send_complete()
505 list_add_tail(&ro->op_notifier->n_list, &rs->rs_notify_queue); in __rds_send_complete()
512 list_add_tail(&ao->op_notifier->n_list, &rs->rs_notify_queue); in __rds_send_complete()
610 list_add_tail(&notifier->n_list, in rds_send_remove_from_sock()
Drds.h378 struct list_head n_list; member
/linux-3.4.99/fs/btrfs/
Ddelayed-inode.h55 struct list_head n_list; member
Ddelayed-inode.c62 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()
235 } else if (list_is_last(&node->n_list, &delayed_root->node_list)) in btrfs_next_delayed_node()
238 p = node->n_list.next; in btrfs_next_delayed_node()
240 next = list_entry(p, struct btrfs_delayed_node, n_list); in btrfs_next_delayed_node()
/linux-3.4.99/include/net/
Dip_vs.h644 struct list_head n_list; /* for the dests in the service */ member
684 struct list_head n_list; /* d-linked list head */ member
703 struct list_head n_list; /* d-linked list head */ member