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 the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
23 * related information and legal notices. It is expected that any future
24 * projects/authors will amend these files as needed.
28 * nat.c: Misc. accesses on the nation file
30 * Known contributors to this file:
36 #include "prototypes.h"
43 /* must follow nation relation defines in nat.h */
44 "At War", "Sitzkrieg", "Mobilizing", "Hostile", "Neutral", "Friendly",
53 if ((np = getnatp(n)) == 0)
59 relatename(struct natstr *np, natid other)
61 return relates[getrel(np, other)];
65 rejectname(struct natstr *np, natid other)
67 static char *rejects[] = {
68 /* must follow reject flags defined in nat.h */
87 return rejects[getrejects(other, np)];
91 natstate(struct natstr *np)
93 static char *stnam[] = {
94 /* must match nat_status */
95 "FREE", "VISITOR", "VISITOR", "SANCTUARY", "ACTIVE", "DEITY"
97 return stnam[np->nat_stat];
100 /* This returns the relations that np has with them */
102 getrel(struct natstr *np, natid them)
104 return np->nat_relate[them];
108 getrejects(natid them, struct natstr *np)
115 shift = 12 - ((them - ((them / 4) << 2)) * 4);
116 reject = (np->nat_rejects[ind] >> shift) & 0x0f;
121 agecontact(struct natstr *np)
125 for (them = 1; them < MAXNOC; ++them) {
126 if (them != np->nat_cnum && np->nat_contact[them]) {
127 --np->nat_contact[them];
133 getcontact(struct natstr *np, natid them)
135 return np->nat_contact[them];
139 putrel(struct natstr *np, natid them, int relate)
141 np->nat_relate[them] = relate;
145 putreject(struct natstr *np, natid them, int how, int what)
153 shift = 12 - ((them - ((them / 4) << 2)) * 4);
154 newrej = np->nat_rejects[ind];
156 newrej |= (what << shift);
158 newrej &= ~(what << shift);
159 np->nat_rejects[ind] = newrej;
163 putcontact(struct natstr *np, natid them, int contact)
165 if (CANT_HAPPEN(contact < 0))
167 if (CANT_HAPPEN(contact > 255))
170 if (np->nat_contact[them] < contact)
171 np->nat_contact[them] = contact;
175 influx(struct natstr *np)
179 getsect(np->nat_xcap, np->nat_ycap, §);
180 if (sect.sct_own != np->nat_cnum ||
181 (sect.sct_type != SCT_CAPIT && sect.sct_type != SCT_MOUNT &&
182 sect.sct_type != SCT_SANCT) ||
183 (np->nat_flags & NF_SACKED))