/*
 *  Empire - A multi-player, client/server Internet based war game.
 *  Copyright (C) 1986-2021, Dave Pare, Jeff Bailey, Thomas Ruschak,
 *                Ken Stevens, Steve McClure, Markus Armbruster
 *
 *  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 3 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  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, see <http://www.gnu.org/licenses/>.
 *
 *  ---
 *
 *  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 "chance.h"
#include "nat.h"
#include "news.h"
#include "optlist.h"
#include "prototypes.h"

#define SLOTS 8

struct newscache {
    struct nwsstr news;
    int id;
};

static struct newscache cache[MAXNOC][SLOTS];
static unsigned char cache_oldest[MAXNOC];
static int news_tail;

static struct newscache *ncache(int, int, int, int);

void
nreport(natid actor, int event, natid victim, int times)
{
    int nice;
    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);

    /*
     * 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 (relations_with(victim, actor) < HOSTILE)
	return;

    setrel(victim, actor, HOSTILE);
}

/*
 * Delete news articles that have expired.
 */
void
delete_old_news(void)
{
    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_vrb == 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_vrb == 0)
	    break;
	putnews(j, &news);
    }
    CANT_HAPPEN(i + j != news_tail);
    news_tail = j;

    /* mark slots no longer in use */
    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));
}

/*
 * Initialize news reporting.
 * Must run between open of file EF_NEWS and first nreport().
 */
void
init_nreport(void)
{
    int newest_item;
    struct nwsstr news;

    for (newest_item = 0; getnews(newest_item, &news); newest_item++) {
	if (news.nws_vrb == 0)
	    break;
    }
    news_tail = newest_item;
}

/*
 * 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)
{
    struct newscache *np;
    int i;
    unsigned oldslot;
    time_t dur;
    time_t now = time(NULL);

    for (i = 0; i < SLOTS; i++) {
	np = &cache[actor][i];
	if (np->news.nws_vrb == 0)
	    continue;
	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 = LIMIT_TO(np->news.nws_ntm + times,
					0, 65535);
	    np->news.nws_duration = dur;
	    return np;
	}
    }
    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_vrb = event;
    np->news.nws_vno = victim;
    np->news.nws_ntm = times;
    np->news.nws_duration = 0;
    np->news.nws_when = now;
    np->id = news_tail++;
    return np;
}
