/*
* Empire - A multi-player, client/server Internet based war game.
- * Copyright (C) 1986-2000, Dave Pare, Jeff Bailey, Thomas Ruschak,
+ * Copyright (C) 1986-2008, Dave Pare, Jeff Bailey, Thomas Ruschak,
* Ken Stevens, Steve McClure
*
* This program is free software; you can redistribute it and/or modify
*
* ---
*
- * 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.
+ * See files README, COPYING and CREDITS in the root of the source
+ * tree for related information and legal notices. It is expected
+ * that future projects/authors will amend these files as needed.
*
* ---
*
* Known contributors to this file:
* Dave Pare, 1994
* Steve McClure, 1997
+ * Ron Koenderink, 2005
*/
-#include "misc.h"
-#include "news.h"
-#include "nat.h"
-#include "deity.h"
+#include <config.h>
+
#include "file.h"
-#include "empio.h"
-#include <fcntl.h>
+#include "nat.h"
+#include "news.h"
+#include "optlist.h"
#include "prototypes.h"
-void
-nreport(natid actor, int event, natid victim, int times)
-{
- int nice;
- int rel;
- struct natstr *np;
-
- filereport(actor, event, victim, times);
- /*
- * this is probably pretty expensive, but hopefully we
- * don't fire zillions of these things off every second.
- */
- if (victim == 0 || (nice = rpt[event].r_good_will) >= 0)
- return;
- /*
- * Pretty schlocky to put it here, but
- * I guess it can't go anywhere else.
- */
- if (actor == victim)
- return;
- if (!chance((double)-nice * times/20.0))
- return;
- if ((np = getnatp(victim)) == 0)
- return;
- if ((rel = getrel(np, actor)) < HOSTILE)
- return;
-
- rel = HOSTILE;
-/*
- if (rel > HOSTILE)
- rel = HOSTILE;
- else
- rel = AT_WAR;
- */
- setrel(victim, actor, rel);
-}
+#define SLOTS 5
-struct free {
- struct free *next;
- int id;
+struct newscache {
+ struct nwsstr news;
+ int id;
};
-struct free *freelist;
+static struct newscache cache[MAXNOC][SLOTS];
+static int news_tail;
-static void
-addfree(int n)
-{
- struct free *fp;
+static struct newscache *
+ncache(int actor, int event, int victim, int times);
- fp = (struct free *) malloc(sizeof(*fp));
- fp->next = freelist;
- fp->id = n;
- freelist = fp;
+void
+nreport(natid actor, int event, natid victim, int times)
+{
+ int nice;
+ struct natstr *natp;
+ struct newscache *ncp;
+
+ if (CANT_HAPPEN((unsigned)event > N_MAX_VERB
+ || rpt[event].r_newstory[0] == rpt[0].r_newstory[0]))
+ return;
+
+ ncp = ncache(actor, event, victim, times);
+ putnews(ncp->id, &ncp->news);
+
+ /*
+ * this is probably pretty expensive, but hopefully we
+ * don't fire zillions of these things off every second.
+ */
+ if (victim == 0 || (nice = rpt[event].r_good_will) >= 0)
+ return;
+ /*
+ * Pretty schlocky to put it here, but
+ * I guess it can't go anywhere else.
+ */
+ if (actor == victim)
+ return;
+ if (!chance((double)-nice * times / 20.0))
+ return;
+ if ((natp = getnatp(victim)) == 0)
+ return;
+ if (getrel(natp, actor) < HOSTILE)
+ return;
+
+ setrel(victim, actor, HOSTILE);
}
/*
- * snoop through the news articles looking
- * for articles which have timed out. Only
- * called when no free items left.
+ * Delete news articles that have expired.
*/
-static void
-findfree(void)
+void
+delete_old_news(void)
{
- register time_t oldnewstime;
- register int n;
- struct nwsstr news;
- time_t newstime;
-
- (void) time(&newstime);
- oldnewstime = newstime - NEWS_PERIOD;
- for (n=0; getnews(n, &news); n++) {
- if (news.nws_when < oldnewstime)
- addfree(n);
- }
- if (freelist == 0) {
- if (!ef_extend(EF_NEWS, 100))
- return;
- findfree();
- }
+ time_t expiry_time;
+ int i, j, k;
+ struct nwsstr news;
+
+ /* skip over expired news */
+ expiry_time = time(NULL) - days(news_keep_days);
+ for (i = 0; getnews(i, &news); i++) {
+ if (news.nws_when == 0 || news.nws_when >= expiry_time)
+ break;
+ }
+ /* news id 0..I-1 have expired */
+ CANT_HAPPEN(i > news_tail);
+ /* no items to delete if I is equal zero */
+ if (i == 0)
+ return;
+
+ /* move unexpired news I.. to 0.., overwriting expired news */
+ for (j = 0; getnews(i + j, &news); j++) {
+ if (news.nws_when == 0)
+ break;
+ putnews(j, &news);
+ }
+ CANT_HAPPEN(i + j != news_tail);
+ news_tail = j;
+
+ /* mark slots no longer in use */
+ memset(&news, 0, sizeof(news));
+ for (k = 0; k < i; k++)
+ putnews(j + k, &news);
+
+ /* clear cache because moving news invalidated it */
+ memset(&cache, 0, sizeof(cache));
}
-static
-int
-nextfree(void)
+/*
+ * Initialize news reporting.
+ * Must run between open of file EF_NEWS and first nreport().
+ */
+void
+init_nreport(void)
{
- struct free *fp;
- int id;
-
- if (freelist == 0)
- findfree();
- if ((fp = freelist) == 0)
- return 0;
- freelist = fp->next;
- id = fp->id;
- free(fp);
- return id;
+ int newest_item;
+ struct nwsstr news;
+
+ for (newest_item = 0; getnews(newest_item, &news); newest_item++) {
+ if (news.nws_when == 0)
+ break;
+ }
+ news_tail = newest_item;
}
-#define SLOTS 5
-
-struct newscache {
- struct nwsstr news;
- int id;
-};
-
-static
-struct newscache *
-ncache(time_t now, int actor, int event, int victim, int times)
+/*
+ * Look to see if the same message has been generated
+ * in the last 5 minutes, if so just increment the times
+ * field instead of creating a new message.
+ */
+static struct newscache *
+ncache(int actor, int event, int victim, int times)
{
- static struct newscache cache[MAXNOC][SLOTS];
- register struct newscache *np;
- int i;
- int oldslot;
- time_t oldtime;
-
- oldslot = -1;
- oldtime = 0x7fffffff;
- for (i=0; i<SLOTS; i++) {
- np = &cache[actor][i];
- if (np->news.nws_when < oldtime) {
- oldslot = i;
- oldtime = np->news.nws_when;
- }
- if (np->id == 0)
- continue;
- if ((now - np->news.nws_when) > minutes(5))
- continue;
- if (np->news.nws_vrb == event && np->news.nws_vno == victim &&
- np->news.nws_ntm + times <= 127) {
- np->news.nws_ntm += times;
- return np;
- }
+ struct newscache *np;
+ int i;
+ int oldslot;
+ time_t oldtime;
+ time_t now = time(NULL);
+
+ oldslot = -1;
+ oldtime = 0x7fffffff;
+ for (i = 0; i < SLOTS; i++) {
+ np = &cache[actor][i];
+ if (np->news.nws_when < oldtime) {
+ oldslot = i;
+ oldtime = np->news.nws_when;
}
- if (oldslot < 0) {
- logerror("internal error; ncache oldslot < 0");
- return &cache[actor][0];
+ if (np->id == 0)
+ continue;
+ if ((now - np->news.nws_when) > minutes(5))
+ continue;
+ if (np->news.nws_vrb == event && np->news.nws_vno == victim &&
+ np->news.nws_ntm + times <= 127) {
+ np->news.nws_ntm += times;
+ return np;
}
- np = &cache[actor][oldslot];
- np->news.nws_ano = actor;
- np->news.nws_vno = victim;
- np->news.nws_when = now;
- np->news.nws_vrb = event;
- np->news.nws_ntm = times;
- np->id = nextfree();
- return np;
-}
-
-void
-filereport(int actor, int event, int victim, int times)
-{
- struct newscache *np;
- time_t now;
-
- time(&now);
- np = ncache(now, actor, event, victim, times);
- ef_write(EF_NEWS, np->id, (s_char *)&np->news);
+ }
+ if (CANT_HAPPEN(oldslot < 0))
+ oldslot = 0;
+ if (CANT_HAPPEN(!strstr(rpt[event].r_newstory[0], "%s") && victim != 0))
+ victim = 0;
+ np = &cache[actor][oldslot];
+ np->news.nws_ano = actor;
+ np->news.nws_vno = victim;
+ np->news.nws_when = now;
+ np->news.nws_vrb = event;
+ np->news.nws_ntm = times;
+ ef_ensure_space(EF_NEWS, news_tail, 100);
+ np->id = news_tail++;
+ return np;
}
projects / empserver / blobdiff