/* xf86drmSL.c -- Skip list support * Created: Mon May 10 09:28:13 1999 by faith@precisioninsight.com * * Copyright 1999 Precision Insight, Inc., Cedar Park, Texas. * All Rights Reserved. * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the "Software"), * to deal in the Software without restriction, including without limitation * the rights to use, copy, modify, merge, publish, distribute, sublicense, * and/or sell copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice (including the next * paragraph) shall be included in all copies or substantial portions of the * Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL * PRECISION INSIGHT AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER * DEALINGS IN THE SOFTWARE. * * Authors: Rickard E. (Rik) Faith * * $XFree86: xc/programs/Xserver/hw/xfree86/os-support/linux/drm/xf86drmSL.c,v 1.3 2000/06/17 00:03:34 martin Exp $ * * DESCRIPTION * * This file contains a straightforward skip list implementation.n * * FUTURE ENHANCEMENTS * * REFERENCES * * [Pugh90] William Pugh. Skip Lists: A Probabilistic Alternative to * Balanced Trees. CACM 33(6), June 1990, pp. 668-676. * */ #define SL_MAIN 0 #if SL_MAIN # include # include # include #else # include "xf86drm.h" # ifdef XFree86LOADER # include "xf86.h" # include "xf86_ansic.h" # else # include # include # endif #endif #define N(x) drm##x #define SL_LIST_MAGIC 0xfacade00LU #define SL_ENTRY_MAGIC 0x00fab1edLU #define SL_FREED_MAGIC 0xdecea5edLU #define SL_MAX_LEVEL 16 #define SL_DEBUG 0 #define SL_RANDOM_SEED 0xc01055a1LU #if SL_MAIN #define SL_ALLOC malloc #define SL_FREE free #define SL_RANDOM_DECL static int state = 0; #define SL_RANDOM_INIT(seed) if (!state) { srandom(seed); ++state; } #define SL_RANDOM random() #else #define SL_ALLOC drmMalloc #define SL_FREE drmFree #define SL_RANDOM_DECL static void *state = NULL #define SL_RANDOM_INIT(seed) if (!state) state = drmRandomCreate(seed) #define SL_RANDOM drmRandom(state) #endif typedef struct SLEntry { unsigned long magic; /* SL_ENTRY_MAGIC */ unsigned long key; void *value; int levels; struct SLEntry *forward[1]; /* variable sized array */ } SLEntry, *SLEntryPtr; typedef struct SkipList { unsigned long magic; /* SL_LIST_MAGIC */ int level; int count; SLEntryPtr head; SLEntryPtr p0; /* Position for iteration */ } SkipList, *SkipListPtr; #if SL_MAIN extern void *N(SLCreate)(void); extern int N(SLDestroy)(void *l); extern int N(SLLookup)(void *l, unsigned long key, void **value); extern int N(SLInsert)(void *l, unsigned long key, void *value); extern int N(SLDelete)(void *l, unsigned long key); extern int N(SLNext)(void *l, unsigned long *key, void **value); extern int N(SLFirst)(void *l, unsigned long *key, void **value); extern void N(SLDump)(void *l); extern int N(SLLookupNeighbors)(void *l, unsigned long key, unsigned long *prev_key, void **prev_value, unsigned long *next_key, void **next_value); #endif static SLEntryPtr SLCreateEntry(int max_level, unsigned long key, void *value) { SLEntryPtr entry; if (max_level < 0 || max_level > SL_MAX_LEVEL) max_level = SL_MAX_LEVEL; entry = SL_ALLOC(sizeof(*entry) + (max_level + 1) * sizeof(entry->forward[0])); if (!entry) return NULL; entry->magic = SL_ENTRY_MAGIC; entry->key = key; entry->value = value; entry->levels = max_level + 1; return entry; } static int SLRandomLevel(void) { int level = 1; SL_RANDOM_DECL; SL_RANDOM_INIT(SL_RANDOM_SEED); while ((SL_RANDOM & 0x01) && level < SL_MAX_LEVEL) ++level; return level; } void *N(SLCreate)(void) { SkipListPtr list; int i; list = SL_ALLOC(sizeof(*list)); if (!list) return NULL; list->magic = SL_LIST_MAGIC; list->level = 0; list->head = SLCreateEntry(SL_MAX_LEVEL, 0, NULL); list->count = 0; for (i = 0; i <= SL_MAX_LEVEL; i++) list->head->forward[i] = NULL; return list; } int N(SLDestroy)(void *l) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr entry; SLEntryPtr next; if (list->magic != SL_LIST_MAGIC) return -1; /* Bad magic */ for (entry = list->head; entry; entry = next) { if (entry->magic != SL_ENTRY_MAGIC) return -1; /* Bad magic */ next = entry->forward[0]; entry->magic = SL_FREED_MAGIC; SL_FREE(entry); } list->magic = SL_FREED_MAGIC; SL_FREE(list); return 0; } static SLEntryPtr SLLocate(void *l, unsigned long key, SLEntryPtr *update) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr entry; int i; if (list->magic != SL_LIST_MAGIC) return NULL; for (i = list->level, entry = list->head; i >= 0; i--) { while (entry->forward[i] && entry->forward[i]->key < key) entry = entry->forward[i]; update[i] = entry; } return entry->forward[0]; } int N(SLInsert)(void *l, unsigned long key, void *value) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr entry; SLEntryPtr update[SL_MAX_LEVEL + 1]; int level; int i; if (list->magic != SL_LIST_MAGIC) return -1; /* Bad magic */ entry = SLLocate(list, key, update); if (entry && entry->key == key) return 1; /* Already in list */ level = SLRandomLevel(); if (level > list->level) { level = ++list->level; update[level] = list->head; } entry = SLCreateEntry(level, key, value); /* Fix up forward pointers */ for (i = 0; i <= level; i++) { entry->forward[i] = update[i]->forward[i]; update[i]->forward[i] = entry; } ++list->count; return 0; /* Added to table */ } int N(SLDelete)(void *l, unsigned long key) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr update[SL_MAX_LEVEL + 1]; SLEntryPtr entry; int i; if (list->magic != SL_LIST_MAGIC) return -1; /* Bad magic */ entry = SLLocate(list, key, update); if (!entry || entry->key != key) return 1; /* Not found */ /* Fix up forward pointers */ for (i = 0; i <= list->level; i++) { if (update[i]->forward[i] == entry) update[i]->forward[i] = entry->forward[i]; } entry->magic = SL_FREED_MAGIC; SL_FREE(entry); while (list->level && !list->head->forward[list->level]) --list->level; --list->count; return 0; } int N(SLLookup)(void *l, unsigned long key, void **value) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr update[SL_MAX_LEVEL + 1]; SLEntryPtr entry; entry = SLLocate(list, key, update); if (entry && entry->key == key) { *value = entry; return 0; } *value = NULL; return -1; } int N(SLLookupNeighbors)(void *l, unsigned long key, unsigned long *prev_key, void **prev_value, unsigned long *next_key, void **next_value) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr update[SL_MAX_LEVEL + 1]; SLEntryPtr entry; int retcode = 0; entry = SLLocate(list, key, update); *prev_key = *next_key = key; *prev_value = *next_value = NULL; if (update[0]) { *prev_key = update[0]->key; *prev_value = update[0]->value; ++retcode; if (update[0]->forward[0]) { *next_key = update[0]->forward[0]->key; *next_value = update[0]->forward[0]->value; ++retcode; } } return retcode; } int N(SLNext)(void *l, unsigned long *key, void **value) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr entry; if (list->magic != SL_LIST_MAGIC) return -1; /* Bad magic */ entry = list->p0; if (entry) { list->p0 = entry->forward[0]; *key = entry->key; *value = entry->value; return 1; } list->p0 = NULL; return 0; } int N(SLFirst)(void *l, unsigned long *key, void **value) { SkipListPtr list = (SkipListPtr)l; if (list->magic != SL_LIST_MAGIC) return -1; /* Bad magic */ list->p0 = list->head->forward[0]; return N(SLNext)(list, key, value); } /* Dump internal data structures for debugging. */ void N(SLDump)(void *l) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr entry; int i; if (list->magic != SL_LIST_MAGIC) { printf("Bad magic: 0x%08lx (expected 0x%08lx)\n", list->magic, SL_LIST_MAGIC); return; } printf("Level = %d, count = %d\n", list->level, list->count); for (entry = list->head; entry; entry = entry->forward[0]) { if (entry->magic != SL_ENTRY_MAGIC) { printf("Bad magic: 0x%08lx (expected 0x%08lx)\n", list->magic, SL_ENTRY_MAGIC); } printf("\nEntry %p <0x%08lx, %p> has %2d levels\n", entry, entry->key, entry->value, entry->levels); for (i = 0; i < entry->levels; i++) { if (entry->forward[i]) { printf(" %2d: %p <0x%08lx, %p>\n", i, entry->forward[i], entry->forward[i]->key, entry->forward[i]->value); } else { printf(" %2d: %p\n", i, entry->forward[i]); } } } } #if SL_MAIN static void print(SkipListPtr list) { unsigned long key; void *value; if (N(SLFirst)(list, &key, &value)) { do { printf("key = %5lu, value = %p\n", key, value); } while (N(SLNext)(list, &key, &value)); } } static double do_time(int size, int iter) { SkipListPtr list; int i, j; unsigned long keys[1000000]; unsigned long previous; unsigned long key; void *value; struct timeval start, stop; double usec; SL_RANDOM_DECL; SL_RANDOM_INIT(12345); list = N(SLCreate)(); for (i = 0; i < size; i++) { keys[i] = SL_RANDOM; N(SLInsert)(list, keys[i], NULL); } previous = 0; if (N(SLFirst)(list, &key, &value)) { do { if (key <= previous) { printf( "%lu !< %lu\n", previous, key); } previous = key; } while (N(SLNext)(list, &key, &value)); } gettimeofday(&start, NULL); for (j = 0; j < iter; j++) { for (i = 0; i < size; i++) { if (N(SLLookup)(list, keys[i], &value)) printf("Error %lu %d\n", keys[i], i); } } gettimeofday(&stop, NULL); usec = (double)(stop.tv_sec * 1000000 + stop.tv_usec - start.tv_sec * 1000000 - start.tv_usec) / (size * iter); printf("%0.2f microseconds for list length %d\n", usec, size); N(SLDestroy)(list); return usec; } static void print_neighbors(void *list, unsigned long key) { unsigned long prev_key = 0; unsigned long next_key = 0; void *prev_value; void *next_value; int retval; retval = drmSLLookupNeighbors(list, key, &prev_key, &prev_value, &next_key, &next_value); printf("Neighbors of %5lu: %d %5lu %5lu\n", key, retval, prev_key, next_key); } int main(void) { SkipListPtr list; double usec, usec2, usec3, usec4; list = N(SLCreate)(); printf( "list at %p\n", list); print(list); printf("\n==============================\n\n"); N(SLInsert)(list, 123, NULL); N(SLInsert)(list, 213, NULL); N(SLInsert)(list, 50, NULL); print(list); printf("\n==============================\n\n"); print_neighbors(list, 0); print_neighbors(list, 50); print_neighbors(list, 51); print_neighbors(list, 123); print_neighbors(list, 200); print_neighbors(list, 213); print_neighbors(list, 256); printf("\n==============================\n\n"); N(SLDelete)(list, 50); print(list); printf("\n==============================\n\n"); N(SLDump)(list); N(SLDestroy)(list); printf("\n==============================\n\n"); usec = do_time(100, 10000); usec2 = do_time(1000, 500); printf("Table size increased by %0.2f, search time increased by %0.2f\n", 1000.0/100.0, usec2 / usec); usec3 = do_time(10000, 50); printf("Table size increased by %0.2f, search time increased by %0.2f\n", 10000.0/100.0, usec3 / usec); usec4 = do_time(100000, 4); printf("Table size increased by %0.2f, search time increased by %0.2f\n", 100000.0/100.0, usec4 / usec); return 0; } #endif '>302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 
/* bufs.c -- IOCTLs to manage buffers -*- c -*-
 * Created: Tue Feb  2 08:37:54 1999 by faith@precisioninsight.com
 * Revised: Fri Aug 20 22:48:10 1999 by faith@precisioninsight.com
 *
 * Copyright 1999 Precision Insight, Inc., Cedar Park, Texas.
 * All Rights Reserved.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 * 
 * The above copyright notice and this permission notice (including the next
 * paragraph) shall be included in all copies or substantial portions of the
 * Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
 * PRECISION INSIGHT AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
 * DEALINGS IN THE SOFTWARE.
 * 
 * $PI: xc/programs/Xserver/hw/xfree86/os-support/linux/drm/kernel/bufs.c,v 1.8 1999/08/30 13:05:00 faith Exp $
 * $XFree86: xc/programs/Xserver/hw/xfree86/os-support/linux/drm/kernel/bufs.c,v 1.1 1999/09/25 14:37:57 dawes Exp $
 *
 */

