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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | |
7 | * |
8 | This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | (at your option) any later version. |
11 | * (at your option) any later version. |
12 | |
12 | * |
13 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | |
17 | * |
18 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
19 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
21 | |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
|
|
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
26 | sub/add_weight will transcend the environment updating the carrying |
25 | sub/add_weight will transcend the environment updating the carrying |
27 | variable. */ |
26 | variable. */ |
|
|
27 | |
28 | #include <global.h> |
28 | #include <global.h> |
29 | #include <stdio.h> |
29 | #include <stdio.h> |
30 | #include <sys/types.h> |
30 | #include <sys/types.h> |
31 | #include <sys/uio.h> |
31 | #include <sys/uio.h> |
32 | #include <object.h> |
32 | #include <object.h> |
33 | #include <funcpoint.h> |
33 | #include <funcpoint.h> |
|
|
34 | #include <sproto.h> |
34 | #include <loader.h> |
35 | #include <loader.h> |
35 | |
36 | |
36 | #include <bitset> |
37 | #include <bitset> |
37 | |
38 | |
38 | int nrofallocobjects = 0; |
39 | UUID UUID::cur; |
39 | static UUID uuid; |
40 | static uint64_t seq_next_save; |
40 | const uint64 UUID_SKIP = 1<<19; |
41 | static const uint64 UUID_GAP = 1<<19; |
41 | |
42 | |
42 | objectvec objects; |
43 | objectvec objects; |
43 | activevec actives; |
44 | activevec actives; |
44 | |
45 | |
45 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
46 | short freearr_x[SIZEOFFREE] = { |
|
|
47 | 0, |
|
|
48 | 0, 1, 1, 1, 0, -1, -1, -1, |
|
|
49 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
46 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
50 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
47 | }; |
51 | }; |
48 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
52 | short freearr_y[SIZEOFFREE] = { |
|
|
53 | 0, |
|
|
54 | -1, -1, 0, 1, 1, 1, 0, -1, |
|
|
55 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
49 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
56 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
50 | }; |
57 | }; |
51 | 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, |
58 | int maxfree[SIZEOFFREE] = { |
|
|
59 | 0, |
|
|
60 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
61 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
52 | 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 |
62 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
53 | }; |
63 | }; |
54 | int freedir[SIZEOFFREE] = { |
64 | int freedir[SIZEOFFREE] = { |
55 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
65 | 0, |
|
|
66 | 1, 2, 3, 4, 5, 6, 7, 8, |
|
|
67 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
56 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
68 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
57 | }; |
69 | }; |
58 | |
70 | |
59 | static void |
71 | static void |
60 | write_uuid (void) |
72 | write_uuid (uval64 skip, bool sync) |
61 | { |
73 | { |
62 | char filename1[MAX_BUF], filename2[MAX_BUF]; |
74 | CALL_BEGIN (2); |
63 | |
75 | CALL_ARG_SV (newSVval64 (skip)); |
64 | sprintf (filename1, "%s/uuid", settings.localdir); |
76 | CALL_ARG_SV (boolSV (sync)); |
65 | sprintf (filename2, "%s/uuid~", settings.localdir); |
77 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
66 | |
78 | CALL_END; |
67 | FILE *fp; |
|
|
68 | |
|
|
69 | if (!(fp = fopen (filename2, "w"))) |
|
|
70 | { |
|
|
71 | LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); |
|
|
72 | return; |
|
|
73 | } |
|
|
74 | |
|
|
75 | fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2); |
|
|
76 | fclose (fp); |
|
|
77 | rename (filename2, filename1); |
|
|
78 | } |
79 | } |
79 | |
80 | |
80 | static void |
81 | static void |
81 | read_uuid (void) |
82 | read_uuid (void) |
82 | { |
83 | { |
83 | char filename[MAX_BUF]; |
84 | char filename[MAX_BUF]; |
84 | |
85 | |
85 | sprintf (filename, "%s/uuid", settings.localdir); |
86 | sprintf (filename, "%s/uuid", settings.localdir); |
86 | |
87 | |
|
|
88 | seq_next_save = 0; |
|
|
89 | |
87 | FILE *fp; |
90 | FILE *fp; |
88 | |
91 | |
89 | if (!(fp = fopen (filename, "r"))) |
92 | if (!(fp = fopen (filename, "r"))) |
90 | { |
93 | { |
91 | if (errno == ENOENT) |
94 | if (errno == ENOENT) |
92 | { |
95 | { |
93 | LOG (llevInfo, "RESET uid to 1\n"); |
96 | LOG (llevInfo, "RESET uid to 1\n"); |
94 | uuid.seq = 0; |
97 | UUID::cur.seq = 0; |
95 | write_uuid (); |
98 | write_uuid (UUID_GAP, true); |
96 | return; |
99 | return; |
97 | } |
100 | } |
98 | |
101 | |
99 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
102 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
100 | _exit (1); |
103 | _exit (1); |
101 | } |
104 | } |
102 | |
105 | |
103 | int version; |
106 | UUID::BUF buf; |
104 | unsigned long long uid; |
107 | buf[0] = 0; |
105 | if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1) |
108 | fgets (buf, sizeof (buf), fp); |
|
|
109 | |
|
|
110 | if (!UUID::cur.parse (buf)) |
106 | { |
111 | { |
107 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
112 | LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf); |
108 | _exit (1); |
113 | _exit (1); |
109 | } |
114 | } |
110 | |
115 | |
111 | uuid.seq = uid; |
116 | LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ()); |
112 | write_uuid (); |
117 | |
113 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
118 | write_uuid (UUID_GAP, true); |
114 | fclose (fp); |
119 | fclose (fp); |
115 | } |
120 | } |
116 | |
121 | |
117 | UUID |
122 | UUID |
118 | gen_uuid () |
123 | UUID::gen () |
119 | { |
124 | { |
120 | UUID uid; |
125 | UUID uid; |
121 | |
126 | |
122 | uid.seq = ++uuid.seq; |
127 | uid.seq = ++cur.seq; |
123 | |
128 | |
124 | if (!(uuid.seq & (UUID_SKIP - 1))) |
129 | if (expect_false (cur.seq >= seq_next_save)) |
125 | write_uuid (); |
130 | { |
|
|
131 | seq_next_save = UUID::cur.seq + (UUID_GAP >> 1); |
|
|
132 | write_uuid (UUID_GAP, false); |
|
|
133 | } |
|
|
134 | |
126 | |
135 | |
127 | return uid; |
136 | return uid; |
128 | } |
137 | } |
129 | |
138 | |
130 | void |
139 | void |
131 | init_uuid () |
140 | UUID::init () |
132 | { |
141 | { |
133 | read_uuid (); |
142 | read_uuid (); |
134 | } |
143 | } |
135 | |
144 | |
136 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
145 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
137 | static int |
146 | static bool |
138 | compare_ob_value_lists_one (const object *wants, const object *has) |
147 | compare_ob_value_lists_one (const object *wants, const object *has) |
139 | { |
148 | { |
140 | key_value *wants_field; |
149 | key_value *wants_field; |
141 | |
150 | |
142 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
151 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
… | |
… | |
150 | key_value *has_field; |
159 | key_value *has_field; |
151 | |
160 | |
152 | /* Look for a field in has with the same key. */ |
161 | /* Look for a field in has with the same key. */ |
153 | has_field = get_ob_key_link (has, wants_field->key); |
162 | has_field = get_ob_key_link (has, wants_field->key); |
154 | |
163 | |
155 | if (has_field == NULL) |
164 | if (!has_field) |
156 | { |
|
|
157 | /* No field with that name. */ |
165 | return 0; /* No field with that name. */ |
158 | return FALSE; |
|
|
159 | } |
|
|
160 | |
166 | |
161 | /* Found the matching field. */ |
167 | /* Found the matching field. */ |
162 | if (has_field->value != wants_field->value) |
168 | if (has_field->value != wants_field->value) |
163 | { |
|
|
164 | /* Values don't match, so this half of the comparison is false. */ |
169 | return 0; /* Values don't match, so this half of the comparison is false. */ |
165 | return FALSE; |
|
|
166 | } |
|
|
167 | |
170 | |
168 | /* If we get here, we found a match. Now for the next field in wants. */ |
171 | /* If we get here, we found a match. Now for the next field in wants. */ |
169 | } |
172 | } |
170 | |
173 | |
171 | /* If we get here, every field in wants has a matching field in has. */ |
174 | /* If we get here, every field in wants has a matching field in has. */ |
172 | return TRUE; |
175 | return 1; |
173 | } |
176 | } |
174 | |
177 | |
175 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
178 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
176 | static int |
179 | static bool |
177 | compare_ob_value_lists (const object *ob1, const object *ob2) |
180 | compare_ob_value_lists (const object *ob1, const object *ob2) |
178 | { |
181 | { |
179 | /* However, there may be fields in has which aren't partnered in wants, |
182 | /* However, there may be fields in has which aren't partnered in wants, |
180 | * so we need to run the comparison *twice*. :( |
183 | * so we need to run the comparison *twice*. :( |
181 | */ |
184 | */ |
… | |
… | |
202 | || ob1->speed != ob2->speed |
205 | || ob1->speed != ob2->speed |
203 | || ob1->value != ob2->value |
206 | || ob1->value != ob2->value |
204 | || ob1->name != ob2->name) |
207 | || ob1->name != ob2->name) |
205 | return 0; |
208 | return 0; |
206 | |
209 | |
207 | //TODO: this ain't working well, use nicer and correct overflow check |
210 | /* Do not merge objects if nrof would overflow. First part checks |
208 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
211 | * for unsigned overflow (2c), second part checks wether the result |
209 | * value could not be stored in a sint32 (which unfortunately sometimes is |
212 | * would fit into a 32 bit signed int, which is often used to hold |
210 | * used to store nrof). |
213 | * nrof values. |
211 | */ |
214 | */ |
212 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
215 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
213 | return 0; |
216 | return 0; |
214 | |
217 | |
215 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
218 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
216 | * This is to the comparison of the flags below will be OK. We |
219 | * This is to the comparison of the flags below will be OK. We |
217 | * just can't ignore the been applied or identified flags, as they |
220 | * just can't ignore the been applied or identified flags, as they |
218 | * are not equal - just if it has been identified, the been_applied |
221 | * are not equal - just if it has been identified, the been_applied |
219 | * flags lose any meaning. |
222 | * flags lose any meaning. |
220 | */ |
223 | */ |
221 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
224 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
… | |
… | |
249 | || ob1->move_off != ob2->move_off |
252 | || ob1->move_off != ob2->move_off |
250 | || ob1->move_slow != ob2->move_slow |
253 | || ob1->move_slow != ob2->move_slow |
251 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
254 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
252 | return 0; |
255 | return 0; |
253 | |
256 | |
254 | /* This is really a spellbook check - really, we should |
257 | /* This is really a spellbook check - we should in general |
255 | * check all objects in the inventory. |
258 | * not merge objects with real inventories, as splitting them |
|
|
259 | * is hard. |
256 | */ |
260 | */ |
257 | if (ob1->inv || ob2->inv) |
261 | if (ob1->inv || ob2->inv) |
258 | { |
262 | { |
259 | /* if one object has inventory but the other doesn't, not equiv */ |
263 | if (!(ob1->inv && ob2->inv)) |
260 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
264 | return 0; /* inventories differ in length */ |
261 | return 0; |
|
|
262 | |
265 | |
263 | /* Now check to see if the two inventory objects could merge */ |
266 | if (ob1->inv->below || ob2->inv->below) |
|
|
267 | return 0; /* more than one object in inv */ |
|
|
268 | |
264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
269 | if (!object::can_merge (ob1->inv, ob2->inv)) |
265 | return 0; |
270 | return 0; /* inventory objects differ */ |
266 | |
271 | |
267 | /* inventory ok - still need to check rest of this object to see |
272 | /* inventory ok - still need to check rest of this object to see |
268 | * if it is valid. |
273 | * if it is valid. |
269 | */ |
274 | */ |
270 | } |
275 | } |
… | |
… | |
289 | if (ob1->level != ob2->level) |
294 | if (ob1->level != ob2->level) |
290 | return 0; |
295 | return 0; |
291 | break; |
296 | break; |
292 | } |
297 | } |
293 | |
298 | |
294 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
299 | if (ob1->key_values || ob2->key_values) |
295 | { |
300 | { |
296 | /* At least one of these has key_values. */ |
301 | /* At least one of these has key_values. */ |
297 | if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) |
302 | if ((!ob1->key_values) != (!ob2->key_values)) |
298 | /* One has fields, but the other one doesn't. */ |
303 | /* One has fields, but the other one doesn't. */ |
299 | return 0; |
304 | return 0; |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
305 | else if (!compare_ob_value_lists (ob1, ob2)) |
301 | return 0; |
306 | return 0; |
302 | } |
307 | } |
303 | |
308 | |
304 | //TODO: generate an event or call into perl for additional checks |
|
|
305 | if (ob1->self || ob2->self) |
309 | if (ob1->self || ob2->self) |
306 | { |
310 | { |
307 | ob1->optimise (); |
311 | ob1->optimise (); |
308 | ob2->optimise (); |
312 | ob2->optimise (); |
309 | |
313 | |
310 | if (ob1->self || ob2->self) |
314 | if (ob1->self || ob2->self) |
|
|
315 | { |
|
|
316 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
|
|
317 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
|
|
318 | |
|
|
319 | if (k1 != k2) |
311 | return 0; |
320 | return 0; |
|
|
321 | else if (k1 == 0) |
|
|
322 | return 1; |
|
|
323 | else if (!cfperl_can_merge (ob1, ob2)) |
|
|
324 | return 0; |
|
|
325 | } |
312 | } |
326 | } |
313 | |
327 | |
314 | /* Everything passes, must be OK. */ |
328 | /* Everything passes, must be OK. */ |
315 | return 1; |
329 | return 1; |
316 | } |
330 | } |
317 | |
331 | |
|
|
332 | static sint32 |
|
|
333 | weight_adjust (object *op, sint32 weight) |
|
|
334 | { |
|
|
335 | return op->type == CONTAINER |
|
|
336 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
|
|
337 | : weight; |
|
|
338 | } |
|
|
339 | |
318 | /* |
340 | /* |
|
|
341 | * add_weight(object, weight) adds the specified weight to an object, |
|
|
342 | * and also updates how much the environment(s) is/are carrying. |
|
|
343 | */ |
|
|
344 | static void |
|
|
345 | add_weight (object *op, sint32 weight) |
|
|
346 | { |
|
|
347 | while (op) |
|
|
348 | { |
|
|
349 | weight = weight_adjust (op, weight); |
|
|
350 | |
|
|
351 | op->carrying += weight; |
|
|
352 | op = op->env; |
|
|
353 | } |
|
|
354 | } |
|
|
355 | |
|
|
356 | /* |
|
|
357 | * sub_weight() recursively (outwards) subtracts a number from the |
|
|
358 | * weight of an object (and what is carried by it's environment(s)). |
|
|
359 | */ |
|
|
360 | static void |
|
|
361 | sub_weight (object *op, long weight) |
|
|
362 | { |
|
|
363 | add_weight (op, -weight); |
|
|
364 | } |
|
|
365 | |
|
|
366 | /* |
319 | * sum_weight() is a recursive function which calculates the weight |
367 | * this is a recursive function which calculates the weight |
320 | * an object is carrying. It goes through in figures out how much |
368 | * an object is carrying. It goes through op and figures out how much |
321 | * containers are carrying, and sums it up. |
369 | * containers are carrying, and sums it up. |
322 | */ |
370 | */ |
323 | long |
371 | void |
324 | sum_weight (object *op) |
372 | object::update_weight () |
325 | { |
373 | { |
326 | long sum; |
374 | sint32 sum = 0; |
327 | object *inv; |
|
|
328 | |
375 | |
329 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
376 | for (object *op = inv; op; op = op->below) |
330 | { |
377 | { |
331 | if (inv->inv) |
378 | if (op->inv) |
332 | sum_weight (inv); |
379 | op->update_weight (); |
333 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
|
|
334 | } |
|
|
335 | |
380 | |
336 | if (op->type == CONTAINER && op->stats.Str) |
381 | sum += op->total_weight (); |
337 | sum = (sum * (100 - op->stats.Str)) / 100; |
382 | } |
338 | |
383 | |
339 | if (op->carrying != sum) |
384 | carrying = weight_adjust (this, sum); |
340 | op->carrying = sum; |
|
|
341 | |
|
|
342 | return sum; |
|
|
343 | } |
|
|
344 | |
|
|
345 | /** |
|
|
346 | * Return the outermost environment object for a given object. |
|
|
347 | */ |
|
|
348 | |
|
|
349 | object * |
|
|
350 | object_get_env_recursive (object *op) |
|
|
351 | { |
|
|
352 | while (op->env != NULL) |
|
|
353 | op = op->env; |
|
|
354 | return op; |
|
|
355 | } |
385 | } |
356 | |
386 | |
357 | /* |
387 | /* |
358 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
388 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
359 | * Some error messages. |
389 | * Some error messages. |
360 | * The result of the dump is stored in the static global errmsg array. |
390 | * The result of the dump is stored in the static global errmsg array. |
361 | */ |
391 | */ |
362 | |
|
|
363 | char * |
392 | char * |
364 | dump_object (object *op) |
393 | dump_object (object *op) |
365 | { |
394 | { |
366 | if (!op) |
395 | if (!op) |
367 | return strdup ("[NULLOBJ]"); |
396 | return strdup ("[NULLOBJ]"); |
368 | |
397 | |
369 | object_freezer freezer; |
398 | object_freezer freezer; |
370 | save_object (freezer, op, 1); |
399 | op->write (freezer); |
371 | return freezer.as_string (); |
400 | return freezer.as_string (); |
372 | } |
401 | } |
373 | |
402 | |
374 | /* |
403 | /* |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
404 | * get_nearest_part(multi-object, object 2) returns the part of the |
376 | * multi-object 1 which is closest to the second object. |
405 | * multi-object 1 which is closest to the second object. |
377 | * If it's not a multi-object, it is returned. |
406 | * If it's not a multi-object, it is returned. |
378 | */ |
407 | */ |
379 | |
|
|
380 | object * |
408 | object * |
381 | get_nearest_part (object *op, const object *pl) |
409 | get_nearest_part (object *op, const object *pl) |
382 | { |
410 | { |
383 | object *tmp, *closest; |
411 | object *tmp, *closest; |
384 | int last_dist, i; |
412 | int last_dist, i; |
… | |
… | |
395 | * Returns the object which has the count-variable equal to the argument. |
423 | * Returns the object which has the count-variable equal to the argument. |
396 | */ |
424 | */ |
397 | object * |
425 | object * |
398 | find_object (tag_t i) |
426 | find_object (tag_t i) |
399 | { |
427 | { |
400 | return ((unsigned int)i) < objects.size () |
428 | for_all_objects (op) |
401 | ? objects [i] |
429 | if (op->count == i) |
402 | : 0; |
430 | return op; |
|
|
431 | |
|
|
432 | return 0; |
403 | } |
433 | } |
404 | |
434 | |
405 | /* |
435 | /* |
406 | * Returns the first object which has a name equal to the argument. |
436 | * Returns the first object which has a name equal to the argument. |
407 | * Used only by the patch command, but not all that useful. |
437 | * Used only by the patch command, but not all that useful. |
… | |
… | |
418 | break; |
448 | break; |
419 | |
449 | |
420 | return op; |
450 | return op; |
421 | } |
451 | } |
422 | |
452 | |
423 | void |
|
|
424 | free_all_object_data () |
|
|
425 | { |
|
|
426 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
427 | } |
|
|
428 | |
|
|
429 | /* |
453 | /* |
430 | * Sets the owner and sets the skill and exp pointers to owner's current |
454 | * Sets the owner and sets the skill and exp pointers to owner's current |
431 | * skill and experience objects. |
455 | * skill and experience objects. |
|
|
456 | * ACTUALLY NO! investigate! TODO |
432 | */ |
457 | */ |
433 | void |
458 | void |
434 | object::set_owner (object *owner) |
459 | object::set_owner (object *owner) |
435 | { |
460 | { |
|
|
461 | // allow objects which own objects |
436 | if (!owner) |
462 | if (owner) |
437 | return; |
|
|
438 | |
|
|
439 | /* next line added to allow objects which own objects */ |
|
|
440 | /* Add a check for ownercounts in here, as I got into an endless loop |
|
|
441 | * with the fireball owning a poison cloud which then owned the |
|
|
442 | * fireball. I believe that was caused by one of the objects getting |
|
|
443 | * freed and then another object replacing it. Since the ownercounts |
|
|
444 | * didn't match, this check is valid and I believe that cause is valid. |
|
|
445 | */ |
|
|
446 | while (owner->owner) |
463 | while (owner->owner) |
447 | owner = owner->owner; |
464 | owner = owner->owner; |
|
|
465 | |
|
|
466 | if (flag [FLAG_FREED]) |
|
|
467 | { |
|
|
468 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
|
|
469 | return; |
|
|
470 | } |
448 | |
471 | |
449 | this->owner = owner; |
472 | this->owner = owner; |
|
|
473 | } |
|
|
474 | |
|
|
475 | int |
|
|
476 | object::slottype () const |
|
|
477 | { |
|
|
478 | if (type == SKILL) |
|
|
479 | { |
|
|
480 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
481 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
482 | } |
|
|
483 | else |
|
|
484 | { |
|
|
485 | if (slot [body_combat].info) return slot_combat; |
|
|
486 | if (slot [body_range ].info) return slot_ranged; |
|
|
487 | } |
|
|
488 | |
|
|
489 | return slot_none; |
|
|
490 | } |
|
|
491 | |
|
|
492 | bool |
|
|
493 | object::change_weapon (object *ob) |
|
|
494 | { |
|
|
495 | if (current_weapon == ob) |
|
|
496 | return true; |
|
|
497 | |
|
|
498 | if (chosen_skill) |
|
|
499 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
500 | |
|
|
501 | current_weapon = ob; |
|
|
502 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
503 | |
|
|
504 | if (chosen_skill) |
|
|
505 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
506 | |
|
|
507 | update_stats (); |
|
|
508 | |
|
|
509 | if (ob) |
|
|
510 | { |
|
|
511 | // now check wether any body locations became invalid, in which case |
|
|
512 | // we cannot apply the weapon at the moment. |
|
|
513 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
514 | if (slot[i].used < 0) |
|
|
515 | { |
|
|
516 | current_weapon = chosen_skill = 0; |
|
|
517 | update_stats (); |
|
|
518 | |
|
|
519 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
520 | "You try to balance all your items at once, " |
|
|
521 | "but the %s is just too much for your body. " |
|
|
522 | "[You need to unapply some items first.]", &ob->name); |
|
|
523 | return false; |
|
|
524 | } |
|
|
525 | |
|
|
526 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
527 | } |
|
|
528 | else |
|
|
529 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
530 | |
|
|
531 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
532 | { |
|
|
533 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
534 | &name, ob->debug_desc ()); |
|
|
535 | return false; |
|
|
536 | } |
|
|
537 | |
|
|
538 | return true; |
450 | } |
539 | } |
451 | |
540 | |
452 | /* Zero the key_values on op, decrementing the shared-string |
541 | /* Zero the key_values on op, decrementing the shared-string |
453 | * refcounts and freeing the links. |
542 | * refcounts and freeing the links. |
454 | */ |
543 | */ |
455 | static void |
544 | static void |
456 | free_key_values (object *op) |
545 | free_key_values (object *op) |
457 | { |
546 | { |
458 | for (key_value *i = op->key_values; i != 0;) |
547 | for (key_value *i = op->key_values; i; ) |
459 | { |
548 | { |
460 | key_value *next = i->next; |
549 | key_value *next = i->next; |
461 | delete i; |
550 | delete i; |
462 | |
551 | |
463 | i = next; |
552 | i = next; |
464 | } |
553 | } |
465 | |
554 | |
466 | op->key_values = 0; |
555 | op->key_values = 0; |
467 | } |
556 | } |
468 | |
557 | |
469 | /* |
558 | object & |
470 | * copy_to first frees everything allocated by the dst object, |
559 | object::operator =(const object &src) |
471 | * and then copies the contents of itself into the second |
|
|
472 | * object, allocating what needs to be allocated. Basically, any |
|
|
473 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
474 | * if the first object is freed, the pointers in the new object |
|
|
475 | * will point at garbage. |
|
|
476 | */ |
|
|
477 | void |
|
|
478 | object::copy_to (object *dst) |
|
|
479 | { |
560 | { |
480 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
561 | bool is_freed = flag [FLAG_FREED]; |
481 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
562 | bool is_removed = flag [FLAG_REMOVED]; |
482 | |
563 | |
483 | *(object_copy *)dst = *this; |
564 | *(object_copy *)this = src; |
484 | |
565 | |
485 | if (is_freed) |
566 | flag [FLAG_FREED] = is_freed; |
486 | SET_FLAG (dst, FLAG_FREED); |
567 | flag [FLAG_REMOVED] = is_removed; |
487 | |
|
|
488 | if (is_removed) |
|
|
489 | SET_FLAG (dst, FLAG_REMOVED); |
|
|
490 | |
|
|
491 | if (speed < 0) |
|
|
492 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
|
|
493 | |
568 | |
494 | /* Copy over key_values, if any. */ |
569 | /* Copy over key_values, if any. */ |
495 | if (key_values) |
570 | if (src.key_values) |
496 | { |
571 | { |
497 | key_value *tail = 0; |
572 | key_value *tail = 0; |
498 | key_value *i; |
|
|
499 | |
|
|
500 | dst->key_values = 0; |
573 | key_values = 0; |
501 | |
574 | |
502 | for (i = key_values; i; i = i->next) |
575 | for (key_value *i = src.key_values; i; i = i->next) |
503 | { |
576 | { |
504 | key_value *new_link = new key_value; |
577 | key_value *new_link = new key_value; |
505 | |
578 | |
506 | new_link->next = 0; |
579 | new_link->next = 0; |
507 | new_link->key = i->key; |
580 | new_link->key = i->key; |
508 | new_link->value = i->value; |
581 | new_link->value = i->value; |
509 | |
582 | |
510 | /* Try and be clever here, too. */ |
583 | /* Try and be clever here, too. */ |
511 | if (!dst->key_values) |
584 | if (!key_values) |
512 | { |
585 | { |
513 | dst->key_values = new_link; |
586 | key_values = new_link; |
514 | tail = new_link; |
587 | tail = new_link; |
515 | } |
588 | } |
516 | else |
589 | else |
517 | { |
590 | { |
518 | tail->next = new_link; |
591 | tail->next = new_link; |
519 | tail = new_link; |
592 | tail = new_link; |
520 | } |
593 | } |
521 | } |
594 | } |
522 | } |
595 | } |
|
|
596 | } |
|
|
597 | |
|
|
598 | /* |
|
|
599 | * copy_to first frees everything allocated by the dst object, |
|
|
600 | * and then copies the contents of itself into the second |
|
|
601 | * object, allocating what needs to be allocated. Basically, any |
|
|
602 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
603 | * if the first object is freed, the pointers in the new object |
|
|
604 | * will point at garbage. |
|
|
605 | */ |
|
|
606 | void |
|
|
607 | object::copy_to (object *dst) |
|
|
608 | { |
|
|
609 | *dst = *this; |
|
|
610 | |
|
|
611 | if (speed < 0) |
|
|
612 | dst->speed_left -= rndm (); |
523 | |
613 | |
524 | dst->set_speed (dst->speed); |
614 | dst->set_speed (dst->speed); |
|
|
615 | } |
|
|
616 | |
|
|
617 | void |
|
|
618 | object::instantiate () |
|
|
619 | { |
|
|
620 | if (!uuid.seq) // HACK |
|
|
621 | uuid = UUID::gen (); |
|
|
622 | |
|
|
623 | speed_left = -0.1f; |
|
|
624 | /* copy the body_info to the body_used - this is only really |
|
|
625 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
626 | * by doing so, when a monster is created, it has good starting |
|
|
627 | * values for the body_used info, so when items are created |
|
|
628 | * for it, they can be properly equipped. |
|
|
629 | */ |
|
|
630 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
631 | slot[i].used = slot[i].info; |
|
|
632 | |
|
|
633 | attachable::instantiate (); |
525 | } |
634 | } |
526 | |
635 | |
527 | object * |
636 | object * |
528 | object::clone () |
637 | object::clone () |
529 | { |
638 | { |
… | |
… | |
587 | * UP_OBJ_FACE: only the objects face has changed. |
696 | * UP_OBJ_FACE: only the objects face has changed. |
588 | */ |
697 | */ |
589 | void |
698 | void |
590 | update_object (object *op, int action) |
699 | update_object (object *op, int action) |
591 | { |
700 | { |
592 | MoveType move_on, move_off, move_block, move_slow; |
|
|
593 | |
|
|
594 | if (op == NULL) |
701 | if (op == NULL) |
595 | { |
702 | { |
596 | /* this should never happen */ |
703 | /* this should never happen */ |
597 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
704 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
598 | return; |
705 | return; |
… | |
… | |
658 | |
765 | |
659 | if (op->more) |
766 | if (op->more) |
660 | update_object (op->more, action); |
767 | update_object (op->more, action); |
661 | } |
768 | } |
662 | |
769 | |
663 | object *object::first; |
|
|
664 | |
|
|
665 | object::object () |
770 | object::object () |
666 | { |
771 | { |
667 | SET_FLAG (this, FLAG_REMOVED); |
772 | SET_FLAG (this, FLAG_REMOVED); |
668 | |
773 | |
669 | expmul = 1.0; |
774 | expmul = 1.0; |
670 | face = blank_face; |
775 | face = blank_face; |
671 | } |
776 | } |
672 | |
777 | |
673 | object::~object () |
778 | object::~object () |
674 | { |
779 | { |
|
|
780 | unlink (); |
|
|
781 | |
675 | free_key_values (this); |
782 | free_key_values (this); |
676 | } |
783 | } |
677 | |
784 | |
|
|
785 | static int object_count; |
|
|
786 | |
678 | void object::link () |
787 | void object::link () |
679 | { |
788 | { |
680 | uuid = gen_uuid (); |
789 | assert (!index);//D |
|
|
790 | uuid = UUID::gen (); |
|
|
791 | count = ++object_count; |
681 | |
792 | |
|
|
793 | refcnt_inc (); |
682 | objects.insert (this); |
794 | objects.insert (this); |
683 | } |
795 | } |
684 | |
796 | |
685 | void object::unlink () |
797 | void object::unlink () |
686 | { |
798 | { |
|
|
799 | if (!index) |
|
|
800 | return; |
|
|
801 | |
687 | objects.erase (this); |
802 | objects.erase (this); |
|
|
803 | refcnt_dec (); |
688 | } |
804 | } |
689 | |
805 | |
690 | void |
806 | void |
691 | object::activate () |
807 | object::activate () |
692 | { |
808 | { |
… | |
… | |
763 | * if some form of movement is allowed, let objects |
879 | * if some form of movement is allowed, let objects |
764 | * drop on that space. |
880 | * drop on that space. |
765 | */ |
881 | */ |
766 | if (!drop_to_ground |
882 | if (!drop_to_ground |
767 | || !map |
883 | || !map |
768 | || map->in_memory != MAP_IN_MEMORY |
884 | || map->in_memory != MAP_ACTIVE |
|
|
885 | || map->nodrop |
769 | || ms ().move_block == MOVE_ALL) |
886 | || ms ().move_block == MOVE_ALL) |
770 | { |
887 | { |
771 | while (inv) |
888 | while (inv) |
772 | { |
889 | { |
773 | inv->destroy_inv (drop_to_ground); |
890 | inv->destroy_inv (drop_to_ground); |
… | |
… | |
782 | |
899 | |
783 | if (op->flag [FLAG_STARTEQUIP] |
900 | if (op->flag [FLAG_STARTEQUIP] |
784 | || op->flag [FLAG_NO_DROP] |
901 | || op->flag [FLAG_NO_DROP] |
785 | || op->type == RUNE |
902 | || op->type == RUNE |
786 | || op->type == TRAP |
903 | || op->type == TRAP |
787 | || op->flag [FLAG_IS_A_TEMPLATE]) |
904 | || op->flag [FLAG_IS_A_TEMPLATE] |
|
|
905 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
788 | op->destroy (); |
906 | op->destroy (); |
789 | else |
907 | else |
790 | map->insert (op, x, y); |
908 | map->insert (op, x, y); |
791 | } |
909 | } |
792 | } |
910 | } |
… | |
… | |
800 | } |
918 | } |
801 | |
919 | |
802 | void |
920 | void |
803 | object::do_destroy () |
921 | object::do_destroy () |
804 | { |
922 | { |
|
|
923 | attachable::do_destroy (); |
|
|
924 | |
805 | if (flag [FLAG_IS_LINKED]) |
925 | if (flag [FLAG_IS_LINKED]) |
806 | remove_button_link (this); |
926 | remove_button_link (this); |
807 | |
927 | |
808 | if (flag [FLAG_FRIENDLY]) |
928 | if (flag [FLAG_FRIENDLY]) |
809 | remove_friendly_object (this); |
929 | remove_friendly_object (this); |
810 | |
930 | |
811 | if (!flag [FLAG_REMOVED]) |
931 | if (!flag [FLAG_REMOVED]) |
812 | remove (); |
932 | remove (); |
813 | |
933 | |
814 | if (flag [FLAG_FREED]) |
934 | destroy_inv (true); |
815 | return; |
|
|
816 | |
935 | |
817 | set_speed (0); |
936 | deactivate (); |
|
|
937 | unlink (); |
818 | |
938 | |
819 | flag [FLAG_FREED] = 1; |
939 | flag [FLAG_FREED] = 1; |
820 | |
|
|
821 | attachable::do_destroy (); |
|
|
822 | |
|
|
823 | destroy_inv (true); |
|
|
824 | unlink (); |
|
|
825 | |
940 | |
826 | // hack to ensure that freed objects still have a valid map |
941 | // hack to ensure that freed objects still have a valid map |
827 | { |
942 | { |
828 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
943 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
829 | |
944 | |
830 | if (!freed_map) |
945 | if (!freed_map) |
831 | { |
946 | { |
832 | freed_map = new maptile; |
947 | freed_map = new maptile; |
833 | |
948 | |
|
|
949 | freed_map->path = "<freed objects map>"; |
834 | freed_map->name = "/internal/freed_objects_map"; |
950 | freed_map->name = "/internal/freed_objects_map"; |
835 | freed_map->width = 3; |
951 | freed_map->width = 3; |
836 | freed_map->height = 3; |
952 | freed_map->height = 3; |
|
|
953 | freed_map->nodrop = 1; |
837 | |
954 | |
838 | freed_map->alloc (); |
955 | freed_map->alloc (); |
839 | freed_map->in_memory = MAP_IN_MEMORY; |
956 | freed_map->in_memory = MAP_ACTIVE; |
840 | } |
957 | } |
841 | |
958 | |
842 | map = freed_map; |
959 | map = freed_map; |
843 | x = 1; |
960 | x = 1; |
844 | y = 1; |
961 | y = 1; |
845 | } |
962 | } |
846 | |
963 | |
847 | head = 0; |
|
|
848 | |
|
|
849 | if (more) |
964 | if (more) |
850 | { |
965 | { |
851 | more->destroy (); |
966 | more->destroy (); |
852 | more = 0; |
967 | more = 0; |
853 | } |
968 | } |
854 | |
969 | |
|
|
970 | head = 0; |
|
|
971 | |
855 | // clear those pointers that likely might have circular references to us |
972 | // clear those pointers that likely might cause circular references |
856 | owner = 0; |
973 | owner = 0; |
857 | enemy = 0; |
974 | enemy = 0; |
858 | attacked_by = 0; |
975 | attacked_by = 0; |
|
|
976 | current_weapon = 0; |
859 | } |
977 | } |
860 | |
978 | |
861 | void |
979 | void |
862 | object::destroy (bool destroy_inventory) |
980 | object::destroy (bool destroy_inventory) |
863 | { |
981 | { |
… | |
… | |
865 | return; |
983 | return; |
866 | |
984 | |
867 | if (destroy_inventory) |
985 | if (destroy_inventory) |
868 | destroy_inv (false); |
986 | destroy_inv (false); |
869 | |
987 | |
|
|
988 | if (is_head ()) |
|
|
989 | if (sound_destroy) |
|
|
990 | play_sound (sound_destroy); |
|
|
991 | else if (flag [FLAG_MONSTER]) |
|
|
992 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
|
|
993 | |
870 | attachable::destroy (); |
994 | attachable::destroy (); |
871 | } |
|
|
872 | |
|
|
873 | /* |
|
|
874 | * sub_weight() recursively (outwards) subtracts a number from the |
|
|
875 | * weight of an object (and what is carried by it's environment(s)). |
|
|
876 | */ |
|
|
877 | void |
|
|
878 | sub_weight (object *op, signed long weight) |
|
|
879 | { |
|
|
880 | while (op != NULL) |
|
|
881 | { |
|
|
882 | if (op->type == CONTAINER) |
|
|
883 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
884 | |
|
|
885 | op->carrying -= weight; |
|
|
886 | op = op->env; |
|
|
887 | } |
|
|
888 | } |
995 | } |
889 | |
996 | |
890 | /* op->remove (): |
997 | /* op->remove (): |
891 | * This function removes the object op from the linked list of objects |
998 | * This function removes the object op from the linked list of objects |
892 | * which it is currently tied to. When this function is done, the |
999 | * which it is currently tied to. When this function is done, the |
893 | * object will have no environment. If the object previously had an |
1000 | * object will have no environment. If the object previously had an |
894 | * environment, the x and y coordinates will be updated to |
1001 | * environment, the x and y coordinates will be updated to |
895 | * the previous environment. |
1002 | * the previous environment. |
896 | * Beware: This function is called from the editor as well! |
|
|
897 | */ |
1003 | */ |
898 | void |
1004 | void |
899 | object::remove () |
1005 | object::do_remove () |
900 | { |
1006 | { |
901 | object *tmp, *last = 0; |
1007 | object *tmp, *last = 0; |
902 | object *otmp; |
1008 | object *otmp; |
903 | |
1009 | |
904 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1010 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
… | |
… | |
947 | } |
1053 | } |
948 | else if (map) |
1054 | else if (map) |
949 | { |
1055 | { |
950 | if (type == PLAYER) |
1056 | if (type == PLAYER) |
951 | { |
1057 | { |
|
|
1058 | // leaving a spot always closes any open container on the ground |
|
|
1059 | if (container && !container->env) |
|
|
1060 | // this causes spurious floorbox updates, but it ensures |
|
|
1061 | // that the CLOSE event is being sent. |
|
|
1062 | close_container (); |
|
|
1063 | |
952 | --map->players; |
1064 | --map->players; |
953 | map->touch (); |
1065 | map->touch (); |
954 | } |
1066 | } |
955 | |
1067 | |
956 | map->dirty = true; |
1068 | map->dirty = true; |
|
|
1069 | mapspace &ms = this->ms (); |
957 | |
1070 | |
958 | /* link the object above us */ |
1071 | /* link the object above us */ |
959 | if (above) |
1072 | if (above) |
960 | above->below = below; |
1073 | above->below = below; |
961 | else |
1074 | else |
962 | map->at (x, y).top = below; /* we were top, set new top */ |
1075 | ms.top = below; /* we were top, set new top */ |
963 | |
1076 | |
964 | /* Relink the object below us, if there is one */ |
1077 | /* Relink the object below us, if there is one */ |
965 | if (below) |
1078 | if (below) |
966 | below->above = above; |
1079 | below->above = above; |
967 | else |
1080 | else |
… | |
… | |
969 | /* Nothing below, which means we need to relink map object for this space |
1082 | /* Nothing below, which means we need to relink map object for this space |
970 | * use translated coordinates in case some oddness with map tiling is |
1083 | * use translated coordinates in case some oddness with map tiling is |
971 | * evident |
1084 | * evident |
972 | */ |
1085 | */ |
973 | if (GET_MAP_OB (map, x, y) != this) |
1086 | if (GET_MAP_OB (map, x, y) != this) |
974 | { |
|
|
975 | char *dump = dump_object (this); |
|
|
976 | LOG (llevError, |
|
|
977 | "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); |
1087 | 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 ()); |
978 | free (dump); |
|
|
979 | dump = dump_object (GET_MAP_OB (map, x, y)); |
|
|
980 | LOG (llevError, "%s\n", dump); |
|
|
981 | free (dump); |
|
|
982 | } |
|
|
983 | |
1088 | |
984 | map->at (x, y).bot = above; /* goes on above it. */ |
1089 | ms.bot = above; /* goes on above it. */ |
985 | } |
1090 | } |
986 | |
1091 | |
987 | above = 0; |
1092 | above = 0; |
988 | below = 0; |
1093 | below = 0; |
989 | |
1094 | |
990 | if (map->in_memory == MAP_SAVING) |
1095 | if (map->in_memory == MAP_SAVING) |
991 | return; |
1096 | return; |
992 | |
1097 | |
993 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1098 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
994 | |
1099 | |
|
|
1100 | if (object *pl = ms.player ()) |
|
|
1101 | { |
|
|
1102 | if (pl->container == this) |
|
|
1103 | /* If a container that the player is currently using somehow gets |
|
|
1104 | * removed (most likely destroyed), update the player view |
|
|
1105 | * appropriately. |
|
|
1106 | */ |
|
|
1107 | pl->close_container (); |
|
|
1108 | |
|
|
1109 | pl->contr->ns->floorbox_update (); |
|
|
1110 | } |
|
|
1111 | |
995 | for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) |
1112 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
996 | { |
1113 | { |
997 | /* No point updating the players look faces if he is the object |
1114 | /* No point updating the players look faces if he is the object |
998 | * being removed. |
1115 | * being removed. |
999 | */ |
1116 | */ |
1000 | |
|
|
1001 | if (tmp->type == PLAYER && tmp != this) |
|
|
1002 | { |
|
|
1003 | /* If a container that the player is currently using somehow gets |
|
|
1004 | * removed (most likely destroyed), update the player view |
|
|
1005 | * appropriately. |
|
|
1006 | */ |
|
|
1007 | if (tmp->container == this) |
|
|
1008 | { |
|
|
1009 | flag [FLAG_APPLIED] = 0; |
|
|
1010 | tmp->container = 0; |
|
|
1011 | } |
|
|
1012 | |
|
|
1013 | if (tmp->contr->ns) |
|
|
1014 | tmp->contr->ns->floorbox_update (); |
|
|
1015 | } |
|
|
1016 | |
1117 | |
1017 | /* See if object moving off should effect something */ |
1118 | /* See if object moving off should effect something */ |
1018 | if (check_walk_off |
1119 | if (check_walk_off |
1019 | && ((move_type & tmp->move_off) |
1120 | && ((move_type & tmp->move_off) |
1020 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1121 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
… | |
… | |
1023 | |
1124 | |
1024 | if (destroyed ()) |
1125 | if (destroyed ()) |
1025 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1126 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1026 | } |
1127 | } |
1027 | |
1128 | |
1028 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1029 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1030 | if (tmp->above == tmp) |
|
|
1031 | tmp->above = 0; |
|
|
1032 | |
|
|
1033 | last = tmp; |
1129 | last = tmp; |
1034 | } |
1130 | } |
1035 | |
1131 | |
1036 | /* last == NULL if there are no objects on this space */ |
1132 | /* last == NULL if there are no objects on this space */ |
1037 | //TODO: this makes little sense, why only update the topmost object? |
1133 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1057 | merge_ob (object *op, object *top) |
1153 | merge_ob (object *op, object *top) |
1058 | { |
1154 | { |
1059 | if (!op->nrof) |
1155 | if (!op->nrof) |
1060 | return 0; |
1156 | return 0; |
1061 | |
1157 | |
1062 | if (top) |
1158 | if (!top) |
1063 | for (top = op; top && top->above; top = top->above) |
1159 | for (top = op; top && top->above; top = top->above) |
1064 | ; |
1160 | ; |
1065 | |
1161 | |
1066 | for (; top; top = top->below) |
1162 | for (; top; top = top->below) |
1067 | { |
1163 | { |
… | |
… | |
1080 | } |
1176 | } |
1081 | |
1177 | |
1082 | return 0; |
1178 | return 0; |
1083 | } |
1179 | } |
1084 | |
1180 | |
|
|
1181 | void |
|
|
1182 | object::expand_tail () |
|
|
1183 | { |
|
|
1184 | if (more) |
|
|
1185 | return; |
|
|
1186 | |
|
|
1187 | object *prev = this; |
|
|
1188 | |
|
|
1189 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
|
|
1190 | { |
|
|
1191 | object *op = arch_to_object (at); |
|
|
1192 | |
|
|
1193 | op->name = name; |
|
|
1194 | op->name_pl = name_pl; |
|
|
1195 | op->title = title; |
|
|
1196 | |
|
|
1197 | op->head = this; |
|
|
1198 | prev->more = op; |
|
|
1199 | |
|
|
1200 | prev = op; |
|
|
1201 | } |
|
|
1202 | } |
|
|
1203 | |
1085 | /* |
1204 | /* |
1086 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1205 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1087 | * job preparing multi-part monsters |
1206 | * job preparing multi-part monsters. |
1088 | */ |
1207 | */ |
1089 | object * |
1208 | object * |
1090 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1209 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1091 | { |
1210 | { |
1092 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1211 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1093 | { |
1212 | { |
1094 | tmp->x = x + tmp->arch->clone.x; |
1213 | tmp->x = x + tmp->arch->x; |
1095 | tmp->y = y + tmp->arch->clone.y; |
1214 | tmp->y = y + tmp->arch->y; |
1096 | } |
1215 | } |
1097 | |
1216 | |
1098 | return insert_ob_in_map (op, m, originator, flag); |
1217 | return insert_ob_in_map (op, m, originator, flag); |
1099 | } |
1218 | } |
1100 | |
1219 | |
… | |
… | |
1119 | * just 'op' otherwise |
1238 | * just 'op' otherwise |
1120 | */ |
1239 | */ |
1121 | object * |
1240 | object * |
1122 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1241 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1123 | { |
1242 | { |
|
|
1243 | assert (!op->flag [FLAG_FREED]); |
|
|
1244 | |
1124 | object *tmp, *top, *floor = NULL; |
1245 | object *top, *floor = NULL; |
1125 | sint16 x, y; |
|
|
1126 | |
1246 | |
1127 | if (QUERY_FLAG (op, FLAG_FREED)) |
1247 | op->remove (); |
1128 | { |
|
|
1129 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1130 | return NULL; |
|
|
1131 | } |
|
|
1132 | |
|
|
1133 | if (!m) |
|
|
1134 | { |
|
|
1135 | char *dump = dump_object (op); |
|
|
1136 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
|
|
1137 | free (dump); |
|
|
1138 | return op; |
|
|
1139 | } |
|
|
1140 | |
|
|
1141 | if (out_of_map (m, op->x, op->y)) |
|
|
1142 | { |
|
|
1143 | char *dump = dump_object (op); |
|
|
1144 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
|
|
1145 | #ifdef MANY_CORES |
|
|
1146 | /* Better to catch this here, as otherwise the next use of this object |
|
|
1147 | * is likely to cause a crash. Better to find out where it is getting |
|
|
1148 | * improperly inserted. |
|
|
1149 | */ |
|
|
1150 | abort (); |
|
|
1151 | #endif |
|
|
1152 | free (dump); |
|
|
1153 | return op; |
|
|
1154 | } |
|
|
1155 | |
|
|
1156 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1157 | { |
|
|
1158 | char *dump = dump_object (op); |
|
|
1159 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1160 | free (dump); |
|
|
1161 | return op; |
|
|
1162 | } |
|
|
1163 | |
|
|
1164 | if (op->more) |
|
|
1165 | { |
|
|
1166 | /* The part may be on a different map. */ |
|
|
1167 | |
|
|
1168 | object *more = op->more; |
|
|
1169 | |
|
|
1170 | /* We really need the caller to normalise coordinates - if |
|
|
1171 | * we set the map, that doesn't work if the location is within |
|
|
1172 | * a map and this is straddling an edge. So only if coordinate |
|
|
1173 | * is clear wrong do we normalise it. |
|
|
1174 | */ |
|
|
1175 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
|
|
1176 | more->map = get_map_from_coord (m, &more->x, &more->y); |
|
|
1177 | else if (!more->map) |
|
|
1178 | { |
|
|
1179 | /* For backwards compatibility - when not dealing with tiled maps, |
|
|
1180 | * more->map should always point to the parent. |
|
|
1181 | */ |
|
|
1182 | more->map = m; |
|
|
1183 | } |
|
|
1184 | |
|
|
1185 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
|
|
1186 | { |
|
|
1187 | if (!op->head) |
|
|
1188 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1189 | |
|
|
1190 | return 0; |
|
|
1191 | } |
|
|
1192 | } |
|
|
1193 | |
|
|
1194 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1195 | |
1248 | |
1196 | /* Ideally, the caller figures this out. However, it complicates a lot |
1249 | /* Ideally, the caller figures this out. However, it complicates a lot |
1197 | * of areas of callers (eg, anything that uses find_free_spot would now |
1250 | * of areas of callers (eg, anything that uses find_free_spot would now |
1198 | * need extra work |
1251 | * need extra work |
1199 | */ |
1252 | */ |
1200 | op->map = get_map_from_coord (m, &op->x, &op->y); |
1253 | if (!xy_normalise (m, op->x, op->y)) |
1201 | x = op->x; |
1254 | { |
1202 | y = op->y; |
1255 | op->destroy (); |
|
|
1256 | return 0; |
|
|
1257 | } |
|
|
1258 | |
|
|
1259 | if (object *more = op->more) |
|
|
1260 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1261 | return 0; |
|
|
1262 | |
|
|
1263 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1264 | |
|
|
1265 | op->map = m; |
|
|
1266 | mapspace &ms = op->ms (); |
1203 | |
1267 | |
1204 | /* this has to be done after we translate the coordinates. |
1268 | /* this has to be done after we translate the coordinates. |
1205 | */ |
1269 | */ |
1206 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1270 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1207 | for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) |
1271 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1208 | if (object::can_merge (op, tmp)) |
1272 | if (object::can_merge (op, tmp)) |
1209 | { |
1273 | { |
1210 | op->nrof += tmp->nrof; |
1274 | op->nrof += tmp->nrof; |
1211 | tmp->destroy (); |
1275 | tmp->destroy (); |
1212 | } |
1276 | } |
… | |
… | |
1229 | op->below = originator->below; |
1293 | op->below = originator->below; |
1230 | |
1294 | |
1231 | if (op->below) |
1295 | if (op->below) |
1232 | op->below->above = op; |
1296 | op->below->above = op; |
1233 | else |
1297 | else |
1234 | op->ms ().bot = op; |
1298 | ms.bot = op; |
1235 | |
1299 | |
1236 | /* since *below* originator, no need to update top */ |
1300 | /* since *below* originator, no need to update top */ |
1237 | originator->below = op; |
1301 | originator->below = op; |
1238 | } |
1302 | } |
1239 | else |
1303 | else |
1240 | { |
1304 | { |
|
|
1305 | top = ms.bot; |
|
|
1306 | |
1241 | /* If there are other objects, then */ |
1307 | /* If there are other objects, then */ |
1242 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1308 | if (top) |
1243 | { |
1309 | { |
1244 | object *last = 0; |
1310 | object *last = 0; |
1245 | |
1311 | |
1246 | /* |
1312 | /* |
1247 | * If there are multiple objects on this space, we do some trickier handling. |
1313 | * If there are multiple objects on this space, we do some trickier handling. |
… | |
… | |
1253 | * once we get to them. This reduces the need to traverse over all of |
1319 | * once we get to them. This reduces the need to traverse over all of |
1254 | * them when adding another one - this saves quite a bit of cpu time |
1320 | * them when adding another one - this saves quite a bit of cpu time |
1255 | * when lots of spells are cast in one area. Currently, it is presumed |
1321 | * when lots of spells are cast in one area. Currently, it is presumed |
1256 | * that flying non pickable objects are spell objects. |
1322 | * that flying non pickable objects are spell objects. |
1257 | */ |
1323 | */ |
1258 | while (top) |
1324 | for (top = ms.bot; top; top = top->above) |
1259 | { |
1325 | { |
1260 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1326 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1261 | floor = top; |
1327 | floor = top; |
1262 | |
1328 | |
1263 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1329 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1266 | top = top->below; |
1332 | top = top->below; |
1267 | break; |
1333 | break; |
1268 | } |
1334 | } |
1269 | |
1335 | |
1270 | last = top; |
1336 | last = top; |
1271 | top = top->above; |
|
|
1272 | } |
1337 | } |
1273 | |
1338 | |
1274 | /* Don't want top to be NULL, so set it to the last valid object */ |
1339 | /* Don't want top to be NULL, so set it to the last valid object */ |
1275 | top = last; |
1340 | top = last; |
1276 | |
1341 | |
… | |
… | |
1278 | * looks like instead of lots of conditions here. |
1343 | * looks like instead of lots of conditions here. |
1279 | * makes things faster, and effectively the same result. |
1344 | * makes things faster, and effectively the same result. |
1280 | */ |
1345 | */ |
1281 | |
1346 | |
1282 | /* Have object 'fall below' other objects that block view. |
1347 | /* Have object 'fall below' other objects that block view. |
1283 | * Unless those objects are exits, type 66 |
1348 | * Unless those objects are exits. |
1284 | * If INS_ON_TOP is used, don't do this processing |
1349 | * If INS_ON_TOP is used, don't do this processing |
1285 | * Need to find the object that in fact blocks view, otherwise |
1350 | * Need to find the object that in fact blocks view, otherwise |
1286 | * stacking is a bit odd. |
1351 | * stacking is a bit odd. |
1287 | */ |
1352 | */ |
1288 | if (!(flag & INS_ON_TOP) && |
1353 | if (!(flag & INS_ON_TOP) |
1289 | (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1354 | && ms.flags () & P_BLOCKSVIEW |
|
|
1355 | && (op->face && !faces [op->face].visibility)) |
1290 | { |
1356 | { |
1291 | for (last = top; last != floor; last = last->below) |
1357 | for (last = top; last != floor; last = last->below) |
1292 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1358 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1293 | break; |
1359 | break; |
|
|
1360 | |
1294 | /* Check to see if we found the object that blocks view, |
1361 | /* Check to see if we found the object that blocks view, |
1295 | * and make sure we have a below pointer for it so that |
1362 | * and make sure we have a below pointer for it so that |
1296 | * we can get inserted below this one, which requires we |
1363 | * we can get inserted below this one, which requires we |
1297 | * set top to the object below us. |
1364 | * set top to the object below us. |
1298 | */ |
1365 | */ |
1299 | if (last && last->below && last != floor) |
1366 | if (last && last->below && last != floor) |
1300 | top = last->below; |
1367 | top = last->below; |
1301 | } |
1368 | } |
1302 | } /* If objects on this space */ |
1369 | } /* If objects on this space */ |
1303 | |
1370 | |
1304 | if (flag & INS_MAP_LOAD) |
|
|
1305 | top = GET_MAP_TOP (op->map, op->x, op->y); |
|
|
1306 | |
|
|
1307 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1371 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1308 | top = floor; |
1372 | top = floor; |
1309 | |
1373 | |
1310 | /* Top is the object that our object (op) is going to get inserted above. |
1374 | /* Top is the object that our object (op) is going to get inserted above. |
1311 | */ |
1375 | */ |
1312 | |
1376 | |
1313 | /* First object on this space */ |
1377 | /* First object on this space */ |
1314 | if (!top) |
1378 | if (!top) |
1315 | { |
1379 | { |
1316 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1380 | op->above = ms.bot; |
1317 | |
1381 | |
1318 | if (op->above) |
1382 | if (op->above) |
1319 | op->above->below = op; |
1383 | op->above->below = op; |
1320 | |
1384 | |
1321 | op->below = 0; |
1385 | op->below = 0; |
1322 | op->ms ().bot = op; |
1386 | ms.bot = op; |
1323 | } |
1387 | } |
1324 | else |
1388 | else |
1325 | { /* get inserted into the stack above top */ |
1389 | { /* get inserted into the stack above top */ |
1326 | op->above = top->above; |
1390 | op->above = top->above; |
1327 | |
1391 | |
… | |
… | |
1331 | op->below = top; |
1395 | op->below = top; |
1332 | top->above = op; |
1396 | top->above = op; |
1333 | } |
1397 | } |
1334 | |
1398 | |
1335 | if (!op->above) |
1399 | if (!op->above) |
1336 | op->ms ().top = op; |
1400 | ms.top = op; |
1337 | } /* else not INS_BELOW_ORIGINATOR */ |
1401 | } /* else not INS_BELOW_ORIGINATOR */ |
1338 | |
1402 | |
1339 | if (op->type == PLAYER) |
1403 | if (op->type == PLAYER) |
1340 | { |
1404 | { |
1341 | op->contr->do_los = 1; |
1405 | op->contr->do_los = 1; |
… | |
… | |
1343 | op->map->touch (); |
1407 | op->map->touch (); |
1344 | } |
1408 | } |
1345 | |
1409 | |
1346 | op->map->dirty = true; |
1410 | op->map->dirty = true; |
1347 | |
1411 | |
1348 | /* If we have a floor, we know the player, if any, will be above |
|
|
1349 | * it, so save a few ticks and start from there. |
|
|
1350 | */ |
|
|
1351 | if (!(flag & INS_MAP_LOAD)) |
|
|
1352 | if (object *pl = op->ms ().player ()) |
1412 | if (object *pl = ms.player ()) |
1353 | if (pl->contr->ns) |
|
|
1354 | pl->contr->ns->floorbox_update (); |
1413 | pl->contr->ns->floorbox_update (); |
1355 | |
1414 | |
1356 | /* If this object glows, it may affect lighting conditions that are |
1415 | /* If this object glows, it may affect lighting conditions that are |
1357 | * visible to others on this map. But update_all_los is really |
1416 | * visible to others on this map. But update_all_los is really |
1358 | * an inefficient way to do this, as it means los for all players |
1417 | * an inefficient way to do this, as it means los for all players |
1359 | * on the map will get recalculated. The players could very well |
1418 | * on the map will get recalculated. The players could very well |
… | |
… | |
1378 | * blocked() and wall() work properly), and these flags are updated by |
1437 | * blocked() and wall() work properly), and these flags are updated by |
1379 | * update_object(). |
1438 | * update_object(). |
1380 | */ |
1439 | */ |
1381 | |
1440 | |
1382 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1441 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1383 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1442 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1384 | { |
1443 | { |
1385 | if (check_move_on (op, originator)) |
1444 | if (check_move_on (op, originator)) |
1386 | return 0; |
1445 | return 0; |
1387 | |
1446 | |
1388 | /* If we are a multi part object, lets work our way through the check |
1447 | /* If we are a multi part object, lets work our way through the check |
1389 | * walk on's. |
1448 | * walk on's. |
1390 | */ |
1449 | */ |
1391 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1450 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1392 | if (check_move_on (tmp, originator)) |
1451 | if (check_move_on (tmp, originator)) |
1393 | return 0; |
1452 | return 0; |
1394 | } |
1453 | } |
1395 | |
1454 | |
1396 | return op; |
1455 | return op; |
… | |
… | |
1406 | object *tmp, *tmp1; |
1465 | object *tmp, *tmp1; |
1407 | |
1466 | |
1408 | /* first search for itself and remove any old instances */ |
1467 | /* first search for itself and remove any old instances */ |
1409 | |
1468 | |
1410 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1469 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1411 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1470 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1412 | tmp->destroy (); |
1471 | tmp->destroy (); |
1413 | |
1472 | |
1414 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1473 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1415 | |
1474 | |
1416 | tmp1->x = op->x; |
1475 | tmp1->x = op->x; |
… | |
… | |
1419 | } |
1478 | } |
1420 | |
1479 | |
1421 | object * |
1480 | object * |
1422 | object::insert_at (object *where, object *originator, int flags) |
1481 | object::insert_at (object *where, object *originator, int flags) |
1423 | { |
1482 | { |
|
|
1483 | if (where->env) |
|
|
1484 | return where->env->insert (this); |
|
|
1485 | else |
1424 | where->map->insert (this, where->x, where->y, originator, flags); |
1486 | return where->map->insert (this, where->x, where->y, originator, flags); |
1425 | } |
1487 | } |
1426 | |
1488 | |
1427 | /* |
1489 | /* |
1428 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1490 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1429 | * is returned contains nr objects, and the remaining parts contains |
1491 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1449 | orig_ob->destroy (1); |
1511 | orig_ob->destroy (1); |
1450 | else if (!is_removed) |
1512 | else if (!is_removed) |
1451 | { |
1513 | { |
1452 | if (orig_ob->env != NULL) |
1514 | if (orig_ob->env != NULL) |
1453 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1515 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
1454 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
1516 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_ACTIVE) |
1455 | { |
1517 | { |
1456 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
1518 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
1457 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
1519 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
1458 | return NULL; |
1520 | return NULL; |
1459 | } |
1521 | } |
… | |
… | |
1469 | * the amount of an object. If the amount reaches 0, the object |
1531 | * the amount of an object. If the amount reaches 0, the object |
1470 | * is subsequently removed and freed. |
1532 | * is subsequently removed and freed. |
1471 | * |
1533 | * |
1472 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1534 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1473 | */ |
1535 | */ |
1474 | |
|
|
1475 | object * |
1536 | object * |
1476 | decrease_ob_nr (object *op, uint32 i) |
1537 | decrease_ob_nr (object *op, uint32 i) |
1477 | { |
1538 | { |
1478 | object *tmp; |
1539 | object *tmp; |
1479 | |
1540 | |
… | |
… | |
1550 | op->destroy (); |
1611 | op->destroy (); |
1551 | return 0; |
1612 | return 0; |
1552 | } |
1613 | } |
1553 | } |
1614 | } |
1554 | |
1615 | |
1555 | /* |
|
|
1556 | * add_weight(object, weight) adds the specified weight to an object, |
|
|
1557 | * and also updates how much the environment(s) is/are carrying. |
|
|
1558 | */ |
|
|
1559 | |
|
|
1560 | void |
|
|
1561 | add_weight (object *op, signed long weight) |
|
|
1562 | { |
|
|
1563 | while (op != NULL) |
|
|
1564 | { |
|
|
1565 | if (op->type == CONTAINER) |
|
|
1566 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
1567 | |
|
|
1568 | op->carrying += weight; |
|
|
1569 | op = op->env; |
|
|
1570 | } |
|
|
1571 | } |
|
|
1572 | |
|
|
1573 | object * |
1616 | object * |
1574 | insert_ob_in_ob (object *op, object *where) |
1617 | insert_ob_in_ob (object *op, object *where) |
1575 | { |
1618 | { |
1576 | if (!where) |
1619 | if (!where) |
1577 | { |
1620 | { |
… | |
… | |
1579 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1622 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1580 | free (dump); |
1623 | free (dump); |
1581 | return op; |
1624 | return op; |
1582 | } |
1625 | } |
1583 | |
1626 | |
1584 | if (where->head) |
1627 | if (where->head_ () != where) |
1585 | { |
1628 | { |
1586 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1629 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1587 | where = where->head; |
1630 | where = where->head; |
1588 | } |
1631 | } |
1589 | |
1632 | |
1590 | return where->insert (op); |
1633 | return where->insert (op); |
1591 | } |
1634 | } |
… | |
… | |
1596 | * inside the object environment. |
1639 | * inside the object environment. |
1597 | * |
1640 | * |
1598 | * The function returns now pointer to inserted item, and return value can |
1641 | * The function returns now pointer to inserted item, and return value can |
1599 | * be != op, if items are merged. -Tero |
1642 | * be != op, if items are merged. -Tero |
1600 | */ |
1643 | */ |
1601 | |
|
|
1602 | object * |
1644 | object * |
1603 | object::insert (object *op) |
1645 | object::insert (object *op) |
1604 | { |
1646 | { |
1605 | object *tmp, *otmp; |
|
|
1606 | |
|
|
1607 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1647 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1608 | op->remove (); |
1648 | op->remove (); |
1609 | |
1649 | |
1610 | if (op->more) |
1650 | if (op->more) |
1611 | { |
1651 | { |
… | |
… | |
1613 | return op; |
1653 | return op; |
1614 | } |
1654 | } |
1615 | |
1655 | |
1616 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1656 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1617 | CLEAR_FLAG (op, FLAG_REMOVED); |
1657 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1658 | |
1618 | if (op->nrof) |
1659 | if (op->nrof) |
1619 | { |
1660 | { |
1620 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1661 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1621 | if (object::can_merge (tmp, op)) |
1662 | if (object::can_merge (tmp, op)) |
1622 | { |
1663 | { |
1623 | /* return the original object and remove inserted object |
1664 | /* return the original object and remove inserted object |
1624 | (client needs the original object) */ |
1665 | (client needs the original object) */ |
1625 | tmp->nrof += op->nrof; |
1666 | tmp->nrof += op->nrof; |
… | |
… | |
1644 | add_weight (this, op->weight * op->nrof); |
1685 | add_weight (this, op->weight * op->nrof); |
1645 | } |
1686 | } |
1646 | else |
1687 | else |
1647 | add_weight (this, (op->weight + op->carrying)); |
1688 | add_weight (this, (op->weight + op->carrying)); |
1648 | |
1689 | |
1649 | otmp = this->in_player (); |
1690 | if (object *otmp = this->in_player ()) |
1650 | if (otmp && otmp->contr) |
|
|
1651 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1691 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1652 | otmp->update_stats (); |
1692 | otmp->update_stats (); |
1653 | |
1693 | |
|
|
1694 | op->owner = 0; // its his/hers now. period. |
1654 | op->map = 0; |
1695 | op->map = 0; |
1655 | op->env = this; |
1696 | op->env = this; |
1656 | op->above = 0; |
1697 | op->above = 0; |
1657 | op->below = 0; |
1698 | op->below = 0; |
1658 | op->x = 0, op->y = 0; |
1699 | op->x = op->y = 0; |
1659 | |
1700 | |
1660 | /* reset the light list and los of the players on the map */ |
1701 | /* reset the light list and los of the players on the map */ |
1661 | if ((op->glow_radius != 0) && map) |
1702 | if (op->glow_radius && map) |
1662 | { |
1703 | { |
1663 | #ifdef DEBUG_LIGHTS |
1704 | #ifdef DEBUG_LIGHTS |
1664 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1705 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1665 | #endif /* DEBUG_LIGHTS */ |
1706 | #endif /* DEBUG_LIGHTS */ |
1666 | if (map->darkness) |
1707 | if (map->darkness) |
… | |
… | |
1766 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1807 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1767 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1808 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1768 | { |
1809 | { |
1769 | |
1810 | |
1770 | float |
1811 | float |
1771 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1812 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1772 | |
1813 | |
1773 | if (op->type == PLAYER) |
1814 | if (op->type == PLAYER) |
1774 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1815 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1775 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1816 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1776 | diff /= 4.0; |
1817 | diff /= 4.0; |
… | |
… | |
1900 | * activate recursively a flag on an object inventory |
1941 | * activate recursively a flag on an object inventory |
1901 | */ |
1942 | */ |
1902 | void |
1943 | void |
1903 | flag_inv (object *op, int flag) |
1944 | flag_inv (object *op, int flag) |
1904 | { |
1945 | { |
1905 | if (op->inv) |
|
|
1906 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1946 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1907 | { |
1947 | { |
1908 | SET_FLAG (tmp, flag); |
1948 | SET_FLAG (tmp, flag); |
1909 | flag_inv (tmp, flag); |
1949 | flag_inv (tmp, flag); |
1910 | } |
1950 | } |
1911 | } |
1951 | } |
1912 | |
1952 | |
1913 | /* |
1953 | /* |
1914 | * deactivate recursively a flag on an object inventory |
1954 | * deactivate recursively a flag on an object inventory |
1915 | */ |
1955 | */ |
1916 | void |
1956 | void |
1917 | unflag_inv (object *op, int flag) |
1957 | unflag_inv (object *op, int flag) |
1918 | { |
1958 | { |
1919 | if (op->inv) |
|
|
1920 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1959 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1921 | { |
1960 | { |
1922 | CLEAR_FLAG (tmp, flag); |
1961 | CLEAR_FLAG (tmp, flag); |
1923 | unflag_inv (tmp, flag); |
1962 | unflag_inv (tmp, flag); |
1924 | } |
1963 | } |
1925 | } |
|
|
1926 | |
|
|
1927 | /* |
|
|
1928 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
1929 | * all it's inventory (recursively). |
|
|
1930 | * If checksums are used, a player will get set_cheat called for |
|
|
1931 | * him/her-self and all object carried by a call to this function. |
|
|
1932 | */ |
|
|
1933 | void |
|
|
1934 | set_cheat (object *op) |
|
|
1935 | { |
|
|
1936 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
1937 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
1938 | } |
1964 | } |
1939 | |
1965 | |
1940 | /* |
1966 | /* |
1941 | * find_free_spot(object, map, x, y, start, stop) will search for |
1967 | * find_free_spot(object, map, x, y, start, stop) will search for |
1942 | * a spot at the given map and coordinates which will be able to contain |
1968 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
1944 | * to search (see the freearr_x/y[] definition). |
1970 | * to search (see the freearr_x/y[] definition). |
1945 | * It returns a random choice among the alternatives found. |
1971 | * It returns a random choice among the alternatives found. |
1946 | * start and stop are where to start relative to the free_arr array (1,9 |
1972 | * start and stop are where to start relative to the free_arr array (1,9 |
1947 | * does all 4 immediate directions). This returns the index into the |
1973 | * does all 4 immediate directions). This returns the index into the |
1948 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1974 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1949 | * Note - this only checks to see if there is space for the head of the |
|
|
1950 | * object - if it is a multispace object, this should be called for all |
|
|
1951 | * pieces. |
|
|
1952 | * Note2: This function does correctly handle tiled maps, but does not |
1975 | * Note: This function does correctly handle tiled maps, but does not |
1953 | * inform the caller. However, insert_ob_in_map will update as |
1976 | * inform the caller. However, insert_ob_in_map will update as |
1954 | * necessary, so the caller shouldn't need to do any special work. |
1977 | * necessary, so the caller shouldn't need to do any special work. |
1955 | * Note - updated to take an object instead of archetype - this is necessary |
1978 | * Note - updated to take an object instead of archetype - this is necessary |
1956 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1979 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1957 | * to know if the space in question will block the object. We can't use |
1980 | * to know if the space in question will block the object. We can't use |
… | |
… | |
1959 | * customized, changed states, etc. |
1982 | * customized, changed states, etc. |
1960 | */ |
1983 | */ |
1961 | int |
1984 | int |
1962 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1985 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1963 | { |
1986 | { |
|
|
1987 | int altern[SIZEOFFREE]; |
1964 | int index = 0, flag; |
1988 | int index = 0, flag; |
1965 | int altern[SIZEOFFREE]; |
|
|
1966 | |
1989 | |
1967 | for (int i = start; i < stop; i++) |
1990 | for (int i = start; i < stop; i++) |
1968 | { |
1991 | { |
1969 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
1992 | mapxy pos (m, x, y); pos.move (i); |
1970 | if (!flag) |
1993 | |
|
|
1994 | if (!pos.normalise ()) |
|
|
1995 | continue; |
|
|
1996 | |
|
|
1997 | mapspace &ms = *pos; |
|
|
1998 | |
|
|
1999 | if (ms.flags () & P_IS_ALIVE) |
|
|
2000 | continue; |
|
|
2001 | |
|
|
2002 | /* However, often |
|
|
2003 | * ob doesn't have any move type (when used to place exits) |
|
|
2004 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
2005 | */ |
|
|
2006 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
2007 | { |
1971 | altern [index++] = i; |
2008 | altern [index++] = i; |
|
|
2009 | continue; |
|
|
2010 | } |
1972 | |
2011 | |
1973 | /* Basically, if we find a wall on a space, we cut down the search size. |
2012 | /* Basically, if we find a wall on a space, we cut down the search size. |
1974 | * In this way, we won't return spaces that are on another side of a wall. |
2013 | * In this way, we won't return spaces that are on another side of a wall. |
1975 | * This mostly work, but it cuts down the search size in all directions - |
2014 | * This mostly work, but it cuts down the search size in all directions - |
1976 | * if the space being examined only has a wall to the north and empty |
2015 | * if the space being examined only has a wall to the north and empty |
1977 | * spaces in all the other directions, this will reduce the search space |
2016 | * spaces in all the other directions, this will reduce the search space |
1978 | * to only the spaces immediately surrounding the target area, and |
2017 | * to only the spaces immediately surrounding the target area, and |
1979 | * won't look 2 spaces south of the target space. |
2018 | * won't look 2 spaces south of the target space. |
1980 | */ |
2019 | */ |
1981 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
2020 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
2021 | { |
1982 | stop = maxfree[i]; |
2022 | stop = maxfree[i]; |
|
|
2023 | continue; |
|
|
2024 | } |
|
|
2025 | |
|
|
2026 | /* Note it is intentional that we check ob - the movement type of the |
|
|
2027 | * head of the object should correspond for the entire object. |
|
|
2028 | */ |
|
|
2029 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
2030 | continue; |
|
|
2031 | |
|
|
2032 | if (ob->blocked (m, pos.x, pos.y)) |
|
|
2033 | continue; |
|
|
2034 | |
|
|
2035 | altern [index++] = i; |
1983 | } |
2036 | } |
1984 | |
2037 | |
1985 | if (!index) |
2038 | if (!index) |
1986 | return -1; |
2039 | return -1; |
1987 | |
2040 | |
1988 | return altern[RANDOM () % index]; |
2041 | return altern [rndm (index)]; |
1989 | } |
2042 | } |
1990 | |
2043 | |
1991 | /* |
2044 | /* |
1992 | * find_first_free_spot(archetype, maptile, x, y) works like |
2045 | * find_first_free_spot(archetype, maptile, x, y) works like |
1993 | * find_free_spot(), but it will search max number of squares. |
2046 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
1996 | */ |
2049 | */ |
1997 | int |
2050 | int |
1998 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2051 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
1999 | { |
2052 | { |
2000 | for (int i = 0; i < SIZEOFFREE; i++) |
2053 | for (int i = 0; i < SIZEOFFREE; i++) |
2001 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2054 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2002 | return i; |
2055 | return i; |
2003 | |
2056 | |
2004 | return -1; |
2057 | return -1; |
2005 | } |
2058 | } |
2006 | |
2059 | |
… | |
… | |
2014 | { |
2067 | { |
2015 | arr += begin; |
2068 | arr += begin; |
2016 | end -= begin; |
2069 | end -= begin; |
2017 | |
2070 | |
2018 | while (--end) |
2071 | while (--end) |
2019 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2072 | swap (arr [end], arr [rndm (end + 1)]); |
2020 | } |
2073 | } |
2021 | |
2074 | |
2022 | /* new function to make monster searching more efficient, and effective! |
2075 | /* new function to make monster searching more efficient, and effective! |
2023 | * This basically returns a randomized array (in the passed pointer) of |
2076 | * This basically returns a randomized array (in the passed pointer) of |
2024 | * the spaces to find monsters. In this way, it won't always look for |
2077 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2060 | object *tmp; |
2113 | object *tmp; |
2061 | maptile *mp; |
2114 | maptile *mp; |
2062 | |
2115 | |
2063 | MoveType blocked, move_type; |
2116 | MoveType blocked, move_type; |
2064 | |
2117 | |
2065 | if (exclude && exclude->head) |
2118 | if (exclude && exclude->head_ () != exclude) |
2066 | { |
2119 | { |
2067 | exclude = exclude->head; |
2120 | exclude = exclude->head; |
2068 | move_type = exclude->move_type; |
2121 | move_type = exclude->move_type; |
2069 | } |
2122 | } |
2070 | else |
2123 | else |
… | |
… | |
2093 | max = maxfree[i]; |
2146 | max = maxfree[i]; |
2094 | else if (mflags & P_IS_ALIVE) |
2147 | else if (mflags & P_IS_ALIVE) |
2095 | { |
2148 | { |
2096 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2149 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2097 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2150 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2098 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2151 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2099 | break; |
2152 | break; |
2100 | |
2153 | |
2101 | if (tmp) |
2154 | if (tmp) |
2102 | return freedir[i]; |
2155 | return freedir[i]; |
2103 | } |
2156 | } |
… | |
… | |
2158 | |
2211 | |
2159 | return 3; |
2212 | return 3; |
2160 | } |
2213 | } |
2161 | |
2214 | |
2162 | /* |
2215 | /* |
2163 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
2164 | * the "absolute" direction of a number (it actually takes care of |
|
|
2165 | * "overflow" in previous calculations of a direction). |
|
|
2166 | */ |
|
|
2167 | |
|
|
2168 | int |
|
|
2169 | absdir (int d) |
|
|
2170 | { |
|
|
2171 | while (d < 1) |
|
|
2172 | d += 8; |
|
|
2173 | |
|
|
2174 | while (d > 8) |
|
|
2175 | d -= 8; |
|
|
2176 | |
|
|
2177 | return d; |
|
|
2178 | } |
|
|
2179 | |
|
|
2180 | /* |
|
|
2181 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2216 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2182 | * between two directions (which are expected to be absolute (see absdir()) |
2217 | * between two directions (which are expected to be absolute (see absdir()) |
2183 | */ |
2218 | */ |
2184 | |
|
|
2185 | int |
2219 | int |
2186 | dirdiff (int dir1, int dir2) |
2220 | dirdiff (int dir1, int dir2) |
2187 | { |
2221 | { |
2188 | int d; |
2222 | int d; |
2189 | |
2223 | |
… | |
… | |
2302 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2336 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2303 | * core dumps if they do. |
2337 | * core dumps if they do. |
2304 | * |
2338 | * |
2305 | * Add a check so we can't pick up invisible objects (0.93.8) |
2339 | * Add a check so we can't pick up invisible objects (0.93.8) |
2306 | */ |
2340 | */ |
2307 | |
|
|
2308 | int |
2341 | int |
2309 | can_pick (const object *who, const object *item) |
2342 | can_pick (const object *who, const object *item) |
2310 | { |
2343 | { |
2311 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2344 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2312 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2345 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
… | |
… | |
2317 | * create clone from object to another |
2350 | * create clone from object to another |
2318 | */ |
2351 | */ |
2319 | object * |
2352 | object * |
2320 | object_create_clone (object *asrc) |
2353 | object_create_clone (object *asrc) |
2321 | { |
2354 | { |
2322 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2355 | object *dst = 0, *tmp, *src, *prev, *item; |
2323 | |
2356 | |
2324 | if (!asrc) |
2357 | if (!asrc) |
2325 | return 0; |
2358 | return 0; |
2326 | |
2359 | |
2327 | src = asrc; |
|
|
2328 | if (src->head) |
|
|
2329 | src = src->head; |
2360 | src = asrc->head_ (); |
2330 | |
2361 | |
2331 | prev = 0; |
2362 | prev = 0; |
2332 | for (part = src; part; part = part->more) |
2363 | for (object *part = src; part; part = part->more) |
2333 | { |
2364 | { |
2334 | tmp = part->clone (); |
2365 | tmp = part->clone (); |
2335 | tmp->x -= src->x; |
2366 | tmp->x -= src->x; |
2336 | tmp->y -= src->y; |
2367 | tmp->y -= src->y; |
2337 | |
2368 | |
… | |
… | |
2353 | |
2384 | |
2354 | for (item = src->inv; item; item = item->below) |
2385 | for (item = src->inv; item; item = item->below) |
2355 | insert_ob_in_ob (object_create_clone (item), dst); |
2386 | insert_ob_in_ob (object_create_clone (item), dst); |
2356 | |
2387 | |
2357 | return dst; |
2388 | return dst; |
2358 | } |
|
|
2359 | |
|
|
2360 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2361 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2362 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2363 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2364 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2365 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2366 | object * |
|
|
2367 | load_object_str (const char *obstr) |
|
|
2368 | { |
|
|
2369 | object *op; |
|
|
2370 | char filename[MAX_BUF]; |
|
|
2371 | |
|
|
2372 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2373 | |
|
|
2374 | FILE *tempfile = fopen (filename, "w"); |
|
|
2375 | |
|
|
2376 | if (tempfile == NULL) |
|
|
2377 | { |
|
|
2378 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2379 | return NULL; |
|
|
2380 | } |
|
|
2381 | |
|
|
2382 | fprintf (tempfile, obstr); |
|
|
2383 | fclose (tempfile); |
|
|
2384 | |
|
|
2385 | op = object::create (); |
|
|
2386 | |
|
|
2387 | object_thawer thawer (filename); |
|
|
2388 | |
|
|
2389 | if (thawer) |
|
|
2390 | load_object (thawer, op, 0); |
|
|
2391 | |
|
|
2392 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2393 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2394 | |
|
|
2395 | return op; |
|
|
2396 | } |
2389 | } |
2397 | |
2390 | |
2398 | /* This returns the first object in who's inventory that |
2391 | /* This returns the first object in who's inventory that |
2399 | * has the same type and subtype match. |
2392 | * has the same type and subtype match. |
2400 | * returns NULL if no match. |
2393 | * returns NULL if no match. |
… | |
… | |
2455 | if (link->key == canonical_key) |
2448 | if (link->key == canonical_key) |
2456 | return link->value; |
2449 | return link->value; |
2457 | |
2450 | |
2458 | return 0; |
2451 | return 0; |
2459 | } |
2452 | } |
2460 | |
|
|
2461 | |
2453 | |
2462 | /* |
2454 | /* |
2463 | * Updates the canonical_key in op to value. |
2455 | * Updates the canonical_key in op to value. |
2464 | * |
2456 | * |
2465 | * canonical_key is a shared string (value doesn't have to be). |
2457 | * canonical_key is a shared string (value doesn't have to be). |
… | |
… | |
2489 | /* Basically, if the archetype has this key set, |
2481 | /* Basically, if the archetype has this key set, |
2490 | * we need to store the null value so when we save |
2482 | * we need to store the null value so when we save |
2491 | * it, we save the empty value so that when we load, |
2483 | * it, we save the empty value so that when we load, |
2492 | * we get this value back again. |
2484 | * we get this value back again. |
2493 | */ |
2485 | */ |
2494 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2486 | if (get_ob_key_link (op->arch, canonical_key)) |
2495 | field->value = 0; |
2487 | field->value = 0; |
2496 | else |
2488 | else |
2497 | { |
2489 | { |
2498 | if (last) |
2490 | if (last) |
2499 | last->next = field->next; |
2491 | last->next = field->next; |
… | |
… | |
2568 | } |
2560 | } |
2569 | else |
2561 | else |
2570 | item = item->env; |
2562 | item = item->env; |
2571 | } |
2563 | } |
2572 | |
2564 | |
2573 | |
|
|
2574 | const char * |
2565 | const char * |
2575 | object::flag_desc (char *desc, int len) const |
2566 | object::flag_desc (char *desc, int len) const |
2576 | { |
2567 | { |
2577 | char *p = desc; |
2568 | char *p = desc; |
2578 | bool first = true; |
2569 | bool first = true; |
… | |
… | |
2605 | { |
2596 | { |
2606 | char flagdesc[512]; |
2597 | char flagdesc[512]; |
2607 | char info2[256 * 4]; |
2598 | char info2[256 * 4]; |
2608 | char *p = info; |
2599 | char *p = info; |
2609 | |
2600 | |
2610 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}", |
2601 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2611 | count, uuid.seq, |
2602 | count, |
|
|
2603 | uuid.c_str (), |
2612 | &name, |
2604 | &name, |
2613 | title ? "\",title:" : "", |
2605 | title ? "\",title:\"" : "", |
2614 | title ? (const char *)title : "", |
2606 | title ? (const char *)title : "", |
2615 | flag_desc (flagdesc, 512), type); |
2607 | flag_desc (flagdesc, 512), type); |
2616 | |
2608 | |
2617 | if (env) |
2609 | if (!this->flag[FLAG_REMOVED] && env) |
2618 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2610 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2619 | |
2611 | |
2620 | if (map) |
2612 | if (map) |
2621 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2613 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2622 | |
2614 | |
… | |
… | |
2624 | } |
2616 | } |
2625 | |
2617 | |
2626 | const char * |
2618 | const char * |
2627 | object::debug_desc () const |
2619 | object::debug_desc () const |
2628 | { |
2620 | { |
2629 | static char info[256 * 4]; |
2621 | static char info[3][256 * 4]; |
|
|
2622 | static int info_idx; |
|
|
2623 | |
2630 | return debug_desc (info); |
2624 | return debug_desc (info [++info_idx % 3]); |
2631 | } |
2625 | } |
2632 | |
2626 | |
|
|
2627 | struct region * |
|
|
2628 | object::region () const |
|
|
2629 | { |
|
|
2630 | return map ? map->region (x, y) |
|
|
2631 | : region::default_region (); |
|
|
2632 | } |
|
|
2633 | |
|
|
2634 | const materialtype_t * |
|
|
2635 | object::dominant_material () const |
|
|
2636 | { |
|
|
2637 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2638 | return mt; |
|
|
2639 | |
|
|
2640 | return name_to_material (shstr_unknown); |
|
|
2641 | } |
|
|
2642 | |
|
|
2643 | void |
|
|
2644 | object::open_container (object *new_container) |
|
|
2645 | { |
|
|
2646 | if (container == new_container) |
|
|
2647 | return; |
|
|
2648 | |
|
|
2649 | if (object *old_container = container) |
|
|
2650 | { |
|
|
2651 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2652 | return; |
|
|
2653 | |
|
|
2654 | #if 0 |
|
|
2655 | // remove the "Close old_container" object. |
|
|
2656 | if (object *closer = old_container->inv) |
|
|
2657 | if (closer->type == CLOSE_CON) |
|
|
2658 | closer->destroy (); |
|
|
2659 | #endif |
|
|
2660 | |
|
|
2661 | old_container->flag [FLAG_APPLIED] = 0; |
|
|
2662 | container = 0; |
|
|
2663 | |
|
|
2664 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2665 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2666 | play_sound (sound_find ("chest_close")); |
|
|
2667 | } |
|
|
2668 | |
|
|
2669 | if (new_container) |
|
|
2670 | { |
|
|
2671 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2672 | return; |
|
|
2673 | |
|
|
2674 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2675 | #if 0 |
|
|
2676 | // insert the "Close Container" object. |
|
|
2677 | if (archetype *closer = new_container->other_arch) |
|
|
2678 | { |
|
|
2679 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2680 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2681 | new_container->insert (closer); |
|
|
2682 | } |
|
|
2683 | #endif |
|
|
2684 | |
|
|
2685 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2686 | |
|
|
2687 | new_container->flag [FLAG_APPLIED] = 1; |
|
|
2688 | container = new_container; |
|
|
2689 | |
|
|
2690 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2691 | esrv_send_inventory (this, new_container); |
|
|
2692 | play_sound (sound_find ("chest_open")); |
|
|
2693 | } |
|
|
2694 | } |
|
|
2695 | |
|
|
2696 | object * |
|
|
2697 | object::force_find (const shstr name) |
|
|
2698 | { |
|
|
2699 | /* cycle through his inventory to look for the MARK we want to |
|
|
2700 | * place |
|
|
2701 | */ |
|
|
2702 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2703 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2704 | return splay (tmp); |
|
|
2705 | |
|
|
2706 | return 0; |
|
|
2707 | } |
|
|
2708 | |
|
|
2709 | void |
|
|
2710 | object::force_add (const shstr name, int duration) |
|
|
2711 | { |
|
|
2712 | if (object *force = force_find (name)) |
|
|
2713 | force->destroy (); |
|
|
2714 | |
|
|
2715 | object *force = get_archetype (FORCE_NAME); |
|
|
2716 | |
|
|
2717 | force->slaying = name; |
|
|
2718 | force->stats.food = 1; |
|
|
2719 | force->speed_left = -1.f; |
|
|
2720 | |
|
|
2721 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2722 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2723 | force->flag [FLAG_APPLIED] = true; |
|
|
2724 | |
|
|
2725 | insert (force); |
|
|
2726 | } |
|
|
2727 | |
|
|
2728 | void |
|
|
2729 | object::play_sound (faceidx sound) const |
|
|
2730 | { |
|
|
2731 | if (!sound) |
|
|
2732 | return; |
|
|
2733 | |
|
|
2734 | if (flag [FLAG_REMOVED]) |
|
|
2735 | return; |
|
|
2736 | |
|
|
2737 | if (env) |
|
|
2738 | { |
|
|
2739 | if (object *pl = in_player ()) |
|
|
2740 | pl->contr->play_sound (sound); |
|
|
2741 | } |
|
|
2742 | else |
|
|
2743 | map->play_sound (sound, x, y); |
|
|
2744 | } |
|
|
2745 | |