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 |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
25 | #include <stdio.h> |
26 | #include <stdio.h> |
26 | #include <sys/types.h> |
27 | #include <sys/types.h> |
27 | #include <sys/uio.h> |
28 | #include <sys/uio.h> |
28 | #include <object.h> |
29 | #include <object.h> |
29 | #include <sproto.h> |
30 | #include <sproto.h> |
30 | #include <loader.h> |
|
|
31 | |
31 | |
32 | #include <bitset> |
32 | #include <bitset> |
33 | |
33 | |
34 | UUID UUID::cur; |
34 | UUID UUID::cur; |
35 | static uint64_t seq_next_save; |
35 | static uint64_t seq_next_save; |
36 | static const uint64 UUID_GAP = 1<<19; |
36 | static const uint64 UUID_GAP = 1<<19; |
37 | uint32_t mapspace::smellcount = 10000; |
37 | uint32_t mapspace::smellcount = 10000; |
38 | |
38 | |
39 | objectvec objects; |
39 | objectvec objects; |
40 | activevec actives; |
40 | activevec actives; |
|
|
41 | |
|
|
42 | //+GPL |
41 | |
43 | |
42 | short freearr_x[SIZEOFFREE] = { |
44 | short freearr_x[SIZEOFFREE] = { |
43 | 0, |
45 | 0, |
44 | 0, 1, 1, 1, 0, -1, -1, -1, |
46 | 0, 1, 1, 1, 0, -1, -1, -1, |
45 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
47 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
… | |
… | |
49 | 0, |
51 | 0, |
50 | -1, -1, 0, 1, 1, 1, 0, -1, |
52 | -1, -1, 0, 1, 1, 1, 0, -1, |
51 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
53 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
52 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
54 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
53 | }; |
55 | }; |
54 | int maxfree[SIZEOFFREE] = { |
|
|
55 | 0, |
|
|
56 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
57 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
|
|
58 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
|
|
59 | }; |
|
|
60 | int freedir[SIZEOFFREE] = { |
56 | int freedir[SIZEOFFREE] = { |
61 | 0, |
57 | 0, |
62 | 1, 2, 3, 4, 5, 6, 7, 8, |
58 | 1, 2, 3, 4, 5, 6, 7, 8, |
63 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
59 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
64 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
60 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
65 | }; |
61 | }; |
66 | |
62 | |
|
|
63 | static int maxfree[SIZEOFFREE] = { |
|
|
64 | 0, |
|
|
65 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
66 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
|
|
67 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
|
|
68 | }; |
|
|
69 | |
67 | static void |
70 | static void |
68 | write_uuid (uval64 skip, bool sync) |
71 | write_uuid (uval64 skip, bool sync) |
69 | { |
72 | { |
70 | CALL_BEGIN (2); |
73 | CALL_BEGIN (2); |
71 | CALL_ARG_SV (newSVval64 (skip)); |
74 | CALL_ARG_SV (newSVval64 (skip)); |
… | |
… | |
73 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
76 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
74 | CALL_END; |
77 | CALL_END; |
75 | } |
78 | } |
76 | |
79 | |
77 | static void |
80 | static void |
78 | read_uuid (void) |
81 | read_uuid () |
79 | { |
82 | { |
80 | char filename[MAX_BUF]; |
83 | char filename[MAX_BUF]; |
81 | |
84 | |
82 | sprintf (filename, "%s/uuid", settings.localdir); |
85 | sprintf (filename, "%s/uuid", settings.localdir); |
83 | |
86 | |
… | |
… | |
97 | |
100 | |
98 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
101 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
99 | _exit (1); |
102 | _exit (1); |
100 | } |
103 | } |
101 | |
104 | |
102 | UUID::BUF buf; |
105 | char buf [UUID::MAX_LEN]; |
103 | buf[0] = 0; |
106 | buf[0] = 0; |
104 | fgets (buf, sizeof (buf), fp); |
107 | fgets (buf, sizeof (buf), fp); |
105 | |
108 | |
106 | if (!UUID::cur.parse (buf)) |
109 | if (!UUID::cur.parse (buf)) |
107 | { |
110 | { |
… | |
… | |
134 | |
137 | |
135 | void |
138 | void |
136 | UUID::init () |
139 | UUID::init () |
137 | { |
140 | { |
138 | read_uuid (); |
141 | read_uuid (); |
|
|
142 | } |
|
|
143 | |
|
|
144 | bool |
|
|
145 | UUID::parse (const char *s) |
|
|
146 | { |
|
|
147 | if (*s++ != '<' || *s++ != '1' || *s++ != '.') |
|
|
148 | return false; |
|
|
149 | |
|
|
150 | seq = 0; |
|
|
151 | |
|
|
152 | while (*s != '>') |
|
|
153 | { |
|
|
154 | if (*s < '0') |
|
|
155 | return false; |
|
|
156 | |
|
|
157 | // this gives nice branchless code with gcc |
|
|
158 | assert ('0' < 'a' && '0' == 48 && 'a' == 97); |
|
|
159 | int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15; |
|
|
160 | |
|
|
161 | seq = (seq << 4) | digit; |
|
|
162 | |
|
|
163 | ++s; |
|
|
164 | } |
|
|
165 | |
|
|
166 | return true; |
|
|
167 | } |
|
|
168 | |
|
|
169 | char * |
|
|
170 | UUID::append (char *buf) const |
|
|
171 | { |
|
|
172 | *buf++ = '<'; |
|
|
173 | *buf++ = '1'; |
|
|
174 | *buf++ = '.'; |
|
|
175 | |
|
|
176 | uint64_t seq = this->seq; |
|
|
177 | const int bits = 64; |
|
|
178 | char nz = 0; |
|
|
179 | static const char tohex [] = "0123456789abcdef"; |
|
|
180 | |
|
|
181 | // assert (len >= 3 + bits / 4 + 1 + 1); |
|
|
182 | for (int i = bits / 4; --i; ) |
|
|
183 | { |
|
|
184 | uint8_t digit = seq >> (bits - 4); |
|
|
185 | |
|
|
186 | *buf = tohex [digit]; |
|
|
187 | nz |= digit; |
|
|
188 | buf += nz ? 1 : 0; |
|
|
189 | seq <<= 4; |
|
|
190 | } |
|
|
191 | |
|
|
192 | // last digit is special - always emit |
|
|
193 | uint8_t digit = seq >> (bits - 4); |
|
|
194 | *buf++ = tohex [digit]; |
|
|
195 | |
|
|
196 | *buf++ = '>'; |
|
|
197 | |
|
|
198 | return buf; |
|
|
199 | } |
|
|
200 | |
|
|
201 | char * |
|
|
202 | UUID::c_str () const |
|
|
203 | { |
|
|
204 | static char buf [MAX_LEN]; |
|
|
205 | *append (buf) = 0; |
|
|
206 | return buf; |
139 | } |
207 | } |
140 | |
208 | |
141 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
209 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
142 | static bool |
210 | static bool |
143 | compare_ob_value_lists_one (const object *wants, const object *has) |
211 | compare_ob_value_lists_one (const object *wants, const object *has) |
… | |
… | |
179 | * Improvements made with merge: Better checking on potion, and also |
247 | * Improvements made with merge: Better checking on potion, and also |
180 | * check weight |
248 | * check weight |
181 | */ |
249 | */ |
182 | bool object::can_merge_slow (object *ob1, object *ob2) |
250 | bool object::can_merge_slow (object *ob1, object *ob2) |
183 | { |
251 | { |
184 | /* A couple quicksanity checks */ |
252 | /* A couple quick sanity checks */ |
185 | if (ob1 == ob2 |
253 | if (ob1 == ob2 |
186 | || ob1->type != ob2->type |
254 | || ob1->type != ob2->type |
187 | || ob1->speed != ob2->speed |
|
|
188 | || ob1->value != ob2->value |
255 | || ob1->value != ob2->value |
189 | || ob1->name != ob2->name) |
256 | || ob1->name != ob2->name |
|
|
257 | || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED) |
190 | return 0; |
258 | return 0; |
191 | |
259 | |
192 | /* Do not merge objects if nrof would overflow, assume nrof |
260 | /* Do not merge objects if nrof would overflow, assume nrof |
193 | * is always 0 .. 2**31-1 */ |
261 | * is always 0 .. 2**31-1 */ |
194 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
262 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
… | |
… | |
215 | || ob1->magic != ob2->magic |
283 | || ob1->magic != ob2->magic |
216 | || ob1->slaying != ob2->slaying |
284 | || ob1->slaying != ob2->slaying |
217 | || ob1->skill != ob2->skill |
285 | || ob1->skill != ob2->skill |
218 | || ob1->value != ob2->value |
286 | || ob1->value != ob2->value |
219 | || ob1->animation_id != ob2->animation_id |
287 | || ob1->animation_id != ob2->animation_id |
220 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other |
288 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other |
221 | || ob1->client_type != ob2->client_type |
289 | || ob1->client_type != ob2->client_type |
222 | || ob1->materialname != ob2->materialname |
290 | || ob1->material != ob2->material |
223 | || ob1->lore != ob2->lore |
291 | || ob1->lore != ob2->lore |
224 | || ob1->subtype != ob2->subtype |
292 | || ob1->subtype != ob2->subtype |
225 | || ob1->move_type != ob2->move_type |
293 | || ob1->move_type != ob2->move_type |
226 | || ob1->move_block != ob2->move_block |
294 | || ob1->move_block != ob2->move_block |
227 | || ob1->move_allow != ob2->move_allow |
295 | || ob1->move_allow != ob2->move_allow |
228 | || ob1->move_on != ob2->move_on |
296 | || ob1->move_on != ob2->move_on |
229 | || ob1->move_off != ob2->move_off |
297 | || ob1->move_off != ob2->move_off |
230 | || ob1->move_slow != ob2->move_slow |
298 | || ob1->move_slow != ob2->move_slow |
231 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
299 | || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f) |
232 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
300 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
233 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
301 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
234 | return 0; |
302 | return 0; |
235 | |
303 | |
236 | if ((ob1->flag ^ ob2->flag) |
304 | if ((ob1->flag ^ ob2->flag) |
… | |
… | |
334 | |
402 | |
335 | // the player itself is always on a map, so we will find him here |
403 | // the player itself is always on a map, so we will find him here |
336 | // even if our inv is in a player. |
404 | // even if our inv is in a player. |
337 | if (envest->is_on_map ()) |
405 | if (envest->is_on_map ()) |
338 | if (object *pl = envest->ms ().player ()) |
406 | if (object *pl = envest->ms ().player ()) |
339 | if (pl->container == env) |
407 | if (pl->container_ () == env) |
340 | return pl; |
408 | return pl; |
341 | } |
409 | } |
342 | else |
410 | else |
343 | { |
411 | { |
344 | // maybe there is a player standing on the same mapspace |
412 | // maybe there is a player standing on the same mapspace |
345 | // this will catch the case where "this" is a player |
413 | // this will catch the case where "this" is a player |
346 | if (object *pl = ms ().player ()) |
414 | if (object *pl = ms ().player ()) |
347 | if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look) |
415 | if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look) |
348 | || this == pl->container) |
416 | || pl->container_ () == this) |
349 | return pl; |
417 | return pl; |
350 | } |
418 | } |
351 | } |
419 | } |
352 | |
420 | |
353 | return 0; |
421 | return 0; |
… | |
… | |
431 | object_freezer freezer; |
499 | object_freezer freezer; |
432 | op->write (freezer); |
500 | op->write (freezer); |
433 | return freezer.as_string (); |
501 | return freezer.as_string (); |
434 | } |
502 | } |
435 | |
503 | |
436 | /* |
504 | char * |
437 | * get_nearest_part(multi-object, object 2) returns the part of the |
505 | object::as_string () |
438 | * multi-object 1 which is closest to the second object. |
|
|
439 | * If it's not a multi-object, it is returned. |
|
|
440 | */ |
|
|
441 | object * |
|
|
442 | get_nearest_part (object *op, const object *pl) |
|
|
443 | { |
506 | { |
444 | object *tmp, *closest; |
507 | return dump_object (this); |
445 | int last_dist, i; |
|
|
446 | |
|
|
447 | if (!op->more) |
|
|
448 | return op; |
|
|
449 | |
|
|
450 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
451 | tmp; |
|
|
452 | tmp = tmp->more) |
|
|
453 | if ((i = distance (tmp, pl)) < last_dist) |
|
|
454 | closest = tmp, last_dist = i; |
|
|
455 | |
|
|
456 | return closest; |
|
|
457 | } |
508 | } |
458 | |
509 | |
459 | /* |
510 | /* |
460 | * Returns the object which has the count-variable equal to the argument. |
511 | * Returns the object which has the count-variable equal to the argument. |
461 | * VERRRY slow. |
512 | * VERRRY slow. |
… | |
… | |
463 | object * |
514 | object * |
464 | find_object (tag_t i) |
515 | find_object (tag_t i) |
465 | { |
516 | { |
466 | for_all_objects (op) |
517 | for_all_objects (op) |
467 | if (op->count == i) |
518 | if (op->count == i) |
|
|
519 | return op; |
|
|
520 | |
|
|
521 | return 0; |
|
|
522 | } |
|
|
523 | |
|
|
524 | /* |
|
|
525 | * Returns the object which has the uuid equal to the argument. |
|
|
526 | * MOAR VERRRY slow. |
|
|
527 | */ |
|
|
528 | |
|
|
529 | object * |
|
|
530 | find_object_uuid (UUID i) |
|
|
531 | { |
|
|
532 | for_all_objects (op) |
|
|
533 | if (op->uuid == i) |
468 | return op; |
534 | return op; |
469 | |
535 | |
470 | return 0; |
536 | return 0; |
471 | } |
537 | } |
472 | |
538 | |
… | |
… | |
506 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
572 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
507 | return; |
573 | return; |
508 | } |
574 | } |
509 | |
575 | |
510 | this->owner = owner; |
576 | this->owner = owner; |
511 | } |
|
|
512 | |
|
|
513 | int |
|
|
514 | object::slottype () const |
|
|
515 | { |
|
|
516 | if (type == SKILL) |
|
|
517 | { |
|
|
518 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
519 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
520 | } |
|
|
521 | else |
|
|
522 | { |
|
|
523 | if (slot [body_combat].info) return slot_combat; |
|
|
524 | if (slot [body_range ].info) return slot_ranged; |
|
|
525 | } |
|
|
526 | |
|
|
527 | return slot_none; |
|
|
528 | } |
|
|
529 | |
|
|
530 | bool |
|
|
531 | object::change_weapon (object *ob) |
|
|
532 | { |
|
|
533 | if (current_weapon == ob) |
|
|
534 | return true; |
|
|
535 | |
|
|
536 | if (chosen_skill) |
|
|
537 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
538 | |
|
|
539 | current_weapon = ob; |
|
|
540 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
541 | |
|
|
542 | if (chosen_skill) |
|
|
543 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
544 | |
|
|
545 | update_stats (); |
|
|
546 | |
|
|
547 | if (ob) |
|
|
548 | { |
|
|
549 | // now check wether any body locations became invalid, in which case |
|
|
550 | // we cannot apply the weapon at the moment. |
|
|
551 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
552 | if (slot[i].used < 0) |
|
|
553 | { |
|
|
554 | current_weapon = chosen_skill = 0; |
|
|
555 | update_stats (); |
|
|
556 | |
|
|
557 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
558 | "You try to balance all your items at once, " |
|
|
559 | "but the %s is just too much for your body. " |
|
|
560 | "[You need to unapply some items first.]", &ob->name); |
|
|
561 | return false; |
|
|
562 | } |
|
|
563 | |
|
|
564 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
565 | } |
|
|
566 | else |
|
|
567 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
568 | |
|
|
569 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
570 | { |
|
|
571 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
572 | &name, ob->debug_desc ()); |
|
|
573 | return false; |
|
|
574 | } |
|
|
575 | |
|
|
576 | return true; |
|
|
577 | } |
577 | } |
578 | |
578 | |
579 | /* Zero the key_values on op, decrementing the shared-string |
579 | /* Zero the key_values on op, decrementing the shared-string |
580 | * refcounts and freeing the links. |
580 | * refcounts and freeing the links. |
581 | */ |
581 | */ |
… | |
… | |
634 | tail = new_link; |
634 | tail = new_link; |
635 | } |
635 | } |
636 | } |
636 | } |
637 | } |
637 | } |
638 | |
638 | |
639 | if (speed < 0) |
|
|
640 | dst->speed_left -= rndm (); |
|
|
641 | |
|
|
642 | dst->activate (); |
639 | dst->activate (); |
643 | } |
640 | } |
644 | |
641 | |
645 | void |
642 | void |
646 | object::instantiate () |
643 | object::instantiate () |
647 | { |
644 | { |
648 | if (!uuid.seq) // HACK |
645 | if (!uuid.seq) // HACK |
649 | uuid = UUID::gen (); |
646 | uuid = UUID::gen (); |
650 | |
647 | |
|
|
648 | // TODO: unclean state changes, should nt be done in copy_to AND instantiate |
|
|
649 | if (flag [FLAG_RANDOM_SPEED] && speed) |
|
|
650 | speed_left = - speed - rndm (); // TODO animation |
|
|
651 | else |
651 | speed_left = -0.1f; |
652 | speed_left = -1.; |
|
|
653 | |
652 | /* copy the body_info to the body_used - this is only really |
654 | /* copy the body_info to the body_used - this is only really |
653 | * need for monsters, but doesn't hurt to do it for everything. |
655 | * need for monsters, but doesn't hurt to do it for everything. |
654 | * by doing so, when a monster is created, it has good starting |
656 | * by doing so, when a monster is created, it has good starting |
655 | * values for the body_used info, so when items are created |
657 | * values for the body_used info, so when items are created |
656 | * for it, they can be properly equipped. |
658 | * for it, they can be properly equipped. |
… | |
… | |
664 | object * |
666 | object * |
665 | object::clone () |
667 | object::clone () |
666 | { |
668 | { |
667 | object *neu = create (); |
669 | object *neu = create (); |
668 | copy_to (neu); |
670 | copy_to (neu); |
|
|
671 | |
|
|
672 | // TODO: unclean state changes, should not be done in clone AND instantiate |
|
|
673 | if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed) |
|
|
674 | neu->speed_left = - neu->speed - rndm (); // TODO animation |
|
|
675 | |
669 | neu->map = map; // not copied by copy_to |
676 | neu->map = map; // not copied by copy_to |
670 | return neu; |
677 | return neu; |
671 | } |
678 | } |
672 | |
679 | |
673 | /* |
680 | /* |
… | |
… | |
691 | * This function needs to be called whenever the speed of an object changes. |
698 | * This function needs to be called whenever the speed of an object changes. |
692 | */ |
699 | */ |
693 | void |
700 | void |
694 | object::set_speed (float speed) |
701 | object::set_speed (float speed) |
695 | { |
702 | { |
696 | if (flag [FLAG_FREED] && speed) |
|
|
697 | { |
|
|
698 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
|
|
699 | speed = 0; |
|
|
700 | } |
|
|
701 | |
|
|
702 | this->speed = speed; |
703 | this->speed = speed; |
703 | |
704 | |
704 | if (has_active_speed ()) |
705 | if (has_active_speed ()) |
705 | activate (); |
706 | activate (); |
706 | else |
707 | else |
… | |
… | |
756 | |
757 | |
757 | if (!(m.flags_ & P_UPTODATE)) |
758 | if (!(m.flags_ & P_UPTODATE)) |
758 | /* nop */; |
759 | /* nop */; |
759 | else if (action == UP_OBJ_INSERT) |
760 | else if (action == UP_OBJ_INSERT) |
760 | { |
761 | { |
|
|
762 | #if 0 |
761 | // this is likely overkill, TODO: revisit (schmorp) |
763 | // this is likely overkill, TODO: revisit (schmorp) |
762 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
764 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
763 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
765 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
764 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
766 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
765 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
767 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
… | |
… | |
770 | || (m.move_slow | op->move_slow) != m.move_slow |
772 | || (m.move_slow | op->move_slow) != m.move_slow |
771 | /* This isn't perfect, but I don't expect a lot of objects to |
773 | /* This isn't perfect, but I don't expect a lot of objects to |
772 | * have move_allow right now. |
774 | * have move_allow right now. |
773 | */ |
775 | */ |
774 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
776 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
775 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
|
|
776 | m.invalidate (); |
777 | m.invalidate (); |
|
|
778 | #else |
|
|
779 | // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp) |
|
|
780 | m.invalidate (); |
|
|
781 | #endif |
777 | } |
782 | } |
778 | /* if the object is being removed, we can't make intelligent |
783 | /* if the object is being removed, we can't make intelligent |
779 | * decisions, because remove_ob can't really pass the object |
784 | * decisions, because remove_ob can't really pass the object |
780 | * that is being removed. |
785 | * that is being removed. |
781 | */ |
786 | */ |
… | |
… | |
793 | object::object () |
798 | object::object () |
794 | { |
799 | { |
795 | SET_FLAG (this, FLAG_REMOVED); |
800 | SET_FLAG (this, FLAG_REMOVED); |
796 | |
801 | |
797 | //expmul = 1.0; declared const for the time being |
802 | //expmul = 1.0; declared const for the time being |
798 | face = blank_face; |
803 | face = blank_face; |
|
|
804 | material = MATERIAL_NULL; |
799 | } |
805 | } |
800 | |
806 | |
801 | object::~object () |
807 | object::~object () |
802 | { |
808 | { |
803 | unlink (); |
809 | unlink (); |
… | |
… | |
831 | { |
837 | { |
832 | /* If already on active list, don't do anything */ |
838 | /* If already on active list, don't do anything */ |
833 | if (active) |
839 | if (active) |
834 | return; |
840 | return; |
835 | |
841 | |
836 | if (has_active_speed () && flag [FLAG_FREED]) LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D |
|
|
837 | if (has_active_speed () && flag [FLAG_DEBUG]) LOG (llevError | logBacktrace, "BUG: tried to activate DEBUG object %s\n", debug_desc ());//D temp |
|
|
838 | |
|
|
839 | if (has_active_speed ()) |
842 | if (has_active_speed ()) |
|
|
843 | { |
|
|
844 | if (flag [FLAG_FREED]) |
|
|
845 | LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D |
|
|
846 | |
840 | actives.insert (this); |
847 | actives.insert (this); |
|
|
848 | } |
841 | } |
849 | } |
842 | |
850 | |
843 | void |
851 | void |
844 | object::activate_recursive () |
852 | object::activate_recursive () |
845 | { |
853 | { |
… | |
… | |
931 | map->insert (op, x, y); |
939 | map->insert (op, x, y); |
932 | } |
940 | } |
933 | } |
941 | } |
934 | } |
942 | } |
935 | |
943 | |
|
|
944 | /* |
|
|
945 | * Remove and free all objects in the inventory of the given object. |
|
|
946 | * Unlike destroy_inv, this assumes the *this is destroyed as well |
|
|
947 | * well, so we can (and have to!) take shortcuts. |
|
|
948 | */ |
|
|
949 | void |
|
|
950 | object::destroy_inv_fast () |
|
|
951 | { |
|
|
952 | while (object *op = inv) |
|
|
953 | { |
|
|
954 | // remove from object the fast way |
|
|
955 | op->flag [FLAG_REMOVED] = true; |
|
|
956 | op->env = 0; |
|
|
957 | if ((inv = inv->below)) |
|
|
958 | inv->above = 0; |
|
|
959 | |
|
|
960 | // then destroy |
|
|
961 | op->destroy (); |
|
|
962 | } |
|
|
963 | } |
|
|
964 | |
936 | object *object::create () |
965 | object *object::create () |
937 | { |
966 | { |
938 | object *op = new object; |
967 | object *op = new object; |
939 | op->link (); |
968 | op->link (); |
940 | return op; |
969 | return op; |
… | |
… | |
1010 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1039 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1011 | head->destroy (); |
1040 | head->destroy (); |
1012 | return; |
1041 | return; |
1013 | } |
1042 | } |
1014 | |
1043 | |
1015 | destroy_inv (false); |
1044 | destroy_inv_fast (); |
1016 | |
1045 | |
1017 | if (is_head ()) |
1046 | if (is_head ()) |
1018 | if (sound_destroy) |
1047 | if (sound_destroy) |
1019 | play_sound (sound_destroy); |
1048 | play_sound (sound_destroy); |
1020 | else if (flag [FLAG_MONSTER]) |
1049 | else if (flag [FLAG_MONSTER]) |
… | |
… | |
1031 | * the previous environment. |
1060 | * the previous environment. |
1032 | */ |
1061 | */ |
1033 | void |
1062 | void |
1034 | object::do_remove () |
1063 | object::do_remove () |
1035 | { |
1064 | { |
1036 | object *tmp, *last = 0; |
|
|
1037 | object *otmp; |
|
|
1038 | |
|
|
1039 | if (flag [FLAG_REMOVED]) |
1065 | if (flag [FLAG_REMOVED]) |
1040 | return; |
1066 | return; |
1041 | |
1067 | |
1042 | INVOKE_OBJECT (REMOVE, this); |
1068 | INVOKE_OBJECT (REMOVE, this); |
1043 | |
1069 | |
… | |
… | |
1075 | |
1101 | |
1076 | above = 0; |
1102 | above = 0; |
1077 | below = 0; |
1103 | below = 0; |
1078 | env = 0; |
1104 | env = 0; |
1079 | |
1105 | |
1080 | /* NO_FIX_PLAYER is set when a great many changes are being |
1106 | if (pl && pl->is_player ()) |
1081 | * made to players inventory. If set, avoiding the call |
|
|
1082 | * to save cpu time. |
|
|
1083 | */ |
1107 | { |
1084 | if (pl) |
1108 | if (expect_false (pl->contr->combat_ob == this)) |
1085 | if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER))) |
|
|
1086 | { |
1109 | { |
1087 | pl->update_stats (); |
1110 | pl->apply (pl->contr->combat_ob, AP_UNAPPLY); |
|
|
1111 | pl->contr->combat_ob = 0; |
|
|
1112 | if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob); |
|
|
1113 | } |
1088 | |
1114 | |
|
|
1115 | if (expect_false (pl->contr->ranged_ob == this)) |
|
|
1116 | { |
|
|
1117 | pl->apply (pl->contr->ranged_ob, AP_UNAPPLY); |
|
|
1118 | pl->contr->ranged_ob = 0; |
|
|
1119 | if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob); |
|
|
1120 | } |
|
|
1121 | |
|
|
1122 | pl->contr->queue_stats_update (); |
|
|
1123 | |
1089 | if (glow_radius && pl->is_on_map ()) |
1124 | if (expect_false (glow_radius) && pl->is_on_map ()) |
1090 | update_all_los (pl->map, pl->x, pl->y); |
1125 | update_all_los (pl->map, pl->x, pl->y); |
1091 | } |
1126 | } |
1092 | } |
1127 | } |
1093 | else if (map) |
1128 | else if (map) |
1094 | { |
1129 | { |
1095 | map->dirty = true; |
1130 | map->dirty = true; |
1096 | mapspace &ms = this->ms (); |
1131 | mapspace &ms = this->ms (); |
… | |
… | |
1109 | close_container (); |
1144 | close_container (); |
1110 | |
1145 | |
1111 | --map->players; |
1146 | --map->players; |
1112 | map->touch (); |
1147 | map->touch (); |
1113 | } |
1148 | } |
1114 | else if (pl->container == this) |
1149 | else if (pl->container_ () == this) |
1115 | { |
1150 | { |
1116 | // removing a container should close it |
1151 | // removing a container should close it |
1117 | close_container (); |
1152 | close_container (); |
1118 | } |
1153 | } |
1119 | |
1154 | |
… | |
… | |
1135 | |
1170 | |
1136 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1171 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1137 | |
1172 | |
1138 | if (object *pl = ms.player ()) |
1173 | if (object *pl = ms.player ()) |
1139 | { |
1174 | { |
1140 | if (pl->container == this) |
1175 | if (pl->container_ () == this) |
1141 | /* If a container that the player is currently using somehow gets |
1176 | /* If a container that the player is currently using somehow gets |
1142 | * removed (most likely destroyed), update the player view |
1177 | * removed (most likely destroyed), update the player view |
1143 | * appropriately. |
1178 | * appropriately. |
1144 | */ |
1179 | */ |
1145 | pl->close_container (); |
1180 | pl->close_container (); |
… | |
… | |
1149 | //TODO: update floorbox to preserve ordering |
1184 | //TODO: update floorbox to preserve ordering |
1150 | if (pl->contr->ns) |
1185 | if (pl->contr->ns) |
1151 | pl->contr->ns->floorbox_update (); |
1186 | pl->contr->ns->floorbox_update (); |
1152 | } |
1187 | } |
1153 | |
1188 | |
|
|
1189 | if (check_walk_off) |
1154 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1190 | for (object *above, *tmp = ms.bot; tmp; tmp = above) |
1155 | { |
1191 | { |
|
|
1192 | above = tmp->above; |
|
|
1193 | |
1156 | /* No point updating the players look faces if he is the object |
1194 | /* No point updating the players look faces if he is the object |
1157 | * being removed. |
1195 | * being removed. |
1158 | */ |
1196 | */ |
1159 | |
1197 | |
1160 | /* See if object moving off should effect something */ |
1198 | /* See if object moving off should effect something */ |
1161 | if (check_walk_off |
|
|
1162 | && ((move_type & tmp->move_off) |
1199 | if ((move_type & tmp->move_off) |
1163 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1200 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0) |
1164 | { |
|
|
1165 | move_apply (tmp, this, 0); |
1201 | move_apply (tmp, this, 0); |
1166 | |
|
|
1167 | if (destroyed ()) |
|
|
1168 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
|
|
1169 | } |
1202 | } |
1170 | |
|
|
1171 | last = tmp; |
|
|
1172 | } |
|
|
1173 | |
1203 | |
1174 | if (affects_los ()) |
1204 | if (affects_los ()) |
1175 | update_all_los (map, x, y); |
1205 | update_all_los (map, x, y); |
1176 | } |
1206 | } |
1177 | } |
1207 | } |
… | |
… | |
1221 | |
1251 | |
1222 | object *prev = this; |
1252 | object *prev = this; |
1223 | |
1253 | |
1224 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1254 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1225 | { |
1255 | { |
1226 | object *op = arch_to_object (at); |
1256 | object *op = at->instance (); |
1227 | |
1257 | |
1228 | op->name = name; |
1258 | op->name = name; |
1229 | op->name_pl = name_pl; |
1259 | op->name_pl = name_pl; |
1230 | op->title = title; |
1260 | op->title = title; |
1231 | |
1261 | |
… | |
… | |
1269 | * Passing 0 for flag gives proper default values, so flag really only needs |
1299 | * Passing 0 for flag gives proper default values, so flag really only needs |
1270 | * to be set if special handling is needed. |
1300 | * to be set if special handling is needed. |
1271 | * |
1301 | * |
1272 | * Return value: |
1302 | * Return value: |
1273 | * new object if 'op' was merged with other object |
1303 | * new object if 'op' was merged with other object |
1274 | * NULL if 'op' was destroyed |
1304 | * NULL if there was an error (destroyed, blocked etc.) |
1275 | * just 'op' otherwise |
1305 | * just 'op' otherwise |
1276 | */ |
1306 | */ |
1277 | object * |
1307 | object * |
1278 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1308 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1279 | { |
1309 | { |
… | |
… | |
1477 | * blocked() and wall() work properly), and these flags are updated by |
1507 | * blocked() and wall() work properly), and these flags are updated by |
1478 | * update_object(). |
1508 | * update_object(). |
1479 | */ |
1509 | */ |
1480 | |
1510 | |
1481 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1511 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1482 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1512 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1483 | { |
1513 | { |
1484 | if (check_move_on (op, originator)) |
1514 | if (check_move_on (op, originator)) |
1485 | return 0; |
1515 | return 0; |
1486 | |
1516 | |
1487 | /* If we are a multi part object, lets work our way through the check |
1517 | /* If we are a multi part object, lets work our way through the check |
… | |
… | |
1506 | |
1536 | |
1507 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1537 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1508 | if (tmp->arch->archname == archname) /* same archetype */ |
1538 | if (tmp->arch->archname == archname) /* same archetype */ |
1509 | tmp->destroy (); |
1539 | tmp->destroy (); |
1510 | |
1540 | |
1511 | object *tmp = arch_to_object (archetype::find (archname)); |
1541 | object *tmp = archetype::find (archname)->instance (); |
1512 | |
1542 | |
1513 | tmp->x = op->x; |
1543 | tmp->x = op->x; |
1514 | tmp->y = op->y; |
1544 | tmp->y = op->y; |
1515 | |
1545 | |
1516 | insert_ob_in_map (tmp, op->map, op, 0); |
1546 | insert_ob_in_map (tmp, op->map, op, 0); |
… | |
… | |
1521 | { |
1551 | { |
1522 | if (where->env) |
1552 | if (where->env) |
1523 | return where->env->insert (this); |
1553 | return where->env->insert (this); |
1524 | else |
1554 | else |
1525 | return where->map->insert (this, where->x, where->y, originator, flags); |
1555 | return where->map->insert (this, where->x, where->y, originator, flags); |
|
|
1556 | } |
|
|
1557 | |
|
|
1558 | // check whether we can put this into the map, respect max_volume, max_items |
|
|
1559 | bool |
|
|
1560 | object::can_drop_at (maptile *m, int x, int y, object *originator) |
|
|
1561 | { |
|
|
1562 | mapspace &ms = m->at (x, y); |
|
|
1563 | |
|
|
1564 | int items = ms.items (); |
|
|
1565 | |
|
|
1566 | if (!items // testing !items ensures we can drop at least one item |
|
|
1567 | || (items < m->max_items |
|
|
1568 | && ms.volume () < m->max_volume)) |
|
|
1569 | return true; |
|
|
1570 | |
|
|
1571 | if (originator && originator->is_player ()) |
|
|
1572 | originator->contr->failmsg (format ( |
|
|
1573 | "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>", |
|
|
1574 | query_name () |
|
|
1575 | )); |
|
|
1576 | |
|
|
1577 | return false; |
1526 | } |
1578 | } |
1527 | |
1579 | |
1528 | /* |
1580 | /* |
1529 | * decrease(object, number) decreases a specified number from |
1581 | * decrease(object, number) decreases a specified number from |
1530 | * the amount of an object. If the amount reaches 0, the object |
1582 | * the amount of an object. If the amount reaches 0, the object |
… | |
… | |
1670 | if (op->glow_radius && is_on_map ()) |
1722 | if (op->glow_radius && is_on_map ()) |
1671 | { |
1723 | { |
1672 | update_stats (); |
1724 | update_stats (); |
1673 | update_all_los (map, x, y); |
1725 | update_all_los (map, x, y); |
1674 | } |
1726 | } |
1675 | else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) |
1727 | else if (is_player ()) |
1676 | // if this is a player's inventory, update stats |
1728 | // if this is a player's inventory, update stats |
1677 | update_stats (); |
1729 | contr->queue_stats_update (); |
1678 | |
1730 | |
1679 | INVOKE_OBJECT (INSERT, this); |
1731 | INVOKE_OBJECT (INSERT, this); |
1680 | |
1732 | |
1681 | return op; |
1733 | return op; |
1682 | } |
1734 | } |
… | |
… | |
1702 | * on top. |
1754 | * on top. |
1703 | */ |
1755 | */ |
1704 | int |
1756 | int |
1705 | check_move_on (object *op, object *originator) |
1757 | check_move_on (object *op, object *originator) |
1706 | { |
1758 | { |
|
|
1759 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
|
|
1760 | return 0; |
|
|
1761 | |
1707 | object *tmp; |
1762 | object *tmp; |
1708 | maptile *m = op->map; |
1763 | maptile *m = op->map; |
1709 | int x = op->x, y = op->y; |
1764 | int x = op->x, y = op->y; |
1710 | |
1765 | |
1711 | MoveType move_on, move_slow, move_block; |
1766 | mapspace &ms = m->at (x, y); |
1712 | |
1767 | |
1713 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1768 | ms.update (); |
1714 | return 0; |
|
|
1715 | |
1769 | |
1716 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1770 | MoveType move_on = ms.move_on; |
1717 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1771 | MoveType move_slow = ms.move_slow; |
1718 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1772 | MoveType move_block = ms.move_block; |
1719 | |
1773 | |
1720 | /* if nothing on this space will slow op down or be applied, |
1774 | /* if nothing on this space will slow op down or be applied, |
1721 | * no need to do checking below. have to make sure move_type |
1775 | * no need to do checking below. have to make sure move_type |
1722 | * is set, as lots of objects don't have it set - we treat that |
1776 | * is set, as lots of objects don't have it set - we treat that |
1723 | * as walking. |
1777 | * as walking. |
… | |
… | |
1734 | return 0; |
1788 | return 0; |
1735 | |
1789 | |
1736 | /* The objects have to be checked from top to bottom. |
1790 | /* The objects have to be checked from top to bottom. |
1737 | * Hence, we first go to the top: |
1791 | * Hence, we first go to the top: |
1738 | */ |
1792 | */ |
1739 | |
1793 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1740 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
|
|
1741 | { |
|
|
1742 | /* Trim the search when we find the first other spell effect |
|
|
1743 | * this helps performance so that if a space has 50 spell objects, |
|
|
1744 | * we don't need to check all of them. |
|
|
1745 | */ |
|
|
1746 | if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK)) |
|
|
1747 | break; |
|
|
1748 | } |
1794 | { |
|
|
1795 | next = tmp->below; |
1749 | |
1796 | |
1750 | for (; tmp; tmp = tmp->below) |
|
|
1751 | { |
|
|
1752 | if (tmp == op) |
1797 | if (tmp == op) |
1753 | continue; /* Can't apply yourself */ |
1798 | continue; /* Can't apply yourself */ |
1754 | |
1799 | |
1755 | /* Check to see if one of the movement types should be slowed down. |
1800 | /* Check to see if one of the movement types should be slowed down. |
1756 | * Second check makes sure that the movement types not being slowed |
1801 | * Second check makes sure that the movement types not being slowed |
… | |
… | |
1761 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1806 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1762 | { |
1807 | { |
1763 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1808 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1764 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1809 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1765 | { |
1810 | { |
1766 | |
|
|
1767 | float |
|
|
1768 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1811 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
1769 | |
1812 | |
1770 | if (op->is_player ()) |
1813 | if (op->is_player ()) |
1771 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1814 | if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) || |
1772 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1815 | (tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN))) |
1773 | diff /= 4.0; |
1816 | diff /= 4.0; |
1774 | |
1817 | |
1775 | op->speed_left -= diff; |
1818 | op->speed_left -= diff; |
1776 | } |
1819 | } |
1777 | } |
1820 | } |
… | |
… | |
2178 | * This basically means that if direction is 15, then it could either go |
2221 | * This basically means that if direction is 15, then it could either go |
2179 | * direction 4, 14, or 16 to get back to where we are. |
2222 | * direction 4, 14, or 16 to get back to where we are. |
2180 | * Moved from spell_util.c to object.c with the other related direction |
2223 | * Moved from spell_util.c to object.c with the other related direction |
2181 | * functions. |
2224 | * functions. |
2182 | */ |
2225 | */ |
2183 | const int reduction_dir[SIZEOFFREE][3] = { |
2226 | static const int reduction_dir[SIZEOFFREE][3] = { |
2184 | {0, 0, 0}, /* 0 */ |
2227 | {0, 0, 0}, /* 0 */ |
2185 | {0, 0, 0}, /* 1 */ |
2228 | {0, 0, 0}, /* 1 */ |
2186 | {0, 0, 0}, /* 2 */ |
2229 | {0, 0, 0}, /* 2 */ |
2187 | {0, 0, 0}, /* 3 */ |
2230 | {0, 0, 0}, /* 3 */ |
2188 | {0, 0, 0}, /* 4 */ |
2231 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2459 | { |
2502 | { |
2460 | return map ? map->region (x, y) |
2503 | return map ? map->region (x, y) |
2461 | : region::default_region (); |
2504 | : region::default_region (); |
2462 | } |
2505 | } |
2463 | |
2506 | |
2464 | const materialtype_t * |
|
|
2465 | object::dominant_material () const |
|
|
2466 | { |
|
|
2467 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2468 | return mt; |
|
|
2469 | |
|
|
2470 | return name_to_material (shstr_unknown); |
|
|
2471 | } |
|
|
2472 | |
|
|
2473 | void |
2507 | void |
2474 | object::open_container (object *new_container) |
2508 | object::open_container (object *new_container) |
2475 | { |
2509 | { |
2476 | if (container == new_container) |
2510 | if (container == new_container) |
2477 | return; |
2511 | return; |
… | |
… | |
2511 | // TODO: this does not seem to serve any purpose anymore? |
2545 | // TODO: this does not seem to serve any purpose anymore? |
2512 | #if 0 |
2546 | #if 0 |
2513 | // insert the "Close Container" object. |
2547 | // insert the "Close Container" object. |
2514 | if (archetype *closer = new_container->other_arch) |
2548 | if (archetype *closer = new_container->other_arch) |
2515 | { |
2549 | { |
2516 | object *closer = arch_to_object (new_container->other_arch); |
2550 | object *closer = new_container->other_arch->instance (); |
2517 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2551 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2518 | new_container->insert (closer); |
2552 | new_container->insert (closer); |
2519 | } |
2553 | } |
2520 | #endif |
2554 | #endif |
2521 | |
2555 | |
… | |
… | |
2547 | return splay (tmp); |
2581 | return splay (tmp); |
2548 | |
2582 | |
2549 | return 0; |
2583 | return 0; |
2550 | } |
2584 | } |
2551 | |
2585 | |
|
|
2586 | //-GPL |
|
|
2587 | |
|
|
2588 | void |
|
|
2589 | object::force_set_timer (int duration) |
|
|
2590 | { |
|
|
2591 | this->duration = 1; |
|
|
2592 | this->speed_left = -1.f; |
|
|
2593 | |
|
|
2594 | this->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2595 | } |
|
|
2596 | |
2552 | object * |
2597 | object * |
2553 | object::force_add (shstr_tmp name, int duration) |
2598 | object::force_add (shstr_tmp name, int duration) |
2554 | { |
2599 | { |
2555 | if (object *force = force_find (name)) |
2600 | if (object *force = force_find (name)) |
2556 | force->destroy (); |
2601 | force->destroy (); |
2557 | |
2602 | |
2558 | object *force = get_archetype (FORCE_NAME); |
2603 | object *force = get_archetype (FORCE_NAME); |
2559 | |
2604 | |
2560 | force->slaying = name; |
2605 | force->slaying = name; |
2561 | force->stats.food = 1; |
2606 | force->force_set_timer (duration); |
2562 | force->speed_left = -1.f; |
|
|
2563 | |
|
|
2564 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2565 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2566 | force->flag [FLAG_APPLIED] = true; |
2607 | force->flag [FLAG_APPLIED] = true; |
2567 | |
2608 | |
2568 | return insert (force); |
2609 | return insert (force); |
2569 | } |
2610 | } |
2570 | |
2611 | |
2571 | void |
2612 | void |
… | |
… | |
2620 | |
2661 | |
2621 | insert (force); |
2662 | insert (force); |
2622 | } |
2663 | } |
2623 | } |
2664 | } |
2624 | |
2665 | |
|
|
2666 | void object::change_move_type (MoveType mt) |
|
|
2667 | { |
|
|
2668 | if (move_type == mt) |
|
|
2669 | return; |
|
|
2670 | |
|
|
2671 | if (is_on_map ()) |
|
|
2672 | { |
|
|
2673 | // we are on the map, so handle move_on/off effects |
|
|
2674 | remove (); |
|
|
2675 | move_type = mt; |
|
|
2676 | map->insert (this, x, y, this); |
|
|
2677 | } |
|
|
2678 | else |
|
|
2679 | move_type = mt; |
|
|
2680 | } |
|
|
2681 | |