#define __NO_VERSION__
#include "drmP.h"
#include <sys/mman.h>
#include <vm/vm.h>
#include <vm/pmap.h>
#include <vm/vm_extern.h>
#include <vm/vm_map.h>

				/* Compute order.  Can be made faster. */
int drm_order(unsigned long size)
{
	int	      order;
	unsigned long tmp;

	for (order = 0, tmp = size; tmp >>= 1; ++order);
	if (size & ~(1 << order)) ++order;
	return order;
}

int drm_addmap(dev_t kdev, u_long cmd, caddr_t data,
	       int flags, struct proc *p)
{
	drm_device_t	*dev	= kdev->si_drv1;
	drm_map_t	*map;
	
	if (!(dev->flags & (FREAD|FWRITE)))
		return EACCES; /* Require read/write */

	map	     = drm_alloc(sizeof(*map), DRM_MEM_MAPS);
	if (!map) return ENOMEM;
	*map = *(drm_map_t *) data;

	DRM_DEBUG("offset = 0x%08lx, size = 0x%08lx, type = %d\n",
		  map->offset, map->size, map->type);
	if ((map->offset & (PAGE_SIZE-1)) || (map->size & (PAGE_SIZE-1))) {
		drm_free(map, sizeof(*map), DRM_MEM_MAPS);
		DRM_DEBUG("offset or size not page aligned\n");
		return EINVAL;
	}
	map->mtrr   = -1;
	map->handle = 0;

	switch (map->type) {
	case _DRM_REGISTERS:
	case _DRM_FRAME_BUFFER:	
		if (map->offset + map->size < map->offset
		    /* || map->offset < virt_to_phys(high_memory) */) {
			drm_free(map, sizeof(*map), DRM_MEM_MAPS);
			DRM_DEBUG("bad frame buffer size\n");
			return EINVAL;
		}
#ifdef CONFIG_MTRR
		if (map->type == _DRM_FRAME_BUFFER
		    || (map->flags & _DRM_WRITE_COMBINING)) {
			map->mtrr = mtrr_add(map->offset, map->size,
					     MTRR_TYPE_WRCOMB, 1);
		}
#endif
		map->handle = drm_ioremap(map->offset, map->size);
		break;
			

	case _DRM_SHM:
		DRM_DEBUG("%ld %d\n", map->size, drm_order(map->size));
		map->handle = (void *)drm_alloc_pages(drm_order(map->size)
						      - PAGE_SHIFT,
						      DRM_MEM_SAREA);
		if (!map->handle) {
			drm_free(map, sizeof(*map), DRM_MEM_MAPS);
			return ENOMEM;
		}
		map->offset = (unsigned long)map->handle;
		if (map->flags & _DRM_CONTAINS_LOCK) {
			dev->lock.hw_lock = map->handle; /* Pointer to lock */
		}
		break;
#ifdef DRM_AGP
	case _DRM_AGP:
		map->offset = map->offset + dev->agp->base;
		break;
#endif
	default:
		drm_free(map, sizeof(*map), DRM_MEM_MAPS);
		DRM_DEBUG("bad type\n");
		return EINVAL;
	}

	lockmgr(&dev->dev_lock, LK_EXCLUSIVE, 0, curproc);
	if (dev->maplist) {
		++dev->map_count;
		dev->maplist = drm_realloc(dev->maplist,
					   (dev->map_count-1)
					   * sizeof(*dev->maplist),
					   dev->map_count
					   * sizeof(*dev->maplist),
					   DRM_MEM_MAPS);
	} else {
		dev->map_count = 1;
		dev->maplist = drm_alloc(dev->map_count*sizeof(*dev->maplist),
					 DRM_MEM_MAPS);
	}
	dev->maplist[dev->map_count-1] = map;
	lockmgr(&dev->dev_lock, LK_RELEASE, 0, curproc);

	*(drm_map_t *) data = *map;
	if (map->type != _DRM_SHM)
		((drm_map_t *)data)->handle = (void *) map->offset;

	return 0;
}

