Paul Pan
7b33e4213a
1. add test soft 2. modify verilator (TODO: crossbar need to replace) 3. fix CP0: now CU0 is always 1 4. Controller: cacheop 5. Controller: fix TEN 6. mycpu_top fix CP0_i 7. fix AXI.sv 8. fix AXIReader.sv 9. fix AXIWriter.sv: getting the correct data and length 10. MU: fix cache writeback, fix mem data mux, fix writer address, fix read request
136 lines
3.5 KiB
C
136 lines
3.5 KiB
C
/* $Id: malloc.c,v 1.1.1.1 2006/09/14 01:59:08 root Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 2000-2002 Opsycon AB (www.opsycon.se)
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by Opsycon AB.
|
|
* 4. The name of the author may not be used to endorse or promote products
|
|
* derived from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
|
|
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
|
|
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
*/
|
|
typedef long long ALIGN;
|
|
|
|
//static void free(void *ap);
|
|
|
|
union header {
|
|
struct {
|
|
union header *ptr;
|
|
unsigned size;
|
|
} s;
|
|
ALIGN x;
|
|
};
|
|
|
|
typedef union header HEADER;
|
|
|
|
static HEADER base;
|
|
static HEADER *allocp; /* K&R called allocp, freep */
|
|
|
|
#ifndef NULL
|
|
#define NULL 0
|
|
#endif
|
|
#define NALLOC 128
|
|
|
|
/* The rest of this file is from pages 185-189 of K & R Edition 2 */
|
|
|
|
static HEADER *morecore (unsigned nbyte);
|
|
|
|
char *membase=0x80010000;
|
|
char *sbrk(int size)
|
|
{
|
|
char *p=membase;
|
|
membase +=size;
|
|
return p;
|
|
}
|
|
|
|
void *
|
|
malloc(size_t nbytes)
|
|
{
|
|
HEADER *p, *q; /* K&R called q, prevp */
|
|
unsigned nunits;
|
|
|
|
nunits = (nbytes + sizeof (HEADER) - 1) / sizeof (HEADER) + 1;
|
|
if ((q = allocp) == NULL) { /* no free list yet */
|
|
base.s.ptr = allocp = q = &base;
|
|
base.s.size = 0;
|
|
}
|
|
for (p = q->s.ptr;; q = p, p = p->s.ptr) {
|
|
if (p->s.size >= nunits) { /* big enough */
|
|
if (p->s.size == nunits) /* exactly */
|
|
q->s.ptr = p->s.ptr;
|
|
else { /* allocate tail end */
|
|
p->s.size -= nunits;
|
|
p += p->s.size;
|
|
p->s.size = nunits;
|
|
}
|
|
allocp = q;
|
|
return ((char *)(p + 1));
|
|
}
|
|
if (p == allocp)
|
|
if ((p = morecore (nunits)) == NULL)
|
|
return (NULL);
|
|
}
|
|
}
|
|
|
|
|
|
static HEADER *
|
|
morecore(unsigned nu)
|
|
{
|
|
char *cp;
|
|
HEADER *up;
|
|
int rnu;
|
|
|
|
rnu = NALLOC * ((nu + NALLOC - 1) / NALLOC);
|
|
cp = sbrk(rnu * sizeof (HEADER));
|
|
if ((int)cp == NULL)
|
|
return (NULL);
|
|
up = (HEADER *) cp;
|
|
up->s.size = rnu;
|
|
free ((char *)(up + 1));
|
|
return (allocp);
|
|
}
|
|
|
|
|
|
void
|
|
free(void *ap)
|
|
{
|
|
HEADER *p, *q;
|
|
|
|
p = (HEADER *) ap - 1;
|
|
for (q = allocp; !(p > q && p < q->s.ptr); q = q->s.ptr)
|
|
if (q >= q->s.ptr && (p > q || p < q->s.ptr))
|
|
break;
|
|
if (p + p->s.size == q->s.ptr) {
|
|
p->s.size += q->s.ptr->s.size;
|
|
p->s.ptr = q->s.ptr->s.ptr;
|
|
} else
|
|
p->s.ptr = q->s.ptr;
|
|
if (q + q->s.size == p) {
|
|
q->s.size += p->s.size;
|
|
q->s.ptr = p->s.ptr;
|
|
} else
|
|
q->s.ptr = p;
|
|
allocp = q;
|
|
}
|