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/slab.h>
38 #include <linux/errno.h>
39
40 #include "c2.h"
41 #include "c2_provider.h"
42
c2_pd_alloc(struct c2_dev * c2dev,int privileged,struct c2_pd * pd)43 int c2_pd_alloc(struct c2_dev *c2dev, int privileged, struct c2_pd *pd)
44 {
45 u32 obj;
46 int ret = 0;
47
48 spin_lock(&c2dev->pd_table.lock);
49 obj = find_next_zero_bit(c2dev->pd_table.table, c2dev->pd_table.max,
50 c2dev->pd_table.last);
51 if (obj >= c2dev->pd_table.max)
52 obj = find_first_zero_bit(c2dev->pd_table.table,
53 c2dev->pd_table.max);
54 if (obj < c2dev->pd_table.max) {
55 pd->pd_id = obj;
56 __set_bit(obj, c2dev->pd_table.table);
57 c2dev->pd_table.last = obj+1;
58 if (c2dev->pd_table.last >= c2dev->pd_table.max)
59 c2dev->pd_table.last = 0;
60 } else
61 ret = -ENOMEM;
62 spin_unlock(&c2dev->pd_table.lock);
63 return ret;
64 }
65
c2_pd_free(struct c2_dev * c2dev,struct c2_pd * pd)66 void c2_pd_free(struct c2_dev *c2dev, struct c2_pd *pd)
67 {
68 spin_lock(&c2dev->pd_table.lock);
69 __clear_bit(pd->pd_id, c2dev->pd_table.table);
70 spin_unlock(&c2dev->pd_table.lock);
71 }
72
c2_init_pd_table(struct c2_dev * c2dev)73 int __devinit c2_init_pd_table(struct c2_dev *c2dev)
74 {
75
76 c2dev->pd_table.last = 0;
77 c2dev->pd_table.max = c2dev->props.max_pd;
78 spin_lock_init(&c2dev->pd_table.lock);
79 c2dev->pd_table.table = kmalloc(BITS_TO_LONGS(c2dev->props.max_pd) *
80 sizeof(long), GFP_KERNEL);
81 if (!c2dev->pd_table.table)
82 return -ENOMEM;
83 bitmap_zero(c2dev->pd_table.table, c2dev->props.max_pd);
84 return 0;
85 }
86
c2_cleanup_pd_table(struct c2_dev * c2dev)87 void __devexit c2_cleanup_pd_table(struct c2_dev *c2dev)
88 {
89 kfree(c2dev->pd_table.table);
90 }
91