… | |
… | |
29 | #include <sys/types.h> |
29 | #include <sys/types.h> |
30 | #include <sys/uio.h> |
30 | #include <sys/uio.h> |
31 | #include <object.h> |
31 | #include <object.h> |
32 | #include <funcpoint.h> |
32 | #include <funcpoint.h> |
33 | #include <loader.h> |
33 | #include <loader.h> |
|
|
34 | |
|
|
35 | #include <bitset> |
34 | |
36 | |
35 | int nrofallocobjects = 0; |
37 | int nrofallocobjects = 0; |
36 | static UUID uuid; |
38 | static UUID uuid; |
37 | const uint64 UUID_SKIP = 1<<19; |
39 | const uint64 UUID_SKIP = 1<<19; |
38 | |
40 | |
… | |
… | |
104 | _exit (1); |
106 | _exit (1); |
105 | } |
107 | } |
106 | |
108 | |
107 | uuid.seq = uid; |
109 | uuid.seq = uid; |
108 | write_uuid (); |
110 | write_uuid (); |
109 | LOG (llevDebug, "read UID: %lld\n", uid); |
111 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
110 | fclose (fp); |
112 | fclose (fp); |
111 | } |
113 | } |
112 | |
114 | |
113 | UUID |
115 | UUID |
114 | gen_uuid () |
116 | gen_uuid () |
… | |
… | |
183 | * |
185 | * |
184 | * Note that this function appears a lot longer than the macro it |
186 | * Note that this function appears a lot longer than the macro it |
185 | * replaces - this is mostly for clarity - a decent compiler should hopefully |
187 | * replaces - this is mostly for clarity - a decent compiler should hopefully |
186 | * reduce this to the same efficiency. |
188 | * reduce this to the same efficiency. |
187 | * |
189 | * |
188 | * Check nrof variable *before* calling CAN_MERGE() |
190 | * Check nrof variable *before* calling can_merge() |
189 | * |
191 | * |
190 | * Improvements made with merge: Better checking on potion, and also |
192 | * Improvements made with merge: Better checking on potion, and also |
191 | * check weight |
193 | * check weight |
192 | */ |
194 | */ |
193 | |
195 | |
194 | bool object::can_merge (object *ob1, object *ob2) |
196 | bool object::can_merge_slow (object *ob1, object *ob2) |
195 | { |
197 | { |
196 | /* A couple quicksanity checks */ |
198 | /* A couple quicksanity checks */ |
197 | if ((ob1 == ob2) || (ob1->type != ob2->type)) |
199 | if (ob1 == ob2 |
|
|
200 | || ob1->type != ob2->type |
|
|
201 | || ob1->speed != ob2->speed |
|
|
202 | || ob1->value != ob2->value |
|
|
203 | || ob1->name != ob2->name) |
198 | return 0; |
204 | return 0; |
199 | |
205 | |
200 | if (ob1->speed != ob2->speed) |
206 | //TODO: this ain't working well, use nicer and correct overflow check |
201 | return 0; |
|
|
202 | |
|
|
203 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
207 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
204 | * value could not be stored in a sint32 (which unfortunately sometimes is |
208 | * value could not be stored in a sint32 (which unfortunately sometimes is |
205 | * used to store nrof). |
209 | * used to store nrof). |
206 | */ |
210 | */ |
207 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
211 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
… | |
… | |
217 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
221 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
218 | |
222 | |
219 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
223 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
220 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
224 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
221 | |
225 | |
222 | |
226 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
223 | /* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something |
227 | || ob1->arch != ob2->arch |
224 | * being locked in inventory should prevent merging. |
|
|
225 | * 0x4 in flags3 is CLIENT_SENT |
|
|
226 | */ |
|
|
227 | if ((ob1->arch != ob2->arch) || |
|
|
228 | (ob1->flags[0] != ob2->flags[0]) || |
|
|
229 | (ob1->flags[1] != ob2->flags[1]) || |
|
|
230 | ((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) || |
|
|
231 | ((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) || |
|
|
232 | (ob1->name != ob2->name) || |
228 | || ob1->name != ob2->name |
233 | (ob1->title != ob2->title) || |
229 | || ob1->title != ob2->title |
234 | (ob1->msg != ob2->msg) || |
230 | || ob1->msg != ob2->msg |
235 | (ob1->weight != ob2->weight) || |
231 | || ob1->weight != ob2->weight |
236 | (memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) || |
232 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
237 | (memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) || |
233 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) ) |
238 | (ob1->attacktype != ob2->attacktype) || |
234 | || ob1->attacktype != ob2->attacktype |
239 | (ob1->magic != ob2->magic) || |
235 | || ob1->magic != ob2->magic |
240 | (ob1->slaying != ob2->slaying) || |
236 | || ob1->slaying != ob2->slaying |
241 | (ob1->skill != ob2->skill) || |
237 | || ob1->skill != ob2->skill |
242 | (ob1->value != ob2->value) || |
238 | || ob1->value != ob2->value |
243 | (ob1->animation_id != ob2->animation_id) || |
239 | || ob1->animation_id != ob2->animation_id |
244 | (ob1->client_type != ob2->client_type) || |
240 | || ob1->client_type != ob2->client_type |
245 | (ob1->materialname != ob2->materialname) || |
241 | || ob1->materialname != ob2->materialname |
246 | (ob1->lore != ob2->lore) || |
242 | || ob1->lore != ob2->lore |
247 | (ob1->subtype != ob2->subtype) || |
243 | || ob1->subtype != ob2->subtype |
248 | (ob1->move_type != ob2->move_type) || |
244 | || ob1->move_type != ob2->move_type |
249 | (ob1->move_block != ob2->move_block) || |
245 | || ob1->move_block != ob2->move_block |
250 | (ob1->move_allow != ob2->move_allow) || |
246 | || ob1->move_allow != ob2->move_allow |
251 | (ob1->move_on != ob2->move_on) || |
247 | || ob1->move_on != ob2->move_on |
252 | (ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty)) |
248 | || ob1->move_off != ob2->move_off |
|
|
249 | || ob1->move_slow != ob2->move_slow |
|
|
250 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
253 | return 0; |
251 | return 0; |
254 | |
252 | |
255 | /* This is really a spellbook check - really, we should |
253 | /* This is really a spellbook check - really, we should |
256 | * check all objects in the inventory. |
254 | * check all objects in the inventory. |
257 | */ |
255 | */ |
… | |
… | |
260 | /* if one object has inventory but the other doesn't, not equiv */ |
258 | /* if one object has inventory but the other doesn't, not equiv */ |
261 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
259 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
262 | return 0; |
260 | return 0; |
263 | |
261 | |
264 | /* Now check to see if the two inventory objects could merge */ |
262 | /* Now check to see if the two inventory objects could merge */ |
265 | if (!CAN_MERGE (ob1->inv, ob2->inv)) |
263 | if (!object::can_merge (ob1->inv, ob2->inv)) |
266 | return 0; |
264 | return 0; |
267 | |
265 | |
268 | /* inventory ok - still need to check rest of this object to see |
266 | /* inventory ok - still need to check rest of this object to see |
269 | * if it is valid. |
267 | * if it is valid. |
270 | */ |
268 | */ |
… | |
… | |
354 | op = op->env; |
352 | op = op->env; |
355 | return op; |
353 | return op; |
356 | } |
354 | } |
357 | |
355 | |
358 | /* |
356 | /* |
359 | * Eneq(@csd.uu.se): Since we can have items buried in a character we need |
|
|
360 | * a better check. We basically keeping traversing up until we can't |
|
|
361 | * or find a player. |
|
|
362 | */ |
|
|
363 | |
|
|
364 | object * |
|
|
365 | is_player_inv (object *op) |
|
|
366 | { |
|
|
367 | for (; op != NULL && op->type != PLAYER; op = op->env) |
|
|
368 | if (op->env == op) |
|
|
369 | op->env = NULL; |
|
|
370 | return op; |
|
|
371 | } |
|
|
372 | |
|
|
373 | /* |
|
|
374 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
357 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
375 | * Some error messages. |
358 | * Some error messages. |
376 | * The result of the dump is stored in the static global errmsg array. |
359 | * The result of the dump is stored in the static global errmsg array. |
377 | */ |
360 | */ |
378 | |
361 | |
379 | void |
362 | char * |
380 | dump_object2 (object *op) |
|
|
381 | { |
|
|
382 | errmsg[0] = 0; |
|
|
383 | return; |
|
|
384 | //TODO//D#d# |
|
|
385 | #if 0 |
|
|
386 | char *cp; |
|
|
387 | |
|
|
388 | /* object *tmp;*/ |
|
|
389 | |
|
|
390 | if (op->arch != NULL) |
|
|
391 | { |
|
|
392 | strcat (errmsg, "arch "); |
|
|
393 | strcat (errmsg, op->arch->name ? op->arch->name : "(null)"); |
|
|
394 | strcat (errmsg, "\n"); |
|
|
395 | if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL) |
|
|
396 | strcat (errmsg, cp); |
|
|
397 | # if 0 |
|
|
398 | /* Don't dump player diffs - they are too long, mostly meaningless, and |
|
|
399 | * will overflow the buffer. |
|
|
400 | * Changed so that we don't dump inventory either. This may |
|
|
401 | * also overflow the buffer. |
|
|
402 | */ |
|
|
403 | if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL) |
|
|
404 | strcat (errmsg, cp); |
|
|
405 | for (tmp = op->inv; tmp; tmp = tmp->below) |
|
|
406 | dump_object2 (tmp); |
|
|
407 | # endif |
|
|
408 | strcat (errmsg, "end\n"); |
|
|
409 | } |
|
|
410 | else |
|
|
411 | { |
|
|
412 | strcat (errmsg, "Object "); |
|
|
413 | if (op->name == NULL) |
|
|
414 | strcat (errmsg, "(null)"); |
|
|
415 | else |
|
|
416 | strcat (errmsg, op->name); |
|
|
417 | strcat (errmsg, "\n"); |
|
|
418 | # if 0 |
|
|
419 | if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL) |
|
|
420 | strcat (errmsg, cp); |
|
|
421 | for (tmp = op->inv; tmp; tmp = tmp->below) |
|
|
422 | dump_object2 (tmp); |
|
|
423 | # endif |
|
|
424 | strcat (errmsg, "end\n"); |
|
|
425 | } |
|
|
426 | #endif |
|
|
427 | } |
|
|
428 | |
|
|
429 | /* |
|
|
430 | * Dumps an object. Returns output in the static global errmsg array. |
|
|
431 | */ |
|
|
432 | |
|
|
433 | void |
|
|
434 | dump_object (object *op) |
363 | dump_object (object *op) |
435 | { |
364 | { |
436 | if (op == NULL) |
365 | if (!op) |
437 | { |
366 | return strdup ("[NULLOBJ]"); |
438 | strcpy (errmsg, "[NULL pointer]"); |
|
|
439 | return; |
|
|
440 | } |
|
|
441 | errmsg[0] = '\0'; |
|
|
442 | dump_object2 (op); |
|
|
443 | } |
|
|
444 | |
367 | |
445 | void |
368 | object_freezer freezer; |
446 | dump_all_objects (void) |
369 | save_object (freezer, op, 3); |
447 | { |
370 | return freezer.as_string (); |
448 | object *op; |
|
|
449 | |
|
|
450 | for (op = object::first; op != NULL; op = op->next) |
|
|
451 | { |
|
|
452 | dump_object (op); |
|
|
453 | fprintf (logfile, "Object %s\n", errmsg); |
|
|
454 | } |
|
|
455 | } |
371 | } |
456 | |
372 | |
457 | /* |
373 | /* |
458 | * 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 |
459 | * multi-object 1 which is closest to the second object. |
375 | * multi-object 1 which is closest to the second object. |
… | |
… | |
479 | */ |
395 | */ |
480 | |
396 | |
481 | object * |
397 | object * |
482 | find_object (tag_t i) |
398 | find_object (tag_t i) |
483 | { |
399 | { |
484 | object *op; |
|
|
485 | |
|
|
486 | for (op = object::first; op != NULL; op = op->next) |
400 | for (object *op = object::first; op; op = op->next) |
487 | if (op->count == i) |
401 | if (op->count == i) |
488 | break; |
402 | return op; |
489 | |
403 | |
490 | return op; |
404 | return 0; |
491 | } |
405 | } |
492 | |
406 | |
493 | /* |
407 | /* |
494 | * Returns the first object which has a name equal to the argument. |
408 | * Returns the first object which has a name equal to the argument. |
495 | * Used only by the patch command, but not all that useful. |
409 | * Used only by the patch command, but not all that useful. |
… | |
… | |
553 | } |
467 | } |
554 | |
468 | |
555 | op->key_values = 0; |
469 | op->key_values = 0; |
556 | } |
470 | } |
557 | |
471 | |
558 | void object::clear () |
|
|
559 | { |
|
|
560 | attachable_base::clear (); |
|
|
561 | |
|
|
562 | free_key_values (this); |
|
|
563 | |
|
|
564 | owner = 0; |
|
|
565 | name = 0; |
|
|
566 | name_pl = 0; |
|
|
567 | title = 0; |
|
|
568 | race = 0; |
|
|
569 | slaying = 0; |
|
|
570 | skill = 0; |
|
|
571 | msg = 0; |
|
|
572 | lore = 0; |
|
|
573 | custom_name = 0; |
|
|
574 | materialname = 0; |
|
|
575 | contr = 0; |
|
|
576 | below = 0; |
|
|
577 | above = 0; |
|
|
578 | inv = 0; |
|
|
579 | container = 0; |
|
|
580 | env = 0; |
|
|
581 | more = 0; |
|
|
582 | head = 0; |
|
|
583 | map = 0; |
|
|
584 | active_next = 0; |
|
|
585 | active_prev = 0; |
|
|
586 | |
|
|
587 | memset (static_cast<object_pod *>(this), 0, sizeof (object_pod)); |
|
|
588 | |
|
|
589 | SET_FLAG (this, FLAG_REMOVED); |
|
|
590 | |
|
|
591 | /* What is not cleared is next, prev, and count */ |
|
|
592 | |
|
|
593 | expmul = 1.0; |
|
|
594 | face = blank_face; |
|
|
595 | |
|
|
596 | if (settings.casting_time) |
|
|
597 | casting_time = -1; |
|
|
598 | } |
|
|
599 | |
|
|
600 | void object::clone (object *destination) |
|
|
601 | { |
|
|
602 | *(object_copy *)destination = *this; |
|
|
603 | *(object_pod *)destination = *this; |
|
|
604 | |
|
|
605 | if (self || cb) |
|
|
606 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); |
|
|
607 | } |
|
|
608 | |
|
|
609 | /* |
472 | /* |
610 | * copy object first frees everything allocated by the second object, |
473 | * copy_to first frees everything allocated by the dst object, |
611 | * and then copies the contends of the first object into the second |
474 | * and then copies the contents of itself into the second |
612 | * object, allocating what needs to be allocated. Basically, any |
475 | * object, allocating what needs to be allocated. Basically, any |
613 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
476 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
614 | * if the first object is freed, the pointers in the new object |
477 | * if the first object is freed, the pointers in the new object |
615 | * will point at garbage. |
478 | * will point at garbage. |
616 | */ |
479 | */ |
617 | void |
480 | void |
618 | copy_object (object *op2, object *op) |
481 | object::copy_to (object *dst) |
619 | { |
482 | { |
620 | bool is_freed = QUERY_FLAG (op, FLAG_FREED); |
483 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
621 | bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); |
484 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
622 | |
485 | |
623 | op2->clone (op); |
486 | *(object_copy *)dst = *this; |
|
|
487 | |
|
|
488 | if (self || cb) |
|
|
489 | INVOKE_OBJECT (CLONE, this, ARG_OBJECT (dst)); |
624 | |
490 | |
625 | if (is_freed) |
491 | if (is_freed) |
626 | SET_FLAG (op, FLAG_FREED); |
492 | SET_FLAG (dst, FLAG_FREED); |
|
|
493 | |
627 | if (is_removed) |
494 | if (is_removed) |
628 | SET_FLAG (op, FLAG_REMOVED); |
495 | SET_FLAG (dst, FLAG_REMOVED); |
629 | |
496 | |
630 | if (op2->speed < 0) |
497 | if (speed < 0) |
631 | op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0; |
498 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
632 | |
499 | |
633 | /* Copy over key_values, if any. */ |
500 | /* Copy over key_values, if any. */ |
634 | if (op2->key_values) |
501 | if (key_values) |
635 | { |
502 | { |
636 | key_value *tail = 0; |
503 | key_value *tail = 0; |
637 | key_value *i; |
504 | key_value *i; |
638 | |
505 | |
639 | op->key_values = 0; |
506 | dst->key_values = 0; |
640 | |
507 | |
641 | for (i = op2->key_values; i; i = i->next) |
508 | for (i = key_values; i; i = i->next) |
642 | { |
509 | { |
643 | key_value *new_link = new key_value; |
510 | key_value *new_link = new key_value; |
644 | |
511 | |
645 | new_link->next = 0; |
512 | new_link->next = 0; |
646 | new_link->key = i->key; |
513 | new_link->key = i->key; |
647 | new_link->value = i->value; |
514 | new_link->value = i->value; |
648 | |
515 | |
649 | /* Try and be clever here, too. */ |
516 | /* Try and be clever here, too. */ |
650 | if (!op->key_values) |
517 | if (!dst->key_values) |
651 | { |
518 | { |
652 | op->key_values = new_link; |
519 | dst->key_values = new_link; |
653 | tail = new_link; |
520 | tail = new_link; |
654 | } |
521 | } |
655 | else |
522 | else |
656 | { |
523 | { |
657 | tail->next = new_link; |
524 | tail->next = new_link; |
658 | tail = new_link; |
525 | tail = new_link; |
659 | } |
526 | } |
660 | } |
527 | } |
661 | } |
528 | } |
662 | |
529 | |
663 | update_ob_speed (op); |
530 | update_ob_speed (dst); |
|
|
531 | } |
|
|
532 | |
|
|
533 | object * |
|
|
534 | object::clone () |
|
|
535 | { |
|
|
536 | object *neu = create (); |
|
|
537 | copy_to (neu); |
|
|
538 | return neu; |
664 | } |
539 | } |
665 | |
540 | |
666 | /* |
541 | /* |
667 | * If an object with the IS_TURNABLE() flag needs to be turned due |
542 | * If an object with the IS_TURNABLE() flag needs to be turned due |
668 | * to the closest player being on the other side, this function can |
543 | * to the closest player being on the other side, this function can |
… | |
… | |
776 | op->active_next = NULL; |
651 | op->active_next = NULL; |
777 | op->active_prev = NULL; |
652 | op->active_prev = NULL; |
778 | } |
653 | } |
779 | |
654 | |
780 | /* |
655 | /* |
781 | * update_object() updates the array which represents the map. |
656 | * update_object() updates the the map. |
782 | * It takes into account invisible objects (and represent squares covered |
657 | * It takes into account invisible objects (and represent squares covered |
783 | * by invisible objects by whatever is below them (unless it's another |
658 | * by invisible objects by whatever is below them (unless it's another |
784 | * invisible object, etc...) |
659 | * invisible object, etc...) |
785 | * If the object being updated is beneath a player, the look-window |
660 | * If the object being updated is beneath a player, the look-window |
786 | * of that player is updated (this might be a suboptimal way of |
661 | * of that player is updated (this might be a suboptimal way of |
787 | * updating that window, though, since update_object() is called _often_) |
662 | * updating that window, though, since update_object() is called _often_) |
788 | * |
663 | * |
789 | * action is a hint of what the caller believes need to be done. |
664 | * action is a hint of what the caller believes need to be done. |
790 | * For example, if the only thing that has changed is the face (due to |
|
|
791 | * an animation), we don't need to call update_position until that actually |
|
|
792 | * comes into view of a player. OTOH, many other things, like addition/removal |
|
|
793 | * of walls or living creatures may need us to update the flags now. |
|
|
794 | * current action are: |
665 | * current action are: |
795 | * UP_OBJ_INSERT: op was inserted |
666 | * UP_OBJ_INSERT: op was inserted |
796 | * UP_OBJ_REMOVE: op was removed |
667 | * UP_OBJ_REMOVE: op was removed |
797 | * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update |
668 | * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update |
798 | * as that is easier than trying to look at what may have changed. |
669 | * as that is easier than trying to look at what may have changed. |
799 | * UP_OBJ_FACE: only the objects face has changed. |
670 | * UP_OBJ_FACE: only the objects face has changed. |
800 | */ |
671 | */ |
801 | |
|
|
802 | void |
672 | void |
803 | update_object (object *op, int action) |
673 | update_object (object *op, int action) |
804 | { |
674 | { |
805 | int update_now = 0, flags; |
|
|
806 | MoveType move_on, move_off, move_block, move_slow; |
675 | MoveType move_on, move_off, move_block, move_slow; |
807 | |
676 | |
808 | if (op == NULL) |
677 | if (op == NULL) |
809 | { |
678 | { |
810 | /* this should never happen */ |
679 | /* this should never happen */ |
811 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
680 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
812 | return; |
681 | return; |
813 | } |
682 | } |
814 | |
683 | |
815 | if (op->env != NULL) |
684 | if (op->env) |
816 | { |
685 | { |
817 | /* Animation is currently handled by client, so nothing |
686 | /* Animation is currently handled by client, so nothing |
818 | * to do in this case. |
687 | * to do in this case. |
819 | */ |
688 | */ |
820 | return; |
689 | return; |
… | |
… | |
834 | abort (); |
703 | abort (); |
835 | #endif |
704 | #endif |
836 | return; |
705 | return; |
837 | } |
706 | } |
838 | |
707 | |
839 | flags = GET_MAP_FLAGS (op->map, op->x, op->y); |
708 | mapspace &m = op->ms (); |
840 | SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE); |
|
|
841 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
|
|
842 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
|
|
843 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
|
|
844 | move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y); |
|
|
845 | |
709 | |
|
|
710 | if (m.flags_ & P_NEED_UPDATE) |
|
|
711 | /* nop */; |
846 | if (action == UP_OBJ_INSERT) |
712 | else if (action == UP_OBJ_INSERT) |
847 | { |
713 | { |
|
|
714 | // this is likely overkill, TODO: revisit (schmorp) |
848 | if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW)) |
715 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
849 | update_now = 1; |
|
|
850 | |
|
|
851 | if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC)) |
716 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
852 | update_now = 1; |
717 | || (op->type == PLAYER && !(m.flags_ & P_PLAYER)) |
853 | |
718 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
|
|
719 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
854 | if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC)) |
720 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
855 | update_now = 1; |
|
|
856 | |
|
|
857 | if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE)) |
|
|
858 | update_now = 1; |
|
|
859 | |
|
|
860 | if (op->type == SAFE_GROUND && !(flags & P_SAFE)) |
|
|
861 | update_now = 1; |
|
|
862 | |
|
|
863 | if ((move_on | op->move_on) != move_on) |
721 | || (m.move_on | op->move_on ) != m.move_on |
864 | update_now = 1; |
|
|
865 | |
|
|
866 | if ((move_off | op->move_off) != move_off) |
722 | || (m.move_off | op->move_off ) != m.move_off |
867 | update_now = 1; |
723 | || (m.move_slow | op->move_slow) != m.move_slow |
868 | |
|
|
869 | /* This isn't perfect, but I don't expect a lot of objects to |
724 | /* This isn't perfect, but I don't expect a lot of objects to |
870 | * to have move_allow right now. |
725 | * to have move_allow right now. |
871 | */ |
726 | */ |
872 | if (((move_block | op->move_block) & ~op->move_allow) != move_block) |
727 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
873 | update_now = 1; |
728 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
874 | |
729 | m.flags_ = P_NEED_UPDATE; |
875 | if ((move_slow | op->move_slow) != move_slow) |
|
|
876 | update_now = 1; |
|
|
877 | } |
730 | } |
878 | /* if the object is being removed, we can't make intelligent |
731 | /* if the object is being removed, we can't make intelligent |
879 | * decisions, because remove_ob can't really pass the object |
732 | * decisions, because remove_ob can't really pass the object |
880 | * that is being removed. |
733 | * that is being removed. |
881 | */ |
734 | */ |
882 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
735 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
883 | update_now = 1; |
736 | m.flags_ = P_NEED_UPDATE; |
884 | else if (action == UP_OBJ_FACE) |
737 | else if (action == UP_OBJ_FACE) |
885 | /* Nothing to do for that case */ ; |
738 | /* Nothing to do for that case */ ; |
886 | else |
739 | else |
887 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
740 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
888 | |
741 | |
889 | if (update_now) |
|
|
890 | { |
|
|
891 | SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE); |
|
|
892 | update_position (op->map, op->x, op->y); |
|
|
893 | } |
|
|
894 | |
|
|
895 | if (op->more != NULL) |
742 | if (op->more) |
896 | update_object (op->more, action); |
743 | update_object (op->more, action); |
897 | } |
744 | } |
898 | |
745 | |
899 | object::vector object::mortals; |
746 | object::vector object::mortals; |
900 | object::vector object::objects; // not yet used |
747 | object::vector object::objects; // not yet used |
… | |
… | |
908 | else |
755 | else |
909 | { |
756 | { |
910 | delete *i; |
757 | delete *i; |
911 | mortals.erase (i); |
758 | mortals.erase (i); |
912 | } |
759 | } |
913 | |
|
|
914 | static int lastmortals = 0;//D |
|
|
915 | |
|
|
916 | if (mortals.size() != lastmortals)//D |
|
|
917 | { |
|
|
918 | lastmortals = mortals.size ();//D |
|
|
919 | LOG (llevDebug, "%d objects in mortal queue\n", lastmortals);//D |
|
|
920 | } |
|
|
921 | } |
760 | } |
922 | |
761 | |
923 | object::object () |
762 | object::object () |
924 | { |
763 | { |
925 | SET_FLAG (this, FLAG_REMOVED); |
764 | SET_FLAG (this, FLAG_REMOVED); |
… | |
… | |
972 | * it from the list of used objects, and puts it on the list of |
811 | * it from the list of used objects, and puts it on the list of |
973 | * free objects. The IS_FREED() flag is set in the object. |
812 | * free objects. The IS_FREED() flag is set in the object. |
974 | * The object must have been removed by remove_ob() first for |
813 | * The object must have been removed by remove_ob() first for |
975 | * this function to succeed. |
814 | * this function to succeed. |
976 | * |
815 | * |
977 | * If free_inventory is set, free inventory as well. Else drop items in |
816 | * If destroy_inventory is set, free inventory as well. Else drop items in |
978 | * inventory to the ground. |
817 | * inventory to the ground. |
979 | */ |
818 | */ |
980 | void object::free (bool free_inventory) |
819 | void object::destroy (bool destroy_inventory) |
981 | { |
820 | { |
982 | if (QUERY_FLAG (this, FLAG_FREED)) |
821 | if (QUERY_FLAG (this, FLAG_FREED)) |
983 | return; |
822 | return; |
984 | |
823 | |
985 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
824 | if (QUERY_FLAG (this, FLAG_FRIENDLY)) |
986 | remove_friendly_object (this); |
825 | remove_friendly_object (this); |
987 | |
826 | |
988 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
827 | if (!QUERY_FLAG (this, FLAG_REMOVED)) |
989 | remove_ob (this); |
828 | remove (); |
990 | |
829 | |
991 | SET_FLAG (this, FLAG_FREED); |
830 | SET_FLAG (this, FLAG_FREED); |
992 | |
831 | |
993 | if (more) |
832 | if (more) |
994 | { |
833 | { |
995 | more->free (free_inventory); |
834 | more->destroy (destroy_inventory); |
996 | more = 0; |
835 | more = 0; |
997 | } |
836 | } |
998 | |
837 | |
999 | if (inv) |
838 | if (inv) |
1000 | { |
839 | { |
1001 | /* Only if the space blocks everything do we not process - |
840 | /* Only if the space blocks everything do we not process - |
1002 | * if some form of movement is allowed, let objects |
841 | * if some form of movement is allowed, let objects |
1003 | * drop on that space. |
842 | * drop on that space. |
1004 | */ |
843 | */ |
1005 | if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
844 | if (destroy_inventory || !map || map->in_memory != MAP_IN_MEMORY || GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL) |
1006 | { |
845 | { |
1007 | object *op = inv; |
846 | object *op = inv; |
1008 | |
847 | |
1009 | while (op) |
848 | while (op) |
1010 | { |
849 | { |
1011 | object *tmp = op->below; |
850 | object *tmp = op->below; |
1012 | op->free (free_inventory); |
851 | op->destroy (destroy_inventory); |
1013 | op = tmp; |
852 | op = tmp; |
1014 | } |
853 | } |
1015 | } |
854 | } |
1016 | else |
855 | else |
1017 | { /* Put objects in inventory onto this space */ |
856 | { /* Put objects in inventory onto this space */ |
… | |
… | |
1019 | |
858 | |
1020 | while (op) |
859 | while (op) |
1021 | { |
860 | { |
1022 | object *tmp = op->below; |
861 | object *tmp = op->below; |
1023 | |
862 | |
1024 | remove_ob (op); |
863 | op->remove (); |
1025 | |
864 | |
1026 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
865 | if (QUERY_FLAG (op, FLAG_STARTEQUIP) |
1027 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
866 | || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) |
1028 | free_object (op); |
867 | op->destroy (); |
1029 | else |
868 | else |
1030 | { |
869 | { |
1031 | op->x = x; |
870 | op->x = x; |
1032 | op->y = y; |
871 | op->y = y; |
1033 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
872 | insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */ |
… | |
… | |
1036 | op = tmp; |
875 | op = tmp; |
1037 | } |
876 | } |
1038 | } |
877 | } |
1039 | } |
878 | } |
1040 | |
879 | |
|
|
880 | // hack to ensure that freed objects still have a valid map |
|
|
881 | { |
|
|
882 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
883 | |
|
|
884 | if (!freed_map) |
|
|
885 | { |
|
|
886 | freed_map = new maptile; |
|
|
887 | |
|
|
888 | freed_map->name = "/internal/freed_objects_map"; |
|
|
889 | freed_map->width = 3; |
|
|
890 | freed_map->height = 3; |
|
|
891 | |
|
|
892 | freed_map->allocate (); |
|
|
893 | } |
|
|
894 | |
|
|
895 | map = freed_map; |
|
|
896 | x = 1; |
|
|
897 | y = 1; |
|
|
898 | } |
|
|
899 | |
1041 | // clear those pointers that likely might have circular references to us |
900 | // clear those pointers that likely might have circular references to us |
1042 | owner = 0; |
901 | owner = 0; |
1043 | enemy = 0; |
902 | enemy = 0; |
1044 | attacked_by = 0; |
903 | attacked_by = 0; |
1045 | |
904 | |
|
|
905 | // only relevant for players(?), but make sure of it anyways |
|
|
906 | contr = 0; |
|
|
907 | |
1046 | /* Remove object from the active list */ |
908 | /* Remove object from the active list */ |
1047 | speed = 0; |
909 | speed = 0; |
1048 | update_ob_speed (this); |
910 | update_ob_speed (this); |
1049 | |
911 | |
1050 | unlink (); |
912 | unlink (); |
… | |
… | |
1054 | |
916 | |
1055 | /* |
917 | /* |
1056 | * sub_weight() recursively (outwards) subtracts a number from the |
918 | * sub_weight() recursively (outwards) subtracts a number from the |
1057 | * weight of an object (and what is carried by it's environment(s)). |
919 | * weight of an object (and what is carried by it's environment(s)). |
1058 | */ |
920 | */ |
1059 | |
|
|
1060 | void |
921 | void |
1061 | sub_weight (object *op, signed long weight) |
922 | sub_weight (object *op, signed long weight) |
1062 | { |
923 | { |
1063 | while (op != NULL) |
924 | while (op != NULL) |
1064 | { |
925 | { |
… | |
… | |
1068 | op->carrying -= weight; |
929 | op->carrying -= weight; |
1069 | op = op->env; |
930 | op = op->env; |
1070 | } |
931 | } |
1071 | } |
932 | } |
1072 | |
933 | |
1073 | /* remove_ob(op): |
934 | /* op->remove (): |
1074 | * This function removes the object op from the linked list of objects |
935 | * This function removes the object op from the linked list of objects |
1075 | * which it is currently tied to. When this function is done, the |
936 | * which it is currently tied to. When this function is done, the |
1076 | * object will have no environment. If the object previously had an |
937 | * object will have no environment. If the object previously had an |
1077 | * environment, the x and y coordinates will be updated to |
938 | * environment, the x and y coordinates will be updated to |
1078 | * the previous environment. |
939 | * the previous environment. |
1079 | * Beware: This function is called from the editor as well! |
940 | * Beware: This function is called from the editor as well! |
1080 | */ |
941 | */ |
1081 | |
|
|
1082 | void |
942 | void |
1083 | remove_ob (object *op) |
943 | object::remove () |
1084 | { |
944 | { |
1085 | object *tmp, *last = 0; |
945 | object *tmp, *last = 0; |
1086 | object *otmp; |
946 | object *otmp; |
1087 | |
947 | |
1088 | int check_walk_off; |
948 | int check_walk_off; |
1089 | maptile *m; |
|
|
1090 | |
949 | |
1091 | sint16 x, y; |
|
|
1092 | |
|
|
1093 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
950 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1094 | return; |
951 | return; |
1095 | |
952 | |
1096 | SET_FLAG (op, FLAG_REMOVED); |
953 | SET_FLAG (this, FLAG_REMOVED); |
1097 | |
954 | |
1098 | if (op->more != NULL) |
955 | if (more) |
1099 | remove_ob (op->more); |
956 | more->remove (); |
1100 | |
957 | |
1101 | /* |
958 | /* |
1102 | * In this case, the object to be removed is in someones |
959 | * In this case, the object to be removed is in someones |
1103 | * inventory. |
960 | * inventory. |
1104 | */ |
961 | */ |
1105 | if (op->env != NULL) |
962 | if (env) |
1106 | { |
963 | { |
1107 | if (op->nrof) |
964 | if (nrof) |
1108 | sub_weight (op->env, op->weight * op->nrof); |
965 | sub_weight (env, weight * nrof); |
1109 | else |
966 | else |
1110 | sub_weight (op->env, op->weight + op->carrying); |
967 | sub_weight (env, weight + carrying); |
1111 | |
968 | |
1112 | /* NO_FIX_PLAYER is set when a great many changes are being |
969 | /* NO_FIX_PLAYER is set when a great many changes are being |
1113 | * made to players inventory. If set, avoiding the call |
970 | * made to players inventory. If set, avoiding the call |
1114 | * to save cpu time. |
971 | * to save cpu time. |
1115 | */ |
972 | */ |
1116 | if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
973 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1117 | fix_player (otmp); |
974 | otmp->update_stats (); |
1118 | |
975 | |
1119 | if (op->above != NULL) |
976 | if (above != NULL) |
1120 | op->above->below = op->below; |
977 | above->below = below; |
1121 | else |
978 | else |
1122 | op->env->inv = op->below; |
979 | env->inv = below; |
1123 | |
980 | |
1124 | if (op->below != NULL) |
981 | if (below != NULL) |
1125 | op->below->above = op->above; |
982 | below->above = above; |
1126 | |
983 | |
1127 | /* we set up values so that it could be inserted into |
984 | /* we set up values so that it could be inserted into |
1128 | * the map, but we don't actually do that - it is up |
985 | * the map, but we don't actually do that - it is up |
1129 | * to the caller to decide what we want to do. |
986 | * to the caller to decide what we want to do. |
1130 | */ |
987 | */ |
1131 | op->x = op->env->x, op->y = op->env->y; |
988 | x = env->x, y = env->y; |
1132 | op->map = op->env->map; |
989 | map = env->map; |
1133 | op->above = NULL, op->below = NULL; |
990 | above = 0, below = 0; |
1134 | op->env = NULL; |
991 | env = 0; |
1135 | } |
992 | } |
1136 | else if (op->map) |
993 | else if (map) |
1137 | { |
994 | { |
1138 | x = op->x; |
|
|
1139 | y = op->y; |
|
|
1140 | m = get_map_from_coord (op->map, &x, &y); |
|
|
1141 | |
|
|
1142 | if (!m) |
|
|
1143 | { |
|
|
1144 | LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n", |
|
|
1145 | op->map->path, op->x, op->y); |
|
|
1146 | /* in old days, we used to set x and y to 0 and continue. |
|
|
1147 | * it seems if we get into this case, something is probablye |
|
|
1148 | * screwed up and should be fixed. |
|
|
1149 | */ |
|
|
1150 | abort (); |
|
|
1151 | } |
|
|
1152 | |
|
|
1153 | if (op->map != m) |
|
|
1154 | LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n", |
|
|
1155 | op->map->path, m->path, op->x, op->y, x, y); |
|
|
1156 | |
|
|
1157 | /* Re did the following section of code - it looks like it had |
995 | /* Re did the following section of code - it looks like it had |
1158 | * lots of logic for things we no longer care about |
996 | * lots of logic for things we no longer care about |
1159 | */ |
997 | */ |
1160 | |
998 | |
1161 | /* link the object above us */ |
999 | /* link the object above us */ |
1162 | if (op->above) |
1000 | if (above) |
1163 | op->above->below = op->below; |
1001 | above->below = below; |
1164 | else |
1002 | else |
1165 | SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */ |
1003 | map->at (x, y).top = below; /* we were top, set new top */ |
1166 | |
1004 | |
1167 | /* Relink the object below us, if there is one */ |
1005 | /* Relink the object below us, if there is one */ |
1168 | if (op->below) |
1006 | if (below) |
1169 | op->below->above = op->above; |
1007 | below->above = above; |
1170 | else |
1008 | else |
1171 | { |
1009 | { |
1172 | /* Nothing below, which means we need to relink map object for this space |
1010 | /* Nothing below, which means we need to relink map object for this space |
1173 | * use translated coordinates in case some oddness with map tiling is |
1011 | * use translated coordinates in case some oddness with map tiling is |
1174 | * evident |
1012 | * evident |
1175 | */ |
1013 | */ |
1176 | if (GET_MAP_OB (m, x, y) != op) |
1014 | if (GET_MAP_OB (map, x, y) != this) |
1177 | { |
1015 | { |
1178 | dump_object (op); |
1016 | char *dump = dump_object (this); |
1179 | LOG (llevError, |
1017 | LOG (llevError, |
1180 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg); |
1018 | "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); |
|
|
1019 | free (dump); |
1181 | dump_object (GET_MAP_OB (m, x, y)); |
1020 | dump = dump_object (GET_MAP_OB (map, x, y)); |
1182 | LOG (llevError, "%s\n", errmsg); |
1021 | LOG (llevError, "%s\n", dump); |
|
|
1022 | free (dump); |
1183 | } |
1023 | } |
1184 | |
1024 | |
1185 | SET_MAP_OB (m, x, y, op->above); /* goes on above it. */ |
1025 | map->at (x, y).bottom = above; /* goes on above it. */ |
1186 | } |
1026 | } |
1187 | |
1027 | |
1188 | op->above = 0; |
1028 | above = 0; |
1189 | op->below = 0; |
1029 | below = 0; |
1190 | |
1030 | |
1191 | if (op->map->in_memory == MAP_SAVING) |
1031 | if (map->in_memory == MAP_SAVING) |
1192 | return; |
1032 | return; |
1193 | |
1033 | |
1194 | check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY); |
1034 | check_walk_off = !QUERY_FLAG (this, FLAG_NO_APPLY); |
1195 | |
1035 | |
1196 | for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1036 | for (tmp = GET_MAP_OB (map, x, y); tmp; tmp = tmp->above) |
1197 | { |
1037 | { |
1198 | /* No point updating the players look faces if he is the object |
1038 | /* No point updating the players look faces if he is the object |
1199 | * being removed. |
1039 | * being removed. |
1200 | */ |
1040 | */ |
1201 | |
1041 | |
1202 | if (tmp->type == PLAYER && tmp != op) |
1042 | if (tmp->type == PLAYER && tmp != this) |
1203 | { |
1043 | { |
1204 | /* If a container that the player is currently using somehow gets |
1044 | /* If a container that the player is currently using somehow gets |
1205 | * removed (most likely destroyed), update the player view |
1045 | * removed (most likely destroyed), update the player view |
1206 | * appropriately. |
1046 | * appropriately. |
1207 | */ |
1047 | */ |
1208 | if (tmp->container == op) |
1048 | if (tmp->container == this) |
1209 | { |
1049 | { |
1210 | CLEAR_FLAG (op, FLAG_APPLIED); |
1050 | CLEAR_FLAG (this, FLAG_APPLIED); |
1211 | tmp->container = NULL; |
1051 | tmp->container = 0; |
1212 | } |
1052 | } |
1213 | |
1053 | |
1214 | tmp->contr->socket.update_look = 1; |
1054 | tmp->contr->ns->floorbox_update (); |
1215 | } |
1055 | } |
1216 | |
1056 | |
1217 | /* See if player moving off should effect something */ |
1057 | /* See if player moving off should effect something */ |
1218 | if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1058 | if (check_walk_off |
|
|
1059 | && ((move_type & tmp->move_off) |
|
|
1060 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1219 | { |
1061 | { |
1220 | move_apply (tmp, op, NULL); |
1062 | move_apply (tmp, this, 0); |
1221 | |
1063 | |
1222 | if (op->destroyed ()); |
1064 | if (destroyed ()) |
1223 | LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name); |
1065 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1224 | } |
1066 | } |
1225 | |
1067 | |
1226 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1068 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
1227 | |
1069 | |
1228 | if (tmp->above == tmp) |
1070 | if (tmp->above == tmp) |
1229 | tmp->above = NULL; |
1071 | tmp->above = 0; |
1230 | |
1072 | |
1231 | last = tmp; |
1073 | last = tmp; |
1232 | } |
1074 | } |
1233 | |
1075 | |
1234 | /* last == NULL of there are no objects on this space */ |
1076 | /* last == NULL of there are no objects on this space */ |
1235 | if (last == NULL) |
1077 | if (!last) |
1236 | { |
1078 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1237 | /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, |
|
|
1238 | * we could preserve the flags (GET_MAP_FLAGS), but update_position figures |
|
|
1239 | * those out anyways, and if there are any flags set right now, they won't |
|
|
1240 | * be correct anyways. |
|
|
1241 | */ |
|
|
1242 | SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE); |
|
|
1243 | update_position (op->map, op->x, op->y); |
|
|
1244 | } |
|
|
1245 | else |
1079 | else |
1246 | update_object (last, UP_OBJ_REMOVE); |
1080 | update_object (last, UP_OBJ_REMOVE); |
1247 | |
1081 | |
1248 | if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0)) |
1082 | if (QUERY_FLAG (this, FLAG_BLOCKSVIEW) || glow_radius) |
1249 | update_all_los (op->map, op->x, op->y); |
1083 | update_all_los (map, x, y); |
1250 | } |
1084 | } |
1251 | } |
1085 | } |
1252 | |
1086 | |
1253 | /* |
1087 | /* |
1254 | * merge_ob(op,top): |
1088 | * merge_ob(op,top): |
… | |
… | |
1269 | |
1103 | |
1270 | for (; top != NULL; top = top->below) |
1104 | for (; top != NULL; top = top->below) |
1271 | { |
1105 | { |
1272 | if (top == op) |
1106 | if (top == op) |
1273 | continue; |
1107 | continue; |
1274 | if (CAN_MERGE (op, top)) |
1108 | |
|
|
1109 | if (object::can_merge (op, top)) |
1275 | { |
1110 | { |
1276 | top->nrof += op->nrof; |
1111 | top->nrof += op->nrof; |
1277 | |
1112 | |
1278 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1113 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1279 | op->weight = 0; /* Don't want any adjustements now */ |
1114 | op->weight = 0; /* Don't want any adjustements now */ |
1280 | remove_ob (op); |
1115 | op->destroy (); |
1281 | free_object (op); |
|
|
1282 | return top; |
1116 | return top; |
1283 | } |
1117 | } |
1284 | } |
1118 | } |
1285 | |
1119 | |
1286 | return 0; |
1120 | return 0; |
… | |
… | |
1340 | return NULL; |
1174 | return NULL; |
1341 | } |
1175 | } |
1342 | |
1176 | |
1343 | if (m == NULL) |
1177 | if (m == NULL) |
1344 | { |
1178 | { |
1345 | dump_object (op); |
1179 | char *dump = dump_object (op); |
1346 | LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg); |
1180 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
|
|
1181 | free (dump); |
1347 | return op; |
1182 | return op; |
1348 | } |
1183 | } |
1349 | |
1184 | |
1350 | if (out_of_map (m, op->x, op->y)) |
1185 | if (out_of_map (m, op->x, op->y)) |
1351 | { |
1186 | { |
1352 | dump_object (op); |
1187 | char *dump = dump_object (op); |
1353 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg); |
1188 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
1354 | #ifdef MANY_CORES |
1189 | #ifdef MANY_CORES |
1355 | /* Better to catch this here, as otherwise the next use of this object |
1190 | /* Better to catch this here, as otherwise the next use of this object |
1356 | * is likely to cause a crash. Better to find out where it is getting |
1191 | * is likely to cause a crash. Better to find out where it is getting |
1357 | * improperly inserted. |
1192 | * improperly inserted. |
1358 | */ |
1193 | */ |
1359 | abort (); |
1194 | abort (); |
1360 | #endif |
1195 | #endif |
|
|
1196 | free (dump); |
1361 | return op; |
1197 | return op; |
1362 | } |
1198 | } |
1363 | |
1199 | |
1364 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1200 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1365 | { |
1201 | { |
1366 | dump_object (op); |
1202 | char *dump = dump_object (op); |
1367 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg); |
1203 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1204 | free (dump); |
1368 | return op; |
1205 | return op; |
1369 | } |
1206 | } |
1370 | |
1207 | |
1371 | if (op->more != NULL) |
1208 | if (op->more != NULL) |
1372 | { |
1209 | { |
… | |
… | |
1410 | |
1247 | |
1411 | /* this has to be done after we translate the coordinates. |
1248 | /* this has to be done after we translate the coordinates. |
1412 | */ |
1249 | */ |
1413 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1250 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1414 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1251 | for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above) |
1415 | if (CAN_MERGE (op, tmp)) |
1252 | if (object::can_merge (op, tmp)) |
1416 | { |
1253 | { |
1417 | op->nrof += tmp->nrof; |
1254 | op->nrof += tmp->nrof; |
1418 | remove_ob (tmp); |
1255 | tmp->destroy (); |
1419 | free_object (tmp); |
|
|
1420 | } |
1256 | } |
1421 | |
1257 | |
1422 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1258 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1423 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1259 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1424 | |
1260 | |
… | |
… | |
1437 | op->below = originator->below; |
1273 | op->below = originator->below; |
1438 | |
1274 | |
1439 | if (op->below) |
1275 | if (op->below) |
1440 | op->below->above = op; |
1276 | op->below->above = op; |
1441 | else |
1277 | else |
1442 | SET_MAP_OB (op->map, op->x, op->y, op); |
1278 | op->ms ().bottom = op; |
1443 | |
1279 | |
1444 | /* since *below* originator, no need to update top */ |
1280 | /* since *below* originator, no need to update top */ |
1445 | originator->below = op; |
1281 | originator->below = op; |
1446 | } |
1282 | } |
1447 | else |
1283 | else |
… | |
… | |
1493 | * If INS_ON_TOP is used, don't do this processing |
1329 | * If INS_ON_TOP is used, don't do this processing |
1494 | * Need to find the object that in fact blocks view, otherwise |
1330 | * Need to find the object that in fact blocks view, otherwise |
1495 | * stacking is a bit odd. |
1331 | * stacking is a bit odd. |
1496 | */ |
1332 | */ |
1497 | if (!(flag & INS_ON_TOP) && |
1333 | if (!(flag & INS_ON_TOP) && |
1498 | (get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1334 | (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1499 | { |
1335 | { |
1500 | for (last = top; last != floor; last = last->below) |
1336 | for (last = top; last != floor; last = last->below) |
1501 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1337 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1502 | break; |
1338 | break; |
1503 | /* Check to see if we found the object that blocks view, |
1339 | /* Check to see if we found the object that blocks view, |
… | |
… | |
1526 | |
1362 | |
1527 | if (op->above) |
1363 | if (op->above) |
1528 | op->above->below = op; |
1364 | op->above->below = op; |
1529 | |
1365 | |
1530 | op->below = NULL; |
1366 | op->below = NULL; |
1531 | SET_MAP_OB (op->map, op->x, op->y, op); |
1367 | op->ms ().bottom = op; |
1532 | } |
1368 | } |
1533 | else |
1369 | else |
1534 | { /* get inserted into the stack above top */ |
1370 | { /* get inserted into the stack above top */ |
1535 | op->above = top->above; |
1371 | op->above = top->above; |
1536 | |
1372 | |
… | |
… | |
1540 | op->below = top; |
1376 | op->below = top; |
1541 | top->above = op; |
1377 | top->above = op; |
1542 | } |
1378 | } |
1543 | |
1379 | |
1544 | if (op->above == NULL) |
1380 | if (op->above == NULL) |
1545 | SET_MAP_TOP (op->map, op->x, op->y, op); |
1381 | op->ms ().top = op; |
1546 | } /* else not INS_BELOW_ORIGINATOR */ |
1382 | } /* else not INS_BELOW_ORIGINATOR */ |
1547 | |
1383 | |
1548 | if (op->type == PLAYER) |
1384 | if (op->type == PLAYER) |
1549 | op->contr->do_los = 1; |
1385 | op->contr->do_los = 1; |
1550 | |
1386 | |
1551 | /* If we have a floor, we know the player, if any, will be above |
1387 | /* If we have a floor, we know the player, if any, will be above |
1552 | * it, so save a few ticks and start from there. |
1388 | * it, so save a few ticks and start from there. |
1553 | */ |
1389 | */ |
1554 | if (!(flag & INS_MAP_LOAD)) |
1390 | if (!(flag & INS_MAP_LOAD)) |
1555 | for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1391 | if (object *pl = op->ms ().player ()) |
1556 | if (tmp->type == PLAYER) |
1392 | pl->contr->ns->floorbox_update (); |
1557 | tmp->contr->socket.update_look = 1; |
|
|
1558 | |
1393 | |
1559 | /* If this object glows, it may affect lighting conditions that are |
1394 | /* If this object glows, it may affect lighting conditions that are |
1560 | * visible to others on this map. But update_all_los is really |
1395 | * visible to others on this map. But update_all_los is really |
1561 | * an inefficient way to do this, as it means los for all players |
1396 | * an inefficient way to do this, as it means los for all players |
1562 | * on the map will get recalculated. The players could very well |
1397 | * on the map will get recalculated. The players could very well |
… | |
… | |
1570 | |
1405 | |
1571 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1406 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1572 | update_object (op, UP_OBJ_INSERT); |
1407 | update_object (op, UP_OBJ_INSERT); |
1573 | |
1408 | |
1574 | /* Don't know if moving this to the end will break anything. However, |
1409 | /* Don't know if moving this to the end will break anything. However, |
1575 | * we want to have update_look set above before calling this. |
1410 | * we want to have floorbox_update called before calling this. |
1576 | * |
1411 | * |
1577 | * check_move_on() must be after this because code called from |
1412 | * check_move_on() must be after this because code called from |
1578 | * check_move_on() depends on correct map flags (so functions like |
1413 | * check_move_on() depends on correct map flags (so functions like |
1579 | * blocked() and wall() work properly), and these flags are updated by |
1414 | * blocked() and wall() work properly), and these flags are updated by |
1580 | * update_object(). |
1415 | * update_object(). |
… | |
… | |
1596 | |
1431 | |
1597 | return op; |
1432 | return op; |
1598 | } |
1433 | } |
1599 | |
1434 | |
1600 | /* this function inserts an object in the map, but if it |
1435 | /* this function inserts an object in the map, but if it |
1601 | * finds an object of its own type, it'll remove that one first. |
1436 | * finds an object of its own type, it'll remove that one first. |
1602 | * op is the object to insert it under: supplies x and the map. |
1437 | * op is the object to insert it under: supplies x and the map. |
1603 | */ |
1438 | */ |
1604 | void |
1439 | void |
1605 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1440 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1606 | { |
1441 | { |
1607 | object * |
1442 | object *tmp, *tmp1; |
1608 | tmp; |
|
|
1609 | object * |
|
|
1610 | tmp1; |
|
|
1611 | |
1443 | |
1612 | /* first search for itself and remove any old instances */ |
1444 | /* first search for itself and remove any old instances */ |
1613 | |
1445 | |
1614 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1446 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1615 | { |
|
|
1616 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1447 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1617 | { |
1448 | tmp->destroy (); |
1618 | remove_ob (tmp); |
|
|
1619 | free_object (tmp); |
|
|
1620 | } |
|
|
1621 | } |
|
|
1622 | |
1449 | |
1623 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1450 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1624 | |
1451 | |
1625 | tmp1->x = op->x; |
1452 | tmp1->x = op->x; |
1626 | tmp1->y = op->y; |
1453 | tmp1->y = op->y; |
… | |
… | |
1636 | */ |
1463 | */ |
1637 | |
1464 | |
1638 | object * |
1465 | object * |
1639 | get_split_ob (object *orig_ob, uint32 nr) |
1466 | get_split_ob (object *orig_ob, uint32 nr) |
1640 | { |
1467 | { |
1641 | object * |
1468 | object *newob; |
1642 | newob; |
|
|
1643 | int |
|
|
1644 | is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1469 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
1645 | |
1470 | |
1646 | if (orig_ob->nrof < nr) |
1471 | if (orig_ob->nrof < nr) |
1647 | { |
1472 | { |
1648 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1473 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
1649 | return NULL; |
1474 | return NULL; |
1650 | } |
1475 | } |
1651 | |
1476 | |
1652 | newob = object_create_clone (orig_ob); |
1477 | newob = object_create_clone (orig_ob); |
1653 | |
1478 | |
1654 | if ((orig_ob->nrof -= nr) < 1) |
1479 | if ((orig_ob->nrof -= nr) < 1) |
1655 | { |
1480 | orig_ob->destroy (1); |
1656 | if (!is_removed) |
|
|
1657 | remove_ob (orig_ob); |
|
|
1658 | free_object2 (orig_ob, 1); |
|
|
1659 | } |
|
|
1660 | else if (!is_removed) |
1481 | else if (!is_removed) |
1661 | { |
1482 | { |
1662 | if (orig_ob->env != NULL) |
1483 | if (orig_ob->env != NULL) |
1663 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1484 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1664 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
1485 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
… | |
… | |
1684 | |
1505 | |
1685 | object * |
1506 | object * |
1686 | decrease_ob_nr (object *op, uint32 i) |
1507 | decrease_ob_nr (object *op, uint32 i) |
1687 | { |
1508 | { |
1688 | object *tmp; |
1509 | object *tmp; |
1689 | player *pl; |
|
|
1690 | |
1510 | |
1691 | if (i == 0) /* objects with op->nrof require this check */ |
1511 | if (i == 0) /* objects with op->nrof require this check */ |
1692 | return op; |
1512 | return op; |
1693 | |
1513 | |
1694 | if (i > op->nrof) |
1514 | if (i > op->nrof) |
1695 | i = op->nrof; |
1515 | i = op->nrof; |
1696 | |
1516 | |
1697 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1517 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
1698 | op->nrof -= i; |
1518 | op->nrof -= i; |
1699 | else if (op->env != NULL) |
1519 | else if (op->env) |
1700 | { |
1520 | { |
1701 | /* is this object in the players inventory, or sub container |
1521 | /* is this object in the players inventory, or sub container |
1702 | * therein? |
1522 | * therein? |
1703 | */ |
1523 | */ |
1704 | tmp = is_player_inv (op->env); |
1524 | tmp = op->in_player (); |
1705 | /* nope. Is this a container the player has opened? |
1525 | /* nope. Is this a container the player has opened? |
1706 | * If so, set tmp to that player. |
1526 | * If so, set tmp to that player. |
1707 | * IMO, searching through all the players will mostly |
1527 | * IMO, searching through all the players will mostly |
1708 | * likely be quicker than following op->env to the map, |
1528 | * likely be quicker than following op->env to the map, |
1709 | * and then searching the map for a player. |
1529 | * and then searching the map for a player. |
1710 | */ |
1530 | */ |
1711 | if (!tmp) |
1531 | if (!tmp) |
1712 | { |
1532 | for_all_players (pl) |
1713 | for (pl = first_player; pl; pl = pl->next) |
|
|
1714 | if (pl->ob->container == op->env) |
1533 | if (pl->ob->container == op->env) |
|
|
1534 | { |
|
|
1535 | tmp = pl->ob; |
1715 | break; |
1536 | break; |
1716 | if (pl) |
|
|
1717 | tmp = pl->ob; |
|
|
1718 | else |
|
|
1719 | tmp = NULL; |
|
|
1720 | } |
1537 | } |
1721 | |
1538 | |
1722 | if (i < op->nrof) |
1539 | if (i < op->nrof) |
1723 | { |
1540 | { |
1724 | sub_weight (op->env, op->weight * i); |
1541 | sub_weight (op->env, op->weight * i); |
1725 | op->nrof -= i; |
1542 | op->nrof -= i; |
1726 | if (tmp) |
1543 | if (tmp) |
1727 | { |
|
|
1728 | esrv_send_item (tmp, op); |
1544 | esrv_send_item (tmp, op); |
1729 | } |
|
|
1730 | } |
1545 | } |
1731 | else |
1546 | else |
1732 | { |
1547 | { |
1733 | remove_ob (op); |
1548 | op->remove (); |
1734 | op->nrof = 0; |
1549 | op->nrof = 0; |
1735 | if (tmp) |
1550 | if (tmp) |
1736 | { |
|
|
1737 | esrv_del_item (tmp->contr, op->count); |
1551 | esrv_del_item (tmp->contr, op->count); |
1738 | } |
|
|
1739 | } |
1552 | } |
1740 | } |
1553 | } |
1741 | else |
1554 | else |
1742 | { |
1555 | { |
1743 | object *above = op->above; |
1556 | object *above = op->above; |
1744 | |
1557 | |
1745 | if (i < op->nrof) |
1558 | if (i < op->nrof) |
1746 | op->nrof -= i; |
1559 | op->nrof -= i; |
1747 | else |
1560 | else |
1748 | { |
1561 | { |
1749 | remove_ob (op); |
1562 | op->remove (); |
1750 | op->nrof = 0; |
1563 | op->nrof = 0; |
1751 | } |
1564 | } |
1752 | |
1565 | |
1753 | /* Since we just removed op, op->above is null */ |
1566 | /* Since we just removed op, op->above is null */ |
1754 | for (tmp = above; tmp != NULL; tmp = tmp->above) |
1567 | for (tmp = above; tmp; tmp = tmp->above) |
1755 | if (tmp->type == PLAYER) |
1568 | if (tmp->type == PLAYER) |
1756 | { |
1569 | { |
1757 | if (op->nrof) |
1570 | if (op->nrof) |
1758 | esrv_send_item (tmp, op); |
1571 | esrv_send_item (tmp, op); |
1759 | else |
1572 | else |
… | |
… | |
1763 | |
1576 | |
1764 | if (op->nrof) |
1577 | if (op->nrof) |
1765 | return op; |
1578 | return op; |
1766 | else |
1579 | else |
1767 | { |
1580 | { |
1768 | free_object (op); |
1581 | op->destroy (); |
1769 | return NULL; |
1582 | return 0; |
1770 | } |
1583 | } |
1771 | } |
1584 | } |
1772 | |
1585 | |
1773 | /* |
1586 | /* |
1774 | * add_weight(object, weight) adds the specified weight to an object, |
1587 | * add_weight(object, weight) adds the specified weight to an object, |
… | |
… | |
1786 | op->carrying += weight; |
1599 | op->carrying += weight; |
1787 | op = op->env; |
1600 | op = op->env; |
1788 | } |
1601 | } |
1789 | } |
1602 | } |
1790 | |
1603 | |
|
|
1604 | object * |
|
|
1605 | insert_ob_in_ob (object *op, object *where) |
|
|
1606 | { |
|
|
1607 | if (!where) |
|
|
1608 | { |
|
|
1609 | char *dump = dump_object (op); |
|
|
1610 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
|
|
1611 | free (dump); |
|
|
1612 | return op; |
|
|
1613 | } |
|
|
1614 | |
|
|
1615 | if (where->head) |
|
|
1616 | { |
|
|
1617 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
|
|
1618 | where = where->head; |
|
|
1619 | } |
|
|
1620 | |
|
|
1621 | return where->insert (op); |
|
|
1622 | } |
|
|
1623 | |
1791 | /* |
1624 | /* |
1792 | * insert_ob_in_ob(op,environment): |
1625 | * env->insert (op) |
1793 | * This function inserts the object op in the linked list |
1626 | * This function inserts the object op in the linked list |
1794 | * inside the object environment. |
1627 | * inside the object environment. |
1795 | * |
1628 | * |
1796 | * Eneq(@csd.uu.se): Altered insert_ob_in_ob to make things picked up enter |
|
|
1797 | * the inventory at the last position or next to other objects of the same |
|
|
1798 | * type. |
|
|
1799 | * Frank: Now sorted by type, archetype and magic! |
|
|
1800 | * |
|
|
1801 | * The function returns now pointer to inserted item, and return value can |
1629 | * The function returns now pointer to inserted item, and return value can |
1802 | * be != op, if items are merged. -Tero |
1630 | * be != op, if items are merged. -Tero |
1803 | */ |
1631 | */ |
1804 | |
1632 | |
1805 | object * |
1633 | object * |
1806 | insert_ob_in_ob (object *op, object *where) |
1634 | object::insert (object *op) |
1807 | { |
1635 | { |
1808 | object * |
1636 | object *tmp, *otmp; |
1809 | tmp, * |
|
|
1810 | otmp; |
|
|
1811 | |
1637 | |
1812 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1638 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1813 | { |
1639 | op->remove (); |
1814 | dump_object (op); |
|
|
1815 | LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg); |
|
|
1816 | return op; |
|
|
1817 | } |
|
|
1818 | |
|
|
1819 | if (where == NULL) |
|
|
1820 | { |
|
|
1821 | dump_object (op); |
|
|
1822 | LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg); |
|
|
1823 | return op; |
|
|
1824 | } |
|
|
1825 | |
|
|
1826 | if (where->head) |
|
|
1827 | { |
|
|
1828 | LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n"); |
|
|
1829 | where = where->head; |
|
|
1830 | } |
|
|
1831 | |
1640 | |
1832 | if (op->more) |
1641 | if (op->more) |
1833 | { |
1642 | { |
1834 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1643 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1835 | return op; |
1644 | return op; |
… | |
… | |
1837 | |
1646 | |
1838 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1647 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1839 | CLEAR_FLAG (op, FLAG_REMOVED); |
1648 | CLEAR_FLAG (op, FLAG_REMOVED); |
1840 | if (op->nrof) |
1649 | if (op->nrof) |
1841 | { |
1650 | { |
1842 | for (tmp = where->inv; tmp != NULL; tmp = tmp->below) |
1651 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1843 | if (CAN_MERGE (tmp, op)) |
1652 | if (object::can_merge (tmp, op)) |
1844 | { |
1653 | { |
1845 | /* return the original object and remove inserted object |
1654 | /* return the original object and remove inserted object |
1846 | (client needs the original object) */ |
1655 | (client needs the original object) */ |
1847 | tmp->nrof += op->nrof; |
1656 | tmp->nrof += op->nrof; |
1848 | /* Weight handling gets pretty funky. Since we are adding to |
1657 | /* Weight handling gets pretty funky. Since we are adding to |
1849 | * tmp->nrof, we need to increase the weight. |
1658 | * tmp->nrof, we need to increase the weight. |
1850 | */ |
1659 | */ |
1851 | add_weight (where, op->weight * op->nrof); |
1660 | add_weight (this, op->weight * op->nrof); |
1852 | SET_FLAG (op, FLAG_REMOVED); |
1661 | SET_FLAG (op, FLAG_REMOVED); |
1853 | free_object (op); /* free the inserted object */ |
1662 | op->destroy (); /* free the inserted object */ |
1854 | op = tmp; |
1663 | op = tmp; |
1855 | remove_ob (op); /* and fix old object's links */ |
1664 | op->remove (); /* and fix old object's links */ |
1856 | CLEAR_FLAG (op, FLAG_REMOVED); |
1665 | CLEAR_FLAG (op, FLAG_REMOVED); |
1857 | break; |
1666 | break; |
1858 | } |
1667 | } |
1859 | |
1668 | |
1860 | /* I assume combined objects have no inventory |
1669 | /* I assume combined objects have no inventory |
1861 | * We add the weight - this object could have just been removed |
1670 | * We add the weight - this object could have just been removed |
1862 | * (if it was possible to merge). calling remove_ob will subtract |
1671 | * (if it was possible to merge). calling remove_ob will subtract |
1863 | * the weight, so we need to add it in again, since we actually do |
1672 | * the weight, so we need to add it in again, since we actually do |
1864 | * the linking below |
1673 | * the linking below |
1865 | */ |
1674 | */ |
1866 | add_weight (where, op->weight * op->nrof); |
1675 | add_weight (this, op->weight * op->nrof); |
1867 | } |
1676 | } |
1868 | else |
1677 | else |
1869 | add_weight (where, (op->weight + op->carrying)); |
1678 | add_weight (this, (op->weight + op->carrying)); |
1870 | |
1679 | |
1871 | otmp = is_player_inv (where); |
1680 | otmp = this->in_player (); |
1872 | if (otmp && otmp->contr != NULL) |
1681 | if (otmp && otmp->contr) |
1873 | { |
|
|
1874 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1682 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1875 | fix_player (otmp); |
1683 | otmp->update_stats (); |
1876 | } |
|
|
1877 | |
1684 | |
1878 | op->map = NULL; |
1685 | op->map = 0; |
1879 | op->env = where; |
1686 | op->env = this; |
1880 | op->above = NULL; |
1687 | op->above = 0; |
1881 | op->below = NULL; |
1688 | op->below = 0; |
1882 | op->x = 0, op->y = 0; |
1689 | op->x = 0, op->y = 0; |
1883 | |
1690 | |
1884 | /* reset the light list and los of the players on the map */ |
1691 | /* reset the light list and los of the players on the map */ |
1885 | if ((op->glow_radius != 0) && where->map) |
1692 | if ((op->glow_radius != 0) && map) |
1886 | { |
1693 | { |
1887 | #ifdef DEBUG_LIGHTS |
1694 | #ifdef DEBUG_LIGHTS |
1888 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1695 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1889 | #endif /* DEBUG_LIGHTS */ |
1696 | #endif /* DEBUG_LIGHTS */ |
1890 | if (MAP_DARKNESS (where->map)) |
1697 | if (MAP_DARKNESS (map)) |
1891 | update_all_los (where->map, where->x, where->y); |
1698 | update_all_los (map, x, y); |
1892 | } |
1699 | } |
1893 | |
1700 | |
1894 | /* Client has no idea of ordering so lets not bother ordering it here. |
1701 | /* Client has no idea of ordering so lets not bother ordering it here. |
1895 | * It sure simplifies this function... |
1702 | * It sure simplifies this function... |
1896 | */ |
1703 | */ |
1897 | if (where->inv == NULL) |
1704 | if (!inv) |
1898 | where->inv = op; |
1705 | inv = op; |
1899 | else |
1706 | else |
1900 | { |
1707 | { |
1901 | op->below = where->inv; |
1708 | op->below = inv; |
1902 | op->below->above = op; |
1709 | op->below->above = op; |
1903 | where->inv = op; |
1710 | inv = op; |
1904 | } |
1711 | } |
|
|
1712 | |
1905 | return op; |
1713 | return op; |
1906 | } |
1714 | } |
1907 | |
1715 | |
1908 | /* |
1716 | /* |
1909 | * Checks if any objects has a move_type that matches objects |
1717 | * Checks if any objects has a move_type that matches objects |
… | |
… | |
2222 | * if the space being examined only has a wall to the north and empty |
2030 | * if the space being examined only has a wall to the north and empty |
2223 | * spaces in all the other directions, this will reduce the search space |
2031 | * spaces in all the other directions, this will reduce the search space |
2224 | * to only the spaces immediately surrounding the target area, and |
2032 | * to only the spaces immediately surrounding the target area, and |
2225 | * won't look 2 spaces south of the target space. |
2033 | * won't look 2 spaces south of the target space. |
2226 | */ |
2034 | */ |
2227 | else if ((flag & AB_NO_PASS) && maxfree[i] < stop) |
2035 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
2228 | stop = maxfree[i]; |
2036 | stop = maxfree[i]; |
2229 | } |
2037 | } |
|
|
2038 | |
2230 | if (!index) |
2039 | if (!index) |
2231 | return -1; |
2040 | return -1; |
|
|
2041 | |
2232 | return altern[RANDOM () % index]; |
2042 | return altern[RANDOM () % index]; |
2233 | } |
2043 | } |
2234 | |
2044 | |
2235 | /* |
2045 | /* |
2236 | * find_first_free_spot(archetype, maptile, x, y) works like |
2046 | * find_first_free_spot(archetype, maptile, x, y) works like |
… | |
… | |
2344 | mp = m; |
2154 | mp = m; |
2345 | nx = x + freearr_x[i]; |
2155 | nx = x + freearr_x[i]; |
2346 | ny = y + freearr_y[i]; |
2156 | ny = y + freearr_y[i]; |
2347 | |
2157 | |
2348 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
2158 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
|
|
2159 | |
2349 | if (mflags & P_OUT_OF_MAP) |
2160 | if (mflags & P_OUT_OF_MAP) |
2350 | { |
|
|
2351 | max = maxfree[i]; |
2161 | max = maxfree[i]; |
2352 | } |
|
|
2353 | else |
2162 | else |
2354 | { |
2163 | { |
2355 | blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); |
2164 | blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny); |
2356 | |
2165 | |
2357 | if ((move_type & blocked) == move_type) |
2166 | if ((move_type & blocked) == move_type) |
2358 | { |
|
|
2359 | max = maxfree[i]; |
2167 | max = maxfree[i]; |
2360 | } |
|
|
2361 | else if (mflags & P_IS_ALIVE) |
2168 | else if (mflags & P_IS_ALIVE) |
2362 | { |
2169 | { |
2363 | for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above) |
2170 | for (tmp = GET_MAP_OB (mp, nx, ny); tmp; tmp = tmp->above) |
2364 | { |
|
|
2365 | if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2171 | if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2366 | { |
|
|
2367 | break; |
2172 | break; |
2368 | } |
2173 | |
2369 | } |
|
|
2370 | if (tmp) |
2174 | if (tmp) |
2371 | { |
|
|
2372 | return freedir[i]; |
2175 | return freedir[i]; |
2373 | } |
|
|
2374 | } |
2176 | } |
2375 | } |
2177 | } |
2376 | } |
2178 | } |
|
|
2179 | |
2377 | return 0; |
2180 | return 0; |
2378 | } |
2181 | } |
2379 | |
2182 | |
2380 | /* |
2183 | /* |
2381 | * distance(object 1, object 2) will return the square of the |
2184 | * distance(object 1, object 2) will return the square of the |
… | |
… | |
2383 | */ |
2186 | */ |
2384 | |
2187 | |
2385 | int |
2188 | int |
2386 | distance (const object *ob1, const object *ob2) |
2189 | distance (const object *ob1, const object *ob2) |
2387 | { |
2190 | { |
2388 | int |
2191 | int i; |
2389 | i; |
|
|
2390 | |
2192 | |
2391 | i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2193 | i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2392 | return i; |
2194 | return i; |
2393 | } |
2195 | } |
2394 | |
2196 | |
… | |
… | |
2399 | */ |
2201 | */ |
2400 | |
2202 | |
2401 | int |
2203 | int |
2402 | find_dir_2 (int x, int y) |
2204 | find_dir_2 (int x, int y) |
2403 | { |
2205 | { |
2404 | int |
2206 | int q; |
2405 | q; |
|
|
2406 | |
2207 | |
2407 | if (y) |
2208 | if (y) |
2408 | q = x * 100 / y; |
2209 | q = x * 100 / y; |
2409 | else if (x) |
2210 | else if (x) |
2410 | q = -300 * x; |
2211 | q = -300 * x; |
… | |
… | |
2536 | * find a path to that monster that we found. If not, |
2337 | * find a path to that monster that we found. If not, |
2537 | * we don't bother going toward it. Returns 1 if we |
2338 | * we don't bother going toward it. Returns 1 if we |
2538 | * can see a direct way to get it |
2339 | * can see a direct way to get it |
2539 | * Modified to be map tile aware -.MSW |
2340 | * Modified to be map tile aware -.MSW |
2540 | */ |
2341 | */ |
2541 | |
|
|
2542 | |
|
|
2543 | int |
2342 | int |
2544 | can_see_monsterP (maptile *m, int x, int y, int dir) |
2343 | can_see_monsterP (maptile *m, int x, int y, int dir) |
2545 | { |
2344 | { |
2546 | sint16 dx, dy; |
2345 | sint16 dx, dy; |
2547 | int |
|
|
2548 | mflags; |
2346 | int mflags; |
2549 | |
2347 | |
2550 | if (dir < 0) |
2348 | if (dir < 0) |
2551 | return 0; /* exit condition: invalid direction */ |
2349 | return 0; /* exit condition: invalid direction */ |
2552 | |
2350 | |
2553 | dx = x + freearr_x[dir]; |
2351 | dx = x + freearr_x[dir]; |
… | |
… | |
2566 | return 0; |
2364 | return 0; |
2567 | |
2365 | |
2568 | /* yes, can see. */ |
2366 | /* yes, can see. */ |
2569 | if (dir < 9) |
2367 | if (dir < 9) |
2570 | return 1; |
2368 | return 1; |
|
|
2369 | |
2571 | return can_see_monsterP (m, x, y, reduction_dir[dir][0]) | |
2370 | return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |
2572 | can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]); |
2371 | | can_see_monsterP (m, x, y, reduction_dir[dir][1]) |
|
|
2372 | | can_see_monsterP (m, x, y, reduction_dir[dir][2]); |
2573 | } |
2373 | } |
2574 | |
|
|
2575 | |
|
|
2576 | |
2374 | |
2577 | /* |
2375 | /* |
2578 | * can_pick(picker, item): finds out if an object is possible to be |
2376 | * can_pick(picker, item): finds out if an object is possible to be |
2579 | * picked up by the picker. Returnes 1 if it can be |
2377 | * picked up by the picker. Returnes 1 if it can be |
2580 | * picked up, otherwise 0. |
2378 | * picked up, otherwise 0. |
… | |
… | |
2591 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2389 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2592 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2390 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2593 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); |
2391 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); |
2594 | } |
2392 | } |
2595 | |
2393 | |
2596 | |
|
|
2597 | /* |
2394 | /* |
2598 | * create clone from object to another |
2395 | * create clone from object to another |
2599 | */ |
2396 | */ |
2600 | object * |
2397 | object * |
2601 | object_create_clone (object *asrc) |
2398 | object_create_clone (object *asrc) |
2602 | { |
2399 | { |
2603 | object * |
|
|
2604 | dst = NULL, *tmp, *src, *part, *prev, *item; |
2400 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2605 | |
2401 | |
2606 | if (!asrc) |
2402 | if (!asrc) |
2607 | return NULL; |
2403 | return 0; |
|
|
2404 | |
2608 | src = asrc; |
2405 | src = asrc; |
2609 | if (src->head) |
2406 | if (src->head) |
2610 | src = src->head; |
2407 | src = src->head; |
2611 | |
2408 | |
2612 | prev = NULL; |
2409 | prev = 0; |
2613 | for (part = src; part; part = part->more) |
2410 | for (part = src; part; part = part->more) |
2614 | { |
2411 | { |
2615 | tmp = get_object (); |
2412 | tmp = part->clone (); |
2616 | copy_object (part, tmp); |
|
|
2617 | tmp->x -= src->x; |
2413 | tmp->x -= src->x; |
2618 | tmp->y -= src->y; |
2414 | tmp->y -= src->y; |
|
|
2415 | |
2619 | if (!part->head) |
2416 | if (!part->head) |
2620 | { |
2417 | { |
2621 | dst = tmp; |
2418 | dst = tmp; |
2622 | tmp->head = NULL; |
2419 | tmp->head = 0; |
2623 | } |
2420 | } |
2624 | else |
2421 | else |
2625 | { |
|
|
2626 | tmp->head = dst; |
2422 | tmp->head = dst; |
2627 | } |
2423 | |
2628 | tmp->more = NULL; |
2424 | tmp->more = 0; |
|
|
2425 | |
2629 | if (prev) |
2426 | if (prev) |
2630 | prev->more = tmp; |
2427 | prev->more = tmp; |
|
|
2428 | |
2631 | prev = tmp; |
2429 | prev = tmp; |
2632 | } |
2430 | } |
2633 | |
2431 | |
2634 | for (item = src->inv; item; item = item->below) |
2432 | for (item = src->inv; item; item = item->below) |
2635 | insert_ob_in_ob (object_create_clone (item), dst); |
2433 | insert_ob_in_ob (object_create_clone (item), dst); |
… | |
… | |
2661 | } |
2459 | } |
2662 | |
2460 | |
2663 | fprintf (tempfile, obstr); |
2461 | fprintf (tempfile, obstr); |
2664 | fclose (tempfile); |
2462 | fclose (tempfile); |
2665 | |
2463 | |
2666 | op = get_object (); |
2464 | op = object::create (); |
2667 | |
2465 | |
2668 | object_thawer thawer (filename); |
2466 | object_thawer thawer (filename); |
2669 | |
2467 | |
2670 | if (thawer) |
2468 | if (thawer) |
2671 | load_object (thawer, op, 0); |
2469 | load_object (thawer, op, 0); |