2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2004, 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:
40 /* must follow nation relation defines in nat.h */
41 "At War", "Sitzkrieg", "Mobilizing", "Hostile", "Neutral", "Friendly",
50 if ((np = getnatp(n)) == 0)
56 relatename(struct natstr *np, natid other)
58 return relates[getrel(np, other)];
62 rejectname(struct natstr *np, natid other)
65 /* must follow reject flags defined in nat.h */
84 return rejects[getrejects(other, np)];
88 natstate(struct natstr *np)
90 if ((np->nat_stat & STAT_INUSE) == 0)
92 if (np->nat_stat & STAT_GOD)
94 if ((np->nat_stat & STAT_NORM) == 0)
99 /* This returns the relations that np has with them */
101 getrel(struct natstr *np, natid them)
103 return np->nat_relate[them];
107 getrejects(natid them, struct natstr *np)
114 shift = 12 - ((them - ((them / 4) << 2)) * 4);
115 reject = (np->nat_rejects[ind] >> shift) & 0x0f;
120 agecontact(struct natstr *np)
124 if (opt_LOSE_CONTACT) {
125 for (them = 1; them < MAXNOC; ++them) {
126 if (them != np->nat_cnum && np->nat_contact[them]) {
127 --np->nat_contact[them];
134 getcontact(struct natstr *np, natid them)
138 if (opt_LOSE_CONTACT) {
139 contact = np->nat_contact[them];
142 int shift = (them % 16);
144 contact = (np->nat_contact[ind] >> shift) & 1;
150 putrel(struct natstr *np, natid them, int relate)
152 np->nat_relate[them] = relate;
156 putreject(struct natstr *np, natid them, int how, int what)
164 shift = 12 - ((them - ((them / 4) << 2)) * 4);
165 newrej = np->nat_rejects[ind];
167 newrej |= (what << shift);
169 newrej &= ~(what << shift);
170 np->nat_rejects[ind] = newrej;
174 putcontact(struct natstr *np, natid them, int contact)
176 if (opt_LOSE_CONTACT) {
177 if (np->nat_contact[them] > contact)
179 np->nat_contact[them] = contact;
182 int shift = them % 16;
183 int new = np->nat_contact[ind];
186 new &= ~(1 << shift);
187 new |= (contact << shift);
188 np->nat_contact[ind] = new;