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
37 #include "mthca_memfree.h"
38 #include "mthca_dev.h"
39 #include "mthca_cmd.h"
42 * We allocate in as big chunks as we can, up to a maximum of 256 KB
46 MTHCA_ICM_ALLOC_SIZE = 1 << 18,
47 MTHCA_TABLE_CHUNK_SIZE = 1 << 18
50 void mthca_free_icm(struct mthca_dev *dev, struct mthca_icm *icm)
52 struct mthca_icm_chunk *chunk, *tmp;
58 list_for_each_entry_safe(chunk, tmp, &icm->chunk_list, list) {
60 pci_unmap_sg(dev->pdev, chunk->mem, chunk->npages,
61 PCI_DMA_BIDIRECTIONAL);
63 for (i = 0; i < chunk->npages; ++i)
64 __free_pages(chunk->mem[i].page,
65 get_order(chunk->mem[i].length));
73 struct mthca_icm *mthca_alloc_icm(struct mthca_dev *dev, int npages,
74 unsigned int gfp_mask)
76 struct mthca_icm *icm;
77 struct mthca_icm_chunk *chunk = NULL;
80 icm = kmalloc(sizeof *icm, gfp_mask & ~(__GFP_HIGHMEM | __GFP_NOWARN));
85 INIT_LIST_HEAD(&icm->chunk_list);
87 cur_order = get_order(MTHCA_ICM_ALLOC_SIZE);
91 chunk = kmalloc(sizeof *chunk,
92 gfp_mask & ~(__GFP_HIGHMEM | __GFP_NOWARN));
98 list_add_tail(&chunk->list, &icm->chunk_list);
101 while (1 << cur_order > npages)
104 chunk->mem[chunk->npages].page = alloc_pages(gfp_mask, cur_order);
105 if (chunk->mem[chunk->npages].page) {
106 chunk->mem[chunk->npages].length = PAGE_SIZE << cur_order;
107 chunk->mem[chunk->npages].offset = 0;
109 if (++chunk->npages == MTHCA_ICM_CHUNK_LEN) {
110 chunk->nsg = pci_map_sg(dev->pdev, chunk->mem,
112 PCI_DMA_BIDIRECTIONAL);
120 npages -= 1 << cur_order;
129 chunk->nsg = pci_map_sg(dev->pdev, chunk->mem,
131 PCI_DMA_BIDIRECTIONAL);
140 mthca_free_icm(dev, icm);
144 int mthca_table_get(struct mthca_dev *dev, struct mthca_icm_table *table, int obj)
146 int i = (obj & (table->num_obj - 1)) * table->obj_size / MTHCA_TABLE_CHUNK_SIZE;
153 ++table->icm[i]->refcount;
157 table->icm[i] = mthca_alloc_icm(dev, MTHCA_TABLE_CHUNK_SIZE >> PAGE_SHIFT,
158 (table->lowmem ? GFP_KERNEL : GFP_HIGHUSER) |
160 if (!table->icm[i]) {
165 if (mthca_MAP_ICM(dev, table->icm[i], table->virt + i * MTHCA_TABLE_CHUNK_SIZE,
166 &status) || status) {
167 mthca_free_icm(dev, table->icm[i]);
168 table->icm[i] = NULL;
173 ++table->icm[i]->refcount;
180 void mthca_table_put(struct mthca_dev *dev, struct mthca_icm_table *table, int obj)
182 int i = (obj & (table->num_obj - 1)) * table->obj_size / MTHCA_TABLE_CHUNK_SIZE;
187 if (--table->icm[i]->refcount == 0) {
188 mthca_UNMAP_ICM(dev, table->virt + i * MTHCA_TABLE_CHUNK_SIZE,
189 MTHCA_TABLE_CHUNK_SIZE >> 12, &status);
190 mthca_free_icm(dev, table->icm[i]);
191 table->icm[i] = NULL;
197 void *mthca_table_find(struct mthca_icm_table *table, int obj)
200 struct mthca_icm_chunk *chunk;
201 struct mthca_icm *icm;
202 struct page *page = NULL;
209 idx = (obj & (table->num_obj - 1)) * table->obj_size;
210 icm = table->icm[idx / MTHCA_TABLE_CHUNK_SIZE];
211 offset = idx % MTHCA_TABLE_CHUNK_SIZE;
216 list_for_each_entry(chunk, &icm->chunk_list, list) {
217 for (i = 0; i < chunk->npages; ++i) {
218 if (chunk->mem[i].length >= offset) {
219 page = chunk->mem[i].page;
222 offset -= chunk->mem[i].length;
228 return page ? lowmem_page_address(page) + offset : NULL;
231 int mthca_table_get_range(struct mthca_dev *dev, struct mthca_icm_table *table,
234 int inc = MTHCA_TABLE_CHUNK_SIZE / table->obj_size;
237 for (i = start; i <= end; i += inc) {
238 err = mthca_table_get(dev, table, i);
248 mthca_table_put(dev, table, i);
254 void mthca_table_put_range(struct mthca_dev *dev, struct mthca_icm_table *table,
259 for (i = start; i <= end; i += MTHCA_TABLE_CHUNK_SIZE / table->obj_size)
260 mthca_table_put(dev, table, i);
263 struct mthca_icm_table *mthca_alloc_icm_table(struct mthca_dev *dev,
264 u64 virt, int obj_size,
265 int nobj, int reserved,
268 struct mthca_icm_table *table;
273 num_icm = obj_size * nobj / MTHCA_TABLE_CHUNK_SIZE;
275 table = kmalloc(sizeof *table + num_icm * sizeof *table->icm, GFP_KERNEL);
280 table->num_icm = num_icm;
281 table->num_obj = nobj;
282 table->obj_size = obj_size;
283 table->lowmem = use_lowmem;
284 init_MUTEX(&table->mutex);
286 for (i = 0; i < num_icm; ++i)
287 table->icm[i] = NULL;
289 for (i = 0; i * MTHCA_TABLE_CHUNK_SIZE < reserved * obj_size; ++i) {
290 table->icm[i] = mthca_alloc_icm(dev, MTHCA_TABLE_CHUNK_SIZE >> PAGE_SHIFT,
291 (use_lowmem ? GFP_KERNEL : GFP_HIGHUSER) |
295 if (mthca_MAP_ICM(dev, table->icm[i], virt + i * MTHCA_TABLE_CHUNK_SIZE,
296 &status) || status) {
297 mthca_free_icm(dev, table->icm[i]);
298 table->icm[i] = NULL;
303 * Add a reference to this ICM chunk so that it never
304 * gets freed (since it contains reserved firmware objects).
306 ++table->icm[i]->refcount;
312 for (i = 0; i < num_icm; ++i)
314 mthca_UNMAP_ICM(dev, virt + i * MTHCA_TABLE_CHUNK_SIZE,
315 MTHCA_TABLE_CHUNK_SIZE >> 12, &status);
316 mthca_free_icm(dev, table->icm[i]);
324 void mthca_free_icm_table(struct mthca_dev *dev, struct mthca_icm_table *table)
329 for (i = 0; i < table->num_icm; ++i)
331 mthca_UNMAP_ICM(dev, table->virt + i * MTHCA_TABLE_CHUNK_SIZE,
332 MTHCA_TABLE_CHUNK_SIZE >> 12, &status);
333 mthca_free_icm(dev, table->icm[i]);
339 static u64 mthca_uarc_virt(struct mthca_dev *dev, int page)
341 return dev->uar_table.uarc_base +
342 dev->driver_uar.index * dev->uar_table.uarc_size +
346 int mthca_alloc_db(struct mthca_dev *dev, int type, u32 qn, u32 **db)
351 struct mthca_db_page *page;
355 down(&dev->db_tab->mutex);
358 case MTHCA_DB_TYPE_CQ_ARM:
359 case MTHCA_DB_TYPE_SQ:
362 end = dev->db_tab->max_group1;
366 case MTHCA_DB_TYPE_CQ_SET_CI:
367 case MTHCA_DB_TYPE_RQ:
368 case MTHCA_DB_TYPE_SRQ:
370 start = dev->db_tab->npages - 1;
371 end = dev->db_tab->min_group2;
380 for (i = start; i != end; i += dir)
381 if (dev->db_tab->page[i].db_rec &&
382 !bitmap_full(dev->db_tab->page[i].used,
383 MTHCA_DB_REC_PER_PAGE)) {
384 page = dev->db_tab->page + i;
388 if (dev->db_tab->max_group1 >= dev->db_tab->min_group2 - 1) {
393 page = dev->db_tab->page + end;
394 page->db_rec = dma_alloc_coherent(&dev->pdev->dev, 4096,
395 &page->mapping, GFP_KERNEL);
400 memset(page->db_rec, 0, 4096);
402 ret = mthca_MAP_ICM_page(dev, page->mapping, mthca_uarc_virt(dev, i), &status);
406 dma_free_coherent(&dev->pdev->dev, 4096,
407 page->db_rec, page->mapping);
411 bitmap_zero(page->used, MTHCA_DB_REC_PER_PAGE);
413 ++dev->db_tab->max_group1;
415 --dev->db_tab->min_group2;
418 j = find_first_zero_bit(page->used, MTHCA_DB_REC_PER_PAGE);
419 set_bit(j, page->used);
422 j = MTHCA_DB_REC_PER_PAGE - 1 - j;
424 ret = i * MTHCA_DB_REC_PER_PAGE + j;
426 page->db_rec[j] = cpu_to_be64((qn << 8) | (type << 5));
428 *db = (u32 *) &page->db_rec[j];
431 up(&dev->db_tab->mutex);
436 void mthca_free_db(struct mthca_dev *dev, int type, int db_index)
439 struct mthca_db_page *page;
442 i = db_index / MTHCA_DB_REC_PER_PAGE;
443 j = db_index % MTHCA_DB_REC_PER_PAGE;
445 page = dev->db_tab->page + i;
447 down(&dev->db_tab->mutex);
450 if (i >= dev->db_tab->min_group2)
451 j = MTHCA_DB_REC_PER_PAGE - 1 - j;
452 clear_bit(j, page->used);
454 if (bitmap_empty(page->used, MTHCA_DB_REC_PER_PAGE) &&
455 i >= dev->db_tab->max_group1 - 1) {
456 mthca_UNMAP_ICM(dev, mthca_uarc_virt(dev, i), 1, &status);
458 dma_free_coherent(&dev->pdev->dev, 4096,
459 page->db_rec, page->mapping);
462 if (i == dev->db_tab->max_group1) {
463 --dev->db_tab->max_group1;
464 /* XXX may be able to unmap more pages now */
466 if (i == dev->db_tab->min_group2)
467 ++dev->db_tab->min_group2;
470 up(&dev->db_tab->mutex);
473 int mthca_init_db_tab(struct mthca_dev *dev)
477 if (!mthca_is_memfree(dev))
480 dev->db_tab = kmalloc(sizeof *dev->db_tab, GFP_KERNEL);
484 init_MUTEX(&dev->db_tab->mutex);
486 dev->db_tab->npages = dev->uar_table.uarc_size / 4096;
487 dev->db_tab->max_group1 = 0;
488 dev->db_tab->min_group2 = dev->db_tab->npages - 1;
490 dev->db_tab->page = kmalloc(dev->db_tab->npages *
491 sizeof *dev->db_tab->page,
493 if (!dev->db_tab->page) {
498 for (i = 0; i < dev->db_tab->npages; ++i)
499 dev->db_tab->page[i].db_rec = NULL;
504 void mthca_cleanup_db_tab(struct mthca_dev *dev)
509 if (!mthca_is_memfree(dev))
513 * Because we don't always free our UARC pages when they
514 * become empty to make mthca_free_db() simpler we need to
515 * make a sweep through the doorbell pages and free any
516 * leftover pages now.
518 for (i = 0; i < dev->db_tab->npages; ++i) {
519 if (!dev->db_tab->page[i].db_rec)
522 if (!bitmap_empty(dev->db_tab->page[i].used, MTHCA_DB_REC_PER_PAGE))
523 mthca_warn(dev, "Kernel UARC page %d not empty\n", i);
525 mthca_UNMAP_ICM(dev, mthca_uarc_virt(dev, i), 1, &status);
527 dma_free_coherent(&dev->pdev->dev, 4096,
528 dev->db_tab->page[i].db_rec,
529 dev->db_tab->page[i].mapping);
532 kfree(dev->db_tab->page);