1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
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,2008 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. |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
|
|
26 | sub/add_weight will transcend the environment updating the carrying |
|
|
27 | variable. */ |
|
|
28 | #include <global.h> |
24 | #include <global.h> |
29 | #include <stdio.h> |
25 | #include <stdio.h> |
30 | #include <sys/types.h> |
26 | #include <sys/types.h> |
31 | #include <sys/uio.h> |
27 | #include <sys/uio.h> |
32 | #include <object.h> |
28 | #include <object.h> |
33 | #include <funcpoint.h> |
29 | #include <sproto.h> |
34 | #include <loader.h> |
30 | #include <loader.h> |
35 | |
31 | |
36 | #include <bitset> |
32 | #include <bitset> |
37 | |
33 | |
38 | int nrofallocobjects = 0; |
34 | UUID UUID::cur; |
39 | static UUID uuid; |
35 | static uint64_t seq_next_save; |
40 | const uint64 UUID_SKIP = 1<<19; |
36 | static const uint64 UUID_GAP = 1<<19; |
41 | |
37 | |
42 | objectvec objects; |
38 | objectvec objects; |
43 | activevec actives; |
39 | activevec actives; |
44 | |
40 | |
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, |
41 | short freearr_x[SIZEOFFREE] = { |
|
|
42 | 0, |
|
|
43 | 0, 1, 1, 1, 0, -1, -1, -1, |
|
|
44 | 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 |
45 | 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 | }; |
46 | }; |
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, |
47 | short freearr_y[SIZEOFFREE] = { |
|
|
48 | 0, |
|
|
49 | -1, -1, 0, 1, 1, 1, 0, -1, |
|
|
50 | -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 |
51 | -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 | }; |
52 | }; |
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, |
53 | int maxfree[SIZEOFFREE] = { |
|
|
54 | 0, |
|
|
55 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
56 | 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 |
57 | 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 | }; |
58 | }; |
54 | int freedir[SIZEOFFREE] = { |
59 | 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, |
60 | 0, |
|
|
61 | 1, 2, 3, 4, 5, 6, 7, 8, |
|
|
62 | 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 |
63 | 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 | }; |
64 | }; |
58 | |
65 | |
59 | static void |
66 | static void |
60 | write_uuid (void) |
67 | write_uuid (uval64 skip, bool sync) |
61 | { |
68 | { |
62 | char filename1[MAX_BUF], filename2[MAX_BUF]; |
69 | CALL_BEGIN (2); |
63 | |
70 | CALL_ARG_SV (newSVval64 (skip)); |
64 | sprintf (filename1, "%s/uuid", settings.localdir); |
71 | CALL_ARG_SV (boolSV (sync)); |
65 | sprintf (filename2, "%s/uuid~", settings.localdir); |
72 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
66 | |
73 | 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 | } |
74 | } |
79 | |
75 | |
80 | static void |
76 | static void |
81 | read_uuid (void) |
77 | read_uuid (void) |
82 | { |
78 | { |
83 | char filename[MAX_BUF]; |
79 | char filename[MAX_BUF]; |
84 | |
80 | |
85 | sprintf (filename, "%s/uuid", settings.localdir); |
81 | sprintf (filename, "%s/uuid", settings.localdir); |
86 | |
82 | |
|
|
83 | seq_next_save = 0; |
|
|
84 | |
87 | FILE *fp; |
85 | FILE *fp; |
88 | |
86 | |
89 | if (!(fp = fopen (filename, "r"))) |
87 | if (!(fp = fopen (filename, "r"))) |
90 | { |
88 | { |
91 | if (errno == ENOENT) |
89 | if (errno == ENOENT) |
92 | { |
90 | { |
93 | LOG (llevInfo, "RESET uid to 1\n"); |
91 | LOG (llevInfo, "RESET uid to 1\n"); |
94 | uuid.seq = 0; |
92 | UUID::cur.seq = 0; |
95 | write_uuid (); |
93 | write_uuid (UUID_GAP, true); |
96 | return; |
94 | return; |
97 | } |
95 | } |
98 | |
96 | |
99 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
97 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
100 | _exit (1); |
98 | _exit (1); |
101 | } |
99 | } |
102 | |
100 | |
103 | int version; |
101 | UUID::BUF buf; |
104 | unsigned long long uid; |
102 | buf[0] = 0; |
105 | if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1) |
103 | fgets (buf, sizeof (buf), fp); |
|
|
104 | |
|
|
105 | if (!UUID::cur.parse (buf)) |
106 | { |
106 | { |
107 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
107 | LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf); |
108 | _exit (1); |
108 | _exit (1); |
109 | } |
109 | } |
110 | |
110 | |
111 | uuid.seq = uid; |
111 | LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ()); |
112 | write_uuid (); |
112 | |
113 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
113 | write_uuid (UUID_GAP, true); |
114 | fclose (fp); |
114 | fclose (fp); |
115 | } |
115 | } |
116 | |
116 | |
117 | UUID |
117 | UUID |
118 | gen_uuid () |
118 | UUID::gen () |
119 | { |
119 | { |
120 | UUID uid; |
120 | UUID uid; |
121 | |
121 | |
122 | uid.seq = ++uuid.seq; |
122 | uid.seq = ++cur.seq; |
123 | |
123 | |
124 | if (!(uuid.seq & (UUID_SKIP - 1))) |
124 | if (expect_false (cur.seq >= seq_next_save)) |
125 | write_uuid (); |
125 | { |
|
|
126 | seq_next_save = UUID::cur.seq + (UUID_GAP >> 1); |
|
|
127 | write_uuid (UUID_GAP, false); |
|
|
128 | } |
|
|
129 | |
126 | |
130 | |
127 | return uid; |
131 | return uid; |
128 | } |
132 | } |
129 | |
133 | |
130 | void |
134 | void |
131 | init_uuid () |
135 | UUID::init () |
132 | { |
136 | { |
133 | read_uuid (); |
137 | read_uuid (); |
134 | } |
138 | } |
135 | |
139 | |
136 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
140 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
137 | static int |
141 | static bool |
138 | compare_ob_value_lists_one (const object *wants, const object *has) |
142 | compare_ob_value_lists_one (const object *wants, const object *has) |
139 | { |
143 | { |
140 | key_value *wants_field; |
144 | key_value *wants_field; |
141 | |
145 | |
142 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
146 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
… | |
… | |
150 | key_value *has_field; |
154 | key_value *has_field; |
151 | |
155 | |
152 | /* Look for a field in has with the same key. */ |
156 | /* Look for a field in has with the same key. */ |
153 | has_field = get_ob_key_link (has, wants_field->key); |
157 | has_field = get_ob_key_link (has, wants_field->key); |
154 | |
158 | |
155 | if (has_field == NULL) |
159 | if (!has_field) |
156 | { |
|
|
157 | /* No field with that name. */ |
160 | return 0; /* No field with that name. */ |
158 | return FALSE; |
|
|
159 | } |
|
|
160 | |
161 | |
161 | /* Found the matching field. */ |
162 | /* Found the matching field. */ |
162 | if (has_field->value != wants_field->value) |
163 | if (has_field->value != wants_field->value) |
163 | { |
|
|
164 | /* Values don't match, so this half of the comparison is false. */ |
164 | return 0; /* Values don't match, so this half of the comparison is false. */ |
165 | return FALSE; |
|
|
166 | } |
|
|
167 | |
165 | |
168 | /* If we get here, we found a match. Now for the next field in wants. */ |
166 | /* If we get here, we found a match. Now for the next field in wants. */ |
169 | } |
167 | } |
170 | |
168 | |
171 | /* If we get here, every field in wants has a matching field in has. */ |
169 | /* If we get here, every field in wants has a matching field in has. */ |
172 | return TRUE; |
170 | return 1; |
173 | } |
171 | } |
174 | |
172 | |
175 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
173 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
176 | static int |
174 | static bool |
177 | compare_ob_value_lists (const object *ob1, const object *ob2) |
175 | compare_ob_value_lists (const object *ob1, const object *ob2) |
178 | { |
176 | { |
179 | /* However, there may be fields in has which aren't partnered in wants, |
177 | /* However, there may be fields in has which aren't partnered in wants, |
180 | * so we need to run the comparison *twice*. :( |
178 | * so we need to run the comparison *twice*. :( |
181 | */ |
179 | */ |
… | |
… | |
202 | || ob1->speed != ob2->speed |
200 | || ob1->speed != ob2->speed |
203 | || ob1->value != ob2->value |
201 | || ob1->value != ob2->value |
204 | || ob1->name != ob2->name) |
202 | || ob1->name != ob2->name) |
205 | return 0; |
203 | return 0; |
206 | |
204 | |
207 | //TODO: this ain't working well, use nicer and correct overflow check |
205 | /* 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 |
206 | * for unsigned overflow (2c), second part checks whether the result |
209 | * value could not be stored in a sint32 (which unfortunately sometimes is |
207 | * would fit into a 32 bit signed int, which is often used to hold |
210 | * used to store nrof). |
208 | * nrof values. |
211 | */ |
209 | */ |
212 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
210 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
213 | return 0; |
211 | return 0; |
214 | |
212 | |
215 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
213 | /* 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 |
214 | * 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 |
215 | * 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 |
216 | * are not equal - just if it has been identified, the been_applied |
219 | * flags lose any meaning. |
217 | * flags lose any meaning. |
220 | */ |
218 | */ |
221 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
219 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
222 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
220 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
223 | |
221 | |
224 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
222 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
225 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
223 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
226 | |
224 | |
227 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
225 | if (ob1->arch->name != ob2->arch->name |
228 | || ob1->arch != ob2->arch |
|
|
229 | || ob1->name != ob2->name |
226 | || ob1->name != ob2->name |
230 | || ob1->title != ob2->title |
227 | || ob1->title != ob2->title |
231 | || ob1->msg != ob2->msg |
228 | || ob1->msg != ob2->msg |
232 | || ob1->weight != ob2->weight |
229 | || ob1->weight != ob2->weight |
233 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
234 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) ) |
|
|
235 | || ob1->attacktype != ob2->attacktype |
230 | || ob1->attacktype != ob2->attacktype |
236 | || ob1->magic != ob2->magic |
231 | || ob1->magic != ob2->magic |
237 | || ob1->slaying != ob2->slaying |
232 | || ob1->slaying != ob2->slaying |
238 | || ob1->skill != ob2->skill |
233 | || ob1->skill != ob2->skill |
239 | || ob1->value != ob2->value |
234 | || ob1->value != ob2->value |
… | |
… | |
246 | || ob1->move_block != ob2->move_block |
241 | || ob1->move_block != ob2->move_block |
247 | || ob1->move_allow != ob2->move_allow |
242 | || ob1->move_allow != ob2->move_allow |
248 | || ob1->move_on != ob2->move_on |
243 | || ob1->move_on != ob2->move_on |
249 | || ob1->move_off != ob2->move_off |
244 | || ob1->move_off != ob2->move_off |
250 | || ob1->move_slow != ob2->move_slow |
245 | || ob1->move_slow != ob2->move_slow |
251 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
246 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
|
|
247 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
248 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
252 | return 0; |
249 | return 0; |
253 | |
250 | |
|
|
251 | if ((ob1->flag ^ ob2->flag) |
|
|
252 | .reset (FLAG_INV_LOCKED) |
|
|
253 | .reset (FLAG_CLIENT_SENT) |
|
|
254 | .reset (FLAG_REMOVED) |
|
|
255 | .any ()) |
|
|
256 | return 0; |
|
|
257 | |
254 | /* This is really a spellbook check - really, we should |
258 | /* This is really a spellbook check - we should in general |
255 | * check all objects in the inventory. |
259 | * not merge objects with real inventories, as splitting them |
|
|
260 | * is hard. |
256 | */ |
261 | */ |
257 | if (ob1->inv || ob2->inv) |
262 | if (ob1->inv || ob2->inv) |
258 | { |
263 | { |
259 | /* if one object has inventory but the other doesn't, not equiv */ |
264 | if (!(ob1->inv && ob2->inv)) |
260 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
265 | return 0; /* inventories differ in length */ |
261 | return 0; |
|
|
262 | |
266 | |
263 | /* Now check to see if the two inventory objects could merge */ |
267 | if (ob1->inv->below || ob2->inv->below) |
|
|
268 | return 0; /* more than one object in inv */ |
|
|
269 | |
264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
270 | if (!object::can_merge (ob1->inv, ob2->inv)) |
265 | return 0; |
271 | return 0; /* inventory objects differ */ |
266 | |
272 | |
267 | /* inventory ok - still need to check rest of this object to see |
273 | /* inventory ok - still need to check rest of this object to see |
268 | * if it is valid. |
274 | * if it is valid. |
269 | */ |
275 | */ |
270 | } |
276 | } |
… | |
… | |
289 | if (ob1->level != ob2->level) |
295 | if (ob1->level != ob2->level) |
290 | return 0; |
296 | return 0; |
291 | break; |
297 | break; |
292 | } |
298 | } |
293 | |
299 | |
294 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
300 | if (ob1->key_values || ob2->key_values) |
295 | { |
301 | { |
296 | /* At least one of these has key_values. */ |
302 | /* At least one of these has key_values. */ |
297 | if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) |
303 | if ((!ob1->key_values) != (!ob2->key_values)) |
298 | /* One has fields, but the other one doesn't. */ |
304 | return 0; /* One has fields, but the other one doesn't. */ |
|
|
305 | |
|
|
306 | if (!compare_ob_value_lists (ob1, ob2)) |
299 | return 0; |
307 | return 0; |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
|
|
301 | return 0; |
|
|
302 | } |
308 | } |
303 | |
309 | |
304 | //TODO: generate an event or call into perl for additional checks |
|
|
305 | if (ob1->self || ob2->self) |
310 | if (ob1->self || ob2->self) |
306 | { |
311 | { |
307 | ob1->optimise (); |
312 | ob1->optimise (); |
308 | ob2->optimise (); |
313 | ob2->optimise (); |
309 | |
314 | |
310 | if (ob1->self || ob2->self) |
315 | if (ob1->self || ob2->self) |
|
|
316 | { |
|
|
317 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
|
|
318 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
|
|
319 | |
|
|
320 | if (k1 != k2) |
311 | return 0; |
321 | return 0; |
|
|
322 | |
|
|
323 | if (k1 == 0) |
|
|
324 | return 1; |
|
|
325 | |
|
|
326 | if (!cfperl_can_merge (ob1, ob2)) |
|
|
327 | return 0; |
|
|
328 | } |
312 | } |
329 | } |
313 | |
330 | |
314 | /* Everything passes, must be OK. */ |
331 | /* Everything passes, must be OK. */ |
315 | return 1; |
332 | return 1; |
316 | } |
333 | } |
317 | |
334 | |
|
|
335 | // adjust weight per container type ("of holding") |
|
|
336 | static sint32 |
|
|
337 | weight_adjust (object *op, sint32 weight) |
|
|
338 | { |
|
|
339 | return op->type == CONTAINER |
|
|
340 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
|
|
341 | : weight; |
|
|
342 | } |
|
|
343 | |
318 | /* |
344 | /* |
|
|
345 | * adjust_weight(object, weight) adds the specified weight to an object, |
|
|
346 | * and also updates how much the environment(s) is/are carrying. |
|
|
347 | */ |
|
|
348 | static void |
|
|
349 | adjust_weight (object *op, sint32 weight) |
|
|
350 | { |
|
|
351 | while (op) |
|
|
352 | { |
|
|
353 | weight = weight_adjust (op, weight); |
|
|
354 | |
|
|
355 | if (!weight) |
|
|
356 | return; |
|
|
357 | |
|
|
358 | op->carrying += weight; |
|
|
359 | |
|
|
360 | if (object *pl = op->visible_to ()) |
|
|
361 | esrv_update_item (UPD_WEIGHT, pl, op); |
|
|
362 | |
|
|
363 | op = op->env; |
|
|
364 | } |
|
|
365 | } |
|
|
366 | |
|
|
367 | /* |
319 | * sum_weight() is a recursive function which calculates the weight |
368 | * this is a recursive function which calculates the weight |
320 | * an object is carrying. It goes through in figures out how much |
369 | * an object is carrying. It goes through op and figures out how much |
321 | * containers are carrying, and sums it up. |
370 | * containers are carrying, and sums it up. |
322 | */ |
371 | */ |
323 | long |
372 | void |
324 | sum_weight (object *op) |
373 | object::update_weight () |
325 | { |
374 | { |
326 | long sum; |
375 | sint32 sum = 0; |
327 | object *inv; |
|
|
328 | |
376 | |
329 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
377 | for (object *op = inv; op; op = op->below) |
330 | { |
378 | { |
331 | if (inv->inv) |
379 | if (op->inv) |
332 | sum_weight (inv); |
380 | op->update_weight (); |
333 | |
381 | |
334 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
382 | sum += op->total_weight (); |
|
|
383 | } |
|
|
384 | |
|
|
385 | sum = weight_adjust (this, sum); |
|
|
386 | |
|
|
387 | if (sum != carrying) |
335 | } |
388 | { |
336 | |
|
|
337 | if (op->type == CONTAINER && op->stats.Str) |
|
|
338 | sum = (sum * (100 - op->stats.Str)) / 100; |
|
|
339 | |
|
|
340 | if (op->carrying != sum) |
|
|
341 | op->carrying = sum; |
389 | carrying = sum; |
342 | |
390 | |
343 | return sum; |
391 | if (object *pl = visible_to ()) |
|
|
392 | esrv_update_item (UPD_WEIGHT, pl, this); |
|
|
393 | } |
344 | } |
394 | } |
345 | |
395 | |
346 | /** |
396 | /* |
347 | * Return the outermost environment object for a given object. |
397 | * Used by: Server DM commands: dumpbelow, dump. Some error messages. |
348 | */ |
|
|
349 | |
|
|
350 | object * |
|
|
351 | object_get_env_recursive (object *op) |
|
|
352 | { |
|
|
353 | while (op->env != NULL) |
|
|
354 | op = op->env; |
|
|
355 | return op; |
|
|
356 | } |
|
|
357 | |
|
|
358 | /* |
|
|
359 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
|
|
360 | * Some error messages. |
|
|
361 | * The result of the dump is stored in the static global errmsg array. |
|
|
362 | */ |
398 | */ |
363 | char * |
399 | char * |
364 | dump_object (object *op) |
400 | dump_object (object *op) |
365 | { |
401 | { |
366 | if (!op) |
402 | if (!op) |
… | |
… | |
374 | /* |
410 | /* |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
411 | * get_nearest_part(multi-object, object 2) returns the part of the |
376 | * multi-object 1 which is closest to the second object. |
412 | * multi-object 1 which is closest to the second object. |
377 | * If it's not a multi-object, it is returned. |
413 | * If it's not a multi-object, it is returned. |
378 | */ |
414 | */ |
379 | |
|
|
380 | object * |
415 | object * |
381 | get_nearest_part (object *op, const object *pl) |
416 | get_nearest_part (object *op, const object *pl) |
382 | { |
417 | { |
383 | object *tmp, *closest; |
418 | object *tmp, *closest; |
384 | int last_dist, i; |
419 | int last_dist, i; |
385 | |
420 | |
386 | if (op->more == NULL) |
421 | if (!op->more) |
387 | return op; |
422 | return op; |
|
|
423 | |
388 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more) |
424 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
425 | tmp; |
|
|
426 | tmp = tmp->more) |
389 | if ((i = distance (tmp, pl)) < last_dist) |
427 | if ((i = distance (tmp, pl)) < last_dist) |
390 | closest = tmp, last_dist = i; |
428 | closest = tmp, last_dist = i; |
|
|
429 | |
391 | return closest; |
430 | return closest; |
392 | } |
431 | } |
393 | |
432 | |
394 | /* |
433 | /* |
395 | * Returns the object which has the count-variable equal to the argument. |
434 | * Returns the object which has the count-variable equal to the argument. |
|
|
435 | * VERRRY slow. |
396 | */ |
436 | */ |
397 | object * |
437 | object * |
398 | find_object (tag_t i) |
438 | find_object (tag_t i) |
399 | { |
439 | { |
400 | for_all_objects (op) |
440 | for_all_objects (op) |
… | |
… | |
420 | break; |
460 | break; |
421 | |
461 | |
422 | return op; |
462 | return op; |
423 | } |
463 | } |
424 | |
464 | |
425 | void |
|
|
426 | free_all_object_data () |
|
|
427 | { |
|
|
428 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
429 | } |
|
|
430 | |
|
|
431 | /* |
465 | /* |
432 | * Sets the owner and sets the skill and exp pointers to owner's current |
466 | * Sets the owner and sets the skill and exp pointers to owner's current |
433 | * skill and experience objects. |
467 | * skill and experience objects. |
|
|
468 | * ACTUALLY NO! investigate! TODO |
434 | */ |
469 | */ |
435 | void |
470 | void |
436 | object::set_owner (object *owner) |
471 | object::set_owner (object *owner) |
437 | { |
472 | { |
|
|
473 | // allow objects which own objects |
438 | if (!owner) |
474 | if (owner) |
439 | return; |
|
|
440 | |
|
|
441 | /* next line added to allow objects which own objects */ |
|
|
442 | /* Add a check for ownercounts in here, as I got into an endless loop |
|
|
443 | * with the fireball owning a poison cloud which then owned the |
|
|
444 | * fireball. I believe that was caused by one of the objects getting |
|
|
445 | * freed and then another object replacing it. Since the ownercounts |
|
|
446 | * didn't match, this check is valid and I believe that cause is valid. |
|
|
447 | */ |
|
|
448 | while (owner->owner) |
475 | while (owner->owner) |
449 | owner = owner->owner; |
476 | owner = owner->owner; |
|
|
477 | |
|
|
478 | if (flag [FLAG_FREED]) |
|
|
479 | { |
|
|
480 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
|
|
481 | return; |
|
|
482 | } |
450 | |
483 | |
451 | this->owner = owner; |
484 | this->owner = owner; |
|
|
485 | } |
|
|
486 | |
|
|
487 | int |
|
|
488 | object::slottype () const |
|
|
489 | { |
|
|
490 | if (type == SKILL) |
|
|
491 | { |
|
|
492 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
493 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
494 | } |
|
|
495 | else |
|
|
496 | { |
|
|
497 | if (slot [body_combat].info) return slot_combat; |
|
|
498 | if (slot [body_range ].info) return slot_ranged; |
|
|
499 | } |
|
|
500 | |
|
|
501 | return slot_none; |
|
|
502 | } |
|
|
503 | |
|
|
504 | bool |
|
|
505 | object::change_weapon (object *ob) |
|
|
506 | { |
|
|
507 | if (current_weapon == ob) |
|
|
508 | return true; |
|
|
509 | |
|
|
510 | if (chosen_skill) |
|
|
511 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
512 | |
|
|
513 | current_weapon = ob; |
|
|
514 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
515 | |
|
|
516 | if (chosen_skill) |
|
|
517 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
518 | |
|
|
519 | update_stats (); |
|
|
520 | |
|
|
521 | if (ob) |
|
|
522 | { |
|
|
523 | // now check wether any body locations became invalid, in which case |
|
|
524 | // we cannot apply the weapon at the moment. |
|
|
525 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
526 | if (slot[i].used < 0) |
|
|
527 | { |
|
|
528 | current_weapon = chosen_skill = 0; |
|
|
529 | update_stats (); |
|
|
530 | |
|
|
531 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
532 | "You try to balance all your items at once, " |
|
|
533 | "but the %s is just too much for your body. " |
|
|
534 | "[You need to unapply some items first.]", &ob->name); |
|
|
535 | return false; |
|
|
536 | } |
|
|
537 | |
|
|
538 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
539 | } |
|
|
540 | else |
|
|
541 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
542 | |
|
|
543 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
544 | { |
|
|
545 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
546 | &name, ob->debug_desc ()); |
|
|
547 | return false; |
|
|
548 | } |
|
|
549 | |
|
|
550 | return true; |
452 | } |
551 | } |
453 | |
552 | |
454 | /* Zero the key_values on op, decrementing the shared-string |
553 | /* Zero the key_values on op, decrementing the shared-string |
455 | * refcounts and freeing the links. |
554 | * refcounts and freeing the links. |
456 | */ |
555 | */ |
… | |
… | |
520 | object::copy_to (object *dst) |
619 | object::copy_to (object *dst) |
521 | { |
620 | { |
522 | *dst = *this; |
621 | *dst = *this; |
523 | |
622 | |
524 | if (speed < 0) |
623 | if (speed < 0) |
525 | dst->speed_left = speed_left - rndm (); |
624 | dst->speed_left -= rndm (); |
526 | |
625 | |
527 | dst->set_speed (dst->speed); |
626 | dst->set_speed (dst->speed); |
528 | } |
627 | } |
529 | |
628 | |
530 | void |
629 | void |
531 | object::instantiate () |
630 | object::instantiate () |
532 | { |
631 | { |
533 | if (!uuid.seq) // HACK |
632 | if (!uuid.seq) // HACK |
534 | uuid = gen_uuid (); |
633 | uuid = UUID::gen (); |
535 | |
634 | |
536 | speed_left = -0.1f; |
635 | speed_left = -0.1f; |
537 | /* copy the body_info to the body_used - this is only really |
636 | /* copy the body_info to the body_used - this is only really |
538 | * need for monsters, but doesn't hurt to do it for everything. |
637 | * need for monsters, but doesn't hurt to do it for everything. |
539 | * by doing so, when a monster is created, it has good starting |
638 | * by doing so, when a monster is created, it has good starting |
540 | * values for the body_used info, so when items are created |
639 | * values for the body_used info, so when items are created |
541 | * for it, they can be properly equipped. |
640 | * for it, they can be properly equipped. |
542 | */ |
641 | */ |
543 | memcpy (body_used, body_info, sizeof (body_used)); |
642 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
643 | slot[i].used = slot[i].info; |
544 | |
644 | |
545 | attachable::instantiate (); |
645 | attachable::instantiate (); |
546 | } |
646 | } |
547 | |
647 | |
548 | object * |
648 | object * |
… | |
… | |
697 | static int object_count; |
797 | static int object_count; |
698 | |
798 | |
699 | void object::link () |
799 | void object::link () |
700 | { |
800 | { |
701 | assert (!index);//D |
801 | assert (!index);//D |
702 | uuid = gen_uuid (); |
802 | uuid = UUID::gen (); |
703 | count = ++object_count; |
803 | count = ++object_count; |
704 | |
804 | |
705 | refcnt_inc (); |
805 | refcnt_inc (); |
706 | objects.insert (this); |
806 | objects.insert (this); |
707 | } |
807 | } |
… | |
… | |
791 | * if some form of movement is allowed, let objects |
891 | * if some form of movement is allowed, let objects |
792 | * drop on that space. |
892 | * drop on that space. |
793 | */ |
893 | */ |
794 | if (!drop_to_ground |
894 | if (!drop_to_ground |
795 | || !map |
895 | || !map |
796 | || map->in_memory != MAP_IN_MEMORY |
896 | || map->in_memory != MAP_ACTIVE |
797 | || map->nodrop |
897 | || map->nodrop |
798 | || ms ().move_block == MOVE_ALL) |
898 | || ms ().move_block == MOVE_ALL) |
799 | { |
899 | { |
800 | while (inv) |
900 | while (inv) |
801 | { |
901 | { |
… | |
… | |
830 | } |
930 | } |
831 | |
931 | |
832 | void |
932 | void |
833 | object::do_destroy () |
933 | object::do_destroy () |
834 | { |
934 | { |
|
|
935 | if (object *pl = visible_to ()) |
|
|
936 | esrv_del_item (pl->contr, count); |
|
|
937 | |
835 | attachable::do_destroy (); |
938 | attachable::do_destroy (); |
836 | |
939 | |
837 | if (flag [FLAG_IS_LINKED]) |
940 | if (flag [FLAG_IS_LINKED]) |
838 | remove_button_link (this); |
941 | remove_button_link (this); |
839 | |
942 | |
… | |
… | |
856 | |
959 | |
857 | if (!freed_map) |
960 | if (!freed_map) |
858 | { |
961 | { |
859 | freed_map = new maptile; |
962 | freed_map = new maptile; |
860 | |
963 | |
|
|
964 | freed_map->path = "<freed objects map>"; |
861 | freed_map->name = "/internal/freed_objects_map"; |
965 | freed_map->name = "/internal/freed_objects_map"; |
862 | freed_map->width = 3; |
966 | freed_map->width = 3; |
863 | freed_map->height = 3; |
967 | freed_map->height = 3; |
|
|
968 | freed_map->nodrop = 1; |
864 | |
969 | |
865 | freed_map->alloc (); |
970 | freed_map->alloc (); |
866 | freed_map->in_memory = MAP_IN_MEMORY; |
971 | freed_map->in_memory = MAP_ACTIVE; |
867 | } |
972 | } |
868 | |
973 | |
869 | map = freed_map; |
974 | map = freed_map; |
870 | x = 1; |
975 | x = 1; |
871 | y = 1; |
976 | y = 1; |
872 | } |
977 | } |
873 | |
978 | |
874 | head = 0; |
|
|
875 | |
|
|
876 | if (more) |
979 | if (more) |
877 | { |
980 | { |
878 | more->destroy (); |
981 | more->destroy (); |
879 | more = 0; |
982 | more = 0; |
880 | } |
983 | } |
881 | |
984 | |
|
|
985 | head = 0; |
|
|
986 | |
882 | // clear those pointers that likely might have circular references to us |
987 | // clear those pointers that likely might cause circular references |
883 | owner = 0; |
988 | owner = 0; |
884 | enemy = 0; |
989 | enemy = 0; |
885 | attacked_by = 0; |
990 | attacked_by = 0; |
|
|
991 | current_weapon = 0; |
886 | } |
992 | } |
887 | |
993 | |
888 | void |
994 | void |
889 | object::destroy (bool destroy_inventory) |
995 | object::destroy (bool destroy_inventory) |
890 | { |
996 | { |
… | |
… | |
892 | return; |
998 | return; |
893 | |
999 | |
894 | if (destroy_inventory) |
1000 | if (destroy_inventory) |
895 | destroy_inv (false); |
1001 | destroy_inv (false); |
896 | |
1002 | |
|
|
1003 | if (is_head ()) |
|
|
1004 | if (sound_destroy) |
|
|
1005 | play_sound (sound_destroy); |
|
|
1006 | else if (flag [FLAG_MONSTER]) |
|
|
1007 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
|
|
1008 | |
897 | attachable::destroy (); |
1009 | attachable::destroy (); |
898 | } |
|
|
899 | |
|
|
900 | /* |
|
|
901 | * sub_weight() recursively (outwards) subtracts a number from the |
|
|
902 | * weight of an object (and what is carried by it's environment(s)). |
|
|
903 | */ |
|
|
904 | void |
|
|
905 | sub_weight (object *op, signed long weight) |
|
|
906 | { |
|
|
907 | while (op != NULL) |
|
|
908 | { |
|
|
909 | if (op->type == CONTAINER) |
|
|
910 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
911 | |
|
|
912 | op->carrying -= weight; |
|
|
913 | op = op->env; |
|
|
914 | } |
|
|
915 | } |
1010 | } |
916 | |
1011 | |
917 | /* op->remove (): |
1012 | /* op->remove (): |
918 | * This function removes the object op from the linked list of objects |
1013 | * This function removes the object op from the linked list of objects |
919 | * which it is currently tied to. When this function is done, the |
1014 | * which it is currently tied to. When this function is done, the |
… | |
… | |
940 | * In this case, the object to be removed is in someones |
1035 | * In this case, the object to be removed is in someones |
941 | * inventory. |
1036 | * inventory. |
942 | */ |
1037 | */ |
943 | if (env) |
1038 | if (env) |
944 | { |
1039 | { |
|
|
1040 | adjust_weight (env, -total_weight ()); |
|
|
1041 | |
|
|
1042 | *(above ? &above->below : &env->inv) = below; |
|
|
1043 | |
945 | if (nrof) |
1044 | if (below) |
946 | sub_weight (env, weight * nrof); |
1045 | below->above = above; |
947 | else |
1046 | |
948 | sub_weight (env, weight + carrying); |
1047 | /* we set up values so that it could be inserted into |
|
|
1048 | * the map, but we don't actually do that - it is up |
|
|
1049 | * to the caller to decide what we want to do. |
|
|
1050 | */ |
|
|
1051 | map = env->map; |
|
|
1052 | x = env->x; |
|
|
1053 | y = env->y; |
|
|
1054 | above = 0; |
|
|
1055 | below = 0; |
|
|
1056 | env = 0; |
949 | |
1057 | |
950 | /* NO_FIX_PLAYER is set when a great many changes are being |
1058 | /* NO_FIX_PLAYER is set when a great many changes are being |
951 | * made to players inventory. If set, avoiding the call |
1059 | * made to players inventory. If set, avoiding the call |
952 | * to save cpu time. |
1060 | * to save cpu time. |
953 | */ |
1061 | */ |
954 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1062 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
955 | otmp->update_stats (); |
1063 | otmp->update_stats (); |
956 | |
|
|
957 | if (above) |
|
|
958 | above->below = below; |
|
|
959 | else |
|
|
960 | env->inv = below; |
|
|
961 | |
|
|
962 | if (below) |
|
|
963 | below->above = above; |
|
|
964 | |
|
|
965 | /* we set up values so that it could be inserted into |
|
|
966 | * the map, but we don't actually do that - it is up |
|
|
967 | * to the caller to decide what we want to do. |
|
|
968 | */ |
|
|
969 | x = env->x, y = env->y; |
|
|
970 | map = env->map; |
|
|
971 | above = 0, below = 0; |
|
|
972 | env = 0; |
|
|
973 | } |
1064 | } |
974 | else if (map) |
1065 | else if (map) |
975 | { |
1066 | { |
976 | if (type == PLAYER) |
1067 | if (type == PLAYER) |
977 | { |
1068 | { |
… | |
… | |
1015 | if (map->in_memory == MAP_SAVING) |
1106 | if (map->in_memory == MAP_SAVING) |
1016 | return; |
1107 | return; |
1017 | |
1108 | |
1018 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1109 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1019 | |
1110 | |
|
|
1111 | if (object *pl = ms.player ()) |
|
|
1112 | { |
|
|
1113 | if (pl->container == this) |
|
|
1114 | /* If a container that the player is currently using somehow gets |
|
|
1115 | * removed (most likely destroyed), update the player view |
|
|
1116 | * appropriately. |
|
|
1117 | */ |
|
|
1118 | pl->close_container (); |
|
|
1119 | |
|
|
1120 | pl->contr->ns->floorbox_update (); |
|
|
1121 | } |
|
|
1122 | |
1020 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1123 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1021 | { |
1124 | { |
1022 | /* No point updating the players look faces if he is the object |
1125 | /* No point updating the players look faces if he is the object |
1023 | * being removed. |
1126 | * being removed. |
1024 | */ |
1127 | */ |
1025 | |
|
|
1026 | if (tmp->type == PLAYER && tmp != this) |
|
|
1027 | { |
|
|
1028 | /* If a container that the player is currently using somehow gets |
|
|
1029 | * removed (most likely destroyed), update the player view |
|
|
1030 | * appropriately. |
|
|
1031 | */ |
|
|
1032 | if (tmp->container == this) |
|
|
1033 | { |
|
|
1034 | flag [FLAG_APPLIED] = 0; |
|
|
1035 | tmp->container = 0; |
|
|
1036 | } |
|
|
1037 | |
|
|
1038 | if (tmp->contr->ns) |
|
|
1039 | tmp->contr->ns->floorbox_update (); |
|
|
1040 | } |
|
|
1041 | |
1128 | |
1042 | /* See if object moving off should effect something */ |
1129 | /* See if object moving off should effect something */ |
1043 | if (check_walk_off |
1130 | if (check_walk_off |
1044 | && ((move_type & tmp->move_off) |
1131 | && ((move_type & tmp->move_off) |
1045 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1132 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
… | |
… | |
1048 | |
1135 | |
1049 | if (destroyed ()) |
1136 | if (destroyed ()) |
1050 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1137 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1051 | } |
1138 | } |
1052 | |
1139 | |
1053 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1054 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1055 | if (tmp->above == tmp) |
|
|
1056 | tmp->above = 0; |
|
|
1057 | |
|
|
1058 | last = tmp; |
1140 | last = tmp; |
1059 | } |
1141 | } |
1060 | |
1142 | |
1061 | /* last == NULL if there are no objects on this space */ |
1143 | /* last == NULL if there are no objects on this space */ |
1062 | //TODO: this makes little sense, why only update the topmost object? |
1144 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1082 | merge_ob (object *op, object *top) |
1164 | merge_ob (object *op, object *top) |
1083 | { |
1165 | { |
1084 | if (!op->nrof) |
1166 | if (!op->nrof) |
1085 | return 0; |
1167 | return 0; |
1086 | |
1168 | |
1087 | if (top) |
1169 | if (!top) |
1088 | for (top = op; top && top->above; top = top->above) |
1170 | for (top = op; top && top->above; top = top->above) |
1089 | ; |
1171 | ; |
1090 | |
1172 | |
1091 | for (; top; top = top->below) |
1173 | for (; top; top = top->below) |
1092 | { |
1174 | { |
… | |
… | |
1113 | if (more) |
1195 | if (more) |
1114 | return; |
1196 | return; |
1115 | |
1197 | |
1116 | object *prev = this; |
1198 | object *prev = this; |
1117 | |
1199 | |
1118 | for (archetype *at = arch->more; at; at = at->more) |
1200 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1119 | { |
1201 | { |
1120 | object *op = arch_to_object (at); |
1202 | object *op = arch_to_object (at); |
1121 | |
1203 | |
1122 | op->name = name; |
1204 | op->name = name; |
1123 | op->name_pl = name_pl; |
1205 | op->name_pl = name_pl; |
… | |
… | |
1137 | object * |
1219 | object * |
1138 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1220 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1139 | { |
1221 | { |
1140 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1222 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1141 | { |
1223 | { |
1142 | tmp->x = x + tmp->arch->clone.x; |
1224 | tmp->x = x + tmp->arch->x; |
1143 | tmp->y = y + tmp->arch->clone.y; |
1225 | tmp->y = y + tmp->arch->y; |
1144 | } |
1226 | } |
1145 | |
1227 | |
1146 | return insert_ob_in_map (op, m, originator, flag); |
1228 | return insert_ob_in_map (op, m, originator, flag); |
1147 | } |
1229 | } |
1148 | |
1230 | |
… | |
… | |
1169 | object * |
1251 | object * |
1170 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1252 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1171 | { |
1253 | { |
1172 | assert (!op->flag [FLAG_FREED]); |
1254 | assert (!op->flag [FLAG_FREED]); |
1173 | |
1255 | |
1174 | object *tmp, *top, *floor = NULL; |
1256 | object *top, *floor = NULL; |
1175 | |
1257 | |
1176 | op->remove (); |
1258 | op->remove (); |
1177 | |
|
|
1178 | #if 0 |
|
|
1179 | if (!m->active != !op->active) |
|
|
1180 | if (m->active) |
|
|
1181 | op->activate_recursive (); |
|
|
1182 | else |
|
|
1183 | op->deactivate_recursive (); |
|
|
1184 | #endif |
|
|
1185 | |
|
|
1186 | if (out_of_map (m, op->x, op->y)) |
|
|
1187 | { |
|
|
1188 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
|
|
1189 | #ifdef MANY_CORES |
|
|
1190 | /* Better to catch this here, as otherwise the next use of this object |
|
|
1191 | * is likely to cause a crash. Better to find out where it is getting |
|
|
1192 | * improperly inserted. |
|
|
1193 | */ |
|
|
1194 | abort (); |
|
|
1195 | #endif |
|
|
1196 | return op; |
|
|
1197 | } |
|
|
1198 | |
|
|
1199 | if (object *more = op->more) |
|
|
1200 | { |
|
|
1201 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1202 | { |
|
|
1203 | if (!op->head) |
|
|
1204 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1205 | |
|
|
1206 | return 0; |
|
|
1207 | } |
|
|
1208 | } |
|
|
1209 | |
|
|
1210 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1211 | |
1259 | |
1212 | /* Ideally, the caller figures this out. However, it complicates a lot |
1260 | /* Ideally, the caller figures this out. However, it complicates a lot |
1213 | * of areas of callers (eg, anything that uses find_free_spot would now |
1261 | * of areas of callers (eg, anything that uses find_free_spot would now |
1214 | * need extra work |
1262 | * need extra work |
1215 | */ |
1263 | */ |
1216 | if (!xy_normalise (m, op->x, op->y)) |
1264 | if (!xy_normalise (m, op->x, op->y)) |
|
|
1265 | { |
|
|
1266 | op->destroy (); |
1217 | return 0; |
1267 | return 0; |
|
|
1268 | } |
|
|
1269 | |
|
|
1270 | if (object *more = op->more) |
|
|
1271 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1272 | return 0; |
|
|
1273 | |
|
|
1274 | CLEAR_FLAG (op, FLAG_REMOVED); |
1218 | |
1275 | |
1219 | op->map = m; |
1276 | op->map = m; |
1220 | mapspace &ms = op->ms (); |
1277 | mapspace &ms = op->ms (); |
1221 | |
1278 | |
1222 | /* this has to be done after we translate the coordinates. |
1279 | /* this has to be done after we translate the coordinates. |
1223 | */ |
1280 | */ |
1224 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1281 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1225 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1282 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1226 | if (object::can_merge (op, tmp)) |
1283 | if (object::can_merge (op, tmp)) |
1227 | { |
1284 | { |
1228 | op->nrof += tmp->nrof; |
1285 | op->nrof += tmp->nrof; |
1229 | tmp->destroy (); |
1286 | tmp->destroy (1); |
1230 | } |
1287 | } |
1231 | |
1288 | |
1232 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1289 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1233 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1290 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1234 | |
1291 | |
… | |
… | |
1257 | else |
1314 | else |
1258 | { |
1315 | { |
1259 | top = ms.bot; |
1316 | top = ms.bot; |
1260 | |
1317 | |
1261 | /* If there are other objects, then */ |
1318 | /* If there are other objects, then */ |
1262 | if ((!(flag & INS_MAP_LOAD)) && top) |
1319 | if (top) |
1263 | { |
1320 | { |
1264 | object *last = 0; |
1321 | object *last = 0; |
1265 | |
1322 | |
1266 | /* |
1323 | /* |
1267 | * If there are multiple objects on this space, we do some trickier handling. |
1324 | * If there are multiple objects on this space, we do some trickier handling. |
… | |
… | |
1320 | if (last && last->below && last != floor) |
1377 | if (last && last->below && last != floor) |
1321 | top = last->below; |
1378 | top = last->below; |
1322 | } |
1379 | } |
1323 | } /* If objects on this space */ |
1380 | } /* If objects on this space */ |
1324 | |
1381 | |
1325 | if (flag & INS_MAP_LOAD) |
|
|
1326 | top = ms.top; |
|
|
1327 | |
|
|
1328 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1382 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1329 | top = floor; |
1383 | top = floor; |
1330 | |
1384 | |
1331 | /* Top is the object that our object (op) is going to get inserted above. |
1385 | /* Top is the object that our object (op) is going to get inserted above. |
1332 | */ |
1386 | */ |
… | |
… | |
1364 | op->map->touch (); |
1418 | op->map->touch (); |
1365 | } |
1419 | } |
1366 | |
1420 | |
1367 | op->map->dirty = true; |
1421 | op->map->dirty = true; |
1368 | |
1422 | |
1369 | /* If we have a floor, we know the player, if any, will be above |
|
|
1370 | * it, so save a few ticks and start from there. |
|
|
1371 | */ |
|
|
1372 | if (!(flag & INS_MAP_LOAD)) |
|
|
1373 | if (object *pl = ms.player ()) |
1423 | if (object *pl = ms.player ()) |
1374 | if (pl->contr->ns) |
|
|
1375 | pl->contr->ns->floorbox_update (); |
1424 | pl->contr->ns->floorbox_update (); |
1376 | |
1425 | |
1377 | /* If this object glows, it may affect lighting conditions that are |
1426 | /* If this object glows, it may affect lighting conditions that are |
1378 | * visible to others on this map. But update_all_los is really |
1427 | * visible to others on this map. But update_all_los is really |
1379 | * an inefficient way to do this, as it means los for all players |
1428 | * an inefficient way to do this, as it means los for all players |
1380 | * on the map will get recalculated. The players could very well |
1429 | * on the map will get recalculated. The players could very well |
… | |
… | |
1399 | * blocked() and wall() work properly), and these flags are updated by |
1448 | * blocked() and wall() work properly), and these flags are updated by |
1400 | * update_object(). |
1449 | * update_object(). |
1401 | */ |
1450 | */ |
1402 | |
1451 | |
1403 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1452 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1404 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1453 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1405 | { |
1454 | { |
1406 | if (check_move_on (op, originator)) |
1455 | if (check_move_on (op, originator)) |
1407 | return 0; |
1456 | return 0; |
1408 | |
1457 | |
1409 | /* If we are a multi part object, lets work our way through the check |
1458 | /* If we are a multi part object, lets work our way through the check |
1410 | * walk on's. |
1459 | * walk on's. |
1411 | */ |
1460 | */ |
1412 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1461 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1413 | if (check_move_on (tmp, originator)) |
1462 | if (check_move_on (tmp, originator)) |
1414 | return 0; |
1463 | return 0; |
1415 | } |
1464 | } |
1416 | |
1465 | |
1417 | return op; |
1466 | return op; |
… | |
… | |
1422 | * op is the object to insert it under: supplies x and the map. |
1471 | * op is the object to insert it under: supplies x and the map. |
1423 | */ |
1472 | */ |
1424 | void |
1473 | void |
1425 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1474 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1426 | { |
1475 | { |
1427 | object *tmp, *tmp1; |
|
|
1428 | |
|
|
1429 | /* first search for itself and remove any old instances */ |
1476 | /* first search for itself and remove any old instances */ |
1430 | |
1477 | |
1431 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1478 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1432 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1479 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1433 | tmp->destroy (); |
1480 | tmp->destroy (1); |
1434 | |
1481 | |
1435 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1482 | object *tmp = arch_to_object (archetype::find (arch_string)); |
1436 | |
1483 | |
1437 | tmp1->x = op->x; |
1484 | tmp->x = op->x; |
1438 | tmp1->y = op->y; |
1485 | tmp->y = op->y; |
|
|
1486 | |
1439 | insert_ob_in_map (tmp1, op->map, op, 0); |
1487 | insert_ob_in_map (tmp, op->map, op, 0); |
1440 | } |
1488 | } |
1441 | |
1489 | |
1442 | object * |
1490 | object * |
1443 | object::insert_at (object *where, object *originator, int flags) |
1491 | object::insert_at (object *where, object *originator, int flags) |
1444 | { |
1492 | { |
|
|
1493 | if (where->env) |
|
|
1494 | return where->env->insert (this); |
|
|
1495 | else |
1445 | return where->map->insert (this, where->x, where->y, originator, flags); |
1496 | return where->map->insert (this, where->x, where->y, originator, flags); |
1446 | } |
1497 | } |
1447 | |
1498 | |
1448 | /* |
1499 | // find player who can see this object |
1449 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
|
|
1450 | * is returned contains nr objects, and the remaining parts contains |
|
|
1451 | * the rest (or is removed and freed if that number is 0). |
|
|
1452 | * On failure, NULL is returned, and the reason put into the |
|
|
1453 | * global static errmsg array. |
|
|
1454 | */ |
|
|
1455 | object * |
1500 | object * |
1456 | get_split_ob (object *orig_ob, uint32 nr) |
1501 | object::visible_to () const |
1457 | { |
1502 | { |
1458 | object *newob; |
1503 | if (!flag [FLAG_REMOVED]) |
1459 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
|
|
1460 | |
|
|
1461 | if (orig_ob->nrof < nr) |
|
|
1462 | { |
|
|
1463 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
|
|
1464 | return NULL; |
|
|
1465 | } |
1504 | { |
1466 | |
1505 | // see if we are in a container of sorts |
1467 | newob = object_create_clone (orig_ob); |
1506 | if (env) |
1468 | |
|
|
1469 | if ((orig_ob->nrof -= nr) < 1) |
|
|
1470 | orig_ob->destroy (1); |
|
|
1471 | else if (!is_removed) |
|
|
1472 | { |
|
|
1473 | if (orig_ob->env != NULL) |
|
|
1474 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
|
|
1475 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
|
|
1476 | { |
|
|
1477 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
|
|
1478 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
|
|
1479 | return NULL; |
|
|
1480 | } |
1507 | { |
1481 | } |
1508 | // the player inventory itself is always visible |
|
|
1509 | if (env->type == PLAYER) |
|
|
1510 | return env; |
1482 | |
1511 | |
1483 | newob->nrof = nr; |
1512 | // else a player could have our env open |
|
|
1513 | object *envest = env->outer_env (); |
1484 | |
1514 | |
|
|
1515 | // the player itself is always on a map, so we will find him here |
|
|
1516 | // even if our inv is in a player. |
|
|
1517 | if (envest->is_on_map ()) |
|
|
1518 | if (object *pl = envest->ms ().player ()) |
|
|
1519 | if (pl->container == env) |
|
|
1520 | return pl; |
|
|
1521 | } |
|
|
1522 | else |
|
|
1523 | { |
|
|
1524 | // maybe there is a player standing on the same mapspace |
|
|
1525 | // this will catch the case where "this" is a player |
|
|
1526 | if (object *pl = ms ().player ()) |
|
|
1527 | return pl; |
|
|
1528 | } |
|
|
1529 | } |
|
|
1530 | |
1485 | return newob; |
1531 | return 0; |
1486 | } |
1532 | } |
1487 | |
1533 | |
1488 | /* |
1534 | /* |
1489 | * decrease_ob_nr(object, number) decreases a specified number from |
1535 | * decrease(object, number) decreases a specified number from |
1490 | * the amount of an object. If the amount reaches 0, the object |
1536 | * the amount of an object. If the amount reaches 0, the object |
1491 | * is subsequently removed and freed. |
1537 | * is subsequently removed and freed. |
1492 | * |
1538 | * |
1493 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1539 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1494 | */ |
1540 | */ |
|
|
1541 | bool |
|
|
1542 | object::decrease (sint32 nr) |
|
|
1543 | { |
|
|
1544 | if (!nr) |
|
|
1545 | return true; |
|
|
1546 | |
|
|
1547 | nr = min (nr, nrof); |
|
|
1548 | |
|
|
1549 | nrof -= nr; |
|
|
1550 | |
|
|
1551 | if (nrof) |
|
|
1552 | { |
|
|
1553 | adjust_weight (env, -weight * nr); // carrying == 0 |
|
|
1554 | |
|
|
1555 | if (object *pl = visible_to ()) |
|
|
1556 | esrv_update_item (UPD_NROF, pl, this); |
|
|
1557 | |
|
|
1558 | return true; |
|
|
1559 | } |
|
|
1560 | else |
|
|
1561 | { |
|
|
1562 | destroy (1); |
|
|
1563 | return false; |
|
|
1564 | } |
|
|
1565 | } |
|
|
1566 | |
|
|
1567 | /* |
|
|
1568 | * split(ob,nr) splits up ob into two parts. The part which |
|
|
1569 | * is returned contains nr objects, and the remaining parts contains |
|
|
1570 | * the rest (or is removed and returned if that number is 0). |
|
|
1571 | * On failure, NULL is returned. |
|
|
1572 | */ |
1495 | object * |
1573 | object * |
1496 | decrease_ob_nr (object *op, uint32 i) |
1574 | object::split (sint32 nr) |
1497 | { |
1575 | { |
1498 | object *tmp; |
1576 | int have = number_of (); |
1499 | |
1577 | |
1500 | if (i == 0) /* objects with op->nrof require this check */ |
1578 | if (have < nr) |
1501 | return op; |
1579 | return 0; |
1502 | |
1580 | else if (have == nr) |
1503 | if (i > op->nrof) |
|
|
1504 | i = op->nrof; |
|
|
1505 | |
|
|
1506 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1507 | op->nrof -= i; |
|
|
1508 | else if (op->env) |
|
|
1509 | { |
1581 | { |
1510 | /* is this object in the players inventory, or sub container |
|
|
1511 | * therein? |
|
|
1512 | */ |
|
|
1513 | tmp = op->in_player (); |
|
|
1514 | /* nope. Is this a container the player has opened? |
|
|
1515 | * If so, set tmp to that player. |
|
|
1516 | * IMO, searching through all the players will mostly |
|
|
1517 | * likely be quicker than following op->env to the map, |
|
|
1518 | * and then searching the map for a player. |
|
|
1519 | */ |
|
|
1520 | if (!tmp) |
|
|
1521 | for_all_players (pl) |
|
|
1522 | if (pl->ob->container == op->env) |
|
|
1523 | { |
|
|
1524 | tmp = pl->ob; |
|
|
1525 | break; |
|
|
1526 | } |
|
|
1527 | |
|
|
1528 | if (i < op->nrof) |
|
|
1529 | { |
|
|
1530 | sub_weight (op->env, op->weight * i); |
|
|
1531 | op->nrof -= i; |
|
|
1532 | if (tmp) |
|
|
1533 | esrv_send_item (tmp, op); |
|
|
1534 | } |
|
|
1535 | else |
|
|
1536 | { |
|
|
1537 | op->remove (); |
1582 | remove (); |
1538 | op->nrof = 0; |
1583 | return this; |
1539 | if (tmp) |
|
|
1540 | esrv_del_item (tmp->contr, op->count); |
|
|
1541 | } |
|
|
1542 | } |
1584 | } |
1543 | else |
1585 | else |
1544 | { |
1586 | { |
1545 | object *above = op->above; |
1587 | decrease (nr); |
1546 | |
1588 | |
1547 | if (i < op->nrof) |
1589 | object *op = object_create_clone (this); |
1548 | op->nrof -= i; |
1590 | op->nrof = nr; |
1549 | else |
|
|
1550 | { |
|
|
1551 | op->remove (); |
|
|
1552 | op->nrof = 0; |
|
|
1553 | } |
|
|
1554 | |
|
|
1555 | /* Since we just removed op, op->above is null */ |
|
|
1556 | for (tmp = above; tmp; tmp = tmp->above) |
|
|
1557 | if (tmp->type == PLAYER) |
|
|
1558 | { |
|
|
1559 | if (op->nrof) |
|
|
1560 | esrv_send_item (tmp, op); |
|
|
1561 | else |
|
|
1562 | esrv_del_item (tmp->contr, op->count); |
|
|
1563 | } |
|
|
1564 | } |
|
|
1565 | |
|
|
1566 | if (op->nrof) |
|
|
1567 | return op; |
1591 | return op; |
1568 | else |
|
|
1569 | { |
|
|
1570 | op->destroy (); |
|
|
1571 | return 0; |
|
|
1572 | } |
|
|
1573 | } |
|
|
1574 | |
|
|
1575 | /* |
|
|
1576 | * add_weight(object, weight) adds the specified weight to an object, |
|
|
1577 | * and also updates how much the environment(s) is/are carrying. |
|
|
1578 | */ |
|
|
1579 | void |
|
|
1580 | add_weight (object *op, signed long weight) |
|
|
1581 | { |
|
|
1582 | while (op != NULL) |
|
|
1583 | { |
|
|
1584 | if (op->type == CONTAINER) |
|
|
1585 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
1586 | |
|
|
1587 | op->carrying += weight; |
|
|
1588 | op = op->env; |
|
|
1589 | } |
1592 | } |
1590 | } |
1593 | } |
1591 | |
1594 | |
1592 | object * |
1595 | object * |
1593 | insert_ob_in_ob (object *op, object *where) |
1596 | insert_ob_in_ob (object *op, object *where) |
… | |
… | |
1598 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1601 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1599 | free (dump); |
1602 | free (dump); |
1600 | return op; |
1603 | return op; |
1601 | } |
1604 | } |
1602 | |
1605 | |
1603 | if (where->head) |
1606 | if (where->head_ () != where) |
1604 | { |
1607 | { |
1605 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1608 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1606 | where = where->head; |
1609 | where = where->head; |
1607 | } |
1610 | } |
1608 | |
1611 | |
1609 | return where->insert (op); |
1612 | return where->insert (op); |
1610 | } |
1613 | } |
… | |
… | |
1618 | * be != op, if items are merged. -Tero |
1621 | * be != op, if items are merged. -Tero |
1619 | */ |
1622 | */ |
1620 | object * |
1623 | object * |
1621 | object::insert (object *op) |
1624 | object::insert (object *op) |
1622 | { |
1625 | { |
1623 | object *tmp, *otmp; |
|
|
1624 | |
|
|
1625 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1626 | op->remove (); |
|
|
1627 | |
|
|
1628 | if (op->more) |
1626 | if (op->more) |
1629 | { |
1627 | { |
1630 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1628 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1631 | return op; |
1629 | return op; |
1632 | } |
1630 | } |
1633 | |
1631 | |
1634 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1632 | op->remove (); |
1635 | CLEAR_FLAG (op, FLAG_REMOVED); |
1633 | |
|
|
1634 | op->flag [FLAG_OBJ_ORIGINAL] = 0; |
|
|
1635 | |
1636 | if (op->nrof) |
1636 | if (op->nrof) |
1637 | { |
|
|
1638 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1637 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1639 | if (object::can_merge (tmp, op)) |
1638 | if (object::can_merge (tmp, op)) |
1640 | { |
1639 | { |
1641 | /* return the original object and remove inserted object |
1640 | /* return the original object and remove inserted object |
1642 | (client needs the original object) */ |
1641 | (client needs the original object) */ |
1643 | tmp->nrof += op->nrof; |
1642 | tmp->nrof += op->nrof; |
1644 | /* Weight handling gets pretty funky. Since we are adding to |
|
|
1645 | * tmp->nrof, we need to increase the weight. |
|
|
1646 | */ |
|
|
1647 | add_weight (this, op->weight * op->nrof); |
1643 | adjust_weight (this, op->total_weight ()); |
1648 | SET_FLAG (op, FLAG_REMOVED); |
1644 | |
1649 | op->destroy (); /* free the inserted object */ |
1645 | op->destroy (1); |
1650 | op = tmp; |
1646 | op = tmp; |
1651 | op->remove (); /* and fix old object's links */ |
1647 | goto inserted; |
1652 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1653 | break; |
|
|
1654 | } |
1648 | } |
1655 | |
1649 | |
1656 | /* I assume combined objects have no inventory |
1650 | op->owner = 0; // it's his/hers now. period. |
1657 | * We add the weight - this object could have just been removed |
1651 | op->map = 0; |
1658 | * (if it was possible to merge). calling remove_ob will subtract |
1652 | op->x = 0; |
1659 | * the weight, so we need to add it in again, since we actually do |
1653 | op->y = 0; |
1660 | * the linking below |
|
|
1661 | */ |
|
|
1662 | add_weight (this, op->weight * op->nrof); |
|
|
1663 | } |
|
|
1664 | else |
|
|
1665 | add_weight (this, (op->weight + op->carrying)); |
|
|
1666 | |
1654 | |
1667 | otmp = this->in_player (); |
1655 | op->above = 0; |
1668 | if (otmp && otmp->contr) |
1656 | op->below = inv; |
|
|
1657 | op->env = this; |
|
|
1658 | |
|
|
1659 | if (inv) |
|
|
1660 | inv->above = op; |
|
|
1661 | |
|
|
1662 | inv = op; |
|
|
1663 | |
|
|
1664 | op->flag [FLAG_REMOVED] = 0; |
|
|
1665 | |
|
|
1666 | adjust_weight (this, op->total_weight ()); |
|
|
1667 | |
|
|
1668 | inserted: |
|
|
1669 | /* reset the light list and los of the players on the map */ |
|
|
1670 | if (op->glow_radius && map && map->darkness) |
|
|
1671 | update_all_los (map, x, y); |
|
|
1672 | |
|
|
1673 | if (object *otmp = in_player ()) |
1669 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1674 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1670 | otmp->update_stats (); |
1675 | otmp->update_stats (); |
1671 | |
|
|
1672 | op->map = 0; |
|
|
1673 | op->env = this; |
|
|
1674 | op->above = 0; |
|
|
1675 | op->below = 0; |
|
|
1676 | op->x = 0, op->y = 0; |
|
|
1677 | |
|
|
1678 | /* reset the light list and los of the players on the map */ |
|
|
1679 | if ((op->glow_radius != 0) && map) |
|
|
1680 | { |
|
|
1681 | #ifdef DEBUG_LIGHTS |
|
|
1682 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
|
|
1683 | #endif /* DEBUG_LIGHTS */ |
|
|
1684 | if (map->darkness) |
|
|
1685 | update_all_los (map, x, y); |
|
|
1686 | } |
|
|
1687 | |
|
|
1688 | /* Client has no idea of ordering so lets not bother ordering it here. |
|
|
1689 | * It sure simplifies this function... |
|
|
1690 | */ |
|
|
1691 | if (!inv) |
|
|
1692 | inv = op; |
|
|
1693 | else |
|
|
1694 | { |
|
|
1695 | op->below = inv; |
|
|
1696 | op->below->above = op; |
|
|
1697 | inv = op; |
|
|
1698 | } |
|
|
1699 | |
1676 | |
1700 | INVOKE_OBJECT (INSERT, this); |
1677 | INVOKE_OBJECT (INSERT, this); |
1701 | |
1678 | |
1702 | return op; |
1679 | return op; |
1703 | } |
1680 | } |
… | |
… | |
1918 | * activate recursively a flag on an object inventory |
1895 | * activate recursively a flag on an object inventory |
1919 | */ |
1896 | */ |
1920 | void |
1897 | void |
1921 | flag_inv (object *op, int flag) |
1898 | flag_inv (object *op, int flag) |
1922 | { |
1899 | { |
1923 | if (op->inv) |
|
|
1924 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1900 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1925 | { |
1901 | { |
1926 | SET_FLAG (tmp, flag); |
1902 | SET_FLAG (tmp, flag); |
1927 | flag_inv (tmp, flag); |
1903 | flag_inv (tmp, flag); |
1928 | } |
1904 | } |
1929 | } |
1905 | } |
1930 | |
1906 | |
1931 | /* |
1907 | /* |
1932 | * deactivate recursively a flag on an object inventory |
1908 | * deactivate recursively a flag on an object inventory |
1933 | */ |
1909 | */ |
1934 | void |
1910 | void |
1935 | unflag_inv (object *op, int flag) |
1911 | unflag_inv (object *op, int flag) |
1936 | { |
1912 | { |
1937 | if (op->inv) |
|
|
1938 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1913 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1939 | { |
1914 | { |
1940 | CLEAR_FLAG (tmp, flag); |
1915 | CLEAR_FLAG (tmp, flag); |
1941 | unflag_inv (tmp, flag); |
1916 | unflag_inv (tmp, flag); |
1942 | } |
1917 | } |
1943 | } |
|
|
1944 | |
|
|
1945 | /* |
|
|
1946 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
1947 | * all it's inventory (recursively). |
|
|
1948 | * If checksums are used, a player will get set_cheat called for |
|
|
1949 | * him/her-self and all object carried by a call to this function. |
|
|
1950 | */ |
|
|
1951 | void |
|
|
1952 | set_cheat (object *op) |
|
|
1953 | { |
|
|
1954 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
1955 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
1956 | } |
1918 | } |
1957 | |
1919 | |
1958 | /* |
1920 | /* |
1959 | * find_free_spot(object, map, x, y, start, stop) will search for |
1921 | * find_free_spot(object, map, x, y, start, stop) will search for |
1960 | * a spot at the given map and coordinates which will be able to contain |
1922 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
1962 | * to search (see the freearr_x/y[] definition). |
1924 | * to search (see the freearr_x/y[] definition). |
1963 | * It returns a random choice among the alternatives found. |
1925 | * It returns a random choice among the alternatives found. |
1964 | * start and stop are where to start relative to the free_arr array (1,9 |
1926 | * start and stop are where to start relative to the free_arr array (1,9 |
1965 | * does all 4 immediate directions). This returns the index into the |
1927 | * does all 4 immediate directions). This returns the index into the |
1966 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1928 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1967 | * Note - this only checks to see if there is space for the head of the |
|
|
1968 | * object - if it is a multispace object, this should be called for all |
|
|
1969 | * pieces. |
|
|
1970 | * Note2: This function does correctly handle tiled maps, but does not |
1929 | * Note: This function does correctly handle tiled maps, but does not |
1971 | * inform the caller. However, insert_ob_in_map will update as |
1930 | * inform the caller. However, insert_ob_in_map will update as |
1972 | * necessary, so the caller shouldn't need to do any special work. |
1931 | * necessary, so the caller shouldn't need to do any special work. |
1973 | * Note - updated to take an object instead of archetype - this is necessary |
1932 | * Note - updated to take an object instead of archetype - this is necessary |
1974 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1933 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1975 | * to know if the space in question will block the object. We can't use |
1934 | * to know if the space in question will block the object. We can't use |
… | |
… | |
1977 | * customized, changed states, etc. |
1936 | * customized, changed states, etc. |
1978 | */ |
1937 | */ |
1979 | int |
1938 | int |
1980 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1939 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1981 | { |
1940 | { |
|
|
1941 | int altern[SIZEOFFREE]; |
1982 | int index = 0, flag; |
1942 | int index = 0, flag; |
1983 | int altern[SIZEOFFREE]; |
|
|
1984 | |
1943 | |
1985 | for (int i = start; i < stop; i++) |
1944 | for (int i = start; i < stop; i++) |
1986 | { |
1945 | { |
1987 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
1946 | mapxy pos (m, x, y); pos.move (i); |
1988 | if (!flag) |
1947 | |
|
|
1948 | if (!pos.normalise ()) |
|
|
1949 | continue; |
|
|
1950 | |
|
|
1951 | mapspace &ms = *pos; |
|
|
1952 | |
|
|
1953 | if (ms.flags () & P_IS_ALIVE) |
|
|
1954 | continue; |
|
|
1955 | |
|
|
1956 | /* However, often |
|
|
1957 | * ob doesn't have any move type (when used to place exits) |
|
|
1958 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
1959 | */ |
|
|
1960 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
1961 | { |
1989 | altern [index++] = i; |
1962 | altern [index++] = i; |
|
|
1963 | continue; |
|
|
1964 | } |
1990 | |
1965 | |
1991 | /* Basically, if we find a wall on a space, we cut down the search size. |
1966 | /* Basically, if we find a wall on a space, we cut down the search size. |
1992 | * In this way, we won't return spaces that are on another side of a wall. |
1967 | * In this way, we won't return spaces that are on another side of a wall. |
1993 | * This mostly work, but it cuts down the search size in all directions - |
1968 | * This mostly work, but it cuts down the search size in all directions - |
1994 | * if the space being examined only has a wall to the north and empty |
1969 | * if the space being examined only has a wall to the north and empty |
1995 | * spaces in all the other directions, this will reduce the search space |
1970 | * spaces in all the other directions, this will reduce the search space |
1996 | * to only the spaces immediately surrounding the target area, and |
1971 | * to only the spaces immediately surrounding the target area, and |
1997 | * won't look 2 spaces south of the target space. |
1972 | * won't look 2 spaces south of the target space. |
1998 | */ |
1973 | */ |
1999 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
1974 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
1975 | { |
2000 | stop = maxfree[i]; |
1976 | stop = maxfree[i]; |
|
|
1977 | continue; |
|
|
1978 | } |
|
|
1979 | |
|
|
1980 | /* Note it is intentional that we check ob - the movement type of the |
|
|
1981 | * head of the object should correspond for the entire object. |
|
|
1982 | */ |
|
|
1983 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
1984 | continue; |
|
|
1985 | |
|
|
1986 | if (ob->blocked (m, pos.x, pos.y)) |
|
|
1987 | continue; |
|
|
1988 | |
|
|
1989 | altern [index++] = i; |
2001 | } |
1990 | } |
2002 | |
1991 | |
2003 | if (!index) |
1992 | if (!index) |
2004 | return -1; |
1993 | return -1; |
2005 | |
1994 | |
… | |
… | |
2014 | */ |
2003 | */ |
2015 | int |
2004 | int |
2016 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2005 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2017 | { |
2006 | { |
2018 | for (int i = 0; i < SIZEOFFREE; i++) |
2007 | for (int i = 0; i < SIZEOFFREE; i++) |
2019 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2008 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2020 | return i; |
2009 | return i; |
2021 | |
2010 | |
2022 | return -1; |
2011 | return -1; |
2023 | } |
2012 | } |
2024 | |
2013 | |
… | |
… | |
2078 | object *tmp; |
2067 | object *tmp; |
2079 | maptile *mp; |
2068 | maptile *mp; |
2080 | |
2069 | |
2081 | MoveType blocked, move_type; |
2070 | MoveType blocked, move_type; |
2082 | |
2071 | |
2083 | if (exclude && exclude->head) |
2072 | if (exclude && exclude->head_ () != exclude) |
2084 | { |
2073 | { |
2085 | exclude = exclude->head; |
2074 | exclude = exclude->head; |
2086 | move_type = exclude->move_type; |
2075 | move_type = exclude->move_type; |
2087 | } |
2076 | } |
2088 | else |
2077 | else |
… | |
… | |
2111 | max = maxfree[i]; |
2100 | max = maxfree[i]; |
2112 | else if (mflags & P_IS_ALIVE) |
2101 | else if (mflags & P_IS_ALIVE) |
2113 | { |
2102 | { |
2114 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2103 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2115 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2104 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2116 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2105 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2117 | break; |
2106 | break; |
2118 | |
2107 | |
2119 | if (tmp) |
2108 | if (tmp) |
2120 | return freedir[i]; |
2109 | return freedir[i]; |
2121 | } |
2110 | } |
… | |
… | |
2301 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2290 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2302 | * core dumps if they do. |
2291 | * core dumps if they do. |
2303 | * |
2292 | * |
2304 | * Add a check so we can't pick up invisible objects (0.93.8) |
2293 | * Add a check so we can't pick up invisible objects (0.93.8) |
2305 | */ |
2294 | */ |
2306 | |
|
|
2307 | int |
2295 | int |
2308 | can_pick (const object *who, const object *item) |
2296 | can_pick (const object *who, const object *item) |
2309 | { |
2297 | { |
2310 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2298 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2311 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2299 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
… | |
… | |
2316 | * create clone from object to another |
2304 | * create clone from object to another |
2317 | */ |
2305 | */ |
2318 | object * |
2306 | object * |
2319 | object_create_clone (object *asrc) |
2307 | object_create_clone (object *asrc) |
2320 | { |
2308 | { |
2321 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2309 | object *dst = 0, *tmp, *src, *prev, *item; |
2322 | |
2310 | |
2323 | if (!asrc) |
2311 | if (!asrc) |
2324 | return 0; |
2312 | return 0; |
2325 | |
2313 | |
2326 | src = asrc; |
|
|
2327 | if (src->head) |
|
|
2328 | src = src->head; |
2314 | src = asrc->head_ (); |
2329 | |
2315 | |
2330 | prev = 0; |
2316 | prev = 0; |
2331 | for (part = src; part; part = part->more) |
2317 | for (object *part = src; part; part = part->more) |
2332 | { |
2318 | { |
2333 | tmp = part->clone (); |
2319 | tmp = part->clone (); |
2334 | tmp->x -= src->x; |
2320 | tmp->x -= src->x; |
2335 | tmp->y -= src->y; |
2321 | tmp->y -= src->y; |
2336 | |
2322 | |
… | |
… | |
2449 | /* Basically, if the archetype has this key set, |
2435 | /* Basically, if the archetype has this key set, |
2450 | * we need to store the null value so when we save |
2436 | * we need to store the null value so when we save |
2451 | * it, we save the empty value so that when we load, |
2437 | * it, we save the empty value so that when we load, |
2452 | * we get this value back again. |
2438 | * we get this value back again. |
2453 | */ |
2439 | */ |
2454 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
2440 | if (get_ob_key_link (op->arch, canonical_key)) |
2455 | field->value = 0; |
2441 | field->value = 0; |
2456 | else |
2442 | else |
2457 | { |
2443 | { |
2458 | if (last) |
2444 | if (last) |
2459 | last->next = field->next; |
2445 | last->next = field->next; |
… | |
… | |
2528 | } |
2514 | } |
2529 | else |
2515 | else |
2530 | item = item->env; |
2516 | item = item->env; |
2531 | } |
2517 | } |
2532 | |
2518 | |
2533 | |
|
|
2534 | const char * |
2519 | const char * |
2535 | object::flag_desc (char *desc, int len) const |
2520 | object::flag_desc (char *desc, int len) const |
2536 | { |
2521 | { |
2537 | char *p = desc; |
2522 | char *p = desc; |
2538 | bool first = true; |
2523 | bool first = true; |
… | |
… | |
2565 | { |
2550 | { |
2566 | char flagdesc[512]; |
2551 | char flagdesc[512]; |
2567 | char info2[256 * 4]; |
2552 | char info2[256 * 4]; |
2568 | char *p = info; |
2553 | char *p = info; |
2569 | |
2554 | |
2570 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2555 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2571 | count, uuid.seq, |
2556 | count, |
|
|
2557 | uuid.c_str (), |
2572 | &name, |
2558 | &name, |
2573 | title ? "\",title:\"" : "", |
2559 | title ? "\",title:\"" : "", |
2574 | title ? (const char *)title : "", |
2560 | title ? (const char *)title : "", |
2575 | flag_desc (flagdesc, 512), type); |
2561 | flag_desc (flagdesc, 512), type); |
2576 | |
2562 | |
2577 | if (env) |
2563 | if (!this->flag[FLAG_REMOVED] && env) |
2578 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2564 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2579 | |
2565 | |
2580 | if (map) |
2566 | if (map) |
2581 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2567 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2582 | |
2568 | |
… | |
… | |
2584 | } |
2570 | } |
2585 | |
2571 | |
2586 | const char * |
2572 | const char * |
2587 | object::debug_desc () const |
2573 | object::debug_desc () const |
2588 | { |
2574 | { |
2589 | static char info[256 * 4]; |
2575 | static char info[3][256 * 4]; |
|
|
2576 | static int info_idx; |
|
|
2577 | |
2590 | return debug_desc (info); |
2578 | return debug_desc (info [++info_idx % 3]); |
2591 | } |
|
|
2592 | |
|
|
2593 | const char * |
|
|
2594 | object::debug_desc2 () const |
|
|
2595 | { |
|
|
2596 | static char info[256 * 4]; |
|
|
2597 | return debug_desc (info); |
|
|
2598 | } |
2579 | } |
2599 | |
2580 | |
2600 | struct region * |
2581 | struct region * |
2601 | object::region () const |
2582 | object::region () const |
2602 | { |
2583 | { |
… | |
… | |
2605 | } |
2586 | } |
2606 | |
2587 | |
2607 | const materialtype_t * |
2588 | const materialtype_t * |
2608 | object::dominant_material () const |
2589 | object::dominant_material () const |
2609 | { |
2590 | { |
2610 | if (materialtype_t *mat = name_to_material (materialname)) |
2591 | if (materialtype_t *mt = name_to_material (materialname)) |
2611 | return mat; |
2592 | return mt; |
2612 | |
2593 | |
2613 | // omfg this is slow, this has to be temporary :) |
|
|
2614 | shstr unknown ("unknown"); |
|
|
2615 | |
|
|
2616 | return name_to_material (unknown); |
2594 | return name_to_material (shstr_unknown); |
2617 | } |
2595 | } |
2618 | |
2596 | |
2619 | void |
2597 | void |
2620 | object::open_container (object *new_container) |
2598 | object::open_container (object *new_container) |
2621 | { |
2599 | { |
… | |
… | |
2637 | old_container->flag [FLAG_APPLIED] = 0; |
2615 | old_container->flag [FLAG_APPLIED] = 0; |
2638 | container = 0; |
2616 | container = 0; |
2639 | |
2617 | |
2640 | esrv_update_item (UPD_FLAGS, this, old_container); |
2618 | esrv_update_item (UPD_FLAGS, this, old_container); |
2641 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2619 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2620 | play_sound (sound_find ("chest_close")); |
2642 | } |
2621 | } |
2643 | |
2622 | |
2644 | if (new_container) |
2623 | if (new_container) |
2645 | { |
2624 | { |
2646 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
2625 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
… | |
… | |
2662 | new_container->flag [FLAG_APPLIED] = 1; |
2641 | new_container->flag [FLAG_APPLIED] = 1; |
2663 | container = new_container; |
2642 | container = new_container; |
2664 | |
2643 | |
2665 | esrv_update_item (UPD_FLAGS, this, new_container); |
2644 | esrv_update_item (UPD_FLAGS, this, new_container); |
2666 | esrv_send_inventory (this, new_container); |
2645 | esrv_send_inventory (this, new_container); |
|
|
2646 | play_sound (sound_find ("chest_open")); |
|
|
2647 | } |
|
|
2648 | } |
|
|
2649 | |
|
|
2650 | object * |
|
|
2651 | object::force_find (const shstr name) |
|
|
2652 | { |
|
|
2653 | /* cycle through his inventory to look for the MARK we want to |
|
|
2654 | * place |
|
|
2655 | */ |
|
|
2656 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2657 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2658 | return splay (tmp); |
|
|
2659 | |
|
|
2660 | return 0; |
|
|
2661 | } |
|
|
2662 | |
|
|
2663 | void |
|
|
2664 | object::force_add (const shstr name, int duration) |
|
|
2665 | { |
|
|
2666 | if (object *force = force_find (name)) |
|
|
2667 | force->destroy (); |
|
|
2668 | |
|
|
2669 | object *force = get_archetype (FORCE_NAME); |
|
|
2670 | |
|
|
2671 | force->slaying = name; |
|
|
2672 | force->stats.food = 1; |
|
|
2673 | force->speed_left = -1.f; |
|
|
2674 | |
|
|
2675 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2676 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2677 | force->flag [FLAG_APPLIED] = true; |
|
|
2678 | |
|
|
2679 | insert (force); |
|
|
2680 | } |
|
|
2681 | |
|
|
2682 | void |
|
|
2683 | object::play_sound (faceidx sound) |
|
|
2684 | { |
|
|
2685 | if (!sound) |
|
|
2686 | return; |
|
|
2687 | |
|
|
2688 | if (flag [FLAG_REMOVED]) |
|
|
2689 | return; |
|
|
2690 | |
|
|
2691 | if (env) |
2667 | } |
2692 | { |
|
|
2693 | if (object *pl = in_player ()) |
|
|
2694 | pl->contr->play_sound (sound); |
|
|
2695 | } |
|
|
2696 | else |
|
|
2697 | map->play_sound (sound, x, y); |
2668 | } |
2698 | } |
2669 | |
2699 | |
2670 | |
|
|