sis_ds.c revision 145132
1178172Simp/* sis_ds.c -- Private header for Direct Rendering Manager -*- linux-c -*- 2178172Simp * Created: Mon Jan 4 10:05:05 1999 by sclin@sis.com.tw */ 3178172Simp/*- 4178172Simp * Copyright 2000 Silicon Integrated Systems Corp, Inc., HsinChu, Taiwan. 5178172Simp * All rights reserved. 6178172Simp * 7178172Simp * Permission is hereby granted, free of charge, to any person obtaining a 8178172Simp * copy of this software and associated documentation files (the "Software"), 9178172Simp * to deal in the Software without restriction, including without limitation 10178172Simp * the rights to use, copy, modify, merge, publish, distribute, sublicense, 11178172Simp * and/or sell copies of the Software, and to permit persons to whom the 12178172Simp * Software is furnished to do so, subject to the following conditions: 13178172Simp * 14178172Simp * The above copyright notice and this permission notice (including the next 15178172Simp * paragraph) shall be included in all copies or substantial portions of the 16178172Simp * Software. 17178172Simp * 18178172Simp * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 19178172Simp * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 20178172Simp * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL 21178172Simp * PRECISION INSIGHT AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR 22178172Simp * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, 23178172Simp * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER 24178172Simp * DEALINGS IN THE SOFTWARE. 25178172Simp * 26178172Simp * Authors: 27178172Simp * Sung-Ching Lin <sclin@sis.com.tw> 28178172Simp * 29178172Simp * $FreeBSD: head/sys/dev/drm/sis_ds.c 145132 2005-04-16 03:44:47Z anholt $ 30178172Simp */ 31178172Simp 32178172Simp#include "dev/drm/drmP.h" 33178172Simp#include "dev/drm/drm.h" 34178172Simp#include "dev/drm/sis_ds.h" 35206714Sjmallett 36178172Simp/* Set Data Structure, not check repeated value 37178172Simp * temporarily used 38178172Simp */ 39178172Simp 40178172Simpset_t *setInit(void) 41178172Simp{ 42253367Sae int i; 43178172Simp set_t *set; 44178172Simp 45178172Simp set = (set_t *) drm_alloc(sizeof(set_t), DRM_MEM_DRIVER); 46178172Simp if (set != NULL) { 47178172Simp for (i = 0; i < SET_SIZE; i++) { 48178172Simp set->list[i].free_next = i + 1; 49178172Simp set->list[i].alloc_next = -1; 50178172Simp } 51178172Simp set->list[SET_SIZE - 1].free_next = -1; 52206714Sjmallett set->free = 0; 53178172Simp set->alloc = -1; 54208581Sgonzo set->trace = -1; 55208581Sgonzo } 56178172Simp return set; 57206714Sjmallett} 58206714Sjmallett 59206714Sjmallettint setAdd(set_t * set, ITEM_TYPE item) 60178172Simp{ 61178172Simp int free = set->free; 62178172Simp 63178172Simp if (free != -1) { 64178172Simp set->list[free].val = item; 65178172Simp set->free = set->list[free].free_next; 66178172Simp } else { 67178172Simp return 0; 68178172Simp } 69206714Sjmallett 70206714Sjmallett set->list[free].alloc_next = set->alloc; 71178172Simp set->alloc = free; 72178172Simp set->list[free].free_next = -1; 73178172Simp 74178172Simp return 1; 75178172Simp} 76178172Simp 77178172Simpint setDel(set_t * set, ITEM_TYPE item) 78178172Simp{ 79178172Simp int alloc = set->alloc; 80178172Simp int prev = -1; 81178172Simp 82178172Simp while (alloc != -1) { 83178172Simp if (set->list[alloc].val == item) { 84178172Simp if (prev != -1) 85178172Simp set->list[prev].alloc_next = 86178172Simp set->list[alloc].alloc_next; 87178172Simp else 88178172Simp set->alloc = set->list[alloc].alloc_next; 89178172Simp break; 90178172Simp } 91178172Simp prev = alloc; 92206714Sjmallett alloc = set->list[alloc].alloc_next; 93206714Sjmallett } 94206714Sjmallett 95217944Sjchandra if (alloc == -1) 96206714Sjmallett return 0; 97217944Sjchandra 98208581Sgonzo set->list[alloc].free_next = set->free; 99208581Sgonzo set->free = alloc; 100208581Sgonzo set->list[alloc].alloc_next = -1; 101208581Sgonzo 102208581Sgonzo return 1; 103208581Sgonzo} 104206714Sjmallett 105206714Sjmallett/* setFirst -> setAdd -> setNext is wrong */ 106206714Sjmallett 107206714Sjmallettint setFirst(set_t * set, ITEM_TYPE * item) 108178172Simp{ 109178172Simp if (set->alloc == -1) 110218195Smdf return 0; 111178172Simp 112178172Simp *item = set->list[set->alloc].val; 113178172Simp set->trace = set->list[set->alloc].alloc_next; 114178172Simp 115178172Simp return 1; 116206714Sjmallett} 117206714Sjmallett 118178172Simpint setNext(set_t * set, ITEM_TYPE * item) 119178172Simp{ 120178172Simp if (set->trace == -1) 121178172Simp return 0; 122178172Simp 123178172Simp *item = set->list[set->trace].val; 124178172Simp set->trace = set->list[set->trace].alloc_next; 125178172Simp 126178172Simp return 1; 127178172Simp} 128178172Simp 129178172Simpint setDestroy(set_t * set) 130206714Sjmallett{ 131206714Sjmallett drm_free(set, sizeof(set_t), DRM_MEM_DRIVER); 132208581Sgonzo 133208581Sgonzo return 1; 134178172Simp} 135178172Simp 136178172Simp/* 137178172Simp * GLX Hardware Device Driver common code 138178172Simp * Copyright (C) 1999 Wittawat Yamwong 139178172Simp * 140178172Simp * Permission is hereby granted, free of charge, to any person obtaining a 141178172Simp * copy of this software and associated documentation files (the "Software"), 142178172Simp * to deal in the Software without restriction, including without limitation 143178172Simp * the rights to use, copy, modify, merge, publish, distribute, sublicense, 144178172Simp * and/or sell copies of the Software, and to permit persons to whom the 145178172Simp * Software is furnished to do so, subject to the following conditions: 146 * 147 * The above copyright notice and this permission notice shall be included 148 * in all copies or substantial portions of the Software. 149 * 150 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS 151 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 152 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL 153 * KEITH WHITWELL, OR ANY OTHER CONTRIBUTORS BE LIABLE FOR ANY CLAIM, 154 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR 155 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE 156 * OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 157 * 158 */ 159 160#define ISFREE(bptr) ((bptr)->free) 161 162memHeap_t *mmInit(int ofs, int size) 163{ 164 PMemBlock blocks; 165 166 if (size <= 0) 167 return NULL; 168 169 blocks = (TMemBlock *) drm_calloc(1, sizeof(TMemBlock), DRM_MEM_DRIVER); 170 if (blocks != NULL) { 171 blocks->ofs = ofs; 172 blocks->size = size; 173 blocks->free = 1; 174 return (memHeap_t *) blocks; 175 } else 176 return NULL; 177} 178 179/* Checks if a pointer 'b' is part of the heap 'heap' */ 180int mmBlockInHeap(memHeap_t * heap, PMemBlock b) 181{ 182 TMemBlock *p; 183 184 if (heap == NULL || b == NULL) 185 return 0; 186 187 p = heap; 188 while (p != NULL && p != b) { 189 p = p->next; 190 } 191 if (p == b) 192 return 1; 193 else 194 return 0; 195} 196 197static TMemBlock *SliceBlock(TMemBlock * p, 198 int startofs, int size, 199 int reserved, int alignment) 200{ 201 TMemBlock *newblock; 202 203 /* break left */ 204 if (startofs > p->ofs) { 205 newblock = (TMemBlock *) drm_calloc(1, sizeof(TMemBlock), 206 DRM_MEM_DRIVER); 207 newblock->ofs = startofs; 208 newblock->size = p->size - (startofs - p->ofs); 209 newblock->free = 1; 210 newblock->next = p->next; 211 p->size -= newblock->size; 212 p->next = newblock; 213 p = newblock; 214 } 215 216 /* break right */ 217 if (size < p->size) { 218 newblock = (TMemBlock *) drm_calloc(1, sizeof(TMemBlock), 219 DRM_MEM_DRIVER); 220 newblock->ofs = startofs + size; 221 newblock->size = p->size - size; 222 newblock->free = 1; 223 newblock->next = p->next; 224 p->size = size; 225 p->next = newblock; 226 } 227 228 /* p = middle block */ 229 p->align = alignment; 230 p->free = 0; 231 p->reserved = reserved; 232 return p; 233} 234 235PMemBlock mmAllocMem(memHeap_t * heap, int size, int align2, int startSearch) 236{ 237 int mask, startofs, endofs; 238 TMemBlock *p; 239 240 if (heap == NULL || align2 < 0 || size <= 0) 241 return NULL; 242 243 mask = (1 << align2) - 1; 244 startofs = 0; 245 p = (TMemBlock *) heap; 246 while (p != NULL) { 247 if (ISFREE(p)) { 248 startofs = (p->ofs + mask) & ~mask; 249 if (startofs < startSearch) { 250 startofs = startSearch; 251 } 252 endofs = startofs + size; 253 if (endofs <= (p->ofs + p->size)) 254 break; 255 } 256 p = p->next; 257 } 258 if (p == NULL) 259 return NULL; 260 p = SliceBlock(p, startofs, size, 0, mask + 1); 261 p->heap = heap; 262 return p; 263} 264 265static __inline__ int Join2Blocks(TMemBlock * p) 266{ 267 if (p->free && p->next && p->next->free) { 268 TMemBlock *q = p->next; 269 p->size += q->size; 270 p->next = q->next; 271 drm_free(q, sizeof(TMemBlock), DRM_MEM_DRIVER); 272 return 1; 273 } 274 return 0; 275} 276 277int mmFreeMem(PMemBlock b) 278{ 279 TMemBlock *p, *prev; 280 281 if (b == NULL) 282 return 0; 283 if (b->heap == NULL) 284 return -1; 285 286 p = b->heap; 287 prev = NULL; 288 while (p != NULL && p != b) { 289 prev = p; 290 p = p->next; 291 } 292 if (p == NULL || p->free || p->reserved) 293 return -1; 294 295 p->free = 1; 296 Join2Blocks(p); 297 if (prev) 298 Join2Blocks(prev); 299 return 0; 300} 301