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 Cisco Systems. All rights reserved. |
| 4 | * Copyright (c) 2005 Mellanox Technologies. All rights reserved. |
| 5 | * Copyright (c) 2005 Open Grid Computing, Inc. All rights reserved. |
| 6 | * |
| 7 | * This software is available to you under a choice of one of two |
| 8 | * licenses. You may choose to be licensed under the terms of the GNU |
| 9 | * General Public License (GPL) Version 2, available from the file |
| 10 | * COPYING in the main directory of this source tree, or the |
| 11 | * OpenIB.org BSD license below: |
| 12 | * |
| 13 | * Redistribution and use in source and binary forms, with or |
| 14 | * without modification, are permitted provided that the following |
| 15 | * conditions are met: |
| 16 | * |
| 17 | * - Redistributions of source code must retain the above |
| 18 | * copyright notice, this list of conditions and the following |
| 19 | * disclaimer. |
| 20 | * |
| 21 | * - Redistributions in binary form must reproduce the above |
| 22 | * copyright notice, this list of conditions and the following |
| 23 | * disclaimer in the documentation and/or other materials |
| 24 | * provided with the distribution. |
| 25 | * |
| 26 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, |
| 27 | * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
| 28 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |
| 29 | * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS |
| 30 | * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN |
| 31 | * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN |
| 32 | * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
| 33 | * SOFTWARE. |
| 34 | */ |
| 35 | |
| 36 | #include <linux/init.h> |
| 37 | #include <linux/errno.h> |
| 38 | |
| 39 | #include "c2.h" |
| 40 | #include "c2_provider.h" |
| 41 | |
| 42 | int c2_pd_alloc(struct c2_dev *c2dev, int privileged, struct c2_pd *pd) |
| 43 | { |
| 44 | u32 obj; |
| 45 | int ret = 0; |
| 46 | |
| 47 | spin_lock(&c2dev->pd_table.lock); |
| 48 | obj = find_next_zero_bit(c2dev->pd_table.table, c2dev->pd_table.max, |
| 49 | c2dev->pd_table.last); |
| 50 | if (obj >= c2dev->pd_table.max) |
| 51 | obj = find_first_zero_bit(c2dev->pd_table.table, |
| 52 | c2dev->pd_table.max); |
| 53 | if (obj < c2dev->pd_table.max) { |
| 54 | pd->pd_id = obj; |
| 55 | __set_bit(obj, c2dev->pd_table.table); |
| 56 | c2dev->pd_table.last = obj+1; |
| 57 | if (c2dev->pd_table.last >= c2dev->pd_table.max) |
| 58 | c2dev->pd_table.last = 0; |
| 59 | } else |
| 60 | ret = -ENOMEM; |
| 61 | spin_unlock(&c2dev->pd_table.lock); |
| 62 | return ret; |
| 63 | } |
| 64 | |
| 65 | void c2_pd_free(struct c2_dev *c2dev, struct c2_pd *pd) |
| 66 | { |
| 67 | spin_lock(&c2dev->pd_table.lock); |
| 68 | __clear_bit(pd->pd_id, c2dev->pd_table.table); |
| 69 | spin_unlock(&c2dev->pd_table.lock); |
| 70 | } |
| 71 | |
| 72 | int __devinit c2_init_pd_table(struct c2_dev *c2dev) |
| 73 | { |
| 74 | |
| 75 | c2dev->pd_table.last = 0; |
| 76 | c2dev->pd_table.max = c2dev->props.max_pd; |
| 77 | spin_lock_init(&c2dev->pd_table.lock); |
| 78 | c2dev->pd_table.table = kmalloc(BITS_TO_LONGS(c2dev->props.max_pd) * |
| 79 | sizeof(long), GFP_KERNEL); |
| 80 | if (!c2dev->pd_table.table) |
| 81 | return -ENOMEM; |
| 82 | bitmap_zero(c2dev->pd_table.table, c2dev->props.max_pd); |
| 83 | return 0; |
| 84 | } |
| 85 | |
| 86 | void __devexit c2_cleanup_pd_table(struct c2_dev *c2dev) |
| 87 | { |
| 88 | kfree(c2dev->pd_table.table); |
| 89 | } |