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.180 by root, Wed Aug 15 04:59:46 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 if (object *pl = ms.player ())
1095 {
1096 if (pl->container == this)
1097 /* If a container that the player is currently using somehow gets
1098 * removed (most likely destroyed), update the player view
1099 * appropriately.
1100 */
1101 pl->close_container ();
1102
1103 pl->contr->ns->floorbox_update ();
1104 }
1105
1106 for (tmp = ms.bot; tmp; tmp = tmp->above)
1133 { 1107 {
1134 /* No point updating the players look faces if he is the object 1108 /* No point updating the players look faces if he is the object
1135 * being removed. 1109 * being removed.
1136 */ 1110 */
1137 1111
1138 if (tmp->type == PLAYER && tmp != op) 1112 /* See if object moving off should effect something */
1113 if (check_walk_off
1114 && ((move_type & tmp->move_off)
1115 && (move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1139 { 1116 {
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); 1117 move_apply (tmp, this, 0);
1159 1118
1160 if (op->destroyed ()) 1119 if (destroyed ())
1161 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); 1120 LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ());
1162 } 1121 }
1163 1122
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; 1123 last = tmp;
1170 } 1124 }
1171 1125
1172 /* last == NULL of there are no objects on this space */ 1126 /* last == NULL if there are no objects on this space */
1127 //TODO: this makes little sense, why only update the topmost object?
1173 if (last == NULL) 1128 if (!last)
1174 { 1129 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 1130 else
1184 update_object (last, UP_OBJ_REMOVE); 1131 update_object (last, UP_OBJ_REMOVE);
1185 1132
1186 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) 1133 if (flag [FLAG_BLOCKSVIEW] || glow_radius)
1187 update_all_los (op->map, op->x, op->y); 1134 update_all_los (map, x, y);
1188 } 1135 }
1189} 1136}
1190 1137
1191/* 1138/*
1192 * merge_ob(op,top): 1139 * merge_ob(op,top):
… …
1200merge_ob (object *op, object *top) 1147merge_ob (object *op, object *top)
1201{ 1148{
1202 if (!op->nrof) 1149 if (!op->nrof)
1203 return 0; 1150 return 0;
1204 1151
1205 if (top == NULL) 1152 if (top)
1206 for (top = op; top != NULL && top->above != NULL; top = top->above); 1153 for (top = op; top && top->above; top = top->above)
1154 ;
1207 1155
1208 for (; top != NULL; top = top->below) 1156 for (; top; top = top->below)
1209 { 1157 {
1210 if (top == op) 1158 if (top == op)
1211 continue; 1159 continue;
1212 if (CAN_MERGE (op, top)) 1160
1161 if (object::can_merge (op, top))
1213 { 1162 {
1214 top->nrof += op->nrof; 1163 top->nrof += op->nrof;
1215 1164
1216/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ 1165/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1217 op->weight = 0; /* Don't want any adjustements now */ 1166 op->weight = 0; /* Don't want any adjustements now */
1218 remove_ob (op); 1167 op->destroy ();
1219 free_object (op);
1220 return top; 1168 return top;
1221 } 1169 }
1222 } 1170 }
1223 1171
1224 return 0; 1172 return 0;
1225} 1173}
1226 1174
1175void
1176object::expand_tail ()
1177{
1178 if (more)
1179 return;
1180
1181 object *prev = this;
1182
1183 for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more)
1184 {
1185 object *op = arch_to_object (at);
1186
1187 op->name = name;
1188 op->name_pl = name_pl;
1189 op->title = title;
1190
1191 op->head = this;
1192 prev->more = op;
1193
1194 prev = op;
1195 }
1196}
1197
1227/* 1198/*
1228 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1199 * same as insert_ob_in_map except it handles separate coordinates and does a clean
1229 * job preparing multi-part monsters 1200 * job preparing multi-part monsters.
1230 */ 1201 */
1231object * 1202object *
1232insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) 1203insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y)
1233{ 1204{
1234 object *tmp;
1235
1236 if (op->head)
1237 op = op->head;
1238
1239 for (tmp = op; tmp; tmp = tmp->more) 1205 for (object *tmp = op->head_ (); tmp; tmp = tmp->more)
1240 { 1206 {
1241 tmp->x = x + tmp->arch->clone.x; 1207 tmp->x = x + tmp->arch->x;
1242 tmp->y = y + tmp->arch->clone.y; 1208 tmp->y = y + tmp->arch->y;
1243 } 1209 }
1244 1210
1245 return insert_ob_in_map (op, m, originator, flag); 1211 return insert_ob_in_map (op, m, originator, flag);
1246} 1212}
1247 1213
… …
1263 * Return value: 1229 * Return value:
1264 * new object if 'op' was merged with other object 1230 * new object if 'op' was merged with other object
1265 * NULL if 'op' was destroyed 1231 * NULL if 'op' was destroyed
1266 * just 'op' otherwise 1232 * just 'op' otherwise
1267 */ 1233 */
1268
1269object * 1234object *
1270insert_ob_in_map (object *op, maptile *m, object *originator, int flag) 1235insert_ob_in_map (object *op, maptile *m, object *originator, int flag)
1271{ 1236{
1237 assert (!op->flag [FLAG_FREED]);
1238
1272 object *tmp, *top, *floor = NULL; 1239 object *top, *floor = NULL;
1273 sint16 x, y;
1274 1240
1275 if (QUERY_FLAG (op, FLAG_FREED)) 1241 op->remove ();
1276 {
1277 LOG (llevError, "Trying to insert freed object!\n");
1278 return NULL;
1279 }
1280
1281 if (m == NULL)
1282 {
1283 char *dump = dump_object (op);
1284 LOG (llevError, "Trying to insert in null-map!\n%s\n", dump);
1285 free (dump);
1286 return op;
1287 }
1288 1242
1289 if (out_of_map (m, op->x, op->y)) 1243 if (out_of_map (m, op->x, op->y))
1290 { 1244 {
1291 char *dump = dump_object (op);
1292 LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); 1245 LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ());
1293#ifdef MANY_CORES 1246#ifdef MANY_CORES
1294 /* Better to catch this here, as otherwise the next use of this object 1247 /* 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 1248 * is likely to cause a crash. Better to find out where it is getting
1296 * improperly inserted. 1249 * improperly inserted.
1297 */ 1250 */
1298 abort (); 1251 abort ();
1299#endif 1252#endif
1300 free (dump);
1301 return op; 1253 return op;
1302 } 1254 }
1303 1255
1304 if (!QUERY_FLAG (op, FLAG_REMOVED)) 1256 if (object *more = op->more)
1305 { 1257 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; 1258 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 1259
1342 CLEAR_FLAG (op, FLAG_REMOVED); 1260 CLEAR_FLAG (op, FLAG_REMOVED);
1343 1261
1344 /* Ideally, the caller figures this out. However, it complicates a lot 1262 /* 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 1263 * of areas of callers (eg, anything that uses find_free_spot would now
1346 * need extra work 1264 * need extra work
1347 */ 1265 */
1348 op->map = get_map_from_coord (m, &op->x, &op->y); 1266 if (!xy_normalise (m, op->x, op->y))
1349 x = op->x; 1267 return 0;
1350 y = op->y; 1268
1269 op->map = m;
1270 mapspace &ms = op->ms ();
1351 1271
1352 /* this has to be done after we translate the coordinates. 1272 /* this has to be done after we translate the coordinates.
1353 */ 1273 */
1354 if (op->nrof && !(flag & INS_NO_MERGE)) 1274 if (op->nrof && !(flag & INS_NO_MERGE))
1355 for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) 1275 for (object *tmp = ms.bot; tmp; tmp = tmp->above)
1356 if (CAN_MERGE (op, tmp)) 1276 if (object::can_merge (op, tmp))
1357 { 1277 {
1358 op->nrof += tmp->nrof; 1278 op->nrof += tmp->nrof;
1359 remove_ob (tmp); 1279 tmp->destroy ();
1360 free_object (tmp);
1361 } 1280 }
1362 1281
1363 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ 1282 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1364 CLEAR_FLAG (op, FLAG_INV_LOCKED); 1283 CLEAR_FLAG (op, FLAG_INV_LOCKED);
1365 1284
… …
1378 op->below = originator->below; 1297 op->below = originator->below;
1379 1298
1380 if (op->below) 1299 if (op->below)
1381 op->below->above = op; 1300 op->below->above = op;
1382 else 1301 else
1383 SET_MAP_OB (op->map, op->x, op->y, op); 1302 ms.bot = op;
1384 1303
1385 /* since *below* originator, no need to update top */ 1304 /* since *below* originator, no need to update top */
1386 originator->below = op; 1305 originator->below = op;
1387 } 1306 }
1388 else 1307 else
1389 { 1308 {
1309 top = ms.bot;
1310
1390 /* If there are other objects, then */ 1311 /* If there are other objects, then */
1391 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) 1312 if ((!(flag & INS_MAP_LOAD)) && top)
1392 { 1313 {
1393 object *last = NULL; 1314 object *last = 0;
1394 1315
1395 /* 1316 /*
1396 * If there are multiple objects on this space, we do some trickier handling. 1317 * If there are multiple objects on this space, we do some trickier handling.
1397 * We've already dealt with merging if appropriate. 1318 * We've already dealt with merging if appropriate.
1398 * Generally, we want to put the new object on top. But if 1319 * 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 1323 * 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 1324 * 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 1325 * when lots of spells are cast in one area. Currently, it is presumed
1405 * that flying non pickable objects are spell objects. 1326 * that flying non pickable objects are spell objects.
1406 */ 1327 */
1407 1328 for (top = ms.bot; top; top = top->above)
1408 while (top != NULL)
1409 { 1329 {
1410 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) 1330 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1411 floor = top; 1331 floor = top;
1412 1332
1413 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) 1333 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; 1336 top = top->below;
1417 break; 1337 break;
1418 } 1338 }
1419 1339
1420 last = top; 1340 last = top;
1421 top = top->above;
1422 } 1341 }
1423 1342
1424 /* Don't want top to be NULL, so set it to the last valid object */ 1343 /* Don't want top to be NULL, so set it to the last valid object */
1425 top = last; 1344 top = last;
1426 1345
… …
1428 * looks like instead of lots of conditions here. 1347 * looks like instead of lots of conditions here.
1429 * makes things faster, and effectively the same result. 1348 * makes things faster, and effectively the same result.
1430 */ 1349 */
1431 1350
1432 /* Have object 'fall below' other objects that block view. 1351 /* Have object 'fall below' other objects that block view.
1433 * Unless those objects are exits, type 66 1352 * Unless those objects are exits.
1434 * If INS_ON_TOP is used, don't do this processing 1353 * If INS_ON_TOP is used, don't do this processing
1435 * Need to find the object that in fact blocks view, otherwise 1354 * Need to find the object that in fact blocks view, otherwise
1436 * stacking is a bit odd. 1355 * stacking is a bit odd.
1437 */ 1356 */
1438 if (!(flag & INS_ON_TOP) && 1357 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)) 1358 && ms.flags () & P_BLOCKSVIEW
1359 && (op->face && !faces [op->face].visibility))
1440 { 1360 {
1441 for (last = top; last != floor; last = last->below) 1361 for (last = top; last != floor; last = last->below)
1442 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) 1362 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1443 break; 1363 break;
1364
1444 /* Check to see if we found the object that blocks view, 1365 /* Check to see if we found the object that blocks view,
1445 * and make sure we have a below pointer for it so that 1366 * and make sure we have a below pointer for it so that
1446 * we can get inserted below this one, which requires we 1367 * we can get inserted below this one, which requires we
1447 * set top to the object below us. 1368 * set top to the object below us.
1448 */ 1369 */
1449 if (last && last->below && last != floor) 1370 if (last && last->below && last != floor)
1450 top = last->below; 1371 top = last->below;
1451 } 1372 }
1452 } /* If objects on this space */ 1373 } /* If objects on this space */
1453
1454 if (flag & INS_MAP_LOAD) 1374 if (flag & INS_MAP_LOAD)
1455 top = GET_MAP_TOP (op->map, op->x, op->y); 1375 top = ms.top;
1456 1376
1457 if (flag & INS_ABOVE_FLOOR_ONLY) 1377 if (flag & INS_ABOVE_FLOOR_ONLY)
1458 top = floor; 1378 top = floor;
1459 1379
1460 /* Top is the object that our object (op) is going to get inserted above. 1380 /* Top is the object that our object (op) is going to get inserted above.
1461 */ 1381 */
1462 1382
1463 /* First object on this space */ 1383 /* First object on this space */
1464 if (!top) 1384 if (!top)
1465 { 1385 {
1466 op->above = GET_MAP_OB (op->map, op->x, op->y); 1386 op->above = ms.bot;
1467 1387
1468 if (op->above) 1388 if (op->above)
1469 op->above->below = op; 1389 op->above->below = op;
1470 1390
1471 op->below = NULL; 1391 op->below = 0;
1472 SET_MAP_OB (op->map, op->x, op->y, op); 1392 ms.bot = op;
1473 } 1393 }
1474 else 1394 else
1475 { /* get inserted into the stack above top */ 1395 { /* get inserted into the stack above top */
1476 op->above = top->above; 1396 op->above = top->above;
1477 1397
… …
1480 1400
1481 op->below = top; 1401 op->below = top;
1482 top->above = op; 1402 top->above = op;
1483 } 1403 }
1484 1404
1485 if (op->above == NULL) 1405 if (!op->above)
1486 SET_MAP_TOP (op->map, op->x, op->y, op); 1406 ms.top = op;
1487 } /* else not INS_BELOW_ORIGINATOR */ 1407 } /* else not INS_BELOW_ORIGINATOR */
1488 1408
1489 if (op->type == PLAYER) 1409 if (op->type == PLAYER)
1410 {
1490 op->contr->do_los = 1; 1411 op->contr->do_los = 1;
1412 ++op->map->players;
1413 op->map->touch ();
1414 }
1491 1415
1492 /* If we have a floor, we know the player, if any, will be above 1416 op->map->dirty = true;
1493 * it, so save a few ticks and start from there. 1417
1494 */
1495 if (!(flag & INS_MAP_LOAD)) 1418 if (!(flag & INS_MAP_LOAD))
1496 for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1419 if (object *pl = ms.player ())
1497 if (tmp->type == PLAYER) 1420 pl->contr->ns->floorbox_update ();
1498 tmp->contr->socket.update_look = 1;
1499 1421
1500 /* If this object glows, it may affect lighting conditions that are 1422 /* If this object glows, it may affect lighting conditions that are
1501 * visible to others on this map. But update_all_los is really 1423 * 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 1424 * 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 1425 * on the map will get recalculated. The players could very well
1504 * be far away from this change and not affected in any way - 1426 * be far away from this change and not affected in any way -
1505 * this should get redone to only look for players within range, 1427 * this should get redone to only look for players within range,
1506 * or just updating the P_NEED_UPDATE for spaces within this area 1428 * or just updating the P_UPTODATE for spaces within this area
1507 * of effect may be sufficient. 1429 * of effect may be sufficient.
1508 */ 1430 */
1509 if (MAP_DARKNESS (op->map) && (op->glow_radius != 0)) 1431 if (op->map->darkness && (op->glow_radius != 0))
1510 update_all_los (op->map, op->x, op->y); 1432 update_all_los (op->map, op->x, op->y);
1511 1433
1512 /* updates flags (blocked, alive, no magic, etc) for this map space */ 1434 /* updates flags (blocked, alive, no magic, etc) for this map space */
1513 update_object (op, UP_OBJ_INSERT); 1435 update_object (op, UP_OBJ_INSERT);
1514 1436
1437 INVOKE_OBJECT (INSERT, op);
1438
1515 /* Don't know if moving this to the end will break anything. However, 1439 /* 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. 1440 * we want to have floorbox_update called before calling this.
1517 * 1441 *
1518 * check_move_on() must be after this because code called from 1442 * check_move_on() must be after this because code called from
1519 * check_move_on() depends on correct map flags (so functions like 1443 * check_move_on() depends on correct map flags (so functions like
1520 * blocked() and wall() work properly), and these flags are updated by 1444 * blocked() and wall() work properly), and these flags are updated by
1521 * update_object(). 1445 * update_object().
1522 */ 1446 */
1523 1447
1524 /* if this is not the head or flag has been passed, don't check walk on status */ 1448 /* 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) 1449 if (!(flag & INS_NO_WALK_ON) && op->head_ () == op)
1526 { 1450 {
1527 if (check_move_on (op, originator)) 1451 if (check_move_on (op, originator))
1528 return NULL; 1452 return 0;
1529 1453
1530 /* If we are a multi part object, lets work our way through the check 1454 /* If we are a multi part object, lets work our way through the check
1531 * walk on's. 1455 * walk on's.
1532 */ 1456 */
1533 for (tmp = op->more; tmp != NULL; tmp = tmp->more) 1457 for (object *tmp = op->more; tmp; tmp = tmp->more)
1534 if (check_move_on (tmp, originator)) 1458 if (check_move_on (tmp, originator))
1535 return NULL; 1459 return 0;
1536 } 1460 }
1537 1461
1538 return op; 1462 return op;
1539} 1463}
1540 1464
1541/* this function inserts an object in the map, but if it 1465/* 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. 1466 * 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. 1467 * op is the object to insert it under: supplies x and the map.
1544 */ 1468 */
1545void 1469void
1546replace_insert_ob_in_map (const char *arch_string, object *op) 1470replace_insert_ob_in_map (const char *arch_string, object *op)
1547{ 1471{
1548 object * 1472 object *tmp, *tmp1;
1549 tmp;
1550 object *
1551 tmp1;
1552 1473
1553 /* first search for itself and remove any old instances */ 1474 /* first search for itself and remove any old instances */
1554 1475
1555 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) 1476 for (tmp = op->ms ().bot; tmp; tmp = tmp->above)
1556 {
1557 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ 1477 if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */
1558 { 1478 tmp->destroy ();
1559 remove_ob (tmp);
1560 free_object (tmp);
1561 }
1562 }
1563 1479
1564 tmp1 = arch_to_object (archetype::find (arch_string)); 1480 tmp1 = arch_to_object (archetype::find (arch_string));
1565 1481
1566 tmp1->x = op->x; 1482 tmp1->x = op->x;
1567 tmp1->y = op->y; 1483 tmp1->y = op->y;
1568 insert_ob_in_map (tmp1, op->map, op, 0); 1484 insert_ob_in_map (tmp1, op->map, op, 0);
1485}
1486
1487object *
1488object::insert_at (object *where, object *originator, int flags)
1489{
1490 return where->map->insert (this, where->x, where->y, originator, flags);
1569} 1491}
1570 1492
1571/* 1493/*
1572 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1494 * 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 1495 * is returned contains nr objects, and the remaining parts contains
1574 * the rest (or is removed and freed if that number is 0). 1496 * the rest (or is removed and freed if that number is 0).
1575 * On failure, NULL is returned, and the reason put into the 1497 * On failure, NULL is returned, and the reason put into the
1576 * global static errmsg array. 1498 * global static errmsg array.
1577 */ 1499 */
1578
1579object * 1500object *
1580get_split_ob (object *orig_ob, uint32 nr) 1501get_split_ob (object *orig_ob, uint32 nr)
1581{ 1502{
1582 object * 1503 object *newob;
1583 newob;
1584 int
1585 is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); 1504 int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1586 1505
1587 if (orig_ob->nrof < nr) 1506 if (orig_ob->nrof < nr)
1588 { 1507 {
1589 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); 1508 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1590 return NULL; 1509 return NULL;
1591 } 1510 }
1592 1511
1593 newob = object_create_clone (orig_ob); 1512 newob = object_create_clone (orig_ob);
1594 1513
1595 if ((orig_ob->nrof -= nr) < 1) 1514 if ((orig_ob->nrof -= nr) < 1)
1596 { 1515 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) 1516 else if (!is_removed)
1602 { 1517 {
1603 if (orig_ob->env != NULL) 1518 if (orig_ob->env != NULL)
1604 sub_weight (orig_ob->env, orig_ob->weight * nr); 1519 sub_weight (orig_ob->env, orig_ob->weight * nr);
1605 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) 1520 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 1535 * the amount of an object. If the amount reaches 0, the object
1621 * is subsequently removed and freed. 1536 * is subsequently removed and freed.
1622 * 1537 *
1623 * Return value: 'op' if something is left, NULL if the amount reached 0 1538 * Return value: 'op' if something is left, NULL if the amount reached 0
1624 */ 1539 */
1625
1626object * 1540object *
1627decrease_ob_nr (object *op, uint32 i) 1541decrease_ob_nr (object *op, uint32 i)
1628{ 1542{
1629 object *tmp; 1543 object *tmp;
1630 player *pl;
1631 1544
1632 if (i == 0) /* objects with op->nrof require this check */ 1545 if (i == 0) /* objects with op->nrof require this check */
1633 return op; 1546 return op;
1634 1547
1635 if (i > op->nrof) 1548 if (i > op->nrof)
1636 i = op->nrof; 1549 i = op->nrof;
1637 1550
1638 if (QUERY_FLAG (op, FLAG_REMOVED)) 1551 if (QUERY_FLAG (op, FLAG_REMOVED))
1639 op->nrof -= i; 1552 op->nrof -= i;
1640 else if (op->env != NULL) 1553 else if (op->env)
1641 { 1554 {
1642 /* is this object in the players inventory, or sub container 1555 /* is this object in the players inventory, or sub container
1643 * therein? 1556 * therein?
1644 */ 1557 */
1645 tmp = is_player_inv (op->env); 1558 tmp = op->in_player ();
1646 /* nope. Is this a container the player has opened? 1559 /* nope. Is this a container the player has opened?
1647 * If so, set tmp to that player. 1560 * If so, set tmp to that player.
1648 * IMO, searching through all the players will mostly 1561 * IMO, searching through all the players will mostly
1649 * likely be quicker than following op->env to the map, 1562 * likely be quicker than following op->env to the map,
1650 * and then searching the map for a player. 1563 * and then searching the map for a player.
1651 */ 1564 */
1652 if (!tmp) 1565 if (!tmp)
1653 { 1566 for_all_players (pl)
1654 for (pl = first_player; pl; pl = pl->next)
1655 if (pl->ob->container == op->env) 1567 if (pl->ob->container == op->env)
1568 {
1569 tmp = pl->ob;
1656 break; 1570 break;
1657 if (pl)
1658 tmp = pl->ob;
1659 else
1660 tmp = NULL;
1661 } 1571 }
1662 1572
1663 if (i < op->nrof) 1573 if (i < op->nrof)
1664 { 1574 {
1665 sub_weight (op->env, op->weight * i); 1575 sub_weight (op->env, op->weight * i);
1666 op->nrof -= i; 1576 op->nrof -= i;
1667 if (tmp) 1577 if (tmp)
1668 {
1669 esrv_send_item (tmp, op); 1578 esrv_send_item (tmp, op);
1670 }
1671 } 1579 }
1672 else 1580 else
1673 { 1581 {
1674 remove_ob (op); 1582 op->remove ();
1675 op->nrof = 0; 1583 op->nrof = 0;
1676 if (tmp) 1584 if (tmp)
1677 {
1678 esrv_del_item (tmp->contr, op->count); 1585 esrv_del_item (tmp->contr, op->count);
1679 }
1680 } 1586 }
1681 } 1587 }
1682 else 1588 else
1683 { 1589 {
1684 object *above = op->above; 1590 object *above = op->above;
1685 1591
1686 if (i < op->nrof) 1592 if (i < op->nrof)
1687 op->nrof -= i; 1593 op->nrof -= i;
1688 else 1594 else
1689 { 1595 {
1690 remove_ob (op); 1596 op->remove ();
1691 op->nrof = 0; 1597 op->nrof = 0;
1692 } 1598 }
1693 1599
1694 /* Since we just removed op, op->above is null */ 1600 /* Since we just removed op, op->above is null */
1695 for (tmp = above; tmp != NULL; tmp = tmp->above) 1601 for (tmp = above; tmp; tmp = tmp->above)
1696 if (tmp->type == PLAYER) 1602 if (tmp->type == PLAYER)
1697 { 1603 {
1698 if (op->nrof) 1604 if (op->nrof)
1699 esrv_send_item (tmp, op); 1605 esrv_send_item (tmp, op);
1700 else 1606 else
… …
1704 1610
1705 if (op->nrof) 1611 if (op->nrof)
1706 return op; 1612 return op;
1707 else 1613 else
1708 { 1614 {
1709 free_object (op); 1615 op->destroy ();
1710 return NULL; 1616 return 0;
1711 } 1617 }
1712} 1618}
1713 1619
1714/* 1620/*
1715 * add_weight(object, weight) adds the specified weight to an object, 1621 * add_weight(object, weight) adds the specified weight to an object,
1716 * and also updates how much the environment(s) is/are carrying. 1622 * and also updates how much the environment(s) is/are carrying.
1717 */ 1623 */
1718
1719void 1624void
1720add_weight (object *op, signed long weight) 1625add_weight (object *op, signed long weight)
1721{ 1626{
1722 while (op != NULL) 1627 while (op != NULL)
1723 { 1628 {
… …
1727 op->carrying += weight; 1632 op->carrying += weight;
1728 op = op->env; 1633 op = op->env;
1729 } 1634 }
1730} 1635}
1731 1636
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 * 1637object *
1747insert_ob_in_ob (object *op, object *where) 1638insert_ob_in_ob (object *op, object *where)
1748{ 1639{
1749 object * 1640 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 { 1641 {
1763 char *dump = dump_object (op); 1642 char *dump = dump_object (op);
1764 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); 1643 LOG (llevError, "Trying to put object in NULL.\n%s\n", dump);
1765 free (dump); 1644 free (dump);
1766 return op; 1645 return op;
1767 } 1646 }
1768 1647
1769 if (where->head) 1648 if (where->head_ () != where)
1770 { 1649 {
1771 LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n"); 1650 LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n");
1772 where = where->head; 1651 where = where->head;
1773 } 1652 }
1653
1654 return where->insert (op);
1655}
1656
1657/*
1658 * env->insert (op)
1659 * This function inserts the object op in the linked list
1660 * inside the object environment.
1661 *
1662 * The function returns now pointer to inserted item, and return value can
1663 * be != op, if items are merged. -Tero
1664 */
1665object *
1666object::insert (object *op)
1667{
1668 object *tmp, *otmp;
1669
1670 if (!QUERY_FLAG (op, FLAG_REMOVED))
1671 op->remove ();
1774 1672
1775 if (op->more) 1673 if (op->more)
1776 { 1674 {
1777 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); 1675 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1778 return op; 1676 return op;
… …
1780 1678
1781 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); 1679 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1782 CLEAR_FLAG (op, FLAG_REMOVED); 1680 CLEAR_FLAG (op, FLAG_REMOVED);
1783 if (op->nrof) 1681 if (op->nrof)
1784 { 1682 {
1785 for (tmp = where->inv; tmp != NULL; tmp = tmp->below) 1683 for (tmp = inv; tmp != NULL; tmp = tmp->below)
1786 if (CAN_MERGE (tmp, op)) 1684 if (object::can_merge (tmp, op))
1787 { 1685 {
1788 /* return the original object and remove inserted object 1686 /* return the original object and remove inserted object
1789 (client needs the original object) */ 1687 (client needs the original object) */
1790 tmp->nrof += op->nrof; 1688 tmp->nrof += op->nrof;
1791 /* Weight handling gets pretty funky. Since we are adding to 1689 /* Weight handling gets pretty funky. Since we are adding to
1792 * tmp->nrof, we need to increase the weight. 1690 * tmp->nrof, we need to increase the weight.
1793 */ 1691 */
1794 add_weight (where, op->weight * op->nrof); 1692 add_weight (this, op->weight * op->nrof);
1795 SET_FLAG (op, FLAG_REMOVED); 1693 SET_FLAG (op, FLAG_REMOVED);
1796 free_object (op); /* free the inserted object */ 1694 op->destroy (); /* free the inserted object */
1797 op = tmp; 1695 op = tmp;
1798 remove_ob (op); /* and fix old object's links */ 1696 op->remove (); /* and fix old object's links */
1799 CLEAR_FLAG (op, FLAG_REMOVED); 1697 CLEAR_FLAG (op, FLAG_REMOVED);
1800 break; 1698 break;
1801 } 1699 }
1802 1700
1803 /* I assume combined objects have no inventory 1701 /* I assume combined objects have no inventory
1804 * We add the weight - this object could have just been removed 1702 * We add the weight - this object could have just been removed
1805 * (if it was possible to merge). calling remove_ob will subtract 1703 * (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 1704 * the weight, so we need to add it in again, since we actually do
1807 * the linking below 1705 * the linking below
1808 */ 1706 */
1809 add_weight (where, op->weight * op->nrof); 1707 add_weight (this, op->weight * op->nrof);
1810 } 1708 }
1811 else 1709 else
1812 add_weight (where, (op->weight + op->carrying)); 1710 add_weight (this, (op->weight + op->carrying));
1813 1711
1814 otmp = is_player_inv (where); 1712 otmp = this->in_player ();
1815 if (otmp && otmp->contr != NULL) 1713 if (otmp && otmp->contr)
1816 {
1817 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) 1714 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1818 fix_player (otmp); 1715 otmp->update_stats ();
1819 }
1820 1716
1821 op->map = NULL; 1717 op->map = 0;
1822 op->env = where; 1718 op->env = this;
1823 op->above = NULL; 1719 op->above = 0;
1824 op->below = NULL; 1720 op->below = 0;
1825 op->x = 0, op->y = 0; 1721 op->x = 0, op->y = 0;
1826 1722
1827 /* reset the light list and los of the players on the map */ 1723 /* reset the light list and los of the players on the map */
1828 if ((op->glow_radius != 0) && where->map) 1724 if ((op->glow_radius != 0) && map)
1829 { 1725 {
1830#ifdef DEBUG_LIGHTS 1726#ifdef DEBUG_LIGHTS
1831 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); 1727 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1832#endif /* DEBUG_LIGHTS */ 1728#endif /* DEBUG_LIGHTS */
1833 if (MAP_DARKNESS (where->map)) 1729 if (map->darkness)
1834 update_all_los (where->map, where->x, where->y); 1730 update_all_los (map, x, y);
1835 } 1731 }
1836 1732
1837 /* Client has no idea of ordering so lets not bother ordering it here. 1733 /* Client has no idea of ordering so lets not bother ordering it here.
1838 * It sure simplifies this function... 1734 * It sure simplifies this function...
1839 */ 1735 */
1840 if (where->inv == NULL) 1736 if (!inv)
1841 where->inv = op; 1737 inv = op;
1842 else 1738 else
1843 { 1739 {
1844 op->below = where->inv; 1740 op->below = inv;
1845 op->below->above = op; 1741 op->below->above = op;
1846 where->inv = op; 1742 inv = op;
1847 } 1743 }
1744
1745 INVOKE_OBJECT (INSERT, this);
1746
1848 return op; 1747 return op;
1849} 1748}
1850 1749
1851/* 1750/*
1852 * Checks if any objects has a move_type that matches objects 1751 * Checks if any objects has a move_type that matches objects
… …
1866 * 1765 *
1867 * MSW 2001-07-08: Check all objects on space, not just those below 1766 * 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 1767 * object being inserted. insert_ob_in_map may not put new objects
1869 * on top. 1768 * on top.
1870 */ 1769 */
1871
1872int 1770int
1873check_move_on (object *op, object *originator) 1771check_move_on (object *op, object *originator)
1874{ 1772{
1875 object *tmp; 1773 object *tmp;
1876 maptile *m = op->map; 1774 maptile *m = op->map;
… …
1903 1801
1904 /* The objects have to be checked from top to bottom. 1802 /* The objects have to be checked from top to bottom.
1905 * Hence, we first go to the top: 1803 * Hence, we first go to the top:
1906 */ 1804 */
1907 1805
1908 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above) 1806 for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above)
1909 { 1807 {
1910 /* Trim the search when we find the first other spell effect 1808 /* Trim the search when we find the first other spell effect
1911 * this helps performance so that if a space has 50 spell objects, 1809 * this helps performance so that if a space has 50 spell objects,
1912 * we don't need to check all of them. 1810 * we don't need to check all of them.
1913 */ 1811 */
… …
1931 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1829 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)) 1830 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1933 { 1831 {
1934 1832
1935 float 1833 float
1936 diff = tmp->move_slow_penalty * FABS (op->speed); 1834 diff = tmp->move_slow_penalty * fabs (op->speed);
1937 1835
1938 if (op->type == PLAYER) 1836 if (op->type == PLAYER)
1939 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || 1837 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))) 1838 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1941 diff /= 4.0; 1839 diff /= 4.0;
… …
1968/* 1866/*
1969 * present_arch(arch, map, x, y) searches for any objects with 1867 * present_arch(arch, map, x, y) searches for any objects with
1970 * a matching archetype at the given map and coordinates. 1868 * a matching archetype at the given map and coordinates.
1971 * The first matching object is returned, or NULL if none. 1869 * The first matching object is returned, or NULL if none.
1972 */ 1870 */
1973
1974object * 1871object *
1975present_arch (const archetype *at, maptile *m, int x, int y) 1872present_arch (const archetype *at, maptile *m, int x, int y)
1976{ 1873{
1977 object *
1978 tmp;
1979
1980 if (m == NULL || out_of_map (m, x, y)) 1874 if (!m || out_of_map (m, x, y))
1981 { 1875 {
1982 LOG (llevError, "Present_arch called outside map.\n"); 1876 LOG (llevError, "Present_arch called outside map.\n");
1983 return NULL; 1877 return NULL;
1984 } 1878 }
1985 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1879
1880 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
1986 if (tmp->arch == at) 1881 if (tmp->arch == at)
1987 return tmp; 1882 return tmp;
1883
1988 return NULL; 1884 return NULL;
1989} 1885}
1990 1886
1991/* 1887/*
1992 * present(type, map, x, y) searches for any objects with 1888 * present(type, map, x, y) searches for any objects with
1993 * a matching type variable at the given map and coordinates. 1889 * a matching type variable at the given map and coordinates.
1994 * The first matching object is returned, or NULL if none. 1890 * The first matching object is returned, or NULL if none.
1995 */ 1891 */
1996
1997object * 1892object *
1998present (unsigned char type, maptile *m, int x, int y) 1893present (unsigned char type, maptile *m, int x, int y)
1999{ 1894{
2000 object *
2001 tmp;
2002
2003 if (out_of_map (m, x, y)) 1895 if (out_of_map (m, x, y))
2004 { 1896 {
2005 LOG (llevError, "Present called outside map.\n"); 1897 LOG (llevError, "Present called outside map.\n");
2006 return NULL; 1898 return NULL;
2007 } 1899 }
2008 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) 1900
1901 for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above)
2009 if (tmp->type == type) 1902 if (tmp->type == type)
2010 return tmp; 1903 return tmp;
1904
2011 return NULL; 1905 return NULL;
2012} 1906}
2013 1907
2014/* 1908/*
2015 * present_in_ob(type, object) searches for any objects with 1909 * present_in_ob(type, object) searches for any objects with
2016 * a matching type variable in the inventory of the given object. 1910 * a matching type variable in the inventory of the given object.
2017 * The first matching object is returned, or NULL if none. 1911 * The first matching object is returned, or NULL if none.
2018 */ 1912 */
2019
2020object * 1913object *
2021present_in_ob (unsigned char type, const object *op) 1914present_in_ob (unsigned char type, const object *op)
2022{ 1915{
2023 object *
2024 tmp;
2025
2026 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1916 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2027 if (tmp->type == type) 1917 if (tmp->type == type)
2028 return tmp; 1918 return tmp;
1919
2029 return NULL; 1920 return NULL;
2030} 1921}
2031 1922
2032/* 1923/*
2033 * present_in_ob (type, str, object) searches for any objects with 1924 * present_in_ob (type, str, object) searches for any objects with
… …
2041 * str is the string to match against. Note that we match against 1932 * 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 1933 * 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 1934 * spell code can use one object type (force), but change it's name
2044 * to be unique. 1935 * to be unique.
2045 */ 1936 */
2046
2047object * 1937object *
2048present_in_ob_by_name (int type, const char *str, const object *op) 1938present_in_ob_by_name (int type, const char *str, const object *op)
2049{ 1939{
2050 object *
2051 tmp;
2052
2053 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1940 for (object *tmp = op->inv; tmp; tmp = tmp->below)
2054 {
2055 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) 1941 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
2056 return tmp; 1942 return tmp;
2057 } 1943
2058 return NULL; 1944 return 0;
2059} 1945}
2060 1946
2061/* 1947/*
2062 * present_arch_in_ob(archetype, object) searches for any objects with 1948 * present_arch_in_ob(archetype, object) searches for any objects with
2063 * a matching archetype in the inventory of the given object. 1949 * a matching archetype in the inventory of the given object.
2064 * The first matching object is returned, or NULL if none. 1950 * The first matching object is returned, or NULL if none.
2065 */ 1951 */
2066
2067object * 1952object *
2068present_arch_in_ob (const archetype *at, const object *op) 1953present_arch_in_ob (const archetype *at, const object *op)
2069{ 1954{
2070 object *
2071 tmp;
2072
2073 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1955 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2074 if (tmp->arch == at) 1956 if (tmp->arch == at)
2075 return tmp; 1957 return tmp;
1958
2076 return NULL; 1959 return NULL;
2077} 1960}
2078 1961
2079/* 1962/*
2080 * activate recursively a flag on an object inventory 1963 * activate recursively a flag on an object inventory
2081 */ 1964 */
2082void 1965void
2083flag_inv (object *op, int flag) 1966flag_inv (object *op, int flag)
2084{ 1967{
2085 object *
2086 tmp;
2087
2088 if (op->inv) 1968 if (op->inv)
2089 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1969 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2090 { 1970 {
2091 SET_FLAG (tmp, flag); 1971 SET_FLAG (tmp, flag);
2092 flag_inv (tmp, flag); 1972 flag_inv (tmp, flag);
2093 } 1973 }
2094} /* 1974}
1975
1976/*
2095 * desactivate recursively a flag on an object inventory 1977 * deactivate recursively a flag on an object inventory
2096 */ 1978 */
2097void 1979void
2098unflag_inv (object *op, int flag) 1980unflag_inv (object *op, int flag)
2099{ 1981{
2100 object *
2101 tmp;
2102
2103 if (op->inv) 1982 if (op->inv)
2104 for (tmp = op->inv; tmp != NULL; tmp = tmp->below) 1983 for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below)
2105 { 1984 {
2106 CLEAR_FLAG (tmp, flag); 1985 CLEAR_FLAG (tmp, flag);
2107 unflag_inv (tmp, flag); 1986 unflag_inv (tmp, flag);
2108 } 1987 }
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} 1988}
2124 1989
2125/* 1990/*
2126 * find_free_spot(object, map, x, y, start, stop) will search for 1991 * 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 1992 * 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 2006 * 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 2007 * 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 2008 * the archetype because that isn't correct if the monster has been
2144 * customized, changed states, etc. 2009 * customized, changed states, etc.
2145 */ 2010 */
2146
2147int 2011int
2148find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) 2012find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop)
2149{ 2013{
2150 int
2151 i,
2152 index = 0, flag; 2014 int index = 0, flag;
2153 static int
2154 altern[SIZEOFFREE]; 2015 int altern[SIZEOFFREE];
2155 2016
2156 for (i = start; i < stop; i++) 2017 for (int i = start; i < stop; i++)
2157 { 2018 {
2158 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); 2019 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
2159 if (!flag) 2020 if (!flag)
2160 altern[index++] = i; 2021 altern [index++] = i;
2161 2022
2162 /* Basically, if we find a wall on a space, we cut down the search size. 2023 /* 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. 2024 * 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 - 2025 * 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 2026 * 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 2027 * spaces in all the other directions, this will reduce the search space
2167 * to only the spaces immediately surrounding the target area, and 2028 * to only the spaces immediately surrounding the target area, and
2168 * won't look 2 spaces south of the target space. 2029 * won't look 2 spaces south of the target space.
2169 */ 2030 */
2170 else if ((flag & AB_NO_PASS) && maxfree[i] < stop) 2031 else if ((flag & P_NO_PASS) && maxfree[i] < stop)
2171 stop = maxfree[i]; 2032 stop = maxfree[i];
2172 } 2033 }
2034
2173 if (!index) 2035 if (!index)
2174 return -1; 2036 return -1;
2037
2175 return altern[RANDOM () % index]; 2038 return altern [rndm (index)];
2176} 2039}
2177 2040
2178/* 2041/*
2179 * find_first_free_spot(archetype, maptile, x, y) works like 2042 * find_first_free_spot(archetype, maptile, x, y) works like
2180 * find_free_spot(), but it will search max number of squares. 2043 * find_free_spot(), but it will search max number of squares.
2181 * But it will return the first available spot, not a random choice. 2044 * 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. 2045 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2183 */ 2046 */
2184
2185int 2047int
2186find_first_free_spot (const object *ob, maptile *m, int x, int y) 2048find_first_free_spot (const object *ob, maptile *m, int x, int y)
2187{ 2049{
2188 int
2189 i;
2190
2191 for (i = 0; i < SIZEOFFREE; i++) 2050 for (int i = 0; i < SIZEOFFREE; i++)
2192 {
2193 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) 2051 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2194 return i; 2052 return i;
2195 } 2053
2196 return -1; 2054 return -1;
2197} 2055}
2198 2056
2199/* 2057/*
2200 * The function permute(arr, begin, end) randomly reorders the array 2058 * The function permute(arr, begin, end) randomly reorders the array
2201 * arr[begin..end-1]. 2059 * arr[begin..end-1].
2060 * now uses a fisher-yates shuffle, old permute was broken
2202 */ 2061 */
2203static void 2062static void
2204permute (int *arr, int begin, int end) 2063permute (int *arr, int begin, int end)
2205{ 2064{
2206 int 2065 arr += begin;
2207 i,
2208 j,
2209 tmp,
2210 len;
2211
2212 len = end - begin; 2066 end -= begin;
2213 for (i = begin; i < end; i++)
2214 {
2215 j = begin + RANDOM () % len;
2216 2067
2217 tmp = arr[i]; 2068 while (--end)
2218 arr[i] = arr[j]; 2069 swap (arr [end], arr [rndm (end + 1)]);
2219 arr[j] = tmp;
2220 }
2221} 2070}
2222 2071
2223/* new function to make monster searching more efficient, and effective! 2072/* new function to make monster searching more efficient, and effective!
2224 * This basically returns a randomized array (in the passed pointer) of 2073 * 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 2074 * 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. 2077 * the 3x3 area will be searched, just not in a predictable order.
2229 */ 2078 */
2230void 2079void
2231get_search_arr (int *search_arr) 2080get_search_arr (int *search_arr)
2232{ 2081{
2233 int 2082 int i;
2234 i;
2235 2083
2236 for (i = 0; i < SIZEOFFREE; i++) 2084 for (i = 0; i < SIZEOFFREE; i++)
2237 {
2238 search_arr[i] = i; 2085 search_arr[i] = i;
2239 }
2240 2086
2241 permute (search_arr, 1, SIZEOFFREE1 + 1); 2087 permute (search_arr, 1, SIZEOFFREE1 + 1);
2242 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); 2088 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2243 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); 2089 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2244} 2090}
… …
2253 * Perhaps incorrectly, but I'm making the assumption that exclude 2099 * 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 2100 * 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 2101 * because we have to know what movement the thing looking to move
2256 * there is capable of. 2102 * there is capable of.
2257 */ 2103 */
2258
2259int 2104int
2260find_dir (maptile *m, int x, int y, object *exclude) 2105find_dir (maptile *m, int x, int y, object *exclude)
2261{ 2106{
2262 int
2263 i,
2264 max = SIZEOFFREE, mflags; 2107 int i, max = SIZEOFFREE, mflags;
2265 2108
2266 sint16 nx, ny; 2109 sint16 nx, ny;
2267 object * 2110 object *tmp;
2268 tmp;
2269 maptile * 2111 maptile *mp;
2270 mp;
2271 2112
2272 MoveType blocked, move_type; 2113 MoveType blocked, move_type;
2273 2114
2274 if (exclude && exclude->head) 2115 if (exclude && exclude->head_ () != exclude)
2275 { 2116 {
2276 exclude = exclude->head; 2117 exclude = exclude->head;
2277 move_type = exclude->move_type; 2118 move_type = exclude->move_type;
2278 } 2119 }
2279 else 2120 else
… …
2287 mp = m; 2128 mp = m;
2288 nx = x + freearr_x[i]; 2129 nx = x + freearr_x[i];
2289 ny = y + freearr_y[i]; 2130 ny = y + freearr_y[i];
2290 2131
2291 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); 2132 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
2133
2292 if (mflags & P_OUT_OF_MAP) 2134 if (mflags & P_OUT_OF_MAP)
2293 {
2294 max = maxfree[i]; 2135 max = maxfree[i];
2295 }
2296 else 2136 else
2297 { 2137 {
2298 blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); 2138 mapspace &ms = mp->at (nx, ny);
2139
2140 blocked = ms.move_block;
2299 2141
2300 if ((move_type & blocked) == move_type) 2142 if ((move_type & blocked) == move_type)
2301 {
2302 max = maxfree[i]; 2143 max = maxfree[i];
2303 }
2304 else if (mflags & P_IS_ALIVE) 2144 else if (mflags & P_IS_ALIVE)
2305 { 2145 {
2306 for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above) 2146 for (tmp = ms.bot; tmp; tmp = tmp->above)
2307 { 2147 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))) 2148 && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude)))
2309 {
2310 break; 2149 break;
2311 } 2150
2312 }
2313 if (tmp) 2151 if (tmp)
2314 {
2315 return freedir[i]; 2152 return freedir[i];
2316 }
2317 } 2153 }
2318 } 2154 }
2319 } 2155 }
2156
2320 return 0; 2157 return 0;
2321} 2158}
2322 2159
2323/* 2160/*
2324 * distance(object 1, object 2) will return the square of the 2161 * distance(object 1, object 2) will return the square of the
2325 * distance between the two given objects. 2162 * distance between the two given objects.
2326 */ 2163 */
2327
2328int 2164int
2329distance (const object *ob1, const object *ob2) 2165distance (const object *ob1, const object *ob2)
2330{ 2166{
2331 int
2332 i;
2333
2334 i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); 2167 return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2335 return i;
2336} 2168}
2337 2169
2338/* 2170/*
2339 * find_dir_2(delta-x,delta-y) will return a direction in which 2171 * 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 2172 * an object which has subtracted the x and y coordinates of another
2341 * object, needs to travel toward it. 2173 * object, needs to travel toward it.
2342 */ 2174 */
2343
2344int 2175int
2345find_dir_2 (int x, int y) 2176find_dir_2 (int x, int y)
2346{ 2177{
2347 int 2178 int q;
2348 q;
2349 2179
2350 if (y) 2180 if (y)
2351 q = x * 100 / y; 2181 q = x * 100 / y;
2352 else if (x) 2182 else if (x)
2353 q = -300 * x; 2183 q = -300 * x;
… …
2378 2208
2379 return 3; 2209 return 3;
2380} 2210}
2381 2211
2382/* 2212/*
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 2213 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2400 * between two directions (which are expected to be absolute (see absdir()) 2214 * between two directions (which are expected to be absolute (see absdir())
2401 */ 2215 */
2402
2403int 2216int
2404dirdiff (int dir1, int dir2) 2217dirdiff (int dir1, int dir2)
2405{ 2218{
2406 int 2219 int d;
2407 d;
2408 2220
2409 d = abs (dir1 - dir2); 2221 d = abs (dir1 - dir2);
2410 if (d > 4) 2222 if (d > 4)
2411 d = 8 - d; 2223 d = 8 - d;
2224
2412 return d; 2225 return d;
2413} 2226}
2414 2227
2415/* peterm: 2228/* peterm:
2416 * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. 2229 * 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 2232 * 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. 2233 * 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 2234 * Moved from spell_util.c to object.c with the other related direction
2422 * functions. 2235 * functions.
2423 */ 2236 */
2424
2425int
2426 reduction_dir[SIZEOFFREE][3] = { 2237int reduction_dir[SIZEOFFREE][3] = {
2427 {0, 0, 0}, /* 0 */ 2238 {0, 0, 0}, /* 0 */
2428 {0, 0, 0}, /* 1 */ 2239 {0, 0, 0}, /* 1 */
2429 {0, 0, 0}, /* 2 */ 2240 {0, 0, 0}, /* 2 */
2430 {0, 0, 0}, /* 3 */ 2241 {0, 0, 0}, /* 3 */
2431 {0, 0, 0}, /* 4 */ 2242 {0, 0, 0}, /* 4 */
… …
2479 * find a path to that monster that we found. If not, 2290 * find a path to that monster that we found. If not,
2480 * we don't bother going toward it. Returns 1 if we 2291 * we don't bother going toward it. Returns 1 if we
2481 * can see a direct way to get it 2292 * can see a direct way to get it
2482 * Modified to be map tile aware -.MSW 2293 * Modified to be map tile aware -.MSW
2483 */ 2294 */
2484
2485
2486int 2295int
2487can_see_monsterP (maptile *m, int x, int y, int dir) 2296can_see_monsterP (maptile *m, int x, int y, int dir)
2488{ 2297{
2489 sint16 dx, dy; 2298 sint16 dx, dy;
2490 int
2491 mflags; 2299 int mflags;
2492 2300
2493 if (dir < 0) 2301 if (dir < 0)
2494 return 0; /* exit condition: invalid direction */ 2302 return 0; /* exit condition: invalid direction */
2495 2303
2496 dx = x + freearr_x[dir]; 2304 dx = x + freearr_x[dir];
… …
2509 return 0; 2317 return 0;
2510 2318
2511 /* yes, can see. */ 2319 /* yes, can see. */
2512 if (dir < 9) 2320 if (dir < 9)
2513 return 1; 2321 return 1;
2322
2514 return can_see_monsterP (m, x, y, reduction_dir[dir][0]) | 2323 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]); 2324 | can_see_monsterP (m, x, y, reduction_dir[dir][1])
2325 | can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2516} 2326}
2517
2518
2519 2327
2520/* 2328/*
2521 * can_pick(picker, item): finds out if an object is possible to be 2329 * 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 2330 * picked up by the picker. Returnes 1 if it can be
2523 * picked up, otherwise 0. 2331 * picked up, otherwise 0.
… …
2525 * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause 2333 * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause
2526 * core dumps if they do. 2334 * core dumps if they do.
2527 * 2335 *
2528 * Add a check so we can't pick up invisible objects (0.93.8) 2336 * Add a check so we can't pick up invisible objects (0.93.8)
2529 */ 2337 */
2530
2531int 2338int
2532can_pick (const object *who, const object *item) 2339can_pick (const object *who, const object *item)
2533{ 2340{
2534 return /*QUERY_FLAG(who,FLAG_WIZ)|| */ 2341 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2535 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && 2342 (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)); 2343 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2537} 2344}
2538 2345
2539
2540/* 2346/*
2541 * create clone from object to another 2347 * create clone from object to another
2542 */ 2348 */
2543object * 2349object *
2544object_create_clone (object *asrc) 2350object_create_clone (object *asrc)
2545{ 2351{
2546 object *
2547 dst = NULL, *tmp, *src, *part, *prev, *item; 2352 object *dst = 0, *tmp, *src, *prev, *item;
2548 2353
2549 if (!asrc) 2354 if (!asrc)
2550 return NULL; 2355 return 0;
2551 src = asrc; 2356
2552 if (src->head)
2553 src = src->head; 2357 src = asrc->head_ ();
2554 2358
2555 prev = NULL; 2359 prev = 0;
2556 for (part = src; part; part = part->more) 2360 for (object *part = src; part; part = part->more)
2557 { 2361 {
2558 tmp = get_object (); 2362 tmp = part->clone ();
2559 copy_object (part, tmp);
2560 tmp->x -= src->x; 2363 tmp->x -= src->x;
2561 tmp->y -= src->y; 2364 tmp->y -= src->y;
2365
2562 if (!part->head) 2366 if (!part->head)
2563 { 2367 {
2564 dst = tmp; 2368 dst = tmp;
2565 tmp->head = NULL; 2369 tmp->head = 0;
2566 } 2370 }
2567 else 2371 else
2568 {
2569 tmp->head = dst; 2372 tmp->head = dst;
2570 } 2373
2571 tmp->more = NULL; 2374 tmp->more = 0;
2375
2572 if (prev) 2376 if (prev)
2573 prev->more = tmp; 2377 prev->more = tmp;
2378
2574 prev = tmp; 2379 prev = tmp;
2575 } 2380 }
2576 2381
2577 for (item = src->inv; item; item = item->below) 2382 for (item = src->inv; item; item = item->below)
2578 insert_ob_in_ob (object_create_clone (item), dst); 2383 insert_ob_in_ob (object_create_clone (item), dst);
2579 2384
2580 return dst; 2385 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} 2386}
2621 2387
2622/* This returns the first object in who's inventory that 2388/* This returns the first object in who's inventory that
2623 * has the same type and subtype match. 2389 * has the same type and subtype match.
2624 * returns NULL if no match. 2390 * returns NULL if no match.
2625 */ 2391 */
2626object * 2392object *
2627find_obj_by_type_subtype (const object *who, int type, int subtype) 2393find_obj_by_type_subtype (const object *who, int type, int subtype)
2628{ 2394{
2629 object *tmp;
2630
2631 for (tmp = who->inv; tmp; tmp = tmp->below) 2395 for (object *tmp = who->inv; tmp; tmp = tmp->below)
2632 if (tmp->type == type && tmp->subtype == subtype) 2396 if (tmp->type == type && tmp->subtype == subtype)
2633 return tmp; 2397 return tmp;
2634 2398
2635 return NULL; 2399 return 0;
2636} 2400}
2637 2401
2638/* If ob has a field named key, return the link from the list, 2402/* If ob has a field named key, return the link from the list,
2639 * otherwise return NULL. 2403 * otherwise return NULL.
2640 * 2404 *
… …
2642 * do the desired thing. 2406 * do the desired thing.
2643 */ 2407 */
2644key_value * 2408key_value *
2645get_ob_key_link (const object *ob, const char *key) 2409get_ob_key_link (const object *ob, const char *key)
2646{ 2410{
2647 key_value *link;
2648
2649 for (link = ob->key_values; link != NULL; link = link->next) 2411 for (key_value *link = ob->key_values; link; link = link->next)
2650 if (link->key == key) 2412 if (link->key == key)
2651 return link; 2413 return link;
2652 2414
2653 return NULL; 2415 return 0;
2654} 2416}
2655 2417
2656/* 2418/*
2657 * Returns the value of op has an extra_field for key, or NULL. 2419 * Returns the value of op has an extra_field for key, or NULL.
2658 * 2420 *
… …
2683 if (link->key == canonical_key) 2445 if (link->key == canonical_key)
2684 return link->value; 2446 return link->value;
2685 2447
2686 return 0; 2448 return 0;
2687} 2449}
2688
2689 2450
2690/* 2451/*
2691 * Updates the canonical_key in op to value. 2452 * Updates the canonical_key in op to value.
2692 * 2453 *
2693 * canonical_key is a shared string (value doesn't have to be). 2454 * canonical_key is a shared string (value doesn't have to be).
… …
2698 * Returns TRUE on success. 2459 * Returns TRUE on success.
2699 */ 2460 */
2700int 2461int
2701set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) 2462set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2702{ 2463{
2703 key_value *
2704 field = NULL, *last = NULL; 2464 key_value *field = NULL, *last = NULL;
2705 2465
2706 for (field = op->key_values; field != NULL; field = field->next) 2466 for (field = op->key_values; field != NULL; field = field->next)
2707 { 2467 {
2708 if (field->key != canonical_key) 2468 if (field->key != canonical_key)
2709 { 2469 {
… …
2718 /* Basically, if the archetype has this key set, 2478 /* Basically, if the archetype has this key set,
2719 * we need to store the null value so when we save 2479 * we need to store the null value so when we save
2720 * it, we save the empty value so that when we load, 2480 * it, we save the empty value so that when we load,
2721 * we get this value back again. 2481 * we get this value back again.
2722 */ 2482 */
2723 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2483 if (get_ob_key_link (op->arch, canonical_key))
2724 field->value = 0; 2484 field->value = 0;
2725 else 2485 else
2726 { 2486 {
2727 if (last) 2487 if (last)
2728 last->next = field->next; 2488 last->next = field->next;
… …
2737 /* IF we get here, key doesn't exist */ 2497 /* IF we get here, key doesn't exist */
2738 2498
2739 /* No field, we'll have to add it. */ 2499 /* No field, we'll have to add it. */
2740 2500
2741 if (!add_key) 2501 if (!add_key)
2742 {
2743 return FALSE; 2502 return FALSE;
2744 } 2503
2745 /* There isn't any good reason to store a null 2504 /* There isn't any good reason to store a null
2746 * value in the key/value list. If the archetype has 2505 * value in the key/value list. If the archetype has
2747 * this key, then we should also have it, so shouldn't 2506 * this key, then we should also have it, so shouldn't
2748 * be here. If user wants to store empty strings, 2507 * be here. If user wants to store empty strings,
2749 * should pass in "" 2508 * should pass in ""
… …
2798 } 2557 }
2799 else 2558 else
2800 item = item->env; 2559 item = item->env;
2801} 2560}
2802 2561
2562const char *
2563object::flag_desc (char *desc, int len) const
2564{
2565 char *p = desc;
2566 bool first = true;
2567
2568 *p = 0;
2569
2570 for (int i = 0; i < NUM_FLAGS; i++)
2571 {
2572 if (len <= 10) // magic constant!
2573 {
2574 snprintf (p, len, ",...");
2575 break;
2576 }
2577
2578 if (flag [i])
2579 {
2580 int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i);
2581 len -= cnt;
2582 p += cnt;
2583 first = false;
2584 }
2585 }
2586
2587 return desc;
2588}
2589
2803// return a suitable string describing an objetc in enough detail to find it 2590// return a suitable string describing an object in enough detail to find it
2804const char * 2591const char *
2805object::debug_desc (char *info) const 2592object::debug_desc (char *info) const
2806{ 2593{
2594 char flagdesc[512];
2807 char info2[256 * 3]; 2595 char info2[256 * 4];
2808 char *p = info; 2596 char *p = info;
2809 2597
2810 p += snprintf (p, 256, "%d=\"%s%s%s\"", 2598 p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}",
2811 count, 2599 count, uuid.seq,
2812 &name, 2600 &name,
2813 title ? " " : "", 2601 title ? "\",title:\"" : "",
2814 title ? (const char *)title : ""); 2602 title ? (const char *)title : "",
2603 flag_desc (flagdesc, 512), type);
2815 2604
2816 if (env) 2605 if (env)
2817 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); 2606 p += snprintf (p, 256, "(in %s)", env->debug_desc (info2));
2818 2607
2819 if (map) 2608 if (map)
2820 p += snprintf (p, 256, "(on %s@%d+%d)", map->path, x, y); 2609 p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y);
2821 2610
2822 return info; 2611 return info;
2823} 2612}
2824 2613
2825const char * 2614const char *
2826object::debug_desc () const 2615object::debug_desc () const
2827{ 2616{
2828 static char info[256 * 3]; 2617 static char info[3][256 * 4];
2618 static int info_idx;
2619
2829 return debug_desc (info); 2620 return debug_desc (info [++info_idx % 3]);
2830} 2621}
2831 2622
2623struct region *
2624object::region () const
2625{
2626 return map ? map->region (x, y)
2627 : region::default_region ();
2628}
2629
2630const materialtype_t *
2631object::dominant_material () const
2632{
2633 if (materialtype_t *mt = name_to_material (materialname))
2634 return mt;
2635
2636 return name_to_material (shstr_unknown);
2637}
2638
2639void
2640object::open_container (object *new_container)
2641{
2642 if (container == new_container)
2643 return;
2644
2645 if (object *old_container = container)
2646 {
2647 if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this)))
2648 return;
2649
2650#if 0
2651 // remove the "Close old_container" object.
2652 if (object *closer = old_container->inv)
2653 if (closer->type == CLOSE_CON)
2654 closer->destroy ();
2655#endif
2656
2657 old_container->flag [FLAG_APPLIED] = 0;
2658 container = 0;
2659
2660 esrv_update_item (UPD_FLAGS, this, old_container);
2661 new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container));
2662 play_sound (sound_find ("chest_close"));
2663 }
2664
2665 if (new_container)
2666 {
2667 if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this)))
2668 return;
2669
2670 // TODO: this does not seem to serve any purpose anymore?
2671#if 0
2672 // insert the "Close Container" object.
2673 if (archetype *closer = new_container->other_arch)
2674 {
2675 object *closer = arch_to_object (new_container->other_arch);
2676 closer->flag [FLAG_NO_MAP_SAVE] = 1;
2677 new_container->insert (closer);
2678 }
2679#endif
2680
2681 new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container));
2682
2683 new_container->flag [FLAG_APPLIED] = 1;
2684 container = new_container;
2685
2686 esrv_update_item (UPD_FLAGS, this, new_container);
2687 esrv_send_inventory (this, new_container);
2688 play_sound (sound_find ("chest_open"));
2689 }
2690}
2691
2692object *
2693object::force_find (const shstr name)
2694{
2695 /* cycle through his inventory to look for the MARK we want to
2696 * place
2697 */
2698 for (object *tmp = inv; tmp; tmp = tmp->below)
2699 if (tmp->type == FORCE && tmp->slaying == name)
2700 return splay (tmp);
2701
2702 return 0;
2703}
2704
2705void
2706object::force_add (const shstr name, int duration)
2707{
2708 if (object *force = force_find (name))
2709 force->destroy ();
2710
2711 object *force = get_archetype (FORCE_NAME);
2712
2713 force->slaying = name;
2714 force->stats.food = 1;
2715 force->speed_left = -1.f;
2716
2717 force->set_speed (duration ? 1.f / duration : 0.f);
2718 force->flag [FLAG_IS_USED_UP] = true;
2719 force->flag [FLAG_APPLIED] = true;
2720
2721 insert (force);
2722}
2723
2724void
2725object::play_sound (faceidx sound) const
2726{
2727 if (!sound)
2728 return;
2729
2730 if (flag [FLAG_REMOVED])
2731 return;
2732
2733 if (env)
2734 {
2735 if (object *pl = in_player ())
2736 pl->contr->play_sound (sound);
2737 }
2738 else
2739 map->play_sound (sound, x, y);
2740}
2741

Diff Legend

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