mirror of
https://github.com/DrBeef/DVR.git
synced 2024-12-21 01:51:11 +00:00
336 lines
8.3 KiB
C
336 lines
8.3 KiB
C
|
/* Emacs style mode select -*- C++ -*-
|
||
|
*-----------------------------------------------------------------------------
|
||
|
*
|
||
|
*
|
||
|
* PrBoom: a Doom port merged with LxDoom and LSDLDoom
|
||
|
* based on BOOM, a modified and improved DOOM engine
|
||
|
* Copyright (C) 2001 by
|
||
|
* Jess Haas, Nicolas Kalkhof, Colin Phipps, Florian Schulze
|
||
|
* Copyright 2005, 2006 by
|
||
|
* Florian Schulze, Colin Phipps, Neil Stevens, Andrey Budko
|
||
|
*
|
||
|
* 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.
|
||
|
*
|
||
|
* DESCRIPTION:
|
||
|
* Transparent access to data in WADs using mmap
|
||
|
*
|
||
|
*-----------------------------------------------------------------------------
|
||
|
*/
|
||
|
|
||
|
#ifdef HAVE_CONFIG_H
|
||
|
#include "config.h"
|
||
|
#endif
|
||
|
|
||
|
#ifdef HAVE_UNISTD_H
|
||
|
#include <unistd.h>
|
||
|
#endif
|
||
|
#ifdef _WIN32
|
||
|
#define WIN32_LEAN_AND_MEAN
|
||
|
#include <windows.h>
|
||
|
#else
|
||
|
// Vladimir
|
||
|
# define __deprecated /* unimplemented */
|
||
|
#include <sys/mman.h>
|
||
|
#endif
|
||
|
|
||
|
#include "doomstat.h"
|
||
|
#include "doomtype.h"
|
||
|
|
||
|
#ifdef __GNUG__
|
||
|
#pragma implementation "w_wad.h"
|
||
|
#endif
|
||
|
#include "w_wad.h"
|
||
|
#include "z_zone.h"
|
||
|
#include "lprintf.h"
|
||
|
#include "i_system.h"
|
||
|
|
||
|
static struct {
|
||
|
void *cache;
|
||
|
#ifdef TIMEDIAG
|
||
|
int locktic;
|
||
|
#endif
|
||
|
int locks;
|
||
|
} *cachelump;
|
||
|
|
||
|
#ifdef HEAPDUMP
|
||
|
void W_PrintLump(FILE* fp, void* p) {
|
||
|
int i;
|
||
|
for (i=0; i<numlumps; i++)
|
||
|
if (cachelump[i].cache == p) {
|
||
|
fprintf(fp, " %8.8s %6u %2d %6d", lumpinfo[i].name,
|
||
|
W_LumpLength(i), cachelump[i].locks, gametic - cachelump[i].locktic);
|
||
|
return;
|
||
|
}
|
||
|
fprintf(fp, " not found");
|
||
|
}
|
||
|
#endif
|
||
|
|
||
|
#ifdef TIMEDIAG
|
||
|
static void W_ReportLocks(void)
|
||
|
{
|
||
|
int i;
|
||
|
lprintf(LO_DEBUG, "W_ReportLocks:\nLump Size Locks Tics\n");
|
||
|
for (i=0; i<numlumps; i++) {
|
||
|
if (cachelump[i].locks > 0)
|
||
|
lprintf(LO_DEBUG, "%8.8s %6u %2d %6d\n", lumpinfo[i].name,
|
||
|
W_LumpLength(i), cachelump[i].locks, gametic - cachelump[i].locktic);
|
||
|
}
|
||
|
}
|
||
|
#endif
|
||
|
|
||
|
#ifdef _WIN32
|
||
|
typedef struct {
|
||
|
HANDLE hnd;
|
||
|
OFSTRUCT fileinfo;
|
||
|
HANDLE hnd_map;
|
||
|
void *data;
|
||
|
} mmap_info_t;
|
||
|
|
||
|
mmap_info_t *mapped_wad;
|
||
|
|
||
|
void W_DoneCache(void)
|
||
|
{
|
||
|
size_t i;
|
||
|
|
||
|
if (cachelump) {
|
||
|
free(cachelump);
|
||
|
cachelump = NULL;
|
||
|
}
|
||
|
|
||
|
if (!mapped_wad)
|
||
|
return;
|
||
|
for (i=0; i<numwadfiles; i++)
|
||
|
{
|
||
|
if (mapped_wad[i].data)
|
||
|
{
|
||
|
UnmapViewOfFile(mapped_wad[i].data);
|
||
|
mapped_wad[i].data=NULL;
|
||
|
}
|
||
|
if (mapped_wad[i].hnd_map)
|
||
|
{
|
||
|
CloseHandle(mapped_wad[i].hnd_map);
|
||
|
mapped_wad[i].hnd_map=NULL;
|
||
|
}
|
||
|
if (mapped_wad[i].hnd)
|
||
|
{
|
||
|
CloseHandle(mapped_wad[i].hnd);
|
||
|
mapped_wad[i].hnd=NULL;
|
||
|
}
|
||
|
}
|
||
|
free(mapped_wad);
|
||
|
}
|
||
|
|
||
|
void W_InitCache(void)
|
||
|
{
|
||
|
// set up caching
|
||
|
cachelump = calloc(numlumps, sizeof *cachelump);
|
||
|
if (!cachelump)
|
||
|
I_Error ("W_Init: Couldn't allocate lumpcache");
|
||
|
|
||
|
#ifdef TIMEDIAG
|
||
|
atexit(W_ReportLocks);
|
||
|
#endif
|
||
|
|
||
|
mapped_wad = calloc(numwadfiles,sizeof(mmap_info_t));
|
||
|
memset(mapped_wad,0,sizeof(mmap_info_t)*numwadfiles);
|
||
|
{
|
||
|
int i;
|
||
|
for (i=0; i<numlumps; i++)
|
||
|
{
|
||
|
int wad_index = (int)(lumpinfo[i].wadfile-wadfiles);
|
||
|
|
||
|
cachelump[i].locks = -1;
|
||
|
|
||
|
if (!lumpinfo[i].wadfile)
|
||
|
continue;
|
||
|
#ifdef RANGECHECK
|
||
|
if ((wad_index<0)||((size_t)wad_index>=numwadfiles))
|
||
|
I_Error("W_InitCache: wad_index out of range");
|
||
|
#endif
|
||
|
if (!mapped_wad[wad_index].data)
|
||
|
{
|
||
|
mapped_wad[wad_index].hnd =
|
||
|
(HANDLE)OpenFile(
|
||
|
wadfiles[wad_index].name,
|
||
|
&mapped_wad[wad_index].fileinfo,
|
||
|
OF_READ
|
||
|
);
|
||
|
if (mapped_wad[wad_index].hnd==(HANDLE)HFILE_ERROR)
|
||
|
I_Error("W_InitCache: OpenFile for memory mapping failed (LastError %i)",GetLastError());
|
||
|
mapped_wad[wad_index].hnd_map =
|
||
|
CreateFileMapping(
|
||
|
mapped_wad[wad_index].hnd,
|
||
|
NULL,
|
||
|
PAGE_READONLY,
|
||
|
0,
|
||
|
0,
|
||
|
NULL
|
||
|
);
|
||
|
if (mapped_wad[wad_index].hnd_map==NULL)
|
||
|
I_Error("W_InitCache: CreateFileMapping for memory mapping failed (LastError %i)",GetLastError());
|
||
|
mapped_wad[wad_index].data =
|
||
|
MapViewOfFile(
|
||
|
mapped_wad[wad_index].hnd_map,
|
||
|
FILE_MAP_READ,
|
||
|
0,
|
||
|
0,
|
||
|
0
|
||
|
);
|
||
|
if (mapped_wad[wad_index].hnd_map==NULL)
|
||
|
I_Error("W_InitCache: MapViewOfFile for memory mapping failed (LastError %i)",GetLastError());
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
const void* W_CacheLumpNum(int lump)
|
||
|
{
|
||
|
int wad_index = (int)(lumpinfo[lump].wadfile-wadfiles);
|
||
|
#ifdef RANGECHECK
|
||
|
if ((wad_index<0)||((size_t)wad_index>=numwadfiles))
|
||
|
I_Error("W_CacheLumpNum: wad_index out of range");
|
||
|
if ((unsigned)lump >= (unsigned)numlumps)
|
||
|
I_Error ("W_CacheLumpNum: %i >= numlumps",lump);
|
||
|
#endif
|
||
|
if (!lumpinfo[lump].wadfile)
|
||
|
return NULL;
|
||
|
return (void*)((unsigned char *)mapped_wad[wad_index].data+lumpinfo[lump].position);
|
||
|
}
|
||
|
|
||
|
#else
|
||
|
|
||
|
void ** mapped_wad;
|
||
|
|
||
|
void W_InitCache(void)
|
||
|
{
|
||
|
int maxfd = 0;
|
||
|
// set up caching
|
||
|
cachelump = calloc(numlumps, sizeof *cachelump);
|
||
|
if (!cachelump)
|
||
|
I_Error ("W_Init: Couldn't allocate lumpcache");
|
||
|
|
||
|
#ifdef TIMEDIAG
|
||
|
atexit(W_ReportLocks);
|
||
|
#endif
|
||
|
|
||
|
{
|
||
|
int i;
|
||
|
for (i=0; i<numlumps; i++)
|
||
|
if (lumpinfo[i].wadfile)
|
||
|
if (lumpinfo[i].wadfile->handle > maxfd) maxfd = lumpinfo[i].wadfile->handle;
|
||
|
}
|
||
|
mapped_wad = calloc(maxfd+1,sizeof *mapped_wad);
|
||
|
{
|
||
|
int i;
|
||
|
for (i=0; i<numlumps; i++) {
|
||
|
cachelump[i].locks = -1;
|
||
|
if (lumpinfo[i].wadfile) {
|
||
|
int fd = lumpinfo[i].wadfile->handle;
|
||
|
if (!mapped_wad[fd])
|
||
|
if ((mapped_wad[fd] = mmap(NULL,I_Filelength(fd),PROT_READ,MAP_SHARED,fd,0)) == MAP_FAILED)
|
||
|
I_Error("W_InitCache: failed to mmap");
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
void W_DoneCache(void)
|
||
|
{
|
||
|
{
|
||
|
int i;
|
||
|
for (i=0; i<numlumps; i++)
|
||
|
if (lumpinfo[i].wadfile) {
|
||
|
int fd = lumpinfo[i].wadfile->handle;
|
||
|
if (mapped_wad[fd]) {
|
||
|
if (munmap(mapped_wad[fd],I_Filelength(fd)))
|
||
|
I_Error("W_DoneCache: failed to munmap");
|
||
|
mapped_wad[fd] = NULL;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
free(mapped_wad);
|
||
|
}
|
||
|
|
||
|
const void* W_CacheLumpNum(int lump)
|
||
|
{
|
||
|
#ifdef RANGECHECK
|
||
|
if ((unsigned)lump >= (unsigned)numlumps)
|
||
|
I_Error ("W_CacheLumpNum: %i >= numlumps",lump);
|
||
|
#endif
|
||
|
if (!lumpinfo[lump].wadfile)
|
||
|
return NULL;
|
||
|
return (mapped_wad[lumpinfo[lump].wadfile->handle]+lumpinfo[lump].position);
|
||
|
}
|
||
|
#endif
|
||
|
|
||
|
/*
|
||
|
* W_LockLumpNum
|
||
|
*
|
||
|
* This copies the lump into a malloced memory region and returns its address
|
||
|
* instead of returning a pointer into the memory mapped area
|
||
|
*
|
||
|
*/
|
||
|
const void* W_LockLumpNum(int lump)
|
||
|
{
|
||
|
size_t len = W_LumpLength(lump);
|
||
|
const void *data = W_CacheLumpNum(lump);
|
||
|
|
||
|
if (!cachelump[lump].cache) {
|
||
|
// read the lump in
|
||
|
Z_Malloc(len, PU_CACHE, &cachelump[lump].cache);
|
||
|
memcpy(cachelump[lump].cache, data, len);
|
||
|
}
|
||
|
|
||
|
/* cph - if wasn't locked but now is, tell z_zone to hold it */
|
||
|
if (cachelump[lump].locks <= 0) {
|
||
|
Z_ChangeTag(cachelump[lump].cache,PU_STATIC);
|
||
|
#ifdef TIMEDIAG
|
||
|
cachelump[lump].locktic = gametic;
|
||
|
#endif
|
||
|
// reset lock counter
|
||
|
cachelump[lump].locks = 1;
|
||
|
} else {
|
||
|
// increment lock counter
|
||
|
cachelump[lump].locks += 1;
|
||
|
}
|
||
|
|
||
|
#ifdef SIMPLECHECKS
|
||
|
if (!((cachelump[lump].locks+1) & 0xf))
|
||
|
lprintf(LO_DEBUG, "W_CacheLumpNum: High lock on %8s (%d)\n",
|
||
|
lumpinfo[lump].name, cachelump[lump].locks);
|
||
|
#endif
|
||
|
|
||
|
return cachelump[lump].cache;
|
||
|
}
|
||
|
|
||
|
void W_UnlockLumpNum(int lump) {
|
||
|
if (cachelump[lump].locks == -1)
|
||
|
return; // this lump is memory mapped
|
||
|
|
||
|
#ifdef SIMPLECHECKS
|
||
|
if (cachelump[lump].locks == 0)
|
||
|
lprintf(LO_DEBUG, "W_UnlockLumpNum: Excess unlocks on %8s\n",
|
||
|
lumpinfo[lump].name);
|
||
|
#endif
|
||
|
cachelump[lump].locks -= 1;
|
||
|
/* cph - Note: must only tell z_zone to make purgeable if currently locked,
|
||
|
* else it might already have been purged
|
||
|
*/
|
||
|
if (cachelump[lump].locks == 0)
|
||
|
Z_ChangeTag(cachelump[lump].cache, PU_CACHE);
|
||
|
}
|
||
|
|