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