www.pudn.com > BUILD Engine 08012001.zip > cache1d.c
/*
* "Build Engine & Tools" Copyright (c) 1993-1997 Ken Silverman
* Ken Silverman's official web site: "http://www.advsys.net/ken"
* See the included license file "BUILDLIC.TXT" for license info.
* This file has been modified from Ken Silverman's original release
*/
#include
#include
#include
#include
#include
#include
#include "platform.h"
#include "display.h"
#include "pragmas.h"
#include "cache1d.h"
#if (defined USE_PHYSICSFS)
#include "physfs.h"
#endif
/*
* This module keeps track of a standard linear cacheing system.
* To use this module, here's all you need to do:
*
* Step 1: Allocate a nice BIG buffer, like from 1MB-4MB and
* Call initcache(long cachestart, long cachesize) where
*
* cachestart = (long)(pointer to start of BIG buffer)
* cachesize = length of BIG buffer
*
* Step 2: Call allocache(long *bufptr, long bufsiz, char *lockptr)
* whenever you need to allocate a buffer, where:
*
* *bufptr = pointer to 4-byte pointer to buffer
* Confused? Using this method, cache2d can remove
* previously allocated things from the cache safely by
* setting the 4-byte pointer to 0.
* bufsiz = number of bytes to allocate
* *lockptr = pointer to locking char which tells whether
* the region can be removed or not. If *lockptr = 0 then
* the region is not locked else its locked.
*
* Step 3: If you need to remove everything from the cache, or every
* unlocked item from the cache, you can call uninitcache();
* Call uninitcache(0) to remove all unlocked items, or
* Call uninitcache(1) to remove everything.
* After calling uninitcache, it is still ok to call allocache
* without first calling initcache.
*/
#define MAXCACHEOBJECTS 9216
static long cachesize = 0;
long cachecount = 0;
unsigned char zerochar = 0;
long cachestart = 0, cacnum = 0, agecount = 0;
typedef struct { long *hand, leng; unsigned char *lock; } cactype;
cactype cac[MAXCACHEOBJECTS];
static long lockrecip[200];
void initcache(long dacachestart, long dacachesize)
{
long i;
for(i=1;i<200;i++) lockrecip[i] = (1<<28)/(200-i);
cachestart = dacachestart;
cachesize = dacachesize;
cac[0].leng = cachesize;
cac[0].lock = &zerochar;
cacnum = 1;
}
void allocache (long *newhandle, long newbytes, unsigned char *newlockptr)
{
long i, z, zz, bestz=0, daval, bestval, besto=0, o1, o2, sucklen, suckz;
newbytes = ((newbytes+15)&0xfffffff0);
if ((unsigned)newbytes > (unsigned)cachesize)
{
printf("Cachesize: %ld\n",cachesize);
printf("*Newhandle: 0x%x, Newbytes: %ld, *Newlock: %d\n",(unsigned int)newhandle,newbytes,*newlockptr);
reportandexit("BUFFER TOO BIG TO FIT IN CACHE!\n");
}
if (*newlockptr == 0)
{
reportandexit("ALLOCACHE CALLED WITH LOCK OF 0!\n");
}
/* Find best place */
bestval = 0x7fffffff; o1 = cachesize;
for(z=cacnum-1;z>=0;z--)
{
o1 -= cac[z].leng;
o2 = o1+newbytes; if (o2 > cachesize) continue;
daval = 0;
for(i=o1,zz=z;i= 200) { daval = 0x7fffffff; break; }
daval += (long) mulscale32(cac[zz].leng+65536,lockrecip[*cac[zz].lock]);
if (daval >= bestval) break;
}
if (daval < bestval)
{
bestval = daval; besto = o1; bestz = z;
if (bestval == 0) break;
}
}
/*printf("%ld %ld %ld\n",besto,newbytes,*newlockptr);*/
if (bestval == 0x7fffffff)
reportandexit("CACHE SPACE ALL LOCKED UP!\n");
/* Suck things out */
for(sucklen=-newbytes,suckz=bestz;sucklen<0;sucklen+=cac[suckz++].leng)
if (*cac[suckz].lock) *cac[suckz].hand = 0;
/* Remove all blocks except 1 */
suckz -= (bestz+1); cacnum -= suckz;
copybufbyte(&cac[bestz+suckz],&cac[bestz],(cacnum-bestz)*sizeof(cactype));
cac[bestz].hand = newhandle; *newhandle = cachestart+besto;
cac[bestz].leng = newbytes;
cac[bestz].lock = newlockptr;
cachecount++;
/* Add new empty block if necessary */
if (sucklen <= 0) return;
bestz++;
if (bestz == cacnum)
{
cacnum++; if (cacnum > MAXCACHEOBJECTS) reportandexit("Too many objects in cache! (cacnum > MAXCACHEOBJECTS)\n");
cac[bestz].leng = sucklen;
cac[bestz].lock = &zerochar;
return;
}
if (*cac[bestz].lock == 0) { cac[bestz].leng += sucklen; return; }
cacnum++; if (cacnum > MAXCACHEOBJECTS) reportandexit("Too many objects in cache! (cacnum > MAXCACHEOBJECTS)\n");
for(z=cacnum-1;z>bestz;z--) cac[z] = cac[z-1];
cac[bestz].leng = sucklen;
cac[bestz].lock = &zerochar;
}
void suckcache (long *suckptr)
{
long i;
/* Can't exit early, because invalid pointer might be same even though lock = 0 */
for(i=0;i 0) && (*cac[i-1].lock == 0))
{
cac[i-1].leng += cac[i].leng;
cacnum--; copybuf(&cac[i+1],&cac[i],(cacnum-i)*sizeof(cactype));
}
else if ((i < cacnum-1) && (*cac[i+1].lock == 0))
{
cac[i+1].leng += cac[i].leng;
cacnum--; copybuf(&cac[i+1],&cac[i],(cacnum-i)*sizeof(cactype));
}
}
}
void agecache(void)
{
long cnt;
char ch;
if (agecount >= cacnum) agecount = cacnum-1;
for(cnt=(cacnum>>4);cnt>=0;cnt--)
{
ch = (*cac[agecount].lock);
if (((ch-2)&255) < 198)
(*cac[agecount].lock) = (unsigned char) (ch-1);
agecount--; if (agecount < 0) agecount = cacnum-1;
}
}
void reportandexit(char *errormessage)
{
long i, j;
setvmode(0x3);
j = 0;
for(i=0;i= MAXGROUPFILES) return(-1);
groupfil[numgroupfiles] = open(filename,O_BINARY|O_RDWR,S_IREAD);
if (groupfil[numgroupfiles] >= 0)
{
groupfilpos[numgroupfiles] = 0;
read(groupfil[numgroupfiles],buf,16);
if ((buf[0] != 'K') || (buf[1] != 'e') || (buf[2] != 'n') ||
(buf[3] != 'S') || (buf[4] != 'i') || (buf[5] != 'l') ||
(buf[6] != 'v') || (buf[7] != 'e') || (buf[8] != 'r') ||
(buf[9] != 'm') || (buf[10] != 'a') || (buf[11] != 'n'))
{
close(groupfil[numgroupfiles]);
groupfil[numgroupfiles] = -1;
return(-1);
}
gnumfiles[numgroupfiles] = *((long *)&buf[12]);
if ((gfilelist[numgroupfiles] = (char *)kmalloc(gnumfiles[numgroupfiles]<<4)) == 0)
{ printf("Not enough memory for file grouping system\n"); exit(0); }
if ((gfileoffs[numgroupfiles] = (long *)kmalloc((gnumfiles[numgroupfiles]+1)<<2)) == 0)
{ printf("Not enough memory for file grouping system\n"); exit(0); }
read(groupfil[numgroupfiles],gfilelist[numgroupfiles],gnumfiles[numgroupfiles]<<4);
j = 0;
for(i=0;i=0;i--)
if (groupfil[i] != -1)
{
kfree(gfilelist[i]);
kfree(gfileoffs[i]);
close(groupfil[i]);
groupfil[i] = -1;
}
#endif
}
long kopen4load(const char *filename, char searchfirst)
{
#if (defined USE_PHYSICSFS)
int i;
PHYSFS_file *rc = PHYSFS_openRead(filename);
if (rc == NULL)
return(-1);
for (i = 0; i < MAXOPENFILES; i++)
{
if (filehan[i] == NULL)
{
filehan[i] = rc;
return(i);
}
}
PHYSFS_close(rc); /* oh well. */
return(-1);
#else
long i, j, k, fil, newhandle;
unsigned char bad;
char *gfileptr;
newhandle = MAXOPENFILES-1;
while (filehan[newhandle] != -1)
{
newhandle--;
if (newhandle < 0)
{
printf("TOO MANY FILES OPEN IN FILE GROUPING SYSTEM!");
exit(0);
}
}
if (searchfirst == 0)
if ((fil = open(filename,O_BINARY|O_RDONLY)) != -1)
{
filegrp[newhandle] = 255;
filehan[newhandle] = fil;
filepos[newhandle] = 0;
return(newhandle);
}
for(k=numgroupfiles-1;k>=0;k--)
{
if (searchfirst != 0) k = 0;
if (groupfil[k] != -1)
{
for(i=gnumfiles[k]-1;i>=0;i--)
{
gfileptr = (char *)&gfilelist[k][i<<4];
bad = 0;
for(j=0;j<13;j++)
{
if (!filename[j]) break;
if (toupperlookup[(int) filename[j]] != toupperlookup[(int) gfileptr[j]])
{ bad = 1; break; }
}
if (bad) continue;
filegrp[newhandle] = (unsigned char) k;
filehan[newhandle] = i;
filepos[newhandle] = 0;
return(newhandle);
}
}
}
return(-1);
#endif
}
long kread(long handle, void *buffer, long leng)
{
#if (defined USE_PHYSICSFS)
return(PHYSFS_read(filehan[handle], buffer, 1, leng));
return(leng);
#else
long i, filenum, groupnum;
filenum = filehan[handle];
groupnum = filegrp[handle];
if (groupnum == 255) return(read(filenum,buffer,leng));
if (groupfil[groupnum] != -1)
{
i = gfileoffs[groupnum][filenum]+filepos[handle];
if (i != groupfilpos[groupnum])
{
lseek(groupfil[groupnum],i+((gnumfiles[groupnum]+1)<<4),SEEK_SET);
groupfilpos[groupnum] = i;
}
leng = min(leng,(gfileoffs[groupnum][filenum+1]-gfileoffs[groupnum][filenum])-filepos[handle]);
leng = read(groupfil[groupnum],buffer,leng);
filepos[handle] += leng;
groupfilpos[groupnum] += leng;
return(leng);
}
return(0);
#endif
}
long klseek(long handle, long offset, long whence)
{
#if (defined USE_PHYSICSFS)
if (whence == SEEK_END)
{
printf("UNSUPPORTED SEEK SEMANTIC!\n");
exit(42);
} /* if */
if (whence == SEEK_CUR)
offset += PHYSFS_tell(filehan[handle]);
if (!PHYSFS_seek(filehan[handle], offset))
return(-1);
return(offset);
#else
long i, groupnum;
groupnum = filegrp[handle];
if (groupnum == 255) return(lseek(filehan[handle],offset,whence));
if (groupfil[groupnum] != -1)
{
switch(whence)
{
case SEEK_SET: filepos[handle] = offset; break;
case SEEK_END: i = filehan[handle];
filepos[handle] = (gfileoffs[groupnum][i+1]-gfileoffs[groupnum][i])+offset;
break;
case SEEK_CUR: filepos[handle] += offset; break;
}
return(filepos[handle]);
}
return(-1);
#endif
}
long kfilelength(long handle)
{
#if (defined USE_PHYSICSFS)
return(PHYSFS_fileLength(filehan[handle]));
#else
long i, groupnum;
groupnum = filegrp[handle];
if (groupnum == 255) return(filelength(filehan[handle]));
i = filehan[handle];
return(gfileoffs[groupnum][i+1]-gfileoffs[groupnum][i]);
#endif
}
void kclose(long handle)
{
#if (defined USE_PHYSICSFS)
if (filehan[handle] != NULL)
{
PHYSFS_close(filehan[handle]);
filehan[handle] = NULL;
} /* if */
#else
if (handle < 0) return;
if (filegrp[handle] == 255) close(filehan[handle]);
filehan[handle] = -1;
#endif
}
/* Internal LZW variables */
#define LZWSIZE 16384 /* Watch out for shorts! */
static char *lzwbuf1, *lzwbuf4, *lzwbuf5;
static unsigned char lzwbuflock[5];
static short *lzwbuf2, *lzwbuf3;
void kdfread(void *buffer, size_t dasizeof, size_t count, long fil)
{
size_t i, j;
long k, kgoal;
short leng;
char *ptr;
lzwbuflock[0] = lzwbuflock[1] = lzwbuflock[2] = lzwbuflock[3] = lzwbuflock[4] = 200;
if (lzwbuf1 == NULL) allocache((long *)&lzwbuf1,LZWSIZE+(LZWSIZE>>4),&lzwbuflock[0]);
if (lzwbuf2 == NULL) allocache((long *)&lzwbuf2,(LZWSIZE+(LZWSIZE>>4))*2,&lzwbuflock[1]);
if (lzwbuf3 == NULL) allocache((long *)&lzwbuf3,(LZWSIZE+(LZWSIZE>>4))*2,&lzwbuflock[2]);
if (lzwbuf4 == NULL) allocache((long *)&lzwbuf4,LZWSIZE,&lzwbuflock[3]);
if (lzwbuf5 == NULL) allocache((long *)&lzwbuf5,LZWSIZE+(LZWSIZE>>4),&lzwbuflock[4]);
if (dasizeof > LZWSIZE) { count *= dasizeof; dasizeof = 1; }
ptr = (char *)buffer;
kread(fil,&leng,2); kread(fil,lzwbuf5,(long)leng);
k = 0;
kgoal = uncompress(lzwbuf5,(long)leng,lzwbuf4);
copybufbyte(lzwbuf4,ptr,(long)dasizeof);
k += (long)dasizeof;
for(i=1;i= kgoal)
{
kread(fil,&leng,2); kread(fil,lzwbuf5,(long)leng);
k = 0; kgoal = uncompress(lzwbuf5,(long)leng,lzwbuf4);
}
for(j=0;j>4),&lzwbuflock[0]);
if (lzwbuf2 == NULL) allocache((long *)&lzwbuf2,(LZWSIZE+(LZWSIZE>>4))*2,&lzwbuflock[1]);
if (lzwbuf3 == NULL) allocache((long *)&lzwbuf3,(LZWSIZE+(LZWSIZE>>4))*2,&lzwbuflock[2]);
if (lzwbuf4 == NULL) allocache((long *)&lzwbuf4,LZWSIZE,&lzwbuflock[3]);
if (lzwbuf5 == NULL) allocache((long *)&lzwbuf5,LZWSIZE+(LZWSIZE>>4),&lzwbuflock[4]);
if (dasizeof > LZWSIZE) { count *= dasizeof; dasizeof = 1; }
ptr = (char *)buffer;
fread(&leng,2,1,fil); fread(lzwbuf5,(long)leng,1,fil);
k = 0; kgoal = uncompress(lzwbuf5,(long)leng,lzwbuf4);
copybufbyte(lzwbuf4,ptr,(long)dasizeof);
k += (long)dasizeof;
for(i=1;i= kgoal)
{
fread(&leng,2,1,fil); fread(lzwbuf5,(long)leng,1,fil);
k = 0; kgoal = uncompress(lzwbuf5,(long)leng,lzwbuf4);
}
for(j=0;j>4),&lzwbuflock[0]);
if (lzwbuf2 == NULL) allocache((long *)&lzwbuf2,(LZWSIZE+(LZWSIZE>>4))*2,&lzwbuflock[1]);
if (lzwbuf3 == NULL) allocache((long *)&lzwbuf3,(LZWSIZE+(LZWSIZE>>4))*2,&lzwbuflock[2]);
if (lzwbuf4 == NULL) allocache((long *)&lzwbuf4,LZWSIZE,&lzwbuflock[3]);
if (lzwbuf5 == NULL) allocache((long *)&lzwbuf5,LZWSIZE+(LZWSIZE>>4),&lzwbuflock[4]);
if (dasizeof > LZWSIZE) { count *= dasizeof; dasizeof = 1; }
ptr = (char *)buffer;
copybufbyte(ptr,lzwbuf4,(long)dasizeof);
k = dasizeof;
if (k > LZWSIZE-dasizeof)
{
leng = (short)compress(lzwbuf4,k,lzwbuf5); k = 0;
fwrite(&leng,2,1,fil); fwrite(lzwbuf5,(long)leng,1,fil);
}
for(i=1;i LZWSIZE-dasizeof)
{
leng = (short)compress(lzwbuf4,k,lzwbuf5); k = 0;
fwrite(&leng,2,1,fil); fwrite(lzwbuf5,(long)leng,1,fil);
}
ptr += dasizeof;
}
if (k > 0)
{
leng = (short)compress(lzwbuf4,k,lzwbuf5);
fwrite(&leng,2,1,fil); fwrite(lzwbuf5,(long)leng,1,fil);
}
lzwbuflock[0] = lzwbuflock[1] = lzwbuflock[2] = lzwbuflock[3] = lzwbuflock[4] = 1;
}
long compress(char *lzwinbuf, long uncompleng, char *lzwoutbuf)
{
long i, addr, newaddr, addrcnt, zx, *longptr;
long bytecnt1, bitcnt, numbits, oneupnumbits;
short *shortptr;
for(i=255;i>=0;i--) { lzwbuf1[i] = (char) i; lzwbuf3[i] = (short) ((i+1)&255); }
clearbuf((void *) FP_OFF(lzwbuf2),256>>1,0xffffffff);
clearbuf((void *) FP_OFF(lzwoutbuf),((uncompleng+15)+3)>>2,0L);
addrcnt = 256; bytecnt1 = 0; bitcnt = (4<<3);
numbits = 8; oneupnumbits = (1<<8);
do
{
addr = lzwinbuf[bytecnt1];
do
{
bytecnt1++;
if (bytecnt1 == uncompleng) break;
if (lzwbuf2[addr] < 0) {lzwbuf2[addr] = (short) addrcnt; break;}
newaddr = lzwbuf2[addr];
while (lzwbuf1[newaddr] != lzwinbuf[bytecnt1])
{
zx = lzwbuf3[newaddr];
if (zx < 0) {lzwbuf3[newaddr] = (short) addrcnt; break;}
newaddr = zx;
}
if (lzwbuf3[newaddr] == addrcnt) break;
addr = newaddr;
} while (addr >= 0);
lzwbuf1[addrcnt] = lzwinbuf[bytecnt1];
lzwbuf2[addrcnt] = -1;
lzwbuf3[addrcnt] = -1;
longptr = (long *)&lzwoutbuf[bitcnt>>3];
longptr[0] |= (addr<<(bitcnt&7));
bitcnt += numbits;
if ((addr&((oneupnumbits>>1)-1)) > ((addrcnt-1)&((oneupnumbits>>1)-1)))
bitcnt--;
addrcnt++;
if (addrcnt > oneupnumbits) { numbits++; oneupnumbits <<= 1; }
} while ((bytecnt1 < uncompleng) && (bitcnt < (uncompleng<<3)));
longptr = (long *)&lzwoutbuf[bitcnt>>3];
longptr[0] |= (addr<<(bitcnt&7));
bitcnt += numbits;
if ((addr&((oneupnumbits>>1)-1)) > ((addrcnt-1)&((oneupnumbits>>1)-1)))
bitcnt--;
shortptr = (short *)lzwoutbuf;
shortptr[0] = (short)uncompleng;
if (((bitcnt+7)>>3) < uncompleng)
{
shortptr[1] = (short)addrcnt;
return((bitcnt+7)>>3);
}
shortptr[1] = (short)0;
for(i=0;i>2);
return((long)shortptr[0]); /* uncompleng */
}
for(i=255;i>=0;i--) { lzwbuf2[i] = (short) i; lzwbuf3[i] = (short) i; }
currstr = 256; bitcnt = (4<<3); outbytecnt = 0;
numbits = 8; oneupnumbits = (1<<8);
do
{
longptr = (long *)&lzwinbuf[bitcnt>>3];
dat = ((longptr[0]>>(bitcnt&7)) & (oneupnumbits-1));
bitcnt += numbits;
if ((dat&((oneupnumbits>>1)-1)) > ((currstr-1)&((oneupnumbits>>1)-1)))
{ dat &= ((oneupnumbits>>1)-1); bitcnt--; }
lzwbuf3[currstr] = (short) dat;
for(leng=0;dat>=256;leng++,dat=lzwbuf3[dat])
lzwbuf1[leng] = (char) lzwbuf2[dat];
lzwoutbuf[outbytecnt++] = (char) dat;
for(i=leng-1;i>=0;i--) lzwoutbuf[outbytecnt++] = lzwbuf1[i];
lzwbuf2[currstr-1] = (short) dat; lzwbuf2[currstr] = (short) dat;
currstr++;
if (currstr > oneupnumbits) { numbits++; oneupnumbits <<= 1; }
} while (currstr < strtot);
return((long)shortptr[0]); /* uncompleng */
}