summaryrefslogtreecommitdiff
path: root/bsd-core/drm_memory.c
AgeCommit message (Collapse)Author
2005-11-08Initial port of savage to FreeBSD for the AGP and !ShadowStatus case. AddsEric Anholt
drm_mtrr_{add,del} for handling the MTRR setup. Still has a LOR issue with DRM_VERIFYAREA_READ/DRM_COPY_FROM_USER_UNCHECKED in savage_bci.c -- this won't work with the fine-grained locking in use, and just doing a single copyin to a temporary will probably work fine. Also note that the module leaks approximately 4 kb on unload.
2005-04-16Use /*- to begin license blocks in BSD code to reduce diffs against FreeBSDEric Anholt
CVS.
2005-02-05- Implement drm_initmap, and extend it with the resource number to helpEric Anholt
FreeBSD. Add drm_get_resource_{start|len} so linux-specific stuff doesn't need to be in shared code. - Fix mach64 build by using __DECONST to work around passing a const pointer to useracc, which is unfortunately not marked const. - Get rid of a lot of maplist code by not having dev->maplist be a pointer, and by sticking the link entries directly in drm_local_map_t rather than having a separate structure for the linked list. - Factor out map uninit and removal into its own routine, rather than duplicating in both drm_takedown() and drm_rmmap(). - Hook up more driver functions, and correct FreeBSD-specific bits of radeon_cp.c, making radeon work. - Baby steps towards using bus_space as we should.
2004-11-06Commit first pieces of port to OpenBSD, done by Martin Lexa (martin atEric Anholt
martinlexa dot cz). Now that we've got porting for all three major BSDs (and the fourth being very similar to FreeBSD), move the mostly-duplication drm_os_* files into drmP.h. Remove some cruft from linux heritage and from pieces of the DRM that have since been removed. Note that things are still not quite working for even FreeBSD, but these are first steps at cleanup, and just a WIP checkpoint.
2004-11-06Remove the vestiges of the memory-debug code.Eric Anholt
2004-11-06Commit WIP of BSD conversion to core model. Compiles for r128, radeon, butEric Anholt
doesn't run yet. Moves the ioctl definitions for these two drivers back to the shared code -- they aren't OS-specific.
2004-08-14Hopefully proper fix for corrupted driver name in memcontrol list.Eric Anholt
Reported by: Jung-uk Kim <jkim@niksun.com>
2004-07-06Fix module loading on alpha by not referencing MTRR symbols onEric Anholt
!__REALLY_HAVE_MTRR.
2003-10-24Move the REALLY_HAVE_AGP endif above the mtrr functions. Broke tdfx module.Eric Anholt
2003-10-20Clean up BSD MTRR handling. The NetBSD code is untested, but it's my bestEric Anholt
shot.
2003-08-29Add DRM(calloc), which is convenient, used by the new sis code, and takesEric Anholt
advantage of M_ZERO on BSDs.
2003-08-19- Remove $FreeBSD$ tags as they weren't too useful and merges are now beingEric Anholt
done through perforce. - Add copyright headers to drm_os_*bsd.h, still need to research the other copyright-less files better.
2003-04-26Move the memory functions with debugging info to drm_memory_debug.h, andEric Anholt
remove a couple of dead functions.
2003-04-25Merge from FreeBSD-current.Eric Anholt
2003-03-29Remove dead vma code and remove the unused devstate struct definition.Eric Anholt
2003-03-11Merge back from FreeBSD-current, adding FreeBSD ID tags to aid futureEric Anholt
merging. Also includes an update to radeon PCI IDs.
2003-02-21Merge from bsd-4-0-0-branch.Eric Anholt
2002-07-05merged bsd-3-0-0-branchAlan Hourihane
2002-03-06first pass at merging mesa 4.0 kernel drivers into new bsd-3-0-0 branch.Alan Hourihane
2002-01-27Initial revisionDavid Dawes
generated by cgit v1.2.3 (git 2.25.1) at 2025-12-06 16:01:38 +0000
#n303'>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 
/*
 * Copyright 1998-2003 VIA Technologies, Inc. All Rights Reserved.
 * Copyright 2001-2003 S3 Graphics, Inc. All Rights Reserved.
 * Copyright 2000 Silicon Integrated Systems Corp, Inc., HsinChu, Taiwan.
 *
 * 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, sub license,
 * 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 NON-INFRINGEMENT. IN NO EVENT SHALL
 * VIA, S3 GRAPHICS, 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.
 */
