1 |
/* |
2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
* |
4 |
* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 |
* Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 |
* Copyright (©) 1992,2007 Frank Tore Johansen |
7 |
* |
8 |
* Deliantra is free software: you can redistribute it and/or modify |
9 |
* it under the terms of the GNU General Public License as published by |
10 |
* the Free Software Foundation, either version 3 of the License, or |
11 |
* (at your option) any later version. |
12 |
* |
13 |
* This program is distributed in the hope that it will be useful, |
14 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 |
* GNU General Public License for more details. |
17 |
* |
18 |
* You should have received a copy of the GNU General Public License |
19 |
* along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 |
* |
21 |
* The authors can be reached via e-mail to <support@deliantra.net> |
22 |
*/ |
23 |
|
24 |
#include <global.h> |
25 |
#include <stdio.h> |
26 |
#include <sys/types.h> |
27 |
#include <sys/uio.h> |
28 |
#include <object.h> |
29 |
#include <sproto.h> |
30 |
#include <loader.h> |
31 |
|
32 |
#include <bitset> |
33 |
|
34 |
UUID UUID::cur; |
35 |
static uint64_t seq_next_save; |
36 |
static const uint64 UUID_GAP = 1<<19; |
37 |
|
38 |
objectvec objects; |
39 |
activevec actives; |
40 |
|
41 |
short freearr_x[SIZEOFFREE] = { |
42 |
0, |
43 |
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, |
45 |
0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
46 |
}; |
47 |
short freearr_y[SIZEOFFREE] = { |
48 |
0, |
49 |
-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, |
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 |
52 |
}; |
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] = { |
60 |
0, |
61 |
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, |
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 |
64 |
}; |
65 |
|
66 |
static void |
67 |
write_uuid (uval64 skip, bool sync) |
68 |
{ |
69 |
CALL_BEGIN (2); |
70 |
CALL_ARG_SV (newSVval64 (skip)); |
71 |
CALL_ARG_SV (boolSV (sync)); |
72 |
CALL_CALL ("cf::write_uuid", G_DISCARD); |
73 |
CALL_END; |
74 |
} |
75 |
|
76 |
static void |
77 |
read_uuid (void) |
78 |
{ |
79 |
char filename[MAX_BUF]; |
80 |
|
81 |
sprintf (filename, "%s/uuid", settings.localdir); |
82 |
|
83 |
seq_next_save = 0; |
84 |
|
85 |
FILE *fp; |
86 |
|
87 |
if (!(fp = fopen (filename, "r"))) |
88 |
{ |
89 |
if (errno == ENOENT) |
90 |
{ |
91 |
LOG (llevInfo, "RESET uid to 1\n"); |
92 |
UUID::cur.seq = 0; |
93 |
write_uuid (UUID_GAP, true); |
94 |
return; |
95 |
} |
96 |
|
97 |
LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
98 |
_exit (1); |
99 |
} |
100 |
|
101 |
UUID::BUF buf; |
102 |
buf[0] = 0; |
103 |
fgets (buf, sizeof (buf), fp); |
104 |
|
105 |
if (!UUID::cur.parse (buf)) |
106 |
{ |
107 |
LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf); |
108 |
_exit (1); |
109 |
} |
110 |
|
111 |
LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ()); |
112 |
|
113 |
write_uuid (UUID_GAP, true); |
114 |
fclose (fp); |
115 |
} |
116 |
|
117 |
UUID |
118 |
UUID::gen () |
119 |
{ |
120 |
UUID uid; |
121 |
|
122 |
uid.seq = ++cur.seq; |
123 |
|
124 |
if (expect_false (cur.seq >= seq_next_save)) |
125 |
{ |
126 |
seq_next_save = UUID::cur.seq + (UUID_GAP >> 1); |
127 |
write_uuid (UUID_GAP, false); |
128 |
} |
129 |
|
130 |
|
131 |
return uid; |
132 |
} |
133 |
|
134 |
void |
135 |
UUID::init () |
136 |
{ |
137 |
read_uuid (); |
138 |
} |
139 |
|
140 |
/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
141 |
static bool |
142 |
compare_ob_value_lists_one (const object *wants, const object *has) |
143 |
{ |
144 |
key_value *wants_field; |
145 |
|
146 |
/* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
147 |
* objects with lists are rare, and lists stay short. If not, use a |
148 |
* different structure or at least keep the lists sorted... |
149 |
*/ |
150 |
|
151 |
/* For each field in wants, */ |
152 |
for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next) |
153 |
{ |
154 |
key_value *has_field; |
155 |
|
156 |
/* Look for a field in has with the same key. */ |
157 |
has_field = get_ob_key_link (has, wants_field->key); |
158 |
|
159 |
if (!has_field) |
160 |
return 0; /* No field with that name. */ |
161 |
|
162 |
/* Found the matching field. */ |
163 |
if (has_field->value != wants_field->value) |
164 |
return 0; /* Values don't match, so this half of the comparison is false. */ |
165 |
|
166 |
/* If we get here, we found a match. Now for the next field in wants. */ |
167 |
} |
168 |
|
169 |
/* If we get here, every field in wants has a matching field in has. */ |
170 |
return 1; |
171 |
} |
172 |
|
173 |
/* Returns TRUE if ob1 has the same key_values as ob2. */ |
174 |
static bool |
175 |
compare_ob_value_lists (const object *ob1, const object *ob2) |
176 |
{ |
177 |
/* However, there may be fields in has which aren't partnered in wants, |
178 |
* so we need to run the comparison *twice*. :( |
179 |
*/ |
180 |
return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1); |
181 |
} |
182 |
|
183 |
/* Function examines the 2 objects given to it, and returns true if |
184 |
* they can be merged together. |
185 |
* |
186 |
* Note that this function appears a lot longer than the macro it |
187 |
* replaces - this is mostly for clarity - a decent compiler should hopefully |
188 |
* reduce this to the same efficiency. |
189 |
* |
190 |
* Check nrof variable *before* calling can_merge() |
191 |
* |
192 |
* Improvements made with merge: Better checking on potion, and also |
193 |
* check weight |
194 |
*/ |
195 |
bool object::can_merge_slow (object *ob1, object *ob2) |
196 |
{ |
197 |
/* A couple quicksanity checks */ |
198 |
if (ob1 == ob2 |
199 |
|| ob1->type != ob2->type |
200 |
|| ob1->speed != ob2->speed |
201 |
|| ob1->value != ob2->value |
202 |
|| ob1->name != ob2->name) |
203 |
return 0; |
204 |
|
205 |
/* Do not merge objects if nrof would overflow. First part checks |
206 |
* for unsigned overflow (2c), second part checks whether the result |
207 |
* would fit into a 32 bit signed int, which is often used to hold |
208 |
* nrof values. |
209 |
*/ |
210 |
if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
211 |
return 0; |
212 |
|
213 |
/* If the objects have been identified, set the BEEN_APPLIED flag. |
214 |
* This is to the comparison of the flags below will be OK. We |
215 |
* just can't ignore the been applied or identified flags, as they |
216 |
* are not equal - just if it has been identified, the been_applied |
217 |
* flags lose any meaning. |
218 |
*/ |
219 |
if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
220 |
SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
221 |
|
222 |
if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
223 |
SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
224 |
|
225 |
if (ob1->arch->name != ob2->arch->name |
226 |
|| ob1->name != ob2->name |
227 |
|| ob1->title != ob2->title |
228 |
|| ob1->msg != ob2->msg |
229 |
|| ob1->weight != ob2->weight |
230 |
|| ob1->attacktype != ob2->attacktype |
231 |
|| ob1->magic != ob2->magic |
232 |
|| ob1->slaying != ob2->slaying |
233 |
|| ob1->skill != ob2->skill |
234 |
|| ob1->value != ob2->value |
235 |
|| ob1->animation_id != ob2->animation_id |
236 |
|| ob1->client_type != ob2->client_type |
237 |
|| ob1->materialname != ob2->materialname |
238 |
|| ob1->lore != ob2->lore |
239 |
|| ob1->subtype != ob2->subtype |
240 |
|| ob1->move_type != ob2->move_type |
241 |
|| ob1->move_block != ob2->move_block |
242 |
|| ob1->move_allow != ob2->move_allow |
243 |
|| ob1->move_on != ob2->move_on |
244 |
|| ob1->move_off != ob2->move_off |
245 |
|| ob1->move_slow != ob2->move_slow |
246 |
|| ob1->move_slow_penalty != ob2->move_slow_penalty |
247 |
|| memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
248 |
|| memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
249 |
return 0; |
250 |
|
251 |
if ((ob1->flag ^ ob2->flag) |
252 |
.reset (FLAG_INV_LOCKED) |
253 |
.reset (FLAG_CLIENT_SENT) |
254 |
.reset (FLAG_REMOVED) |
255 |
.any ()) |
256 |
return 0; |
257 |
|
258 |
/* This is really a spellbook check - we should in general |
259 |
* not merge objects with real inventories, as splitting them |
260 |
* is hard. |
261 |
*/ |
262 |
if (ob1->inv || ob2->inv) |
263 |
{ |
264 |
if (!(ob1->inv && ob2->inv)) |
265 |
return 0; /* inventories differ in length */ |
266 |
|
267 |
if (ob1->inv->below || ob2->inv->below) |
268 |
return 0; /* more than one object in inv */ |
269 |
|
270 |
if (!object::can_merge (ob1->inv, ob2->inv)) |
271 |
return 0; /* inventory objects differ */ |
272 |
|
273 |
/* inventory ok - still need to check rest of this object to see |
274 |
* if it is valid. |
275 |
*/ |
276 |
} |
277 |
|
278 |
/* Don't merge objects that are applied. With the new 'body' code, |
279 |
* it is possible for most any character to have more than one of |
280 |
* some items equipped, and we don't want those to merge. |
281 |
*/ |
282 |
if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED)) |
283 |
return 0; |
284 |
|
285 |
/* Note sure why the following is the case - either the object has to |
286 |
* be animated or have a very low speed. Is this an attempted monster |
287 |
* check? |
288 |
*/ |
289 |
if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
290 |
return 0; |
291 |
|
292 |
switch (ob1->type) |
293 |
{ |
294 |
case SCROLL: |
295 |
if (ob1->level != ob2->level) |
296 |
return 0; |
297 |
break; |
298 |
} |
299 |
|
300 |
if (ob1->key_values || ob2->key_values) |
301 |
{ |
302 |
/* At least one of these has key_values. */ |
303 |
if ((!ob1->key_values) != (!ob2->key_values)) |
304 |
return 0; /* One has fields, but the other one doesn't. */ |
305 |
|
306 |
if (!compare_ob_value_lists (ob1, ob2)) |
307 |
return 0; |
308 |
} |
309 |
|
310 |
if (ob1->self || ob2->self) |
311 |
{ |
312 |
ob1->optimise (); |
313 |
ob2->optimise (); |
314 |
|
315 |
if (ob1->self || ob2->self) |
316 |
{ |
317 |
int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
318 |
int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
319 |
|
320 |
if (k1 != k2) |
321 |
return 0; |
322 |
|
323 |
if (k1 == 0) |
324 |
return 1; |
325 |
|
326 |
if (!cfperl_can_merge (ob1, ob2)) |
327 |
return 0; |
328 |
} |
329 |
} |
330 |
|
331 |
/* Everything passes, must be OK. */ |
332 |
return 1; |
333 |
} |
334 |
|
335 |
// find player who can see this object |
336 |
object * |
337 |
object::visible_to () const |
338 |
{ |
339 |
if (client_visible () && !flag [FLAG_REMOVED]) |
340 |
{ |
341 |
// see if we are in a container of sorts |
342 |
if (env) |
343 |
{ |
344 |
// the player inventory itself is always visible |
345 |
if (env->type == PLAYER) |
346 |
return env; |
347 |
|
348 |
// else a player could have our env open |
349 |
object *envest = env->outer_env (); |
350 |
|
351 |
// the player itself is always on a map, so we will find him here |
352 |
// even if our inv is in a player. |
353 |
if (envest->is_on_map ()) |
354 |
if (object *pl = envest->ms ().player ()) |
355 |
if (pl->container == env) |
356 |
return pl; |
357 |
} |
358 |
else |
359 |
{ |
360 |
// maybe there is a player standing on the same mapspace |
361 |
// this will catch the case where "this" is a player |
362 |
if (object *pl = ms ().player ()) |
363 |
if (!pl->container || this == pl->container) |
364 |
return pl; |
365 |
} |
366 |
} |
367 |
|
368 |
return 0; |
369 |
} |
370 |
|
371 |
// adjust weight per container type ("of holding") |
372 |
static sint32 |
373 |
weight_adjust (object *op, sint32 weight) |
374 |
{ |
375 |
return op->type == CONTAINER |
376 |
? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
377 |
: weight; |
378 |
} |
379 |
|
380 |
/* |
381 |
* adjust_weight(object, weight) adds the specified weight to an object, |
382 |
* and also updates how much the environment(s) is/are carrying. |
383 |
*/ |
384 |
static void |
385 |
adjust_weight (object *op, sint32 weight) |
386 |
{ |
387 |
while (op) |
388 |
{ |
389 |
weight = weight_adjust (op, weight); |
390 |
|
391 |
if (!weight) |
392 |
return; |
393 |
|
394 |
op->carrying += weight; |
395 |
|
396 |
if (object *pl = op->visible_to ()) |
397 |
if (pl != op) // player is handled lazily |
398 |
esrv_update_item (UPD_WEIGHT, pl, op); |
399 |
|
400 |
op = op->env; |
401 |
} |
402 |
} |
403 |
|
404 |
/* |
405 |
* this is a recursive function which calculates the weight |
406 |
* an object is carrying. It goes through op and figures out how much |
407 |
* containers are carrying, and sums it up. |
408 |
*/ |
409 |
void |
410 |
object::update_weight () |
411 |
{ |
412 |
sint32 sum = 0; |
413 |
|
414 |
for (object *op = inv; op; op = op->below) |
415 |
{ |
416 |
if (op->inv) |
417 |
op->update_weight (); |
418 |
|
419 |
sum += op->total_weight (); |
420 |
} |
421 |
|
422 |
sum = weight_adjust (this, sum); |
423 |
|
424 |
if (sum != carrying) |
425 |
{ |
426 |
carrying = sum; |
427 |
|
428 |
if (object *pl = visible_to ()) |
429 |
if (pl != this) // player is handled lazily |
430 |
esrv_update_item (UPD_WEIGHT, pl, this); |
431 |
} |
432 |
} |
433 |
|
434 |
/* |
435 |
* Used by: Server DM commands: dumpbelow, dump. Some error messages. |
436 |
*/ |
437 |
char * |
438 |
dump_object (object *op) |
439 |
{ |
440 |
if (!op) |
441 |
return strdup ("[NULLOBJ]"); |
442 |
|
443 |
object_freezer freezer; |
444 |
op->write (freezer); |
445 |
return freezer.as_string (); |
446 |
} |
447 |
|
448 |
/* |
449 |
* get_nearest_part(multi-object, object 2) returns the part of the |
450 |
* multi-object 1 which is closest to the second object. |
451 |
* If it's not a multi-object, it is returned. |
452 |
*/ |
453 |
object * |
454 |
get_nearest_part (object *op, const object *pl) |
455 |
{ |
456 |
object *tmp, *closest; |
457 |
int last_dist, i; |
458 |
|
459 |
if (!op->more) |
460 |
return op; |
461 |
|
462 |
for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
463 |
tmp; |
464 |
tmp = tmp->more) |
465 |
if ((i = distance (tmp, pl)) < last_dist) |
466 |
closest = tmp, last_dist = i; |
467 |
|
468 |
return closest; |
469 |
} |
470 |
|
471 |
/* |
472 |
* Returns the object which has the count-variable equal to the argument. |
473 |
* VERRRY slow. |
474 |
*/ |
475 |
object * |
476 |
find_object (tag_t i) |
477 |
{ |
478 |
for_all_objects (op) |
479 |
if (op->count == i) |
480 |
return op; |
481 |
|
482 |
return 0; |
483 |
} |
484 |
|
485 |
/* |
486 |
* Returns the first object which has a name equal to the argument. |
487 |
* Used only by the patch command, but not all that useful. |
488 |
* Enables features like "patch <name-of-other-player> food 999" |
489 |
*/ |
490 |
object * |
491 |
find_object_name (const char *str) |
492 |
{ |
493 |
shstr_cmp str_ (str); |
494 |
object *op; |
495 |
|
496 |
for_all_objects (op) |
497 |
if (op->name == str_) |
498 |
break; |
499 |
|
500 |
return op; |
501 |
} |
502 |
|
503 |
/* |
504 |
* Sets the owner and sets the skill and exp pointers to owner's current |
505 |
* skill and experience objects. |
506 |
* ACTUALLY NO! investigate! TODO |
507 |
*/ |
508 |
void |
509 |
object::set_owner (object *owner) |
510 |
{ |
511 |
// allow objects which own objects |
512 |
if (owner) |
513 |
while (owner->owner) |
514 |
owner = owner->owner; |
515 |
|
516 |
if (flag [FLAG_FREED]) |
517 |
{ |
518 |
LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
519 |
return; |
520 |
} |
521 |
|
522 |
this->owner = owner; |
523 |
} |
524 |
|
525 |
int |
526 |
object::slottype () const |
527 |
{ |
528 |
if (type == SKILL) |
529 |
{ |
530 |
if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
531 |
if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
532 |
} |
533 |
else |
534 |
{ |
535 |
if (slot [body_combat].info) return slot_combat; |
536 |
if (slot [body_range ].info) return slot_ranged; |
537 |
} |
538 |
|
539 |
return slot_none; |
540 |
} |
541 |
|
542 |
bool |
543 |
object::change_weapon (object *ob) |
544 |
{ |
545 |
if (current_weapon == ob) |
546 |
return true; |
547 |
|
548 |
if (chosen_skill) |
549 |
chosen_skill->flag [FLAG_APPLIED] = false; |
550 |
|
551 |
current_weapon = ob; |
552 |
chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
553 |
|
554 |
if (chosen_skill) |
555 |
chosen_skill->flag [FLAG_APPLIED] = true; |
556 |
|
557 |
update_stats (); |
558 |
|
559 |
if (ob) |
560 |
{ |
561 |
// now check wether any body locations became invalid, in which case |
562 |
// we cannot apply the weapon at the moment. |
563 |
for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
564 |
if (slot[i].used < 0) |
565 |
{ |
566 |
current_weapon = chosen_skill = 0; |
567 |
update_stats (); |
568 |
|
569 |
new_draw_info_format (NDI_UNIQUE, 0, this, |
570 |
"You try to balance all your items at once, " |
571 |
"but the %s is just too much for your body. " |
572 |
"[You need to unapply some items first.]", &ob->name); |
573 |
return false; |
574 |
} |
575 |
|
576 |
//new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
577 |
} |
578 |
else |
579 |
;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
580 |
|
581 |
if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
582 |
{ |
583 |
LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
584 |
&name, ob->debug_desc ()); |
585 |
return false; |
586 |
} |
587 |
|
588 |
return true; |
589 |
} |
590 |
|
591 |
/* Zero the key_values on op, decrementing the shared-string |
592 |
* refcounts and freeing the links. |
593 |
*/ |
594 |
static void |
595 |
free_key_values (object *op) |
596 |
{ |
597 |
for (key_value *i = op->key_values; i; ) |
598 |
{ |
599 |
key_value *next = i->next; |
600 |
delete i; |
601 |
|
602 |
i = next; |
603 |
} |
604 |
|
605 |
op->key_values = 0; |
606 |
} |
607 |
|
608 |
object & |
609 |
object::operator =(const object &src) |
610 |
{ |
611 |
bool is_freed = flag [FLAG_FREED]; |
612 |
bool is_removed = flag [FLAG_REMOVED]; |
613 |
|
614 |
*(object_copy *)this = src; |
615 |
|
616 |
flag [FLAG_FREED] = is_freed; |
617 |
flag [FLAG_REMOVED] = is_removed; |
618 |
|
619 |
/* Copy over key_values, if any. */ |
620 |
if (src.key_values) |
621 |
{ |
622 |
key_value *tail = 0; |
623 |
key_values = 0; |
624 |
|
625 |
for (key_value *i = src.key_values; i; i = i->next) |
626 |
{ |
627 |
key_value *new_link = new key_value; |
628 |
|
629 |
new_link->next = 0; |
630 |
new_link->key = i->key; |
631 |
new_link->value = i->value; |
632 |
|
633 |
/* Try and be clever here, too. */ |
634 |
if (!key_values) |
635 |
{ |
636 |
key_values = new_link; |
637 |
tail = new_link; |
638 |
} |
639 |
else |
640 |
{ |
641 |
tail->next = new_link; |
642 |
tail = new_link; |
643 |
} |
644 |
} |
645 |
} |
646 |
} |
647 |
|
648 |
/* |
649 |
* copy_to first frees everything allocated by the dst object, |
650 |
* and then copies the contents of itself into the second |
651 |
* object, allocating what needs to be allocated. Basically, any |
652 |
* data that is malloc'd needs to be re-malloc/copied. Otherwise, |
653 |
* if the first object is freed, the pointers in the new object |
654 |
* will point at garbage. |
655 |
*/ |
656 |
void |
657 |
object::copy_to (object *dst) |
658 |
{ |
659 |
*dst = *this; |
660 |
|
661 |
if (speed < 0) |
662 |
dst->speed_left -= rndm (); |
663 |
|
664 |
dst->set_speed (dst->speed); |
665 |
} |
666 |
|
667 |
void |
668 |
object::instantiate () |
669 |
{ |
670 |
if (!uuid.seq) // HACK |
671 |
uuid = UUID::gen (); |
672 |
|
673 |
speed_left = -0.1f; |
674 |
/* copy the body_info to the body_used - this is only really |
675 |
* need for monsters, but doesn't hurt to do it for everything. |
676 |
* by doing so, when a monster is created, it has good starting |
677 |
* values for the body_used info, so when items are created |
678 |
* for it, they can be properly equipped. |
679 |
*/ |
680 |
for (int i = NUM_BODY_LOCATIONS; i--; ) |
681 |
slot[i].used = slot[i].info; |
682 |
|
683 |
attachable::instantiate (); |
684 |
} |
685 |
|
686 |
object * |
687 |
object::clone () |
688 |
{ |
689 |
object *neu = create (); |
690 |
copy_to (neu); |
691 |
return neu; |
692 |
} |
693 |
|
694 |
/* |
695 |
* If an object with the IS_TURNABLE() flag needs to be turned due |
696 |
* to the closest player being on the other side, this function can |
697 |
* be called to update the face variable, _and_ how it looks on the map. |
698 |
*/ |
699 |
void |
700 |
update_turn_face (object *op) |
701 |
{ |
702 |
if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
703 |
return; |
704 |
|
705 |
SET_ANIMATION (op, op->direction); |
706 |
update_object (op, UP_OBJ_FACE); |
707 |
} |
708 |
|
709 |
/* |
710 |
* Updates the speed of an object. If the speed changes from 0 to another |
711 |
* value, or vice versa, then add/remove the object from the active list. |
712 |
* This function needs to be called whenever the speed of an object changes. |
713 |
*/ |
714 |
void |
715 |
object::set_speed (float speed) |
716 |
{ |
717 |
if (flag [FLAG_FREED] && speed) |
718 |
{ |
719 |
LOG (llevError, "Object %s is freed but has speed.\n", &name); |
720 |
speed = 0; |
721 |
} |
722 |
|
723 |
this->speed = speed; |
724 |
|
725 |
if (has_active_speed ()) |
726 |
activate (); |
727 |
else |
728 |
deactivate (); |
729 |
} |
730 |
|
731 |
/* |
732 |
* update_object() updates the the map. |
733 |
* It takes into account invisible objects (and represent squares covered |
734 |
* by invisible objects by whatever is below them (unless it's another |
735 |
* invisible object, etc...) |
736 |
* If the object being updated is beneath a player, the look-window |
737 |
* of that player is updated (this might be a suboptimal way of |
738 |
* updating that window, though, since update_object() is called _often_) |
739 |
* |
740 |
* action is a hint of what the caller believes need to be done. |
741 |
* current action are: |
742 |
* UP_OBJ_INSERT: op was inserted |
743 |
* UP_OBJ_REMOVE: op was removed |
744 |
* UP_OBJ_CHANGE: object has somehow changed. In this case, we always update |
745 |
* as that is easier than trying to look at what may have changed. |
746 |
* UP_OBJ_FACE: only the objects face has changed. |
747 |
*/ |
748 |
void |
749 |
update_object (object *op, int action) |
750 |
{ |
751 |
if (!op) |
752 |
{ |
753 |
/* this should never happen */ |
754 |
LOG (llevError | logBacktrace, "update_object() called for NULL object.\n"); |
755 |
return; |
756 |
} |
757 |
|
758 |
if (!op->is_on_map ()) |
759 |
{ |
760 |
/* Animation is currently handled by client, so nothing |
761 |
* to do in this case. |
762 |
*/ |
763 |
return; |
764 |
} |
765 |
|
766 |
/* make sure the object is within map boundaries */ |
767 |
if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
768 |
{ |
769 |
LOG (llevError, "update_object() called for object out of map!\n"); |
770 |
#ifdef MANY_CORES |
771 |
abort (); |
772 |
#endif |
773 |
return; |
774 |
} |
775 |
|
776 |
mapspace &m = op->ms (); |
777 |
|
778 |
if (!(m.flags_ & P_UPTODATE)) |
779 |
/* nop */; |
780 |
else if (action == UP_OBJ_INSERT) |
781 |
{ |
782 |
// this is likely overkill, TODO: revisit (schmorp) |
783 |
if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
784 |
|| (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
785 |
|| (op->type == PLAYER && !(m.flags_ & P_PLAYER)) |
786 |
|| (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
787 |
|| (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
788 |
|| (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
789 |
|| (m.move_on | op->move_on ) != m.move_on |
790 |
|| (m.move_off | op->move_off ) != m.move_off |
791 |
|| (m.move_slow | op->move_slow) != m.move_slow |
792 |
/* This isn't perfect, but I don't expect a lot of objects to |
793 |
* to have move_allow right now. |
794 |
*/ |
795 |
|| ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
796 |
|| 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
797 |
m.flags_ = 0; |
798 |
} |
799 |
/* if the object is being removed, we can't make intelligent |
800 |
* decisions, because remove_ob can't really pass the object |
801 |
* that is being removed. |
802 |
*/ |
803 |
else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
804 |
m.flags_ = 0; |
805 |
else if (action == UP_OBJ_FACE) |
806 |
/* Nothing to do for that case */ ; |
807 |
else |
808 |
LOG (llevError, "update_object called with invalid action: %d\n", action); |
809 |
|
810 |
if (op->more) |
811 |
update_object (op->more, action); |
812 |
} |
813 |
|
814 |
object::object () |
815 |
{ |
816 |
SET_FLAG (this, FLAG_REMOVED); |
817 |
|
818 |
expmul = 1.0; |
819 |
face = blank_face; |
820 |
} |
821 |
|
822 |
object::~object () |
823 |
{ |
824 |
unlink (); |
825 |
|
826 |
free_key_values (this); |
827 |
} |
828 |
|
829 |
static int object_count; |
830 |
|
831 |
void object::link () |
832 |
{ |
833 |
assert (!index);//D |
834 |
uuid = UUID::gen (); |
835 |
count = ++object_count; |
836 |
|
837 |
refcnt_inc (); |
838 |
objects.insert (this); |
839 |
} |
840 |
|
841 |
void object::unlink () |
842 |
{ |
843 |
if (!index) |
844 |
return; |
845 |
|
846 |
objects.erase (this); |
847 |
refcnt_dec (); |
848 |
} |
849 |
|
850 |
void |
851 |
object::activate () |
852 |
{ |
853 |
/* If already on active list, don't do anything */ |
854 |
if (active) |
855 |
return; |
856 |
|
857 |
if (has_active_speed ()) |
858 |
actives.insert (this); |
859 |
} |
860 |
|
861 |
void |
862 |
object::activate_recursive () |
863 |
{ |
864 |
activate (); |
865 |
|
866 |
for (object *op = inv; op; op = op->below) |
867 |
op->activate_recursive (); |
868 |
} |
869 |
|
870 |
/* This function removes object 'op' from the list of active |
871 |
* objects. |
872 |
* This should only be used for style maps or other such |
873 |
* reference maps where you don't want an object that isn't |
874 |
* in play chewing up cpu time getting processed. |
875 |
* The reverse of this is to call update_ob_speed, which |
876 |
* will do the right thing based on the speed of the object. |
877 |
*/ |
878 |
void |
879 |
object::deactivate () |
880 |
{ |
881 |
/* If not on the active list, nothing needs to be done */ |
882 |
if (!active) |
883 |
return; |
884 |
|
885 |
actives.erase (this); |
886 |
} |
887 |
|
888 |
void |
889 |
object::deactivate_recursive () |
890 |
{ |
891 |
for (object *op = inv; op; op = op->below) |
892 |
op->deactivate_recursive (); |
893 |
|
894 |
deactivate (); |
895 |
} |
896 |
|
897 |
void |
898 |
object::set_flag_inv (int flag, int value) |
899 |
{ |
900 |
for (object *op = inv; op; op = op->below) |
901 |
{ |
902 |
op->flag [flag] = value; |
903 |
op->set_flag_inv (flag, value); |
904 |
} |
905 |
} |
906 |
|
907 |
/* |
908 |
* Remove and free all objects in the inventory of the given object. |
909 |
* object.c ? |
910 |
*/ |
911 |
void |
912 |
object::destroy_inv (bool drop_to_ground) |
913 |
{ |
914 |
// need to check first, because the checks below might segfault |
915 |
// as we might be on an invalid mapspace and crossfire code |
916 |
// is too buggy to ensure that the inventory is empty. |
917 |
// corollary: if you create arrows etc. with stuff in its inventory, |
918 |
// cf will crash below with off-map x and y |
919 |
if (!inv) |
920 |
return; |
921 |
|
922 |
/* Only if the space blocks everything do we not process - |
923 |
* if some form of movement is allowed, let objects |
924 |
* drop on that space. |
925 |
*/ |
926 |
if (!drop_to_ground |
927 |
|| !map |
928 |
|| map->in_memory != MAP_ACTIVE |
929 |
|| map->nodrop |
930 |
|| ms ().move_block == MOVE_ALL) |
931 |
{ |
932 |
while (inv) |
933 |
{ |
934 |
inv->destroy_inv (false); |
935 |
inv->destroy (); |
936 |
} |
937 |
} |
938 |
else |
939 |
{ /* Put objects in inventory onto this space */ |
940 |
while (inv) |
941 |
{ |
942 |
object *op = inv; |
943 |
|
944 |
if (op->flag [FLAG_STARTEQUIP] |
945 |
|| op->flag [FLAG_NO_DROP] |
946 |
|| op->type == RUNE |
947 |
|| op->type == TRAP |
948 |
|| op->flag [FLAG_IS_A_TEMPLATE] |
949 |
|| op->flag [FLAG_DESTROY_ON_DEATH]) |
950 |
op->destroy (true); |
951 |
else |
952 |
map->insert (op, x, y); |
953 |
} |
954 |
} |
955 |
} |
956 |
|
957 |
object *object::create () |
958 |
{ |
959 |
object *op = new object; |
960 |
op->link (); |
961 |
return op; |
962 |
} |
963 |
|
964 |
static struct freed_map : maptile |
965 |
{ |
966 |
freed_map () |
967 |
{ |
968 |
path = "<freed objects map>"; |
969 |
name = "/internal/freed_objects_map"; |
970 |
width = 3; |
971 |
height = 3; |
972 |
nodrop = 1; |
973 |
|
974 |
alloc (); |
975 |
in_memory = MAP_ACTIVE; |
976 |
} |
977 |
} freed_map; // freed objects are moved here to avoid crashes |
978 |
|
979 |
void |
980 |
object::do_destroy () |
981 |
{ |
982 |
if (flag [FLAG_IS_LINKED]) |
983 |
remove_button_link (this); |
984 |
|
985 |
if (flag [FLAG_FRIENDLY]) |
986 |
remove_friendly_object (this); |
987 |
|
988 |
remove (); |
989 |
|
990 |
attachable::do_destroy (); |
991 |
|
992 |
deactivate (); |
993 |
unlink (); |
994 |
|
995 |
flag [FLAG_FREED] = 1; |
996 |
|
997 |
// hack to ensure that freed objects still have a valid map |
998 |
map = &freed_map; |
999 |
x = 1; |
1000 |
y = 1; |
1001 |
|
1002 |
if (more) |
1003 |
{ |
1004 |
more->destroy (); |
1005 |
more = 0; |
1006 |
} |
1007 |
|
1008 |
head = 0; |
1009 |
|
1010 |
// clear those pointers that likely might cause circular references |
1011 |
owner = 0; |
1012 |
enemy = 0; |
1013 |
attacked_by = 0; |
1014 |
current_weapon = 0; |
1015 |
} |
1016 |
|
1017 |
void |
1018 |
object::destroy (bool destroy_inventory) |
1019 |
{ |
1020 |
if (destroyed ()) |
1021 |
return; |
1022 |
|
1023 |
if (!is_head () && !head->destroyed ()) |
1024 |
{ |
1025 |
LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1026 |
head->destroy (destroy_inventory); |
1027 |
return; |
1028 |
} |
1029 |
|
1030 |
destroy_inv (!destroy_inventory); |
1031 |
|
1032 |
if (is_head ()) |
1033 |
if (sound_destroy) |
1034 |
play_sound (sound_destroy); |
1035 |
else if (flag [FLAG_MONSTER]) |
1036 |
play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
1037 |
|
1038 |
attachable::destroy (); |
1039 |
} |
1040 |
|
1041 |
/* op->remove (): |
1042 |
* This function removes the object op from the linked list of objects |
1043 |
* which it is currently tied to. When this function is done, the |
1044 |
* object will have no environment. If the object previously had an |
1045 |
* environment, the x and y coordinates will be updated to |
1046 |
* the previous environment. |
1047 |
*/ |
1048 |
void |
1049 |
object::do_remove () |
1050 |
{ |
1051 |
object *tmp, *last = 0; |
1052 |
object *otmp; |
1053 |
|
1054 |
if (flag [FLAG_REMOVED]) |
1055 |
return; |
1056 |
|
1057 |
INVOKE_OBJECT (REMOVE, this); |
1058 |
|
1059 |
flag [FLAG_REMOVED] = true; |
1060 |
|
1061 |
if (more) |
1062 |
more->remove (); |
1063 |
|
1064 |
/* |
1065 |
* In this case, the object to be removed is in someones |
1066 |
* inventory. |
1067 |
*/ |
1068 |
if (env) |
1069 |
{ |
1070 |
flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1071 |
if (object *pl = visible_to ()) |
1072 |
esrv_del_item (pl->contr, count); |
1073 |
flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1074 |
|
1075 |
adjust_weight (env, -total_weight ()); |
1076 |
|
1077 |
*(above ? &above->below : &env->inv) = below; |
1078 |
|
1079 |
if (below) |
1080 |
below->above = above; |
1081 |
|
1082 |
/* we set up values so that it could be inserted into |
1083 |
* the map, but we don't actually do that - it is up |
1084 |
* to the caller to decide what we want to do. |
1085 |
*/ |
1086 |
map = env->map; |
1087 |
x = env->x; |
1088 |
y = env->y; |
1089 |
above = 0; |
1090 |
below = 0; |
1091 |
env = 0; |
1092 |
|
1093 |
/* NO_FIX_PLAYER is set when a great many changes are being |
1094 |
* made to players inventory. If set, avoiding the call |
1095 |
* to save cpu time. |
1096 |
*/ |
1097 |
if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1098 |
otmp->update_stats (); |
1099 |
} |
1100 |
else if (map) |
1101 |
{ |
1102 |
map->dirty = true; |
1103 |
mapspace &ms = this->ms (); |
1104 |
|
1105 |
if (object *pl = ms.player ()) |
1106 |
{ |
1107 |
if (type == PLAYER) // this == pl(!) |
1108 |
{ |
1109 |
// leaving a spot always closes any open container on the ground |
1110 |
if (container && !container->env) |
1111 |
// this causes spurious floorbox updates, but it ensures |
1112 |
// that the CLOSE event is being sent. |
1113 |
close_container (); |
1114 |
|
1115 |
--map->players; |
1116 |
map->touch (); |
1117 |
} |
1118 |
else if (pl->container == this) |
1119 |
{ |
1120 |
// removing a container should close it |
1121 |
close_container (); |
1122 |
} |
1123 |
|
1124 |
esrv_del_item (pl->contr, count); |
1125 |
} |
1126 |
|
1127 |
/* link the object above us */ |
1128 |
if (above) |
1129 |
above->below = below; |
1130 |
else |
1131 |
ms.top = below; /* we were top, set new top */ |
1132 |
|
1133 |
/* Relink the object below us, if there is one */ |
1134 |
if (below) |
1135 |
below->above = above; |
1136 |
else |
1137 |
{ |
1138 |
/* Nothing below, which means we need to relink map object for this space |
1139 |
* use translated coordinates in case some oddness with map tiling is |
1140 |
* evident |
1141 |
*/ |
1142 |
if (GET_MAP_OB (map, x, y) != this) |
1143 |
LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ()); |
1144 |
|
1145 |
ms.bot = above; /* goes on above it. */ |
1146 |
} |
1147 |
|
1148 |
above = 0; |
1149 |
below = 0; |
1150 |
|
1151 |
if (map->in_memory == MAP_SAVING) |
1152 |
return; |
1153 |
|
1154 |
int check_walk_off = !flag [FLAG_NO_APPLY]; |
1155 |
|
1156 |
if (object *pl = ms.player ()) |
1157 |
{ |
1158 |
if (pl->container == this) |
1159 |
/* If a container that the player is currently using somehow gets |
1160 |
* removed (most likely destroyed), update the player view |
1161 |
* appropriately. |
1162 |
*/ |
1163 |
pl->close_container (); |
1164 |
|
1165 |
//TODO: the floorbox prev/next might need updating |
1166 |
esrv_del_item (pl->contr, count); |
1167 |
} |
1168 |
|
1169 |
for (tmp = ms.bot; tmp; tmp = tmp->above) |
1170 |
{ |
1171 |
/* No point updating the players look faces if he is the object |
1172 |
* being removed. |
1173 |
*/ |
1174 |
|
1175 |
/* See if object moving off should effect something */ |
1176 |
if (check_walk_off |
1177 |
&& ((move_type & tmp->move_off) |
1178 |
&& (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1179 |
{ |
1180 |
move_apply (tmp, this, 0); |
1181 |
|
1182 |
if (destroyed ()) |
1183 |
LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1184 |
} |
1185 |
|
1186 |
last = tmp; |
1187 |
} |
1188 |
|
1189 |
/* last == NULL if there are no objects on this space */ |
1190 |
//TODO: this makes little sense, why only update the topmost object? |
1191 |
if (!last) |
1192 |
map->at (x, y).flags_ = 0; |
1193 |
else |
1194 |
update_object (last, UP_OBJ_REMOVE); |
1195 |
|
1196 |
if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1197 |
update_all_los (map, x, y); |
1198 |
} |
1199 |
} |
1200 |
|
1201 |
/* |
1202 |
* merge_ob(op,top): |
1203 |
* |
1204 |
* This function goes through all objects below and including top, and |
1205 |
* merges op to the first matching object. |
1206 |
* If top is NULL, it is calculated. |
1207 |
* Returns pointer to object if it succeded in the merge, otherwise NULL |
1208 |
*/ |
1209 |
object * |
1210 |
merge_ob (object *op, object *top) |
1211 |
{ |
1212 |
if (!op->nrof) |
1213 |
return 0; |
1214 |
|
1215 |
if (!top) |
1216 |
for (top = op; top && top->above; top = top->above) |
1217 |
; |
1218 |
|
1219 |
for (; top; top = top->below) |
1220 |
if (object::can_merge (op, top)) |
1221 |
{ |
1222 |
top->nrof += op->nrof; |
1223 |
|
1224 |
if (object *pl = top->visible_to ()) |
1225 |
esrv_update_item (UPD_NROF, pl, top); |
1226 |
|
1227 |
op->weight = 0; // cancel the addition above |
1228 |
op->carrying = 0; // must be 0 already |
1229 |
|
1230 |
op->destroy (1); |
1231 |
|
1232 |
return top; |
1233 |
} |
1234 |
|
1235 |
return 0; |
1236 |
} |
1237 |
|
1238 |
void |
1239 |
object::expand_tail () |
1240 |
{ |
1241 |
if (more) |
1242 |
return; |
1243 |
|
1244 |
object *prev = this; |
1245 |
|
1246 |
for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1247 |
{ |
1248 |
object *op = arch_to_object (at); |
1249 |
|
1250 |
op->name = name; |
1251 |
op->name_pl = name_pl; |
1252 |
op->title = title; |
1253 |
|
1254 |
op->head = this; |
1255 |
prev->more = op; |
1256 |
|
1257 |
prev = op; |
1258 |
} |
1259 |
} |
1260 |
|
1261 |
/* |
1262 |
* same as insert_ob_in_map except it handles separate coordinates and does a clean |
1263 |
* job preparing multi-part monsters. |
1264 |
*/ |
1265 |
object * |
1266 |
insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1267 |
{ |
1268 |
for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1269 |
{ |
1270 |
tmp->x = x + tmp->arch->x; |
1271 |
tmp->y = y + tmp->arch->y; |
1272 |
} |
1273 |
|
1274 |
return insert_ob_in_map (op, m, originator, flag); |
1275 |
} |
1276 |
|
1277 |
/* |
1278 |
* insert_ob_in_map (op, map, originator, flag): |
1279 |
* This function inserts the object in the two-way linked list |
1280 |
* which represents what is on a map. |
1281 |
* The second argument specifies the map, and the x and y variables |
1282 |
* in the object about to be inserted specifies the position. |
1283 |
* |
1284 |
* originator: Player, monster or other object that caused 'op' to be inserted |
1285 |
* into 'map'. May be NULL. |
1286 |
* |
1287 |
* flag is a bitmask about special things to do (or not do) when this |
1288 |
* function is called. see the object.h file for the INS_ values. |
1289 |
* Passing 0 for flag gives proper default values, so flag really only needs |
1290 |
* to be set if special handling is needed. |
1291 |
* |
1292 |
* Return value: |
1293 |
* new object if 'op' was merged with other object |
1294 |
* NULL if 'op' was destroyed |
1295 |
* just 'op' otherwise |
1296 |
*/ |
1297 |
object * |
1298 |
insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1299 |
{ |
1300 |
assert (!op->flag [FLAG_FREED]); |
1301 |
|
1302 |
op->remove (); |
1303 |
|
1304 |
/* Ideally, the caller figures this out. However, it complicates a lot |
1305 |
* of areas of callers (eg, anything that uses find_free_spot would now |
1306 |
* need extra work |
1307 |
*/ |
1308 |
if (!xy_normalise (m, op->x, op->y)) |
1309 |
{ |
1310 |
op->destroy (1); |
1311 |
return 0; |
1312 |
} |
1313 |
|
1314 |
if (object *more = op->more) |
1315 |
if (!insert_ob_in_map (more, m, originator, flag)) |
1316 |
return 0; |
1317 |
|
1318 |
CLEAR_FLAG (op, FLAG_REMOVED); |
1319 |
|
1320 |
op->map = m; |
1321 |
mapspace &ms = op->ms (); |
1322 |
|
1323 |
/* this has to be done after we translate the coordinates. |
1324 |
*/ |
1325 |
if (op->nrof && !(flag & INS_NO_MERGE)) |
1326 |
for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1327 |
if (object::can_merge (op, tmp)) |
1328 |
{ |
1329 |
// TODO: we atcually want to update tmp, not op, |
1330 |
// but some caller surely breaks when we return tmp |
1331 |
// from here :/ |
1332 |
op->nrof += tmp->nrof; |
1333 |
tmp->destroy (1); |
1334 |
} |
1335 |
|
1336 |
CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1337 |
CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1338 |
|
1339 |
if (!QUERY_FLAG (op, FLAG_ALIVE)) |
1340 |
CLEAR_FLAG (op, FLAG_NO_STEAL); |
1341 |
|
1342 |
if (flag & INS_BELOW_ORIGINATOR) |
1343 |
{ |
1344 |
if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1345 |
{ |
1346 |
LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1347 |
abort (); |
1348 |
} |
1349 |
|
1350 |
op->above = originator; |
1351 |
op->below = originator->below; |
1352 |
|
1353 |
if (op->below) |
1354 |
op->below->above = op; |
1355 |
else |
1356 |
ms.bot = op; |
1357 |
|
1358 |
/* since *below* originator, no need to update top */ |
1359 |
originator->below = op; |
1360 |
} |
1361 |
else |
1362 |
{ |
1363 |
object *top, *floor = NULL; |
1364 |
|
1365 |
top = ms.bot; |
1366 |
|
1367 |
/* If there are other objects, then */ |
1368 |
if (top) |
1369 |
{ |
1370 |
object *last = 0; |
1371 |
|
1372 |
/* |
1373 |
* If there are multiple objects on this space, we do some trickier handling. |
1374 |
* We've already dealt with merging if appropriate. |
1375 |
* Generally, we want to put the new object on top. But if |
1376 |
* flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1377 |
* floor, we want to insert above that and no further. |
1378 |
* Also, if there are spell objects on this space, we stop processing |
1379 |
* once we get to them. This reduces the need to traverse over all of |
1380 |
* them when adding another one - this saves quite a bit of cpu time |
1381 |
* when lots of spells are cast in one area. Currently, it is presumed |
1382 |
* that flying non pickable objects are spell objects. |
1383 |
*/ |
1384 |
for (top = ms.bot; top; top = top->above) |
1385 |
{ |
1386 |
if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1387 |
floor = top; |
1388 |
|
1389 |
if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1390 |
{ |
1391 |
/* We insert above top, so we want this object below this */ |
1392 |
top = top->below; |
1393 |
break; |
1394 |
} |
1395 |
|
1396 |
last = top; |
1397 |
} |
1398 |
|
1399 |
/* Don't want top to be NULL, so set it to the last valid object */ |
1400 |
top = last; |
1401 |
|
1402 |
/* We let update_position deal with figuring out what the space |
1403 |
* looks like instead of lots of conditions here. |
1404 |
* makes things faster, and effectively the same result. |
1405 |
*/ |
1406 |
|
1407 |
/* Have object 'fall below' other objects that block view. |
1408 |
* Unless those objects are exits. |
1409 |
* If INS_ON_TOP is used, don't do this processing |
1410 |
* Need to find the object that in fact blocks view, otherwise |
1411 |
* stacking is a bit odd. |
1412 |
*/ |
1413 |
if (!(flag & INS_ON_TOP) |
1414 |
&& ms.flags () & P_BLOCKSVIEW |
1415 |
&& (op->face && !faces [op->face].visibility)) |
1416 |
{ |
1417 |
for (last = top; last != floor; last = last->below) |
1418 |
if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1419 |
break; |
1420 |
|
1421 |
/* Check to see if we found the object that blocks view, |
1422 |
* and make sure we have a below pointer for it so that |
1423 |
* we can get inserted below this one, which requires we |
1424 |
* set top to the object below us. |
1425 |
*/ |
1426 |
if (last && last->below && last != floor) |
1427 |
top = last->below; |
1428 |
} |
1429 |
} /* If objects on this space */ |
1430 |
|
1431 |
if (flag & INS_ABOVE_FLOOR_ONLY) |
1432 |
top = floor; |
1433 |
|
1434 |
/* Top is the object that our object (op) is going to get inserted above. |
1435 |
*/ |
1436 |
|
1437 |
/* First object on this space */ |
1438 |
if (!top) |
1439 |
{ |
1440 |
op->above = ms.bot; |
1441 |
|
1442 |
if (op->above) |
1443 |
op->above->below = op; |
1444 |
|
1445 |
op->below = 0; |
1446 |
ms.bot = op; |
1447 |
} |
1448 |
else |
1449 |
{ /* get inserted into the stack above top */ |
1450 |
op->above = top->above; |
1451 |
|
1452 |
if (op->above) |
1453 |
op->above->below = op; |
1454 |
|
1455 |
op->below = top; |
1456 |
top->above = op; |
1457 |
} |
1458 |
|
1459 |
if (!op->above) |
1460 |
ms.top = op; |
1461 |
} /* else not INS_BELOW_ORIGINATOR */ |
1462 |
|
1463 |
if (op->type == PLAYER) |
1464 |
{ |
1465 |
op->contr->do_los = 1; |
1466 |
++op->map->players; |
1467 |
op->map->touch (); |
1468 |
} |
1469 |
|
1470 |
op->map->dirty = true; |
1471 |
|
1472 |
if (object *pl = ms.player ()) |
1473 |
//TODO: the floorbox prev/next might need updating |
1474 |
esrv_send_item (pl, op); |
1475 |
|
1476 |
/* If this object glows, it may affect lighting conditions that are |
1477 |
* visible to others on this map. But update_all_los is really |
1478 |
* an inefficient way to do this, as it means los for all players |
1479 |
* on the map will get recalculated. The players could very well |
1480 |
* be far away from this change and not affected in any way - |
1481 |
* this should get redone to only look for players within range, |
1482 |
* or just updating the P_UPTODATE for spaces within this area |
1483 |
* of effect may be sufficient. |
1484 |
*/ |
1485 |
if (op->map->darkness && (op->glow_radius != 0)) |
1486 |
update_all_los (op->map, op->x, op->y); |
1487 |
|
1488 |
/* updates flags (blocked, alive, no magic, etc) for this map space */ |
1489 |
update_object (op, UP_OBJ_INSERT); |
1490 |
|
1491 |
INVOKE_OBJECT (INSERT, op); |
1492 |
|
1493 |
/* Don't know if moving this to the end will break anything. However, |
1494 |
* we want to have floorbox_update called before calling this. |
1495 |
* |
1496 |
* check_move_on() must be after this because code called from |
1497 |
* check_move_on() depends on correct map flags (so functions like |
1498 |
* blocked() and wall() work properly), and these flags are updated by |
1499 |
* update_object(). |
1500 |
*/ |
1501 |
|
1502 |
/* if this is not the head or flag has been passed, don't check walk on status */ |
1503 |
if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1504 |
{ |
1505 |
if (check_move_on (op, originator)) |
1506 |
return 0; |
1507 |
|
1508 |
/* If we are a multi part object, lets work our way through the check |
1509 |
* walk on's. |
1510 |
*/ |
1511 |
for (object *tmp = op->more; tmp; tmp = tmp->more) |
1512 |
if (check_move_on (tmp, originator)) |
1513 |
return 0; |
1514 |
} |
1515 |
|
1516 |
return op; |
1517 |
} |
1518 |
|
1519 |
/* this function inserts an object in the map, but if it |
1520 |
* finds an object of its own type, it'll remove that one first. |
1521 |
* op is the object to insert it under: supplies x and the map. |
1522 |
*/ |
1523 |
void |
1524 |
replace_insert_ob_in_map (const char *arch_string, object *op) |
1525 |
{ |
1526 |
/* first search for itself and remove any old instances */ |
1527 |
|
1528 |
for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1529 |
if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1530 |
tmp->destroy (1); |
1531 |
|
1532 |
object *tmp = arch_to_object (archetype::find (arch_string)); |
1533 |
|
1534 |
tmp->x = op->x; |
1535 |
tmp->y = op->y; |
1536 |
|
1537 |
insert_ob_in_map (tmp, op->map, op, 0); |
1538 |
} |
1539 |
|
1540 |
object * |
1541 |
object::insert_at (object *where, object *originator, int flags) |
1542 |
{ |
1543 |
if (where->env) |
1544 |
return where->env->insert (this); |
1545 |
else |
1546 |
return where->map->insert (this, where->x, where->y, originator, flags); |
1547 |
} |
1548 |
|
1549 |
/* |
1550 |
* decrease(object, number) decreases a specified number from |
1551 |
* the amount of an object. If the amount reaches 0, the object |
1552 |
* is subsequently removed and freed. |
1553 |
* |
1554 |
* Return value: 'op' if something is left, NULL if the amount reached 0 |
1555 |
*/ |
1556 |
bool |
1557 |
object::decrease (sint32 nr) |
1558 |
{ |
1559 |
if (!nr) |
1560 |
return true; |
1561 |
|
1562 |
nr = min (nr, nrof); |
1563 |
|
1564 |
nrof -= nr; |
1565 |
|
1566 |
if (nrof) |
1567 |
{ |
1568 |
adjust_weight (env, -weight * nr); // carrying == 0 |
1569 |
|
1570 |
if (object *pl = visible_to ()) |
1571 |
esrv_update_item (UPD_NROF, pl, this); |
1572 |
|
1573 |
return true; |
1574 |
} |
1575 |
else |
1576 |
{ |
1577 |
destroy (1); |
1578 |
return false; |
1579 |
} |
1580 |
} |
1581 |
|
1582 |
/* |
1583 |
* split(ob,nr) splits up ob into two parts. The part which |
1584 |
* is returned contains nr objects, and the remaining parts contains |
1585 |
* the rest (or is removed and returned if that number is 0). |
1586 |
* On failure, NULL is returned. |
1587 |
*/ |
1588 |
object * |
1589 |
object::split (sint32 nr) |
1590 |
{ |
1591 |
int have = number_of (); |
1592 |
|
1593 |
if (have < nr) |
1594 |
return 0; |
1595 |
else if (have == nr) |
1596 |
{ |
1597 |
remove (); |
1598 |
return this; |
1599 |
} |
1600 |
else |
1601 |
{ |
1602 |
decrease (nr); |
1603 |
|
1604 |
object *op = object_create_clone (this); |
1605 |
op->nrof = nr; |
1606 |
return op; |
1607 |
} |
1608 |
} |
1609 |
|
1610 |
object * |
1611 |
insert_ob_in_ob (object *op, object *where) |
1612 |
{ |
1613 |
if (!where) |
1614 |
{ |
1615 |
char *dump = dump_object (op); |
1616 |
LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1617 |
free (dump); |
1618 |
return op; |
1619 |
} |
1620 |
|
1621 |
if (where->head_ () != where) |
1622 |
{ |
1623 |
LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1624 |
where = where->head; |
1625 |
} |
1626 |
|
1627 |
return where->insert (op); |
1628 |
} |
1629 |
|
1630 |
/* |
1631 |
* env->insert (op) |
1632 |
* This function inserts the object op in the linked list |
1633 |
* inside the object environment. |
1634 |
* |
1635 |
* The function returns now pointer to inserted item, and return value can |
1636 |
* be != op, if items are merged. -Tero |
1637 |
*/ |
1638 |
object * |
1639 |
object::insert (object *op) |
1640 |
{ |
1641 |
if (op->more) |
1642 |
{ |
1643 |
LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1644 |
return op; |
1645 |
} |
1646 |
|
1647 |
op->remove (); |
1648 |
|
1649 |
op->flag [FLAG_OBJ_ORIGINAL] = 0; |
1650 |
|
1651 |
if (op->nrof) |
1652 |
for (object *tmp = inv; tmp; tmp = tmp->below) |
1653 |
if (object::can_merge (tmp, op)) |
1654 |
{ |
1655 |
/* return the original object and remove inserted object |
1656 |
(client needs the original object) */ |
1657 |
tmp->nrof += op->nrof; |
1658 |
|
1659 |
if (object *pl = tmp->visible_to ()) |
1660 |
esrv_update_item (UPD_NROF, pl, tmp); |
1661 |
|
1662 |
adjust_weight (this, op->total_weight ()); |
1663 |
|
1664 |
op->destroy (1); |
1665 |
op = tmp; |
1666 |
goto inserted; |
1667 |
} |
1668 |
|
1669 |
op->owner = 0; // it's his/hers now. period. |
1670 |
op->map = 0; |
1671 |
op->x = 0; |
1672 |
op->y = 0; |
1673 |
|
1674 |
op->above = 0; |
1675 |
op->below = inv; |
1676 |
op->env = this; |
1677 |
|
1678 |
if (inv) |
1679 |
inv->above = op; |
1680 |
|
1681 |
inv = op; |
1682 |
|
1683 |
op->flag [FLAG_REMOVED] = 0; |
1684 |
|
1685 |
if (object *pl = op->visible_to ()) |
1686 |
esrv_send_item (pl, op); |
1687 |
|
1688 |
adjust_weight (this, op->total_weight ()); |
1689 |
|
1690 |
inserted: |
1691 |
/* reset the light list and los of the players on the map */ |
1692 |
if (op->glow_radius && map && map->darkness) |
1693 |
update_all_los (map, x, y); |
1694 |
|
1695 |
// if this is a player's inventory, update stats |
1696 |
if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER]) |
1697 |
update_stats (); |
1698 |
|
1699 |
INVOKE_OBJECT (INSERT, this); |
1700 |
|
1701 |
return op; |
1702 |
} |
1703 |
|
1704 |
/* |
1705 |
* Checks if any objects has a move_type that matches objects |
1706 |
* that effect this object on this space. Call apply() to process |
1707 |
* these events. |
1708 |
* |
1709 |
* Any speed-modification due to SLOW_MOVE() of other present objects |
1710 |
* will affect the speed_left of the object. |
1711 |
* |
1712 |
* originator: Player, monster or other object that caused 'op' to be inserted |
1713 |
* into 'map'. May be NULL. |
1714 |
* |
1715 |
* Return value: 1 if 'op' was destroyed, 0 otherwise. |
1716 |
* |
1717 |
* 4-21-95 added code to check if appropriate skill was readied - this will |
1718 |
* permit faster movement by the player through this terrain. -b.t. |
1719 |
* |
1720 |
* MSW 2001-07-08: Check all objects on space, not just those below |
1721 |
* object being inserted. insert_ob_in_map may not put new objects |
1722 |
* on top. |
1723 |
*/ |
1724 |
int |
1725 |
check_move_on (object *op, object *originator) |
1726 |
{ |
1727 |
object *tmp; |
1728 |
maptile *m = op->map; |
1729 |
int x = op->x, y = op->y; |
1730 |
|
1731 |
MoveType move_on, move_slow, move_block; |
1732 |
|
1733 |
if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1734 |
return 0; |
1735 |
|
1736 |
move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1737 |
move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1738 |
move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1739 |
|
1740 |
/* if nothing on this space will slow op down or be applied, |
1741 |
* no need to do checking below. have to make sure move_type |
1742 |
* is set, as lots of objects don't have it set - we treat that |
1743 |
* as walking. |
1744 |
*/ |
1745 |
if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow)) |
1746 |
return 0; |
1747 |
|
1748 |
/* This is basically inverse logic of that below - basically, |
1749 |
* if the object can avoid the move on or slow move, they do so, |
1750 |
* but can't do it if the alternate movement they are using is |
1751 |
* blocked. Logic on this seems confusing, but does seem correct. |
1752 |
*/ |
1753 |
if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0) |
1754 |
return 0; |
1755 |
|
1756 |
/* The objects have to be checked from top to bottom. |
1757 |
* Hence, we first go to the top: |
1758 |
*/ |
1759 |
|
1760 |
for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
1761 |
{ |
1762 |
/* Trim the search when we find the first other spell effect |
1763 |
* this helps performance so that if a space has 50 spell objects, |
1764 |
* we don't need to check all of them. |
1765 |
*/ |
1766 |
if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK)) |
1767 |
break; |
1768 |
} |
1769 |
|
1770 |
for (; tmp; tmp = tmp->below) |
1771 |
{ |
1772 |
if (tmp == op) |
1773 |
continue; /* Can't apply yourself */ |
1774 |
|
1775 |
/* Check to see if one of the movement types should be slowed down. |
1776 |
* Second check makes sure that the movement types not being slowed |
1777 |
* (~slow_move) is not blocked on this space - just because the |
1778 |
* space doesn't slow down swimming (for example), if you can't actually |
1779 |
* swim on that space, can't use it to avoid the penalty. |
1780 |
*/ |
1781 |
if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1782 |
{ |
1783 |
if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1784 |
((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1785 |
{ |
1786 |
|
1787 |
float |
1788 |
diff = tmp->move_slow_penalty * fabs (op->speed); |
1789 |
|
1790 |
if (op->type == PLAYER) |
1791 |
if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1792 |
(QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1793 |
diff /= 4.0; |
1794 |
|
1795 |
op->speed_left -= diff; |
1796 |
} |
1797 |
} |
1798 |
|
1799 |
/* Basically same logic as above, except now for actual apply. */ |
1800 |
if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1801 |
((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1802 |
{ |
1803 |
move_apply (tmp, op, originator); |
1804 |
|
1805 |
if (op->destroyed ()) |
1806 |
return 1; |
1807 |
|
1808 |
/* what the person/creature stepped onto has moved the object |
1809 |
* someplace new. Don't process any further - if we did, |
1810 |
* have a feeling strange problems would result. |
1811 |
*/ |
1812 |
if (op->map != m || op->x != x || op->y != y) |
1813 |
return 0; |
1814 |
} |
1815 |
} |
1816 |
|
1817 |
return 0; |
1818 |
} |
1819 |
|
1820 |
/* |
1821 |
* present_arch(arch, map, x, y) searches for any objects with |
1822 |
* a matching archetype at the given map and coordinates. |
1823 |
* The first matching object is returned, or NULL if none. |
1824 |
*/ |
1825 |
object * |
1826 |
present_arch (const archetype *at, maptile *m, int x, int y) |
1827 |
{ |
1828 |
if (!m || out_of_map (m, x, y)) |
1829 |
{ |
1830 |
LOG (llevError, "Present_arch called outside map.\n"); |
1831 |
return NULL; |
1832 |
} |
1833 |
|
1834 |
for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1835 |
if (tmp->arch == at) |
1836 |
return tmp; |
1837 |
|
1838 |
return NULL; |
1839 |
} |
1840 |
|
1841 |
/* |
1842 |
* present(type, map, x, y) searches for any objects with |
1843 |
* a matching type variable at the given map and coordinates. |
1844 |
* The first matching object is returned, or NULL if none. |
1845 |
*/ |
1846 |
object * |
1847 |
present (unsigned char type, maptile *m, int x, int y) |
1848 |
{ |
1849 |
if (out_of_map (m, x, y)) |
1850 |
{ |
1851 |
LOG (llevError, "Present called outside map.\n"); |
1852 |
return NULL; |
1853 |
} |
1854 |
|
1855 |
for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1856 |
if (tmp->type == type) |
1857 |
return tmp; |
1858 |
|
1859 |
return NULL; |
1860 |
} |
1861 |
|
1862 |
/* |
1863 |
* present_in_ob(type, object) searches for any objects with |
1864 |
* a matching type variable in the inventory of the given object. |
1865 |
* The first matching object is returned, or NULL if none. |
1866 |
*/ |
1867 |
object * |
1868 |
present_in_ob (unsigned char type, const object *op) |
1869 |
{ |
1870 |
for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1871 |
if (tmp->type == type) |
1872 |
return tmp; |
1873 |
|
1874 |
return NULL; |
1875 |
} |
1876 |
|
1877 |
/* |
1878 |
* present_in_ob (type, str, object) searches for any objects with |
1879 |
* a matching type & name variable in the inventory of the given object. |
1880 |
* The first matching object is returned, or NULL if none. |
1881 |
* This is mostly used by spell effect code, so that we only |
1882 |
* have one spell effect at a time. |
1883 |
* type can be used to narrow the search - if type is set, |
1884 |
* the type must also match. -1 can be passed for the type, |
1885 |
* in which case the type does not need to pass. |
1886 |
* str is the string to match against. Note that we match against |
1887 |
* the object name, not the archetype name. this is so that the |
1888 |
* spell code can use one object type (force), but change it's name |
1889 |
* to be unique. |
1890 |
*/ |
1891 |
object * |
1892 |
present_in_ob_by_name (int type, const char *str, const object *op) |
1893 |
{ |
1894 |
for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1895 |
if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name))) |
1896 |
return tmp; |
1897 |
|
1898 |
return 0; |
1899 |
} |
1900 |
|
1901 |
/* |
1902 |
* present_arch_in_ob(archetype, object) searches for any objects with |
1903 |
* a matching archetype in the inventory of the given object. |
1904 |
* The first matching object is returned, or NULL if none. |
1905 |
*/ |
1906 |
object * |
1907 |
present_arch_in_ob (const archetype *at, const object *op) |
1908 |
{ |
1909 |
for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1910 |
if (tmp->arch == at) |
1911 |
return tmp; |
1912 |
|
1913 |
return NULL; |
1914 |
} |
1915 |
|
1916 |
/* |
1917 |
* activate recursively a flag on an object inventory |
1918 |
*/ |
1919 |
void |
1920 |
flag_inv (object *op, int flag) |
1921 |
{ |
1922 |
for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1923 |
{ |
1924 |
SET_FLAG (tmp, flag); |
1925 |
flag_inv (tmp, flag); |
1926 |
} |
1927 |
} |
1928 |
|
1929 |
/* |
1930 |
* deactivate recursively a flag on an object inventory |
1931 |
*/ |
1932 |
void |
1933 |
unflag_inv (object *op, int flag) |
1934 |
{ |
1935 |
for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1936 |
{ |
1937 |
CLEAR_FLAG (tmp, flag); |
1938 |
unflag_inv (tmp, flag); |
1939 |
} |
1940 |
} |
1941 |
|
1942 |
/* |
1943 |
* find_free_spot(object, map, x, y, start, stop) will search for |
1944 |
* a spot at the given map and coordinates which will be able to contain |
1945 |
* the given object. start and stop specifies how many squares |
1946 |
* to search (see the freearr_x/y[] definition). |
1947 |
* It returns a random choice among the alternatives found. |
1948 |
* start and stop are where to start relative to the free_arr array (1,9 |
1949 |
* does all 4 immediate directions). This returns the index into the |
1950 |
* array of the free spot, -1 if no spot available (dir 0 = x,y) |
1951 |
* Note: This function does correctly handle tiled maps, but does not |
1952 |
* inform the caller. However, insert_ob_in_map will update as |
1953 |
* necessary, so the caller shouldn't need to do any special work. |
1954 |
* Note - updated to take an object instead of archetype - this is necessary |
1955 |
* because arch_blocked (now ob_blocked) needs to know the movement type |
1956 |
* to know if the space in question will block the object. We can't use |
1957 |
* the archetype because that isn't correct if the monster has been |
1958 |
* customized, changed states, etc. |
1959 |
*/ |
1960 |
int |
1961 |
find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1962 |
{ |
1963 |
int altern[SIZEOFFREE]; |
1964 |
int index = 0, flag; |
1965 |
|
1966 |
for (int i = start; i < stop; i++) |
1967 |
{ |
1968 |
mapxy pos (m, x, y); pos.move (i); |
1969 |
|
1970 |
if (!pos.normalise ()) |
1971 |
continue; |
1972 |
|
1973 |
mapspace &ms = *pos; |
1974 |
|
1975 |
if (ms.flags () & P_IS_ALIVE) |
1976 |
continue; |
1977 |
|
1978 |
/* However, often |
1979 |
* ob doesn't have any move type (when used to place exits) |
1980 |
* so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
1981 |
*/ |
1982 |
if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
1983 |
{ |
1984 |
altern [index++] = i; |
1985 |
continue; |
1986 |
} |
1987 |
|
1988 |
/* Basically, if we find a wall on a space, we cut down the search size. |
1989 |
* In this way, we won't return spaces that are on another side of a wall. |
1990 |
* This mostly work, but it cuts down the search size in all directions - |
1991 |
* if the space being examined only has a wall to the north and empty |
1992 |
* spaces in all the other directions, this will reduce the search space |
1993 |
* to only the spaces immediately surrounding the target area, and |
1994 |
* won't look 2 spaces south of the target space. |
1995 |
*/ |
1996 |
if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
1997 |
{ |
1998 |
stop = maxfree[i]; |
1999 |
continue; |
2000 |
} |
2001 |
|
2002 |
/* Note it is intentional that we check ob - the movement type of the |
2003 |
* head of the object should correspond for the entire object. |
2004 |
*/ |
2005 |
if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
2006 |
continue; |
2007 |
|
2008 |
if (ob->blocked (m, pos.x, pos.y)) |
2009 |
continue; |
2010 |
|
2011 |
altern [index++] = i; |
2012 |
} |
2013 |
|
2014 |
if (!index) |
2015 |
return -1; |
2016 |
|
2017 |
return altern [rndm (index)]; |
2018 |
} |
2019 |
|
2020 |
/* |
2021 |
* find_first_free_spot(archetype, maptile, x, y) works like |
2022 |
* find_free_spot(), but it will search max number of squares. |
2023 |
* But it will return the first available spot, not a random choice. |
2024 |
* Changed 0.93.2: Have it return -1 if there is no free spot available. |
2025 |
*/ |
2026 |
int |
2027 |
find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2028 |
{ |
2029 |
for (int i = 0; i < SIZEOFFREE; i++) |
2030 |
if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2031 |
return i; |
2032 |
|
2033 |
return -1; |
2034 |
} |
2035 |
|
2036 |
/* |
2037 |
* The function permute(arr, begin, end) randomly reorders the array |
2038 |
* arr[begin..end-1]. |
2039 |
* now uses a fisher-yates shuffle, old permute was broken |
2040 |
*/ |
2041 |
static void |
2042 |
permute (int *arr, int begin, int end) |
2043 |
{ |
2044 |
arr += begin; |
2045 |
end -= begin; |
2046 |
|
2047 |
while (--end) |
2048 |
swap (arr [end], arr [rndm (end + 1)]); |
2049 |
} |
2050 |
|
2051 |
/* new function to make monster searching more efficient, and effective! |
2052 |
* This basically returns a randomized array (in the passed pointer) of |
2053 |
* the spaces to find monsters. In this way, it won't always look for |
2054 |
* monsters to the north first. However, the size of the array passed |
2055 |
* covers all the spaces, so within that size, all the spaces within |
2056 |
* the 3x3 area will be searched, just not in a predictable order. |
2057 |
*/ |
2058 |
void |
2059 |
get_search_arr (int *search_arr) |
2060 |
{ |
2061 |
int i; |
2062 |
|
2063 |
for (i = 0; i < SIZEOFFREE; i++) |
2064 |
search_arr[i] = i; |
2065 |
|
2066 |
permute (search_arr, 1, SIZEOFFREE1 + 1); |
2067 |
permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1); |
2068 |
permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE); |
2069 |
} |
2070 |
|
2071 |
/* |
2072 |
* find_dir(map, x, y, exclude) will search some close squares in the |
2073 |
* given map at the given coordinates for live objects. |
2074 |
* It will not considered the object given as exclude among possible |
2075 |
* live objects. |
2076 |
* It returns the direction toward the first/closest live object if finds |
2077 |
* any, otherwise 0. |
2078 |
* Perhaps incorrectly, but I'm making the assumption that exclude |
2079 |
* is actually want is going to try and move there. We need this info |
2080 |
* because we have to know what movement the thing looking to move |
2081 |
* there is capable of. |
2082 |
*/ |
2083 |
int |
2084 |
find_dir (maptile *m, int x, int y, object *exclude) |
2085 |
{ |
2086 |
int i, max = SIZEOFFREE, mflags; |
2087 |
|
2088 |
sint16 nx, ny; |
2089 |
object *tmp; |
2090 |
maptile *mp; |
2091 |
|
2092 |
MoveType blocked, move_type; |
2093 |
|
2094 |
if (exclude && exclude->head_ () != exclude) |
2095 |
{ |
2096 |
exclude = exclude->head; |
2097 |
move_type = exclude->move_type; |
2098 |
} |
2099 |
else |
2100 |
{ |
2101 |
/* If we don't have anything, presume it can use all movement types. */ |
2102 |
move_type = MOVE_ALL; |
2103 |
} |
2104 |
|
2105 |
for (i = 1; i < max; i++) |
2106 |
{ |
2107 |
mp = m; |
2108 |
nx = x + freearr_x[i]; |
2109 |
ny = y + freearr_y[i]; |
2110 |
|
2111 |
mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
2112 |
|
2113 |
if (mflags & P_OUT_OF_MAP) |
2114 |
max = maxfree[i]; |
2115 |
else |
2116 |
{ |
2117 |
mapspace &ms = mp->at (nx, ny); |
2118 |
|
2119 |
blocked = ms.move_block; |
2120 |
|
2121 |
if ((move_type & blocked) == move_type) |
2122 |
max = maxfree[i]; |
2123 |
else if (mflags & P_IS_ALIVE) |
2124 |
{ |
2125 |
for (tmp = ms.bot; tmp; tmp = tmp->above) |
2126 |
if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2127 |
&& (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2128 |
break; |
2129 |
|
2130 |
if (tmp) |
2131 |
return freedir[i]; |
2132 |
} |
2133 |
} |
2134 |
} |
2135 |
|
2136 |
return 0; |
2137 |
} |
2138 |
|
2139 |
/* |
2140 |
* distance(object 1, object 2) will return the square of the |
2141 |
* distance between the two given objects. |
2142 |
*/ |
2143 |
int |
2144 |
distance (const object *ob1, const object *ob2) |
2145 |
{ |
2146 |
return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2147 |
} |
2148 |
|
2149 |
/* |
2150 |
* find_dir_2(delta-x,delta-y) will return a direction in which |
2151 |
* an object which has subtracted the x and y coordinates of another |
2152 |
* object, needs to travel toward it. |
2153 |
*/ |
2154 |
int |
2155 |
find_dir_2 (int x, int y) |
2156 |
{ |
2157 |
int q; |
2158 |
|
2159 |
if (y) |
2160 |
q = x * 100 / y; |
2161 |
else if (x) |
2162 |
q = -300 * x; |
2163 |
else |
2164 |
return 0; |
2165 |
|
2166 |
if (y > 0) |
2167 |
{ |
2168 |
if (q < -242) |
2169 |
return 3; |
2170 |
if (q < -41) |
2171 |
return 2; |
2172 |
if (q < 41) |
2173 |
return 1; |
2174 |
if (q < 242) |
2175 |
return 8; |
2176 |
return 7; |
2177 |
} |
2178 |
|
2179 |
if (q < -242) |
2180 |
return 7; |
2181 |
if (q < -41) |
2182 |
return 6; |
2183 |
if (q < 41) |
2184 |
return 5; |
2185 |
if (q < 242) |
2186 |
return 4; |
2187 |
|
2188 |
return 3; |
2189 |
} |
2190 |
|
2191 |
/* |
2192 |
* dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2193 |
* between two directions (which are expected to be absolute (see absdir()) |
2194 |
*/ |
2195 |
int |
2196 |
dirdiff (int dir1, int dir2) |
2197 |
{ |
2198 |
int d; |
2199 |
|
2200 |
d = abs (dir1 - dir2); |
2201 |
if (d > 4) |
2202 |
d = 8 - d; |
2203 |
|
2204 |
return d; |
2205 |
} |
2206 |
|
2207 |
/* peterm: |
2208 |
* do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2209 |
* Basically, this is a table of directions, and what directions |
2210 |
* one could go to go back to us. Eg, entry 15 below is 4, 14, 16. |
2211 |
* This basically means that if direction is 15, then it could either go |
2212 |
* direction 4, 14, or 16 to get back to where we are. |
2213 |
* Moved from spell_util.c to object.c with the other related direction |
2214 |
* functions. |
2215 |
*/ |
2216 |
int reduction_dir[SIZEOFFREE][3] = { |
2217 |
{0, 0, 0}, /* 0 */ |
2218 |
{0, 0, 0}, /* 1 */ |
2219 |
{0, 0, 0}, /* 2 */ |
2220 |
{0, 0, 0}, /* 3 */ |
2221 |
{0, 0, 0}, /* 4 */ |
2222 |
{0, 0, 0}, /* 5 */ |
2223 |
{0, 0, 0}, /* 6 */ |
2224 |
{0, 0, 0}, /* 7 */ |
2225 |
{0, 0, 0}, /* 8 */ |
2226 |
{8, 1, 2}, /* 9 */ |
2227 |
{1, 2, -1}, /* 10 */ |
2228 |
{2, 10, 12}, /* 11 */ |
2229 |
{2, 3, -1}, /* 12 */ |
2230 |
{2, 3, 4}, /* 13 */ |
2231 |
{3, 4, -1}, /* 14 */ |
2232 |
{4, 14, 16}, /* 15 */ |
2233 |
{5, 4, -1}, /* 16 */ |
2234 |
{4, 5, 6}, /* 17 */ |
2235 |
{6, 5, -1}, /* 18 */ |
2236 |
{6, 20, 18}, /* 19 */ |
2237 |
{7, 6, -1}, /* 20 */ |
2238 |
{6, 7, 8}, /* 21 */ |
2239 |
{7, 8, -1}, /* 22 */ |
2240 |
{8, 22, 24}, /* 23 */ |
2241 |
{8, 1, -1}, /* 24 */ |
2242 |
{24, 9, 10}, /* 25 */ |
2243 |
{9, 10, -1}, /* 26 */ |
2244 |
{10, 11, -1}, /* 27 */ |
2245 |
{27, 11, 29}, /* 28 */ |
2246 |
{11, 12, -1}, /* 29 */ |
2247 |
{12, 13, -1}, /* 30 */ |
2248 |
{12, 13, 14}, /* 31 */ |
2249 |
{13, 14, -1}, /* 32 */ |
2250 |
{14, 15, -1}, /* 33 */ |
2251 |
{33, 15, 35}, /* 34 */ |
2252 |
{16, 15, -1}, /* 35 */ |
2253 |
{17, 16, -1}, /* 36 */ |
2254 |
{18, 17, 16}, /* 37 */ |
2255 |
{18, 17, -1}, /* 38 */ |
2256 |
{18, 19, -1}, /* 39 */ |
2257 |
{41, 19, 39}, /* 40 */ |
2258 |
{19, 20, -1}, /* 41 */ |
2259 |
{20, 21, -1}, /* 42 */ |
2260 |
{20, 21, 22}, /* 43 */ |
2261 |
{21, 22, -1}, /* 44 */ |
2262 |
{23, 22, -1}, /* 45 */ |
2263 |
{45, 47, 23}, /* 46 */ |
2264 |
{23, 24, -1}, /* 47 */ |
2265 |
{24, 9, -1} |
2266 |
}; /* 48 */ |
2267 |
|
2268 |
/* Recursive routine to step back and see if we can |
2269 |
* find a path to that monster that we found. If not, |
2270 |
* we don't bother going toward it. Returns 1 if we |
2271 |
* can see a direct way to get it |
2272 |
* Modified to be map tile aware -.MSW |
2273 |
*/ |
2274 |
int |
2275 |
can_see_monsterP (maptile *m, int x, int y, int dir) |
2276 |
{ |
2277 |
sint16 dx, dy; |
2278 |
int mflags; |
2279 |
|
2280 |
if (dir < 0) |
2281 |
return 0; /* exit condition: invalid direction */ |
2282 |
|
2283 |
dx = x + freearr_x[dir]; |
2284 |
dy = y + freearr_y[dir]; |
2285 |
|
2286 |
mflags = get_map_flags (m, &m, dx, dy, &dx, &dy); |
2287 |
|
2288 |
/* This functional arguably was incorrect before - it was |
2289 |
* checking for P_WALL - that was basically seeing if |
2290 |
* we could move to the monster - this is being more |
2291 |
* literal on if we can see it. To know if we can actually |
2292 |
* move to the monster, we'd need the monster passed in or |
2293 |
* at least its move type. |
2294 |
*/ |
2295 |
if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW)) |
2296 |
return 0; |
2297 |
|
2298 |
/* yes, can see. */ |
2299 |
if (dir < 9) |
2300 |
return 1; |
2301 |
|
2302 |
return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |
2303 |
| can_see_monsterP (m, x, y, reduction_dir[dir][1]) |
2304 |
| can_see_monsterP (m, x, y, reduction_dir[dir][2]); |
2305 |
} |
2306 |
|
2307 |
/* |
2308 |
* can_pick(picker, item): finds out if an object is possible to be |
2309 |
* picked up by the picker. Returnes 1 if it can be |
2310 |
* picked up, otherwise 0. |
2311 |
* |
2312 |
* Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2313 |
* core dumps if they do. |
2314 |
* |
2315 |
* Add a check so we can't pick up invisible objects (0.93.8) |
2316 |
*/ |
2317 |
int |
2318 |
can_pick (const object *who, const object *item) |
2319 |
{ |
2320 |
return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2321 |
(item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2322 |
!QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); |
2323 |
} |
2324 |
|
2325 |
/* |
2326 |
* create clone from object to another |
2327 |
*/ |
2328 |
object * |
2329 |
object_create_clone (object *asrc) |
2330 |
{ |
2331 |
object *dst = 0, *tmp, *src, *prev, *item; |
2332 |
|
2333 |
if (!asrc) |
2334 |
return 0; |
2335 |
|
2336 |
src = asrc->head_ (); |
2337 |
|
2338 |
prev = 0; |
2339 |
for (object *part = src; part; part = part->more) |
2340 |
{ |
2341 |
tmp = part->clone (); |
2342 |
tmp->x -= src->x; |
2343 |
tmp->y -= src->y; |
2344 |
|
2345 |
if (!part->head) |
2346 |
{ |
2347 |
dst = tmp; |
2348 |
tmp->head = 0; |
2349 |
} |
2350 |
else |
2351 |
tmp->head = dst; |
2352 |
|
2353 |
tmp->more = 0; |
2354 |
|
2355 |
if (prev) |
2356 |
prev->more = tmp; |
2357 |
|
2358 |
prev = tmp; |
2359 |
} |
2360 |
|
2361 |
for (item = src->inv; item; item = item->below) |
2362 |
insert_ob_in_ob (object_create_clone (item), dst); |
2363 |
|
2364 |
return dst; |
2365 |
} |
2366 |
|
2367 |
/* This returns the first object in who's inventory that |
2368 |
* has the same type and subtype match. |
2369 |
* returns NULL if no match. |
2370 |
*/ |
2371 |
object * |
2372 |
find_obj_by_type_subtype (const object *who, int type, int subtype) |
2373 |
{ |
2374 |
for (object *tmp = who->inv; tmp; tmp = tmp->below) |
2375 |
if (tmp->type == type && tmp->subtype == subtype) |
2376 |
return tmp; |
2377 |
|
2378 |
return 0; |
2379 |
} |
2380 |
|
2381 |
/* If ob has a field named key, return the link from the list, |
2382 |
* otherwise return NULL. |
2383 |
* |
2384 |
* key must be a passed in shared string - otherwise, this won't |
2385 |
* do the desired thing. |
2386 |
*/ |
2387 |
key_value * |
2388 |
get_ob_key_link (const object *ob, const char *key) |
2389 |
{ |
2390 |
for (key_value *link = ob->key_values; link; link = link->next) |
2391 |
if (link->key == key) |
2392 |
return link; |
2393 |
|
2394 |
return 0; |
2395 |
} |
2396 |
|
2397 |
/* |
2398 |
* Returns the value of op has an extra_field for key, or NULL. |
2399 |
* |
2400 |
* The argument doesn't need to be a shared string. |
2401 |
* |
2402 |
* The returned string is shared. |
2403 |
*/ |
2404 |
const char * |
2405 |
get_ob_key_value (const object *op, const char *const key) |
2406 |
{ |
2407 |
key_value *link; |
2408 |
shstr_cmp canonical_key (key); |
2409 |
|
2410 |
if (!canonical_key) |
2411 |
{ |
2412 |
/* 1. There being a field named key on any object |
2413 |
* implies there'd be a shared string to find. |
2414 |
* 2. Since there isn't, no object has this field. |
2415 |
* 3. Therefore, *this* object doesn't have this field. |
2416 |
*/ |
2417 |
return 0; |
2418 |
} |
2419 |
|
2420 |
/* This is copied from get_ob_key_link() above - |
2421 |
* only 4 lines, and saves the function call overhead. |
2422 |
*/ |
2423 |
for (link = op->key_values; link; link = link->next) |
2424 |
if (link->key == canonical_key) |
2425 |
return link->value; |
2426 |
|
2427 |
return 0; |
2428 |
} |
2429 |
|
2430 |
/* |
2431 |
* Updates the canonical_key in op to value. |
2432 |
* |
2433 |
* canonical_key is a shared string (value doesn't have to be). |
2434 |
* |
2435 |
* Unless add_key is TRUE, it won't add fields, only change the value of existing |
2436 |
* keys. |
2437 |
* |
2438 |
* Returns TRUE on success. |
2439 |
*/ |
2440 |
int |
2441 |
set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
2442 |
{ |
2443 |
key_value *field = NULL, *last = NULL; |
2444 |
|
2445 |
for (field = op->key_values; field != NULL; field = field->next) |
2446 |
{ |
2447 |
if (field->key != canonical_key) |
2448 |
{ |
2449 |
last = field; |
2450 |
continue; |
2451 |
} |
2452 |
|
2453 |
if (value) |
2454 |
field->value = value; |
2455 |
else |
2456 |
{ |
2457 |
/* Basically, if the archetype has this key set, |
2458 |
* we need to store the null value so when we save |
2459 |
* it, we save the empty value so that when we load, |
2460 |
* we get this value back again. |
2461 |
*/ |
2462 |
if (get_ob_key_link (op->arch, canonical_key)) |
2463 |
field->value = 0; |
2464 |
else |
2465 |
{ |
2466 |
if (last) |
2467 |
last->next = field->next; |
2468 |
else |
2469 |
op->key_values = field->next; |
2470 |
|
2471 |
delete field; |
2472 |
} |
2473 |
} |
2474 |
return TRUE; |
2475 |
} |
2476 |
/* IF we get here, key doesn't exist */ |
2477 |
|
2478 |
/* No field, we'll have to add it. */ |
2479 |
|
2480 |
if (!add_key) |
2481 |
return FALSE; |
2482 |
|
2483 |
/* There isn't any good reason to store a null |
2484 |
* value in the key/value list. If the archetype has |
2485 |
* this key, then we should also have it, so shouldn't |
2486 |
* be here. If user wants to store empty strings, |
2487 |
* should pass in "" |
2488 |
*/ |
2489 |
if (value == NULL) |
2490 |
return TRUE; |
2491 |
|
2492 |
field = new key_value; |
2493 |
|
2494 |
field->key = canonical_key; |
2495 |
field->value = value; |
2496 |
/* Usual prepend-addition. */ |
2497 |
field->next = op->key_values; |
2498 |
op->key_values = field; |
2499 |
|
2500 |
return TRUE; |
2501 |
} |
2502 |
|
2503 |
/* |
2504 |
* Updates the key in op to value. |
2505 |
* |
2506 |
* If add_key is FALSE, this will only update existing keys, |
2507 |
* and not add new ones. |
2508 |
* In general, should be little reason FALSE is ever passed in for add_key |
2509 |
* |
2510 |
* Returns TRUE on success. |
2511 |
*/ |
2512 |
int |
2513 |
set_ob_key_value (object *op, const char *key, const char *value, int add_key) |
2514 |
{ |
2515 |
shstr key_ (key); |
2516 |
|
2517 |
return set_ob_key_value_s (op, key_, value, add_key); |
2518 |
} |
2519 |
|
2520 |
object::depth_iterator::depth_iterator (object *container) |
2521 |
: iterator_base (container) |
2522 |
{ |
2523 |
while (item->inv) |
2524 |
item = item->inv; |
2525 |
} |
2526 |
|
2527 |
void |
2528 |
object::depth_iterator::next () |
2529 |
{ |
2530 |
if (item->below) |
2531 |
{ |
2532 |
item = item->below; |
2533 |
|
2534 |
while (item->inv) |
2535 |
item = item->inv; |
2536 |
} |
2537 |
else |
2538 |
item = item->env; |
2539 |
} |
2540 |
|
2541 |
const char * |
2542 |
object::flag_desc (char *desc, int len) const |
2543 |
{ |
2544 |
char *p = desc; |
2545 |
bool first = true; |
2546 |
|
2547 |
*p = 0; |
2548 |
|
2549 |
for (int i = 0; i < NUM_FLAGS; i++) |
2550 |
{ |
2551 |
if (len <= 10) // magic constant! |
2552 |
{ |
2553 |
snprintf (p, len, ",..."); |
2554 |
break; |
2555 |
} |
2556 |
|
2557 |
if (flag [i]) |
2558 |
{ |
2559 |
int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
2560 |
len -= cnt; |
2561 |
p += cnt; |
2562 |
first = false; |
2563 |
} |
2564 |
} |
2565 |
|
2566 |
return desc; |
2567 |
} |
2568 |
|
2569 |
// return a suitable string describing an object in enough detail to find it |
2570 |
const char * |
2571 |
object::debug_desc (char *info) const |
2572 |
{ |
2573 |
char flagdesc[512]; |
2574 |
char info2[256 * 4]; |
2575 |
char *p = info; |
2576 |
|
2577 |
p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2578 |
count, |
2579 |
uuid.c_str (), |
2580 |
&name, |
2581 |
title ? "\",title:\"" : "", |
2582 |
title ? (const char *)title : "", |
2583 |
flag_desc (flagdesc, 512), type); |
2584 |
|
2585 |
if (!flag[FLAG_REMOVED] && env) |
2586 |
p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2587 |
|
2588 |
if (map) |
2589 |
p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2590 |
|
2591 |
return info; |
2592 |
} |
2593 |
|
2594 |
const char * |
2595 |
object::debug_desc () const |
2596 |
{ |
2597 |
static char info[3][256 * 4]; |
2598 |
static int info_idx; |
2599 |
|
2600 |
return debug_desc (info [++info_idx % 3]); |
2601 |
} |
2602 |
|
2603 |
struct region * |
2604 |
object::region () const |
2605 |
{ |
2606 |
return map ? map->region (x, y) |
2607 |
: region::default_region (); |
2608 |
} |
2609 |
|
2610 |
const materialtype_t * |
2611 |
object::dominant_material () const |
2612 |
{ |
2613 |
if (materialtype_t *mt = name_to_material (materialname)) |
2614 |
return mt; |
2615 |
|
2616 |
return name_to_material (shstr_unknown); |
2617 |
} |
2618 |
|
2619 |
void |
2620 |
object::open_container (object *new_container) |
2621 |
{ |
2622 |
if (container == new_container) |
2623 |
return; |
2624 |
|
2625 |
object *old_container = container; |
2626 |
|
2627 |
if (old_container) |
2628 |
{ |
2629 |
if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2630 |
return; |
2631 |
|
2632 |
#if 0 |
2633 |
// remove the "Close old_container" object. |
2634 |
if (object *closer = old_container->inv) |
2635 |
if (closer->type == CLOSE_CON) |
2636 |
closer->destroy (); |
2637 |
#endif |
2638 |
|
2639 |
// make sure the container is available |
2640 |
esrv_send_item (this, old_container); |
2641 |
|
2642 |
old_container->flag [FLAG_APPLIED] = false; |
2643 |
container = 0; |
2644 |
|
2645 |
// client needs item update to make it work, client bug requires this to be separate |
2646 |
esrv_update_item (UPD_FLAGS, this, old_container); |
2647 |
|
2648 |
new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2649 |
play_sound (sound_find ("chest_close")); |
2650 |
} |
2651 |
|
2652 |
if (new_container) |
2653 |
{ |
2654 |
if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
2655 |
return; |
2656 |
|
2657 |
// TODO: this does not seem to serve any purpose anymore? |
2658 |
#if 0 |
2659 |
// insert the "Close Container" object. |
2660 |
if (archetype *closer = new_container->other_arch) |
2661 |
{ |
2662 |
object *closer = arch_to_object (new_container->other_arch); |
2663 |
closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2664 |
new_container->insert (closer); |
2665 |
} |
2666 |
#endif |
2667 |
|
2668 |
new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2669 |
|
2670 |
// make sure the container is available, client bug requires this to be separate |
2671 |
esrv_send_item (this, new_container); |
2672 |
|
2673 |
new_container->flag [FLAG_APPLIED] = true; |
2674 |
container = new_container; |
2675 |
|
2676 |
// client needs flag change |
2677 |
esrv_update_item (UPD_FLAGS, this, new_container); |
2678 |
esrv_send_inventory (this, new_container); |
2679 |
play_sound (sound_find ("chest_open")); |
2680 |
} |
2681 |
// else if (!old_container->env && contr && contr->ns) |
2682 |
// contr->ns->floorbox_reset (); |
2683 |
} |
2684 |
|
2685 |
object * |
2686 |
object::force_find (const shstr name) |
2687 |
{ |
2688 |
/* cycle through his inventory to look for the MARK we want to |
2689 |
* place |
2690 |
*/ |
2691 |
for (object *tmp = inv; tmp; tmp = tmp->below) |
2692 |
if (tmp->type == FORCE && tmp->slaying == name) |
2693 |
return splay (tmp); |
2694 |
|
2695 |
return 0; |
2696 |
} |
2697 |
|
2698 |
void |
2699 |
object::force_add (const shstr name, int duration) |
2700 |
{ |
2701 |
if (object *force = force_find (name)) |
2702 |
force->destroy (); |
2703 |
|
2704 |
object *force = get_archetype (FORCE_NAME); |
2705 |
|
2706 |
force->slaying = name; |
2707 |
force->stats.food = 1; |
2708 |
force->speed_left = -1.f; |
2709 |
|
2710 |
force->set_speed (duration ? 1.f / duration : 0.f); |
2711 |
force->flag [FLAG_IS_USED_UP] = true; |
2712 |
force->flag [FLAG_APPLIED] = true; |
2713 |
|
2714 |
insert (force); |
2715 |
} |
2716 |
|
2717 |
void |
2718 |
object::play_sound (faceidx sound) |
2719 |
{ |
2720 |
if (!sound) |
2721 |
return; |
2722 |
|
2723 |
if (flag [FLAG_REMOVED]) |
2724 |
return; |
2725 |
|
2726 |
if (env) |
2727 |
{ |
2728 |
if (object *pl = in_player ()) |
2729 |
pl->contr->play_sound (sound); |
2730 |
} |
2731 |
else |
2732 |
map->play_sound (sound, x, y); |
2733 |
} |
2734 |
|