Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 | /* * Copyright (c) 2004, 2005 Topspin Communications. All rights reserved. * Copyright (c) 2005 Mellanox Technologies. All rights reserved. * * This software is available to you under a choice of one of two * licenses. You may choose to be licensed under the terms of the GNU * General Public License (GPL) Version 2, available from the file * COPYING in the main directory of this source tree, or the * OpenIB.org BSD license below: * * Redistribution and use in source and binary forms, with or * without modification, are permitted provided that the following * conditions are met: * * - Redistributions of source code must retain the above * copyright notice, this list of conditions and the following * disclaimer. * * - Redistributions in binary form must reproduce the above * copyright notice, this list of conditions and the following * disclaimer in the documentation and/or other materials * provided with the distribution. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE * SOFTWARE. */ #include <linux/string.h> #include <linux/slab.h> #include "mthca_profile.h" enum { MTHCA_RES_QP, MTHCA_RES_EEC, MTHCA_RES_SRQ, MTHCA_RES_CQ, MTHCA_RES_EQP, MTHCA_RES_EEEC, MTHCA_RES_EQ, MTHCA_RES_RDB, MTHCA_RES_MCG, MTHCA_RES_MPT, MTHCA_RES_MTT, MTHCA_RES_UAR, MTHCA_RES_UDAV, MTHCA_RES_UARC, MTHCA_RES_NUM }; enum { MTHCA_NUM_EQS = 32, MTHCA_NUM_PDS = 1 << 15 }; s64 mthca_make_profile(struct mthca_dev *dev, struct mthca_profile *request, struct mthca_dev_lim *dev_lim, struct mthca_init_hca_param *init_hca) { struct mthca_resource { u64 size; u64 start; int type; int num; int log_num; }; u64 mem_base, mem_avail; s64 total_size = 0; struct mthca_resource *profile; int i, j; profile = kcalloc(MTHCA_RES_NUM, sizeof(*profile), GFP_KERNEL); if (!profile) return -ENOMEM; profile[MTHCA_RES_QP].size = dev_lim->qpc_entry_sz; profile[MTHCA_RES_EEC].size = dev_lim->eec_entry_sz; profile[MTHCA_RES_SRQ].size = dev_lim->srq_entry_sz; profile[MTHCA_RES_CQ].size = dev_lim->cqc_entry_sz; profile[MTHCA_RES_EQP].size = dev_lim->eqpc_entry_sz; profile[MTHCA_RES_EEEC].size = dev_lim->eeec_entry_sz; profile[MTHCA_RES_EQ].size = dev_lim->eqc_entry_sz; profile[MTHCA_RES_RDB].size = MTHCA_RDB_ENTRY_SIZE; profile[MTHCA_RES_MCG].size = MTHCA_MGM_ENTRY_SIZE; profile[MTHCA_RES_MPT].size = dev_lim->mpt_entry_sz; profile[MTHCA_RES_MTT].size = dev->limits.mtt_seg_size; profile[MTHCA_RES_UAR].size = dev_lim->uar_scratch_entry_sz; profile[MTHCA_RES_UDAV].size = MTHCA_AV_SIZE; profile[MTHCA_RES_UARC].size = request->uarc_size; profile[MTHCA_RES_QP].num = request->num_qp; profile[MTHCA_RES_SRQ].num = request->num_srq; profile[MTHCA_RES_EQP].num = request->num_qp; profile[MTHCA_RES_RDB].num = request->num_qp * request->rdb_per_qp; profile[MTHCA_RES_CQ].num = request->num_cq; profile[MTHCA_RES_EQ].num = MTHCA_NUM_EQS; profile[MTHCA_RES_MCG].num = request->num_mcg; profile[MTHCA_RES_MPT].num = request->num_mpt; profile[MTHCA_RES_MTT].num = request->num_mtt; profile[MTHCA_RES_UAR].num = request->num_uar; profile[MTHCA_RES_UARC].num = request->num_uar; profile[MTHCA_RES_UDAV].num = request->num_udav; for (i = 0; i < MTHCA_RES_NUM; ++i) { profile[i].type = i; profile[i].log_num = max(ffs(profile[i].num) - 1, 0); profile[i].size *= profile[i].num; if (mthca_is_memfree(dev)) profile[i].size = max(profile[i].size, (u64) PAGE_SIZE); } if (mthca_is_memfree(dev)) { mem_base = 0; mem_avail = dev_lim->hca.arbel.max_icm_sz; } else { mem_base = dev->ddr_start; mem_avail = dev->fw.tavor.fw_start - dev->ddr_start; } /* * Sort the resources in decreasing order of size. Since they * all have sizes that are powers of 2, we'll be able to keep * resources aligned to their size and pack them without gaps * using the sorted order. */ for (i = MTHCA_RES_NUM; i > 0; --i) for (j = 1; j < i; ++j) { if (profile[j].size > profile[j - 1].size) swap(profile[j], profile[j - 1]); } for (i = 0; i < MTHCA_RES_NUM; ++i) { if (profile[i].size) { profile[i].start = mem_base + total_size; total_size += profile[i].size; } if (total_size > mem_avail) { mthca_err(dev, "Profile requires 0x%llx bytes; " "won't fit in 0x%llx bytes of context memory.\n", (unsigned long long) total_size, (unsigned long long) mem_avail); kfree(profile); return -ENOMEM; } if (profile[i].size) mthca_dbg(dev, "profile[%2d]--%2d/%2d @ 0x%16llx " "(size 0x%8llx)\n", i, profile[i].type, profile[i].log_num, (unsigned long long) profile[i].start, (unsigned long long) profile[i].size); } if (mthca_is_memfree(dev)) mthca_dbg(dev, "HCA context memory: reserving %d KB\n", (int) (total_size >> 10)); else mthca_dbg(dev, "HCA memory: allocated %d KB/%d KB (%d KB free)\n", (int) (total_size >> 10), (int) (mem_avail >> 10), (int) ((mem_avail - total_size) >> 10)); for (i = 0; i < MTHCA_RES_NUM; ++i) { switch (profile[i].type) { case MTHCA_RES_QP: dev->limits.num_qps = profile[i].num; init_hca->qpc_base = profile[i].start; init_hca->log_num_qps = profile[i].log_num; break; case MTHCA_RES_EEC: dev->limits.num_eecs = profile[i].num; init_hca->eec_base = profile[i].start; init_hca->log_num_eecs = profile[i].log_num; break; case MTHCA_RES_SRQ: dev->limits.num_srqs = profile[i].num; init_hca->srqc_base = profile[i].start; init_hca->log_num_srqs = profile[i].log_num; break; case MTHCA_RES_CQ: dev->limits.num_cqs = profile[i].num; init_hca->cqc_base = profile[i].start; init_hca->log_num_cqs = profile[i].log_num; break; case MTHCA_RES_EQP: init_hca->eqpc_base = profile[i].start; break; case MTHCA_RES_EEEC: init_hca->eeec_base = profile[i].start; break; case MTHCA_RES_EQ: dev->limits.num_eqs = profile[i].num; init_hca->eqc_base = profile[i].start; init_hca->log_num_eqs = profile[i].log_num; break; case MTHCA_RES_RDB: for (dev->qp_table.rdb_shift = 0; request->num_qp << dev->qp_table.rdb_shift < profile[i].num; ++dev->qp_table.rdb_shift) ; /* nothing */ dev->qp_table.rdb_base = (u32) profile[i].start; init_hca->rdb_base = profile[i].start; break; case MTHCA_RES_MCG: dev->limits.num_mgms = profile[i].num >> 1; dev->limits.num_amgms = profile[i].num >> 1; init_hca->mc_base = profile[i].start; init_hca->log_mc_entry_sz = ffs(MTHCA_MGM_ENTRY_SIZE) - 1; init_hca->log_mc_table_sz = profile[i].log_num; init_hca->mc_hash_sz = 1 << (profile[i].log_num - 1); break; case MTHCA_RES_MPT: dev->limits.num_mpts = profile[i].num; dev->mr_table.mpt_base = profile[i].start; init_hca->mpt_base = profile[i].start; init_hca->log_mpt_sz = profile[i].log_num; break; case MTHCA_RES_MTT: dev->limits.num_mtt_segs = profile[i].num; dev->mr_table.mtt_base = profile[i].start; init_hca->mtt_base = profile[i].start; init_hca->mtt_seg_sz = ffs(dev->limits.mtt_seg_size) - 7; break; case MTHCA_RES_UAR: dev->limits.num_uars = profile[i].num; init_hca->uar_scratch_base = profile[i].start; break; case MTHCA_RES_UDAV: dev->av_table.ddr_av_base = profile[i].start; dev->av_table.num_ddr_avs = profile[i].num; break; case MTHCA_RES_UARC: dev->uar_table.uarc_size = request->uarc_size; dev->uar_table.uarc_base = profile[i].start; init_hca->uarc_base = profile[i].start; init_hca->log_uarc_sz = ffs(request->uarc_size) - 13; init_hca->log_uar_sz = ffs(request->num_uar) - 1; break; default: break; } } /* * PDs don't take any HCA memory, but we assign them as part * of the HCA profile anyway. */ dev->limits.num_pds = MTHCA_NUM_PDS; if (dev->mthca_flags & MTHCA_FLAG_SINAI_OPT && init_hca->log_mpt_sz > 23) { mthca_warn(dev, "MPT table too large (requested size 2^%d >= 2^24)\n", init_hca->log_mpt_sz); mthca_warn(dev, "Disabling memory key throughput optimization.\n"); dev->mthca_flags &= ~MTHCA_FLAG_SINAI_OPT; } /* * For Tavor, FMRs use ioremapped PCI memory. For 32 bit * systems it may use too much vmalloc space to map all MTT * memory, so we reserve some MTTs for FMR access, taking them * out of the MR pool. They don't use additional memory, but * we assign them as part of the HCA profile anyway. */ if (mthca_is_memfree(dev) || BITS_PER_LONG == 64) dev->limits.fmr_reserved_mtts = 0; else dev->limits.fmr_reserved_mtts = request->fmr_reserved_mtts; kfree(profile); return total_size; } |