transport.c 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156
  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. void 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. }
  53. EXPORT_SYMBOL_GPL(rds_trans_register);
  54. void rds_trans_unregister(struct rds_transport *trans)
  55. {
  56. down_write(&rds_trans_sem);
  57. transports[trans->t_type] = NULL;
  58. printk(KERN_INFO "Unregistered RDS/%s transport\n", trans->t_name);
  59. up_write(&rds_trans_sem);
  60. }
  61. EXPORT_SYMBOL_GPL(rds_trans_unregister);
  62. void rds_trans_put(struct rds_transport *trans)
  63. {
  64. if (trans)
  65. module_put(trans->t_owner);
  66. }
  67. struct rds_transport *rds_trans_get_preferred(struct net *net, __be32 addr)
  68. {
  69. struct rds_transport *ret = NULL;
  70. struct rds_transport *trans;
  71. unsigned int i;
  72. if (IN_LOOPBACK(ntohl(addr)))
  73. return &rds_loop_transport;
  74. down_read(&rds_trans_sem);
  75. for (i = 0; i < RDS_TRANS_COUNT; i++) {
  76. trans = transports[i];
  77. if (trans && (trans->laddr_check(net, addr) == 0) &&
  78. (!trans->t_owner || try_module_get(trans->t_owner))) {
  79. ret = trans;
  80. break;
  81. }
  82. }
  83. up_read(&rds_trans_sem);
  84. return ret;
  85. }
  86. struct rds_transport *rds_trans_get(int t_type)
  87. {
  88. struct rds_transport *ret = NULL;
  89. struct rds_transport *trans;
  90. unsigned int i;
  91. down_read(&rds_trans_sem);
  92. for (i = 0; i < RDS_TRANS_COUNT; i++) {
  93. trans = transports[i];
  94. if (trans && trans->t_type == t_type &&
  95. (!trans->t_owner || try_module_get(trans->t_owner))) {
  96. ret = trans;
  97. break;
  98. }
  99. }
  100. up_read(&rds_trans_sem);
  101. return ret;
  102. }
  103. /*
  104. * This returns the number of stats entries in the snapshot and only
  105. * copies them using the iter if there is enough space for them. The
  106. * caller passes in the global stats so that we can size and copy while
  107. * holding the lock.
  108. */
  109. unsigned int rds_trans_stats_info_copy(struct rds_info_iterator *iter,
  110. unsigned int avail)
  111. {
  112. struct rds_transport *trans;
  113. unsigned int total = 0;
  114. unsigned int part;
  115. int i;
  116. rds_info_iter_unmap(iter);
  117. down_read(&rds_trans_sem);
  118. for (i = 0; i < RDS_TRANS_COUNT; i++) {
  119. trans = transports[i];
  120. if (!trans || !trans->stats_info_copy)
  121. continue;
  122. part = trans->stats_info_copy(iter, avail);
  123. avail -= min(avail, part);
  124. total += part;
  125. }
  126. up_read(&rds_trans_sem);
  127. return total;
  128. }