Tom Tucker | f94b533 | 2006-09-22 15:22:48 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (c) 2004 Topspin Communications. All rights reserved. |
| 3 | * Copyright (c) 2005 Open Grid Computing, Inc. 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/errno.h> |
| 35 | #include <linux/slab.h> |
| 36 | #include <linux/bitmap.h> |
| 37 | |
| 38 | #include "c2.h" |
| 39 | |
| 40 | static int c2_alloc_mqsp_chunk(struct c2_dev *c2dev, gfp_t gfp_mask, |
| 41 | struct sp_chunk **head) |
| 42 | { |
| 43 | int i; |
| 44 | struct sp_chunk *new_head; |
| 45 | |
| 46 | new_head = (struct sp_chunk *) __get_free_page(gfp_mask); |
| 47 | if (new_head == NULL) |
| 48 | return -ENOMEM; |
| 49 | |
| 50 | new_head->dma_addr = dma_map_single(c2dev->ibdev.dma_device, new_head, |
| 51 | PAGE_SIZE, DMA_FROM_DEVICE); |
| 52 | pci_unmap_addr_set(new_head, mapping, new_head->dma_addr); |
| 53 | |
| 54 | new_head->next = NULL; |
| 55 | new_head->head = 0; |
| 56 | |
| 57 | /* build list where each index is the next free slot */ |
| 58 | for (i = 0; |
| 59 | i < (PAGE_SIZE - sizeof(struct sp_chunk) - |
| 60 | sizeof(u16)) / sizeof(u16) - 1; |
| 61 | i++) { |
| 62 | new_head->shared_ptr[i] = i + 1; |
| 63 | } |
| 64 | /* terminate list */ |
| 65 | new_head->shared_ptr[i] = 0xFFFF; |
| 66 | |
| 67 | *head = new_head; |
| 68 | return 0; |
| 69 | } |
| 70 | |
| 71 | int c2_init_mqsp_pool(struct c2_dev *c2dev, gfp_t gfp_mask, |
| 72 | struct sp_chunk **root) |
| 73 | { |
| 74 | return c2_alloc_mqsp_chunk(c2dev, gfp_mask, root); |
| 75 | } |
| 76 | |
| 77 | void c2_free_mqsp_pool(struct c2_dev *c2dev, struct sp_chunk *root) |
| 78 | { |
| 79 | struct sp_chunk *next; |
| 80 | |
| 81 | while (root) { |
| 82 | next = root->next; |
| 83 | dma_unmap_single(c2dev->ibdev.dma_device, |
| 84 | pci_unmap_addr(root, mapping), PAGE_SIZE, |
| 85 | DMA_FROM_DEVICE); |
| 86 | __free_page((struct page *) root); |
| 87 | root = next; |
| 88 | } |
| 89 | } |
| 90 | |
| 91 | u16 *c2_alloc_mqsp(struct c2_dev *c2dev, struct sp_chunk *head, |
| 92 | dma_addr_t *dma_addr, gfp_t gfp_mask) |
| 93 | { |
| 94 | u16 mqsp; |
| 95 | |
| 96 | while (head) { |
| 97 | mqsp = head->head; |
| 98 | if (mqsp != 0xFFFF) { |
| 99 | head->head = head->shared_ptr[mqsp]; |
| 100 | break; |
| 101 | } else if (head->next == NULL) { |
| 102 | if (c2_alloc_mqsp_chunk(c2dev, gfp_mask, &head->next) == |
| 103 | 0) { |
| 104 | head = head->next; |
| 105 | mqsp = head->head; |
| 106 | head->head = head->shared_ptr[mqsp]; |
| 107 | break; |
| 108 | } else |
| 109 | return NULL; |
| 110 | } else |
| 111 | head = head->next; |
| 112 | } |
| 113 | if (head) { |
| 114 | *dma_addr = head->dma_addr + |
| 115 | ((unsigned long) &(head->shared_ptr[mqsp]) - |
| 116 | (unsigned long) head); |
| 117 | pr_debug("%s addr %p dma_addr %llx\n", __FUNCTION__, |
Roland Dreier | 6edf602 | 2006-09-27 14:42:56 -0700 | [diff] [blame] | 118 | &(head->shared_ptr[mqsp]), (unsigned long long) *dma_addr); |
Tom Tucker | f94b533 | 2006-09-22 15:22:48 -0700 | [diff] [blame] | 119 | return &(head->shared_ptr[mqsp]); |
| 120 | } |
| 121 | return NULL; |
| 122 | } |
| 123 | |
| 124 | void c2_free_mqsp(u16 * mqsp) |
| 125 | { |
| 126 | struct sp_chunk *head; |
| 127 | u16 idx; |
| 128 | |
| 129 | /* The chunk containing this ptr begins at the page boundary */ |
| 130 | head = (struct sp_chunk *) ((unsigned long) mqsp & PAGE_MASK); |
| 131 | |
| 132 | /* Link head to new mqsp */ |
| 133 | *mqsp = head->head; |
| 134 | |
| 135 | /* Compute the shared_ptr index */ |
| 136 | idx = ((unsigned long) mqsp & ~PAGE_MASK) >> 1; |
| 137 | idx -= (unsigned long) &(((struct sp_chunk *) 0)->shared_ptr[0]) >> 1; |
| 138 | |
| 139 | /* Point this index at the head */ |
| 140 | head->shared_ptr[idx] = head->head; |
| 141 | |
| 142 | /* Point head at this index */ |
| 143 | head->head = idx; |
| 144 | } |