2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2006, 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
38 #include "prototypes.h"
50 static struct newscache cache[MAXNOC][SLOTS];
53 static struct newscache *
54 ncache(int actor, int event, int victim, int times);
57 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]))
67 ncp = ncache(actor, event, victim, times);
68 putnews(ncp->id, &ncp->news);
71 * this is probably pretty expensive, but hopefully we
72 * don't fire zillions of these things off every second.
74 if (victim == 0 || (nice = rpt[event].r_good_will) >= 0)
77 * Pretty schlocky to put it here, but
78 * I guess it can't go anywhere else.
82 if (!chance((double)-nice * times / 20.0))
84 if ((natp = getnatp(victim)) == 0)
86 if (getrel(natp, 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_when == 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_when == 0)
120 CANT_HAPPEN(i + j != news_tail);
123 /* mark slots no longer in use */
124 memset(&news, 0, sizeof(news));
125 for (k = 0; k < i; k++)
126 putnews(j + k, &news);
128 /* clear cache because moving news invalidated it */
129 memset(&cache, 0, sizeof(cache));
133 * Initialize news reporting.
134 * Must run between open of file EF_NEWS and first nreport().
142 for (newest_item = 0; getnews(newest_item, &news); newest_item++) {
143 if (news.nws_when == 0)
146 news_tail = newest_item;
150 * Look to see if the same message has been generated
151 * in the last 5 minutes, if so just increment the times
152 * field instead of creating a new message.
154 static struct newscache *
155 ncache(int actor, int event, int victim, int times)
157 register struct newscache *np;
161 time_t now = time(NULL);
164 oldtime = 0x7fffffff;
165 for (i = 0; i < SLOTS; i++) {
166 np = &cache[actor][i];
167 if (np->news.nws_when < oldtime) {
169 oldtime = np->news.nws_when;
173 if ((now - np->news.nws_when) > minutes(5))
175 if (np->news.nws_vrb == event && np->news.nws_vno == victim &&
176 np->news.nws_ntm + times <= 127) {
177 np->news.nws_ntm += times;
181 if (CANT_HAPPEN(oldslot < 0))
183 if (CANT_HAPPEN(!strstr(rpt[event].r_newstory[0], "%s") && victim != 0))
185 np = &cache[actor][oldslot];
186 np->news.nws_ano = actor;
187 np->news.nws_vno = victim;
188 np->news.nws_when = now;
189 np->news.nws_vrb = event;
190 np->news.nws_ntm = times;
191 ef_ensure_space(EF_NEWS, news_tail, 100);
192 np->id = news_tail++;