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.54 by root, Fri Nov 17 19:40:53 2006 UTC vs.
Revision 1.174 by root, Wed Aug 8 04:52:59 2007 UTC

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

Diff Legend

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