| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | /* sis_ds.c -- Private header for Direct Rendering Manager -*- linux-c -*- | 
 | 2 |  * Created: Mon Jan  4 10:05:05 1999 by sclin@sis.com.tw | 
 | 3 |  * | 
 | 4 |  * Copyright 2000 Silicon Integrated Systems Corp, Inc., HsinChu, Taiwan. | 
 | 5 |  * All rights reserved. | 
 | 6 |  * | 
 | 7 |  * Permission is hereby granted, free of charge, to any person obtaining a | 
 | 8 |  * copy of this software and associated documentation files (the "Software"), | 
 | 9 |  * to deal in the Software without restriction, including without limitation | 
 | 10 |  * the rights to use, copy, modify, merge, publish, distribute, sublicense, | 
 | 11 |  * and/or sell copies of the Software, and to permit persons to whom the | 
 | 12 |  * Software is furnished to do so, subject to the following conditions: | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 13 |  * | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 14 |  * The above copyright notice and this permission notice (including the next | 
 | 15 |  * paragraph) shall be included in all copies or substantial portions of the | 
 | 16 |  * Software. | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 17 |  * | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 18 |  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | 
 | 19 |  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | 
 | 20 |  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL | 
 | 21 |  * PRECISION INSIGHT AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR | 
 | 22 |  * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, | 
 | 23 |  * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER | 
 | 24 |  * DEALINGS IN THE SOFTWARE. | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 25 |  * | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 26 |  * Authors: | 
 | 27 |  *    Sung-Ching Lin <sclin@sis.com.tw> | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 28 |  * | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 29 |  */ | 
 | 30 |  | 
 | 31 | #include "drmP.h" | 
 | 32 | #include "drm.h" | 
 | 33 | #include "sis_ds.h" | 
 | 34 |  | 
 | 35 | /* Set Data Structure, not check repeated value | 
 | 36 |  * temporarily used | 
 | 37 |  */ | 
 | 38 |  | 
 | 39 | set_t *setInit(void) | 
 | 40 | { | 
 | 41 | 	int i; | 
 | 42 | 	set_t *set; | 
 | 43 |  | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 44 | 	set = (set_t *) drm_alloc(sizeof(set_t), DRM_MEM_DRIVER); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 45 | 	if (set != NULL) { | 
 | 46 | 		for (i = 0; i < SET_SIZE; i++) { | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 47 | 			set->list[i].free_next = i + 1; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 48 | 			set->list[i].alloc_next = -1; | 
 | 49 | 		} | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 50 | 		set->list[SET_SIZE - 1].free_next = -1; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 51 | 		set->free = 0; | 
 | 52 | 		set->alloc = -1; | 
 | 53 | 		set->trace = -1; | 
 | 54 | 	} | 
 | 55 | 	return set; | 
 | 56 | } | 
 | 57 |  | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 58 | int setAdd(set_t * set, ITEM_TYPE item) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 59 | { | 
 | 60 | 	int free = set->free; | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 61 |  | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 62 | 	if (free != -1) { | 
 | 63 | 		set->list[free].val = item; | 
 | 64 | 		set->free = set->list[free].free_next; | 
 | 65 | 	} else { | 
 | 66 | 		return 0; | 
 | 67 | 	} | 
 | 68 |  | 
 | 69 | 	set->list[free].alloc_next = set->alloc; | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 70 | 	set->alloc = free; | 
 | 71 | 	set->list[free].free_next = -1; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 72 |  | 
 | 73 | 	return 1; | 
 | 74 | } | 
 | 75 |  | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 76 | int setDel(set_t * set, ITEM_TYPE item) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 77 | { | 
 | 78 | 	int alloc = set->alloc; | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 79 | 	int prev = -1; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 80 |  | 
 | 81 | 	while (alloc != -1) { | 
 | 82 | 		if (set->list[alloc].val == item) { | 
 | 83 | 			if (prev != -1) | 
 | 84 | 				set->list[prev].alloc_next = | 
 | 85 | 				    set->list[alloc].alloc_next; | 
 | 86 | 			else | 
 | 87 | 				set->alloc = set->list[alloc].alloc_next; | 
 | 88 | 			break; | 
 | 89 | 		} | 
 | 90 | 		prev = alloc; | 
 | 91 | 		alloc = set->list[alloc].alloc_next; | 
 | 92 | 	} | 
 | 93 |  | 
 | 94 | 	if (alloc == -1) | 
 | 95 | 		return 0; | 
 | 96 |  | 
 | 97 | 	set->list[alloc].free_next = set->free; | 
 | 98 | 	set->free = alloc; | 
 | 99 | 	set->list[alloc].alloc_next = -1; | 
 | 100 |  | 
 | 101 | 	return 1; | 
 | 102 | } | 
 | 103 |  | 
 | 104 | /* setFirst -> setAdd -> setNext is wrong */ | 
 | 105 |  | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 106 | int setFirst(set_t * set, ITEM_TYPE * item) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 107 | { | 
 | 108 | 	if (set->alloc == -1) | 
 | 109 | 		return 0; | 
 | 110 |  | 
 | 111 | 	*item = set->list[set->alloc].val; | 
 | 112 | 	set->trace = set->list[set->alloc].alloc_next; | 
 | 113 |  | 
 | 114 | 	return 1; | 
 | 115 | } | 
 | 116 |  | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 117 | int setNext(set_t * set, ITEM_TYPE * item) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 118 | { | 
 | 119 | 	if (set->trace == -1) | 
 | 120 | 		return 0; | 
 | 121 |  | 
 | 122 | 	*item = set->list[set->trace].val; | 
 | 123 | 	set->trace = set->list[set->trace].alloc_next; | 
 | 124 |  | 
 | 125 | 	return 1; | 
 | 126 | } | 
 | 127 |  | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 128 | int setDestroy(set_t * set) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 129 | { | 
 | 130 | 	drm_free(set, sizeof(set_t), DRM_MEM_DRIVER); | 
 | 131 |  | 
 | 132 | 	return 1; | 
 | 133 | } | 
 | 134 |  | 
 | 135 | /* | 
 | 136 |  * GLX Hardware Device Driver common code | 
 | 137 |  * Copyright (C) 1999 Wittawat Yamwong | 
 | 138 |  * | 
 | 139 |  * Permission is hereby granted, free of charge, to any person obtaining a | 
 | 140 |  * copy of this software and associated documentation files (the "Software"), | 
 | 141 |  * to deal in the Software without restriction, including without limitation | 
 | 142 |  * the rights to use, copy, modify, merge, publish, distribute, sublicense, | 
 | 143 |  * and/or sell copies of the Software, and to permit persons to whom the | 
 | 144 |  * Software is furnished to do so, subject to the following conditions: | 
 | 145 |  * | 
 | 146 |  * The above copyright notice and this permission notice shall be included | 
 | 147 |  * in all copies or substantial portions of the Software. | 
 | 148 |  * | 
 | 149 |  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS | 
 | 150 |  * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | 
 | 151 |  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 152 |  * WITTAWAT YAMWONG, OR ANY OTHER CONTRIBUTORS BE LIABLE FOR ANY CLAIM, | 
 | 153 |  * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR | 
 | 154 |  * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 155 |  * OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. | 
 | 156 |  * | 
 | 157 |  */ | 
 | 158 |  | 
 | 159 | #define ISFREE(bptr) ((bptr)->free) | 
 | 160 |  | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 161 | memHeap_t *mmInit(int ofs, int size) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 162 | { | 
 | 163 | 	PMemBlock blocks; | 
 | 164 |  | 
 | 165 | 	if (size <= 0) | 
 | 166 | 		return NULL; | 
 | 167 |  | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 168 | 	blocks = (TMemBlock *) drm_calloc(1, sizeof(TMemBlock), DRM_MEM_DRIVER); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 169 | 	if (blocks != NULL) { | 
 | 170 | 		blocks->ofs = ofs; | 
 | 171 | 		blocks->size = size; | 
 | 172 | 		blocks->free = 1; | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 173 | 		return (memHeap_t *) blocks; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 174 | 	} else | 
 | 175 | 		return NULL; | 
 | 176 | } | 
 | 177 |  | 
 | 178 | /* Checks if a pointer 'b' is part of the heap 'heap' */ | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 179 | int mmBlockInHeap(memHeap_t * heap, PMemBlock b) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 180 | { | 
 | 181 | 	TMemBlock *p; | 
 | 182 |  | 
 | 183 | 	if (heap == NULL || b == NULL) | 
 | 184 | 		return 0; | 
 | 185 |  | 
 | 186 | 	p = heap; | 
 | 187 | 	while (p != NULL && p != b) { | 
 | 188 | 		p = p->next; | 
 | 189 | 	} | 
 | 190 | 	if (p == b) | 
 | 191 | 		return 1; | 
 | 192 | 	else | 
 | 193 | 		return 0; | 
 | 194 | } | 
 | 195 |  | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 196 | static TMemBlock *SliceBlock(TMemBlock * p, | 
 | 197 | 			     int startofs, int size, | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 198 | 			     int reserved, int alignment) | 
 | 199 | { | 
 | 200 | 	TMemBlock *newblock; | 
 | 201 |  | 
 | 202 | 	/* break left */ | 
 | 203 | 	if (startofs > p->ofs) { | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 204 | 		newblock = (TMemBlock *) drm_calloc(1, sizeof(TMemBlock), | 
 | 205 | 						    DRM_MEM_DRIVER); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 206 | 		newblock->ofs = startofs; | 
 | 207 | 		newblock->size = p->size - (startofs - p->ofs); | 
 | 208 | 		newblock->free = 1; | 
 | 209 | 		newblock->next = p->next; | 
 | 210 | 		p->size -= newblock->size; | 
 | 211 | 		p->next = newblock; | 
 | 212 | 		p = newblock; | 
 | 213 | 	} | 
 | 214 |  | 
 | 215 | 	/* break right */ | 
 | 216 | 	if (size < p->size) { | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 217 | 		newblock = (TMemBlock *) drm_calloc(1, sizeof(TMemBlock), | 
 | 218 | 						    DRM_MEM_DRIVER); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 219 | 		newblock->ofs = startofs + size; | 
 | 220 | 		newblock->size = p->size - size; | 
 | 221 | 		newblock->free = 1; | 
 | 222 | 		newblock->next = p->next; | 
 | 223 | 		p->size = size; | 
 | 224 | 		p->next = newblock; | 
 | 225 | 	} | 
 | 226 |  | 
 | 227 | 	/* p = middle block */ | 
 | 228 | 	p->align = alignment; | 
 | 229 | 	p->free = 0; | 
 | 230 | 	p->reserved = reserved; | 
 | 231 | 	return p; | 
 | 232 | } | 
 | 233 |  | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 234 | PMemBlock mmAllocMem(memHeap_t * heap, int size, int align2, int startSearch) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 235 | { | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 236 | 	int mask, startofs, endofs; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 237 | 	TMemBlock *p; | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 238 |  | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 239 | 	if (heap == NULL || align2 < 0 || size <= 0) | 
 | 240 | 		return NULL; | 
 | 241 |  | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 242 | 	mask = (1 << align2) - 1; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 243 | 	startofs = 0; | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 244 | 	p = (TMemBlock *) heap; | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 245 | 	while (p != NULL) { | 
 | 246 | 		if (ISFREE(p)) { | 
 | 247 | 			startofs = (p->ofs + mask) & ~mask; | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 248 | 			if (startofs < startSearch) { | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 249 | 				startofs = startSearch; | 
 | 250 | 			} | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 251 | 			endofs = startofs + size; | 
 | 252 | 			if (endofs <= (p->ofs + p->size)) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 253 | 				break; | 
 | 254 | 		} | 
 | 255 | 		p = p->next; | 
 | 256 | 	} | 
 | 257 | 	if (p == NULL) | 
 | 258 | 		return NULL; | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 259 | 	p = SliceBlock(p, startofs, size, 0, mask + 1); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 260 | 	p->heap = heap; | 
 | 261 | 	return p; | 
 | 262 | } | 
 | 263 |  | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 264 | static __inline__ int Join2Blocks(TMemBlock * p) | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 265 | { | 
 | 266 | 	if (p->free && p->next && p->next->free) { | 
 | 267 | 		TMemBlock *q = p->next; | 
 | 268 | 		p->size += q->size; | 
 | 269 | 		p->next = q->next; | 
 | 270 | 		drm_free(q, sizeof(TMemBlock), DRM_MEM_DRIVER); | 
 | 271 | 		return 1; | 
 | 272 | 	} | 
 | 273 | 	return 0; | 
 | 274 | } | 
 | 275 |  | 
 | 276 | int mmFreeMem(PMemBlock b) | 
 | 277 | { | 
 | 278 | 	TMemBlock *p, *prev; | 
 | 279 |  | 
 | 280 | 	if (b == NULL) | 
 | 281 | 		return 0; | 
 | 282 | 	if (b->heap == NULL) | 
 | 283 | 		return -1; | 
 | 284 |  | 
 | 285 | 	p = b->heap; | 
 | 286 | 	prev = NULL; | 
 | 287 | 	while (p != NULL && p != b) { | 
 | 288 | 		prev = p; | 
 | 289 | 		p = p->next; | 
 | 290 | 	} | 
 | 291 | 	if (p == NULL || p->free || p->reserved) | 
 | 292 | 		return -1; | 
 | 293 |  | 
 | 294 | 	p->free = 1; | 
 | 295 | 	Join2Blocks(p); | 
 | 296 | 	if (prev) | 
| Dave Airlie | b5e89ed | 2005-09-25 14:28:13 +1000 | [diff] [blame] | 297 | 		Join2Blocks(prev); | 
| Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 298 | 	return 0; | 
 | 299 | } |