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