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