2 * Copyright (c) 2004, 2005 Topspin Communications. All rights reserved.
4 * This software is available to you under a choice of one of two
5 * licenses. You may choose to be licensed under the terms of the GNU
6 * General Public License (GPL) Version 2, available from the file
7 * COPYING in the main directory of this source tree, or the
8 * OpenIB.org BSD license below:
10 * Redistribution and use in source and binary forms, with or
11 * without modification, are permitted provided that the following
14 * - Redistributions of source code must retain the above
15 * copyright notice, this list of conditions and the following
18 * - Redistributions in binary form must reproduce the above
19 * copyright notice, this list of conditions and the following
20 * disclaimer in the documentation and/or other materials
21 * provided with the distribution.
23 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
24 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
25 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
26 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
27 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
28 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
29 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
35 #include "mthca_memfree.h"
36 #include "mthca_dev.h"
37 #include "mthca_cmd.h"
41 * We allocate in as big chunks as we can, up to a maximum of 256 KB
45 MTHCA_ICM_ALLOC_SIZE = 1 << 18,
46 MTHCA_TABLE_CHUNK_SIZE = 1 << 18
49 void mthca_free_icm(struct mthca_dev *dev, struct mthca_icm *icm)
51 struct mthca_icm_chunk *chunk, *tmp;
57 list_for_each_entry_safe(chunk, tmp, &icm->chunk_list, list) {
59 pci_unmap_sg(dev->pdev, chunk->mem, chunk->npages,
60 PCI_DMA_BIDIRECTIONAL);
62 for (i = 0; i < chunk->npages; ++i)
63 __free_pages(chunk->mem[i].page,
64 get_order(chunk->mem[i].length));
72 struct mthca_icm *mthca_alloc_icm(struct mthca_dev *dev, int npages,
73 unsigned int gfp_mask)
75 struct mthca_icm *icm;
76 struct mthca_icm_chunk *chunk = NULL;
79 icm = kmalloc(sizeof *icm, gfp_mask & ~(__GFP_HIGHMEM | __GFP_NOWARN));
84 INIT_LIST_HEAD(&icm->chunk_list);
86 cur_order = get_order(MTHCA_ICM_ALLOC_SIZE);
90 chunk = kmalloc(sizeof *chunk,
91 gfp_mask & ~(__GFP_HIGHMEM | __GFP_NOWARN));
97 list_add_tail(&chunk->list, &icm->chunk_list);
100 while (1 << cur_order > npages)
103 chunk->mem[chunk->npages].page = alloc_pages(gfp_mask, cur_order);
104 if (chunk->mem[chunk->npages].page) {
105 chunk->mem[chunk->npages].length = PAGE_SIZE << cur_order;
106 chunk->mem[chunk->npages].offset = 0;
108 if (++chunk->npages == MTHCA_ICM_CHUNK_LEN) {
109 chunk->nsg = pci_map_sg(dev->pdev, chunk->mem,
111 PCI_DMA_BIDIRECTIONAL);
119 npages -= 1 << cur_order;
128 chunk->nsg = pci_map_sg(dev->pdev, chunk->mem,
130 PCI_DMA_BIDIRECTIONAL);
139 mthca_free_icm(dev, icm);
143 int mthca_table_get(struct mthca_dev *dev, struct mthca_icm_table *table, int obj)
145 int i = (obj & (table->num_obj - 1)) * table->obj_size / MTHCA_TABLE_CHUNK_SIZE;
152 ++table->icm[i]->refcount;
156 table->icm[i] = mthca_alloc_icm(dev, MTHCA_TABLE_CHUNK_SIZE >> PAGE_SHIFT,
157 (table->lowmem ? GFP_KERNEL : GFP_HIGHUSER) |
159 if (!table->icm[i]) {
164 if (mthca_MAP_ICM(dev, table->icm[i], table->virt + i * MTHCA_TABLE_CHUNK_SIZE,
165 &status) || status) {
166 mthca_free_icm(dev, table->icm[i]);
167 table->icm[i] = NULL;
172 ++table->icm[i]->refcount;
179 void mthca_table_put(struct mthca_dev *dev, struct mthca_icm_table *table, int obj)
181 int i = (obj & (table->num_obj - 1)) * table->obj_size / MTHCA_TABLE_CHUNK_SIZE;
186 if (--table->icm[i]->refcount == 0) {
187 mthca_UNMAP_ICM(dev, table->virt + i * MTHCA_TABLE_CHUNK_SIZE,
188 MTHCA_TABLE_CHUNK_SIZE >> 12, &status);
189 mthca_free_icm(dev, table->icm[i]);
190 table->icm[i] = NULL;
196 void *mthca_table_find(struct mthca_icm_table *table, int obj)
199 struct mthca_icm_chunk *chunk;
200 struct mthca_icm *icm;
201 struct page *page = NULL;
208 idx = (obj & (table->num_obj - 1)) * table->obj_size;
209 icm = table->icm[idx / MTHCA_TABLE_CHUNK_SIZE];
210 offset = idx % MTHCA_TABLE_CHUNK_SIZE;
215 list_for_each_entry(chunk, &icm->chunk_list, list) {
216 for (i = 0; i < chunk->npages; ++i) {
217 if (chunk->mem[i].length >= offset) {
218 page = chunk->mem[i].page;
221 offset -= chunk->mem[i].length;
227 return page ? lowmem_page_address(page) + offset : NULL;
230 int mthca_table_get_range(struct mthca_dev *dev, struct mthca_icm_table *table,
233 int inc = MTHCA_TABLE_CHUNK_SIZE / table->obj_size;
236 for (i = start; i <= end; i += inc) {
237 err = mthca_table_get(dev, table, i);
247 mthca_table_put(dev, table, i);
253 void mthca_table_put_range(struct mthca_dev *dev, struct mthca_icm_table *table,
258 for (i = start; i <= end; i += MTHCA_TABLE_CHUNK_SIZE / table->obj_size)
259 mthca_table_put(dev, table, i);
262 struct mthca_icm_table *mthca_alloc_icm_table(struct mthca_dev *dev,
263 u64 virt, int obj_size,
264 int nobj, int reserved,
267 struct mthca_icm_table *table;
272 num_icm = obj_size * nobj / MTHCA_TABLE_CHUNK_SIZE;
274 table = kmalloc(sizeof *table + num_icm * sizeof *table->icm, GFP_KERNEL);
279 table->num_icm = num_icm;
280 table->num_obj = nobj;
281 table->obj_size = obj_size;
282 table->lowmem = use_lowmem;
283 init_MUTEX(&table->mutex);
285 for (i = 0; i < num_icm; ++i)
286 table->icm[i] = NULL;
288 for (i = 0; i * MTHCA_TABLE_CHUNK_SIZE < reserved * obj_size; ++i) {
289 table->icm[i] = mthca_alloc_icm(dev, MTHCA_TABLE_CHUNK_SIZE >> PAGE_SHIFT,
290 (use_lowmem ? GFP_KERNEL : GFP_HIGHUSER) |
294 if (mthca_MAP_ICM(dev, table->icm[i], virt + i * MTHCA_TABLE_CHUNK_SIZE,
295 &status) || status) {
296 mthca_free_icm(dev, table->icm[i]);
297 table->icm[i] = NULL;
302 * Add a reference to this ICM chunk so that it never
303 * gets freed (since it contains reserved firmware objects).
305 ++table->icm[i]->refcount;
311 for (i = 0; i < num_icm; ++i)
313 mthca_UNMAP_ICM(dev, virt + i * MTHCA_TABLE_CHUNK_SIZE,
314 MTHCA_TABLE_CHUNK_SIZE >> 12, &status);
315 mthca_free_icm(dev, table->icm[i]);
323 void mthca_free_icm_table(struct mthca_dev *dev, struct mthca_icm_table *table)
328 for (i = 0; i < table->num_icm; ++i)
330 mthca_UNMAP_ICM(dev, table->virt + i * MTHCA_TABLE_CHUNK_SIZE,
331 MTHCA_TABLE_CHUNK_SIZE >> 12, &status);
332 mthca_free_icm(dev, table->icm[i]);
338 static u64 mthca_uarc_virt(struct mthca_dev *dev, int page)
340 return dev->uar_table.uarc_base +
341 dev->driver_uar.index * dev->uar_table.uarc_size +
345 int mthca_alloc_db(struct mthca_dev *dev, int type, u32 qn, u32 **db)
350 struct mthca_db_page *page;
354 down(&dev->db_tab->mutex);
357 case MTHCA_DB_TYPE_CQ_ARM:
358 case MTHCA_DB_TYPE_SQ:
361 end = dev->db_tab->max_group1;
365 case MTHCA_DB_TYPE_CQ_SET_CI:
366 case MTHCA_DB_TYPE_RQ:
367 case MTHCA_DB_TYPE_SRQ:
369 start = dev->db_tab->npages - 1;
370 end = dev->db_tab->min_group2;
379 for (i = start; i != end; i += dir)
380 if (dev->db_tab->page[i].db_rec &&
381 !bitmap_full(dev->db_tab->page[i].used,
382 MTHCA_DB_REC_PER_PAGE)) {
383 page = dev->db_tab->page + i;
387 if (dev->db_tab->max_group1 >= dev->db_tab->min_group2 - 1) {
392 page = dev->db_tab->page + end;
393 page->db_rec = dma_alloc_coherent(&dev->pdev->dev, 4096,
394 &page->mapping, GFP_KERNEL);
399 memset(page->db_rec, 0, 4096);
401 ret = mthca_MAP_ICM_page(dev, page->mapping, mthca_uarc_virt(dev, i), &status);
405 dma_free_coherent(&dev->pdev->dev, 4096,
406 page->db_rec, page->mapping);
410 bitmap_zero(page->used, MTHCA_DB_REC_PER_PAGE);
412 ++dev->db_tab->max_group1;
414 --dev->db_tab->min_group2;
417 j = find_first_zero_bit(page->used, MTHCA_DB_REC_PER_PAGE);
418 set_bit(j, page->used);
421 j = MTHCA_DB_REC_PER_PAGE - 1 - j;
423 ret = i * MTHCA_DB_REC_PER_PAGE + j;
425 page->db_rec[j] = cpu_to_be64((qn << 8) | (type << 5));
427 *db = (u32 *) &page->db_rec[j];
430 up(&dev->db_tab->mutex);
435 void mthca_free_db(struct mthca_dev *dev, int type, int db_index)
438 struct mthca_db_page *page;
441 i = db_index / MTHCA_DB_REC_PER_PAGE;
442 j = db_index % MTHCA_DB_REC_PER_PAGE;
444 page = dev->db_tab->page + i;
446 down(&dev->db_tab->mutex);
449 if (i >= dev->db_tab->min_group2)
450 j = MTHCA_DB_REC_PER_PAGE - 1 - j;
451 clear_bit(j, page->used);
453 if (bitmap_empty(page->used, MTHCA_DB_REC_PER_PAGE) &&
454 i >= dev->db_tab->max_group1 - 1) {
455 mthca_UNMAP_ICM(dev, mthca_uarc_virt(dev, i), 1, &status);
457 dma_free_coherent(&dev->pdev->dev, 4096,
458 page->db_rec, page->mapping);
461 if (i == dev->db_tab->max_group1) {
462 --dev->db_tab->max_group1;
463 /* XXX may be able to unmap more pages now */
465 if (i == dev->db_tab->min_group2)
466 ++dev->db_tab->min_group2;
469 up(&dev->db_tab->mutex);
472 int mthca_init_db_tab(struct mthca_dev *dev)
476 if (!mthca_is_memfree(dev))
479 dev->db_tab = kmalloc(sizeof *dev->db_tab, GFP_KERNEL);
483 init_MUTEX(&dev->db_tab->mutex);
485 dev->db_tab->npages = dev->uar_table.uarc_size / 4096;
486 dev->db_tab->max_group1 = 0;
487 dev->db_tab->min_group2 = dev->db_tab->npages - 1;
489 dev->db_tab->page = kmalloc(dev->db_tab->npages *
490 sizeof *dev->db_tab->page,
492 if (!dev->db_tab->page) {
497 for (i = 0; i < dev->db_tab->npages; ++i)
498 dev->db_tab->page[i].db_rec = NULL;
503 void mthca_cleanup_db_tab(struct mthca_dev *dev)
508 if (!mthca_is_memfree(dev))
512 * Because we don't always free our UARC pages when they
513 * become empty to make mthca_free_db() simpler we need to
514 * make a sweep through the doorbell pages and free any
515 * leftover pages now.
517 for (i = 0; i < dev->db_tab->npages; ++i) {
518 if (!dev->db_tab->page[i].db_rec)
521 if (!bitmap_empty(dev->db_tab->page[i].used, MTHCA_DB_REC_PER_PAGE))
522 mthca_warn(dev, "Kernel UARC page %d not empty\n", i);
524 mthca_UNMAP_ICM(dev, mthca_uarc_virt(dev, i), 1, &status);
526 dma_free_coherent(&dev->pdev->dev, 4096,
527 dev->db_tab->page[i].db_rec,
528 dev->db_tab->page[i].mapping);
531 kfree(dev->db_tab->page);