Merge remote branch 'upstream/gallium-0.1' into nouveau-gallium-0.1
[mesa.git] / src / gallium / winsys / dri / nouveau / nouveau_resource.c
1 /*
2 * Copyright 2007 Nouveau Project
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
13 *
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
17 * THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
18 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
19 * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
20 * SOFTWARE.
21 */
22
23 #include <stdlib.h>
24 #include <errno.h>
25
26 #include "nouveau_drmif.h"
27 #include "nouveau_local.h"
28
29 int
30 nouveau_resource_init(struct nouveau_resource **heap,
31 unsigned start, unsigned size)
32 {
33 struct nouveau_resource *r;
34
35 r = calloc(1, sizeof(struct nouveau_resource));
36 if (!r)
37 return 1;
38
39 r->start = start;
40 r->size = size;
41 *heap = r;
42 return 0;
43 }
44
45 int
46 nouveau_resource_alloc(struct nouveau_resource *heap, int size, void *priv,
47 struct nouveau_resource **res)
48 {
49 struct nouveau_resource *r;
50
51 if (!heap || !size || !res || *res)
52 return 1;
53
54 while (heap) {
55 if (!heap->in_use && heap->size >= size) {
56 r = calloc(1, sizeof(struct nouveau_resource));
57 if (!r)
58 return 1;
59
60 r->start = (heap->start + heap->size) - size;
61 r->size = size;
62 r->in_use = 1;
63 r->priv = priv;
64
65 heap->size -= size;
66
67 r->next = heap->next;
68 if (heap->next)
69 heap->next->prev = r;
70 r->prev = heap;
71 heap->next = r;
72
73 *res = r;
74 return 0;
75 }
76
77 heap = heap->next;
78 }
79
80 return 1;
81 }
82
83 void
84 nouveau_resource_free(struct nouveau_resource **res)
85 {
86 struct nouveau_resource *r;
87
88 if (!res || !*res)
89 return;
90 r = *res;
91 *res = NULL;
92
93 r->in_use = 0;
94
95 if (r->next && !r->next->in_use) {
96 struct nouveau_resource *new = r->next;
97
98 new->prev = r->prev;
99 if (r->prev)
100 r->prev->next = new;
101 new->size += r->size;
102 new->start = r->start;
103
104 free(r);
105 r = new;
106 }
107
108 if (r->prev && !r->prev->in_use) {
109 r->prev->next = r->next;
110 if (r->next)
111 r->next->prev = r->prev;
112 r->prev->size += r->size;
113 free(r);
114 }
115
116 }