2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2008, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * See files README, COPYING and CREDITS in the root of the source
23 * tree for related information and legal notices. It is expected
24 * that future projects/authors will amend these files as needed.
28 * nreport.c: File a news report. Downgrade relations if things get hostile.
30 * Known contributors to this file:
33 * Ron Koenderink, 2005
42 #include "prototypes.h"
51 static struct newscache cache[MAXNOC][SLOTS];
54 static struct newscache *
55 ncache(int actor, int event, int victim, int times);
58 nreport(natid actor, int event, natid victim, int times)
62 struct newscache *ncp;
64 if (CANT_HAPPEN((unsigned)event > N_MAX_VERB
65 || rpt[event].r_newstory[0] == rpt[0].r_newstory[0]))
68 ncp = ncache(actor, event, victim, times);
69 putnews(ncp->id, &ncp->news);
72 * this is probably pretty expensive, but hopefully we
73 * don't fire zillions of these things off every second.
75 if (victim == 0 || (nice = rpt[event].r_good_will) >= 0)
78 * Pretty schlocky to put it here, but
79 * I guess it can't go anywhere else.
83 if (!chance((double)-nice * times / 20.0))
85 if ((natp = getnatp(victim)) == 0)
87 if (getrel(natp, actor) < HOSTILE)
90 setrel(victim, actor, HOSTILE);
94 * Delete news articles that have expired.
103 /* skip over expired news */
104 expiry_time = time(NULL) - days(news_keep_days);
105 for (i = 0; getnews(i, &news); i++) {
106 if (news.nws_when == 0 || news.nws_when >= expiry_time)
109 /* news id 0..I-1 have expired */
110 CANT_HAPPEN(i > news_tail);
111 /* no items to delete if I is equal zero */
115 /* move unexpired news I.. to 0.., overwriting expired news */
116 for (j = 0; getnews(i + j, &news); j++) {
117 if (news.nws_when == 0)
121 CANT_HAPPEN(i + j != news_tail);
124 /* mark slots no longer in use */
125 memset(&news, 0, sizeof(news));
126 for (k = 0; k < i; k++)
127 putnews(j + k, &news);
129 /* clear cache because moving news invalidated it */
130 memset(&cache, 0, sizeof(cache));
134 * Initialize news reporting.
135 * Must run between open of file EF_NEWS and first nreport().
143 for (newest_item = 0; getnews(newest_item, &news); newest_item++) {
144 if (news.nws_when == 0)
147 news_tail = newest_item;
151 * Look to see if the same message has been generated
152 * in the last 5 minutes, if so just increment the times
153 * field instead of creating a new message.
155 static struct newscache *
156 ncache(int actor, int event, int victim, int times)
158 struct newscache *np;
162 time_t now = time(NULL);
165 oldtime = 0x7fffffff;
166 for (i = 0; i < SLOTS; i++) {
167 np = &cache[actor][i];
168 if (np->news.nws_when < oldtime) {
170 oldtime = np->news.nws_when;
174 if ((now - np->news.nws_when) > minutes(5))
176 if (np->news.nws_vrb == event && np->news.nws_vno == victim &&
177 np->news.nws_ntm + times <= 127) {
178 np->news.nws_ntm += times;
182 if (CANT_HAPPEN(oldslot < 0))
184 if (CANT_HAPPEN(!strstr(rpt[event].r_newstory[0], "%s") && victim != 0))
186 np = &cache[actor][oldslot];
187 np->news.nws_ano = actor;
188 np->news.nws_vno = victim;
189 np->news.nws_when = now;
190 np->news.nws_vrb = event;
191 np->news.nws_ntm = times;
192 ef_ensure_space(EF_NEWS, news_tail, 100);
193 np->id = news_tail++;