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.31 by root, Mon Sep 11 23:33:27 2006 UTC vs.
Revision 1.104 by root, Tue Jan 2 21:13:21 2007 UTC

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

Diff Legend

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