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.26 by root, Mon Sep 11 11:46:52 2006 UTC vs.
Revision 1.173 by root, Sat Aug 4 22:23:47 2007 UTC

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

Diff Legend

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