2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2011, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure, Markus Armbruster
6 * Empire 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 3 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, see <http://www.gnu.org/licenses/>.
21 * See files README, COPYING and CREDITS in the root of the source
22 * tree for related information and legal notices. It is expected
23 * that future projects/authors will amend these files as needed.
27 * show.c: General show routines
29 * Known contributors to this file:
33 * Ron Koenderink, 2005-2009
34 * Markus Armbruster, 2006-2011
51 #include "prototypes.h"
56 static char *fmttime2822(time_t);
57 static void show_load(short[]);
58 static void show_capab(int, struct symbol *);
66 chr_index_cmp(const void *a, const void *b)
68 const struct chr_index *ca = a, *cb = b;
69 if (ca->tech == cb->tech)
70 return ca->type - cb->type;
71 return ca->tech - cb->tech;
75 make_mchr_index(struct chr_index chridx[], int tlev)
77 struct natstr *natp = getnatp(player->cnum);
81 for (i = 0; mchr[i].m_name; i++) {
82 if (mchr[i].m_tech > tlev)
84 if ((mchr[i].m_flags & M_TRADE) && !opt_TRADESHIPS)
87 chridx[n].tech = mchr[i].m_tech;
90 if (natp->nat_flags & NF_TECHLISTS)
91 qsort(chridx, n, sizeof(*chridx), chr_index_cmp);
96 make_plchr_index(struct chr_index chridx[], int tlev)
98 struct natstr *natp = getnatp(player->cnum);
102 for (i = 0; plchr[i].pl_name; i++) {
103 if (plchr[i].pl_tech > tlev)
106 chridx[n].tech = plchr[i].pl_tech;
109 if (natp->nat_flags & NF_TECHLISTS)
110 qsort(chridx, n, sizeof(*chridx), chr_index_cmp);
115 make_lchr_index(struct chr_index chridx[], int tlev)
117 struct natstr *natp = getnatp(player->cnum);
121 for (i = 0; lchr[i].l_name; i++) {
122 if (lchr[i].l_tech > tlev)
124 if ((lchr[i].l_flags & L_SPY) && !opt_LANDSPIES)
127 chridx[n].tech = lchr[i].l_tech;
130 if (natp->nat_flags & NF_TECHLISTS)
131 qsort(chridx, n, sizeof(*chridx), chr_index_cmp);
136 show_bridge(int tlev)
140 pr("Bridges require %g tech, %d hcm, 0 workers,\n",
142 pr("%d available workforce, and cost $%g\n",
143 (SCT_BLD_WORK(0, buil_bh) * SCT_MINEFF + 99) / 100,
150 if (tlev < buil_tower_bt)
152 pr("Bridge towers require %g tech, %d hcm, 0 workers,\n",
153 buil_tower_bt, buil_tower_bh);
154 pr("%d available workforce, and cost $%g\n",
155 (SCT_BLD_WORK(0, buil_tower_bh) * SCT_MINEFF + 99) / 100,
160 show_nuke_stats(int tlev)
162 show_nuke_capab(tlev);
166 show_nuke_build(int tlev)
171 pr("%13s lcm hcm oil rad avail tech res $\n", "");
173 for (np = nchr; np->n_name; np++) {
174 avail = NUK_BLD_WORK(np->n_lcm, np->n_hcm, np->n_oil, np->n_rad);
175 if (np->n_tech > tlev)
177 pr("%-13.13s %3d %3d %4d %4d %5d %4d %3.0f $%6d\n",
178 np->n_name, np->n_lcm, np->n_hcm, np->n_oil,
179 np->n_rad, avail, np->n_tech,
180 drnuke_const > MIN_DRNUKE_CONST ?
181 ceil(np->n_tech * drnuke_const) : 0.0,
187 show_nuke_capab(int tlev)
191 pr("%13s blst dam lbs tech res $%7s abilities\n", "", "");
193 for (np = nchr; np->n_name; np++) {
194 if (np->n_tech > tlev)
196 pr("%-13.13s %4d %3d %3d %4d %3.0f $%7d",
197 np->n_name, np->n_blast, np->n_dam,
198 np->n_weight, np->n_tech,
199 drnuke_const > MIN_DRNUKE_CONST ?
200 ceil(np->n_tech * drnuke_const) : 0.0,
202 show_capab(np->n_flags, nuke_chr_flags);
208 show_ship_build(int tlev)
210 struct chr_index chridx[sizeof(mchr) / sizeof(*mchr)];
211 int n = make_mchr_index(chridx, tlev);
215 pr("%25s lcm hcm avail tech $\n", "");
216 for (i = 0; i < n; i++) {
217 mp = &mchr[chridx[i].type];
218 pr("%-25.25s %3d %3d %5d %4d $%d\n",
219 mp->m_name, mp->m_lcm, mp->m_hcm,
220 SHP_BLD_WORK(mp->m_lcm, mp->m_hcm), mp->m_tech, mp->m_cost);
225 show_ship_stats(int tlev)
227 struct chr_index chridx[sizeof(mchr) / sizeof(*mchr)];
228 int n = make_mchr_index(chridx, tlev);
232 pr("%25s s v s r f l p h x\n", "");
233 pr("%25s p i p n i n l e p\n", "");
234 pr("%25s def d s y g r d n l l\n", "");
235 for (i = 0; i < n; i++) {
236 mp = &mchr[chridx[i].type];
237 pr("%-25.25s %3d %2d %2d %2d %2d %2d %2d %2d %2d %2d\n",
238 mp->m_name, m_armor(mp, tlev), m_speed(mp, tlev),
239 m_visib(mp, tlev), mp->m_vrnge,
240 m_frnge(mp, tlev), m_glim(mp, tlev),
241 mp->m_nland, mp->m_nplanes, mp->m_nchoppers, mp->m_nxlight);
246 show_ship_capab(int tlev)
248 struct chr_index chridx[sizeof(mchr) / sizeof(*mchr)];
249 int n = make_mchr_index(chridx, tlev);
253 pr("%25s cargos & capabilities\n", "");
254 for (i = 0; i < n; i++) {
255 mp = &mchr[chridx[i].type];
256 pr("%-25.25s ", mp->m_name);
257 show_load(mp->m_item);
258 show_capab(mp->m_flags, ship_chr_flags);
264 show_plane_stats(int tlev)
266 struct chr_index chridx[sizeof(plchr) / sizeof(*plchr)];
267 int n = make_plchr_index(chridx, tlev);
271 pr("%25s acc load att def ran fuel stlth\n", "");
272 for (i = 0; i < n; i++) {
273 pp = &plchr[chridx[i].type];
274 pr("%-25.25s %3d %4d %3d %3d %3d %4d %4d%%\n",
275 pp->pl_name, pl_acc(pp, tlev), pl_load(pp, tlev),
276 pl_att(pp, tlev), pl_def(pp, tlev), pl_range(pp, tlev),
277 pp->pl_fuel, pp->pl_stealth);
282 show_plane_capab(int tlev)
284 struct chr_index chridx[sizeof(plchr) / sizeof(*plchr)];
285 int n = make_plchr_index(chridx, tlev);
289 pr("%25s capabilities\n", "");
290 for (i = 0; i < n; i++) {
291 pp = &plchr[chridx[i].type];
292 pr("%-25.25s ", pp->pl_name);
293 show_capab(pp->pl_flags, plane_chr_flags);
299 show_plane_build(int tlev)
301 struct chr_index chridx[sizeof(plchr) / sizeof(*plchr)];
302 int n = make_plchr_index(chridx, tlev);
306 pr("%25s lcm hcm crew avail tech $\n", "");
307 for (i = 0; i < n; i++) {
308 pp = &plchr[chridx[i].type];
309 pr("%-25.25s %3d %3d %4d %5d %4d $%d\n",
310 pp->pl_name, pp->pl_lcm,
311 pp->pl_hcm, pp->pl_crew,
312 PLN_BLD_WORK(pp->pl_lcm, pp->pl_hcm), pp->pl_tech, pp->pl_cost);
317 show_land_build(int tlev)
319 struct chr_index chridx[sizeof(lchr) / sizeof(*lchr)];
320 int n = make_lchr_index(chridx, tlev);
324 pr("%25s lcm hcm guns avail tech $\n", "");
325 for (i = 0; i < n; i++) {
326 lp = &lchr[chridx[i].type];
327 pr("%-25.25s %3d %3d %4d %5d %4d $%d\n",
328 lp->l_name, lp->l_lcm,
331 LND_BLD_WORK(lp->l_lcm, lp->l_hcm), lp->l_tech, lp->l_cost);
336 show_land_capab(int tlev)
338 struct chr_index chridx[sizeof(lchr) / sizeof(*lchr)];
339 int n = make_lchr_index(chridx, tlev);
343 pr("%25s capabilities\n", "");
344 for (i = 0; i < n; i++) {
345 lcp = &lchr[chridx[i].type];
346 pr("%-25s ", lcp->l_name);
347 show_load(lcp->l_item);
348 show_capab(lcp->l_flags, land_chr_flags);
354 show_land_stats(int tlev)
356 struct chr_index chridx[sizeof(lchr) / sizeof(*lchr)];
357 int n = make_lchr_index(chridx, tlev);
361 pr("%25s s v s r r a f a a x l\n", "");
362 pr("%25s p i p a n c i m a p n\n", "");
363 pr("%25s att def vul d s y d g c r m f l d\n", "");
364 for (i = 0; i < n; i++) {
365 lcp = &lchr[chridx[i].type];
366 pr("%-25s %1.1f %1.1f %3d %2d %2d %2d %2d %2d %2d %2d %2d %2d"
369 l_att(lcp, tlev), l_def(lcp, tlev), l_vul(lcp, tlev),
370 l_spd(lcp, tlev), lcp->l_vis, lcp->l_spy, lcp->l_rad,
371 l_frg(lcp, tlev), l_acc(lcp, tlev), l_dam(lcp, tlev),
372 lcp->l_ammo, lcp->l_aaf, lcp->l_nxlight, lcp->l_nland);
377 show_sect_build(int foo)
381 pr(" desig build 100%% eff maint\n"
382 "sector type $ lcm hcm $ $\n");
383 for (i = 0; dchr[i].d_name; i++) {
384 if (dchr[i].d_mnem == 0)
386 if (dchr[i].d_mob0 < 0)
388 if (dchr[i].d_cost <= 0 && dchr[i].d_build == 1
389 && dchr[i].d_lcms == 0 && dchr[i].d_hcms == 0
390 && dchr[i].d_maint == 0)
391 continue; /* the usual, skip */
392 pr("%c %-21.21s", dchr[i].d_mnem, dchr[i].d_name);
393 if (dchr[i].d_cost < 0)
396 pr(" %5d", dchr[i].d_cost);
397 pr(" %5d%5d %5d %5d\n",
398 100 * dchr[i].d_lcms,
399 100 * dchr[i].d_hcms,
400 100 * dchr[i].d_build,
401 dchr[i].d_maint * etu_per_update);
403 pr("any other 0 0 0 100 0\n");
406 for (i = 0; intrchr[i].in_name; i++) {
407 if (!intrchr[i].in_enable)
410 pr("\nInfrastructure building - adding 1 point of efficiency costs:\n"
411 " type lcms hcms mobility $$$$\n");
412 pr("%-20s %4d %4d %8d %4d\n",
413 intrchr[i].in_name, intrchr[i].in_lcms, intrchr[i].in_hcms,
414 intrchr[i].in_mcost, intrchr[i].in_dcost);
420 show_sect_stats(int foo)
423 struct natstr *natp = getnatp(player->cnum);
425 pr(" mob cost max max naviga packing max\n");
426 pr(" sector type 0%% 100%% off def bility bonus pop\n");
428 for (i = 0; dchr[i].d_name; i++) {
429 if (dchr[i].d_mnem == 0)
431 pr("%c %-21.21s", dchr[i].d_mnem, dchr[i].d_name);
432 if (dchr[i].d_mob0 < 0)
435 pr(" %3.1f %3.1f", dchr[i].d_mob0, dchr[i].d_mob1);
436 pr(" %5.2f %5.2f %7.7s %10.10s %5d\n",
437 dchr[i].d_ostr, dchr[i].d_dstr,
438 symbol_by_value(dchr[i].d_nav, sector_navigation),
439 symbol_by_value(dchr[i].d_pkg, packing),
440 max_population(natp->nat_level[NAT_RLEV], i, 100));
445 show_sect_capab(int foo)
449 pr(" sector type product p.e.\n");
451 for (i = 0; dchr[i].d_name; i++) {
452 if (dchr[i].d_mnem == 0 || dchr[i].d_prd < 0)
454 pr("%c %-23s %-7s %4d%%\n",
455 dchr[i].d_mnem, dchr[i].d_name, pchr[dchr[i].d_prd].p_sname,
465 pr("item value sell lbs packing melt item\n");
466 pr("mnem in no wh ur bk deno name\n");
468 for (ip = ichr; ip->i_name; ip++) {
469 pr(" %c %5d %4s %3d %2d %2d %2d %2d %2d %4d %s\n",
470 ip->i_mnem, ip->i_value, ip->i_sell ? "yes" : "no", ip->i_lbs,
471 ip->i_pkg[IPKG], ip->i_pkg[NPKG], ip->i_pkg[WPKG],
472 ip->i_pkg[UPKG], ip->i_pkg[BPKG],
473 ip->i_melt_denom, ip->i_name);
478 show_product(int tlev)
484 pr("product cost raw materials reso dep level p.e.\n");
486 for (pp = pchr; pp->p_sname; pp++) {
487 pr("%7.7s %c $%-3d ",
489 pp->p_type < 0 ? ' ' : ichr[pp->p_type].i_mnem,
491 (void)CANT_HAPPEN(MAXPRCON > 3); /* output has only three columns */
492 for (i = 0; i < 3; i++) {
493 if (i < MAXPRCON && pp->p_camt[i]
494 && pp->p_ctype[i] > I_NONE && pp->p_ctype[i] <= I_MAX)
495 pr(" %2d%c", pp->p_camt[i], ichr[pp->p_ctype[i]].i_mnem);
501 symbol_by_value(pp->p_nrndx, resources), pp->p_nrdep);
507 lev = symbol_by_value(pp->p_nlndx, level);
508 pr("(%.4s%+d)/(%.4s%+d)\n",
509 lev, -pp->p_nlmin, lev, pp->p_nllag - pp->p_nlmin);
519 pr("id category good will\n");
522 for (i = 1; i < N_MAX_VERB + 1; i++) {
523 if (rpt[i].r_newspage == N_NOTUSED)
525 pr("%-2d %-20.20s %4d\n", rpt[i].r_uid,
526 page_headings[rpt[i].r_newspage].name, rpt[i].r_good_will);
527 for (j = 0; j < NUM_RPTS; j++)
528 pr(" %s\n", rpt[i].r_newstory[j]);
533 * Show update policy and up to N scheduled updates.
538 struct gamestr *game = game_tick_tick();
542 pr("%s, Turn %d, ETU %d\n", fmttime2822(time(NULL)),
543 game->game_turn, game->game_tick);
545 if (update_time[0]) {
546 if (update_demand == UPD_DEMAND_SCHED) {
547 pr("Demand updates occur according to schedule:\n");
550 pr("Updates occur according to schedule:\n");
551 for (i = 0; i < n && update_time[i]; i++)
552 pr("%3d. %s\n", game->game_turn + i,
553 fmttime2822(update_time[i]));
555 pr("Updates occur within %d seconds after the scheduled time\n",
559 pr("There are no updates scheduled.\n");
561 if (update_demand == UPD_DEMAND_ASYNC) {
562 pr("Demand updates occur right after the demand is set.\n");
563 if (*update_demandtimes != 0) {
564 pr("Demand updates are allowed during: %s\n",
571 pr("Demand updates require %d country(s) to want one.\n",
575 if (updates_disabled())
576 pr("\nUPDATES ARE DISABLED!\n");
580 * Return T formatted according to RFC 2822.
581 * The return value is statically allocated and overwritten on
585 fmttime2822(time_t t)
591 TIME_ZONE_INFORMATION tzi;
595 time = localtime(&t);
597 n = strftime(buf, sizeof(buf), "%a, %d %b %Y %H:%M:%S", time);
598 if (CANT_HAPPEN(n == 0)) {
602 GetTimeZoneInformation(&tzi);
603 time_offset = -(tzi.Bias +
604 (time->tm_isdst ? tzi.DaylightBias : tzi.StandardBias));
606 nn = _snprintf(buf + n, sizeof(buf) - n, " %+03d%02d",
607 time_offset / 60, abs(time_offset) % 60);
608 if (CANT_HAPPEN(nn <= 0 || nn + n >= sizeof(buf)))
611 size_t n = strftime(buf, sizeof(buf), "%a, %d %b %Y %T %z",
613 if (CANT_HAPPEN(n == 0))
620 show_load(short item[])
624 for (i = I_NONE + 1; i <= I_MAX; ++i) {
626 pr(" %d%c", item[i], ichr[i].i_mnem);
631 show_capab(int flags, struct symbol *table)
636 for (i = 0; i < 32; i++) {
637 if (!(flags & bit(i)))
639 p = symbol_by_value(bit(i), table);