1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | |
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
20 | |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
|
|
22 | */ |
22 | */ |
23 | |
23 | |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | sub/add_weight will transcend the environment updating the carrying |
25 | sub/add_weight will transcend the environment updating the carrying |
26 | variable. */ |
26 | variable. */ |
27 | #include <global.h> |
27 | #include <global.h> |
28 | #include <stdio.h> |
28 | #include <stdio.h> |
29 | #include <sys/types.h> |
29 | #include <sys/types.h> |
30 | #include <sys/uio.h> |
30 | #include <sys/uio.h> |
31 | #include <object.h> |
31 | #include <object.h> |
32 | #include <funcpoint.h> |
32 | #include <funcpoint.h> |
|
|
33 | #include <sproto.h> |
33 | #include <loader.h> |
34 | #include <loader.h> |
34 | |
35 | |
35 | #include <bitset> |
36 | #include <bitset> |
36 | |
37 | |
37 | int nrofallocobjects = 0; |
38 | UUID UUID::cur; |
38 | static UUID uuid; |
39 | static uint64_t seq_next_save; |
39 | const uint64 UUID_SKIP = 1<<19; |
40 | static const uint64 UUID_GAP = 1<<19; |
40 | |
41 | |
41 | object *active_objects; /* List of active objects that need to be processed */ |
42 | objectvec objects; |
|
|
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] = { |
|
|
46 | 0, |
|
|
47 | 0, 1, 1, 1, 0, -1, -1, -1, |
|
|
48 | 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 |
49 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
45 | }; |
50 | }; |
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, |
51 | short freearr_y[SIZEOFFREE] = { |
|
|
52 | 0, |
|
|
53 | -1, -1, 0, 1, 1, 1, 0, -1, |
|
|
54 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
47 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
55 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
48 | }; |
56 | }; |
49 | int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, |
57 | int maxfree[SIZEOFFREE] = { |
|
|
58 | 0, |
|
|
59 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
60 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
50 | 48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
61 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
51 | }; |
62 | }; |
52 | int freedir[SIZEOFFREE] = { |
63 | int freedir[SIZEOFFREE] = { |
53 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
64 | 0, |
|
|
65 | 1, 2, 3, 4, 5, 6, 7, 8, |
|
|
66 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
54 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
67 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
55 | }; |
68 | }; |
56 | |
69 | |
57 | static void |
70 | static void |
58 | write_uuid (void) |
71 | write_uuid (uval64 skip, bool sync) |
59 | { |
72 | { |
60 | char filename1[MAX_BUF], filename2[MAX_BUF]; |
73 | CALL_BEGIN (2); |
61 | |
74 | CALL_ARG_SV (newSVval64 (skip)); |
62 | sprintf (filename1, "%s/uuid", settings.localdir); |
75 | CALL_ARG_SV (boolSV (sync)); |
63 | sprintf (filename2, "%s/uuid~", settings.localdir); |
76 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
64 | |
77 | CALL_END; |
65 | FILE *fp; |
|
|
66 | |
|
|
67 | if (!(fp = fopen (filename2, "w"))) |
|
|
68 | { |
|
|
69 | LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); |
|
|
70 | return; |
|
|
71 | } |
|
|
72 | |
|
|
73 | fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2); |
|
|
74 | fclose (fp); |
|
|
75 | rename (filename2, filename1); |
|
|
76 | } |
78 | } |
77 | |
79 | |
78 | static void |
80 | static void |
79 | read_uuid (void) |
81 | read_uuid (void) |
80 | { |
82 | { |
81 | char filename[MAX_BUF]; |
83 | char filename[MAX_BUF]; |
82 | |
84 | |
83 | sprintf (filename, "%s/uuid", settings.localdir); |
85 | sprintf (filename, "%s/uuid", settings.localdir); |
84 | |
86 | |
|
|
87 | seq_next_save = 0; |
|
|
88 | |
85 | FILE *fp; |
89 | FILE *fp; |
86 | |
90 | |
87 | if (!(fp = fopen (filename, "r"))) |
91 | if (!(fp = fopen (filename, "r"))) |
88 | { |
92 | { |
89 | if (errno == ENOENT) |
93 | if (errno == ENOENT) |
90 | { |
94 | { |
91 | LOG (llevInfo, "RESET uid to 1\n"); |
95 | LOG (llevInfo, "RESET uid to 1\n"); |
92 | uuid.seq = 0; |
96 | UUID::cur.seq = 0; |
93 | write_uuid (); |
97 | write_uuid (UUID_GAP, true); |
94 | return; |
98 | return; |
95 | } |
99 | } |
96 | |
100 | |
97 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
101 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
98 | _exit (1); |
102 | _exit (1); |
99 | } |
103 | } |
100 | |
104 | |
101 | int version; |
105 | UUID::BUF buf; |
102 | unsigned long long uid; |
106 | buf[0] = 0; |
103 | if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1) |
107 | fgets (buf, sizeof (buf), fp); |
|
|
108 | |
|
|
109 | if (!UUID::cur.parse (buf)) |
104 | { |
110 | { |
105 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
111 | LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf); |
106 | _exit (1); |
112 | _exit (1); |
107 | } |
113 | } |
108 | |
114 | |
109 | uuid.seq = uid; |
115 | LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ()); |
110 | write_uuid (); |
116 | |
111 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
117 | write_uuid (UUID_GAP, true); |
112 | fclose (fp); |
118 | fclose (fp); |
113 | } |
119 | } |
114 | |
120 | |
115 | UUID |
121 | UUID |
116 | gen_uuid () |
122 | UUID::gen () |
117 | { |
123 | { |
118 | UUID uid; |
124 | UUID uid; |
119 | |
125 | |
120 | uid.seq = ++uuid.seq; |
126 | uid.seq = ++cur.seq; |
121 | |
127 | |
122 | if (!(uuid.seq & (UUID_SKIP - 1))) |
128 | if (expect_false (cur.seq >= seq_next_save)) |
123 | write_uuid (); |
129 | { |
|
|
130 | seq_next_save = UUID::cur.seq + (UUID_GAP >> 1); |
|
|
131 | write_uuid (UUID_GAP, false); |
|
|
132 | } |
|
|
133 | |
124 | |
134 | |
125 | return uid; |
135 | return uid; |
126 | } |
136 | } |
127 | |
137 | |
128 | void |
138 | void |
129 | init_uuid () |
139 | UUID::init () |
130 | { |
140 | { |
131 | read_uuid (); |
141 | read_uuid (); |
132 | } |
142 | } |
133 | |
143 | |
134 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
144 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
135 | static int |
145 | static bool |
136 | compare_ob_value_lists_one (const object *wants, const object *has) |
146 | compare_ob_value_lists_one (const object *wants, const object *has) |
137 | { |
147 | { |
138 | key_value *wants_field; |
148 | key_value *wants_field; |
139 | |
149 | |
140 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
150 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
… | |
… | |
148 | key_value *has_field; |
158 | key_value *has_field; |
149 | |
159 | |
150 | /* Look for a field in has with the same key. */ |
160 | /* Look for a field in has with the same key. */ |
151 | has_field = get_ob_key_link (has, wants_field->key); |
161 | has_field = get_ob_key_link (has, wants_field->key); |
152 | |
162 | |
153 | if (has_field == NULL) |
163 | if (!has_field) |
154 | { |
|
|
155 | /* No field with that name. */ |
164 | return 0; /* No field with that name. */ |
156 | return FALSE; |
|
|
157 | } |
|
|
158 | |
165 | |
159 | /* Found the matching field. */ |
166 | /* Found the matching field. */ |
160 | if (has_field->value != wants_field->value) |
167 | if (has_field->value != wants_field->value) |
161 | { |
|
|
162 | /* Values don't match, so this half of the comparison is false. */ |
168 | return 0; /* Values don't match, so this half of the comparison is false. */ |
163 | return FALSE; |
|
|
164 | } |
|
|
165 | |
169 | |
166 | /* If we get here, we found a match. Now for the next field in wants. */ |
170 | /* If we get here, we found a match. Now for the next field in wants. */ |
167 | } |
171 | } |
168 | |
172 | |
169 | /* If we get here, every field in wants has a matching field in has. */ |
173 | /* If we get here, every field in wants has a matching field in has. */ |
170 | return TRUE; |
174 | return 1; |
171 | } |
175 | } |
172 | |
176 | |
173 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
177 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
174 | static int |
178 | static bool |
175 | compare_ob_value_lists (const object *ob1, const object *ob2) |
179 | compare_ob_value_lists (const object *ob1, const object *ob2) |
176 | { |
180 | { |
177 | /* However, there may be fields in has which aren't partnered in wants, |
181 | /* However, there may be fields in has which aren't partnered in wants, |
178 | * so we need to run the comparison *twice*. :( |
182 | * so we need to run the comparison *twice*. :( |
179 | */ |
183 | */ |
… | |
… | |
200 | || ob1->speed != ob2->speed |
204 | || ob1->speed != ob2->speed |
201 | || ob1->value != ob2->value |
205 | || ob1->value != ob2->value |
202 | || ob1->name != ob2->name) |
206 | || ob1->name != ob2->name) |
203 | return 0; |
207 | return 0; |
204 | |
208 | |
205 | //TODO: this ain't working well, use nicer and correct overflow check |
209 | /* Do not merge objects if nrof would overflow. First part checks |
206 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
210 | * for unsigned overflow (2c), second part checks wether the result |
207 | * value could not be stored in a sint32 (which unfortunately sometimes is |
211 | * would fit into a 32 bit signed int, which is often used to hold |
208 | * used to store nrof). |
212 | * nrof values. |
209 | */ |
213 | */ |
210 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
214 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
211 | return 0; |
215 | return 0; |
212 | |
216 | |
213 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
217 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
214 | * This is to the comparison of the flags below will be OK. We |
218 | * This is to the comparison of the flags below will be OK. We |
215 | * just can't ignore the been applied or identified flags, as they |
219 | * just can't ignore the been applied or identified flags, as they |
216 | * are not equal - just if it has been identified, the been_applied |
220 | * are not equal - just if it has been identified, the been_applied |
217 | * flags lose any meaning. |
221 | * flags lose any meaning. |
218 | */ |
222 | */ |
219 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
223 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
… | |
… | |
247 | || ob1->move_off != ob2->move_off |
251 | || ob1->move_off != ob2->move_off |
248 | || ob1->move_slow != ob2->move_slow |
252 | || ob1->move_slow != ob2->move_slow |
249 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
253 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
250 | return 0; |
254 | return 0; |
251 | |
255 | |
252 | /* This is really a spellbook check - really, we should |
256 | /* This is really a spellbook check - we should in general |
253 | * check all objects in the inventory. |
257 | * not merge objects with real inventories, as splitting them |
|
|
258 | * is hard. |
254 | */ |
259 | */ |
255 | if (ob1->inv || ob2->inv) |
260 | if (ob1->inv || ob2->inv) |
256 | { |
261 | { |
257 | /* if one object has inventory but the other doesn't, not equiv */ |
262 | if (!(ob1->inv && ob2->inv)) |
258 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
263 | return 0; /* inventories differ in length */ |
259 | return 0; |
|
|
260 | |
264 | |
261 | /* Now check to see if the two inventory objects could merge */ |
265 | if (ob1->inv->below || ob2->inv->below) |
|
|
266 | return 0; /* more than one object in inv */ |
|
|
267 | |
262 | if (!object::can_merge (ob1->inv, ob2->inv)) |
268 | if (!object::can_merge (ob1->inv, ob2->inv)) |
263 | return 0; |
269 | return 0; /* inventory objects differ */ |
264 | |
270 | |
265 | /* inventory ok - still need to check rest of this object to see |
271 | /* inventory ok - still need to check rest of this object to see |
266 | * if it is valid. |
272 | * if it is valid. |
267 | */ |
273 | */ |
268 | } |
274 | } |
… | |
… | |
276 | |
282 | |
277 | /* Note sure why the following is the case - either the object has to |
283 | /* Note sure why the following is the case - either the object has to |
278 | * be animated or have a very low speed. Is this an attempted monster |
284 | * be animated or have a very low speed. Is this an attempted monster |
279 | * check? |
285 | * check? |
280 | */ |
286 | */ |
281 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED) |
287 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
282 | return 0; |
288 | return 0; |
283 | |
289 | |
284 | switch (ob1->type) |
290 | switch (ob1->type) |
285 | { |
291 | { |
286 | case SCROLL: |
292 | case SCROLL: |
287 | if (ob1->level != ob2->level) |
293 | if (ob1->level != ob2->level) |
288 | return 0; |
294 | return 0; |
289 | break; |
295 | break; |
290 | } |
296 | } |
291 | |
297 | |
292 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
298 | if (ob1->key_values || ob2->key_values) |
293 | { |
299 | { |
294 | /* At least one of these has key_values. */ |
300 | /* At least one of these has key_values. */ |
295 | if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) |
301 | if ((!ob1->key_values) != (!ob2->key_values)) |
296 | /* One has fields, but the other one doesn't. */ |
302 | /* One has fields, but the other one doesn't. */ |
297 | return 0; |
303 | return 0; |
298 | else if (!compare_ob_value_lists (ob1, ob2)) |
304 | else if (!compare_ob_value_lists (ob1, ob2)) |
299 | return 0; |
305 | return 0; |
300 | } |
306 | } |
301 | |
307 | |
302 | //TODO: generate an event or call into perl for additional checks |
|
|
303 | if (ob1->self || ob2->self) |
308 | if (ob1->self || ob2->self) |
304 | { |
309 | { |
305 | ob1->optimise (); |
310 | ob1->optimise (); |
306 | ob2->optimise (); |
311 | ob2->optimise (); |
307 | |
312 | |
308 | if (ob1->self || ob2->self) |
313 | if (ob1->self || ob2->self) |
|
|
314 | { |
|
|
315 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
|
|
316 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
|
|
317 | |
|
|
318 | if (k1 != k2) |
309 | return 0; |
319 | return 0; |
|
|
320 | else if (k1 == 0) |
|
|
321 | return 1; |
|
|
322 | else if (!cfperl_can_merge (ob1, ob2)) |
|
|
323 | return 0; |
|
|
324 | } |
310 | } |
325 | } |
311 | |
326 | |
312 | /* Everything passes, must be OK. */ |
327 | /* Everything passes, must be OK. */ |
313 | return 1; |
328 | return 1; |
314 | } |
329 | } |
… | |
… | |
322 | sum_weight (object *op) |
337 | sum_weight (object *op) |
323 | { |
338 | { |
324 | long sum; |
339 | long sum; |
325 | object *inv; |
340 | object *inv; |
326 | |
341 | |
327 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
342 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
328 | { |
343 | { |
329 | if (inv->inv) |
344 | if (inv->inv) |
330 | sum_weight (inv); |
345 | sum_weight (inv); |
|
|
346 | |
331 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
347 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
332 | } |
348 | } |
333 | |
349 | |
334 | if (op->type == CONTAINER && op->stats.Str) |
350 | if (op->type == CONTAINER && op->stats.Str) |
335 | sum = (sum * (100 - op->stats.Str)) / 100; |
351 | sum = (sum * (100 - op->stats.Str)) / 100; |
… | |
… | |
355 | /* |
371 | /* |
356 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
372 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
357 | * Some error messages. |
373 | * Some error messages. |
358 | * The result of the dump is stored in the static global errmsg array. |
374 | * The result of the dump is stored in the static global errmsg array. |
359 | */ |
375 | */ |
360 | |
|
|
361 | char * |
376 | char * |
362 | dump_object (object *op) |
377 | dump_object (object *op) |
363 | { |
378 | { |
364 | if (!op) |
379 | if (!op) |
365 | return strdup ("[NULLOBJ]"); |
380 | return strdup ("[NULLOBJ]"); |
366 | |
381 | |
367 | object_freezer freezer; |
382 | object_freezer freezer; |
368 | save_object (freezer, op, 1); |
383 | op->write (freezer); |
369 | return freezer.as_string (); |
384 | return freezer.as_string (); |
370 | } |
385 | } |
371 | |
386 | |
372 | /* |
387 | /* |
373 | * get_nearest_part(multi-object, object 2) returns the part of the |
388 | * get_nearest_part(multi-object, object 2) returns the part of the |
374 | * multi-object 1 which is closest to the second object. |
389 | * multi-object 1 which is closest to the second object. |
375 | * If it's not a multi-object, it is returned. |
390 | * If it's not a multi-object, it is returned. |
376 | */ |
391 | */ |
377 | |
|
|
378 | object * |
392 | object * |
379 | get_nearest_part (object *op, const object *pl) |
393 | get_nearest_part (object *op, const object *pl) |
380 | { |
394 | { |
381 | object *tmp, *closest; |
395 | object *tmp, *closest; |
382 | int last_dist, i; |
396 | int last_dist, i; |
… | |
… | |
390 | } |
404 | } |
391 | |
405 | |
392 | /* |
406 | /* |
393 | * Returns the object which has the count-variable equal to the argument. |
407 | * Returns the object which has the count-variable equal to the argument. |
394 | */ |
408 | */ |
395 | |
|
|
396 | object * |
409 | object * |
397 | find_object (tag_t i) |
410 | find_object (tag_t i) |
398 | { |
411 | { |
399 | for (object *op = object::first; op; op = op->next) |
412 | for_all_objects (op) |
400 | if (op->count == i) |
413 | if (op->count == i) |
401 | return op; |
414 | return op; |
402 | |
415 | |
403 | return 0; |
416 | return 0; |
404 | } |
417 | } |
405 | |
418 | |
406 | /* |
419 | /* |
407 | * Returns the first object which has a name equal to the argument. |
420 | * Returns the first object which has a name equal to the argument. |
408 | * Used only by the patch command, but not all that useful. |
421 | * Used only by the patch command, but not all that useful. |
409 | * Enables features like "patch <name-of-other-player> food 999" |
422 | * Enables features like "patch <name-of-other-player> food 999" |
410 | */ |
423 | */ |
411 | |
|
|
412 | object * |
424 | object * |
413 | find_object_name (const char *str) |
425 | find_object_name (const char *str) |
414 | { |
426 | { |
415 | shstr_cmp str_ (str); |
427 | shstr_cmp str_ (str); |
416 | object *op; |
428 | object *op; |
417 | |
429 | |
418 | for (op = object::first; op != NULL; op = op->next) |
430 | for_all_objects (op) |
419 | if (op->name == str_) |
431 | if (op->name == str_) |
420 | break; |
432 | break; |
421 | |
433 | |
422 | return op; |
434 | return op; |
423 | } |
435 | } |
424 | |
436 | |
425 | void |
|
|
426 | free_all_object_data () |
|
|
427 | { |
|
|
428 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
429 | } |
|
|
430 | |
|
|
431 | /* |
437 | /* |
432 | * Sets the owner and sets the skill and exp pointers to owner's current |
438 | * Sets the owner and sets the skill and exp pointers to owner's current |
433 | * skill and experience objects. |
439 | * skill and experience objects. |
|
|
440 | * ACTUALLY NO! investigate! TODO |
434 | */ |
441 | */ |
435 | void |
442 | void |
436 | object::set_owner (object *owner) |
443 | object::set_owner (object *owner) |
437 | { |
444 | { |
|
|
445 | // allow objects which own objects |
438 | if (!owner) |
446 | if (owner) |
439 | return; |
|
|
440 | |
|
|
441 | /* next line added to allow objects which own objects */ |
|
|
442 | /* Add a check for ownercounts in here, as I got into an endless loop |
|
|
443 | * with the fireball owning a poison cloud which then owned the |
|
|
444 | * fireball. I believe that was caused by one of the objects getting |
|
|
445 | * freed and then another object replacing it. Since the ownercounts |
|
|
446 | * didn't match, this check is valid and I believe that cause is valid. |
|
|
447 | */ |
|
|
448 | while (owner->owner) |
447 | while (owner->owner) |
449 | owner = owner->owner; |
448 | owner = owner->owner; |
|
|
449 | |
|
|
450 | if (flag [FLAG_FREED]) |
|
|
451 | { |
|
|
452 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
|
|
453 | return; |
|
|
454 | } |
450 | |
455 | |
451 | this->owner = owner; |
456 | this->owner = owner; |
|
|
457 | } |
|
|
458 | |
|
|
459 | int |
|
|
460 | object::slottype () const |
|
|
461 | { |
|
|
462 | if (type == SKILL) |
|
|
463 | { |
|
|
464 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
465 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
466 | } |
|
|
467 | else |
|
|
468 | { |
|
|
469 | if (slot [body_combat].info) return slot_combat; |
|
|
470 | if (slot [body_range ].info) return slot_ranged; |
|
|
471 | } |
|
|
472 | |
|
|
473 | return slot_none; |
|
|
474 | } |
|
|
475 | |
|
|
476 | bool |
|
|
477 | object::change_weapon (object *ob) |
|
|
478 | { |
|
|
479 | if (current_weapon == ob) |
|
|
480 | return true; |
|
|
481 | |
|
|
482 | if (chosen_skill) |
|
|
483 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
484 | |
|
|
485 | current_weapon = ob; |
|
|
486 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
487 | |
|
|
488 | if (chosen_skill) |
|
|
489 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
490 | |
|
|
491 | update_stats (); |
|
|
492 | |
|
|
493 | if (ob) |
|
|
494 | { |
|
|
495 | // now check wether any body locations became invalid, in which case |
|
|
496 | // we cannot apply the weapon at the moment. |
|
|
497 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
498 | if (slot[i].used < 0) |
|
|
499 | { |
|
|
500 | current_weapon = chosen_skill = 0; |
|
|
501 | update_stats (); |
|
|
502 | |
|
|
503 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
504 | "You try to balance all your items at once, " |
|
|
505 | "but the %s is just too much for your body. " |
|
|
506 | "[You need to unapply some items first.]", &ob->name); |
|
|
507 | return false; |
|
|
508 | } |
|
|
509 | |
|
|
510 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
511 | } |
|
|
512 | else |
|
|
513 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
514 | |
|
|
515 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
516 | { |
|
|
517 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
518 | &name, ob->debug_desc ()); |
|
|
519 | return false; |
|
|
520 | } |
|
|
521 | |
|
|
522 | return true; |
452 | } |
523 | } |
453 | |
524 | |
454 | /* Zero the key_values on op, decrementing the shared-string |
525 | /* Zero the key_values on op, decrementing the shared-string |
455 | * refcounts and freeing the links. |
526 | * refcounts and freeing the links. |
456 | */ |
527 | */ |
457 | static void |
528 | static void |
458 | free_key_values (object *op) |
529 | free_key_values (object *op) |
459 | { |
530 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
531 | for (key_value *i = op->key_values; i; ) |
461 | { |
532 | { |
462 | key_value *next = i->next; |
533 | key_value *next = i->next; |
463 | delete i; |
534 | delete i; |
464 | |
535 | |
465 | i = next; |
536 | i = next; |
466 | } |
537 | } |
467 | |
538 | |
468 | op->key_values = 0; |
539 | op->key_values = 0; |
469 | } |
540 | } |
470 | |
541 | |
471 | /* |
542 | object & |
472 | * copy_to first frees everything allocated by the dst object, |
543 | object::operator =(const object &src) |
473 | * and then copies the contents of itself into the second |
|
|
474 | * object, allocating what needs to be allocated. Basically, any |
|
|
475 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
476 | * if the first object is freed, the pointers in the new object |
|
|
477 | * will point at garbage. |
|
|
478 | */ |
|
|
479 | void |
|
|
480 | object::copy_to (object *dst) |
|
|
481 | { |
544 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
545 | bool is_freed = flag [FLAG_FREED]; |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
546 | bool is_removed = flag [FLAG_REMOVED]; |
484 | |
547 | |
485 | *(object_copy *)dst = *this; |
548 | *(object_copy *)this = src; |
486 | |
549 | |
487 | if (is_freed) |
550 | flag [FLAG_FREED] = is_freed; |
488 | SET_FLAG (dst, FLAG_FREED); |
551 | flag [FLAG_REMOVED] = is_removed; |
489 | |
|
|
490 | if (is_removed) |
|
|
491 | SET_FLAG (dst, FLAG_REMOVED); |
|
|
492 | |
|
|
493 | if (speed < 0) |
|
|
494 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
|
|
495 | |
552 | |
496 | /* Copy over key_values, if any. */ |
553 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
554 | if (src.key_values) |
498 | { |
555 | { |
499 | key_value *tail = 0; |
556 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
557 | key_values = 0; |
503 | |
558 | |
504 | for (i = key_values; i; i = i->next) |
559 | for (key_value *i = src.key_values; i; i = i->next) |
505 | { |
560 | { |
506 | key_value *new_link = new key_value; |
561 | key_value *new_link = new key_value; |
507 | |
562 | |
508 | new_link->next = 0; |
563 | new_link->next = 0; |
509 | new_link->key = i->key; |
564 | new_link->key = i->key; |
510 | new_link->value = i->value; |
565 | new_link->value = i->value; |
511 | |
566 | |
512 | /* Try and be clever here, too. */ |
567 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
568 | if (!key_values) |
514 | { |
569 | { |
515 | dst->key_values = new_link; |
570 | key_values = new_link; |
516 | tail = new_link; |
571 | tail = new_link; |
517 | } |
572 | } |
518 | else |
573 | else |
519 | { |
574 | { |
520 | tail->next = new_link; |
575 | tail->next = new_link; |
521 | tail = new_link; |
576 | tail = new_link; |
522 | } |
577 | } |
523 | } |
578 | } |
524 | } |
579 | } |
|
|
580 | } |
|
|
581 | |
|
|
582 | /* |
|
|
583 | * copy_to first frees everything allocated by the dst object, |
|
|
584 | * and then copies the contents of itself into the second |
|
|
585 | * object, allocating what needs to be allocated. Basically, any |
|
|
586 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
587 | * if the first object is freed, the pointers in the new object |
|
|
588 | * will point at garbage. |
|
|
589 | */ |
|
|
590 | void |
|
|
591 | object::copy_to (object *dst) |
|
|
592 | { |
|
|
593 | *dst = *this; |
|
|
594 | |
|
|
595 | if (speed < 0) |
|
|
596 | dst->speed_left -= rndm (); |
525 | |
597 | |
526 | dst->set_speed (dst->speed); |
598 | dst->set_speed (dst->speed); |
|
|
599 | } |
|
|
600 | |
|
|
601 | void |
|
|
602 | object::instantiate () |
|
|
603 | { |
|
|
604 | if (!uuid.seq) // HACK |
|
|
605 | uuid = UUID::gen (); |
|
|
606 | |
|
|
607 | speed_left = -0.1f; |
|
|
608 | /* copy the body_info to the body_used - this is only really |
|
|
609 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
610 | * by doing so, when a monster is created, it has good starting |
|
|
611 | * values for the body_used info, so when items are created |
|
|
612 | * for it, they can be properly equipped. |
|
|
613 | */ |
|
|
614 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
615 | slot[i].used = slot[i].info; |
|
|
616 | |
|
|
617 | attachable::instantiate (); |
527 | } |
618 | } |
528 | |
619 | |
529 | object * |
620 | object * |
530 | object::clone () |
621 | object::clone () |
531 | { |
622 | { |
… | |
… | |
563 | speed = 0; |
654 | speed = 0; |
564 | } |
655 | } |
565 | |
656 | |
566 | this->speed = speed; |
657 | this->speed = speed; |
567 | |
658 | |
568 | if (FABS (speed) > MIN_ACTIVE_SPEED) |
659 | if (has_active_speed ()) |
569 | { |
660 | activate (); |
570 | /* If already on active list, don't do anything */ |
|
|
571 | if (active_next || active_prev || this == active_objects) |
|
|
572 | return; |
|
|
573 | |
|
|
574 | /* process_events() expects us to insert the object at the beginning |
|
|
575 | * of the list. */ |
|
|
576 | active_next = active_objects; |
|
|
577 | |
|
|
578 | if (active_next) |
|
|
579 | active_next->active_prev = this; |
|
|
580 | |
|
|
581 | active_objects = this; |
|
|
582 | } |
|
|
583 | else |
661 | else |
584 | { |
662 | deactivate (); |
585 | /* If not on the active list, nothing needs to be done */ |
|
|
586 | if (!active_next && !active_prev && this != active_objects) |
|
|
587 | return; |
|
|
588 | |
|
|
589 | if (!active_prev) |
|
|
590 | { |
|
|
591 | active_objects = active_next; |
|
|
592 | |
|
|
593 | if (active_next) |
|
|
594 | active_next->active_prev = 0; |
|
|
595 | } |
|
|
596 | else |
|
|
597 | { |
|
|
598 | active_prev->active_next = active_next; |
|
|
599 | |
|
|
600 | if (active_next) |
|
|
601 | active_next->active_prev = active_prev; |
|
|
602 | } |
|
|
603 | |
|
|
604 | active_next = 0; |
|
|
605 | active_prev = 0; |
|
|
606 | } |
|
|
607 | } |
663 | } |
608 | |
664 | |
609 | /* |
665 | /* |
610 | * update_object() updates the the map. |
666 | * update_object() updates the the map. |
611 | * It takes into account invisible objects (and represent squares covered |
667 | * It takes into account invisible objects (and represent squares covered |
… | |
… | |
624 | * UP_OBJ_FACE: only the objects face has changed. |
680 | * UP_OBJ_FACE: only the objects face has changed. |
625 | */ |
681 | */ |
626 | void |
682 | void |
627 | update_object (object *op, int action) |
683 | update_object (object *op, int action) |
628 | { |
684 | { |
629 | MoveType move_on, move_off, move_block, move_slow; |
|
|
630 | |
|
|
631 | if (op == NULL) |
685 | if (op == NULL) |
632 | { |
686 | { |
633 | /* this should never happen */ |
687 | /* this should never happen */ |
634 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
688 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
635 | return; |
689 | return; |
… | |
… | |
659 | return; |
713 | return; |
660 | } |
714 | } |
661 | |
715 | |
662 | mapspace &m = op->ms (); |
716 | mapspace &m = op->ms (); |
663 | |
717 | |
664 | if (m.flags_ & P_NEED_UPDATE) |
718 | if (!(m.flags_ & P_UPTODATE)) |
665 | /* nop */; |
719 | /* nop */; |
666 | else if (action == UP_OBJ_INSERT) |
720 | else if (action == UP_OBJ_INSERT) |
667 | { |
721 | { |
668 | // this is likely overkill, TODO: revisit (schmorp) |
722 | // this is likely overkill, TODO: revisit (schmorp) |
669 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
723 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
… | |
… | |
678 | /* This isn't perfect, but I don't expect a lot of objects to |
732 | /* This isn't perfect, but I don't expect a lot of objects to |
679 | * to have move_allow right now. |
733 | * to have move_allow right now. |
680 | */ |
734 | */ |
681 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
735 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
682 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
736 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
683 | m.flags_ = P_NEED_UPDATE; |
737 | m.flags_ = 0; |
684 | } |
738 | } |
685 | /* if the object is being removed, we can't make intelligent |
739 | /* if the object is being removed, we can't make intelligent |
686 | * decisions, because remove_ob can't really pass the object |
740 | * decisions, because remove_ob can't really pass the object |
687 | * that is being removed. |
741 | * that is being removed. |
688 | */ |
742 | */ |
689 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
743 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
690 | m.flags_ = P_NEED_UPDATE; |
744 | m.flags_ = 0; |
691 | else if (action == UP_OBJ_FACE) |
745 | else if (action == UP_OBJ_FACE) |
692 | /* Nothing to do for that case */ ; |
746 | /* Nothing to do for that case */ ; |
693 | else |
747 | else |
694 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
748 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
695 | |
749 | |
696 | if (op->more) |
750 | if (op->more) |
697 | update_object (op->more, action); |
751 | update_object (op->more, action); |
698 | } |
752 | } |
699 | |
753 | |
700 | object::vector object::objects; // not yet used |
|
|
701 | object *object::first; |
|
|
702 | |
|
|
703 | object::object () |
754 | object::object () |
704 | { |
755 | { |
705 | SET_FLAG (this, FLAG_REMOVED); |
756 | SET_FLAG (this, FLAG_REMOVED); |
706 | |
757 | |
707 | expmul = 1.0; |
758 | expmul = 1.0; |
708 | face = blank_face; |
759 | face = blank_face; |
709 | } |
760 | } |
710 | |
761 | |
711 | object::~object () |
762 | object::~object () |
712 | { |
763 | { |
|
|
764 | unlink (); |
|
|
765 | |
713 | free_key_values (this); |
766 | free_key_values (this); |
714 | } |
767 | } |
715 | |
768 | |
|
|
769 | static int object_count; |
|
|
770 | |
716 | void object::link () |
771 | void object::link () |
717 | { |
772 | { |
|
|
773 | assert (!index);//D |
|
|
774 | uuid = UUID::gen (); |
718 | count = ++ob_count; |
775 | count = ++object_count; |
719 | uuid = gen_uuid (); |
|
|
720 | |
776 | |
721 | prev = 0; |
777 | refcnt_inc (); |
722 | next = object::first; |
778 | objects.insert (this); |
723 | |
|
|
724 | if (object::first) |
|
|
725 | object::first->prev = this; |
|
|
726 | |
|
|
727 | object::first = this; |
|
|
728 | } |
779 | } |
729 | |
780 | |
730 | void object::unlink () |
781 | void object::unlink () |
731 | { |
782 | { |
732 | if (this == object::first) |
783 | if (!index) |
733 | object::first = next; |
784 | return; |
734 | |
785 | |
735 | /* Remove this object from the list of used objects */ |
786 | objects.erase (this); |
736 | if (prev) prev->next = next; |
787 | refcnt_dec (); |
737 | if (next) next->prev = prev; |
|
|
738 | |
|
|
739 | prev = 0; |
|
|
740 | next = 0; |
|
|
741 | } |
788 | } |
742 | |
789 | |
743 | void |
790 | void |
|
|
791 | object::activate () |
|
|
792 | { |
|
|
793 | /* If already on active list, don't do anything */ |
|
|
794 | if (active) |
|
|
795 | return; |
|
|
796 | |
|
|
797 | if (has_active_speed ()) |
|
|
798 | actives.insert (this); |
|
|
799 | } |
|
|
800 | |
|
|
801 | void |
744 | object::activate (bool recursive) |
802 | object::activate_recursive () |
745 | { |
803 | { |
746 | // uh, hack |
804 | activate (); |
747 | set_speed (speed); |
|
|
748 | |
805 | |
749 | if (recursive) |
|
|
750 | for (object *op = inv; op; op = op->above) |
806 | for (object *op = inv; op; op = op->below) |
751 | op->activate (1); |
807 | op->activate_recursive (); |
752 | } |
808 | } |
753 | |
809 | |
754 | /* This function removes object 'op' from the list of active |
810 | /* This function removes object 'op' from the list of active |
755 | * objects. |
811 | * objects. |
756 | * This should only be used for style maps or other such |
812 | * This should only be used for style maps or other such |
… | |
… | |
758 | * in play chewing up cpu time getting processed. |
814 | * in play chewing up cpu time getting processed. |
759 | * The reverse of this is to call update_ob_speed, which |
815 | * The reverse of this is to call update_ob_speed, which |
760 | * will do the right thing based on the speed of the object. |
816 | * will do the right thing based on the speed of the object. |
761 | */ |
817 | */ |
762 | void |
818 | void |
763 | object::deactivate (bool recursive) |
819 | object::deactivate () |
764 | { |
820 | { |
765 | /* If not on the active list, nothing needs to be done */ |
821 | /* If not on the active list, nothing needs to be done */ |
766 | if (!active_next && !active_prev && this != active_objects) |
822 | if (!active) |
767 | return; |
823 | return; |
768 | |
824 | |
769 | if (active_prev == 0) |
825 | actives.erase (this); |
770 | { |
826 | } |
771 | active_objects = active_next; |
|
|
772 | if (active_next) |
|
|
773 | active_next->active_prev = 0; |
|
|
774 | } |
|
|
775 | else |
|
|
776 | { |
|
|
777 | active_prev->active_next = active_next; |
|
|
778 | if (active_next) |
|
|
779 | active_next->active_prev = active_prev; |
|
|
780 | } |
|
|
781 | |
827 | |
782 | active_next = 0; |
828 | void |
783 | active_prev = 0; |
829 | object::deactivate_recursive () |
784 | |
830 | { |
785 | if (recursive) |
|
|
786 | for (object *op = inv; op; op = op->above) |
831 | for (object *op = inv; op; op = op->below) |
|
|
832 | op->deactivate_recursive (); |
|
|
833 | |
787 | op->deactivate (1); |
834 | deactivate (); |
|
|
835 | } |
|
|
836 | |
|
|
837 | void |
|
|
838 | object::set_flag_inv (int flag, int value) |
|
|
839 | { |
|
|
840 | for (object *op = inv; op; op = op->below) |
|
|
841 | { |
|
|
842 | op->flag [flag] = value; |
|
|
843 | op->set_flag_inv (flag, value); |
|
|
844 | } |
788 | } |
845 | } |
789 | |
846 | |
790 | /* |
847 | /* |
791 | * Remove and free all objects in the inventory of the given object. |
848 | * Remove and free all objects in the inventory of the given object. |
792 | * object.c ? |
849 | * object.c ? |
… | |
… | |
806 | * if some form of movement is allowed, let objects |
863 | * if some form of movement is allowed, let objects |
807 | * drop on that space. |
864 | * drop on that space. |
808 | */ |
865 | */ |
809 | if (!drop_to_ground |
866 | if (!drop_to_ground |
810 | || !map |
867 | || !map |
811 | || map->in_memory != MAP_IN_MEMORY |
868 | || map->in_memory != MAP_ACTIVE |
|
|
869 | || map->nodrop |
812 | || ms ().move_block == MOVE_ALL) |
870 | || ms ().move_block == MOVE_ALL) |
813 | { |
871 | { |
814 | while (inv) |
872 | while (inv) |
815 | { |
873 | { |
816 | inv->destroy_inv (drop_to_ground); |
874 | inv->destroy_inv (drop_to_ground); |
… | |
… | |
825 | |
883 | |
826 | if (op->flag [FLAG_STARTEQUIP] |
884 | if (op->flag [FLAG_STARTEQUIP] |
827 | || op->flag [FLAG_NO_DROP] |
885 | || op->flag [FLAG_NO_DROP] |
828 | || op->type == RUNE |
886 | || op->type == RUNE |
829 | || op->type == TRAP |
887 | || op->type == TRAP |
830 | || op->flag [FLAG_IS_A_TEMPLATE]) |
888 | || op->flag [FLAG_IS_A_TEMPLATE] |
|
|
889 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
831 | op->destroy (); |
890 | op->destroy (); |
832 | else |
891 | else |
833 | map->insert (op, x, y); |
892 | map->insert (op, x, y); |
834 | } |
893 | } |
835 | } |
894 | } |
… | |
… | |
843 | } |
902 | } |
844 | |
903 | |
845 | void |
904 | void |
846 | object::do_destroy () |
905 | object::do_destroy () |
847 | { |
906 | { |
|
|
907 | attachable::do_destroy (); |
|
|
908 | |
848 | if (flag [FLAG_IS_LINKED]) |
909 | if (flag [FLAG_IS_LINKED]) |
849 | remove_button_link (this); |
910 | remove_button_link (this); |
850 | |
911 | |
851 | if (flag [FLAG_FRIENDLY]) |
912 | if (flag [FLAG_FRIENDLY]) |
852 | remove_friendly_object (this); |
913 | remove_friendly_object (this); |
853 | |
914 | |
854 | if (!flag [FLAG_REMOVED]) |
915 | if (!flag [FLAG_REMOVED]) |
855 | remove (); |
916 | remove (); |
856 | |
917 | |
857 | if (flag [FLAG_FREED]) |
918 | destroy_inv (true); |
858 | return; |
|
|
859 | |
919 | |
860 | set_speed (0); |
920 | deactivate (); |
|
|
921 | unlink (); |
861 | |
922 | |
862 | flag [FLAG_FREED] = 1; |
923 | flag [FLAG_FREED] = 1; |
863 | |
|
|
864 | attachable::do_destroy (); |
|
|
865 | |
|
|
866 | destroy_inv (true); |
|
|
867 | unlink (); |
|
|
868 | |
924 | |
869 | // hack to ensure that freed objects still have a valid map |
925 | // hack to ensure that freed objects still have a valid map |
870 | { |
926 | { |
871 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
927 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
872 | |
928 | |
873 | if (!freed_map) |
929 | if (!freed_map) |
874 | { |
930 | { |
875 | freed_map = new maptile; |
931 | freed_map = new maptile; |
876 | |
932 | |
|
|
933 | freed_map->path = "<freed objects map>"; |
877 | freed_map->name = "/internal/freed_objects_map"; |
934 | freed_map->name = "/internal/freed_objects_map"; |
878 | freed_map->width = 3; |
935 | freed_map->width = 3; |
879 | freed_map->height = 3; |
936 | freed_map->height = 3; |
|
|
937 | freed_map->nodrop = 1; |
880 | |
938 | |
881 | freed_map->alloc (); |
939 | freed_map->alloc (); |
|
|
940 | freed_map->in_memory = MAP_ACTIVE; |
882 | } |
941 | } |
883 | |
942 | |
884 | map = freed_map; |
943 | map = freed_map; |
885 | x = 1; |
944 | x = 1; |
886 | y = 1; |
945 | y = 1; |
887 | } |
946 | } |
888 | |
947 | |
889 | head = 0; |
|
|
890 | |
|
|
891 | if (more) |
948 | if (more) |
892 | { |
949 | { |
893 | more->destroy (); |
950 | more->destroy (); |
894 | more = 0; |
951 | more = 0; |
895 | } |
952 | } |
896 | |
953 | |
|
|
954 | head = 0; |
|
|
955 | |
897 | // clear those pointers that likely might have circular references to us |
956 | // clear those pointers that likely might cause circular references |
898 | owner = 0; |
957 | owner = 0; |
899 | enemy = 0; |
958 | enemy = 0; |
900 | attacked_by = 0; |
959 | attacked_by = 0; |
901 | |
960 | current_weapon = 0; |
902 | // only relevant for players(?), but make sure of it anyways |
|
|
903 | contr = 0; |
|
|
904 | } |
961 | } |
905 | |
962 | |
906 | void |
963 | void |
907 | object::destroy (bool destroy_inventory) |
964 | object::destroy (bool destroy_inventory) |
908 | { |
965 | { |
909 | if (destroyed ()) |
966 | if (destroyed ()) |
910 | return; |
967 | return; |
911 | |
968 | |
912 | if (destroy_inventory) |
969 | if (destroy_inventory) |
913 | destroy_inv (false); |
970 | destroy_inv (false); |
|
|
971 | |
|
|
972 | if (is_head ()) |
|
|
973 | if (sound_destroy) |
|
|
974 | play_sound (sound_destroy); |
|
|
975 | else if (flag [FLAG_MONSTER]) |
|
|
976 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
914 | |
977 | |
915 | attachable::destroy (); |
978 | attachable::destroy (); |
916 | } |
979 | } |
917 | |
980 | |
918 | /* |
981 | /* |
… | |
… | |
936 | * This function removes the object op from the linked list of objects |
999 | * This function removes the object op from the linked list of objects |
937 | * which it is currently tied to. When this function is done, the |
1000 | * which it is currently tied to. When this function is done, the |
938 | * object will have no environment. If the object previously had an |
1001 | * object will have no environment. If the object previously had an |
939 | * environment, the x and y coordinates will be updated to |
1002 | * environment, the x and y coordinates will be updated to |
940 | * the previous environment. |
1003 | * the previous environment. |
941 | * Beware: This function is called from the editor as well! |
|
|
942 | */ |
1004 | */ |
943 | void |
1005 | void |
944 | object::remove () |
1006 | object::do_remove () |
945 | { |
1007 | { |
946 | object *tmp, *last = 0; |
1008 | object *tmp, *last = 0; |
947 | object *otmp; |
1009 | object *otmp; |
948 | |
1010 | |
949 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1011 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
… | |
… | |
992 | } |
1054 | } |
993 | else if (map) |
1055 | else if (map) |
994 | { |
1056 | { |
995 | if (type == PLAYER) |
1057 | if (type == PLAYER) |
996 | { |
1058 | { |
|
|
1059 | // leaving a spot always closes any open container on the ground |
|
|
1060 | if (container && !container->env) |
|
|
1061 | // this causes spurious floorbox updates, but it ensures |
|
|
1062 | // that the CLOSE event is being sent. |
|
|
1063 | close_container (); |
|
|
1064 | |
997 | --map->players; |
1065 | --map->players; |
998 | map->last_access = runtime; |
1066 | map->touch (); |
999 | } |
1067 | } |
1000 | |
1068 | |
|
|
1069 | map->dirty = true; |
|
|
1070 | mapspace &ms = this->ms (); |
1001 | |
1071 | |
1002 | /* link the object above us */ |
1072 | /* link the object above us */ |
1003 | if (above) |
1073 | if (above) |
1004 | above->below = below; |
1074 | above->below = below; |
1005 | else |
1075 | else |
1006 | map->at (x, y).top = below; /* we were top, set new top */ |
1076 | ms.top = below; /* we were top, set new top */ |
1007 | |
1077 | |
1008 | /* Relink the object below us, if there is one */ |
1078 | /* Relink the object below us, if there is one */ |
1009 | if (below) |
1079 | if (below) |
1010 | below->above = above; |
1080 | below->above = above; |
1011 | else |
1081 | else |
… | |
… | |
1013 | /* Nothing below, which means we need to relink map object for this space |
1083 | /* Nothing below, which means we need to relink map object for this space |
1014 | * use translated coordinates in case some oddness with map tiling is |
1084 | * use translated coordinates in case some oddness with map tiling is |
1015 | * evident |
1085 | * evident |
1016 | */ |
1086 | */ |
1017 | if (GET_MAP_OB (map, x, y) != this) |
1087 | if (GET_MAP_OB (map, x, y) != this) |
1018 | { |
|
|
1019 | char *dump = dump_object (this); |
|
|
1020 | LOG (llevError, |
|
|
1021 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump); |
1088 | 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 ()); |
1022 | free (dump); |
|
|
1023 | dump = dump_object (GET_MAP_OB (map, x, y)); |
|
|
1024 | LOG (llevError, "%s\n", dump); |
|
|
1025 | free (dump); |
|
|
1026 | } |
|
|
1027 | |
1089 | |
1028 | map->at (x, y).bot = above; /* goes on above it. */ |
1090 | ms.bot = above; /* goes on above it. */ |
1029 | } |
1091 | } |
1030 | |
1092 | |
1031 | above = 0; |
1093 | above = 0; |
1032 | below = 0; |
1094 | below = 0; |
1033 | |
1095 | |
1034 | if (map->in_memory == MAP_SAVING) |
1096 | if (map->in_memory == MAP_SAVING) |
1035 | return; |
1097 | return; |
1036 | |
1098 | |
1037 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1099 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1038 | |
1100 | |
|
|
1101 | if (object *pl = ms.player ()) |
|
|
1102 | { |
|
|
1103 | if (pl->container == this) |
|
|
1104 | /* If a container that the player is currently using somehow gets |
|
|
1105 | * removed (most likely destroyed), update the player view |
|
|
1106 | * appropriately. |
|
|
1107 | */ |
|
|
1108 | pl->close_container (); |
|
|
1109 | |
|
|
1110 | pl->contr->ns->floorbox_update (); |
|
|
1111 | } |
|
|
1112 | |
1039 | for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) |
1113 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1040 | { |
1114 | { |
1041 | /* No point updating the players look faces if he is the object |
1115 | /* No point updating the players look faces if he is the object |
1042 | * being removed. |
1116 | * being removed. |
1043 | */ |
1117 | */ |
1044 | |
|
|
1045 | if (tmp->type == PLAYER && tmp != this) |
|
|
1046 | { |
|
|
1047 | /* If a container that the player is currently using somehow gets |
|
|
1048 | * removed (most likely destroyed), update the player view |
|
|
1049 | * appropriately. |
|
|
1050 | */ |
|
|
1051 | if (tmp->container == this) |
|
|
1052 | { |
|
|
1053 | flag [FLAG_APPLIED] = 0; |
|
|
1054 | tmp->container = 0; |
|
|
1055 | } |
|
|
1056 | |
|
|
1057 | if (tmp->contr->ns) |
|
|
1058 | tmp->contr->ns->floorbox_update (); |
|
|
1059 | } |
|
|
1060 | |
1118 | |
1061 | /* See if object moving off should effect something */ |
1119 | /* See if object moving off should effect something */ |
1062 | if (check_walk_off |
1120 | if (check_walk_off |
1063 | && ((move_type & tmp->move_off) |
1121 | && ((move_type & tmp->move_off) |
1064 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1122 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
… | |
… | |
1067 | |
1125 | |
1068 | if (destroyed ()) |
1126 | if (destroyed ()) |
1069 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1127 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1070 | } |
1128 | } |
1071 | |
1129 | |
1072 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1073 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1074 | if (tmp->above == tmp) |
|
|
1075 | tmp->above = 0; |
|
|
1076 | |
|
|
1077 | last = tmp; |
1130 | last = tmp; |
1078 | } |
1131 | } |
1079 | |
1132 | |
1080 | /* last == NULL if there are no objects on this space */ |
1133 | /* last == NULL if there are no objects on this space */ |
1081 | //TODO: this makes little sense, why only update the topmost object? |
1134 | //TODO: this makes little sense, why only update the topmost object? |
1082 | if (!last) |
1135 | if (!last) |
1083 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1136 | map->at (x, y).flags_ = 0; |
1084 | else |
1137 | else |
1085 | update_object (last, UP_OBJ_REMOVE); |
1138 | update_object (last, UP_OBJ_REMOVE); |
1086 | |
1139 | |
1087 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1140 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1088 | update_all_los (map, x, y); |
1141 | update_all_los (map, x, y); |
… | |
… | |
1101 | merge_ob (object *op, object *top) |
1154 | merge_ob (object *op, object *top) |
1102 | { |
1155 | { |
1103 | if (!op->nrof) |
1156 | if (!op->nrof) |
1104 | return 0; |
1157 | return 0; |
1105 | |
1158 | |
1106 | if (top) |
1159 | if (!top) |
1107 | for (top = op; top && top->above; top = top->above) |
1160 | for (top = op; top && top->above; top = top->above) |
1108 | ; |
1161 | ; |
1109 | |
1162 | |
1110 | for (; top; top = top->below) |
1163 | for (; top; top = top->below) |
1111 | { |
1164 | { |
… | |
… | |
1124 | } |
1177 | } |
1125 | |
1178 | |
1126 | return 0; |
1179 | return 0; |
1127 | } |
1180 | } |
1128 | |
1181 | |
|
|
1182 | void |
|
|
1183 | object::expand_tail () |
|
|
1184 | { |
|
|
1185 | if (more) |
|
|
1186 | return; |
|
|
1187 | |
|
|
1188 | object *prev = this; |
|
|
1189 | |
|
|
1190 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
|
|
1191 | { |
|
|
1192 | object *op = arch_to_object (at); |
|
|
1193 | |
|
|
1194 | op->name = name; |
|
|
1195 | op->name_pl = name_pl; |
|
|
1196 | op->title = title; |
|
|
1197 | |
|
|
1198 | op->head = this; |
|
|
1199 | prev->more = op; |
|
|
1200 | |
|
|
1201 | prev = op; |
|
|
1202 | } |
|
|
1203 | } |
|
|
1204 | |
1129 | /* |
1205 | /* |
1130 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1206 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1131 | * job preparing multi-part monsters |
1207 | * job preparing multi-part monsters. |
1132 | */ |
1208 | */ |
1133 | object * |
1209 | object * |
1134 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1210 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1135 | { |
1211 | { |
1136 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1212 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1137 | { |
1213 | { |
1138 | tmp->x = x + tmp->arch->clone.x; |
1214 | tmp->x = x + tmp->arch->x; |
1139 | tmp->y = y + tmp->arch->clone.y; |
1215 | tmp->y = y + tmp->arch->y; |
1140 | } |
1216 | } |
1141 | |
1217 | |
1142 | return insert_ob_in_map (op, m, originator, flag); |
1218 | return insert_ob_in_map (op, m, originator, flag); |
1143 | } |
1219 | } |
1144 | |
1220 | |
… | |
… | |
1163 | * just 'op' otherwise |
1239 | * just 'op' otherwise |
1164 | */ |
1240 | */ |
1165 | object * |
1241 | object * |
1166 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1242 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1167 | { |
1243 | { |
|
|
1244 | assert (!op->flag [FLAG_FREED]); |
|
|
1245 | |
1168 | object *tmp, *top, *floor = NULL; |
1246 | object *top, *floor = NULL; |
1169 | sint16 x, y; |
|
|
1170 | |
1247 | |
1171 | if (QUERY_FLAG (op, FLAG_FREED)) |
1248 | op->remove (); |
1172 | { |
|
|
1173 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1174 | return NULL; |
|
|
1175 | } |
|
|
1176 | |
|
|
1177 | if (!m) |
|
|
1178 | { |
|
|
1179 | char *dump = dump_object (op); |
|
|
1180 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
|
|
1181 | free (dump); |
|
|
1182 | return op; |
|
|
1183 | } |
|
|
1184 | |
|
|
1185 | if (out_of_map (m, op->x, op->y)) |
|
|
1186 | { |
|
|
1187 | char *dump = dump_object (op); |
|
|
1188 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
|
|
1189 | #ifdef MANY_CORES |
|
|
1190 | /* Better to catch this here, as otherwise the next use of this object |
|
|
1191 | * is likely to cause a crash. Better to find out where it is getting |
|
|
1192 | * improperly inserted. |
|
|
1193 | */ |
|
|
1194 | abort (); |
|
|
1195 | #endif |
|
|
1196 | free (dump); |
|
|
1197 | return op; |
|
|
1198 | } |
|
|
1199 | |
|
|
1200 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1201 | { |
|
|
1202 | char *dump = dump_object (op); |
|
|
1203 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1204 | free (dump); |
|
|
1205 | return op; |
|
|
1206 | } |
|
|
1207 | |
|
|
1208 | if (op->more) |
|
|
1209 | { |
|
|
1210 | /* The part may be on a different map. */ |
|
|
1211 | |
|
|
1212 | object *more = op->more; |
|
|
1213 | |
|
|
1214 | /* We really need the caller to normalize coordinates - if |
|
|
1215 | * we set the map, that doesn't work if the location is within |
|
|
1216 | * a map and this is straddling an edge. So only if coordinate |
|
|
1217 | * is clear wrong do we normalize it. |
|
|
1218 | */ |
|
|
1219 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
|
|
1220 | more->map = get_map_from_coord (m, &more->x, &more->y); |
|
|
1221 | else if (!more->map) |
|
|
1222 | { |
|
|
1223 | /* For backwards compatibility - when not dealing with tiled maps, |
|
|
1224 | * more->map should always point to the parent. |
|
|
1225 | */ |
|
|
1226 | more->map = m; |
|
|
1227 | } |
|
|
1228 | |
|
|
1229 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
|
|
1230 | { |
|
|
1231 | if (!op->head) |
|
|
1232 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1233 | |
|
|
1234 | return 0; |
|
|
1235 | } |
|
|
1236 | } |
|
|
1237 | |
|
|
1238 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1239 | |
1249 | |
1240 | /* Ideally, the caller figures this out. However, it complicates a lot |
1250 | /* Ideally, the caller figures this out. However, it complicates a lot |
1241 | * of areas of callers (eg, anything that uses find_free_spot would now |
1251 | * of areas of callers (eg, anything that uses find_free_spot would now |
1242 | * need extra work |
1252 | * need extra work |
1243 | */ |
1253 | */ |
1244 | op->map = get_map_from_coord (m, &op->x, &op->y); |
1254 | if (!xy_normalise (m, op->x, op->y)) |
1245 | x = op->x; |
1255 | { |
1246 | y = op->y; |
1256 | op->destroy (); |
|
|
1257 | return 0; |
|
|
1258 | } |
|
|
1259 | |
|
|
1260 | if (object *more = op->more) |
|
|
1261 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1262 | return 0; |
|
|
1263 | |
|
|
1264 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1265 | |
|
|
1266 | op->map = m; |
|
|
1267 | mapspace &ms = op->ms (); |
1247 | |
1268 | |
1248 | /* this has to be done after we translate the coordinates. |
1269 | /* this has to be done after we translate the coordinates. |
1249 | */ |
1270 | */ |
1250 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1271 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1251 | for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) |
1272 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1252 | if (object::can_merge (op, tmp)) |
1273 | if (object::can_merge (op, tmp)) |
1253 | { |
1274 | { |
1254 | op->nrof += tmp->nrof; |
1275 | op->nrof += tmp->nrof; |
1255 | tmp->destroy (); |
1276 | tmp->destroy (); |
1256 | } |
1277 | } |
… | |
… | |
1273 | op->below = originator->below; |
1294 | op->below = originator->below; |
1274 | |
1295 | |
1275 | if (op->below) |
1296 | if (op->below) |
1276 | op->below->above = op; |
1297 | op->below->above = op; |
1277 | else |
1298 | else |
1278 | op->ms ().bot = op; |
1299 | ms.bot = op; |
1279 | |
1300 | |
1280 | /* since *below* originator, no need to update top */ |
1301 | /* since *below* originator, no need to update top */ |
1281 | originator->below = op; |
1302 | originator->below = op; |
1282 | } |
1303 | } |
1283 | else |
1304 | else |
1284 | { |
1305 | { |
|
|
1306 | top = ms.bot; |
|
|
1307 | |
1285 | /* If there are other objects, then */ |
1308 | /* If there are other objects, then */ |
1286 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1309 | if (top) |
1287 | { |
1310 | { |
1288 | object *last = 0; |
1311 | object *last = 0; |
1289 | |
1312 | |
1290 | /* |
1313 | /* |
1291 | * If there are multiple objects on this space, we do some trickier handling. |
1314 | * If there are multiple objects on this space, we do some trickier handling. |
… | |
… | |
1297 | * once we get to them. This reduces the need to traverse over all of |
1320 | * once we get to them. This reduces the need to traverse over all of |
1298 | * them when adding another one - this saves quite a bit of cpu time |
1321 | * them when adding another one - this saves quite a bit of cpu time |
1299 | * when lots of spells are cast in one area. Currently, it is presumed |
1322 | * when lots of spells are cast in one area. Currently, it is presumed |
1300 | * that flying non pickable objects are spell objects. |
1323 | * that flying non pickable objects are spell objects. |
1301 | */ |
1324 | */ |
1302 | while (top) |
1325 | for (top = ms.bot; top; top = top->above) |
1303 | { |
1326 | { |
1304 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1327 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1305 | floor = top; |
1328 | floor = top; |
1306 | |
1329 | |
1307 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1330 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1310 | top = top->below; |
1333 | top = top->below; |
1311 | break; |
1334 | break; |
1312 | } |
1335 | } |
1313 | |
1336 | |
1314 | last = top; |
1337 | last = top; |
1315 | top = top->above; |
|
|
1316 | } |
1338 | } |
1317 | |
1339 | |
1318 | /* Don't want top to be NULL, so set it to the last valid object */ |
1340 | /* Don't want top to be NULL, so set it to the last valid object */ |
1319 | top = last; |
1341 | top = last; |
1320 | |
1342 | |
… | |
… | |
1322 | * looks like instead of lots of conditions here. |
1344 | * looks like instead of lots of conditions here. |
1323 | * makes things faster, and effectively the same result. |
1345 | * makes things faster, and effectively the same result. |
1324 | */ |
1346 | */ |
1325 | |
1347 | |
1326 | /* Have object 'fall below' other objects that block view. |
1348 | /* Have object 'fall below' other objects that block view. |
1327 | * Unless those objects are exits, type 66 |
1349 | * Unless those objects are exits. |
1328 | * If INS_ON_TOP is used, don't do this processing |
1350 | * If INS_ON_TOP is used, don't do this processing |
1329 | * Need to find the object that in fact blocks view, otherwise |
1351 | * Need to find the object that in fact blocks view, otherwise |
1330 | * stacking is a bit odd. |
1352 | * stacking is a bit odd. |
1331 | */ |
1353 | */ |
1332 | if (!(flag & INS_ON_TOP) && |
1354 | if (!(flag & INS_ON_TOP) |
1333 | (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1355 | && ms.flags () & P_BLOCKSVIEW |
|
|
1356 | && (op->face && !faces [op->face].visibility)) |
1334 | { |
1357 | { |
1335 | for (last = top; last != floor; last = last->below) |
1358 | for (last = top; last != floor; last = last->below) |
1336 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1359 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1337 | break; |
1360 | break; |
|
|
1361 | |
1338 | /* Check to see if we found the object that blocks view, |
1362 | /* Check to see if we found the object that blocks view, |
1339 | * and make sure we have a below pointer for it so that |
1363 | * and make sure we have a below pointer for it so that |
1340 | * we can get inserted below this one, which requires we |
1364 | * we can get inserted below this one, which requires we |
1341 | * set top to the object below us. |
1365 | * set top to the object below us. |
1342 | */ |
1366 | */ |
1343 | if (last && last->below && last != floor) |
1367 | if (last && last->below && last != floor) |
1344 | top = last->below; |
1368 | top = last->below; |
1345 | } |
1369 | } |
1346 | } /* If objects on this space */ |
1370 | } /* If objects on this space */ |
1347 | |
1371 | |
1348 | if (flag & INS_MAP_LOAD) |
|
|
1349 | top = GET_MAP_TOP (op->map, op->x, op->y); |
|
|
1350 | |
|
|
1351 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1372 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1352 | top = floor; |
1373 | top = floor; |
1353 | |
1374 | |
1354 | /* Top is the object that our object (op) is going to get inserted above. |
1375 | /* Top is the object that our object (op) is going to get inserted above. |
1355 | */ |
1376 | */ |
1356 | |
1377 | |
1357 | /* First object on this space */ |
1378 | /* First object on this space */ |
1358 | if (!top) |
1379 | if (!top) |
1359 | { |
1380 | { |
1360 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1381 | op->above = ms.bot; |
1361 | |
1382 | |
1362 | if (op->above) |
1383 | if (op->above) |
1363 | op->above->below = op; |
1384 | op->above->below = op; |
1364 | |
1385 | |
1365 | op->below = 0; |
1386 | op->below = 0; |
1366 | op->ms ().bot = op; |
1387 | ms.bot = op; |
1367 | } |
1388 | } |
1368 | else |
1389 | else |
1369 | { /* get inserted into the stack above top */ |
1390 | { /* get inserted into the stack above top */ |
1370 | op->above = top->above; |
1391 | op->above = top->above; |
1371 | |
1392 | |
… | |
… | |
1375 | op->below = top; |
1396 | op->below = top; |
1376 | top->above = op; |
1397 | top->above = op; |
1377 | } |
1398 | } |
1378 | |
1399 | |
1379 | if (!op->above) |
1400 | if (!op->above) |
1380 | op->ms ().top = op; |
1401 | ms.top = op; |
1381 | } /* else not INS_BELOW_ORIGINATOR */ |
1402 | } /* else not INS_BELOW_ORIGINATOR */ |
1382 | |
1403 | |
1383 | if (op->type == PLAYER) |
1404 | if (op->type == PLAYER) |
1384 | { |
1405 | { |
1385 | op->contr->do_los = 1; |
1406 | op->contr->do_los = 1; |
1386 | ++op->map->players; |
1407 | ++op->map->players; |
1387 | op->map->last_access = runtime; |
1408 | op->map->touch (); |
1388 | } |
1409 | } |
1389 | |
1410 | |
1390 | /* If we have a floor, we know the player, if any, will be above |
1411 | op->map->dirty = true; |
1391 | * it, so save a few ticks and start from there. |
1412 | |
1392 | */ |
|
|
1393 | if (!(flag & INS_MAP_LOAD)) |
|
|
1394 | if (object *pl = op->ms ().player ()) |
1413 | if (object *pl = ms.player ()) |
1395 | if (pl->contr->ns) |
|
|
1396 | pl->contr->ns->floorbox_update (); |
1414 | pl->contr->ns->floorbox_update (); |
1397 | |
1415 | |
1398 | /* If this object glows, it may affect lighting conditions that are |
1416 | /* If this object glows, it may affect lighting conditions that are |
1399 | * visible to others on this map. But update_all_los is really |
1417 | * visible to others on this map. But update_all_los is really |
1400 | * an inefficient way to do this, as it means los for all players |
1418 | * an inefficient way to do this, as it means los for all players |
1401 | * on the map will get recalculated. The players could very well |
1419 | * on the map will get recalculated. The players could very well |
1402 | * be far away from this change and not affected in any way - |
1420 | * be far away from this change and not affected in any way - |
1403 | * this should get redone to only look for players within range, |
1421 | * this should get redone to only look for players within range, |
1404 | * or just updating the P_NEED_UPDATE for spaces within this area |
1422 | * or just updating the P_UPTODATE for spaces within this area |
1405 | * of effect may be sufficient. |
1423 | * of effect may be sufficient. |
1406 | */ |
1424 | */ |
1407 | if (op->map->darkness && (op->glow_radius != 0)) |
1425 | if (op->map->darkness && (op->glow_radius != 0)) |
1408 | update_all_los (op->map, op->x, op->y); |
1426 | update_all_los (op->map, op->x, op->y); |
1409 | |
1427 | |
… | |
… | |
1420 | * blocked() and wall() work properly), and these flags are updated by |
1438 | * blocked() and wall() work properly), and these flags are updated by |
1421 | * update_object(). |
1439 | * update_object(). |
1422 | */ |
1440 | */ |
1423 | |
1441 | |
1424 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1442 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1425 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1443 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1426 | { |
1444 | { |
1427 | if (check_move_on (op, originator)) |
1445 | if (check_move_on (op, originator)) |
1428 | return 0; |
1446 | return 0; |
1429 | |
1447 | |
1430 | /* If we are a multi part object, lets work our way through the check |
1448 | /* If we are a multi part object, lets work our way through the check |
1431 | * walk on's. |
1449 | * walk on's. |
1432 | */ |
1450 | */ |
1433 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1451 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1434 | if (check_move_on (tmp, originator)) |
1452 | if (check_move_on (tmp, originator)) |
1435 | return 0; |
1453 | return 0; |
1436 | } |
1454 | } |
1437 | |
1455 | |
1438 | return op; |
1456 | return op; |
… | |
… | |
1447 | { |
1465 | { |
1448 | object *tmp, *tmp1; |
1466 | object *tmp, *tmp1; |
1449 | |
1467 | |
1450 | /* first search for itself and remove any old instances */ |
1468 | /* first search for itself and remove any old instances */ |
1451 | |
1469 | |
1452 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1470 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1453 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1471 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1454 | tmp->destroy (); |
1472 | tmp->destroy (); |
1455 | |
1473 | |
1456 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1474 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1457 | |
1475 | |
1458 | tmp1->x = op->x; |
1476 | tmp1->x = op->x; |
… | |
… | |
1461 | } |
1479 | } |
1462 | |
1480 | |
1463 | object * |
1481 | object * |
1464 | object::insert_at (object *where, object *originator, int flags) |
1482 | object::insert_at (object *where, object *originator, int flags) |
1465 | { |
1483 | { |
|
|
1484 | if (where->env) |
|
|
1485 | return where->env->insert (this); |
|
|
1486 | else |
1466 | where->map->insert (this, where->x, where->y, originator, flags); |
1487 | return where->map->insert (this, where->x, where->y, originator, flags); |
1467 | } |
1488 | } |
1468 | |
1489 | |
1469 | /* |
1490 | /* |
1470 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1491 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1471 | * is returned contains nr objects, and the remaining parts contains |
1492 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1491 | orig_ob->destroy (1); |
1512 | orig_ob->destroy (1); |
1492 | else if (!is_removed) |
1513 | else if (!is_removed) |
1493 | { |
1514 | { |
1494 | if (orig_ob->env != NULL) |
1515 | if (orig_ob->env != NULL) |
1495 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1516 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1496 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
1517 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_ACTIVE) |
1497 | { |
1518 | { |
1498 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
1519 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
1499 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
1520 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
1500 | return NULL; |
1521 | return NULL; |
1501 | } |
1522 | } |
… | |
… | |
1511 | * the amount of an object. If the amount reaches 0, the object |
1532 | * the amount of an object. If the amount reaches 0, the object |
1512 | * is subsequently removed and freed. |
1533 | * is subsequently removed and freed. |
1513 | * |
1534 | * |
1514 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1535 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1515 | */ |
1536 | */ |
1516 | |
|
|
1517 | object * |
1537 | object * |
1518 | decrease_ob_nr (object *op, uint32 i) |
1538 | decrease_ob_nr (object *op, uint32 i) |
1519 | { |
1539 | { |
1520 | object *tmp; |
1540 | object *tmp; |
1521 | |
1541 | |
… | |
… | |
1596 | |
1616 | |
1597 | /* |
1617 | /* |
1598 | * add_weight(object, weight) adds the specified weight to an object, |
1618 | * add_weight(object, weight) adds the specified weight to an object, |
1599 | * and also updates how much the environment(s) is/are carrying. |
1619 | * and also updates how much the environment(s) is/are carrying. |
1600 | */ |
1620 | */ |
1601 | |
|
|
1602 | void |
1621 | void |
1603 | add_weight (object *op, signed long weight) |
1622 | add_weight (object *op, signed long weight) |
1604 | { |
1623 | { |
1605 | while (op != NULL) |
1624 | while (op != NULL) |
1606 | { |
1625 | { |
… | |
… | |
1621 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1640 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1622 | free (dump); |
1641 | free (dump); |
1623 | return op; |
1642 | return op; |
1624 | } |
1643 | } |
1625 | |
1644 | |
1626 | if (where->head) |
1645 | if (where->head_ () != where) |
1627 | { |
1646 | { |
1628 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1647 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1629 | where = where->head; |
1648 | where = where->head; |
1630 | } |
1649 | } |
1631 | |
1650 | |
1632 | return where->insert (op); |
1651 | return where->insert (op); |
1633 | } |
1652 | } |
… | |
… | |
1638 | * inside the object environment. |
1657 | * inside the object environment. |
1639 | * |
1658 | * |
1640 | * The function returns now pointer to inserted item, and return value can |
1659 | * The function returns now pointer to inserted item, and return value can |
1641 | * be != op, if items are merged. -Tero |
1660 | * be != op, if items are merged. -Tero |
1642 | */ |
1661 | */ |
1643 | |
|
|
1644 | object * |
1662 | object * |
1645 | object::insert (object *op) |
1663 | object::insert (object *op) |
1646 | { |
1664 | { |
1647 | object *tmp, *otmp; |
|
|
1648 | |
|
|
1649 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1665 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1650 | op->remove (); |
1666 | op->remove (); |
1651 | |
1667 | |
1652 | if (op->more) |
1668 | if (op->more) |
1653 | { |
1669 | { |
… | |
… | |
1655 | return op; |
1671 | return op; |
1656 | } |
1672 | } |
1657 | |
1673 | |
1658 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1674 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1659 | CLEAR_FLAG (op, FLAG_REMOVED); |
1675 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1676 | |
1660 | if (op->nrof) |
1677 | if (op->nrof) |
1661 | { |
1678 | { |
1662 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1679 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1663 | if (object::can_merge (tmp, op)) |
1680 | if (object::can_merge (tmp, op)) |
1664 | { |
1681 | { |
1665 | /* return the original object and remove inserted object |
1682 | /* return the original object and remove inserted object |
1666 | (client needs the original object) */ |
1683 | (client needs the original object) */ |
1667 | tmp->nrof += op->nrof; |
1684 | tmp->nrof += op->nrof; |
… | |
… | |
1686 | add_weight (this, op->weight * op->nrof); |
1703 | add_weight (this, op->weight * op->nrof); |
1687 | } |
1704 | } |
1688 | else |
1705 | else |
1689 | add_weight (this, (op->weight + op->carrying)); |
1706 | add_weight (this, (op->weight + op->carrying)); |
1690 | |
1707 | |
1691 | otmp = this->in_player (); |
1708 | if (object *otmp = this->in_player ()) |
1692 | if (otmp && otmp->contr) |
|
|
1693 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1709 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1694 | otmp->update_stats (); |
1710 | otmp->update_stats (); |
1695 | |
1711 | |
|
|
1712 | op->owner = 0; // its his/hers now. period. |
1696 | op->map = 0; |
1713 | op->map = 0; |
1697 | op->env = this; |
1714 | op->env = this; |
1698 | op->above = 0; |
1715 | op->above = 0; |
1699 | op->below = 0; |
1716 | op->below = 0; |
1700 | op->x = 0, op->y = 0; |
1717 | op->x = op->y = 0; |
1701 | |
1718 | |
1702 | /* reset the light list and los of the players on the map */ |
1719 | /* reset the light list and los of the players on the map */ |
1703 | if ((op->glow_radius != 0) && map) |
1720 | if (op->glow_radius && map) |
1704 | { |
1721 | { |
1705 | #ifdef DEBUG_LIGHTS |
1722 | #ifdef DEBUG_LIGHTS |
1706 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1723 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1707 | #endif /* DEBUG_LIGHTS */ |
1724 | #endif /* DEBUG_LIGHTS */ |
1708 | if (map->darkness) |
1725 | if (map->darkness) |
… | |
… | |
1780 | |
1797 | |
1781 | /* The objects have to be checked from top to bottom. |
1798 | /* The objects have to be checked from top to bottom. |
1782 | * Hence, we first go to the top: |
1799 | * Hence, we first go to the top: |
1783 | */ |
1800 | */ |
1784 | |
1801 | |
1785 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above) |
1802 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
1786 | { |
1803 | { |
1787 | /* Trim the search when we find the first other spell effect |
1804 | /* Trim the search when we find the first other spell effect |
1788 | * this helps performance so that if a space has 50 spell objects, |
1805 | * this helps performance so that if a space has 50 spell objects, |
1789 | * we don't need to check all of them. |
1806 | * we don't need to check all of them. |
1790 | */ |
1807 | */ |
… | |
… | |
1808 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1825 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1809 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1826 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1810 | { |
1827 | { |
1811 | |
1828 | |
1812 | float |
1829 | float |
1813 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1830 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1814 | |
1831 | |
1815 | if (op->type == PLAYER) |
1832 | if (op->type == PLAYER) |
1816 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1833 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1817 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1834 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1818 | diff /= 4.0; |
1835 | diff /= 4.0; |
… | |
… | |
1848 | * The first matching object is returned, or NULL if none. |
1865 | * The first matching object is returned, or NULL if none. |
1849 | */ |
1866 | */ |
1850 | object * |
1867 | object * |
1851 | present_arch (const archetype *at, maptile *m, int x, int y) |
1868 | present_arch (const archetype *at, maptile *m, int x, int y) |
1852 | { |
1869 | { |
1853 | if (m == NULL || out_of_map (m, x, y)) |
1870 | if (!m || out_of_map (m, x, y)) |
1854 | { |
1871 | { |
1855 | LOG (llevError, "Present_arch called outside map.\n"); |
1872 | LOG (llevError, "Present_arch called outside map.\n"); |
1856 | return NULL; |
1873 | return NULL; |
1857 | } |
1874 | } |
1858 | |
1875 | |
1859 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1876 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1860 | if (tmp->arch == at) |
1877 | if (tmp->arch == at) |
1861 | return tmp; |
1878 | return tmp; |
1862 | |
1879 | |
1863 | return NULL; |
1880 | return NULL; |
1864 | } |
1881 | } |
… | |
… | |
1875 | { |
1892 | { |
1876 | LOG (llevError, "Present called outside map.\n"); |
1893 | LOG (llevError, "Present called outside map.\n"); |
1877 | return NULL; |
1894 | return NULL; |
1878 | } |
1895 | } |
1879 | |
1896 | |
1880 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1897 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1881 | if (tmp->type == type) |
1898 | if (tmp->type == type) |
1882 | return tmp; |
1899 | return tmp; |
1883 | |
1900 | |
1884 | return NULL; |
1901 | return NULL; |
1885 | } |
1902 | } |
… | |
… | |
1942 | * activate recursively a flag on an object inventory |
1959 | * activate recursively a flag on an object inventory |
1943 | */ |
1960 | */ |
1944 | void |
1961 | void |
1945 | flag_inv (object *op, int flag) |
1962 | flag_inv (object *op, int flag) |
1946 | { |
1963 | { |
1947 | if (op->inv) |
|
|
1948 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1964 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1949 | { |
1965 | { |
1950 | SET_FLAG (tmp, flag); |
1966 | SET_FLAG (tmp, flag); |
1951 | flag_inv (tmp, flag); |
1967 | flag_inv (tmp, flag); |
1952 | } |
1968 | } |
1953 | } |
1969 | } |
1954 | |
1970 | |
1955 | /* |
1971 | /* |
1956 | * deactivate recursively a flag on an object inventory |
1972 | * deactivate recursively a flag on an object inventory |
1957 | */ |
1973 | */ |
1958 | void |
1974 | void |
1959 | unflag_inv (object *op, int flag) |
1975 | unflag_inv (object *op, int flag) |
1960 | { |
1976 | { |
1961 | if (op->inv) |
|
|
1962 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1977 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1963 | { |
1978 | { |
1964 | CLEAR_FLAG (tmp, flag); |
1979 | CLEAR_FLAG (tmp, flag); |
1965 | unflag_inv (tmp, flag); |
1980 | unflag_inv (tmp, flag); |
1966 | } |
1981 | } |
1967 | } |
|
|
1968 | |
|
|
1969 | /* |
|
|
1970 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
1971 | * all it's inventory (recursively). |
|
|
1972 | * If checksums are used, a player will get set_cheat called for |
|
|
1973 | * him/her-self and all object carried by a call to this function. |
|
|
1974 | */ |
|
|
1975 | void |
|
|
1976 | set_cheat (object *op) |
|
|
1977 | { |
|
|
1978 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
1979 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
1980 | } |
1982 | } |
1981 | |
1983 | |
1982 | /* |
1984 | /* |
1983 | * find_free_spot(object, map, x, y, start, stop) will search for |
1985 | * find_free_spot(object, map, x, y, start, stop) will search for |
1984 | * a spot at the given map and coordinates which will be able to contain |
1986 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
1986 | * to search (see the freearr_x/y[] definition). |
1988 | * to search (see the freearr_x/y[] definition). |
1987 | * It returns a random choice among the alternatives found. |
1989 | * It returns a random choice among the alternatives found. |
1988 | * start and stop are where to start relative to the free_arr array (1,9 |
1990 | * start and stop are where to start relative to the free_arr array (1,9 |
1989 | * does all 4 immediate directions). This returns the index into the |
1991 | * does all 4 immediate directions). This returns the index into the |
1990 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1992 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1991 | * Note - this only checks to see if there is space for the head of the |
|
|
1992 | * object - if it is a multispace object, this should be called for all |
|
|
1993 | * pieces. |
|
|
1994 | * Note2: This function does correctly handle tiled maps, but does not |
1993 | * Note: This function does correctly handle tiled maps, but does not |
1995 | * inform the caller. However, insert_ob_in_map will update as |
1994 | * inform the caller. However, insert_ob_in_map will update as |
1996 | * necessary, so the caller shouldn't need to do any special work. |
1995 | * necessary, so the caller shouldn't need to do any special work. |
1997 | * Note - updated to take an object instead of archetype - this is necessary |
1996 | * Note - updated to take an object instead of archetype - this is necessary |
1998 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1997 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1999 | * to know if the space in question will block the object. We can't use |
1998 | * to know if the space in question will block the object. We can't use |
… | |
… | |
2001 | * customized, changed states, etc. |
2000 | * customized, changed states, etc. |
2002 | */ |
2001 | */ |
2003 | int |
2002 | int |
2004 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2003 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2005 | { |
2004 | { |
|
|
2005 | int altern[SIZEOFFREE]; |
2006 | int index = 0, flag; |
2006 | int index = 0, flag; |
2007 | int altern[SIZEOFFREE]; |
|
|
2008 | |
2007 | |
2009 | for (int i = start; i < stop; i++) |
2008 | for (int i = start; i < stop; i++) |
2010 | { |
2009 | { |
2011 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
2010 | mapxy pos (m, x, y); pos.move (i); |
2012 | if (!flag) |
2011 | |
|
|
2012 | if (!pos.normalise ()) |
|
|
2013 | continue; |
|
|
2014 | |
|
|
2015 | mapspace &ms = *pos; |
|
|
2016 | |
|
|
2017 | if (ms.flags () & P_IS_ALIVE) |
|
|
2018 | continue; |
|
|
2019 | |
|
|
2020 | /* However, often |
|
|
2021 | * ob doesn't have any move type (when used to place exits) |
|
|
2022 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
2023 | */ |
|
|
2024 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
2025 | { |
2013 | altern [index++] = i; |
2026 | altern [index++] = i; |
|
|
2027 | continue; |
|
|
2028 | } |
2014 | |
2029 | |
2015 | /* Basically, if we find a wall on a space, we cut down the search size. |
2030 | /* Basically, if we find a wall on a space, we cut down the search size. |
2016 | * In this way, we won't return spaces that are on another side of a wall. |
2031 | * In this way, we won't return spaces that are on another side of a wall. |
2017 | * This mostly work, but it cuts down the search size in all directions - |
2032 | * This mostly work, but it cuts down the search size in all directions - |
2018 | * if the space being examined only has a wall to the north and empty |
2033 | * if the space being examined only has a wall to the north and empty |
2019 | * spaces in all the other directions, this will reduce the search space |
2034 | * spaces in all the other directions, this will reduce the search space |
2020 | * to only the spaces immediately surrounding the target area, and |
2035 | * to only the spaces immediately surrounding the target area, and |
2021 | * won't look 2 spaces south of the target space. |
2036 | * won't look 2 spaces south of the target space. |
2022 | */ |
2037 | */ |
2023 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
2038 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
2039 | { |
2024 | stop = maxfree[i]; |
2040 | stop = maxfree[i]; |
|
|
2041 | continue; |
|
|
2042 | } |
|
|
2043 | |
|
|
2044 | /* Note it is intentional that we check ob - the movement type of the |
|
|
2045 | * head of the object should correspond for the entire object. |
|
|
2046 | */ |
|
|
2047 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
2048 | continue; |
|
|
2049 | |
|
|
2050 | if (ob->blocked (m, pos.x, pos.y)) |
|
|
2051 | continue; |
|
|
2052 | |
|
|
2053 | altern [index++] = i; |
2025 | } |
2054 | } |
2026 | |
2055 | |
2027 | if (!index) |
2056 | if (!index) |
2028 | return -1; |
2057 | return -1; |
2029 | |
2058 | |
2030 | return altern[RANDOM () % index]; |
2059 | return altern [rndm (index)]; |
2031 | } |
2060 | } |
2032 | |
2061 | |
2033 | /* |
2062 | /* |
2034 | * find_first_free_spot(archetype, maptile, x, y) works like |
2063 | * find_first_free_spot(archetype, maptile, x, y) works like |
2035 | * find_free_spot(), but it will search max number of squares. |
2064 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
2038 | */ |
2067 | */ |
2039 | int |
2068 | int |
2040 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2069 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2041 | { |
2070 | { |
2042 | for (int i = 0; i < SIZEOFFREE; i++) |
2071 | for (int i = 0; i < SIZEOFFREE; i++) |
2043 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2072 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2044 | return i; |
2073 | return i; |
2045 | |
2074 | |
2046 | return -1; |
2075 | return -1; |
2047 | } |
2076 | } |
2048 | |
2077 | |
… | |
… | |
2056 | { |
2085 | { |
2057 | arr += begin; |
2086 | arr += begin; |
2058 | end -= begin; |
2087 | end -= begin; |
2059 | |
2088 | |
2060 | while (--end) |
2089 | while (--end) |
2061 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2090 | swap (arr [end], arr [rndm (end + 1)]); |
2062 | } |
2091 | } |
2063 | |
2092 | |
2064 | /* new function to make monster searching more efficient, and effective! |
2093 | /* new function to make monster searching more efficient, and effective! |
2065 | * This basically returns a randomized array (in the passed pointer) of |
2094 | * This basically returns a randomized array (in the passed pointer) of |
2066 | * the spaces to find monsters. In this way, it won't always look for |
2095 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2102 | object *tmp; |
2131 | object *tmp; |
2103 | maptile *mp; |
2132 | maptile *mp; |
2104 | |
2133 | |
2105 | MoveType blocked, move_type; |
2134 | MoveType blocked, move_type; |
2106 | |
2135 | |
2107 | if (exclude && exclude->head) |
2136 | if (exclude && exclude->head_ () != exclude) |
2108 | { |
2137 | { |
2109 | exclude = exclude->head; |
2138 | exclude = exclude->head; |
2110 | move_type = exclude->move_type; |
2139 | move_type = exclude->move_type; |
2111 | } |
2140 | } |
2112 | else |
2141 | else |
… | |
… | |
2135 | max = maxfree[i]; |
2164 | max = maxfree[i]; |
2136 | else if (mflags & P_IS_ALIVE) |
2165 | else if (mflags & P_IS_ALIVE) |
2137 | { |
2166 | { |
2138 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2167 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2139 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2168 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2140 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2169 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2141 | break; |
2170 | break; |
2142 | |
2171 | |
2143 | if (tmp) |
2172 | if (tmp) |
2144 | return freedir[i]; |
2173 | return freedir[i]; |
2145 | } |
2174 | } |
… | |
… | |
2200 | |
2229 | |
2201 | return 3; |
2230 | return 3; |
2202 | } |
2231 | } |
2203 | |
2232 | |
2204 | /* |
2233 | /* |
2205 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
2206 | * the "absolute" direction of a number (it actually takes care of |
|
|
2207 | * "overflow" in previous calculations of a direction). |
|
|
2208 | */ |
|
|
2209 | |
|
|
2210 | int |
|
|
2211 | absdir (int d) |
|
|
2212 | { |
|
|
2213 | while (d < 1) |
|
|
2214 | d += 8; |
|
|
2215 | |
|
|
2216 | while (d > 8) |
|
|
2217 | d -= 8; |
|
|
2218 | |
|
|
2219 | return d; |
|
|
2220 | } |
|
|
2221 | |
|
|
2222 | /* |
|
|
2223 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2234 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2224 | * between two directions (which are expected to be absolute (see absdir()) |
2235 | * between two directions (which are expected to be absolute (see absdir()) |
2225 | */ |
2236 | */ |
2226 | |
|
|
2227 | int |
2237 | int |
2228 | dirdiff (int dir1, int dir2) |
2238 | dirdiff (int dir1, int dir2) |
2229 | { |
2239 | { |
2230 | int d; |
2240 | int d; |
2231 | |
2241 | |
… | |
… | |
2344 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2354 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2345 | * core dumps if they do. |
2355 | * core dumps if they do. |
2346 | * |
2356 | * |
2347 | * Add a check so we can't pick up invisible objects (0.93.8) |
2357 | * Add a check so we can't pick up invisible objects (0.93.8) |
2348 | */ |
2358 | */ |
2349 | |
|
|
2350 | int |
2359 | int |
2351 | can_pick (const object *who, const object *item) |
2360 | can_pick (const object *who, const object *item) |
2352 | { |
2361 | { |
2353 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2362 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2354 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2363 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
… | |
… | |
2359 | * create clone from object to another |
2368 | * create clone from object to another |
2360 | */ |
2369 | */ |
2361 | object * |
2370 | object * |
2362 | object_create_clone (object *asrc) |
2371 | object_create_clone (object *asrc) |
2363 | { |
2372 | { |
2364 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2373 | object *dst = 0, *tmp, *src, *prev, *item; |
2365 | |
2374 | |
2366 | if (!asrc) |
2375 | if (!asrc) |
2367 | return 0; |
2376 | return 0; |
2368 | |
2377 | |
2369 | src = asrc; |
|
|
2370 | if (src->head) |
|
|
2371 | src = src->head; |
2378 | src = asrc->head_ (); |
2372 | |
2379 | |
2373 | prev = 0; |
2380 | prev = 0; |
2374 | for (part = src; part; part = part->more) |
2381 | for (object *part = src; part; part = part->more) |
2375 | { |
2382 | { |
2376 | tmp = part->clone (); |
2383 | tmp = part->clone (); |
2377 | tmp->x -= src->x; |
2384 | tmp->x -= src->x; |
2378 | tmp->y -= src->y; |
2385 | tmp->y -= src->y; |
2379 | |
2386 | |
… | |
… | |
2395 | |
2402 | |
2396 | for (item = src->inv; item; item = item->below) |
2403 | for (item = src->inv; item; item = item->below) |
2397 | insert_ob_in_ob (object_create_clone (item), dst); |
2404 | insert_ob_in_ob (object_create_clone (item), dst); |
2398 | |
2405 | |
2399 | return dst; |
2406 | return dst; |
2400 | } |
|
|
2401 | |
|
|
2402 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2403 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2404 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2405 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2406 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2407 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2408 | object * |
|
|
2409 | load_object_str (const char *obstr) |
|
|
2410 | { |
|
|
2411 | object *op; |
|
|
2412 | char filename[MAX_BUF]; |
|
|
2413 | |
|
|
2414 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2415 | |
|
|
2416 | FILE *tempfile = fopen (filename, "w"); |
|
|
2417 | |
|
|
2418 | if (tempfile == NULL) |
|
|
2419 | { |
|
|
2420 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2421 | return NULL; |
|
|
2422 | } |
|
|
2423 | |
|
|
2424 | fprintf (tempfile, obstr); |
|
|
2425 | fclose (tempfile); |
|
|
2426 | |
|
|
2427 | op = object::create (); |
|
|
2428 | |
|
|
2429 | object_thawer thawer (filename); |
|
|
2430 | |
|
|
2431 | if (thawer) |
|
|
2432 | load_object (thawer, op, 0); |
|
|
2433 | |
|
|
2434 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2435 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2436 | |
|
|
2437 | return op; |
|
|
2438 | } |
2407 | } |
2439 | |
2408 | |
2440 | /* This returns the first object in who's inventory that |
2409 | /* This returns the first object in who's inventory that |
2441 | * has the same type and subtype match. |
2410 | * has the same type and subtype match. |
2442 | * returns NULL if no match. |
2411 | * returns NULL if no match. |
… | |
… | |
2497 | if (link->key == canonical_key) |
2466 | if (link->key == canonical_key) |
2498 | return link->value; |
2467 | return link->value; |
2499 | |
2468 | |
2500 | return 0; |
2469 | return 0; |
2501 | } |
2470 | } |
2502 | |
|
|
2503 | |
2471 | |
2504 | /* |
2472 | /* |
2505 | * Updates the canonical_key in op to value. |
2473 | * Updates the canonical_key in op to value. |
2506 | * |
2474 | * |
2507 | * canonical_key is a shared string (value doesn't have to be). |
2475 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2531 | /* Basically, if the archetype has this key set, |
2499 | /* Basically, if the archetype has this key set, |
2532 | * we need to store the null value so when we save |
2500 | * we need to store the null value so when we save |
2533 | * it, we save the empty value so that when we load, |
2501 | * it, we save the empty value so that when we load, |
2534 | * we get this value back again. |
2502 | * we get this value back again. |
2535 | */ |
2503 | */ |
2536 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2504 | if (get_ob_key_link (op->arch, canonical_key)) |
2537 | field->value = 0; |
2505 | field->value = 0; |
2538 | else |
2506 | else |
2539 | { |
2507 | { |
2540 | if (last) |
2508 | if (last) |
2541 | last->next = field->next; |
2509 | last->next = field->next; |
… | |
… | |
2610 | } |
2578 | } |
2611 | else |
2579 | else |
2612 | item = item->env; |
2580 | item = item->env; |
2613 | } |
2581 | } |
2614 | |
2582 | |
|
|
2583 | const char * |
|
|
2584 | object::flag_desc (char *desc, int len) const |
|
|
2585 | { |
|
|
2586 | char *p = desc; |
|
|
2587 | bool first = true; |
|
|
2588 | |
|
|
2589 | *p = 0; |
|
|
2590 | |
|
|
2591 | for (int i = 0; i < NUM_FLAGS; i++) |
|
|
2592 | { |
|
|
2593 | if (len <= 10) // magic constant! |
|
|
2594 | { |
|
|
2595 | snprintf (p, len, ",..."); |
|
|
2596 | break; |
|
|
2597 | } |
|
|
2598 | |
|
|
2599 | if (flag [i]) |
|
|
2600 | { |
|
|
2601 | int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
|
|
2602 | len -= cnt; |
|
|
2603 | p += cnt; |
|
|
2604 | first = false; |
|
|
2605 | } |
|
|
2606 | } |
|
|
2607 | |
|
|
2608 | return desc; |
|
|
2609 | } |
|
|
2610 | |
2615 | // return a suitable string describing an objetc in enough detail to find it |
2611 | // return a suitable string describing an object in enough detail to find it |
2616 | const char * |
2612 | const char * |
2617 | object::debug_desc (char *info) const |
2613 | object::debug_desc (char *info) const |
2618 | { |
2614 | { |
|
|
2615 | char flagdesc[512]; |
2619 | char info2[256 * 3]; |
2616 | char info2[256 * 4]; |
2620 | char *p = info; |
2617 | char *p = info; |
2621 | |
2618 | |
2622 | p += snprintf (p, 256, "%d=\"%s%s%s\"", |
2619 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2623 | count, |
2620 | count, |
|
|
2621 | uuid.c_str (), |
2624 | &name, |
2622 | &name, |
2625 | title ? " " : "", |
2623 | title ? "\",title:\"" : "", |
2626 | title ? (const char *)title : ""); |
2624 | title ? (const char *)title : "", |
|
|
2625 | flag_desc (flagdesc, 512), type); |
2627 | |
2626 | |
2628 | if (env) |
2627 | if (!this->flag[FLAG_REMOVED] && env) |
2629 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2628 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2630 | |
2629 | |
2631 | if (map) |
2630 | if (map) |
2632 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2631 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2633 | |
2632 | |
… | |
… | |
2635 | } |
2634 | } |
2636 | |
2635 | |
2637 | const char * |
2636 | const char * |
2638 | object::debug_desc () const |
2637 | object::debug_desc () const |
2639 | { |
2638 | { |
2640 | static char info[256 * 3]; |
2639 | static char info[3][256 * 4]; |
|
|
2640 | static int info_idx; |
|
|
2641 | |
2641 | return debug_desc (info); |
2642 | return debug_desc (info [++info_idx % 3]); |
2642 | } |
2643 | } |
2643 | |
2644 | |
|
|
2645 | struct region * |
|
|
2646 | object::region () const |
|
|
2647 | { |
|
|
2648 | return map ? map->region (x, y) |
|
|
2649 | : region::default_region (); |
|
|
2650 | } |
|
|
2651 | |
|
|
2652 | const materialtype_t * |
|
|
2653 | object::dominant_material () const |
|
|
2654 | { |
|
|
2655 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2656 | return mt; |
|
|
2657 | |
|
|
2658 | return name_to_material (shstr_unknown); |
|
|
2659 | } |
|
|
2660 | |
|
|
2661 | void |
|
|
2662 | object::open_container (object *new_container) |
|
|
2663 | { |
|
|
2664 | if (container == new_container) |
|
|
2665 | return; |
|
|
2666 | |
|
|
2667 | if (object *old_container = container) |
|
|
2668 | { |
|
|
2669 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2670 | return; |
|
|
2671 | |
|
|
2672 | #if 0 |
|
|
2673 | // remove the "Close old_container" object. |
|
|
2674 | if (object *closer = old_container->inv) |
|
|
2675 | if (closer->type == CLOSE_CON) |
|
|
2676 | closer->destroy (); |
|
|
2677 | #endif |
|
|
2678 | |
|
|
2679 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2680 | container = 0; |
|
|
2681 | |
|
|
2682 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2683 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2684 | play_sound (sound_find ("chest_close")); |
|
|
2685 | } |
|
|
2686 | |
|
|
2687 | if (new_container) |
|
|
2688 | { |
|
|
2689 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2690 | return; |
|
|
2691 | |
|
|
2692 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2693 | #if 0 |
|
|
2694 | // insert the "Close Container" object. |
|
|
2695 | if (archetype *closer = new_container->other_arch) |
|
|
2696 | { |
|
|
2697 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2698 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2699 | new_container->insert (closer); |
|
|
2700 | } |
|
|
2701 | #endif |
|
|
2702 | |
|
|
2703 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2704 | |
|
|
2705 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2706 | container = new_container; |
|
|
2707 | |
|
|
2708 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2709 | esrv_send_inventory (this, new_container); |
|
|
2710 | play_sound (sound_find ("chest_open")); |
|
|
2711 | } |
|
|
2712 | } |
|
|
2713 | |
|
|
2714 | object * |
|
|
2715 | object::force_find (const shstr name) |
|
|
2716 | { |
|
|
2717 | /* cycle through his inventory to look for the MARK we want to |
|
|
2718 | * place |
|
|
2719 | */ |
|
|
2720 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2721 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2722 | return splay (tmp); |
|
|
2723 | |
|
|
2724 | return 0; |
|
|
2725 | } |
|
|
2726 | |
|
|
2727 | void |
|
|
2728 | object::force_add (const shstr name, int duration) |
|
|
2729 | { |
|
|
2730 | if (object *force = force_find (name)) |
|
|
2731 | force->destroy (); |
|
|
2732 | |
|
|
2733 | object *force = get_archetype (FORCE_NAME); |
|
|
2734 | |
|
|
2735 | force->slaying = name; |
|
|
2736 | force->stats.food = 1; |
|
|
2737 | force->speed_left = -1.f; |
|
|
2738 | |
|
|
2739 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2740 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2741 | force->flag [FLAG_APPLIED] = true; |
|
|
2742 | |
|
|
2743 | insert (force); |
|
|
2744 | } |
|
|
2745 | |
|
|
2746 | void |
|
|
2747 | object::play_sound (faceidx sound) const |
|
|
2748 | { |
|
|
2749 | if (!sound) |
|
|
2750 | return; |
|
|
2751 | |
|
|
2752 | if (flag [FLAG_REMOVED]) |
|
|
2753 | return; |
|
|
2754 | |
|
|
2755 | if (env) |
|
|
2756 | { |
|
|
2757 | if (object *pl = in_player ()) |
|
|
2758 | pl->contr->play_sound (sound); |
|
|
2759 | } |
|
|
2760 | else |
|
|
2761 | map->play_sound (sound, x, y); |
|
|
2762 | } |
|
|
2763 | |