2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2000, 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:
44 if ((np = getnatp(n)) == 0)
50 relatename(struct natstr *np, natid other)
52 extern s_char *relates[];
54 return relates[getrel(np, other)];
58 rejectname(struct natstr *np, natid other)
60 extern s_char *rejects[];
62 return rejects[getrejects(other, np)];
66 natstate(struct natstr *np)
68 if ((np->nat_stat & STAT_INUSE) == 0)
70 if (np->nat_stat & STAT_GOD)
72 if ((np->nat_stat & STAT_NORM) == 0)
77 /* This returns the relations that np has with them */
79 getrel(struct natstr *np, natid them)
81 return np->nat_relate[them];
85 getrejects(natid them, struct natstr *np)
92 shift = 12 - ((them - ((them / 4) << 2)) * 4);
93 /* the 07 should *really* be 017 */
94 reject = (np->nat_rejects[ind] >> shift) & 0x0f;
99 agecontact(struct natstr *np)
103 if (opt_LOSE_CONTACT) {
104 for (them = 1; them < MAXNOC; ++them) {
105 if (them != np->nat_cnum && np->nat_contact[them]) {
106 --np->nat_contact[them];
113 getcontact(struct natstr *np, natid them)
117 if (opt_LOSE_CONTACT) {
118 contact = np->nat_contact[them];
121 int shift = (them % 16);
123 contact = (np->nat_contact[ind] >> shift) & 1;
129 putrel(struct natstr *np, natid them, int relate)
131 np->nat_relate[them] = relate;
135 putreject(struct natstr *np, natid them, int how, int what)
141 /* This 07 should be changed to 017 after the current game is over */
144 shift = 12 - ((them - ((them / 4) << 2)) * 4);
145 newrej = np->nat_rejects[ind];
147 newrej |= (what << shift);
149 newrej &= ~(what << shift);
150 np->nat_rejects[ind] = newrej;
154 putcontact(struct natstr *np, natid them, int contact)
156 if (opt_LOSE_CONTACT) {
157 if (np->nat_contact[them] > contact)
159 np->nat_contact[them] = contact;
162 int shift = them % 16;
163 int new = np->nat_contact[ind];
166 new &= ~(1 << shift);
167 new |= (contact << shift);
168 np->nat_contact[ind] = new;