int drm_addbufs(dev_t kdev, u_long cmd, caddr_t data,
		int flags, struct proc *p)
{
	drm_device_t	 *dev	 = kdev->si_drv1;
	drm_device_dma_t *dma	 = dev->dma;
	drm_buf_desc_t	 request;
	int		 count;
	int		 order;
	int		 size;
	int		 total;
	int		 page_order;
	drm_buf_entry_t	 *entry;
	unsigned long	 page;
	drm_buf_t	 *buf;
	int		 alignment;
	unsigned long	 offset;
	int		 i;
	int		 byte_count;
	int		 page_count;

	if (!dma) return EINVAL;

	request = *(drm_buf_desc_t *) data;

	count	   = request.count;
	order	   = drm_order(request.size);
	size	   = 1 << order;
	
	DRM_DEBUG("count = %d, size = %d (%d), order = %d, queue_count = %d\n",
		  request.count, request.size, size, order, dev->queue_count);

	if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER) return EINVAL;
	if (dev->queue_count) return EBUSY; /* Not while in use */

	alignment  = (request.flags & _DRM_PAGE_ALIGN) ? round_page(size) :size;
	page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0;
	total	   = PAGE_SIZE << page_order;

	simple_lock(&dev->count_lock);
	if (dev->buf_use) {
		simple_unlock(&dev->count_lock);
		return EBUSY;
	}
	atomic_inc(&dev->buf_alloc);
	simple_unlock(&dev->count_lock);
	
	lockmgr(&dev->dev_lock, LK_EXCLUSIVE, 0, curproc);
	entry = &dma->bufs[order];
	if (entry->buf_count) {
		lockmgr(&dev->dev_lock, LK_RELEASE, 0, curproc);
		atomic_dec(&dev->buf_alloc);
		return ENOMEM;	/* May only call once for each order */
	}
	
	entry->buflist = drm_alloc(count * sizeof(*entry->buflist),
				   DRM_MEM_BUFS);
	if (!entry->buflist) {
		lockmgr(&dev->dev_lock, LK_RELEASE, 0, curproc);
		atomic_dec(&dev->buf_alloc);
		return ENOMEM;
	}
	memset(entry->buflist, 0, count * sizeof(*entry->buflist));

	entry->seglist = drm_alloc(count * sizeof(*entry->seglist),
				   DRM_MEM_SEGS);
	if (!entry->seglist) {
		drm_free(entry->buflist,
			 count * sizeof(*entry->buflist),
			 DRM_MEM_BUFS);
		lockmgr(&dev->dev_lock, LK_RELEASE, 0, curproc);
		atomic_dec(&dev->buf_alloc);
		return ENOMEM;
	}
	memset(entry->seglist, 0, count * sizeof(*entry->seglist));

	dma->pagelist = drm_realloc(dma->pagelist,
				    dma->page_count * sizeof(*dma->pagelist),
				    (dma->page_count + (count << page_order))
				    * sizeof(*dma->pagelist),
				    DRM_MEM_PAGES);
	DRM_DEBUG("pagelist: %d entries\n",
		  dma->page_count + (count << page_order));


	entry->buf_size	  = size;
	entry->page_order = page_order;
	byte_count	  = 0;
	page_count	  = 0;
	while (entry->buf_count < count) {
		if (!(page = drm_alloc_pages(page_order, DRM_MEM_DMA))) break;
		entry->seglist[entry->seg_count++] = page;
		for (i = 0; i < (1 << page_order); i++) {
			DRM_DEBUG("page %d @ 0x%08lx\n",
				  dma->page_count + page_count,
				  page + PAGE_SIZE * i);
			dma->pagelist[dma->page_count + page_count++]
				= page + PAGE_SIZE * i;
		}
		for (offset = 0;
		     offset + size <= total && entry->buf_count < count;
		     offset += alignment, ++entry->buf_count) {
			buf	     = &entry->buflist[entry->buf_count];
			buf->idx     = dma->buf_count + entry->buf_count;
			buf->total   = alignment;
			buf->order   = order;
			buf->used    = 0;
			buf->offset  = (dma->byte_count + byte_count + offset);
			buf->address = (void *)(page + offset);
			buf->next    = NULL;
			buf->waiting = 0;
			buf->pending = 0;
			buf->dma_wait = 0;
			buf->pid     = 0;
#if DRM_DMA_HISTOGRAM
			timespecclear(&buf->time_queued);
			timespecclear(&buf->time_dispatched);
			timespecclear(&buf->time_completed);
			timespecclear(&buf->time_freed);
#endif
			DRM_DEBUG("buffer %d @ %p\n",
				  entry->buf_count, buf->address);
		}
		byte_count += PAGE_SIZE << page_order;
	}

	dma->buflist = drm_realloc(dma->buflist,
				   dma->buf_count * sizeof(*dma->buflist),
				   (dma->buf_count + entry->buf_count)
				   * sizeof(*dma->buflist),
				   DRM_MEM_BUFS);
	for (i = dma->buf_count; i < dma->buf_count + entry->buf_count; i++)
		dma->buflist[i] = &entry->buflist[i - dma->buf_count];

	dma->buf_count	+= entry->buf_count;
	dma->seg_count	+= entry->seg_count;
	dma->page_count += entry->seg_count << page_order;
	dma->byte_count += PAGE_SIZE * (entry->seg_count << page_order);
	
	drm_freelist_create(&entry->freelist, entry->buf_count);
	for (i = 0; i < entry->buf_count; i++) {
		drm_freelist_put(dev, &entry->freelist, &entry->buflist[i]);
	}
	
	lockmgr(&dev->dev_lock, LK_RELEASE, 0, curproc);

	request.count = entry->buf_count;
	request.size  = size;

	*(drm_buf_desc_t *) data = request;
	
	atomic_dec(&dev->buf_alloc);
	return 0;
}

