1 /*
2  * Copyright (c) 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 #include <asm/page.h>		/* PAGE_SHIFT */
36 
37 #include "mthca_dev.h"
38 #include "mthca_memfree.h"
39 
40 int mthca_uar_alloc(struct mthca_dev *dev, struct mthca_uar *uar)
41 {
42 	uar->index = mthca_alloc(&dev->uar_table.alloc);
43 	if (uar->index == -1)
44 		return -ENOMEM;
45 
46 	uar->pfn = (pci_resource_start(dev->pdev, 2) >> PAGE_SHIFT) + uar->index;
47 
48 	return 0;
49 }
50 
51 void mthca_uar_free(struct mthca_dev *dev, struct mthca_uar *uar)
52 {
53 	mthca_free(&dev->uar_table.alloc, uar->index);
54 }
55 
56 int mthca_init_uar_table(struct mthca_dev *dev)
57 {
58 	int ret;
59 
60 	ret = mthca_alloc_init(&dev->uar_table.alloc,
61 			       dev->limits.num_uars,
62 			       dev->limits.num_uars - 1,
63 			       dev->limits.reserved_uars + 1);
64 	if (ret)
65 		return ret;
66 
67 	ret = mthca_init_db_tab(dev);
68 	if (ret)
69 		mthca_alloc_cleanup(&dev->uar_table.alloc);
70 
71 	return ret;
72 }
73 
74 void mthca_cleanup_uar_table(struct mthca_dev *dev)
75 {
76 	mthca_cleanup_db_tab(dev);
77 
78 	/* XXX check if any UARs are still allocated? */
79 	mthca_alloc_cleanup(&dev->uar_table.alloc);
80 }
81