empserver/src/lib/common/file.c
Markus Armbruster 64d8f6babe (ef_open, EFF_RDONLY, EFF_CREATE, EFF_OPEN): Replace mode parameter
(really open flags, not mode) by new flags EFF_RDONLY, EFF_CREATE.
Open flags were needlessly general.  Callers changed.
(empfile): Member mode now unused, remove.
2005-10-24 18:18:59 +00:00

421 lines
9.4 KiB
C

/*
* Empire - A multi-player, client/server Internet based war game.
* Copyright (C) 1986-2005, Dave Pare, Jeff Bailey, Thomas Ruschak,
* Ken Stevens, Steve McClure
*
* 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
*
* ---
*
* See the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
* related information and legal notices. It is expected that any future
* projects/authors will amend these files as needed.
*
* ---
*
* file.c: Misc. operations on files
*
* Known contributors to this file:
* Dave Pare, 1989
* Steve McClure, 2000
*/
#include <string.h>
#include <fcntl.h>
#include <signal.h>
#include <stdlib.h>
#if !defined(_WIN32)
#include <unistd.h>
#endif
#include "misc.h"
#include "nsc.h"
#include "file.h"
#include "common.h"
#include "gen.h"
static void fillcache(struct empfile *ep, int start);
/*
* Open the binary file for table TYPE (EF_SECTOR, ...).
* HOW are EFF_OPEN flags to control operation.
* Return non-zero on success, zero on failure.
* You must call ef_close() before the next ef_open().
*/
int
ef_open(int type, int how)
{
struct empfile *ep;
int oflags, size;
if (ef_check(type) < 0)
return 0;
if (CANT_HAPPEN(how & ~EFF_OPEN))
how &= EFF_OPEN;
ep = &empfile[type];
if (CANT_HAPPEN(ep->fd >= 0))
return 0;
oflags = O_RDWR;
if (how & EFF_RDONLY)
oflags = O_RDONLY;
if (how & EFF_CREATE)
oflags |= O_CREAT | O_TRUNC;
#if defined(_WIN32)
oflags |= O_BINARY;
#endif
if ((ep->fd = open(ep->file, oflags, 0660)) < 0) {
logerror("%s: open failed", ep->file);
return 0;
}
ep->baseid = 0;
ep->cids = 0;
ep->flags = (ep->flags & ~EFF_OPEN) | (how ^ ~EFF_CREATE);
ep->fids = fsize(ep->fd) / ep->size;
if (ep->flags & EFF_MEM)
ep->csize = ep->fids;
else
ep->csize = max(1, blksize(ep->fd) / ep->size);
size = ep->csize * ep->size;
ep->cache = malloc(size);
if (ep->cache == NULL) {
logerror("ef_open: %s malloc(%d) failed\n", ep->file, size);
return 0;
}
if (ep->flags & EFF_MEM) {
if (read(ep->fd, ep->cache, size) != size) {
logerror("ef_open: read(%s) failed\n", ep->file);
return 0;
}
ep->cids = size / ep->size;
}
return 1;
}
/*
* Close the file containing objects of the type 'type', flushing the cache
* if applicable.
*/
int
ef_close(int type)
{
struct empfile *ep;
int r;
if (ef_check(type) < 0)
return 0;
ep = &empfile[type];
if (ep->cache == NULL) {
/* no cache implies never opened */
return 0;
}
ef_flush(type);
ep->flags &= ~EFF_MEM;
free(ep->cache);
ep->cache = NULL;
if ((r = close(ep->fd)) < 0) {
logerror("ef_close: %s close(%d) -> %d", ep->name, ep->fd, r);
}
ep->fd = -1;
return 1;
}
/*
* Flush the cache of the file containing objects of type 'type' to disk.
*/
int
ef_flush(int type)
{
struct empfile *ep;
int size;
int r;
if (ef_check(type) < 0)
return 0;
ep = &empfile[type];
if (ep->cache == NULL) {
/* no cache implies never opened */
return 0;
}
/*
* We don't know which cache entries are dirty. ef_write() writes
* through, but direct updates through ef_ptr() don't. They are
* allowed only with EFF_MEM. Assume the whole cash is dirty
* then.
*/
if (!(ep->flags & EFF_RDONLY) && (ep->flags & EFF_MEM)) {
size = ep->csize * ep->size;
if ((r = lseek(ep->fd, 0L, SEEK_SET)) < 0) {
logerror("ef_flush: %s cache lseek(%d, 0L, SEEK_SET) -> %d",
ep->name, ep->fd, r);
return 0;
}
if (write(ep->fd, ep->cache, size) != size) {
logerror("ef_flush: %s cache write(%d, %p, %d) -> %d",
ep->name, ep->fd, ep->cache, ep->size, r);
return 0;
}
}
return 1;
}
/*
* Return a pointer the id 'id' of object of type 'type' in the cache.
*/
char *
ef_ptr(int type, int id)
{
struct empfile *ep;
if (ef_check(type) < 0)
return NULL;
ep = &empfile[type];
if (id < 0 || id >= ep->fids)
return NULL;
if ((ep->flags & EFF_MEM) == 0) {
logerror("ef_ptr: (%s) only valid for EFF_MEM entries", ep->file);
return NULL;
}
return ep->cache + ep->size * id;
}
/*
* buffered read. Tries to read a large number of items.
* This system won't work if item size is > sizeof buffer area.
*/
int
ef_read(int type, int id, void *into)
{
struct empfile *ep;
void *from;
if (ef_check(type) < 0)
return 0;
ep = &empfile[type];
if (id < 0)
return 0;
if (ep->flags & EFF_MEM) {
if (id >= ep->fids)
return 0;
from = ep->cache + (id * ep->size);
} else {
if (id >= ep->fids) {
ep->fids = fsize(ep->fd) / ep->size;
if (id >= ep->fids)
return 0;
}
if (ep->baseid + ep->cids <= id || ep->baseid > id)
fillcache(ep, id);
from = ep->cache + (id - ep->baseid) * ep->size;
}
memcpy(into, from, ep->size);
if (ep->postread)
ep->postread(id, into);
return 1;
}
static void
fillcache(struct empfile *ep, int start)
{
int n;
ep->baseid = start;
lseek(ep->fd, start * ep->size, SEEK_SET);
n = read(ep->fd, ep->cache, ep->csize * ep->size);
ep->cids = n / ep->size;
}
/*
* buffered write. Modifies read cache (if applicable)
* and writes through to disk.
*/
int
ef_write(int type, int id, void *from)
{
int r;
struct empfile *ep;
char *to;
if (ef_check(type) < 0)
return 0;
ep = &empfile[type];
if (id > 65536) {
/* largest unit id; this may bite us in large games */
logerror("ef_write: type %d id %d is too large!\n", type, id);
return 0;
}
if ((r = lseek(ep->fd, id * ep->size, SEEK_SET)) < 0) {
logerror("ef_write: %s #%d lseek(%d, %d, SEEK_SET) -> %d",
ep->name, id, ep->fd, id * ep->size, r);
return 0;
}
if (ep->prewrite)
ep->prewrite(id, from);
if ((r = write(ep->fd, from, ep->size)) != ep->size) {
logerror("ef_write: %s #%d write(%d, %p, %d) -> %d",
ep->name, id, ep->fd, from, ep->size, r);
return 0;
}
if (id >= ep->baseid && id < ep->baseid + ep->cids) {
/* update the cache if necessary */
to = ep->cache + (id - ep->baseid) * ep->size;
memcpy(to, from, ep->size);
}
CANT_HAPPEN(id > ep->fids);
if (id >= ep->fids) {
if (ep->flags & EFF_MEM) {
logerror("file %s went beyond %d items; won't be able toread item w/o restart",
ep->name, ep->fids);
} else {
/* write expanded file; ep->fids = last id + 1 */
ep->fids = id + 1;
}
}
return 1;
}
/*
* Grow the file containing objects of the type 'type' by 'count' objects.
*/
int
ef_extend(int type, int count)
{
struct empfile *ep;
char *tmpobj;
int cur, max;
int how;
int r;
if (ef_check(type) < 0)
return 0;
ep = &empfile[type];
max = ep->fids + count;
cur = ep->fids;
tmpobj = calloc(1, ep->size);
if ((r = lseek(ep->fd, ep->fids * ep->size, SEEK_SET)) < 0) {
logerror("ef_extend: %s +#%d lseek(%d, %d, SEEK_SET) -> %d",
ep->name, count, ep->fd, ep->fids * ep->size, r);
free(tmpobj);
return 0;
}
for (cur = ep->fids; cur < max; cur++) {
if (ep->init)
ep->init(cur, tmpobj);
if ((r = write(ep->fd, tmpobj, ep->size)) != ep->size) {
logerror("ef_extend: %s +#%d write(%d, %p, %d) -> %d",
ep->name, count, ep->fd, tmpobj, ep->size, r);
free(tmpobj);
return 0;
}
}
free(tmpobj);
if (ep->flags & EFF_MEM) {
/* XXX this will cause problems if there are ef_ptrs (to the
* old allocated structure) active when we do the re-open */
how = ep->flags;
ef_close(type);
ef_open(type, how);
} else {
ep->fids += count;
}
return 1;
}
/*
* Mark the cache for the file containing objects of type 'type' as unused.
*/
void
ef_zapcache(int type)
{
struct empfile *ep = &empfile[type];
if ((ep->flags & EFF_MEM) == 0) {
ep->cids = 0;
ep->baseid = -1;
}
}
struct castr *
ef_cadef(int type)
{
return empfile[type].cadef;
}
int
ef_nelem(int type)
{
return empfile[type].fids;
}
int
ef_flags(int type)
{
return empfile[type].flags;
}
time_t
ef_mtime(int type)
{
if (empfile[type].fd <= 0)
return 0;
return fdate(empfile[type].fd);
}
/*
* Search empfile[0..EF_MAX-1] for element named NAME.
* Return its index in empfile[] if found, else -1.
*/
int
ef_byname(char *name)
{
struct empfile *ef;
int i;
int len;
len = strlen(name);
for (i = 0; i < EF_MAX; i++) {
ef = &empfile[i];
if (strncmp(ef->name, name, min(len, strlen(ef->name))) == 0)
return i;
}
return -1;
}
char *
ef_nameof(int type)
{
if (type < 0 || type >= EF_MAX)
return "bad item type";
return empfile[type].name;
}
int
ef_check(int type)
{
if (type < 0 || type >= EF_MAX) {
logerror("ef_ptr: bad EF_type %d\n", type);
return -1;
}
return 0;
}
int
ef_ensure_space(int type, int id, int count)
{
while (id >= empfile[type].fids) {
if (!ef_extend(type, count))
return 0;
}
return 1;
}