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 * surv.c: Show sector survey
30 * Known contributors to this file:
48 static char code_char(struct valstr, struct sctstr *sp);
51 * survey type <sarg> ?cond
58 struct nstr_sect nstr;
65 struct nscstr cond[NS_NCOND];
69 /* Note this is not re-entrant anyway, so we keep the buffers
71 static char *mapbuf = NULL;
72 static char **map = NULL;
75 ptr = getstarg(player->argp[1], "commodity or variable? ", buf);
78 ptr = nstr_comp_val(ptr, &val, EF_SECTOR);
81 if (val.val_cat != NSC_OFF || nstr_coerce_val(&val, NSC_LONG, NULL) < 0) {
82 pr("Can't survey this\n");
85 for (; isspace(*ptr); ++ptr) ;
88 if (!snxtsct(&nstr, player->argp[2]))
91 mapbuf = malloc(WORLD_Y * MAPWIDTH(1));
93 map = malloc(WORLD_Y * sizeof(char *));
95 for (i = 0; i < WORLD_Y; i++)
96 map[i] = &mapbuf[MAPWIDTH(1) * i];
102 if (!mapbuf || !map) {
103 pr("Memory error, tell the deity.\n");
104 logerror("malloc failed in sect\n");
108 memcpy(cond, nstr.cond, sizeof(struct nscstr) * ncond);
110 np = getnatp(player->cnum);
111 xyrelrange(np, &nstr.range, &range);
112 border(&range, " ", "");
113 blankfill(mapbuf, &nstr.range, 1);
114 while (nxtsct(&nstr, §)) {
117 ptr = &map[nstr.dy][nstr.dx];
118 if (nstr_exec(cond, ncond, §)) {
120 *ptr = 0x80 | code_char(val, §);
122 *ptr = dchr[sect.sct_type].d_mnem;
125 for (y = nstr.range.ly, i = 0; i < nstr.range.height; y++, i++) {
129 pr("%4d %s %4d\n", yval, map[i], yval);
133 border(&range, " ", "");
135 pr("\n%d sector%s.\n", nsect, splur(nsect));
140 code_char(struct valstr val, struct sctstr *sp)
144 int large = val.val_type != NSC_CHAR && val.val_type != NSC_UCHAR;
146 nstr_exec_val(&val, player->cnum, sp, NSC_LONG);
147 amt = val.val_as.lng;
150 n = amt / (large ? 100 : 10);
153 return "0123456789"[n];