/*
* Empire - A multi-player, client/server Internet based war game.
- * Copyright (C) 1986-2004, Dave Pare, Jeff Bailey, Thomas Ruschak,
- * Ken Stevens, Steve McClure
+ * Copyright (C) 1986-2011, Dave Pare, Jeff Bailey, Thomas Ruschak,
+ * Ken Stevens, Steve McClure, Markus Armbruster
*
- * This program is free software; you can redistribute it and/or modify
+ * Empire is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2 of the License, or
+ * the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* ---
*
- * 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.
*
* ---
*
* lostsub.c: Subroutines for lost items
- *
+ *
* Known contributors to this file:
* Steve McClure, 1997
+ * Markus Armbruster, 2008
*/
-#include "misc.h"
-#include "player.h"
-#include "var.h"
+#include <config.h>
+
#include "file.h"
-#include "land.h"
-#include "ship.h"
-#include "xy.h"
-#include "nat.h"
-#include "nsc.h"
-#include "plane.h"
#include "lost.h"
-#include "prototypes.h"
+#include "misc.h"
+#include "optlist.h"
+
+static int findlost(int, natid, int, coord, coord, int);
+
+/*
+ * Record item ID of type TYPE changed owner from EXOWN to OWN at X, Y.
+ */
+void
+lost_and_found(int type, natid exown, natid own, int id, coord x, coord y)
+{
+ if (exown == own)
+ return;
+ if (exown)
+ makelost(type, exown, id, x, y);
+ if (own)
+ makenotlost(type, own, id, x, y);
+}
void
-makelost(char type, natid owner, short int id, coord x, coord y)
+makelost(int type, natid owner, int id, coord x, coord y)
{
struct loststr lost;
int n;
n = findlost(type, owner, id, x, y, 1);
- if (n < 0) {
- ef_extend(EF_LOST, 25);
- n = findlost(type, owner, id, x, y, 1);
- if (n < 0)
- return;
- }
-
- getlost(n, &lost);
+ ef_blank(EF_LOST, n, &lost);
lost.lost_type = type;
lost.lost_owner = owner;
lost.lost_id = id;
lost.lost_x = x;
lost.lost_y = y;
- lost.lost_uid = n;
- time(&lost.lost_timestamp);
putlost(n, &lost);
}
void
-makenotlost(char type, natid owner, short int id, coord x, coord y)
+makenotlost(int type, natid owner, int id, coord x, coord y)
{
struct loststr lost;
int n;
return;
getlost(n, &lost);
lost.lost_owner = 0;
- lost.lost_timestamp = 0;
putlost(n, &lost);
}
-int
-findlost(char type, natid owner, short int id, coord x, coord y, int free)
-
-
-
-
- /* Give me the item of a free slot */
+/*
+ * Find a suitable slot in the lost file.
+ * If a record for TYPE, OWNER, ID, X, Y exists, return its index.
+ * Else if FREE is non-zero, return the index of an unused record.
+ * Else return -1.
+ */
+static int
+findlost(int type, natid owner, int id, coord x, coord y, int free)
{
struct loststr lost;
int n;
int freeslot = -1;
-/* Find a free slot, or find this item again */
for (n = 0; getlost(n, &lost); n++) {
- if (!lost.lost_owner && freeslot == -1 && free == 1)
+ if (!lost.lost_owner && freeslot < 0)
freeslot = n;
if (!lost.lost_owner)
continue;
if (lost.lost_owner == owner && type == lost.lost_type) {
- if (type == EF_SECTOR && lost.lost_x == x && lost.lost_y == y) {
- freeslot = n;
- break;
- } else if (lost.lost_id == id) {
- freeslot = n;
- break;
- }
+ if (type == EF_SECTOR && lost.lost_x == x && lost.lost_y == y)
+ return n;
+ else if (lost.lost_id == id)
+ return n;
}
}
- return freeslot;
+
+ if (free) {
+ if (freeslot < 0)
+ freeslot = n;
+ return freeslot;
+ }
+
+ return -1;
+}
+
+void
+delete_old_lostitems(void)
+{
+ time_t expiry_time = time(NULL) - hours(lost_keep_hours);
+ struct loststr lost;
+ int i;
+
+ for (i = 0; getlost(i, &lost); i++) {
+ if (!lost.lost_owner)
+ continue;
+ if (lost.lost_timestamp >= expiry_time)
+ continue;
+ lost.lost_owner = 0;
+ putlost(i, &lost);
+ }
}