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 | |
38 | |
38 | objectvec objects; |
39 | objectvec objects; |
39 | activevec actives; |
40 | activevec actives; |
|
|
41 | |
|
|
42 | freelist_item *object::freelist; |
|
|
43 | uint32_t object::object_count; |
|
|
44 | uint32_t object::free_count; |
|
|
45 | uint32_t object::create_count; |
|
|
46 | uint32_t object::destroy_count; |
|
|
47 | |
|
|
48 | //+GPL |
40 | |
49 | |
41 | short freearr_x[SIZEOFFREE] = { |
50 | short freearr_x[SIZEOFFREE] = { |
42 | 0, |
51 | 0, |
43 | 0, 1, 1, 1, 0, -1, -1, -1, |
52 | 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, |
53 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
… | |
… | |
48 | 0, |
57 | 0, |
49 | -1, -1, 0, 1, 1, 1, 0, -1, |
58 | -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, |
59 | -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 |
60 | -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 | }; |
61 | }; |
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] = { |
62 | int freedir[SIZEOFFREE] = { |
60 | 0, |
63 | 0, |
61 | 1, 2, 3, 4, 5, 6, 7, 8, |
64 | 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, |
65 | 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 |
66 | 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 | }; |
67 | }; |
65 | |
68 | |
|
|
69 | static int maxfree[SIZEOFFREE] = { |
|
|
70 | 0, |
|
|
71 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
72 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
|
|
73 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
|
|
74 | }; |
|
|
75 | |
|
|
76 | const char *wall_suffix[16] = { |
|
|
77 | "0", |
|
|
78 | "1_3", |
|
|
79 | "1_4", |
|
|
80 | "2_1_2", |
|
|
81 | "1_2", |
|
|
82 | "2_2_4", |
|
|
83 | "2_2_1", |
|
|
84 | "3_1", |
|
|
85 | "1_1", |
|
|
86 | "2_2_3", |
|
|
87 | "2_2_2", |
|
|
88 | "3_3", |
|
|
89 | "2_1_1", |
|
|
90 | "3_4", |
|
|
91 | "3_2", |
|
|
92 | "4" |
|
|
93 | }; |
|
|
94 | |
66 | static void |
95 | static void |
67 | write_uuid (uval64 skip, bool sync) |
96 | write_uuid (uval64 skip, bool sync) |
68 | { |
97 | { |
69 | CALL_BEGIN (2); |
98 | CALL_BEGIN (2); |
70 | CALL_ARG_SV (newSVval64 (skip)); |
99 | CALL_ARG_SV (newSVval64 (skip)); |
… | |
… | |
72 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
101 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
73 | CALL_END; |
102 | CALL_END; |
74 | } |
103 | } |
75 | |
104 | |
76 | static void |
105 | static void |
77 | read_uuid (void) |
106 | read_uuid () |
78 | { |
107 | { |
79 | char filename[MAX_BUF]; |
108 | char filename[MAX_BUF]; |
80 | |
109 | |
81 | sprintf (filename, "%s/uuid", settings.localdir); |
110 | sprintf (filename, "%s/uuid", settings.localdir); |
82 | |
111 | |
… | |
… | |
96 | |
125 | |
97 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
126 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
98 | _exit (1); |
127 | _exit (1); |
99 | } |
128 | } |
100 | |
129 | |
101 | UUID::BUF buf; |
130 | char buf [UUID::MAX_LEN]; |
102 | buf[0] = 0; |
131 | buf[0] = 0; |
103 | fgets (buf, sizeof (buf), fp); |
132 | fgets (buf, sizeof (buf), fp); |
104 | |
133 | |
105 | if (!UUID::cur.parse (buf)) |
134 | if (!UUID::cur.parse (buf)) |
106 | { |
135 | { |
… | |
… | |
133 | |
162 | |
134 | void |
163 | void |
135 | UUID::init () |
164 | UUID::init () |
136 | { |
165 | { |
137 | read_uuid (); |
166 | read_uuid (); |
|
|
167 | } |
|
|
168 | |
|
|
169 | bool |
|
|
170 | UUID::parse (const char *s) |
|
|
171 | { |
|
|
172 | if (*s++ != '<' || *s++ != '1' || *s++ != '.') |
|
|
173 | return false; |
|
|
174 | |
|
|
175 | seq = 0; |
|
|
176 | |
|
|
177 | while (*s != '>') |
|
|
178 | { |
|
|
179 | if (*s < '0') |
|
|
180 | return false; |
|
|
181 | |
|
|
182 | // this gives nice branchless code with gcc |
|
|
183 | assert ('0' < 'a' && '0' == 48 && 'a' == 97); |
|
|
184 | int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15; |
|
|
185 | |
|
|
186 | seq = (seq << 4) | digit; |
|
|
187 | |
|
|
188 | ++s; |
|
|
189 | } |
|
|
190 | |
|
|
191 | return true; |
|
|
192 | } |
|
|
193 | |
|
|
194 | char * |
|
|
195 | UUID::append (char *buf) const |
|
|
196 | { |
|
|
197 | *buf++ = '<'; |
|
|
198 | *buf++ = '1'; |
|
|
199 | *buf++ = '.'; |
|
|
200 | |
|
|
201 | uint64_t seq = this->seq; |
|
|
202 | const int bits = 64; |
|
|
203 | char nz = 0; |
|
|
204 | static const char tohex [] = "0123456789abcdef"; |
|
|
205 | |
|
|
206 | // assert (len >= 3 + bits / 4 + 1 + 1); |
|
|
207 | for (int i = bits / 4; --i; ) |
|
|
208 | { |
|
|
209 | uint8_t digit = seq >> (bits - 4); |
|
|
210 | |
|
|
211 | *buf = tohex [digit]; |
|
|
212 | nz |= digit; |
|
|
213 | buf += nz ? 1 : 0; |
|
|
214 | seq <<= 4; |
|
|
215 | } |
|
|
216 | |
|
|
217 | // last digit is special - always emit |
|
|
218 | uint8_t digit = seq >> (bits - 4); |
|
|
219 | *buf++ = tohex [digit]; |
|
|
220 | |
|
|
221 | *buf++ = '>'; |
|
|
222 | |
|
|
223 | return buf; |
|
|
224 | } |
|
|
225 | |
|
|
226 | char * |
|
|
227 | UUID::c_str () const |
|
|
228 | { |
|
|
229 | static char buf [MAX_LEN]; |
|
|
230 | *append (buf) = 0; |
|
|
231 | return buf; |
138 | } |
232 | } |
139 | |
233 | |
140 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
234 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
141 | static bool |
235 | static bool |
142 | compare_ob_value_lists_one (const object *wants, const object *has) |
236 | compare_ob_value_lists_one (const object *wants, const object *has) |
… | |
… | |
178 | * Improvements made with merge: Better checking on potion, and also |
272 | * Improvements made with merge: Better checking on potion, and also |
179 | * check weight |
273 | * check weight |
180 | */ |
274 | */ |
181 | bool object::can_merge_slow (object *ob1, object *ob2) |
275 | bool object::can_merge_slow (object *ob1, object *ob2) |
182 | { |
276 | { |
183 | /* A couple quicksanity checks */ |
277 | /* A couple quick sanity checks */ |
184 | if (ob1 == ob2 |
278 | if (ob1 == ob2 |
185 | || ob1->type != ob2->type |
279 | || ob1->type != ob2->type |
186 | || ob1->speed != ob2->speed |
|
|
187 | || ob1->value != ob2->value |
280 | || ob1->value != ob2->value |
188 | || ob1->name != ob2->name) |
281 | || ob1->name != ob2->name |
|
|
282 | || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED) |
189 | return 0; |
283 | return 0; |
190 | |
284 | |
191 | /* Do not merge objects if nrof would overflow. First part checks |
285 | /* Do not merge objects if nrof would overflow, assume nrof |
192 | * for unsigned overflow (2c), second part checks whether the result |
286 | * is always 0 .. 2**31-1 */ |
193 | * would fit into a 32 bit signed int, which is often used to hold |
287 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
194 | * nrof values. |
|
|
195 | */ |
|
|
196 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
|
|
197 | return 0; |
288 | return 0; |
198 | |
289 | |
199 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
290 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
200 | * This is to the comparison of the flags below will be OK. We |
291 | * This is to the comparison of the flags below will be OK. We |
201 | * just can't ignore the been applied or identified flags, as they |
292 | * just can't ignore the been applied or identified flags, as they |
202 | * are not equal - just if it has been identified, the been_applied |
293 | * are not equal - just if it has been identified, the been_applied |
203 | * flags lose any meaning. |
294 | * flags lose any meaning. |
204 | */ |
295 | */ |
205 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
296 | if (ob1->flag [FLAG_IDENTIFIED]) |
206 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
297 | ob1->set_flag (FLAG_BEEN_APPLIED); |
207 | |
298 | |
208 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
299 | if (ob2->flag [FLAG_IDENTIFIED]) |
209 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
300 | ob2->set_flag (FLAG_BEEN_APPLIED); |
210 | |
301 | |
211 | if (ob1->arch->archname != ob2->arch->archname |
302 | if (ob1->arch->archname != ob2->arch->archname |
212 | || ob1->name != ob2->name |
303 | || ob1->name != ob2->name |
213 | || ob1->title != ob2->title |
304 | || ob1->title != ob2->title |
214 | || ob1->msg != ob2->msg |
305 | || ob1->msg != ob2->msg |
… | |
… | |
217 | || ob1->magic != ob2->magic |
308 | || ob1->magic != ob2->magic |
218 | || ob1->slaying != ob2->slaying |
309 | || ob1->slaying != ob2->slaying |
219 | || ob1->skill != ob2->skill |
310 | || ob1->skill != ob2->skill |
220 | || ob1->value != ob2->value |
311 | || ob1->value != ob2->value |
221 | || ob1->animation_id != ob2->animation_id |
312 | || ob1->animation_id != ob2->animation_id |
222 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other |
313 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other |
223 | || ob1->client_type != ob2->client_type |
314 | || ob1->client_type != ob2->client_type |
224 | || ob1->materialname != ob2->materialname |
315 | || ob1->material != ob2->material |
225 | || ob1->lore != ob2->lore |
316 | || ob1->lore != ob2->lore |
226 | || ob1->subtype != ob2->subtype |
317 | || ob1->subtype != ob2->subtype |
227 | || ob1->move_type != ob2->move_type |
318 | || ob1->move_type != ob2->move_type |
228 | || ob1->move_block != ob2->move_block |
319 | || ob1->move_block != ob2->move_block |
229 | || ob1->move_allow != ob2->move_allow |
320 | || ob1->move_allow != ob2->move_allow |
230 | || ob1->move_on != ob2->move_on |
321 | || ob1->move_on != ob2->move_on |
231 | || ob1->move_off != ob2->move_off |
322 | || ob1->move_off != ob2->move_off |
232 | || ob1->move_slow != ob2->move_slow |
323 | || ob1->move_slow != ob2->move_slow |
233 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
324 | || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f) |
234 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
325 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
235 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
326 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
236 | return 0; |
327 | return 0; |
237 | |
328 | |
238 | if ((ob1->flag ^ ob2->flag) |
329 | if ((ob1->flag ^ ob2->flag) |
239 | .reset (FLAG_INV_LOCKED) |
330 | .reset (FLAG_INV_LOCKED) |
240 | .reset (FLAG_CLIENT_SENT) |
|
|
241 | .reset (FLAG_REMOVED) |
331 | .reset (FLAG_REMOVED) |
242 | .any ()) |
332 | .any ()) |
243 | return 0; |
333 | return 0; |
244 | |
334 | |
245 | /* This is really a spellbook check - we should in general |
335 | /* This is really a spellbook check - we should in general |
… | |
… | |
264 | |
354 | |
265 | /* Don't merge objects that are applied. With the new 'body' code, |
355 | /* Don't merge objects that are applied. With the new 'body' code, |
266 | * it is possible for most any character to have more than one of |
356 | * it is possible for most any character to have more than one of |
267 | * some items equipped, and we don't want those to merge. |
357 | * some items equipped, and we don't want those to merge. |
268 | */ |
358 | */ |
269 | if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED)) |
359 | if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED]) |
270 | return 0; |
360 | return 0; |
271 | |
361 | |
272 | /* Note sure why the following is the case - either the object has to |
362 | /* Note sure why the following is the case - either the object has to |
273 | * be animated or have a very low speed. Is this an attempted monster |
363 | * be animated or have a very low speed. Is this an attempted monster |
274 | * check? |
364 | * check? |
275 | */ |
365 | */ |
276 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
366 | if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ()) |
277 | return 0; |
367 | return 0; |
278 | |
368 | |
279 | switch (ob1->type) |
369 | switch (ob1->type) |
280 | { |
370 | { |
281 | case SCROLL: |
371 | case SCROLL: |
… | |
… | |
327 | { |
417 | { |
328 | // see if we are in a container of sorts |
418 | // see if we are in a container of sorts |
329 | if (env) |
419 | if (env) |
330 | { |
420 | { |
331 | // the player inventory itself is always visible |
421 | // the player inventory itself is always visible |
332 | if (env->type == PLAYER) |
422 | if (env->is_player ()) |
333 | return env; |
423 | return env; |
334 | |
424 | |
335 | // else a player could have our env open |
425 | // else a player could have our env open |
336 | object *envest = env->outer_env (); |
426 | object *envest = env->outer_env_or_self (); |
337 | |
427 | |
338 | // the player itself is always on a map, so we will find him here |
428 | // the player itself is always on a map, so we will find him here |
339 | // even if our inv is in a player. |
429 | // even if our inv is in a player. |
340 | if (envest->is_on_map ()) |
430 | if (envest->is_on_map ()) |
341 | if (object *pl = envest->ms ().player ()) |
431 | if (object *pl = envest->ms ().player ()) |
342 | if (pl->container == env) |
432 | if (pl->container_ () == env) |
343 | return pl; |
433 | return pl; |
344 | } |
434 | } |
345 | else |
435 | else |
346 | { |
436 | { |
347 | // maybe there is a player standing on the same mapspace |
437 | // maybe there is a player standing on the same mapspace |
348 | // this will catch the case where "this" is a player |
438 | // this will catch the case where "this" is a player |
349 | if (object *pl = ms ().player ()) |
439 | if (object *pl = ms ().player ()) |
350 | if (!pl->container || this == pl->container) |
440 | if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look) |
|
|
441 | || pl->container_ () == this) |
351 | return pl; |
442 | return pl; |
352 | } |
443 | } |
353 | } |
444 | } |
354 | |
445 | |
355 | return 0; |
446 | return 0; |
356 | } |
447 | } |
357 | |
448 | |
358 | // adjust weight per container type ("of holding") |
449 | // adjust weight per container type ("of holding") |
359 | static sint32 |
450 | static uint32 |
360 | weight_adjust_for (object *op, sint32 weight) |
451 | weight_adjust_for (object *op, uint32 weight) |
361 | { |
452 | { |
362 | return op->type == CONTAINER |
453 | return op->type == CONTAINER |
363 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
454 | ? weight - weight * op->stats.Str / 100 |
364 | : weight; |
455 | : weight; |
365 | } |
456 | } |
366 | |
457 | |
367 | /* |
458 | /* |
368 | * adjust_weight(object, weight) adds the specified weight to an object, |
459 | * subtracts, then adds, the specified weight to an object, |
369 | * and also updates how much the environment(s) is/are carrying. |
460 | * and also updates how much the environment(s) is/are carrying. |
370 | */ |
461 | */ |
371 | static void |
462 | static void |
372 | adjust_weight (object *op, sint32 weight) |
463 | adjust_weight (object *op, sint32 sub, sint32 add) |
373 | { |
464 | { |
374 | while (op) |
465 | while (op) |
375 | { |
466 | { |
376 | // adjust by actual difference to account for rounding errors |
467 | sint32 ocarrying = op->carrying; |
377 | // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct |
|
|
378 | weight = weight_adjust_for (op, op->carrying) |
|
|
379 | - weight_adjust_for (op, op->carrying - weight); |
|
|
380 | |
468 | |
381 | if (!weight) |
469 | op->carrying -= weight_adjust_for (op, sub); |
382 | return; |
470 | op->carrying += weight_adjust_for (op, add); |
383 | |
|
|
384 | op->carrying += weight; |
|
|
385 | |
471 | |
386 | if (object *pl = op->visible_to ()) |
472 | if (object *pl = op->visible_to ()) |
387 | if (pl != op) // player is handled lazily |
473 | if (pl != op) // player is handled lazily |
388 | esrv_update_item (UPD_WEIGHT, pl, op); |
474 | esrv_update_item (UPD_WEIGHT, pl, op); |
389 | |
475 | |
|
|
476 | sub = ocarrying; |
|
|
477 | add = op->carrying; |
|
|
478 | |
390 | op = op->env; |
479 | op = op->env; |
391 | } |
480 | } |
392 | } |
481 | } |
393 | |
482 | |
394 | /* |
483 | /* |
… | |
… | |
401 | { |
490 | { |
402 | sint32 sum = 0; |
491 | sint32 sum = 0; |
403 | |
492 | |
404 | for (object *op = inv; op; op = op->below) |
493 | for (object *op = inv; op; op = op->below) |
405 | { |
494 | { |
406 | if (op->inv) |
|
|
407 | op->update_weight (); |
495 | op->update_weight (); |
408 | |
496 | |
409 | sum += op->total_weight (); |
497 | sum += weight_adjust_for (this, op->total_weight ()); |
410 | } |
498 | } |
411 | |
|
|
412 | sum = weight_adjust_for (this, sum); |
|
|
413 | |
499 | |
414 | if (sum != carrying) |
500 | if (sum != carrying) |
415 | { |
501 | { |
|
|
502 | if (carrying != sum && carrying)//D |
|
|
503 | LOG (llevDebug, "updating carrying got %ld, expected %ld (%s)\n", |
|
|
504 | (long long)sum, (long long)carrying, debug_desc ()); |
|
|
505 | |
416 | carrying = sum; |
506 | carrying = sum; |
417 | |
507 | |
418 | if (object *pl = visible_to ()) |
508 | if (object *pl = visible_to ()) |
419 | if (pl != this) // player is handled lazily |
509 | if (pl != this) // player is handled lazily |
420 | esrv_update_item (UPD_WEIGHT, pl, this); |
510 | esrv_update_item (UPD_WEIGHT, pl, this); |
… | |
… | |
433 | object_freezer freezer; |
523 | object_freezer freezer; |
434 | op->write (freezer); |
524 | op->write (freezer); |
435 | return freezer.as_string (); |
525 | return freezer.as_string (); |
436 | } |
526 | } |
437 | |
527 | |
438 | /* |
528 | char * |
439 | * get_nearest_part(multi-object, object 2) returns the part of the |
529 | object::as_string () |
440 | * multi-object 1 which is closest to the second object. |
|
|
441 | * If it's not a multi-object, it is returned. |
|
|
442 | */ |
|
|
443 | object * |
|
|
444 | get_nearest_part (object *op, const object *pl) |
|
|
445 | { |
530 | { |
446 | object *tmp, *closest; |
531 | return dump_object (this); |
447 | int last_dist, i; |
|
|
448 | |
|
|
449 | if (!op->more) |
|
|
450 | return op; |
|
|
451 | |
|
|
452 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
453 | tmp; |
|
|
454 | tmp = tmp->more) |
|
|
455 | if ((i = distance (tmp, pl)) < last_dist) |
|
|
456 | closest = tmp, last_dist = i; |
|
|
457 | |
|
|
458 | return closest; |
|
|
459 | } |
532 | } |
460 | |
533 | |
461 | /* |
534 | /* |
462 | * Returns the object which has the count-variable equal to the argument. |
535 | * Returns the object which has the count-variable equal to the argument. |
463 | * VERRRY slow. |
536 | * VERRRY slow. |
… | |
… | |
465 | object * |
538 | object * |
466 | find_object (tag_t i) |
539 | find_object (tag_t i) |
467 | { |
540 | { |
468 | for_all_objects (op) |
541 | for_all_objects (op) |
469 | if (op->count == i) |
542 | if (op->count == i) |
|
|
543 | return op; |
|
|
544 | |
|
|
545 | return 0; |
|
|
546 | } |
|
|
547 | |
|
|
548 | /* |
|
|
549 | * Returns the object which has the uuid equal to the argument. |
|
|
550 | * MOAR VERRRY slow. |
|
|
551 | */ |
|
|
552 | |
|
|
553 | object * |
|
|
554 | find_object_uuid (UUID i) |
|
|
555 | { |
|
|
556 | for_all_objects (op) |
|
|
557 | if (op->uuid == i) |
470 | return op; |
558 | return op; |
471 | |
559 | |
472 | return 0; |
560 | return 0; |
473 | } |
561 | } |
474 | |
562 | |
… | |
… | |
508 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
596 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
509 | return; |
597 | return; |
510 | } |
598 | } |
511 | |
599 | |
512 | this->owner = owner; |
600 | this->owner = owner; |
513 | } |
|
|
514 | |
|
|
515 | int |
|
|
516 | object::slottype () const |
|
|
517 | { |
|
|
518 | if (type == SKILL) |
|
|
519 | { |
|
|
520 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
521 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
522 | } |
|
|
523 | else |
|
|
524 | { |
|
|
525 | if (slot [body_combat].info) return slot_combat; |
|
|
526 | if (slot [body_range ].info) return slot_ranged; |
|
|
527 | } |
|
|
528 | |
|
|
529 | return slot_none; |
|
|
530 | } |
|
|
531 | |
|
|
532 | bool |
|
|
533 | object::change_weapon (object *ob) |
|
|
534 | { |
|
|
535 | if (current_weapon == ob) |
|
|
536 | return true; |
|
|
537 | |
|
|
538 | if (chosen_skill) |
|
|
539 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
540 | |
|
|
541 | current_weapon = ob; |
|
|
542 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
543 | |
|
|
544 | if (chosen_skill) |
|
|
545 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
546 | |
|
|
547 | update_stats (); |
|
|
548 | |
|
|
549 | if (ob) |
|
|
550 | { |
|
|
551 | // now check wether any body locations became invalid, in which case |
|
|
552 | // we cannot apply the weapon at the moment. |
|
|
553 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
554 | if (slot[i].used < 0) |
|
|
555 | { |
|
|
556 | current_weapon = chosen_skill = 0; |
|
|
557 | update_stats (); |
|
|
558 | |
|
|
559 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
560 | "You try to balance all your items at once, " |
|
|
561 | "but the %s is just too much for your body. " |
|
|
562 | "[You need to unapply some items first.]", &ob->name); |
|
|
563 | return false; |
|
|
564 | } |
|
|
565 | |
|
|
566 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
567 | } |
|
|
568 | else |
|
|
569 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
570 | |
|
|
571 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
572 | { |
|
|
573 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
574 | &name, ob->debug_desc ()); |
|
|
575 | return false; |
|
|
576 | } |
|
|
577 | |
|
|
578 | return true; |
|
|
579 | } |
601 | } |
580 | |
602 | |
581 | /* Zero the key_values on op, decrementing the shared-string |
603 | /* Zero the key_values on op, decrementing the shared-string |
582 | * refcounts and freeing the links. |
604 | * refcounts and freeing the links. |
583 | */ |
605 | */ |
… | |
… | |
636 | tail = new_link; |
658 | tail = new_link; |
637 | } |
659 | } |
638 | } |
660 | } |
639 | } |
661 | } |
640 | |
662 | |
641 | if (speed < 0) |
663 | dst->activate (); |
642 | dst->speed_left -= rndm (); |
|
|
643 | |
|
|
644 | dst->set_speed (dst->speed); |
|
|
645 | } |
664 | } |
646 | |
665 | |
647 | void |
666 | void |
648 | object::instantiate () |
667 | object::instantiate () |
649 | { |
668 | { |
650 | if (!uuid.seq) // HACK |
669 | if (!uuid.seq) // HACK |
651 | uuid = UUID::gen (); |
670 | uuid = UUID::gen (); |
652 | |
671 | |
|
|
672 | // TODO: unclean state changes, should nt be done in copy_to AND instantiate |
|
|
673 | if (flag [FLAG_RANDOM_SPEED] && speed) |
|
|
674 | speed_left = - speed - rndm (); // TODO animation |
|
|
675 | else |
653 | speed_left = -0.1f; |
676 | speed_left = -1.; |
|
|
677 | |
654 | /* copy the body_info to the body_used - this is only really |
678 | /* copy the body_info to the body_used - this is only really |
655 | * need for monsters, but doesn't hurt to do it for everything. |
679 | * need for monsters, but doesn't hurt to do it for everything. |
656 | * by doing so, when a monster is created, it has good starting |
680 | * by doing so, when a monster is created, it has good starting |
657 | * values for the body_used info, so when items are created |
681 | * values for the body_used info, so when items are created |
658 | * for it, they can be properly equipped. |
682 | * for it, they can be properly equipped. |
… | |
… | |
666 | object * |
690 | object * |
667 | object::clone () |
691 | object::clone () |
668 | { |
692 | { |
669 | object *neu = create (); |
693 | object *neu = create (); |
670 | copy_to (neu); |
694 | copy_to (neu); |
|
|
695 | |
|
|
696 | // TODO: unclean state changes, should not be done in clone AND instantiate |
|
|
697 | if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed) |
|
|
698 | neu->speed_left = - neu->speed - rndm (); // TODO animation |
|
|
699 | |
671 | neu->map = map; // not copied by copy_to |
700 | neu->map = map; // not copied by copy_to |
672 | return neu; |
701 | return neu; |
673 | } |
702 | } |
674 | |
703 | |
675 | /* |
704 | /* |
… | |
… | |
678 | * be called to update the face variable, _and_ how it looks on the map. |
707 | * be called to update the face variable, _and_ how it looks on the map. |
679 | */ |
708 | */ |
680 | void |
709 | void |
681 | update_turn_face (object *op) |
710 | update_turn_face (object *op) |
682 | { |
711 | { |
683 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
712 | if (!op->flag [FLAG_IS_TURNABLE] || !op->arch) |
684 | return; |
713 | return; |
685 | |
714 | |
686 | SET_ANIMATION (op, op->direction); |
715 | SET_ANIMATION (op, op->direction); |
687 | update_object (op, UP_OBJ_FACE); |
716 | update_object (op, UP_OBJ_FACE); |
688 | } |
717 | } |
… | |
… | |
693 | * This function needs to be called whenever the speed of an object changes. |
722 | * This function needs to be called whenever the speed of an object changes. |
694 | */ |
723 | */ |
695 | void |
724 | void |
696 | object::set_speed (float speed) |
725 | object::set_speed (float speed) |
697 | { |
726 | { |
698 | if (flag [FLAG_FREED] && speed) |
|
|
699 | { |
|
|
700 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
|
|
701 | speed = 0; |
|
|
702 | } |
|
|
703 | |
|
|
704 | this->speed = speed; |
727 | this->speed = speed; |
705 | |
728 | |
706 | if (has_active_speed ()) |
729 | if (has_active_speed ()) |
707 | activate (); |
730 | activate (); |
708 | else |
731 | else |
… | |
… | |
758 | |
781 | |
759 | if (!(m.flags_ & P_UPTODATE)) |
782 | if (!(m.flags_ & P_UPTODATE)) |
760 | /* nop */; |
783 | /* nop */; |
761 | else if (action == UP_OBJ_INSERT) |
784 | else if (action == UP_OBJ_INSERT) |
762 | { |
785 | { |
|
|
786 | #if 0 |
763 | // this is likely overkill, TODO: revisit (schmorp) |
787 | // this is likely overkill, TODO: revisit (schmorp) |
764 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
788 | if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW)) |
765 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
789 | || (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC)) |
766 | || (op->type == PLAYER && !(m.flags_ & P_PLAYER)) |
790 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
767 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
791 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
768 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
792 | || (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE)) |
769 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
793 | || (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC)) |
770 | || (m.move_on | op->move_on ) != m.move_on |
794 | || (m.move_on | op->move_on ) != m.move_on |
771 | || (m.move_off | op->move_off ) != m.move_off |
795 | || (m.move_off | op->move_off ) != m.move_off |
772 | || (m.move_slow | op->move_slow) != m.move_slow |
796 | || (m.move_slow | op->move_slow) != m.move_slow |
773 | /* This isn't perfect, but I don't expect a lot of objects to |
797 | /* This isn't perfect, but I don't expect a lot of objects to |
774 | * to have move_allow right now. |
798 | * have move_allow right now. |
775 | */ |
799 | */ |
776 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
800 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
|
|
801 | m.invalidate (); |
|
|
802 | #else |
777 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
803 | // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp) |
778 | m.flags_ = 0; |
804 | m.invalidate (); |
|
|
805 | #endif |
779 | } |
806 | } |
780 | /* if the object is being removed, we can't make intelligent |
807 | /* if the object is being removed, we can't make intelligent |
781 | * decisions, because remove_ob can't really pass the object |
808 | * decisions, because remove_ob can't really pass the object |
782 | * that is being removed. |
809 | * that is being removed. |
783 | */ |
810 | */ |
784 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
811 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
785 | m.flags_ = 0; |
812 | m.invalidate (); |
786 | else if (action == UP_OBJ_FACE) |
813 | else if (action == UP_OBJ_FACE) |
787 | /* Nothing to do for that case */ ; |
814 | /* Nothing to do for that case */ ; |
788 | else |
815 | else |
789 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
816 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
790 | |
817 | |
… | |
… | |
792 | update_object (op->more, action); |
819 | update_object (op->more, action); |
793 | } |
820 | } |
794 | |
821 | |
795 | object::object () |
822 | object::object () |
796 | { |
823 | { |
797 | SET_FLAG (this, FLAG_REMOVED); |
824 | this->set_flag (FLAG_REMOVED); |
798 | |
825 | |
799 | expmul = 1.0; |
826 | //expmul = 1.0; declared const for the time being |
800 | face = blank_face; |
827 | face = blank_face; |
|
|
828 | material = MATERIAL_NULL; |
801 | } |
829 | } |
802 | |
830 | |
803 | object::~object () |
831 | object::~object () |
804 | { |
832 | { |
805 | unlink (); |
833 | unlink (); |
806 | |
834 | |
807 | free_key_values (this); |
835 | free_key_values (this); |
808 | } |
836 | } |
809 | |
|
|
810 | static int object_count; |
|
|
811 | |
837 | |
812 | void object::link () |
838 | void object::link () |
813 | { |
839 | { |
814 | assert (!index);//D |
840 | assert (!index);//D |
815 | uuid = UUID::gen (); |
841 | uuid = UUID::gen (); |
816 | count = ++object_count; |
|
|
817 | |
842 | |
818 | refcnt_inc (); |
843 | refcnt_inc (); |
819 | objects.insert (this); |
844 | objects.insert (this); |
|
|
845 | |
|
|
846 | ++create_count; |
|
|
847 | |
820 | } |
848 | } |
821 | |
849 | |
822 | void object::unlink () |
850 | void object::unlink () |
823 | { |
851 | { |
824 | if (!index) |
852 | if (!index) |
825 | return; |
853 | return; |
|
|
854 | |
|
|
855 | ++destroy_count; |
826 | |
856 | |
827 | objects.erase (this); |
857 | objects.erase (this); |
828 | refcnt_dec (); |
858 | refcnt_dec (); |
829 | } |
859 | } |
830 | |
860 | |
… | |
… | |
834 | /* If already on active list, don't do anything */ |
864 | /* If already on active list, don't do anything */ |
835 | if (active) |
865 | if (active) |
836 | return; |
866 | return; |
837 | |
867 | |
838 | if (has_active_speed ()) |
868 | if (has_active_speed ()) |
|
|
869 | { |
|
|
870 | if (flag [FLAG_FREED]) |
|
|
871 | LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D |
|
|
872 | |
839 | actives.insert (this); |
873 | actives.insert (this); |
|
|
874 | } |
840 | } |
875 | } |
841 | |
876 | |
842 | void |
877 | void |
843 | object::activate_recursive () |
878 | object::activate_recursive () |
844 | { |
879 | { |
… | |
… | |
909 | || map->in_memory != MAP_ACTIVE |
944 | || map->in_memory != MAP_ACTIVE |
910 | || map->no_drop |
945 | || map->no_drop |
911 | || ms ().move_block == MOVE_ALL) |
946 | || ms ().move_block == MOVE_ALL) |
912 | { |
947 | { |
913 | while (inv) |
948 | while (inv) |
914 | { |
|
|
915 | inv->destroy_inv (false); |
|
|
916 | inv->destroy (); |
949 | inv->destroy (); |
917 | } |
|
|
918 | } |
950 | } |
919 | else |
951 | else |
920 | { /* Put objects in inventory onto this space */ |
952 | { /* Put objects in inventory onto this space */ |
921 | while (inv) |
953 | while (inv) |
922 | { |
954 | { |
… | |
… | |
926 | || op->flag [FLAG_NO_DROP] |
958 | || op->flag [FLAG_NO_DROP] |
927 | || op->type == RUNE |
959 | || op->type == RUNE |
928 | || op->type == TRAP |
960 | || op->type == TRAP |
929 | || op->flag [FLAG_IS_A_TEMPLATE] |
961 | || op->flag [FLAG_IS_A_TEMPLATE] |
930 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
962 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
931 | op->destroy (true); |
963 | op->destroy (); |
932 | else |
964 | else |
933 | map->insert (op, x, y); |
965 | map->insert (op, x, y); |
934 | } |
966 | } |
935 | } |
967 | } |
936 | } |
968 | } |
937 | |
969 | |
|
|
970 | /* |
|
|
971 | * Remove and free all objects in the inventory of the given object. |
|
|
972 | * Unlike destroy_inv, this assumes the *this is destroyed as well |
|
|
973 | * well, so we can (and have to!) take shortcuts. |
|
|
974 | */ |
|
|
975 | void |
|
|
976 | object::destroy_inv_fast () |
|
|
977 | { |
|
|
978 | while (object *op = inv) |
|
|
979 | { |
|
|
980 | // remove from object the fast way |
|
|
981 | op->flag [FLAG_REMOVED] = true; |
|
|
982 | op->env = 0; |
|
|
983 | if ((inv = inv->below)) |
|
|
984 | inv->above = 0; |
|
|
985 | |
|
|
986 | // then destroy |
|
|
987 | op->destroy (); |
|
|
988 | } |
|
|
989 | } |
|
|
990 | |
|
|
991 | void |
|
|
992 | object::freelist_free (int count) |
|
|
993 | { |
|
|
994 | while (count-- && freelist) |
|
|
995 | { |
|
|
996 | freelist_item *next = freelist->next; |
|
|
997 | // count is being "destroyed" |
|
|
998 | |
|
|
999 | sfree ((char *)freelist, sizeof (object)); |
|
|
1000 | |
|
|
1001 | freelist = next; |
|
|
1002 | --free_count; |
|
|
1003 | } |
|
|
1004 | } |
|
|
1005 | |
|
|
1006 | object * |
938 | object *object::create () |
1007 | object::create () |
939 | { |
1008 | { |
940 | object *op = new object; |
1009 | object *op; |
|
|
1010 | |
|
|
1011 | if (freelist) |
|
|
1012 | { |
|
|
1013 | freelist_item li = *freelist; |
|
|
1014 | memset (freelist, 0, sizeof (object)); |
|
|
1015 | |
|
|
1016 | op = new (freelist) object; |
|
|
1017 | op->count = li.count; |
|
|
1018 | |
|
|
1019 | freelist = li.next; |
|
|
1020 | --free_count; |
|
|
1021 | } |
|
|
1022 | else |
|
|
1023 | { |
|
|
1024 | void *ni = salloc0<char> (sizeof (object)); |
|
|
1025 | |
|
|
1026 | op = new(ni) object; |
|
|
1027 | |
|
|
1028 | op->count = ++object_count; |
|
|
1029 | } |
|
|
1030 | |
941 | op->link (); |
1031 | op->link (); |
|
|
1032 | |
942 | return op; |
1033 | return op; |
943 | } |
1034 | } |
944 | |
1035 | |
|
|
1036 | void |
|
|
1037 | object::do_delete () |
|
|
1038 | { |
|
|
1039 | uint32_t count = this->count; |
|
|
1040 | |
|
|
1041 | this->~object (); |
|
|
1042 | |
|
|
1043 | freelist_item *li = (freelist_item *)this; |
|
|
1044 | li->next = freelist; |
|
|
1045 | li->count = count; |
|
|
1046 | |
|
|
1047 | freelist = li; |
|
|
1048 | ++free_count; |
|
|
1049 | } |
|
|
1050 | |
945 | static struct freed_map : maptile |
1051 | static struct freed_map : maptile |
946 | { |
1052 | { |
947 | freed_map () |
1053 | freed_map () |
|
|
1054 | : maptile (3, 3) |
948 | { |
1055 | { |
949 | path = "<freed objects map>"; |
1056 | path = "<freed objects map>"; |
950 | name = "/internal/freed_objects_map"; |
1057 | name = "/internal/freed_objects_map"; |
951 | width = 3; |
|
|
952 | height = 3; |
|
|
953 | no_drop = 1; |
1058 | no_drop = 1; |
954 | no_reset = 1; |
1059 | no_reset = 1; |
955 | |
1060 | |
956 | alloc (); |
|
|
957 | in_memory = MAP_ACTIVE; |
1061 | in_memory = MAP_ACTIVE; |
958 | } |
1062 | } |
959 | |
1063 | |
960 | ~freed_map () |
1064 | ~freed_map () |
961 | { |
1065 | { |
… | |
… | |
965 | |
1069 | |
966 | void |
1070 | void |
967 | object::do_destroy () |
1071 | object::do_destroy () |
968 | { |
1072 | { |
969 | if (flag [FLAG_IS_LINKED]) |
1073 | if (flag [FLAG_IS_LINKED]) |
970 | remove_button_link (this); |
1074 | remove_link (); |
971 | |
1075 | |
972 | if (flag [FLAG_FRIENDLY]) |
1076 | if (flag [FLAG_FRIENDLY]) |
973 | remove_friendly_object (this); |
1077 | remove_friendly_object (this); |
974 | |
1078 | |
975 | remove (); |
1079 | remove (); |
… | |
… | |
1000 | attacked_by = 0; |
1104 | attacked_by = 0; |
1001 | current_weapon = 0; |
1105 | current_weapon = 0; |
1002 | } |
1106 | } |
1003 | |
1107 | |
1004 | void |
1108 | void |
1005 | object::destroy (bool destroy_inventory) |
1109 | object::destroy () |
1006 | { |
1110 | { |
1007 | if (destroyed ()) |
1111 | if (destroyed ()) |
1008 | return; |
1112 | return; |
1009 | |
1113 | |
1010 | if (!is_head () && !head->destroyed ()) |
1114 | if (!is_head () && !head->destroyed ()) |
1011 | { |
1115 | { |
1012 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1116 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1013 | head->destroy (destroy_inventory); |
1117 | head->destroy (); |
1014 | return; |
1118 | return; |
1015 | } |
1119 | } |
1016 | |
1120 | |
1017 | destroy_inv (!destroy_inventory); |
1121 | destroy_inv_fast (); |
1018 | |
1122 | |
1019 | if (is_head ()) |
1123 | if (is_head ()) |
1020 | if (sound_destroy) |
1124 | if (sound_destroy) |
1021 | play_sound (sound_destroy); |
1125 | play_sound (sound_destroy); |
1022 | else if (flag [FLAG_MONSTER]) |
1126 | else if (flag [FLAG_MONSTER]) |
… | |
… | |
1033 | * the previous environment. |
1137 | * the previous environment. |
1034 | */ |
1138 | */ |
1035 | void |
1139 | void |
1036 | object::do_remove () |
1140 | object::do_remove () |
1037 | { |
1141 | { |
1038 | object *tmp, *last = 0; |
|
|
1039 | object *otmp; |
|
|
1040 | |
|
|
1041 | if (flag [FLAG_REMOVED]) |
1142 | if (flag [FLAG_REMOVED]) |
1042 | return; |
1143 | return; |
1043 | |
1144 | |
1044 | INVOKE_OBJECT (REMOVE, this); |
1145 | INVOKE_OBJECT (REMOVE, this); |
1045 | |
1146 | |
… | |
… | |
1057 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1158 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1058 | if (object *pl = visible_to ()) |
1159 | if (object *pl = visible_to ()) |
1059 | esrv_del_item (pl->contr, count); |
1160 | esrv_del_item (pl->contr, count); |
1060 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1161 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1061 | |
1162 | |
1062 | adjust_weight (env, -total_weight ()); |
1163 | adjust_weight (env, total_weight (), 0); |
|
|
1164 | |
|
|
1165 | object *pl = in_player (); |
1063 | |
1166 | |
1064 | /* we set up values so that it could be inserted into |
1167 | /* we set up values so that it could be inserted into |
1065 | * the map, but we don't actually do that - it is up |
1168 | * the map, but we don't actually do that - it is up |
1066 | * to the caller to decide what we want to do. |
1169 | * to the caller to decide what we want to do. |
1067 | */ |
1170 | */ |
… | |
… | |
1075 | |
1178 | |
1076 | above = 0; |
1179 | above = 0; |
1077 | below = 0; |
1180 | below = 0; |
1078 | env = 0; |
1181 | env = 0; |
1079 | |
1182 | |
1080 | /* NO_FIX_PLAYER is set when a great many changes are being |
1183 | if (pl && pl->is_player ()) |
1081 | * made to players inventory. If set, avoiding the call |
|
|
1082 | * to save cpu time. |
|
|
1083 | */ |
1184 | { |
1084 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1185 | if (expect_false (pl->contr->combat_ob == this)) |
1085 | otmp->update_stats (); |
1186 | { |
|
|
1187 | pl->apply (pl->contr->combat_ob, AP_UNAPPLY | AP_IGNORE_CURSE); |
|
|
1188 | pl->contr->combat_ob = 0; |
|
|
1189 | if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob); |
|
|
1190 | } |
|
|
1191 | |
|
|
1192 | if (expect_false (pl->contr->ranged_ob == this)) |
|
|
1193 | { |
|
|
1194 | pl->apply (pl->contr->ranged_ob, AP_UNAPPLY | AP_IGNORE_CURSE); |
|
|
1195 | pl->contr->ranged_ob = 0; |
|
|
1196 | if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob); |
|
|
1197 | } |
|
|
1198 | |
|
|
1199 | pl->contr->queue_stats_update (); |
|
|
1200 | |
|
|
1201 | if (expect_false (glow_radius) && pl->is_on_map ()) |
|
|
1202 | update_all_los (pl->map, pl->x, pl->y); |
|
|
1203 | } |
1086 | } |
1204 | } |
1087 | else if (map) |
1205 | else if (map) |
1088 | { |
1206 | { |
1089 | map->dirty = true; |
1207 | map->dirty = true; |
1090 | mapspace &ms = this->ms (); |
1208 | mapspace &ms = this->ms (); |
1091 | |
1209 | |
1092 | if (object *pl = ms.player ()) |
1210 | if (object *pl = ms.player ()) |
1093 | { |
1211 | { |
1094 | if (type == PLAYER) // this == pl(!) |
1212 | if (is_player ()) |
1095 | { |
1213 | { |
|
|
1214 | if (!flag [FLAG_WIZPASS]) |
|
|
1215 | ms.smell = ++mapspace::smellcount; // remember the smell of the player |
|
|
1216 | |
1096 | // leaving a spot always closes any open container on the ground |
1217 | // leaving a spot always closes any open container on the ground |
1097 | if (container && !container->env) |
1218 | if (container && !container->env) |
1098 | // this causes spurious floorbox updates, but it ensures |
1219 | // this causes spurious floorbox updates, but it ensures |
1099 | // that the CLOSE event is being sent. |
1220 | // that the CLOSE event is being sent. |
1100 | close_container (); |
1221 | close_container (); |
1101 | |
1222 | |
1102 | --map->players; |
1223 | --map->players; |
1103 | map->touch (); |
1224 | map->touch (); |
1104 | } |
1225 | } |
1105 | else if (pl->container == this) |
1226 | else if (pl->container_ () == this) |
1106 | { |
1227 | { |
1107 | // removing a container should close it |
1228 | // removing a container should close it |
1108 | close_container (); |
1229 | close_container (); |
1109 | } |
1230 | } |
1110 | |
1231 | else |
1111 | esrv_del_item (pl->contr, count); |
1232 | esrv_del_item (pl->contr, count); |
1112 | } |
1233 | } |
1113 | |
1234 | |
1114 | /* link the object above us */ |
1235 | /* link the object above us */ |
1115 | // re-link, make sure compiler can easily use cmove |
1236 | // re-link, make sure compiler can easily use cmove |
1116 | *(above ? &above->below : &ms.top) = below; |
1237 | *(above ? &above->below : &ms.top) = below; |
1117 | *(below ? &below->above : &ms.bot) = above; |
1238 | *(below ? &below->above : &ms.bot) = above; |
1118 | |
1239 | |
1119 | above = 0; |
1240 | above = 0; |
1120 | below = 0; |
1241 | below = 0; |
1121 | |
1242 | |
|
|
1243 | ms.invalidate (); |
|
|
1244 | |
1122 | if (map->in_memory == MAP_SAVING) |
1245 | if (map->in_memory == MAP_SAVING) |
1123 | return; |
1246 | return; |
1124 | |
1247 | |
1125 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1248 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1126 | |
1249 | |
1127 | if (object *pl = ms.player ()) |
1250 | if (object *pl = ms.player ()) |
1128 | { |
1251 | { |
1129 | if (pl->container == this) |
1252 | if (pl->container_ () == this) |
1130 | /* If a container that the player is currently using somehow gets |
1253 | /* If a container that the player is currently using somehow gets |
1131 | * removed (most likely destroyed), update the player view |
1254 | * removed (most likely destroyed), update the player view |
1132 | * appropriately. |
1255 | * appropriately. |
1133 | */ |
1256 | */ |
1134 | pl->close_container (); |
1257 | pl->close_container (); |
… | |
… | |
1138 | //TODO: update floorbox to preserve ordering |
1261 | //TODO: update floorbox to preserve ordering |
1139 | if (pl->contr->ns) |
1262 | if (pl->contr->ns) |
1140 | pl->contr->ns->floorbox_update (); |
1263 | pl->contr->ns->floorbox_update (); |
1141 | } |
1264 | } |
1142 | |
1265 | |
|
|
1266 | if (check_walk_off) |
1143 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1267 | for (object *above, *tmp = ms.bot; tmp; tmp = above) |
1144 | { |
1268 | { |
|
|
1269 | above = tmp->above; |
|
|
1270 | |
1145 | /* No point updating the players look faces if he is the object |
1271 | /* No point updating the players look faces if he is the object |
1146 | * being removed. |
1272 | * being removed. |
1147 | */ |
1273 | */ |
1148 | |
1274 | |
1149 | /* See if object moving off should effect something */ |
1275 | /* See if object moving off should effect something */ |
1150 | if (check_walk_off |
|
|
1151 | && ((move_type & tmp->move_off) |
1276 | if ((move_type & tmp->move_off) |
1152 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1277 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0) |
1153 | { |
|
|
1154 | move_apply (tmp, this, 0); |
1278 | move_apply (tmp, this, 0); |
1155 | |
|
|
1156 | if (destroyed ()) |
|
|
1157 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
|
|
1158 | } |
1279 | } |
1159 | |
1280 | |
1160 | last = tmp; |
1281 | if (affects_los ()) |
1161 | } |
|
|
1162 | |
|
|
1163 | /* last == NULL if there are no objects on this space */ |
|
|
1164 | //TODO: this makes little sense, why only update the topmost object? |
|
|
1165 | if (!last) |
|
|
1166 | map->at (x, y).flags_ = 0; |
|
|
1167 | else |
|
|
1168 | update_object (last, UP_OBJ_REMOVE); |
|
|
1169 | |
|
|
1170 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
|
|
1171 | update_all_los (map, x, y); |
1282 | update_all_los (map, x, y); |
1172 | } |
1283 | } |
1173 | } |
1284 | } |
1174 | |
1285 | |
1175 | /* |
1286 | /* |
… | |
… | |
1199 | esrv_update_item (UPD_NROF, pl, top); |
1310 | esrv_update_item (UPD_NROF, pl, top); |
1200 | |
1311 | |
1201 | op->weight = 0; // cancel the addition above |
1312 | op->weight = 0; // cancel the addition above |
1202 | op->carrying = 0; // must be 0 already |
1313 | op->carrying = 0; // must be 0 already |
1203 | |
1314 | |
1204 | op->destroy (1); |
1315 | op->destroy (); |
1205 | |
1316 | |
1206 | return top; |
1317 | return top; |
1207 | } |
1318 | } |
1208 | |
1319 | |
1209 | return 0; |
1320 | return 0; |
… | |
… | |
1217 | |
1328 | |
1218 | object *prev = this; |
1329 | object *prev = this; |
1219 | |
1330 | |
1220 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1331 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1221 | { |
1332 | { |
1222 | object *op = arch_to_object (at); |
1333 | object *op = at->instance (); |
1223 | |
1334 | |
1224 | op->name = name; |
1335 | op->name = name; |
1225 | op->name_pl = name_pl; |
1336 | op->name_pl = name_pl; |
1226 | op->title = title; |
1337 | op->title = title; |
1227 | |
1338 | |
… | |
… | |
1265 | * Passing 0 for flag gives proper default values, so flag really only needs |
1376 | * Passing 0 for flag gives proper default values, so flag really only needs |
1266 | * to be set if special handling is needed. |
1377 | * to be set if special handling is needed. |
1267 | * |
1378 | * |
1268 | * Return value: |
1379 | * Return value: |
1269 | * new object if 'op' was merged with other object |
1380 | * new object if 'op' was merged with other object |
1270 | * NULL if 'op' was destroyed |
1381 | * NULL if there was an error (destroyed, blocked etc.) |
1271 | * just 'op' otherwise |
1382 | * just 'op' otherwise |
1272 | */ |
1383 | */ |
1273 | object * |
1384 | object * |
1274 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1385 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1275 | { |
1386 | { |
1276 | if (op->is_on_map ()) |
|
|
1277 | { |
|
|
1278 | LOG (llevError, "insert_ob_in_map called for object already on map"); |
|
|
1279 | abort (); |
|
|
1280 | } |
|
|
1281 | |
|
|
1282 | if (op->env) |
|
|
1283 | { |
|
|
1284 | LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)"); |
|
|
1285 | op->remove (); |
1387 | op->remove (); |
1286 | } |
|
|
1287 | |
1388 | |
1288 | if (op->face && !face_info (op->face))//D TODO: remove soon |
1389 | if (m == &freed_map)//D TODO: remove soon |
1289 | {//D |
1390 | {//D |
1290 | LOG (llevError | logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D |
1391 | LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D |
1291 | op->face = 1;//D |
|
|
1292 | }//D |
1392 | }//D |
1293 | |
1393 | |
1294 | /* Ideally, the caller figures this out. However, it complicates a lot |
1394 | /* Ideally, the caller figures this out. However, it complicates a lot |
1295 | * of areas of callers (eg, anything that uses find_free_spot would now |
1395 | * of areas of callers (eg, anything that uses find_free_spot would now |
1296 | * need extra work |
1396 | * need extra work |
1297 | */ |
1397 | */ |
|
|
1398 | maptile *newmap = m; |
1298 | if (!xy_normalise (m, op->x, op->y)) |
1399 | if (!xy_normalise (newmap, op->x, op->y)) |
1299 | { |
1400 | { |
1300 | op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found |
1401 | op->head_ ()->destroy ();// remove head_ once all tail object destroyers found |
1301 | return 0; |
1402 | return 0; |
1302 | } |
1403 | } |
1303 | |
1404 | |
1304 | if (object *more = op->more) |
1405 | if (object *more = op->more) |
1305 | if (!insert_ob_in_map (more, m, originator, flag)) |
1406 | if (!insert_ob_in_map (more, m, originator, flag)) |
1306 | return 0; |
1407 | return 0; |
1307 | |
1408 | |
1308 | CLEAR_FLAG (op, FLAG_REMOVED); |
1409 | op->flag [FLAG_REMOVED] = false; |
1309 | |
1410 | op->env = 0; |
1310 | op->map = m; |
1411 | op->map = newmap; |
|
|
1412 | |
1311 | mapspace &ms = op->ms (); |
1413 | mapspace &ms = op->ms (); |
1312 | |
1414 | |
1313 | /* this has to be done after we translate the coordinates. |
1415 | /* this has to be done after we translate the coordinates. |
1314 | */ |
1416 | */ |
1315 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1417 | if (op->nrof && !(flag & INS_NO_MERGE)) |
… | |
… | |
1318 | { |
1420 | { |
1319 | // TODO: we actually want to update tmp, not op, |
1421 | // TODO: we actually want to update tmp, not op, |
1320 | // but some caller surely breaks when we return tmp |
1422 | // but some caller surely breaks when we return tmp |
1321 | // from here :/ |
1423 | // from here :/ |
1322 | op->nrof += tmp->nrof; |
1424 | op->nrof += tmp->nrof; |
1323 | tmp->destroy (1); |
1425 | tmp->destroy (); |
1324 | } |
1426 | } |
1325 | |
1427 | |
1326 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1428 | op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1327 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1429 | op->clr_flag (FLAG_INV_LOCKED); |
1328 | |
1430 | |
1329 | if (!QUERY_FLAG (op, FLAG_ALIVE)) |
1431 | if (!op->flag [FLAG_ALIVE]) |
1330 | CLEAR_FLAG (op, FLAG_NO_STEAL); |
1432 | op->clr_flag (FLAG_NO_STEAL); |
1331 | |
1433 | |
1332 | if (flag & INS_BELOW_ORIGINATOR) |
1434 | if (flag & INS_BELOW_ORIGINATOR) |
1333 | { |
1435 | { |
1334 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1436 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1335 | { |
1437 | { |
1336 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1438 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1337 | abort (); |
1439 | abort (); |
1338 | } |
1440 | } |
1339 | |
1441 | |
1340 | if (!originator->is_on_map ()) |
1442 | if (!originator->is_on_map ()) |
|
|
1443 | { |
1341 | LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", |
1444 | LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", |
1342 | op->debug_desc (), originator->debug_desc ()); |
1445 | op->debug_desc (), originator->debug_desc ()); |
|
|
1446 | abort (); |
|
|
1447 | } |
1343 | |
1448 | |
1344 | op->above = originator; |
1449 | op->above = originator; |
1345 | op->below = originator->below; |
1450 | op->below = originator->below; |
1346 | originator->below = op; |
1451 | originator->below = op; |
1347 | |
1452 | |
… | |
… | |
1367 | * when lots of spells are cast in one area. Currently, it is presumed |
1472 | * when lots of spells are cast in one area. Currently, it is presumed |
1368 | * that flying non pickable objects are spell objects. |
1473 | * that flying non pickable objects are spell objects. |
1369 | */ |
1474 | */ |
1370 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1475 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1371 | { |
1476 | { |
1372 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR)) |
1477 | if (tmp->flag [FLAG_IS_FLOOR] || tmp->flag [FLAG_OVERLAY_FLOOR]) |
1373 | floor = tmp; |
1478 | floor = tmp; |
1374 | |
1479 | |
1375 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1480 | if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR]) |
1376 | { |
1481 | { |
1377 | /* We insert above top, so we want this object below this */ |
1482 | /* We insert above top, so we want this object below this */ |
1378 | top = tmp->below; |
1483 | top = tmp->below; |
1379 | break; |
1484 | break; |
1380 | } |
1485 | } |
… | |
… | |
1398 | && (op->face && !faces [op->face].visibility)) |
1503 | && (op->face && !faces [op->face].visibility)) |
1399 | { |
1504 | { |
1400 | object *last; |
1505 | object *last; |
1401 | |
1506 | |
1402 | for (last = top; last != floor; last = last->below) |
1507 | for (last = top; last != floor; last = last->below) |
1403 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1508 | if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT)) |
1404 | break; |
1509 | break; |
1405 | |
1510 | |
1406 | /* Check to see if we found the object that blocks view, |
1511 | /* Check to see if we found the object that blocks view, |
1407 | * and make sure we have a below pointer for it so that |
1512 | * and make sure we have a below pointer for it so that |
1408 | * we can get inserted below this one, which requires we |
1513 | * we can get inserted below this one, which requires we |
… | |
… | |
1433 | op->below = top; |
1538 | op->below = top; |
1434 | *(op->above ? &op->above->below : &ms.top) = op; |
1539 | *(op->above ? &op->above->below : &ms.top) = op; |
1435 | } |
1540 | } |
1436 | } |
1541 | } |
1437 | |
1542 | |
1438 | if (op->type == PLAYER) |
1543 | if (op->is_player ()) |
1439 | { |
1544 | { |
1440 | op->contr->do_los = 1; |
1545 | op->contr->do_los = 1; |
1441 | ++op->map->players; |
1546 | ++op->map->players; |
1442 | op->map->touch (); |
1547 | op->map->touch (); |
1443 | } |
1548 | } |
… | |
… | |
1458 | * be far away from this change and not affected in any way - |
1563 | * be far away from this change and not affected in any way - |
1459 | * this should get redone to only look for players within range, |
1564 | * this should get redone to only look for players within range, |
1460 | * or just updating the P_UPTODATE for spaces within this area |
1565 | * or just updating the P_UPTODATE for spaces within this area |
1461 | * of effect may be sufficient. |
1566 | * of effect may be sufficient. |
1462 | */ |
1567 | */ |
1463 | if (op->map->darkness && (op->glow_radius != 0)) |
1568 | if (op->affects_los ()) |
|
|
1569 | { |
|
|
1570 | op->ms ().invalidate (); |
1464 | update_all_los (op->map, op->x, op->y); |
1571 | update_all_los (op->map, op->x, op->y); |
|
|
1572 | } |
1465 | |
1573 | |
1466 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1574 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1467 | update_object (op, UP_OBJ_INSERT); |
1575 | update_object (op, UP_OBJ_INSERT); |
1468 | |
1576 | |
1469 | INVOKE_OBJECT (INSERT, op); |
1577 | INVOKE_OBJECT (INSERT, op); |
… | |
… | |
1476 | * blocked() and wall() work properly), and these flags are updated by |
1584 | * blocked() and wall() work properly), and these flags are updated by |
1477 | * update_object(). |
1585 | * update_object(). |
1478 | */ |
1586 | */ |
1479 | |
1587 | |
1480 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1588 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1481 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1589 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1482 | { |
1590 | { |
1483 | if (check_move_on (op, originator)) |
1591 | if (check_move_on (op, originator, flag)) |
1484 | return 0; |
1592 | return 0; |
1485 | |
1593 | |
1486 | /* If we are a multi part object, lets work our way through the check |
1594 | /* If we are a multi part object, let's work our way through the check |
1487 | * walk on's. |
1595 | * walk on's. |
1488 | */ |
1596 | */ |
1489 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1597 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1490 | if (check_move_on (tmp, originator)) |
1598 | if (check_move_on (tmp, originator, flag)) |
1491 | return 0; |
1599 | return 0; |
1492 | } |
1600 | } |
1493 | |
1601 | |
1494 | return op; |
1602 | return op; |
1495 | } |
1603 | } |
… | |
… | |
1497 | /* this function inserts an object in the map, but if it |
1605 | /* this function inserts an object in the map, but if it |
1498 | * finds an object of its own type, it'll remove that one first. |
1606 | * finds an object of its own type, it'll remove that one first. |
1499 | * op is the object to insert it under: supplies x and the map. |
1607 | * op is the object to insert it under: supplies x and the map. |
1500 | */ |
1608 | */ |
1501 | void |
1609 | void |
1502 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1610 | replace_insert_ob_in_map (shstr_tmp archname, object *op) |
1503 | { |
1611 | { |
1504 | /* first search for itself and remove any old instances */ |
1612 | /* first search for itself and remove any old instances */ |
1505 | |
1613 | |
1506 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1614 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1507 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1615 | if (tmp->arch->archname == archname) /* same archetype */ |
1508 | tmp->destroy (1); |
1616 | tmp->destroy (); |
1509 | |
1617 | |
1510 | object *tmp = arch_to_object (archetype::find (arch_string)); |
1618 | object *tmp = archetype::find (archname)->instance (); |
1511 | |
1619 | |
1512 | tmp->x = op->x; |
1620 | tmp->x = op->x; |
1513 | tmp->y = op->y; |
1621 | tmp->y = op->y; |
1514 | |
1622 | |
1515 | insert_ob_in_map (tmp, op->map, op, 0); |
1623 | insert_ob_in_map (tmp, op->map, op, 0); |
… | |
… | |
1520 | { |
1628 | { |
1521 | if (where->env) |
1629 | if (where->env) |
1522 | return where->env->insert (this); |
1630 | return where->env->insert (this); |
1523 | else |
1631 | else |
1524 | return where->map->insert (this, where->x, where->y, originator, flags); |
1632 | return where->map->insert (this, where->x, where->y, originator, flags); |
|
|
1633 | } |
|
|
1634 | |
|
|
1635 | // check whether we can put this into the map, respect max_volume, max_items |
|
|
1636 | bool |
|
|
1637 | object::can_drop_at (maptile *m, int x, int y, object *originator) |
|
|
1638 | { |
|
|
1639 | mapspace &ms = m->at (x, y); |
|
|
1640 | |
|
|
1641 | int items = ms.items (); |
|
|
1642 | |
|
|
1643 | if (!items // testing !items ensures we can drop at least one item |
|
|
1644 | || (items < m->max_items |
|
|
1645 | && ms.volume () < m->max_volume)) |
|
|
1646 | return true; |
|
|
1647 | |
|
|
1648 | if (originator && originator->is_player ()) |
|
|
1649 | originator->contr->failmsgf ( |
|
|
1650 | "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>", |
|
|
1651 | query_name () |
|
|
1652 | ); |
|
|
1653 | |
|
|
1654 | return false; |
1525 | } |
1655 | } |
1526 | |
1656 | |
1527 | /* |
1657 | /* |
1528 | * decrease(object, number) decreases a specified number from |
1658 | * decrease(object, number) decreases a specified number from |
1529 | * the amount of an object. If the amount reaches 0, the object |
1659 | * the amount of an object. If the amount reaches 0, the object |
… | |
… | |
1537 | if (!nr) |
1667 | if (!nr) |
1538 | return true; |
1668 | return true; |
1539 | |
1669 | |
1540 | nr = min (nr, nrof); |
1670 | nr = min (nr, nrof); |
1541 | |
1671 | |
|
|
1672 | if (nrof > nr) |
|
|
1673 | { |
|
|
1674 | sint64 oweight = total_weight (); |
|
|
1675 | |
1542 | nrof -= nr; |
1676 | nrof -= nr; |
1543 | |
|
|
1544 | if (nrof) |
|
|
1545 | { |
|
|
1546 | adjust_weight (env, -weight * nr); // carrying == 0 |
|
|
1547 | |
1677 | |
1548 | if (object *pl = visible_to ()) |
1678 | if (object *pl = visible_to ()) |
1549 | esrv_update_item (UPD_NROF, pl, this); |
1679 | esrv_update_item (UPD_NROF, pl, this); |
1550 | |
1680 | |
|
|
1681 | adjust_weight (env, oweight, total_weight ()); |
|
|
1682 | |
1551 | return true; |
1683 | return true; |
1552 | } |
1684 | } |
1553 | else |
1685 | else |
1554 | { |
1686 | { |
1555 | destroy (1); |
1687 | destroy (); |
1556 | return false; |
1688 | return false; |
1557 | } |
1689 | } |
1558 | } |
1690 | } |
1559 | |
1691 | |
1560 | /* |
1692 | /* |
… | |
… | |
1629 | if (op->nrof) |
1761 | if (op->nrof) |
1630 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1762 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1631 | if (object::can_merge (tmp, op)) |
1763 | if (object::can_merge (tmp, op)) |
1632 | { |
1764 | { |
1633 | /* return the original object and remove inserted object |
1765 | /* return the original object and remove inserted object |
1634 | (client needs the original object) */ |
1766 | (client prefers the original object) */ |
|
|
1767 | |
|
|
1768 | // carring must be 0 for mergable objects |
|
|
1769 | sint64 oweight = tmp->weight * tmp->nrof; |
|
|
1770 | |
1635 | tmp->nrof += op->nrof; |
1771 | tmp->nrof += op->nrof; |
1636 | |
1772 | |
1637 | if (object *pl = tmp->visible_to ()) |
1773 | if (object *pl = tmp->visible_to ()) |
1638 | esrv_update_item (UPD_NROF, pl, tmp); |
1774 | esrv_update_item (UPD_NROF, pl, tmp); |
1639 | |
1775 | |
1640 | adjust_weight (this, op->total_weight ()); |
1776 | adjust_weight (this, oweight, tmp->weight * tmp->nrof); |
1641 | |
1777 | |
1642 | op->destroy (1); |
1778 | op->destroy (); |
1643 | op = tmp; |
1779 | op = tmp; |
1644 | goto inserted; |
1780 | goto inserted; |
1645 | } |
1781 | } |
1646 | |
1782 | |
1647 | op->owner = 0; // it's his/hers now. period. |
1783 | op->owner = 0; // it's his/hers now. period. |
… | |
… | |
1661 | op->flag [FLAG_REMOVED] = 0; |
1797 | op->flag [FLAG_REMOVED] = 0; |
1662 | |
1798 | |
1663 | if (object *pl = op->visible_to ()) |
1799 | if (object *pl = op->visible_to ()) |
1664 | esrv_send_item (pl, op); |
1800 | esrv_send_item (pl, op); |
1665 | |
1801 | |
1666 | adjust_weight (this, op->total_weight ()); |
1802 | adjust_weight (this, 0, op->total_weight ()); |
1667 | |
1803 | |
1668 | inserted: |
1804 | inserted: |
1669 | /* reset the light list and los of the players on the map */ |
1805 | /* reset the light list and los of the players on the map */ |
1670 | if (op->glow_radius && map && map->darkness) |
1806 | if (op->glow_radius && is_on_map ()) |
|
|
1807 | { |
|
|
1808 | update_stats (); |
1671 | update_all_los (map, x, y); |
1809 | update_all_los (map, x, y); |
1672 | |
1810 | } |
|
|
1811 | else if (is_player ()) |
1673 | // if this is a player's inventory, update stats |
1812 | // if this is a player's inventory, update stats |
1674 | if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER]) |
1813 | contr->queue_stats_update (); |
1675 | update_stats (); |
|
|
1676 | |
1814 | |
1677 | INVOKE_OBJECT (INSERT, this); |
1815 | INVOKE_OBJECT (INSERT, this); |
1678 | |
1816 | |
1679 | return op; |
1817 | return op; |
1680 | } |
1818 | } |
… | |
… | |
1698 | * MSW 2001-07-08: Check all objects on space, not just those below |
1836 | * MSW 2001-07-08: Check all objects on space, not just those below |
1699 | * object being inserted. insert_ob_in_map may not put new objects |
1837 | * object being inserted. insert_ob_in_map may not put new objects |
1700 | * on top. |
1838 | * on top. |
1701 | */ |
1839 | */ |
1702 | int |
1840 | int |
1703 | check_move_on (object *op, object *originator) |
1841 | check_move_on (object *op, object *originator, int flags) |
1704 | { |
1842 | { |
|
|
1843 | if (op->flag [FLAG_NO_APPLY]) |
|
|
1844 | return 0; |
|
|
1845 | |
1705 | object *tmp; |
1846 | object *tmp; |
1706 | maptile *m = op->map; |
1847 | maptile *m = op->map; |
1707 | int x = op->x, y = op->y; |
1848 | int x = op->x, y = op->y; |
1708 | |
1849 | |
1709 | MoveType move_on, move_slow, move_block; |
1850 | mapspace &ms = m->at (x, y); |
1710 | |
1851 | |
1711 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1852 | ms.update (); |
1712 | return 0; |
|
|
1713 | |
1853 | |
1714 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1854 | MoveType move_on = ms.move_on; |
1715 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1855 | MoveType move_slow = ms.move_slow; |
1716 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1856 | MoveType move_block = ms.move_block; |
1717 | |
1857 | |
1718 | /* if nothing on this space will slow op down or be applied, |
1858 | /* if nothing on this space will slow op down or be applied, |
1719 | * no need to do checking below. have to make sure move_type |
1859 | * no need to do checking below. have to make sure move_type |
1720 | * is set, as lots of objects don't have it set - we treat that |
1860 | * is set, as lots of objects don't have it set - we treat that |
1721 | * as walking. |
1861 | * as walking. |
… | |
… | |
1732 | return 0; |
1872 | return 0; |
1733 | |
1873 | |
1734 | /* The objects have to be checked from top to bottom. |
1874 | /* The objects have to be checked from top to bottom. |
1735 | * Hence, we first go to the top: |
1875 | * Hence, we first go to the top: |
1736 | */ |
1876 | */ |
1737 | |
1877 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1738 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
|
|
1739 | { |
|
|
1740 | /* Trim the search when we find the first other spell effect |
|
|
1741 | * this helps performance so that if a space has 50 spell objects, |
|
|
1742 | * we don't need to check all of them. |
|
|
1743 | */ |
|
|
1744 | if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK)) |
|
|
1745 | break; |
|
|
1746 | } |
1878 | { |
|
|
1879 | next = tmp->below; |
1747 | |
1880 | |
1748 | for (; tmp; tmp = tmp->below) |
|
|
1749 | { |
|
|
1750 | if (tmp == op) |
1881 | if (tmp == op) |
1751 | continue; /* Can't apply yourself */ |
1882 | continue; /* Can't apply yourself */ |
1752 | |
1883 | |
1753 | /* Check to see if one of the movement types should be slowed down. |
1884 | /* Check to see if one of the movement types should be slowed down. |
1754 | * Second check makes sure that the movement types not being slowed |
1885 | * Second check makes sure that the movement types not being slowed |
1755 | * (~slow_move) is not blocked on this space - just because the |
1886 | * (~slow_move) is not blocked on this space - just because the |
1756 | * space doesn't slow down swimming (for example), if you can't actually |
1887 | * space doesn't slow down swimming (for example), if you can't actually |
1757 | * swim on that space, can't use it to avoid the penalty. |
1888 | * swim on that space, can't use it to avoid the penalty. |
1758 | */ |
1889 | */ |
1759 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1890 | if (!op->flag [FLAG_WIZPASS]) |
1760 | { |
1891 | { |
1761 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1892 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1762 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1893 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1763 | { |
1894 | { |
1764 | |
|
|
1765 | float |
|
|
1766 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1895 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
1767 | |
1896 | |
1768 | if (op->type == PLAYER) |
1897 | if (op->is_player ()) |
1769 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1898 | if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) || |
1770 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1899 | (tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN))) |
1771 | diff /= 4.0; |
1900 | diff /= 4.0; |
1772 | |
1901 | |
1773 | op->speed_left -= diff; |
1902 | op->speed_left -= diff; |
1774 | } |
1903 | } |
1775 | } |
1904 | } |
1776 | |
1905 | |
1777 | /* Basically same logic as above, except now for actual apply. */ |
1906 | /* Basically same logic as above, except now for actual apply. */ |
1778 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1907 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1779 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1908 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1780 | { |
1909 | { |
|
|
1910 | if ((flags & INS_NO_AUTO_EXIT) |
|
|
1911 | && (tmp->type == EXIT || tmp->type == TELEPORTER |
|
|
1912 | || tmp->type == HOLE || tmp->type == TRAPDOOR)) //TODO: temporary, fix exits instead |
|
|
1913 | continue; |
|
|
1914 | |
1781 | move_apply (tmp, op, originator); |
1915 | move_apply (tmp, op, originator); |
1782 | |
1916 | |
1783 | if (op->destroyed ()) |
1917 | if (op->destroyed ()) |
1784 | return 1; |
1918 | return 1; |
1785 | |
1919 | |
… | |
… | |
1897 | void |
2031 | void |
1898 | flag_inv (object *op, int flag) |
2032 | flag_inv (object *op, int flag) |
1899 | { |
2033 | { |
1900 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
2034 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1901 | { |
2035 | { |
1902 | SET_FLAG (tmp, flag); |
2036 | tmp->set_flag (flag); |
1903 | flag_inv (tmp, flag); |
2037 | flag_inv (tmp, flag); |
1904 | } |
2038 | } |
1905 | } |
2039 | } |
1906 | |
2040 | |
1907 | /* |
2041 | /* |
… | |
… | |
1910 | void |
2044 | void |
1911 | unflag_inv (object *op, int flag) |
2045 | unflag_inv (object *op, int flag) |
1912 | { |
2046 | { |
1913 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
2047 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1914 | { |
2048 | { |
1915 | CLEAR_FLAG (tmp, flag); |
2049 | tmp->clr_flag (flag); |
1916 | unflag_inv (tmp, flag); |
2050 | unflag_inv (tmp, flag); |
1917 | } |
2051 | } |
1918 | } |
2052 | } |
1919 | |
2053 | |
1920 | /* |
2054 | /* |
… | |
… | |
1981 | * head of the object should correspond for the entire object. |
2115 | * head of the object should correspond for the entire object. |
1982 | */ |
2116 | */ |
1983 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
2117 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
1984 | continue; |
2118 | continue; |
1985 | |
2119 | |
1986 | if (ob->blocked (m, pos.x, pos.y)) |
2120 | if (ob->blocked (pos.m, pos.x, pos.y)) |
1987 | continue; |
2121 | continue; |
1988 | |
2122 | |
1989 | altern [index++] = i; |
2123 | altern [index++] = i; |
1990 | } |
2124 | } |
1991 | |
2125 | |
… | |
… | |
2059 | * there is capable of. |
2193 | * there is capable of. |
2060 | */ |
2194 | */ |
2061 | int |
2195 | int |
2062 | find_dir (maptile *m, int x, int y, object *exclude) |
2196 | find_dir (maptile *m, int x, int y, object *exclude) |
2063 | { |
2197 | { |
2064 | int i, max = SIZEOFFREE, mflags; |
2198 | int max = SIZEOFFREE, mflags; |
2065 | |
|
|
2066 | sint16 nx, ny; |
|
|
2067 | object *tmp; |
|
|
2068 | maptile *mp; |
|
|
2069 | |
|
|
2070 | MoveType blocked, move_type; |
2199 | MoveType move_type; |
2071 | |
2200 | |
2072 | if (exclude && exclude->head_ () != exclude) |
2201 | if (exclude && exclude->head_ () != exclude) |
2073 | { |
2202 | { |
2074 | exclude = exclude->head; |
2203 | exclude = exclude->head; |
2075 | move_type = exclude->move_type; |
2204 | move_type = exclude->move_type; |
… | |
… | |
2078 | { |
2207 | { |
2079 | /* If we don't have anything, presume it can use all movement types. */ |
2208 | /* If we don't have anything, presume it can use all movement types. */ |
2080 | move_type = MOVE_ALL; |
2209 | move_type = MOVE_ALL; |
2081 | } |
2210 | } |
2082 | |
2211 | |
2083 | for (i = 1; i < max; i++) |
2212 | for (int i = 1; i < max; i++) |
2084 | { |
2213 | { |
2085 | mp = m; |
2214 | mapxy pos (m, x, y); |
2086 | nx = x + freearr_x[i]; |
2215 | pos.move (i); |
2087 | ny = y + freearr_y[i]; |
|
|
2088 | |
2216 | |
2089 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
2217 | if (!pos.normalise ()) |
2090 | |
|
|
2091 | if (mflags & P_OUT_OF_MAP) |
|
|
2092 | max = maxfree[i]; |
2218 | max = maxfree[i]; |
2093 | else |
2219 | else |
2094 | { |
2220 | { |
2095 | mapspace &ms = mp->at (nx, ny); |
2221 | mapspace &ms = *pos; |
2096 | |
2222 | |
2097 | blocked = ms.move_block; |
|
|
2098 | |
|
|
2099 | if ((move_type & blocked) == move_type) |
2223 | if ((move_type & ms.move_block) == move_type) |
2100 | max = maxfree[i]; |
2224 | max = maxfree [i]; |
2101 | else if (mflags & P_IS_ALIVE) |
2225 | else if (ms.flags () & P_IS_ALIVE) |
2102 | { |
2226 | { |
2103 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2227 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
2104 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2228 | if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ()) |
2105 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2229 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2106 | break; |
|
|
2107 | |
|
|
2108 | if (tmp) |
|
|
2109 | return freedir[i]; |
2230 | return freedir [i]; |
2110 | } |
2231 | } |
2111 | } |
2232 | } |
2112 | } |
2233 | } |
2113 | |
2234 | |
2114 | return 0; |
2235 | return 0; |
… | |
… | |
2123 | { |
2244 | { |
2124 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2245 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2125 | } |
2246 | } |
2126 | |
2247 | |
2127 | /* |
2248 | /* |
2128 | * find_dir_2(delta-x,delta-y) will return a direction in which |
2249 | * find_dir_2(delta-x,delta-y) will return a direction value |
2129 | * an object which has subtracted the x and y coordinates of another |
2250 | * for running into direct [dx, dy]. |
2130 | * object, needs to travel toward it. |
2251 | * (the opposite of crossfire's find_dir_2!) |
2131 | */ |
2252 | */ |
2132 | int |
2253 | int |
2133 | find_dir_2 (int x, int y) |
2254 | find_dir_2 (int x, int y) |
2134 | { |
2255 | { |
|
|
2256 | #if 1 // new algorithm |
|
|
2257 | // this works by putting x, y into 16 sectors, which |
|
|
2258 | // are not equal sized, but are a better approximation |
|
|
2259 | // then the old algorithm, and then using a mapping |
|
|
2260 | // table to map it into a direction value. |
|
|
2261 | // basically, it maps these comparisons to each bit |
|
|
2262 | // bit #3: x < 0 |
|
|
2263 | // bit #2: y < 0 |
|
|
2264 | // bit #1: x > y |
|
|
2265 | // bit #0: x > 2y |
|
|
2266 | |
|
|
2267 | static const uint8 dir[16] = { |
|
|
2268 | 4, 5, 4, 3, |
|
|
2269 | 2, 1, 2, 3, |
|
|
2270 | 6, 5, 6, 7, |
|
|
2271 | 8, 1, 8, 7, |
|
|
2272 | }; |
|
|
2273 | int sector = 0; |
|
|
2274 | |
|
|
2275 | // this is a bit ugly, but more likely to result in branchless code |
|
|
2276 | sector |= x < 0 ? 8 : 0; |
|
|
2277 | x = x < 0 ? -x : x; // abs |
|
|
2278 | |
|
|
2279 | sector |= y < 0 ? 4 : 0; |
|
|
2280 | y = y < 0 ? -y : y; // abs |
|
|
2281 | |
|
|
2282 | if (x > y) |
|
|
2283 | { |
|
|
2284 | sector |= 2; |
|
|
2285 | |
|
|
2286 | if (x > y * 2) |
|
|
2287 | sector |= 1; |
|
|
2288 | } |
|
|
2289 | else |
|
|
2290 | { |
|
|
2291 | if (y > x * 2) |
|
|
2292 | sector |= 1; |
|
|
2293 | else if (!y) |
|
|
2294 | return 0; // x == 0 here |
|
|
2295 | } |
|
|
2296 | |
|
|
2297 | return dir [sector]; |
|
|
2298 | #else // old algorithm |
2135 | int q; |
2299 | int q; |
2136 | |
2300 | |
2137 | if (y) |
2301 | if (y) |
2138 | q = x * 100 / y; |
2302 | q = 128 * x / y; |
2139 | else if (x) |
2303 | else if (x) |
2140 | q = -300 * x; |
2304 | q = -512 * x; // to make it > 309 |
2141 | else |
2305 | else |
2142 | return 0; |
2306 | return 0; |
2143 | |
2307 | |
2144 | if (y > 0) |
2308 | if (y > 0) |
2145 | { |
2309 | { |
2146 | if (q < -242) |
2310 | if (q < -309) return 7; |
|
|
2311 | if (q < -52) return 6; |
|
|
2312 | if (q < 52) return 5; |
|
|
2313 | if (q < 309) return 4; |
|
|
2314 | |
2147 | return 3; |
2315 | return 3; |
2148 | if (q < -41) |
2316 | } |
2149 | return 2; |
2317 | else |
2150 | if (q < 41) |
2318 | { |
2151 | return 1; |
2319 | if (q < -309) return 3; |
2152 | if (q < 242) |
2320 | if (q < -52) return 2; |
2153 | return 8; |
2321 | if (q < 52) return 1; |
|
|
2322 | if (q < 309) return 8; |
|
|
2323 | |
2154 | return 7; |
2324 | return 7; |
2155 | } |
2325 | } |
2156 | |
2326 | #endif |
2157 | if (q < -242) |
|
|
2158 | return 7; |
|
|
2159 | if (q < -41) |
|
|
2160 | return 6; |
|
|
2161 | if (q < 41) |
|
|
2162 | return 5; |
|
|
2163 | if (q < 242) |
|
|
2164 | return 4; |
|
|
2165 | |
|
|
2166 | return 3; |
|
|
2167 | } |
2327 | } |
2168 | |
2328 | |
2169 | /* |
2329 | /* |
2170 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2330 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2171 | * between two directions (which are expected to be absolute (see absdir()) |
2331 | * between two directions (which are expected to be absolute (see absdir()) |
2172 | */ |
2332 | */ |
2173 | int |
2333 | int |
2174 | dirdiff (int dir1, int dir2) |
2334 | dirdiff (int dir1, int dir2) |
2175 | { |
2335 | { |
2176 | int d; |
|
|
2177 | |
|
|
2178 | d = abs (dir1 - dir2); |
2336 | int d = abs (dir1 - dir2); |
2179 | if (d > 4) |
|
|
2180 | d = 8 - d; |
|
|
2181 | |
2337 | |
2182 | return d; |
2338 | return d > 4 ? 8 - d : d; |
2183 | } |
2339 | } |
2184 | |
2340 | |
2185 | /* peterm: |
2341 | /* peterm: |
2186 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2342 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2187 | * Basically, this is a table of directions, and what directions |
2343 | * Basically, this is a table of directions, and what directions |
… | |
… | |
2189 | * This basically means that if direction is 15, then it could either go |
2345 | * This basically means that if direction is 15, then it could either go |
2190 | * direction 4, 14, or 16 to get back to where we are. |
2346 | * direction 4, 14, or 16 to get back to where we are. |
2191 | * Moved from spell_util.c to object.c with the other related direction |
2347 | * Moved from spell_util.c to object.c with the other related direction |
2192 | * functions. |
2348 | * functions. |
2193 | */ |
2349 | */ |
2194 | int reduction_dir[SIZEOFFREE][3] = { |
2350 | static const int reduction_dir[SIZEOFFREE][3] = { |
2195 | {0, 0, 0}, /* 0 */ |
2351 | {0, 0, 0}, /* 0 */ |
2196 | {0, 0, 0}, /* 1 */ |
2352 | {0, 0, 0}, /* 1 */ |
2197 | {0, 0, 0}, /* 2 */ |
2353 | {0, 0, 0}, /* 2 */ |
2198 | {0, 0, 0}, /* 3 */ |
2354 | {0, 0, 0}, /* 3 */ |
2199 | {0, 0, 0}, /* 4 */ |
2355 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2293 | * Add a check so we can't pick up invisible objects (0.93.8) |
2449 | * Add a check so we can't pick up invisible objects (0.93.8) |
2294 | */ |
2450 | */ |
2295 | int |
2451 | int |
2296 | can_pick (const object *who, const object *item) |
2452 | can_pick (const object *who, const object *item) |
2297 | { |
2453 | { |
2298 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2454 | return /*who->flag [FLAG_WIZ]|| */ |
2299 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2455 | (item->weight > 0 && !item->flag [FLAG_NO_PICK] && |
2300 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); |
2456 | !item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2301 | } |
2457 | } |
2302 | |
2458 | |
2303 | /* |
2459 | /* |
2304 | * create clone from object to another |
2460 | * create clone from object to another |
2305 | */ |
2461 | */ |
… | |
… | |
2337 | return tmp; |
2493 | return tmp; |
2338 | |
2494 | |
2339 | return 0; |
2495 | return 0; |
2340 | } |
2496 | } |
2341 | |
2497 | |
2342 | const shstr & |
2498 | shstr_tmp |
2343 | object::kv_get (const shstr &key) const |
2499 | object::kv_get (shstr_tmp key) const |
2344 | { |
2500 | { |
2345 | for (key_value *kv = key_values; kv; kv = kv->next) |
2501 | for (key_value *kv = key_values; kv; kv = kv->next) |
2346 | if (kv->key == key) |
2502 | if (kv->key == key) |
2347 | return kv->value; |
2503 | return kv->value; |
2348 | |
2504 | |
2349 | return shstr_null; |
2505 | return shstr (); |
2350 | } |
2506 | } |
2351 | |
2507 | |
2352 | void |
2508 | void |
2353 | object::kv_set (const shstr &key, const shstr &value) |
2509 | object::kv_set (shstr_tmp key, shstr_tmp value) |
2354 | { |
2510 | { |
2355 | for (key_value *kv = key_values; kv; kv = kv->next) |
2511 | for (key_value *kv = key_values; kv; kv = kv->next) |
2356 | if (kv->key == key) |
2512 | if (kv->key == key) |
2357 | { |
2513 | { |
2358 | kv->value = value; |
2514 | kv->value = value; |
… | |
… | |
2367 | |
2523 | |
2368 | key_values = kv; |
2524 | key_values = kv; |
2369 | } |
2525 | } |
2370 | |
2526 | |
2371 | void |
2527 | void |
2372 | object::kv_del (const shstr &key) |
2528 | object::kv_del (shstr_tmp key) |
2373 | { |
2529 | { |
2374 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
2530 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
2375 | if ((*kvp)->key == key) |
2531 | if ((*kvp)->key == key) |
2376 | { |
2532 | { |
2377 | key_value *kv = *kvp; |
2533 | key_value *kv = *kvp; |
… | |
… | |
2470 | { |
2626 | { |
2471 | return map ? map->region (x, y) |
2627 | return map ? map->region (x, y) |
2472 | : region::default_region (); |
2628 | : region::default_region (); |
2473 | } |
2629 | } |
2474 | |
2630 | |
2475 | const materialtype_t * |
|
|
2476 | object::dominant_material () const |
|
|
2477 | { |
|
|
2478 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2479 | return mt; |
|
|
2480 | |
|
|
2481 | return name_to_material (shstr_unknown); |
|
|
2482 | } |
|
|
2483 | |
|
|
2484 | void |
2631 | void |
2485 | object::open_container (object *new_container) |
2632 | object::open_container (object *new_container) |
2486 | { |
2633 | { |
2487 | if (container == new_container) |
2634 | if (container == new_container) |
2488 | return; |
2635 | return; |
… | |
… | |
2508 | container = 0; |
2655 | container = 0; |
2509 | |
2656 | |
2510 | // client needs item update to make it work, client bug requires this to be separate |
2657 | // client needs item update to make it work, client bug requires this to be separate |
2511 | esrv_update_item (UPD_FLAGS, this, old_container); |
2658 | esrv_update_item (UPD_FLAGS, this, old_container); |
2512 | |
2659 | |
2513 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2660 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ()); |
2514 | play_sound (sound_find ("chest_close")); |
2661 | play_sound (sound_find ("chest_close")); |
2515 | } |
2662 | } |
2516 | |
2663 | |
2517 | if (new_container) |
2664 | if (new_container) |
2518 | { |
2665 | { |
… | |
… | |
2522 | // TODO: this does not seem to serve any purpose anymore? |
2669 | // TODO: this does not seem to serve any purpose anymore? |
2523 | #if 0 |
2670 | #if 0 |
2524 | // insert the "Close Container" object. |
2671 | // insert the "Close Container" object. |
2525 | if (archetype *closer = new_container->other_arch) |
2672 | if (archetype *closer = new_container->other_arch) |
2526 | { |
2673 | { |
2527 | object *closer = arch_to_object (new_container->other_arch); |
2674 | object *closer = new_container->other_arch->instance (); |
2528 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2675 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2529 | new_container->insert (closer); |
2676 | new_container->insert (closer); |
2530 | } |
2677 | } |
2531 | #endif |
2678 | #endif |
2532 | |
2679 | |
2533 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2680 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ()); |
2534 | |
2681 | |
2535 | // make sure the container is available, client bug requires this to be separate |
2682 | // make sure the container is available, client bug requires this to be separate |
2536 | esrv_send_item (this, new_container); |
2683 | esrv_send_item (this, new_container); |
2537 | |
2684 | |
2538 | new_container->flag [FLAG_APPLIED] = true; |
2685 | new_container->flag [FLAG_APPLIED] = true; |
… | |
… | |
2546 | // else if (!old_container->env && contr && contr->ns) |
2693 | // else if (!old_container->env && contr && contr->ns) |
2547 | // contr->ns->floorbox_reset (); |
2694 | // contr->ns->floorbox_reset (); |
2548 | } |
2695 | } |
2549 | |
2696 | |
2550 | object * |
2697 | object * |
2551 | object::force_find (const shstr name) |
2698 | object::force_find (shstr_tmp name) |
2552 | { |
2699 | { |
2553 | /* cycle through his inventory to look for the MARK we want to |
2700 | /* cycle through his inventory to look for the MARK we want to |
2554 | * place |
2701 | * place |
2555 | */ |
2702 | */ |
2556 | for (object *tmp = inv; tmp; tmp = tmp->below) |
2703 | for (object *tmp = inv; tmp; tmp = tmp->below) |
… | |
… | |
2558 | return splay (tmp); |
2705 | return splay (tmp); |
2559 | |
2706 | |
2560 | return 0; |
2707 | return 0; |
2561 | } |
2708 | } |
2562 | |
2709 | |
|
|
2710 | //-GPL |
|
|
2711 | |
2563 | void |
2712 | void |
|
|
2713 | object::force_set_timer (int duration) |
|
|
2714 | { |
|
|
2715 | this->duration = 1; |
|
|
2716 | this->speed_left = -1.f; |
|
|
2717 | |
|
|
2718 | this->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2719 | } |
|
|
2720 | |
|
|
2721 | object * |
2564 | object::force_add (const shstr name, int duration) |
2722 | object::force_add (shstr_tmp name, int duration) |
2565 | { |
2723 | { |
2566 | if (object *force = force_find (name)) |
2724 | if (object *force = force_find (name)) |
2567 | force->destroy (); |
2725 | force->destroy (); |
2568 | |
2726 | |
2569 | object *force = get_archetype (FORCE_NAME); |
2727 | object *force = get_archetype (FORCE_NAME); |
2570 | |
2728 | |
2571 | force->slaying = name; |
2729 | force->slaying = name; |
2572 | force->stats.food = 1; |
2730 | force->force_set_timer (duration); |
2573 | force->speed_left = -1.f; |
|
|
2574 | |
|
|
2575 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2576 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2577 | force->flag [FLAG_APPLIED] = true; |
2731 | force->flag [FLAG_APPLIED] = true; |
2578 | |
2732 | |
2579 | insert (force); |
2733 | return insert (force); |
2580 | } |
2734 | } |
2581 | |
2735 | |
2582 | void |
2736 | void |
2583 | object::play_sound (faceidx sound) |
2737 | object::play_sound (faceidx sound) const |
2584 | { |
2738 | { |
2585 | if (!sound) |
2739 | if (!sound) |
2586 | return; |
2740 | return; |
2587 | |
2741 | |
2588 | if (flag [FLAG_REMOVED]) |
2742 | if (is_on_map ()) |
|
|
2743 | map->play_sound (sound, x, y); |
|
|
2744 | else if (object *pl = in_player ()) |
|
|
2745 | pl->contr->play_sound (sound); |
|
|
2746 | } |
|
|
2747 | |
|
|
2748 | void |
|
|
2749 | object::say_msg (const char *msg) const |
|
|
2750 | { |
|
|
2751 | if (is_on_map ()) |
|
|
2752 | map->say_msg (msg, x, y); |
|
|
2753 | else if (object *pl = in_player ()) |
|
|
2754 | pl->contr->play_sound (sound); |
|
|
2755 | } |
|
|
2756 | |
|
|
2757 | void |
|
|
2758 | object::make_noise () |
|
|
2759 | { |
|
|
2760 | // we do not model noise in the map, so instead put |
|
|
2761 | // a temporary light into the noise source |
|
|
2762 | // could use the map instead, but that's less reliable for our |
|
|
2763 | // goal, which is to make invisibility a bit harder to exploit |
|
|
2764 | |
|
|
2765 | // currently only works sensibly for players |
|
|
2766 | if (!is_player ()) |
2589 | return; |
2767 | return; |
2590 | |
2768 | |
2591 | if (env) |
2769 | // find old force, or create new one |
2592 | { |
2770 | object *force = force_find (shstr_noise_force); |
2593 | if (object *pl = in_player ()) |
2771 | |
2594 | pl->contr->play_sound (sound); |
2772 | if (force) |
2595 | } |
2773 | force->speed_left = -1.f; // patch old speed up |
2596 | else |
2774 | else |
2597 | map->play_sound (sound, x, y); |
2775 | { |
2598 | } |
2776 | force = archetype::get (shstr_noise_force); |
2599 | |
2777 | |
|
|
2778 | force->slaying = shstr_noise_force; |
|
|
2779 | force->stats.food = 1; |
|
|
2780 | force->speed_left = -1.f; |
|
|
2781 | |
|
|
2782 | force->set_speed (1.f / 4.f); |
|
|
2783 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2784 | force->flag [FLAG_APPLIED] = true; |
|
|
2785 | |
|
|
2786 | insert (force); |
|
|
2787 | } |
|
|
2788 | } |
|
|
2789 | |
|
|
2790 | void object::change_move_type (MoveType mt) |
|
|
2791 | { |
|
|
2792 | if (move_type == mt) |
|
|
2793 | return; |
|
|
2794 | |
|
|
2795 | if (is_on_map ()) |
|
|
2796 | { |
|
|
2797 | // we are on the map, so handle move_on/off effects |
|
|
2798 | remove (); |
|
|
2799 | move_type = mt; |
|
|
2800 | map->insert (this, x, y, this); |
|
|
2801 | } |
|
|
2802 | else |
|
|
2803 | move_type = mt; |
|
|
2804 | } |
|
|
2805 | |
|
|
2806 | /* object should be a player. |
|
|
2807 | * we return the object the player has marked with the 'mark' command |
|
|
2808 | * below. If no match is found (or object has changed), we return |
|
|
2809 | * NULL. We leave it up to the calling function to print messages if |
|
|
2810 | * nothing is found. |
|
|
2811 | */ |
|
|
2812 | object * |
|
|
2813 | object::mark () const |
|
|
2814 | { |
|
|
2815 | if (contr && contr->mark && contr->mark->env == this) |
|
|
2816 | return contr->mark; |
|
|
2817 | else |
|
|
2818 | return 0; |
|
|
2819 | } |
|
|
2820 | |