#include <linux/module.h>
#include <linux/delay.h>
#include <linux/errno.h>
#include <linux/kernel.h>
#include <linux/slab.h>
#include <linux/poll.h>
#include <asm/io.h>
#include <linux/pci.h>

#include "via_ds.h"
extern unsigned int VIA_DEBUG;

set_t *via_setInit(void)
{
        int i;
        set_t *set;
        set = (set_t *)DRM(alloc)(sizeof(set_t), DRM_MEM_DRIVER);
        for (i = 0; i < SET_SIZE; i++) {
                set->list[i].free_next = i+1;    
                set->list[i].alloc_next = -1;
        }    
        set->list[SET_SIZE-1].free_next = -1;
        set->free = 0;
        set->alloc = -1;
        set->trace = -1;
        return set;
}

int via_setAdd(set_t *set, ITEM_TYPE item)
{
        int free = set->free;
        if (free != -1) {
                set->list[free].val = item;
                set->free = set->list[free].free_next;
        }
        else {
                return 0;
        }
        set->list[free].alloc_next = set->alloc;
        set->alloc = free;  
        set->list[free].free_next = -1;  
        return 1;
}

int via_setDel(set_t *set, ITEM_TYPE item)
{
        int alloc = set->alloc;
        int prev = -1;  
  
        while (alloc != -1) {
                if (set->list[alloc].val == item) {
                        if (prev != -1)      
                                set->list[prev].alloc_next = set->list[alloc].alloc_next; 
                        else
                                set->alloc = set->list[alloc].alloc_next;
                        break;
                }
                prev = alloc;
                alloc = set->list[alloc].alloc_next;      
        }

        if (alloc == -1)
                return 0;
  
        set->list[alloc].free_next = set->free;
        set->free = alloc;
        set->list[alloc].alloc_next = -1;   

        return 1;
}

/* setFirst -> setAdd -> setNext is wrong */

int via_setFirst(set_t *set, ITEM_TYPE *item)
{
        if (set->alloc == -1)
                return 0;

        *item = set->list[set->alloc].val;
        set->trace = set->list[set->alloc].alloc_next; 

	
        return 1;
}

int via_setNext(set_t *set, ITEM_TYPE *item)
{
        if (set->trace == -1)
                return 0;
  
        *item = set->list[set->trace].val;
        set->trace = set->list[set->trace].alloc_next;      

        return 1;
}

int via_setDestroy(set_t *set)
{
        DRM(free)(set, sizeof(set_t), DRM_MEM_DRIVER);

        return 1;
}

#define ISFREE(bptr) ((bptr)->free)

#define PRINTF(fmt, arg...) do{}while(0)
#define fprintf(fmt, arg...) do{}while(0)

void via_mmDumpMemInfo( memHeap_t *heap )
{
        TMemBlock *p;

        PRINTF ("Memory heap %p:\n", heap);
    
        if (heap == 0)
                PRINTF ("  heap == 0\n");
        else {
                p = (TMemBlock *)heap;
	
                while (p) {
                        PRINTF ("  Offset:%08x, Size:%08x, %c%c\n",p->ofs,p->size,
                                p->free ? '.':'U',
                                p->reserved ? 'R':'.');
                        p = p->next;
                }
        }
    
        PRINTF ("End of memory blocks\n");
}

memHeap_t *via_mmInit(int ofs,
		      int size)
{
        PMemBlock blocks;
  
        if (size <= 0)
                return 0;

      
        blocks = (TMemBlock *)DRM(calloc)(1,sizeof(TMemBlock),DRM_MEM_DRIVER);
   
        if (blocks) {
                blocks->ofs = ofs;
                blocks->size = size;
                blocks->free = 1;
                return (memHeap_t *)blocks;
        } else
                return 0;
}

memHeap_t *via_mmAddRange(memHeap_t *heap,
			  int ofs,
			  int size)
{
        PMemBlock blocks;
        blocks = (TMemBlock *)DRM(calloc)(2,sizeof(TMemBlock),DRM_MEM_DRIVER);
    
        if (blocks) {
                blocks[0].size = size;
                blocks[0].free = 1;
                blocks[0].ofs = ofs;
                blocks[0].next = &blocks[1];

                /* Discontinuity - stops JoinBlock from trying to join non-adjacent
                 * ranges.
                 */
                blocks[1].size = 0;
                blocks[1].free = 0;
                blocks[1].ofs = ofs+size;
                blocks[1].next = (PMemBlock) heap;      
                return (memHeap_t *)blocks;
        } 
        else
                return heap;
}

