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

Diff Legend

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