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