multipath_rr.c 2.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697
  1. /*
  2. * Round robin policy for multipath.
  3. *
  4. *
  5. * Version: $Id: multipath_rr.c,v 1.1.2.2 2004/09/16 07:42:34 elueck Exp $
  6. *
  7. * Authors: Einar Lueck <elueck@de.ibm.com><lkml@einar-lueck.de>
  8. *
  9. * This program is free software; you can redistribute it and/or
  10. * modify it under the terms of the GNU General Public License
  11. * as published by the Free Software Foundation; either version
  12. * 2 of the License, or (at your option) any later version.
  13. */
  14. #include <linux/config.h>
  15. #include <asm/system.h>
  16. #include <asm/uaccess.h>
  17. #include <linux/types.h>
  18. #include <linux/sched.h>
  19. #include <linux/errno.h>
  20. #include <linux/timer.h>
  21. #include <linux/mm.h>
  22. #include <linux/kernel.h>
  23. #include <linux/fcntl.h>
  24. #include <linux/stat.h>
  25. #include <linux/socket.h>
  26. #include <linux/in.h>
  27. #include <linux/inet.h>
  28. #include <linux/netdevice.h>
  29. #include <linux/inetdevice.h>
  30. #include <linux/igmp.h>
  31. #include <linux/proc_fs.h>
  32. #include <linux/seq_file.h>
  33. #include <linux/module.h>
  34. #include <linux/mroute.h>
  35. #include <linux/init.h>
  36. #include <net/ip.h>
  37. #include <net/protocol.h>
  38. #include <linux/skbuff.h>
  39. #include <net/sock.h>
  40. #include <net/icmp.h>
  41. #include <net/udp.h>
  42. #include <net/raw.h>
  43. #include <linux/notifier.h>
  44. #include <linux/if_arp.h>
  45. #include <linux/netfilter_ipv4.h>
  46. #include <net/ipip.h>
  47. #include <net/checksum.h>
  48. #include <net/ip_mp_alg.h>
  49. static void rr_select_route(const struct flowi *flp,
  50. struct rtable *first, struct rtable **rp)
  51. {
  52. struct rtable *nh, *result, *min_use_cand = NULL;
  53. int min_use = -1;
  54. /* 1. make sure all alt. nexthops have the same GC related data
  55. * 2. determine the new candidate to be returned
  56. */
  57. result = NULL;
  58. for (nh = rcu_dereference(first); nh;
  59. nh = rcu_dereference(nh->u.rt_next)) {
  60. if ((nh->u.dst.flags & DST_BALANCED) != 0 &&
  61. multipath_comparekeys(&nh->fl, flp)) {
  62. nh->u.dst.lastuse = jiffies;
  63. if (min_use == -1 || nh->u.dst.__use < min_use) {
  64. min_use = nh->u.dst.__use;
  65. min_use_cand = nh;
  66. }
  67. }
  68. }
  69. result = min_use_cand;
  70. if (!result)
  71. result = first;
  72. result->u.dst.__use++;
  73. *rp = result;
  74. }
  75. static struct ip_mp_alg_ops rr_ops = {
  76. .mp_alg_select_route = rr_select_route,
  77. };
  78. static int __init rr_init(void)
  79. {
  80. return multipath_alg_register(&rr_ops, IP_MP_ALG_RR);
  81. }
  82. static void __exit rr_exit(void)
  83. {
  84. multipath_alg_unregister(&rr_ops, IP_MP_ALG_RR);
  85. }
  86. module_init(rr_init);
  87. module_exit(rr_exit);
  88. MODULE_LICENSE("GPL");