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 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) |
… | |
… | |
328 | // the player inventory itself is always visible |
396 | // the player inventory itself is always visible |
329 | if (env->is_player ()) |
397 | if (env->is_player ()) |
330 | return env; |
398 | return env; |
331 | |
399 | |
332 | // else a player could have our env open |
400 | // else a player could have our env open |
333 | object *envest = env->outer_env (); |
401 | object *envest = env->outer_env_or_self (); |
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 | |
… | |
… | |
555 | update_stats (); |
621 | update_stats (); |
556 | |
622 | |
557 | new_draw_info_format (NDI_UNIQUE, 0, this, |
623 | new_draw_info_format (NDI_UNIQUE, 0, this, |
558 | "You try to balance all your items at once, " |
624 | "You try to balance all your items at once, " |
559 | "but the %s is just too much for your body. " |
625 | "but the %s is just too much for your body. " |
560 | "[You need to unapply some items first.]", &ob->name); |
626 | "[You need to unapply some items first - use the 'body' command to see " |
|
|
627 | "how many items you cna wera on a specific body part.]", &ob->name); |
561 | return false; |
628 | return false; |
562 | } |
629 | } |
563 | |
630 | |
564 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
631 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
565 | } |
632 | } |
… | |
… | |
634 | tail = new_link; |
701 | tail = new_link; |
635 | } |
702 | } |
636 | } |
703 | } |
637 | } |
704 | } |
638 | |
705 | |
639 | if (speed < 0) |
|
|
640 | dst->speed_left -= rndm (); |
|
|
641 | |
|
|
642 | dst->activate (); |
706 | dst->activate (); |
643 | } |
707 | } |
644 | |
708 | |
645 | void |
709 | void |
646 | object::instantiate () |
710 | object::instantiate () |
647 | { |
711 | { |
648 | if (!uuid.seq) // HACK |
712 | if (!uuid.seq) // HACK |
649 | uuid = UUID::gen (); |
713 | uuid = UUID::gen (); |
650 | |
714 | |
|
|
715 | // TODO: unclean state changes, should nt be done in copy_to AND instantiate |
|
|
716 | if (flag [FLAG_RANDOM_SPEED] && speed) |
|
|
717 | speed_left = - speed - rndm (); // TODO animation |
|
|
718 | else |
651 | speed_left = -0.1f; |
719 | speed_left = -1.; |
|
|
720 | |
652 | /* copy the body_info to the body_used - this is only really |
721 | /* 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. |
722 | * 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 |
723 | * by doing so, when a monster is created, it has good starting |
655 | * values for the body_used info, so when items are created |
724 | * values for the body_used info, so when items are created |
656 | * for it, they can be properly equipped. |
725 | * for it, they can be properly equipped. |
… | |
… | |
664 | object * |
733 | object * |
665 | object::clone () |
734 | object::clone () |
666 | { |
735 | { |
667 | object *neu = create (); |
736 | object *neu = create (); |
668 | copy_to (neu); |
737 | copy_to (neu); |
|
|
738 | |
|
|
739 | // TODO: unclean state changes, should not be done in clone AND instantiate |
|
|
740 | if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed) |
|
|
741 | neu->speed_left = - neu->speed - rndm (); // TODO animation |
|
|
742 | |
669 | neu->map = map; // not copied by copy_to |
743 | neu->map = map; // not copied by copy_to |
670 | return neu; |
744 | return neu; |
671 | } |
745 | } |
672 | |
746 | |
673 | /* |
747 | /* |
… | |
… | |
691 | * This function needs to be called whenever the speed of an object changes. |
765 | * This function needs to be called whenever the speed of an object changes. |
692 | */ |
766 | */ |
693 | void |
767 | void |
694 | object::set_speed (float speed) |
768 | object::set_speed (float speed) |
695 | { |
769 | { |
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; |
770 | this->speed = speed; |
703 | |
771 | |
704 | if (has_active_speed ()) |
772 | if (has_active_speed ()) |
705 | activate (); |
773 | activate (); |
706 | else |
774 | else |
… | |
… | |
756 | |
824 | |
757 | if (!(m.flags_ & P_UPTODATE)) |
825 | if (!(m.flags_ & P_UPTODATE)) |
758 | /* nop */; |
826 | /* nop */; |
759 | else if (action == UP_OBJ_INSERT) |
827 | else if (action == UP_OBJ_INSERT) |
760 | { |
828 | { |
|
|
829 | #if 0 |
761 | // this is likely overkill, TODO: revisit (schmorp) |
830 | // this is likely overkill, TODO: revisit (schmorp) |
762 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
831 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
763 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
832 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
764 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
833 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
765 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
834 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
… | |
… | |
770 | || (m.move_slow | op->move_slow) != m.move_slow |
839 | || (m.move_slow | op->move_slow) != m.move_slow |
771 | /* This isn't perfect, but I don't expect a lot of objects to |
840 | /* This isn't perfect, but I don't expect a lot of objects to |
772 | * have move_allow right now. |
841 | * have move_allow right now. |
773 | */ |
842 | */ |
774 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
843 | || ((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 (); |
844 | m.invalidate (); |
|
|
845 | #else |
|
|
846 | // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp) |
|
|
847 | m.invalidate (); |
|
|
848 | #endif |
777 | } |
849 | } |
778 | /* if the object is being removed, we can't make intelligent |
850 | /* if the object is being removed, we can't make intelligent |
779 | * decisions, because remove_ob can't really pass the object |
851 | * decisions, because remove_ob can't really pass the object |
780 | * that is being removed. |
852 | * that is being removed. |
781 | */ |
853 | */ |
… | |
… | |
792 | |
864 | |
793 | object::object () |
865 | object::object () |
794 | { |
866 | { |
795 | SET_FLAG (this, FLAG_REMOVED); |
867 | SET_FLAG (this, FLAG_REMOVED); |
796 | |
868 | |
797 | expmul = 1.0; |
869 | //expmul = 1.0; declared const for the time being |
798 | face = blank_face; |
870 | face = blank_face; |
|
|
871 | material = MATERIAL_NULL; |
799 | } |
872 | } |
800 | |
873 | |
801 | object::~object () |
874 | object::~object () |
802 | { |
875 | { |
803 | unlink (); |
876 | unlink (); |
… | |
… | |
831 | { |
904 | { |
832 | /* If already on active list, don't do anything */ |
905 | /* If already on active list, don't do anything */ |
833 | if (active) |
906 | if (active) |
834 | return; |
907 | return; |
835 | |
908 | |
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 ()) |
909 | if (has_active_speed ()) |
|
|
910 | { |
|
|
911 | if (flag [FLAG_FREED]) |
|
|
912 | LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D |
|
|
913 | |
840 | actives.insert (this); |
914 | actives.insert (this); |
|
|
915 | } |
841 | } |
916 | } |
842 | |
917 | |
843 | void |
918 | void |
844 | object::activate_recursive () |
919 | object::activate_recursive () |
845 | { |
920 | { |
… | |
… | |
1031 | * the previous environment. |
1106 | * the previous environment. |
1032 | */ |
1107 | */ |
1033 | void |
1108 | void |
1034 | object::do_remove () |
1109 | object::do_remove () |
1035 | { |
1110 | { |
1036 | object *tmp, *last = 0; |
|
|
1037 | object *otmp; |
|
|
1038 | |
|
|
1039 | if (flag [FLAG_REMOVED]) |
1111 | if (flag [FLAG_REMOVED]) |
1040 | return; |
1112 | return; |
1041 | |
1113 | |
1042 | INVOKE_OBJECT (REMOVE, this); |
1114 | INVOKE_OBJECT (REMOVE, this); |
1043 | |
1115 | |
… | |
… | |
1075 | |
1147 | |
1076 | above = 0; |
1148 | above = 0; |
1077 | below = 0; |
1149 | below = 0; |
1078 | env = 0; |
1150 | env = 0; |
1079 | |
1151 | |
1080 | /* NO_FIX_PLAYER is set when a great many changes are being |
1152 | if (pl && pl->is_player ()) |
1081 | * made to players inventory. If set, avoiding the call |
|
|
1082 | * to save cpu time. |
|
|
1083 | */ |
|
|
1084 | if (pl) |
|
|
1085 | if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER))) |
|
|
1086 | { |
1153 | { |
1087 | pl->update_stats (); |
1154 | pl->contr->queue_stats_update (); |
1088 | |
1155 | |
1089 | if (glow_radius && pl->is_on_map ()) |
1156 | if (glow_radius && pl->is_on_map ()) |
1090 | update_all_los (pl->map, pl->x, pl->y); |
1157 | update_all_los (pl->map, pl->x, pl->y); |
1091 | } |
1158 | } |
1092 | } |
1159 | } |
1093 | else if (map) |
1160 | else if (map) |
1094 | { |
1161 | { |
1095 | map->dirty = true; |
1162 | map->dirty = true; |
1096 | mapspace &ms = this->ms (); |
1163 | mapspace &ms = this->ms (); |
… | |
… | |
1109 | close_container (); |
1176 | close_container (); |
1110 | |
1177 | |
1111 | --map->players; |
1178 | --map->players; |
1112 | map->touch (); |
1179 | map->touch (); |
1113 | } |
1180 | } |
1114 | else if (pl->container == this) |
1181 | else if (pl->container_ () == this) |
1115 | { |
1182 | { |
1116 | // removing a container should close it |
1183 | // removing a container should close it |
1117 | close_container (); |
1184 | close_container (); |
1118 | } |
1185 | } |
1119 | |
1186 | |
… | |
… | |
1135 | |
1202 | |
1136 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1203 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1137 | |
1204 | |
1138 | if (object *pl = ms.player ()) |
1205 | if (object *pl = ms.player ()) |
1139 | { |
1206 | { |
1140 | if (pl->container == this) |
1207 | if (pl->container_ () == this) |
1141 | /* If a container that the player is currently using somehow gets |
1208 | /* If a container that the player is currently using somehow gets |
1142 | * removed (most likely destroyed), update the player view |
1209 | * removed (most likely destroyed), update the player view |
1143 | * appropriately. |
1210 | * appropriately. |
1144 | */ |
1211 | */ |
1145 | pl->close_container (); |
1212 | pl->close_container (); |
… | |
… | |
1149 | //TODO: update floorbox to preserve ordering |
1216 | //TODO: update floorbox to preserve ordering |
1150 | if (pl->contr->ns) |
1217 | if (pl->contr->ns) |
1151 | pl->contr->ns->floorbox_update (); |
1218 | pl->contr->ns->floorbox_update (); |
1152 | } |
1219 | } |
1153 | |
1220 | |
|
|
1221 | if (check_walk_off) |
1154 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1222 | for (object *above, *tmp = ms.bot; tmp; tmp = above) |
1155 | { |
1223 | { |
|
|
1224 | above = tmp->above; |
|
|
1225 | |
1156 | /* No point updating the players look faces if he is the object |
1226 | /* No point updating the players look faces if he is the object |
1157 | * being removed. |
1227 | * being removed. |
1158 | */ |
1228 | */ |
1159 | |
1229 | |
1160 | /* See if object moving off should effect something */ |
1230 | /* See if object moving off should effect something */ |
1161 | if (check_walk_off |
|
|
1162 | && ((move_type & tmp->move_off) |
1231 | if ((move_type & tmp->move_off) |
1163 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1232 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0) |
1164 | { |
|
|
1165 | move_apply (tmp, this, 0); |
1233 | 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 | } |
1234 | } |
1170 | |
|
|
1171 | last = tmp; |
|
|
1172 | } |
|
|
1173 | |
1235 | |
1174 | if (affects_los ()) |
1236 | if (affects_los ()) |
1175 | update_all_los (map, x, y); |
1237 | update_all_los (map, x, y); |
1176 | } |
1238 | } |
1177 | } |
1239 | } |
… | |
… | |
1221 | |
1283 | |
1222 | object *prev = this; |
1284 | object *prev = this; |
1223 | |
1285 | |
1224 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1286 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1225 | { |
1287 | { |
1226 | object *op = arch_to_object (at); |
1288 | object *op = at->instance (); |
1227 | |
1289 | |
1228 | op->name = name; |
1290 | op->name = name; |
1229 | op->name_pl = name_pl; |
1291 | op->name_pl = name_pl; |
1230 | op->title = title; |
1292 | op->title = title; |
1231 | |
1293 | |
… | |
… | |
1269 | * Passing 0 for flag gives proper default values, so flag really only needs |
1331 | * Passing 0 for flag gives proper default values, so flag really only needs |
1270 | * to be set if special handling is needed. |
1332 | * to be set if special handling is needed. |
1271 | * |
1333 | * |
1272 | * Return value: |
1334 | * Return value: |
1273 | * new object if 'op' was merged with other object |
1335 | * new object if 'op' was merged with other object |
1274 | * NULL if 'op' was destroyed |
1336 | * NULL if there was an error (destroyed, blocked etc.) |
1275 | * just 'op' otherwise |
1337 | * just 'op' otherwise |
1276 | */ |
1338 | */ |
1277 | object * |
1339 | object * |
1278 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1340 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1279 | { |
1341 | { |
… | |
… | |
1297 | |
1359 | |
1298 | if (object *more = op->more) |
1360 | if (object *more = op->more) |
1299 | if (!insert_ob_in_map (more, m, originator, flag)) |
1361 | if (!insert_ob_in_map (more, m, originator, flag)) |
1300 | return 0; |
1362 | return 0; |
1301 | |
1363 | |
1302 | CLEAR_FLAG (op, FLAG_REMOVED); |
1364 | op->flag [FLAG_REMOVED] = false; |
1303 | |
1365 | op->env = 0; |
1304 | op->map = newmap; |
1366 | op->map = newmap; |
|
|
1367 | |
1305 | mapspace &ms = op->ms (); |
1368 | mapspace &ms = op->ms (); |
1306 | |
1369 | |
1307 | /* this has to be done after we translate the coordinates. |
1370 | /* this has to be done after we translate the coordinates. |
1308 | */ |
1371 | */ |
1309 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1372 | if (op->nrof && !(flag & INS_NO_MERGE)) |
… | |
… | |
1330 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1393 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1331 | abort (); |
1394 | abort (); |
1332 | } |
1395 | } |
1333 | |
1396 | |
1334 | if (!originator->is_on_map ()) |
1397 | if (!originator->is_on_map ()) |
|
|
1398 | { |
1335 | LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", |
1399 | LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", |
1336 | op->debug_desc (), originator->debug_desc ()); |
1400 | op->debug_desc (), originator->debug_desc ()); |
|
|
1401 | abort (); |
|
|
1402 | } |
1337 | |
1403 | |
1338 | op->above = originator; |
1404 | op->above = originator; |
1339 | op->below = originator->below; |
1405 | op->below = originator->below; |
1340 | originator->below = op; |
1406 | originator->below = op; |
1341 | |
1407 | |
… | |
… | |
1473 | * blocked() and wall() work properly), and these flags are updated by |
1539 | * blocked() and wall() work properly), and these flags are updated by |
1474 | * update_object(). |
1540 | * update_object(). |
1475 | */ |
1541 | */ |
1476 | |
1542 | |
1477 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1543 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1478 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1544 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1479 | { |
1545 | { |
1480 | if (check_move_on (op, originator)) |
1546 | if (check_move_on (op, originator)) |
1481 | return 0; |
1547 | return 0; |
1482 | |
1548 | |
1483 | /* If we are a multi part object, lets work our way through the check |
1549 | /* If we are a multi part object, lets work our way through the check |
… | |
… | |
1502 | |
1568 | |
1503 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1569 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1504 | if (tmp->arch->archname == archname) /* same archetype */ |
1570 | if (tmp->arch->archname == archname) /* same archetype */ |
1505 | tmp->destroy (); |
1571 | tmp->destroy (); |
1506 | |
1572 | |
1507 | object *tmp = arch_to_object (archetype::find (archname)); |
1573 | object *tmp = archetype::find (archname)->instance (); |
1508 | |
1574 | |
1509 | tmp->x = op->x; |
1575 | tmp->x = op->x; |
1510 | tmp->y = op->y; |
1576 | tmp->y = op->y; |
1511 | |
1577 | |
1512 | insert_ob_in_map (tmp, op->map, op, 0); |
1578 | insert_ob_in_map (tmp, op->map, op, 0); |
… | |
… | |
1517 | { |
1583 | { |
1518 | if (where->env) |
1584 | if (where->env) |
1519 | return where->env->insert (this); |
1585 | return where->env->insert (this); |
1520 | else |
1586 | else |
1521 | return where->map->insert (this, where->x, where->y, originator, flags); |
1587 | return where->map->insert (this, where->x, where->y, originator, flags); |
|
|
1588 | } |
|
|
1589 | |
|
|
1590 | // check whether we can put this into the map, respect max_volume, max_items |
|
|
1591 | bool |
|
|
1592 | object::can_drop_at (maptile *m, int x, int y, object *originator) |
|
|
1593 | { |
|
|
1594 | mapspace &ms = m->at (x, y); |
|
|
1595 | |
|
|
1596 | int items = ms.items (); |
|
|
1597 | |
|
|
1598 | if (!items // testing !items ensures we can drop at least one item |
|
|
1599 | || (items < m->max_items |
|
|
1600 | && ms.volume () < m->max_volume)) |
|
|
1601 | return true; |
|
|
1602 | |
|
|
1603 | if (originator && originator->is_player ()) |
|
|
1604 | originator->contr->failmsg (format ( |
|
|
1605 | "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>", |
|
|
1606 | query_name () |
|
|
1607 | )); |
|
|
1608 | |
|
|
1609 | return false; |
1522 | } |
1610 | } |
1523 | |
1611 | |
1524 | /* |
1612 | /* |
1525 | * decrease(object, number) decreases a specified number from |
1613 | * decrease(object, number) decreases a specified number from |
1526 | * the amount of an object. If the amount reaches 0, the object |
1614 | * the amount of an object. If the amount reaches 0, the object |
… | |
… | |
1666 | if (op->glow_radius && is_on_map ()) |
1754 | if (op->glow_radius && is_on_map ()) |
1667 | { |
1755 | { |
1668 | update_stats (); |
1756 | update_stats (); |
1669 | update_all_los (map, x, y); |
1757 | update_all_los (map, x, y); |
1670 | } |
1758 | } |
1671 | else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) |
1759 | else if (is_player ()) |
1672 | // if this is a player's inventory, update stats |
1760 | // if this is a player's inventory, update stats |
1673 | update_stats (); |
1761 | contr->queue_stats_update (); |
1674 | |
1762 | |
1675 | INVOKE_OBJECT (INSERT, this); |
1763 | INVOKE_OBJECT (INSERT, this); |
1676 | |
1764 | |
1677 | return op; |
1765 | return op; |
1678 | } |
1766 | } |
… | |
… | |
1698 | * on top. |
1786 | * on top. |
1699 | */ |
1787 | */ |
1700 | int |
1788 | int |
1701 | check_move_on (object *op, object *originator) |
1789 | check_move_on (object *op, object *originator) |
1702 | { |
1790 | { |
|
|
1791 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
|
|
1792 | return 0; |
|
|
1793 | |
1703 | object *tmp; |
1794 | object *tmp; |
1704 | maptile *m = op->map; |
1795 | maptile *m = op->map; |
1705 | int x = op->x, y = op->y; |
1796 | int x = op->x, y = op->y; |
1706 | |
1797 | |
1707 | MoveType move_on, move_slow, move_block; |
1798 | mapspace &ms = m->at (x, y); |
1708 | |
1799 | |
1709 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1800 | ms.update (); |
1710 | return 0; |
|
|
1711 | |
1801 | |
1712 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1802 | MoveType move_on = ms.move_on; |
1713 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1803 | MoveType move_slow = ms.move_slow; |
1714 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1804 | MoveType move_block = ms.move_block; |
1715 | |
1805 | |
1716 | /* if nothing on this space will slow op down or be applied, |
1806 | /* if nothing on this space will slow op down or be applied, |
1717 | * no need to do checking below. have to make sure move_type |
1807 | * no need to do checking below. have to make sure move_type |
1718 | * is set, as lots of objects don't have it set - we treat that |
1808 | * is set, as lots of objects don't have it set - we treat that |
1719 | * as walking. |
1809 | * as walking. |
… | |
… | |
1730 | return 0; |
1820 | return 0; |
1731 | |
1821 | |
1732 | /* The objects have to be checked from top to bottom. |
1822 | /* The objects have to be checked from top to bottom. |
1733 | * Hence, we first go to the top: |
1823 | * Hence, we first go to the top: |
1734 | */ |
1824 | */ |
1735 | |
1825 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1736 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
|
|
1737 | { |
|
|
1738 | /* Trim the search when we find the first other spell effect |
|
|
1739 | * this helps performance so that if a space has 50 spell objects, |
|
|
1740 | * we don't need to check all of them. |
|
|
1741 | */ |
|
|
1742 | if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK)) |
|
|
1743 | break; |
|
|
1744 | } |
1826 | { |
|
|
1827 | next = tmp->below; |
1745 | |
1828 | |
1746 | for (; tmp; tmp = tmp->below) |
|
|
1747 | { |
|
|
1748 | if (tmp == op) |
1829 | if (tmp == op) |
1749 | continue; /* Can't apply yourself */ |
1830 | continue; /* Can't apply yourself */ |
1750 | |
1831 | |
1751 | /* Check to see if one of the movement types should be slowed down. |
1832 | /* Check to see if one of the movement types should be slowed down. |
1752 | * Second check makes sure that the movement types not being slowed |
1833 | * Second check makes sure that the movement types not being slowed |
… | |
… | |
1757 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1838 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1758 | { |
1839 | { |
1759 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1840 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1760 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1841 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1761 | { |
1842 | { |
1762 | |
|
|
1763 | float |
|
|
1764 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1843 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
1765 | |
1844 | |
1766 | if (op->is_player ()) |
1845 | if (op->is_player ()) |
1767 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1846 | if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) || |
1768 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1847 | (tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN))) |
1769 | diff /= 4.0; |
1848 | diff /= 4.0; |
1770 | |
1849 | |
1771 | op->speed_left -= diff; |
1850 | op->speed_left -= diff; |
1772 | } |
1851 | } |
1773 | } |
1852 | } |
… | |
… | |
2174 | * This basically means that if direction is 15, then it could either go |
2253 | * This basically means that if direction is 15, then it could either go |
2175 | * direction 4, 14, or 16 to get back to where we are. |
2254 | * direction 4, 14, or 16 to get back to where we are. |
2176 | * Moved from spell_util.c to object.c with the other related direction |
2255 | * Moved from spell_util.c to object.c with the other related direction |
2177 | * functions. |
2256 | * functions. |
2178 | */ |
2257 | */ |
2179 | const int reduction_dir[SIZEOFFREE][3] = { |
2258 | static const int reduction_dir[SIZEOFFREE][3] = { |
2180 | {0, 0, 0}, /* 0 */ |
2259 | {0, 0, 0}, /* 0 */ |
2181 | {0, 0, 0}, /* 1 */ |
2260 | {0, 0, 0}, /* 1 */ |
2182 | {0, 0, 0}, /* 2 */ |
2261 | {0, 0, 0}, /* 2 */ |
2183 | {0, 0, 0}, /* 3 */ |
2262 | {0, 0, 0}, /* 3 */ |
2184 | {0, 0, 0}, /* 4 */ |
2263 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2455 | { |
2534 | { |
2456 | return map ? map->region (x, y) |
2535 | return map ? map->region (x, y) |
2457 | : region::default_region (); |
2536 | : region::default_region (); |
2458 | } |
2537 | } |
2459 | |
2538 | |
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 |
2539 | void |
2470 | object::open_container (object *new_container) |
2540 | object::open_container (object *new_container) |
2471 | { |
2541 | { |
2472 | if (container == new_container) |
2542 | if (container == new_container) |
2473 | return; |
2543 | return; |
… | |
… | |
2493 | container = 0; |
2563 | container = 0; |
2494 | |
2564 | |
2495 | // client needs item update to make it work, client bug requires this to be separate |
2565 | // client needs item update to make it work, client bug requires this to be separate |
2496 | esrv_update_item (UPD_FLAGS, this, old_container); |
2566 | esrv_update_item (UPD_FLAGS, this, old_container); |
2497 | |
2567 | |
2498 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2568 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ()); |
2499 | play_sound (sound_find ("chest_close")); |
2569 | play_sound (sound_find ("chest_close")); |
2500 | } |
2570 | } |
2501 | |
2571 | |
2502 | if (new_container) |
2572 | if (new_container) |
2503 | { |
2573 | { |
… | |
… | |
2507 | // TODO: this does not seem to serve any purpose anymore? |
2577 | // TODO: this does not seem to serve any purpose anymore? |
2508 | #if 0 |
2578 | #if 0 |
2509 | // insert the "Close Container" object. |
2579 | // insert the "Close Container" object. |
2510 | if (archetype *closer = new_container->other_arch) |
2580 | if (archetype *closer = new_container->other_arch) |
2511 | { |
2581 | { |
2512 | object *closer = arch_to_object (new_container->other_arch); |
2582 | object *closer = new_container->other_arch->instance (); |
2513 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2583 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2514 | new_container->insert (closer); |
2584 | new_container->insert (closer); |
2515 | } |
2585 | } |
2516 | #endif |
2586 | #endif |
2517 | |
2587 | |
2518 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2588 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ()); |
2519 | |
2589 | |
2520 | // make sure the container is available, client bug requires this to be separate |
2590 | // make sure the container is available, client bug requires this to be separate |
2521 | esrv_send_item (this, new_container); |
2591 | esrv_send_item (this, new_container); |
2522 | |
2592 | |
2523 | new_container->flag [FLAG_APPLIED] = true; |
2593 | new_container->flag [FLAG_APPLIED] = true; |
… | |
… | |
2543 | return splay (tmp); |
2613 | return splay (tmp); |
2544 | |
2614 | |
2545 | return 0; |
2615 | return 0; |
2546 | } |
2616 | } |
2547 | |
2617 | |
|
|
2618 | //-GPL |
|
|
2619 | |
|
|
2620 | void |
|
|
2621 | object::force_set_timer (int duration) |
|
|
2622 | { |
|
|
2623 | this->duration = 1; |
|
|
2624 | this->speed_left = -1.f; |
|
|
2625 | |
|
|
2626 | this->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2627 | } |
|
|
2628 | |
2548 | object * |
2629 | object * |
2549 | object::force_add (shstr_tmp name, int duration) |
2630 | object::force_add (shstr_tmp name, int duration) |
2550 | { |
2631 | { |
2551 | if (object *force = force_find (name)) |
2632 | if (object *force = force_find (name)) |
2552 | force->destroy (); |
2633 | force->destroy (); |
2553 | |
2634 | |
2554 | object *force = get_archetype (FORCE_NAME); |
2635 | object *force = get_archetype (FORCE_NAME); |
2555 | |
2636 | |
2556 | force->slaying = name; |
2637 | force->slaying = name; |
2557 | force->stats.food = 1; |
2638 | force->force_set_timer (duration); |
2558 | force->speed_left = -1.f; |
|
|
2559 | |
|
|
2560 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2561 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2562 | force->flag [FLAG_APPLIED] = true; |
2639 | force->flag [FLAG_APPLIED] = true; |
2563 | |
2640 | |
2564 | return insert (force); |
2641 | return insert (force); |
2565 | } |
2642 | } |
2566 | |
2643 | |
2567 | void |
2644 | void |
2568 | object::play_sound (faceidx sound) |
2645 | object::play_sound (faceidx sound) const |
2569 | { |
2646 | { |
2570 | if (!sound) |
2647 | if (!sound) |
2571 | return; |
2648 | return; |
2572 | |
2649 | |
2573 | if (flag [FLAG_REMOVED]) |
2650 | if (is_on_map ()) |
2574 | return; |
|
|
2575 | |
|
|
2576 | if (env) |
|
|
2577 | { |
|
|
2578 | if (object *pl = in_player ()) |
|
|
2579 | pl->contr->play_sound (sound); |
|
|
2580 | } |
|
|
2581 | else |
|
|
2582 | map->play_sound (sound, x, y); |
2651 | map->play_sound (sound, x, y); |
|
|
2652 | else if (object *pl = in_player ()) |
|
|
2653 | pl->contr->play_sound (sound); |
|
|
2654 | } |
|
|
2655 | |
|
|
2656 | void |
|
|
2657 | object::say_msg (const char *msg) const |
|
|
2658 | { |
|
|
2659 | if (is_on_map ()) |
|
|
2660 | map->say_msg (msg, x, y); |
|
|
2661 | else if (object *pl = in_player ()) |
|
|
2662 | pl->contr->play_sound (sound); |
2583 | } |
2663 | } |
2584 | |
2664 | |
2585 | void |
2665 | void |
2586 | object::make_noise () |
2666 | object::make_noise () |
2587 | { |
2667 | { |
… | |
… | |
2613 | |
2693 | |
2614 | insert (force); |
2694 | insert (force); |
2615 | } |
2695 | } |
2616 | } |
2696 | } |
2617 | |
2697 | |
|
|
2698 | void object::change_move_type (MoveType mt) |
|
|
2699 | { |
|
|
2700 | if (move_type == mt) |
|
|
2701 | return; |
|
|
2702 | |
|
|
2703 | if (is_on_map ()) |
|
|
2704 | { |
|
|
2705 | // we are on the map, so handle move_on/off effects |
|
|
2706 | remove (); |
|
|
2707 | move_type = mt; |
|
|
2708 | map->insert (this, x, y, this); |
|
|
2709 | } |
|
|
2710 | else |
|
|
2711 | move_type = mt; |
|
|
2712 | } |
|
|
2713 | |