profile.c 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259
  1. /*
  2. * Copyright (c) 2004, 2005 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005 Mellanox Technologies. All rights reserved.
  4. * Copyright (c) 2006, 2007 Cisco Systems, Inc. All rights reserved.
  5. *
  6. * This software is available to you under a choice of one of two
  7. * licenses. You may choose to be licensed under the terms of the GNU
  8. * General Public License (GPL) Version 2, available from the file
  9. * COPYING in the main directory of this source tree, or the
  10. * OpenIB.org BSD license below:
  11. *
  12. * Redistribution and use in source and binary forms, with or
  13. * without modification, are permitted provided that the following
  14. * conditions are met:
  15. *
  16. * - Redistributions of source code must retain the above
  17. * copyright notice, this list of conditions and the following
  18. * disclaimer.
  19. *
  20. * - Redistributions in binary form must reproduce the above
  21. * copyright notice, this list of conditions and the following
  22. * disclaimer in the documentation and/or other materials
  23. * provided with the distribution.
  24. *
  25. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  26. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  27. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  28. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  29. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  30. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  31. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  32. * SOFTWARE.
  33. */
  34. #include <linux/slab.h>
  35. #include "mlx4.h"
  36. #include "fw.h"
  37. enum {
  38. MLX4_RES_QP,
  39. MLX4_RES_RDMARC,
  40. MLX4_RES_ALTC,
  41. MLX4_RES_AUXC,
  42. MLX4_RES_SRQ,
  43. MLX4_RES_CQ,
  44. MLX4_RES_EQ,
  45. MLX4_RES_DMPT,
  46. MLX4_RES_CMPT,
  47. MLX4_RES_MTT,
  48. MLX4_RES_MCG,
  49. MLX4_RES_NUM
  50. };
  51. static const char *res_name[] = {
  52. [MLX4_RES_QP] = "QP",
  53. [MLX4_RES_RDMARC] = "RDMARC",
  54. [MLX4_RES_ALTC] = "ALTC",
  55. [MLX4_RES_AUXC] = "AUXC",
  56. [MLX4_RES_SRQ] = "SRQ",
  57. [MLX4_RES_CQ] = "CQ",
  58. [MLX4_RES_EQ] = "EQ",
  59. [MLX4_RES_DMPT] = "DMPT",
  60. [MLX4_RES_CMPT] = "CMPT",
  61. [MLX4_RES_MTT] = "MTT",
  62. [MLX4_RES_MCG] = "MCG",
  63. };
  64. u64 mlx4_make_profile(struct mlx4_dev *dev,
  65. struct mlx4_profile *request,
  66. struct mlx4_dev_cap *dev_cap,
  67. struct mlx4_init_hca_param *init_hca)
  68. {
  69. struct mlx4_priv *priv = mlx4_priv(dev);
  70. struct mlx4_resource {
  71. u64 size;
  72. u64 start;
  73. int type;
  74. int num;
  75. int log_num;
  76. };
  77. u64 total_size = 0;
  78. struct mlx4_resource *profile;
  79. struct mlx4_resource tmp;
  80. struct sysinfo si;
  81. int i, j;
  82. profile = kcalloc(MLX4_RES_NUM, sizeof(*profile), GFP_KERNEL);
  83. if (!profile)
  84. return -ENOMEM;
  85. /*
  86. * We want to scale the number of MTTs with the size of the
  87. * system memory, since it makes sense to register a lot of
  88. * memory on a system with a lot of memory. As a heuristic,
  89. * make sure we have enough MTTs to cover twice the system
  90. * memory (with PAGE_SIZE entries).
  91. *
  92. * This number has to be a power of two and fit into 32 bits
  93. * due to device limitations, so cap this at 2^31 as well.
  94. * That limits us to 8TB of memory registration per HCA with
  95. * 4KB pages, which is probably OK for the next few months.
  96. */
  97. si_meminfo(&si);
  98. request->num_mtt =
  99. roundup_pow_of_two(max_t(unsigned, request->num_mtt,
  100. min(1UL << 31,
  101. si.totalram >> (log_mtts_per_seg - 1))));
  102. profile[MLX4_RES_QP].size = dev_cap->qpc_entry_sz;
  103. profile[MLX4_RES_RDMARC].size = dev_cap->rdmarc_entry_sz;
  104. profile[MLX4_RES_ALTC].size = dev_cap->altc_entry_sz;
  105. profile[MLX4_RES_AUXC].size = dev_cap->aux_entry_sz;
  106. profile[MLX4_RES_SRQ].size = dev_cap->srq_entry_sz;
  107. profile[MLX4_RES_CQ].size = dev_cap->cqc_entry_sz;
  108. profile[MLX4_RES_EQ].size = dev_cap->eqc_entry_sz;
  109. profile[MLX4_RES_DMPT].size = dev_cap->dmpt_entry_sz;
  110. profile[MLX4_RES_CMPT].size = dev_cap->cmpt_entry_sz;
  111. profile[MLX4_RES_MTT].size = dev_cap->mtt_entry_sz;
  112. profile[MLX4_RES_MCG].size = mlx4_get_mgm_entry_size(dev);
  113. profile[MLX4_RES_QP].num = request->num_qp;
  114. profile[MLX4_RES_RDMARC].num = request->num_qp * request->rdmarc_per_qp;
  115. profile[MLX4_RES_ALTC].num = request->num_qp;
  116. profile[MLX4_RES_AUXC].num = request->num_qp;
  117. profile[MLX4_RES_SRQ].num = request->num_srq;
  118. profile[MLX4_RES_CQ].num = request->num_cq;
  119. profile[MLX4_RES_EQ].num = min_t(unsigned, dev_cap->max_eqs, MAX_MSIX);
  120. profile[MLX4_RES_DMPT].num = request->num_mpt;
  121. profile[MLX4_RES_CMPT].num = MLX4_NUM_CMPTS;
  122. profile[MLX4_RES_MTT].num = request->num_mtt * (1 << log_mtts_per_seg);
  123. profile[MLX4_RES_MCG].num = request->num_mcg;
  124. for (i = 0; i < MLX4_RES_NUM; ++i) {
  125. profile[i].type = i;
  126. profile[i].num = roundup_pow_of_two(profile[i].num);
  127. profile[i].log_num = ilog2(profile[i].num);
  128. profile[i].size *= profile[i].num;
  129. profile[i].size = max(profile[i].size, (u64) PAGE_SIZE);
  130. }
  131. /*
  132. * Sort the resources in decreasing order of size. Since they
  133. * all have sizes that are powers of 2, we'll be able to keep
  134. * resources aligned to their size and pack them without gaps
  135. * using the sorted order.
  136. */
  137. for (i = MLX4_RES_NUM; i > 0; --i)
  138. for (j = 1; j < i; ++j) {
  139. if (profile[j].size > profile[j - 1].size) {
  140. tmp = profile[j];
  141. profile[j] = profile[j - 1];
  142. profile[j - 1] = tmp;
  143. }
  144. }
  145. for (i = 0; i < MLX4_RES_NUM; ++i) {
  146. if (profile[i].size) {
  147. profile[i].start = total_size;
  148. total_size += profile[i].size;
  149. }
  150. if (total_size > dev_cap->max_icm_sz) {
  151. mlx4_err(dev, "Profile requires 0x%llx bytes; "
  152. "won't fit in 0x%llx bytes of context memory.\n",
  153. (unsigned long long) total_size,
  154. (unsigned long long) dev_cap->max_icm_sz);
  155. kfree(profile);
  156. return -ENOMEM;
  157. }
  158. if (profile[i].size)
  159. mlx4_dbg(dev, " profile[%2d] (%6s): 2^%02d entries @ 0x%10llx, "
  160. "size 0x%10llx\n",
  161. i, res_name[profile[i].type], profile[i].log_num,
  162. (unsigned long long) profile[i].start,
  163. (unsigned long long) profile[i].size);
  164. }
  165. mlx4_dbg(dev, "HCA context memory: reserving %d KB\n",
  166. (int) (total_size >> 10));
  167. for (i = 0; i < MLX4_RES_NUM; ++i) {
  168. switch (profile[i].type) {
  169. case MLX4_RES_QP:
  170. dev->caps.num_qps = profile[i].num;
  171. init_hca->qpc_base = profile[i].start;
  172. init_hca->log_num_qps = profile[i].log_num;
  173. break;
  174. case MLX4_RES_RDMARC:
  175. for (priv->qp_table.rdmarc_shift = 0;
  176. request->num_qp << priv->qp_table.rdmarc_shift < profile[i].num;
  177. ++priv->qp_table.rdmarc_shift)
  178. ; /* nothing */
  179. dev->caps.max_qp_dest_rdma = 1 << priv->qp_table.rdmarc_shift;
  180. priv->qp_table.rdmarc_base = (u32) profile[i].start;
  181. init_hca->rdmarc_base = profile[i].start;
  182. init_hca->log_rd_per_qp = priv->qp_table.rdmarc_shift;
  183. break;
  184. case MLX4_RES_ALTC:
  185. init_hca->altc_base = profile[i].start;
  186. break;
  187. case MLX4_RES_AUXC:
  188. init_hca->auxc_base = profile[i].start;
  189. break;
  190. case MLX4_RES_SRQ:
  191. dev->caps.num_srqs = profile[i].num;
  192. init_hca->srqc_base = profile[i].start;
  193. init_hca->log_num_srqs = profile[i].log_num;
  194. break;
  195. case MLX4_RES_CQ:
  196. dev->caps.num_cqs = profile[i].num;
  197. init_hca->cqc_base = profile[i].start;
  198. init_hca->log_num_cqs = profile[i].log_num;
  199. break;
  200. case MLX4_RES_EQ:
  201. dev->caps.num_eqs = profile[i].num;
  202. init_hca->eqc_base = profile[i].start;
  203. init_hca->log_num_eqs = profile[i].log_num;
  204. break;
  205. case MLX4_RES_DMPT:
  206. dev->caps.num_mpts = profile[i].num;
  207. priv->mr_table.mpt_base = profile[i].start;
  208. init_hca->dmpt_base = profile[i].start;
  209. init_hca->log_mpt_sz = profile[i].log_num;
  210. break;
  211. case MLX4_RES_CMPT:
  212. init_hca->cmpt_base = profile[i].start;
  213. break;
  214. case MLX4_RES_MTT:
  215. dev->caps.num_mtts = profile[i].num;
  216. priv->mr_table.mtt_base = profile[i].start;
  217. init_hca->mtt_base = profile[i].start;
  218. break;
  219. case MLX4_RES_MCG:
  220. dev->caps.num_mgms = profile[i].num >> 1;
  221. dev->caps.num_amgms = profile[i].num >> 1;
  222. init_hca->mc_base = profile[i].start;
  223. init_hca->log_mc_entry_sz =
  224. ilog2(mlx4_get_mgm_entry_size(dev));
  225. init_hca->log_mc_table_sz = profile[i].log_num;
  226. init_hca->log_mc_hash_sz = profile[i].log_num - 1;
  227. break;
  228. default:
  229. break;
  230. }
  231. }
  232. /*
  233. * PDs don't take any HCA memory, but we assign them as part
  234. * of the HCA profile anyway.
  235. */
  236. dev->caps.num_pds = MLX4_NUM_PDS;
  237. kfree(profile);
  238. return total_size;
  239. }