hash.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443
  1. /*
  2. * Copyright (c) 2016 Citrix Systems Inc.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public License version 2
  6. * as published by the Free Softare Foundation; or, when distributed
  7. * separately from the Linux kernel or incorporated into other
  8. * software packages, subject to the following license:
  9. *
  10. * Permission is hereby granted, free of charge, to any person obtaining a copy
  11. * of this source file (the "Software"), to deal in the Software without
  12. * restriction, including without limitation the rights to use, copy, modify,
  13. * merge, publish, distribute, sublicense, and/or sell copies of the Software,
  14. * and to permit persons to whom the Software is furnished to do so, subject to
  15. * the following conditions:
  16. *
  17. * The above copyright notice and this permission notice shall be included in
  18. * all copies or substantial portions of the Software.
  19. *
  20. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  21. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  22. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  23. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  24. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  25. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  26. * IN THE SOFTWARE.
  27. */
  28. #define XEN_NETIF_DEFINE_TOEPLITZ
  29. #include "common.h"
  30. #include <linux/vmalloc.h>
  31. #include <linux/rculist.h>
  32. static void xenvif_add_hash(struct xenvif *vif, const u8 *tag,
  33. unsigned int len, u32 val)
  34. {
  35. struct xenvif_hash_cache_entry *new, *entry, *oldest;
  36. unsigned long flags;
  37. bool found;
  38. new = kmalloc(sizeof(*entry), GFP_ATOMIC);
  39. if (!new)
  40. return;
  41. memcpy(new->tag, tag, len);
  42. new->len = len;
  43. new->val = val;
  44. spin_lock_irqsave(&vif->hash.cache.lock, flags);
  45. found = false;
  46. oldest = NULL;
  47. list_for_each_entry_rcu(entry, &vif->hash.cache.list, link) {
  48. /* Make sure we don't add duplicate entries */
  49. if (entry->len == len &&
  50. memcmp(entry->tag, tag, len) == 0)
  51. found = true;
  52. if (!oldest || entry->seq < oldest->seq)
  53. oldest = entry;
  54. }
  55. if (!found) {
  56. new->seq = atomic_inc_return(&vif->hash.cache.seq);
  57. list_add_rcu(&new->link, &vif->hash.cache.list);
  58. if (++vif->hash.cache.count > xenvif_hash_cache_size) {
  59. list_del_rcu(&oldest->link);
  60. vif->hash.cache.count--;
  61. kfree_rcu(oldest, rcu);
  62. }
  63. }
  64. spin_unlock_irqrestore(&vif->hash.cache.lock, flags);
  65. if (found)
  66. kfree(new);
  67. }
  68. static u32 xenvif_new_hash(struct xenvif *vif, const u8 *data,
  69. unsigned int len)
  70. {
  71. u32 val;
  72. val = xen_netif_toeplitz_hash(vif->hash.key,
  73. sizeof(vif->hash.key),
  74. data, len);
  75. if (xenvif_hash_cache_size != 0)
  76. xenvif_add_hash(vif, data, len, val);
  77. return val;
  78. }
  79. static void xenvif_flush_hash(struct xenvif *vif)
  80. {
  81. struct xenvif_hash_cache_entry *entry;
  82. unsigned long flags;
  83. if (xenvif_hash_cache_size == 0)
  84. return;
  85. spin_lock_irqsave(&vif->hash.cache.lock, flags);
  86. list_for_each_entry_rcu(entry, &vif->hash.cache.list, link) {
  87. list_del_rcu(&entry->link);
  88. vif->hash.cache.count--;
  89. kfree_rcu(entry, rcu);
  90. }
  91. spin_unlock_irqrestore(&vif->hash.cache.lock, flags);
  92. }
  93. static u32 xenvif_find_hash(struct xenvif *vif, const u8 *data,
  94. unsigned int len)
  95. {
  96. struct xenvif_hash_cache_entry *entry;
  97. u32 val;
  98. bool found;
  99. if (len >= XEN_NETBK_HASH_TAG_SIZE)
  100. return 0;
  101. if (xenvif_hash_cache_size == 0)
  102. return xenvif_new_hash(vif, data, len);
  103. rcu_read_lock();
  104. found = false;
  105. list_for_each_entry_rcu(entry, &vif->hash.cache.list, link) {
  106. if (entry->len == len &&
  107. memcmp(entry->tag, data, len) == 0) {
  108. val = entry->val;
  109. entry->seq = atomic_inc_return(&vif->hash.cache.seq);
  110. found = true;
  111. break;
  112. }
  113. }
  114. rcu_read_unlock();
  115. if (!found)
  116. val = xenvif_new_hash(vif, data, len);
  117. return val;
  118. }
  119. void xenvif_set_skb_hash(struct xenvif *vif, struct sk_buff *skb)
  120. {
  121. struct flow_keys flow;
  122. u32 hash = 0;
  123. enum pkt_hash_types type = PKT_HASH_TYPE_NONE;
  124. u32 flags = vif->hash.flags;
  125. bool has_tcp_hdr;
  126. /* Quick rejection test: If the network protocol doesn't
  127. * correspond to any enabled hash type then there's no point
  128. * in parsing the packet header.
  129. */
  130. switch (skb->protocol) {
  131. case htons(ETH_P_IP):
  132. if (flags & (XEN_NETIF_CTRL_HASH_TYPE_IPV4_TCP |
  133. XEN_NETIF_CTRL_HASH_TYPE_IPV4))
  134. break;
  135. goto done;
  136. case htons(ETH_P_IPV6):
  137. if (flags & (XEN_NETIF_CTRL_HASH_TYPE_IPV6_TCP |
  138. XEN_NETIF_CTRL_HASH_TYPE_IPV6))
  139. break;
  140. goto done;
  141. default:
  142. goto done;
  143. }
  144. memset(&flow, 0, sizeof(flow));
  145. if (!skb_flow_dissect_flow_keys(skb, &flow, 0))
  146. goto done;
  147. has_tcp_hdr = (flow.basic.ip_proto == IPPROTO_TCP) &&
  148. !(flow.control.flags & FLOW_DIS_IS_FRAGMENT);
  149. switch (skb->protocol) {
  150. case htons(ETH_P_IP):
  151. if (has_tcp_hdr &&
  152. (flags & XEN_NETIF_CTRL_HASH_TYPE_IPV4_TCP)) {
  153. u8 data[12];
  154. memcpy(&data[0], &flow.addrs.v4addrs.src, 4);
  155. memcpy(&data[4], &flow.addrs.v4addrs.dst, 4);
  156. memcpy(&data[8], &flow.ports.src, 2);
  157. memcpy(&data[10], &flow.ports.dst, 2);
  158. hash = xenvif_find_hash(vif, data, sizeof(data));
  159. type = PKT_HASH_TYPE_L4;
  160. } else if (flags & XEN_NETIF_CTRL_HASH_TYPE_IPV4) {
  161. u8 data[8];
  162. memcpy(&data[0], &flow.addrs.v4addrs.src, 4);
  163. memcpy(&data[4], &flow.addrs.v4addrs.dst, 4);
  164. hash = xenvif_find_hash(vif, data, sizeof(data));
  165. type = PKT_HASH_TYPE_L3;
  166. }
  167. break;
  168. case htons(ETH_P_IPV6):
  169. if (has_tcp_hdr &&
  170. (flags & XEN_NETIF_CTRL_HASH_TYPE_IPV6_TCP)) {
  171. u8 data[36];
  172. memcpy(&data[0], &flow.addrs.v6addrs.src, 16);
  173. memcpy(&data[16], &flow.addrs.v6addrs.dst, 16);
  174. memcpy(&data[32], &flow.ports.src, 2);
  175. memcpy(&data[34], &flow.ports.dst, 2);
  176. hash = xenvif_find_hash(vif, data, sizeof(data));
  177. type = PKT_HASH_TYPE_L4;
  178. } else if (flags & XEN_NETIF_CTRL_HASH_TYPE_IPV6) {
  179. u8 data[32];
  180. memcpy(&data[0], &flow.addrs.v6addrs.src, 16);
  181. memcpy(&data[16], &flow.addrs.v6addrs.dst, 16);
  182. hash = xenvif_find_hash(vif, data, sizeof(data));
  183. type = PKT_HASH_TYPE_L3;
  184. }
  185. break;
  186. }
  187. done:
  188. if (type == PKT_HASH_TYPE_NONE)
  189. skb_clear_hash(skb);
  190. else
  191. __skb_set_sw_hash(skb, hash, type == PKT_HASH_TYPE_L4);
  192. }
  193. u32 xenvif_set_hash_alg(struct xenvif *vif, u32 alg)
  194. {
  195. switch (alg) {
  196. case XEN_NETIF_CTRL_HASH_ALGORITHM_NONE:
  197. case XEN_NETIF_CTRL_HASH_ALGORITHM_TOEPLITZ:
  198. break;
  199. default:
  200. return XEN_NETIF_CTRL_STATUS_INVALID_PARAMETER;
  201. }
  202. vif->hash.alg = alg;
  203. return XEN_NETIF_CTRL_STATUS_SUCCESS;
  204. }
  205. u32 xenvif_get_hash_flags(struct xenvif *vif, u32 *flags)
  206. {
  207. if (vif->hash.alg == XEN_NETIF_CTRL_HASH_ALGORITHM_NONE)
  208. return XEN_NETIF_CTRL_STATUS_NOT_SUPPORTED;
  209. *flags = XEN_NETIF_CTRL_HASH_TYPE_IPV4 |
  210. XEN_NETIF_CTRL_HASH_TYPE_IPV4_TCP |
  211. XEN_NETIF_CTRL_HASH_TYPE_IPV6 |
  212. XEN_NETIF_CTRL_HASH_TYPE_IPV6_TCP;
  213. return XEN_NETIF_CTRL_STATUS_SUCCESS;
  214. }
  215. u32 xenvif_set_hash_flags(struct xenvif *vif, u32 flags)
  216. {
  217. if (flags & ~(XEN_NETIF_CTRL_HASH_TYPE_IPV4 |
  218. XEN_NETIF_CTRL_HASH_TYPE_IPV4_TCP |
  219. XEN_NETIF_CTRL_HASH_TYPE_IPV6 |
  220. XEN_NETIF_CTRL_HASH_TYPE_IPV6_TCP))
  221. return XEN_NETIF_CTRL_STATUS_INVALID_PARAMETER;
  222. if (vif->hash.alg == XEN_NETIF_CTRL_HASH_ALGORITHM_NONE)
  223. return XEN_NETIF_CTRL_STATUS_INVALID_PARAMETER;
  224. vif->hash.flags = flags;
  225. return XEN_NETIF_CTRL_STATUS_SUCCESS;
  226. }
  227. u32 xenvif_set_hash_key(struct xenvif *vif, u32 gref, u32 len)
  228. {
  229. u8 *key = vif->hash.key;
  230. struct gnttab_copy copy_op = {
  231. .source.u.ref = gref,
  232. .source.domid = vif->domid,
  233. .dest.u.gmfn = virt_to_gfn(key),
  234. .dest.domid = DOMID_SELF,
  235. .dest.offset = xen_offset_in_page(key),
  236. .len = len,
  237. .flags = GNTCOPY_source_gref
  238. };
  239. if (len > XEN_NETBK_MAX_HASH_KEY_SIZE)
  240. return XEN_NETIF_CTRL_STATUS_INVALID_PARAMETER;
  241. if (copy_op.len != 0) {
  242. gnttab_batch_copy(&copy_op, 1);
  243. if (copy_op.status != GNTST_okay)
  244. return XEN_NETIF_CTRL_STATUS_INVALID_PARAMETER;
  245. }
  246. /* Clear any remaining key octets */
  247. if (len < XEN_NETBK_MAX_HASH_KEY_SIZE)
  248. memset(key + len, 0, XEN_NETBK_MAX_HASH_KEY_SIZE - len);
  249. xenvif_flush_hash(vif);
  250. return XEN_NETIF_CTRL_STATUS_SUCCESS;
  251. }
  252. u32 xenvif_set_hash_mapping_size(struct xenvif *vif, u32 size)
  253. {
  254. if (size > XEN_NETBK_MAX_HASH_MAPPING_SIZE)
  255. return XEN_NETIF_CTRL_STATUS_INVALID_PARAMETER;
  256. vif->hash.size = size;
  257. memset(vif->hash.mapping, 0, sizeof(u32) * size);
  258. return XEN_NETIF_CTRL_STATUS_SUCCESS;
  259. }
  260. u32 xenvif_set_hash_mapping(struct xenvif *vif, u32 gref, u32 len,
  261. u32 off)
  262. {
  263. u32 *mapping = &vif->hash.mapping[off];
  264. struct gnttab_copy copy_op = {
  265. .source.u.ref = gref,
  266. .source.domid = vif->domid,
  267. .dest.u.gmfn = virt_to_gfn(mapping),
  268. .dest.domid = DOMID_SELF,
  269. .dest.offset = xen_offset_in_page(mapping),
  270. .len = len * sizeof(u32),
  271. .flags = GNTCOPY_source_gref
  272. };
  273. if ((off + len > vif->hash.size) || copy_op.len > XEN_PAGE_SIZE)
  274. return XEN_NETIF_CTRL_STATUS_INVALID_PARAMETER;
  275. while (len-- != 0)
  276. if (mapping[off++] >= vif->num_queues)
  277. return XEN_NETIF_CTRL_STATUS_INVALID_PARAMETER;
  278. if (copy_op.len != 0) {
  279. gnttab_batch_copy(&copy_op, 1);
  280. if (copy_op.status != GNTST_okay)
  281. return XEN_NETIF_CTRL_STATUS_INVALID_PARAMETER;
  282. }
  283. return XEN_NETIF_CTRL_STATUS_SUCCESS;
  284. }
  285. #ifdef CONFIG_DEBUG_FS
  286. void xenvif_dump_hash_info(struct xenvif *vif, struct seq_file *m)
  287. {
  288. unsigned int i;
  289. switch (vif->hash.alg) {
  290. case XEN_NETIF_CTRL_HASH_ALGORITHM_TOEPLITZ:
  291. seq_puts(m, "Hash Algorithm: TOEPLITZ\n");
  292. break;
  293. case XEN_NETIF_CTRL_HASH_ALGORITHM_NONE:
  294. seq_puts(m, "Hash Algorithm: NONE\n");
  295. /* FALLTHRU */
  296. default:
  297. return;
  298. }
  299. if (vif->hash.flags) {
  300. seq_puts(m, "\nHash Flags:\n");
  301. if (vif->hash.flags & XEN_NETIF_CTRL_HASH_TYPE_IPV4)
  302. seq_puts(m, "- IPv4\n");
  303. if (vif->hash.flags & XEN_NETIF_CTRL_HASH_TYPE_IPV4_TCP)
  304. seq_puts(m, "- IPv4 + TCP\n");
  305. if (vif->hash.flags & XEN_NETIF_CTRL_HASH_TYPE_IPV6)
  306. seq_puts(m, "- IPv6\n");
  307. if (vif->hash.flags & XEN_NETIF_CTRL_HASH_TYPE_IPV6_TCP)
  308. seq_puts(m, "- IPv6 + TCP\n");
  309. }
  310. seq_puts(m, "\nHash Key:\n");
  311. for (i = 0; i < XEN_NETBK_MAX_HASH_KEY_SIZE; ) {
  312. unsigned int j, n;
  313. n = 8;
  314. if (i + n >= XEN_NETBK_MAX_HASH_KEY_SIZE)
  315. n = XEN_NETBK_MAX_HASH_KEY_SIZE - i;
  316. seq_printf(m, "[%2u - %2u]: ", i, i + n - 1);
  317. for (j = 0; j < n; j++, i++)
  318. seq_printf(m, "%02x ", vif->hash.key[i]);
  319. seq_puts(m, "\n");
  320. }
  321. if (vif->hash.size != 0) {
  322. seq_puts(m, "\nHash Mapping:\n");
  323. for (i = 0; i < vif->hash.size; ) {
  324. unsigned int j, n;
  325. n = 8;
  326. if (i + n >= vif->hash.size)
  327. n = vif->hash.size - i;
  328. seq_printf(m, "[%4u - %4u]: ", i, i + n - 1);
  329. for (j = 0; j < n; j++, i++)
  330. seq_printf(m, "%4u ", vif->hash.mapping[i]);
  331. seq_puts(m, "\n");
  332. }
  333. }
  334. }
  335. #endif /* CONFIG_DEBUG_FS */
  336. void xenvif_init_hash(struct xenvif *vif)
  337. {
  338. if (xenvif_hash_cache_size == 0)
  339. return;
  340. spin_lock_init(&vif->hash.cache.lock);
  341. INIT_LIST_HEAD(&vif->hash.cache.list);
  342. }
  343. void xenvif_deinit_hash(struct xenvif *vif)
  344. {
  345. xenvif_flush_hash(vif);
  346. }