static TMemBlock* SliceBlock(TMemBlock *p, 
			     int startofs, int size, 
			     int reserved, int alignment)
{
        TMemBlock *newblock;

        /* break left */
        if (startofs > p->ofs) {
                newblock = (TMemBlock*)DRM(calloc)(1,sizeof(TMemBlock),DRM_MEM_DRIVER);
                newblock->ofs = startofs;
                newblock->size = p->size - (startofs - p->ofs);
                newblock->free = 1;
                newblock->next = p->next;
                p->size -= newblock->size;
                p->next = newblock;
                p = newblock;
        }

        /* break right */
        if (size < p->size) {
                newblock = (TMemBlock*)DRM(calloc)(1,sizeof(TMemBlock),DRM_MEM_DRIVER);
                newblock->ofs = startofs + size;
                newblock->size = p->size - size;
                newblock->free = 1;
                newblock->next = p->next;
                p->size = size;
                p->next = newblock;
        }

        /* p = middle block */
        p->align = alignment;
        p->free = 0;
        p->reserved = reserved;
        return p;
}

PMemBlock via_mmAllocMem(memHeap_t *heap, int size, int align2, int startSearch)
{
        int mask,startofs,endofs;
        TMemBlock *p;

        if (!heap || align2 < 0 || size <= 0)
                return NULL;
    
        mask = (1 << align2)-1;
        startofs = 0;
        p = (TMemBlock *)heap;
    
        while (p) {
                if (ISFREE(p)) {
                        startofs = (p->ofs + mask) & ~mask;
    	
                        if ( startofs < startSearch )
                                startofs = startSearch;
        
                        endofs = startofs+size;
        
                        if (endofs <= (p->ofs+p->size))
                                break;
                }
	
                p = p->next;
        }
    
        if (!p)
                return NULL;
    
        p = SliceBlock(p,startofs,size,0,mask+1);
        p->heap = heap;
    
        return p;
}

static __inline__ int Join2Blocks(TMemBlock *p)
{
        if (p->free && p->next && p->next->free) {
                TMemBlock *q = p->next;
                p->size += q->size;
                p->next = q->next;
                DRM(free)(q,sizeof(TMemBlock),DRM_MEM_DRIVER);
	
                return 1;
        }
    
        return 0;
}

int via_mmFreeMem(PMemBlock b)
{
        TMemBlock *p,*prev;

        if (!b)
                return 0;
    
        if (!b->heap) {
                fprintf(stderr, "no heap\n");
        
                return -1;
        }
    
        p = b->heap;
        prev = NULL;
    
        while (p && p != b) {
                prev = p;
                p = p->next;
        }
    
        if (!p || p->free || p->reserved) {
                if (!p)
                        fprintf(stderr, "block not found in heap\n");
                else if (p->free)
                        fprintf(stderr, "block already free\n");
                else
                        fprintf(stderr, "block is reserved\n");
	
	
                return -1;
        }
    
        p->free = 1;
        Join2Blocks(p);
    
        if (prev)
                Join2Blocks(prev);
  
        return 0;
}

int via_mmReserveMem(memHeap_t *heap, int offset,int size)
{
        int endofs;
        TMemBlock *p;

        if (!heap || size <= 0)
                return -1;
        endofs = offset+size;
        p = (TMemBlock *)heap;
    
        while (p && p->ofs <= offset) {
                if (ISFREE(p) && endofs <= (p->ofs+p->size)) {
                        SliceBlock(p,offset,size,1,1);
                        return 0;
                }
                p = p->next;
        }
        return -1;
}

int via_mmFreeReserved(memHeap_t *heap, int offset)
{
        TMemBlock *p,*prev;

        if (!heap)
                return -1;
  
        p = (TMemBlock *)heap;
        prev = NULL;
    
        while (p && p->ofs != offset) {
                prev = p;
                p = p->next;
        }
    
        if (!p || !p->reserved)
                return -1;
        p->free = 1;
        p->reserved = 0;
        Join2Blocks(p);
    
        if (prev)
                Join2Blocks(prev);
    
        return 0;
}

void via_mmDestroy(memHeap_t *heap)
{
        TMemBlock *p,*q;

        if (!heap)
                return;
        p = (TMemBlock *)heap;
    
        while (p) {
                q = p->next;
                DRM(free)(p,sizeof(TMemBlock),DRM_MEM_DRIVER);
                p = q;
        }
}
generated by cgit v1.2.3 (git 2.25.1) at 2025-12-06 16:01:37 +0000