int drm_infobufs(dev_t kdev, u_long cmd, caddr_t data,
		 int flags, struct proc *p)
{
	drm_device_t	 *dev	 = kdev->si_drv1;
	drm_device_dma_t *dma	 = dev->dma;
	drm_buf_info_t	 request;
	int		 i;
	int		 count;

	if (!dma) return EINVAL;

	simple_lock(&dev->count_lock);
	if (atomic_read(&dev->buf_alloc)) {
		simple_unlock(&dev->count_lock);
		return EBUSY;
	}
	++dev->buf_use;		/* Can't allocate more after this call */
	simple_unlock(&dev->count_lock);

	request = *(drm_buf_info_t *) data;

	for (i = 0, count = 0; i < DRM_MAX_ORDER+1; i++) {
		if (dma->bufs[i].buf_count) ++count;
	}
	
	DRM_DEBUG("count = %d\n", count);
	
	if (request.count >= count) {
		for (i = 0, count = 0; i < DRM_MAX_ORDER+1; i++) {
			if (dma->bufs[i].buf_count) {
				int error;
				error = copyout(&dma->bufs[i].buf_count,
						&request.list[count].count,
						sizeof(dma->bufs[0]
						       .buf_count));
				if (error) return error;
				error = copyout(&dma->bufs[i].buf_size,
						&request.list[count].size,
						sizeof(dma->bufs[0].buf_size));
				if (error) return error;
				error = copyout(&dma->bufs[i]
						.freelist.low_mark,
						&request.list[count].low_mark,
						sizeof(dma->bufs[0]
						       .freelist.low_mark));
				if (error) return error;
				error = copyout(&dma->bufs[i]
						.freelist.high_mark,
						&request.list[count].high_mark,
						sizeof(dma->bufs[0]
						       .freelist.high_mark));
				if (error) return error;
				DRM_DEBUG("%d %d %d %d %d\n",
					  i,
					  dma->bufs[i].buf_count,
					  dma->bufs[i].buf_size,
					  dma->bufs[i].freelist.low_mark,
					  dma->bufs[i].freelist.high_mark);
				++count;
			}
		}
	}
	request.count = count;

	*(drm_buf_info_t *) data = request;
	
	return 0;
}

