/*
* Empire - A multi-player, client/server Internet based war game.
- * Copyright (C) 1986-2000, Dave Pare, Jeff Bailey, Thomas Ruschak,
+ * Copyright (C) 1986-2006, Dave Pare, Jeff Bailey, Thomas Ruschak,
* Ken Stevens, Steve McClure
*
* This program is free software; you can redistribute it and/or modify
*
* ---
*
- * See the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
- * related information and legal notices. It is expected that any future
- * projects/authors will amend these files as needed.
+ * See files README, COPYING and CREDITS in the root of the source
+ * tree for related information and legal notices. It is expected
+ * that future projects/authors will amend these files as needed.
*
* ---
*
*
*/
+#include <config.h>
+
#include "misc.h"
#include "player.h"
-#include "var.h"
#include "xy.h"
#include "sect.h"
#include "nat.h"
#include "nsc.h"
-#include "deity.h"
#include "file.h"
#include "product.h"
#include "commands.h"
int
grin(void)
{
- struct nstr_sect nstr;
- int vec[I_MAX+1];
- struct sctstr sect;
- s_char *p;
- int i,n,qty;
- int avail;
- s_char buf[1024];
+ struct nstr_sect nstr;
+ struct sctstr sect;
+ s_char *p;
+ int i, n, qty;
+ int avail;
+ s_char buf[1024];
+ double grind_eff = 0.8;
- if ((p = getstarg(player->argp[1], "Sectors? ", buf)) == 0)
- return RET_SYN;
- if (!snxtsct(&nstr, p))
- return RET_SYN;
- if ((p = getstarg(player->argp[2], "amount : ", buf)) == 0 || *p == 0)
- return RET_SYN;
- qty = atoi(p);
- if(qty < 0)
- return RET_SYN;
- while (nxtsct(&nstr, §)) {
- if (!player->owner)
- continue;
-/* getsect(item.sct_x, item.sct_y, §); */
- if (sect.sct_effic < 60 || sect.sct_own != player->cnum)
- continue;
- getvec(VT_ITEM, vec, (s_char *)§, EF_SECTOR);
- n = (vec[I_BAR] >= qty) ? qty : vec[I_BAR];
- avail = n * 5.0;
- if(avail > sect.sct_avail) {
- n = sect.sct_avail / 5;
- avail = sect.sct_avail;
- if(n == 0)
- continue;
- }
- if (n) {
- vec[I_BAR] -= n;
- pr("%d bars ground up in %s\n", n,
- xyas(sect.sct_x, sect.sct_y, player->cnum));
- for (i = 0; i < pchr[P_BAR].p_nv; i++) {
- vec[unitem(pchr[P_BAR].p_vtype[i])] += (int)((n *
- pchr[P_BAR].p_vamt[i]) * 0.8);
- }
- putvec(VT_ITEM, vec, (s_char *)§, EF_SECTOR);
- sect.sct_avail -= avail;
- putsect(§);
- }
+ if ((p = getstarg(player->argp[1], "Sectors? ", buf)) == 0)
+ return RET_SYN;
+ if (!snxtsct(&nstr, p))
+ return RET_SYN;
+ if ((p = getstarg(player->argp[2], "amount : ", buf)) == 0 || *p == 0)
+ return RET_SYN;
+ qty = atoi(p);
+ if (qty < 0)
+ return RET_SYN;
+ while (nxtsct(&nstr, §)) {
+ if (!player->owner)
+ continue;
+ if (sect.sct_effic < 60 || sect.sct_own != player->cnum)
+ continue;
+ n = sect.sct_item[I_BAR] >= qty ? qty : sect.sct_item[I_BAR];
+ /* work limit */
+ avail = n * 5;
+ if (avail > sect.sct_avail) {
+ n = sect.sct_avail / 5;
+ avail = sect.sct_avail;
+ }
+ /* space limit */
+ for (i = 0; i < MAXPRCON; i++) {
+ if (!pchr[P_BAR].p_camt[i])
+ continue;
+ if (CANT_HAPPEN(pchr[P_BAR].p_ctype[i] <= I_NONE ||
+ pchr[P_BAR].p_ctype[i] > I_MAX))
+ continue;
+ n = MIN(n,
+ (double)(ITEM_MAX - sect.sct_item[pchr[P_BAR].p_ctype[i]])
+ / (pchr[P_BAR].p_camt[i] * grind_eff));
}
- return RET_OK;
-}
+ if (n > 0) {
+ pr("%d bars ground up in %s\n", n,
+ xyas(sect.sct_x, sect.sct_y, player->cnum));
+ sect.sct_item[I_BAR] -= n;
+ for (i = 0; i < MAXPRCON; i++) {
+ if (!pchr[P_BAR].p_camt[i])
+ continue;
+ if (CANT_HAPPEN(pchr[P_BAR].p_ctype[i] <= I_NONE ||
+ pchr[P_BAR].p_ctype[i] > I_MAX))
+ continue;
+ sect.sct_item[pchr[P_BAR].p_ctype[i]]
+ += n * pchr[P_BAR].p_camt[i] * grind_eff;
+ }
+ sect.sct_avail -= avail;
+ putsect(§);
+ }
+ }
+ return RET_OK;
+}