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,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 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 | |
38 | |
38 | objectvec objects; |
39 | objectvec objects; |
39 | activevec actives; |
40 | activevec actives; |
|
|
41 | |
|
|
42 | //+GPL |
40 | |
43 | |
41 | short freearr_x[SIZEOFFREE] = { |
44 | short freearr_x[SIZEOFFREE] = { |
42 | 0, |
45 | 0, |
43 | 0, 1, 1, 1, 0, -1, -1, -1, |
46 | 0, 1, 1, 1, 0, -1, -1, -1, |
44 | 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, |
… | |
… | |
48 | 0, |
51 | 0, |
49 | -1, -1, 0, 1, 1, 1, 0, -1, |
52 | -1, -1, 0, 1, 1, 1, 0, -1, |
50 | -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, |
51 | -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 |
52 | }; |
55 | }; |
53 | int maxfree[SIZEOFFREE] = { |
|
|
54 | 0, |
|
|
55 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
56 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
|
|
57 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
|
|
58 | }; |
|
|
59 | int freedir[SIZEOFFREE] = { |
56 | int freedir[SIZEOFFREE] = { |
60 | 0, |
57 | 0, |
61 | 1, 2, 3, 4, 5, 6, 7, 8, |
58 | 1, 2, 3, 4, 5, 6, 7, 8, |
62 | 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, |
63 | 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 |
64 | }; |
61 | }; |
65 | |
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 | |
66 | static void |
70 | static void |
67 | write_uuid (uval64 skip, bool sync) |
71 | write_uuid (uval64 skip, bool sync) |
68 | { |
72 | { |
69 | CALL_BEGIN (2); |
73 | CALL_BEGIN (2); |
70 | CALL_ARG_SV (newSVval64 (skip)); |
74 | CALL_ARG_SV (newSVval64 (skip)); |
… | |
… | |
72 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
76 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
73 | CALL_END; |
77 | CALL_END; |
74 | } |
78 | } |
75 | |
79 | |
76 | static void |
80 | static void |
77 | read_uuid (void) |
81 | read_uuid () |
78 | { |
82 | { |
79 | char filename[MAX_BUF]; |
83 | char filename[MAX_BUF]; |
80 | |
84 | |
81 | sprintf (filename, "%s/uuid", settings.localdir); |
85 | sprintf (filename, "%s/uuid", settings.localdir); |
82 | |
86 | |
… | |
… | |
96 | |
100 | |
97 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
101 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
98 | _exit (1); |
102 | _exit (1); |
99 | } |
103 | } |
100 | |
104 | |
101 | UUID::BUF buf; |
105 | char buf [UUID::MAX_LEN]; |
102 | buf[0] = 0; |
106 | buf[0] = 0; |
103 | fgets (buf, sizeof (buf), fp); |
107 | fgets (buf, sizeof (buf), fp); |
104 | |
108 | |
105 | if (!UUID::cur.parse (buf)) |
109 | if (!UUID::cur.parse (buf)) |
106 | { |
110 | { |
… | |
… | |
133 | |
137 | |
134 | void |
138 | void |
135 | UUID::init () |
139 | UUID::init () |
136 | { |
140 | { |
137 | 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; |
138 | } |
207 | } |
139 | |
208 | |
140 | /* 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. */ |
141 | static bool |
210 | static bool |
142 | compare_ob_value_lists_one (const object *wants, const object *has) |
211 | compare_ob_value_lists_one (const object *wants, const object *has) |
… | |
… | |
178 | * Improvements made with merge: Better checking on potion, and also |
247 | * Improvements made with merge: Better checking on potion, and also |
179 | * check weight |
248 | * check weight |
180 | */ |
249 | */ |
181 | bool object::can_merge_slow (object *ob1, object *ob2) |
250 | bool object::can_merge_slow (object *ob1, object *ob2) |
182 | { |
251 | { |
183 | /* A couple quicksanity checks */ |
252 | /* A couple quick sanity checks */ |
184 | if (ob1 == ob2 |
253 | if (ob1 == ob2 |
185 | || ob1->type != ob2->type |
254 | || ob1->type != ob2->type |
186 | || ob1->speed != ob2->speed |
|
|
187 | || ob1->value != ob2->value |
255 | || ob1->value != ob2->value |
188 | || ob1->name != ob2->name) |
256 | || ob1->name != ob2->name |
|
|
257 | || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED) |
189 | return 0; |
258 | return 0; |
190 | |
259 | |
191 | // some objects are unmergable |
|
|
192 | if (!ob1->nrof || !ob2->nrof) |
|
|
193 | return 0; |
|
|
194 | |
|
|
195 | /* Do not merge objects if nrof would overflow. First part checks |
260 | /* Do not merge objects if nrof would overflow, assume nrof |
196 | * for unsigned overflow (2c), second part checks whether the result |
261 | * is always 0 .. 2**31-1 */ |
197 | * would fit into a 32 bit signed int, which is often used to hold |
262 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
198 | * nrof values. |
|
|
199 | */ |
|
|
200 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
|
|
201 | return 0; |
263 | return 0; |
202 | |
264 | |
203 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
265 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
204 | * This is to the comparison of the flags below will be OK. We |
266 | * This is to the comparison of the flags below will be OK. We |
205 | * just can't ignore the been applied or identified flags, as they |
267 | * just can't ignore the been applied or identified flags, as they |
… | |
… | |
221 | || ob1->magic != ob2->magic |
283 | || ob1->magic != ob2->magic |
222 | || ob1->slaying != ob2->slaying |
284 | || ob1->slaying != ob2->slaying |
223 | || ob1->skill != ob2->skill |
285 | || ob1->skill != ob2->skill |
224 | || ob1->value != ob2->value |
286 | || ob1->value != ob2->value |
225 | || ob1->animation_id != ob2->animation_id |
287 | || ob1->animation_id != ob2->animation_id |
226 | || (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 |
227 | || ob1->client_type != ob2->client_type |
289 | || ob1->client_type != ob2->client_type |
228 | || ob1->materialname != ob2->materialname |
290 | || ob1->material != ob2->material |
229 | || ob1->lore != ob2->lore |
291 | || ob1->lore != ob2->lore |
230 | || ob1->subtype != ob2->subtype |
292 | || ob1->subtype != ob2->subtype |
231 | || ob1->move_type != ob2->move_type |
293 | || ob1->move_type != ob2->move_type |
232 | || ob1->move_block != ob2->move_block |
294 | || ob1->move_block != ob2->move_block |
233 | || ob1->move_allow != ob2->move_allow |
295 | || ob1->move_allow != ob2->move_allow |
234 | || ob1->move_on != ob2->move_on |
296 | || ob1->move_on != ob2->move_on |
235 | || ob1->move_off != ob2->move_off |
297 | || ob1->move_off != ob2->move_off |
236 | || ob1->move_slow != ob2->move_slow |
298 | || ob1->move_slow != ob2->move_slow |
237 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
299 | || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f) |
238 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
300 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
239 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
301 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
240 | return 0; |
302 | return 0; |
241 | |
303 | |
242 | if ((ob1->flag ^ ob2->flag) |
304 | if ((ob1->flag ^ ob2->flag) |
243 | .reset (FLAG_INV_LOCKED) |
305 | .reset (FLAG_INV_LOCKED) |
244 | .reset (FLAG_CLIENT_SENT) |
|
|
245 | .reset (FLAG_REMOVED) |
306 | .reset (FLAG_REMOVED) |
246 | .any ()) |
307 | .any ()) |
247 | return 0; |
308 | return 0; |
248 | |
309 | |
249 | /* This is really a spellbook check - we should in general |
310 | /* This is really a spellbook check - we should in general |
… | |
… | |
331 | { |
392 | { |
332 | // see if we are in a container of sorts |
393 | // see if we are in a container of sorts |
333 | if (env) |
394 | if (env) |
334 | { |
395 | { |
335 | // the player inventory itself is always visible |
396 | // the player inventory itself is always visible |
336 | if (env->type == PLAYER) |
397 | if (env->is_player ()) |
337 | return env; |
398 | return env; |
338 | |
399 | |
339 | // else a player could have our env open |
400 | // else a player could have our env open |
340 | object *envest = env->outer_env (); |
401 | object *envest = env->outer_env_or_self (); |
341 | |
402 | |
342 | // 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 |
343 | // even if our inv is in a player. |
404 | // even if our inv is in a player. |
344 | if (envest->is_on_map ()) |
405 | if (envest->is_on_map ()) |
345 | if (object *pl = envest->ms ().player ()) |
406 | if (object *pl = envest->ms ().player ()) |
346 | if (pl->container == env) |
407 | if (pl->container_ () == env) |
347 | return pl; |
408 | return pl; |
348 | } |
409 | } |
349 | else |
410 | else |
350 | { |
411 | { |
351 | // maybe there is a player standing on the same mapspace |
412 | // maybe there is a player standing on the same mapspace |
352 | // this will catch the case where "this" is a player |
413 | // this will catch the case where "this" is a player |
353 | if (object *pl = ms ().player ()) |
414 | if (object *pl = ms ().player ()) |
354 | if (!pl->container || this == pl->container) |
415 | if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look) |
|
|
416 | || pl->container_ () == this) |
355 | return pl; |
417 | return pl; |
356 | } |
418 | } |
357 | } |
419 | } |
358 | |
420 | |
359 | return 0; |
421 | return 0; |
… | |
… | |
437 | object_freezer freezer; |
499 | object_freezer freezer; |
438 | op->write (freezer); |
500 | op->write (freezer); |
439 | return freezer.as_string (); |
501 | return freezer.as_string (); |
440 | } |
502 | } |
441 | |
503 | |
442 | /* |
504 | char * |
443 | * get_nearest_part(multi-object, object 2) returns the part of the |
505 | object::as_string () |
444 | * multi-object 1 which is closest to the second object. |
|
|
445 | * If it's not a multi-object, it is returned. |
|
|
446 | */ |
|
|
447 | object * |
|
|
448 | get_nearest_part (object *op, const object *pl) |
|
|
449 | { |
506 | { |
450 | object *tmp, *closest; |
507 | return dump_object (this); |
451 | int last_dist, i; |
|
|
452 | |
|
|
453 | if (!op->more) |
|
|
454 | return op; |
|
|
455 | |
|
|
456 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
457 | tmp; |
|
|
458 | tmp = tmp->more) |
|
|
459 | if ((i = distance (tmp, pl)) < last_dist) |
|
|
460 | closest = tmp, last_dist = i; |
|
|
461 | |
|
|
462 | return closest; |
|
|
463 | } |
508 | } |
464 | |
509 | |
465 | /* |
510 | /* |
466 | * 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. |
467 | * VERRRY slow. |
512 | * VERRRY slow. |
… | |
… | |
469 | object * |
514 | object * |
470 | find_object (tag_t i) |
515 | find_object (tag_t i) |
471 | { |
516 | { |
472 | for_all_objects (op) |
517 | for_all_objects (op) |
473 | 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) |
474 | return op; |
534 | return op; |
475 | |
535 | |
476 | return 0; |
536 | return 0; |
477 | } |
537 | } |
478 | |
538 | |
… | |
… | |
561 | update_stats (); |
621 | update_stats (); |
562 | |
622 | |
563 | new_draw_info_format (NDI_UNIQUE, 0, this, |
623 | new_draw_info_format (NDI_UNIQUE, 0, this, |
564 | "You try to balance all your items at once, " |
624 | "You try to balance all your items at once, " |
565 | "but the %s is just too much for your body. " |
625 | "but the %s is just too much for your body. " |
566 | "[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); |
567 | return false; |
628 | return false; |
568 | } |
629 | } |
569 | |
630 | |
570 | //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); |
571 | } |
632 | } |
… | |
… | |
640 | tail = new_link; |
701 | tail = new_link; |
641 | } |
702 | } |
642 | } |
703 | } |
643 | } |
704 | } |
644 | |
705 | |
645 | if (speed < 0) |
706 | dst->activate (); |
646 | dst->speed_left -= rndm (); |
|
|
647 | |
|
|
648 | dst->set_speed (dst->speed); |
|
|
649 | } |
707 | } |
650 | |
708 | |
651 | void |
709 | void |
652 | object::instantiate () |
710 | object::instantiate () |
653 | { |
711 | { |
654 | if (!uuid.seq) // HACK |
712 | if (!uuid.seq) // HACK |
655 | uuid = UUID::gen (); |
713 | uuid = UUID::gen (); |
656 | |
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 |
657 | speed_left = -0.1f; |
719 | speed_left = -1.; |
|
|
720 | |
658 | /* 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 |
659 | * 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. |
660 | * 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 |
661 | * values for the body_used info, so when items are created |
724 | * values for the body_used info, so when items are created |
662 | * for it, they can be properly equipped. |
725 | * for it, they can be properly equipped. |
… | |
… | |
670 | object * |
733 | object * |
671 | object::clone () |
734 | object::clone () |
672 | { |
735 | { |
673 | object *neu = create (); |
736 | object *neu = create (); |
674 | 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 | |
675 | neu->map = map; // not copied by copy_to |
743 | neu->map = map; // not copied by copy_to |
676 | return neu; |
744 | return neu; |
677 | } |
745 | } |
678 | |
746 | |
679 | /* |
747 | /* |
… | |
… | |
697 | * 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. |
698 | */ |
766 | */ |
699 | void |
767 | void |
700 | object::set_speed (float speed) |
768 | object::set_speed (float speed) |
701 | { |
769 | { |
702 | if (flag [FLAG_FREED] && speed) |
|
|
703 | { |
|
|
704 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
|
|
705 | speed = 0; |
|
|
706 | } |
|
|
707 | |
|
|
708 | this->speed = speed; |
770 | this->speed = speed; |
709 | |
771 | |
710 | if (has_active_speed ()) |
772 | if (has_active_speed ()) |
711 | activate (); |
773 | activate (); |
712 | else |
774 | else |
… | |
… | |
762 | |
824 | |
763 | if (!(m.flags_ & P_UPTODATE)) |
825 | if (!(m.flags_ & P_UPTODATE)) |
764 | /* nop */; |
826 | /* nop */; |
765 | else if (action == UP_OBJ_INSERT) |
827 | else if (action == UP_OBJ_INSERT) |
766 | { |
828 | { |
|
|
829 | #if 0 |
767 | // this is likely overkill, TODO: revisit (schmorp) |
830 | // this is likely overkill, TODO: revisit (schmorp) |
768 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
831 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
769 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
832 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
770 | || (op->type == PLAYER && !(m.flags_ & P_PLAYER)) |
833 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
771 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
834 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
772 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
835 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
773 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
836 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
774 | || (m.move_on | op->move_on ) != m.move_on |
837 | || (m.move_on | op->move_on ) != m.move_on |
775 | || (m.move_off | op->move_off ) != m.move_off |
838 | || (m.move_off | op->move_off ) != m.move_off |
776 | || (m.move_slow | op->move_slow) != m.move_slow |
839 | || (m.move_slow | op->move_slow) != m.move_slow |
777 | /* 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 |
778 | * to have move_allow right now. |
841 | * have move_allow right now. |
779 | */ |
842 | */ |
780 | || ((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 |
|
|
844 | m.invalidate (); |
|
|
845 | #else |
781 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
846 | // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp) |
782 | m.flags_ = 0; |
847 | m.invalidate (); |
|
|
848 | #endif |
783 | } |
849 | } |
784 | /* if the object is being removed, we can't make intelligent |
850 | /* if the object is being removed, we can't make intelligent |
785 | * decisions, because remove_ob can't really pass the object |
851 | * decisions, because remove_ob can't really pass the object |
786 | * that is being removed. |
852 | * that is being removed. |
787 | */ |
853 | */ |
788 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
854 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
789 | m.flags_ = 0; |
855 | m.invalidate (); |
790 | else if (action == UP_OBJ_FACE) |
856 | else if (action == UP_OBJ_FACE) |
791 | /* Nothing to do for that case */ ; |
857 | /* Nothing to do for that case */ ; |
792 | else |
858 | else |
793 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
859 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
794 | |
860 | |
… | |
… | |
798 | |
864 | |
799 | object::object () |
865 | object::object () |
800 | { |
866 | { |
801 | SET_FLAG (this, FLAG_REMOVED); |
867 | SET_FLAG (this, FLAG_REMOVED); |
802 | |
868 | |
803 | expmul = 1.0; |
869 | //expmul = 1.0; declared const for the time being |
804 | face = blank_face; |
870 | face = blank_face; |
|
|
871 | material = MATERIAL_NULL; |
805 | } |
872 | } |
806 | |
873 | |
807 | object::~object () |
874 | object::~object () |
808 | { |
875 | { |
809 | unlink (); |
876 | unlink (); |
… | |
… | |
838 | /* If already on active list, don't do anything */ |
905 | /* If already on active list, don't do anything */ |
839 | if (active) |
906 | if (active) |
840 | return; |
907 | return; |
841 | |
908 | |
842 | 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 | |
843 | actives.insert (this); |
914 | actives.insert (this); |
|
|
915 | } |
844 | } |
916 | } |
845 | |
917 | |
846 | void |
918 | void |
847 | object::activate_recursive () |
919 | object::activate_recursive () |
848 | { |
920 | { |
… | |
… | |
913 | || map->in_memory != MAP_ACTIVE |
985 | || map->in_memory != MAP_ACTIVE |
914 | || map->no_drop |
986 | || map->no_drop |
915 | || ms ().move_block == MOVE_ALL) |
987 | || ms ().move_block == MOVE_ALL) |
916 | { |
988 | { |
917 | while (inv) |
989 | while (inv) |
918 | { |
|
|
919 | inv->destroy_inv (false); |
|
|
920 | inv->destroy (); |
990 | inv->destroy (); |
921 | } |
|
|
922 | } |
991 | } |
923 | else |
992 | else |
924 | { /* Put objects in inventory onto this space */ |
993 | { /* Put objects in inventory onto this space */ |
925 | while (inv) |
994 | while (inv) |
926 | { |
995 | { |
… | |
… | |
930 | || op->flag [FLAG_NO_DROP] |
999 | || op->flag [FLAG_NO_DROP] |
931 | || op->type == RUNE |
1000 | || op->type == RUNE |
932 | || op->type == TRAP |
1001 | || op->type == TRAP |
933 | || op->flag [FLAG_IS_A_TEMPLATE] |
1002 | || op->flag [FLAG_IS_A_TEMPLATE] |
934 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
1003 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
935 | op->destroy (true); |
1004 | op->destroy (); |
936 | else |
1005 | else |
937 | map->insert (op, x, y); |
1006 | map->insert (op, x, y); |
938 | } |
1007 | } |
939 | } |
1008 | } |
940 | } |
1009 | } |
… | |
… | |
969 | |
1038 | |
970 | void |
1039 | void |
971 | object::do_destroy () |
1040 | object::do_destroy () |
972 | { |
1041 | { |
973 | if (flag [FLAG_IS_LINKED]) |
1042 | if (flag [FLAG_IS_LINKED]) |
974 | remove_button_link (this); |
1043 | remove_link (); |
975 | |
1044 | |
976 | if (flag [FLAG_FRIENDLY]) |
1045 | if (flag [FLAG_FRIENDLY]) |
977 | remove_friendly_object (this); |
1046 | remove_friendly_object (this); |
978 | |
1047 | |
979 | remove (); |
1048 | remove (); |
… | |
… | |
1004 | attacked_by = 0; |
1073 | attacked_by = 0; |
1005 | current_weapon = 0; |
1074 | current_weapon = 0; |
1006 | } |
1075 | } |
1007 | |
1076 | |
1008 | void |
1077 | void |
1009 | object::destroy (bool destroy_inventory) |
1078 | object::destroy () |
1010 | { |
1079 | { |
1011 | if (destroyed ()) |
1080 | if (destroyed ()) |
1012 | return; |
1081 | return; |
1013 | |
1082 | |
1014 | if (!is_head () && !head->destroyed ()) |
1083 | if (!is_head () && !head->destroyed ()) |
1015 | { |
1084 | { |
1016 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1085 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1017 | head->destroy (destroy_inventory); |
1086 | head->destroy (); |
1018 | return; |
1087 | return; |
1019 | } |
1088 | } |
1020 | |
1089 | |
1021 | destroy_inv (!destroy_inventory); |
1090 | destroy_inv (false); |
1022 | |
1091 | |
1023 | if (is_head ()) |
1092 | if (is_head ()) |
1024 | if (sound_destroy) |
1093 | if (sound_destroy) |
1025 | play_sound (sound_destroy); |
1094 | play_sound (sound_destroy); |
1026 | else if (flag [FLAG_MONSTER]) |
1095 | else if (flag [FLAG_MONSTER]) |
… | |
… | |
1037 | * the previous environment. |
1106 | * the previous environment. |
1038 | */ |
1107 | */ |
1039 | void |
1108 | void |
1040 | object::do_remove () |
1109 | object::do_remove () |
1041 | { |
1110 | { |
1042 | object *tmp, *last = 0; |
|
|
1043 | object *otmp; |
|
|
1044 | |
|
|
1045 | if (flag [FLAG_REMOVED]) |
1111 | if (flag [FLAG_REMOVED]) |
1046 | return; |
1112 | return; |
1047 | |
1113 | |
1048 | INVOKE_OBJECT (REMOVE, this); |
1114 | INVOKE_OBJECT (REMOVE, this); |
1049 | |
1115 | |
… | |
… | |
1062 | if (object *pl = visible_to ()) |
1128 | if (object *pl = visible_to ()) |
1063 | esrv_del_item (pl->contr, count); |
1129 | esrv_del_item (pl->contr, count); |
1064 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1130 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1065 | |
1131 | |
1066 | adjust_weight (env, -total_weight ()); |
1132 | adjust_weight (env, -total_weight ()); |
|
|
1133 | |
|
|
1134 | object *pl = in_player (); |
1067 | |
1135 | |
1068 | /* we set up values so that it could be inserted into |
1136 | /* we set up values so that it could be inserted into |
1069 | * the map, but we don't actually do that - it is up |
1137 | * the map, but we don't actually do that - it is up |
1070 | * to the caller to decide what we want to do. |
1138 | * to the caller to decide what we want to do. |
1071 | */ |
1139 | */ |
… | |
… | |
1079 | |
1147 | |
1080 | above = 0; |
1148 | above = 0; |
1081 | below = 0; |
1149 | below = 0; |
1082 | env = 0; |
1150 | env = 0; |
1083 | |
1151 | |
1084 | /* NO_FIX_PLAYER is set when a great many changes are being |
1152 | if (pl && pl->is_player ()) |
1085 | * made to players inventory. If set, avoiding the call |
|
|
1086 | * to save cpu time. |
|
|
1087 | */ |
1153 | { |
1088 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1154 | pl->contr->queue_stats_update (); |
1089 | otmp->update_stats (); |
1155 | |
|
|
1156 | if (glow_radius && pl->is_on_map ()) |
|
|
1157 | update_all_los (pl->map, pl->x, pl->y); |
|
|
1158 | } |
1090 | } |
1159 | } |
1091 | else if (map) |
1160 | else if (map) |
1092 | { |
1161 | { |
1093 | map->dirty = true; |
1162 | map->dirty = true; |
1094 | mapspace &ms = this->ms (); |
1163 | mapspace &ms = this->ms (); |
1095 | |
1164 | |
1096 | if (object *pl = ms.player ()) |
1165 | if (object *pl = ms.player ()) |
1097 | { |
1166 | { |
1098 | if (type == PLAYER) // this == pl(!) |
1167 | if (is_player ()) |
1099 | { |
1168 | { |
|
|
1169 | if (!flag [FLAG_WIZPASS]) |
|
|
1170 | ms.smell = ++mapspace::smellcount; // remember the smell of the player |
|
|
1171 | |
1100 | // leaving a spot always closes any open container on the ground |
1172 | // leaving a spot always closes any open container on the ground |
1101 | if (container && !container->env) |
1173 | if (container && !container->env) |
1102 | // this causes spurious floorbox updates, but it ensures |
1174 | // this causes spurious floorbox updates, but it ensures |
1103 | // that the CLOSE event is being sent. |
1175 | // that the CLOSE event is being sent. |
1104 | close_container (); |
1176 | close_container (); |
1105 | |
1177 | |
1106 | --map->players; |
1178 | --map->players; |
1107 | map->touch (); |
1179 | map->touch (); |
1108 | } |
1180 | } |
1109 | else if (pl->container == this) |
1181 | else if (pl->container_ () == this) |
1110 | { |
1182 | { |
1111 | // removing a container should close it |
1183 | // removing a container should close it |
1112 | close_container (); |
1184 | close_container (); |
1113 | } |
1185 | } |
1114 | |
1186 | |
… | |
… | |
1121 | *(below ? &below->above : &ms.bot) = above; |
1193 | *(below ? &below->above : &ms.bot) = above; |
1122 | |
1194 | |
1123 | above = 0; |
1195 | above = 0; |
1124 | below = 0; |
1196 | below = 0; |
1125 | |
1197 | |
|
|
1198 | ms.invalidate (); |
|
|
1199 | |
1126 | if (map->in_memory == MAP_SAVING) |
1200 | if (map->in_memory == MAP_SAVING) |
1127 | return; |
1201 | return; |
1128 | |
1202 | |
1129 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1203 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1130 | |
1204 | |
1131 | if (object *pl = ms.player ()) |
1205 | if (object *pl = ms.player ()) |
1132 | { |
1206 | { |
1133 | if (pl->container == this) |
1207 | if (pl->container_ () == this) |
1134 | /* If a container that the player is currently using somehow gets |
1208 | /* If a container that the player is currently using somehow gets |
1135 | * removed (most likely destroyed), update the player view |
1209 | * removed (most likely destroyed), update the player view |
1136 | * appropriately. |
1210 | * appropriately. |
1137 | */ |
1211 | */ |
1138 | pl->close_container (); |
1212 | pl->close_container (); |
… | |
… | |
1142 | //TODO: update floorbox to preserve ordering |
1216 | //TODO: update floorbox to preserve ordering |
1143 | if (pl->contr->ns) |
1217 | if (pl->contr->ns) |
1144 | pl->contr->ns->floorbox_update (); |
1218 | pl->contr->ns->floorbox_update (); |
1145 | } |
1219 | } |
1146 | |
1220 | |
|
|
1221 | if (check_walk_off) |
1147 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1222 | for (object *above, *tmp = ms.bot; tmp; tmp = above) |
1148 | { |
1223 | { |
|
|
1224 | above = tmp->above; |
|
|
1225 | |
1149 | /* 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 |
1150 | * being removed. |
1227 | * being removed. |
1151 | */ |
1228 | */ |
1152 | |
1229 | |
1153 | /* See if object moving off should effect something */ |
1230 | /* See if object moving off should effect something */ |
1154 | if (check_walk_off |
|
|
1155 | && ((move_type & tmp->move_off) |
1231 | if ((move_type & tmp->move_off) |
1156 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1232 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0) |
1157 | { |
|
|
1158 | move_apply (tmp, this, 0); |
1233 | move_apply (tmp, this, 0); |
1159 | |
|
|
1160 | if (destroyed ()) |
|
|
1161 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
|
|
1162 | } |
1234 | } |
1163 | |
1235 | |
1164 | last = tmp; |
1236 | if (affects_los ()) |
1165 | } |
|
|
1166 | |
|
|
1167 | /* last == NULL if there are no objects on this space */ |
|
|
1168 | //TODO: this makes little sense, why only update the topmost object? |
|
|
1169 | if (!last) |
|
|
1170 | map->at (x, y).flags_ = 0; |
|
|
1171 | else |
|
|
1172 | update_object (last, UP_OBJ_REMOVE); |
|
|
1173 | |
|
|
1174 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
|
|
1175 | update_all_los (map, x, y); |
1237 | update_all_los (map, x, y); |
1176 | } |
1238 | } |
1177 | } |
1239 | } |
1178 | |
1240 | |
1179 | /* |
1241 | /* |
… | |
… | |
1203 | esrv_update_item (UPD_NROF, pl, top); |
1265 | esrv_update_item (UPD_NROF, pl, top); |
1204 | |
1266 | |
1205 | op->weight = 0; // cancel the addition above |
1267 | op->weight = 0; // cancel the addition above |
1206 | op->carrying = 0; // must be 0 already |
1268 | op->carrying = 0; // must be 0 already |
1207 | |
1269 | |
1208 | op->destroy (1); |
1270 | op->destroy (); |
1209 | |
1271 | |
1210 | return top; |
1272 | return top; |
1211 | } |
1273 | } |
1212 | |
1274 | |
1213 | return 0; |
1275 | return 0; |
… | |
… | |
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 | |
… | |
… | |
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 | { |
1280 | if (op->is_on_map ()) |
|
|
1281 | { |
|
|
1282 | LOG (llevError, "insert_ob_in_map called for object already on map"); |
|
|
1283 | abort (); |
|
|
1284 | } |
|
|
1285 | |
|
|
1286 | if (op->env) |
|
|
1287 | { |
|
|
1288 | LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)"); |
|
|
1289 | op->remove (); |
1342 | op->remove (); |
1290 | } |
|
|
1291 | |
1343 | |
1292 | if (op->face && !face_info (op->face))//D TODO: remove soon |
1344 | if (m == &freed_map)//D TODO: remove soon |
1293 | {//D |
1345 | {//D |
1294 | LOG (llevError | logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D |
1346 | LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D |
1295 | op->face = 1;//D |
|
|
1296 | }//D |
1347 | }//D |
1297 | |
1348 | |
1298 | /* Ideally, the caller figures this out. However, it complicates a lot |
1349 | /* Ideally, the caller figures this out. However, it complicates a lot |
1299 | * of areas of callers (eg, anything that uses find_free_spot would now |
1350 | * of areas of callers (eg, anything that uses find_free_spot would now |
1300 | * need extra work |
1351 | * need extra work |
1301 | */ |
1352 | */ |
|
|
1353 | maptile *newmap = m; |
1302 | if (!xy_normalise (m, op->x, op->y)) |
1354 | if (!xy_normalise (newmap, op->x, op->y)) |
1303 | { |
1355 | { |
1304 | op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found |
1356 | op->head_ ()->destroy ();// remove head_ once all tail object destroyers found |
1305 | return 0; |
1357 | return 0; |
1306 | } |
1358 | } |
1307 | |
1359 | |
1308 | if (object *more = op->more) |
1360 | if (object *more = op->more) |
1309 | if (!insert_ob_in_map (more, m, originator, flag)) |
1361 | if (!insert_ob_in_map (more, m, originator, flag)) |
1310 | return 0; |
1362 | return 0; |
1311 | |
1363 | |
1312 | CLEAR_FLAG (op, FLAG_REMOVED); |
1364 | op->flag [FLAG_REMOVED] = false; |
1313 | |
1365 | op->env = 0; |
1314 | op->map = m; |
1366 | op->map = newmap; |
|
|
1367 | |
1315 | mapspace &ms = op->ms (); |
1368 | mapspace &ms = op->ms (); |
1316 | |
1369 | |
1317 | /* this has to be done after we translate the coordinates. |
1370 | /* this has to be done after we translate the coordinates. |
1318 | */ |
1371 | */ |
1319 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1372 | if (op->nrof && !(flag & INS_NO_MERGE)) |
… | |
… | |
1322 | { |
1375 | { |
1323 | // TODO: we actually want to update tmp, not op, |
1376 | // TODO: we actually want to update tmp, not op, |
1324 | // but some caller surely breaks when we return tmp |
1377 | // but some caller surely breaks when we return tmp |
1325 | // from here :/ |
1378 | // from here :/ |
1326 | op->nrof += tmp->nrof; |
1379 | op->nrof += tmp->nrof; |
1327 | tmp->destroy (1); |
1380 | tmp->destroy (); |
1328 | } |
1381 | } |
1329 | |
1382 | |
1330 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1383 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1331 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1384 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1332 | |
1385 | |
… | |
… | |
1340 | 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"); |
1341 | abort (); |
1394 | abort (); |
1342 | } |
1395 | } |
1343 | |
1396 | |
1344 | if (!originator->is_on_map ()) |
1397 | if (!originator->is_on_map ()) |
|
|
1398 | { |
1345 | 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", |
1346 | op->debug_desc (), originator->debug_desc ()); |
1400 | op->debug_desc (), originator->debug_desc ()); |
|
|
1401 | abort (); |
|
|
1402 | } |
1347 | |
1403 | |
1348 | op->above = originator; |
1404 | op->above = originator; |
1349 | op->below = originator->below; |
1405 | op->below = originator->below; |
1350 | originator->below = op; |
1406 | originator->below = op; |
1351 | |
1407 | |
… | |
… | |
1437 | op->below = top; |
1493 | op->below = top; |
1438 | *(op->above ? &op->above->below : &ms.top) = op; |
1494 | *(op->above ? &op->above->below : &ms.top) = op; |
1439 | } |
1495 | } |
1440 | } |
1496 | } |
1441 | |
1497 | |
1442 | if (op->type == PLAYER) |
1498 | if (op->is_player ()) |
1443 | { |
1499 | { |
1444 | op->contr->do_los = 1; |
1500 | op->contr->do_los = 1; |
1445 | ++op->map->players; |
1501 | ++op->map->players; |
1446 | op->map->touch (); |
1502 | op->map->touch (); |
1447 | } |
1503 | } |
… | |
… | |
1462 | * be far away from this change and not affected in any way - |
1518 | * be far away from this change and not affected in any way - |
1463 | * this should get redone to only look for players within range, |
1519 | * this should get redone to only look for players within range, |
1464 | * or just updating the P_UPTODATE for spaces within this area |
1520 | * or just updating the P_UPTODATE for spaces within this area |
1465 | * of effect may be sufficient. |
1521 | * of effect may be sufficient. |
1466 | */ |
1522 | */ |
1467 | if (op->map->darkness && (op->glow_radius != 0)) |
1523 | if (op->affects_los ()) |
|
|
1524 | { |
|
|
1525 | op->ms ().invalidate (); |
1468 | update_all_los (op->map, op->x, op->y); |
1526 | update_all_los (op->map, op->x, op->y); |
|
|
1527 | } |
1469 | |
1528 | |
1470 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1529 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1471 | update_object (op, UP_OBJ_INSERT); |
1530 | update_object (op, UP_OBJ_INSERT); |
1472 | |
1531 | |
1473 | INVOKE_OBJECT (INSERT, op); |
1532 | INVOKE_OBJECT (INSERT, op); |
… | |
… | |
1480 | * blocked() and wall() work properly), and these flags are updated by |
1539 | * blocked() and wall() work properly), and these flags are updated by |
1481 | * update_object(). |
1540 | * update_object(). |
1482 | */ |
1541 | */ |
1483 | |
1542 | |
1484 | /* 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 */ |
1485 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1544 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1486 | { |
1545 | { |
1487 | if (check_move_on (op, originator)) |
1546 | if (check_move_on (op, originator)) |
1488 | return 0; |
1547 | return 0; |
1489 | |
1548 | |
1490 | /* 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 |
… | |
… | |
1501 | /* this function inserts an object in the map, but if it |
1560 | /* this function inserts an object in the map, but if it |
1502 | * finds an object of its own type, it'll remove that one first. |
1561 | * finds an object of its own type, it'll remove that one first. |
1503 | * op is the object to insert it under: supplies x and the map. |
1562 | * op is the object to insert it under: supplies x and the map. |
1504 | */ |
1563 | */ |
1505 | void |
1564 | void |
1506 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1565 | replace_insert_ob_in_map (shstr_tmp archname, object *op) |
1507 | { |
1566 | { |
1508 | /* first search for itself and remove any old instances */ |
1567 | /* first search for itself and remove any old instances */ |
1509 | |
1568 | |
1510 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1569 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1511 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1570 | if (tmp->arch->archname == archname) /* same archetype */ |
1512 | tmp->destroy (1); |
1571 | tmp->destroy (); |
1513 | |
1572 | |
1514 | object *tmp = arch_to_object (archetype::find (arch_string)); |
1573 | object *tmp = archetype::find (archname)->instance (); |
1515 | |
1574 | |
1516 | tmp->x = op->x; |
1575 | tmp->x = op->x; |
1517 | tmp->y = op->y; |
1576 | tmp->y = op->y; |
1518 | |
1577 | |
1519 | insert_ob_in_map (tmp, op->map, op, 0); |
1578 | insert_ob_in_map (tmp, op->map, op, 0); |
… | |
… | |
1524 | { |
1583 | { |
1525 | if (where->env) |
1584 | if (where->env) |
1526 | return where->env->insert (this); |
1585 | return where->env->insert (this); |
1527 | else |
1586 | else |
1528 | 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; |
1529 | } |
1610 | } |
1530 | |
1611 | |
1531 | /* |
1612 | /* |
1532 | * decrease(object, number) decreases a specified number from |
1613 | * decrease(object, number) decreases a specified number from |
1533 | * 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 |
… | |
… | |
1541 | if (!nr) |
1622 | if (!nr) |
1542 | return true; |
1623 | return true; |
1543 | |
1624 | |
1544 | nr = min (nr, nrof); |
1625 | nr = min (nr, nrof); |
1545 | |
1626 | |
|
|
1627 | if (nrof > nr) |
|
|
1628 | { |
1546 | nrof -= nr; |
1629 | nrof -= nr; |
1547 | |
|
|
1548 | if (nrof) |
|
|
1549 | { |
|
|
1550 | adjust_weight (env, -weight * nr); // carrying == 0 |
1630 | adjust_weight (env, -weight * max (1, nr)); // carrying == 0 |
1551 | |
1631 | |
1552 | if (object *pl = visible_to ()) |
1632 | if (object *pl = visible_to ()) |
1553 | esrv_update_item (UPD_NROF, pl, this); |
1633 | esrv_update_item (UPD_NROF, pl, this); |
1554 | |
1634 | |
1555 | return true; |
1635 | return true; |
1556 | } |
1636 | } |
1557 | else |
1637 | else |
1558 | { |
1638 | { |
1559 | destroy (1); |
1639 | destroy (); |
1560 | return false; |
1640 | return false; |
1561 | } |
1641 | } |
1562 | } |
1642 | } |
1563 | |
1643 | |
1564 | /* |
1644 | /* |
… | |
… | |
1641 | if (object *pl = tmp->visible_to ()) |
1721 | if (object *pl = tmp->visible_to ()) |
1642 | esrv_update_item (UPD_NROF, pl, tmp); |
1722 | esrv_update_item (UPD_NROF, pl, tmp); |
1643 | |
1723 | |
1644 | adjust_weight (this, op->total_weight ()); |
1724 | adjust_weight (this, op->total_weight ()); |
1645 | |
1725 | |
1646 | op->destroy (1); |
1726 | op->destroy (); |
1647 | op = tmp; |
1727 | op = tmp; |
1648 | goto inserted; |
1728 | goto inserted; |
1649 | } |
1729 | } |
1650 | |
1730 | |
1651 | op->owner = 0; // it's his/hers now. period. |
1731 | op->owner = 0; // it's his/hers now. period. |
… | |
… | |
1669 | |
1749 | |
1670 | adjust_weight (this, op->total_weight ()); |
1750 | adjust_weight (this, op->total_weight ()); |
1671 | |
1751 | |
1672 | inserted: |
1752 | inserted: |
1673 | /* reset the light list and los of the players on the map */ |
1753 | /* reset the light list and los of the players on the map */ |
1674 | if (op->glow_radius && map && map->darkness) |
1754 | if (op->glow_radius && is_on_map ()) |
|
|
1755 | { |
|
|
1756 | update_stats (); |
1675 | update_all_los (map, x, y); |
1757 | update_all_los (map, x, y); |
1676 | |
1758 | } |
|
|
1759 | else if (is_player ()) |
1677 | // if this is a player's inventory, update stats |
1760 | // if this is a player's inventory, update stats |
1678 | if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER]) |
1761 | contr->queue_stats_update (); |
1679 | update_stats (); |
|
|
1680 | |
1762 | |
1681 | INVOKE_OBJECT (INSERT, this); |
1763 | INVOKE_OBJECT (INSERT, this); |
1682 | |
1764 | |
1683 | return op; |
1765 | return op; |
1684 | } |
1766 | } |
… | |
… | |
1704 | * on top. |
1786 | * on top. |
1705 | */ |
1787 | */ |
1706 | int |
1788 | int |
1707 | check_move_on (object *op, object *originator) |
1789 | check_move_on (object *op, object *originator) |
1708 | { |
1790 | { |
|
|
1791 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
|
|
1792 | return 0; |
|
|
1793 | |
1709 | object *tmp; |
1794 | object *tmp; |
1710 | maptile *m = op->map; |
1795 | maptile *m = op->map; |
1711 | int x = op->x, y = op->y; |
1796 | int x = op->x, y = op->y; |
1712 | |
1797 | |
1713 | MoveType move_on, move_slow, move_block; |
1798 | mapspace &ms = m->at (x, y); |
1714 | |
1799 | |
1715 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1800 | ms.update (); |
1716 | return 0; |
|
|
1717 | |
1801 | |
1718 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1802 | MoveType move_on = ms.move_on; |
1719 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1803 | MoveType move_slow = ms.move_slow; |
1720 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1804 | MoveType move_block = ms.move_block; |
1721 | |
1805 | |
1722 | /* 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, |
1723 | * 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 |
1724 | * 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 |
1725 | * as walking. |
1809 | * as walking. |
… | |
… | |
1736 | return 0; |
1820 | return 0; |
1737 | |
1821 | |
1738 | /* The objects have to be checked from top to bottom. |
1822 | /* The objects have to be checked from top to bottom. |
1739 | * Hence, we first go to the top: |
1823 | * Hence, we first go to the top: |
1740 | */ |
1824 | */ |
1741 | |
1825 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1742 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
|
|
1743 | { |
|
|
1744 | /* Trim the search when we find the first other spell effect |
|
|
1745 | * this helps performance so that if a space has 50 spell objects, |
|
|
1746 | * we don't need to check all of them. |
|
|
1747 | */ |
|
|
1748 | if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK)) |
|
|
1749 | break; |
|
|
1750 | } |
1826 | { |
|
|
1827 | next = tmp->below; |
1751 | |
1828 | |
1752 | for (; tmp; tmp = tmp->below) |
|
|
1753 | { |
|
|
1754 | if (tmp == op) |
1829 | if (tmp == op) |
1755 | continue; /* Can't apply yourself */ |
1830 | continue; /* Can't apply yourself */ |
1756 | |
1831 | |
1757 | /* 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. |
1758 | * Second check makes sure that the movement types not being slowed |
1833 | * Second check makes sure that the movement types not being slowed |
… | |
… | |
1763 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1838 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1764 | { |
1839 | { |
1765 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1840 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1766 | ((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)) |
1767 | { |
1842 | { |
1768 | |
|
|
1769 | float |
|
|
1770 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1843 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
1771 | |
1844 | |
1772 | if (op->type == PLAYER) |
1845 | if (op->is_player ()) |
1773 | 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)) || |
1774 | (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))) |
1775 | diff /= 4.0; |
1848 | diff /= 4.0; |
1776 | |
1849 | |
1777 | op->speed_left -= diff; |
1850 | op->speed_left -= diff; |
1778 | } |
1851 | } |
1779 | } |
1852 | } |
… | |
… | |
1985 | * head of the object should correspond for the entire object. |
2058 | * head of the object should correspond for the entire object. |
1986 | */ |
2059 | */ |
1987 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
2060 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
1988 | continue; |
2061 | continue; |
1989 | |
2062 | |
1990 | if (ob->blocked (m, pos.x, pos.y)) |
2063 | if (ob->blocked (pos.m, pos.x, pos.y)) |
1991 | continue; |
2064 | continue; |
1992 | |
2065 | |
1993 | altern [index++] = i; |
2066 | altern [index++] = i; |
1994 | } |
2067 | } |
1995 | |
2068 | |
… | |
… | |
2063 | * there is capable of. |
2136 | * there is capable of. |
2064 | */ |
2137 | */ |
2065 | int |
2138 | int |
2066 | find_dir (maptile *m, int x, int y, object *exclude) |
2139 | find_dir (maptile *m, int x, int y, object *exclude) |
2067 | { |
2140 | { |
2068 | int i, max = SIZEOFFREE, mflags; |
2141 | int max = SIZEOFFREE, mflags; |
2069 | |
|
|
2070 | sint16 nx, ny; |
|
|
2071 | object *tmp; |
|
|
2072 | maptile *mp; |
|
|
2073 | |
|
|
2074 | MoveType blocked, move_type; |
2142 | MoveType move_type; |
2075 | |
2143 | |
2076 | if (exclude && exclude->head_ () != exclude) |
2144 | if (exclude && exclude->head_ () != exclude) |
2077 | { |
2145 | { |
2078 | exclude = exclude->head; |
2146 | exclude = exclude->head; |
2079 | move_type = exclude->move_type; |
2147 | move_type = exclude->move_type; |
… | |
… | |
2082 | { |
2150 | { |
2083 | /* If we don't have anything, presume it can use all movement types. */ |
2151 | /* If we don't have anything, presume it can use all movement types. */ |
2084 | move_type = MOVE_ALL; |
2152 | move_type = MOVE_ALL; |
2085 | } |
2153 | } |
2086 | |
2154 | |
2087 | for (i = 1; i < max; i++) |
2155 | for (int i = 1; i < max; i++) |
2088 | { |
2156 | { |
2089 | mp = m; |
2157 | mapxy pos (m, x, y); |
2090 | nx = x + freearr_x[i]; |
2158 | pos.move (i); |
2091 | ny = y + freearr_y[i]; |
|
|
2092 | |
2159 | |
2093 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
2160 | if (!pos.normalise ()) |
2094 | |
|
|
2095 | if (mflags & P_OUT_OF_MAP) |
|
|
2096 | max = maxfree[i]; |
2161 | max = maxfree[i]; |
2097 | else |
2162 | else |
2098 | { |
2163 | { |
2099 | mapspace &ms = mp->at (nx, ny); |
2164 | mapspace &ms = *pos; |
2100 | |
2165 | |
2101 | blocked = ms.move_block; |
|
|
2102 | |
|
|
2103 | if ((move_type & blocked) == move_type) |
2166 | if ((move_type & ms.move_block) == move_type) |
2104 | max = maxfree[i]; |
2167 | max = maxfree [i]; |
2105 | else if (mflags & P_IS_ALIVE) |
2168 | else if (ms.flags () & P_IS_ALIVE) |
2106 | { |
2169 | { |
2107 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2170 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
2108 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2171 | if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ()) |
2109 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2172 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2110 | break; |
|
|
2111 | |
|
|
2112 | if (tmp) |
|
|
2113 | return freedir[i]; |
2173 | return freedir [i]; |
2114 | } |
2174 | } |
2115 | } |
2175 | } |
2116 | } |
2176 | } |
2117 | |
2177 | |
2118 | return 0; |
2178 | return 0; |
… | |
… | |
2193 | * 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 |
2194 | * 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. |
2195 | * 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 |
2196 | * functions. |
2256 | * functions. |
2197 | */ |
2257 | */ |
2198 | int reduction_dir[SIZEOFFREE][3] = { |
2258 | static const int reduction_dir[SIZEOFFREE][3] = { |
2199 | {0, 0, 0}, /* 0 */ |
2259 | {0, 0, 0}, /* 0 */ |
2200 | {0, 0, 0}, /* 1 */ |
2260 | {0, 0, 0}, /* 1 */ |
2201 | {0, 0, 0}, /* 2 */ |
2261 | {0, 0, 0}, /* 2 */ |
2202 | {0, 0, 0}, /* 3 */ |
2262 | {0, 0, 0}, /* 3 */ |
2203 | {0, 0, 0}, /* 4 */ |
2263 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2299 | int |
2359 | int |
2300 | can_pick (const object *who, const object *item) |
2360 | can_pick (const object *who, const object *item) |
2301 | { |
2361 | { |
2302 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2362 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2303 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2363 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2304 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); |
2364 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2305 | } |
2365 | } |
2306 | |
2366 | |
2307 | /* |
2367 | /* |
2308 | * create clone from object to another |
2368 | * create clone from object to another |
2309 | */ |
2369 | */ |
… | |
… | |
2341 | return tmp; |
2401 | return tmp; |
2342 | |
2402 | |
2343 | return 0; |
2403 | return 0; |
2344 | } |
2404 | } |
2345 | |
2405 | |
2346 | const shstr & |
2406 | shstr_tmp |
2347 | object::kv_get (const shstr &key) const |
2407 | object::kv_get (shstr_tmp key) const |
2348 | { |
2408 | { |
2349 | for (key_value *kv = key_values; kv; kv = kv->next) |
2409 | for (key_value *kv = key_values; kv; kv = kv->next) |
2350 | if (kv->key == key) |
2410 | if (kv->key == key) |
2351 | return kv->value; |
2411 | return kv->value; |
2352 | |
2412 | |
2353 | return shstr_null; |
2413 | return shstr (); |
2354 | } |
2414 | } |
2355 | |
2415 | |
2356 | void |
2416 | void |
2357 | object::kv_set (const shstr &key, const shstr &value) |
2417 | object::kv_set (shstr_tmp key, shstr_tmp value) |
2358 | { |
2418 | { |
2359 | for (key_value *kv = key_values; kv; kv = kv->next) |
2419 | for (key_value *kv = key_values; kv; kv = kv->next) |
2360 | if (kv->key == key) |
2420 | if (kv->key == key) |
2361 | { |
2421 | { |
2362 | kv->value = value; |
2422 | kv->value = value; |
… | |
… | |
2371 | |
2431 | |
2372 | key_values = kv; |
2432 | key_values = kv; |
2373 | } |
2433 | } |
2374 | |
2434 | |
2375 | void |
2435 | void |
2376 | object::kv_del (const shstr &key) |
2436 | object::kv_del (shstr_tmp key) |
2377 | { |
2437 | { |
2378 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
2438 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
2379 | if ((*kvp)->key == key) |
2439 | if ((*kvp)->key == key) |
2380 | { |
2440 | { |
2381 | key_value *kv = *kvp; |
2441 | key_value *kv = *kvp; |
… | |
… | |
2474 | { |
2534 | { |
2475 | return map ? map->region (x, y) |
2535 | return map ? map->region (x, y) |
2476 | : region::default_region (); |
2536 | : region::default_region (); |
2477 | } |
2537 | } |
2478 | |
2538 | |
2479 | const materialtype_t * |
|
|
2480 | object::dominant_material () const |
|
|
2481 | { |
|
|
2482 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2483 | return mt; |
|
|
2484 | |
|
|
2485 | return name_to_material (shstr_unknown); |
|
|
2486 | } |
|
|
2487 | |
|
|
2488 | void |
2539 | void |
2489 | object::open_container (object *new_container) |
2540 | object::open_container (object *new_container) |
2490 | { |
2541 | { |
2491 | if (container == new_container) |
2542 | if (container == new_container) |
2492 | return; |
2543 | return; |
… | |
… | |
2512 | container = 0; |
2563 | container = 0; |
2513 | |
2564 | |
2514 | // 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 |
2515 | esrv_update_item (UPD_FLAGS, this, old_container); |
2566 | esrv_update_item (UPD_FLAGS, this, old_container); |
2516 | |
2567 | |
2517 | 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 ()); |
2518 | play_sound (sound_find ("chest_close")); |
2569 | play_sound (sound_find ("chest_close")); |
2519 | } |
2570 | } |
2520 | |
2571 | |
2521 | if (new_container) |
2572 | if (new_container) |
2522 | { |
2573 | { |
… | |
… | |
2526 | // TODO: this does not seem to serve any purpose anymore? |
2577 | // TODO: this does not seem to serve any purpose anymore? |
2527 | #if 0 |
2578 | #if 0 |
2528 | // insert the "Close Container" object. |
2579 | // insert the "Close Container" object. |
2529 | if (archetype *closer = new_container->other_arch) |
2580 | if (archetype *closer = new_container->other_arch) |
2530 | { |
2581 | { |
2531 | object *closer = arch_to_object (new_container->other_arch); |
2582 | object *closer = new_container->other_arch->instance (); |
2532 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2583 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2533 | new_container->insert (closer); |
2584 | new_container->insert (closer); |
2534 | } |
2585 | } |
2535 | #endif |
2586 | #endif |
2536 | |
2587 | |
2537 | 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 ()); |
2538 | |
2589 | |
2539 | // 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 |
2540 | esrv_send_item (this, new_container); |
2591 | esrv_send_item (this, new_container); |
2541 | |
2592 | |
2542 | new_container->flag [FLAG_APPLIED] = true; |
2593 | new_container->flag [FLAG_APPLIED] = true; |
… | |
… | |
2550 | // else if (!old_container->env && contr && contr->ns) |
2601 | // else if (!old_container->env && contr && contr->ns) |
2551 | // contr->ns->floorbox_reset (); |
2602 | // contr->ns->floorbox_reset (); |
2552 | } |
2603 | } |
2553 | |
2604 | |
2554 | object * |
2605 | object * |
2555 | object::force_find (const shstr name) |
2606 | object::force_find (shstr_tmp name) |
2556 | { |
2607 | { |
2557 | /* cycle through his inventory to look for the MARK we want to |
2608 | /* cycle through his inventory to look for the MARK we want to |
2558 | * place |
2609 | * place |
2559 | */ |
2610 | */ |
2560 | for (object *tmp = inv; tmp; tmp = tmp->below) |
2611 | for (object *tmp = inv; tmp; tmp = tmp->below) |
… | |
… | |
2562 | return splay (tmp); |
2613 | return splay (tmp); |
2563 | |
2614 | |
2564 | return 0; |
2615 | return 0; |
2565 | } |
2616 | } |
2566 | |
2617 | |
|
|
2618 | //-GPL |
|
|
2619 | |
2567 | void |
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 | |
|
|
2629 | object * |
2568 | object::force_add (const shstr name, int duration) |
2630 | object::force_add (shstr_tmp name, int duration) |
2569 | { |
2631 | { |
2570 | if (object *force = force_find (name)) |
2632 | if (object *force = force_find (name)) |
2571 | force->destroy (); |
2633 | force->destroy (); |
2572 | |
2634 | |
2573 | object *force = get_archetype (FORCE_NAME); |
2635 | object *force = get_archetype (FORCE_NAME); |
2574 | |
2636 | |
2575 | force->slaying = name; |
2637 | force->slaying = name; |
2576 | force->stats.food = 1; |
2638 | force->force_set_timer (duration); |
2577 | force->speed_left = -1.f; |
|
|
2578 | |
|
|
2579 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2580 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2581 | force->flag [FLAG_APPLIED] = true; |
2639 | force->flag [FLAG_APPLIED] = true; |
2582 | |
2640 | |
2583 | insert (force); |
2641 | return insert (force); |
2584 | } |
2642 | } |
2585 | |
2643 | |
2586 | void |
2644 | void |
2587 | object::play_sound (faceidx sound) |
2645 | object::play_sound (faceidx sound) const |
2588 | { |
2646 | { |
2589 | if (!sound) |
2647 | if (!sound) |
2590 | return; |
2648 | return; |
2591 | |
2649 | |
2592 | if (flag [FLAG_REMOVED]) |
2650 | if (is_on_map ()) |
|
|
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); |
|
|
2663 | } |
|
|
2664 | |
|
|
2665 | void |
|
|
2666 | object::make_noise () |
|
|
2667 | { |
|
|
2668 | // we do not model noise in the map, so instead put |
|
|
2669 | // a temporary light into the noise source |
|
|
2670 | // could use the map instead, but that's less reliable for our |
|
|
2671 | // goal, which is to make invisibility a bit harder to exploit |
|
|
2672 | |
|
|
2673 | // currently only works sensibly for players |
|
|
2674 | if (!is_player ()) |
2593 | return; |
2675 | return; |
2594 | |
2676 | |
2595 | if (env) |
2677 | // find old force, or create new one |
2596 | { |
2678 | object *force = force_find (shstr_noise_force); |
2597 | if (object *pl = in_player ()) |
2679 | |
2598 | pl->contr->play_sound (sound); |
2680 | if (force) |
2599 | } |
2681 | force->speed_left = -1.f; // patch old speed up |
2600 | else |
2682 | else |
2601 | map->play_sound (sound, x, y); |
2683 | { |
2602 | } |
2684 | force = archetype::get (shstr_noise_force); |
2603 | |
2685 | |
|
|
2686 | force->slaying = shstr_noise_force; |
|
|
2687 | force->stats.food = 1; |
|
|
2688 | force->speed_left = -1.f; |
|
|
2689 | |
|
|
2690 | force->set_speed (1.f / 4.f); |
|
|
2691 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2692 | force->flag [FLAG_APPLIED] = true; |
|
|
2693 | |
|
|
2694 | insert (force); |
|
|
2695 | } |
|
|
2696 | } |
|
|
2697 | |