/*
* Empire - A multi-player, client/server Internet based war game.
- * Copyright (C) 1986-2006, Dave Pare, Jeff Bailey, Thomas Ruschak,
- * Ken Stevens, Steve McClure
+ * Copyright (C) 1986-2021, Dave Pare, Jeff Bailey, Thomas Ruschak,
+ * Ken Stevens, Steve McClure, Markus Armbruster
*
- * This program is free software; you can redistribute it and/or modify
+ * Empire 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
+ * the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* 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
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* ---
*
- * 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.
*
* ---
*
* nreport.c: File a news report. Downgrade relations if things get hostile.
- *
+ *
* Known contributors to this file:
* Dave Pare, 1994
* Steve McClure, 1997
+ * Ron Koenderink, 2005
+ * Markus Armbruster, 2004-2016
*/
#include <config.h>
-#include "prototypes.h"
+#include "chance.h"
+#include "nat.h"
#include "news.h"
-#include "file.h"
#include "optlist.h"
+#include "prototypes.h"
-#define SLOTS 5
+#define SLOTS 8
struct newscache {
struct nwsstr news;
};
static struct newscache cache[MAXNOC][SLOTS];
+static unsigned char cache_oldest[MAXNOC];
static int news_tail;
-static struct newscache *
-ncache(int actor, int event, int victim, int times);
+static struct newscache *ncache(int, int, int, int);
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;
+ if (CANT_HAPPEN(actor >= MAXNOC || victim >= MAXNOC))
+ return;
ncp = ncache(actor, event, victim, times);
putnews(ncp->id, &ncp->news);
return;
if (!chance((double)-nice * times / 20.0))
return;
- if ((natp = getnatp(victim)) == 0)
- return;
- if (getrel(natp, actor) < HOSTILE)
+ if (relations_with(victim, actor) < HOSTILE)
return;
setrel(victim, actor, HOSTILE);
/* 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)
+ if (news.nws_vrb == 0 || news.nws_when >= expiry_time)
break;
}
- /* news id 0..I-1 have expired */
+ /* news ID 0..I-1 have expired */
CANT_HAPPEN(i > news_tail);
/* no items to delete if I is equal zero */
if (i == 0)
/* move unexpired news I.. to 0.., overwriting expired news */
for (j = 0; getnews(i + j, &news); j++) {
- if (news.nws_when == 0)
+ if (news.nws_vrb == 0)
break;
putnews(j, &news);
}
news_tail = j;
/* mark slots no longer in use */
- memset(&news, 0, sizeof(news));
- for (k = 0; k < i; k++)
+ for (k = 0; k < i; k++) {
+ ef_blank(EF_NEWS, j + k, &news);
putnews(j + k, &news);
+ }
/* clear cache because moving news invalidated it */
memset(&cache, 0, sizeof(cache));
struct nwsstr news;
for (newest_item = 0; getnews(newest_item, &news); newest_item++) {
- if (news.nws_when == 0)
+ if (news.nws_vrb == 0)
break;
}
news_tail = newest_item;
static struct newscache *
ncache(int actor, int event, int victim, int times)
{
- register struct newscache *np;
+ struct newscache *np;
int i;
- int oldslot;
- time_t oldtime;
+ unsigned oldslot;
+ time_t dur;
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 (np->id == 0)
+ if (np->news.nws_vrb == 0)
continue;
- if ((now - np->news.nws_when) > minutes(5))
+ dur = now - np->news.nws_when;
+ if (dur > 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;
+ if (np->news.nws_vrb == event && np->news.nws_vno == victim) {
+ np->news.nws_ntm = LIMIT_TO(np->news.nws_ntm + times,
+ 0, 65535);
+ np->news.nws_duration = dur;
return np;
}
}
- if (CANT_HAPPEN(oldslot < 0))
- oldslot = 0;
if (CANT_HAPPEN(!strstr(rpt[event].r_newstory[0], "%s") && victim != 0))
victim = 0;
+ oldslot = cache_oldest[actor];
+ if (CANT_HAPPEN(oldslot >= SLOTS))
+ oldslot = 0;
np = &cache[actor][oldslot];
+ cache_oldest[actor] = (oldslot + 1) % SLOTS;
+ ef_blank(EF_NEWS, news_tail, &np->news);
np->news.nws_ano = actor;
- np->news.nws_vno = victim;
- np->news.nws_when = now;
np->news.nws_vrb = event;
+ np->news.nws_vno = victim;
np->news.nws_ntm = times;
- ef_ensure_space(EF_NEWS, news_tail, 100);
+ np->news.nws_duration = 0;
+ np->news.nws_when = now;
np->id = news_tail++;
return np;
}