ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/object.C
(Generate patch)

Comparing deliantra/server/common/object.C (file contents):
Revision 1.11 by root, Sun Sep 3 00:18:40 2006 UTC vs.
Revision 1.62 by root, Mon Dec 11 23:35:37 2006 UTC

1/*
2 * static char *rcsid_object_c =
3 * "$Id: object.C,v 1.11 2006/09/03 00:18:40 root Exp $";
4 */
5
6/* 1/*
7 CrossFire, A Multiplayer game for X-windows 2 CrossFire, A Multiplayer game for X-windows
8 3
9 Copyright (C) 2001 Mark Wedel & Crossfire Development Team 4 Copyright (C) 2001 Mark Wedel & Crossfire Development Team
10 Copyright (C) 1992 Frank Tore Johansen 5 Copyright (C) 1992 Frank Tore Johansen
… …
21 16
22 You should have received a copy of the GNU General Public License 17 You should have received a copy of the GNU General Public License
23 along with this program; if not, write to the Free Software 18 along with this program; if not, write to the Free Software
24 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25 20
26 The authors can be reached via e-mail at crossfire-devel@real-time.com 21 The authors can be reached via e-mail at <crossfire@schmorp.de>
27*/ 22*/
28 23
29/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 24/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
30 sub/add_weight will transcend the environment updating the carrying 25 sub/add_weight will transcend the environment updating the carrying
31 variable. */ 26 variable. */
32#include <global.h> 27#include <global.h>
33#ifndef WIN32 /* ---win32 exclude headers */
34#include <stdio.h> 28#include <stdio.h>
35#include <sys/types.h> 29#include <sys/types.h>
36#include <sys/uio.h> 30#include <sys/uio.h>
37#endif /* win32 */
38#include <object.h> 31#include <object.h>
39#include <funcpoint.h> 32#include <funcpoint.h>
40#include <skills.h>
41#include <loader.h> 33#include <loader.h>
42#ifdef MEMORY_DEBUG 34
43int nroffreeobjects = 0;
44int nrofallocobjects = 0; 35int nrofallocobjects = 0;
45#undef OBJ_EXPAND 36static UUID uuid;
46#define OBJ_EXPAND 1 37const uint64 UUID_SKIP = 1<<19;
47#else
48object objarray[STARTMAX]; /* All objects, allocated this way at first */
49int nroffreeobjects = STARTMAX; /* How many OBs allocated and free (free) */
50int nrofallocobjects = STARTMAX; /* How many OBs allocated (free + used) */
51#endif
52 38
53object *objects; /* Pointer to the list of used objects */
54object *free_objects; /* Pointer to the list of unused objects */
55object *active_objects; /* List of active objects that need to be processed */ 39object *active_objects; /* List of active objects that need to be processed */
56 40
57short freearr_x[SIZEOFFREE]= 41short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1,
58 {0,0,1,1,1,0,-1,-1,-1,0,1,2,2,2,2,2,1,0,-1,-2,-2,-2,-2,-2,-1,
59 0,1,2,3,3,3,3,3,3,3,2,1,0,-1,-2,-3,-3,-3,-3,-3,-3,-3,-2,-1}; 42 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
60short freearr_y[SIZEOFFREE]= 43};
61 {0,-1,-1,0,1,1,1,0,-1,-2,-2,-2,-1,0,1,2,2,2,2,2,1,0,-1,-2,-2, 44short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
62 -3,-3,-3,-3,-2,-1,0,1,2,3,3,3,3,3,3,3,2,1,0,-1,-2,-3,-3,-3}; 45 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
63int maxfree[SIZEOFFREE]= 46};
64 {0,9,10,13,14,17,18,21,22,25,26,27,30,31,32,33,36,37,39,39,42,43,44,45, 47int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45,
65 48,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49}; 48 48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49
49};
66int freedir[SIZEOFFREE]= { 50int freedir[SIZEOFFREE] = {
67 0,1,2,3,4,5,6,7,8,1,2,2,2,3,4,4,4,5,6,6,6,7,8,8,8, 51 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8,
68 1,2,2,2,2,2,3,4,4,4,4,4,5,6,6,6,6,6,7,8,8,8,8,8}; 52 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
53};
69 54
55static void
56write_uuid (void)
57{
58 char filename1[MAX_BUF], filename2[MAX_BUF];
59
60 sprintf (filename1, "%s/uuid", settings.localdir);
61 sprintf (filename2, "%s/uuid~", settings.localdir);
62
63 FILE *fp;
64
65 if (!(fp = fopen (filename2, "w")))
66 {
67 LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2);
68 return;
69 }
70
71 fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2);
72 fclose (fp);
73 rename (filename2, filename1);
74}
75
76static void
77read_uuid (void)
78{
79 char filename[MAX_BUF];
80
81 sprintf (filename, "%s/uuid", settings.localdir);
82
83 FILE *fp;
84
85 if (!(fp = fopen (filename, "r")))
86 {
87 if (errno == ENOENT)
88 {
89 LOG (llevInfo, "RESET uid to 1\n");
90 uuid.seq = 0;
91 write_uuid ();
92 return;
93 }
94
95 LOG (llevError, "FATAL: cannot open %s for reading!\n", filename);
96 _exit (1);
97 }
98
99 int version;
100 unsigned long long uid;
101 if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1)
102 {
103 LOG (llevError, "FATAL: error reading uid from %s!\n", filename);
104 _exit (1);
105 }
106
107 uuid.seq = uid;
108 write_uuid ();
109 LOG (llevDebug, "read UID: %" PRId64 "\n", uid);
110 fclose (fp);
111}
112
113UUID
114gen_uuid ()
115{
116 UUID uid;
117
118 uid.seq = ++uuid.seq;
119
120 if (!(uuid.seq & (UUID_SKIP - 1)))
121 write_uuid ();
122
123 return uid;
124}
125
126void
127init_uuid ()
128{
129 read_uuid ();
130}
70 131
71/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 132/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
133static int
72static int compare_ob_value_lists_one(const object * wants, const object * has) { 134compare_ob_value_lists_one (const object *wants, const object *has)
135{
73 key_value * wants_field; 136 key_value *wants_field;
74 137
75 /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both 138 /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
76 * objects with lists are rare, and lists stay short. If not, use a 139 * objects with lists are rare, and lists stay short. If not, use a
77 * different structure or at least keep the lists sorted... 140 * different structure or at least keep the lists sorted...
78 */ 141 */
79 142
80 /* For each field in wants, */ 143 /* For each field in wants, */
81 for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next) { 144 for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)
145 {
82 key_value * has_field; 146 key_value *has_field;
83 147
84 /* Look for a field in has with the same key. */ 148 /* Look for a field in has with the same key. */
85 has_field = get_ob_key_link(has, wants_field->key); 149 has_field = get_ob_key_link (has, wants_field->key);
150
151 if (has_field == NULL)
86 152 {
87 if (has_field == NULL) {
88 /* No field with that name. */ 153 /* No field with that name. */
89 return FALSE; 154 return FALSE;
90 }
91 155 }
156
92 /* Found the matching field. */ 157 /* Found the matching field. */
93 if (has_field->value != wants_field->value) { 158 if (has_field->value != wants_field->value)
159 {
94 /* Values don't match, so this half of the comparison is false. */ 160 /* Values don't match, so this half of the comparison is false. */
95 return FALSE; 161 return FALSE;
96 } 162 }
97 163
98 /* If we get here, we found a match. Now for the next field in wants. */ 164 /* If we get here, we found a match. Now for the next field in wants. */
99 }
100 165 }
166
101 /* If we get here, every field in wants has a matching field in has. */ 167 /* If we get here, every field in wants has a matching field in has. */
102 return TRUE; 168 return TRUE;
103} 169}
104 170
105/* Returns TRUE if ob1 has the same key_values as ob2. */ 171/* Returns TRUE if ob1 has the same key_values as ob2. */
172static int
106static int compare_ob_value_lists(const object * ob1, const object * ob2) { 173compare_ob_value_lists (const object *ob1, const object *ob2)
174{
107 /* However, there may be fields in has which aren't partnered in wants, 175 /* However, there may be fields in has which aren't partnered in wants,
108 * so we need to run the comparison *twice*. :( 176 * so we need to run the comparison *twice*. :(
109 */ 177 */
110 return compare_ob_value_lists_one(ob1, ob2) && compare_ob_value_lists_one(ob2, ob1); 178 return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);
111} 179}
112 180
113/* Function examines the 2 objects given to it, and returns true if 181/* Function examines the 2 objects given to it, and returns true if
114 * they can be merged together. 182 * they can be merged together.
115 * 183 *
… …
121 * 189 *
122 * Improvements made with merge: Better checking on potion, and also 190 * Improvements made with merge: Better checking on potion, and also
123 * check weight 191 * check weight
124 */ 192 */
125 193
126int CAN_MERGE(object *ob1, object *ob2) { 194bool object::can_merge (object *ob1, object *ob2)
127 195{
128 /* A couple quicksanity checks */ 196 /* A couple quicksanity checks */
129 if ((ob1 == ob2) || (ob1->type != ob2->type)) return 0; 197 if ((ob1 == ob2) || (ob1->type != ob2->type))
198 return 0;
130 199
131 if (ob1->speed != ob2->speed) return 0; 200 if (ob1->speed != ob2->speed)
132 /* Note sure why the following is the case - either the object has to 201 return 0;
133 * be animated or have a very low speed. Is this an attempted monster 202
134 * check? 203 /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
204 * value could not be stored in a sint32 (which unfortunately sometimes is
205 * used to store nrof).
135 */ 206 */
136 if (!QUERY_FLAG(ob1,FLAG_ANIMATE) && FABS((ob1)->speed) > MIN_ACTIVE_SPEED) 207 if (ob1->nrof + ob2->nrof >= 1UL << 31)
208 return 0;
209
210 /* If the objects have been identified, set the BEEN_APPLIED flag.
211 * This is to the comparison of the flags below will be OK. We
212 * just can't ignore the been applied or identified flags, as they
213 * are not equal - just if it has been identified, the been_applied
214 * flags lose any meaning.
215 */
216 if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
217 SET_FLAG (ob1, FLAG_BEEN_APPLIED);
218
219 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
220 SET_FLAG (ob2, FLAG_BEEN_APPLIED);
221
222
223 /* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something
224 * being locked in inventory should prevent merging.
225 * 0x4 in flags3 is CLIENT_SENT
226 */
227 if ((ob1->arch != ob2->arch) ||
228 (ob1->flags[0] != ob2->flags[0]) ||
229 (ob1->flags[1] != ob2->flags[1]) ||
230 ((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) ||
231 ((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
232 (ob1->name != ob2->name) ||
233 (ob1->title != ob2->title) ||
234 (ob1->msg != ob2->msg) ||
235 (ob1->weight != ob2->weight) ||
236 (memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) ||
237 (memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) ||
238 (ob1->attacktype != ob2->attacktype) ||
239 (ob1->magic != ob2->magic) ||
240 (ob1->slaying != ob2->slaying) ||
241 (ob1->skill != ob2->skill) ||
242 (ob1->value != ob2->value) ||
243 (ob1->animation_id != ob2->animation_id) ||
244 (ob1->client_type != ob2->client_type) ||
245 (ob1->materialname != ob2->materialname) ||
246 (ob1->lore != ob2->lore) ||
247 (ob1->subtype != ob2->subtype) ||
248 (ob1->move_type != ob2->move_type) ||
249 (ob1->move_block != ob2->move_block) ||
250 (ob1->move_allow != ob2->move_allow) ||
251 (ob1->move_on != ob2->move_on) ||
252 (ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty))
253 return 0;
254
255 /* This is really a spellbook check - really, we should
256 * check all objects in the inventory.
257 */
258 if (ob1->inv || ob2->inv)
259 {
260 /* if one object has inventory but the other doesn't, not equiv */
261 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
137 return 0; 262 return 0;
138 263
139 /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that 264 /* Now check to see if the two inventory objects could merge */
140 * value could not be stored in a sint32 (which unfortunately sometimes is 265 if (!CAN_MERGE (ob1->inv, ob2->inv))
141 * used to store nrof).
142 */
143 if (ob1->nrof+ob2->nrof >= 1UL<<31)
144 return 0; 266 return 0;
145 267
146 /* This is really a spellbook check - really, we should
147 * check all objects in the inventory.
148 */
149 if (ob1->inv || ob2->inv) {
150 /* if one object has inventory but the other doesn't, not equiv */
151 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) return 0;
152
153 /* Now check to see if the two inventory objects could merge */
154 if (!CAN_MERGE(ob1->inv, ob2->inv)) return 0;
155
156 /* inventory ok - still need to check rest of this object to see 268 /* inventory ok - still need to check rest of this object to see
157 * if it is valid. 269 * if it is valid.
158 */ 270 */
159 } 271 }
160 272
161 /* If the objects have been identified, set the BEEN_APPLIED flag.
162 * This is to the comparison of the flags below will be OK. We
163 * just can't ignore the been applied or identified flags, as they
164 * are not equal - just if it has been identified, the been_applied
165 * flags lose any meaning.
166 */
167 if (QUERY_FLAG(ob1, FLAG_IDENTIFIED))
168 SET_FLAG(ob1, FLAG_BEEN_APPLIED);
169
170 if (QUERY_FLAG(ob2, FLAG_IDENTIFIED))
171 SET_FLAG(ob2, FLAG_BEEN_APPLIED);
172
173
174 /* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something
175 * being locked in inventory should prevent merging.
176 * 0x4 in flags3 is CLIENT_SENT
177 */
178 if ((ob1->arch != ob2->arch) ||
179 (ob1->flags[0] != ob2->flags[0]) ||
180 (ob1->flags[1] != ob2->flags[1]) ||
181 ((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~ 0x400000)) ||
182 ((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
183 (ob1->name != ob2->name) ||
184 (ob1->title != ob2->title) ||
185 (ob1->msg != ob2->msg) ||
186 (ob1->weight != ob2->weight) ||
187 (memcmp(&ob1->resist, &ob2->resist, sizeof(ob1->resist))!=0) ||
188 (memcmp(&ob1->stats, &ob2->stats, sizeof(ob1->stats))!=0) ||
189 (ob1->attacktype != ob2->attacktype) ||
190 (ob1->magic != ob2->magic) ||
191 (ob1->slaying != ob2->slaying) ||
192 (ob1->skill != ob2->skill) ||
193 (ob1->value != ob2->value) ||
194 (ob1->animation_id != ob2->animation_id) ||
195 (ob1->client_type != ob2->client_type) ||
196 (ob1->materialname != ob2->materialname) ||
197 (ob1->lore != ob2->lore) ||
198 (ob1->subtype != ob2->subtype) ||
199 (ob1->move_type != ob2->move_type) ||
200 (ob1->move_block != ob2->move_block) ||
201 (ob1->move_allow != ob2->move_allow) ||
202 (ob1->move_on != ob2->move_on) ||
203 (ob1->move_off != ob2->move_off) ||
204 (ob1->move_slow != ob2->move_slow) ||
205 (ob1->move_slow_penalty != ob2->move_slow_penalty)
206 )
207 return 0;
208
209 /* Don't merge objects that are applied. With the new 'body' code, 273 /* Don't merge objects that are applied. With the new 'body' code,
210 * it is possible for most any character to have more than one of 274 * it is possible for most any character to have more than one of
211 * some items equipped, and we don't want those to merge. 275 * some items equipped, and we don't want those to merge.
212 */ 276 */
213 if (QUERY_FLAG(ob1, FLAG_APPLIED) || QUERY_FLAG(ob2, FLAG_APPLIED)) 277 if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED))
278 return 0;
279
280 /* Note sure why the following is the case - either the object has to
281 * be animated or have a very low speed. Is this an attempted monster
282 * check?
283 */
284 if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)
285 return 0;
286
287 switch (ob1->type)
288 {
289 case SCROLL:
290 if (ob1->level != ob2->level)
291 return 0;
292 break;
293 }
294
295 if (ob1->key_values != NULL || ob2->key_values != NULL)
296 {
297 /* At least one of these has key_values. */
298 if ((ob1->key_values == NULL) != (ob2->key_values == NULL))
299 /* One has fields, but the other one doesn't. */
214 return 0; 300 return 0;
215
216 switch (ob1->type) {
217 case SCROLL:
218 if (ob1->level != ob2->level) return 0;
219 break;
220
221 }
222 if (ob1->key_values != NULL || ob2->key_values != NULL) {
223 /* At least one of these has key_values. */
224 if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) {
225 /* One has fields, but the other one doesn't. */
226 return 0;
227 } else if (!compare_ob_value_lists(ob1, ob2)) { 301 else if (!compare_ob_value_lists (ob1, ob2))
228 return 0; 302 return 0;
229 } 303 }
304
305 //TODO: generate an event or call into perl for additional checks
306 if (ob1->self || ob2->self)
230 } 307 {
308 ob1->optimise ();
309 ob2->optimise ();
231 310
311 if (ob1->self || ob2->self)
312 return 0;
313 }
314
232 /* Everything passes, must be OK. */ 315 /* Everything passes, must be OK. */
233 return 1; 316 return 1;
234} 317}
235 318
236/* 319/*
237 * sum_weight() is a recursive function which calculates the weight 320 * sum_weight() is a recursive function which calculates the weight
238 * an object is carrying. It goes through in figures out how much 321 * an object is carrying. It goes through in figures out how much
239 * containers are carrying, and sums it up. 322 * containers are carrying, and sums it up.
240 */ 323 */
241signed long sum_weight(object *op) { 324long
325sum_weight (object *op)
326{
242 signed long sum; 327 long sum;
243 object *inv; 328 object *inv;
329
244 for(sum = 0, inv = op->inv; inv != NULL; inv = inv->below) { 330 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)
331 {
245 if (inv->inv) 332 if (inv->inv)
246 sum_weight(inv); 333 sum_weight (inv);
247 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 334 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
248 } 335 }
336
249 if (op->type == CONTAINER && op->stats.Str) 337 if (op->type == CONTAINER && op->stats.Str)
250 sum = (sum * (100 - op->stats.Str))/100; 338 sum = (sum * (100 - op->stats.Str)) / 100;
339
251 if(op->carrying != sum) 340 if (op->carrying != sum)
252 op->carrying = sum; 341 op->carrying = sum;
342
253 return sum; 343 return sum;
254} 344}
255 345
256/** 346/**
257 * Return the outermost environment object for a given object. 347 * Return the outermost environment object for a given object.
258 */ 348 */
259 349
350object *
260object *object_get_env_recursive (object *op) { 351object_get_env_recursive (object *op)
352{
261 while (op->env != NULL) 353 while (op->env != NULL)
262 op = op->env; 354 op = op->env;
263 return op; 355 return op;
264} 356}
265 357
266/* 358/*
267 * Eneq(@csd.uu.se): Since we can have items buried in a character we need 359 * Eneq(@csd.uu.se): Since we can have items buried in a character we need
268 * a better check. We basically keeping traversing up until we can't 360 * a better check. We basically keeping traversing up until we can't
269 * or find a player. 361 * or find a player.
270 */ 362 */
271 363
364object *
272object *is_player_inv (object *op) { 365is_player_inv (object *op)
366{
273 for (;op!=NULL&&op->type!=PLAYER; op=op->env) 367 for (; op != NULL && op->type != PLAYER; op = op->env)
274 if (op->env==op) 368 if (op->env == op)
275 op->env = NULL; 369 op->env = NULL;
276 return op; 370 return op;
277} 371}
278 372
279/* 373/*
280 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 374 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
281 * Some error messages. 375 * Some error messages.
282 * The result of the dump is stored in the static global errmsg array. 376 * The result of the dump is stored in the static global errmsg array.
283 */ 377 */
284 378
285void dump_object2(object *op) { 379char *
286errmsg[0] = 0;
287return;
288 //TODO//D#d#
289#if 0
290 char *cp;
291/* object *tmp;*/
292
293 if(op->arch!=NULL) {
294 strcat(errmsg,"arch ");
295 strcat(errmsg,op->arch->name?op->arch->name:"(null)");
296 strcat(errmsg,"\n");
297 if((cp=get_ob_diff(op,&empty_archetype->clone))!=NULL)
298 strcat(errmsg,cp);
299#if 0
300 /* Don't dump player diffs - they are too long, mostly meaningless, and
301 * will overflow the buffer.
302 * Changed so that we don't dump inventory either. This may
303 * also overflow the buffer.
304 */
305 if(op->type!=PLAYER && (cp=get_ob_diff(op,&empty_archetype->clone))!=NULL)
306 strcat(errmsg,cp);
307 for (tmp=op->inv; tmp; tmp=tmp->below)
308 dump_object2(tmp);
309#endif
310 strcat(errmsg,"end\n");
311 } else {
312 strcat(errmsg,"Object ");
313 if (op->name==NULL) strcat(errmsg, "(null)");
314 else strcat(errmsg,op->name);
315 strcat(errmsg,"\n");
316#if 0
317 if((cp=get_ob_diff(op,&empty_archetype->clone))!=NULL)
318 strcat(errmsg,cp);
319 for (tmp=op->inv; tmp; tmp=tmp->below)
320 dump_object2(tmp);
321#endif
322 strcat(errmsg,"end\n");
323 }
324#endif
325}
326
327/*
328 * Dumps an object. Returns output in the static global errmsg array.
329 */
330
331void dump_object(object *op) { 380dump_object (object *op)
332 if(op==NULL) { 381{
333 strcpy(errmsg,"[NULL pointer]"); 382 if (!op)
334 return; 383 return strdup ("[NULLOBJ]");
335 }
336 errmsg[0]='\0';
337 dump_object2(op);
338}
339 384
340void dump_all_objects(void) { 385 object_freezer freezer;
341 object *op; 386 save_object (freezer, op, 3);
342 for(op=objects;op!=NULL;op=op->next) { 387 return freezer.as_string ();
343 dump_object(op);
344 fprintf(logfile, "Object %d\n:%s\n", op->count, errmsg);
345 }
346} 388}
347 389
348/* 390/*
349 * get_nearest_part(multi-object, object 2) returns the part of the 391 * get_nearest_part(multi-object, object 2) returns the part of the
350 * multi-object 1 which is closest to the second object. 392 * multi-object 1 which is closest to the second object.
351 * If it's not a multi-object, it is returned. 393 * If it's not a multi-object, it is returned.
352 */ 394 */
353 395
396object *
354object *get_nearest_part(object *op, const object *pl) { 397get_nearest_part (object *op, const object *pl)
398{
355 object *tmp,*closest; 399 object *tmp, *closest;
356 int last_dist,i; 400 int last_dist, i;
401
357 if(op->more==NULL) 402 if (op->more == NULL)
358 return op; 403 return op;
359 for(last_dist=distance(op,pl),closest=op,tmp=op->more;tmp!=NULL;tmp=tmp->more) 404 for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)
360 if((i=distance(tmp,pl))<last_dist) 405 if ((i = distance (tmp, pl)) < last_dist)
361 closest=tmp,last_dist=i; 406 closest = tmp, last_dist = i;
362 return closest; 407 return closest;
363} 408}
364 409
365/* 410/*
366 * Returns the object which has the count-variable equal to the argument. 411 * Returns the object which has the count-variable equal to the argument.
367 */ 412 */
368 413
414object *
369object *find_object(tag_t i) { 415find_object (tag_t i)
370 object *op; 416{
371 for(op=objects;op!=NULL;op=op->next) 417 for (object *op = object::first; op; op = op->next)
372 if(op->count==i) 418 if (op->count == i)
373 break; 419 return op;
420
374 return op; 421 return 0;
375} 422}
376 423
377/* 424/*
378 * Returns the first object which has a name equal to the argument. 425 * Returns the first object which has a name equal to the argument.
379 * Used only by the patch command, but not all that useful. 426 * Used only by the patch command, but not all that useful.
380 * Enables features like "patch <name-of-other-player> food 999" 427 * Enables features like "patch <name-of-other-player> food 999"
381 */ 428 */
382 429
430object *
383object *find_object_name(const char *str) { 431find_object_name (const char *str)
384 const char *name = shstr::find (str); 432{
433 shstr_cmp str_ (str);
385 object *op; 434 object *op;
435
386 for(op=objects;op!=NULL;op=op->next) 436 for (op = object::first; op != NULL; op = op->next)
387 if(&op->name == name) 437 if (op->name == str_)
388 break; 438 break;
389 439
390 return op; 440 return op;
391} 441}
392 442
443void
393void free_all_object_data(void) { 444free_all_object_data ()
394#ifdef MEMORY_DEBUG
395 object *op, *next;
396
397 for (op=free_objects; op!=NULL; ) {
398 next=op->next;
399 free(op);
400 nrofallocobjects--;
401 nroffreeobjects--;
402 op=next;
403 }
404#endif
405 LOG(llevDebug,"%d allocated objects, %d free objects, STARMAX=%d\n",
406 nrofallocobjects, nroffreeobjects,STARTMAX);
407}
408
409/*
410 * Returns the object which this object marks as being the owner.
411 * A id-scheme is used to avoid pointing to objects which have been
412 * freed and are now reused. If this is detected, the owner is
413 * set to NULL, and NULL is returned.
414 * Changed 2004-02-12 - if the player is setting at the play again
415 * prompt, he is removed, and we don't want to treat him as an owner of
416 * anything, so check removed flag. I don't expect that this should break
417 * anything - once an object is removed, it is basically dead anyways.
418 */
419
420object *get_owner(object *op) {
421 if(op->owner==NULL)
422 return NULL;
423
424 if (!QUERY_FLAG(op->owner,FLAG_FREED) && !QUERY_FLAG(op->owner, FLAG_REMOVED) &&
425 op->owner->count==op->ownercount)
426 return op->owner;
427
428 op->owner=NULL;
429 op->ownercount=0;
430 return NULL;
431}
432
433void clear_owner(object *op)
434{ 445{
435 if (!op) return; 446 LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
436
437 if (op->owner && op->ownercount == op->owner->count)
438 op->owner->refcount--;
439
440 op->owner = NULL;
441 op->ownercount = 0;
442} 447}
443
444
445 448
446/* 449/*
447 * Sets the owner and sets the skill and exp pointers to owner's current 450 * Sets the owner and sets the skill and exp pointers to owner's current
448 * skill and experience objects. 451 * skill and experience objects.
449 */ 452 */
450void set_owner (object *op, object *owner) 453void
454object::set_owner (object *owner)
451{ 455{
452 if(owner==NULL||op==NULL) 456 if (!owner)
453 return; 457 return;
454 458
455 /* next line added to allow objects which own objects */ 459 /* next line added to allow objects which own objects */
456 /* Add a check for ownercounts in here, as I got into an endless loop 460 /* Add a check for ownercounts in here, as I got into an endless loop
457 * with the fireball owning a poison cloud which then owned the 461 * with the fireball owning a poison cloud which then owned the
458 * fireball. I believe that was caused by one of the objects getting 462 * fireball. I believe that was caused by one of the objects getting
459 * freed and then another object replacing it. Since the ownercounts 463 * freed and then another object replacing it. Since the ownercounts
460 * didn't match, this check is valid and I believe that cause is valid. 464 * didn't match, this check is valid and I believe that cause is valid.
461 */ 465 */
462 while (owner->owner && owner!=owner->owner && 466 while (owner->owner)
463 owner->ownercount==owner->owner->count) owner=owner->owner; 467 owner = owner->owner;
464 468
465 /* IF the owner still has an owner, we did not resolve to a final owner.
466 * so lets not add to that.
467 */
468 if (owner->owner) return;
469
470 op->owner=owner; 469 this->owner = owner;
471
472 op->ownercount=owner->count;
473 owner->refcount++;
474
475}
476
477/* Set the owner to clone's current owner and set the skill and experience
478 * objects to clone's objects (typically those objects that where the owner's
479 * current skill and experience objects at the time when clone's owner was
480 * set - not the owner's current skill and experience objects).
481 *
482 * Use this function if player created an object (e.g. fire bullet, swarm
483 * spell), and this object creates further objects whose kills should be
484 * accounted for the player's original skill, even if player has changed
485 * skills meanwhile.
486 */
487void copy_owner (object *op, object *clone)
488{
489 object *owner = get_owner (clone);
490 if (owner == NULL) {
491 /* players don't have owners - they own themselves. Update
492 * as appropriate.
493 */
494 if (clone->type == PLAYER) owner=clone;
495 else return;
496 }
497 set_owner(op, owner);
498
499}
500
501/*
502 * Resets vital variables in an object
503 */
504
505void reset_object(object *op) {
506
507 op->name = NULL;
508 op->name_pl = NULL;
509 op->title = NULL;
510 op->race = NULL;
511 op->slaying = NULL;
512 op->skill = NULL;
513 op->msg = NULL;
514 op->materialname = NULL;
515 op->lore = NULL;
516 clear_object(op);
517} 470}
518 471
519/* Zero the key_values on op, decrementing the shared-string 472/* Zero the key_values on op, decrementing the shared-string
520 * refcounts and freeing the links. 473 * refcounts and freeing the links.
521 */ 474 */
475static void
522static void free_key_values(object * op) 476free_key_values (object *op)
523{ 477{
524 for (key_value *i = op->key_values; i != 0; ) 478 for (key_value *i = op->key_values; i != 0;)
525 { 479 {
526 key_value *next = i->next; 480 key_value *next = i->next;
527 delete i; 481 delete i;
482
528 i = next; 483 i = next;
529 } 484 }
530 485
531 op->key_values = 0; 486 op->key_values = 0;
532} 487}
533 488
534/* 489void object::clear ()
535 * clear_object() frees everything allocated by an object, and also
536 * clears all variables and flags to default settings.
537 */
538
539void clear_object(object *op)
540{ 490{
541 op->clear (); 491 attachable_base::clear ();
542 492
543 free_key_values (op); 493 free_key_values (this);
544 494
545 /* the memset will clear all these values for us, but we need 495 owner = 0;
546 * to reduce the refcount on them. 496 name = 0;
547 */
548 op->name = 0;
549 op->name_pl = 0; 497 name_pl = 0;
550 op->title = 0; 498 title = 0;
551 op->race = 0; 499 race = 0;
552 op->slaying = 0; 500 slaying = 0;
553 op->skill = 0; 501 skill = 0;
554 op->msg = 0; 502 msg = 0;
555 op->lore = 0; 503 lore = 0;
504 custom_name = 0;
556 op->materialname = 0; 505 materialname = 0;
506 contr = 0;
507 below = 0;
508 above = 0;
509 inv = 0;
510 container = 0;
511 env = 0;
512 more = 0;
513 head = 0;
514 map = 0;
515 active_next = 0;
516 active_prev = 0;
557 517
558 memset((void*)op, 0, sizeof (object_special)); 518 memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
559 /* Below here, we clear things that are not done by the memset, 519
560 * or set default values that are not zero.
561 */
562 /* This is more or less true */
563 SET_FLAG (op, FLAG_REMOVED); 520 SET_FLAG (this, FLAG_REMOVED);
564 521
565 op->contr = NULL;
566 op->below = NULL;
567 op->above = NULL;
568 op->inv = NULL;
569 op->container=NULL;
570 op->env=NULL;
571 op->more=NULL;
572 op->head=NULL;
573 op->map=NULL;
574 op->refcount=0;
575 op->active_next = NULL;
576 op->active_prev = NULL;
577 /* What is not cleared is next, prev, and count */ 522 /* What is not cleared is next, prev, and count */
578 523
579 op->expmul=1.0; 524 expmul = 1.0;
580 op->face = blank_face; 525 face = blank_face;
581 op->attacked_by_count = (tag_t) -1;
582 526
583 if (settings.casting_time) 527 if (settings.casting_time)
584 op->casting_time = -1; 528 casting_time = -1;
529}
530
531void object::clone (object *destination)
532{
533 *(object_copy *)destination = *this;
534 *(object_pod *)destination = *this;
535
536 if (self || cb)
537 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
585} 538}
586 539
587/* 540/*
588 * copy object first frees everything allocated by the second object, 541 * copy object first frees everything allocated by the second object,
589 * and then copies the contends of the first object into the second 542 * and then copies the contends of the first object into the second
590 * object, allocating what needs to be allocated. Basically, any 543 * object, allocating what needs to be allocated. Basically, any
591 * data that is malloc'd needs to be re-malloc/copied. Otherwise, 544 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
592 * if the first object is freed, the pointers in the new object 545 * if the first object is freed, the pointers in the new object
593 * will point at garbage. 546 * will point at garbage.
594 */ 547 */
595 548void
596void copy_object(object *op2, object *op) 549copy_object (object *op2, object *op)
597{ 550{
598 int is_freed=QUERY_FLAG(op,FLAG_FREED),is_removed=QUERY_FLAG(op,FLAG_REMOVED); 551 bool is_freed = QUERY_FLAG (op, FLAG_FREED);
552 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);
599 553
600 op->clear ();
601
602 free_key_values (op);
603
604 *(object_special *)op = *(object_special *)op2;
605 op2->clone (op); 554 op2->clone (op);
606 555
607 if (is_freed) SET_FLAG(op,FLAG_FREED); 556 if (is_freed)
608 if (is_removed) SET_FLAG(op,FLAG_REMOVED); 557 SET_FLAG (op, FLAG_FREED);
558
559 if (is_removed)
560 SET_FLAG (op, FLAG_REMOVED);
609 561
610 if (op2->speed < 0) 562 if (op2->speed < 0)
611 op->speed_left = op2->speed_left - RANDOM() % 200 / 100.0; 563 op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0;
612 564
613 /* Copy over key_values, if any. */ 565 /* Copy over key_values, if any. */
614 if (op2->key_values != NULL) { 566 if (op2->key_values)
567 {
615 key_value *tail = NULL; 568 key_value *tail = 0;
616 key_value *i; 569 key_value *i;
617 570
618 op->key_values = NULL; 571 op->key_values = 0;
619 572
620 for (i = op2->key_values; i != NULL; i = i->next) 573 for (i = op2->key_values; i; i = i->next)
621 { 574 {
622 key_value *new_link = new key_value; 575 key_value *new_link = new key_value;
623 576
624 new_link->next = NULL; 577 new_link->next = 0;
625 new_link->key = i->key; 578 new_link->key = i->key;
626 new_link->value = i->value; 579 new_link->value = i->value;
627 580
628 /* Try and be clever here, too. */ 581 /* Try and be clever here, too. */
629 if (op->key_values == NULL) 582 if (!op->key_values)
630 { 583 {
631 op->key_values = new_link; 584 op->key_values = new_link;
632 tail = new_link; 585 tail = new_link;
633 } 586 }
634 else 587 else
635 { 588 {
636 tail->next = new_link; 589 tail->next = new_link;
637 tail = new_link; 590 tail = new_link;
638 } 591 }
639 } 592 }
640 } 593 }
641 594
642 update_ob_speed (op); 595 update_ob_speed (op);
643}
644
645/*
646 * expand_objects() allocates more objects for the list of unused objects.
647 * It is called from get_object() if the unused list is empty.
648 */
649
650void expand_objects(void) {
651 int i;
652 object *obj;
653 obj = new object [OBJ_EXPAND];
654
655 free_objects=obj;
656 obj[0].prev=NULL;
657 obj[0].next= &obj[1],
658 SET_FLAG(&(obj[0]), FLAG_REMOVED);
659 SET_FLAG(&(obj[0]), FLAG_FREED);
660
661 for(i=1;i<OBJ_EXPAND-1;i++) {
662 obj[i].next= &obj[i+1],
663 obj[i].prev= &obj[i-1],
664 SET_FLAG(&(obj[i]), FLAG_REMOVED);
665 SET_FLAG(&(obj[i]), FLAG_FREED);
666 }
667 obj[OBJ_EXPAND-1].prev= &obj[OBJ_EXPAND-2],
668 obj[OBJ_EXPAND-1].next=NULL,
669 SET_FLAG(&(obj[OBJ_EXPAND-1]), FLAG_REMOVED);
670 SET_FLAG(&(obj[OBJ_EXPAND-1]), FLAG_FREED);
671
672 nrofallocobjects += OBJ_EXPAND;
673 nroffreeobjects += OBJ_EXPAND;
674}
675
676/*
677 * get_object() grabs an object from the list of unused objects, makes
678 * sure it is initialised, and returns it.
679 * If there are no free objects, expand_objects() is called to get more.
680 */
681
682object *get_object(void)
683{
684 object *op;
685
686 if(free_objects==NULL)
687 expand_objects();
688
689 op = free_objects;
690
691 if (!QUERY_FLAG (op, FLAG_FREED))
692 LOG(llevError,"Fatal: Getting busy object.\n");
693
694 free_objects = op->next;
695
696 if (free_objects != NULL)
697 free_objects->prev = NULL;
698
699 op->count= ++ob_count;
700 op->name=NULL;
701 op->name_pl=NULL;
702 op->title=NULL;
703 op->race=NULL;
704 op->slaying=NULL;
705 op->skill = NULL;
706 op->lore=NULL;
707 op->msg=NULL;
708 op->materialname=NULL;
709 op->next=objects;
710 op->prev=NULL;
711 op->active_next = NULL;
712 op->active_prev = NULL;
713 if(objects!=NULL)
714 objects->prev=op;
715 objects=op;
716 clear_object(op);
717 SET_FLAG(op,FLAG_REMOVED);
718 nroffreeobjects--;
719 return op;
720} 596}
721 597
722/* 598/*
723 * If an object with the IS_TURNABLE() flag needs to be turned due 599 * If an object with the IS_TURNABLE() flag needs to be turned due
724 * to the closest player being on the other side, this function can 600 * to the closest player being on the other side, this function can
725 * be called to update the face variable, _and_ how it looks on the map. 601 * be called to update the face variable, _and_ how it looks on the map.
726 */ 602 */
727 603
604void
728void update_turn_face(object *op) { 605update_turn_face (object *op)
606{
729 if(!QUERY_FLAG(op,FLAG_IS_TURNABLE)||op->arch==NULL) 607 if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)
730 return; 608 return;
731 SET_ANIMATION(op, op->direction); 609 SET_ANIMATION (op, op->direction);
732 update_object(op,UP_OBJ_FACE); 610 update_object (op, UP_OBJ_FACE);
733} 611}
734 612
735/* 613/*
736 * Updates the speed of an object. If the speed changes from 0 to another 614 * Updates the speed of an object. If the speed changes from 0 to another
737 * value, or vice versa, then add/remove the object from the active list. 615 * value, or vice versa, then add/remove the object from the active list.
738 * This function needs to be called whenever the speed of an object changes. 616 * This function needs to be called whenever the speed of an object changes.
739 */ 617 */
740 618void
741void update_ob_speed(object *op) { 619update_ob_speed (object *op)
620{
742 extern int arch_init; 621 extern int arch_init;
743 622
744 /* No reason putting the archetypes objects on the speed list, 623 /* No reason putting the archetypes objects on the speed list,
745 * since they never really need to be updated. 624 * since they never really need to be updated.
746 */ 625 */
747 626
748 if (QUERY_FLAG(op, FLAG_FREED) && op->speed) { 627 if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
628 {
749 LOG(llevError,"Object %s is freed but has speed.\n", &op->name); 629 LOG (llevError, "Object %s is freed but has speed.\n", &op->name);
750#ifdef MANY_CORES 630#ifdef MANY_CORES
751 abort(); 631 abort ();
752#else 632#else
753 op->speed = 0; 633 op->speed = 0;
754#endif 634#endif
755 } 635 }
636
756 if (arch_init) { 637 if (arch_init)
638 return;
639
640 if (FABS (op->speed) > MIN_ACTIVE_SPEED)
641 {
642 /* If already on active list, don't do anything */
643 if (op->active_next || op->active_prev || op == active_objects)
757 return; 644 return;
758 }
759 if (FABS(op->speed)>MIN_ACTIVE_SPEED) {
760 /* If already on active list, don't do anything */
761 if (op->active_next || op->active_prev || op==active_objects)
762 return;
763 645
764 /* process_events() expects us to insert the object at the beginning 646 /* process_events() expects us to insert the object at the beginning
765 * of the list. */ 647 * of the list. */
766 op->active_next = active_objects; 648 op->active_next = active_objects;
649
767 if (op->active_next!=NULL) 650 if (op->active_next != NULL)
768 op->active_next->active_prev = op; 651 op->active_next->active_prev = op;
652
769 active_objects = op; 653 active_objects = op;
654 }
655 else
770 } 656 {
771 else {
772 /* If not on the active list, nothing needs to be done */ 657 /* If not on the active list, nothing needs to be done */
773 if (!op->active_next && !op->active_prev && op!=active_objects) 658 if (!op->active_next && !op->active_prev && op != active_objects)
774 return; 659 return;
775 660
776 if (op->active_prev==NULL) { 661 if (op->active_prev == NULL)
662 {
777 active_objects = op->active_next; 663 active_objects = op->active_next;
664
778 if (op->active_next!=NULL) 665 if (op->active_next != NULL)
779 op->active_next->active_prev = NULL; 666 op->active_next->active_prev = NULL;
667 }
668 else
780 } 669 {
781 else {
782 op->active_prev->active_next = op->active_next; 670 op->active_prev->active_next = op->active_next;
671
783 if (op->active_next) 672 if (op->active_next)
784 op->active_next->active_prev = op->active_prev; 673 op->active_next->active_prev = op->active_prev;
785 } 674 }
675
786 op->active_next = NULL; 676 op->active_next = NULL;
787 op->active_prev = NULL; 677 op->active_prev = NULL;
788 } 678 }
789} 679}
790 680
791/* This function removes object 'op' from the list of active 681/* This function removes object 'op' from the list of active
792 * objects. 682 * objects.
… …
794 * reference maps where you don't want an object that isn't 684 * reference maps where you don't want an object that isn't
795 * in play chewing up cpu time getting processed. 685 * in play chewing up cpu time getting processed.
796 * The reverse of this is to call update_ob_speed, which 686 * The reverse of this is to call update_ob_speed, which
797 * will do the right thing based on the speed of the object. 687 * will do the right thing based on the speed of the object.
798 */ 688 */
689void
799void remove_from_active_list(object *op) 690remove_from_active_list (object *op)
800{ 691{
801 /* If not on the active list, nothing needs to be done */ 692 /* If not on the active list, nothing needs to be done */
802 if (!op->active_next && !op->active_prev && op!=active_objects) 693 if (!op->active_next && !op->active_prev && op != active_objects)
803 return; 694 return;
804 695
805 if (op->active_prev==NULL) { 696 if (op->active_prev == NULL)
697 {
806 active_objects = op->active_next; 698 active_objects = op->active_next;
807 if (op->active_next!=NULL) 699 if (op->active_next != NULL)
808 op->active_next->active_prev = NULL; 700 op->active_next->active_prev = NULL;
701 }
702 else
809 } 703 {
810 else {
811 op->active_prev->active_next = op->active_next; 704 op->active_prev->active_next = op->active_next;
812 if (op->active_next) 705 if (op->active_next)
813 op->active_next->active_prev = op->active_prev; 706 op->active_next->active_prev = op->active_prev;
814 } 707 }
815 op->active_next = NULL; 708 op->active_next = NULL;
816 op->active_prev = NULL; 709 op->active_prev = NULL;
817} 710}
818 711
819/* 712/*
820 * update_object() updates the array which represents the map. 713 * update_object() updates the array which represents the map.
821 * It takes into account invisible objects (and represent squares covered 714 * It takes into account invisible objects (and represent squares covered
… …
836 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update 729 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
837 * as that is easier than trying to look at what may have changed. 730 * as that is easier than trying to look at what may have changed.
838 * UP_OBJ_FACE: only the objects face has changed. 731 * UP_OBJ_FACE: only the objects face has changed.
839 */ 732 */
840 733
734void
841void update_object(object *op, int action) { 735update_object (object *op, int action)
736{
842 int update_now=0, flags; 737 int update_now = 0, flags;
843 MoveType move_on, move_off, move_block, move_slow; 738 MoveType move_on, move_off, move_block, move_slow;
844 739
845 if (op == NULL) { 740 if (op == NULL)
741 {
846 /* this should never happen */ 742 /* this should never happen */
847 LOG(llevDebug,"update_object() called for NULL object.\n"); 743 LOG (llevDebug, "update_object() called for NULL object.\n");
848 return; 744 return;
849 }
850 745 }
746
851 if(op->env!=NULL) { 747 if (op->env != NULL)
748 {
852 /* Animation is currently handled by client, so nothing 749 /* Animation is currently handled by client, so nothing
853 * to do in this case. 750 * to do in this case.
854 */ 751 */
855 return; 752 return;
856 } 753 }
857 754
858 /* If the map is saving, don't do anything as everything is 755 /* If the map is saving, don't do anything as everything is
859 * going to get freed anyways. 756 * going to get freed anyways.
860 */ 757 */
861 if (!op->map || op->map->in_memory == MAP_SAVING) return; 758 if (!op->map || op->map->in_memory == MAP_SAVING)
862 759 return;
760
863 /* make sure the object is within map boundaries */ 761 /* make sure the object is within map boundaries */
864 if (op->x < 0 || op->x >= MAP_WIDTH(op->map) || 762 if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))
865 op->y < 0 || op->y >= MAP_HEIGHT(op->map)) { 763 {
866 LOG(llevError,"update_object() called for object out of map!\n"); 764 LOG (llevError, "update_object() called for object out of map!\n");
867#ifdef MANY_CORES 765#ifdef MANY_CORES
868 abort(); 766 abort ();
869#endif 767#endif
870 return; 768 return;
871 }
872 769 }
770
873 flags = GET_MAP_FLAGS(op->map, op->x, op->y); 771 flags = GET_MAP_FLAGS (op->map, op->x, op->y);
874 SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NEED_UPDATE); 772 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
875 move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y); 773 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
876 move_on = GET_MAP_MOVE_ON(op->map, op->x, op->y); 774 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
877 move_block = GET_MAP_MOVE_BLOCK(op->map, op->x, op->y); 775 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
878 move_off = GET_MAP_MOVE_OFF(op->map, op->x, op->y); 776 move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
879 777
880 if (action == UP_OBJ_INSERT) { 778 if (action == UP_OBJ_INSERT)
779 {
881 if (QUERY_FLAG(op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW)) 780 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))
882 update_now=1; 781 update_now = 1;
883 782
884 if (QUERY_FLAG(op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC)) 783 if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))
885 update_now=1; 784 update_now = 1;
886 785
887 if (QUERY_FLAG(op, FLAG_DAMNED) && !(flags & P_NO_CLERIC)) 786 if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))
888 update_now=1; 787 update_now = 1;
889 788
890 if (QUERY_FLAG(op, FLAG_ALIVE) && !(flags & P_IS_ALIVE)) 789 if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
891 update_now=1; 790 update_now = 1;
892 791
792 if (op->type == SAFE_GROUND && !(flags & P_SAFE))
793 update_now = 1;
794
893 if ((move_on | op->move_on) != move_on) update_now=1; 795 if ((move_on | op->move_on) != move_on)
796 update_now = 1;
797
894 if ((move_off | op->move_off) != move_off) update_now=1; 798 if ((move_off | op->move_off) != move_off)
799 update_now = 1;
800
895 /* This isn't perfect, but I don't expect a lot of objects to 801 /* This isn't perfect, but I don't expect a lot of objects to
896 * to have move_allow right now. 802 * to have move_allow right now.
897 */ 803 */
898 if (((move_block | op->move_block) & ~op->move_allow) != move_block) 804 if (((move_block | op->move_block) & ~op->move_allow) != move_block)
899 update_now=1; 805 update_now = 1;
806
900 if ((move_slow | op->move_slow) != move_slow) update_now=1; 807 if ((move_slow | op->move_slow) != move_slow)
808 update_now = 1;
901 } 809 }
810
902 /* if the object is being removed, we can't make intelligent 811 /* if the object is being removed, we can't make intelligent
903 * decisions, because remove_ob can't really pass the object 812 * decisions, because remove_ob can't really pass the object
904 * that is being removed. 813 * that is being removed.
905 */ 814 */
906 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) { 815 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
907 update_now=1; 816 update_now = 1;
908 } else if (action == UP_OBJ_FACE) { 817 else if (action == UP_OBJ_FACE)
909 /* Nothing to do for that case */ 818 /* Nothing to do for that case */ ;
910 }
911 else { 819 else
912 LOG(llevError,"update_object called with invalid action: %d\n", action); 820 LOG (llevError, "update_object called with invalid action: %d\n", action);
913 }
914 821
915 if (update_now) { 822 if (update_now)
823 {
916 SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE); 824 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
917 update_position(op->map, op->x, op->y); 825 update_position (op->map, op->x, op->y);
918 } 826 }
919 827
920 if(op->more!=NULL) 828 if (op->more != NULL)
921 update_object(op->more, action); 829 update_object (op->more, action);
922} 830}
923 831
832object::vector object::mortals;
833object::vector object::objects; // not yet used
834object *object::first;
835
836void object::free_mortals ()
837{
838 for (AUTODECL (i, mortals.begin ()); i != mortals.end ();)
839 if ((*i)->refcnt)
840 ++i; // further delay freeing
841 else
842 {
843 delete *i;
844 mortals.erase (i);
845 }
846}
847
848object::object ()
849{
850 SET_FLAG (this, FLAG_REMOVED);
851
852 expmul = 1.0;
853 face = blank_face;
854}
855
856object::~object ()
857{
858 free_key_values (this);
859}
860
861void object::link ()
862{
863 count = ++ob_count;
864 uuid = gen_uuid ();
865
866 prev = 0;
867 next = object::first;
868
869 if (object::first)
870 object::first->prev = this;
871
872 object::first = this;
873}
874
875void object::unlink ()
876{
877 if (this == object::first)
878 object::first = next;
879
880 /* Remove this object from the list of used objects */
881 if (prev) prev->next = next;
882 if (next) next->prev = prev;
883
884 prev = 0;
885 next = 0;
886}
887
888object *object::create ()
889{
890 object *op = new object;
891 op->link ();
892 return op;
893}
924 894
925/* 895/*
926 * free_object() frees everything allocated by an object, removes 896 * free_object() frees everything allocated by an object, removes
927 * it from the list of used objects, and puts it on the list of 897 * it from the list of used objects, and puts it on the list of
928 * free objects. The IS_FREED() flag is set in the object. 898 * free objects. The IS_FREED() flag is set in the object.
929 * The object must have been removed by remove_ob() first for 899 * The object must have been removed by remove_ob() first for
930 * this function to succeed. 900 * this function to succeed.
931 * 901 *
932 * If free_inventory is set, free inventory as well. Else drop items in 902 * If destroy_inventory is set, free inventory as well. Else drop items in
933 * inventory to the ground. 903 * inventory to the ground.
934 */ 904 */
935 905void object::destroy (bool destroy_inventory)
936void free_object(object *ob) { 906{
937 free_object2(ob, 0);
938}
939void free_object2(object *ob, int free_inventory) {
940 object *tmp,*op;
941
942 ob->clear ();
943
944 if (!QUERY_FLAG(ob,FLAG_REMOVED)) {
945 LOG(llevDebug,"Free object called with non removed object\n");
946 dump_object(ob);
947#ifdef MANY_CORES
948 abort();
949#endif
950 }
951 if(QUERY_FLAG(ob,FLAG_FRIENDLY)) {
952 LOG(llevMonster,"Warning: tried to free friendly object.\n");
953 remove_friendly_object(ob);
954 }
955 if(QUERY_FLAG(ob,FLAG_FREED)) { 907 if (QUERY_FLAG (this, FLAG_FREED))
956 dump_object(ob);
957 LOG(llevError,"Trying to free freed object.\n%s\n",errmsg);
958 return; 908 return;
909
910 if (QUERY_FLAG (this, FLAG_FRIENDLY))
911 remove_friendly_object (this);
912
913 if (!QUERY_FLAG (this, FLAG_REMOVED))
914 remove_ob (this);
915
916 SET_FLAG (this, FLAG_FREED);
917
918 if (more)
959 } 919 {
960 if(ob->more!=NULL) { 920 more->destroy (destroy_inventory);
961 free_object2(ob->more, free_inventory); 921 more = 0;
962 ob->more=NULL; 922 }
923
924 if (inv)
963 } 925 {
964 if (ob->inv) {
965 /* Only if the space blocks everything do we not process - 926 /* Only if the space blocks everything do we not process -
966 * if some form of movemnt is allowed, let objects 927 * if some form of movement is allowed, let objects
967 * drop on that space. 928 * drop on that space.
968 */ 929 */
969 if (free_inventory || ob->map==NULL || ob->map->in_memory!=MAP_IN_MEMORY || 930 if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL)
970 (GET_MAP_MOVE_BLOCK(ob->map, ob->x, ob->y) == MOVE_ALL)) 931 {
932 object *op = inv;
933
934 while (op)
971 { 935 {
972 op=ob->inv;
973 while(op!=NULL) {
974 tmp=op->below; 936 object *tmp = op->below;
975 remove_ob(op); 937 op->destroy (destroy_inventory);
976 free_object2(op, free_inventory);
977 op=tmp; 938 op = tmp;
978 } 939 }
979 } 940 }
941 else
980 else { /* Put objects in inventory onto this space */ 942 { /* Put objects in inventory onto this space */
981 op=ob->inv; 943 object *op = inv;
944
982 while(op!=NULL) { 945 while (op)
946 {
983 tmp=op->below; 947 object *tmp = op->below;
948
984 remove_ob(op); 949 remove_ob (op);
985 if(QUERY_FLAG(op,FLAG_STARTEQUIP)||QUERY_FLAG(op,FLAG_NO_DROP) || 950
986 op->type==RUNE || op->type==TRAP || QUERY_FLAG(op,FLAG_IS_A_TEMPLATE)) 951 if (QUERY_FLAG (op, FLAG_STARTEQUIP)
952 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
987 free_object(op); 953 free_object (op);
988 else { 954 else
955 {
989 op->x=ob->x; 956 op->x = x;
990 op->y=ob->y; 957 op->y = y;
991 insert_ob_in_map(op,ob->map,NULL,0); /* Insert in same map as the envir */ 958 insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
992 } 959 }
960
993 op=tmp; 961 op = tmp;
994 } 962 }
995 } 963 }
996 } 964 }
965
966 // hack to ensure that freed objects still have a valid map
967 {
968 static maptile *freed_map; // freed objects are moved here to avoid crashes
969
970 if (!freed_map)
971 {
972 freed_map = new maptile;
973
974 freed_map->name = "/internal/freed_objects_map";
975 freed_map->width = 3;
976 freed_map->height = 3;
977
978 freed_map->allocate ();
979 }
980
981 map = freed_map;
982 x = 1;
983 y = 1;
984 }
985
986 // clear those pointers that likely might have circular references to us
987 owner = 0;
988 enemy = 0;
989 attacked_by = 0;
990
991 // only relevant for players(?), but make sure of it anyways
992 contr = 0;
993
997 /* Remove object from the active list */ 994 /* Remove object from the active list */
998 ob->speed = 0; 995 speed = 0;
999 update_ob_speed(ob); 996 update_ob_speed (this);
1000 997
1001 SET_FLAG(ob, FLAG_FREED); 998 unlink ();
1002 ob->count = 0;
1003 999
1004 /* Remove this object from the list of used objects */ 1000 mortals.push_back (this);
1005 if(ob->prev==NULL) {
1006 objects=ob->next;
1007 if(objects!=NULL)
1008 objects->prev=NULL;
1009 }
1010 else {
1011 ob->prev->next=ob->next;
1012 if(ob->next!=NULL)
1013 ob->next->prev=ob->prev;
1014 }
1015
1016 ob->name = 0;
1017 ob->name_pl = 0;
1018 ob->title = 0;
1019 ob->race = 0;
1020 ob->slaying = 0;
1021 ob->skill = 0;
1022 ob->lore = 0;
1023 ob->msg = 0;
1024 ob->materialname = 0;
1025
1026 free_key_values (ob);
1027
1028 /* Now link it with the free_objects list: */
1029 ob->prev=NULL;
1030 ob->next=free_objects;
1031
1032 if(free_objects!=NULL)
1033 free_objects->prev=ob;
1034
1035 free_objects=ob;
1036 nroffreeobjects++;
1037}
1038
1039/*
1040 * count_free() returns the number of objects on the list of free objects.
1041 */
1042
1043int count_free ()
1044{
1045 int i=0;
1046 object *tmp=free_objects;
1047 while(tmp!=NULL)
1048 tmp=tmp->next, i++;
1049 return i;
1050}
1051
1052/*
1053 * count_used() returns the number of objects on the list of used objects.
1054 */
1055
1056int count_used()
1057{
1058 int i=0;
1059 object *tmp=objects;
1060 while(tmp!=NULL)
1061 tmp=tmp->next, i++;
1062 return i;
1063}
1064
1065/*
1066 * count_active() returns the number of objects on the list of active objects.
1067 */
1068
1069int count_active()
1070{
1071 int i=0;
1072 object *tmp=active_objects;
1073 while(tmp!=NULL)
1074 tmp=tmp->active_next, i++;
1075 return i;
1076} 1001}
1077 1002
1078/* 1003/*
1079 * sub_weight() recursively (outwards) subtracts a number from the 1004 * sub_weight() recursively (outwards) subtracts a number from the
1080 * weight of an object (and what is carried by it's environment(s)). 1005 * weight of an object (and what is carried by it's environment(s)).
1081 */ 1006 */
1082 1007void
1083void sub_weight (object *op, signed long weight) { 1008sub_weight (object *op, signed long weight)
1009{
1084 while (op != NULL) { 1010 while (op != NULL)
1011 {
1085 if (op->type == CONTAINER) { 1012 if (op->type == CONTAINER)
1086 weight=(signed long)(weight*(100-op->stats.Str)/100); 1013 weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1087 } 1014
1088 op->carrying-=weight; 1015 op->carrying -= weight;
1089 op = op->env; 1016 op = op->env;
1090 } 1017 }
1091} 1018}
1092 1019
1093/* remove_ob(op): 1020/* remove_ob(op):
1094 * This function removes the object op from the linked list of objects 1021 * This function removes the object op from the linked list of objects
1095 * which it is currently tied to. When this function is done, the 1022 * which it is currently tied to. When this function is done, the
1096 * object will have no environment. If the object previously had an 1023 * object will have no environment. If the object previously had an
1097 * environment, the x and y coordinates will be updated to 1024 * environment, the x and y coordinates will be updated to
1098 * the previous environment. 1025 * the previous environment.
1099 * Beware: This function is called from the editor as well! 1026 * Beware: This function is called from the editor as well!
1100 */ 1027 */
1101 1028void
1102void remove_ob(object *op) { 1029object::remove ()
1030{
1103 object *tmp,*last=NULL; 1031 object *tmp, *last = 0;
1104 object *otmp; 1032 object *otmp;
1105 tag_t tag; 1033
1106 int check_walk_off; 1034 int check_walk_off;
1107 mapstruct *m;
1108 sint16 x,y;
1109
1110 1035
1111 if(QUERY_FLAG(op,FLAG_REMOVED)) { 1036 if (QUERY_FLAG (this, FLAG_REMOVED))
1112 dump_object(op); 1037 return;
1113 LOG(llevError,"Trying to remove removed object.\n%s\n",errmsg);
1114 1038
1115 /* Changed it to always dump core in this case. As has been learned
1116 * in the past, trying to recover from errors almost always
1117 * make things worse, and this is a real error here - something
1118 * that should not happen.
1119 * Yes, if this was a mission critical app, trying to do something
1120 * to recover may make sense, but that is because failure of the app
1121 * may have other disastrous problems. Cf runs out of a script
1122 * so is easily enough restarted without any real problems.
1123 * MSW 2001-07-01
1124 */
1125 abort();
1126 }
1127 if(op->more!=NULL)
1128 remove_ob(op->more);
1129
1130 SET_FLAG(op, FLAG_REMOVED); 1039 SET_FLAG (this, FLAG_REMOVED);
1131 1040
1041 if (more)
1042 more->remove ();
1043
1132 /* 1044 /*
1133 * In this case, the object to be removed is in someones 1045 * In this case, the object to be removed is in someones
1134 * inventory. 1046 * inventory.
1135 */ 1047 */
1136 if(op->env!=NULL) { 1048 if (env)
1049 {
1137 if(op->nrof) 1050 if (nrof)
1138 sub_weight(op->env, op->weight*op->nrof); 1051 sub_weight (env, weight * nrof);
1139 else 1052 else
1140 sub_weight(op->env, op->weight+op->carrying); 1053 sub_weight (env, weight + carrying);
1141 1054
1142 /* NO_FIX_PLAYER is set when a great many changes are being 1055 /* NO_FIX_PLAYER is set when a great many changes are being
1143 * made to players inventory. If set, avoiding the call 1056 * made to players inventory. If set, avoiding the call
1144 * to save cpu time. 1057 * to save cpu time.
1145 */ 1058 */
1146 if ((otmp=is_player_inv(op->env))!=NULL && otmp->contr && 1059 if ((otmp = is_player_inv (env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1147 !QUERY_FLAG(otmp,FLAG_NO_FIX_PLAYER))
1148 fix_player(otmp); 1060 fix_player (otmp);
1149 1061
1150 if(op->above!=NULL) 1062 if (above != NULL)
1151 op->above->below=op->below; 1063 above->below = below;
1152 else 1064 else
1153 op->env->inv=op->below; 1065 env->inv = below;
1154 1066
1155 if(op->below!=NULL) 1067 if (below != NULL)
1156 op->below->above=op->above; 1068 below->above = above;
1157 1069
1158 /* we set up values so that it could be inserted into 1070 /* we set up values so that it could be inserted into
1159 * the map, but we don't actually do that - it is up 1071 * the map, but we don't actually do that - it is up
1160 * to the caller to decide what we want to do. 1072 * to the caller to decide what we want to do.
1073 */
1074 x = env->x, y = env->y;
1075 map = env->map;
1076 above = 0, below = 0;
1077 env = 0;
1078 }
1079 else if (map)
1080 {
1081 /* Re did the following section of code - it looks like it had
1082 * lots of logic for things we no longer care about
1083 */
1084
1085 /* link the object above us */
1086 if (above)
1087 above->below = below;
1088 else
1089 SET_MAP_TOP (map, x, y, below); /* we were top, set new top */
1090
1091 /* Relink the object below us, if there is one */
1092 if (below)
1093 below->above = above;
1094 else
1095 {
1096 /* Nothing below, which means we need to relink map object for this space
1097 * use translated coordinates in case some oddness with map tiling is
1098 * evident
1161 */ 1099 */
1162 op->x=op->env->x,op->y=op->env->y; 1100 if (GET_MAP_OB (map, x, y) != this)
1163 op->ox=op->x,op->oy=op->y; 1101 {
1164 op->map=op->env->map; 1102 char *dump = dump_object (this);
1165 op->above=NULL,op->below=NULL; 1103 LOG (llevError,
1166 op->env=NULL; 1104 "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump);
1105 free (dump);
1106 dump = dump_object (GET_MAP_OB (map, x, y));
1107 LOG (llevError, "%s\n", dump);
1108 free (dump);
1109 }
1110
1111 SET_MAP_OB (map, x, y, above); /* goes on above it. */
1112 }
1113
1114 above = 0;
1115 below = 0;
1116
1117 if (map->in_memory == MAP_SAVING)
1167 return; 1118 return;
1168 }
1169 1119
1170 /* If we get here, we are removing it from a map */
1171 if (op->map == NULL) return;
1172
1173 x = op->x;
1174 y = op->y;
1175 m = get_map_from_coord(op->map, &x, &y);
1176
1177 if (!m) {
1178 LOG(llevError,"remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1179 op->map->path, op->x, op->y);
1180 /* in old days, we used to set x and y to 0 and continue.
1181 * it seems if we get into this case, something is probablye
1182 * screwed up and should be fixed.
1183 */
1184 abort();
1185 }
1186 if (op->map != m) {
1187 LOG(llevDebug,"remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1188 op->map->path, m->path, op->x, op->y, x, y);
1189 }
1190
1191 /* Re did the following section of code - it looks like it had
1192 * lots of logic for things we no longer care about
1193 */
1194
1195 /* link the object above us */
1196 if (op->above)
1197 op->above->below=op->below;
1198 else
1199 SET_MAP_TOP(m,x,y,op->below); /* we were top, set new top */
1200
1201 /* Relink the object below us, if there is one */
1202 if(op->below) {
1203 op->below->above=op->above;
1204 } else {
1205 /* Nothing below, which means we need to relink map object for this space
1206 * use translated coordinates in case some oddness with map tiling is
1207 * evident
1208 */
1209 if(GET_MAP_OB(m,x,y)!=op) {
1210 dump_object(op);
1211 LOG(llevError,"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg);
1212 dump_object(GET_MAP_OB(m,x,y));
1213 LOG(llevError,"%s\n",errmsg);
1214 }
1215 SET_MAP_OB(m,x,y,op->above); /* goes on above it. */
1216 }
1217 op->above=NULL;
1218 op->below=NULL;
1219
1220 if (op->map->in_memory == MAP_SAVING)
1221 return;
1222
1223 tag = op->count;
1224 check_walk_off = ! QUERY_FLAG (op, FLAG_NO_APPLY); 1120 check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY);
1121
1225 for(tmp=GET_MAP_OB(m,x,y);tmp!=NULL;tmp=tmp->above) { 1122 for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above)
1123 {
1226 /* No point updating the players look faces if he is the object 1124 /* No point updating the players look faces if he is the object
1227 * being removed. 1125 * being removed.
1228 */ 1126 */
1229 1127
1230 if(tmp->type==PLAYER && tmp!=op) { 1128 if (tmp->type == PLAYER && tmp != this)
1129 {
1231 /* If a container that the player is currently using somehow gets 1130 /* If a container that the player is currently using somehow gets
1232 * removed (most likely destroyed), update the player view 1131 * removed (most likely destroyed), update the player view
1233 * appropriately. 1132 * appropriately.
1234 */ 1133 */
1235 if (tmp->container==op) { 1134 if (tmp->container == this)
1135 {
1236 CLEAR_FLAG(op, FLAG_APPLIED); 1136 CLEAR_FLAG (this, FLAG_APPLIED);
1237 tmp->container=NULL; 1137 tmp->container = 0;
1138 }
1139
1140 tmp->contr->socket.update_look = 1;
1238 } 1141 }
1239 tmp->contr->socket.update_look=1; 1142
1240 }
1241 /* See if player moving off should effect something */ 1143 /* See if player moving off should effect something */
1242 if (check_walk_off && ((op->move_type & tmp->move_off) && 1144 if (check_walk_off
1145 && ((move_type & tmp->move_off)
1243 (op->move_type & ~tmp->move_off & ~tmp->move_block)==0)) { 1146 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1244 1147 {
1245 move_apply(tmp, op, NULL); 1148 move_apply (tmp, this, 0);
1149
1246 if (was_destroyed (op, tag)) { 1150 if (destroyed ())
1247 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " 1151 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1248 "leaving object\n", &tmp->name, &tmp->arch->name);
1249 } 1152 }
1250 }
1251 1153
1252 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1154 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1253 1155
1254 if(tmp->above == tmp) 1156 if (tmp->above == tmp)
1255 tmp->above = NULL; 1157 tmp->above = 0;
1158
1256 last=tmp; 1159 last = tmp;
1257 } 1160 }
1161
1258 /* last == NULL of there are no objects on this space */ 1162 /* last == NULL of there are no objects on this space */
1259 if (last==NULL) { 1163 if (!last)
1164 {
1260 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, 1165 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1261 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures 1166 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1262 * those out anyways, and if there are any flags set right now, they won't 1167 * those out anyways, and if there are any flags set right now, they won't
1263 * be correct anyways. 1168 * be correct anyways.
1264 */ 1169 */
1265 SET_MAP_FLAGS(op->map, op->x, op->y, P_NEED_UPDATE); 1170 SET_MAP_FLAGS (map, x, y, P_NEED_UPDATE);
1266 update_position(op->map, op->x, op->y); 1171 update_position (map, x, y);
1267 } 1172 }
1268 else 1173 else
1269 update_object(last, UP_OBJ_REMOVE); 1174 update_object (last, UP_OBJ_REMOVE);
1270 1175
1271 if(QUERY_FLAG(op,FLAG_BLOCKSVIEW)|| (op->glow_radius != 0)) 1176 if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius)
1272 update_all_los(op->map, op->x, op->y); 1177 update_all_los (map, x, y);
1273 1178 }
1274} 1179}
1275 1180
1276/* 1181/*
1277 * merge_ob(op,top): 1182 * merge_ob(op,top):
1278 * 1183 *
1279 * This function goes through all objects below and including top, and 1184 * This function goes through all objects below and including top, and
1280 * merges op to the first matching object. 1185 * merges op to the first matching object.
1281 * If top is NULL, it is calculated. 1186 * If top is NULL, it is calculated.
1282 * Returns pointer to object if it succeded in the merge, otherwise NULL 1187 * Returns pointer to object if it succeded in the merge, otherwise NULL
1283 */ 1188 */
1284 1189object *
1285object *merge_ob(object *op, object *top) { 1190merge_ob (object *op, object *top)
1191{
1286 if(!op->nrof) 1192 if (!op->nrof)
1287 return 0; 1193 return 0;
1194
1288 if(top==NULL) 1195 if (top == NULL)
1289 for(top=op;top!=NULL&&top->above!=NULL;top=top->above); 1196 for (top = op; top != NULL && top->above != NULL; top = top->above);
1197
1290 for(;top!=NULL;top=top->below) { 1198 for (; top != NULL; top = top->below)
1199 {
1291 if(top==op) 1200 if (top == op)
1292 continue; 1201 continue;
1293 if (CAN_MERGE(op,top)) 1202 if (CAN_MERGE (op, top))
1294 { 1203 {
1295 top->nrof+=op->nrof; 1204 top->nrof += op->nrof;
1205
1296/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ 1206/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1297 op->weight = 0; /* Don't want any adjustements now */ 1207 op->weight = 0; /* Don't want any adjustements now */
1298 remove_ob(op); 1208 remove_ob (op);
1299 free_object(op); 1209 free_object (op);
1300 return top; 1210 return top;
1301 } 1211 }
1302 } 1212 }
1213
1303 return NULL; 1214 return 0;
1304} 1215}
1305 1216
1306/* 1217/*
1307 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1218 * same as insert_ob_in_map except it handle separate coordinates and do a clean
1308 * job preparing multi-part monsters 1219 * job preparing multi-part monsters
1309 */ 1220 */
1221object *
1310object *insert_ob_in_map_at(object *op, mapstruct *m, object *originator, int flag, int x, int y){ 1222insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1223{
1311 object* tmp; 1224 object *tmp;
1225
1312 if (op->head) 1226 if (op->head)
1313 op=op->head; 1227 op = op->head;
1228
1314 for (tmp=op;tmp;tmp=tmp->more){ 1229 for (tmp = op; tmp; tmp = tmp->more)
1230 {
1315 tmp->x=x+tmp->arch->clone.x; 1231 tmp->x = x + tmp->arch->clone.x;
1316 tmp->y=y+tmp->arch->clone.y; 1232 tmp->y = y + tmp->arch->clone.y;
1317 } 1233 }
1234
1318 return insert_ob_in_map (op, m, originator, flag); 1235 return insert_ob_in_map (op, m, originator, flag);
1319} 1236}
1320 1237
1321/* 1238/*
1322 * insert_ob_in_map (op, map, originator, flag): 1239 * insert_ob_in_map (op, map, originator, flag):
1323 * This function inserts the object in the two-way linked list 1240 * This function inserts the object in the two-way linked list
… …
1337 * new object if 'op' was merged with other object 1254 * new object if 'op' was merged with other object
1338 * NULL if 'op' was destroyed 1255 * NULL if 'op' was destroyed
1339 * just 'op' otherwise 1256 * just 'op' otherwise
1340 */ 1257 */
1341 1258
1259object *
1342object *insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) 1260insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1343{ 1261{
1344 object *tmp, *top, *floor=NULL; 1262 object *tmp, *top, *floor = NULL;
1345 sint16 x,y; 1263 sint16 x, y;
1346 1264
1347 if (QUERY_FLAG (op, FLAG_FREED)) { 1265 if (QUERY_FLAG (op, FLAG_FREED))
1266 {
1348 LOG (llevError, "Trying to insert freed object!\n"); 1267 LOG (llevError, "Trying to insert freed object!\n");
1268 return NULL;
1269 }
1270
1271 if (m == NULL)
1272 {
1273 char *dump = dump_object (op);
1274 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1275 free (dump);
1276 return op;
1277 }
1278
1279 if (out_of_map (m, op->x, op->y))
1280 {
1281 char *dump = dump_object (op);
1282 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump);
1283#ifdef MANY_CORES
1284 /* Better to catch this here, as otherwise the next use of this object
1285 * is likely to cause a crash. Better to find out where it is getting
1286 * improperly inserted.
1287 */
1288 abort ();
1289#endif
1290 free (dump);
1291 return op;
1292 }
1293
1294 if (!QUERY_FLAG (op, FLAG_REMOVED))
1295 {
1296 char *dump = dump_object (op);
1297 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump);
1298 free (dump);
1299 return op;
1300 }
1301
1302 if (op->more != NULL)
1303 {
1304 /* The part may be on a different map. */
1305
1306 object *more = op->more;
1307
1308 /* We really need the caller to normalize coordinates - if
1309 * we set the map, that doesn't work if the location is within
1310 * a map and this is straddling an edge. So only if coordinate
1311 * is clear wrong do we normalize it.
1312 */
1313 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1314 more->map = get_map_from_coord (m, &more->x, &more->y);
1315 else if (!more->map)
1316 {
1317 /* For backwards compatibility - when not dealing with tiled maps,
1318 * more->map should always point to the parent.
1319 */
1320 more->map = m;
1321 }
1322
1323 if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1324 {
1325 if (!op->head)
1326 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1327
1328 return NULL;
1329 }
1330 }
1331
1332 CLEAR_FLAG (op, FLAG_REMOVED);
1333
1334 /* Ideally, the caller figures this out. However, it complicates a lot
1335 * of areas of callers (eg, anything that uses find_free_spot would now
1336 * need extra work
1337 */
1338 op->map = get_map_from_coord (m, &op->x, &op->y);
1339 x = op->x;
1340 y = op->y;
1341
1342 /* this has to be done after we translate the coordinates.
1343 */
1344 if (op->nrof && !(flag & INS_NO_MERGE))
1345 for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)
1346 if (CAN_MERGE (op, tmp))
1347 {
1348 op->nrof += tmp->nrof;
1349 remove_ob (tmp);
1350 free_object (tmp);
1351 }
1352
1353 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1354 CLEAR_FLAG (op, FLAG_INV_LOCKED);
1355
1356 if (!QUERY_FLAG (op, FLAG_ALIVE))
1357 CLEAR_FLAG (op, FLAG_NO_STEAL);
1358
1359 if (flag & INS_BELOW_ORIGINATOR)
1360 {
1361 if (originator->map != op->map || originator->x != op->x || originator->y != op->y)
1362 {
1363 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1364 abort ();
1365 }
1366
1367 op->above = originator;
1368 op->below = originator->below;
1369
1370 if (op->below)
1371 op->below->above = op;
1372 else
1373 SET_MAP_OB (op->map, op->x, op->y, op);
1374
1375 /* since *below* originator, no need to update top */
1376 originator->below = op;
1377 }
1378 else
1379 {
1380 /* If there are other objects, then */
1381 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))
1382 {
1383 object *last = NULL;
1384
1385 /*
1386 * If there are multiple objects on this space, we do some trickier handling.
1387 * We've already dealt with merging if appropriate.
1388 * Generally, we want to put the new object on top. But if
1389 * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
1390 * floor, we want to insert above that and no further.
1391 * Also, if there are spell objects on this space, we stop processing
1392 * once we get to them. This reduces the need to traverse over all of
1393 * them when adding another one - this saves quite a bit of cpu time
1394 * when lots of spells are cast in one area. Currently, it is presumed
1395 * that flying non pickable objects are spell objects.
1396 */
1397
1398 while (top != NULL)
1399 {
1400 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1401 floor = top;
1402
1403 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
1404 {
1405 /* We insert above top, so we want this object below this */
1406 top = top->below;
1407 break;
1408 }
1409
1410 last = top;
1411 top = top->above;
1412 }
1413
1414 /* Don't want top to be NULL, so set it to the last valid object */
1415 top = last;
1416
1417 /* We let update_position deal with figuring out what the space
1418 * looks like instead of lots of conditions here.
1419 * makes things faster, and effectively the same result.
1420 */
1421
1422 /* Have object 'fall below' other objects that block view.
1423 * Unless those objects are exits, type 66
1424 * If INS_ON_TOP is used, don't do this processing
1425 * Need to find the object that in fact blocks view, otherwise
1426 * stacking is a bit odd.
1427 */
1428 if (!(flag & INS_ON_TOP) &&
1429 (get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))
1430 {
1431 for (last = top; last != floor; last = last->below)
1432 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1433 break;
1434 /* Check to see if we found the object that blocks view,
1435 * and make sure we have a below pointer for it so that
1436 * we can get inserted below this one, which requires we
1437 * set top to the object below us.
1438 */
1439 if (last && last->below && last != floor)
1440 top = last->below;
1441 }
1442 } /* If objects on this space */
1443
1444 if (flag & INS_MAP_LOAD)
1445 top = GET_MAP_TOP (op->map, op->x, op->y);
1446
1447 if (flag & INS_ABOVE_FLOOR_ONLY)
1448 top = floor;
1449
1450 /* Top is the object that our object (op) is going to get inserted above.
1451 */
1452
1453 /* First object on this space */
1454 if (!top)
1455 {
1456 op->above = GET_MAP_OB (op->map, op->x, op->y);
1457
1458 if (op->above)
1459 op->above->below = op;
1460
1461 op->below = NULL;
1462 SET_MAP_OB (op->map, op->x, op->y, op);
1463 }
1464 else
1465 { /* get inserted into the stack above top */
1466 op->above = top->above;
1467
1468 if (op->above)
1469 op->above->below = op;
1470
1471 op->below = top;
1472 top->above = op;
1473 }
1474
1475 if (op->above == NULL)
1476 SET_MAP_TOP (op->map, op->x, op->y, op);
1477 } /* else not INS_BELOW_ORIGINATOR */
1478
1479 if (op->type == PLAYER)
1480 op->contr->do_los = 1;
1481
1482 /* If we have a floor, we know the player, if any, will be above
1483 * it, so save a few ticks and start from there.
1484 */
1485 if (!(flag & INS_MAP_LOAD))
1486 for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1487 if (tmp->type == PLAYER)
1488 tmp->contr->socket.update_look = 1;
1489
1490 /* If this object glows, it may affect lighting conditions that are
1491 * visible to others on this map. But update_all_los is really
1492 * an inefficient way to do this, as it means los for all players
1493 * on the map will get recalculated. The players could very well
1494 * be far away from this change and not affected in any way -
1495 * this should get redone to only look for players within range,
1496 * or just updating the P_NEED_UPDATE for spaces within this area
1497 * of effect may be sufficient.
1498 */
1499 if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))
1500 update_all_los (op->map, op->x, op->y);
1501
1502 /* updates flags (blocked, alive, no magic, etc) for this map space */
1503 update_object (op, UP_OBJ_INSERT);
1504
1505 /* Don't know if moving this to the end will break anything. However,
1506 * we want to have update_look set above before calling this.
1507 *
1508 * check_move_on() must be after this because code called from
1509 * check_move_on() depends on correct map flags (so functions like
1510 * blocked() and wall() work properly), and these flags are updated by
1511 * update_object().
1512 */
1513
1514 /* if this is not the head or flag has been passed, don't check walk on status */
1515 if (!(flag & INS_NO_WALK_ON) && !op->head)
1516 {
1517 if (check_move_on (op, originator))
1349 return NULL; 1518 return NULL;
1350 }
1351 if(m==NULL) {
1352 dump_object(op);
1353 LOG(llevError,"Trying to insert in null-map!\n%s\n",errmsg);
1354 return op;
1355 }
1356 if(out_of_map(m,op->x,op->y)) {
1357 dump_object(op);
1358 LOG(llevError,"Trying to insert object outside the map.\n%s\n", errmsg);
1359#ifdef MANY_CORES
1360 /* Better to catch this here, as otherwise the next use of this object
1361 * is likely to cause a crash. Better to find out where it is getting
1362 * improperly inserted.
1363 */
1364 abort();
1365#endif
1366 return op;
1367 }
1368 if(!QUERY_FLAG(op,FLAG_REMOVED)) {
1369 dump_object(op);
1370 LOG(llevError,"Trying to insert (map) inserted object.\n%s\n", errmsg);
1371 return op;
1372 }
1373 if(op->more!=NULL) {
1374 /* The part may be on a different map. */
1375 1519
1376 object *more = op->more;
1377
1378 /* We really need the caller to normalize coordinates - if
1379 * we set the map, that doesn't work if the location is within
1380 * a map and this is straddling an edge. So only if coordinate
1381 * is clear wrong do we normalize it.
1382 */
1383 if (OUT_OF_REAL_MAP(more->map, more->x, more->y)) {
1384 /* Debugging information so you can see the last coordinates this object had */
1385 more->ox = more->x;
1386 more->oy = more->y;
1387 more->map = get_map_from_coord(m, &more->x, &more->y);
1388 } else if (!more->map) {
1389 /* For backwards compatibility - when not dealing with tiled maps,
1390 * more->map should always point to the parent.
1391 */
1392 more->map = m;
1393 }
1394
1395 if (insert_ob_in_map(more, more->map, originator, flag) == NULL) {
1396 if ( ! op->head)
1397 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1398 return NULL;
1399 }
1400 }
1401 CLEAR_FLAG(op,FLAG_REMOVED);
1402
1403 /* Debugging information so you can see the last coordinates this object had */
1404 op->ox=op->x;
1405 op->oy=op->y;
1406
1407 /* Ideally, the caller figures this out. However, it complicates a lot
1408 * of areas of callers (eg, anything that uses find_free_spot would now
1409 * need extra work
1410 */
1411 op->map=get_map_from_coord(m, &op->x, &op->y);
1412 x = op->x;
1413 y = op->y;
1414
1415 /* this has to be done after we translate the coordinates.
1416 */
1417 if(op->nrof && !(flag & INS_NO_MERGE)) {
1418 for(tmp=GET_MAP_OB(op->map,x,y);tmp!=NULL;tmp=tmp->above)
1419 if (CAN_MERGE(op,tmp)) {
1420 op->nrof+=tmp->nrof;
1421 remove_ob(tmp);
1422 free_object(tmp);
1423 }
1424 }
1425
1426 CLEAR_FLAG(op,FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1427 CLEAR_FLAG(op, FLAG_INV_LOCKED);
1428 if (!QUERY_FLAG(op, FLAG_ALIVE))
1429 CLEAR_FLAG(op, FLAG_NO_STEAL);
1430
1431 if (flag & INS_BELOW_ORIGINATOR) {
1432 if (originator->map != op->map || originator->x != op->x ||
1433 originator->y != op->y) {
1434 LOG(llevError,"insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1435 abort();
1436 }
1437 op->above = originator;
1438 op->below = originator->below;
1439 if (op->below) op->below->above = op;
1440 else SET_MAP_OB(op->map, op->x, op->y, op);
1441 /* since *below* originator, no need to update top */
1442 originator->below = op;
1443 } else {
1444 /* If there are other objects, then */
1445 if((! (flag & INS_MAP_LOAD)) && ((top=GET_MAP_OB(op->map,op->x,op->y))!=NULL)) {
1446 object *last=NULL;
1447 /*
1448 * If there are multiple objects on this space, we do some trickier handling.
1449 * We've already dealt with merging if appropriate.
1450 * Generally, we want to put the new object on top. But if
1451 * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
1452 * floor, we want to insert above that and no further.
1453 * Also, if there are spell objects on this space, we stop processing
1454 * once we get to them. This reduces the need to traverse over all of
1455 * them when adding another one - this saves quite a bit of cpu time
1456 * when lots of spells are cast in one area. Currently, it is presumed
1457 * that flying non pickable objects are spell objects.
1458 */
1459
1460 while (top != NULL) {
1461 if (QUERY_FLAG(top, FLAG_IS_FLOOR) ||
1462 QUERY_FLAG(top, FLAG_OVERLAY_FLOOR)) floor = top;
1463 if (QUERY_FLAG(top, FLAG_NO_PICK)
1464 && (top->move_type & (MOVE_FLY_LOW |MOVE_FLY_HIGH))
1465 && !QUERY_FLAG(top, FLAG_IS_FLOOR))
1466 {
1467 /* We insert above top, so we want this object below this */
1468 top=top->below;
1469 break;
1470 }
1471 last = top;
1472 top = top->above;
1473 }
1474 /* Don't want top to be NULL, so set it to the last valid object */
1475 top = last;
1476
1477 /* We let update_position deal with figuring out what the space
1478 * looks like instead of lots of conditions here.
1479 * makes things faster, and effectively the same result.
1480 */
1481
1482 /* Have object 'fall below' other objects that block view.
1483 * Unless those objects are exits, type 66
1484 * If INS_ON_TOP is used, don't do this processing
1485 * Need to find the object that in fact blocks view, otherwise
1486 * stacking is a bit odd.
1487 */
1488 if (!(flag & INS_ON_TOP) &&
1489 (get_map_flags(op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) &&
1490 (op->face && !op->face->visibility)) {
1491 for (last=top; last != floor; last=last->below)
1492 if (QUERY_FLAG(last, FLAG_BLOCKSVIEW)&&(last->type != EXIT)) break;
1493 /* Check to see if we found the object that blocks view,
1494 * and make sure we have a below pointer for it so that
1495 * we can get inserted below this one, which requires we
1496 * set top to the object below us.
1497 */
1498 if (last && last->below && last != floor) top=last->below;
1499 }
1500 } /* If objects on this space */
1501 if (flag & INS_MAP_LOAD)
1502 top = GET_MAP_TOP(op->map,op->x,op->y);
1503 if (flag & INS_ABOVE_FLOOR_ONLY) top = floor;
1504
1505 /* Top is the object that our object (op) is going to get inserted above.
1506 */
1507
1508 /* First object on this space */
1509 if (!top) {
1510 op->above = GET_MAP_OB(op->map, op->x, op->y);
1511 if (op->above) op->above->below = op;
1512 op->below = NULL;
1513 SET_MAP_OB(op->map, op->x, op->y, op);
1514 } else { /* get inserted into the stack above top */
1515 op->above = top->above;
1516 if (op->above) op->above->below = op;
1517 op->below = top;
1518 top->above = op;
1519 }
1520 if (op->above==NULL)
1521 SET_MAP_TOP(op->map,op->x, op->y, op);
1522 } /* else not INS_BELOW_ORIGINATOR */
1523
1524 if(op->type==PLAYER)
1525 op->contr->do_los=1;
1526
1527 /* If we have a floor, we know the player, if any, will be above
1528 * it, so save a few ticks and start from there.
1529 */
1530 if (!(flag & INS_MAP_LOAD))
1531 for(tmp=floor?floor:GET_MAP_OB(op->map,op->x,op->y);tmp!=NULL;tmp=tmp->above) {
1532 if (tmp->type == PLAYER)
1533 tmp->contr->socket.update_look=1;
1534 }
1535
1536 /* If this object glows, it may affect lighting conditions that are
1537 * visible to others on this map. But update_all_los is really
1538 * an inefficient way to do this, as it means los for all players
1539 * on the map will get recalculated. The players could very well
1540 * be far away from this change and not affected in any way -
1541 * this should get redone to only look for players within range,
1542 * or just updating the P_NEED_UPDATE for spaces within this area
1543 * of effect may be sufficient.
1544 */
1545 if(MAP_DARKNESS(op->map) && (op->glow_radius != 0))
1546 update_all_los(op->map, op->x, op->y);
1547
1548
1549 /* updates flags (blocked, alive, no magic, etc) for this map space */
1550 update_object(op,UP_OBJ_INSERT);
1551
1552
1553 /* Don't know if moving this to the end will break anything. However,
1554 * we want to have update_look set above before calling this.
1555 *
1556 * check_move_on() must be after this because code called from
1557 * check_move_on() depends on correct map flags (so functions like
1558 * blocked() and wall() work properly), and these flags are updated by
1559 * update_object().
1560 */
1561
1562 /* if this is not the head or flag has been passed, don't check walk on status */
1563
1564 if (!(flag & INS_NO_WALK_ON) && !op->head) {
1565 if (check_move_on(op, originator))
1566 return NULL;
1567
1568 /* If we are a multi part object, lets work our way through the check 1520 /* If we are a multi part object, lets work our way through the check
1569 * walk on's. 1521 * walk on's.
1570 */ 1522 */
1571 for (tmp=op->more; tmp!=NULL; tmp=tmp->more) 1523 for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1572 if (check_move_on (tmp, originator)) 1524 if (check_move_on (tmp, originator))
1573 return NULL; 1525 return NULL;
1574 } 1526 }
1527
1575 return op; 1528 return op;
1576} 1529}
1577 1530
1578/* this function inserts an object in the map, but if it 1531/* this function inserts an object in the map, but if it
1579 * finds an object of its own type, it'll remove that one first. 1532 * finds an object of its own type, it'll remove that one first.
1580 * op is the object to insert it under: supplies x and the map. 1533 * op is the object to insert it under: supplies x and the map.
1581 */ 1534 */
1535void
1582void replace_insert_ob_in_map(const char *arch_string, object *op) { 1536replace_insert_ob_in_map (const char *arch_string, object *op)
1537{
1583 object *tmp; 1538 object *
1584 object *tmp1; 1539 tmp;
1540 object *
1541 tmp1;
1585 1542
1586 /* first search for itself and remove any old instances */ 1543 /* first search for itself and remove any old instances */
1587 1544
1588 for(tmp=GET_MAP_OB(op->map,op->x,op->y); tmp!=NULL; tmp=tmp->above) { 1545 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1546 {
1589 if(!strcmp(tmp->arch->name,arch_string)) /* same archetype */ { 1547 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1548 {
1590 remove_ob(tmp); 1549 remove_ob (tmp);
1591 free_object(tmp); 1550 free_object (tmp);
1592 } 1551 }
1593 } 1552 }
1594 1553
1595 tmp1=arch_to_object(find_archetype(arch_string)); 1554 tmp1 = arch_to_object (archetype::find (arch_string));
1596 1555
1597 1556 tmp1->x = op->x;
1598 tmp1->x = op->x; tmp1->y = op->y; 1557 tmp1->y = op->y;
1599 insert_ob_in_map(tmp1,op->map,op,0); 1558 insert_ob_in_map (tmp1, op->map, op, 0);
1600} 1559}
1601 1560
1602/* 1561/*
1603 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1562 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1604 * is returned contains nr objects, and the remaining parts contains 1563 * is returned contains nr objects, and the remaining parts contains
1605 * the rest (or is removed and freed if that number is 0). 1564 * the rest (or is removed and freed if that number is 0).
1606 * On failure, NULL is returned, and the reason put into the 1565 * On failure, NULL is returned, and the reason put into the
1607 * global static errmsg array. 1566 * global static errmsg array.
1608 */ 1567 */
1609 1568
1569object *
1610object *get_split_ob(object *orig_ob, uint32 nr) { 1570get_split_ob (object *orig_ob, uint32 nr)
1611 object *newob; 1571{
1572 object *
1573 newob;
1574 int
1612 int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); 1575 is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1613 1576
1614 if(orig_ob->nrof<nr) { 1577 if (orig_ob->nrof < nr)
1615 sprintf(errmsg,"There are only %d %ss.", 1578 {
1616 orig_ob->nrof?orig_ob->nrof:1, &orig_ob->name); 1579 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1617 return NULL; 1580 return NULL;
1618 } 1581 }
1582
1619 newob = object_create_clone(orig_ob); 1583 newob = object_create_clone (orig_ob);
1584
1620 if((orig_ob->nrof-=nr)<1) { 1585 if ((orig_ob->nrof -= nr) < 1)
1586 {
1621 if ( ! is_removed) 1587 if (!is_removed)
1622 remove_ob(orig_ob); 1588 remove_ob (orig_ob);
1623 free_object2(orig_ob, 1); 1589 free_object2 (orig_ob, 1);
1624 } 1590 }
1625 else if ( ! is_removed) { 1591 else if (!is_removed)
1592 {
1626 if(orig_ob->env!=NULL) 1593 if (orig_ob->env != NULL)
1627 sub_weight (orig_ob->env,orig_ob->weight*nr); 1594 sub_weight (orig_ob->env, orig_ob->weight * nr);
1628 if (orig_ob->env == NULL && orig_ob->map->in_memory!=MAP_IN_MEMORY) { 1595 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1596 {
1629 strcpy(errmsg, "Tried to split object whose map is not in memory."); 1597 strcpy (errmsg, "Tried to split object whose map is not in memory.");
1630 LOG(llevDebug,
1631 "Error, Tried to split object whose map is not in memory.\n"); 1598 LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1632 return NULL; 1599 return NULL;
1633 } 1600 }
1634 } 1601 }
1602
1635 newob->nrof=nr; 1603 newob->nrof = nr;
1636 1604
1637 return newob; 1605 return newob;
1638} 1606}
1639 1607
1640/* 1608/*
1641 * decrease_ob_nr(object, number) decreases a specified number from 1609 * decrease_ob_nr(object, number) decreases a specified number from
1642 * the amount of an object. If the amount reaches 0, the object 1610 * the amount of an object. If the amount reaches 0, the object
1643 * is subsequently removed and freed. 1611 * is subsequently removed and freed.
1644 * 1612 *
1645 * Return value: 'op' if something is left, NULL if the amount reached 0 1613 * Return value: 'op' if something is left, NULL if the amount reached 0
1646 */ 1614 */
1647 1615
1616object *
1648object *decrease_ob_nr (object *op, uint32 i) 1617decrease_ob_nr (object *op, uint32 i)
1649{ 1618{
1650 object *tmp; 1619 object *tmp;
1651 player *pl; 1620 player *pl;
1652 1621
1653 if (i == 0) /* objects with op->nrof require this check */ 1622 if (i == 0) /* objects with op->nrof require this check */
1654 return op; 1623 return op;
1655 1624
1656 if (i > op->nrof) 1625 if (i > op->nrof)
1657 i = op->nrof; 1626 i = op->nrof;
1658 1627
1659 if (QUERY_FLAG (op, FLAG_REMOVED)) 1628 if (QUERY_FLAG (op, FLAG_REMOVED))
1629 op->nrof -= i;
1630 else if (op->env != NULL)
1631 {
1632 /* is this object in the players inventory, or sub container
1633 * therein?
1634 */
1635 tmp = is_player_inv (op->env);
1636 /* nope. Is this a container the player has opened?
1637 * If so, set tmp to that player.
1638 * IMO, searching through all the players will mostly
1639 * likely be quicker than following op->env to the map,
1640 * and then searching the map for a player.
1641 */
1642 if (!tmp)
1643 {
1644 for (pl = first_player; pl; pl = pl->next)
1645 if (pl->ob->container == op->env)
1646 break;
1647 if (pl)
1648 tmp = pl->ob;
1649 else
1650 tmp = NULL;
1651 }
1652
1653 if (i < op->nrof)
1654 {
1655 sub_weight (op->env, op->weight * i);
1656 op->nrof -= i;
1657 if (tmp)
1658 {
1659 esrv_send_item (tmp, op);
1660 }
1661 }
1662 else
1663 {
1664 remove_ob (op);
1665 op->nrof = 0;
1666 if (tmp)
1667 {
1668 esrv_del_item (tmp->contr, op->count);
1669 }
1670 }
1660 { 1671 }
1672 else
1673 {
1674 object *above = op->above;
1675
1676 if (i < op->nrof)
1661 op->nrof -= i; 1677 op->nrof -= i;
1662 } 1678 else
1663 else if (op->env != NULL)
1664 {
1665 /* is this object in the players inventory, or sub container
1666 * therein?
1667 */
1668 tmp = is_player_inv (op->env);
1669 /* nope. Is this a container the player has opened?
1670 * If so, set tmp to that player.
1671 * IMO, searching through all the players will mostly
1672 * likely be quicker than following op->env to the map,
1673 * and then searching the map for a player.
1674 */
1675 if (!tmp) {
1676 for (pl=first_player; pl; pl=pl->next)
1677 if (pl->ob->container == op->env) break;
1678 if (pl) tmp=pl->ob;
1679 else tmp=NULL;
1680 } 1679 {
1681
1682 if (i < op->nrof) {
1683 sub_weight (op->env, op->weight * i);
1684 op->nrof -= i;
1685 if (tmp) {
1686 esrv_send_item(tmp, op);
1687 }
1688 } else {
1689 remove_ob (op); 1680 remove_ob (op);
1690 op->nrof = 0; 1681 op->nrof = 0;
1691 if (tmp) {
1692 esrv_del_item(tmp->contr, op->count);
1693 } 1682 }
1694 }
1695 }
1696 else
1697 {
1698 object *above = op->above;
1699 1683
1700 if (i < op->nrof) {
1701 op->nrof -= i;
1702 } else {
1703 remove_ob (op);
1704 op->nrof = 0;
1705 }
1706 /* Since we just removed op, op->above is null */ 1684 /* Since we just removed op, op->above is null */
1707 for (tmp = above; tmp != NULL; tmp = tmp->above) 1685 for (tmp = above; tmp != NULL; tmp = tmp->above)
1708 if (tmp->type == PLAYER) { 1686 if (tmp->type == PLAYER)
1687 {
1709 if (op->nrof) 1688 if (op->nrof)
1710 esrv_send_item(tmp, op); 1689 esrv_send_item (tmp, op);
1711 else 1690 else
1712 esrv_del_item(tmp->contr, op->count); 1691 esrv_del_item (tmp->contr, op->count);
1713 } 1692 }
1714 } 1693 }
1715 1694
1716 if (op->nrof) { 1695 if (op->nrof)
1717 return op; 1696 return op;
1718 } else { 1697 else
1698 {
1719 free_object (op); 1699 free_object (op);
1720 return NULL; 1700 return NULL;
1721 } 1701 }
1722} 1702}
1723 1703
1724/* 1704/*
1725 * add_weight(object, weight) adds the specified weight to an object, 1705 * add_weight(object, weight) adds the specified weight to an object,
1726 * and also updates how much the environment(s) is/are carrying. 1706 * and also updates how much the environment(s) is/are carrying.
1727 */ 1707 */
1728 1708
1709void
1729void add_weight (object *op, signed long weight) { 1710add_weight (object *op, signed long weight)
1711{
1730 while (op!=NULL) { 1712 while (op != NULL)
1713 {
1731 if (op->type == CONTAINER) { 1714 if (op->type == CONTAINER)
1732 weight=(signed long)(weight*(100-op->stats.Str)/100); 1715 weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1733 } 1716
1734 op->carrying+=weight; 1717 op->carrying += weight;
1735 op=op->env; 1718 op = op->env;
1736 } 1719 }
1737} 1720}
1738 1721
1722object *
1723insert_ob_in_ob (object *op, object *where)
1724{
1725 if (!where)
1726 {
1727 char *dump = dump_object (op);
1728 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1729 free (dump);
1730 return op;
1731 }
1732
1733 if (where->head)
1734 {
1735 LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n");
1736 where = where->head;
1737 }
1738
1739 return where->insert (op);
1740}
1741
1739/* 1742/*
1740 * insert_ob_in_ob(op,environment): 1743 * env->insert (op)
1741 * This function inserts the object op in the linked list 1744 * This function inserts the object op in the linked list
1742 * inside the object environment. 1745 * inside the object environment.
1743 * 1746 *
1744 * Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter
1745 * the inventory at the last position or next to other objects of the same
1746 * type.
1747 * Frank: Now sorted by type, archetype and magic!
1748 *
1749 * The function returns now pointer to inserted item, and return value can 1747 * The function returns now pointer to inserted item, and return value can
1750 * be != op, if items are merged. -Tero 1748 * be != op, if items are merged. -Tero
1751 */ 1749 */
1752 1750
1753object *insert_ob_in_ob(object *op,object *where) { 1751object *
1752object::insert (object *op)
1753{
1754 object *tmp, *otmp; 1754 object *tmp, *otmp;
1755 1755
1756 if(!QUERY_FLAG(op,FLAG_REMOVED)) { 1756 if (!QUERY_FLAG (op, FLAG_REMOVED))
1757 dump_object(op); 1757 op->remove ();
1758 LOG(llevError,"Trying to insert (ob) inserted object.\n%s\n", errmsg); 1758
1759 return op;
1760 }
1761 if(where==NULL) {
1762 dump_object(op);
1763 LOG(llevError,"Trying to put object in NULL.\n%s\n", errmsg);
1764 return op;
1765 }
1766 if (where->head) {
1767 LOG(llevDebug,
1768 "Warning: Tried to insert object wrong part of multipart object.\n");
1769 where = where->head;
1770 }
1771 if (op->more) { 1759 if (op->more)
1760 {
1772 LOG(llevError, "Tried to insert multipart object %s (%d)\n", 1761 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1773 &op->name, op->count);
1774 return op; 1762 return op;
1775 } 1763 }
1764
1776 CLEAR_FLAG(op, FLAG_OBJ_ORIGINAL); 1765 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1777 CLEAR_FLAG(op, FLAG_REMOVED); 1766 CLEAR_FLAG (op, FLAG_REMOVED);
1778 if(op->nrof) { 1767 if (op->nrof)
1768 {
1779 for(tmp=where->inv;tmp!=NULL;tmp=tmp->below) 1769 for (tmp = inv; tmp != NULL; tmp = tmp->below)
1780 if ( CAN_MERGE(tmp,op) ) { 1770 if (CAN_MERGE (tmp, op))
1771 {
1781 /* return the original object and remove inserted object 1772 /* return the original object and remove inserted object
1782 (client needs the original object) */ 1773 (client needs the original object) */
1783 tmp->nrof += op->nrof; 1774 tmp->nrof += op->nrof;
1784 /* Weight handling gets pretty funky. Since we are adding to 1775 /* Weight handling gets pretty funky. Since we are adding to
1785 * tmp->nrof, we need to increase the weight. 1776 * tmp->nrof, we need to increase the weight.
1786 */ 1777 */
1787 add_weight (where, op->weight*op->nrof); 1778 add_weight (this, op->weight * op->nrof);
1788 SET_FLAG(op, FLAG_REMOVED); 1779 SET_FLAG (op, FLAG_REMOVED);
1789 free_object(op); /* free the inserted object */ 1780 op->destroy (); /* free the inserted object */
1790 op = tmp; 1781 op = tmp;
1791 remove_ob (op); /* and fix old object's links */ 1782 op->remove (); /* and fix old object's links */
1792 CLEAR_FLAG(op, FLAG_REMOVED); 1783 CLEAR_FLAG (op, FLAG_REMOVED);
1793 break; 1784 break;
1794 } 1785 }
1795 1786
1796 /* I assume combined objects have no inventory 1787 /* I assume combined objects have no inventory
1797 * We add the weight - this object could have just been removed 1788 * We add the weight - this object could have just been removed
1798 * (if it was possible to merge). calling remove_ob will subtract 1789 * (if it was possible to merge). calling remove_ob will subtract
1799 * the weight, so we need to add it in again, since we actually do 1790 * the weight, so we need to add it in again, since we actually do
1800 * the linking below 1791 * the linking below
1801 */ 1792 */
1802 add_weight (where, op->weight*op->nrof); 1793 add_weight (this, op->weight * op->nrof);
1794 }
1803 } else 1795 else
1804 add_weight (where, (op->weight+op->carrying)); 1796 add_weight (this, (op->weight + op->carrying));
1805 1797
1806 otmp=is_player_inv(where); 1798 otmp = is_player_inv (this);
1807 if (otmp&&otmp->contr!=NULL) { 1799 if (otmp && otmp->contr)
1808 if (!QUERY_FLAG(otmp,FLAG_NO_FIX_PLAYER)) 1800 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1809 fix_player(otmp); 1801 fix_player (otmp);
1810 }
1811 1802
1812 op->map=NULL; 1803 op->map = NULL;
1813 op->env=where; 1804 op->env = this;
1814 op->above=NULL; 1805 op->above = NULL;
1815 op->below=NULL; 1806 op->below = NULL;
1816 op->x=0,op->y=0; 1807 op->x = 0, op->y = 0;
1817 op->ox=0,op->oy=0;
1818 1808
1819 /* reset the light list and los of the players on the map */ 1809 /* reset the light list and los of the players on the map */
1820 if((op->glow_radius!=0)&&where->map) 1810 if ((op->glow_radius != 0) && map)
1821 { 1811 {
1822#ifdef DEBUG_LIGHTS 1812#ifdef DEBUG_LIGHTS
1823 LOG(llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", 1813 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1824 op->name);
1825#endif /* DEBUG_LIGHTS */ 1814#endif /* DEBUG_LIGHTS */
1826 if (MAP_DARKNESS(where->map)) update_all_los(where->map, where->x, where->y); 1815 if (MAP_DARKNESS (map))
1816 update_all_los (map, x, y);
1827 } 1817 }
1828 1818
1829 /* Client has no idea of ordering so lets not bother ordering it here. 1819 /* Client has no idea of ordering so lets not bother ordering it here.
1830 * It sure simplifies this function... 1820 * It sure simplifies this function...
1831 */ 1821 */
1832 if (where->inv==NULL) 1822 if (!inv)
1833 where->inv=op; 1823 inv = op;
1834 else { 1824 else
1825 {
1835 op->below = where->inv; 1826 op->below = inv;
1836 op->below->above = op; 1827 op->below->above = op;
1837 where->inv = op; 1828 inv = op;
1838 } 1829 }
1830
1839 return op; 1831 return op;
1840} 1832}
1841 1833
1842/* 1834/*
1843 * Checks if any objects has a move_type that matches objects 1835 * Checks if any objects has a move_type that matches objects
… …
1858 * MSW 2001-07-08: Check all objects on space, not just those below 1850 * MSW 2001-07-08: Check all objects on space, not just those below
1859 * object being inserted. insert_ob_in_map may not put new objects 1851 * object being inserted. insert_ob_in_map may not put new objects
1860 * on top. 1852 * on top.
1861 */ 1853 */
1862 1854
1855int
1863int check_move_on (object *op, object *originator) 1856check_move_on (object *op, object *originator)
1864{ 1857{
1865 object *tmp; 1858 object *tmp;
1866 tag_t tag;
1867 mapstruct *m=op->map; 1859 maptile *m = op->map;
1868 int x=op->x, y=op->y; 1860 int x = op->x, y = op->y;
1861
1869 MoveType move_on, move_slow, move_block; 1862 MoveType move_on, move_slow, move_block;
1870 1863
1871 if(QUERY_FLAG(op,FLAG_NO_APPLY)) 1864 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1872 return 0; 1865 return 0;
1873 1866
1874 tag = op->count;
1875
1876 move_on = GET_MAP_MOVE_ON(op->map, op->x, op->y); 1867 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
1877 move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y); 1868 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
1878 move_block = GET_MAP_MOVE_BLOCK(op->map, op->x, op->y); 1869 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1879 1870
1880 /* if nothing on this space will slow op down or be applied, 1871 /* if nothing on this space will slow op down or be applied,
1881 * no need to do checking below. have to make sure move_type 1872 * no need to do checking below. have to make sure move_type
1882 * is set, as lots of objects don't have it set - we treat that 1873 * is set, as lots of objects don't have it set - we treat that
1883 * as walking. 1874 * as walking.
1884 */ 1875 */
1885 if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow)) 1876 if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow))
1886 return 0; 1877 return 0;
1887 1878
1888 /* This is basically inverse logic of that below - basically, 1879 /* This is basically inverse logic of that below - basically,
1889 * if the object can avoid the move on or slow move, they do so, 1880 * if the object can avoid the move on or slow move, they do so,
1890 * but can't do it if the alternate movement they are using is 1881 * but can't do it if the alternate movement they are using is
1891 * blocked. Logic on this seems confusing, but does seem correct. 1882 * blocked. Logic on this seems confusing, but does seem correct.
1892 */ 1883 */
1893 if ((op->move_type & ~move_on & ~move_block) != 0 && 1884 if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0)
1894 (op->move_type & ~move_slow & ~move_block) != 0) return 0; 1885 return 0;
1895 1886
1896 /* The objects have to be checked from top to bottom. 1887 /* The objects have to be checked from top to bottom.
1897 * Hence, we first go to the top: 1888 * Hence, we first go to the top:
1898 */ 1889 */
1899 1890
1900 for (tmp=GET_MAP_OB(op->map, op->x, op->y); tmp!=NULL && 1891 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)
1901 tmp->above!=NULL; tmp=tmp->above) { 1892 {
1902 /* Trim the search when we find the first other spell effect 1893 /* Trim the search when we find the first other spell effect
1903 * this helps performance so that if a space has 50 spell objects, 1894 * this helps performance so that if a space has 50 spell objects,
1904 * we don't need to check all of them. 1895 * we don't need to check all of them.
1905 */ 1896 */
1906 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG(tmp, FLAG_NO_PICK)) break; 1897 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1898 break;
1899 }
1900
1901 for (; tmp; tmp = tmp->below)
1907 } 1902 {
1908 for(;tmp!=NULL; tmp=tmp->below) { 1903 if (tmp == op)
1909 if (tmp == op) continue; /* Can't apply yourself */ 1904 continue; /* Can't apply yourself */
1910 1905
1911 /* Check to see if one of the movement types should be slowed down. 1906 /* Check to see if one of the movement types should be slowed down.
1912 * Second check makes sure that the movement types not being slowed 1907 * Second check makes sure that the movement types not being slowed
1913 * (~slow_move) is not blocked on this space - just because the 1908 * (~slow_move) is not blocked on this space - just because the
1914 * space doesn't slow down swimming (for example), if you can't actually 1909 * space doesn't slow down swimming (for example), if you can't actually
1915 * swim on that space, can't use it to avoid the penalty. 1910 * swim on that space, can't use it to avoid the penalty.
1916 */ 1911 */
1917 if (!QUERY_FLAG(op, FLAG_WIZPASS)) { 1912 if (!QUERY_FLAG (op, FLAG_WIZPASS))
1913 {
1918 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1914 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1919 ((op->move_type & tmp->move_slow) &&
1920 (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) { 1915 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1916 {
1921 1917
1922 float diff; 1918 float
1923
1924 diff = tmp->move_slow_penalty*FABS(op->speed); 1919 diff = tmp->move_slow_penalty * FABS (op->speed);
1920
1925 if (op->type == PLAYER) { 1921 if (op->type == PLAYER)
1926 if ((QUERY_FLAG(tmp, FLAG_IS_HILLY) && find_skill_by_number(op, SK_CLIMBING)) || 1922 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1927 (QUERY_FLAG(tmp, FLAG_IS_WOODED) && find_skill_by_number(op, SK_WOODSMAN))) { 1923 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1928 diff /= 4.0; 1924 diff /= 4.0;
1929 } 1925
1930 }
1931 op->speed_left -= diff; 1926 op->speed_left -= diff;
1932 } 1927 }
1933 } 1928 }
1934 1929
1935 /* Basically same logic as above, except now for actual apply. */ 1930 /* Basically same logic as above, except now for actual apply. */
1936 if ((!op->move_type && tmp->move_on & MOVE_WALK) || 1931 if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
1937 ((op->move_type & tmp->move_on) &&
1938 (op->move_type & ~tmp->move_on & ~tmp->move_block)==0)) { 1932 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
1939 1933 {
1940 move_apply(tmp, op, originator); 1934 move_apply (tmp, op, originator);
1935
1941 if (was_destroyed (op, tag)) 1936 if (op->destroyed ())
1942 return 1; 1937 return 1;
1943 1938
1944 /* what the person/creature stepped onto has moved the object 1939 /* what the person/creature stepped onto has moved the object
1945 * someplace new. Don't process any further - if we did, 1940 * someplace new. Don't process any further - if we did,
1946 * have a feeling strange problems would result. 1941 * have a feeling strange problems would result.
1947 */ 1942 */
1948 if (op->map != m || op->x != x || op->y != y) return 0; 1943 if (op->map != m || op->x != x || op->y != y)
1944 return 0;
1949 } 1945 }
1950 } 1946 }
1947
1951 return 0; 1948 return 0;
1952} 1949}
1953 1950
1954/* 1951/*
1955 * present_arch(arch, map, x, y) searches for any objects with 1952 * present_arch(arch, map, x, y) searches for any objects with
1956 * a matching archetype at the given map and coordinates. 1953 * a matching archetype at the given map and coordinates.
1957 * The first matching object is returned, or NULL if none. 1954 * The first matching object is returned, or NULL if none.
1958 */ 1955 */
1959 1956
1957object *
1960object *present_arch(const archetype *at, mapstruct *m, int x, int y) { 1958present_arch (const archetype *at, maptile *m, int x, int y)
1959{
1961 object *tmp; 1960 object *
1961 tmp;
1962
1962 if(m==NULL || out_of_map(m,x,y)) { 1963 if (m == NULL || out_of_map (m, x, y))
1964 {
1963 LOG(llevError,"Present_arch called outside map.\n"); 1965 LOG (llevError, "Present_arch called outside map.\n");
1964 return NULL; 1966 return NULL;
1965 } 1967 }
1966 for(tmp=GET_MAP_OB(m,x,y); tmp != NULL; tmp = tmp->above) 1968 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1967 if(tmp->arch == at) 1969 if (tmp->arch == at)
1968 return tmp; 1970 return tmp;
1969 return NULL; 1971 return NULL;
1970} 1972}
1971 1973
1972/* 1974/*
1973 * present(type, map, x, y) searches for any objects with 1975 * present(type, map, x, y) searches for any objects with
1974 * a matching type variable at the given map and coordinates. 1976 * a matching type variable at the given map and coordinates.
1975 * The first matching object is returned, or NULL if none. 1977 * The first matching object is returned, or NULL if none.
1976 */ 1978 */
1977 1979
1980object *
1978object *present(unsigned char type,mapstruct *m, int x,int y) { 1981present (unsigned char type, maptile *m, int x, int y)
1982{
1979 object *tmp; 1983 object *
1984 tmp;
1985
1980 if(out_of_map(m,x,y)) { 1986 if (out_of_map (m, x, y))
1987 {
1981 LOG(llevError,"Present called outside map.\n"); 1988 LOG (llevError, "Present called outside map.\n");
1982 return NULL; 1989 return NULL;
1983 } 1990 }
1984 for(tmp=GET_MAP_OB(m,x,y);tmp!=NULL;tmp=tmp->above) 1991 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1985 if(tmp->type==type) 1992 if (tmp->type == type)
1986 return tmp; 1993 return tmp;
1987 return NULL; 1994 return NULL;
1988} 1995}
1989 1996
1990/* 1997/*
1991 * present_in_ob(type, object) searches for any objects with 1998 * present_in_ob(type, object) searches for any objects with
1992 * a matching type variable in the inventory of the given object. 1999 * a matching type variable in the inventory of the given object.
1993 * The first matching object is returned, or NULL if none. 2000 * The first matching object is returned, or NULL if none.
1994 */ 2001 */
1995 2002
2003object *
1996object *present_in_ob(unsigned char type, const object *op) { 2004present_in_ob (unsigned char type, const object *op)
2005{
1997 object *tmp; 2006 object *
2007 tmp;
2008
1998 for(tmp=op->inv;tmp!=NULL;tmp=tmp->below) 2009 for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
1999 if(tmp->type==type) 2010 if (tmp->type == type)
2000 return tmp; 2011 return tmp;
2001 return NULL; 2012 return NULL;
2002} 2013}
2003 2014
2004/* 2015/*
… …
2014 * the object name, not the archetype name. this is so that the 2025 * the object name, not the archetype name. this is so that the
2015 * spell code can use one object type (force), but change it's name 2026 * spell code can use one object type (force), but change it's name
2016 * to be unique. 2027 * to be unique.
2017 */ 2028 */
2018 2029
2030object *
2019object *present_in_ob_by_name(int type, const char *str, const object *op) { 2031present_in_ob_by_name (int type, const char *str, const object *op)
2032{
2020 object *tmp; 2033 object *
2034 tmp;
2021 2035
2022 for(tmp=op->inv; tmp!=NULL; tmp=tmp->below) { 2036 for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
2037 {
2023 if ((type==-1 || tmp->type==type) && (!strcmp(str, tmp->name))) 2038 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2024 return tmp; 2039 return tmp;
2025 } 2040 }
2026 return NULL; 2041 return NULL;
2027} 2042}
2028 2043
2029/* 2044/*
2030 * present_arch_in_ob(archetype, object) searches for any objects with 2045 * present_arch_in_ob(archetype, object) searches for any objects with
2031 * a matching archetype in the inventory of the given object. 2046 * a matching archetype in the inventory of the given object.
2032 * The first matching object is returned, or NULL if none. 2047 * The first matching object is returned, or NULL if none.
2033 */ 2048 */
2034 2049
2050object *
2035object *present_arch_in_ob(const archetype *at, const object *op) { 2051present_arch_in_ob (const archetype *at, const object *op)
2052{
2036 object *tmp; 2053 object *
2054 tmp;
2055
2037 for(tmp=op->inv;tmp!=NULL;tmp=tmp->below) 2056 for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
2038 if( tmp->arch == at) 2057 if (tmp->arch == at)
2039 return tmp; 2058 return tmp;
2040 return NULL; 2059 return NULL;
2041} 2060}
2042 2061
2043/* 2062/*
2044 * activate recursively a flag on an object inventory 2063 * activate recursively a flag on an object inventory
2045 */ 2064 */
2065void
2046void flag_inv(object*op, int flag){ 2066flag_inv (object *op, int flag)
2067{
2047 object *tmp; 2068 object *
2069 tmp;
2070
2048 if(op->inv) 2071 if (op->inv)
2049 for(tmp = op->inv; tmp != NULL; tmp = tmp->below){ 2072 for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
2073 {
2050 SET_FLAG(tmp, flag); 2074 SET_FLAG (tmp, flag);
2051 flag_inv(tmp,flag); 2075 flag_inv (tmp, flag);
2052 } 2076 }
2053}/* 2077} /*
2054 * desactivate recursively a flag on an object inventory 2078 * desactivate recursively a flag on an object inventory
2055 */ 2079 */
2080void
2056void unflag_inv(object*op, int flag){ 2081unflag_inv (object *op, int flag)
2082{
2057 object *tmp; 2083 object *
2084 tmp;
2085
2058 if(op->inv) 2086 if (op->inv)
2059 for(tmp = op->inv; tmp != NULL; tmp = tmp->below){ 2087 for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
2088 {
2060 CLEAR_FLAG(tmp, flag); 2089 CLEAR_FLAG (tmp, flag);
2061 unflag_inv(tmp,flag); 2090 unflag_inv (tmp, flag);
2062 } 2091 }
2063} 2092}
2064 2093
2065/* 2094/*
2066 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in 2095 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
2067 * all it's inventory (recursively). 2096 * all it's inventory (recursively).
2068 * If checksums are used, a player will get set_cheat called for 2097 * If checksums are used, a player will get set_cheat called for
2069 * him/her-self and all object carried by a call to this function. 2098 * him/her-self and all object carried by a call to this function.
2070 */ 2099 */
2071 2100
2101void
2072void set_cheat(object *op) { 2102set_cheat (object *op)
2103{
2073 SET_FLAG(op, FLAG_WAS_WIZ); 2104 SET_FLAG (op, FLAG_WAS_WIZ);
2074 flag_inv(op, FLAG_WAS_WIZ); 2105 flag_inv (op, FLAG_WAS_WIZ);
2075} 2106}
2076 2107
2077/* 2108/*
2078 * find_free_spot(object, map, x, y, start, stop) will search for 2109 * find_free_spot(object, map, x, y, start, stop) will search for
2079 * a spot at the given map and coordinates which will be able to contain 2110 * a spot at the given map and coordinates which will be able to contain
… …
2094 * to know if the space in question will block the object. We can't use 2125 * to know if the space in question will block the object. We can't use
2095 * the archetype because that isn't correct if the monster has been 2126 * the archetype because that isn't correct if the monster has been
2096 * customized, changed states, etc. 2127 * customized, changed states, etc.
2097 */ 2128 */
2098 2129
2130int
2099int find_free_spot(const object *ob, mapstruct *m,int x,int y,int start,int stop) { 2131find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2132{
2133 int
2134 i,
2100 int i,index=0, flag; 2135 index = 0, flag;
2136 static int
2101 static int altern[SIZEOFFREE]; 2137 altern[SIZEOFFREE];
2102 2138
2103 for(i=start;i<stop;i++) { 2139 for (i = start; i < stop; i++)
2140 {
2104 flag = ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]); 2141 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2105 if(!flag) 2142 if (!flag)
2106 altern[index++]=i; 2143 altern[index++] = i;
2107 2144
2108 /* Basically, if we find a wall on a space, we cut down the search size. 2145 /* Basically, if we find a wall on a space, we cut down the search size.
2109 * In this way, we won't return spaces that are on another side of a wall. 2146 * In this way, we won't return spaces that are on another side of a wall.
2110 * This mostly work, but it cuts down the search size in all directions - 2147 * This mostly work, but it cuts down the search size in all directions -
2111 * if the space being examined only has a wall to the north and empty 2148 * if the space being examined only has a wall to the north and empty
2112 * spaces in all the other directions, this will reduce the search space 2149 * spaces in all the other directions, this will reduce the search space
2113 * to only the spaces immediately surrounding the target area, and 2150 * to only the spaces immediately surrounding the target area, and
2114 * won't look 2 spaces south of the target space. 2151 * won't look 2 spaces south of the target space.
2115 */ 2152 */
2116 else if ((flag & AB_NO_PASS) && maxfree[i]<stop) 2153 else if ((flag & AB_NO_PASS) && maxfree[i] < stop)
2117 stop=maxfree[i]; 2154 stop = maxfree[i];
2118 } 2155 }
2119 if(!index) return -1; 2156 if (!index)
2157 return -1;
2120 return altern[RANDOM()%index]; 2158 return altern[RANDOM () % index];
2121} 2159}
2122 2160
2123/* 2161/*
2124 * find_first_free_spot(archetype, mapstruct, x, y) works like 2162 * find_first_free_spot(archetype, maptile, x, y) works like
2125 * find_free_spot(), but it will search max number of squares. 2163 * find_free_spot(), but it will search max number of squares.
2126 * But it will return the first available spot, not a random choice. 2164 * But it will return the first available spot, not a random choice.
2127 * Changed 0.93.2: Have it return -1 if there is no free spot available. 2165 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2128 */ 2166 */
2129 2167
2168int
2130int find_first_free_spot(const object *ob, mapstruct *m,int x,int y) { 2169find_first_free_spot (const object *ob, maptile *m, int x, int y)
2170{
2171 int
2131 int i; 2172 i;
2173
2132 for(i=0;i<SIZEOFFREE;i++) { 2174 for (i = 0; i < SIZEOFFREE; i++)
2175 {
2133 if(!ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i])) 2176 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2134 return i; 2177 return i;
2135 } 2178 }
2136 return -1; 2179 return -1;
2137} 2180}
2138 2181
2139/* 2182/*
2140 * The function permute(arr, begin, end) randomly reorders the array 2183 * The function permute(arr, begin, end) randomly reorders the array
2141 * arr[begin..end-1]. 2184 * arr[begin..end-1].
2142 */ 2185 */
2186static void
2143static void permute(int *arr, int begin, int end) 2187permute (int *arr, int begin, int end)
2144{ 2188{
2145 int i, j, tmp, len; 2189 int
2190 i,
2191 j,
2192 tmp,
2193 len;
2146 2194
2147 len = end-begin; 2195 len = end - begin;
2148 for(i = begin; i < end; i++) 2196 for (i = begin; i < end; i++)
2149 { 2197 {
2150 j = begin+RANDOM()%len; 2198 j = begin + RANDOM () % len;
2151 2199
2152 tmp = arr[i]; 2200 tmp = arr[i];
2153 arr[i] = arr[j]; 2201 arr[i] = arr[j];
2154 arr[j] = tmp; 2202 arr[j] = tmp;
2155 } 2203 }
2156} 2204}
2157 2205
2158/* new function to make monster searching more efficient, and effective! 2206/* new function to make monster searching more efficient, and effective!
2159 * This basically returns a randomized array (in the passed pointer) of 2207 * This basically returns a randomized array (in the passed pointer) of
2160 * the spaces to find monsters. In this way, it won't always look for 2208 * the spaces to find monsters. In this way, it won't always look for
2161 * monsters to the north first. However, the size of the array passed 2209 * monsters to the north first. However, the size of the array passed
2162 * covers all the spaces, so within that size, all the spaces within 2210 * covers all the spaces, so within that size, all the spaces within
2163 * the 3x3 area will be searched, just not in a predictable order. 2211 * the 3x3 area will be searched, just not in a predictable order.
2164 */ 2212 */
2213void
2165void get_search_arr(int *search_arr) 2214get_search_arr (int *search_arr)
2166{ 2215{
2216 int
2167 int i; 2217 i;
2168 2218
2169 for(i = 0; i < SIZEOFFREE; i++) 2219 for (i = 0; i < SIZEOFFREE; i++)
2170 { 2220 {
2171 search_arr[i] = i; 2221 search_arr[i] = i;
2172 } 2222 }
2173 2223
2174 permute(search_arr, 1, SIZEOFFREE1+1); 2224 permute (search_arr, 1, SIZEOFFREE1 + 1);
2175 permute(search_arr, SIZEOFFREE1+1, SIZEOFFREE2+1); 2225 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2176 permute(search_arr, SIZEOFFREE2+1, SIZEOFFREE); 2226 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2177} 2227}
2178 2228
2179/* 2229/*
2180 * find_dir(map, x, y, exclude) will search some close squares in the 2230 * find_dir(map, x, y, exclude) will search some close squares in the
2181 * given map at the given coordinates for live objects. 2231 * given map at the given coordinates for live objects.
… …
2187 * is actually want is going to try and move there. We need this info 2237 * is actually want is going to try and move there. We need this info
2188 * because we have to know what movement the thing looking to move 2238 * because we have to know what movement the thing looking to move
2189 * there is capable of. 2239 * there is capable of.
2190 */ 2240 */
2191 2241
2242int
2192int find_dir(mapstruct *m, int x, int y, object *exclude) { 2243find_dir (maptile *m, int x, int y, object *exclude)
2244{
2245 int
2246 i,
2193 int i,max=SIZEOFFREE, mflags; 2247 max = SIZEOFFREE, mflags;
2248
2194 sint16 nx, ny; 2249 sint16 nx, ny;
2195 object *tmp; 2250 object *
2196 mapstruct *mp; 2251 tmp;
2252 maptile *
2253 mp;
2254
2197 MoveType blocked, move_type; 2255 MoveType blocked, move_type;
2198 2256
2199 if (exclude && exclude->head) { 2257 if (exclude && exclude->head)
2258 {
2200 exclude = exclude->head; 2259 exclude = exclude->head;
2201 move_type = exclude->move_type; 2260 move_type = exclude->move_type;
2202 } else { 2261 }
2262 else
2263 {
2203 /* If we don't have anything, presume it can use all movement types. */ 2264 /* If we don't have anything, presume it can use all movement types. */
2204 move_type=MOVE_ALL; 2265 move_type = MOVE_ALL;
2266 }
2267
2268 for (i = 1; i < max; i++)
2205 } 2269 {
2206
2207 for(i=1;i<max;i++) {
2208 mp = m; 2270 mp = m;
2209 nx = x + freearr_x[i]; 2271 nx = x + freearr_x[i];
2210 ny = y + freearr_y[i]; 2272 ny = y + freearr_y[i];
2211 2273
2212 mflags = get_map_flags(m, &mp, nx, ny, &nx, &ny); 2274 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
2213 if (mflags & P_OUT_OF_MAP) { 2275 if (mflags & P_OUT_OF_MAP)
2276 {
2214 max = maxfree[i]; 2277 max = maxfree[i];
2278 }
2215 } else { 2279 else
2280 {
2216 blocked = GET_MAP_MOVE_BLOCK(mp, nx, ny); 2281 blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);
2217 2282
2218 if ((move_type & blocked) == move_type) { 2283 if ((move_type & blocked) == move_type)
2284 {
2219 max=maxfree[i]; 2285 max = maxfree[i];
2286 }
2220 } else if (mflags & P_IS_ALIVE) { 2287 else if (mflags & P_IS_ALIVE)
2288 {
2221 for (tmp=GET_MAP_OB(mp,nx,ny); tmp!= NULL; tmp=tmp->above) { 2289 for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)
2222 if ((QUERY_FLAG(tmp,FLAG_MONSTER) || tmp->type==PLAYER) && 2290 {
2223 (tmp != exclude ||(tmp->head && tmp->head != exclude))) { 2291 if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))
2292 {
2224 break; 2293 break;
2225 } 2294 }
2226 } 2295 }
2227 if(tmp) { 2296 if (tmp)
2297 {
2228 return freedir[i]; 2298 return freedir[i];
2229 } 2299 }
2230 } 2300 }
2231 } 2301 }
2232 } 2302 }
2233 return 0; 2303 return 0;
2234} 2304}
2235 2305
2236/* 2306/*
2237 * distance(object 1, object 2) will return the square of the 2307 * distance(object 1, object 2) will return the square of the
2238 * distance between the two given objects. 2308 * distance between the two given objects.
2239 */ 2309 */
2240 2310
2311int
2241int distance(const object *ob1, const object *ob2) { 2312distance (const object *ob1, const object *ob2)
2313{
2242 int i; 2314 int
2243 i= (ob1->x - ob2->x)*(ob1->x - ob2->x)+ 2315 i;
2244 (ob1->y - ob2->y)*(ob1->y - ob2->y); 2316
2317 i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2245 return i; 2318 return i;
2246} 2319}
2247 2320
2248/* 2321/*
2249 * find_dir_2(delta-x,delta-y) will return a direction in which 2322 * find_dir_2(delta-x,delta-y) will return a direction in which
2250 * an object which has subtracted the x and y coordinates of another 2323 * an object which has subtracted the x and y coordinates of another
2251 * object, needs to travel toward it. 2324 * object, needs to travel toward it.
2252 */ 2325 */
2253 2326
2327int
2254int find_dir_2(int x, int y) { 2328find_dir_2 (int x, int y)
2329{
2255 int q; 2330 int
2331 q;
2256 2332
2257 if(y) 2333 if (y)
2258 q=x*100/y; 2334 q = x * 100 / y;
2259 else if (x) 2335 else if (x)
2260 q= -300*x; 2336 q = -300 * x;
2261 else 2337 else
2262 return 0; 2338 return 0;
2263 2339
2264 if(y>0) { 2340 if (y > 0)
2341 {
2265 if(q < -242) 2342 if (q < -242)
2266 return 3 ; 2343 return 3;
2267 if (q < -41) 2344 if (q < -41)
2268 return 2 ; 2345 return 2;
2269 if (q < 41) 2346 if (q < 41)
2270 return 1 ; 2347 return 1;
2271 if (q < 242) 2348 if (q < 242)
2272 return 8 ; 2349 return 8;
2273 return 7 ; 2350 return 7;
2274 } 2351 }
2275 2352
2276 if (q < -242) 2353 if (q < -242)
2277 return 7 ; 2354 return 7;
2278 if (q < -41) 2355 if (q < -41)
2279 return 6 ; 2356 return 6;
2280 if (q < 41) 2357 if (q < 41)
2281 return 5 ; 2358 return 5;
2282 if (q < 242) 2359 if (q < 242)
2283 return 4 ; 2360 return 4;
2284 2361
2285 return 3 ; 2362 return 3;
2286} 2363}
2287 2364
2288/* 2365/*
2289 * absdir(int): Returns a number between 1 and 8, which represent 2366 * absdir(int): Returns a number between 1 and 8, which represent
2290 * the "absolute" direction of a number (it actually takes care of 2367 * the "absolute" direction of a number (it actually takes care of
2291 * "overflow" in previous calculations of a direction). 2368 * "overflow" in previous calculations of a direction).
2292 */ 2369 */
2293 2370
2371int
2294int absdir(int d) { 2372absdir (int d)
2295 while(d<1) d+=8; 2373{
2296 while(d>8) d-=8; 2374 while (d < 1)
2375 d += 8;
2376 while (d > 8)
2377 d -= 8;
2297 return d; 2378 return d;
2298} 2379}
2299 2380
2300/* 2381/*
2301 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2382 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2302 * between two directions (which are expected to be absolute (see absdir()) 2383 * between two directions (which are expected to be absolute (see absdir())
2303 */ 2384 */
2304 2385
2386int
2305int dirdiff(int dir1, int dir2) { 2387dirdiff (int dir1, int dir2)
2388{
2306 int d; 2389 int
2390 d;
2391
2307 d = abs(dir1 - dir2); 2392 d = abs (dir1 - dir2);
2308 if(d>4) 2393 if (d > 4)
2309 d = 8 - d; 2394 d = 8 - d;
2310 return d; 2395 return d;
2311} 2396}
2312 2397
2313/* peterm: 2398/* peterm:
… …
2318 * direction 4, 14, or 16 to get back to where we are. 2403 * direction 4, 14, or 16 to get back to where we are.
2319 * Moved from spell_util.c to object.c with the other related direction 2404 * Moved from spell_util.c to object.c with the other related direction
2320 * functions. 2405 * functions.
2321 */ 2406 */
2322 2407
2408int
2323int reduction_dir[SIZEOFFREE][3] = { 2409 reduction_dir[SIZEOFFREE][3] = {
2324 {0,0,0}, /* 0 */ 2410 {0, 0, 0}, /* 0 */
2325 {0,0,0}, /* 1 */ 2411 {0, 0, 0}, /* 1 */
2326 {0,0,0}, /* 2 */ 2412 {0, 0, 0}, /* 2 */
2327 {0,0,0}, /* 3 */ 2413 {0, 0, 0}, /* 3 */
2328 {0,0,0}, /* 4 */ 2414 {0, 0, 0}, /* 4 */
2329 {0,0,0}, /* 5 */ 2415 {0, 0, 0}, /* 5 */
2330 {0,0,0}, /* 6 */ 2416 {0, 0, 0}, /* 6 */
2331 {0,0,0}, /* 7 */ 2417 {0, 0, 0}, /* 7 */
2332 {0,0,0}, /* 8 */ 2418 {0, 0, 0}, /* 8 */
2333 {8,1,2}, /* 9 */ 2419 {8, 1, 2}, /* 9 */
2334 {1,2,-1}, /* 10 */ 2420 {1, 2, -1}, /* 10 */
2335 {2,10,12}, /* 11 */ 2421 {2, 10, 12}, /* 11 */
2336 {2,3,-1}, /* 12 */ 2422 {2, 3, -1}, /* 12 */
2337 {2,3,4}, /* 13 */ 2423 {2, 3, 4}, /* 13 */
2338 {3,4,-1}, /* 14 */ 2424 {3, 4, -1}, /* 14 */
2339 {4,14,16}, /* 15 */ 2425 {4, 14, 16}, /* 15 */
2340 {5,4,-1}, /* 16 */ 2426 {5, 4, -1}, /* 16 */
2341 {4,5,6}, /* 17 */ 2427 {4, 5, 6}, /* 17 */
2342 {6,5,-1}, /* 18 */ 2428 {6, 5, -1}, /* 18 */
2343 {6,20,18}, /* 19 */ 2429 {6, 20, 18}, /* 19 */
2344 {7,6,-1}, /* 20 */ 2430 {7, 6, -1}, /* 20 */
2345 {6,7,8}, /* 21 */ 2431 {6, 7, 8}, /* 21 */
2346 {7,8,-1}, /* 22 */ 2432 {7, 8, -1}, /* 22 */
2347 {8,22,24}, /* 23 */ 2433 {8, 22, 24}, /* 23 */
2348 {8,1,-1}, /* 24 */ 2434 {8, 1, -1}, /* 24 */
2349 {24,9,10}, /* 25 */ 2435 {24, 9, 10}, /* 25 */
2350 {9,10,-1}, /* 26 */ 2436 {9, 10, -1}, /* 26 */
2351 {10,11,-1}, /* 27 */ 2437 {10, 11, -1}, /* 27 */
2352 {27,11,29}, /* 28 */ 2438 {27, 11, 29}, /* 28 */
2353 {11,12,-1}, /* 29 */ 2439 {11, 12, -1}, /* 29 */
2354 {12,13,-1}, /* 30 */ 2440 {12, 13, -1}, /* 30 */
2355 {12,13,14}, /* 31 */ 2441 {12, 13, 14}, /* 31 */
2356 {13,14,-1}, /* 32 */ 2442 {13, 14, -1}, /* 32 */
2357 {14,15,-1}, /* 33 */ 2443 {14, 15, -1}, /* 33 */
2358 {33,15,35}, /* 34 */ 2444 {33, 15, 35}, /* 34 */
2359 {16,15,-1}, /* 35 */ 2445 {16, 15, -1}, /* 35 */
2360 {17,16,-1}, /* 36 */ 2446 {17, 16, -1}, /* 36 */
2361 {18,17,16}, /* 37 */ 2447 {18, 17, 16}, /* 37 */
2362 {18,17,-1}, /* 38 */ 2448 {18, 17, -1}, /* 38 */
2363 {18,19,-1}, /* 39 */ 2449 {18, 19, -1}, /* 39 */
2364 {41,19,39}, /* 40 */ 2450 {41, 19, 39}, /* 40 */
2365 {19,20,-1}, /* 41 */ 2451 {19, 20, -1}, /* 41 */
2366 {20,21,-1}, /* 42 */ 2452 {20, 21, -1}, /* 42 */
2367 {20,21,22}, /* 43 */ 2453 {20, 21, 22}, /* 43 */
2368 {21,22,-1}, /* 44 */ 2454 {21, 22, -1}, /* 44 */
2369 {23,22,-1}, /* 45 */ 2455 {23, 22, -1}, /* 45 */
2370 {45,47,23}, /* 46 */ 2456 {45, 47, 23}, /* 46 */
2371 {23,24,-1}, /* 47 */ 2457 {23, 24, -1}, /* 47 */
2372 {24,9,-1}}; /* 48 */ 2458 {24, 9, -1}
2459}; /* 48 */
2373 2460
2374/* Recursive routine to step back and see if we can 2461/* Recursive routine to step back and see if we can
2375 * find a path to that monster that we found. If not, 2462 * find a path to that monster that we found. If not,
2376 * we don't bother going toward it. Returns 1 if we 2463 * we don't bother going toward it. Returns 1 if we
2377 * can see a direct way to get it 2464 * can see a direct way to get it
2378 * Modified to be map tile aware -.MSW 2465 * Modified to be map tile aware -.MSW
2379 */ 2466 */
2380
2381 2467
2468
2469int
2382int can_see_monsterP(mapstruct *m, int x, int y,int dir) { 2470can_see_monsterP (maptile *m, int x, int y, int dir)
2471{
2383 sint16 dx, dy; 2472 sint16 dx, dy;
2473 int
2384 int mflags; 2474 mflags;
2385 2475
2476 if (dir < 0)
2386 if(dir<0) return 0; /* exit condition: invalid direction */ 2477 return 0; /* exit condition: invalid direction */
2387 2478
2388 dx = x + freearr_x[dir]; 2479 dx = x + freearr_x[dir];
2389 dy = y + freearr_y[dir]; 2480 dy = y + freearr_y[dir];
2390 2481
2391 mflags = get_map_flags(m, &m, dx, dy, &dx, &dy); 2482 mflags = get_map_flags (m, &m, dx, dy, &dx, &dy);
2392 2483
2393 /* This functional arguably was incorrect before - it was 2484 /* This functional arguably was incorrect before - it was
2394 * checking for P_WALL - that was basically seeing if 2485 * checking for P_WALL - that was basically seeing if
2395 * we could move to the monster - this is being more 2486 * we could move to the monster - this is being more
2396 * literal on if we can see it. To know if we can actually 2487 * literal on if we can see it. To know if we can actually
2397 * move to the monster, we'd need the monster passed in or 2488 * move to the monster, we'd need the monster passed in or
2398 * at least its move type. 2489 * at least its move type.
2399 */ 2490 */
2400 if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW)) return 0; 2491 if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW))
2492 return 0;
2401 2493
2402 /* yes, can see. */ 2494 /* yes, can see. */
2403 if(dir < 9) return 1; 2495 if (dir < 9)
2496 return 1;
2404 return can_see_monsterP(m, x, y, reduction_dir[dir][0]) | 2497 return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |
2405 can_see_monsterP(m,x,y, reduction_dir[dir][1]) | 2498 can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2406 can_see_monsterP(m,x,y, reduction_dir[dir][2]);
2407} 2499}
2408 2500
2409 2501
2410 2502
2411/* 2503/*
2412 * can_pick(picker, item): finds out if an object is possible to be 2504 * can_pick(picker, item): finds out if an object is possible to be
2413 * picked up by the picker. Returnes 1 if it can be 2505 * picked up by the picker. Returnes 1 if it can be
2414 * picked up, otherwise 0. 2506 * picked up, otherwise 0.
2415 * 2507 *
… …
2417 * core dumps if they do. 2509 * core dumps if they do.
2418 * 2510 *
2419 * Add a check so we can't pick up invisible objects (0.93.8) 2511 * Add a check so we can't pick up invisible objects (0.93.8)
2420 */ 2512 */
2421 2513
2514int
2422int can_pick(const object *who, const object *item) { 2515can_pick (const object *who, const object *item)
2516{
2423 return /*QUERY_FLAG(who,FLAG_WIZ)||*/ 2517 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2424 (item->weight>0&&!QUERY_FLAG(item,FLAG_NO_PICK)&& 2518 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2425 !QUERY_FLAG(item,FLAG_ALIVE)&&!item->invisible && 2519 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2426 (who->type==PLAYER||item->weight<who->weight/3));
2427} 2520}
2428 2521
2429 2522
2430/* 2523/*
2431 * create clone from object to another 2524 * create clone from object to another
2432 */ 2525 */
2526object *
2433object *object_create_clone (object *asrc) { 2527object_create_clone (object *asrc)
2528{
2434 object *dst = NULL,*tmp,*src,*part,*prev, *item; 2529 object *dst = 0, *tmp, *src, *part, *prev, *item;
2435 2530
2436 if(!asrc) return NULL; 2531 if (!asrc)
2532 return 0;
2533
2437 src = asrc; 2534 src = asrc;
2438 if(src->head) 2535 if (src->head)
2439 src = src->head; 2536 src = src->head;
2440 2537
2441 prev = NULL; 2538 prev = 0;
2442 for(part = src; part; part = part->more) { 2539 for (part = src; part; part = part->more)
2540 {
2443 tmp = get_object(); 2541 tmp = get_object ();
2444 copy_object(part,tmp); 2542 copy_object (part, tmp);
2445 tmp->x -= src->x; 2543 tmp->x -= src->x;
2446 tmp->y -= src->y; 2544 tmp->y -= src->y;
2545
2447 if(!part->head) { 2546 if (!part->head)
2547 {
2448 dst = tmp; 2548 dst = tmp;
2449 tmp->head = NULL; 2549 tmp->head = 0;
2550 }
2450 } else { 2551 else
2552 {
2451 tmp->head = dst; 2553 tmp->head = dst;
2452 } 2554 }
2555
2453 tmp->more = NULL; 2556 tmp->more = 0;
2557
2454 if(prev) 2558 if (prev)
2455 prev->more = tmp; 2559 prev->more = tmp;
2560
2456 prev = tmp; 2561 prev = tmp;
2457 } 2562 }
2458 /*** copy inventory ***/ 2563
2459 for(item = src->inv; item; item = item->below) { 2564 for (item = src->inv; item; item = item->below)
2460 (void) insert_ob_in_ob(object_create_clone(item),dst); 2565 insert_ob_in_ob (object_create_clone (item), dst);
2461 }
2462 2566
2463 return dst; 2567 return dst;
2464}
2465
2466/* return true if the object was destroyed, 0 otherwise */
2467int was_destroyed (const object *op, tag_t old_tag)
2468{
2469 /* checking for FLAG_FREED isn't necessary, but makes this function more
2470 * robust */
2471 return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED);
2472} 2568}
2473 2569
2474/* GROS - Creates an object using a string representing its content. */ 2570/* GROS - Creates an object using a string representing its content. */
2475/* Basically, we save the content of the string to a temp file, then call */ 2571/* Basically, we save the content of the string to a temp file, then call */
2476/* load_object on it. I admit it is a highly inefficient way to make things, */ 2572/* load_object on it. I admit it is a highly inefficient way to make things, */
2477/* but it was simple to make and allows reusing the load_object function. */ 2573/* but it was simple to make and allows reusing the load_object function. */
2478/* Remember not to use load_object_str in a time-critical situation. */ 2574/* Remember not to use load_object_str in a time-critical situation. */
2479/* Also remember that multiparts objects are not supported for now. */ 2575/* Also remember that multiparts objects are not supported for now. */
2480 2576
2577object *
2481object* load_object_str(const char *obstr) 2578load_object_str (const char *obstr)
2482{ 2579{
2483 object *op; 2580 object *op;
2484 char filename[MAX_BUF]; 2581 char filename[MAX_BUF];
2582
2485 sprintf(filename,"%s/cfloadobstr2044",settings.tmpdir); 2583 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2486 2584
2487 FILE *tempfile=fopen(filename,"w"); 2585 FILE *tempfile = fopen (filename, "w");
2586
2488 if (tempfile == NULL) 2587 if (tempfile == NULL)
2489 { 2588 {
2490 LOG(llevError,"Error - Unable to access load object temp file\n"); 2589 LOG (llevError, "Error - Unable to access load object temp file\n");
2491 return NULL; 2590 return NULL;
2492 }; 2591 }
2592
2493 fprintf(tempfile,obstr); 2593 fprintf (tempfile, obstr);
2494 fclose(tempfile); 2594 fclose (tempfile);
2495 2595
2496 op=get_object(); 2596 op = get_object ();
2497 2597
2498 object_thawer thawer (filename); 2598 object_thawer thawer (filename);
2599
2499 if (thawer) 2600 if (thawer)
2500 load_object(thawer,op,LO_NEWFILE,0); 2601 load_object (thawer, op, 0);
2602
2501 LOG(llevDebug," load str completed, object=%s\n", &op->name); 2603 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2502 CLEAR_FLAG(op,FLAG_REMOVED); 2604 CLEAR_FLAG (op, FLAG_REMOVED);
2503 2605
2504 return op; 2606 return op;
2505} 2607}
2506 2608
2507/* This returns the first object in who's inventory that 2609/* This returns the first object in who's inventory that
2508 * has the same type and subtype match. 2610 * has the same type and subtype match.
2509 * returns NULL if no match. 2611 * returns NULL if no match.
2510 */ 2612 */
2613object *
2511object *find_obj_by_type_subtype(const object *who, int type, int subtype) 2614find_obj_by_type_subtype (const object *who, int type, int subtype)
2512{ 2615{
2513 object *tmp; 2616 object *tmp;
2514 2617
2515 for (tmp=who->inv; tmp; tmp=tmp->below) 2618 for (tmp = who->inv; tmp; tmp = tmp->below)
2516 if (tmp->type == type && tmp->subtype == subtype) return tmp; 2619 if (tmp->type == type && tmp->subtype == subtype)
2620 return tmp;
2517 2621
2518 return NULL; 2622 return NULL;
2519} 2623}
2520 2624
2521/* If ob has a field named key, return the link from the list, 2625/* If ob has a field named key, return the link from the list,
2522 * otherwise return NULL. 2626 * otherwise return NULL.
2523 * 2627 *
2524 * key must be a passed in shared string - otherwise, this won't 2628 * key must be a passed in shared string - otherwise, this won't
2525 * do the desired thing. 2629 * do the desired thing.
2526 */ 2630 */
2631key_value *
2527key_value * get_ob_key_link(const object * ob, const char * key) { 2632get_ob_key_link (const object *ob, const char *key)
2633{
2528 key_value * link; 2634 key_value *link;
2529 2635
2530 for (link = ob->key_values; link != NULL; link = link->next) { 2636 for (link = ob->key_values; link != NULL; link = link->next)
2531 if (link->key == key) { 2637 if (link->key == key)
2532 return link; 2638 return link;
2533 } 2639
2534 }
2535
2536 return NULL; 2640 return NULL;
2537} 2641}
2538 2642
2539/* 2643/*
2540 * Returns the value of op has an extra_field for key, or NULL. 2644 * Returns the value of op has an extra_field for key, or NULL.
2541 * 2645 *
2542 * The argument doesn't need to be a shared string. 2646 * The argument doesn't need to be a shared string.
2543 * 2647 *
2544 * The returned string is shared. 2648 * The returned string is shared.
2545 */ 2649 */
2650const char *
2546const char * get_ob_key_value(const object * op, const char * const key) { 2651get_ob_key_value (const object *op, const char *const key)
2652{
2547 key_value * link; 2653 key_value *link;
2548 const char * canonical_key; 2654 shstr_cmp canonical_key (key);
2655
2656 if (!canonical_key)
2549 2657 {
2550 canonical_key = shstr::find (key);
2551
2552 if (canonical_key == NULL) {
2553 /* 1. There being a field named key on any object 2658 /* 1. There being a field named key on any object
2554 * implies there'd be a shared string to find. 2659 * implies there'd be a shared string to find.
2555 * 2. Since there isn't, no object has this field. 2660 * 2. Since there isn't, no object has this field.
2556 * 3. Therefore, *this* object doesn't have this field. 2661 * 3. Therefore, *this* object doesn't have this field.
2557 */ 2662 */
2558 return NULL; 2663 return 0;
2559 } 2664 }
2560 2665
2561 /* This is copied from get_ob_key_link() above - 2666 /* This is copied from get_ob_key_link() above -
2562 * only 4 lines, and saves the function call overhead. 2667 * only 4 lines, and saves the function call overhead.
2563 */ 2668 */
2564 for (link = op->key_values; link != NULL; link = link->next) { 2669 for (link = op->key_values; link; link = link->next)
2565 if (link->key == canonical_key) { 2670 if (link->key == canonical_key)
2566 return link->value; 2671 return link->value;
2567 } 2672
2568 } 2673 return 0;
2569 return NULL;
2570} 2674}
2571 2675
2572 2676
2573/* 2677/*
2574 * Updates the canonical_key in op to value. 2678 * Updates the canonical_key in op to value.
… …
2578 * Unless add_key is TRUE, it won't add fields, only change the value of existing 2682 * Unless add_key is TRUE, it won't add fields, only change the value of existing
2579 * keys. 2683 * keys.
2580 * 2684 *
2581 * Returns TRUE on success. 2685 * Returns TRUE on success.
2582 */ 2686 */
2687int
2583int set_ob_key_value_s(object * op, const shstr &canonical_key, const char * value, int add_key) { 2688set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2689{
2690 key_value *
2584 key_value * field = NULL, *last=NULL; 2691 field = NULL, *last = NULL;
2585 2692
2586 for (field=op->key_values; field != NULL; field=field->next) { 2693 for (field = op->key_values; field != NULL; field = field->next)
2694 {
2587 if (field->key != canonical_key) { 2695 if (field->key != canonical_key)
2696 {
2588 last = field; 2697 last = field;
2589 continue; 2698 continue;
2590 } 2699 }
2591 2700
2592 if (value) 2701 if (value)
2593 field->value = value; 2702 field->value = value;
2594 else { 2703 else
2704 {
2595 /* Basically, if the archetype has this key set, 2705 /* Basically, if the archetype has this key set,
2596 * we need to store the null value so when we save 2706 * we need to store the null value so when we save
2597 * it, we save the empty value so that when we load, 2707 * it, we save the empty value so that when we load,
2598 * we get this value back again. 2708 * we get this value back again.
2599 */ 2709 */
2600 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2710 if (get_ob_key_link (&op->arch->clone, canonical_key))
2601 field->value = 0; 2711 field->value = 0;
2712 else
2713 {
2714 if (last)
2715 last->next = field->next;
2602 else 2716 else
2603 {
2604 if (last) last->next = field->next;
2605 else op->key_values = field->next; 2717 op->key_values = field->next;
2606 2718
2607 delete field; 2719 delete field;
2608 } 2720 }
2609 } 2721 }
2610 return TRUE; 2722 return TRUE;
2611 } 2723 }
2612 /* IF we get here, key doesn't exist */ 2724 /* IF we get here, key doesn't exist */
2613 2725
2614 /* No field, we'll have to add it. */ 2726 /* No field, we'll have to add it. */
2727
2728 if (!add_key)
2615 2729 {
2616 if (!add_key) {
2617 return FALSE; 2730 return FALSE;
2618 } 2731 }
2619 /* There isn't any good reason to store a null 2732 /* There isn't any good reason to store a null
2620 * value in the key/value list. If the archetype has 2733 * value in the key/value list. If the archetype has
2621 * this key, then we should also have it, so shouldn't 2734 * this key, then we should also have it, so shouldn't
2622 * be here. If user wants to store empty strings, 2735 * be here. If user wants to store empty strings,
2623 * should pass in "" 2736 * should pass in ""
2624 */ 2737 */
2625 if (value == NULL) return TRUE; 2738 if (value == NULL)
2626
2627 field = new key_value;
2628
2629 field->key = canonical_key;
2630 field->value = value;
2631 /* Usual prepend-addition. */
2632 field->next = op->key_values;
2633 op->key_values = field;
2634
2635 return TRUE; 2739 return TRUE;
2740
2741 field = new key_value;
2742
2743 field->key = canonical_key;
2744 field->value = value;
2745 /* Usual prepend-addition. */
2746 field->next = op->key_values;
2747 op->key_values = field;
2748
2749 return TRUE;
2636} 2750}
2637 2751
2638/* 2752/*
2639 * Updates the key in op to value. 2753 * Updates the key in op to value.
2640 * 2754 *
… …
2642 * and not add new ones. 2756 * and not add new ones.
2643 * In general, should be little reason FALSE is ever passed in for add_key 2757 * In general, should be little reason FALSE is ever passed in for add_key
2644 * 2758 *
2645 * Returns TRUE on success. 2759 * Returns TRUE on success.
2646 */ 2760 */
2761int
2647int set_ob_key_value(object * op, const char *key, const char * value, int add_key) 2762set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2648{ 2763{
2649 shstr key_ (key); 2764 shstr key_ (key);
2765
2650 return set_ob_key_value_s (op, key_, value, add_key); 2766 return set_ob_key_value_s (op, key_, value, add_key);
2651} 2767}
2768
2769object::depth_iterator::depth_iterator (object *container)
2770: iterator_base (container)
2771{
2772 while (item->inv)
2773 item = item->inv;
2774}
2775
2776void
2777object::depth_iterator::next ()
2778{
2779 if (item->below)
2780 {
2781 item = item->below;
2782
2783 while (item->inv)
2784 item = item->inv;
2785 }
2786 else
2787 item = item->env;
2788}
2789
2790// return a suitable string describing an objetc in enough detail to find it
2791const char *
2792object::debug_desc (char *info) const
2793{
2794 char info2[256 * 3];
2795 char *p = info;
2796
2797 p += snprintf (p, 256, "%d=\"%s%s%s\"",
2798 count,
2799 &name,
2800 title ? " " : "",
2801 title ? (const char *)title : "");
2802
2803 if (env)
2804 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2805
2806 if (map)
2807 p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y);
2808
2809 return info;
2810}
2811
2812const char *
2813object::debug_desc () const
2814{
2815 static char info[256 * 3];
2816 return debug_desc (info);
2817}
2818

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines