No empty .Rs/.Re
[netbsd-mini2440.git] / sys / external / bsd / drm / dist / libdrm / nouveau / nouveau_resource.c
blob6bef75672026b7d1deaab6df6f127281863b7369
1 /*
2 * Copyright 2007 Nouveau Project
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:
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
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.
23 #include <stdlib.h>
24 #include <errno.h>
26 #include "nouveau_private.h"
28 int
29 nouveau_resource_init(struct nouveau_resource **heap,
30 unsigned start, unsigned size)
32 struct nouveau_resource *r;
34 r = calloc(1, sizeof(struct nouveau_resource));
35 if (!r)
36 return 1;
38 r->start = start;
39 r->size = size;
40 *heap = r;
41 return 0;
44 int
45 nouveau_resource_alloc(struct nouveau_resource *heap, unsigned size, void *priv,
46 struct nouveau_resource **res)
48 struct nouveau_resource *r;
50 if (!heap || !size || !res || *res)
51 return 1;
53 while (heap) {
54 if (!heap->in_use && heap->size >= size) {
55 r = calloc(1, sizeof(struct nouveau_resource));
56 if (!r)
57 return 1;
59 r->start = (heap->start + heap->size) - size;
60 r->size = size;
61 r->in_use = 1;
62 r->priv = priv;
64 heap->size -= size;
66 r->next = heap->next;
67 if (heap->next)
68 heap->next->prev = r;
69 r->prev = heap;
70 heap->next = r;
72 *res = r;
73 return 0;
76 heap = heap->next;
79 return 1;
82 void
83 nouveau_resource_free(struct nouveau_resource **res)
85 struct nouveau_resource *r;
87 if (!res || !*res)
88 return;
89 r = *res;
90 *res = NULL;
92 r->in_use = 0;
94 if (r->next && !r->next->in_use) {
95 struct nouveau_resource *new = r->next;
97 new->prev = r->prev;
98 if (r->prev)
99 r->prev->next = new;
100 new->size += r->size;
101 new->start = r->start;
103 free(r);
104 r = new;
107 if (r->prev && !r->prev->in_use) {
108 r->prev->next = r->next;
109 if (r->next)
110 r->next->prev = r->prev;
111 r->prev->size += r->size;
112 free(r);