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