mirror of
https://git.code.sf.net/p/quake/quake2forge
synced 2024-12-12 13:42:21 +00:00
bd911a47db
taken his patch against icculus.org's quake2 tree, and applied it to solaris/ and then migrated that stuff to our tree in src/ so it gets built.
234 lines
4.7 KiB
C
234 lines
4.7 KiB
C
/*
|
|
Copyright (C) 1997-2001 Id Software, Inc.
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License
|
|
as published by the Free Software Foundation; either version 2
|
|
of the License, or (at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
See the GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
|
|
*/
|
|
#include <sys/types.h>
|
|
#include <errno.h>
|
|
#include <stdio.h>
|
|
#include <dirent.h>
|
|
#include <sys/stat.h>
|
|
#include <unistd.h>
|
|
#include <sys/mman.h>
|
|
#include <sys/time.h>
|
|
|
|
#include "../solaris/glob.h"
|
|
|
|
#include "../qcommon/qcommon.h"
|
|
|
|
//===============================================================================
|
|
|
|
byte *membase;
|
|
int maxhunksize;
|
|
int curhunksize;
|
|
|
|
void *Hunk_Begin (int maxsize)
|
|
{
|
|
// reserve a huge chunk of memory, but don't commit any yet
|
|
maxhunksize = maxsize;
|
|
curhunksize = 0;
|
|
membase = malloc(maxhunksize);
|
|
/* DEBUG: eliasm */
|
|
memset( membase, 0, maxhunksize );
|
|
/* DEBUG: eliasm */
|
|
if (membase == NULL)
|
|
Sys_Error(ERR_FATAL, "unable to allocate %d bytes", maxsize);
|
|
|
|
return membase;
|
|
}
|
|
|
|
void *Hunk_Alloc (int size)
|
|
{
|
|
byte *buf;
|
|
|
|
// round to cacheline
|
|
size = (size+31)&~31;
|
|
if (curhunksize + size > maxhunksize)
|
|
Sys_Error(ERR_FATAL, "Hunk_Alloc overflow");
|
|
buf = membase + curhunksize;
|
|
curhunksize += size;
|
|
return buf;
|
|
}
|
|
|
|
int Hunk_End (void)
|
|
{
|
|
byte *n;
|
|
|
|
n = realloc(membase, curhunksize);
|
|
if (n != membase)
|
|
Sys_Error(ERR_FATAL, "Hunk_End: Could not remap virtual block (%d)", errno);
|
|
|
|
return curhunksize;
|
|
}
|
|
|
|
void Hunk_Free (void *base)
|
|
{
|
|
if (base)
|
|
free(base);
|
|
}
|
|
|
|
//===============================================================================
|
|
|
|
|
|
/*
|
|
================
|
|
Sys_Milliseconds
|
|
================
|
|
*/
|
|
int curtime;
|
|
int xSys_Milliseconds (void)
|
|
{
|
|
struct timeval tp;
|
|
struct timezone tzp;
|
|
static int secbase;
|
|
|
|
gettimeofday(&tp, &tzp);
|
|
|
|
if (!secbase)
|
|
{
|
|
secbase = tp.tv_sec;
|
|
return tp.tv_usec/1000;
|
|
}
|
|
|
|
curtime = (tp.tv_sec - secbase)*1000 + tp.tv_usec/1000;
|
|
|
|
return curtime;
|
|
}
|
|
|
|
extern hrtime_t base_hrtime;
|
|
|
|
int Sys_Milliseconds( void )
|
|
{
|
|
hrtime_t curr_hrtime;
|
|
|
|
curr_hrtime = gethrtime();
|
|
|
|
curtime = (curr_hrtime - base_hrtime) / 1000000LL;
|
|
|
|
return curtime;
|
|
}
|
|
|
|
|
|
void Sys_Mkdir (char *path)
|
|
{
|
|
mkdir (path, 0777);
|
|
}
|
|
|
|
char *strlwr (char *s)
|
|
{
|
|
while (*s) {
|
|
*s = tolower(*s);
|
|
s++;
|
|
}
|
|
}
|
|
|
|
//============================================
|
|
|
|
static char findbase[MAX_OSPATH];
|
|
static char findpath[MAX_OSPATH];
|
|
static char findpattern[MAX_OSPATH];
|
|
static DIR *fdir;
|
|
|
|
static qboolean CompareAttributes(char *path, char *name,
|
|
unsigned musthave, unsigned canthave )
|
|
{
|
|
struct stat st;
|
|
char fn[MAX_OSPATH];
|
|
|
|
// . and .. never match
|
|
if (strcmp(name, ".") == 0 || strcmp(name, "..") == 0)
|
|
return false;
|
|
|
|
return true;
|
|
//sprintf(fn, "%s/%s", path, name);
|
|
if (stat(fn, &st) == -1)
|
|
return false; // shouldn't happen
|
|
|
|
if ( ( st.st_mode & S_IFDIR ) && ( canthave & SFF_SUBDIR ) )
|
|
return false;
|
|
|
|
if ( ( musthave & SFF_SUBDIR ) && !( st.st_mode & S_IFDIR ) )
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
char *Sys_FindFirst (char *path, unsigned musthave, unsigned canhave)
|
|
{
|
|
struct dirent *d;
|
|
char *p;
|
|
|
|
if (fdir)
|
|
Sys_Error ("Sys_BeginFind without close");
|
|
|
|
// COM_FilePath (path, findbase);
|
|
strcpy(findbase, path);
|
|
|
|
if ((p = strrchr(findbase, '/')) != NULL) {
|
|
*p = 0;
|
|
strcpy(findpattern, p + 1);
|
|
} else
|
|
strcpy(findpattern, "*");
|
|
|
|
if (strcmp(findpattern, "*.*") == 0)
|
|
strcpy(findpattern, "*");
|
|
|
|
/* if ((fdir = opendir(path)) == NULL)*/
|
|
if ((fdir = opendir(findbase)) == NULL)
|
|
return NULL;
|
|
while ((d = readdir(fdir)) != NULL) {
|
|
if (!*findpattern || glob_match(findpattern, d->d_name)) {
|
|
// if (*findpattern)
|
|
// printf("%s matched %s\n", findpattern, d->d_name);
|
|
if (CompareAttributes(findbase, d->d_name, musthave, canhave)) {
|
|
sprintf (findpath, "%s/%s", findbase, d->d_name);
|
|
return findpath;
|
|
}
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
char *Sys_FindNext (unsigned musthave, unsigned canhave)
|
|
{
|
|
struct dirent *d;
|
|
|
|
if (fdir == NULL)
|
|
return NULL;
|
|
while ((d = readdir(fdir)) != NULL) {
|
|
if (!*findpattern || glob_match(findpattern, d->d_name)) {
|
|
// if (*findpattern)
|
|
// printf("%s matched %s\n", findpattern, d->d_name);
|
|
if (CompareAttributes(findbase, d->d_name, musthave, canhave)) {
|
|
sprintf (findpath, "%s/%s", findbase, d->d_name);
|
|
return findpath;
|
|
}
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
void Sys_FindClose (void)
|
|
{
|
|
if (fdir != NULL)
|
|
closedir(fdir);
|
|
fdir = NULL;
|
|
}
|
|
|
|
|
|
//============================================
|
|
|