transport.c 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158
  1. /*
  2. * Copyright (c) 2006 Oracle. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. *
  32. */
  33. #include <linux/kernel.h>
  34. #include <linux/module.h>
  35. #include <linux/in.h>
  36. #include "rds.h"
  37. #include "loop.h"
  38. static struct rds_transport *transports[RDS_TRANS_COUNT];
  39. static DECLARE_RWSEM(rds_trans_sem);
  40. int rds_trans_register(struct rds_transport *trans)
  41. {
  42. BUG_ON(strlen(trans->t_name) + 1 > TRANSNAMSIZ);
  43. down_write(&rds_trans_sem);
  44. if (transports[trans->t_type])
  45. printk(KERN_ERR "RDS Transport type %d already registered\n",
  46. trans->t_type);
  47. else {
  48. transports[trans->t_type] = trans;
  49. printk(KERN_INFO "Registered RDS/%s transport\n", trans->t_name);
  50. }
  51. up_write(&rds_trans_sem);
  52. return 0;
  53. }
  54. EXPORT_SYMBOL_GPL(rds_trans_register);
  55. void rds_trans_unregister(struct rds_transport *trans)
  56. {
  57. down_write(&rds_trans_sem);
  58. transports[trans->t_type] = NULL;
  59. printk(KERN_INFO "Unregistered RDS/%s transport\n", trans->t_name);
  60. up_write(&rds_trans_sem);
  61. }
  62. EXPORT_SYMBOL_GPL(rds_trans_unregister);
  63. void rds_trans_put(struct rds_transport *trans)
  64. {
  65. if (trans)
  66. module_put(trans->t_owner);
  67. }
  68. struct rds_transport *rds_trans_get_preferred(struct net *net, __be32 addr)
  69. {
  70. struct rds_transport *ret = NULL;
  71. struct rds_transport *trans;
  72. unsigned int i;
  73. if (IN_LOOPBACK(ntohl(addr)))
  74. return &rds_loop_transport;
  75. down_read(&rds_trans_sem);
  76. for (i = 0; i < RDS_TRANS_COUNT; i++) {
  77. trans = transports[i];
  78. if (trans && (trans->laddr_check(net, addr) == 0) &&
  79. (!trans->t_owner || try_module_get(trans->t_owner))) {
  80. ret = trans;
  81. break;
  82. }
  83. }
  84. up_read(&rds_trans_sem);
  85. return ret;
  86. }
  87. struct rds_transport *rds_trans_get(int t_type)
  88. {
  89. struct rds_transport *ret = NULL;
  90. struct rds_transport *trans;
  91. unsigned int i;
  92. down_read(&rds_trans_sem);
  93. for (i = 0; i < RDS_TRANS_COUNT; i++) {
  94. trans = transports[i];
  95. if (trans && trans->t_type == t_type &&
  96. (!trans->t_owner || try_module_get(trans->t_owner))) {
  97. ret = trans;
  98. break;
  99. }
  100. }
  101. up_read(&rds_trans_sem);
  102. return ret;
  103. }
  104. /*
  105. * This returns the number of stats entries in the snapshot and only
  106. * copies them using the iter if there is enough space for them. The
  107. * caller passes in the global stats so that we can size and copy while
  108. * holding the lock.
  109. */
  110. unsigned int rds_trans_stats_info_copy(struct rds_info_iterator *iter,
  111. unsigned int avail)
  112. {
  113. struct rds_transport *trans;
  114. unsigned int total = 0;
  115. unsigned int part;
  116. int i;
  117. rds_info_iter_unmap(iter);
  118. down_read(&rds_trans_sem);
  119. for (i = 0; i < RDS_TRANS_COUNT; i++) {
  120. trans = transports[i];
  121. if (!trans || !trans->stats_info_copy)
  122. continue;
  123. part = trans->stats_info_copy(iter, avail);
  124. avail -= min(avail, part);
  125. total += part;
  126. }
  127. up_read(&rds_trans_sem);
  128. return total;
  129. }