1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * option) any later version. |
… | |
… | |
26 | #include <stdio.h> |
26 | #include <stdio.h> |
27 | #include <sys/types.h> |
27 | #include <sys/types.h> |
28 | #include <sys/uio.h> |
28 | #include <sys/uio.h> |
29 | #include <object.h> |
29 | #include <object.h> |
30 | #include <sproto.h> |
30 | #include <sproto.h> |
31 | #include <loader.h> |
|
|
32 | |
31 | |
33 | #include <bitset> |
32 | #include <bitset> |
34 | |
33 | |
35 | UUID UUID::cur; |
34 | UUID UUID::cur; |
36 | static uint64_t seq_next_save; |
35 | static uint64_t seq_next_save; |
37 | static const uint64 UUID_GAP = 1<<19; |
36 | static const uint64 UUID_GAP = 1<<19; |
38 | uint32_t mapspace::smellcount = 10000; |
37 | uint32_t mapspace::smellcount = 10000; |
39 | |
38 | |
40 | objectvec objects; |
39 | objectvec objects; |
41 | activevec actives; |
40 | activevec actives; |
|
|
41 | |
|
|
42 | freelist_item *object::freelist; |
|
|
43 | uint32_t object::object_count; |
|
|
44 | uint32_t object::free_count; |
|
|
45 | uint32_t object::create_count; |
|
|
46 | uint32_t object::destroy_count; |
42 | |
47 | |
43 | //+GPL |
48 | //+GPL |
44 | |
49 | |
45 | short freearr_x[SIZEOFFREE] = { |
50 | short freearr_x[SIZEOFFREE] = { |
46 | 0, |
51 | 0, |
… | |
… | |
77 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
82 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
78 | CALL_END; |
83 | CALL_END; |
79 | } |
84 | } |
80 | |
85 | |
81 | static void |
86 | static void |
82 | read_uuid (void) |
87 | read_uuid () |
83 | { |
88 | { |
84 | char filename[MAX_BUF]; |
89 | char filename[MAX_BUF]; |
85 | |
90 | |
86 | sprintf (filename, "%s/uuid", settings.localdir); |
91 | sprintf (filename, "%s/uuid", settings.localdir); |
87 | |
92 | |
… | |
… | |
101 | |
106 | |
102 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
107 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
103 | _exit (1); |
108 | _exit (1); |
104 | } |
109 | } |
105 | |
110 | |
106 | UUID::BUF buf; |
111 | char buf [UUID::MAX_LEN]; |
107 | buf[0] = 0; |
112 | buf[0] = 0; |
108 | fgets (buf, sizeof (buf), fp); |
113 | fgets (buf, sizeof (buf), fp); |
109 | |
114 | |
110 | if (!UUID::cur.parse (buf)) |
115 | if (!UUID::cur.parse (buf)) |
111 | { |
116 | { |
… | |
… | |
138 | |
143 | |
139 | void |
144 | void |
140 | UUID::init () |
145 | UUID::init () |
141 | { |
146 | { |
142 | read_uuid (); |
147 | read_uuid (); |
|
|
148 | } |
|
|
149 | |
|
|
150 | bool |
|
|
151 | UUID::parse (const char *s) |
|
|
152 | { |
|
|
153 | if (*s++ != '<' || *s++ != '1' || *s++ != '.') |
|
|
154 | return false; |
|
|
155 | |
|
|
156 | seq = 0; |
|
|
157 | |
|
|
158 | while (*s != '>') |
|
|
159 | { |
|
|
160 | if (*s < '0') |
|
|
161 | return false; |
|
|
162 | |
|
|
163 | // this gives nice branchless code with gcc |
|
|
164 | assert ('0' < 'a' && '0' == 48 && 'a' == 97); |
|
|
165 | int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15; |
|
|
166 | |
|
|
167 | seq = (seq << 4) | digit; |
|
|
168 | |
|
|
169 | ++s; |
|
|
170 | } |
|
|
171 | |
|
|
172 | return true; |
|
|
173 | } |
|
|
174 | |
|
|
175 | char * |
|
|
176 | UUID::append (char *buf) const |
|
|
177 | { |
|
|
178 | *buf++ = '<'; |
|
|
179 | *buf++ = '1'; |
|
|
180 | *buf++ = '.'; |
|
|
181 | |
|
|
182 | uint64_t seq = this->seq; |
|
|
183 | const int bits = 64; |
|
|
184 | char nz = 0; |
|
|
185 | static const char tohex [] = "0123456789abcdef"; |
|
|
186 | |
|
|
187 | // assert (len >= 3 + bits / 4 + 1 + 1); |
|
|
188 | for (int i = bits / 4; --i; ) |
|
|
189 | { |
|
|
190 | uint8_t digit = seq >> (bits - 4); |
|
|
191 | |
|
|
192 | *buf = tohex [digit]; |
|
|
193 | nz |= digit; |
|
|
194 | buf += nz ? 1 : 0; |
|
|
195 | seq <<= 4; |
|
|
196 | } |
|
|
197 | |
|
|
198 | // last digit is special - always emit |
|
|
199 | uint8_t digit = seq >> (bits - 4); |
|
|
200 | *buf++ = tohex [digit]; |
|
|
201 | |
|
|
202 | *buf++ = '>'; |
|
|
203 | |
|
|
204 | return buf; |
|
|
205 | } |
|
|
206 | |
|
|
207 | char * |
|
|
208 | UUID::c_str () const |
|
|
209 | { |
|
|
210 | static char buf [MAX_LEN]; |
|
|
211 | *append (buf) = 0; |
|
|
212 | return buf; |
143 | } |
213 | } |
144 | |
214 | |
145 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
215 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
146 | static bool |
216 | static bool |
147 | compare_ob_value_lists_one (const object *wants, const object *has) |
217 | compare_ob_value_lists_one (const object *wants, const object *has) |
… | |
… | |
183 | * Improvements made with merge: Better checking on potion, and also |
253 | * Improvements made with merge: Better checking on potion, and also |
184 | * check weight |
254 | * check weight |
185 | */ |
255 | */ |
186 | bool object::can_merge_slow (object *ob1, object *ob2) |
256 | bool object::can_merge_slow (object *ob1, object *ob2) |
187 | { |
257 | { |
188 | /* A couple quicksanity checks */ |
258 | /* A couple quick sanity checks */ |
189 | if (ob1 == ob2 |
259 | if (ob1 == ob2 |
190 | || ob1->type != ob2->type |
260 | || ob1->type != ob2->type |
191 | || ob1->speed != ob2->speed |
|
|
192 | || ob1->value != ob2->value |
261 | || ob1->value != ob2->value |
193 | || ob1->name != ob2->name) |
262 | || ob1->name != ob2->name |
|
|
263 | || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED) |
194 | return 0; |
264 | return 0; |
195 | |
265 | |
196 | /* Do not merge objects if nrof would overflow, assume nrof |
266 | /* Do not merge objects if nrof would overflow, assume nrof |
197 | * is always 0 .. 2**31-1 */ |
267 | * is always 0 .. 2**31-1 */ |
198 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
268 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
… | |
… | |
202 | * This is to the comparison of the flags below will be OK. We |
272 | * This is to the comparison of the flags below will be OK. We |
203 | * just can't ignore the been applied or identified flags, as they |
273 | * just can't ignore the been applied or identified flags, as they |
204 | * are not equal - just if it has been identified, the been_applied |
274 | * are not equal - just if it has been identified, the been_applied |
205 | * flags lose any meaning. |
275 | * flags lose any meaning. |
206 | */ |
276 | */ |
207 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
277 | if (ob1->flag [FLAG_IDENTIFIED]) |
208 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
278 | ob1->set_flag (FLAG_BEEN_APPLIED); |
209 | |
279 | |
210 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
280 | if (ob2->flag [FLAG_IDENTIFIED]) |
211 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
281 | ob2->set_flag (FLAG_BEEN_APPLIED); |
212 | |
282 | |
213 | if (ob1->arch->archname != ob2->arch->archname |
283 | if (ob1->arch->archname != ob2->arch->archname |
214 | || ob1->name != ob2->name |
284 | || ob1->name != ob2->name |
215 | || ob1->title != ob2->title |
285 | || ob1->title != ob2->title |
216 | || ob1->msg != ob2->msg |
286 | || ob1->msg != ob2->msg |
… | |
… | |
219 | || ob1->magic != ob2->magic |
289 | || ob1->magic != ob2->magic |
220 | || ob1->slaying != ob2->slaying |
290 | || ob1->slaying != ob2->slaying |
221 | || ob1->skill != ob2->skill |
291 | || ob1->skill != ob2->skill |
222 | || ob1->value != ob2->value |
292 | || ob1->value != ob2->value |
223 | || ob1->animation_id != ob2->animation_id |
293 | || ob1->animation_id != ob2->animation_id |
224 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other |
294 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other |
225 | || ob1->client_type != ob2->client_type |
295 | || ob1->client_type != ob2->client_type |
226 | || ob1->materialname != ob2->materialname |
296 | || ob1->material != ob2->material |
227 | || ob1->lore != ob2->lore |
297 | || ob1->lore != ob2->lore |
228 | || ob1->subtype != ob2->subtype |
298 | || ob1->subtype != ob2->subtype |
229 | || ob1->move_type != ob2->move_type |
299 | || ob1->move_type != ob2->move_type |
230 | || ob1->move_block != ob2->move_block |
300 | || ob1->move_block != ob2->move_block |
231 | || ob1->move_allow != ob2->move_allow |
301 | || ob1->move_allow != ob2->move_allow |
232 | || ob1->move_on != ob2->move_on |
302 | || ob1->move_on != ob2->move_on |
233 | || ob1->move_off != ob2->move_off |
303 | || ob1->move_off != ob2->move_off |
234 | || ob1->move_slow != ob2->move_slow |
304 | || ob1->move_slow != ob2->move_slow |
235 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
305 | || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f) |
236 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
306 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
237 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
307 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
238 | return 0; |
308 | return 0; |
239 | |
309 | |
240 | if ((ob1->flag ^ ob2->flag) |
310 | if ((ob1->flag ^ ob2->flag) |
… | |
… | |
265 | |
335 | |
266 | /* Don't merge objects that are applied. With the new 'body' code, |
336 | /* Don't merge objects that are applied. With the new 'body' code, |
267 | * it is possible for most any character to have more than one of |
337 | * it is possible for most any character to have more than one of |
268 | * some items equipped, and we don't want those to merge. |
338 | * some items equipped, and we don't want those to merge. |
269 | */ |
339 | */ |
270 | if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED)) |
340 | if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED]) |
271 | return 0; |
341 | return 0; |
272 | |
342 | |
273 | /* Note sure why the following is the case - either the object has to |
343 | /* Note sure why the following is the case - either the object has to |
274 | * be animated or have a very low speed. Is this an attempted monster |
344 | * be animated or have a very low speed. Is this an attempted monster |
275 | * check? |
345 | * check? |
276 | */ |
346 | */ |
277 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
347 | if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ()) |
278 | return 0; |
348 | return 0; |
279 | |
349 | |
280 | switch (ob1->type) |
350 | switch (ob1->type) |
281 | { |
351 | { |
282 | case SCROLL: |
352 | case SCROLL: |
… | |
… | |
413 | |
483 | |
414 | sum = weight_adjust_for (this, sum); |
484 | sum = weight_adjust_for (this, sum); |
415 | |
485 | |
416 | if (sum != carrying) |
486 | if (sum != carrying) |
417 | { |
487 | { |
|
|
488 | if (carrying != sum)//D |
|
|
489 | LOG (llevDebug, "updating weight got %ld, expected %ld (%s)\n", |
|
|
490 | (long long)sum, (long long)carrying, debug_desc ()); |
|
|
491 | |
418 | carrying = sum; |
492 | carrying = sum; |
419 | |
493 | |
420 | if (object *pl = visible_to ()) |
494 | if (object *pl = visible_to ()) |
421 | if (pl != this) // player is handled lazily |
495 | if (pl != this) // player is handled lazily |
422 | esrv_update_item (UPD_WEIGHT, pl, this); |
496 | esrv_update_item (UPD_WEIGHT, pl, this); |
… | |
… | |
442 | { |
516 | { |
443 | return dump_object (this); |
517 | return dump_object (this); |
444 | } |
518 | } |
445 | |
519 | |
446 | /* |
520 | /* |
447 | * get_nearest_part(multi-object, object 2) returns the part of the |
|
|
448 | * multi-object 1 which is closest to the second object. |
|
|
449 | * If it's not a multi-object, it is returned. |
|
|
450 | */ |
|
|
451 | static object * |
|
|
452 | get_nearest_part (object *op, const object *pl) |
|
|
453 | { |
|
|
454 | object *tmp, *closest; |
|
|
455 | int last_dist, i; |
|
|
456 | |
|
|
457 | if (!op->more) |
|
|
458 | return op; |
|
|
459 | |
|
|
460 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
461 | tmp; |
|
|
462 | tmp = tmp->more) |
|
|
463 | if ((i = distance (tmp, pl)) < last_dist) |
|
|
464 | closest = tmp, last_dist = i; |
|
|
465 | |
|
|
466 | return closest; |
|
|
467 | } |
|
|
468 | |
|
|
469 | /* |
|
|
470 | * Returns the object which has the count-variable equal to the argument. |
521 | * Returns the object which has the count-variable equal to the argument. |
471 | * VERRRY slow. |
522 | * VERRRY slow. |
472 | */ |
523 | */ |
473 | object * |
524 | object * |
474 | find_object (tag_t i) |
525 | find_object (tag_t i) |
475 | { |
526 | { |
476 | for_all_objects (op) |
527 | for_all_objects (op) |
477 | if (op->count == i) |
528 | if (op->count == i) |
|
|
529 | return op; |
|
|
530 | |
|
|
531 | return 0; |
|
|
532 | } |
|
|
533 | |
|
|
534 | /* |
|
|
535 | * Returns the object which has the uuid equal to the argument. |
|
|
536 | * MOAR VERRRY slow. |
|
|
537 | */ |
|
|
538 | |
|
|
539 | object * |
|
|
540 | find_object_uuid (UUID i) |
|
|
541 | { |
|
|
542 | for_all_objects (op) |
|
|
543 | if (op->uuid == i) |
478 | return op; |
544 | return op; |
479 | |
545 | |
480 | return 0; |
546 | return 0; |
481 | } |
547 | } |
482 | |
548 | |
… | |
… | |
516 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
582 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
517 | return; |
583 | return; |
518 | } |
584 | } |
519 | |
585 | |
520 | this->owner = owner; |
586 | this->owner = owner; |
521 | } |
|
|
522 | |
|
|
523 | int |
|
|
524 | object::slottype () const |
|
|
525 | { |
|
|
526 | if (type == SKILL) |
|
|
527 | { |
|
|
528 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
529 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
530 | } |
|
|
531 | else |
|
|
532 | { |
|
|
533 | if (slot [body_combat].info) return slot_combat; |
|
|
534 | if (slot [body_range ].info) return slot_ranged; |
|
|
535 | } |
|
|
536 | |
|
|
537 | return slot_none; |
|
|
538 | } |
|
|
539 | |
|
|
540 | bool |
|
|
541 | object::change_weapon (object *ob) |
|
|
542 | { |
|
|
543 | if (current_weapon == ob) |
|
|
544 | return true; |
|
|
545 | |
|
|
546 | if (chosen_skill) |
|
|
547 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
548 | |
|
|
549 | current_weapon = ob; |
|
|
550 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
551 | |
|
|
552 | if (chosen_skill) |
|
|
553 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
554 | |
|
|
555 | update_stats (); |
|
|
556 | |
|
|
557 | if (ob) |
|
|
558 | { |
|
|
559 | // now check wether any body locations became invalid, in which case |
|
|
560 | // we cannot apply the weapon at the moment. |
|
|
561 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
562 | if (slot[i].used < 0) |
|
|
563 | { |
|
|
564 | current_weapon = chosen_skill = 0; |
|
|
565 | update_stats (); |
|
|
566 | |
|
|
567 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
568 | "You try to balance all your items at once, " |
|
|
569 | "but the %s is just too much for your body. " |
|
|
570 | "[You need to unapply some items first - use the 'body' command to see " |
|
|
571 | "how many items you cna wera on a specific body part.]", &ob->name); |
|
|
572 | return false; |
|
|
573 | } |
|
|
574 | |
|
|
575 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
576 | } |
|
|
577 | else |
|
|
578 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
579 | |
|
|
580 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
581 | { |
|
|
582 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
583 | &name, ob->debug_desc ()); |
|
|
584 | return false; |
|
|
585 | } |
|
|
586 | |
|
|
587 | return true; |
|
|
588 | } |
587 | } |
589 | |
588 | |
590 | /* Zero the key_values on op, decrementing the shared-string |
589 | /* Zero the key_values on op, decrementing the shared-string |
591 | * refcounts and freeing the links. |
590 | * refcounts and freeing the links. |
592 | */ |
591 | */ |
… | |
… | |
645 | tail = new_link; |
644 | tail = new_link; |
646 | } |
645 | } |
647 | } |
646 | } |
648 | } |
647 | } |
649 | |
648 | |
650 | if (speed < 0) |
|
|
651 | dst->speed_left -= rndm (); |
|
|
652 | |
|
|
653 | dst->activate (); |
649 | dst->activate (); |
654 | } |
650 | } |
655 | |
651 | |
656 | void |
652 | void |
657 | object::instantiate () |
653 | object::instantiate () |
658 | { |
654 | { |
659 | if (!uuid.seq) // HACK |
655 | if (!uuid.seq) // HACK |
660 | uuid = UUID::gen (); |
656 | uuid = UUID::gen (); |
661 | |
657 | |
|
|
658 | // TODO: unclean state changes, should nt be done in copy_to AND instantiate |
|
|
659 | if (flag [FLAG_RANDOM_SPEED] && speed) |
|
|
660 | speed_left = - speed - rndm (); // TODO animation |
|
|
661 | else |
662 | speed_left = -0.1f; |
662 | speed_left = -1.; |
|
|
663 | |
663 | /* copy the body_info to the body_used - this is only really |
664 | /* copy the body_info to the body_used - this is only really |
664 | * need for monsters, but doesn't hurt to do it for everything. |
665 | * need for monsters, but doesn't hurt to do it for everything. |
665 | * by doing so, when a monster is created, it has good starting |
666 | * by doing so, when a monster is created, it has good starting |
666 | * values for the body_used info, so when items are created |
667 | * values for the body_used info, so when items are created |
667 | * for it, they can be properly equipped. |
668 | * for it, they can be properly equipped. |
… | |
… | |
675 | object * |
676 | object * |
676 | object::clone () |
677 | object::clone () |
677 | { |
678 | { |
678 | object *neu = create (); |
679 | object *neu = create (); |
679 | copy_to (neu); |
680 | copy_to (neu); |
|
|
681 | |
|
|
682 | // TODO: unclean state changes, should not be done in clone AND instantiate |
|
|
683 | if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed) |
|
|
684 | neu->speed_left = - neu->speed - rndm (); // TODO animation |
|
|
685 | |
680 | neu->map = map; // not copied by copy_to |
686 | neu->map = map; // not copied by copy_to |
681 | return neu; |
687 | return neu; |
682 | } |
688 | } |
683 | |
689 | |
684 | /* |
690 | /* |
… | |
… | |
687 | * be called to update the face variable, _and_ how it looks on the map. |
693 | * be called to update the face variable, _and_ how it looks on the map. |
688 | */ |
694 | */ |
689 | void |
695 | void |
690 | update_turn_face (object *op) |
696 | update_turn_face (object *op) |
691 | { |
697 | { |
692 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
698 | if (!op->flag [FLAG_IS_TURNABLE] || !op->arch) |
693 | return; |
699 | return; |
694 | |
700 | |
695 | SET_ANIMATION (op, op->direction); |
701 | SET_ANIMATION (op, op->direction); |
696 | update_object (op, UP_OBJ_FACE); |
702 | update_object (op, UP_OBJ_FACE); |
697 | } |
703 | } |
… | |
… | |
702 | * This function needs to be called whenever the speed of an object changes. |
708 | * This function needs to be called whenever the speed of an object changes. |
703 | */ |
709 | */ |
704 | void |
710 | void |
705 | object::set_speed (float speed) |
711 | object::set_speed (float speed) |
706 | { |
712 | { |
707 | if (flag [FLAG_FREED] && speed) |
|
|
708 | { |
|
|
709 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
|
|
710 | speed = 0; |
|
|
711 | } |
|
|
712 | |
|
|
713 | this->speed = speed; |
713 | this->speed = speed; |
714 | |
714 | |
715 | if (has_active_speed ()) |
715 | if (has_active_speed ()) |
716 | activate (); |
716 | activate (); |
717 | else |
717 | else |
… | |
… | |
767 | |
767 | |
768 | if (!(m.flags_ & P_UPTODATE)) |
768 | if (!(m.flags_ & P_UPTODATE)) |
769 | /* nop */; |
769 | /* nop */; |
770 | else if (action == UP_OBJ_INSERT) |
770 | else if (action == UP_OBJ_INSERT) |
771 | { |
771 | { |
|
|
772 | #if 0 |
772 | // this is likely overkill, TODO: revisit (schmorp) |
773 | // this is likely overkill, TODO: revisit (schmorp) |
773 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
774 | if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW)) |
774 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
775 | || (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC)) |
775 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
776 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
776 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
777 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
777 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
778 | || (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE)) |
778 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
779 | || (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC)) |
779 | || (m.move_on | op->move_on ) != m.move_on |
780 | || (m.move_on | op->move_on ) != m.move_on |
780 | || (m.move_off | op->move_off ) != m.move_off |
781 | || (m.move_off | op->move_off ) != m.move_off |
781 | || (m.move_slow | op->move_slow) != m.move_slow |
782 | || (m.move_slow | op->move_slow) != m.move_slow |
782 | /* This isn't perfect, but I don't expect a lot of objects to |
783 | /* This isn't perfect, but I don't expect a lot of objects to |
783 | * have move_allow right now. |
784 | * have move_allow right now. |
784 | */ |
785 | */ |
785 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
786 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
786 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
|
|
787 | m.invalidate (); |
787 | m.invalidate (); |
|
|
788 | #else |
|
|
789 | // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp) |
|
|
790 | m.invalidate (); |
|
|
791 | #endif |
788 | } |
792 | } |
789 | /* if the object is being removed, we can't make intelligent |
793 | /* if the object is being removed, we can't make intelligent |
790 | * decisions, because remove_ob can't really pass the object |
794 | * decisions, because remove_ob can't really pass the object |
791 | * that is being removed. |
795 | * that is being removed. |
792 | */ |
796 | */ |
… | |
… | |
801 | update_object (op->more, action); |
805 | update_object (op->more, action); |
802 | } |
806 | } |
803 | |
807 | |
804 | object::object () |
808 | object::object () |
805 | { |
809 | { |
806 | SET_FLAG (this, FLAG_REMOVED); |
810 | this->set_flag (FLAG_REMOVED); |
807 | |
811 | |
808 | //expmul = 1.0; declared const for the time being |
812 | //expmul = 1.0; declared const for the time being |
809 | face = blank_face; |
813 | face = blank_face; |
|
|
814 | material = MATERIAL_NULL; |
810 | } |
815 | } |
811 | |
816 | |
812 | object::~object () |
817 | object::~object () |
813 | { |
818 | { |
814 | unlink (); |
819 | unlink (); |
815 | |
820 | |
816 | free_key_values (this); |
821 | free_key_values (this); |
817 | } |
822 | } |
818 | |
|
|
819 | static int object_count; |
|
|
820 | |
823 | |
821 | void object::link () |
824 | void object::link () |
822 | { |
825 | { |
823 | assert (!index);//D |
826 | assert (!index);//D |
824 | uuid = UUID::gen (); |
827 | uuid = UUID::gen (); |
825 | count = ++object_count; |
|
|
826 | |
828 | |
827 | refcnt_inc (); |
829 | refcnt_inc (); |
828 | objects.insert (this); |
830 | objects.insert (this); |
|
|
831 | |
|
|
832 | ++create_count; |
|
|
833 | |
829 | } |
834 | } |
830 | |
835 | |
831 | void object::unlink () |
836 | void object::unlink () |
832 | { |
837 | { |
833 | if (!index) |
838 | if (!index) |
834 | return; |
839 | return; |
|
|
840 | |
|
|
841 | ++destroy_count; |
835 | |
842 | |
836 | objects.erase (this); |
843 | objects.erase (this); |
837 | refcnt_dec (); |
844 | refcnt_dec (); |
838 | } |
845 | } |
839 | |
846 | |
… | |
… | |
944 | map->insert (op, x, y); |
951 | map->insert (op, x, y); |
945 | } |
952 | } |
946 | } |
953 | } |
947 | } |
954 | } |
948 | |
955 | |
|
|
956 | /* |
|
|
957 | * Remove and free all objects in the inventory of the given object. |
|
|
958 | * Unlike destroy_inv, this assumes the *this is destroyed as well |
|
|
959 | * well, so we can (and have to!) take shortcuts. |
|
|
960 | */ |
|
|
961 | void |
|
|
962 | object::destroy_inv_fast () |
|
|
963 | { |
|
|
964 | while (object *op = inv) |
|
|
965 | { |
|
|
966 | // remove from object the fast way |
|
|
967 | op->flag [FLAG_REMOVED] = true; |
|
|
968 | op->env = 0; |
|
|
969 | if ((inv = inv->below)) |
|
|
970 | inv->above = 0; |
|
|
971 | |
|
|
972 | // then destroy |
|
|
973 | op->destroy (); |
|
|
974 | } |
|
|
975 | } |
|
|
976 | |
|
|
977 | void |
|
|
978 | object::freelist_free (int count) |
|
|
979 | { |
|
|
980 | while (count-- && freelist) |
|
|
981 | { |
|
|
982 | freelist_item *next = freelist->next; |
|
|
983 | // count is being "destroyed" |
|
|
984 | |
|
|
985 | sfree ((char *)freelist, sizeof (object)); |
|
|
986 | |
|
|
987 | freelist = next; |
|
|
988 | --free_count; |
|
|
989 | } |
|
|
990 | } |
|
|
991 | |
|
|
992 | object * |
949 | object *object::create () |
993 | object::create () |
950 | { |
994 | { |
951 | object *op = new object; |
995 | object *op; |
|
|
996 | |
|
|
997 | if (freelist) |
|
|
998 | { |
|
|
999 | freelist_item li = *freelist; |
|
|
1000 | memset (freelist, 0, sizeof (object)); |
|
|
1001 | |
|
|
1002 | op = new (freelist) object; |
|
|
1003 | op->count = li.count; |
|
|
1004 | |
|
|
1005 | freelist = li.next; |
|
|
1006 | --free_count; |
|
|
1007 | } |
|
|
1008 | else |
|
|
1009 | { |
|
|
1010 | void *ni = salloc0<char> (sizeof (object)); |
|
|
1011 | |
|
|
1012 | op = new(ni) object; |
|
|
1013 | |
|
|
1014 | op->count = ++object_count; |
|
|
1015 | } |
|
|
1016 | |
952 | op->link (); |
1017 | op->link (); |
|
|
1018 | |
953 | return op; |
1019 | return op; |
954 | } |
1020 | } |
955 | |
1021 | |
|
|
1022 | void |
|
|
1023 | object::do_delete () |
|
|
1024 | { |
|
|
1025 | uint32_t count = this->count; |
|
|
1026 | |
|
|
1027 | this->~object (); |
|
|
1028 | |
|
|
1029 | freelist_item *li = (freelist_item *)this; |
|
|
1030 | li->next = freelist; |
|
|
1031 | li->count = count; |
|
|
1032 | |
|
|
1033 | freelist = li; |
|
|
1034 | ++free_count; |
|
|
1035 | } |
|
|
1036 | |
956 | static struct freed_map : maptile |
1037 | static struct freed_map : maptile |
957 | { |
1038 | { |
958 | freed_map () |
1039 | freed_map () |
|
|
1040 | : maptile (3, 3) |
959 | { |
1041 | { |
960 | path = "<freed objects map>"; |
1042 | path = "<freed objects map>"; |
961 | name = "/internal/freed_objects_map"; |
1043 | name = "/internal/freed_objects_map"; |
962 | width = 3; |
|
|
963 | height = 3; |
|
|
964 | no_drop = 1; |
1044 | no_drop = 1; |
965 | no_reset = 1; |
1045 | no_reset = 1; |
966 | |
1046 | |
967 | alloc (); |
|
|
968 | in_memory = MAP_ACTIVE; |
1047 | in_memory = MAP_ACTIVE; |
969 | } |
1048 | } |
970 | |
1049 | |
971 | ~freed_map () |
1050 | ~freed_map () |
972 | { |
1051 | { |
… | |
… | |
1023 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1102 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1024 | head->destroy (); |
1103 | head->destroy (); |
1025 | return; |
1104 | return; |
1026 | } |
1105 | } |
1027 | |
1106 | |
1028 | destroy_inv (false); |
1107 | destroy_inv_fast (); |
1029 | |
1108 | |
1030 | if (is_head ()) |
1109 | if (is_head ()) |
1031 | if (sound_destroy) |
1110 | if (sound_destroy) |
1032 | play_sound (sound_destroy); |
1111 | play_sound (sound_destroy); |
1033 | else if (flag [FLAG_MONSTER]) |
1112 | else if (flag [FLAG_MONSTER]) |
… | |
… | |
1085 | |
1164 | |
1086 | above = 0; |
1165 | above = 0; |
1087 | below = 0; |
1166 | below = 0; |
1088 | env = 0; |
1167 | env = 0; |
1089 | |
1168 | |
1090 | /* NO_FIX_PLAYER is set when a great many changes are being |
1169 | if (pl && pl->is_player ()) |
1091 | * made to players inventory. If set, avoiding the call |
|
|
1092 | * to save cpu time. |
|
|
1093 | */ |
1170 | { |
1094 | if (pl) |
1171 | if (expect_false (pl->contr->combat_ob == this)) |
1095 | if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER))) |
|
|
1096 | { |
1172 | { |
1097 | pl->update_stats (); |
1173 | pl->apply (pl->contr->combat_ob, AP_UNAPPLY); |
|
|
1174 | pl->contr->combat_ob = 0; |
|
|
1175 | if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob); |
|
|
1176 | } |
1098 | |
1177 | |
|
|
1178 | if (expect_false (pl->contr->ranged_ob == this)) |
|
|
1179 | { |
|
|
1180 | pl->apply (pl->contr->ranged_ob, AP_UNAPPLY); |
|
|
1181 | pl->contr->ranged_ob = 0; |
|
|
1182 | if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob); |
|
|
1183 | } |
|
|
1184 | |
|
|
1185 | pl->contr->queue_stats_update (); |
|
|
1186 | |
1099 | if (glow_radius && pl->is_on_map ()) |
1187 | if (expect_false (glow_radius) && pl->is_on_map ()) |
1100 | update_all_los (pl->map, pl->x, pl->y); |
1188 | update_all_los (pl->map, pl->x, pl->y); |
1101 | } |
1189 | } |
1102 | } |
1190 | } |
1103 | else if (map) |
1191 | else if (map) |
1104 | { |
1192 | { |
1105 | map->dirty = true; |
1193 | map->dirty = true; |
1106 | mapspace &ms = this->ms (); |
1194 | mapspace &ms = this->ms (); |
… | |
… | |
1124 | else if (pl->container_ () == this) |
1212 | else if (pl->container_ () == this) |
1125 | { |
1213 | { |
1126 | // removing a container should close it |
1214 | // removing a container should close it |
1127 | close_container (); |
1215 | close_container (); |
1128 | } |
1216 | } |
1129 | |
1217 | else |
1130 | esrv_del_item (pl->contr, count); |
1218 | esrv_del_item (pl->contr, count); |
1131 | } |
1219 | } |
1132 | |
1220 | |
1133 | /* link the object above us */ |
1221 | /* link the object above us */ |
1134 | // re-link, make sure compiler can easily use cmove |
1222 | // re-link, make sure compiler can easily use cmove |
1135 | *(above ? &above->below : &ms.top) = below; |
1223 | *(above ? &above->below : &ms.top) = below; |
… | |
… | |
1226 | |
1314 | |
1227 | object *prev = this; |
1315 | object *prev = this; |
1228 | |
1316 | |
1229 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1317 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1230 | { |
1318 | { |
1231 | object *op = arch_to_object (at); |
1319 | object *op = at->instance (); |
1232 | |
1320 | |
1233 | op->name = name; |
1321 | op->name = name; |
1234 | op->name_pl = name_pl; |
1322 | op->name_pl = name_pl; |
1235 | op->title = title; |
1323 | op->title = title; |
1236 | |
1324 | |
… | |
… | |
1274 | * Passing 0 for flag gives proper default values, so flag really only needs |
1362 | * Passing 0 for flag gives proper default values, so flag really only needs |
1275 | * to be set if special handling is needed. |
1363 | * to be set if special handling is needed. |
1276 | * |
1364 | * |
1277 | * Return value: |
1365 | * Return value: |
1278 | * new object if 'op' was merged with other object |
1366 | * new object if 'op' was merged with other object |
1279 | * NULL if 'op' was destroyed |
1367 | * NULL if there was an error (destroyed, blocked etc.) |
1280 | * just 'op' otherwise |
1368 | * just 'op' otherwise |
1281 | */ |
1369 | */ |
1282 | object * |
1370 | object * |
1283 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1371 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1284 | { |
1372 | { |
… | |
… | |
1321 | // from here :/ |
1409 | // from here :/ |
1322 | op->nrof += tmp->nrof; |
1410 | op->nrof += tmp->nrof; |
1323 | tmp->destroy (); |
1411 | tmp->destroy (); |
1324 | } |
1412 | } |
1325 | |
1413 | |
1326 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1414 | op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1327 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1415 | op->clr_flag (FLAG_INV_LOCKED); |
1328 | |
1416 | |
1329 | if (!QUERY_FLAG (op, FLAG_ALIVE)) |
1417 | if (!op->flag [FLAG_ALIVE]) |
1330 | CLEAR_FLAG (op, FLAG_NO_STEAL); |
1418 | op->clr_flag (FLAG_NO_STEAL); |
1331 | |
1419 | |
1332 | if (flag & INS_BELOW_ORIGINATOR) |
1420 | if (flag & INS_BELOW_ORIGINATOR) |
1333 | { |
1421 | { |
1334 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1422 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1335 | { |
1423 | { |
… | |
… | |
1370 | * when lots of spells are cast in one area. Currently, it is presumed |
1458 | * when lots of spells are cast in one area. Currently, it is presumed |
1371 | * that flying non pickable objects are spell objects. |
1459 | * that flying non pickable objects are spell objects. |
1372 | */ |
1460 | */ |
1373 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1461 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1374 | { |
1462 | { |
1375 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR)) |
1463 | if (tmp->flag [FLAG_IS_FLOOR] || tmp->flag [FLAG_OVERLAY_FLOOR]) |
1376 | floor = tmp; |
1464 | floor = tmp; |
1377 | |
1465 | |
1378 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1466 | if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR]) |
1379 | { |
1467 | { |
1380 | /* We insert above top, so we want this object below this */ |
1468 | /* We insert above top, so we want this object below this */ |
1381 | top = tmp->below; |
1469 | top = tmp->below; |
1382 | break; |
1470 | break; |
1383 | } |
1471 | } |
… | |
… | |
1401 | && (op->face && !faces [op->face].visibility)) |
1489 | && (op->face && !faces [op->face].visibility)) |
1402 | { |
1490 | { |
1403 | object *last; |
1491 | object *last; |
1404 | |
1492 | |
1405 | for (last = top; last != floor; last = last->below) |
1493 | for (last = top; last != floor; last = last->below) |
1406 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1494 | if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT)) |
1407 | break; |
1495 | break; |
1408 | |
1496 | |
1409 | /* Check to see if we found the object that blocks view, |
1497 | /* Check to see if we found the object that blocks view, |
1410 | * and make sure we have a below pointer for it so that |
1498 | * and make sure we have a below pointer for it so that |
1411 | * we can get inserted below this one, which requires we |
1499 | * we can get inserted below this one, which requires we |
… | |
… | |
1511 | |
1599 | |
1512 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1600 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1513 | if (tmp->arch->archname == archname) /* same archetype */ |
1601 | if (tmp->arch->archname == archname) /* same archetype */ |
1514 | tmp->destroy (); |
1602 | tmp->destroy (); |
1515 | |
1603 | |
1516 | object *tmp = arch_to_object (archetype::find (archname)); |
1604 | object *tmp = archetype::find (archname)->instance (); |
1517 | |
1605 | |
1518 | tmp->x = op->x; |
1606 | tmp->x = op->x; |
1519 | tmp->y = op->y; |
1607 | tmp->y = op->y; |
1520 | |
1608 | |
1521 | insert_ob_in_map (tmp, op->map, op, 0); |
1609 | insert_ob_in_map (tmp, op->map, op, 0); |
… | |
… | |
1526 | { |
1614 | { |
1527 | if (where->env) |
1615 | if (where->env) |
1528 | return where->env->insert (this); |
1616 | return where->env->insert (this); |
1529 | else |
1617 | else |
1530 | return where->map->insert (this, where->x, where->y, originator, flags); |
1618 | return where->map->insert (this, where->x, where->y, originator, flags); |
|
|
1619 | } |
|
|
1620 | |
|
|
1621 | // check whether we can put this into the map, respect max_volume, max_items |
|
|
1622 | bool |
|
|
1623 | object::can_drop_at (maptile *m, int x, int y, object *originator) |
|
|
1624 | { |
|
|
1625 | mapspace &ms = m->at (x, y); |
|
|
1626 | |
|
|
1627 | int items = ms.items (); |
|
|
1628 | |
|
|
1629 | if (!items // testing !items ensures we can drop at least one item |
|
|
1630 | || (items < m->max_items |
|
|
1631 | && ms.volume () < m->max_volume)) |
|
|
1632 | return true; |
|
|
1633 | |
|
|
1634 | if (originator && originator->is_player ()) |
|
|
1635 | originator->contr->failmsgf ( |
|
|
1636 | "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>", |
|
|
1637 | query_name () |
|
|
1638 | ); |
|
|
1639 | |
|
|
1640 | return false; |
1531 | } |
1641 | } |
1532 | |
1642 | |
1533 | /* |
1643 | /* |
1534 | * decrease(object, number) decreases a specified number from |
1644 | * decrease(object, number) decreases a specified number from |
1535 | * the amount of an object. If the amount reaches 0, the object |
1645 | * the amount of an object. If the amount reaches 0, the object |
… | |
… | |
1675 | if (op->glow_radius && is_on_map ()) |
1785 | if (op->glow_radius && is_on_map ()) |
1676 | { |
1786 | { |
1677 | update_stats (); |
1787 | update_stats (); |
1678 | update_all_los (map, x, y); |
1788 | update_all_los (map, x, y); |
1679 | } |
1789 | } |
1680 | else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) |
1790 | else if (is_player ()) |
1681 | // if this is a player's inventory, update stats |
1791 | // if this is a player's inventory, update stats |
1682 | update_stats (); |
1792 | contr->queue_stats_update (); |
1683 | |
1793 | |
1684 | INVOKE_OBJECT (INSERT, this); |
1794 | INVOKE_OBJECT (INSERT, this); |
1685 | |
1795 | |
1686 | return op; |
1796 | return op; |
1687 | } |
1797 | } |
… | |
… | |
1707 | * on top. |
1817 | * on top. |
1708 | */ |
1818 | */ |
1709 | int |
1819 | int |
1710 | check_move_on (object *op, object *originator) |
1820 | check_move_on (object *op, object *originator) |
1711 | { |
1821 | { |
1712 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1822 | if (op->flag [FLAG_NO_APPLY]) |
1713 | return 0; |
1823 | return 0; |
1714 | |
1824 | |
1715 | object *tmp; |
1825 | object *tmp; |
1716 | maptile *m = op->map; |
1826 | maptile *m = op->map; |
1717 | int x = op->x, y = op->y; |
1827 | int x = op->x, y = op->y; |
… | |
… | |
1754 | * Second check makes sure that the movement types not being slowed |
1864 | * Second check makes sure that the movement types not being slowed |
1755 | * (~slow_move) is not blocked on this space - just because the |
1865 | * (~slow_move) is not blocked on this space - just because the |
1756 | * space doesn't slow down swimming (for example), if you can't actually |
1866 | * space doesn't slow down swimming (for example), if you can't actually |
1757 | * swim on that space, can't use it to avoid the penalty. |
1867 | * swim on that space, can't use it to avoid the penalty. |
1758 | */ |
1868 | */ |
1759 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1869 | if (!op->flag [FLAG_WIZPASS]) |
1760 | { |
1870 | { |
1761 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1871 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1762 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1872 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1763 | { |
1873 | { |
1764 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
1874 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
… | |
… | |
1895 | void |
2005 | void |
1896 | flag_inv (object *op, int flag) |
2006 | flag_inv (object *op, int flag) |
1897 | { |
2007 | { |
1898 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
2008 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1899 | { |
2009 | { |
1900 | SET_FLAG (tmp, flag); |
2010 | tmp->set_flag (flag); |
1901 | flag_inv (tmp, flag); |
2011 | flag_inv (tmp, flag); |
1902 | } |
2012 | } |
1903 | } |
2013 | } |
1904 | |
2014 | |
1905 | /* |
2015 | /* |
… | |
… | |
1908 | void |
2018 | void |
1909 | unflag_inv (object *op, int flag) |
2019 | unflag_inv (object *op, int flag) |
1910 | { |
2020 | { |
1911 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
2021 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1912 | { |
2022 | { |
1913 | CLEAR_FLAG (tmp, flag); |
2023 | tmp->clr_flag (flag); |
1914 | unflag_inv (tmp, flag); |
2024 | unflag_inv (tmp, flag); |
1915 | } |
2025 | } |
1916 | } |
2026 | } |
1917 | |
2027 | |
1918 | /* |
2028 | /* |
… | |
… | |
2108 | { |
2218 | { |
2109 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2219 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2110 | } |
2220 | } |
2111 | |
2221 | |
2112 | /* |
2222 | /* |
2113 | * find_dir_2(delta-x,delta-y) will return a direction in which |
2223 | * find_dir_2(delta-x,delta-y) will return a direction value |
2114 | * an object which has subtracted the x and y coordinates of another |
2224 | * for running into direct [dx, dy]. |
2115 | * object, needs to travel toward it. |
2225 | * (the opposite of crossfire's find_dir_2!) |
2116 | */ |
2226 | */ |
2117 | int |
2227 | int |
2118 | find_dir_2 (int x, int y) |
2228 | find_dir_2 (int x, int y) |
2119 | { |
2229 | { |
|
|
2230 | #if 1 // new algorithm |
|
|
2231 | // this works by putting x, y into 16 sectors, which |
|
|
2232 | // are not equal sized, but are a better approximation |
|
|
2233 | // then the old algorithm, and then using a mapping |
|
|
2234 | // table to map it into a direction value. |
|
|
2235 | // basically, it maps these comparisons to each bit |
|
|
2236 | // bit #3: x < 0 |
|
|
2237 | // bit #2: y < 0 |
|
|
2238 | // bit #1: x > y |
|
|
2239 | // bit #0: x > 2y |
|
|
2240 | |
|
|
2241 | static const uint8 dir[16] = { |
|
|
2242 | 4, 5, 4, 3, |
|
|
2243 | 2, 1, 2, 3, |
|
|
2244 | 6, 5, 6, 7, |
|
|
2245 | 8, 1, 8, 7, |
|
|
2246 | }; |
|
|
2247 | int sector = 0; |
|
|
2248 | |
|
|
2249 | // this is a bit ugly, but more likely to result in branchless code |
|
|
2250 | sector |= x < 0 ? 8 : 0; |
|
|
2251 | x = x < 0 ? -x : x; // abs |
|
|
2252 | |
|
|
2253 | sector |= y < 0 ? 4 : 0; |
|
|
2254 | y = y < 0 ? -y : y; // abs |
|
|
2255 | |
|
|
2256 | if (x > y) |
|
|
2257 | { |
|
|
2258 | sector |= 2; |
|
|
2259 | |
|
|
2260 | if (x > y * 2) |
|
|
2261 | sector |= 1; |
|
|
2262 | } |
|
|
2263 | else |
|
|
2264 | { |
|
|
2265 | if (y > x * 2) |
|
|
2266 | sector |= 1; |
|
|
2267 | else if (!y) |
|
|
2268 | return 0; // x == 0 here |
|
|
2269 | } |
|
|
2270 | |
|
|
2271 | return dir [sector]; |
|
|
2272 | #else // old algorithm |
2120 | int q; |
2273 | int q; |
2121 | |
2274 | |
2122 | if (y) |
2275 | if (y) |
2123 | q = x * 100 / y; |
2276 | q = 128 * x / y; |
2124 | else if (x) |
2277 | else if (x) |
2125 | q = -300 * x; |
2278 | q = -512 * x; // to make it > 309 |
2126 | else |
2279 | else |
2127 | return 0; |
2280 | return 0; |
2128 | |
2281 | |
2129 | if (y > 0) |
2282 | if (y > 0) |
2130 | { |
2283 | { |
2131 | if (q < -242) |
2284 | if (q < -309) return 7; |
|
|
2285 | if (q < -52) return 6; |
|
|
2286 | if (q < 52) return 5; |
|
|
2287 | if (q < 309) return 4; |
|
|
2288 | |
2132 | return 3; |
2289 | return 3; |
2133 | if (q < -41) |
2290 | } |
2134 | return 2; |
2291 | else |
2135 | if (q < 41) |
2292 | { |
2136 | return 1; |
2293 | if (q < -309) return 3; |
2137 | if (q < 242) |
2294 | if (q < -52) return 2; |
2138 | return 8; |
2295 | if (q < 52) return 1; |
|
|
2296 | if (q < 309) return 8; |
|
|
2297 | |
2139 | return 7; |
2298 | return 7; |
2140 | } |
2299 | } |
2141 | |
2300 | #endif |
2142 | if (q < -242) |
|
|
2143 | return 7; |
|
|
2144 | if (q < -41) |
|
|
2145 | return 6; |
|
|
2146 | if (q < 41) |
|
|
2147 | return 5; |
|
|
2148 | if (q < 242) |
|
|
2149 | return 4; |
|
|
2150 | |
|
|
2151 | return 3; |
|
|
2152 | } |
2301 | } |
2153 | |
2302 | |
2154 | /* |
2303 | /* |
2155 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2304 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2156 | * between two directions (which are expected to be absolute (see absdir()) |
2305 | * between two directions (which are expected to be absolute (see absdir()) |
2157 | */ |
2306 | */ |
2158 | int |
2307 | int |
2159 | dirdiff (int dir1, int dir2) |
2308 | dirdiff (int dir1, int dir2) |
2160 | { |
2309 | { |
2161 | int d; |
|
|
2162 | |
|
|
2163 | d = abs (dir1 - dir2); |
2310 | int d = abs (dir1 - dir2); |
2164 | if (d > 4) |
|
|
2165 | d = 8 - d; |
|
|
2166 | |
2311 | |
2167 | return d; |
2312 | return d > 4 ? 8 - d : d; |
2168 | } |
2313 | } |
2169 | |
2314 | |
2170 | /* peterm: |
2315 | /* peterm: |
2171 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2316 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2172 | * Basically, this is a table of directions, and what directions |
2317 | * Basically, this is a table of directions, and what directions |
… | |
… | |
2278 | * Add a check so we can't pick up invisible objects (0.93.8) |
2423 | * Add a check so we can't pick up invisible objects (0.93.8) |
2279 | */ |
2424 | */ |
2280 | int |
2425 | int |
2281 | can_pick (const object *who, const object *item) |
2426 | can_pick (const object *who, const object *item) |
2282 | { |
2427 | { |
2283 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2428 | return /*who->flag [FLAG_WIZ]|| */ |
2284 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2429 | (item->weight > 0 && !item->flag [FLAG_NO_PICK] && |
2285 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2430 | !item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2286 | } |
2431 | } |
2287 | |
2432 | |
2288 | /* |
2433 | /* |
2289 | * create clone from object to another |
2434 | * create clone from object to another |
2290 | */ |
2435 | */ |
… | |
… | |
2455 | { |
2600 | { |
2456 | return map ? map->region (x, y) |
2601 | return map ? map->region (x, y) |
2457 | : region::default_region (); |
2602 | : region::default_region (); |
2458 | } |
2603 | } |
2459 | |
2604 | |
2460 | const materialtype_t * |
|
|
2461 | object::dominant_material () const |
|
|
2462 | { |
|
|
2463 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2464 | return mt; |
|
|
2465 | |
|
|
2466 | return name_to_material (shstr_unknown); |
|
|
2467 | } |
|
|
2468 | |
|
|
2469 | void |
2605 | void |
2470 | object::open_container (object *new_container) |
2606 | object::open_container (object *new_container) |
2471 | { |
2607 | { |
2472 | if (container == new_container) |
2608 | if (container == new_container) |
2473 | return; |
2609 | return; |
… | |
… | |
2507 | // TODO: this does not seem to serve any purpose anymore? |
2643 | // TODO: this does not seem to serve any purpose anymore? |
2508 | #if 0 |
2644 | #if 0 |
2509 | // insert the "Close Container" object. |
2645 | // insert the "Close Container" object. |
2510 | if (archetype *closer = new_container->other_arch) |
2646 | if (archetype *closer = new_container->other_arch) |
2511 | { |
2647 | { |
2512 | object *closer = arch_to_object (new_container->other_arch); |
2648 | object *closer = new_container->other_arch->instance (); |
2513 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2649 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2514 | new_container->insert (closer); |
2650 | new_container->insert (closer); |
2515 | } |
2651 | } |
2516 | #endif |
2652 | #endif |
2517 | |
2653 | |
… | |
… | |
2623 | |
2759 | |
2624 | insert (force); |
2760 | insert (force); |
2625 | } |
2761 | } |
2626 | } |
2762 | } |
2627 | |
2763 | |
|
|
2764 | void object::change_move_type (MoveType mt) |
|
|
2765 | { |
|
|
2766 | if (move_type == mt) |
|
|
2767 | return; |
|
|
2768 | |
|
|
2769 | if (is_on_map ()) |
|
|
2770 | { |
|
|
2771 | // we are on the map, so handle move_on/off effects |
|
|
2772 | remove (); |
|
|
2773 | move_type = mt; |
|
|
2774 | map->insert (this, x, y, this); |
|
|
2775 | } |
|
|
2776 | else |
|
|
2777 | move_type = mt; |
|
|
2778 | } |
|
|
2779 | |
|
|
2780 | /* object should be a player. |
|
|
2781 | * we return the object the player has marked with the 'mark' command |
|
|
2782 | * below. If no match is found (or object has changed), we return |
|
|
2783 | * NULL. We leave it up to the calling function to print messages if |
|
|
2784 | * nothing is found. |
|
|
2785 | */ |
|
|
2786 | object * |
|
|
2787 | object::mark () const |
|
|
2788 | { |
|
|
2789 | if (contr && contr->mark && contr->mark->env == this) |
|
|
2790 | return contr->mark; |
|
|
2791 | else |
|
|
2792 | return 0; |
|
|
2793 | } |
|
|
2794 | |