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 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. |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | sub/add_weight will transcend the environment updating the carrying |
25 | sub/add_weight will transcend the environment updating the carrying |
26 | variable. */ |
26 | variable. */ |
… | |
… | |
33 | #include <sproto.h> |
33 | #include <sproto.h> |
34 | #include <loader.h> |
34 | #include <loader.h> |
35 | |
35 | |
36 | #include <bitset> |
36 | #include <bitset> |
37 | |
37 | |
38 | int nrofallocobjects = 0; |
38 | UUID UUID::cur; |
39 | static UUID uuid; |
39 | static uint64_t seq_next_save; |
40 | const uint64 UUID_SKIP = 1<<19; |
40 | static const uint64 UUID_GAP = 1<<19; |
41 | |
41 | |
42 | objectvec objects; |
42 | objectvec objects; |
43 | activevec actives; |
43 | activevec actives; |
44 | |
44 | |
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, |
45 | short freearr_x[SIZEOFFREE] = { |
|
|
46 | 0, |
|
|
47 | 0, 1, 1, 1, 0, -1, -1, -1, |
|
|
48 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
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 |
49 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
47 | }; |
50 | }; |
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, |
51 | short freearr_y[SIZEOFFREE] = { |
|
|
52 | 0, |
|
|
53 | -1, -1, 0, 1, 1, 1, 0, -1, |
|
|
54 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
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 |
55 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
50 | }; |
56 | }; |
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, |
57 | int maxfree[SIZEOFFREE] = { |
|
|
58 | 0, |
|
|
59 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
60 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
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 |
61 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
53 | }; |
62 | }; |
54 | int freedir[SIZEOFFREE] = { |
63 | 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, |
64 | 0, |
|
|
65 | 1, 2, 3, 4, 5, 6, 7, 8, |
|
|
66 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
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 |
67 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
57 | }; |
68 | }; |
58 | |
69 | |
59 | static void |
70 | static void |
60 | write_uuid (void) |
71 | write_uuid (uval64 skip, bool sync) |
61 | { |
72 | { |
62 | char filename1[MAX_BUF], filename2[MAX_BUF]; |
73 | CALL_BEGIN (2); |
63 | |
74 | CALL_ARG_SV (newSVval64 (skip)); |
64 | sprintf (filename1, "%s/uuid", settings.localdir); |
75 | CALL_ARG_SV (boolSV (sync)); |
65 | sprintf (filename2, "%s/uuid~", settings.localdir); |
76 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
66 | |
77 | 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 | } |
78 | } |
79 | |
79 | |
80 | static void |
80 | static void |
81 | read_uuid (void) |
81 | read_uuid (void) |
82 | { |
82 | { |
83 | char filename[MAX_BUF]; |
83 | char filename[MAX_BUF]; |
84 | |
84 | |
85 | sprintf (filename, "%s/uuid", settings.localdir); |
85 | sprintf (filename, "%s/uuid", settings.localdir); |
86 | |
86 | |
|
|
87 | seq_next_save = 0; |
|
|
88 | |
87 | FILE *fp; |
89 | FILE *fp; |
88 | |
90 | |
89 | if (!(fp = fopen (filename, "r"))) |
91 | if (!(fp = fopen (filename, "r"))) |
90 | { |
92 | { |
91 | if (errno == ENOENT) |
93 | if (errno == ENOENT) |
92 | { |
94 | { |
93 | LOG (llevInfo, "RESET uid to 1\n"); |
95 | LOG (llevInfo, "RESET uid to 1\n"); |
94 | uuid.seq = 0; |
96 | UUID::cur.seq = 0; |
95 | write_uuid (); |
97 | write_uuid (UUID_GAP, true); |
96 | return; |
98 | return; |
97 | } |
99 | } |
98 | |
100 | |
99 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
101 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
100 | _exit (1); |
102 | _exit (1); |
101 | } |
103 | } |
102 | |
104 | |
103 | int version; |
105 | UUID::BUF buf; |
104 | unsigned long long uid; |
106 | buf[0] = 0; |
105 | if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1) |
107 | fgets (buf, sizeof (buf), fp); |
|
|
108 | |
|
|
109 | if (!UUID::cur.parse (buf)) |
106 | { |
110 | { |
107 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
111 | LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf); |
108 | _exit (1); |
112 | _exit (1); |
109 | } |
113 | } |
110 | |
114 | |
111 | uuid.seq = uid; |
115 | LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ()); |
112 | write_uuid (); |
116 | |
113 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
117 | write_uuid (UUID_GAP, true); |
114 | fclose (fp); |
118 | fclose (fp); |
115 | } |
119 | } |
116 | |
120 | |
117 | UUID |
121 | UUID |
118 | gen_uuid () |
122 | UUID::gen () |
119 | { |
123 | { |
120 | UUID uid; |
124 | UUID uid; |
121 | |
125 | |
122 | uid.seq = ++uuid.seq; |
126 | uid.seq = ++cur.seq; |
123 | |
127 | |
124 | if (!(uuid.seq & (UUID_SKIP - 1))) |
128 | if (expect_false (cur.seq >= seq_next_save)) |
125 | write_uuid (); |
129 | { |
|
|
130 | seq_next_save = UUID::cur.seq + (UUID_GAP >> 1); |
|
|
131 | write_uuid (UUID_GAP, false); |
|
|
132 | } |
|
|
133 | |
126 | |
134 | |
127 | return uid; |
135 | return uid; |
128 | } |
136 | } |
129 | |
137 | |
130 | void |
138 | void |
131 | init_uuid () |
139 | UUID::init () |
132 | { |
140 | { |
133 | read_uuid (); |
141 | read_uuid (); |
134 | } |
142 | } |
135 | |
143 | |
136 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
144 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
137 | static int |
145 | static bool |
138 | compare_ob_value_lists_one (const object *wants, const object *has) |
146 | compare_ob_value_lists_one (const object *wants, const object *has) |
139 | { |
147 | { |
140 | key_value *wants_field; |
148 | key_value *wants_field; |
141 | |
149 | |
142 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
150 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
… | |
… | |
150 | key_value *has_field; |
158 | key_value *has_field; |
151 | |
159 | |
152 | /* Look for a field in has with the same key. */ |
160 | /* Look for a field in has with the same key. */ |
153 | has_field = get_ob_key_link (has, wants_field->key); |
161 | has_field = get_ob_key_link (has, wants_field->key); |
154 | |
162 | |
155 | if (has_field == NULL) |
163 | if (!has_field) |
156 | { |
|
|
157 | /* No field with that name. */ |
164 | return 0; /* No field with that name. */ |
158 | return FALSE; |
|
|
159 | } |
|
|
160 | |
165 | |
161 | /* Found the matching field. */ |
166 | /* Found the matching field. */ |
162 | if (has_field->value != wants_field->value) |
167 | if (has_field->value != wants_field->value) |
163 | { |
|
|
164 | /* Values don't match, so this half of the comparison is false. */ |
168 | return 0; /* Values don't match, so this half of the comparison is false. */ |
165 | return FALSE; |
|
|
166 | } |
|
|
167 | |
169 | |
168 | /* If we get here, we found a match. Now for the next field in wants. */ |
170 | /* If we get here, we found a match. Now for the next field in wants. */ |
169 | } |
171 | } |
170 | |
172 | |
171 | /* If we get here, every field in wants has a matching field in has. */ |
173 | /* If we get here, every field in wants has a matching field in has. */ |
172 | return TRUE; |
174 | return 1; |
173 | } |
175 | } |
174 | |
176 | |
175 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
177 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
176 | static int |
178 | static bool |
177 | compare_ob_value_lists (const object *ob1, const object *ob2) |
179 | compare_ob_value_lists (const object *ob1, const object *ob2) |
178 | { |
180 | { |
179 | /* However, there may be fields in has which aren't partnered in wants, |
181 | /* However, there may be fields in has which aren't partnered in wants, |
180 | * so we need to run the comparison *twice*. :( |
182 | * so we need to run the comparison *twice*. :( |
181 | */ |
183 | */ |
… | |
… | |
202 | || ob1->speed != ob2->speed |
204 | || ob1->speed != ob2->speed |
203 | || ob1->value != ob2->value |
205 | || ob1->value != ob2->value |
204 | || ob1->name != ob2->name) |
206 | || ob1->name != ob2->name) |
205 | return 0; |
207 | return 0; |
206 | |
208 | |
207 | //TODO: this ain't working well, use nicer and correct overflow check |
209 | /* 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 |
210 | * for unsigned overflow (2c), second part checks wether the result |
209 | * value could not be stored in a sint32 (which unfortunately sometimes is |
211 | * would fit into a 32 bit signed int, which is often used to hold |
210 | * used to store nrof). |
212 | * nrof values. |
211 | */ |
213 | */ |
212 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
214 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
213 | return 0; |
215 | return 0; |
214 | |
216 | |
215 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
217 | /* 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 |
218 | * 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 |
219 | * 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 |
220 | * are not equal - just if it has been identified, the been_applied |
219 | * flags lose any meaning. |
221 | * flags lose any meaning. |
220 | */ |
222 | */ |
221 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
223 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
… | |
… | |
249 | || ob1->move_off != ob2->move_off |
251 | || ob1->move_off != ob2->move_off |
250 | || ob1->move_slow != ob2->move_slow |
252 | || ob1->move_slow != ob2->move_slow |
251 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
253 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
252 | return 0; |
254 | return 0; |
253 | |
255 | |
254 | /* This is really a spellbook check - really, we should |
256 | /* This is really a spellbook check - we should in general |
255 | * check all objects in the inventory. |
257 | * not merge objects with real inventories, as splitting them |
|
|
258 | * is hard. |
256 | */ |
259 | */ |
257 | if (ob1->inv || ob2->inv) |
260 | if (ob1->inv || ob2->inv) |
258 | { |
261 | { |
259 | /* if one object has inventory but the other doesn't, not equiv */ |
262 | if (!(ob1->inv && ob2->inv)) |
260 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
263 | return 0; /* inventories differ in length */ |
261 | return 0; |
|
|
262 | |
264 | |
263 | /* Now check to see if the two inventory objects could merge */ |
265 | if (ob1->inv->below || ob2->inv->below) |
|
|
266 | return 0; /* more than one object in inv */ |
|
|
267 | |
264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
268 | if (!object::can_merge (ob1->inv, ob2->inv)) |
265 | return 0; |
269 | return 0; /* inventory objects differ */ |
266 | |
270 | |
267 | /* inventory ok - still need to check rest of this object to see |
271 | /* inventory ok - still need to check rest of this object to see |
268 | * if it is valid. |
272 | * if it is valid. |
269 | */ |
273 | */ |
270 | } |
274 | } |
… | |
… | |
289 | if (ob1->level != ob2->level) |
293 | if (ob1->level != ob2->level) |
290 | return 0; |
294 | return 0; |
291 | break; |
295 | break; |
292 | } |
296 | } |
293 | |
297 | |
294 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
298 | if (ob1->key_values || ob2->key_values) |
295 | { |
299 | { |
296 | /* At least one of these has key_values. */ |
300 | /* At least one of these has key_values. */ |
297 | if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) |
301 | if ((!ob1->key_values) != (!ob2->key_values)) |
298 | /* One has fields, but the other one doesn't. */ |
302 | /* One has fields, but the other one doesn't. */ |
299 | return 0; |
303 | return 0; |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
304 | else if (!compare_ob_value_lists (ob1, ob2)) |
301 | return 0; |
305 | return 0; |
302 | } |
306 | } |
303 | |
307 | |
304 | //TODO: generate an event or call into perl for additional checks |
|
|
305 | if (ob1->self || ob2->self) |
308 | if (ob1->self || ob2->self) |
306 | { |
309 | { |
307 | ob1->optimise (); |
310 | ob1->optimise (); |
308 | ob2->optimise (); |
311 | ob2->optimise (); |
309 | |
312 | |
310 | if (ob1->self || ob2->self) |
313 | if (ob1->self || ob2->self) |
|
|
314 | { |
|
|
315 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
|
|
316 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
|
|
317 | |
|
|
318 | if (k1 != k2) |
311 | return 0; |
319 | return 0; |
|
|
320 | else if (k1 == 0) |
|
|
321 | return 1; |
|
|
322 | else if (!cfperl_can_merge (ob1, ob2)) |
|
|
323 | return 0; |
|
|
324 | } |
312 | } |
325 | } |
313 | |
326 | |
314 | /* Everything passes, must be OK. */ |
327 | /* Everything passes, must be OK. */ |
315 | return 1; |
328 | return 1; |
316 | } |
329 | } |
… | |
… | |
374 | /* |
387 | /* |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
388 | * get_nearest_part(multi-object, object 2) returns the part of the |
376 | * multi-object 1 which is closest to the second object. |
389 | * multi-object 1 which is closest to the second object. |
377 | * If it's not a multi-object, it is returned. |
390 | * If it's not a multi-object, it is returned. |
378 | */ |
391 | */ |
379 | |
|
|
380 | object * |
392 | object * |
381 | get_nearest_part (object *op, const object *pl) |
393 | get_nearest_part (object *op, const object *pl) |
382 | { |
394 | { |
383 | object *tmp, *closest; |
395 | object *tmp, *closest; |
384 | int last_dist, i; |
396 | int last_dist, i; |
… | |
… | |
420 | break; |
432 | break; |
421 | |
433 | |
422 | return op; |
434 | return op; |
423 | } |
435 | } |
424 | |
436 | |
425 | void |
|
|
426 | free_all_object_data () |
|
|
427 | { |
|
|
428 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
429 | } |
|
|
430 | |
|
|
431 | /* |
437 | /* |
432 | * Sets the owner and sets the skill and exp pointers to owner's current |
438 | * Sets the owner and sets the skill and exp pointers to owner's current |
433 | * skill and experience objects. |
439 | * skill and experience objects. |
|
|
440 | * ACTUALLY NO! investigate! TODO |
434 | */ |
441 | */ |
435 | void |
442 | void |
436 | object::set_owner (object *owner) |
443 | object::set_owner (object *owner) |
437 | { |
444 | { |
|
|
445 | // allow objects which own objects |
438 | if (!owner) |
446 | if (owner) |
439 | return; |
|
|
440 | |
|
|
441 | /* next line added to allow objects which own objects */ |
|
|
442 | /* Add a check for ownercounts in here, as I got into an endless loop |
|
|
443 | * with the fireball owning a poison cloud which then owned the |
|
|
444 | * fireball. I believe that was caused by one of the objects getting |
|
|
445 | * freed and then another object replacing it. Since the ownercounts |
|
|
446 | * didn't match, this check is valid and I believe that cause is valid. |
|
|
447 | */ |
|
|
448 | while (owner->owner) |
447 | while (owner->owner) |
449 | owner = owner->owner; |
448 | owner = owner->owner; |
|
|
449 | |
|
|
450 | if (flag [FLAG_FREED]) |
|
|
451 | { |
|
|
452 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
|
|
453 | return; |
|
|
454 | } |
450 | |
455 | |
451 | this->owner = owner; |
456 | this->owner = owner; |
452 | } |
457 | } |
453 | |
458 | |
454 | int |
459 | int |
… | |
… | |
586 | object::copy_to (object *dst) |
591 | object::copy_to (object *dst) |
587 | { |
592 | { |
588 | *dst = *this; |
593 | *dst = *this; |
589 | |
594 | |
590 | if (speed < 0) |
595 | if (speed < 0) |
591 | dst->speed_left = speed_left - rndm (); |
596 | dst->speed_left -= rndm (); |
592 | |
597 | |
593 | dst->set_speed (dst->speed); |
598 | dst->set_speed (dst->speed); |
594 | } |
599 | } |
595 | |
600 | |
596 | void |
601 | void |
597 | object::instantiate () |
602 | object::instantiate () |
598 | { |
603 | { |
599 | if (!uuid.seq) // HACK |
604 | if (!uuid.seq) // HACK |
600 | uuid = gen_uuid (); |
605 | uuid = UUID::gen (); |
601 | |
606 | |
602 | speed_left = -0.1f; |
607 | speed_left = -0.1f; |
603 | /* copy the body_info to the body_used - this is only really |
608 | /* copy the body_info to the body_used - this is only really |
604 | * need for monsters, but doesn't hurt to do it for everything. |
609 | * need for monsters, but doesn't hurt to do it for everything. |
605 | * by doing so, when a monster is created, it has good starting |
610 | * by doing so, when a monster is created, it has good starting |
… | |
… | |
764 | static int object_count; |
769 | static int object_count; |
765 | |
770 | |
766 | void object::link () |
771 | void object::link () |
767 | { |
772 | { |
768 | assert (!index);//D |
773 | assert (!index);//D |
769 | uuid = gen_uuid (); |
774 | uuid = UUID::gen (); |
770 | count = ++object_count; |
775 | count = ++object_count; |
771 | |
776 | |
772 | refcnt_inc (); |
777 | refcnt_inc (); |
773 | objects.insert (this); |
778 | objects.insert (this); |
774 | } |
779 | } |
… | |
… | |
923 | |
928 | |
924 | if (!freed_map) |
929 | if (!freed_map) |
925 | { |
930 | { |
926 | freed_map = new maptile; |
931 | freed_map = new maptile; |
927 | |
932 | |
|
|
933 | freed_map->path = "<freed objects map>"; |
928 | freed_map->name = "/internal/freed_objects_map"; |
934 | freed_map->name = "/internal/freed_objects_map"; |
929 | freed_map->width = 3; |
935 | freed_map->width = 3; |
930 | freed_map->height = 3; |
936 | freed_map->height = 3; |
|
|
937 | freed_map->nodrop = 1; |
931 | |
938 | |
932 | freed_map->alloc (); |
939 | freed_map->alloc (); |
933 | freed_map->in_memory = MAP_IN_MEMORY; |
940 | freed_map->in_memory = MAP_IN_MEMORY; |
934 | } |
941 | } |
935 | |
942 | |
… | |
… | |
959 | if (destroyed ()) |
966 | if (destroyed ()) |
960 | return; |
967 | return; |
961 | |
968 | |
962 | if (destroy_inventory) |
969 | if (destroy_inventory) |
963 | destroy_inv (false); |
970 | destroy_inv (false); |
|
|
971 | |
|
|
972 | if (is_head ()) |
|
|
973 | if (sound_destroy) |
|
|
974 | play_sound (sound_destroy); |
|
|
975 | else if (flag [FLAG_MONSTER]) |
|
|
976 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
964 | |
977 | |
965 | attachable::destroy (); |
978 | attachable::destroy (); |
966 | } |
979 | } |
967 | |
980 | |
968 | /* |
981 | /* |
… | |
… | |
1083 | if (map->in_memory == MAP_SAVING) |
1096 | if (map->in_memory == MAP_SAVING) |
1084 | return; |
1097 | return; |
1085 | |
1098 | |
1086 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1099 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1087 | |
1100 | |
|
|
1101 | if (object *pl = ms.player ()) |
|
|
1102 | { |
|
|
1103 | if (pl->container == this) |
|
|
1104 | /* If a container that the player is currently using somehow gets |
|
|
1105 | * removed (most likely destroyed), update the player view |
|
|
1106 | * appropriately. |
|
|
1107 | */ |
|
|
1108 | pl->close_container (); |
|
|
1109 | |
|
|
1110 | pl->contr->ns->floorbox_update (); |
|
|
1111 | } |
|
|
1112 | |
1088 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1113 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1089 | { |
1114 | { |
1090 | /* No point updating the players look faces if he is the object |
1115 | /* No point updating the players look faces if he is the object |
1091 | * being removed. |
1116 | * being removed. |
1092 | */ |
1117 | */ |
1093 | |
|
|
1094 | if (tmp->type == PLAYER && tmp != this) |
|
|
1095 | { |
|
|
1096 | /* If a container that the player is currently using somehow gets |
|
|
1097 | * removed (most likely destroyed), update the player view |
|
|
1098 | * appropriately. |
|
|
1099 | */ |
|
|
1100 | if (tmp->container == this) |
|
|
1101 | { |
|
|
1102 | flag [FLAG_APPLIED] = 0; |
|
|
1103 | tmp->container = 0; |
|
|
1104 | } |
|
|
1105 | |
|
|
1106 | if (tmp->contr->ns) |
|
|
1107 | tmp->contr->ns->floorbox_update (); |
|
|
1108 | } |
|
|
1109 | |
1118 | |
1110 | /* See if object moving off should effect something */ |
1119 | /* See if object moving off should effect something */ |
1111 | if (check_walk_off |
1120 | if (check_walk_off |
1112 | && ((move_type & tmp->move_off) |
1121 | && ((move_type & tmp->move_off) |
1113 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1122 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
… | |
… | |
1145 | merge_ob (object *op, object *top) |
1154 | merge_ob (object *op, object *top) |
1146 | { |
1155 | { |
1147 | if (!op->nrof) |
1156 | if (!op->nrof) |
1148 | return 0; |
1157 | return 0; |
1149 | |
1158 | |
1150 | if (top) |
1159 | if (!top) |
1151 | for (top = op; top && top->above; top = top->above) |
1160 | for (top = op; top && top->above; top = top->above) |
1152 | ; |
1161 | ; |
1153 | |
1162 | |
1154 | for (; top; top = top->below) |
1163 | for (; top; top = top->below) |
1155 | { |
1164 | { |
… | |
… | |
1236 | |
1245 | |
1237 | object *top, *floor = NULL; |
1246 | object *top, *floor = NULL; |
1238 | |
1247 | |
1239 | op->remove (); |
1248 | op->remove (); |
1240 | |
1249 | |
1241 | #if 0 |
|
|
1242 | if (!m->active != !op->active) |
|
|
1243 | if (m->active) |
|
|
1244 | op->activate_recursive (); |
|
|
1245 | else |
|
|
1246 | op->deactivate_recursive (); |
|
|
1247 | #endif |
|
|
1248 | |
|
|
1249 | if (out_of_map (m, op->x, op->y)) |
|
|
1250 | { |
|
|
1251 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
|
|
1252 | #ifdef MANY_CORES |
|
|
1253 | /* Better to catch this here, as otherwise the next use of this object |
|
|
1254 | * is likely to cause a crash. Better to find out where it is getting |
|
|
1255 | * improperly inserted. |
|
|
1256 | */ |
|
|
1257 | abort (); |
|
|
1258 | #endif |
|
|
1259 | return op; |
|
|
1260 | } |
|
|
1261 | |
|
|
1262 | if (object *more = op->more) |
|
|
1263 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1264 | return 0; |
|
|
1265 | |
|
|
1266 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1267 | |
|
|
1268 | /* Ideally, the caller figures this out. However, it complicates a lot |
1250 | /* Ideally, the caller figures this out. However, it complicates a lot |
1269 | * of areas of callers (eg, anything that uses find_free_spot would now |
1251 | * of areas of callers (eg, anything that uses find_free_spot would now |
1270 | * need extra work |
1252 | * need extra work |
1271 | */ |
1253 | */ |
1272 | if (!xy_normalise (m, op->x, op->y)) |
1254 | if (!xy_normalise (m, op->x, op->y)) |
|
|
1255 | { |
|
|
1256 | op->destroy (); |
1273 | return 0; |
1257 | return 0; |
|
|
1258 | } |
|
|
1259 | |
|
|
1260 | if (object *more = op->more) |
|
|
1261 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1262 | return 0; |
|
|
1263 | |
|
|
1264 | CLEAR_FLAG (op, FLAG_REMOVED); |
1274 | |
1265 | |
1275 | op->map = m; |
1266 | op->map = m; |
1276 | mapspace &ms = op->ms (); |
1267 | mapspace &ms = op->ms (); |
1277 | |
1268 | |
1278 | /* this has to be done after we translate the coordinates. |
1269 | /* this has to be done after we translate the coordinates. |
… | |
… | |
1313 | else |
1304 | else |
1314 | { |
1305 | { |
1315 | top = ms.bot; |
1306 | top = ms.bot; |
1316 | |
1307 | |
1317 | /* If there are other objects, then */ |
1308 | /* If there are other objects, then */ |
1318 | if ((!(flag & INS_MAP_LOAD)) && top) |
1309 | if (top) |
1319 | { |
1310 | { |
1320 | object *last = 0; |
1311 | object *last = 0; |
1321 | |
1312 | |
1322 | /* |
1313 | /* |
1323 | * If there are multiple objects on this space, we do some trickier handling. |
1314 | * If there are multiple objects on this space, we do some trickier handling. |
… | |
… | |
1376 | if (last && last->below && last != floor) |
1367 | if (last && last->below && last != floor) |
1377 | top = last->below; |
1368 | top = last->below; |
1378 | } |
1369 | } |
1379 | } /* If objects on this space */ |
1370 | } /* If objects on this space */ |
1380 | |
1371 | |
1381 | if (flag & INS_MAP_LOAD) |
|
|
1382 | top = ms.top; |
|
|
1383 | |
|
|
1384 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1372 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1385 | top = floor; |
1373 | top = floor; |
1386 | |
1374 | |
1387 | /* Top is the object that our object (op) is going to get inserted above. |
1375 | /* Top is the object that our object (op) is going to get inserted above. |
1388 | */ |
1376 | */ |
… | |
… | |
1420 | op->map->touch (); |
1408 | op->map->touch (); |
1421 | } |
1409 | } |
1422 | |
1410 | |
1423 | op->map->dirty = true; |
1411 | op->map->dirty = true; |
1424 | |
1412 | |
1425 | /* If we have a floor, we know the player, if any, will be above |
|
|
1426 | * it, so save a few ticks and start from there. |
|
|
1427 | */ |
|
|
1428 | if (!(flag & INS_MAP_LOAD)) |
|
|
1429 | if (object *pl = ms.player ()) |
1413 | if (object *pl = ms.player ()) |
1430 | if (pl->contr->ns) |
|
|
1431 | pl->contr->ns->floorbox_update (); |
1414 | pl->contr->ns->floorbox_update (); |
1432 | |
1415 | |
1433 | /* If this object glows, it may affect lighting conditions that are |
1416 | /* If this object glows, it may affect lighting conditions that are |
1434 | * visible to others on this map. But update_all_los is really |
1417 | * visible to others on this map. But update_all_los is really |
1435 | * an inefficient way to do this, as it means los for all players |
1418 | * an inefficient way to do this, as it means los for all players |
1436 | * on the map will get recalculated. The players could very well |
1419 | * on the map will get recalculated. The players could very well |
… | |
… | |
1496 | } |
1479 | } |
1497 | |
1480 | |
1498 | object * |
1481 | object * |
1499 | object::insert_at (object *where, object *originator, int flags) |
1482 | object::insert_at (object *where, object *originator, int flags) |
1500 | { |
1483 | { |
|
|
1484 | if (where->env) |
|
|
1485 | return where->env->insert (this); |
|
|
1486 | else |
1501 | return where->map->insert (this, where->x, where->y, originator, flags); |
1487 | return where->map->insert (this, where->x, where->y, originator, flags); |
1502 | } |
1488 | } |
1503 | |
1489 | |
1504 | /* |
1490 | /* |
1505 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1491 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1506 | * is returned contains nr objects, and the remaining parts contains |
1492 | * is returned contains nr objects, and the remaining parts contains |
… | |
… | |
1674 | * be != op, if items are merged. -Tero |
1660 | * be != op, if items are merged. -Tero |
1675 | */ |
1661 | */ |
1676 | object * |
1662 | object * |
1677 | object::insert (object *op) |
1663 | object::insert (object *op) |
1678 | { |
1664 | { |
1679 | object *tmp, *otmp; |
|
|
1680 | |
|
|
1681 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1665 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
1682 | op->remove (); |
1666 | op->remove (); |
1683 | |
1667 | |
1684 | if (op->more) |
1668 | if (op->more) |
1685 | { |
1669 | { |
… | |
… | |
1687 | return op; |
1671 | return op; |
1688 | } |
1672 | } |
1689 | |
1673 | |
1690 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1674 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1691 | CLEAR_FLAG (op, FLAG_REMOVED); |
1675 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1676 | |
1692 | if (op->nrof) |
1677 | if (op->nrof) |
1693 | { |
1678 | { |
1694 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1679 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1695 | if (object::can_merge (tmp, op)) |
1680 | if (object::can_merge (tmp, op)) |
1696 | { |
1681 | { |
1697 | /* return the original object and remove inserted object |
1682 | /* return the original object and remove inserted object |
1698 | (client needs the original object) */ |
1683 | (client needs the original object) */ |
1699 | tmp->nrof += op->nrof; |
1684 | tmp->nrof += op->nrof; |
… | |
… | |
1718 | add_weight (this, op->weight * op->nrof); |
1703 | add_weight (this, op->weight * op->nrof); |
1719 | } |
1704 | } |
1720 | else |
1705 | else |
1721 | add_weight (this, (op->weight + op->carrying)); |
1706 | add_weight (this, (op->weight + op->carrying)); |
1722 | |
1707 | |
1723 | otmp = this->in_player (); |
1708 | if (object *otmp = this->in_player ()) |
1724 | if (otmp && otmp->contr) |
|
|
1725 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1709 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1726 | otmp->update_stats (); |
1710 | otmp->update_stats (); |
1727 | |
1711 | |
|
|
1712 | op->owner = 0; // its his/hers now. period. |
1728 | op->map = 0; |
1713 | op->map = 0; |
1729 | op->env = this; |
1714 | op->env = this; |
1730 | op->above = 0; |
1715 | op->above = 0; |
1731 | op->below = 0; |
1716 | op->below = 0; |
1732 | op->x = 0, op->y = 0; |
1717 | op->x = op->y = 0; |
1733 | |
1718 | |
1734 | /* reset the light list and los of the players on the map */ |
1719 | /* reset the light list and los of the players on the map */ |
1735 | if ((op->glow_radius != 0) && map) |
1720 | if (op->glow_radius && map) |
1736 | { |
1721 | { |
1737 | #ifdef DEBUG_LIGHTS |
1722 | #ifdef DEBUG_LIGHTS |
1738 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1723 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
1739 | #endif /* DEBUG_LIGHTS */ |
1724 | #endif /* DEBUG_LIGHTS */ |
1740 | if (map->darkness) |
1725 | if (map->darkness) |
… | |
… | |
1974 | * activate recursively a flag on an object inventory |
1959 | * activate recursively a flag on an object inventory |
1975 | */ |
1960 | */ |
1976 | void |
1961 | void |
1977 | flag_inv (object *op, int flag) |
1962 | flag_inv (object *op, int flag) |
1978 | { |
1963 | { |
1979 | if (op->inv) |
|
|
1980 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1964 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1981 | { |
1965 | { |
1982 | SET_FLAG (tmp, flag); |
1966 | SET_FLAG (tmp, flag); |
1983 | flag_inv (tmp, flag); |
1967 | flag_inv (tmp, flag); |
1984 | } |
1968 | } |
1985 | } |
1969 | } |
1986 | |
1970 | |
1987 | /* |
1971 | /* |
1988 | * deactivate recursively a flag on an object inventory |
1972 | * deactivate recursively a flag on an object inventory |
1989 | */ |
1973 | */ |
1990 | void |
1974 | void |
1991 | unflag_inv (object *op, int flag) |
1975 | unflag_inv (object *op, int flag) |
1992 | { |
1976 | { |
1993 | if (op->inv) |
|
|
1994 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1977 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1995 | { |
1978 | { |
1996 | CLEAR_FLAG (tmp, flag); |
1979 | CLEAR_FLAG (tmp, flag); |
1997 | unflag_inv (tmp, flag); |
1980 | unflag_inv (tmp, flag); |
1998 | } |
1981 | } |
1999 | } |
1982 | } |
2000 | |
1983 | |
2001 | /* |
1984 | /* |
2002 | * find_free_spot(object, map, x, y, start, stop) will search for |
1985 | * find_free_spot(object, map, x, y, start, stop) will search for |
2003 | * a spot at the given map and coordinates which will be able to contain |
1986 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
2005 | * to search (see the freearr_x/y[] definition). |
1988 | * to search (see the freearr_x/y[] definition). |
2006 | * It returns a random choice among the alternatives found. |
1989 | * It returns a random choice among the alternatives found. |
2007 | * start and stop are where to start relative to the free_arr array (1,9 |
1990 | * start and stop are where to start relative to the free_arr array (1,9 |
2008 | * does all 4 immediate directions). This returns the index into the |
1991 | * does all 4 immediate directions). This returns the index into the |
2009 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1992 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
2010 | * Note - this only checks to see if there is space for the head of the |
|
|
2011 | * object - if it is a multispace object, this should be called for all |
|
|
2012 | * pieces. |
|
|
2013 | * Note2: This function does correctly handle tiled maps, but does not |
1993 | * Note: This function does correctly handle tiled maps, but does not |
2014 | * inform the caller. However, insert_ob_in_map will update as |
1994 | * inform the caller. However, insert_ob_in_map will update as |
2015 | * necessary, so the caller shouldn't need to do any special work. |
1995 | * necessary, so the caller shouldn't need to do any special work. |
2016 | * Note - updated to take an object instead of archetype - this is necessary |
1996 | * Note - updated to take an object instead of archetype - this is necessary |
2017 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1997 | * because arch_blocked (now ob_blocked) needs to know the movement type |
2018 | * to know if the space in question will block the object. We can't use |
1998 | * to know if the space in question will block the object. We can't use |
… | |
… | |
2020 | * customized, changed states, etc. |
2000 | * customized, changed states, etc. |
2021 | */ |
2001 | */ |
2022 | int |
2002 | int |
2023 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2003 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2024 | { |
2004 | { |
|
|
2005 | int altern[SIZEOFFREE]; |
2025 | int index = 0, flag; |
2006 | int index = 0, flag; |
2026 | int altern[SIZEOFFREE]; |
|
|
2027 | |
2007 | |
2028 | for (int i = start; i < stop; i++) |
2008 | for (int i = start; i < stop; i++) |
2029 | { |
2009 | { |
2030 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
2010 | mapxy pos (m, x, y); pos.move (i); |
2031 | if (!flag) |
2011 | |
|
|
2012 | if (!pos.normalise ()) |
|
|
2013 | continue; |
|
|
2014 | |
|
|
2015 | mapspace &ms = *pos; |
|
|
2016 | |
|
|
2017 | if (ms.flags () & P_IS_ALIVE) |
|
|
2018 | continue; |
|
|
2019 | |
|
|
2020 | /* However, often |
|
|
2021 | * ob doesn't have any move type (when used to place exits) |
|
|
2022 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
2023 | */ |
|
|
2024 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
2025 | { |
2032 | altern [index++] = i; |
2026 | altern [index++] = i; |
|
|
2027 | continue; |
|
|
2028 | } |
2033 | |
2029 | |
2034 | /* Basically, if we find a wall on a space, we cut down the search size. |
2030 | /* Basically, if we find a wall on a space, we cut down the search size. |
2035 | * In this way, we won't return spaces that are on another side of a wall. |
2031 | * In this way, we won't return spaces that are on another side of a wall. |
2036 | * This mostly work, but it cuts down the search size in all directions - |
2032 | * This mostly work, but it cuts down the search size in all directions - |
2037 | * if the space being examined only has a wall to the north and empty |
2033 | * if the space being examined only has a wall to the north and empty |
2038 | * spaces in all the other directions, this will reduce the search space |
2034 | * spaces in all the other directions, this will reduce the search space |
2039 | * to only the spaces immediately surrounding the target area, and |
2035 | * to only the spaces immediately surrounding the target area, and |
2040 | * won't look 2 spaces south of the target space. |
2036 | * won't look 2 spaces south of the target space. |
2041 | */ |
2037 | */ |
2042 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
2038 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
2039 | { |
2043 | stop = maxfree[i]; |
2040 | stop = maxfree[i]; |
|
|
2041 | continue; |
|
|
2042 | } |
|
|
2043 | |
|
|
2044 | /* Note it is intentional that we check ob - the movement type of the |
|
|
2045 | * head of the object should correspond for the entire object. |
|
|
2046 | */ |
|
|
2047 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
2048 | continue; |
|
|
2049 | |
|
|
2050 | if (ob->blocked (m, pos.x, pos.y)) |
|
|
2051 | continue; |
|
|
2052 | |
|
|
2053 | altern [index++] = i; |
2044 | } |
2054 | } |
2045 | |
2055 | |
2046 | if (!index) |
2056 | if (!index) |
2047 | return -1; |
2057 | return -1; |
2048 | |
2058 | |
… | |
… | |
2057 | */ |
2067 | */ |
2058 | int |
2068 | int |
2059 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2069 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2060 | { |
2070 | { |
2061 | for (int i = 0; i < SIZEOFFREE; i++) |
2071 | for (int i = 0; i < SIZEOFFREE; i++) |
2062 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2072 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2063 | return i; |
2073 | return i; |
2064 | |
2074 | |
2065 | return -1; |
2075 | return -1; |
2066 | } |
2076 | } |
2067 | |
2077 | |
… | |
… | |
2344 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2354 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2345 | * core dumps if they do. |
2355 | * core dumps if they do. |
2346 | * |
2356 | * |
2347 | * Add a check so we can't pick up invisible objects (0.93.8) |
2357 | * Add a check so we can't pick up invisible objects (0.93.8) |
2348 | */ |
2358 | */ |
2349 | |
|
|
2350 | int |
2359 | int |
2351 | can_pick (const object *who, const object *item) |
2360 | can_pick (const object *who, const object *item) |
2352 | { |
2361 | { |
2353 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2362 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2354 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2363 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
… | |
… | |
2605 | { |
2614 | { |
2606 | char flagdesc[512]; |
2615 | char flagdesc[512]; |
2607 | char info2[256 * 4]; |
2616 | char info2[256 * 4]; |
2608 | char *p = info; |
2617 | char *p = info; |
2609 | |
2618 | |
2610 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2619 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2611 | count, uuid.seq, |
2620 | count, |
|
|
2621 | uuid.c_str (), |
2612 | &name, |
2622 | &name, |
2613 | title ? "\",title:\"" : "", |
2623 | title ? "\",title:\"" : "", |
2614 | title ? (const char *)title : "", |
2624 | title ? (const char *)title : "", |
2615 | flag_desc (flagdesc, 512), type); |
2625 | flag_desc (flagdesc, 512), type); |
2616 | |
2626 | |
2617 | if (env) |
2627 | if (!this->flag[FLAG_REMOVED] && env) |
2618 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2628 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2619 | |
2629 | |
2620 | if (map) |
2630 | if (map) |
2621 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2631 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2622 | |
2632 | |
… | |
… | |
2640 | } |
2650 | } |
2641 | |
2651 | |
2642 | const materialtype_t * |
2652 | const materialtype_t * |
2643 | object::dominant_material () const |
2653 | object::dominant_material () const |
2644 | { |
2654 | { |
2645 | if (materialtype_t *mat = name_to_material (materialname)) |
2655 | if (materialtype_t *mt = name_to_material (materialname)) |
2646 | return mat; |
2656 | return mt; |
2647 | |
2657 | |
2648 | // omfg this is slow, this has to be temporary :) |
|
|
2649 | shstr unknown ("unknown"); |
|
|
2650 | |
|
|
2651 | return name_to_material (unknown); |
2658 | return name_to_material (shstr_unknown); |
2652 | } |
2659 | } |
2653 | |
2660 | |
2654 | void |
2661 | void |
2655 | object::open_container (object *new_container) |
2662 | object::open_container (object *new_container) |
2656 | { |
2663 | { |
… | |
… | |
2672 | old_container->flag [FLAG_APPLIED] = 0; |
2679 | old_container->flag [FLAG_APPLIED] = 0; |
2673 | container = 0; |
2680 | container = 0; |
2674 | |
2681 | |
2675 | esrv_update_item (UPD_FLAGS, this, old_container); |
2682 | esrv_update_item (UPD_FLAGS, this, old_container); |
2676 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2683 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2684 | play_sound (sound_find ("chest_close")); |
2677 | } |
2685 | } |
2678 | |
2686 | |
2679 | if (new_container) |
2687 | if (new_container) |
2680 | { |
2688 | { |
2681 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
2689 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
… | |
… | |
2697 | new_container->flag [FLAG_APPLIED] = 1; |
2705 | new_container->flag [FLAG_APPLIED] = 1; |
2698 | container = new_container; |
2706 | container = new_container; |
2699 | |
2707 | |
2700 | esrv_update_item (UPD_FLAGS, this, new_container); |
2708 | esrv_update_item (UPD_FLAGS, this, new_container); |
2701 | esrv_send_inventory (this, new_container); |
2709 | esrv_send_inventory (this, new_container); |
|
|
2710 | play_sound (sound_find ("chest_open")); |
|
|
2711 | } |
|
|
2712 | } |
|
|
2713 | |
|
|
2714 | object * |
|
|
2715 | object::force_find (const shstr name) |
|
|
2716 | { |
|
|
2717 | /* cycle through his inventory to look for the MARK we want to |
|
|
2718 | * place |
|
|
2719 | */ |
|
|
2720 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2721 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2722 | return splay (tmp); |
|
|
2723 | |
|
|
2724 | return 0; |
|
|
2725 | } |
|
|
2726 | |
|
|
2727 | void |
|
|
2728 | object::force_add (const shstr name, int duration) |
|
|
2729 | { |
|
|
2730 | if (object *force = force_find (name)) |
|
|
2731 | force->destroy (); |
|
|
2732 | |
|
|
2733 | object *force = get_archetype (FORCE_NAME); |
|
|
2734 | |
|
|
2735 | force->slaying = name; |
|
|
2736 | force->stats.food = 1; |
|
|
2737 | force->speed_left = -1.f; |
|
|
2738 | |
|
|
2739 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2740 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2741 | force->flag [FLAG_APPLIED] = true; |
|
|
2742 | |
|
|
2743 | insert (force); |
|
|
2744 | } |
|
|
2745 | |
|
|
2746 | void |
|
|
2747 | object::play_sound (faceidx sound) const |
|
|
2748 | { |
|
|
2749 | if (!sound) |
|
|
2750 | return; |
|
|
2751 | |
|
|
2752 | if (flag [FLAG_REMOVED]) |
|
|
2753 | return; |
|
|
2754 | |
|
|
2755 | if (env) |
2702 | } |
2756 | { |
|
|
2757 | if (object *pl = in_player ()) |
|
|
2758 | pl->contr->play_sound (sound); |
|
|
2759 | } |
|
|
2760 | else |
|
|
2761 | map->play_sound (sound, x, y); |
2703 | } |
2762 | } |
2704 | |
2763 | |
2705 | |
|
|