int drm_markbufs(dev_t kdev, u_long cmd, caddr_t data,
		 int flags, struct proc *p)
{
	drm_device_t	 *dev	 = kdev->si_drv1;
	drm_device_dma_t *dma	 = dev->dma;
	drm_buf_desc_t	 request;
	int		 order;
	drm_buf_entry_t	 *entry;

	if (!dma) return EINVAL;

	request = *(drm_buf_desc_t *) data;

	DRM_DEBUG("%d, %d, %d\n",
		  request.size, request.low_mark, request.high_mark);
	order = drm_order(request.size);
	if (order < DRM_MIN_ORDER || order > DRM_MAX_ORDER) return EINVAL;
	entry = &dma->bufs[order];

	if (request.low_mark < 0 || request.low_mark > entry->buf_count)
		return EINVAL;
	if (request.high_mark < 0 || request.high_mark > entry->buf_count)
		return EINVAL;

	entry->freelist.low_mark  = request.low_mark;
	entry->freelist.high_mark = request.high_mark;
	
	return 0;
}

int drm_freebufs(dev_t kdev, u_long cmd, caddr_t data,
		 int flags, struct proc *p)
{
	drm_device_t	 *dev	 = kdev->si_drv1;
	drm_device_dma_t *dma	 = dev->dma;
	drm_buf_free_t	 request;
	int		 i;
	int		 idx;
	int		 error;
	drm_buf_t	 *buf;

	if (!dma) return EINVAL;

	request = *(drm_buf_free_t *) data;

	DRM_DEBUG("%d\n", request.count);
	for (i = 0; i < request.count; i++) {
		error = copyin(&request.list[i], &idx, sizeof(idx));
		if (error)
			return error;
		if (idx < 0 || idx >= dma->buf_count) {
			DRM_ERROR("Index %d (of %d max)\n",
				  idx, dma->buf_count - 1);
			return EINVAL;
		}
		buf = dma->buflist[idx];
		if (buf->pid != p->p_pid) {
			DRM_ERROR("Process %d freeing buffer owned by %d\n",
				  p->p_pid, buf->pid);
			return EINVAL;
		}
		drm_free_buffer(dev, buf);
	}
	
	return 0;
}

