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