1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT 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 3 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, |
… | |
… | |
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, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
|
|
25 | sub/add_weight will transcend the environment updating the carrying |
|
|
26 | variable. */ |
|
|
27 | #include <global.h> |
24 | #include <global.h> |
28 | #include <stdio.h> |
25 | #include <stdio.h> |
29 | #include <sys/types.h> |
26 | #include <sys/types.h> |
30 | #include <sys/uio.h> |
27 | #include <sys/uio.h> |
31 | #include <object.h> |
28 | #include <object.h> |
… | |
… | |
33 | #include <sproto.h> |
30 | #include <sproto.h> |
34 | #include <loader.h> |
31 | #include <loader.h> |
35 | |
32 | |
36 | #include <bitset> |
33 | #include <bitset> |
37 | |
34 | |
38 | int nrofallocobjects = 0; |
35 | UUID UUID::cur; |
39 | static UUID uuid; |
36 | static uint64_t seq_next_save; |
40 | const uint64 UUID_SKIP = 1<<19; |
37 | static const uint64 UUID_GAP = 1<<19; |
41 | |
38 | |
42 | objectvec objects; |
39 | objectvec objects; |
43 | activevec actives; |
40 | activevec actives; |
44 | |
41 | |
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, |
42 | short freearr_x[SIZEOFFREE] = { |
|
|
43 | 0, |
|
|
44 | 0, 1, 1, 1, 0, -1, -1, -1, |
|
|
45 | 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 |
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 |
47 | }; |
47 | }; |
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, |
48 | short freearr_y[SIZEOFFREE] = { |
|
|
49 | 0, |
|
|
50 | -1, -1, 0, 1, 1, 1, 0, -1, |
|
|
51 | -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 |
52 | -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 | }; |
53 | }; |
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, |
54 | int maxfree[SIZEOFFREE] = { |
|
|
55 | 0, |
|
|
56 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
57 | 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 |
58 | 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 | }; |
59 | }; |
54 | int freedir[SIZEOFFREE] = { |
60 | 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, |
61 | 0, |
|
|
62 | 1, 2, 3, 4, 5, 6, 7, 8, |
|
|
63 | 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 |
64 | 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 | }; |
65 | }; |
58 | |
66 | |
59 | static void |
67 | static void |
60 | write_uuid (void) |
68 | write_uuid (uval64 skip, bool sync) |
61 | { |
69 | { |
62 | char filename1[MAX_BUF], filename2[MAX_BUF]; |
70 | CALL_BEGIN (2); |
63 | |
71 | CALL_ARG_SV (newSVval64 (skip)); |
64 | sprintf (filename1, "%s/uuid", settings.localdir); |
72 | CALL_ARG_SV (boolSV (sync)); |
65 | sprintf (filename2, "%s/uuid~", settings.localdir); |
73 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
66 | |
74 | 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 | } |
75 | } |
79 | |
76 | |
80 | static void |
77 | static void |
81 | read_uuid (void) |
78 | read_uuid (void) |
82 | { |
79 | { |
83 | char filename[MAX_BUF]; |
80 | char filename[MAX_BUF]; |
84 | |
81 | |
85 | sprintf (filename, "%s/uuid", settings.localdir); |
82 | sprintf (filename, "%s/uuid", settings.localdir); |
86 | |
83 | |
|
|
84 | seq_next_save = 0; |
|
|
85 | |
87 | FILE *fp; |
86 | FILE *fp; |
88 | |
87 | |
89 | if (!(fp = fopen (filename, "r"))) |
88 | if (!(fp = fopen (filename, "r"))) |
90 | { |
89 | { |
91 | if (errno == ENOENT) |
90 | if (errno == ENOENT) |
92 | { |
91 | { |
93 | LOG (llevInfo, "RESET uid to 1\n"); |
92 | LOG (llevInfo, "RESET uid to 1\n"); |
94 | uuid.seq = 0; |
93 | UUID::cur.seq = 0; |
95 | write_uuid (); |
94 | write_uuid (UUID_GAP, true); |
96 | return; |
95 | return; |
97 | } |
96 | } |
98 | |
97 | |
99 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
98 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
100 | _exit (1); |
99 | _exit (1); |
101 | } |
100 | } |
102 | |
101 | |
103 | int version; |
102 | UUID::BUF buf; |
104 | unsigned long long uid; |
103 | buf[0] = 0; |
105 | if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1) |
104 | fgets (buf, sizeof (buf), fp); |
|
|
105 | |
|
|
106 | if (!UUID::cur.parse (buf)) |
106 | { |
107 | { |
107 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
108 | LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf); |
108 | _exit (1); |
109 | _exit (1); |
109 | } |
110 | } |
110 | |
111 | |
111 | uuid.seq = uid; |
112 | LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ()); |
112 | write_uuid (); |
113 | |
113 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
114 | write_uuid (UUID_GAP, true); |
114 | fclose (fp); |
115 | fclose (fp); |
115 | } |
116 | } |
116 | |
117 | |
117 | UUID |
118 | UUID |
118 | gen_uuid () |
119 | UUID::gen () |
119 | { |
120 | { |
120 | UUID uid; |
121 | UUID uid; |
121 | |
122 | |
122 | uid.seq = ++uuid.seq; |
123 | uid.seq = ++cur.seq; |
123 | |
124 | |
124 | if (!(uuid.seq & (UUID_SKIP - 1))) |
125 | if (expect_false (cur.seq >= seq_next_save)) |
125 | write_uuid (); |
126 | { |
|
|
127 | seq_next_save = UUID::cur.seq + (UUID_GAP >> 1); |
|
|
128 | write_uuid (UUID_GAP, false); |
|
|
129 | } |
|
|
130 | |
126 | |
131 | |
127 | return uid; |
132 | return uid; |
128 | } |
133 | } |
129 | |
134 | |
130 | void |
135 | void |
131 | init_uuid () |
136 | UUID::init () |
132 | { |
137 | { |
133 | read_uuid (); |
138 | read_uuid (); |
134 | } |
139 | } |
135 | |
140 | |
136 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
141 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
137 | static int |
142 | static bool |
138 | compare_ob_value_lists_one (const object *wants, const object *has) |
143 | compare_ob_value_lists_one (const object *wants, const object *has) |
139 | { |
144 | { |
140 | key_value *wants_field; |
145 | key_value *wants_field; |
141 | |
146 | |
142 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
147 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
… | |
… | |
150 | key_value *has_field; |
155 | key_value *has_field; |
151 | |
156 | |
152 | /* Look for a field in has with the same key. */ |
157 | /* Look for a field in has with the same key. */ |
153 | has_field = get_ob_key_link (has, wants_field->key); |
158 | has_field = get_ob_key_link (has, wants_field->key); |
154 | |
159 | |
155 | if (has_field == NULL) |
160 | if (!has_field) |
156 | { |
|
|
157 | /* No field with that name. */ |
161 | return 0; /* No field with that name. */ |
158 | return FALSE; |
|
|
159 | } |
|
|
160 | |
162 | |
161 | /* Found the matching field. */ |
163 | /* Found the matching field. */ |
162 | if (has_field->value != wants_field->value) |
164 | if (has_field->value != wants_field->value) |
163 | { |
|
|
164 | /* Values don't match, so this half of the comparison is false. */ |
165 | return 0; /* Values don't match, so this half of the comparison is false. */ |
165 | return FALSE; |
|
|
166 | } |
|
|
167 | |
166 | |
168 | /* If we get here, we found a match. Now for the next field in wants. */ |
167 | /* If we get here, we found a match. Now for the next field in wants. */ |
169 | } |
168 | } |
170 | |
169 | |
171 | /* If we get here, every field in wants has a matching field in has. */ |
170 | /* If we get here, every field in wants has a matching field in has. */ |
172 | return TRUE; |
171 | return 1; |
173 | } |
172 | } |
174 | |
173 | |
175 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
174 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
176 | static int |
175 | static bool |
177 | compare_ob_value_lists (const object *ob1, const object *ob2) |
176 | compare_ob_value_lists (const object *ob1, const object *ob2) |
178 | { |
177 | { |
179 | /* However, there may be fields in has which aren't partnered in wants, |
178 | /* However, there may be fields in has which aren't partnered in wants, |
180 | * so we need to run the comparison *twice*. :( |
179 | * so we need to run the comparison *twice*. :( |
181 | */ |
180 | */ |
… | |
… | |
202 | || ob1->speed != ob2->speed |
201 | || ob1->speed != ob2->speed |
203 | || ob1->value != ob2->value |
202 | || ob1->value != ob2->value |
204 | || ob1->name != ob2->name) |
203 | || ob1->name != ob2->name) |
205 | return 0; |
204 | return 0; |
206 | |
205 | |
207 | //TODO: this ain't working well, use nicer and correct overflow check |
206 | /* 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 |
207 | * for unsigned overflow (2c), second part checks whether the result |
209 | * value could not be stored in a sint32 (which unfortunately sometimes is |
208 | * would fit into a 32 bit signed int, which is often used to hold |
210 | * used to store nrof). |
209 | * nrof values. |
211 | */ |
210 | */ |
212 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
211 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
213 | return 0; |
212 | return 0; |
214 | |
213 | |
215 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
214 | /* 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 |
215 | * 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 |
216 | * 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 |
217 | * are not equal - just if it has been identified, the been_applied |
219 | * flags lose any meaning. |
218 | * flags lose any meaning. |
220 | */ |
219 | */ |
221 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
220 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
222 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
221 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
223 | |
222 | |
224 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
223 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
225 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
224 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
226 | |
225 | |
227 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
226 | if (ob1->arch->name != ob2->arch->name |
228 | || ob1->arch != ob2->arch |
|
|
229 | || ob1->name != ob2->name |
227 | || ob1->name != ob2->name |
230 | || ob1->title != ob2->title |
228 | || ob1->title != ob2->title |
231 | || ob1->msg != ob2->msg |
229 | || ob1->msg != ob2->msg |
232 | || ob1->weight != ob2->weight |
230 | || 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 |
231 | || ob1->attacktype != ob2->attacktype |
236 | || ob1->magic != ob2->magic |
232 | || ob1->magic != ob2->magic |
237 | || ob1->slaying != ob2->slaying |
233 | || ob1->slaying != ob2->slaying |
238 | || ob1->skill != ob2->skill |
234 | || ob1->skill != ob2->skill |
239 | || ob1->value != ob2->value |
235 | || ob1->value != ob2->value |
… | |
… | |
246 | || ob1->move_block != ob2->move_block |
242 | || ob1->move_block != ob2->move_block |
247 | || ob1->move_allow != ob2->move_allow |
243 | || ob1->move_allow != ob2->move_allow |
248 | || ob1->move_on != ob2->move_on |
244 | || ob1->move_on != ob2->move_on |
249 | || ob1->move_off != ob2->move_off |
245 | || ob1->move_off != ob2->move_off |
250 | || ob1->move_slow != ob2->move_slow |
246 | || ob1->move_slow != ob2->move_slow |
251 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
247 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
|
|
248 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
249 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
252 | return 0; |
250 | return 0; |
253 | |
251 | |
|
|
252 | if ((ob1->flag ^ ob2->flag) |
|
|
253 | .reset (FLAG_INV_LOCKED) |
|
|
254 | .reset (FLAG_CLIENT_SENT) |
|
|
255 | .reset (FLAG_REMOVED) |
|
|
256 | .any ()) |
|
|
257 | return 0; |
|
|
258 | |
254 | /* This is really a spellbook check - really, we should |
259 | /* This is really a spellbook check - we should in general |
255 | * check all objects in the inventory. |
260 | * not merge objects with real inventories, as splitting them |
|
|
261 | * is hard. |
256 | */ |
262 | */ |
257 | if (ob1->inv || ob2->inv) |
263 | if (ob1->inv || ob2->inv) |
258 | { |
264 | { |
259 | /* if one object has inventory but the other doesn't, not equiv */ |
265 | if (!(ob1->inv && ob2->inv)) |
260 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
266 | return 0; /* inventories differ in length */ |
261 | return 0; |
|
|
262 | |
267 | |
263 | /* Now check to see if the two inventory objects could merge */ |
268 | if (ob1->inv->below || ob2->inv->below) |
|
|
269 | return 0; /* more than one object in inv */ |
|
|
270 | |
264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
271 | if (!object::can_merge (ob1->inv, ob2->inv)) |
265 | return 0; |
272 | return 0; /* inventory objects differ */ |
266 | |
273 | |
267 | /* inventory ok - still need to check rest of this object to see |
274 | /* inventory ok - still need to check rest of this object to see |
268 | * if it is valid. |
275 | * if it is valid. |
269 | */ |
276 | */ |
270 | } |
277 | } |
… | |
… | |
289 | if (ob1->level != ob2->level) |
296 | if (ob1->level != ob2->level) |
290 | return 0; |
297 | return 0; |
291 | break; |
298 | break; |
292 | } |
299 | } |
293 | |
300 | |
294 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
301 | if (ob1->key_values || ob2->key_values) |
295 | { |
302 | { |
296 | /* At least one of these has key_values. */ |
303 | /* At least one of these has key_values. */ |
297 | if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) |
304 | if ((!ob1->key_values) != (!ob2->key_values)) |
298 | /* One has fields, but the other one doesn't. */ |
305 | return 0; /* One has fields, but the other one doesn't. */ |
299 | return 0; |
306 | |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
307 | if (!compare_ob_value_lists (ob1, ob2)) |
301 | return 0; |
308 | return 0; |
302 | } |
309 | } |
303 | |
310 | |
304 | if (ob1->self || ob2->self) |
311 | if (ob1->self || ob2->self) |
305 | { |
312 | { |
306 | ob1->optimise (); |
313 | ob1->optimise (); |
307 | ob2->optimise (); |
314 | ob2->optimise (); |
308 | |
315 | |
309 | if (ob1->self || ob2->self) |
316 | if (ob1->self || ob2->self) |
|
|
317 | { |
|
|
318 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
|
|
319 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
|
|
320 | |
|
|
321 | if (k1 != k2) |
|
|
322 | return 0; |
|
|
323 | |
|
|
324 | if (k1 == 0) |
|
|
325 | return 1; |
|
|
326 | |
310 | if (!cfperl_can_merge (ob1, ob2)) |
327 | if (!cfperl_can_merge (ob1, ob2)) |
311 | return 0; |
328 | return 0; |
|
|
329 | } |
312 | } |
330 | } |
313 | |
331 | |
314 | /* Everything passes, must be OK. */ |
332 | /* Everything passes, must be OK. */ |
315 | return 1; |
333 | return 1; |
316 | } |
334 | } |
317 | |
335 | |
|
|
336 | // adjust weight per container type ("of holding") |
|
|
337 | static sint32 |
|
|
338 | weight_adjust (object *op, sint32 weight) |
|
|
339 | { |
|
|
340 | return op->type == CONTAINER |
|
|
341 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
|
|
342 | : weight; |
|
|
343 | } |
|
|
344 | |
318 | /* |
345 | /* |
|
|
346 | * adjust_weight(object, weight) adds the specified weight to an object, |
|
|
347 | * and also updates how much the environment(s) is/are carrying. |
|
|
348 | */ |
|
|
349 | static void |
|
|
350 | adjust_weight (object *op, sint32 weight) |
|
|
351 | { |
|
|
352 | while (op) |
|
|
353 | { |
|
|
354 | weight = weight_adjust (op, weight); |
|
|
355 | |
|
|
356 | op->carrying += weight; |
|
|
357 | op = op->env; |
|
|
358 | } |
|
|
359 | } |
|
|
360 | |
|
|
361 | /* |
319 | * sum_weight() is a recursive function which calculates the weight |
362 | * this is a recursive function which calculates the weight |
320 | * an object is carrying. It goes through in figures out how much |
363 | * an object is carrying. It goes through op and figures out how much |
321 | * containers are carrying, and sums it up. |
364 | * containers are carrying, and sums it up. |
322 | */ |
365 | */ |
323 | long |
366 | void |
324 | sum_weight (object *op) |
367 | object::update_weight () |
325 | { |
368 | { |
326 | long sum; |
369 | sint32 sum = 0; |
327 | object *inv; |
|
|
328 | |
370 | |
329 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
371 | for (object *op = inv; op; op = op->below) |
330 | { |
372 | { |
331 | if (inv->inv) |
373 | if (op->inv) |
332 | sum_weight (inv); |
374 | op->update_weight (); |
333 | |
375 | |
334 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
376 | sum += op->total_weight (); |
335 | } |
377 | } |
336 | |
378 | |
337 | if (op->type == CONTAINER && op->stats.Str) |
379 | carrying = weight_adjust (this, sum); |
338 | sum = (sum * (100 - op->stats.Str)) / 100; |
|
|
339 | |
|
|
340 | if (op->carrying != sum) |
|
|
341 | op->carrying = sum; |
|
|
342 | |
|
|
343 | return sum; |
|
|
344 | } |
380 | } |
345 | |
381 | |
346 | /** |
382 | /* |
347 | * Return the outermost environment object for a given object. |
383 | * 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 | */ |
384 | */ |
363 | char * |
385 | char * |
364 | dump_object (object *op) |
386 | dump_object (object *op) |
365 | { |
387 | { |
366 | if (!op) |
388 | if (!op) |
… | |
… | |
374 | /* |
396 | /* |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
397 | * get_nearest_part(multi-object, object 2) returns the part of the |
376 | * multi-object 1 which is closest to the second object. |
398 | * multi-object 1 which is closest to the second object. |
377 | * If it's not a multi-object, it is returned. |
399 | * If it's not a multi-object, it is returned. |
378 | */ |
400 | */ |
379 | |
|
|
380 | object * |
401 | object * |
381 | get_nearest_part (object *op, const object *pl) |
402 | get_nearest_part (object *op, const object *pl) |
382 | { |
403 | { |
383 | object *tmp, *closest; |
404 | object *tmp, *closest; |
384 | int last_dist, i; |
405 | int last_dist, i; |
385 | |
406 | |
386 | if (op->more == NULL) |
407 | if (!op->more) |
387 | return op; |
408 | return op; |
|
|
409 | |
388 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more) |
410 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
411 | tmp; |
|
|
412 | tmp = tmp->more) |
389 | if ((i = distance (tmp, pl)) < last_dist) |
413 | if ((i = distance (tmp, pl)) < last_dist) |
390 | closest = tmp, last_dist = i; |
414 | closest = tmp, last_dist = i; |
|
|
415 | |
391 | return closest; |
416 | return closest; |
392 | } |
417 | } |
393 | |
418 | |
394 | /* |
419 | /* |
395 | * Returns the object which has the count-variable equal to the argument. |
420 | * Returns the object which has the count-variable equal to the argument. |
|
|
421 | * VERRRY slow. |
396 | */ |
422 | */ |
397 | object * |
423 | object * |
398 | find_object (tag_t i) |
424 | find_object (tag_t i) |
399 | { |
425 | { |
400 | for_all_objects (op) |
426 | for_all_objects (op) |
… | |
… | |
418 | for_all_objects (op) |
444 | for_all_objects (op) |
419 | if (op->name == str_) |
445 | if (op->name == str_) |
420 | break; |
446 | break; |
421 | |
447 | |
422 | return op; |
448 | return op; |
423 | } |
|
|
424 | |
|
|
425 | void |
|
|
426 | free_all_object_data () |
|
|
427 | { |
|
|
428 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
429 | } |
449 | } |
430 | |
450 | |
431 | /* |
451 | /* |
432 | * Sets the owner and sets the skill and exp pointers to owner's current |
452 | * Sets the owner and sets the skill and exp pointers to owner's current |
433 | * skill and experience objects. |
453 | * skill and experience objects. |
… | |
… | |
438 | { |
458 | { |
439 | // allow objects which own objects |
459 | // allow objects which own objects |
440 | if (owner) |
460 | if (owner) |
441 | while (owner->owner) |
461 | while (owner->owner) |
442 | owner = owner->owner; |
462 | owner = owner->owner; |
|
|
463 | |
|
|
464 | if (flag [FLAG_FREED]) |
|
|
465 | { |
|
|
466 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
|
|
467 | return; |
|
|
468 | } |
443 | |
469 | |
444 | this->owner = owner; |
470 | this->owner = owner; |
445 | } |
471 | } |
446 | |
472 | |
447 | int |
473 | int |
… | |
… | |
579 | object::copy_to (object *dst) |
605 | object::copy_to (object *dst) |
580 | { |
606 | { |
581 | *dst = *this; |
607 | *dst = *this; |
582 | |
608 | |
583 | if (speed < 0) |
609 | if (speed < 0) |
584 | dst->speed_left = speed_left - rndm (); |
610 | dst->speed_left -= rndm (); |
585 | |
611 | |
586 | dst->set_speed (dst->speed); |
612 | dst->set_speed (dst->speed); |
587 | } |
613 | } |
588 | |
614 | |
589 | void |
615 | void |
590 | object::instantiate () |
616 | object::instantiate () |
591 | { |
617 | { |
592 | if (!uuid.seq) // HACK |
618 | if (!uuid.seq) // HACK |
593 | uuid = gen_uuid (); |
619 | uuid = UUID::gen (); |
594 | |
620 | |
595 | speed_left = -0.1f; |
621 | speed_left = -0.1f; |
596 | /* copy the body_info to the body_used - this is only really |
622 | /* copy the body_info to the body_used - this is only really |
597 | * need for monsters, but doesn't hurt to do it for everything. |
623 | * need for monsters, but doesn't hurt to do it for everything. |
598 | * by doing so, when a monster is created, it has good starting |
624 | * by doing so, when a monster is created, it has good starting |
… | |
… | |
757 | static int object_count; |
783 | static int object_count; |
758 | |
784 | |
759 | void object::link () |
785 | void object::link () |
760 | { |
786 | { |
761 | assert (!index);//D |
787 | assert (!index);//D |
762 | uuid = gen_uuid (); |
788 | uuid = UUID::gen (); |
763 | count = ++object_count; |
789 | count = ++object_count; |
764 | |
790 | |
765 | refcnt_inc (); |
791 | refcnt_inc (); |
766 | objects.insert (this); |
792 | objects.insert (this); |
767 | } |
793 | } |
… | |
… | |
851 | * if some form of movement is allowed, let objects |
877 | * if some form of movement is allowed, let objects |
852 | * drop on that space. |
878 | * drop on that space. |
853 | */ |
879 | */ |
854 | if (!drop_to_ground |
880 | if (!drop_to_ground |
855 | || !map |
881 | || !map |
856 | || map->in_memory != MAP_IN_MEMORY |
882 | || map->in_memory != MAP_ACTIVE |
857 | || map->nodrop |
883 | || map->nodrop |
858 | || ms ().move_block == MOVE_ALL) |
884 | || ms ().move_block == MOVE_ALL) |
859 | { |
885 | { |
860 | while (inv) |
886 | while (inv) |
861 | { |
887 | { |
… | |
… | |
916 | |
942 | |
917 | if (!freed_map) |
943 | if (!freed_map) |
918 | { |
944 | { |
919 | freed_map = new maptile; |
945 | freed_map = new maptile; |
920 | |
946 | |
|
|
947 | freed_map->path = "<freed objects map>"; |
921 | freed_map->name = "/internal/freed_objects_map"; |
948 | freed_map->name = "/internal/freed_objects_map"; |
922 | freed_map->width = 3; |
949 | freed_map->width = 3; |
923 | freed_map->height = 3; |
950 | freed_map->height = 3; |
|
|
951 | freed_map->nodrop = 1; |
924 | |
952 | |
925 | freed_map->alloc (); |
953 | freed_map->alloc (); |
926 | freed_map->in_memory = MAP_IN_MEMORY; |
954 | freed_map->in_memory = MAP_ACTIVE; |
927 | } |
955 | } |
928 | |
956 | |
929 | map = freed_map; |
957 | map = freed_map; |
930 | x = 1; |
958 | x = 1; |
931 | y = 1; |
959 | y = 1; |
… | |
… | |
960 | play_sound (sound_destroy); |
988 | play_sound (sound_destroy); |
961 | else if (flag [FLAG_MONSTER]) |
989 | else if (flag [FLAG_MONSTER]) |
962 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
990 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
963 | |
991 | |
964 | attachable::destroy (); |
992 | attachable::destroy (); |
965 | } |
|
|
966 | |
|
|
967 | /* |
|
|
968 | * sub_weight() recursively (outwards) subtracts a number from the |
|
|
969 | * weight of an object (and what is carried by it's environment(s)). |
|
|
970 | */ |
|
|
971 | void |
|
|
972 | sub_weight (object *op, signed long weight) |
|
|
973 | { |
|
|
974 | while (op != NULL) |
|
|
975 | { |
|
|
976 | if (op->type == CONTAINER) |
|
|
977 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
978 | |
|
|
979 | op->carrying -= weight; |
|
|
980 | op = op->env; |
|
|
981 | } |
|
|
982 | } |
993 | } |
983 | |
994 | |
984 | /* op->remove (): |
995 | /* op->remove (): |
985 | * This function removes the object op from the linked list of objects |
996 | * This function removes the object op from the linked list of objects |
986 | * which it is currently tied to. When this function is done, the |
997 | * which it is currently tied to. When this function is done, the |
… | |
… | |
1007 | * In this case, the object to be removed is in someones |
1018 | * In this case, the object to be removed is in someones |
1008 | * inventory. |
1019 | * inventory. |
1009 | */ |
1020 | */ |
1010 | if (env) |
1021 | if (env) |
1011 | { |
1022 | { |
|
|
1023 | adjust_weight (env, -total_weight ()); |
|
|
1024 | |
|
|
1025 | *(above ? &above->below : &env->inv) = below; |
|
|
1026 | |
1012 | if (nrof) |
1027 | if (below) |
1013 | sub_weight (env, weight * nrof); |
1028 | below->above = above; |
1014 | else |
1029 | |
1015 | sub_weight (env, weight + carrying); |
1030 | /* we set up values so that it could be inserted into |
|
|
1031 | * the map, but we don't actually do that - it is up |
|
|
1032 | * to the caller to decide what we want to do. |
|
|
1033 | */ |
|
|
1034 | map = env->map; |
|
|
1035 | x = env->x; |
|
|
1036 | y = env->y; |
|
|
1037 | above = 0; |
|
|
1038 | below = 0; |
|
|
1039 | env = 0; |
1016 | |
1040 | |
1017 | /* NO_FIX_PLAYER is set when a great many changes are being |
1041 | /* NO_FIX_PLAYER is set when a great many changes are being |
1018 | * made to players inventory. If set, avoiding the call |
1042 | * made to players inventory. If set, avoiding the call |
1019 | * to save cpu time. |
1043 | * to save cpu time. |
1020 | */ |
1044 | */ |
1021 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1045 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1022 | otmp->update_stats (); |
1046 | otmp->update_stats (); |
1023 | |
|
|
1024 | if (above) |
|
|
1025 | above->below = below; |
|
|
1026 | else |
|
|
1027 | env->inv = below; |
|
|
1028 | |
|
|
1029 | if (below) |
|
|
1030 | below->above = above; |
|
|
1031 | |
|
|
1032 | /* we set up values so that it could be inserted into |
|
|
1033 | * the map, but we don't actually do that - it is up |
|
|
1034 | * to the caller to decide what we want to do. |
|
|
1035 | */ |
|
|
1036 | x = env->x, y = env->y; |
|
|
1037 | map = env->map; |
|
|
1038 | above = 0, below = 0; |
|
|
1039 | env = 0; |
|
|
1040 | } |
1047 | } |
1041 | else if (map) |
1048 | else if (map) |
1042 | { |
1049 | { |
1043 | if (type == PLAYER) |
1050 | if (type == PLAYER) |
1044 | { |
1051 | { |
… | |
… | |
1140 | merge_ob (object *op, object *top) |
1147 | merge_ob (object *op, object *top) |
1141 | { |
1148 | { |
1142 | if (!op->nrof) |
1149 | if (!op->nrof) |
1143 | return 0; |
1150 | return 0; |
1144 | |
1151 | |
1145 | if (top) |
1152 | if (!top) |
1146 | for (top = op; top && top->above; top = top->above) |
1153 | for (top = op; top && top->above; top = top->above) |
1147 | ; |
1154 | ; |
1148 | |
1155 | |
1149 | for (; top; top = top->below) |
1156 | for (; top; top = top->below) |
1150 | { |
1157 | { |
… | |
… | |
1231 | |
1238 | |
1232 | object *top, *floor = NULL; |
1239 | object *top, *floor = NULL; |
1233 | |
1240 | |
1234 | op->remove (); |
1241 | op->remove (); |
1235 | |
1242 | |
1236 | if (out_of_map (m, op->x, op->y)) |
|
|
1237 | { |
|
|
1238 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
|
|
1239 | #ifdef MANY_CORES |
|
|
1240 | /* Better to catch this here, as otherwise the next use of this object |
|
|
1241 | * is likely to cause a crash. Better to find out where it is getting |
|
|
1242 | * improperly inserted. |
|
|
1243 | */ |
|
|
1244 | abort (); |
|
|
1245 | #endif |
|
|
1246 | return op; |
|
|
1247 | } |
|
|
1248 | |
|
|
1249 | if (object *more = op->more) |
|
|
1250 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1251 | return 0; |
|
|
1252 | |
|
|
1253 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1254 | |
|
|
1255 | /* Ideally, the caller figures this out. However, it complicates a lot |
1243 | /* Ideally, the caller figures this out. However, it complicates a lot |
1256 | * of areas of callers (eg, anything that uses find_free_spot would now |
1244 | * of areas of callers (eg, anything that uses find_free_spot would now |
1257 | * need extra work |
1245 | * need extra work |
1258 | */ |
1246 | */ |
1259 | if (!xy_normalise (m, op->x, op->y)) |
1247 | if (!xy_normalise (m, op->x, op->y)) |
|
|
1248 | { |
|
|
1249 | op->destroy (); |
1260 | return 0; |
1250 | return 0; |
|
|
1251 | } |
|
|
1252 | |
|
|
1253 | if (object *more = op->more) |
|
|
1254 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1255 | return 0; |
|
|
1256 | |
|
|
1257 | CLEAR_FLAG (op, FLAG_REMOVED); |
1261 | |
1258 | |
1262 | op->map = m; |
1259 | op->map = m; |
1263 | mapspace &ms = op->ms (); |
1260 | mapspace &ms = op->ms (); |
1264 | |
1261 | |
1265 | /* this has to be done after we translate the coordinates. |
1262 | /* this has to be done after we translate the coordinates. |
… | |
… | |
1267 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1264 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1268 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1265 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1269 | if (object::can_merge (op, tmp)) |
1266 | if (object::can_merge (op, tmp)) |
1270 | { |
1267 | { |
1271 | op->nrof += tmp->nrof; |
1268 | op->nrof += tmp->nrof; |
1272 | tmp->destroy (); |
1269 | tmp->destroy (1); |
1273 | } |
1270 | } |
1274 | |
1271 | |
1275 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1272 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1276 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1273 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1277 | |
1274 | |
… | |
… | |
1300 | else |
1297 | else |
1301 | { |
1298 | { |
1302 | top = ms.bot; |
1299 | top = ms.bot; |
1303 | |
1300 | |
1304 | /* If there are other objects, then */ |
1301 | /* If there are other objects, then */ |
1305 | if ((!(flag & INS_MAP_LOAD)) && top) |
1302 | if (top) |
1306 | { |
1303 | { |
1307 | object *last = 0; |
1304 | object *last = 0; |
1308 | |
1305 | |
1309 | /* |
1306 | /* |
1310 | * If there are multiple objects on this space, we do some trickier handling. |
1307 | * If there are multiple objects on this space, we do some trickier handling. |
… | |
… | |
1362 | */ |
1359 | */ |
1363 | if (last && last->below && last != floor) |
1360 | if (last && last->below && last != floor) |
1364 | top = last->below; |
1361 | top = last->below; |
1365 | } |
1362 | } |
1366 | } /* If objects on this space */ |
1363 | } /* If objects on this space */ |
1367 | if (flag & INS_MAP_LOAD) |
|
|
1368 | top = ms.top; |
|
|
1369 | |
1364 | |
1370 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1365 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1371 | top = floor; |
1366 | top = floor; |
1372 | |
1367 | |
1373 | /* Top is the object that our object (op) is going to get inserted above. |
1368 | /* Top is the object that our object (op) is going to get inserted above. |
… | |
… | |
1406 | op->map->touch (); |
1401 | op->map->touch (); |
1407 | } |
1402 | } |
1408 | |
1403 | |
1409 | op->map->dirty = true; |
1404 | op->map->dirty = true; |
1410 | |
1405 | |
1411 | if (!(flag & INS_MAP_LOAD)) |
|
|
1412 | if (object *pl = ms.player ()) |
1406 | if (object *pl = ms.player ()) |
1413 | pl->contr->ns->floorbox_update (); |
1407 | pl->contr->ns->floorbox_update (); |
1414 | |
1408 | |
1415 | /* If this object glows, it may affect lighting conditions that are |
1409 | /* If this object glows, it may affect lighting conditions that are |
1416 | * visible to others on this map. But update_all_los is really |
1410 | * visible to others on this map. But update_all_los is really |
1417 | * an inefficient way to do this, as it means los for all players |
1411 | * an inefficient way to do this, as it means los for all players |
1418 | * on the map will get recalculated. The players could very well |
1412 | * on the map will get recalculated. The players could very well |
… | |
… | |
1460 | * op is the object to insert it under: supplies x and the map. |
1454 | * op is the object to insert it under: supplies x and the map. |
1461 | */ |
1455 | */ |
1462 | void |
1456 | void |
1463 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1457 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1464 | { |
1458 | { |
1465 | object *tmp, *tmp1; |
|
|
1466 | |
|
|
1467 | /* first search for itself and remove any old instances */ |
1459 | /* first search for itself and remove any old instances */ |
1468 | |
1460 | |
1469 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1461 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1470 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1462 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1471 | tmp->destroy (); |
1463 | tmp->destroy (1); |
1472 | |
1464 | |
1473 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1465 | object *tmp = arch_to_object (archetype::find (arch_string)); |
1474 | |
1466 | |
1475 | tmp1->x = op->x; |
1467 | tmp->x = op->x; |
1476 | tmp1->y = op->y; |
1468 | tmp->y = op->y; |
|
|
1469 | |
1477 | insert_ob_in_map (tmp1, op->map, op, 0); |
1470 | insert_ob_in_map (tmp, op->map, op, 0); |
1478 | } |
1471 | } |
1479 | |
1472 | |
1480 | object * |
1473 | object * |
1481 | object::insert_at (object *where, object *originator, int flags) |
1474 | object::insert_at (object *where, object *originator, int flags) |
1482 | { |
1475 | { |
|
|
1476 | if (where->env) |
|
|
1477 | return where->env->insert (this); |
|
|
1478 | else |
1483 | return where->map->insert (this, where->x, where->y, originator, flags); |
1479 | return where->map->insert (this, where->x, where->y, originator, flags); |
1484 | } |
1480 | } |
1485 | |
1481 | |
1486 | /* |
1482 | // find player who can see this object |
1487 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1483 | static object * |
1488 | * is returned contains nr objects, and the remaining parts contains |
1484 | visible_to (object *op) |
1489 | * the rest (or is removed and freed if that number is 0). |
|
|
1490 | * On failure, NULL is returned, and the reason put into the |
|
|
1491 | * global static errmsg array. |
|
|
1492 | */ |
|
|
1493 | object * |
|
|
1494 | get_split_ob (object *orig_ob, uint32 nr) |
|
|
1495 | { |
1485 | { |
1496 | object *newob; |
1486 | if (!op->flag [FLAG_REMOVED]) |
1497 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
|
|
1498 | |
|
|
1499 | if (orig_ob->nrof < nr) |
|
|
1500 | { |
|
|
1501 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
|
|
1502 | return NULL; |
|
|
1503 | } |
1487 | { |
1504 | |
1488 | // see if we are in a container of sorts |
1505 | newob = object_create_clone (orig_ob); |
1489 | if (object *env = op->env) |
1506 | |
|
|
1507 | if ((orig_ob->nrof -= nr) < 1) |
|
|
1508 | orig_ob->destroy (1); |
|
|
1509 | else if (!is_removed) |
|
|
1510 | { |
|
|
1511 | if (orig_ob->env != NULL) |
|
|
1512 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
|
|
1513 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
|
|
1514 | { |
|
|
1515 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
|
|
1516 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
|
|
1517 | return NULL; |
|
|
1518 | } |
1490 | { |
1519 | } |
1491 | // the player inventory itself is always visible |
|
|
1492 | if (env->type == PLAYER) |
|
|
1493 | return env; |
1520 | |
1494 | |
1521 | newob->nrof = nr; |
1495 | // else a player could have our env open |
|
|
1496 | env = env->outer_env (); |
1522 | |
1497 | |
|
|
1498 | // the player itself is always on a map, so we will find him here |
|
|
1499 | // even if our inv is in a player. |
|
|
1500 | if (env->is_on_map ()) |
|
|
1501 | if (object *pl = env->ms ().player ()) |
|
|
1502 | if (pl->container == op->env) |
|
|
1503 | return pl; |
|
|
1504 | } |
|
|
1505 | else |
|
|
1506 | { |
|
|
1507 | // maybe there is a player standing on the same mapspace |
|
|
1508 | if (object *pl = env->ms ().player ()) |
|
|
1509 | return pl; |
|
|
1510 | } |
|
|
1511 | } |
|
|
1512 | |
1523 | return newob; |
1513 | return 0; |
1524 | } |
1514 | } |
1525 | |
1515 | |
1526 | /* |
1516 | /* |
1527 | * decrease_ob_nr(object, number) decreases a specified number from |
1517 | * decrease(object, number) decreases a specified number from |
1528 | * the amount of an object. If the amount reaches 0, the object |
1518 | * the amount of an object. If the amount reaches 0, the object |
1529 | * is subsequently removed and freed. |
1519 | * is subsequently removed and freed. |
1530 | * |
1520 | * |
1531 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1521 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1532 | */ |
1522 | */ |
|
|
1523 | bool |
|
|
1524 | object::decrease (sint32 nr) |
|
|
1525 | { |
|
|
1526 | nr = min (nr, nrof); |
|
|
1527 | |
|
|
1528 | if (!nr) |
|
|
1529 | return 1; |
|
|
1530 | |
|
|
1531 | nrof -= nr; |
|
|
1532 | |
|
|
1533 | object *visible = visible_to (this); |
|
|
1534 | |
|
|
1535 | if (nrof) |
|
|
1536 | { |
|
|
1537 | adjust_weight (env, -weight * nr); // carrying == 0 |
|
|
1538 | |
|
|
1539 | if (visible) |
|
|
1540 | esrv_send_item (visible, this); |
|
|
1541 | |
|
|
1542 | return 1; |
|
|
1543 | } |
|
|
1544 | else |
|
|
1545 | { |
|
|
1546 | if (visible) |
|
|
1547 | esrv_del_item (visible->contr, count); |
|
|
1548 | |
|
|
1549 | this->destroy (1); |
|
|
1550 | return 0; |
|
|
1551 | } |
|
|
1552 | } |
|
|
1553 | |
|
|
1554 | /* |
|
|
1555 | * split(ob,nr) splits up ob into two parts. The part which |
|
|
1556 | * is returned contains nr objects, and the remaining parts contains |
|
|
1557 | * the rest (or is removed and returned if that number is 0). |
|
|
1558 | * On failure, NULL is returned. |
|
|
1559 | */ |
1533 | object * |
1560 | object * |
1534 | decrease_ob_nr (object *op, uint32 i) |
1561 | object::split (sint32 nr) |
1535 | { |
1562 | { |
1536 | object *tmp; |
1563 | if (nrof < nr) |
1537 | |
|
|
1538 | if (i == 0) /* objects with op->nrof require this check */ |
|
|
1539 | return op; |
1564 | return 0; |
1540 | |
1565 | else if (nrof == nr) |
1541 | if (i > op->nrof) |
|
|
1542 | i = op->nrof; |
|
|
1543 | |
|
|
1544 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1545 | op->nrof -= i; |
|
|
1546 | else if (op->env) |
|
|
1547 | { |
1566 | { |
1548 | /* is this object in the players inventory, or sub container |
|
|
1549 | * therein? |
|
|
1550 | */ |
|
|
1551 | tmp = op->in_player (); |
|
|
1552 | /* nope. Is this a container the player has opened? |
|
|
1553 | * If so, set tmp to that player. |
|
|
1554 | * IMO, searching through all the players will mostly |
|
|
1555 | * likely be quicker than following op->env to the map, |
|
|
1556 | * and then searching the map for a player. |
|
|
1557 | */ |
|
|
1558 | if (!tmp) |
|
|
1559 | for_all_players (pl) |
|
|
1560 | if (pl->ob->container == op->env) |
|
|
1561 | { |
|
|
1562 | tmp = pl->ob; |
|
|
1563 | break; |
|
|
1564 | } |
|
|
1565 | |
|
|
1566 | if (i < op->nrof) |
|
|
1567 | { |
|
|
1568 | sub_weight (op->env, op->weight * i); |
|
|
1569 | op->nrof -= i; |
|
|
1570 | if (tmp) |
|
|
1571 | esrv_send_item (tmp, op); |
|
|
1572 | } |
|
|
1573 | else |
|
|
1574 | { |
|
|
1575 | op->remove (); |
1567 | remove (); |
1576 | op->nrof = 0; |
1568 | return this; |
1577 | if (tmp) |
|
|
1578 | esrv_del_item (tmp->contr, op->count); |
|
|
1579 | } |
|
|
1580 | } |
1569 | } |
1581 | else |
1570 | else |
1582 | { |
1571 | { |
1583 | object *above = op->above; |
1572 | decrease (nr); |
1584 | |
1573 | |
1585 | if (i < op->nrof) |
1574 | object *op = object_create_clone (this); |
1586 | op->nrof -= i; |
1575 | op->nrof = nr; |
1587 | else |
|
|
1588 | { |
|
|
1589 | op->remove (); |
|
|
1590 | op->nrof = 0; |
|
|
1591 | } |
|
|
1592 | |
|
|
1593 | /* Since we just removed op, op->above is null */ |
|
|
1594 | for (tmp = above; tmp; tmp = tmp->above) |
|
|
1595 | if (tmp->type == PLAYER) |
|
|
1596 | { |
|
|
1597 | if (op->nrof) |
|
|
1598 | esrv_send_item (tmp, op); |
|
|
1599 | else |
|
|
1600 | esrv_del_item (tmp->contr, op->count); |
|
|
1601 | } |
|
|
1602 | } |
|
|
1603 | |
|
|
1604 | if (op->nrof) |
|
|
1605 | return op; |
1576 | return op; |
1606 | else |
|
|
1607 | { |
|
|
1608 | op->destroy (); |
|
|
1609 | return 0; |
|
|
1610 | } |
|
|
1611 | } |
|
|
1612 | |
|
|
1613 | /* |
|
|
1614 | * add_weight(object, weight) adds the specified weight to an object, |
|
|
1615 | * and also updates how much the environment(s) is/are carrying. |
|
|
1616 | */ |
|
|
1617 | void |
|
|
1618 | add_weight (object *op, signed long weight) |
|
|
1619 | { |
|
|
1620 | while (op != NULL) |
|
|
1621 | { |
|
|
1622 | if (op->type == CONTAINER) |
|
|
1623 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
1624 | |
|
|
1625 | op->carrying += weight; |
|
|
1626 | op = op->env; |
|
|
1627 | } |
1577 | } |
1628 | } |
1578 | } |
1629 | |
1579 | |
1630 | object * |
1580 | object * |
1631 | insert_ob_in_ob (object *op, object *where) |
1581 | insert_ob_in_ob (object *op, object *where) |
… | |
… | |
1656 | * be != op, if items are merged. -Tero |
1606 | * be != op, if items are merged. -Tero |
1657 | */ |
1607 | */ |
1658 | object * |
1608 | object * |
1659 | object::insert (object *op) |
1609 | object::insert (object *op) |
1660 | { |
1610 | { |
1661 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1662 | op->remove (); |
|
|
1663 | |
|
|
1664 | if (op->more) |
1611 | if (op->more) |
1665 | { |
1612 | { |
1666 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1613 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1667 | return op; |
1614 | return op; |
1668 | } |
1615 | } |
1669 | |
1616 | |
1670 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1617 | op->remove (); |
1671 | CLEAR_FLAG (op, FLAG_REMOVED); |
1618 | |
|
|
1619 | op->flag [FLAG_OBJ_ORIGINAL] = 0; |
1672 | |
1620 | |
1673 | if (op->nrof) |
1621 | if (op->nrof) |
1674 | { |
|
|
1675 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1622 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1676 | if (object::can_merge (tmp, op)) |
1623 | if (object::can_merge (tmp, op)) |
1677 | { |
1624 | { |
1678 | /* return the original object and remove inserted object |
1625 | /* return the original object and remove inserted object |
1679 | (client needs the original object) */ |
1626 | (client needs the original object) */ |
1680 | tmp->nrof += op->nrof; |
1627 | tmp->nrof += op->nrof; |
1681 | /* Weight handling gets pretty funky. Since we are adding to |
|
|
1682 | * tmp->nrof, we need to increase the weight. |
|
|
1683 | */ |
|
|
1684 | add_weight (this, op->weight * op->nrof); |
1628 | adjust_weight (this, op->total_weight ()); |
1685 | SET_FLAG (op, FLAG_REMOVED); |
1629 | |
1686 | op->destroy (); /* free the inserted object */ |
1630 | op->destroy (1); |
1687 | op = tmp; |
1631 | op = tmp; |
1688 | op->remove (); /* and fix old object's links */ |
1632 | goto inserted; |
1689 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1690 | break; |
|
|
1691 | } |
1633 | } |
1692 | |
1634 | |
1693 | /* I assume combined objects have no inventory |
1635 | op->owner = 0; // it's his/hers now. period. |
1694 | * We add the weight - this object could have just been removed |
1636 | op->map = 0; |
1695 | * (if it was possible to merge). calling remove_ob will subtract |
1637 | op->x = 0; |
1696 | * the weight, so we need to add it in again, since we actually do |
1638 | op->y = 0; |
1697 | * the linking below |
|
|
1698 | */ |
|
|
1699 | add_weight (this, op->weight * op->nrof); |
|
|
1700 | } |
|
|
1701 | else |
|
|
1702 | add_weight (this, (op->weight + op->carrying)); |
|
|
1703 | |
1639 | |
|
|
1640 | op->above = 0; |
|
|
1641 | op->below = inv; |
|
|
1642 | op->env = this; |
|
|
1643 | |
|
|
1644 | if (inv) |
|
|
1645 | inv->above = op; |
|
|
1646 | |
|
|
1647 | inv = op; |
|
|
1648 | |
|
|
1649 | op->flag [FLAG_REMOVED] = 0; |
|
|
1650 | |
|
|
1651 | adjust_weight (this, op->total_weight ()); |
|
|
1652 | |
|
|
1653 | inserted: |
|
|
1654 | /* reset the light list and los of the players on the map */ |
|
|
1655 | if (op->glow_radius && map && map->darkness) |
|
|
1656 | update_all_los (map, x, y); |
|
|
1657 | |
1704 | if (object *otmp = this->in_player ()) |
1658 | if (object *otmp = in_player ()) |
1705 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1659 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1706 | otmp->update_stats (); |
1660 | otmp->update_stats (); |
1707 | |
|
|
1708 | op->owner = 0; // its his/hers now. period. |
|
|
1709 | op->map = 0; |
|
|
1710 | op->env = this; |
|
|
1711 | op->above = 0; |
|
|
1712 | op->below = 0; |
|
|
1713 | op->x = op->y = 0; |
|
|
1714 | |
|
|
1715 | /* reset the light list and los of the players on the map */ |
|
|
1716 | if (op->glow_radius && map) |
|
|
1717 | { |
|
|
1718 | #ifdef DEBUG_LIGHTS |
|
|
1719 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
|
|
1720 | #endif /* DEBUG_LIGHTS */ |
|
|
1721 | if (map->darkness) |
|
|
1722 | update_all_los (map, x, y); |
|
|
1723 | } |
|
|
1724 | |
|
|
1725 | /* Client has no idea of ordering so lets not bother ordering it here. |
|
|
1726 | * It sure simplifies this function... |
|
|
1727 | */ |
|
|
1728 | if (!inv) |
|
|
1729 | inv = op; |
|
|
1730 | else |
|
|
1731 | { |
|
|
1732 | op->below = inv; |
|
|
1733 | op->below->above = op; |
|
|
1734 | inv = op; |
|
|
1735 | } |
|
|
1736 | |
1661 | |
1737 | INVOKE_OBJECT (INSERT, this); |
1662 | INVOKE_OBJECT (INSERT, this); |
1738 | |
1663 | |
1739 | return op; |
1664 | return op; |
1740 | } |
1665 | } |
… | |
… | |
1955 | * activate recursively a flag on an object inventory |
1880 | * activate recursively a flag on an object inventory |
1956 | */ |
1881 | */ |
1957 | void |
1882 | void |
1958 | flag_inv (object *op, int flag) |
1883 | flag_inv (object *op, int flag) |
1959 | { |
1884 | { |
1960 | if (op->inv) |
|
|
1961 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1885 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1962 | { |
1886 | { |
1963 | SET_FLAG (tmp, flag); |
1887 | SET_FLAG (tmp, flag); |
1964 | flag_inv (tmp, flag); |
1888 | flag_inv (tmp, flag); |
1965 | } |
1889 | } |
1966 | } |
1890 | } |
1967 | |
1891 | |
1968 | /* |
1892 | /* |
1969 | * deactivate recursively a flag on an object inventory |
1893 | * deactivate recursively a flag on an object inventory |
1970 | */ |
1894 | */ |
1971 | void |
1895 | void |
1972 | unflag_inv (object *op, int flag) |
1896 | unflag_inv (object *op, int flag) |
1973 | { |
1897 | { |
1974 | if (op->inv) |
|
|
1975 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1898 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1976 | { |
1899 | { |
1977 | CLEAR_FLAG (tmp, flag); |
1900 | CLEAR_FLAG (tmp, flag); |
1978 | unflag_inv (tmp, flag); |
1901 | unflag_inv (tmp, flag); |
1979 | } |
1902 | } |
1980 | } |
1903 | } |
1981 | |
1904 | |
1982 | /* |
1905 | /* |
1983 | * find_free_spot(object, map, x, y, start, stop) will search for |
1906 | * find_free_spot(object, map, x, y, start, stop) will search for |
1984 | * a spot at the given map and coordinates which will be able to contain |
1907 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
1986 | * to search (see the freearr_x/y[] definition). |
1909 | * to search (see the freearr_x/y[] definition). |
1987 | * It returns a random choice among the alternatives found. |
1910 | * It returns a random choice among the alternatives found. |
1988 | * start and stop are where to start relative to the free_arr array (1,9 |
1911 | * start and stop are where to start relative to the free_arr array (1,9 |
1989 | * does all 4 immediate directions). This returns the index into the |
1912 | * does all 4 immediate directions). This returns the index into the |
1990 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1913 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1991 | * Note - this only checks to see if there is space for the head of the |
|
|
1992 | * object - if it is a multispace object, this should be called for all |
|
|
1993 | * pieces. |
|
|
1994 | * Note2: This function does correctly handle tiled maps, but does not |
1914 | * Note: This function does correctly handle tiled maps, but does not |
1995 | * inform the caller. However, insert_ob_in_map will update as |
1915 | * inform the caller. However, insert_ob_in_map will update as |
1996 | * necessary, so the caller shouldn't need to do any special work. |
1916 | * necessary, so the caller shouldn't need to do any special work. |
1997 | * Note - updated to take an object instead of archetype - this is necessary |
1917 | * Note - updated to take an object instead of archetype - this is necessary |
1998 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1918 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1999 | * to know if the space in question will block the object. We can't use |
1919 | * to know if the space in question will block the object. We can't use |
… | |
… | |
2001 | * customized, changed states, etc. |
1921 | * customized, changed states, etc. |
2002 | */ |
1922 | */ |
2003 | int |
1923 | int |
2004 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1924 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2005 | { |
1925 | { |
|
|
1926 | int altern[SIZEOFFREE]; |
2006 | int index = 0, flag; |
1927 | int index = 0, flag; |
2007 | int altern[SIZEOFFREE]; |
|
|
2008 | |
1928 | |
2009 | for (int i = start; i < stop; i++) |
1929 | for (int i = start; i < stop; i++) |
2010 | { |
1930 | { |
2011 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
1931 | mapxy pos (m, x, y); pos.move (i); |
2012 | if (!flag) |
1932 | |
|
|
1933 | if (!pos.normalise ()) |
|
|
1934 | continue; |
|
|
1935 | |
|
|
1936 | mapspace &ms = *pos; |
|
|
1937 | |
|
|
1938 | if (ms.flags () & P_IS_ALIVE) |
|
|
1939 | continue; |
|
|
1940 | |
|
|
1941 | /* However, often |
|
|
1942 | * ob doesn't have any move type (when used to place exits) |
|
|
1943 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
1944 | */ |
|
|
1945 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
1946 | { |
2013 | altern [index++] = i; |
1947 | altern [index++] = i; |
|
|
1948 | continue; |
|
|
1949 | } |
2014 | |
1950 | |
2015 | /* Basically, if we find a wall on a space, we cut down the search size. |
1951 | /* Basically, if we find a wall on a space, we cut down the search size. |
2016 | * In this way, we won't return spaces that are on another side of a wall. |
1952 | * In this way, we won't return spaces that are on another side of a wall. |
2017 | * This mostly work, but it cuts down the search size in all directions - |
1953 | * This mostly work, but it cuts down the search size in all directions - |
2018 | * if the space being examined only has a wall to the north and empty |
1954 | * if the space being examined only has a wall to the north and empty |
2019 | * spaces in all the other directions, this will reduce the search space |
1955 | * spaces in all the other directions, this will reduce the search space |
2020 | * to only the spaces immediately surrounding the target area, and |
1956 | * to only the spaces immediately surrounding the target area, and |
2021 | * won't look 2 spaces south of the target space. |
1957 | * won't look 2 spaces south of the target space. |
2022 | */ |
1958 | */ |
2023 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
1959 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
1960 | { |
2024 | stop = maxfree[i]; |
1961 | stop = maxfree[i]; |
|
|
1962 | continue; |
|
|
1963 | } |
|
|
1964 | |
|
|
1965 | /* Note it is intentional that we check ob - the movement type of the |
|
|
1966 | * head of the object should correspond for the entire object. |
|
|
1967 | */ |
|
|
1968 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
1969 | continue; |
|
|
1970 | |
|
|
1971 | if (ob->blocked (m, pos.x, pos.y)) |
|
|
1972 | continue; |
|
|
1973 | |
|
|
1974 | altern [index++] = i; |
2025 | } |
1975 | } |
2026 | |
1976 | |
2027 | if (!index) |
1977 | if (!index) |
2028 | return -1; |
1978 | return -1; |
2029 | |
1979 | |
… | |
… | |
2038 | */ |
1988 | */ |
2039 | int |
1989 | int |
2040 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
1990 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2041 | { |
1991 | { |
2042 | for (int i = 0; i < SIZEOFFREE; i++) |
1992 | for (int i = 0; i < SIZEOFFREE; i++) |
2043 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
1993 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2044 | return i; |
1994 | return i; |
2045 | |
1995 | |
2046 | return -1; |
1996 | return -1; |
2047 | } |
1997 | } |
2048 | |
1998 | |
… | |
… | |
2585 | { |
2535 | { |
2586 | char flagdesc[512]; |
2536 | char flagdesc[512]; |
2587 | char info2[256 * 4]; |
2537 | char info2[256 * 4]; |
2588 | char *p = info; |
2538 | char *p = info; |
2589 | |
2539 | |
2590 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2540 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2591 | count, uuid.seq, |
2541 | count, |
|
|
2542 | uuid.c_str (), |
2592 | &name, |
2543 | &name, |
2593 | title ? "\",title:\"" : "", |
2544 | title ? "\",title:\"" : "", |
2594 | title ? (const char *)title : "", |
2545 | title ? (const char *)title : "", |
2595 | flag_desc (flagdesc, 512), type); |
2546 | flag_desc (flagdesc, 512), type); |
2596 | |
2547 | |
… | |
… | |
2712 | |
2663 | |
2713 | insert (force); |
2664 | insert (force); |
2714 | } |
2665 | } |
2715 | |
2666 | |
2716 | void |
2667 | void |
2717 | object::play_sound (faceidx sound) const |
2668 | object::play_sound (faceidx sound) |
2718 | { |
2669 | { |
2719 | if (!sound) |
2670 | if (!sound) |
2720 | return; |
2671 | return; |
2721 | |
2672 | |
2722 | if (flag [FLAG_REMOVED]) |
2673 | if (flag [FLAG_REMOVED]) |