/*
* db.c
*/
/*
* $Id: db.c,v 1.4 1995/12/03 09:18:32 root Exp root $
*/
#include "copyright.h"
#include "autoconf.h"
#include <sys/file.h>
#define __DB_C
#include "mudconf.h"
#include "config.h"
#include "externs.h"
#include "db.h"
#include "attrs.h"
#include "vattr.h"
#include "match.h"
#include "alloc.h"
#include "powers.h"
#include "interface.h"
#include "flags.h"
#ifndef O_ACCMODE
#define O_ACCMODE (O_RDONLY|O_WRONLY|O_RDWR)
#endif
/*
* Restart definitions
*/
#define RS_CONCENTRATE 0x00000002
#define RS_RECORD_PLAYERS 0x00000004
OBJ *db = NULL;
NAME *names = NULL;
extern int sock;
extern int ndescriptors;
extern int maxd;
extern int slave_socket;
#ifdef CONCENTRATE
extern int conc_pid;
#endif
extern pid_t slave_pid;
extern void FDECL(desc_addhash, (DESC *));
#ifdef TEST_MALLOC
int malloc_count = 0;
#endif /*
* * TEST_MALLOC
*/
#ifdef RADIX_COMPRESSION
/*
* Buffers for compressing in and out of. NOTE: These assume that compression
* will NEVER expand input text by more than 1.5, which is valid for the
* radix tree stuff, since it emits at worst a 12 bit code for every input
* byte. If this changes, the size of compress_buff needs to be adjusted to the
* new worst case.
*/
char decomp_buff[LBUF_SIZE];
char compress_buff[LBUF_SIZE + (LBUF_SIZE >> 1) + 1];
#endif
extern VATTR *FDECL(vattr_rename, (char *, char *));
typedef struct atrcount ATRCOUNT;
struct atrcount {
dbref thing;
int count;
};
/*
* ---------------------------------------------------------------------------
* * Temp file management, used to get around static limits in some versions
* * of libc.
*/
FILE *t_fd;
int t_is_pipe;
#ifdef TLI
int t_is_tli;
#endif
static void tf_xclose(fd)
FILE *fd;
{
if (fd) {
if (t_is_pipe)
pclose(fd);
#ifdef TLI
else if (t_is_tli)
t_close(fd);
#endif
else
fclose(fd);
} else {
close(0);
}
t_fd = NULL;
t_is_pipe = 0;
}
static int tf_fiddle(tfd)
int tfd;
{
if (tfd < 0) {
tfd = open(DEV_NULL, O_RDONLY, 0);
return -1;
}
if (tfd != 0) {
dup2(tfd, 0);
close(tfd);
}
return 0;
}
static int tf_xopen(fname, mode)
char *fname;
int mode;
{
int fd;
fd = open(fname, mode, 0600);
fd = tf_fiddle(fd);
return fd;
}
/*
* #define t_xopen(f,m) t_fiddle(open(f, m, 0600))
*/
static const char *mode_txt(mode)
int mode;
{
switch (mode & O_ACCMODE) {
case O_RDONLY:
return "r";
case O_WRONLY:
return "w";
}
return "r+";
}
void NDECL(tf_init)
{
fclose(stdin);
tf_xopen(DEV_NULL, O_RDONLY);
t_fd = NULL;
t_is_pipe = 0;
}
int tf_open(fname, mode)
char *fname;
int mode;
{
tf_xclose(t_fd);
return tf_xopen(fname, mode);
}
#ifndef STANDALONE
int tf_socket(fam, typ)
int fam, typ;
{
tf_xclose(t_fd);
return tf_fiddle(socket(fam, typ, 0));
}
#ifdef TLI
int tf_topen(fam, mode)
int fam, mode;
{
tf_xclose(t_fd);
return tf_fiddle(t_open(fam, mode, NULL));
}
#endif
#endif
void tf_close(fdes)
int fdes;
{
tf_xclose(t_fd);
tf_xopen(DEV_NULL, O_RDONLY);
}
FILE *tf_fopen(fname, mode)
char *fname;
int mode;
{
tf_xclose(t_fd);
if (tf_xopen(fname, mode) >= 0) {
t_fd = fdopen(0, mode_txt(mode));
return t_fd;
}
return NULL;
}
void tf_fclose(fd)
FILE *fd;
{
tf_xclose(t_fd);
tf_xopen(DEV_NULL, O_RDONLY);
}
FILE *tf_popen(fname, mode)
char *fname;
int mode;
{
tf_xclose(t_fd);
t_fd = popen(fname, mode_txt(mode));
if (t_fd != NULL) {
t_is_pipe = 1;
}
return t_fd;
}
/*
* #define GNU_MALLOC_TEST 1
*/
#ifdef GNU_MALLOC_TEST
extern unsigned int malloc_sbrk_used; /*
*
* * amount of data space used now
*/
#endif
/*
* Check routine forward declaration.
*/
extern int FDECL(fwdlist_ck, (int, dbref, dbref, int, char *));
extern void FDECL(pcache_reload, (dbref));
extern void FDECL(desc_reload, (dbref));
/*
* *INSERT-OFF*
*/
/*
* list of attributes
*/
ATTR attr[] =
{
{"Aahear", A_AAHEAR, AF_ODARK, NULL},
{"Aclone", A_ACLONE, AF_ODARK, NULL},
{"Aconnect", A_ACONNECT, AF_ODARK, NULL},
{"Adesc", A_ADESC, AF_ODARK, NULL},
{"Adfail", A_ADFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Adisconnect", A_ADISCONNECT, AF_ODARK, NULL},
{"Adrop", A_ADROP, AF_ODARK, NULL},
{"Aefail", A_AEFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Aenter", A_AENTER, AF_ODARK, NULL},
{"Afail", A_AFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Agfail", A_AGFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Ahear", A_AHEAR, AF_ODARK, NULL},
{"Akill", A_AKILL, AF_ODARK, NULL},
{"Aleave", A_ALEAVE, AF_ODARK, NULL},
{"Alfail", A_ALFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Alias", A_ALIAS, AF_NOPROG | AF_NOCMD | AF_GOD, NULL},
{"Allowance", A_ALLOWANCE, AF_MDARK | AF_NOPROG | AF_WIZARD, NULL},
{"Amail", A_AMAIL, AF_ODARK | AF_NOPROG, NULL},
{"Amhear", A_AMHEAR, AF_ODARK, NULL},
{"Amove", A_AMOVE, AF_ODARK, NULL},
{"Apay", A_APAY, AF_ODARK, NULL},
{"Arfail", A_ARFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Asucc", A_ASUCC, AF_ODARK, NULL},
{"Atfail", A_ATFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Atport", A_ATPORT, AF_ODARK | AF_NOPROG, NULL},
{"Atofail", A_ATOFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Aufail", A_AUFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Ause", A_AUSE, AF_ODARK, NULL},
{"Away", A_AWAY, AF_ODARK | AF_NOPROG, NULL},
{"Charges", A_CHARGES, AF_ODARK | AF_NOPROG, NULL},
{"Comment", A_COMMENT, AF_MDARK | AF_WIZARD, NULL},
{"Cost", A_COST, AF_ODARK, NULL},
{"Daily", A_DAILY, AF_ODARK, NULL},
{"Desc", A_DESC, AF_NOPROG, NULL},
{"DefaultLock", A_LOCK, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"Destroyer", A_DESTROYER, AF_MDARK | AF_WIZARD | AF_NOPROG, NULL},
{"Dfail", A_DFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Drop", A_DROP, AF_ODARK | AF_NOPROG, NULL},
{"DropLock", A_LDROP, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"Ealias", A_EALIAS, AF_ODARK | AF_NOPROG, NULL},
{"Efail", A_EFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Enter", A_ENTER, AF_ODARK, NULL},
{"EnterLock", A_LENTER, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"Fail", A_FAIL, AF_ODARK | AF_NOPROG, NULL},
{"Filter", A_FILTER, AF_ODARK | AF_NOPROG, NULL},
{"Forwardlist", A_FORWARDLIST, AF_ODARK | AF_NOPROG, fwdlist_ck},
{"Gfail", A_GFAIL, AF_ODARK | AF_NOPROG, NULL},
{"GiveLock", A_LGIVE, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"Html", A_HTML, AF_ODARK | AF_NOPROG, NULL},
{"Idesc", A_IDESC, AF_ODARK | AF_NOPROG, NULL},
{"Idle", A_IDLE, AF_ODARK | AF_NOPROG, NULL},
{"Infilter", A_INFILTER, AF_ODARK | AF_NOPROG, NULL},
{"Inprefix", A_INPREFIX, AF_ODARK | AF_NOPROG, NULL},
{"Kill", A_KILL, AF_ODARK, NULL},
{"Lalias", A_LALIAS, AF_ODARK | AF_NOPROG, NULL},
{"Last", A_LAST, AF_WIZARD | AF_NOCMD | AF_NOPROG, NULL},
{"Lastpage", A_LASTPAGE,
AF_INTERNAL | AF_NOCMD | AF_NOPROG | AF_GOD | AF_PRIVATE, NULL},
{"Lastsite", A_LASTSITE, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_GOD,
NULL},
{"Leave", A_LEAVE, AF_ODARK, NULL},
{"LeaveLock", A_LLEAVE, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"Lfail", A_LFAIL, AF_ODARK | AF_NOPROG, NULL},
{"LinkLock", A_LLINK, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"Listen", A_LISTEN, AF_ODARK, NULL},
{"Logindata", A_LOGINDATA, AF_DARK | AF_NOPROG | AF_NOCMD | AF_INTERNAL,
NULL},
{"Mailcurf", A_MAILCURF, AF_MDARK | AF_WIZARD | AF_NOPROG, NULL},
{"Mailflags", A_MAILFLAGS, AF_MDARK | AF_WIZARD | AF_NOPROG, NULL},
{"Mailfolders", A_MAILFOLDERS, AF_MDARK | AF_WIZARD | AF_NOPROG, NULL},
{"Mailmsg", A_MAILMSG, AF_DARK | AF_NOPROG | AF_NOCMD | AF_INTERNAL,
NULL},
{"Mailsub", A_MAILSUB, AF_DARK | AF_NOPROG | AF_NOCMD | AF_INTERNAL,
NULL},
{"Mailsucc", A_MAIL, AF_ODARK | AF_NOPROG, NULL},
{"Mailto", A_MAILTO, AF_DARK | AF_NOPROG | AF_NOCMD | AF_INTERNAL,
NULL},
{"Move", A_MOVE, AF_ODARK, NULL},
{"Name", A_NAME, AF_DARK | AF_NOPROG | AF_NOCMD | AF_INTERNAL,
NULL},
{"Odesc", A_ODESC, AF_ODARK | AF_NOPROG, NULL},
{"Odfail", A_ODFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Odrop", A_ODROP, AF_ODARK | AF_NOPROG, NULL},
{"Oefail", A_OEFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Oenter", A_OENTER, AF_ODARK, NULL},
{"Ofail", A_OFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Ogfail", A_OGFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Okill", A_OKILL, AF_ODARK, NULL},
{"Oleave", A_OLEAVE, AF_ODARK, NULL},
{"Olfail", A_OLFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Omove", A_OMOVE, AF_ODARK, NULL},
{"Opay", A_OPAY, AF_ODARK, NULL},
{"Orfail", A_ORFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Osucc", A_OSUCC, AF_ODARK | AF_NOPROG, NULL},
{"Otfail", A_OTFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Otport", A_OTPORT, AF_ODARK | AF_NOPROG, NULL},
{"Otofail", A_OTOFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Oufail", A_OUFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Ouse", A_OUSE, AF_ODARK, NULL},
{"Oxenter", A_OXENTER, AF_ODARK, NULL},
{"Oxleave", A_OXLEAVE, AF_ODARK, NULL},
{"Oxtport", A_OXTPORT, AF_ODARK | AF_NOPROG, NULL},
{"PageLock", A_LPAGE, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"ParentLock", A_LPARENT, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"Pay", A_PAY, AF_ODARK, NULL},
{"Prefix", A_PREFIX, AF_ODARK | AF_NOPROG, NULL},
{"ProgCmd", A_PROGCMD, AF_DARK | AF_NOPROG | AF_NOCMD | AF_INTERNAL,
NULL},
{"QueueMax", A_QUEUEMAX, AF_MDARK | AF_WIZARD | AF_NOPROG, NULL},
{"Quota", A_QUOTA, AF_MDARK | AF_NOPROG | AF_GOD | AF_NOCMD, NULL},
{"ReceiveLock", A_LRECEIVE, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"Reject", A_REJECT, AF_ODARK | AF_NOPROG, NULL},
{"Rfail", A_RFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Rquota", A_RQUOTA, AF_MDARK | AF_NOPROG | AF_GOD | AF_NOCMD, NULL},
{"Runout", A_RUNOUT, AF_ODARK, NULL},
{"Semaphore", A_SEMAPHORE, AF_ODARK | AF_NOPROG | AF_WIZARD | AF_NOCMD, NULL},
{"Sex", A_SEX, AF_NOPROG, NULL},
{"Signature", A_SIGNATURE, AF_ODARK | AF_NOPROG, NULL},
{"SpeechLock", A_LSPEECH, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"Startup", A_STARTUP, AF_ODARK, NULL},
{"Succ", A_SUCC, AF_ODARK | AF_NOPROG, NULL},
{"TeloutLock", A_LTELOUT, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"Tfail", A_TFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Timeout", A_TIMEOUT, AF_MDARK | AF_NOPROG | AF_WIZARD, NULL},
{"Tport", A_TPORT, AF_ODARK | AF_NOPROG, NULL},
{"TportLock", A_LTPORT, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"Tofail", A_TOFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Ufail", A_UFAIL, AF_ODARK | AF_NOPROG, NULL},
{"Use", A_USE, AF_ODARK, NULL},
{"UseLock", A_LUSE, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"UserLock", A_LUSER, AF_ODARK | AF_NOPROG | AF_NOCMD | AF_IS_LOCK,
NULL},
{"VA", A_VA, AF_ODARK, NULL},
{"VB", A_VA + 1, AF_ODARK, NULL},
{"VC", A_VA + 2, AF_ODARK, NULL},
{"VD", A_VA + 3, AF_ODARK, NULL},
{"VE", A_VA + 4, AF_ODARK, NULL},
{"VF", A_VA + 5, AF_ODARK, NULL},
{"VG", A_VA + 6, AF_ODARK, NULL},
{"VH", A_VA + 7, AF_ODARK, NULL},
{"VI", A_VA + 8, AF_ODARK, NULL},
{"VJ", A_VA + 9, AF_ODARK, NULL},
{"VK", A_VA + 10, AF_ODARK, NULL},
{"VL", A_VA + 11, AF_ODARK, NULL},
{"VM", A_VA + 12, AF_ODARK, NULL},
{"VN", A_VA + 13, AF_ODARK, NULL},
{"VO", A_VA + 14, AF_ODARK, NULL},
{"VP", A_VA + 15, AF_ODARK, NULL},
{"VQ", A_VA + 16, AF_ODARK, NULL},
{"VR", A_VA + 17, AF_ODARK, NULL},
{"VS", A_VA + 18, AF_ODARK, NULL},
{"VT", A_VA + 19, AF_ODARK, NULL},
{"VU", A_VA + 20, AF_ODARK, NULL},
{"VV", A_VA + 21, AF_ODARK, NULL},
{"VW", A_VA + 22, AF_ODARK, NULL},
{"VX", A_VA + 23, AF_ODARK, NULL},
{"VY", A_VA + 24, AF_ODARK, NULL},
{"VZ", A_VA + 25, AF_ODARK, NULL},
{"*Password", A_PASS, AF_DARK | AF_NOPROG | AF_NOCMD | AF_INTERNAL,
NULL},
{"*Privileges", A_PRIVS, AF_DARK | AF_NOPROG | AF_NOCMD | AF_INTERNAL,
NULL},
{"*Money", A_MONEY, AF_DARK | AF_NOPROG | AF_NOCMD | AF_INTERNAL,
NULL},
{NULL, 0, 0, NULL}};
#ifndef STANDALONE
/*
* *INSERT-ON*
*/
/*
* ---------------------------------------------------------------------------
* * fwdlist_set, fwdlist_clr: Manage cached forwarding lists
*/
void fwdlist_set(thing, ifp)
dbref thing;
FWDLIST *ifp;
{
FWDLIST *fp, *xfp;
int i;
/*
* If fwdlist is null, clear
*/
if (!ifp || (ifp->count <= 0)) {
fwdlist_clr(thing);
return;
}
/*
* Copy input forwardlist to a correctly-sized buffer
*/
fp = (FWDLIST *) XMALLOC(sizeof(int) * ((ifp->count) + 1), "fwdlist_set");
for (i = 0; i < ifp->count; i++) {
fp->data[i] = ifp->data[i];
}
fp->count = ifp->count;
/*
* Replace an existing forwardlist, or add a new one
*/
xfp = fwdlist_get(thing);
if (xfp) {
XFREE(xfp, "fwdlist_set");
nhashrepl(thing, (int *)fp, &mudstate.fwdlist_htab);
} else {
nhashadd(thing, (int *)fp, &mudstate.fwdlist_htab);
}
}
void fwdlist_clr(thing)
dbref thing;
{
FWDLIST *xfp;
/*
* If a forwardlist exists, delete it
*/
xfp = fwdlist_get(thing);
if (xfp) {
XFREE(xfp, "fwdlist_clr");
nhashdelete(thing, &mudstate.fwdlist_htab);
}
}
#endif
/*
* ---------------------------------------------------------------------------
* * fwdlist_load: Load text into a forwardlist.
*/
int fwdlist_load(fp, player, atext)
FWDLIST *fp;
dbref player;
char *atext;
{
dbref target;
char *tp, *bp, *dp;
int count, errors, fail;
count = 0;
errors = 0;
bp = tp = alloc_lbuf("fwdlist_load.str");
StringCopy(tp, atext);
do {
for (; *bp && isspace(*bp); bp++) ; /*
* skip spaces
*/
for (dp = bp; *bp && !isspace(*bp); bp++) ; /*
* remember *
*
* * * * *
* * * * * *
* string
*/
if (*bp)
*bp++ = '\0'; /*
* terminate string
*/
if ((*dp++ == '#') && isdigit(*dp)) {
target = atoi(dp);
#ifndef STANDALONE
fail = (!Good_obj(target) ||
(!God(player) &&
!controls(player, target) &&
(!Link_ok(target) ||
!could_doit(player, target, A_LLINK))));
#else
fail = !Good_obj(target);
#endif
if (fail) {
#ifndef STANDALONE
notify(player,
tprintf("Cannot forward to #%d: Permission denied.",
target));
#endif
errors++;
} else {
fp->data[count++] = target;
}
}
} while (*bp);
free_lbuf(tp);
fp->count = count;
return errors;
}
/*
* ---------------------------------------------------------------------------
* * fwdlist_rewrite: Generate a text string from a FWDLIST buffer.
*/
int fwdlist_rewrite(fp, atext)
FWDLIST *fp;
char *atext;
{
char *tp, *bp;
int i, count;
if (fp && fp->count) {
count = fp->count;
tp = alloc_sbuf("fwdlist_rewrite.errors");
bp = atext;
for (i = 0; i < fp->count; i++) {
if (Good_obj(fp->data[i])) {
sprintf(tp, "#%d ", fp->data[i]);
safe_str(tp, atext, &bp);
} else {
count--;
}
}
*bp = '\0';
free_sbuf(tp);
} else {
count = 0;
*atext = '\0';
}
return count;
}
/*
* ---------------------------------------------------------------------------
* * fwdlist_ck: Check a list of dbref numbers to forward to for AUDIBLE
*/
int fwdlist_ck(key, player, thing, anum, atext)
int key, anum;
dbref player, thing;
char *atext;
{
#ifndef STANDALONE
FWDLIST *fp;
int count;
count = 0;
if (atext && *atext) {
fp = (FWDLIST *) alloc_lbuf("fwdlist_ck.fp");
fwdlist_load(fp, player, atext);
} else {
fp = NULL;
}
/*
* Set the cached forwardlist
*/
fwdlist_set(thing, fp);
count = fwdlist_rewrite(fp, atext);
if (fp)
free_lbuf(fp);
return ((count > 0) || !atext || !*atext);
#else
return 1;
#endif
}
FWDLIST *fwdlist_get(thing)
dbref thing;
{
#ifdef STANDALONE
dbref aowner;
int aflags, errors;
char *tp;
static FWDLIST *fp = NULL;
if (!fp)
fp = (FWDLIST *) alloc_lbuf("fwdlist_get");
tp = atr_get(thing, A_FORWARDLIST, &aowner, &aflags);
errors = fwdlist_load(fp, GOD, tp);
free_lbuf(tp);
#else
FWDLIST *fp;
fp = ((FWDLIST *) nhashfind(thing, &mudstate.fwdlist_htab));
#endif
return fp;
}
static char *set_string(ptr, new)
char **ptr, *new;
{
/*
* if pointer not null unalloc it
*/
if (*ptr)
XFREE(*ptr, "set_string");
/*
* if new string is not null allocate space for it and copy it
*/
if (!new) /*
* * || !*new
*/
return (*ptr = NULL); /*
* Check with GAC about this
*/
*ptr = (char *)XMALLOC(strlen(new) + 1, "set_string");
StringCopy(*ptr, new);
return (*ptr);
}
/*
* ---------------------------------------------------------------------------
* * Name, s_Name: Get or set an object's name.
*/
INLINE char *Name(thing)
dbref thing;
{
dbref aowner;
int aflags;
char *buff;
static char *tbuff[LBUF_SIZE];
if (mudconf.cache_names) {
if (!names[thing]) {
buff = atr_get(thing, A_NAME, &aowner, &aflags);
set_string(&names[thing], buff);
free_lbuf(buff);
}
return (names[thing]);
}
atr_get_str((char *)tbuff, thing, A_NAME, &aowner, &aflags);
return ((char *)tbuff);
}
INLINE void s_Name(thing, s)
dbref thing;
const char *s;
{
atr_add_raw(thing, A_NAME, (char *)s);
if (mudconf.cache_names) {
set_string(&names[thing], (char *)s);
}
}
void s_Pass(thing, s)
dbref thing;
const char *s;
{
atr_add_raw(thing, A_PASS, (char *)s);
}
#ifndef STANDALONE
/*
* ---------------------------------------------------------------------------
* * do_attrib: Manage user-named attributes.
*/
extern NAMETAB attraccess_nametab[];
void do_attribute(player, cause, key, aname, value)
dbref player, cause;
int key;
char *aname, *value;
{
int success, negate, f;
char *buff, *sp, *p, *q;
VATTR *va;
ATTR *va2;
/*
* Look up the user-named attribute we want to play with
*/
buff = alloc_sbuf("do_attribute");
for (p = buff, q = aname; *q && ((p - buff) < (SBUF_SIZE - 1)); p++, q++)
*p = ToLower(*q);
*p = '\0';
va = (VATTR *) vattr_find(buff);
if (!va) {
notify(player, "No such user-named attribute.");
free_sbuf(buff);
return;
}
switch (key) {
case ATTRIB_ACCESS:
/*
* Modify access to user-named attribute
*/
for (sp = value; *sp; sp++)
*sp = ToLower(*sp);
sp = strtok(value, " ");
success = 0;
while (sp != NULL) {
/*
* Check for negation
*/
negate = 0;
if (*sp == '!') {
negate = 1;
sp++;
}
/*
* Set or clear the appropriate bit
*/
f = search_nametab(player, attraccess_nametab, sp);
if (f > 0) {
success = 1;
if (negate)
va->flags &= ~f;
else
va->flags |= f;
} else {
notify(player,
tprintf("Unknown permission: %s.", sp));
}
/*
* Get the next token
*/
sp = strtok(NULL, " ");
}
if (success && !Quiet(player))
notify(player, "Attribute access changed.");
break;
case ATTRIB_RENAME:
/*
* Make sure the new name doesn't already exist
*/
va2 = atr_str(value);
if (va2) {
notify(player,
"An attribute with that name already exists.");
free_sbuf(buff);
return;
}
if (vattr_rename(va->name, value) == NULL)
notify(player, "Attribute rename failed.");
else
notify(player, "Attribute renamed.");
break;
case ATTRIB_DELETE:
/*
* Remove the attribute
*/
vattr_delete(buff);
notify(player, "Attribute deleted.");
break;
}
free_sbuf(buff);
return;
}
/*
* ---------------------------------------------------------------------------
* * do_fixdb: Directly edit database fields
*/
void do_fixdb(player, cause, key, arg1, arg2)
dbref player, cause;
int key;
char *arg1, *arg2;
{
dbref thing, res;
init_match(player, arg1, NOTYPE);
match_everything(0);
thing = noisy_match_result();
if (thing == NOTHING)
return;
res = NOTHING;
switch (key) {
case FIXDB_OWNER:
case FIXDB_LOC:
case FIXDB_CON:
case FIXDB_EXITS:
case FIXDB_NEXT:
init_match(player, arg2, NOTYPE);
match_everything(0);
res = noisy_match_result();
break;
case FIXDB_PENNIES:
res = atoi(arg2);
break;
}
switch (key) {
case FIXDB_OWNER:
s_Owner(thing, res);
if (!Quiet(player))
notify(player, tprintf("Owner set to #%d", res));
break;
case FIXDB_LOC:
s_Location(thing, res);
if (!Quiet(player))
notify(player, tprintf("Location set to #%d", res));
break;
case FIXDB_CON:
s_Contents(thing, res);
if (!Quiet(player))
notify(player, tprintf("Contents set to #%d", res));
break;
case FIXDB_EXITS:
s_Exits(thing, res);
if (!Quiet(player))
notify(player, tprintf("Exits set to #%d", res));
break;
case FIXDB_NEXT:
s_Next(thing, res);
if (!Quiet(player))
notify(player, tprintf("Next set to #%d", res));
break;
case FIXDB_PENNIES:
s_Pennies(thing, res);
if (!Quiet(player))
notify(player, tprintf("Pennies set to %d", res));
break;
case FIXDB_NAME:
if (Typeof(thing) == TYPE_PLAYER) {
if (!ok_player_name(arg2)) {
notify(player,
"That's not a good name for a player.");
return;
}
if (lookup_player(NOTHING, arg2, 0) != NOTHING) {
notify(player,
"That name is already in use.");
return;
}
STARTLOG(LOG_SECURITY, "SEC", "CNAME")
log_name(thing),
log_text((char *)" renamed to ");
log_text(arg2);
ENDLOG
if (Suspect(player)) {
raw_broadcast(WIZARD,
"[Suspect] %s renamed to %s",
Name(thing), arg2);
}
delete_player_name(thing, Name(thing));
s_Name(thing, arg2);
add_player_name(thing, arg2);
} else {
if (!ok_name(arg2)) {
notify(player,
"Warning: That is not a reasonable name.");
}
s_Name(thing, arg2);
}
if (!Quiet(player))
notify(player, tprintf("Name set to %s", arg2));
break;
}
}
/*
* ---------------------------------------------------------------------------
* * init_attrtab: Initialize the attribute hash tables.
*/
void NDECL(init_attrtab)
{
ATTR *a;
char *buff, *p, *q;
hashinit(&mudstate.attr_name_htab, 100 * HASH_FACTOR);
buff = alloc_sbuf("init_attrtab");
for (a = attr; a->number; a++) {
anum_extend(a->number);
anum_set(a->number, a);
for (p = buff, q = (char *)a->name; *q; p++, q++)
*p = ToLower(*q);
*p = '\0';
hashadd(buff, (int *)a, &mudstate.attr_name_htab);
}
free_sbuf(buff);
}
/*
* ---------------------------------------------------------------------------
* * atr_str: Look up an attribute by name.
*/
ATTR *atr_str(s)
char *s;
{
char *buff, *p, *q;
ATTR *a;
VATTR *va;
static ATTR tattr;
/*
* Convert the buffer name to lowercase
*/
buff = alloc_sbuf("atr_str");
for (p = buff, q = s; *q && ((p - buff) < (SBUF_SIZE - 1)); p++, q++)
*p = ToLower(*q);
*p = '\0';
/*
* Look for a predefined attribute
*/
a = (ATTR *) hashfind(buff, &mudstate.attr_name_htab);
if (a != NULL) {
free_sbuf(buff);
return a;
}
/*
* Nope, look for a user attribute
*/
va = (VATTR *) vattr_find(buff);
free_sbuf(buff);
/*
* If we got one, load tattr and return a pointer to it.
*/
if (va != NULL) {
tattr.name = va->name;
tattr.number = va->number;
tattr.flags = va->flags;
tattr.check = NULL;
return &tattr;
}
/*
* All failed, return NULL
*/
return NULL;
}
#else /*
* * STANDALONE
*/
/*
* We don't have the hash tables, do it by hand
*/
/*
* ---------------------------------------------------------------------------
* * atr_str: Look up an attribute by name.
*/
ATTR *atr_str(s)
char *s;
{
ATTR *ap;
VATTR *va;
static ATTR tattr;
/*
* Check for an exact match on a predefined attribute
*/
for (ap = attr; ap->name; ap++) {
if (!string_compare(ap->name, s))
return ap;
}
/*
* Check for an exact match on a user-named attribute
*/
va = (VATTR *) vattr_find(s);
if (va != NULL) {
/*
* Got it
*/
tattr.name = va->name;
tattr.number = va->number;
tattr.flags = va->flags;
tattr.check = NULL;
return &tattr;
}
/*
* No exact match, try for a prefix match on predefined attribs. * *
* * * * * Check for both longer versions and shorter versions.
*/
for (ap = attr; ap->name; ap++) {
if (string_prefix(s, ap->name))
return ap;
if (string_prefix(ap->name, s))
return ap;
}
return NULL;
}
#endif /*
* * STANDALONE
*/
/*
* ---------------------------------------------------------------------------
* * anum_extend: Grow the attr num lookup table.
*/
ATTR **anum_table = NULL;
int anum_alc_top = 0;
void anum_extend(newtop)
int newtop;
{
ATTR **anum_table2;
int delta, i;
#ifndef STANDALONE
delta = mudconf.init_size;
#else
delta = 1000;
#endif
if (newtop <= anum_alc_top)
return;
if (newtop < anum_alc_top + delta)
newtop = anum_alc_top + delta;
if (anum_table == NULL) {
anum_table = (ATTR **) malloc((newtop + 1) * sizeof(ATTR *));
for (i = 0; i <= newtop; i++)
anum_table[i] = NULL;
} else {
anum_table2 = (ATTR **) malloc((newtop + 1) * sizeof(ATTR *));
for (i = 0; i <= anum_alc_top; i++)
anum_table2[i] = anum_table[i];
for (i = anum_alc_top + 1; i <= newtop; i++)
anum_table2[i] = NULL;
free((char *)anum_table);
anum_table = anum_table2;
}
anum_alc_top = newtop;
}
/*
* ---------------------------------------------------------------------------
* * atr_num: Look up an attribute by number.
*/
ATTR *atr_num(anum)
int anum;
{
VATTR *va;
static ATTR tattr;
/*
* Look for a predefined attribute
*/
if (anum < A_USER_START)
return anum_get(anum);
if (anum >= anum_alc_top)
return NULL;
/*
* It's a user-defined attribute, we need to copy data
*/
va = (VATTR *) anum_get(anum);
if (va != NULL) {
tattr.name = va->name;
tattr.number = va->number;
tattr.flags = va->flags;
tattr.check = NULL;
return &tattr;
}
/*
* All failed, return NULL
*/
return NULL;
}
/*
* ---------------------------------------------------------------------------
* * mkattr: Lookup attribute by name, creating if needed.
*/
int mkattr(buff)
char *buff;
{
ATTR *ap;
VATTR *va;
if (!(ap = atr_str(buff))) {
/*
* Unknown attr, create a new one
*/
va = vattr_alloc(buff, mudconf.vattr_flags);
if (!va || !(va->number))
return -1;
return va->number;
}
if (!(ap->number))
return -1;
return ap->number;
}
/*
* ---------------------------------------------------------------------------
* * al_decode: Fetch an attribute number from an alist.
*/
static int al_decode(app)
char **app;
{
int atrnum = 0, anum, atrshft = 0;
char *ap;
ap = *app;
for (;;) {
anum = ((*ap) & 0x7f);
if (atrshft > 0)
atrnum += (anum << atrshft);
else
atrnum = anum;
if (!(*ap++ & 0x80)) {
*app = ap;
return atrnum;
}
atrshft += 7;
}
/*
* NOTREACHED
*/
}
/*
* ---------------------------------------------------------------------------
* * al_code: Store an attribute number in an alist.
*/
static void al_code(app, atrnum)
char **app;
int atrnum;
{
char *ap;
ap = *app;
for (;;) {
*ap = atrnum & 0x7f;
atrnum = atrnum >> 7;
if (!atrnum) {
*app = ++ap;
return;
}
*ap++ |= 0x80;
}
}
/*
* ---------------------------------------------------------------------------
* * Commer: check if an object has any $-commands in its attributes.
*/
int Commer(thing)
dbref thing;
{
char *s, *as, c;
int attr, aflags;
dbref aowner;
ATTR *ap;
atr_push();
for (attr = atr_head(thing, &as); attr; attr = atr_next(&as)) {
ap = atr_num(attr);
if (!ap || (ap->flags & AF_NOPROG))
continue;
s = atr_get(thing, attr, &aowner, &aflags);
c = *s;
free_lbuf(s);
if ((c == '$') && !(aflags & AF_NOPROG)) {
atr_pop();
return 1;
}
}
atr_pop();
return 0;
}
/*
* routines to handle object attribute lists
*/
#ifndef MEMORY_BASED
/*
* ---------------------------------------------------------------------------
* * al_size, al_fetch, al_store, al_add, al_delete: Manipulate attribute lists
*/
/*
* al_extend: Get more space for attributes, if needed
*/
void al_extend(buffer, bufsiz, len, copy)
char **buffer;
int *bufsiz, len, copy;
{
char *tbuff;
if (len > *bufsiz) {
*bufsiz = len + ATR_BUF_CHUNK;
tbuff = XMALLOC(*bufsiz, "al_extend");
if (*buffer) {
if (copy)
bcopy(*buffer, tbuff, *bufsiz);
XFREE(*buffer, "al_extend");
}
*buffer = tbuff;
}
}
/*
* al_size: Return length of attribute list in chars
*/
int al_size(astr)
char *astr;
{
if (!astr)
return 0;
return (strlen(astr) + 1);
}
/*
* al_store: Write modified attribute list
*/
void NDECL(al_store)
{
if (mudstate.mod_al_id != NOTHING) {
if (mudstate.mod_alist && *mudstate.mod_alist) {
atr_add_raw(mudstate.mod_al_id, A_LIST,
mudstate.mod_alist);
} else {
atr_clr(mudstate.mod_al_id, A_LIST);
}
}
mudstate.mod_al_id = NOTHING;
}
/*
* al_fetch: Load attribute list
*/
char *al_fetch(thing)
dbref thing;
{
char *astr;
int len;
/*
* We only need fetch if we change things
*/
if (mudstate.mod_al_id == thing)
return mudstate.mod_alist;
/*
* Save old list, then fetch and set up the attribute list
*/
al_store();
astr = atr_get_raw(thing, A_LIST);
if (astr) {
len = al_size(astr);
al_extend(&mudstate.mod_alist, &mudstate.mod_size, len, 0);
bcopy((char *)astr, (char *)mudstate.mod_alist, len);
} else {
al_extend(&mudstate.mod_alist, &mudstate.mod_size, 1, 0);
*mudstate.mod_alist = '\0';
}
mudstate.mod_al_id = thing;
return mudstate.mod_alist;
}
/*
* al_add: Add an attribute to an attribute list
*/
void al_add(thing, attrnum)
dbref thing;
int attrnum;
{
char *abuf, *cp;
int anum;
/*
* If trying to modify List attrib, return. Otherwise, get the * * *
*
* * * * * * attribute list.
*/
if (attrnum == A_LIST)
return;
abuf = al_fetch(thing);
/*
* See if attr is in the list. If so, exit (need not do anything)
*/
cp = abuf;
while (*cp) {
anum = al_decode(&cp);
if (anum == attrnum)
return;
}
/*
* Nope, extend it
*/
al_extend(&mudstate.mod_alist, &mudstate.mod_size,
(cp - abuf + ATR_BUF_INCR), 1);
if (mudstate.mod_alist != abuf) {
/*
* extend returned different buffer, re-find the end
*/
abuf = mudstate.mod_alist;
for (cp = abuf; *cp; anum = al_decode(&cp)) ;
}
/*
* Add the new attribute on to the end
*/
al_code(&cp, attrnum);
*cp = '\0';
return;
}
/*
* al_delete: Remove an attribute from an attribute list
*/
void al_delete(thing, attrnum)
dbref thing;
int attrnum;
{
int anum;
char *abuf, *cp, *dp;
/*
* If trying to modify List attrib, return. Otherwise, get the * * *
*
* * * * * * attribute list.
*/
if (attrnum == A_LIST)
return;
abuf = al_fetch(thing);
if (!abuf)
return;
cp = abuf;
while (*cp) {
dp = cp;
anum = al_decode(&cp);
if (anum == attrnum) {
while (*cp) {
anum = al_decode(&cp);
al_code(&dp, anum);
}
*dp = '\0';
return;
}
}
return;
}
INLINE static void makekey(thing, atr, abuff)
dbref thing;
int atr;
Aname *abuff;
{
abuff->object = thing;
abuff->attrnum = atr;
return;
}
/*
* ---------------------------------------------------------------------------
* * al_destroy: wipe out an object's attribute list.
*/
void al_destroy(thing)
dbref thing;
{
if (mudstate.mod_al_id == thing)
al_store(); /*
* remove from cache
*/
atr_clr(thing, A_LIST);
}
#endif /*
* * MEMORY_BASED
*/
/*
* ---------------------------------------------------------------------------
* * atr_encode: Encode an attribute string.
*/
static char *atr_encode(iattr, thing, owner, flags, atr)
char *iattr;
dbref thing, owner;
int flags, atr;
{
/*
* If using the default owner and flags (almost all attributes will),
* * * * * * * just store the string.
*/
if (((owner == Owner(thing)) || (owner == NOTHING)) && !flags)
return iattr;
/*
* Encode owner and flags into the attribute text
*/
if (owner == NOTHING)
owner = Owner(thing);
return tprintf("%c%d:%d:%s", ATR_INFO_CHAR, owner, flags, iattr);
}
#ifdef RADIX_COMPRESSION
/*
* ---------------------------------------------------------------------------
* * atr_get_raw_decode: Get an attribute string out of the DB, decompress and
* * decode it in one shot. Since the decompression involves a copy, and we
* * normally do decode/copy immediately after fetching the attribute, this is
* * used to roll the two operations together.
*/
static int atr_get_raw_decode(thing, oattr, owner, flags, atr)
dbref thing;
char *oattr;
dbref *owner;
int *flags, atr;
{
Attr *a;
char *cp;
int neg;
int len;
#ifdef MEMORY_BASED
a = (char *)atr_get_raw(thing, atr);
#else
Aname okey;
if (atr == A_LIST) { /*
* This is not supposed to be compressed!
*/
abort();
}
makekey(thing, atr, &okey);
a = FETCH(&okey);
#endif /*
* * MEMORY_BASED
*/
if (!a) {
*owner = Owner(thing);
*flags = 0;
if (oattr) {
*oattr = '\0';
}
return 0;
}
#ifndef MEMORY_BASED
/*
* We now have a compressed attribute, decompress it into oattr
*/
/*
* and decode it.
*/
if (oattr == NULL) {
len = string_decompress(a, decomp_buff);
cp = decomp_buff;
} else {
len = string_decompress(a, oattr);
cp = oattr;
}
#else
/*
* Already uncompressed
*/
if (oattr == NULL) {
len = strlen(a) + 1;
StringCopy(decomp_buff, a);
cp = decomp_buff;
} else {
len = strlen(a) + 1;
StringCopy(oattr, a);
cp = oattr;
}
#endif /*
* * MEMORY_BASED
*/
if (*cp == ATR_INFO_CHAR) {
/*
* Get the attribute owner
*/
cp++; /*
* Skip magic character
*/
*owner = 0;
neg = 0;
if (*cp == '-') {
neg = 1;
cp++;
}
while (isdigit(*cp)) {
*owner = (*owner * 10) + (*cp++ - '0');
}
if (neg)
*owner = 0 - *owner;
/*
* If delimiter is not ':', just return attribute
*/
if (*cp++ != ':') {
*owner = Owner(thing);
*flags = 0;
return 1;
}
/*
* Get the attribute flags
*/
*flags = 0;
while (isdigit(*cp)) {
*flags = (*flags * 10) + (*cp++ - '0');
}
/*
* If delimiter is not ':', just return attribute
*/
if (*cp++ != ':') {
*owner = Owner(thing);
*flags = 0;
return 1;
}
/*
* Get the attribute text
*/
if (oattr != NULL)
bcopy(cp, oattr, len - (cp - oattr));
if (*owner == NOTHING)
*owner = Owner(thing);
} else {
/*
* Not the special character, return normal info
*/
*owner = Owner(thing);
*flags = 0;
}
return 1;
}
#endif /*
* * RADIX_COMPRESSION
*/
/*
* ---------------------------------------------------------------------------
* * atr_decode: Decode an attribute string.
*/
static void atr_decode(iattr, oattr, thing, owner, flags, atr)
char *iattr, *oattr;
dbref thing, *owner;
int *flags, atr;
{
char *cp;
int neg;
/*
* See if the first char of the attribute is the special character
*/
if (*iattr == ATR_INFO_CHAR) {
/*
* It is, crack the attr apart
*/
cp = &iattr[1];
/*
* Get the attribute owner
*/
*owner = 0;
neg = 0;
if (*cp == '-') {
neg = 1;
cp++;
}
while (isdigit(*cp)) {
*owner = (*owner * 10) + (*cp++ - '0');
}
if (neg)
*owner = 0 - *owner;
/*
* If delimiter is not ':', just return attribute
*/
if (*cp++ != ':') {
*owner = Owner(thing);
*flags = 0;
if (oattr) {
StringCopy(oattr, iattr);
}
return;
}
/*
* Get the attribute flags
*/
*flags = 0;
while (isdigit(*cp)) {
*flags = (*flags * 10) + (*cp++ - '0');
}
/*
* If delimiter is not ':', just return attribute
*/
if (*cp++ != ':') {
*owner = Owner(thing);
*flags = 0;
if (oattr) {
StringCopy(oattr, iattr);
}
}
/*
* Get the attribute text
*/
if (oattr) {
StringCopy(oattr, cp);
}
if (*owner == NOTHING)
*owner = Owner(thing);
} else {
/*
* Not the special character, return normal info
*/
*owner = Owner(thing);
*flags = 0;
if (oattr) {
StringCopy(oattr, iattr);
}
}
}
/*
* ---------------------------------------------------------------------------
* * atr_clr: clear an attribute in the list.
*/
void atr_clr(thing, atr)
dbref thing;
int atr;
{
#ifdef MEMORY_BASED
ATRLIST *list;
int hi, lo, mid;
if (!db[thing].at_count || !db[thing].ahead)
return;
if (db[thing].at_count < 0)
abort();
/*
* Binary search for the attribute.
*/
lo = 0;
hi = db[thing].at_count - 1;
list = db[thing].ahead;
while (lo <= hi) {
mid = ((hi - lo) >> 1) + lo;
if (list[mid].number == atr) {
free(list[mid].data);
db[thing].at_count -= 1;
if (mid != db[thing].at_count)
bcopy((char *)(list + mid + 1), (char *)(list + mid),
(db[thing].at_count - mid) * sizeof(ATRLIST));
break;
} else if (list[mid].number > atr) {
hi = mid - 1;
} else {
lo = mid + 1;
}
}
#else
Aname okey;
makekey(thing, atr, &okey);
DELETE(&okey);
al_delete(thing, atr);
#endif /*
* * MEMORY_BASED
*/
switch (atr) {
case A_STARTUP:
s_Flags(thing, Flags(thing) & ~HAS_STARTUP);
break;
case A_DAILY:
s_Flags(thing, Flags(thing) & ~HAS_DAILY);
break;
case A_FORWARDLIST:
s_Flags2(thing, Flags2(thing) & ~HAS_FWDLIST);
break;
case A_LISTEN:
s_Flags2(thing, Flags2(thing) & ~HAS_LISTEN);
break;
#ifndef STANDALONE
case A_TIMEOUT:
desc_reload(thing);
break;
case A_QUEUEMAX:
pcache_reload(thing);
break;
#endif
}
}
/*
* ---------------------------------------------------------------------------
* * atr_add_raw, atr_add: add attribute of type atr to list
*/
void atr_add_raw(thing, atr, buff)
dbref thing;
int atr;
char *buff;
{
#ifdef MEMORY_BASED
ATRLIST *list;
char *text;
int found = 0;
int hi, lo, mid;
#ifdef RADIX_COMPRESSION
int len;
#endif /*
* * RADIX_COMPRESSION
*/
if (!buff || !*buff) {
atr_clr(thing, atr);
return;
}
if (strlen(buff) >= LBUF_SIZE) {
buff[LBUF_SIZE-1] = '\0';
}
#ifdef RADIX_COMPRESSION
len = string_compress(buff, compress_buff);
if ((text = (char *)malloc(len)) == NULL) {
return;
}
bcopy(compress_buff, text, len);
#else
if ((text = (char *)malloc(strlen(buff) + 1)) == NULL) {
return;
}
StringCopy(text, buff);
#endif
if (!db[thing].ahead) {
if ((list = (ATRLIST *) malloc(sizeof(ATRLIST))) == NULL) {
free(text);
return;
}
db[thing].ahead = list;
db[thing].at_count = 1;
list[0].number = atr;
list[0].data = text;
#ifdef RADIX_COMPRESSION
list[0].size = len;
#else
list[0].size = strlen(text) + 1;
#endif /*
* * RADIX_COMPRESSION
*/
found = 1;
} else {
/*
* Binary search for the attribute
*/
lo = 0;
hi = db[thing].at_count - 1;
list = db[thing].ahead;
while (lo <= hi) {
mid = ((hi - lo) >> 1) + lo;
if (list[mid].number == atr) {
free(list[mid].data);
list[mid].data = text;
#ifdef RADIX_COMPRESSION
list[mid].size = len;
#else
list[mid].size = strlen(text) + 1;
#endif /*
* * RADIX_COMPRESSION
*/
found = 1;
break;
} else if (list[mid].number > atr) {
hi = mid - 1;
} else {
lo = mid + 1;
}
}
if (!found) {
/*
* If we got here, we didn't find it, so lo = hi + 1,
*
* * * * * * * * * * and the * attribute should
* be * inserted * * between * * them.
*/
list = (ATRLIST *) realloc(db[thing].ahead, (db[thing].at_count + 1) * sizeof(ATRLIST));
if (!list)
return;
/*
* Move the stuff upwards one slot
*/
if (lo < db[thing].at_count)
bcopy((char *)(list + lo), (char *)(list + lo + 1),
(db[thing].at_count - lo) * sizeof(ATRLIST));
list[lo].data = text;
list[lo].number = atr;
#ifdef RADIX_COMPRESSION
list[lo].size = len;
#else
list[lo].size = strlen(text) + 1;
#endif /*
* * RADIX_COMPRESSION
*/
db[thing].at_count++;
db[thing].ahead = list;
}
}
#else
Attr *a;
Aname okey;
#ifdef RADIX_COMPRESSION
int len;
#endif
makekey(thing, atr, &okey);
if (!buff || !*buff) {
DELETE(&okey);
al_delete(thing, atr);
return;
}
#ifdef RADIX_COMPRESSION
/*
* A_LIST is never compressed
*/
if (atr == A_LIST) {
if (!(a = (Attr *) XMALLOC(strlen(buff) + 1, "atr_add_raw"))) {
return;
}
strcpy(a, buff);
len = strlen(a) + 1;
} else {
/*
* It's not an A_LIST, so compress it into a buffer and store
*
* * * * * * * * * * that
*/
len = string_compress(buff, compress_buff);
if (!(a = (Attr *) XMALLOC(len, "atr_add_raw"))) {
return;
}
bcopy(compress_buff, a, len);
al_add(thing, atr);
}
STORE(&okey, a, len);
#else /*
* * Not RADIX_COMPRESSION
*/
if ((a = (Attr *) malloc(strlen(buff) + 1)) == (char *)0) {
return;
}
StringCopy(a, buff);
STORE(&okey, a);
al_add(thing, atr);
#endif /*
* * RADIX_COMPRESSION
*/
#endif /*
* * MEMORY_BASED
*/
switch (atr) {
case A_STARTUP:
s_Flags(thing, Flags(thing) | HAS_STARTUP);
break;
case A_DAILY:
s_Flags(thing, Flags(thing) | HAS_DAILY);
break;
case A_FORWARDLIST:
s_Flags2(thing, Flags2(thing) | HAS_FWDLIST);
break;
case A_LISTEN:
s_Flags2(thing, Flags2(thing) | HAS_LISTEN);
break;
#ifndef STANDALONE
case A_TIMEOUT:
desc_reload(thing);
break;
case A_QUEUEMAX:
pcache_reload(thing);
break;
#endif
}
}
void atr_add(thing, atr, buff, owner, flags)
dbref thing, owner;
int atr, flags;
char *buff;
{
char *tbuff;
if (!buff || !*buff) {
atr_clr(thing, atr);
} else {
tbuff = atr_encode(buff, thing, owner, flags, atr);
atr_add_raw(thing, atr, tbuff);
}
}
void atr_set_owner(thing, atr, owner)
dbref thing, owner;
int atr;
{
dbref aowner;
int aflags;
char *buff;
buff = atr_get(thing, atr, &aowner, &aflags);
atr_add(thing, atr, buff, owner, aflags);
free_lbuf(buff);
}
void atr_set_flags(thing, atr, flags)
dbref thing, flags;
int atr;
{
dbref aowner;
int aflags;
char *buff;
buff = atr_get(thing, atr, &aowner, &aflags);
atr_add(thing, atr, buff, aowner, flags);
free_lbuf(buff);
}
/*
* ---------------------------------------------------------------------------
* * get_atr,atr_get_raw, atr_get_str, atr_get: Get an attribute from the database.
*/
int get_atr(name)
char *name;
{
ATTR *ap;
if (!(ap = atr_str(name)))
return 0;
if (!(ap->number))
return -1;
return ap->number;
}
#ifdef MEMORY_BASED
char *atr_get_raw(thing, atr)
dbref thing;
int atr;
{
int lo, mid, hi;
ATRLIST *list;
char *text;
if (thing < 0)
return NULL;
/*
* Binary search for the attribute
*/
lo = 0;
hi = db[thing].at_count - 1;
list = db[thing].ahead;
if (!list)
return NULL;
while (lo <= hi) {
mid = ((hi - lo) >> 1) + lo;
if (list[mid].number == atr) {
#ifdef RADIX_COMPRESSION
(void)string_decompress(list[mid].data, decomp_buff);
return decomp_buff;
#else
return list[mid].data;
#endif /*
* * RADIX_COMPRESSION
*/
} else if (list[mid].number > atr) {
hi = mid - 1;
} else {
lo = mid + 1;
}
}
return NULL;
}
#else
char *atr_get_raw(thing, atr)
dbref thing;
int atr;
{
Attr *a;
Aname okey;
makekey(thing, atr, &okey);
a = FETCH(&okey);
#ifdef RADIX_COMPRESSION
if (!a || atr == A_LIST) {
return a;
}
(void)string_decompress(a, decomp_buff);
return decomp_buff;
#else
return a;
#endif /*
* * RADIX_COMPRESSION
*/
}
#endif /*
* * MEMORY_BASED
*/
char *atr_get_str(s, thing, atr, owner, flags)
char *s;
dbref thing, *owner;
int atr, *flags;
{
#ifdef RADIX_COMPRESSION
(void)atr_get_raw_decode(thing, s, owner, flags, atr);
#else
char *buff;
buff = atr_get_raw(thing, atr);
if (!buff) {
*owner = Owner(thing);
*flags = 0;
*s = '\0';
} else {
atr_decode(buff, s, thing, owner, flags, atr);
}
#endif /*
* * RADIX_COMPRESSION
*/
return s;
}
char *atr_get(thing, atr, owner, flags)
dbref thing, *owner;
int atr, *flags;
{
char *buff;
buff = alloc_lbuf("atr_get");
return atr_get_str(buff, thing, atr, owner, flags);
}
int atr_get_info(thing, atr, owner, flags)
dbref thing, *owner;
int atr, *flags;
{
#ifdef RADIX_COMPRESSION
int retval;
retval = atr_get_raw_decode(thing, NULL, owner, flags, atr);
return retval;
#else
char *buff;
buff = atr_get_raw(thing, atr);
if (!buff) {
*owner = Owner(thing);
*flags = 0;
return 0;
}
atr_decode(buff, NULL, thing, owner, flags, atr);
return 1;
#endif /*
* * RADIX_COMPRESSION
*/
}
#ifndef STANDALONE
char *atr_pget_str(s, thing, atr, owner, flags)
char *s;
dbref thing, *owner;
int atr, *flags;
{
char *buff;
dbref parent;
int lev;
#ifdef RADIX_COMPRESSION
int retval;
#endif /*
* * RADIX_COMPRESSION
*/
ATTR *ap;
ITER_PARENTS(thing, parent, lev) {
#ifdef RADIX_COMPRESSION
retval = atr_get_raw_decode(parent, s, owner, flags, atr);
if (retval && ((lev = 0) || !(*flags & AF_PRIVATE))) {
return s;
}
#else
buff = atr_get_raw(parent, atr);
if (buff && *buff) {
atr_decode(buff, s, thing, owner, flags, atr);
if ((lev == 0) || !(*flags & AF_PRIVATE))
return s;
}
#endif /*
* * RADIX_COMPRESSION
*/
if ((lev == 0) && Good_obj(Parent(parent))) {
ap = atr_num(atr);
if (!ap || ap->flags & AF_PRIVATE)
break;
}
}
*owner = Owner(thing);
*flags = 0;
*s = '\0';
return s;
}
char *atr_pget(thing, atr, owner, flags)
dbref thing, *owner;
int atr, *flags;
{
char *buff;
buff = alloc_lbuf("atr_pget");
return atr_pget_str(buff, thing, atr, owner, flags);
}
int atr_pget_info(thing, atr, owner, flags)
dbref thing, *owner;
int atr, *flags;
{
char *buff;
dbref parent;
int lev;
ATTR *ap;
ITER_PARENTS(thing, parent, lev) {
buff = atr_get_raw(parent, atr);
if (buff && *buff) {
atr_decode(buff, NULL, thing, owner, flags, atr);
if ((lev == 0) || !(*flags & AF_PRIVATE))
return 1;
}
if ((lev == 0) && Good_obj(Parent(parent))) {
ap = atr_num(atr);
if (!ap || ap->flags & AF_PRIVATE)
break;
}
}
*owner = Owner(thing);
*flags = 0;
return 0;
}
#endif /*
* * STANDALONE
*/
/*
* ---------------------------------------------------------------------------
* * atr_free: Return all attributes of an object.
*/
void atr_free(thing)
dbref thing;
{
int attr;
char *as;
#ifndef MEMORY_BASED
atr_push();
for (attr = atr_head(thing, &as); attr; attr = atr_next(&as)) {
atr_clr(thing, attr);
}
atr_pop();
al_destroy(thing); /*
* Just to be on the safe side
*/
#else
free(db[thing].ahead);
db[thing].ahead = NULL;
#endif /*
* * MEMORY_BASED
*/
}
/*
* garbage collect an attribute list
*/
void atr_collect(thing)
dbref thing;
{
/*
* Nada. gdbm takes care of us. I hope ;-)
*/
}
/*
* ---------------------------------------------------------------------------
* * atr_cpy: Copy all attributes from one object to another. Takes the
* * player argument to ensure that only attributes that COULD be set by
* * the player are copied.
*/
void atr_cpy(player, dest, source)
dbref player, dest, source;
{
int attr, aflags;
dbref owner, aowner;
char *as, *buf;
ATTR *at;
owner = Owner(dest);
atr_push();
for (attr = atr_head(source, &as); attr; attr = atr_next(&as)) {
buf = atr_get(source, attr, &aowner, &aflags);
if (!(aflags & AF_LOCK))
aowner = owner; /*
* chg owner
*/
at = atr_num(attr);
if (attr && at) {
if (Write_attr(owner, dest, at, aflags))
/*
* Only set attrs that owner has perm to set
*/
atr_add(dest, attr, buf, aowner, aflags);
}
free_lbuf(buf);
}
atr_pop();
}
/*
* ---------------------------------------------------------------------------
* * atr_chown: Change the ownership of the attributes of an object to the
* * current owner if they are not locked.
*/
void atr_chown(obj)
dbref obj;
{
int attr, aflags;
dbref owner, aowner;
char *as, *buf;
owner = Owner(obj);
atr_push();
for (attr = atr_head(obj, &as); attr; attr = atr_next(&as)) {
buf = atr_get(obj, attr, &aowner, &aflags);
if ((aowner != owner) && !(aflags & AF_LOCK))
atr_add(obj, attr, buf, owner, aflags);
free_lbuf(buf);
}
atr_pop();
}
/*
* ---------------------------------------------------------------------------
* * atr_next: Return next attribute in attribute list.
*/
int atr_next(attrp)
char **attrp;
{
#ifdef MEMORY_BASED
ATRLIST *list;
ATRCOUNT *atr;
if (!attrp || !*attrp) {
return 0;
} else {
atr = (ATRCOUNT *) * attrp;
if (atr->count > db[atr->thing].at_count) {
free(atr);
return 0;
}
atr->count++;
return db[atr->thing].ahead[atr->count - 2].number;
}
#else
if (!*attrp || !**attrp) {
return 0;
} else {
return al_decode(attrp);
}
#endif /*
* * MEMORY_BASED
*/
}
/*
* ---------------------------------------------------------------------------
* * atr_push, atr_pop: Push and pop attr lists.
*/
void NDECL(atr_push)
{
#ifndef MEMORY_BASED
ALIST *new_alist;
new_alist = (ALIST *) alloc_sbuf("atr_push");
new_alist->data = mudstate.iter_alist.data;
new_alist->len = mudstate.iter_alist.len;
new_alist->next = mudstate.iter_alist.next;
mudstate.iter_alist.data = NULL;
mudstate.iter_alist.len = 0;
mudstate.iter_alist.next = new_alist;
return;
#endif /*
* * MEMORY_BASED
*/
}
void NDECL(atr_pop)
{
#ifndef MEMORY_BASED
ALIST *old_alist;
char *cp;
old_alist = mudstate.iter_alist.next;
if (mudstate.iter_alist.data) {
free(mudstate.iter_alist.data);
}
if (old_alist) {
mudstate.iter_alist.data = old_alist->data;
mudstate.iter_alist.len = old_alist->len;
mudstate.iter_alist.next = old_alist->next;
cp = (char *)old_alist;
free_sbuf(cp);
} else {
mudstate.iter_alist.data = NULL;
mudstate.iter_alist.len = 0;
mudstate.iter_alist.next = NULL;
}
return;
#endif /*
* * MEMORY_BASED
*/
}
/*
* ---------------------------------------------------------------------------
* * atr_head: Returns the head of the attr list for object 'thing'
*/
int atr_head(thing, attrp)
dbref thing;
char **attrp;
{
#ifdef MEMORY_BASED
ATRCOUNT *atr;
if (db[thing].at_count) {
atr = (ATRCOUNT *) malloc(sizeof(ATRCOUNT));
atr->thing = thing;
atr->count = 2;
*attrp = (char *)atr;
return db[thing].ahead[0].number;
}
return 0;
#else
char *astr;
int alen;
/*
* Get attribute list. Save a read if it is in the modify atr list
*/
if (thing == mudstate.mod_al_id) {
astr = mudstate.mod_alist;
} else {
astr = atr_get_raw(thing, A_LIST);
}
alen = al_size(astr);
/*
* If no list, return nothing
*/
if (!alen)
return 0;
/*
* Set up the list and return the first entry
*/
al_extend(&mudstate.iter_alist.data, &mudstate.iter_alist.len,
alen, 0);
bcopy((char *)astr, (char *)mudstate.iter_alist.data, alen);
*attrp = mudstate.iter_alist.data;
return atr_next(attrp);
#endif /*
* * MEMORY_BASED
*/
}
/*
* ---------------------------------------------------------------------------
* * db_grow: Extend the struct database.
*/
#define SIZE_HACK 1 /*
* * So mistaken refs to #-1 won't die.
*/
void initialize_objects(first, last)
dbref first, last;
{
dbref thing;
for (thing = first; thing < last; thing++) {
s_Owner(thing, GOD);
s_Flags(thing, (TYPE_GARBAGE | GOING));
s_Powers(thing, 0);
s_Powers2(thing, 0);
s_Location(thing, NOTHING);
s_Contents(thing, NOTHING);
s_Exits(thing, NOTHING);
s_Link(thing, NOTHING);
s_Next(thing, NOTHING);
s_Pennies(thing, NOTHING);
s_Zone(thing, NOTHING);
s_Parent(thing, NOTHING);
s_Pennies(thing, 0);
s_Stack(thing, NULL);
s_StackSize(thing, 0);
#ifdef MEMORY_BASED
db[thing].ahead = NULL;
db[thing].at_count = 0;
#endif /*
* * MEMORY_BASED
*/
}
}
void db_grow(newtop)
dbref newtop;
{
int newsize, marksize, delta, i;
MARKBUF *newmarkbuf;
OBJ *newdb;
NAME *newnames;
char *cp;
#ifndef STANDALONE
delta = mudconf.init_size;
#else
delta = 1000;
#endif
/*
* Determine what to do based on requested size, current top and * *
*
* * * * * * * * size. Make sure we grow in reasonable-sized
* chunks to * * prevent * * * * frequent reallocations of the db
* array.
*/
/*
* If requested size is smaller than the current db size, ignore it
*/
if (newtop <= mudstate.db_top) {
return;
}
/*
* If requested size is greater than the current db size but smaller
* * * * * * * than the amount of space we have allocated, raise the
* db * * * size * * and * initialize the new area.
*/
if (newtop <= mudstate.db_size) {
for (i = mudstate.db_top; i < newtop; i++) {
if (mudconf.cache_names)
i_Name(i);
}
initialize_objects(mudstate.db_top, newtop);
mudstate.db_top = newtop;
return;
}
/*
* Grow by a minimum of delta objects
*/
if (newtop <= mudstate.db_size + delta) {
newsize = mudstate.db_size + delta;
} else {
newsize = newtop;
}
/*
* Enforce minimumdatabase size
*/
if (newsize < mudstate.min_size)
newsize = mudstate.min_size + delta;;
/*
* Grow the name table
*/
if (mudconf.cache_names) {
newnames = (NAME *) XMALLOC((newsize + SIZE_HACK) * sizeof(NAME),
"db_grow.names");
if (!newnames) {
LOG_SIMPLE(LOG_ALWAYS, "ALC", "DB",
tprintf("Could not allocate space for %d item name cache.",
newsize));
abort();
}
bzero((char *)newnames, (newsize + SIZE_HACK) * sizeof(NAME));
if (names) {
/*
* An old name cache exists. Copy it.
*/
names -= SIZE_HACK;
bcopy((char *)names, (char *)newnames,
(newtop + SIZE_HACK) * sizeof(NAME));
cp = (char *)names;
XFREE(cp, "db_grow.name");
} else {
/*
* Creating a brand new struct database. Fill in the
* * * * * * * 'reserved' area in case it gets *
* referenced.
*/
names = newnames;
for (i = 0; i < SIZE_HACK; i++) {
i_Name(i);
}
}
names = newnames + SIZE_HACK;
newnames = NULL;
}
/*
* Grow the db array
*/
newdb = (OBJ *)
XMALLOC((newsize + SIZE_HACK) * sizeof(OBJ), "db_grow.db");
if (!newdb) {
LOG_SIMPLE(LOG_ALWAYS, "ALC", "DB",
tprintf("Could not allocate space for %d item struct database.",
newsize));
abort();
}
if (db) {
/*
* An old struct database exists. Copy it to the new buffer
*/
db -= SIZE_HACK;
bcopy((char *)db, (char *)newdb,
(mudstate.db_top + SIZE_HACK) * sizeof(OBJ));
cp = (char *)db;
XFREE(cp, "db_grow.db");
} else {
/*
* Creating a brand new struct database. Fill in the * * * *
*
* * * * 'reserved' area in case it gets referenced.
*/
db = newdb;
for (i = 0; i < SIZE_HACK; i++) {
s_Owner(i, GOD);
s_Flags(i, (TYPE_GARBAGE | GOING));
s_Powers(i, 0);
s_Powers2(i, 0);
s_Location(i, NOTHING);
s_Contents(i, NOTHING);
s_Exits(i, NOTHING);
s_Link(i, NOTHING);
s_Next(i, NOTHING);
s_Pennies(i, NOTHING);
s_Zone(i, NOTHING);
s_Parent(i, NOTHING);
s_Pennies(i, 0);
s_Stack(i, NULL);
s_StackSize(i, 0);
#ifdef MEMORY_BASED
db[i].ahead = NULL;
db[i].at_count = 0;
#endif /*
* * MEMORY_BASED
*/
}
}
db = newdb + SIZE_HACK;
newdb = NULL;
for (i = mudstate.db_top; i < newtop; i++) {
if (mudconf.cache_names)
i_Name(i);
}
initialize_objects(mudstate.db_top, newtop);
mudstate.db_top = newtop;
mudstate.db_size = newsize;
/*
* Grow the db mark buffer
*/
marksize = (newsize + 7) >> 3;
newmarkbuf = (MARKBUF *) XMALLOC(marksize, "db_grow");
bzero((char *)newmarkbuf, marksize);
if (mudstate.markbits) {
marksize = (newtop + 7) >> 3;
bcopy((char *)mudstate.markbits, (char *)newmarkbuf, marksize);
cp = (char *)mudstate.markbits;
XFREE(cp, "db_grow");
}
mudstate.markbits = newmarkbuf;
}
void NDECL(db_free)
{
char *cp;
if (db != NULL) {
db -= SIZE_HACK;
cp = (char *)db;
XFREE(cp, "db_grow");
db = NULL;
}
mudstate.db_top = 0;
mudstate.db_size = 0;
mudstate.freelist = NOTHING;
}
#ifndef STANDALONE
void NDECL(db_make_minimal)
{
dbref obj;
db_free();
db_grow(1);
s_Name(0, "Limbo");
s_Flags(0, TYPE_ROOM);
s_Powers(0, 0);
s_Powers2(0, 0);
s_Location(0, NOTHING);
s_Exits(0, NOTHING);
s_Link(0, NOTHING);
s_Parent(0, NOTHING);
s_Zone(0, NOTHING);
s_Pennies(0, 1);
s_Owner(0, 1);
#ifdef MEMORY_BASED
db[0].ahead = NULL;
db[0].at_count = 0;
#endif /*
* * MEMORY_BASED
*/
/*
* should be #1
*/
load_player_names();
obj = create_player((char *)"Wizard", (char *)"potrzebie", NOTHING, 0, 0);
s_Flags(obj, Flags(obj) | WIZARD);
s_Powers(obj, 0);
s_Powers2(obj, 0);
s_Pennies(obj, 1000);
/*
* Manually link to Limbo, just in case
*/
s_Location(obj, 0);
s_Next(obj, NOTHING);
s_Contents(0, obj);
s_Link(obj, 0);
}
#endif
dbref parse_dbref(s)
const char *s;
{
const char *p;
int x;
/*
* Enforce completely numeric dbrefs
*/
for (p = s; *p; p++) {
if (!isdigit(*p))
return NOTHING;
}
x = atoi(s);
return ((x >= 0) ? x : NOTHING);
}
void putref(f, ref)
FILE *f;
dbref ref;
{
fprintf(f, "%d\n", ref);
}
void putstring(f, s)
FILE *f;
const char *s;
{
if (s) {
fputs(s, f);
}
putc('\n', f);
}
const char *getstring_noalloc(f)
FILE *f;
{
static char buf[LBUF_SIZE];
char *p;
int c, lastc;
p = buf;
c = '\0';
for (;;) {
lastc = c;
c = fgetc(f);
/*
* If EOF or null, return
*/
if (!c || (c == EOF)) {
*p = '\0';
return buf;
}
/*
* If a newline, return if prior char is not a cr. Otherwise
* * * * * * * keep on truckin'
*/
if ((c == '\n') && (lastc != '\r')) {
*p = '\0';
return buf;
}
safe_chr(c, buf, &p);
}
}
const char *pern_getstring_noalloc(f, pern_strings)
FILE *f;
int pern_strings;
{
static char buf[LBUF_SIZE];
char *p;
int c, lastc;
p = buf;
c = fgetc(f);
if (!pern_strings || (c != '"')) {
ungetc(c, f);
c = '\0';
for (;;) {
lastc = c;
c = fgetc(f);
/*
* If EOF or null, return
*/
if (!c || (c == EOF)) {
*p = '\0';
return buf;
}
/*
* If a newline, return if prior char is not a cr. *
* * * Otherwise * keep on truckin'
*/
if ((c == '\n') && (lastc != '\r')) {
*p = '\0';
return buf;
}
safe_chr(c, buf, &p);
}
} else {
for (;;) {
c = fgetc(f);
if (c == '"') {
if ((c = fgetc(f)) != '\n')
ungetc(c, f);
*p = '\0';
return buf;
} else if (c == '\\') {
c = fgetc(f);
}
if ((c == '\0') || (c == EOF)) {
*p == '\0';
return buf;
}
safe_chr(c, buf, &p);
}
}
}
const char *attr_getstring_noalloc(f)
FILE *f;
{
static char buf[LBUF_SIZE];
char *p;
int c, lastc;
p = buf;
c = '\0';
for (;;) {
lastc = c;
c = fgetc(f);
/*
* If EOF or null, return
*/
if (!c || (c == EOF)) {
*p = '\0';
return buf;
}
/*
* If a newline, return if prior char is not a cr. Otherwise
* * * * * * * keep on truckin'
*/
if ((c == '\n') && (lastc != '\r')) {
if (((c = getc(f)) == '>') || (c == '<')) {
ungetc(c, f);
*p = '\0';
return buf;
}
}
safe_chr(c, buf, &p);
}
}
dbref getref(f)
FILE *f;
{
return (atoi(getstring_noalloc(f)));
}
void free_boolexp(b)
BOOLEXP *b;
{
if (b == TRUE_BOOLEXP)
return;
switch (b->type) {
case BOOLEXP_AND:
case BOOLEXP_OR:
free_boolexp(b->sub1);
free_boolexp(b->sub2);
free_bool(b);
break;
case BOOLEXP_NOT:
case BOOLEXP_CARRY:
case BOOLEXP_IS:
case BOOLEXP_OWNER:
case BOOLEXP_INDIR:
free_boolexp(b->sub1);
free_bool(b);
break;
case BOOLEXP_CONST:
free_bool(b);
break;
case BOOLEXP_ATR:
case BOOLEXP_EVAL:
free((char *)b->sub1);
free_bool(b);
break;
}
}
BOOLEXP *dup_bool(b)
BOOLEXP *b;
{
BOOLEXP *r;
if (b == TRUE_BOOLEXP)
return (TRUE_BOOLEXP);
r = alloc_bool("dup_bool");
switch (r->type = b->type) {
case BOOLEXP_AND:
case BOOLEXP_OR:
r->sub2 = dup_bool(b->sub2);
case BOOLEXP_NOT:
case BOOLEXP_CARRY:
case BOOLEXP_IS:
case BOOLEXP_OWNER:
case BOOLEXP_INDIR:
r->sub1 = dup_bool(b->sub1);
case BOOLEXP_CONST:
r->thing = b->thing;
break;
case BOOLEXP_EVAL:
case BOOLEXP_ATR:
r->thing = b->thing;
r->sub1 = (BOOLEXP *) strsave((char *)b->sub1);
break;
default:
fprintf(stderr, "bad bool type!!\n");
return (TRUE_BOOLEXP);
}
return (r);
}
void clone_object(a, b)
dbref a, b;
{
bcopy((char *)&db[b], (char *)&db[a], sizeof(struct object));
}
#ifndef MEMORY_BASED
int init_gdbm_db(gdbmfile)
char *gdbmfile;
{
#ifdef STANDALONE
fprintf(stderr, "Opening %s\n", gdbmfile);
#endif
cache_init(mudconf.cache_width, mudconf.cache_depth);
dddb_setfile(gdbmfile);
dddb_init();
#ifdef STANDALONE
fprintf(stderr, "Done opening %s.\n", gdbmfile);
#else
STARTLOG(LOG_ALWAYS, "INI", "LOAD")
log_text((char *)"Using gdbm file: ");
log_text(gdbmfile);
ENDLOG
#endif
db_free();
vattr_init();
return (0);
}
#endif /*
* * MEMORY_BASED
*/
#ifndef STANDALONE
/*
* check_zone - checks back through a zone tree for control
*/
int check_zone(player, thing, limit)
dbref player, thing;
int limit;
{
if (!mudconf.have_zones || (Zone(thing) == NOTHING) || (limit == mudconf.zone_nest_lim) || (isPlayer(thing)))
return 0;
/*
* If the zone doesn't have an enterlock, DON'T allow control.
*/
if (atr_get_raw(Zone(thing), A_LENTER) && could_doit(player, Zone(thing), A_LENTER)) {
return 1;
} else {
return check_zone(player, Zone(thing), limit + 1);
}
}
int check_zone_for_player(player, thing, limit)
dbref player, thing;
int limit;
{
if (!mudconf.have_zones || (Zone(thing) == NOTHING) || (limit == mudconf.zone_nest_lim) || !(isPlayer(thing)))
return 0;
if (atr_get_raw(Zone(thing), A_LENTER) && could_doit(player, Zone(thing), A_LENTER)) {
return 1;
} else {
return check_zone(player, Zone(thing), limit + 1);
}
}
void toast_player(player)
dbref player;
{
do_clearcom(player);
do_channelnuke(player);
del_commac(player);
do_clear_macro(player, NULL);
}
#else
int check_zone(player, thing, limit)
dbref player, thing;
int limit;
{
return 0;
}
#endif /*
* * STANDALONE
*/
#ifndef STANDALONE
/*
* ---------------------------------------------------------------------------
* * dump_restart_db: Writes out socket information.
*/
void dump_restart_db()
{
FILE *f;
DESC *d;
int version = 0;
/* We maintain a version number for the restart database,
so we can restart even if the format of the restart db
has been changed in the new executable. */
#ifdef CONCENTRATE
version |= RS_CONCENTRATE;
#endif
version |= RS_RECORD_PLAYERS;
f = fopen("restart.db", "w");
putstring(f, tprintf("+V%d", version));
putref(f, sock);
putref(f, mudstate.start_time);
putstring(f, mudstate.doing_hdr);
#ifdef CONCENTRATE
putref(f, conc_pid);
#endif
putref(f, mudstate.record_players);
DESC_ITER_ALL(d) {
putref(f, d->descriptor);
putref(f, d->flags);
putref(f, d->connected_at);
putref(f, d->command_count);
putref(f, d->timeout);
putref(f, d->host_info);
putref(f, d->player);
putref(f, d->last_time);
putstring(f, d->output_prefix);
putstring(f, d->output_suffix);
putstring(f, d->addr);
putstring(f, d->doing);
putstring(f, d->username);
#ifdef CONCENTRATE
putref(f, d->concid);
putref(f, d->cstatus);
#endif
}
putref(f, 0);
fclose(f);
}
void load_restart_db()
{
FILE *f;
DESC *d;
DESC *p;
DESC *k;
int val, version;
char *temp, buf[8];
f = fopen("restart.db", "r");
if (!f) {
mudstate.restarting = 0;
return;
}
mudstate.restarting = 1;
fgets(buf, 3, f);
if (strncmp(buf, "+V", 2)) {
abort();
}
version = getref(f);
sock = getref(f);
maxd = sock + 1;
mudstate.start_time = getref(f);
strcpy(mudstate.doing_hdr, getstring_noalloc(f));
if (version & RS_CONCENTRATE) {
#ifdef CONCENTRATE
conc_pid = getref(f);
#else
(void)getref(f);
#endif
}
if (version & RS_RECORD_PLAYERS) {
mudstate.record_players = getref(f);
}
while ((val = getref(f)) != 0) {
ndescriptors++;
d = alloc_desc("restart");
d->descriptor = val;
d->flags = getref(f);
d->connected_at = getref(f);
d->command_count = getref(f);
d->timeout = getref(f);
d->host_info = getref(f);
d->player = getref(f);
d->last_time = getref(f);
temp = (char *)getstring_noalloc(f);
if (*temp) {
d->output_prefix = alloc_lbuf("set_userstring");
strcpy(d->output_prefix, temp);
} else {
d->output_prefix = NULL;
}
temp = (char *)getstring_noalloc(f);
if (*temp) {
d->output_suffix = alloc_lbuf("set_userstring");
strcpy(d->output_suffix, temp);
} else {
d->output_suffix = NULL;
}
strcpy(d->addr, getstring_noalloc(f));
strcpy(d->doing, getstring_noalloc(f));
strcpy(d->username, getstring_noalloc(f));
if (version & RS_CONCENTRATE) {
#ifdef CONCENTRATE
d->concid = getref(f);
d->cstatus = getref(f);
#else
(void)getref(f);
(void)getref(f);
#endif
}
d->output_size = 0;
d->output_tot = 0;
d->output_lost = 0;
d->output_head = NULL;
d->output_tail = NULL;
d->input_head = NULL;
d->input_tail = NULL;
d->input_size = 0;
d->input_tot = 0;
d->input_lost = 0;
d->raw_input = NULL;
d->raw_input_at = NULL;
d->quota = mudconf.cmd_quota_max;
d->program_data = NULL;
d->hashnext = NULL;
if (descriptor_list) {
for (p = descriptor_list; p->next; p = p->next) ;
d->prev = &p->next;
p->next = d;
d->next = NULL;
} else {
d->next = descriptor_list;
d->prev = &descriptor_list;
descriptor_list = d;
}
if (d->descriptor >= maxd)
maxd = d->descriptor + 1;
desc_addhash(d);
#ifdef CONCENTRATE
if (!(d->cstatus & C_CCONTROL))
#endif
s_Flags2(d->player, Flags2(d->player) | CONNECTED);
}
DESC_ITER_CONN(d) {
if (!isPlayer(d->player)) {
shutdownsock(d, R_QUIT);
}
#ifdef CONCENTRATE
if (d->cstatus & C_REMOTE) {
DESC_ITER_ALL(k) {
if (k->descriptor = d->descriptor)
d->parent = k;
}
}
#endif
}
fclose(f);
remove("restart.db");
raw_broadcast(0, "Game: Restart finished.");
}
#endif /*
* * STANDALONE
*/