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

Diff Legend

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