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