int drm_mapbufs(dev_t kdev, u_long cmd, caddr_t data,
		int flags, struct proc *p)
{
	drm_device_t	 *dev	 = kdev->si_drv1;
	drm_device_dma_t *dma	 = dev->dma;
	int		 retcode = 0;
	const int	 zero	 = 0;
	vm_offset_t	 virtual;
	vm_offset_t	 address;
	drm_buf_map_t	 request;
	int		 i;

	if (!dma) return EINVAL;
	
	DRM_DEBUG("\n");

	simple_lock(&dev->count_lock);
	if (atomic_read(&dev->buf_alloc)) {
		simple_unlock(&dev->count_lock);
		return EBUSY;
	}
	++dev->buf_use;		/* Can't allocate more after this call */
	simple_unlock(&dev->count_lock);

	request = *(drm_buf_map_t *) data;

	if (request.count >= dma->buf_count) {
		virtual = 0;
		retcode = vm_mmap(&p->p_vmspace->vm_map,
				  &virtual,
				  round_page(dma->byte_count),
				  PROT_READ|PROT_WRITE, VM_PROT_ALL,
				  MAP_SHARED,
				  SLIST_FIRST(&kdev->si_hlist),
				  0);
		if (retcode)
			goto done;

		request.virtual = (void *)virtual;

		for (i = 0; i < dma->buf_count; i++) {
			retcode = copyout(&dma->buflist[i]->idx,
					  &request.list[i].idx,
					  sizeof(request.list[0].idx));
			if (retcode) goto done;
			retcode = copyout(&dma->buflist[i]->total,
					  &request.list[i].total,
					  sizeof(request.list[0].total));
			if (retcode) goto done;
			retcode = copyout(&zero,
					  &request.list[i].used,
					  sizeof(request.list[0].used));
			if (retcode) goto done;
			address = virtual + dma->buflist[i]->offset;
			retcode = copyout(&address,
					  &request.list[i].address,
					  sizeof(address));
			if (retcode) goto done;
		}
	}
done:
	request.count = dma->buf_count;
	DRM_DEBUG("%d buffers, retcode = %d\n", request.count, retcode);

	*(drm_buf_map_t *) data = request;

	return retcode;
}
generated by cgit v1.2.3 (git 2.25.1) at 2025-12-06 16:07:47 +0000