mthca_profile.c 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286
  1. /*
  2. * Copyright (c) 2004, 2005 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005 Mellanox Technologies. 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/module.h>
  34. #include <linux/moduleparam.h>
  35. #include <linux/string.h>
  36. #include <linux/slab.h>
  37. #include "mthca_profile.h"
  38. enum {
  39. MTHCA_RES_QP,
  40. MTHCA_RES_EEC,
  41. MTHCA_RES_SRQ,
  42. MTHCA_RES_CQ,
  43. MTHCA_RES_EQP,
  44. MTHCA_RES_EEEC,
  45. MTHCA_RES_EQ,
  46. MTHCA_RES_RDB,
  47. MTHCA_RES_MCG,
  48. MTHCA_RES_MPT,
  49. MTHCA_RES_MTT,
  50. MTHCA_RES_UAR,
  51. MTHCA_RES_UDAV,
  52. MTHCA_RES_UARC,
  53. MTHCA_RES_NUM
  54. };
  55. enum {
  56. MTHCA_NUM_EQS = 32,
  57. MTHCA_NUM_PDS = 1 << 15
  58. };
  59. s64 mthca_make_profile(struct mthca_dev *dev,
  60. struct mthca_profile *request,
  61. struct mthca_dev_lim *dev_lim,
  62. struct mthca_init_hca_param *init_hca)
  63. {
  64. struct mthca_resource {
  65. u64 size;
  66. u64 start;
  67. int type;
  68. int num;
  69. int log_num;
  70. };
  71. u64 mem_base, mem_avail;
  72. s64 total_size = 0;
  73. struct mthca_resource *profile;
  74. struct mthca_resource tmp;
  75. int i, j;
  76. profile = kzalloc(MTHCA_RES_NUM * sizeof *profile, GFP_KERNEL);
  77. if (!profile)
  78. return -ENOMEM;
  79. profile[MTHCA_RES_QP].size = dev_lim->qpc_entry_sz;
  80. profile[MTHCA_RES_EEC].size = dev_lim->eec_entry_sz;
  81. profile[MTHCA_RES_SRQ].size = dev_lim->srq_entry_sz;
  82. profile[MTHCA_RES_CQ].size = dev_lim->cqc_entry_sz;
  83. profile[MTHCA_RES_EQP].size = dev_lim->eqpc_entry_sz;
  84. profile[MTHCA_RES_EEEC].size = dev_lim->eeec_entry_sz;
  85. profile[MTHCA_RES_EQ].size = dev_lim->eqc_entry_sz;
  86. profile[MTHCA_RES_RDB].size = MTHCA_RDB_ENTRY_SIZE;
  87. profile[MTHCA_RES_MCG].size = MTHCA_MGM_ENTRY_SIZE;
  88. profile[MTHCA_RES_MPT].size = dev_lim->mpt_entry_sz;
  89. profile[MTHCA_RES_MTT].size = dev->limits.mtt_seg_size;
  90. profile[MTHCA_RES_UAR].size = dev_lim->uar_scratch_entry_sz;
  91. profile[MTHCA_RES_UDAV].size = MTHCA_AV_SIZE;
  92. profile[MTHCA_RES_UARC].size = request->uarc_size;
  93. profile[MTHCA_RES_QP].num = request->num_qp;
  94. profile[MTHCA_RES_SRQ].num = request->num_srq;
  95. profile[MTHCA_RES_EQP].num = request->num_qp;
  96. profile[MTHCA_RES_RDB].num = request->num_qp * request->rdb_per_qp;
  97. profile[MTHCA_RES_CQ].num = request->num_cq;
  98. profile[MTHCA_RES_EQ].num = MTHCA_NUM_EQS;
  99. profile[MTHCA_RES_MCG].num = request->num_mcg;
  100. profile[MTHCA_RES_MPT].num = request->num_mpt;
  101. profile[MTHCA_RES_MTT].num = request->num_mtt;
  102. profile[MTHCA_RES_UAR].num = request->num_uar;
  103. profile[MTHCA_RES_UARC].num = request->num_uar;
  104. profile[MTHCA_RES_UDAV].num = request->num_udav;
  105. for (i = 0; i < MTHCA_RES_NUM; ++i) {
  106. profile[i].type = i;
  107. profile[i].log_num = max(ffs(profile[i].num) - 1, 0);
  108. profile[i].size *= profile[i].num;
  109. if (mthca_is_memfree(dev))
  110. profile[i].size = max(profile[i].size, (u64) PAGE_SIZE);
  111. }
  112. if (mthca_is_memfree(dev)) {
  113. mem_base = 0;
  114. mem_avail = dev_lim->hca.arbel.max_icm_sz;
  115. } else {
  116. mem_base = dev->ddr_start;
  117. mem_avail = dev->fw.tavor.fw_start - dev->ddr_start;
  118. }
  119. /*
  120. * Sort the resources in decreasing order of size. Since they
  121. * all have sizes that are powers of 2, we'll be able to keep
  122. * resources aligned to their size and pack them without gaps
  123. * using the sorted order.
  124. */
  125. for (i = MTHCA_RES_NUM; i > 0; --i)
  126. for (j = 1; j < i; ++j) {
  127. if (profile[j].size > profile[j - 1].size) {
  128. tmp = profile[j];
  129. profile[j] = profile[j - 1];
  130. profile[j - 1] = tmp;
  131. }
  132. }
  133. for (i = 0; i < MTHCA_RES_NUM; ++i) {
  134. if (profile[i].size) {
  135. profile[i].start = mem_base + total_size;
  136. total_size += profile[i].size;
  137. }
  138. if (total_size > mem_avail) {
  139. mthca_err(dev, "Profile requires 0x%llx bytes; "
  140. "won't fit in 0x%llx bytes of context memory.\n",
  141. (unsigned long long) total_size,
  142. (unsigned long long) mem_avail);
  143. kfree(profile);
  144. return -ENOMEM;
  145. }
  146. if (profile[i].size)
  147. mthca_dbg(dev, "profile[%2d]--%2d/%2d @ 0x%16llx "
  148. "(size 0x%8llx)\n",
  149. i, profile[i].type, profile[i].log_num,
  150. (unsigned long long) profile[i].start,
  151. (unsigned long long) profile[i].size);
  152. }
  153. if (mthca_is_memfree(dev))
  154. mthca_dbg(dev, "HCA context memory: reserving %d KB\n",
  155. (int) (total_size >> 10));
  156. else
  157. mthca_dbg(dev, "HCA memory: allocated %d KB/%d KB (%d KB free)\n",
  158. (int) (total_size >> 10), (int) (mem_avail >> 10),
  159. (int) ((mem_avail - total_size) >> 10));
  160. for (i = 0; i < MTHCA_RES_NUM; ++i) {
  161. switch (profile[i].type) {
  162. case MTHCA_RES_QP:
  163. dev->limits.num_qps = profile[i].num;
  164. init_hca->qpc_base = profile[i].start;
  165. init_hca->log_num_qps = profile[i].log_num;
  166. break;
  167. case MTHCA_RES_EEC:
  168. dev->limits.num_eecs = profile[i].num;
  169. init_hca->eec_base = profile[i].start;
  170. init_hca->log_num_eecs = profile[i].log_num;
  171. break;
  172. case MTHCA_RES_SRQ:
  173. dev->limits.num_srqs = profile[i].num;
  174. init_hca->srqc_base = profile[i].start;
  175. init_hca->log_num_srqs = profile[i].log_num;
  176. break;
  177. case MTHCA_RES_CQ:
  178. dev->limits.num_cqs = profile[i].num;
  179. init_hca->cqc_base = profile[i].start;
  180. init_hca->log_num_cqs = profile[i].log_num;
  181. break;
  182. case MTHCA_RES_EQP:
  183. init_hca->eqpc_base = profile[i].start;
  184. break;
  185. case MTHCA_RES_EEEC:
  186. init_hca->eeec_base = profile[i].start;
  187. break;
  188. case MTHCA_RES_EQ:
  189. dev->limits.num_eqs = profile[i].num;
  190. init_hca->eqc_base = profile[i].start;
  191. init_hca->log_num_eqs = profile[i].log_num;
  192. break;
  193. case MTHCA_RES_RDB:
  194. for (dev->qp_table.rdb_shift = 0;
  195. request->num_qp << dev->qp_table.rdb_shift < profile[i].num;
  196. ++dev->qp_table.rdb_shift)
  197. ; /* nothing */
  198. dev->qp_table.rdb_base = (u32) profile[i].start;
  199. init_hca->rdb_base = profile[i].start;
  200. break;
  201. case MTHCA_RES_MCG:
  202. dev->limits.num_mgms = profile[i].num >> 1;
  203. dev->limits.num_amgms = profile[i].num >> 1;
  204. init_hca->mc_base = profile[i].start;
  205. init_hca->log_mc_entry_sz = ffs(MTHCA_MGM_ENTRY_SIZE) - 1;
  206. init_hca->log_mc_table_sz = profile[i].log_num;
  207. init_hca->mc_hash_sz = 1 << (profile[i].log_num - 1);
  208. break;
  209. case MTHCA_RES_MPT:
  210. dev->limits.num_mpts = profile[i].num;
  211. dev->mr_table.mpt_base = profile[i].start;
  212. init_hca->mpt_base = profile[i].start;
  213. init_hca->log_mpt_sz = profile[i].log_num;
  214. break;
  215. case MTHCA_RES_MTT:
  216. dev->limits.num_mtt_segs = profile[i].num;
  217. dev->mr_table.mtt_base = profile[i].start;
  218. init_hca->mtt_base = profile[i].start;
  219. init_hca->mtt_seg_sz = ffs(dev->limits.mtt_seg_size) - 7;
  220. break;
  221. case MTHCA_RES_UAR:
  222. dev->limits.num_uars = profile[i].num;
  223. init_hca->uar_scratch_base = profile[i].start;
  224. break;
  225. case MTHCA_RES_UDAV:
  226. dev->av_table.ddr_av_base = profile[i].start;
  227. dev->av_table.num_ddr_avs = profile[i].num;
  228. break;
  229. case MTHCA_RES_UARC:
  230. dev->uar_table.uarc_size = request->uarc_size;
  231. dev->uar_table.uarc_base = profile[i].start;
  232. init_hca->uarc_base = profile[i].start;
  233. init_hca->log_uarc_sz = ffs(request->uarc_size) - 13;
  234. init_hca->log_uar_sz = ffs(request->num_uar) - 1;
  235. break;
  236. default:
  237. break;
  238. }
  239. }
  240. /*
  241. * PDs don't take any HCA memory, but we assign them as part
  242. * of the HCA profile anyway.
  243. */
  244. dev->limits.num_pds = MTHCA_NUM_PDS;
  245. if (dev->mthca_flags & MTHCA_FLAG_SINAI_OPT &&
  246. init_hca->log_mpt_sz > 23) {
  247. mthca_warn(dev, "MPT table too large (requested size 2^%d >= 2^24)\n",
  248. init_hca->log_mpt_sz);
  249. mthca_warn(dev, "Disabling memory key throughput optimization.\n");
  250. dev->mthca_flags &= ~MTHCA_FLAG_SINAI_OPT;
  251. }
  252. /*
  253. * For Tavor, FMRs use ioremapped PCI memory. For 32 bit
  254. * systems it may use too much vmalloc space to map all MTT
  255. * memory, so we reserve some MTTs for FMR access, taking them
  256. * out of the MR pool. They don't use additional memory, but
  257. * we assign them as part of the HCA profile anyway.
  258. */
  259. if (mthca_is_memfree(dev) || BITS_PER_LONG == 64)
  260. dev->limits.fmr_reserved_mtts = 0;
  261. else
  262. dev->limits.fmr_reserved_mtts = request->fmr_reserved_mtts;
  263. kfree(profile);
  264. return total_size;
  265. }