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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
8 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
12 | * option) any later version. |
12 | * |
13 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * GNU General Public License for more details. |
17 | * |
18 | * |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * You should have received a copy of the Affero GNU General Public License |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
21 | * <http://www.gnu.org/licenses/>. |
21 | * |
22 | * |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
24 | */ |
24 | |
25 | |
25 | #include <global.h> |
26 | #include <global.h> |
26 | #include <stdio.h> |
27 | #include <stdio.h> |
27 | #include <sys/types.h> |
28 | #include <sys/types.h> |
28 | #include <sys/uio.h> |
29 | #include <sys/uio.h> |
29 | #include <object.h> |
30 | #include <object.h> |
30 | #include <sproto.h> |
31 | #include <sproto.h> |
31 | #include <loader.h> |
|
|
32 | |
32 | |
33 | #include <bitset> |
33 | #include <bitset> |
34 | |
34 | |
35 | UUID UUID::cur; |
35 | UUID UUID::cur; |
36 | static uint64_t seq_next_save; |
36 | static uint64_t seq_next_save; |
… | |
… | |
38 | uint32_t mapspace::smellcount = 10000; |
38 | uint32_t mapspace::smellcount = 10000; |
39 | |
39 | |
40 | objectvec objects; |
40 | objectvec objects; |
41 | activevec actives; |
41 | activevec actives; |
42 | |
42 | |
|
|
43 | freelist_item *object::freelist; |
|
|
44 | uint32_t object::object_count; |
|
|
45 | uint32_t object::free_count; |
|
|
46 | uint32_t object::create_count; |
|
|
47 | uint32_t object::destroy_count; |
|
|
48 | |
43 | //+GPL |
49 | //+GPL |
44 | |
50 | |
45 | short freearr_x[SIZEOFFREE] = { |
51 | int freearr_x[SIZEOFFREE] = { |
46 | 0, |
52 | 0, |
47 | 0, 1, 1, 1, 0, -1, -1, -1, |
53 | 0, 1, 1, 1, 0, -1, -1, -1, |
48 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
54 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
49 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
55 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
50 | }; |
56 | }; |
51 | short freearr_y[SIZEOFFREE] = { |
57 | int freearr_y[SIZEOFFREE] = { |
52 | 0, |
58 | 0, |
53 | -1, -1, 0, 1, 1, 1, 0, -1, |
59 | -1, -1, 0, 1, 1, 1, 0, -1, |
54 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
60 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
55 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
61 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
56 | }; |
62 | }; |
… | |
… | |
66 | 9, 10, 13, 14, 17, 18, 21, 22, |
72 | 9, 10, 13, 14, 17, 18, 21, 22, |
67 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
73 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
68 | 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 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
69 | }; |
75 | }; |
70 | |
76 | |
|
|
77 | const char *wall_suffix[16] = { |
|
|
78 | "0", |
|
|
79 | "1_3", |
|
|
80 | "1_4", |
|
|
81 | "2_1_2", |
|
|
82 | "1_2", |
|
|
83 | "2_2_4", |
|
|
84 | "2_2_1", |
|
|
85 | "3_1", |
|
|
86 | "1_1", |
|
|
87 | "2_2_3", |
|
|
88 | "2_2_2", |
|
|
89 | "3_3", |
|
|
90 | "2_1_1", |
|
|
91 | "3_4", |
|
|
92 | "3_2", |
|
|
93 | "4" |
|
|
94 | }; |
|
|
95 | |
71 | static void |
96 | static void |
72 | write_uuid (uval64 skip, bool sync) |
97 | write_uuid (uval64 skip, bool sync) |
73 | { |
98 | { |
74 | CALL_BEGIN (2); |
99 | CALL_BEGIN (2); |
75 | CALL_ARG_SV (newSVval64 (skip)); |
100 | CALL_ARG_SV (newSVval64 (skip)); |
… | |
… | |
77 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
102 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
78 | CALL_END; |
103 | CALL_END; |
79 | } |
104 | } |
80 | |
105 | |
81 | static void |
106 | static void |
82 | read_uuid (void) |
107 | read_uuid () |
83 | { |
108 | { |
84 | char filename[MAX_BUF]; |
109 | char filename[MAX_BUF]; |
85 | |
110 | |
86 | sprintf (filename, "%s/uuid", settings.localdir); |
111 | sprintf (filename, "%s/uuid", settings.localdir); |
87 | |
112 | |
… | |
… | |
124 | { |
149 | { |
125 | UUID uid; |
150 | UUID uid; |
126 | |
151 | |
127 | uid.seq = ++cur.seq; |
152 | uid.seq = ++cur.seq; |
128 | |
153 | |
129 | if (expect_false (cur.seq >= seq_next_save)) |
154 | if (ecb_expect_false (cur.seq >= seq_next_save)) |
130 | { |
155 | { |
131 | seq_next_save = UUID::cur.seq + (UUID_GAP >> 1); |
156 | seq_next_save = UUID::cur.seq + (UUID_GAP >> 1); |
132 | write_uuid (UUID_GAP, false); |
157 | write_uuid (UUID_GAP, false); |
133 | } |
158 | } |
134 | |
159 | |
… | |
… | |
209 | |
234 | |
210 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
235 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
211 | static bool |
236 | static bool |
212 | compare_ob_value_lists_one (const object *wants, const object *has) |
237 | compare_ob_value_lists_one (const object *wants, const object *has) |
213 | { |
238 | { |
214 | /* n-squared behaviour (see kv_get), but I'm hoping both |
239 | /* n-squared behaviour (see kv.get), but I'm hoping both |
215 | * objects with lists are rare, and lists stay short. If not, use a |
240 | * objects with lists are rare, and lists stay short. If not, use a |
216 | * different structure or at least keep the lists sorted... |
241 | * different structure or at least keep the lists sorted... |
217 | */ |
242 | */ |
218 | |
243 | |
219 | /* For each field in wants, */ |
244 | /* For each field in wants, */ |
220 | for (key_value *kv = wants->key_values; kv; kv = kv->next) |
245 | for (key_value *kv = wants->kv.first; kv; kv = kv->next) |
221 | if (has->kv_get (kv->key) != kv->value) |
246 | if (has->kv.get (kv->key) != kv->value) |
222 | return false; |
247 | return false; |
223 | |
248 | |
224 | /* If we get here, every field in wants has a matching field in has. */ |
249 | /* If we get here, every field in wants has a matching field in has. */ |
225 | return true; |
250 | return true; |
226 | } |
251 | } |
… | |
… | |
248 | * Improvements made with merge: Better checking on potion, and also |
273 | * Improvements made with merge: Better checking on potion, and also |
249 | * check weight |
274 | * check weight |
250 | */ |
275 | */ |
251 | bool object::can_merge_slow (object *ob1, object *ob2) |
276 | bool object::can_merge_slow (object *ob1, object *ob2) |
252 | { |
277 | { |
253 | /* A couple quicksanity checks */ |
278 | /* A couple quick sanity checks */ |
254 | if (ob1 == ob2 |
279 | if (ob1 == ob2 |
255 | || ob1->type != ob2->type |
280 | || ob1->type != ob2->type |
|
|
281 | || ob1->value != ob2->value |
|
|
282 | || ob1->name != ob2->name |
|
|
283 | || ob1->custom_name != ob2->custom_name |
256 | || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED |
284 | || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED) |
257 | || ob1->value != ob2->value |
|
|
258 | || ob1->name != ob2->name) |
|
|
259 | return 0; |
285 | return 0; |
260 | |
286 | |
261 | /* Do not merge objects if nrof would overflow, assume nrof |
287 | /* Do not merge objects if nrof would overflow, assume nrof |
262 | * is always 0 .. 2**31-1 */ |
288 | * is always 0 .. 2**31-1 */ |
263 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
289 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
… | |
… | |
267 | * This is to the comparison of the flags below will be OK. We |
293 | * This is to the comparison of the flags below will be OK. We |
268 | * just can't ignore the been applied or identified flags, as they |
294 | * just can't ignore the been applied or identified flags, as they |
269 | * are not equal - just if it has been identified, the been_applied |
295 | * are not equal - just if it has been identified, the been_applied |
270 | * flags lose any meaning. |
296 | * flags lose any meaning. |
271 | */ |
297 | */ |
272 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
298 | if (ob1->flag [FLAG_IDENTIFIED]) |
273 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
299 | ob1->set_flag (FLAG_BEEN_APPLIED); |
274 | |
300 | |
275 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
301 | if (ob2->flag [FLAG_IDENTIFIED]) |
276 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
302 | ob2->set_flag (FLAG_BEEN_APPLIED); |
277 | |
303 | |
278 | if (ob1->arch->archname != ob2->arch->archname |
304 | if (ob1->arch->archname != ob2->arch->archname |
279 | || ob1->name != ob2->name |
305 | || ob1->name != ob2->name |
280 | || ob1->title != ob2->title |
306 | || ob1->title != ob2->title |
281 | || ob1->msg != ob2->msg |
307 | || ob1->msg != ob2->msg |
… | |
… | |
284 | || ob1->magic != ob2->magic |
310 | || ob1->magic != ob2->magic |
285 | || ob1->slaying != ob2->slaying |
311 | || ob1->slaying != ob2->slaying |
286 | || ob1->skill != ob2->skill |
312 | || ob1->skill != ob2->skill |
287 | || ob1->value != ob2->value |
313 | || ob1->value != ob2->value |
288 | || ob1->animation_id != ob2->animation_id |
314 | || ob1->animation_id != ob2->animation_id |
289 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other |
315 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other |
290 | || ob1->client_type != ob2->client_type |
316 | || ob1->client_type != ob2->client_type |
291 | || ob1->material != ob2->material |
317 | || ob1->material != ob2->material |
292 | || ob1->lore != ob2->lore |
318 | || ob1->lore != ob2->lore |
293 | || ob1->subtype != ob2->subtype |
319 | || ob1->subtype != ob2->subtype |
294 | || ob1->move_type != ob2->move_type |
320 | || ob1->move_type != ob2->move_type |
… | |
… | |
326 | /* inventory ok - still need to check rest of this object to see |
352 | /* inventory ok - still need to check rest of this object to see |
327 | * if it is valid. |
353 | * if it is valid. |
328 | */ |
354 | */ |
329 | } |
355 | } |
330 | |
356 | |
331 | /* Don't merge objects that are applied. With the new 'body' code, |
357 | /* Don't merge objects that are applied. With the new 'body' code, |
332 | * it is possible for most any character to have more than one of |
358 | * it is possible for most any character to have more than one of |
333 | * some items equipped, and we don't want those to merge. |
359 | * some items equipped, and we don't want those to merge. |
334 | */ |
360 | */ |
335 | if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED)) |
361 | if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED]) |
336 | return 0; |
362 | return 0; |
337 | |
363 | |
338 | /* Note sure why the following is the case - either the object has to |
364 | /* Not sure why the following is the case - either the object has to |
339 | * be animated or have a very low speed. Is this an attempted monster |
365 | * be animated or have a very low speed. Is this an attempted monster |
340 | * check? |
366 | * check? |
341 | */ |
367 | */ |
342 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
368 | if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ()) |
343 | return 0; |
369 | return 0; |
344 | |
370 | |
345 | switch (ob1->type) |
371 | switch (ob1->type) |
346 | { |
372 | { |
347 | case SCROLL: |
373 | case SCROLL: |
348 | if (ob1->level != ob2->level) |
374 | if (ob1->level != ob2->level) |
349 | return 0; |
375 | return 0; |
350 | break; |
376 | break; |
351 | } |
377 | } |
352 | |
378 | |
353 | if (ob1->key_values || ob2->key_values) |
379 | if (!ob1->kv.empty () || !ob2->kv.empty ()) |
354 | { |
380 | { |
355 | /* At least one of these has key_values. */ |
381 | /* At least one of these has key_values. */ |
356 | if ((!ob1->key_values) != (!ob2->key_values)) |
382 | if (ob1->kv.empty () != ob2->kv.empty ()) |
357 | return 0; /* One has fields, but the other one doesn't. */ |
383 | return 0; /* One has fields, but the other one doesn't. */ |
358 | |
384 | |
359 | if (!compare_ob_value_lists (ob1, ob2)) |
385 | if (!compare_ob_value_lists (ob1, ob2)) |
360 | return 0; |
386 | return 0; |
361 | } |
387 | } |
… | |
… | |
421 | |
447 | |
422 | return 0; |
448 | return 0; |
423 | } |
449 | } |
424 | |
450 | |
425 | // adjust weight per container type ("of holding") |
451 | // adjust weight per container type ("of holding") |
426 | static sint32 |
452 | static weight_t |
427 | weight_adjust_for (object *op, sint32 weight) |
453 | weight_adjust_for (object *op, weight_t weight) |
428 | { |
454 | { |
429 | return op->type == CONTAINER |
455 | if (op->type == CONTAINER) |
430 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
456 | weight -= weight * op->stats.Str / 100; |
431 | : weight; |
|
|
432 | } |
|
|
433 | |
457 | |
|
|
458 | return weight; |
|
|
459 | } |
|
|
460 | |
434 | /* |
461 | /* |
435 | * adjust_weight(object, weight) adds the specified weight to an object, |
462 | * subtracts, then adds, the specified weight to an object, |
436 | * and also updates how much the environment(s) is/are carrying. |
463 | * and also updates how much the environment(s) is/are carrying. |
437 | */ |
464 | */ |
438 | static void |
465 | static void |
439 | adjust_weight (object *op, sint32 weight) |
466 | adjust_weight (object *op, weight_t sub, weight_t add) |
440 | { |
467 | { |
441 | while (op) |
468 | while (op) |
442 | { |
469 | { |
443 | // adjust by actual difference to account for rounding errors |
470 | weight_t carrying = (weight_t)op->carrying |
444 | // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct |
471 | - weight_adjust_for (op, sub) |
445 | weight = weight_adjust_for (op, op->carrying) |
472 | + weight_adjust_for (op, add); |
446 | - weight_adjust_for (op, op->carrying - weight); |
|
|
447 | |
473 | |
448 | if (!weight) |
474 | sub = op->carrying; |
449 | return; |
|
|
450 | |
|
|
451 | op->carrying += weight; |
475 | op->carrying = carrying; |
|
|
476 | add = op->carrying; |
452 | |
477 | |
453 | if (object *pl = op->visible_to ()) |
478 | if (object *pl = op->visible_to ()) |
454 | if (pl != op) // player is handled lazily |
479 | if (pl != op) // player is handled lazily |
455 | esrv_update_item (UPD_WEIGHT, pl, op); |
480 | esrv_update_item (UPD_WEIGHT, pl, op); |
456 | |
481 | |
… | |
… | |
464 | * containers are carrying, and sums it up. |
489 | * containers are carrying, and sums it up. |
465 | */ |
490 | */ |
466 | void |
491 | void |
467 | object::update_weight () |
492 | object::update_weight () |
468 | { |
493 | { |
469 | sint32 sum = 0; |
494 | weight_t sum = 0; |
470 | |
495 | |
471 | for (object *op = inv; op; op = op->below) |
496 | for (object *op = inv; op; op = op->below) |
472 | { |
497 | { |
473 | if (op->inv) |
|
|
474 | op->update_weight (); |
498 | op->update_weight (); |
475 | |
499 | |
476 | sum += op->total_weight (); |
500 | sum += weight_adjust_for (this, op->total_weight ()); |
477 | } |
501 | } |
478 | |
|
|
479 | sum = weight_adjust_for (this, sum); |
|
|
480 | |
502 | |
481 | if (sum != carrying) |
503 | if (sum != carrying) |
482 | { |
504 | { |
|
|
505 | if (carrying != sum && carrying)//D |
|
|
506 | LOG (llevDebug, "updating carrying got %ld, expected %ld (%s)\n", |
|
|
507 | (long long)sum, (long long)carrying, debug_desc ()); |
|
|
508 | |
483 | carrying = sum; |
509 | carrying = sum; |
484 | |
510 | |
485 | if (object *pl = visible_to ()) |
511 | if (object *pl = visible_to ()) |
486 | if (pl != this) // player is handled lazily |
512 | if (pl != this) // player is handled lazily |
487 | esrv_update_item (UPD_WEIGHT, pl, this); |
513 | esrv_update_item (UPD_WEIGHT, pl, this); |
… | |
… | |
515 | object * |
541 | object * |
516 | find_object (tag_t i) |
542 | find_object (tag_t i) |
517 | { |
543 | { |
518 | for_all_objects (op) |
544 | for_all_objects (op) |
519 | if (op->count == i) |
545 | if (op->count == i) |
|
|
546 | return op; |
|
|
547 | |
|
|
548 | return 0; |
|
|
549 | } |
|
|
550 | |
|
|
551 | /* |
|
|
552 | * Returns the object which has the uuid equal to the argument. |
|
|
553 | * MOAR VERRRY slow. |
|
|
554 | */ |
|
|
555 | |
|
|
556 | object * |
|
|
557 | find_object_uuid (UUID i) |
|
|
558 | { |
|
|
559 | for_all_objects (op) |
|
|
560 | if (op->uuid == i) |
520 | return op; |
561 | return op; |
521 | |
562 | |
522 | return 0; |
563 | return 0; |
523 | } |
564 | } |
524 | |
565 | |
… | |
… | |
558 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
599 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
559 | return; |
600 | return; |
560 | } |
601 | } |
561 | |
602 | |
562 | this->owner = owner; |
603 | this->owner = owner; |
563 | } |
|
|
564 | |
|
|
565 | int |
|
|
566 | object::slottype () const |
|
|
567 | { |
|
|
568 | if (type == SKILL) |
|
|
569 | { |
|
|
570 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
571 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
572 | } |
|
|
573 | else |
|
|
574 | { |
|
|
575 | if (slot [body_combat].info) return slot_combat; |
|
|
576 | if (slot [body_range ].info) return slot_ranged; |
|
|
577 | } |
|
|
578 | |
|
|
579 | return slot_none; |
|
|
580 | } |
|
|
581 | |
|
|
582 | bool |
|
|
583 | object::change_weapon (object *ob) |
|
|
584 | { |
|
|
585 | if (current_weapon == ob) |
|
|
586 | return true; |
|
|
587 | |
|
|
588 | if (chosen_skill) |
|
|
589 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
590 | |
|
|
591 | current_weapon = ob; |
|
|
592 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
593 | |
|
|
594 | if (chosen_skill) |
|
|
595 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
596 | |
|
|
597 | update_stats (); |
|
|
598 | |
|
|
599 | if (ob) |
|
|
600 | { |
|
|
601 | // now check wether any body locations became invalid, in which case |
|
|
602 | // we cannot apply the weapon at the moment. |
|
|
603 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
604 | if (slot[i].used < 0) |
|
|
605 | { |
|
|
606 | current_weapon = chosen_skill = 0; |
|
|
607 | update_stats (); |
|
|
608 | |
|
|
609 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
610 | "You try to balance all your items at once, " |
|
|
611 | "but the %s is just too much for your body. " |
|
|
612 | "[You need to unapply some items first - use the 'body' command to see " |
|
|
613 | "how many items you cna wera on a specific body part.]", &ob->name); |
|
|
614 | return false; |
|
|
615 | } |
|
|
616 | |
|
|
617 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
618 | } |
|
|
619 | else |
|
|
620 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
621 | |
|
|
622 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
623 | { |
|
|
624 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
625 | &name, ob->debug_desc ()); |
|
|
626 | return false; |
|
|
627 | } |
|
|
628 | |
|
|
629 | return true; |
|
|
630 | } |
|
|
631 | |
|
|
632 | /* Zero the key_values on op, decrementing the shared-string |
|
|
633 | * refcounts and freeing the links. |
|
|
634 | */ |
|
|
635 | static void |
|
|
636 | free_key_values (object *op) |
|
|
637 | { |
|
|
638 | for (key_value *i = op->key_values; i; ) |
|
|
639 | { |
|
|
640 | key_value *next = i->next; |
|
|
641 | delete i; |
|
|
642 | |
|
|
643 | i = next; |
|
|
644 | } |
|
|
645 | |
|
|
646 | op->key_values = 0; |
|
|
647 | } |
604 | } |
648 | |
605 | |
649 | /* |
606 | /* |
650 | * copy_to first frees everything allocated by the dst object, |
607 | * copy_to first frees everything allocated by the dst object, |
651 | * and then copies the contents of itself into the second |
608 | * and then copies the contents of itself into the second |
… | |
… | |
657 | void |
614 | void |
658 | object::copy_to (object *dst) |
615 | object::copy_to (object *dst) |
659 | { |
616 | { |
660 | dst->remove (); |
617 | dst->remove (); |
661 | *(object_copy *)dst = *this; |
618 | *(object_copy *)dst = *this; |
|
|
619 | |
|
|
620 | // maybe move to object_copy? |
|
|
621 | dst->kv = kv; |
|
|
622 | |
662 | dst->flag [FLAG_REMOVED] = true; |
623 | dst->flag [FLAG_REMOVED] = true; |
663 | |
|
|
664 | /* Copy over key_values, if any. */ |
|
|
665 | if (key_values) |
|
|
666 | { |
|
|
667 | key_value *tail = 0; |
|
|
668 | dst->key_values = 0; |
|
|
669 | |
|
|
670 | for (key_value *i = key_values; i; i = i->next) |
|
|
671 | { |
|
|
672 | key_value *new_link = new key_value; |
|
|
673 | |
|
|
674 | new_link->next = 0; |
|
|
675 | new_link->key = i->key; |
|
|
676 | new_link->value = i->value; |
|
|
677 | |
|
|
678 | /* Try and be clever here, too. */ |
|
|
679 | if (!dst->key_values) |
|
|
680 | { |
|
|
681 | dst->key_values = new_link; |
|
|
682 | tail = new_link; |
|
|
683 | } |
|
|
684 | else |
|
|
685 | { |
|
|
686 | tail->next = new_link; |
|
|
687 | tail = new_link; |
|
|
688 | } |
|
|
689 | } |
|
|
690 | } |
|
|
691 | |
|
|
692 | dst->activate (); |
624 | dst->activate (); |
693 | } |
625 | } |
694 | |
626 | |
695 | void |
627 | void |
696 | object::instantiate () |
628 | object::instantiate () |
697 | { |
629 | { |
698 | if (!uuid.seq) // HACK |
630 | if (!uuid.seq) // HACK |
699 | uuid = UUID::gen (); |
631 | uuid = UUID::gen (); |
700 | |
632 | |
701 | // TODO: unclean state changes, should nt be done in copy_to AND instantiate |
633 | // TODO: unclean state changes, should not be done in copy_to AND instantiate |
702 | if (flag [FLAG_RANDOM_SPEED] && speed) |
634 | if (flag [FLAG_RANDOM_SPEED] && speed) |
703 | speed_left = -rndm (); // TODO animation |
635 | speed_left = - speed - rndm (); // TODO animation |
704 | else |
636 | else |
705 | speed_left = -speed; |
637 | speed_left = -1.; |
706 | |
638 | |
707 | /* copy the body_info to the body_used - this is only really |
639 | /* copy the body_info to the body_used - this is only really |
708 | * need for monsters, but doesn't hurt to do it for everything. |
640 | * need for monsters, but doesn't hurt to do it for everything. |
709 | * by doing so, when a monster is created, it has good starting |
641 | * by doing so, when a monster is created, it has good starting |
710 | * values for the body_used info, so when items are created |
642 | * values for the body_used info, so when items are created |
711 | * for it, they can be properly equipped. |
643 | * for it, they can be properly equipped. |
712 | */ |
644 | */ |
713 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
645 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
714 | slot[i].used = slot[i].info; |
646 | slot[i].used = slot[i].info; |
715 | |
647 | |
716 | attachable::instantiate (); |
648 | attachable::instantiate (); |
717 | } |
649 | } |
718 | |
650 | |
… | |
… | |
722 | object *neu = create (); |
654 | object *neu = create (); |
723 | copy_to (neu); |
655 | copy_to (neu); |
724 | |
656 | |
725 | // TODO: unclean state changes, should not be done in clone AND instantiate |
657 | // TODO: unclean state changes, should not be done in clone AND instantiate |
726 | if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed) |
658 | if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed) |
727 | neu->speed_left = -rndm (); // TODO animation |
659 | neu->speed_left = - neu->speed - rndm (); // TODO animation |
728 | |
660 | |
729 | neu->map = map; // not copied by copy_to |
661 | neu->map = map; // not copied by copy_to |
730 | return neu; |
662 | return neu; |
|
|
663 | } |
|
|
664 | |
|
|
665 | // update the anhimation frame of an object, but only if it has an animation |
|
|
666 | // assigned and the frame number if within the animation. |
|
|
667 | void object::update_anim_frame (int frame) |
|
|
668 | { |
|
|
669 | if (ecb_expect_false (!has_anim () || frame >= anim_frames ())) |
|
|
670 | return; |
|
|
671 | |
|
|
672 | set_anim_frame (frame); |
|
|
673 | update_object (this, UP_OBJ_FACE); |
731 | } |
674 | } |
732 | |
675 | |
733 | /* |
676 | /* |
734 | * If an object with the IS_TURNABLE() flag needs to be turned due |
677 | * If an object with the IS_TURNABLE() flag needs to be turned due |
735 | * to the closest player being on the other side, this function can |
678 | * to the closest player being on the other side, this function can |
736 | * be called to update the face variable, _and_ how it looks on the map. |
679 | * be called to update the face variable, _and_ how it looks on the map. |
737 | */ |
680 | */ |
738 | void |
681 | void |
739 | update_turn_face (object *op) |
682 | update_turn_face (object *op) |
740 | { |
683 | { |
741 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
684 | if (!op->flag [FLAG_IS_TURNABLE] || !op->arch) |
742 | return; |
685 | return; |
743 | |
686 | |
744 | SET_ANIMATION (op, op->direction); |
687 | op->update_anim_frame (op->direction); |
745 | update_object (op, UP_OBJ_FACE); |
|
|
746 | } |
688 | } |
747 | |
689 | |
748 | /* |
690 | /* |
749 | * Updates the speed of an object. If the speed changes from 0 to another |
691 | * Updates the speed of an object. If the speed changes from 0 to another |
750 | * value, or vice versa, then add/remove the object from the active list. |
692 | * value, or vice versa, then add/remove the object from the active list. |
… | |
… | |
760 | else |
702 | else |
761 | deactivate (); |
703 | deactivate (); |
762 | } |
704 | } |
763 | |
705 | |
764 | /* |
706 | /* |
765 | * update_object() updates the the map. |
707 | * update_object() updates the map. |
766 | * It takes into account invisible objects (and represent squares covered |
708 | * It takes into account invisible objects (and represent squares covered |
767 | * by invisible objects by whatever is below them (unless it's another |
709 | * by invisible objects by whatever is below them (unless it's another |
768 | * invisible object, etc...) |
710 | * invisible object, etc...) |
769 | * If the object being updated is beneath a player, the look-window |
711 | * If the object being updated is beneath a player, the look-window |
770 | * of that player is updated (this might be a suboptimal way of |
712 | * of that player is updated (this might be a suboptimal way of |
… | |
… | |
807 | } |
749 | } |
808 | |
750 | |
809 | mapspace &m = op->ms (); |
751 | mapspace &m = op->ms (); |
810 | |
752 | |
811 | if (!(m.flags_ & P_UPTODATE)) |
753 | if (!(m.flags_ & P_UPTODATE)) |
812 | /* nop */; |
754 | m.update_up (); // nothing to do except copy up |
813 | else if (action == UP_OBJ_INSERT) |
755 | else if (action == UP_OBJ_INSERT) |
814 | { |
756 | { |
815 | #if 0 |
757 | #if 0 |
816 | // this is likely overkill, TODO: revisit (schmorp) |
758 | // this is likely overkill, TODO: revisit (schmorp) |
817 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
759 | if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW)) |
818 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
760 | || (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC)) |
819 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
761 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
820 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
762 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
821 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
763 | || (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE)) |
822 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
764 | || (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC)) |
823 | || (m.move_on | op->move_on ) != m.move_on |
765 | || (m.move_on | op->move_on ) != m.move_on |
824 | || (m.move_off | op->move_off ) != m.move_off |
766 | || (m.move_off | op->move_off ) != m.move_off |
825 | || (m.move_slow | op->move_slow) != m.move_slow |
767 | || (m.move_slow | op->move_slow) != m.move_slow |
826 | /* This isn't perfect, but I don't expect a lot of objects to |
768 | /* This isn't perfect, but I don't expect a lot of objects to |
827 | * have move_allow right now. |
769 | * have move_allow right now. |
828 | */ |
770 | */ |
829 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
771 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
830 | m.invalidate (); |
772 | m.invalidate (); |
831 | #else |
773 | #else |
832 | // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp) |
774 | // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp) |
… | |
… | |
838 | * that is being removed. |
780 | * that is being removed. |
839 | */ |
781 | */ |
840 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
782 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
841 | m.invalidate (); |
783 | m.invalidate (); |
842 | else if (action == UP_OBJ_FACE) |
784 | else if (action == UP_OBJ_FACE) |
843 | /* Nothing to do for that case */ ; |
785 | m.update_up (); // nothing to do for that case, except copy up |
844 | else |
786 | else |
845 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
787 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
846 | |
788 | |
847 | if (op->more) |
789 | if (op->more) |
848 | update_object (op->more, action); |
790 | update_object (op->more, action); |
849 | } |
791 | } |
850 | |
792 | |
851 | object::object () |
793 | object::object () |
852 | { |
794 | { |
853 | SET_FLAG (this, FLAG_REMOVED); |
795 | this->set_flag (FLAG_REMOVED); |
854 | |
796 | |
855 | //expmul = 1.0; declared const for the time being |
797 | //expmul = 1.0; declared const for the time being |
856 | face = blank_face; |
798 | face = blank_face; |
857 | material = MATERIAL_NULL; |
799 | material = MATERIAL_NULL; |
858 | } |
800 | } |
859 | |
801 | |
860 | object::~object () |
802 | object::~object () |
861 | { |
803 | { |
862 | unlink (); |
804 | unlink (); |
863 | |
805 | |
864 | free_key_values (this); |
806 | kv.clear (); |
865 | } |
807 | } |
866 | |
|
|
867 | static int object_count; |
|
|
868 | |
808 | |
869 | void object::link () |
809 | void object::link () |
870 | { |
810 | { |
871 | assert (!index);//D |
811 | assert (!index);//D |
872 | uuid = UUID::gen (); |
812 | uuid = UUID::gen (); |
873 | count = ++object_count; |
|
|
874 | |
813 | |
875 | refcnt_inc (); |
814 | refcnt_inc (); |
876 | objects.insert (this); |
815 | objects.insert (this); |
|
|
816 | |
|
|
817 | ++create_count; |
|
|
818 | |
877 | } |
819 | } |
878 | |
820 | |
879 | void object::unlink () |
821 | void object::unlink () |
880 | { |
822 | { |
881 | if (!index) |
823 | if (!index) |
882 | return; |
824 | return; |
|
|
825 | |
|
|
826 | ++destroy_count; |
883 | |
827 | |
884 | objects.erase (this); |
828 | objects.erase (this); |
885 | refcnt_dec (); |
829 | refcnt_dec (); |
886 | } |
830 | } |
887 | |
831 | |
… | |
… | |
910 | op->activate_recursive (); |
854 | op->activate_recursive (); |
911 | } |
855 | } |
912 | |
856 | |
913 | /* This function removes object 'op' from the list of active |
857 | /* This function removes object 'op' from the list of active |
914 | * objects. |
858 | * objects. |
915 | * This should only be used for style maps or other such |
859 | * This should only be used for style maps or other such |
916 | * reference maps where you don't want an object that isn't |
860 | * reference maps where you don't want an object that isn't |
917 | * in play chewing up cpu time getting processed. |
861 | * in play chewing up cpu time getting processed. |
918 | * The reverse of this is to call update_ob_speed, which |
862 | * The reverse of this is to call update_ob_speed, which |
919 | * will do the right thing based on the speed of the object. |
863 | * will do the right thing based on the speed of the object. |
920 | */ |
864 | */ |
… | |
… | |
966 | * if some form of movement is allowed, let objects |
910 | * if some form of movement is allowed, let objects |
967 | * drop on that space. |
911 | * drop on that space. |
968 | */ |
912 | */ |
969 | if (!drop_to_ground |
913 | if (!drop_to_ground |
970 | || !map |
914 | || !map |
971 | || map->in_memory != MAP_ACTIVE |
915 | || !map->linkable () |
972 | || map->no_drop |
916 | || map->no_drop |
973 | || ms ().move_block == MOVE_ALL) |
917 | || ms ().move_block == MOVE_ALL) |
974 | { |
918 | { |
975 | while (inv) |
919 | while (inv) |
976 | inv->destroy (); |
920 | inv->destroy (); |
… | |
… | |
992 | map->insert (op, x, y); |
936 | map->insert (op, x, y); |
993 | } |
937 | } |
994 | } |
938 | } |
995 | } |
939 | } |
996 | |
940 | |
|
|
941 | /* |
|
|
942 | * Remove and free all objects in the inventory of the given object. |
|
|
943 | * Unlike destroy_inv, this assumes the *this is destroyed as well |
|
|
944 | * well, so we can (and have to!) take shortcuts. |
|
|
945 | */ |
|
|
946 | void |
|
|
947 | object::destroy_inv_fast () |
|
|
948 | { |
|
|
949 | while (object *op = inv) |
|
|
950 | { |
|
|
951 | // remove from object the fast way |
|
|
952 | op->flag [FLAG_REMOVED] = true; |
|
|
953 | op->env = 0; |
|
|
954 | if ((inv = inv->below)) |
|
|
955 | inv->above = 0; |
|
|
956 | |
|
|
957 | // then destroy |
|
|
958 | op->destroy (); |
|
|
959 | } |
|
|
960 | } |
|
|
961 | |
|
|
962 | void |
|
|
963 | object::freelist_free (int count) |
|
|
964 | { |
|
|
965 | while (count-- && freelist) |
|
|
966 | { |
|
|
967 | freelist_item *next = freelist->next; |
|
|
968 | // count is being "destroyed" |
|
|
969 | |
|
|
970 | sfree ((char *)freelist, sizeof (object)); |
|
|
971 | |
|
|
972 | freelist = next; |
|
|
973 | --free_count; |
|
|
974 | } |
|
|
975 | } |
|
|
976 | |
|
|
977 | object * |
997 | object *object::create () |
978 | object::create () |
998 | { |
979 | { |
999 | object *op = new object; |
980 | object *op; |
|
|
981 | |
|
|
982 | if (freelist) |
|
|
983 | { |
|
|
984 | freelist_item li = *freelist; |
|
|
985 | memset (freelist, 0, sizeof (object)); |
|
|
986 | |
|
|
987 | op = new (freelist) object; |
|
|
988 | op->count = li.count; |
|
|
989 | |
|
|
990 | freelist = li.next; |
|
|
991 | --free_count; |
|
|
992 | } |
|
|
993 | else |
|
|
994 | { |
|
|
995 | void *ni = salloc0<char> (sizeof (object)); |
|
|
996 | |
|
|
997 | op = new(ni) object; |
|
|
998 | |
|
|
999 | op->count = ++object_count; |
|
|
1000 | } |
|
|
1001 | |
1000 | op->link (); |
1002 | op->link (); |
|
|
1003 | |
1001 | return op; |
1004 | return op; |
1002 | } |
1005 | } |
1003 | |
1006 | |
1004 | static struct freed_map : maptile |
1007 | void |
|
|
1008 | object::do_delete () |
1005 | { |
1009 | { |
1006 | freed_map () |
1010 | uint32_t count = this->count; |
1007 | { |
|
|
1008 | path = "<freed objects map>"; |
|
|
1009 | name = "/internal/freed_objects_map"; |
|
|
1010 | width = 3; |
|
|
1011 | height = 3; |
|
|
1012 | no_drop = 1; |
|
|
1013 | no_reset = 1; |
|
|
1014 | |
1011 | |
1015 | alloc (); |
1012 | this->~object (); |
1016 | in_memory = MAP_ACTIVE; |
|
|
1017 | } |
|
|
1018 | |
1013 | |
1019 | ~freed_map () |
1014 | freelist_item *li = (freelist_item *)this; |
1020 | { |
1015 | li->next = freelist; |
1021 | destroy (); |
1016 | li->count = count; |
1022 | } |
1017 | |
1023 | } freed_map; // freed objects are moved here to avoid crashes |
1018 | freelist = li; |
|
|
1019 | ++free_count; |
|
|
1020 | } |
1024 | |
1021 | |
1025 | void |
1022 | void |
1026 | object::do_destroy () |
1023 | object::do_destroy () |
1027 | { |
1024 | { |
1028 | if (flag [FLAG_IS_LINKED]) |
1025 | if (flag [FLAG_IS_LINKED]) |
… | |
… | |
1071 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1068 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1072 | head->destroy (); |
1069 | head->destroy (); |
1073 | return; |
1070 | return; |
1074 | } |
1071 | } |
1075 | |
1072 | |
1076 | destroy_inv (false); |
1073 | destroy_inv_fast (); |
1077 | |
1074 | |
1078 | if (is_head ()) |
1075 | if (is_head ()) |
1079 | if (sound_destroy) |
1076 | if (sound_destroy) |
1080 | play_sound (sound_destroy); |
1077 | play_sound (sound_destroy); |
1081 | else if (flag [FLAG_MONSTER]) |
1078 | else if (flag [FLAG_MONSTER]) |
… | |
… | |
1102 | flag [FLAG_REMOVED] = true; |
1099 | flag [FLAG_REMOVED] = true; |
1103 | |
1100 | |
1104 | if (more) |
1101 | if (more) |
1105 | more->remove (); |
1102 | more->remove (); |
1106 | |
1103 | |
1107 | /* |
1104 | /* |
1108 | * In this case, the object to be removed is in someones |
1105 | * In this case, the object to be removed is in someones |
1109 | * inventory. |
1106 | * inventory. |
1110 | */ |
1107 | */ |
1111 | if (env) |
1108 | if (env) |
1112 | { |
1109 | { |
1113 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1110 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1114 | if (object *pl = visible_to ()) |
1111 | if (object *pl = visible_to ()) |
1115 | esrv_del_item (pl->contr, count); |
1112 | esrv_del_item (pl->contr, count); |
1116 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1113 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1117 | |
1114 | |
1118 | adjust_weight (env, -total_weight ()); |
1115 | adjust_weight (env, total_weight (), 0); |
1119 | |
1116 | |
1120 | object *pl = in_player (); |
1117 | object *pl = in_player (); |
1121 | |
1118 | |
1122 | /* we set up values so that it could be inserted into |
1119 | /* we set up values so that it could be inserted into |
1123 | * the map, but we don't actually do that - it is up |
1120 | * the map, but we don't actually do that - it is up |
… | |
… | |
1135 | below = 0; |
1132 | below = 0; |
1136 | env = 0; |
1133 | env = 0; |
1137 | |
1134 | |
1138 | if (pl && pl->is_player ()) |
1135 | if (pl && pl->is_player ()) |
1139 | { |
1136 | { |
|
|
1137 | if (ecb_expect_false (pl->contr->combat_ob == this)) |
|
|
1138 | { |
|
|
1139 | pl->apply (pl->contr->combat_ob, AP_UNAPPLY | AP_IGNORE_CURSE); |
|
|
1140 | pl->contr->combat_ob = 0; |
|
|
1141 | if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob); |
|
|
1142 | } |
|
|
1143 | |
|
|
1144 | if (ecb_expect_false (pl->contr->ranged_ob == this)) |
|
|
1145 | { |
|
|
1146 | pl->apply (pl->contr->ranged_ob, AP_UNAPPLY | AP_IGNORE_CURSE); |
|
|
1147 | pl->contr->ranged_ob = 0; |
|
|
1148 | if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob); |
|
|
1149 | } |
|
|
1150 | |
1140 | pl->contr->queue_stats_update (); |
1151 | pl->contr->queue_stats_update (); |
1141 | |
1152 | |
1142 | if (glow_radius && pl->is_on_map ()) |
1153 | if (ecb_expect_false (glow_radius) && pl->is_on_map ()) |
1143 | update_all_los (pl->map, pl->x, pl->y); |
1154 | update_all_los (pl->map, pl->x, pl->y); |
1144 | } |
1155 | } |
1145 | } |
1156 | } |
1146 | else if (map) |
1157 | else if (map) |
1147 | { |
1158 | { |
… | |
… | |
1167 | else if (pl->container_ () == this) |
1178 | else if (pl->container_ () == this) |
1168 | { |
1179 | { |
1169 | // removing a container should close it |
1180 | // removing a container should close it |
1170 | close_container (); |
1181 | close_container (); |
1171 | } |
1182 | } |
1172 | |
1183 | else |
1173 | esrv_del_item (pl->contr, count); |
1184 | esrv_del_item (pl->contr, count); |
1174 | } |
1185 | } |
1175 | |
1186 | |
1176 | /* link the object above us */ |
1187 | /* link the object above us */ |
1177 | // re-link, make sure compiler can easily use cmove |
1188 | // re-link, make sure compiler can easily use cmove |
1178 | *(above ? &above->below : &ms.top) = below; |
1189 | *(above ? &above->below : &ms.top) = below; |
… | |
… | |
1180 | |
1191 | |
1181 | above = 0; |
1192 | above = 0; |
1182 | below = 0; |
1193 | below = 0; |
1183 | |
1194 | |
1184 | ms.invalidate (); |
1195 | ms.invalidate (); |
1185 | |
|
|
1186 | if (map->in_memory == MAP_SAVING) |
|
|
1187 | return; |
|
|
1188 | |
1196 | |
1189 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1197 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1190 | |
1198 | |
1191 | if (object *pl = ms.player ()) |
1199 | if (object *pl = ms.player ()) |
1192 | { |
1200 | { |
… | |
… | |
1269 | |
1277 | |
1270 | object *prev = this; |
1278 | object *prev = this; |
1271 | |
1279 | |
1272 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1280 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1273 | { |
1281 | { |
1274 | object *op = arch_to_object (at); |
1282 | object *op = at->instance (); |
1275 | |
1283 | |
1276 | op->name = name; |
1284 | op->name = name; |
1277 | op->name_pl = name_pl; |
1285 | op->name_pl = name_pl; |
1278 | op->title = title; |
1286 | op->title = title; |
1279 | |
1287 | |
… | |
… | |
1317 | * Passing 0 for flag gives proper default values, so flag really only needs |
1325 | * Passing 0 for flag gives proper default values, so flag really only needs |
1318 | * to be set if special handling is needed. |
1326 | * to be set if special handling is needed. |
1319 | * |
1327 | * |
1320 | * Return value: |
1328 | * Return value: |
1321 | * new object if 'op' was merged with other object |
1329 | * new object if 'op' was merged with other object |
1322 | * NULL if 'op' was destroyed |
1330 | * NULL if there was an error (destroyed, blocked etc.) |
1323 | * just 'op' otherwise |
1331 | * just 'op' otherwise |
1324 | */ |
1332 | */ |
1325 | object * |
1333 | object * |
1326 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1334 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1327 | { |
1335 | { |
1328 | op->remove (); |
1336 | op->remove (); |
1329 | |
1337 | |
1330 | if (m == &freed_map)//D TODO: remove soon |
1338 | if (m == &freed_map)//D TODO: remove soon |
1331 | {//D |
1339 | {//D |
1332 | LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D |
1340 | LOG (llevError | logBacktrace, "tries to insert object on freed objects map: %s", op->debug_desc ());//D |
1333 | }//D |
1341 | }//D |
1334 | |
1342 | |
1335 | /* Ideally, the caller figures this out. However, it complicates a lot |
1343 | /* Ideally, the caller figures this out. However, it complicates a lot |
1336 | * of areas of callers (eg, anything that uses find_free_spot would now |
1344 | * of areas of callers (eg, anything that uses find_free_spot would now |
1337 | * need extra work |
1345 | * need extra work |
… | |
… | |
1364 | // from here :/ |
1372 | // from here :/ |
1365 | op->nrof += tmp->nrof; |
1373 | op->nrof += tmp->nrof; |
1366 | tmp->destroy (); |
1374 | tmp->destroy (); |
1367 | } |
1375 | } |
1368 | |
1376 | |
1369 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1377 | op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1370 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1378 | op->clr_flag (FLAG_INV_LOCKED); |
1371 | |
1379 | |
1372 | if (!QUERY_FLAG (op, FLAG_ALIVE)) |
1380 | if (!op->flag [FLAG_ALIVE]) |
1373 | CLEAR_FLAG (op, FLAG_NO_STEAL); |
1381 | op->clr_flag (FLAG_NO_STEAL); |
1374 | |
1382 | |
1375 | if (flag & INS_BELOW_ORIGINATOR) |
1383 | if (flag & INS_BELOW_ORIGINATOR) |
1376 | { |
1384 | { |
1377 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1385 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1378 | { |
1386 | { |
… | |
… | |
1406 | * We've already dealt with merging if appropriate. |
1414 | * We've already dealt with merging if appropriate. |
1407 | * Generally, we want to put the new object on top. But if |
1415 | * Generally, we want to put the new object on top. But if |
1408 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1416 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1409 | * floor, we want to insert above that and no further. |
1417 | * floor, we want to insert above that and no further. |
1410 | * Also, if there are spell objects on this space, we stop processing |
1418 | * Also, if there are spell objects on this space, we stop processing |
1411 | * once we get to them. This reduces the need to traverse over all of |
1419 | * once we get to them. This reduces the need to traverse over all of |
1412 | * them when adding another one - this saves quite a bit of cpu time |
1420 | * them when adding another one - this saves quite a bit of cpu time |
1413 | * when lots of spells are cast in one area. Currently, it is presumed |
1421 | * when lots of spells are cast in one area. Currently, it is presumed |
1414 | * that flying non pickable objects are spell objects. |
1422 | * that flying non pickable objects are spell objects. |
1415 | */ |
1423 | */ |
1416 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1424 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1417 | { |
1425 | { |
1418 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR)) |
1426 | if (tmp->flag [FLAG_IS_FLOOR] || tmp->flag [FLAG_OVERLAY_FLOOR]) |
1419 | floor = tmp; |
1427 | floor = tmp; |
1420 | |
1428 | |
1421 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1429 | if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR]) |
1422 | { |
1430 | { |
1423 | /* We insert above top, so we want this object below this */ |
1431 | /* We insert above top, so we want this object below this */ |
1424 | top = tmp->below; |
1432 | top = tmp->below; |
1425 | break; |
1433 | break; |
1426 | } |
1434 | } |
… | |
… | |
1444 | && (op->face && !faces [op->face].visibility)) |
1452 | && (op->face && !faces [op->face].visibility)) |
1445 | { |
1453 | { |
1446 | object *last; |
1454 | object *last; |
1447 | |
1455 | |
1448 | for (last = top; last != floor; last = last->below) |
1456 | for (last = top; last != floor; last = last->below) |
1449 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1457 | if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT)) |
1450 | break; |
1458 | break; |
1451 | |
1459 | |
1452 | /* Check to see if we found the object that blocks view, |
1460 | /* Check to see if we found the object that blocks view, |
1453 | * and make sure we have a below pointer for it so that |
1461 | * and make sure we have a below pointer for it so that |
1454 | * we can get inserted below this one, which requires we |
1462 | * we can get inserted below this one, which requires we |
… | |
… | |
1527 | */ |
1535 | */ |
1528 | |
1536 | |
1529 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1537 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1530 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1538 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1531 | { |
1539 | { |
1532 | if (check_move_on (op, originator)) |
1540 | if (check_move_on (op, originator, flag)) |
1533 | return 0; |
1541 | return 0; |
1534 | |
1542 | |
1535 | /* If we are a multi part object, lets work our way through the check |
1543 | /* If we are a multi part object, let's work our way through the check |
1536 | * walk on's. |
1544 | * walk on's. |
1537 | */ |
1545 | */ |
1538 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1546 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1539 | if (check_move_on (tmp, originator)) |
1547 | if (check_move_on (tmp, originator, flag)) |
1540 | return 0; |
1548 | return 0; |
1541 | } |
1549 | } |
1542 | |
1550 | |
1543 | return op; |
1551 | return op; |
1544 | } |
1552 | } |
1545 | |
1553 | |
1546 | /* this function inserts an object in the map, but if it |
1554 | /* this function inserts an object in the map, but if it |
1547 | * finds an object of its own type, it'll remove that one first. |
1555 | * finds an object of its own type, it'll remove that one first. |
1548 | * op is the object to insert it under: supplies x and the map. |
1556 | * op is the object to insert it under: supplies x and the map. |
1549 | */ |
1557 | */ |
1550 | void |
1558 | void |
1551 | replace_insert_ob_in_map (shstr_tmp archname, object *op) |
1559 | replace_insert_ob_in_map (shstr_tmp archname, object *op) |
1552 | { |
1560 | { |
… | |
… | |
1554 | |
1562 | |
1555 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1563 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1556 | if (tmp->arch->archname == archname) /* same archetype */ |
1564 | if (tmp->arch->archname == archname) /* same archetype */ |
1557 | tmp->destroy (); |
1565 | tmp->destroy (); |
1558 | |
1566 | |
1559 | object *tmp = arch_to_object (archetype::find (archname)); |
1567 | object *tmp = archetype::find (archname)->instance (); |
1560 | |
1568 | |
1561 | tmp->x = op->x; |
1569 | tmp->x = op->x; |
1562 | tmp->y = op->y; |
1570 | tmp->y = op->y; |
1563 | |
1571 | |
1564 | insert_ob_in_map (tmp, op->map, op, 0); |
1572 | insert_ob_in_map (tmp, op->map, op, 0); |
… | |
… | |
1584 | if (!items // testing !items ensures we can drop at least one item |
1592 | if (!items // testing !items ensures we can drop at least one item |
1585 | || (items < m->max_items |
1593 | || (items < m->max_items |
1586 | && ms.volume () < m->max_volume)) |
1594 | && ms.volume () < m->max_volume)) |
1587 | return true; |
1595 | return true; |
1588 | |
1596 | |
1589 | if (originator && originator->is_player ()) |
1597 | if (originator) |
1590 | originator->contr->failmsg (format ( |
1598 | originator->failmsgf ( |
1591 | "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>", |
1599 | "No matter how hard you try, you just cannot put the %s here! H<Try to remove some items from the floor first.>", |
1592 | query_name () |
1600 | query_name () |
1593 | )); |
1601 | ); |
1594 | |
1602 | |
1595 | return false; |
1603 | return false; |
1596 | } |
1604 | } |
1597 | |
1605 | |
1598 | /* |
1606 | /* |
… | |
… | |
1610 | |
1618 | |
1611 | nr = min (nr, nrof); |
1619 | nr = min (nr, nrof); |
1612 | |
1620 | |
1613 | if (nrof > nr) |
1621 | if (nrof > nr) |
1614 | { |
1622 | { |
|
|
1623 | weight_t oweight = total_weight (); |
|
|
1624 | |
1615 | nrof -= nr; |
1625 | nrof -= nr; |
1616 | adjust_weight (env, -weight * max (1, nr)); // carrying == 0 |
|
|
1617 | |
1626 | |
1618 | if (object *pl = visible_to ()) |
1627 | if (object *pl = visible_to ()) |
1619 | esrv_update_item (UPD_NROF, pl, this); |
1628 | esrv_update_item (UPD_NROF, pl, this); |
|
|
1629 | |
|
|
1630 | adjust_weight (env, oweight, total_weight ()); |
1620 | |
1631 | |
1621 | return true; |
1632 | return true; |
1622 | } |
1633 | } |
1623 | else |
1634 | else |
1624 | { |
1635 | { |
… | |
… | |
1678 | /* |
1689 | /* |
1679 | * env->insert (op) |
1690 | * env->insert (op) |
1680 | * This function inserts the object op in the linked list |
1691 | * This function inserts the object op in the linked list |
1681 | * inside the object environment. |
1692 | * inside the object environment. |
1682 | * |
1693 | * |
1683 | * The function returns now pointer to inserted item, and return value can |
1694 | * The function returns now pointer to inserted item, and return value can |
1684 | * be != op, if items are merged. -Tero |
1695 | * be != op, if items are merged. -Tero |
1685 | */ |
1696 | */ |
1686 | object * |
1697 | object * |
1687 | object::insert (object *op) |
1698 | object::insert (object *op) |
1688 | { |
1699 | { |
… | |
… | |
1699 | if (op->nrof) |
1710 | if (op->nrof) |
1700 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1711 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1701 | if (object::can_merge (tmp, op)) |
1712 | if (object::can_merge (tmp, op)) |
1702 | { |
1713 | { |
1703 | /* return the original object and remove inserted object |
1714 | /* return the original object and remove inserted object |
1704 | (client needs the original object) */ |
1715 | (client prefers the original object) */ |
|
|
1716 | |
|
|
1717 | // carrying must be 0 for mergable objects |
|
|
1718 | weight_t oweight = weight_t (tmp->weight) * tmp->nrof; |
|
|
1719 | |
1705 | tmp->nrof += op->nrof; |
1720 | tmp->nrof += op->nrof; |
1706 | |
1721 | |
1707 | if (object *pl = tmp->visible_to ()) |
1722 | if (object *pl = tmp->visible_to ()) |
1708 | esrv_update_item (UPD_NROF, pl, tmp); |
1723 | esrv_update_item (UPD_NROF, pl, tmp); |
1709 | |
1724 | |
1710 | adjust_weight (this, op->total_weight ()); |
1725 | adjust_weight (this, oweight, weight_t (tmp->weight) * tmp->nrof); |
1711 | |
1726 | |
1712 | op->destroy (); |
1727 | op->destroy (); |
1713 | op = tmp; |
1728 | op = tmp; |
1714 | goto inserted; |
1729 | goto inserted; |
1715 | } |
1730 | } |
… | |
… | |
1731 | op->flag [FLAG_REMOVED] = 0; |
1746 | op->flag [FLAG_REMOVED] = 0; |
1732 | |
1747 | |
1733 | if (object *pl = op->visible_to ()) |
1748 | if (object *pl = op->visible_to ()) |
1734 | esrv_send_item (pl, op); |
1749 | esrv_send_item (pl, op); |
1735 | |
1750 | |
1736 | adjust_weight (this, op->total_weight ()); |
1751 | adjust_weight (this, 0, op->total_weight ()); |
1737 | |
1752 | |
1738 | inserted: |
1753 | inserted: |
1739 | /* reset the light list and los of the players on the map */ |
1754 | /* reset the light list and los of the players on the map */ |
1740 | if (op->glow_radius && is_on_map ()) |
1755 | if (op->glow_radius && is_on_map ()) |
1741 | { |
1756 | { |
… | |
… | |
1770 | * MSW 2001-07-08: Check all objects on space, not just those below |
1785 | * MSW 2001-07-08: Check all objects on space, not just those below |
1771 | * object being inserted. insert_ob_in_map may not put new objects |
1786 | * object being inserted. insert_ob_in_map may not put new objects |
1772 | * on top. |
1787 | * on top. |
1773 | */ |
1788 | */ |
1774 | int |
1789 | int |
1775 | check_move_on (object *op, object *originator) |
1790 | check_move_on (object *op, object *originator, int flags) |
1776 | { |
1791 | { |
1777 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1792 | if (op->flag [FLAG_NO_APPLY]) |
1778 | return 0; |
1793 | return 0; |
1779 | |
1794 | |
1780 | object *tmp; |
1795 | object *tmp; |
1781 | maptile *m = op->map; |
1796 | maptile *m = op->map; |
1782 | int x = op->x, y = op->y; |
1797 | int x = op->x, y = op->y; |
… | |
… | |
1804 | */ |
1819 | */ |
1805 | if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0) |
1820 | if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0) |
1806 | return 0; |
1821 | return 0; |
1807 | |
1822 | |
1808 | /* The objects have to be checked from top to bottom. |
1823 | /* The objects have to be checked from top to bottom. |
1809 | * Hence, we first go to the top: |
1824 | * Hence, we first go to the top: |
1810 | */ |
1825 | */ |
1811 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1826 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1812 | { |
1827 | { |
1813 | next = tmp->below; |
1828 | next = tmp->below; |
1814 | |
1829 | |
… | |
… | |
1819 | * Second check makes sure that the movement types not being slowed |
1834 | * Second check makes sure that the movement types not being slowed |
1820 | * (~slow_move) is not blocked on this space - just because the |
1835 | * (~slow_move) is not blocked on this space - just because the |
1821 | * space doesn't slow down swimming (for example), if you can't actually |
1836 | * space doesn't slow down swimming (for example), if you can't actually |
1822 | * swim on that space, can't use it to avoid the penalty. |
1837 | * swim on that space, can't use it to avoid the penalty. |
1823 | */ |
1838 | */ |
1824 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1839 | if (!op->flag [FLAG_WIZPASS]) |
1825 | { |
1840 | { |
1826 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1841 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1827 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1842 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1828 | { |
1843 | { |
1829 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
1844 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
… | |
… | |
1839 | |
1854 | |
1840 | /* Basically same logic as above, except now for actual apply. */ |
1855 | /* Basically same logic as above, except now for actual apply. */ |
1841 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1856 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1842 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1857 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1843 | { |
1858 | { |
|
|
1859 | if ((flags & INS_NO_AUTO_EXIT) |
|
|
1860 | && (tmp->type == EXIT || tmp->type == TELEPORTER |
|
|
1861 | || tmp->type == HOLE || tmp->type == TRAPDOOR)) //TODO: temporary, fix exits instead |
|
|
1862 | continue; |
|
|
1863 | |
1844 | move_apply (tmp, op, originator); |
1864 | move_apply (tmp, op, originator); |
1845 | |
1865 | |
1846 | if (op->destroyed ()) |
1866 | if (op->destroyed ()) |
1847 | return 1; |
1867 | return 1; |
1848 | |
1868 | |
… | |
… | |
1960 | void |
1980 | void |
1961 | flag_inv (object *op, int flag) |
1981 | flag_inv (object *op, int flag) |
1962 | { |
1982 | { |
1963 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1983 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1964 | { |
1984 | { |
1965 | SET_FLAG (tmp, flag); |
1985 | tmp->set_flag (flag); |
1966 | flag_inv (tmp, flag); |
1986 | flag_inv (tmp, flag); |
1967 | } |
1987 | } |
1968 | } |
1988 | } |
1969 | |
1989 | |
1970 | /* |
1990 | /* |
… | |
… | |
1973 | void |
1993 | void |
1974 | unflag_inv (object *op, int flag) |
1994 | unflag_inv (object *op, int flag) |
1975 | { |
1995 | { |
1976 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1996 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1977 | { |
1997 | { |
1978 | CLEAR_FLAG (tmp, flag); |
1998 | tmp->clr_flag (flag); |
1979 | unflag_inv (tmp, flag); |
1999 | unflag_inv (tmp, flag); |
1980 | } |
2000 | } |
1981 | } |
2001 | } |
1982 | |
2002 | |
1983 | /* |
2003 | /* |
… | |
… | |
1993 | * inform the caller. However, insert_ob_in_map will update as |
2013 | * inform the caller. However, insert_ob_in_map will update as |
1994 | * necessary, so the caller shouldn't need to do any special work. |
2014 | * necessary, so the caller shouldn't need to do any special work. |
1995 | * Note - updated to take an object instead of archetype - this is necessary |
2015 | * Note - updated to take an object instead of archetype - this is necessary |
1996 | * because arch_blocked (now ob_blocked) needs to know the movement type |
2016 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1997 | * to know if the space in question will block the object. We can't use |
2017 | * to know if the space in question will block the object. We can't use |
1998 | * the archetype because that isn't correct if the monster has been |
2018 | * the archetype because that isn't correct if the monster has been |
1999 | * customized, changed states, etc. |
2019 | * customized, changed states, etc. |
2000 | */ |
2020 | */ |
2001 | int |
2021 | int |
2002 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2022 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2003 | { |
2023 | { |
2004 | int altern[SIZEOFFREE]; |
2024 | int altern[SIZEOFFREE]; |
2005 | int index = 0, flag; |
2025 | int index = 0; |
2006 | |
2026 | |
2007 | for (int i = start; i < stop; i++) |
2027 | for (int i = start; i < stop; i++) |
2008 | { |
2028 | { |
2009 | mapxy pos (m, x, y); pos.move (i); |
2029 | mapxy pos (m, x, y); pos.move (i); |
2010 | |
2030 | |
… | |
… | |
2026 | continue; |
2046 | continue; |
2027 | } |
2047 | } |
2028 | |
2048 | |
2029 | /* Basically, if we find a wall on a space, we cut down the search size. |
2049 | /* Basically, if we find a wall on a space, we cut down the search size. |
2030 | * In this way, we won't return spaces that are on another side of a wall. |
2050 | * In this way, we won't return spaces that are on another side of a wall. |
2031 | * This mostly work, but it cuts down the search size in all directions - |
2051 | * This mostly work, but it cuts down the search size in all directions - |
2032 | * if the space being examined only has a wall to the north and empty |
2052 | * if the space being examined only has a wall to the north and empty |
2033 | * spaces in all the other directions, this will reduce the search space |
2053 | * spaces in all the other directions, this will reduce the search space |
2034 | * to only the spaces immediately surrounding the target area, and |
2054 | * to only the spaces immediately surrounding the target area, and |
2035 | * won't look 2 spaces south of the target space. |
2055 | * won't look 2 spaces south of the target space. |
2036 | */ |
2056 | */ |
… | |
… | |
2066 | */ |
2086 | */ |
2067 | int |
2087 | int |
2068 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2088 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2069 | { |
2089 | { |
2070 | for (int i = 0; i < SIZEOFFREE; i++) |
2090 | for (int i = 0; i < SIZEOFFREE; i++) |
2071 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2091 | if (!ob->blocked (m, x + DIRX (i), y + DIRY (i))) |
2072 | return i; |
2092 | return i; |
2073 | |
2093 | |
2074 | return -1; |
2094 | return -1; |
2075 | } |
2095 | } |
2076 | |
2096 | |
… | |
… | |
2087 | |
2107 | |
2088 | while (--end) |
2108 | while (--end) |
2089 | swap (arr [end], arr [rndm (end + 1)]); |
2109 | swap (arr [end], arr [rndm (end + 1)]); |
2090 | } |
2110 | } |
2091 | |
2111 | |
2092 | /* new function to make monster searching more efficient, and effective! |
2112 | /* new function to make monster searching more efficient, and effective! |
2093 | * This basically returns a randomized array (in the passed pointer) of |
2113 | * This basically returns a randomized array (in the passed pointer) of |
2094 | * the spaces to find monsters. In this way, it won't always look for |
2114 | * the spaces to find monsters. In this way, it won't always look for |
2095 | * monsters to the north first. However, the size of the array passed |
2115 | * monsters to the north first. However, the size of the array passed |
2096 | * covers all the spaces, so within that size, all the spaces within |
2116 | * covers all the spaces, so within that size, all the spaces within |
2097 | * the 3x3 area will be searched, just not in a predictable order. |
2117 | * the 3x3 area will be searched, just not in a predictable order. |
… | |
… | |
2122 | * there is capable of. |
2142 | * there is capable of. |
2123 | */ |
2143 | */ |
2124 | int |
2144 | int |
2125 | find_dir (maptile *m, int x, int y, object *exclude) |
2145 | find_dir (maptile *m, int x, int y, object *exclude) |
2126 | { |
2146 | { |
2127 | int max = SIZEOFFREE, mflags; |
2147 | int max = SIZEOFFREE; |
2128 | MoveType move_type; |
2148 | MoveType move_type; |
2129 | |
2149 | |
2130 | if (exclude && exclude->head_ () != exclude) |
2150 | if (exclude && exclude->head_ () != exclude) |
2131 | { |
2151 | { |
2132 | exclude = exclude->head; |
2152 | exclude = exclude->head; |
… | |
… | |
2173 | { |
2193 | { |
2174 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2194 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2175 | } |
2195 | } |
2176 | |
2196 | |
2177 | /* |
2197 | /* |
2178 | * find_dir_2(delta-x,delta-y) will return a direction in which |
2198 | * find_dir_2(delta-x,delta-y) will return a direction value |
2179 | * an object which has subtracted the x and y coordinates of another |
2199 | * for running into direct [dx, dy]. |
2180 | * object, needs to travel toward it. |
2200 | * (the opposite of crossfire's find_dir_2!) |
2181 | */ |
2201 | */ |
2182 | int |
2202 | int |
2183 | find_dir_2 (int x, int y) |
2203 | find_dir_2 (int x, int y) |
2184 | { |
2204 | { |
|
|
2205 | #if 1 // new algorithm |
|
|
2206 | // this works by putting x, y into 16 sectors, which |
|
|
2207 | // are not equal sized, but are a better approximation |
|
|
2208 | // then the old algorithm, and then using a mapping |
|
|
2209 | // table to map it into a direction value. |
|
|
2210 | // basically, it maps these comparisons to each bit |
|
|
2211 | // bit #3: x < 0 |
|
|
2212 | // bit #2: y < 0 |
|
|
2213 | // bit #1: x > y |
|
|
2214 | // bit #0: x > 2y |
|
|
2215 | |
|
|
2216 | static const uint8 dir[16] = { |
|
|
2217 | 4, 5, 4, 3, |
|
|
2218 | 2, 1, 2, 3, |
|
|
2219 | 6, 5, 6, 7, |
|
|
2220 | 8, 1, 8, 7, |
|
|
2221 | }; |
|
|
2222 | int sector = 0; |
|
|
2223 | |
|
|
2224 | // this is a bit ugly, but more likely to result in branchless code |
|
|
2225 | sector |= x < 0 ? 8 : 0; |
|
|
2226 | x = x < 0 ? -x : x; // abs |
|
|
2227 | |
|
|
2228 | sector |= y < 0 ? 4 : 0; |
|
|
2229 | y = y < 0 ? -y : y; // abs |
|
|
2230 | |
|
|
2231 | if (x > y) |
|
|
2232 | { |
|
|
2233 | sector |= 2; |
|
|
2234 | |
|
|
2235 | if (x > y * 2) |
|
|
2236 | sector |= 1; |
|
|
2237 | } |
|
|
2238 | else |
|
|
2239 | { |
|
|
2240 | if (y > x * 2) |
|
|
2241 | sector |= 1; |
|
|
2242 | else if (!y) |
|
|
2243 | return 0; // x == 0 here |
|
|
2244 | } |
|
|
2245 | |
|
|
2246 | return dir [sector]; |
|
|
2247 | #else // old algorithm |
2185 | int q; |
2248 | int q; |
2186 | |
2249 | |
2187 | if (y) |
2250 | if (y) |
2188 | q = x * 100 / y; |
2251 | q = 128 * x / y; |
2189 | else if (x) |
2252 | else if (x) |
2190 | q = -300 * x; |
2253 | q = -512 * x; // to make it > 309 |
2191 | else |
2254 | else |
2192 | return 0; |
2255 | return 0; |
2193 | |
2256 | |
2194 | if (y > 0) |
2257 | if (y > 0) |
2195 | { |
2258 | { |
2196 | if (q < -242) |
2259 | if (q < -309) return 7; |
|
|
2260 | if (q < -52) return 6; |
|
|
2261 | if (q < 52) return 5; |
|
|
2262 | if (q < 309) return 4; |
|
|
2263 | |
2197 | return 3; |
2264 | return 3; |
2198 | if (q < -41) |
2265 | } |
2199 | return 2; |
2266 | else |
2200 | if (q < 41) |
2267 | { |
2201 | return 1; |
2268 | if (q < -309) return 3; |
2202 | if (q < 242) |
2269 | if (q < -52) return 2; |
2203 | return 8; |
2270 | if (q < 52) return 1; |
|
|
2271 | if (q < 309) return 8; |
|
|
2272 | |
2204 | return 7; |
2273 | return 7; |
2205 | } |
2274 | } |
2206 | |
2275 | #endif |
2207 | if (q < -242) |
|
|
2208 | return 7; |
|
|
2209 | if (q < -41) |
|
|
2210 | return 6; |
|
|
2211 | if (q < 41) |
|
|
2212 | return 5; |
|
|
2213 | if (q < 242) |
|
|
2214 | return 4; |
|
|
2215 | |
|
|
2216 | return 3; |
|
|
2217 | } |
2276 | } |
2218 | |
2277 | |
2219 | /* |
2278 | /* |
2220 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2279 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2221 | * between two directions (which are expected to be absolute (see absdir()) |
2280 | * between two directions (which are expected to be absolute (see absdir()) |
2222 | */ |
2281 | */ |
2223 | int |
2282 | int |
2224 | dirdiff (int dir1, int dir2) |
2283 | dirdiff (int dir1, int dir2) |
2225 | { |
2284 | { |
2226 | int d; |
|
|
2227 | |
|
|
2228 | d = abs (dir1 - dir2); |
2285 | int d = abs (dir1 - dir2); |
2229 | if (d > 4) |
|
|
2230 | d = 8 - d; |
|
|
2231 | |
2286 | |
2232 | return d; |
2287 | return d > 4 ? 8 - d : d; |
2233 | } |
2288 | } |
2234 | |
2289 | |
2235 | /* peterm: |
2290 | /* peterm: |
2236 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2291 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2237 | * Basically, this is a table of directions, and what directions |
2292 | * Basically, this is a table of directions, and what directions |
… | |
… | |
2306 | int mflags; |
2361 | int mflags; |
2307 | |
2362 | |
2308 | if (dir < 0) |
2363 | if (dir < 0) |
2309 | return 0; /* exit condition: invalid direction */ |
2364 | return 0; /* exit condition: invalid direction */ |
2310 | |
2365 | |
2311 | dx = x + freearr_x[dir]; |
2366 | dx = x + DIRX (dir); |
2312 | dy = y + freearr_y[dir]; |
2367 | dy = y + DIRY (dir); |
2313 | |
2368 | |
2314 | mflags = get_map_flags (m, &m, dx, dy, &dx, &dy); |
2369 | mflags = get_map_flags (m, &m, dx, dy, &dx, &dy); |
2315 | |
2370 | |
2316 | /* This functional arguably was incorrect before - it was |
2371 | /* This functional arguably was incorrect before - it was |
2317 | * checking for P_WALL - that was basically seeing if |
2372 | * checking for P_WALL - that was basically seeing if |
… | |
… | |
2343 | * Add a check so we can't pick up invisible objects (0.93.8) |
2398 | * Add a check so we can't pick up invisible objects (0.93.8) |
2344 | */ |
2399 | */ |
2345 | int |
2400 | int |
2346 | can_pick (const object *who, const object *item) |
2401 | can_pick (const object *who, const object *item) |
2347 | { |
2402 | { |
2348 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2403 | return /*who->flag [FLAG_WIZ]|| */ |
2349 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2404 | (item->weight > 0 && !item->flag [FLAG_NO_PICK] && |
2350 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2405 | !item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2351 | } |
2406 | } |
|
|
2407 | |
|
|
2408 | //-GPL |
2352 | |
2409 | |
2353 | /* |
2410 | /* |
2354 | * create clone from object to another |
2411 | * create clone from object to another |
2355 | */ |
2412 | */ |
2356 | object * |
2413 | object * |
… | |
… | |
2387 | return tmp; |
2444 | return tmp; |
2388 | |
2445 | |
2389 | return 0; |
2446 | return 0; |
2390 | } |
2447 | } |
2391 | |
2448 | |
|
|
2449 | /* Zero the key_values on op, decrementing the shared-string |
|
|
2450 | * refcounts and freeing the links. |
|
|
2451 | */ |
|
|
2452 | void |
|
|
2453 | key_values::clear () |
|
|
2454 | { |
|
|
2455 | for (key_value *kvp = first; kvp; ) |
|
|
2456 | { |
|
|
2457 | key_value *next = kvp->next; |
|
|
2458 | delete kvp; |
|
|
2459 | kvp = next; |
|
|
2460 | } |
|
|
2461 | |
|
|
2462 | first = 0; |
|
|
2463 | } |
|
|
2464 | |
2392 | shstr_tmp |
2465 | shstr_tmp |
2393 | object::kv_get (shstr_tmp key) const |
2466 | key_values::get (shstr_tmp key) const |
2394 | { |
2467 | { |
2395 | for (key_value *kv = key_values; kv; kv = kv->next) |
2468 | for (key_value *kv = first; kv; kv = kv->next) |
2396 | if (kv->key == key) |
2469 | if (kv->key == key) |
2397 | return kv->value; |
2470 | return kv->value; |
2398 | |
2471 | |
2399 | return shstr (); |
2472 | return shstr (); |
2400 | } |
2473 | } |
2401 | |
2474 | |
2402 | void |
2475 | void |
|
|
2476 | key_values::add (shstr_tmp key, shstr_tmp value) |
|
|
2477 | { |
|
|
2478 | key_value *kv = new key_value; |
|
|
2479 | |
|
|
2480 | kv->next = first; |
|
|
2481 | kv->key = key; |
|
|
2482 | kv->value = value; |
|
|
2483 | |
|
|
2484 | first = kv; |
|
|
2485 | } |
|
|
2486 | |
|
|
2487 | void |
2403 | object::kv_set (shstr_tmp key, shstr_tmp value) |
2488 | key_values::set (shstr_tmp key, shstr_tmp value) |
2404 | { |
2489 | { |
2405 | for (key_value *kv = key_values; kv; kv = kv->next) |
2490 | for (key_value *kv = first; kv; kv = kv->next) |
2406 | if (kv->key == key) |
2491 | if (kv->key == key) |
2407 | { |
2492 | { |
2408 | kv->value = value; |
2493 | kv->value = value; |
2409 | return; |
2494 | return; |
2410 | } |
2495 | } |
2411 | |
2496 | |
2412 | key_value *kv = new key_value; |
2497 | add (key, value); |
2413 | |
|
|
2414 | kv->next = key_values; |
|
|
2415 | kv->key = key; |
|
|
2416 | kv->value = value; |
|
|
2417 | |
|
|
2418 | key_values = kv; |
|
|
2419 | } |
2498 | } |
2420 | |
2499 | |
2421 | void |
2500 | void |
2422 | object::kv_del (shstr_tmp key) |
2501 | key_values::del (shstr_tmp key) |
2423 | { |
2502 | { |
2424 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
2503 | for (key_value **kvp = &first; *kvp; kvp = &(*kvp)->next) |
2425 | if ((*kvp)->key == key) |
2504 | if ((*kvp)->key == key) |
2426 | { |
2505 | { |
2427 | key_value *kv = *kvp; |
2506 | key_value *kv = *kvp; |
2428 | *kvp = (*kvp)->next; |
2507 | *kvp = (*kvp)->next; |
2429 | delete kv; |
2508 | delete kv; |
2430 | return; |
2509 | return; |
2431 | } |
2510 | } |
|
|
2511 | } |
|
|
2512 | |
|
|
2513 | void |
|
|
2514 | key_values::reverse () |
|
|
2515 | { |
|
|
2516 | key_value *prev = 0; |
|
|
2517 | key_value *head = first; |
|
|
2518 | |
|
|
2519 | while (head) |
|
|
2520 | { |
|
|
2521 | key_value *node = head; |
|
|
2522 | head = head->next; |
|
|
2523 | node->next = prev; |
|
|
2524 | prev = node; |
|
|
2525 | } |
|
|
2526 | |
|
|
2527 | first = prev; |
|
|
2528 | } |
|
|
2529 | |
|
|
2530 | key_values & |
|
|
2531 | key_values::operator =(const key_values &kv) |
|
|
2532 | { |
|
|
2533 | clear (); |
|
|
2534 | |
|
|
2535 | for (key_value *kvp = kv.first; kvp; kvp = kvp->next) |
|
|
2536 | add (kvp->key, kvp->value); |
|
|
2537 | |
|
|
2538 | reverse (); |
|
|
2539 | |
|
|
2540 | return *this; |
2432 | } |
2541 | } |
2433 | |
2542 | |
2434 | object::depth_iterator::depth_iterator (object *container) |
2543 | object::depth_iterator::depth_iterator (object *container) |
2435 | : iterator_base (container) |
2544 | : iterator_base (container) |
2436 | { |
2545 | { |
… | |
… | |
2520 | { |
2629 | { |
2521 | return map ? map->region (x, y) |
2630 | return map ? map->region (x, y) |
2522 | : region::default_region (); |
2631 | : region::default_region (); |
2523 | } |
2632 | } |
2524 | |
2633 | |
|
|
2634 | //+GPL |
|
|
2635 | |
2525 | void |
2636 | void |
2526 | object::open_container (object *new_container) |
2637 | object::open_container (object *new_container) |
2527 | { |
2638 | { |
2528 | if (container == new_container) |
2639 | if (container == new_container) |
2529 | return; |
2640 | return; |
… | |
… | |
2563 | // TODO: this does not seem to serve any purpose anymore? |
2674 | // TODO: this does not seem to serve any purpose anymore? |
2564 | #if 0 |
2675 | #if 0 |
2565 | // insert the "Close Container" object. |
2676 | // insert the "Close Container" object. |
2566 | if (archetype *closer = new_container->other_arch) |
2677 | if (archetype *closer = new_container->other_arch) |
2567 | { |
2678 | { |
2568 | object *closer = arch_to_object (new_container->other_arch); |
2679 | object *closer = new_container->other_arch->instance (); |
2569 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2680 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2570 | new_container->insert (closer); |
2681 | new_container->insert (closer); |
2571 | } |
2682 | } |
2572 | #endif |
2683 | #endif |
2573 | |
2684 | |
… | |
… | |
2586 | } |
2697 | } |
2587 | // else if (!old_container->env && contr && contr->ns) |
2698 | // else if (!old_container->env && contr && contr->ns) |
2588 | // contr->ns->floorbox_reset (); |
2699 | // contr->ns->floorbox_reset (); |
2589 | } |
2700 | } |
2590 | |
2701 | |
|
|
2702 | //-GPL |
|
|
2703 | |
|
|
2704 | // prefetch some flat area around the player |
|
|
2705 | static void |
|
|
2706 | prefetch_surrounding_area (object *op, maptile *map, int range) |
|
|
2707 | { |
|
|
2708 | for (maprect *rect = map->split_to_tiles (mapwalk_buf, |
|
|
2709 | op->x - range , op->y - range , |
|
|
2710 | op->x + range + 1, op->y + range + 1); |
|
|
2711 | rect->m; |
|
|
2712 | ++rect) |
|
|
2713 | { |
|
|
2714 | rect->m->touch (); |
|
|
2715 | rect->m->activate (); |
|
|
2716 | } |
|
|
2717 | } |
|
|
2718 | |
|
|
2719 | // prefetch a generous area around the player, also up and down |
|
|
2720 | void |
|
|
2721 | object::prefetch_surrounding_maps () |
|
|
2722 | { |
|
|
2723 | prefetch_surrounding_area (this, map, 40); |
|
|
2724 | |
|
|
2725 | if (maptile *m = map->tile_available (TILE_DOWN)) |
|
|
2726 | prefetch_surrounding_area (this, m, 20); |
|
|
2727 | |
|
|
2728 | if (maptile *m = map->tile_available (TILE_UP)) |
|
|
2729 | prefetch_surrounding_area (this, m, 20); |
|
|
2730 | } |
|
|
2731 | |
|
|
2732 | //+GPL |
|
|
2733 | |
2591 | object * |
2734 | object * |
2592 | object::force_find (shstr_tmp name) |
2735 | object::force_find (shstr_tmp name) |
2593 | { |
2736 | { |
2594 | /* cycle through his inventory to look for the MARK we want to |
2737 | /* cycle through his inventory to look for the MARK we want to |
2595 | * place |
2738 | * place |
2596 | */ |
2739 | */ |
2597 | for (object *tmp = inv; tmp; tmp = tmp->below) |
2740 | for (object *tmp = inv; tmp; tmp = tmp->below) |
2598 | if (tmp->type == FORCE && tmp->slaying == name) |
2741 | if (tmp->type == FORCE && tmp->slaying == name) |
2599 | return splay (tmp); |
2742 | return splay (tmp); |
2600 | |
2743 | |
2601 | return 0; |
2744 | return 0; |
2602 | } |
2745 | } |
2603 | |
2746 | |
2604 | //-GPL |
|
|
2605 | |
|
|
2606 | void |
2747 | void |
2607 | object::force_set_timer (int duration) |
2748 | object::force_set_timer (int duration) |
2608 | { |
2749 | { |
2609 | this->duration = 1; |
2750 | this->duration = 1; |
2610 | this->speed_left = -1.f; |
2751 | this->speed_left = -1.f; |
… | |
… | |
2616 | object::force_add (shstr_tmp name, int duration) |
2757 | object::force_add (shstr_tmp name, int duration) |
2617 | { |
2758 | { |
2618 | if (object *force = force_find (name)) |
2759 | if (object *force = force_find (name)) |
2619 | force->destroy (); |
2760 | force->destroy (); |
2620 | |
2761 | |
2621 | object *force = get_archetype (FORCE_NAME); |
2762 | object *force = archetype::get (FORCE_NAME); |
2622 | |
2763 | |
2623 | force->slaying = name; |
2764 | force->slaying = name; |
2624 | force->force_set_timer (duration); |
2765 | force->force_set_timer (duration); |
2625 | force->flag [FLAG_APPLIED] = true; |
2766 | force->flag [FLAG_APPLIED] = true; |
2626 | |
2767 | |
… | |
… | |
2679 | |
2820 | |
2680 | insert (force); |
2821 | insert (force); |
2681 | } |
2822 | } |
2682 | } |
2823 | } |
2683 | |
2824 | |
|
|
2825 | void object::change_move_type (MoveType mt) |
|
|
2826 | { |
|
|
2827 | if (move_type == mt) |
|
|
2828 | return; |
|
|
2829 | |
|
|
2830 | if (is_on_map ()) |
|
|
2831 | { |
|
|
2832 | // we are on the map, so handle move_on/off effects |
|
|
2833 | remove (); |
|
|
2834 | move_type = mt; |
|
|
2835 | map->insert (this, x, y, this); |
|
|
2836 | } |
|
|
2837 | else |
|
|
2838 | move_type = mt; |
|
|
2839 | } |
|
|
2840 | |
|
|
2841 | /* object should be a player. |
|
|
2842 | * we return the object the player has marked with the 'mark' command |
|
|
2843 | * below. If no match is found (or object has changed), we return |
|
|
2844 | * NULL. We leave it up to the calling function to print messages if |
|
|
2845 | * nothing is found. |
|
|
2846 | */ |
|
|
2847 | object * |
|
|
2848 | object::mark () const |
|
|
2849 | { |
|
|
2850 | if (contr && contr->mark && contr->mark->env == this) |
|
|
2851 | return contr->mark; |
|
|
2852 | else |
|
|
2853 | return 0; |
|
|
2854 | } |
|
|
2855 | |
|
|
2856 | // put marked object first in the inventory |
|
|
2857 | // this is used by identify-like spells so players can influence |
|
|
2858 | // the order a bit. |
|
|
2859 | void |
|
|
2860 | object::splay_marked () |
|
|
2861 | { |
|
|
2862 | if (object *marked = mark ()) |
|
|
2863 | splay (marked); |
|
|
2864 | } |
|
|
2865 | |