/linux-master/net/netfilter/ipvs/ |
H A D | ip_vs_lblcr.c | 579 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { 595 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { 629 list_for_each_entry_rcu(d, &svc->destinations, n_list) { 725 .n_list = LIST_HEAD_INIT(ip_vs_lblcr_scheduler.n_list),
|
H A D | ip_vs_lblc.c | 416 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { 431 list_for_each_entry_continue_rcu(dest, &svc->destinations, n_list) { 465 list_for_each_entry_rcu(d, &svc->destinations, n_list) { 539 .n_list = LIST_HEAD_INIT(ip_vs_lblc_scheduler.n_list),
|
H A D | ip_vs_ctl.c | 706 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) { 2445 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { 2936 list_for_each_entry(dest, &svc->destinations, n_list) { 3622 list_for_each_entry(dest, &svc->destinations, n_list) { [all...] |
H A D | ip_vs_wrr.c | 75 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 D | ip_vs_wlc.c | 50 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 D | ip_vs_sh.c | 186 dest = list_entry(p, struct ip_vs_dest, n_list); 353 .n_list = LIST_HEAD_INIT(ip_vs_sh_scheduler.n_list),
|
H A D | ip_vs_twos.c | 55 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 D | ip_vs_sed.c | 78 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 D | ip_vs_pe_sip.c | 166 .n_list = LIST_HEAD_INIT(ip_vs_sip_pe.n_list),
|
H A D | ip_vs_ovf.c | 35 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { 64 .n_list = LIST_HEAD_INIT(ip_vs_ovf_scheduler.n_list),
|
H A D | ip_vs_rr.c | 42 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 D | ip_vs_nq.c | 74 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { 120 .n_list = LIST_HEAD_INIT(ip_vs_nq_scheduler.n_list),
|
H A D | ip_vs_lc.c | 41 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { 70 .n_list = LIST_HEAD_INIT(ip_vs_lc_scheduler.n_list),
|
H A D | ip_vs_fo.c | 32 list_for_each_entry_rcu(dest, &svc->destinations, n_list) { 57 .n_list = LIST_HEAD_INIT(ip_vs_fo_scheduler.n_list),
|
H A D | ip_vs_dh.c | 119 dest = list_entry(p, struct ip_vs_dest, n_list); 248 .n_list = LIST_HEAD_INIT(ip_vs_dh_scheduler.n_list),
|
H A D | ip_vs_mh.c | 141 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 D | ip_vs_pe.c | 29 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 D | ip_vs_sched.c | 87 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);
|
/linux-master/fs/btrfs/ |
H A D | delayed-inode.c | 63 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);
|
H A D | delayed-inode.h | 56 struct list_head n_list; member in struct:btrfs_delayed_node
|
/linux-master/net/rds/ |
H A D | send.c | 517 list_add_tail(¬ifier->n_list, &rs->rs_notify_queue); 553 list_add_tail(¬ifier->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(¬ifier->n_list,
|
H A D | recv.c | 482 struct rds_notifier, n_list); 483 list_move(¬ifier->n_list, ©); 492 notifier = list_entry(copy.next, struct rds_notifier, n_list); 504 list_del_init(¬ifier->n_list);
|
H A D | rds.h | 498 struct list_head n_list; member in struct:rds_notifier
|
/linux-master/include/net/ |
H A D | ip_vs.h | 718 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
|