2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2017, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure, Markus Armbruster
6 * Empire 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 3 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, see <http://www.gnu.org/licenses/>.
21 * See files README, COPYING and CREDITS in the root of the source
22 * tree for related information and legal notices. It is expected
23 * that future projects/authors will amend these files as needed.
27 * nreport.c: File a news report. Downgrade relations if things get hostile.
29 * Known contributors to this file:
32 * Ron Koenderink, 2005
33 * Markus Armbruster, 2004-2016
42 #include "prototypes.h"
51 static struct newscache cache[MAXNOC][SLOTS];
52 static unsigned char cache_oldest[MAXNOC];
55 static struct newscache *ncache(int, int, int, int);
58 nreport(natid actor, int event, natid victim, int times)
61 struct newscache *ncp;
63 if (CANT_HAPPEN((unsigned)event > N_MAX_VERB
64 || rpt[event].r_newstory[0] == rpt[0].r_newstory[0]))
66 if (CANT_HAPPEN(actor >= MAXNOC || victim >= MAXNOC))
69 ncp = ncache(actor, event, victim, times);
70 putnews(ncp->id, &ncp->news);
73 * this is probably pretty expensive, but hopefully we
74 * don't fire zillions of these things off every second.
76 if (victim == 0 || (nice = rpt[event].r_good_will) >= 0)
79 * Pretty schlocky to put it here, but
80 * I guess it can't go anywhere else.
84 if (!chance((double)-nice * times / 20.0))
86 if (relations_with(victim, actor) < HOSTILE)
89 setrel(victim, actor, HOSTILE);
93 * Delete news articles that have expired.
102 /* skip over expired news */
103 expiry_time = time(NULL) - days(news_keep_days);
104 for (i = 0; getnews(i, &news); i++) {
105 if (news.nws_vrb == 0 || news.nws_when >= expiry_time)
108 /* news id 0..I-1 have expired */
109 CANT_HAPPEN(i > news_tail);
110 /* no items to delete if I is equal zero */
114 /* move unexpired news I.. to 0.., overwriting expired news */
115 for (j = 0; getnews(i + j, &news); j++) {
116 if (news.nws_vrb == 0)
120 CANT_HAPPEN(i + j != news_tail);
123 /* mark slots no longer in use */
124 for (k = 0; k < i; k++) {
125 ef_blank(EF_NEWS, j + k, &news);
126 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_vrb == 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);
164 for (i = 0; i < SLOTS; i++) {
165 np = &cache[actor][i];
166 if (np->news.nws_vrb == 0)
168 dur = now - np->news.nws_when;
169 if (dur > minutes(5))
171 if (np->news.nws_vrb == event && np->news.nws_vno == victim) {
172 np->news.nws_ntm = LIMIT_TO(np->news.nws_ntm + times,
174 np->news.nws_duration = dur;
178 if (CANT_HAPPEN(!strstr(rpt[event].r_newstory[0], "%s") && victim != 0))
180 oldslot = cache_oldest[actor];
181 if (CANT_HAPPEN(oldslot >= SLOTS))
183 np = &cache[actor][oldslot];
184 cache_oldest[actor] = (oldslot + 1) % SLOTS;
185 ef_blank(EF_NEWS, news_tail, &np->news);
186 np->news.nws_ano = actor;
187 np->news.nws_vrb = event;
188 np->news.nws_vno = victim;
189 np->news.nws_ntm = times;
190 np->news.nws_duration = 0;
191 np->news.nws_when = now;
192 np->id = news_tail++;