Searched refs:n_list (Results 1 - 24 of 24) sorted by relevance

/linux-master/net/netfilter/ipvs/
H A Dip_vs_rr.c42 if (p == &dest->n_list)
64 last = dest = list_entry(p, struct ip_vs_dest, n_list);
69 n_list) {
89 svc->sched_data = &dest->n_list;
105 .n_list = LIST_HEAD_INIT(ip_vs_rr_scheduler.n_list),
H A Dip_vs_pe.c29 list_for_each_entry_rcu(pe, &ip_vs_pe, n_list) {
78 list_for_each_entry(tmp, &ip_vs_pe, n_list) {
88 list_add_rcu(&pe->n_list, &ip_vs_pe);
102 list_del_rcu(&pe->n_list);
H A Dip_vs_wlc.c50 list_for_each_entry_rcu(dest, &svc->destinations, n_list) {
65 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) {
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) {
93 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) {
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) {
78 list_for_each_entry_rcu(dest, &svc->destinations, n_list) {
122 .n_list = LIST_HEAD_INIT(ip_vs_twos_scheduler.n_list),
H A Dip_vs_nq.c74 list_for_each_entry_rcu(dest, &svc->destinations, n_list) {
120 .n_list = LIST_HEAD_INIT(ip_vs_nq_scheduler.n_list),
H A Dip_vs_lc.c41 list_for_each_entry_rcu(dest, &svc->destinations, n_list) {
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) {
64 .n_list = LIST_HEAD_INIT(ip_vs_ovf_scheduler.n_list),
H A Dip_vs_fo.c32 list_for_each_entry_rcu(dest, &svc->destinations, n_list) {
57 .n_list = LIST_HEAD_INIT(ip_vs_fo_scheduler.n_list),
H A Dip_vs_sched.c87 list_for_each_entry(sched, &ip_vs_schedulers, n_list) {
187 if (!list_empty(&scheduler->n_list)) {
199 list_for_each_entry(sched, &ip_vs_schedulers, n_list) {
211 list_add(&scheduler->n_list, &ip_vs_schedulers);
231 if (list_empty(&scheduler->n_list)) {
241 list_del(&scheduler->n_list);
H A Dip_vs_wrr.c75 list_for_each_entry(dest, &svc->destinations, n_list) {
96 list_for_each_entry(dest, &svc->destinations, n_list) {
117 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list);
144 mark->cl = list_entry(&svc->destinations, struct ip_vs_dest, n_list);
179 n_list) {
196 &last->n_list == &svc->destinations)
202 &last->n_list != &svc->destinations) {
243 .n_list = LIST_HEAD_INIT(ip_vs_wrr_scheduler.n_list),
H A Dip_vs_dh.c119 dest = list_entry(p, struct ip_vs_dest, n_list);
248 .n_list = LIST_HEAD_INIT(ip_vs_dh_scheduler.n_list),
H A Dip_vs_mh.c141 dest = list_entry(p, struct ip_vs_dest, n_list);
209 new_dest = list_entry(p, struct ip_vs_dest, n_list);
328 list_for_each_entry(dest, &svc->destinations, n_list) {
356 list_for_each_entry(dest, &svc->destinations, n_list) {
515 .n_list = LIST_HEAD_INIT(ip_vs_mh_scheduler.n_list),
H A Dip_vs_pe_sip.c166 .n_list = LIST_HEAD_INIT(ip_vs_sip_pe.n_list),
H A Dip_vs_sh.c186 dest = list_entry(p, struct ip_vs_dest, n_list);
353 .n_list = LIST_HEAD_INIT(ip_vs_sh_scheduler.n_list),
H A Dip_vs_lblc.c417 list_for_each_entry_rcu(dest, &svc->destinations, n_list) {
432 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) {
466 list_for_each_entry_rcu(d, &svc->destinations, n_list) {
540 .n_list = LIST_HEAD_INIT(ip_vs_lblc_scheduler.n_list),
H A Dip_vs_lblcr.c580 list_for_each_entry_rcu(dest, &svc->destinations, n_list) {
596 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) {
630 list_for_each_entry_rcu(d, &svc->destinations, n_list) {
726 .n_list = LIST_HEAD_INIT(ip_vs_lblcr_scheduler.n_list),
H A Dip_vs_ctl.c706 list_for_each_entry_rcu(dest, &svc->destinations, n_list) {
1041 list_add_rcu(&dest->n_list, &svc->destinations);
1284 list_del_rcu(&dest->n_list);
1640 list_for_each_entry_safe(dest, nxt, &svc->destinations, n_list) {
1783 n_list) {
1792 n_list) {
1816 list_for_each_entry(dest, &svc->destinations, n_list) {
2446 list_for_each_entry_rcu(dest, &svc->destinations, n_list) {
2937 list_for_each_entry(dest, &svc->destinations, n_list) {
3623 list_for_each_entry(dest, &svc->destinations, n_list) {
[all...]
/linux-master/fs/btrfs/
H A Ddelayed-inode.h56 struct list_head n_list; member in struct:btrfs_delayed_node
H A Ddelayed-inode.c63 INIT_LIST_HEAD(&delayed_node->n_list);
186 list_add_tail(&node->n_list, &root->node_list);
203 list_del_init(&node->n_list);
222 node = list_entry(p, struct btrfs_delayed_node, n_list);
244 } else if (list_is_last(&node->n_list, &delayed_root->node_list))
247 p = node->n_list.next;
249 next = list_entry(p, struct btrfs_delayed_node, n_list);
/linux-master/net/rds/
H A Drecv.c482 struct rds_notifier, n_list);
483 list_move(&notifier->n_list, &copy);
492 notifier = list_entry(copy.next, struct rds_notifier, n_list);
504 list_del_init(&notifier->n_list);
H A Dsend.c517 list_add_tail(&notifier->n_list, &rs->rs_notify_queue);
553 list_add_tail(&notifier->n_list, &rs->rs_notify_queue);
582 list_add_tail(&ro->op_notifier->n_list, &rs->rs_notify_queue);
589 list_add_tail(&ao->op_notifier->n_list, &rs->rs_notify_queue);
654 list_add_tail(&notifier->n_list,
H A Drds.h498 struct list_head n_list; member in struct:rds_notifier
/linux-master/include/net/
H A Dip_vs.h718 struct list_head n_list; /* for the dests in the service */ member in struct:ip_vs_dest
761 struct list_head n_list; /* d-linked list head */ member in struct:ip_vs_scheduler
785 struct list_head n_list; /* d-linked list head */ member in struct:ip_vs_pe

Completed in 184 milliseconds