ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/object.C
(Generate patch)

Comparing deliantra/server/common/object.C (file contents):
Revision 1.32 by root, Mon Sep 11 23:53:30 2006 UTC vs.
Revision 1.159 by root, Mon Jun 4 13:04:00 2007 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines