netlink.c 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191
  1. /*
  2. * Copyright (c) 2010 Voltaire Inc. 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. #define pr_fmt(fmt) "%s:%s: " fmt, KBUILD_MODNAME, __func__
  33. #include <net/netlink.h>
  34. #include <net/net_namespace.h>
  35. #include <net/sock.h>
  36. #include <rdma/rdma_netlink.h>
  37. struct ibnl_client {
  38. struct list_head list;
  39. int index;
  40. int nops;
  41. const struct ibnl_client_cbs *cb_table;
  42. };
  43. static DEFINE_MUTEX(ibnl_mutex);
  44. static struct sock *nls;
  45. static LIST_HEAD(client_list);
  46. int ibnl_add_client(int index, int nops,
  47. const struct ibnl_client_cbs cb_table[])
  48. {
  49. struct ibnl_client *cur;
  50. struct ibnl_client *nl_client;
  51. nl_client = kmalloc(sizeof *nl_client, GFP_KERNEL);
  52. if (!nl_client)
  53. return -ENOMEM;
  54. nl_client->index = index;
  55. nl_client->nops = nops;
  56. nl_client->cb_table = cb_table;
  57. mutex_lock(&ibnl_mutex);
  58. list_for_each_entry(cur, &client_list, list) {
  59. if (cur->index == index) {
  60. pr_warn("Client for %d already exists\n", index);
  61. mutex_unlock(&ibnl_mutex);
  62. kfree(nl_client);
  63. return -EINVAL;
  64. }
  65. }
  66. list_add_tail(&nl_client->list, &client_list);
  67. mutex_unlock(&ibnl_mutex);
  68. return 0;
  69. }
  70. EXPORT_SYMBOL(ibnl_add_client);
  71. int ibnl_remove_client(int index)
  72. {
  73. struct ibnl_client *cur, *next;
  74. mutex_lock(&ibnl_mutex);
  75. list_for_each_entry_safe(cur, next, &client_list, list) {
  76. if (cur->index == index) {
  77. list_del(&(cur->list));
  78. mutex_unlock(&ibnl_mutex);
  79. kfree(cur);
  80. return 0;
  81. }
  82. }
  83. pr_warn("Can't remove callback for client idx %d. Not found\n", index);
  84. mutex_unlock(&ibnl_mutex);
  85. return -EINVAL;
  86. }
  87. EXPORT_SYMBOL(ibnl_remove_client);
  88. void *ibnl_put_msg(struct sk_buff *skb, struct nlmsghdr **nlh, int seq,
  89. int len, int client, int op)
  90. {
  91. unsigned char *prev_tail;
  92. prev_tail = skb_tail_pointer(skb);
  93. *nlh = NLMSG_NEW(skb, 0, seq, RDMA_NL_GET_TYPE(client, op),
  94. len, NLM_F_MULTI);
  95. (*nlh)->nlmsg_len = skb_tail_pointer(skb) - prev_tail;
  96. return NLMSG_DATA(*nlh);
  97. nlmsg_failure:
  98. nlmsg_trim(skb, prev_tail);
  99. return NULL;
  100. }
  101. EXPORT_SYMBOL(ibnl_put_msg);
  102. int ibnl_put_attr(struct sk_buff *skb, struct nlmsghdr *nlh,
  103. int len, void *data, int type)
  104. {
  105. unsigned char *prev_tail;
  106. prev_tail = skb_tail_pointer(skb);
  107. NLA_PUT(skb, type, len, data);
  108. nlh->nlmsg_len += skb_tail_pointer(skb) - prev_tail;
  109. return 0;
  110. nla_put_failure:
  111. nlmsg_trim(skb, prev_tail - nlh->nlmsg_len);
  112. return -EMSGSIZE;
  113. }
  114. EXPORT_SYMBOL(ibnl_put_attr);
  115. static int ibnl_rcv_msg(struct sk_buff *skb, struct nlmsghdr *nlh)
  116. {
  117. struct ibnl_client *client;
  118. int type = nlh->nlmsg_type;
  119. int index = RDMA_NL_GET_CLIENT(type);
  120. int op = RDMA_NL_GET_OP(type);
  121. list_for_each_entry(client, &client_list, list) {
  122. if (client->index == index) {
  123. if (op < 0 || op >= client->nops ||
  124. !client->cb_table[RDMA_NL_GET_OP(op)].dump)
  125. return -EINVAL;
  126. return netlink_dump_start(nls, skb, nlh,
  127. client->cb_table[op].dump,
  128. NULL);
  129. }
  130. }
  131. pr_info("Index %d wasn't found in client list\n", index);
  132. return -EINVAL;
  133. }
  134. static void ibnl_rcv(struct sk_buff *skb)
  135. {
  136. mutex_lock(&ibnl_mutex);
  137. netlink_rcv_skb(skb, &ibnl_rcv_msg);
  138. mutex_unlock(&ibnl_mutex);
  139. }
  140. int __init ibnl_init(void)
  141. {
  142. nls = netlink_kernel_create(&init_net, NETLINK_RDMA, 0, ibnl_rcv,
  143. NULL, THIS_MODULE);
  144. if (!nls) {
  145. pr_warn("Failed to create netlink socket\n");
  146. return -ENOMEM;
  147. }
  148. return 0;
  149. }
  150. void ibnl_cleanup(void)
  151. {
  152. struct ibnl_client *cur, *next;
  153. mutex_lock(&ibnl_mutex);
  154. list_for_each_entry_safe(cur, next, &client_list, list) {
  155. list_del(&(cur->list));
  156. kfree(cur);
  157. }
  158. mutex_unlock(&ibnl_mutex);
  159. netlink_kernel_release(nls);
  160. }