ud_header.c 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365
  1. /*
  2. * Copyright (c) 2004 Topspin Corporation. All rights reserved.
  3. * Copyright (c) 2005 Sun Microsystems, Inc. All rights reserved.
  4. *
  5. * This software is available to you under a choice of one of two
  6. * licenses. You may choose to be licensed under the terms of the GNU
  7. * General Public License (GPL) Version 2, available from the file
  8. * COPYING in the main directory of this source tree, or the
  9. * OpenIB.org BSD license below:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #include <linux/errno.h>
  34. #include <linux/string.h>
  35. #include <rdma/ib_pack.h>
  36. #define STRUCT_FIELD(header, field) \
  37. .struct_offset_bytes = offsetof(struct ib_unpacked_ ## header, field), \
  38. .struct_size_bytes = sizeof ((struct ib_unpacked_ ## header *) 0)->field, \
  39. .field_name = #header ":" #field
  40. static const struct ib_field lrh_table[] = {
  41. { STRUCT_FIELD(lrh, virtual_lane),
  42. .offset_words = 0,
  43. .offset_bits = 0,
  44. .size_bits = 4 },
  45. { STRUCT_FIELD(lrh, link_version),
  46. .offset_words = 0,
  47. .offset_bits = 4,
  48. .size_bits = 4 },
  49. { STRUCT_FIELD(lrh, service_level),
  50. .offset_words = 0,
  51. .offset_bits = 8,
  52. .size_bits = 4 },
  53. { RESERVED,
  54. .offset_words = 0,
  55. .offset_bits = 12,
  56. .size_bits = 2 },
  57. { STRUCT_FIELD(lrh, link_next_header),
  58. .offset_words = 0,
  59. .offset_bits = 14,
  60. .size_bits = 2 },
  61. { STRUCT_FIELD(lrh, destination_lid),
  62. .offset_words = 0,
  63. .offset_bits = 16,
  64. .size_bits = 16 },
  65. { RESERVED,
  66. .offset_words = 1,
  67. .offset_bits = 0,
  68. .size_bits = 5 },
  69. { STRUCT_FIELD(lrh, packet_length),
  70. .offset_words = 1,
  71. .offset_bits = 5,
  72. .size_bits = 11 },
  73. { STRUCT_FIELD(lrh, source_lid),
  74. .offset_words = 1,
  75. .offset_bits = 16,
  76. .size_bits = 16 }
  77. };
  78. static const struct ib_field grh_table[] = {
  79. { STRUCT_FIELD(grh, ip_version),
  80. .offset_words = 0,
  81. .offset_bits = 0,
  82. .size_bits = 4 },
  83. { STRUCT_FIELD(grh, traffic_class),
  84. .offset_words = 0,
  85. .offset_bits = 4,
  86. .size_bits = 8 },
  87. { STRUCT_FIELD(grh, flow_label),
  88. .offset_words = 0,
  89. .offset_bits = 12,
  90. .size_bits = 20 },
  91. { STRUCT_FIELD(grh, payload_length),
  92. .offset_words = 1,
  93. .offset_bits = 0,
  94. .size_bits = 16 },
  95. { STRUCT_FIELD(grh, next_header),
  96. .offset_words = 1,
  97. .offset_bits = 16,
  98. .size_bits = 8 },
  99. { STRUCT_FIELD(grh, hop_limit),
  100. .offset_words = 1,
  101. .offset_bits = 24,
  102. .size_bits = 8 },
  103. { STRUCT_FIELD(grh, source_gid),
  104. .offset_words = 2,
  105. .offset_bits = 0,
  106. .size_bits = 128 },
  107. { STRUCT_FIELD(grh, destination_gid),
  108. .offset_words = 6,
  109. .offset_bits = 0,
  110. .size_bits = 128 }
  111. };
  112. static const struct ib_field bth_table[] = {
  113. { STRUCT_FIELD(bth, opcode),
  114. .offset_words = 0,
  115. .offset_bits = 0,
  116. .size_bits = 8 },
  117. { STRUCT_FIELD(bth, solicited_event),
  118. .offset_words = 0,
  119. .offset_bits = 8,
  120. .size_bits = 1 },
  121. { STRUCT_FIELD(bth, mig_req),
  122. .offset_words = 0,
  123. .offset_bits = 9,
  124. .size_bits = 1 },
  125. { STRUCT_FIELD(bth, pad_count),
  126. .offset_words = 0,
  127. .offset_bits = 10,
  128. .size_bits = 2 },
  129. { STRUCT_FIELD(bth, transport_header_version),
  130. .offset_words = 0,
  131. .offset_bits = 12,
  132. .size_bits = 4 },
  133. { STRUCT_FIELD(bth, pkey),
  134. .offset_words = 0,
  135. .offset_bits = 16,
  136. .size_bits = 16 },
  137. { RESERVED,
  138. .offset_words = 1,
  139. .offset_bits = 0,
  140. .size_bits = 8 },
  141. { STRUCT_FIELD(bth, destination_qpn),
  142. .offset_words = 1,
  143. .offset_bits = 8,
  144. .size_bits = 24 },
  145. { STRUCT_FIELD(bth, ack_req),
  146. .offset_words = 2,
  147. .offset_bits = 0,
  148. .size_bits = 1 },
  149. { RESERVED,
  150. .offset_words = 2,
  151. .offset_bits = 1,
  152. .size_bits = 7 },
  153. { STRUCT_FIELD(bth, psn),
  154. .offset_words = 2,
  155. .offset_bits = 8,
  156. .size_bits = 24 }
  157. };
  158. static const struct ib_field deth_table[] = {
  159. { STRUCT_FIELD(deth, qkey),
  160. .offset_words = 0,
  161. .offset_bits = 0,
  162. .size_bits = 32 },
  163. { RESERVED,
  164. .offset_words = 1,
  165. .offset_bits = 0,
  166. .size_bits = 8 },
  167. { STRUCT_FIELD(deth, source_qpn),
  168. .offset_words = 1,
  169. .offset_bits = 8,
  170. .size_bits = 24 }
  171. };
  172. /**
  173. * ib_ud_header_init - Initialize UD header structure
  174. * @payload_bytes:Length of packet payload
  175. * @grh_present:GRH flag (if non-zero, GRH will be included)
  176. * @header:Structure to initialize
  177. *
  178. * ib_ud_header_init() initializes the lrh.link_version, lrh.link_next_header,
  179. * lrh.packet_length, grh.ip_version, grh.payload_length,
  180. * grh.next_header, bth.opcode, bth.pad_count and
  181. * bth.transport_header_version fields of a &struct ib_ud_header given
  182. * the payload length and whether a GRH will be included.
  183. */
  184. void ib_ud_header_init(int payload_bytes,
  185. int grh_present,
  186. struct ib_ud_header *header)
  187. {
  188. int header_len;
  189. u16 packet_length;
  190. memset(header, 0, sizeof *header);
  191. header_len =
  192. IB_LRH_BYTES +
  193. IB_BTH_BYTES +
  194. IB_DETH_BYTES;
  195. if (grh_present) {
  196. header_len += IB_GRH_BYTES;
  197. }
  198. header->lrh.link_version = 0;
  199. header->lrh.link_next_header =
  200. grh_present ? IB_LNH_IBA_GLOBAL : IB_LNH_IBA_LOCAL;
  201. packet_length = (IB_LRH_BYTES +
  202. IB_BTH_BYTES +
  203. IB_DETH_BYTES +
  204. payload_bytes +
  205. 4 + /* ICRC */
  206. 3) / 4; /* round up */
  207. header->grh_present = grh_present;
  208. if (grh_present) {
  209. packet_length += IB_GRH_BYTES / 4;
  210. header->grh.ip_version = 6;
  211. header->grh.payload_length =
  212. cpu_to_be16((IB_BTH_BYTES +
  213. IB_DETH_BYTES +
  214. payload_bytes +
  215. 4 + /* ICRC */
  216. 3) & ~3); /* round up */
  217. header->grh.next_header = 0x1b;
  218. }
  219. header->lrh.packet_length = cpu_to_be16(packet_length);
  220. if (header->immediate_present)
  221. header->bth.opcode = IB_OPCODE_UD_SEND_ONLY_WITH_IMMEDIATE;
  222. else
  223. header->bth.opcode = IB_OPCODE_UD_SEND_ONLY;
  224. header->bth.pad_count = (4 - payload_bytes) & 3;
  225. header->bth.transport_header_version = 0;
  226. }
  227. EXPORT_SYMBOL(ib_ud_header_init);
  228. /**
  229. * ib_ud_header_pack - Pack UD header struct into wire format
  230. * @header:UD header struct
  231. * @buf:Buffer to pack into
  232. *
  233. * ib_ud_header_pack() packs the UD header structure @header into wire
  234. * format in the buffer @buf.
  235. */
  236. int ib_ud_header_pack(struct ib_ud_header *header,
  237. void *buf)
  238. {
  239. int len = 0;
  240. ib_pack(lrh_table, ARRAY_SIZE(lrh_table),
  241. &header->lrh, buf);
  242. len += IB_LRH_BYTES;
  243. if (header->grh_present) {
  244. ib_pack(grh_table, ARRAY_SIZE(grh_table),
  245. &header->grh, buf + len);
  246. len += IB_GRH_BYTES;
  247. }
  248. ib_pack(bth_table, ARRAY_SIZE(bth_table),
  249. &header->bth, buf + len);
  250. len += IB_BTH_BYTES;
  251. ib_pack(deth_table, ARRAY_SIZE(deth_table),
  252. &header->deth, buf + len);
  253. len += IB_DETH_BYTES;
  254. if (header->immediate_present) {
  255. memcpy(buf + len, &header->immediate_data, sizeof header->immediate_data);
  256. len += sizeof header->immediate_data;
  257. }
  258. return len;
  259. }
  260. EXPORT_SYMBOL(ib_ud_header_pack);
  261. /**
  262. * ib_ud_header_unpack - Unpack UD header struct from wire format
  263. * @header:UD header struct
  264. * @buf:Buffer to pack into
  265. *
  266. * ib_ud_header_pack() unpacks the UD header structure @header from wire
  267. * format in the buffer @buf.
  268. */
  269. int ib_ud_header_unpack(void *buf,
  270. struct ib_ud_header *header)
  271. {
  272. ib_unpack(lrh_table, ARRAY_SIZE(lrh_table),
  273. buf, &header->lrh);
  274. buf += IB_LRH_BYTES;
  275. if (header->lrh.link_version != 0) {
  276. printk(KERN_WARNING "Invalid LRH.link_version %d\n",
  277. header->lrh.link_version);
  278. return -EINVAL;
  279. }
  280. switch (header->lrh.link_next_header) {
  281. case IB_LNH_IBA_LOCAL:
  282. header->grh_present = 0;
  283. break;
  284. case IB_LNH_IBA_GLOBAL:
  285. header->grh_present = 1;
  286. ib_unpack(grh_table, ARRAY_SIZE(grh_table),
  287. buf, &header->grh);
  288. buf += IB_GRH_BYTES;
  289. if (header->grh.ip_version != 6) {
  290. printk(KERN_WARNING "Invalid GRH.ip_version %d\n",
  291. header->grh.ip_version);
  292. return -EINVAL;
  293. }
  294. if (header->grh.next_header != 0x1b) {
  295. printk(KERN_WARNING "Invalid GRH.next_header 0x%02x\n",
  296. header->grh.next_header);
  297. return -EINVAL;
  298. }
  299. break;
  300. default:
  301. printk(KERN_WARNING "Invalid LRH.link_next_header %d\n",
  302. header->lrh.link_next_header);
  303. return -EINVAL;
  304. }
  305. ib_unpack(bth_table, ARRAY_SIZE(bth_table),
  306. buf, &header->bth);
  307. buf += IB_BTH_BYTES;
  308. switch (header->bth.opcode) {
  309. case IB_OPCODE_UD_SEND_ONLY:
  310. header->immediate_present = 0;
  311. break;
  312. case IB_OPCODE_UD_SEND_ONLY_WITH_IMMEDIATE:
  313. header->immediate_present = 1;
  314. break;
  315. default:
  316. printk(KERN_WARNING "Invalid BTH.opcode 0x%02x\n",
  317. header->bth.opcode);
  318. return -EINVAL;
  319. }
  320. if (header->bth.transport_header_version != 0) {
  321. printk(KERN_WARNING "Invalid BTH.transport_header_version %d\n",
  322. header->bth.transport_header_version);
  323. return -EINVAL;
  324. }
  325. ib_unpack(deth_table, ARRAY_SIZE(deth_table),
  326. buf, &header->deth);
  327. buf += IB_DETH_BYTES;
  328. if (header->immediate_present)
  329. memcpy(&header->immediate_data, buf, sizeof header->immediate_data);
  330. return 0;
  331. }
  332. EXPORT_SYMBOL(ib_ud_header_unpack);