Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame^] | 1 | /* |
| 2 | * Copyright (c) 2004, 2005 Topspin Communications. All rights reserved. |
| 3 | * |
| 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: |
| 9 | * |
| 10 | * Redistribution and use in source and binary forms, with or |
| 11 | * without modification, are permitted provided that the following |
| 12 | * conditions are met: |
| 13 | * |
| 14 | * - Redistributions of source code must retain the above |
| 15 | * copyright notice, this list of conditions and the following |
| 16 | * disclaimer. |
| 17 | * |
| 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. |
| 22 | * |
| 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 |
| 30 | * SOFTWARE. |
| 31 | * |
| 32 | * $Id$ |
| 33 | */ |
| 34 | |
| 35 | #ifndef MTHCA_MEMFREE_H |
| 36 | #define MTHCA_MEMFREE_H |
| 37 | |
| 38 | #include <linux/list.h> |
| 39 | #include <linux/pci.h> |
| 40 | |
| 41 | #include <asm/semaphore.h> |
| 42 | |
| 43 | #define MTHCA_ICM_CHUNK_LEN \ |
| 44 | ((256 - sizeof (struct list_head) - 2 * sizeof (int)) / \ |
| 45 | (sizeof (struct scatterlist))) |
| 46 | |
| 47 | struct mthca_icm_chunk { |
| 48 | struct list_head list; |
| 49 | int npages; |
| 50 | int nsg; |
| 51 | struct scatterlist mem[MTHCA_ICM_CHUNK_LEN]; |
| 52 | }; |
| 53 | |
| 54 | struct mthca_icm { |
| 55 | struct list_head chunk_list; |
| 56 | int refcount; |
| 57 | }; |
| 58 | |
| 59 | struct mthca_icm_table { |
| 60 | u64 virt; |
| 61 | int num_icm; |
| 62 | int num_obj; |
| 63 | int obj_size; |
| 64 | int lowmem; |
| 65 | struct semaphore mutex; |
| 66 | struct mthca_icm *icm[0]; |
| 67 | }; |
| 68 | |
| 69 | struct mthca_icm_iter { |
| 70 | struct mthca_icm *icm; |
| 71 | struct mthca_icm_chunk *chunk; |
| 72 | int page_idx; |
| 73 | }; |
| 74 | |
| 75 | struct mthca_dev; |
| 76 | |
| 77 | struct mthca_icm *mthca_alloc_icm(struct mthca_dev *dev, int npages, |
| 78 | unsigned int gfp_mask); |
| 79 | void mthca_free_icm(struct mthca_dev *dev, struct mthca_icm *icm); |
| 80 | |
| 81 | struct mthca_icm_table *mthca_alloc_icm_table(struct mthca_dev *dev, |
| 82 | u64 virt, int obj_size, |
| 83 | int nobj, int reserved, |
| 84 | int use_lowmem); |
| 85 | void mthca_free_icm_table(struct mthca_dev *dev, struct mthca_icm_table *table); |
| 86 | int mthca_table_get(struct mthca_dev *dev, struct mthca_icm_table *table, int obj); |
| 87 | void mthca_table_put(struct mthca_dev *dev, struct mthca_icm_table *table, int obj); |
| 88 | |
| 89 | static inline void mthca_icm_first(struct mthca_icm *icm, |
| 90 | struct mthca_icm_iter *iter) |
| 91 | { |
| 92 | iter->icm = icm; |
| 93 | iter->chunk = list_empty(&icm->chunk_list) ? |
| 94 | NULL : list_entry(icm->chunk_list.next, |
| 95 | struct mthca_icm_chunk, list); |
| 96 | iter->page_idx = 0; |
| 97 | } |
| 98 | |
| 99 | static inline int mthca_icm_last(struct mthca_icm_iter *iter) |
| 100 | { |
| 101 | return !iter->chunk; |
| 102 | } |
| 103 | |
| 104 | static inline void mthca_icm_next(struct mthca_icm_iter *iter) |
| 105 | { |
| 106 | if (++iter->page_idx >= iter->chunk->nsg) { |
| 107 | if (iter->chunk->list.next == &iter->icm->chunk_list) { |
| 108 | iter->chunk = NULL; |
| 109 | return; |
| 110 | } |
| 111 | |
| 112 | iter->chunk = list_entry(iter->chunk->list.next, |
| 113 | struct mthca_icm_chunk, list); |
| 114 | iter->page_idx = 0; |
| 115 | } |
| 116 | } |
| 117 | |
| 118 | static inline dma_addr_t mthca_icm_addr(struct mthca_icm_iter *iter) |
| 119 | { |
| 120 | return sg_dma_address(&iter->chunk->mem[iter->page_idx]); |
| 121 | } |
| 122 | |
| 123 | static inline unsigned long mthca_icm_size(struct mthca_icm_iter *iter) |
| 124 | { |
| 125 | return sg_dma_len(&iter->chunk->mem[iter->page_idx]); |
| 126 | } |
| 127 | |
| 128 | enum { |
| 129 | MTHCA_DB_REC_PER_PAGE = 4096 / 8 |
| 130 | }; |
| 131 | |
| 132 | struct mthca_db_page { |
| 133 | DECLARE_BITMAP(used, MTHCA_DB_REC_PER_PAGE); |
| 134 | u64 *db_rec; |
| 135 | dma_addr_t mapping; |
| 136 | }; |
| 137 | |
| 138 | struct mthca_db_table { |
| 139 | int npages; |
| 140 | int max_group1; |
| 141 | int min_group2; |
| 142 | struct mthca_db_page *page; |
| 143 | struct semaphore mutex; |
| 144 | }; |
| 145 | |
| 146 | enum { |
| 147 | MTHCA_DB_TYPE_INVALID = 0x0, |
| 148 | MTHCA_DB_TYPE_CQ_SET_CI = 0x1, |
| 149 | MTHCA_DB_TYPE_CQ_ARM = 0x2, |
| 150 | MTHCA_DB_TYPE_SQ = 0x3, |
| 151 | MTHCA_DB_TYPE_RQ = 0x4, |
| 152 | MTHCA_DB_TYPE_SRQ = 0x5, |
| 153 | MTHCA_DB_TYPE_GROUP_SEP = 0x7 |
| 154 | }; |
| 155 | |
| 156 | int mthca_init_db_tab(struct mthca_dev *dev); |
| 157 | void mthca_cleanup_db_tab(struct mthca_dev *dev); |
| 158 | int mthca_alloc_db(struct mthca_dev *dev, int type, u32 qn, u32 **db); |
| 159 | void mthca_free_db(struct mthca_dev *dev, int type, int db_index); |
| 160 | |
| 161 | #endif /* MTHCA_MEMFREE_H */ |