1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | |
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | (at your option) any later version. |
11 | * (at your option) any later version. |
11 | |
12 | * |
12 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
18 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
20 | |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
21 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
|
|
22 | */ |
22 | */ |
23 | |
23 | |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
|
|
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> |
32 | #include <funcpoint.h> |
29 | #include <sproto.h> |
33 | #include <loader.h> |
30 | #include <loader.h> |
34 | |
31 | |
35 | #include <bitset> |
32 | #include <bitset> |
36 | |
33 | |
37 | int nrofallocobjects = 0; |
34 | UUID UUID::cur; |
38 | static UUID uuid; |
35 | static uint64_t seq_next_save; |
39 | const uint64 UUID_SKIP = 1<<19; |
36 | static const uint64 UUID_GAP = 1<<19; |
40 | |
37 | |
41 | object *active_objects; /* List of active objects that need to be processed */ |
38 | objectvec objects; |
|
|
39 | activevec actives; |
42 | |
40 | |
43 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
41 | short freearr_x[SIZEOFFREE] = { |
|
|
42 | 0, |
|
|
43 | 0, 1, 1, 1, 0, -1, -1, -1, |
|
|
44 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
44 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
45 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
45 | }; |
46 | }; |
46 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
47 | short freearr_y[SIZEOFFREE] = { |
|
|
48 | 0, |
|
|
49 | -1, -1, 0, 1, 1, 1, 0, -1, |
|
|
50 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
47 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
51 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
48 | }; |
52 | }; |
49 | int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, |
53 | int maxfree[SIZEOFFREE] = { |
|
|
54 | 0, |
|
|
55 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
56 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
50 | 48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
57 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
51 | }; |
58 | }; |
52 | int freedir[SIZEOFFREE] = { |
59 | int freedir[SIZEOFFREE] = { |
53 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
60 | 0, |
|
|
61 | 1, 2, 3, 4, 5, 6, 7, 8, |
|
|
62 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
54 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
63 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
55 | }; |
64 | }; |
56 | |
65 | |
57 | static void |
66 | static void |
58 | write_uuid (void) |
67 | write_uuid (uval64 skip, bool sync) |
59 | { |
68 | { |
60 | char filename1[MAX_BUF], filename2[MAX_BUF]; |
69 | CALL_BEGIN (2); |
61 | |
70 | CALL_ARG_SV (newSVval64 (skip)); |
62 | sprintf (filename1, "%s/uuid", settings.localdir); |
71 | CALL_ARG_SV (boolSV (sync)); |
63 | sprintf (filename2, "%s/uuid~", settings.localdir); |
72 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
64 | |
73 | CALL_END; |
65 | FILE *fp; |
|
|
66 | |
|
|
67 | if (!(fp = fopen (filename2, "w"))) |
|
|
68 | { |
|
|
69 | LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); |
|
|
70 | return; |
|
|
71 | } |
|
|
72 | |
|
|
73 | fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2); |
|
|
74 | fclose (fp); |
|
|
75 | rename (filename2, filename1); |
|
|
76 | } |
74 | } |
77 | |
75 | |
78 | static void |
76 | static void |
79 | read_uuid (void) |
77 | read_uuid (void) |
80 | { |
78 | { |
81 | char filename[MAX_BUF]; |
79 | char filename[MAX_BUF]; |
82 | |
80 | |
83 | sprintf (filename, "%s/uuid", settings.localdir); |
81 | sprintf (filename, "%s/uuid", settings.localdir); |
|
|
82 | |
|
|
83 | seq_next_save = 0; |
84 | |
84 | |
85 | FILE *fp; |
85 | FILE *fp; |
86 | |
86 | |
87 | if (!(fp = fopen (filename, "r"))) |
87 | if (!(fp = fopen (filename, "r"))) |
88 | { |
88 | { |
89 | if (errno == ENOENT) |
89 | if (errno == ENOENT) |
90 | { |
90 | { |
91 | LOG (llevInfo, "RESET uid to 1\n"); |
91 | LOG (llevInfo, "RESET uid to 1\n"); |
92 | uuid.seq = 0; |
92 | UUID::cur.seq = 0; |
93 | write_uuid (); |
93 | write_uuid (UUID_GAP, true); |
94 | return; |
94 | return; |
95 | } |
95 | } |
96 | |
96 | |
97 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
97 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
98 | _exit (1); |
98 | _exit (1); |
99 | } |
99 | } |
100 | |
100 | |
101 | int version; |
101 | UUID::BUF buf; |
102 | unsigned long long uid; |
102 | buf[0] = 0; |
103 | if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1) |
103 | fgets (buf, sizeof (buf), fp); |
|
|
104 | |
|
|
105 | if (!UUID::cur.parse (buf)) |
104 | { |
106 | { |
105 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
107 | LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf); |
106 | _exit (1); |
108 | _exit (1); |
107 | } |
109 | } |
108 | |
110 | |
109 | uuid.seq = uid; |
111 | LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ()); |
110 | write_uuid (); |
112 | |
111 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
113 | write_uuid (UUID_GAP, true); |
112 | fclose (fp); |
114 | fclose (fp); |
113 | } |
115 | } |
114 | |
116 | |
115 | UUID |
117 | UUID |
116 | gen_uuid () |
118 | UUID::gen () |
117 | { |
119 | { |
118 | UUID uid; |
120 | UUID uid; |
119 | |
121 | |
120 | uid.seq = ++uuid.seq; |
122 | uid.seq = ++cur.seq; |
121 | |
123 | |
122 | if (!(uuid.seq & (UUID_SKIP - 1))) |
124 | if (expect_false (cur.seq >= seq_next_save)) |
123 | write_uuid (); |
125 | { |
|
|
126 | seq_next_save = UUID::cur.seq + (UUID_GAP >> 1); |
|
|
127 | write_uuid (UUID_GAP, false); |
|
|
128 | } |
|
|
129 | |
124 | |
130 | |
125 | return uid; |
131 | return uid; |
126 | } |
132 | } |
127 | |
133 | |
128 | void |
134 | void |
129 | init_uuid () |
135 | UUID::init () |
130 | { |
136 | { |
131 | read_uuid (); |
137 | read_uuid (); |
132 | } |
138 | } |
133 | |
139 | |
134 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
140 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
135 | static int |
141 | static bool |
136 | compare_ob_value_lists_one (const object *wants, const object *has) |
142 | compare_ob_value_lists_one (const object *wants, const object *has) |
137 | { |
143 | { |
138 | key_value *wants_field; |
|
|
139 | |
|
|
140 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
144 | /* n-squared behaviour (see kv_get), but I'm hoping both |
141 | * objects with lists are rare, and lists stay short. If not, use a |
145 | * objects with lists are rare, and lists stay short. If not, use a |
142 | * different structure or at least keep the lists sorted... |
146 | * different structure or at least keep the lists sorted... |
143 | */ |
147 | */ |
144 | |
148 | |
145 | /* For each field in wants, */ |
149 | /* For each field in wants, */ |
146 | for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next) |
150 | for (key_value *kv = wants->key_values; kv; kv = kv->next) |
147 | { |
151 | if (has->kv_get (kv->key) != kv->value) |
148 | key_value *has_field; |
152 | return false; |
149 | |
|
|
150 | /* Look for a field in has with the same key. */ |
|
|
151 | has_field = get_ob_key_link (has, wants_field->key); |
|
|
152 | |
|
|
153 | if (has_field == NULL) |
|
|
154 | { |
|
|
155 | /* No field with that name. */ |
|
|
156 | return FALSE; |
|
|
157 | } |
|
|
158 | |
|
|
159 | /* Found the matching field. */ |
|
|
160 | if (has_field->value != wants_field->value) |
|
|
161 | { |
|
|
162 | /* Values don't match, so this half of the comparison is false. */ |
|
|
163 | return FALSE; |
|
|
164 | } |
|
|
165 | |
|
|
166 | /* If we get here, we found a match. Now for the next field in wants. */ |
|
|
167 | } |
|
|
168 | |
153 | |
169 | /* If we get here, every field in wants has a matching field in has. */ |
154 | /* If we get here, every field in wants has a matching field in has. */ |
170 | return TRUE; |
155 | return true; |
171 | } |
156 | } |
172 | |
157 | |
173 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
158 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
174 | static int |
159 | static bool |
175 | compare_ob_value_lists (const object *ob1, const object *ob2) |
160 | compare_ob_value_lists (const object *ob1, const object *ob2) |
176 | { |
161 | { |
177 | /* However, there may be fields in has which aren't partnered in wants, |
162 | /* However, there may be fields in has which aren't partnered in wants, |
178 | * so we need to run the comparison *twice*. :( |
163 | * so we need to run the comparison *twice*. :( |
179 | */ |
164 | */ |
180 | return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1); |
165 | return compare_ob_value_lists_one (ob1, ob2) |
|
|
166 | && compare_ob_value_lists_one (ob2, ob1); |
181 | } |
167 | } |
182 | |
168 | |
183 | /* Function examines the 2 objects given to it, and returns true if |
169 | /* Function examines the 2 objects given to it, and returns true if |
184 | * they can be merged together. |
170 | * they can be merged together. |
185 | * |
171 | * |
… | |
… | |
200 | || ob1->speed != ob2->speed |
186 | || ob1->speed != ob2->speed |
201 | || ob1->value != ob2->value |
187 | || ob1->value != ob2->value |
202 | || ob1->name != ob2->name) |
188 | || ob1->name != ob2->name) |
203 | return 0; |
189 | return 0; |
204 | |
190 | |
205 | //TODO: this ain't working well, use nicer and correct overflow check |
191 | /* Do not merge objects if nrof would overflow. First part checks |
206 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
192 | * for unsigned overflow (2c), second part checks whether the result |
207 | * value could not be stored in a sint32 (which unfortunately sometimes is |
193 | * would fit into a 32 bit signed int, which is often used to hold |
208 | * used to store nrof). |
194 | * nrof values. |
209 | */ |
195 | */ |
210 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
196 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
211 | return 0; |
197 | return 0; |
212 | |
198 | |
213 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
199 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
214 | * This is to the comparison of the flags below will be OK. We |
200 | * This is to the comparison of the flags below will be OK. We |
215 | * just can't ignore the been applied or identified flags, as they |
201 | * just can't ignore the been applied or identified flags, as they |
216 | * are not equal - just if it has been identified, the been_applied |
202 | * are not equal - just if it has been identified, the been_applied |
217 | * flags lose any meaning. |
203 | * flags lose any meaning. |
218 | */ |
204 | */ |
219 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
205 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
220 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
206 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
221 | |
207 | |
222 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
208 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
223 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
209 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
224 | |
210 | |
225 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
211 | if (ob1->arch->name != ob2->arch->name |
226 | || ob1->arch != ob2->arch |
|
|
227 | || ob1->name != ob2->name |
212 | || ob1->name != ob2->name |
228 | || ob1->title != ob2->title |
213 | || ob1->title != ob2->title |
229 | || ob1->msg != ob2->msg |
214 | || ob1->msg != ob2->msg |
230 | || ob1->weight != ob2->weight |
215 | || ob1->weight != ob2->weight |
231 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
232 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) ) |
|
|
233 | || ob1->attacktype != ob2->attacktype |
216 | || ob1->attacktype != ob2->attacktype |
234 | || ob1->magic != ob2->magic |
217 | || ob1->magic != ob2->magic |
235 | || ob1->slaying != ob2->slaying |
218 | || ob1->slaying != ob2->slaying |
236 | || ob1->skill != ob2->skill |
219 | || ob1->skill != ob2->skill |
237 | || ob1->value != ob2->value |
220 | || ob1->value != ob2->value |
… | |
… | |
244 | || ob1->move_block != ob2->move_block |
227 | || ob1->move_block != ob2->move_block |
245 | || ob1->move_allow != ob2->move_allow |
228 | || ob1->move_allow != ob2->move_allow |
246 | || ob1->move_on != ob2->move_on |
229 | || ob1->move_on != ob2->move_on |
247 | || ob1->move_off != ob2->move_off |
230 | || ob1->move_off != ob2->move_off |
248 | || ob1->move_slow != ob2->move_slow |
231 | || ob1->move_slow != ob2->move_slow |
249 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
232 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
|
|
233 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
234 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
250 | return 0; |
235 | return 0; |
251 | |
236 | |
|
|
237 | if ((ob1->flag ^ ob2->flag) |
|
|
238 | .reset (FLAG_INV_LOCKED) |
|
|
239 | .reset (FLAG_CLIENT_SENT) |
|
|
240 | .reset (FLAG_REMOVED) |
|
|
241 | .any ()) |
|
|
242 | return 0; |
|
|
243 | |
252 | /* This is really a spellbook check - really, we should |
244 | /* This is really a spellbook check - we should in general |
253 | * check all objects in the inventory. |
245 | * not merge objects with real inventories, as splitting them |
|
|
246 | * is hard. |
254 | */ |
247 | */ |
255 | if (ob1->inv || ob2->inv) |
248 | if (ob1->inv || ob2->inv) |
256 | { |
249 | { |
257 | /* if one object has inventory but the other doesn't, not equiv */ |
250 | if (!(ob1->inv && ob2->inv)) |
258 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
251 | return 0; /* inventories differ in length */ |
259 | return 0; |
|
|
260 | |
252 | |
261 | /* Now check to see if the two inventory objects could merge */ |
253 | if (ob1->inv->below || ob2->inv->below) |
|
|
254 | return 0; /* more than one object in inv */ |
|
|
255 | |
262 | if (!object::can_merge (ob1->inv, ob2->inv)) |
256 | if (!object::can_merge (ob1->inv, ob2->inv)) |
263 | return 0; |
257 | return 0; /* inventory objects differ */ |
264 | |
258 | |
265 | /* inventory ok - still need to check rest of this object to see |
259 | /* inventory ok - still need to check rest of this object to see |
266 | * if it is valid. |
260 | * if it is valid. |
267 | */ |
261 | */ |
268 | } |
262 | } |
… | |
… | |
287 | if (ob1->level != ob2->level) |
281 | if (ob1->level != ob2->level) |
288 | return 0; |
282 | return 0; |
289 | break; |
283 | break; |
290 | } |
284 | } |
291 | |
285 | |
292 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
286 | if (ob1->key_values || ob2->key_values) |
293 | { |
287 | { |
294 | /* At least one of these has key_values. */ |
288 | /* At least one of these has key_values. */ |
295 | if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) |
289 | if ((!ob1->key_values) != (!ob2->key_values)) |
296 | /* One has fields, but the other one doesn't. */ |
290 | return 0; /* One has fields, but the other one doesn't. */ |
|
|
291 | |
|
|
292 | if (!compare_ob_value_lists (ob1, ob2)) |
297 | return 0; |
293 | return 0; |
298 | else if (!compare_ob_value_lists (ob1, ob2)) |
|
|
299 | return 0; |
|
|
300 | } |
294 | } |
301 | |
295 | |
302 | //TODO: generate an event or call into perl for additional checks |
|
|
303 | if (ob1->self || ob2->self) |
296 | if (ob1->self || ob2->self) |
304 | { |
297 | { |
305 | ob1->optimise (); |
298 | ob1->optimise (); |
306 | ob2->optimise (); |
299 | ob2->optimise (); |
307 | |
300 | |
308 | if (ob1->self || ob2->self) |
301 | if (ob1->self || ob2->self) |
|
|
302 | { |
|
|
303 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
|
|
304 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
|
|
305 | |
|
|
306 | if (k1 != k2) |
309 | return 0; |
307 | return 0; |
|
|
308 | |
|
|
309 | if (k1 == 0) |
|
|
310 | return 1; |
|
|
311 | |
|
|
312 | if (!cfperl_can_merge (ob1, ob2)) |
|
|
313 | return 0; |
|
|
314 | } |
310 | } |
315 | } |
311 | |
316 | |
312 | /* Everything passes, must be OK. */ |
317 | /* Everything passes, must be OK. */ |
313 | return 1; |
318 | return 1; |
314 | } |
319 | } |
315 | |
320 | |
|
|
321 | // find player who can see this object |
|
|
322 | object * |
|
|
323 | object::visible_to () const |
|
|
324 | { |
|
|
325 | if (client_visible () && !flag [FLAG_REMOVED]) |
|
|
326 | { |
|
|
327 | // see if we are in a container of sorts |
|
|
328 | if (env) |
|
|
329 | { |
|
|
330 | // the player inventory itself is always visible |
|
|
331 | if (env->type == PLAYER) |
|
|
332 | return env; |
|
|
333 | |
|
|
334 | // else a player could have our env open |
|
|
335 | object *envest = env->outer_env (); |
|
|
336 | |
|
|
337 | // the player itself is always on a map, so we will find him here |
|
|
338 | // even if our inv is in a player. |
|
|
339 | if (envest->is_on_map ()) |
|
|
340 | if (object *pl = envest->ms ().player ()) |
|
|
341 | if (pl->container == env) |
|
|
342 | return pl; |
|
|
343 | } |
|
|
344 | else |
|
|
345 | { |
|
|
346 | // maybe there is a player standing on the same mapspace |
|
|
347 | // this will catch the case where "this" is a player |
|
|
348 | if (object *pl = ms ().player ()) |
|
|
349 | if (!pl->container || this == pl->container) |
|
|
350 | return pl; |
|
|
351 | } |
|
|
352 | } |
|
|
353 | |
|
|
354 | return 0; |
|
|
355 | } |
|
|
356 | |
|
|
357 | // adjust weight per container type ("of holding") |
|
|
358 | static sint32 |
|
|
359 | weight_adjust_for (object *op, sint32 weight) |
|
|
360 | { |
|
|
361 | return op->type == CONTAINER |
|
|
362 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
|
|
363 | : weight; |
|
|
364 | } |
|
|
365 | |
316 | /* |
366 | /* |
|
|
367 | * adjust_weight(object, weight) adds the specified weight to an object, |
|
|
368 | * and also updates how much the environment(s) is/are carrying. |
|
|
369 | */ |
|
|
370 | static void |
|
|
371 | adjust_weight (object *op, sint32 weight) |
|
|
372 | { |
|
|
373 | while (op) |
|
|
374 | { |
|
|
375 | // adjust by actual difference to account for rounding errors |
|
|
376 | // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct |
|
|
377 | weight = weight_adjust_for (op, op->carrying) |
|
|
378 | - weight_adjust_for (op, op->carrying - weight); |
|
|
379 | |
|
|
380 | if (!weight) |
|
|
381 | return; |
|
|
382 | |
|
|
383 | op->carrying += weight; |
|
|
384 | |
|
|
385 | if (object *pl = op->visible_to ()) |
|
|
386 | if (pl != op) // player is handled lazily |
|
|
387 | esrv_update_item (UPD_WEIGHT, pl, op); |
|
|
388 | |
|
|
389 | op = op->env; |
|
|
390 | } |
|
|
391 | } |
|
|
392 | |
|
|
393 | /* |
317 | * sum_weight() is a recursive function which calculates the weight |
394 | * this is a recursive function which calculates the weight |
318 | * an object is carrying. It goes through in figures out how much |
395 | * an object is carrying. It goes through op and figures out how much |
319 | * containers are carrying, and sums it up. |
396 | * containers are carrying, and sums it up. |
320 | */ |
397 | */ |
321 | long |
398 | void |
322 | sum_weight (object *op) |
399 | object::update_weight () |
323 | { |
400 | { |
324 | long sum; |
401 | sint32 sum = 0; |
325 | object *inv; |
|
|
326 | |
402 | |
327 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
403 | for (object *op = inv; op; op = op->below) |
328 | { |
404 | { |
329 | if (inv->inv) |
405 | if (op->inv) |
330 | sum_weight (inv); |
406 | op->update_weight (); |
331 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
407 | |
|
|
408 | sum += op->total_weight (); |
|
|
409 | } |
|
|
410 | |
|
|
411 | sum = weight_adjust (this, sum); |
|
|
412 | |
|
|
413 | if (sum != carrying) |
332 | } |
414 | { |
333 | |
|
|
334 | if (op->type == CONTAINER && op->stats.Str) |
|
|
335 | sum = (sum * (100 - op->stats.Str)) / 100; |
|
|
336 | |
|
|
337 | if (op->carrying != sum) |
|
|
338 | op->carrying = sum; |
415 | carrying = sum; |
339 | |
416 | |
340 | return sum; |
417 | if (object *pl = visible_to ()) |
|
|
418 | if (pl != this) // player is handled lazily |
|
|
419 | esrv_update_item (UPD_WEIGHT, pl, this); |
|
|
420 | } |
341 | } |
421 | } |
342 | |
422 | |
343 | /** |
423 | /* |
344 | * Return the outermost environment object for a given object. |
424 | * Used by: Server DM commands: dumpbelow, dump. Some error messages. |
345 | */ |
425 | */ |
346 | |
|
|
347 | object * |
|
|
348 | object_get_env_recursive (object *op) |
|
|
349 | { |
|
|
350 | while (op->env != NULL) |
|
|
351 | op = op->env; |
|
|
352 | return op; |
|
|
353 | } |
|
|
354 | |
|
|
355 | /* |
|
|
356 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
|
|
357 | * Some error messages. |
|
|
358 | * The result of the dump is stored in the static global errmsg array. |
|
|
359 | */ |
|
|
360 | |
|
|
361 | char * |
426 | char * |
362 | dump_object (object *op) |
427 | dump_object (object *op) |
363 | { |
428 | { |
364 | if (!op) |
429 | if (!op) |
365 | return strdup ("[NULLOBJ]"); |
430 | return strdup ("[NULLOBJ]"); |
366 | |
431 | |
367 | object_freezer freezer; |
432 | object_freezer freezer; |
368 | save_object (freezer, op, 1); |
433 | op->write (freezer); |
369 | return freezer.as_string (); |
434 | return freezer.as_string (); |
370 | } |
435 | } |
371 | |
436 | |
372 | /* |
437 | /* |
373 | * get_nearest_part(multi-object, object 2) returns the part of the |
438 | * get_nearest_part(multi-object, object 2) returns the part of the |
374 | * multi-object 1 which is closest to the second object. |
439 | * multi-object 1 which is closest to the second object. |
375 | * If it's not a multi-object, it is returned. |
440 | * If it's not a multi-object, it is returned. |
376 | */ |
441 | */ |
377 | |
|
|
378 | object * |
442 | object * |
379 | get_nearest_part (object *op, const object *pl) |
443 | get_nearest_part (object *op, const object *pl) |
380 | { |
444 | { |
381 | object *tmp, *closest; |
445 | object *tmp, *closest; |
382 | int last_dist, i; |
446 | int last_dist, i; |
383 | |
447 | |
384 | if (op->more == NULL) |
448 | if (!op->more) |
385 | return op; |
449 | return op; |
|
|
450 | |
386 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more) |
451 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
452 | tmp; |
|
|
453 | tmp = tmp->more) |
387 | if ((i = distance (tmp, pl)) < last_dist) |
454 | if ((i = distance (tmp, pl)) < last_dist) |
388 | closest = tmp, last_dist = i; |
455 | closest = tmp, last_dist = i; |
|
|
456 | |
389 | return closest; |
457 | return closest; |
390 | } |
458 | } |
391 | |
459 | |
392 | /* |
460 | /* |
393 | * Returns the object which has the count-variable equal to the argument. |
461 | * Returns the object which has the count-variable equal to the argument. |
|
|
462 | * VERRRY slow. |
394 | */ |
463 | */ |
395 | |
|
|
396 | object * |
464 | object * |
397 | find_object (tag_t i) |
465 | find_object (tag_t i) |
398 | { |
466 | { |
399 | for (object *op = object::first; op; op = op->next) |
467 | for_all_objects (op) |
400 | if (op->count == i) |
468 | if (op->count == i) |
401 | return op; |
469 | return op; |
402 | |
470 | |
403 | return 0; |
471 | return 0; |
404 | } |
472 | } |
405 | |
473 | |
406 | /* |
474 | /* |
407 | * Returns the first object which has a name equal to the argument. |
475 | * Returns the first object which has a name equal to the argument. |
408 | * Used only by the patch command, but not all that useful. |
476 | * Used only by the patch command, but not all that useful. |
409 | * Enables features like "patch <name-of-other-player> food 999" |
477 | * Enables features like "patch <name-of-other-player> food 999" |
410 | */ |
478 | */ |
411 | |
|
|
412 | object * |
479 | object * |
413 | find_object_name (const char *str) |
480 | find_object_name (const char *str) |
414 | { |
481 | { |
415 | shstr_cmp str_ (str); |
482 | shstr_cmp str_ (str); |
416 | object *op; |
483 | object *op; |
417 | |
484 | |
418 | for (op = object::first; op != NULL; op = op->next) |
485 | for_all_objects (op) |
419 | if (op->name == str_) |
486 | if (op->name == str_) |
420 | break; |
487 | break; |
421 | |
488 | |
422 | return op; |
489 | return op; |
423 | } |
490 | } |
424 | |
491 | |
425 | void |
|
|
426 | free_all_object_data () |
|
|
427 | { |
|
|
428 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
429 | } |
|
|
430 | |
|
|
431 | /* |
492 | /* |
432 | * Sets the owner and sets the skill and exp pointers to owner's current |
493 | * Sets the owner and sets the skill and exp pointers to owner's current |
433 | * skill and experience objects. |
494 | * skill and experience objects. |
|
|
495 | * ACTUALLY NO! investigate! TODO |
434 | */ |
496 | */ |
435 | void |
497 | void |
436 | object::set_owner (object *owner) |
498 | object::set_owner (object *owner) |
437 | { |
499 | { |
|
|
500 | // allow objects which own objects |
438 | if (!owner) |
501 | 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) |
502 | while (owner->owner) |
449 | owner = owner->owner; |
503 | owner = owner->owner; |
|
|
504 | |
|
|
505 | if (flag [FLAG_FREED]) |
|
|
506 | { |
|
|
507 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
|
|
508 | return; |
|
|
509 | } |
450 | |
510 | |
451 | this->owner = owner; |
511 | this->owner = owner; |
|
|
512 | } |
|
|
513 | |
|
|
514 | int |
|
|
515 | object::slottype () const |
|
|
516 | { |
|
|
517 | if (type == SKILL) |
|
|
518 | { |
|
|
519 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
520 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
521 | } |
|
|
522 | else |
|
|
523 | { |
|
|
524 | if (slot [body_combat].info) return slot_combat; |
|
|
525 | if (slot [body_range ].info) return slot_ranged; |
|
|
526 | } |
|
|
527 | |
|
|
528 | return slot_none; |
|
|
529 | } |
|
|
530 | |
|
|
531 | bool |
|
|
532 | object::change_weapon (object *ob) |
|
|
533 | { |
|
|
534 | if (current_weapon == ob) |
|
|
535 | return true; |
|
|
536 | |
|
|
537 | if (chosen_skill) |
|
|
538 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
539 | |
|
|
540 | current_weapon = ob; |
|
|
541 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
542 | |
|
|
543 | if (chosen_skill) |
|
|
544 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
545 | |
|
|
546 | update_stats (); |
|
|
547 | |
|
|
548 | if (ob) |
|
|
549 | { |
|
|
550 | // now check wether any body locations became invalid, in which case |
|
|
551 | // we cannot apply the weapon at the moment. |
|
|
552 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
553 | if (slot[i].used < 0) |
|
|
554 | { |
|
|
555 | current_weapon = chosen_skill = 0; |
|
|
556 | update_stats (); |
|
|
557 | |
|
|
558 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
559 | "You try to balance all your items at once, " |
|
|
560 | "but the %s is just too much for your body. " |
|
|
561 | "[You need to unapply some items first.]", &ob->name); |
|
|
562 | return false; |
|
|
563 | } |
|
|
564 | |
|
|
565 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
566 | } |
|
|
567 | else |
|
|
568 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
569 | |
|
|
570 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
571 | { |
|
|
572 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
573 | &name, ob->debug_desc ()); |
|
|
574 | return false; |
|
|
575 | } |
|
|
576 | |
|
|
577 | return true; |
452 | } |
578 | } |
453 | |
579 | |
454 | /* Zero the key_values on op, decrementing the shared-string |
580 | /* Zero the key_values on op, decrementing the shared-string |
455 | * refcounts and freeing the links. |
581 | * refcounts and freeing the links. |
456 | */ |
582 | */ |
457 | static void |
583 | static void |
458 | free_key_values (object *op) |
584 | free_key_values (object *op) |
459 | { |
585 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
586 | for (key_value *i = op->key_values; i; ) |
461 | { |
587 | { |
462 | key_value *next = i->next; |
588 | key_value *next = i->next; |
463 | delete i; |
589 | delete i; |
464 | |
590 | |
465 | i = next; |
591 | i = next; |
… | |
… | |
477 | * will point at garbage. |
603 | * will point at garbage. |
478 | */ |
604 | */ |
479 | void |
605 | void |
480 | object::copy_to (object *dst) |
606 | object::copy_to (object *dst) |
481 | { |
607 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
608 | dst->remove (); |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
|
|
484 | |
|
|
485 | *(object_copy *)dst = *this; |
609 | *(object_copy *)dst = *this; |
486 | |
610 | dst->flag [FLAG_REMOVED] = true; |
487 | if (is_freed) |
|
|
488 | SET_FLAG (dst, FLAG_FREED); |
|
|
489 | |
|
|
490 | if (is_removed) |
|
|
491 | SET_FLAG (dst, FLAG_REMOVED); |
|
|
492 | |
|
|
493 | if (speed < 0) |
|
|
494 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
|
|
495 | |
611 | |
496 | /* Copy over key_values, if any. */ |
612 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
613 | if (key_values) |
498 | { |
614 | { |
499 | key_value *tail = 0; |
615 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
616 | dst->key_values = 0; |
503 | |
617 | |
504 | for (i = key_values; i; i = i->next) |
618 | for (key_value *i = key_values; i; i = i->next) |
505 | { |
619 | { |
506 | key_value *new_link = new key_value; |
620 | key_value *new_link = new key_value; |
507 | |
621 | |
508 | new_link->next = 0; |
622 | new_link->next = 0; |
509 | new_link->key = i->key; |
623 | new_link->key = i->key; |
510 | new_link->value = i->value; |
624 | new_link->value = i->value; |
511 | |
625 | |
512 | /* Try and be clever here, too. */ |
626 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
627 | if (!dst->key_values) |
514 | { |
628 | { |
… | |
… | |
521 | tail = new_link; |
635 | tail = new_link; |
522 | } |
636 | } |
523 | } |
637 | } |
524 | } |
638 | } |
525 | |
639 | |
|
|
640 | if (speed < 0) |
|
|
641 | dst->speed_left -= rndm (); |
|
|
642 | |
526 | dst->set_speed (dst->speed); |
643 | dst->set_speed (dst->speed); |
|
|
644 | } |
|
|
645 | |
|
|
646 | void |
|
|
647 | object::instantiate () |
|
|
648 | { |
|
|
649 | if (!uuid.seq) // HACK |
|
|
650 | uuid = UUID::gen (); |
|
|
651 | |
|
|
652 | speed_left = -0.1f; |
|
|
653 | /* copy the body_info to the body_used - this is only really |
|
|
654 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
655 | * by doing so, when a monster is created, it has good starting |
|
|
656 | * values for the body_used info, so when items are created |
|
|
657 | * for it, they can be properly equipped. |
|
|
658 | */ |
|
|
659 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
660 | slot[i].used = slot[i].info; |
|
|
661 | |
|
|
662 | attachable::instantiate (); |
527 | } |
663 | } |
528 | |
664 | |
529 | object * |
665 | object * |
530 | object::clone () |
666 | object::clone () |
531 | { |
667 | { |
532 | object *neu = create (); |
668 | object *neu = create (); |
533 | copy_to (neu); |
669 | copy_to (neu); |
|
|
670 | neu->map = map; // not copied by copy_to |
534 | return neu; |
671 | return neu; |
535 | } |
672 | } |
536 | |
673 | |
537 | /* |
674 | /* |
538 | * If an object with the IS_TURNABLE() flag needs to be turned due |
675 | * If an object with the IS_TURNABLE() flag needs to be turned due |
… | |
… | |
589 | * UP_OBJ_FACE: only the objects face has changed. |
726 | * UP_OBJ_FACE: only the objects face has changed. |
590 | */ |
727 | */ |
591 | void |
728 | void |
592 | update_object (object *op, int action) |
729 | update_object (object *op, int action) |
593 | { |
730 | { |
594 | MoveType move_on, move_off, move_block, move_slow; |
731 | if (!op) |
595 | |
|
|
596 | if (op == NULL) |
|
|
597 | { |
732 | { |
598 | /* this should never happen */ |
733 | /* this should never happen */ |
599 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
734 | LOG (llevError | logBacktrace, "update_object() called for NULL object.\n"); |
600 | return; |
735 | return; |
601 | } |
736 | } |
602 | |
737 | |
603 | if (op->env) |
738 | if (!op->is_on_map ()) |
604 | { |
739 | { |
605 | /* Animation is currently handled by client, so nothing |
740 | /* Animation is currently handled by client, so nothing |
606 | * to do in this case. |
741 | * to do in this case. |
607 | */ |
742 | */ |
608 | return; |
743 | return; |
609 | } |
744 | } |
610 | |
|
|
611 | /* If the map is saving, don't do anything as everything is |
|
|
612 | * going to get freed anyways. |
|
|
613 | */ |
|
|
614 | if (!op->map || op->map->in_memory == MAP_SAVING) |
|
|
615 | return; |
|
|
616 | |
745 | |
617 | /* make sure the object is within map boundaries */ |
746 | /* make sure the object is within map boundaries */ |
618 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
747 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
619 | { |
748 | { |
620 | LOG (llevError, "update_object() called for object out of map!\n"); |
749 | LOG (llevError, "update_object() called for object out of map!\n"); |
… | |
… | |
624 | return; |
753 | return; |
625 | } |
754 | } |
626 | |
755 | |
627 | mapspace &m = op->ms (); |
756 | mapspace &m = op->ms (); |
628 | |
757 | |
629 | if (m.flags_ & P_NEED_UPDATE) |
758 | if (!(m.flags_ & P_UPTODATE)) |
630 | /* nop */; |
759 | /* nop */; |
631 | else if (action == UP_OBJ_INSERT) |
760 | else if (action == UP_OBJ_INSERT) |
632 | { |
761 | { |
633 | // this is likely overkill, TODO: revisit (schmorp) |
762 | // this is likely overkill, TODO: revisit (schmorp) |
634 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
763 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
… | |
… | |
643 | /* This isn't perfect, but I don't expect a lot of objects to |
772 | /* This isn't perfect, but I don't expect a lot of objects to |
644 | * to have move_allow right now. |
773 | * to have move_allow right now. |
645 | */ |
774 | */ |
646 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
775 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
647 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
776 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
648 | m.flags_ = P_NEED_UPDATE; |
777 | m.flags_ = 0; |
649 | } |
778 | } |
650 | /* if the object is being removed, we can't make intelligent |
779 | /* if the object is being removed, we can't make intelligent |
651 | * decisions, because remove_ob can't really pass the object |
780 | * decisions, because remove_ob can't really pass the object |
652 | * that is being removed. |
781 | * that is being removed. |
653 | */ |
782 | */ |
654 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
783 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
655 | m.flags_ = P_NEED_UPDATE; |
784 | m.flags_ = 0; |
656 | else if (action == UP_OBJ_FACE) |
785 | else if (action == UP_OBJ_FACE) |
657 | /* Nothing to do for that case */ ; |
786 | /* Nothing to do for that case */ ; |
658 | else |
787 | else |
659 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
788 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
660 | |
789 | |
661 | if (op->more) |
790 | if (op->more) |
662 | update_object (op->more, action); |
791 | update_object (op->more, action); |
663 | } |
792 | } |
664 | |
793 | |
665 | object *object::first; |
|
|
666 | |
|
|
667 | object::object () |
794 | object::object () |
668 | { |
795 | { |
669 | SET_FLAG (this, FLAG_REMOVED); |
796 | SET_FLAG (this, FLAG_REMOVED); |
670 | |
797 | |
671 | expmul = 1.0; |
798 | expmul = 1.0; |
672 | face = blank_face; |
799 | face = blank_face; |
673 | } |
800 | } |
674 | |
801 | |
675 | object::~object () |
802 | object::~object () |
676 | { |
803 | { |
|
|
804 | unlink (); |
|
|
805 | |
677 | free_key_values (this); |
806 | free_key_values (this); |
678 | } |
807 | } |
679 | |
808 | |
|
|
809 | static int object_count; |
|
|
810 | |
680 | void object::link () |
811 | void object::link () |
681 | { |
812 | { |
|
|
813 | assert (!index);//D |
|
|
814 | uuid = UUID::gen (); |
682 | count = ++ob_count; |
815 | count = ++object_count; |
683 | uuid = gen_uuid (); |
|
|
684 | |
816 | |
685 | prev = 0; |
817 | refcnt_inc (); |
686 | next = object::first; |
818 | objects.insert (this); |
687 | |
|
|
688 | if (object::first) |
|
|
689 | object::first->prev = this; |
|
|
690 | |
|
|
691 | object::first = this; |
|
|
692 | } |
819 | } |
693 | |
820 | |
694 | void object::unlink () |
821 | void object::unlink () |
695 | { |
822 | { |
696 | if (this == object::first) |
823 | if (!index) |
697 | object::first = next; |
824 | return; |
698 | |
825 | |
699 | /* Remove this object from the list of used objects */ |
826 | objects.erase (this); |
700 | if (prev) prev->next = next; |
827 | refcnt_dec (); |
701 | if (next) next->prev = prev; |
|
|
702 | |
|
|
703 | prev = 0; |
|
|
704 | next = 0; |
|
|
705 | } |
|
|
706 | |
|
|
707 | bool |
|
|
708 | object::active () const |
|
|
709 | { |
|
|
710 | return active_next || active_prev || this == active_objects; |
|
|
711 | } |
828 | } |
712 | |
829 | |
713 | void |
830 | void |
714 | object::activate () |
831 | object::activate () |
715 | { |
832 | { |
716 | /* If already on active list, don't do anything */ |
833 | /* If already on active list, don't do anything */ |
717 | if (active ()) |
834 | if (active) |
718 | return; |
835 | return; |
719 | |
836 | |
720 | if (has_active_speed ()) |
837 | if (has_active_speed ()) |
721 | { |
838 | actives.insert (this); |
722 | /* process_events() expects us to insert the object at the beginning |
|
|
723 | * of the list. */ |
|
|
724 | active_next = active_objects; |
|
|
725 | |
|
|
726 | if (active_next) |
|
|
727 | active_next->active_prev = this; |
|
|
728 | |
|
|
729 | active_objects = this; |
|
|
730 | } |
|
|
731 | } |
839 | } |
732 | |
840 | |
733 | void |
841 | void |
734 | object::activate_recursive () |
842 | object::activate_recursive () |
735 | { |
843 | { |
736 | activate (); |
844 | activate (); |
737 | |
845 | |
738 | for (object *op = inv; op; op = op->above) |
846 | for (object *op = inv; op; op = op->below) |
739 | op->activate_recursive (); |
847 | op->activate_recursive (); |
740 | } |
848 | } |
741 | |
849 | |
742 | /* This function removes object 'op' from the list of active |
850 | /* This function removes object 'op' from the list of active |
743 | * objects. |
851 | * objects. |
… | |
… | |
749 | */ |
857 | */ |
750 | void |
858 | void |
751 | object::deactivate () |
859 | object::deactivate () |
752 | { |
860 | { |
753 | /* If not on the active list, nothing needs to be done */ |
861 | /* If not on the active list, nothing needs to be done */ |
754 | if (!active ()) |
862 | if (!active) |
755 | return; |
863 | return; |
756 | |
864 | |
757 | if (active_prev == 0) |
865 | actives.erase (this); |
758 | { |
|
|
759 | active_objects = active_next; |
|
|
760 | if (active_next) |
|
|
761 | active_next->active_prev = 0; |
|
|
762 | } |
|
|
763 | else |
|
|
764 | { |
|
|
765 | active_prev->active_next = active_next; |
|
|
766 | if (active_next) |
|
|
767 | active_next->active_prev = active_prev; |
|
|
768 | } |
|
|
769 | |
|
|
770 | active_next = 0; |
|
|
771 | active_prev = 0; |
|
|
772 | } |
866 | } |
773 | |
867 | |
774 | void |
868 | void |
775 | object::deactivate_recursive () |
869 | object::deactivate_recursive () |
776 | { |
870 | { |
777 | for (object *op = inv; op; op = op->above) |
871 | for (object *op = inv; op; op = op->below) |
778 | op->deactivate_recursive (); |
872 | op->deactivate_recursive (); |
779 | |
873 | |
780 | deactivate (); |
874 | deactivate (); |
|
|
875 | } |
|
|
876 | |
|
|
877 | void |
|
|
878 | object::set_flag_inv (int flag, int value) |
|
|
879 | { |
|
|
880 | for (object *op = inv; op; op = op->below) |
|
|
881 | { |
|
|
882 | op->flag [flag] = value; |
|
|
883 | op->set_flag_inv (flag, value); |
|
|
884 | } |
781 | } |
885 | } |
782 | |
886 | |
783 | /* |
887 | /* |
784 | * Remove and free all objects in the inventory of the given object. |
888 | * Remove and free all objects in the inventory of the given object. |
785 | * object.c ? |
889 | * object.c ? |
… | |
… | |
788 | object::destroy_inv (bool drop_to_ground) |
892 | object::destroy_inv (bool drop_to_ground) |
789 | { |
893 | { |
790 | // need to check first, because the checks below might segfault |
894 | // need to check first, because the checks below might segfault |
791 | // as we might be on an invalid mapspace and crossfire code |
895 | // as we might be on an invalid mapspace and crossfire code |
792 | // is too buggy to ensure that the inventory is empty. |
896 | // is too buggy to ensure that the inventory is empty. |
793 | // corollary: if you create arrows etc. with stuff in tis inventory, |
897 | // corollary: if you create arrows etc. with stuff in its inventory, |
794 | // cf will crash below with off-map x and y |
898 | // cf will crash below with off-map x and y |
795 | if (!inv) |
899 | if (!inv) |
796 | return; |
900 | return; |
797 | |
901 | |
798 | /* Only if the space blocks everything do we not process - |
902 | /* Only if the space blocks everything do we not process - |
799 | * if some form of movement is allowed, let objects |
903 | * if some form of movement is allowed, let objects |
800 | * drop on that space. |
904 | * drop on that space. |
801 | */ |
905 | */ |
802 | if (!drop_to_ground |
906 | if (!drop_to_ground |
803 | || !map |
907 | || !map |
804 | || map->in_memory != MAP_IN_MEMORY |
908 | || map->in_memory != MAP_ACTIVE |
|
|
909 | || map->nodrop |
805 | || ms ().move_block == MOVE_ALL) |
910 | || ms ().move_block == MOVE_ALL) |
806 | { |
911 | { |
807 | while (inv) |
912 | while (inv) |
808 | { |
913 | { |
809 | inv->destroy_inv (drop_to_ground); |
914 | inv->destroy_inv (false); |
810 | inv->destroy (); |
915 | inv->destroy (); |
811 | } |
916 | } |
812 | } |
917 | } |
813 | else |
918 | else |
814 | { /* Put objects in inventory onto this space */ |
919 | { /* Put objects in inventory onto this space */ |
… | |
… | |
818 | |
923 | |
819 | if (op->flag [FLAG_STARTEQUIP] |
924 | if (op->flag [FLAG_STARTEQUIP] |
820 | || op->flag [FLAG_NO_DROP] |
925 | || op->flag [FLAG_NO_DROP] |
821 | || op->type == RUNE |
926 | || op->type == RUNE |
822 | || op->type == TRAP |
927 | || op->type == TRAP |
823 | || op->flag [FLAG_IS_A_TEMPLATE]) |
928 | || op->flag [FLAG_IS_A_TEMPLATE] |
|
|
929 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
824 | op->destroy (); |
930 | op->destroy (true); |
825 | else |
931 | else |
826 | map->insert (op, x, y); |
932 | map->insert (op, x, y); |
827 | } |
933 | } |
828 | } |
934 | } |
829 | } |
935 | } |
… | |
… | |
833 | object *op = new object; |
939 | object *op = new object; |
834 | op->link (); |
940 | op->link (); |
835 | return op; |
941 | return op; |
836 | } |
942 | } |
837 | |
943 | |
|
|
944 | static struct freed_map : maptile |
|
|
945 | { |
|
|
946 | freed_map () |
|
|
947 | { |
|
|
948 | path = "<freed objects map>"; |
|
|
949 | name = "/internal/freed_objects_map"; |
|
|
950 | width = 3; |
|
|
951 | height = 3; |
|
|
952 | nodrop = 1; |
|
|
953 | |
|
|
954 | alloc (); |
|
|
955 | in_memory = MAP_ACTIVE; |
|
|
956 | } |
|
|
957 | |
|
|
958 | ~freed_map () |
|
|
959 | { |
|
|
960 | destroy (); |
|
|
961 | } |
|
|
962 | } freed_map; // freed objects are moved here to avoid crashes |
|
|
963 | |
838 | void |
964 | void |
839 | object::do_destroy () |
965 | object::do_destroy () |
840 | { |
966 | { |
841 | if (flag [FLAG_IS_LINKED]) |
967 | if (flag [FLAG_IS_LINKED]) |
842 | remove_button_link (this); |
968 | remove_button_link (this); |
843 | |
969 | |
844 | if (flag [FLAG_FRIENDLY]) |
970 | if (flag [FLAG_FRIENDLY]) |
845 | remove_friendly_object (this); |
971 | remove_friendly_object (this); |
846 | |
972 | |
847 | if (!flag [FLAG_REMOVED]) |
|
|
848 | remove (); |
973 | remove (); |
849 | |
974 | |
850 | if (flag [FLAG_FREED]) |
975 | attachable::do_destroy (); |
851 | return; |
|
|
852 | |
976 | |
853 | set_speed (0); |
977 | deactivate (); |
|
|
978 | unlink (); |
854 | |
979 | |
855 | flag [FLAG_FREED] = 1; |
980 | flag [FLAG_FREED] = 1; |
856 | |
981 | |
857 | attachable::do_destroy (); |
|
|
858 | |
|
|
859 | destroy_inv (true); |
|
|
860 | unlink (); |
|
|
861 | |
|
|
862 | // hack to ensure that freed objects still have a valid map |
982 | // hack to ensure that freed objects still have a valid map |
863 | { |
|
|
864 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
865 | |
|
|
866 | if (!freed_map) |
|
|
867 | { |
|
|
868 | freed_map = new maptile; |
|
|
869 | |
|
|
870 | freed_map->name = "/internal/freed_objects_map"; |
|
|
871 | freed_map->width = 3; |
|
|
872 | freed_map->height = 3; |
|
|
873 | |
|
|
874 | freed_map->alloc (); |
|
|
875 | } |
|
|
876 | |
|
|
877 | map = freed_map; |
983 | map = &freed_map; |
878 | x = 1; |
984 | x = 1; |
879 | y = 1; |
985 | y = 1; |
880 | } |
|
|
881 | |
|
|
882 | head = 0; |
|
|
883 | |
986 | |
884 | if (more) |
987 | if (more) |
885 | { |
988 | { |
886 | more->destroy (); |
989 | more->destroy (); |
887 | more = 0; |
990 | more = 0; |
888 | } |
991 | } |
889 | |
992 | |
|
|
993 | head = 0; |
|
|
994 | |
890 | // clear those pointers that likely might have circular references to us |
995 | // clear those pointers that likely might cause circular references |
891 | owner = 0; |
996 | owner = 0; |
892 | enemy = 0; |
997 | enemy = 0; |
893 | attacked_by = 0; |
998 | attacked_by = 0; |
894 | |
999 | current_weapon = 0; |
895 | // only relevant for players(?), but make sure of it anyways |
|
|
896 | contr = 0; |
|
|
897 | } |
1000 | } |
898 | |
1001 | |
899 | void |
1002 | void |
900 | object::destroy (bool destroy_inventory) |
1003 | object::destroy (bool destroy_inventory) |
901 | { |
1004 | { |
902 | if (destroyed ()) |
1005 | if (destroyed ()) |
903 | return; |
1006 | return; |
904 | |
1007 | |
|
|
1008 | if (!is_head () && !head->destroyed ()) |
|
|
1009 | { |
|
|
1010 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
|
|
1011 | head->destroy (destroy_inventory); |
|
|
1012 | return; |
|
|
1013 | } |
|
|
1014 | |
905 | if (destroy_inventory) |
1015 | destroy_inv (!destroy_inventory); |
906 | destroy_inv (false); |
1016 | |
|
|
1017 | if (is_head ()) |
|
|
1018 | if (sound_destroy) |
|
|
1019 | play_sound (sound_destroy); |
|
|
1020 | else if (flag [FLAG_MONSTER]) |
|
|
1021 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
907 | |
1022 | |
908 | attachable::destroy (); |
1023 | attachable::destroy (); |
909 | } |
|
|
910 | |
|
|
911 | /* |
|
|
912 | * sub_weight() recursively (outwards) subtracts a number from the |
|
|
913 | * weight of an object (and what is carried by it's environment(s)). |
|
|
914 | */ |
|
|
915 | void |
|
|
916 | sub_weight (object *op, signed long weight) |
|
|
917 | { |
|
|
918 | while (op != NULL) |
|
|
919 | { |
|
|
920 | if (op->type == CONTAINER) |
|
|
921 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
922 | |
|
|
923 | op->carrying -= weight; |
|
|
924 | op = op->env; |
|
|
925 | } |
|
|
926 | } |
1024 | } |
927 | |
1025 | |
928 | /* op->remove (): |
1026 | /* op->remove (): |
929 | * This function removes the object op from the linked list of objects |
1027 | * This function removes the object op from the linked list of objects |
930 | * which it is currently tied to. When this function is done, the |
1028 | * which it is currently tied to. When this function is done, the |
931 | * object will have no environment. If the object previously had an |
1029 | * object will have no environment. If the object previously had an |
932 | * environment, the x and y coordinates will be updated to |
1030 | * environment, the x and y coordinates will be updated to |
933 | * the previous environment. |
1031 | * the previous environment. |
934 | * Beware: This function is called from the editor as well! |
|
|
935 | */ |
1032 | */ |
936 | void |
1033 | void |
937 | object::remove () |
1034 | object::do_remove () |
938 | { |
1035 | { |
939 | object *tmp, *last = 0; |
1036 | object *tmp, *last = 0; |
940 | object *otmp; |
1037 | object *otmp; |
941 | |
1038 | |
942 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1039 | if (flag [FLAG_REMOVED]) |
943 | return; |
1040 | return; |
944 | |
1041 | |
945 | SET_FLAG (this, FLAG_REMOVED); |
|
|
946 | INVOKE_OBJECT (REMOVE, this); |
1042 | INVOKE_OBJECT (REMOVE, this); |
|
|
1043 | |
|
|
1044 | flag [FLAG_REMOVED] = true; |
947 | |
1045 | |
948 | if (more) |
1046 | if (more) |
949 | more->remove (); |
1047 | more->remove (); |
950 | |
1048 | |
951 | /* |
1049 | /* |
952 | * In this case, the object to be removed is in someones |
1050 | * In this case, the object to be removed is in someones |
953 | * inventory. |
1051 | * inventory. |
954 | */ |
1052 | */ |
955 | if (env) |
1053 | if (env) |
956 | { |
1054 | { |
|
|
1055 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
|
|
1056 | if (object *pl = visible_to ()) |
|
|
1057 | esrv_del_item (pl->contr, count); |
|
|
1058 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
|
|
1059 | |
|
|
1060 | adjust_weight (env, -total_weight ()); |
|
|
1061 | |
|
|
1062 | *(above ? &above->below : &env->inv) = below; |
|
|
1063 | |
957 | if (nrof) |
1064 | if (below) |
958 | sub_weight (env, weight * nrof); |
1065 | below->above = above; |
959 | else |
1066 | |
960 | sub_weight (env, weight + carrying); |
1067 | /* we set up values so that it could be inserted into |
|
|
1068 | * the map, but we don't actually do that - it is up |
|
|
1069 | * to the caller to decide what we want to do. |
|
|
1070 | */ |
|
|
1071 | map = env->map; |
|
|
1072 | x = env->x; |
|
|
1073 | y = env->y; |
|
|
1074 | above = 0; |
|
|
1075 | below = 0; |
|
|
1076 | env = 0; |
961 | |
1077 | |
962 | /* NO_FIX_PLAYER is set when a great many changes are being |
1078 | /* NO_FIX_PLAYER is set when a great many changes are being |
963 | * made to players inventory. If set, avoiding the call |
1079 | * made to players inventory. If set, avoiding the call |
964 | * to save cpu time. |
1080 | * to save cpu time. |
965 | */ |
1081 | */ |
966 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1082 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
967 | otmp->update_stats (); |
1083 | otmp->update_stats (); |
968 | |
|
|
969 | if (above) |
|
|
970 | above->below = below; |
|
|
971 | else |
|
|
972 | env->inv = below; |
|
|
973 | |
|
|
974 | if (below) |
|
|
975 | below->above = above; |
|
|
976 | |
|
|
977 | /* we set up values so that it could be inserted into |
|
|
978 | * the map, but we don't actually do that - it is up |
|
|
979 | * to the caller to decide what we want to do. |
|
|
980 | */ |
|
|
981 | x = env->x, y = env->y; |
|
|
982 | map = env->map; |
|
|
983 | above = 0, below = 0; |
|
|
984 | env = 0; |
|
|
985 | } |
1084 | } |
986 | else if (map) |
1085 | else if (map) |
987 | { |
1086 | { |
988 | if (type == PLAYER) |
1087 | map->dirty = true; |
|
|
1088 | mapspace &ms = this->ms (); |
|
|
1089 | |
|
|
1090 | if (object *pl = ms.player ()) |
989 | { |
1091 | { |
|
|
1092 | if (type == PLAYER) // this == pl(!) |
|
|
1093 | { |
|
|
1094 | // leaving a spot always closes any open container on the ground |
|
|
1095 | if (container && !container->env) |
|
|
1096 | // this causes spurious floorbox updates, but it ensures |
|
|
1097 | // that the CLOSE event is being sent. |
|
|
1098 | close_container (); |
|
|
1099 | |
990 | --map->players; |
1100 | --map->players; |
991 | map->last_access = runtime; |
1101 | map->touch (); |
|
|
1102 | } |
|
|
1103 | else if (pl->container == this) |
|
|
1104 | { |
|
|
1105 | // removing a container should close it |
|
|
1106 | close_container (); |
|
|
1107 | } |
|
|
1108 | |
|
|
1109 | esrv_del_item (pl->contr, count); |
992 | } |
1110 | } |
993 | |
|
|
994 | map->dirty = true; |
|
|
995 | |
1111 | |
996 | /* link the object above us */ |
1112 | /* link the object above us */ |
997 | if (above) |
1113 | if (above) |
998 | above->below = below; |
1114 | above->below = below; |
999 | else |
1115 | else |
1000 | map->at (x, y).top = below; /* we were top, set new top */ |
1116 | ms.top = below; /* we were top, set new top */ |
1001 | |
1117 | |
1002 | /* Relink the object below us, if there is one */ |
1118 | /* Relink the object below us, if there is one */ |
1003 | if (below) |
1119 | if (below) |
1004 | below->above = above; |
1120 | below->above = above; |
1005 | else |
1121 | else |
… | |
… | |
1007 | /* Nothing below, which means we need to relink map object for this space |
1123 | /* Nothing below, which means we need to relink map object for this space |
1008 | * use translated coordinates in case some oddness with map tiling is |
1124 | * use translated coordinates in case some oddness with map tiling is |
1009 | * evident |
1125 | * evident |
1010 | */ |
1126 | */ |
1011 | if (GET_MAP_OB (map, x, y) != this) |
1127 | if (GET_MAP_OB (map, x, y) != this) |
1012 | { |
|
|
1013 | char *dump = dump_object (this); |
|
|
1014 | LOG (llevError, |
|
|
1015 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump); |
1128 | LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ()); |
1016 | free (dump); |
|
|
1017 | dump = dump_object (GET_MAP_OB (map, x, y)); |
|
|
1018 | LOG (llevError, "%s\n", dump); |
|
|
1019 | free (dump); |
|
|
1020 | } |
|
|
1021 | |
1129 | |
1022 | map->at (x, y).bot = above; /* goes on above it. */ |
1130 | ms.bot = above; /* goes on above it. */ |
1023 | } |
1131 | } |
1024 | |
1132 | |
1025 | above = 0; |
1133 | above = 0; |
1026 | below = 0; |
1134 | below = 0; |
1027 | |
1135 | |
1028 | if (map->in_memory == MAP_SAVING) |
1136 | if (map->in_memory == MAP_SAVING) |
1029 | return; |
1137 | return; |
1030 | |
1138 | |
1031 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1139 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1032 | |
1140 | |
|
|
1141 | if (object *pl = ms.player ()) |
|
|
1142 | { |
|
|
1143 | if (pl->container == this) |
|
|
1144 | /* If a container that the player is currently using somehow gets |
|
|
1145 | * removed (most likely destroyed), update the player view |
|
|
1146 | * appropriately. |
|
|
1147 | */ |
|
|
1148 | pl->close_container (); |
|
|
1149 | |
|
|
1150 | //TODO: the floorbox prev/next might need updating |
|
|
1151 | //esrv_del_item (pl->contr, count); |
|
|
1152 | //TODO: update floorbox to preserve ordering |
|
|
1153 | if (pl->contr->ns) |
|
|
1154 | pl->contr->ns->floorbox_update (); |
|
|
1155 | } |
|
|
1156 | |
1033 | for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) |
1157 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1034 | { |
1158 | { |
1035 | /* No point updating the players look faces if he is the object |
1159 | /* No point updating the players look faces if he is the object |
1036 | * being removed. |
1160 | * being removed. |
1037 | */ |
1161 | */ |
1038 | |
|
|
1039 | if (tmp->type == PLAYER && tmp != this) |
|
|
1040 | { |
|
|
1041 | /* If a container that the player is currently using somehow gets |
|
|
1042 | * removed (most likely destroyed), update the player view |
|
|
1043 | * appropriately. |
|
|
1044 | */ |
|
|
1045 | if (tmp->container == this) |
|
|
1046 | { |
|
|
1047 | flag [FLAG_APPLIED] = 0; |
|
|
1048 | tmp->container = 0; |
|
|
1049 | } |
|
|
1050 | |
|
|
1051 | if (tmp->contr->ns) |
|
|
1052 | tmp->contr->ns->floorbox_update (); |
|
|
1053 | } |
|
|
1054 | |
1162 | |
1055 | /* See if object moving off should effect something */ |
1163 | /* See if object moving off should effect something */ |
1056 | if (check_walk_off |
1164 | if (check_walk_off |
1057 | && ((move_type & tmp->move_off) |
1165 | && ((move_type & tmp->move_off) |
1058 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1166 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
… | |
… | |
1061 | |
1169 | |
1062 | if (destroyed ()) |
1170 | if (destroyed ()) |
1063 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1171 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1064 | } |
1172 | } |
1065 | |
1173 | |
1066 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1067 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1068 | if (tmp->above == tmp) |
|
|
1069 | tmp->above = 0; |
|
|
1070 | |
|
|
1071 | last = tmp; |
1174 | last = tmp; |
1072 | } |
1175 | } |
1073 | |
1176 | |
1074 | /* last == NULL if there are no objects on this space */ |
1177 | /* last == NULL if there are no objects on this space */ |
1075 | //TODO: this makes little sense, why only update the topmost object? |
1178 | //TODO: this makes little sense, why only update the topmost object? |
1076 | if (!last) |
1179 | if (!last) |
1077 | map->at (x, y).flags_ = P_NEED_UPDATE; |
1180 | map->at (x, y).flags_ = 0; |
1078 | else |
1181 | else |
1079 | update_object (last, UP_OBJ_REMOVE); |
1182 | update_object (last, UP_OBJ_REMOVE); |
1080 | |
1183 | |
1081 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1184 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
1082 | update_all_los (map, x, y); |
1185 | update_all_los (map, x, y); |
… | |
… | |
1095 | merge_ob (object *op, object *top) |
1198 | merge_ob (object *op, object *top) |
1096 | { |
1199 | { |
1097 | if (!op->nrof) |
1200 | if (!op->nrof) |
1098 | return 0; |
1201 | return 0; |
1099 | |
1202 | |
1100 | if (top) |
1203 | if (!top) |
1101 | for (top = op; top && top->above; top = top->above) |
1204 | for (top = op; top && top->above; top = top->above) |
1102 | ; |
1205 | ; |
1103 | |
1206 | |
1104 | for (; top; top = top->below) |
1207 | for (; top; top = top->below) |
1105 | { |
|
|
1106 | if (top == op) |
|
|
1107 | continue; |
|
|
1108 | |
|
|
1109 | if (object::can_merge (op, top)) |
1208 | if (object::can_merge (op, top)) |
1110 | { |
1209 | { |
1111 | top->nrof += op->nrof; |
1210 | top->nrof += op->nrof; |
1112 | |
1211 | |
1113 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1212 | if (object *pl = top->visible_to ()) |
1114 | op->weight = 0; /* Don't want any adjustements now */ |
1213 | esrv_update_item (UPD_NROF, pl, top); |
|
|
1214 | |
|
|
1215 | op->weight = 0; // cancel the addition above |
|
|
1216 | op->carrying = 0; // must be 0 already |
|
|
1217 | |
1115 | op->destroy (); |
1218 | op->destroy (1); |
|
|
1219 | |
1116 | return top; |
1220 | return top; |
1117 | } |
1221 | } |
1118 | } |
|
|
1119 | |
1222 | |
1120 | return 0; |
1223 | return 0; |
1121 | } |
1224 | } |
1122 | |
1225 | |
|
|
1226 | void |
|
|
1227 | object::expand_tail () |
|
|
1228 | { |
|
|
1229 | if (more) |
|
|
1230 | return; |
|
|
1231 | |
|
|
1232 | object *prev = this; |
|
|
1233 | |
|
|
1234 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
|
|
1235 | { |
|
|
1236 | object *op = arch_to_object (at); |
|
|
1237 | |
|
|
1238 | op->name = name; |
|
|
1239 | op->name_pl = name_pl; |
|
|
1240 | op->title = title; |
|
|
1241 | |
|
|
1242 | op->head = this; |
|
|
1243 | prev->more = op; |
|
|
1244 | |
|
|
1245 | prev = op; |
|
|
1246 | } |
|
|
1247 | } |
|
|
1248 | |
1123 | /* |
1249 | /* |
1124 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1250 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1125 | * job preparing multi-part monsters |
1251 | * job preparing multi-part monsters. |
1126 | */ |
1252 | */ |
1127 | object * |
1253 | object * |
1128 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1254 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1129 | { |
1255 | { |
1130 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1256 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1131 | { |
1257 | { |
1132 | tmp->x = x + tmp->arch->clone.x; |
1258 | tmp->x = x + tmp->arch->x; |
1133 | tmp->y = y + tmp->arch->clone.y; |
1259 | tmp->y = y + tmp->arch->y; |
1134 | } |
1260 | } |
1135 | |
1261 | |
1136 | return insert_ob_in_map (op, m, originator, flag); |
1262 | return insert_ob_in_map (op, m, originator, flag); |
1137 | } |
1263 | } |
1138 | |
1264 | |
… | |
… | |
1157 | * just 'op' otherwise |
1283 | * just 'op' otherwise |
1158 | */ |
1284 | */ |
1159 | object * |
1285 | object * |
1160 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1286 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1161 | { |
1287 | { |
1162 | object *tmp, *top, *floor = NULL; |
1288 | assert (!op->flag [FLAG_FREED]); |
1163 | sint16 x, y; |
|
|
1164 | |
1289 | |
1165 | if (QUERY_FLAG (op, FLAG_FREED)) |
1290 | op->remove (); |
1166 | { |
|
|
1167 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1168 | return NULL; |
|
|
1169 | } |
|
|
1170 | |
|
|
1171 | if (!m) |
|
|
1172 | { |
|
|
1173 | char *dump = dump_object (op); |
|
|
1174 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
|
|
1175 | free (dump); |
|
|
1176 | return op; |
|
|
1177 | } |
|
|
1178 | |
|
|
1179 | if (out_of_map (m, op->x, op->y)) |
|
|
1180 | { |
|
|
1181 | char *dump = dump_object (op); |
|
|
1182 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
|
|
1183 | #ifdef MANY_CORES |
|
|
1184 | /* Better to catch this here, as otherwise the next use of this object |
|
|
1185 | * is likely to cause a crash. Better to find out where it is getting |
|
|
1186 | * improperly inserted. |
|
|
1187 | */ |
|
|
1188 | abort (); |
|
|
1189 | #endif |
|
|
1190 | free (dump); |
|
|
1191 | return op; |
|
|
1192 | } |
|
|
1193 | |
|
|
1194 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1195 | { |
|
|
1196 | char *dump = dump_object (op); |
|
|
1197 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1198 | free (dump); |
|
|
1199 | return op; |
|
|
1200 | } |
|
|
1201 | |
|
|
1202 | if (op->more) |
|
|
1203 | { |
|
|
1204 | /* The part may be on a different map. */ |
|
|
1205 | |
|
|
1206 | object *more = op->more; |
|
|
1207 | |
|
|
1208 | /* We really need the caller to normalize coordinates - if |
|
|
1209 | * we set the map, that doesn't work if the location is within |
|
|
1210 | * a map and this is straddling an edge. So only if coordinate |
|
|
1211 | * is clear wrong do we normalize it. |
|
|
1212 | */ |
|
|
1213 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
|
|
1214 | more->map = get_map_from_coord (m, &more->x, &more->y); |
|
|
1215 | else if (!more->map) |
|
|
1216 | { |
|
|
1217 | /* For backwards compatibility - when not dealing with tiled maps, |
|
|
1218 | * more->map should always point to the parent. |
|
|
1219 | */ |
|
|
1220 | more->map = m; |
|
|
1221 | } |
|
|
1222 | |
|
|
1223 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
|
|
1224 | { |
|
|
1225 | if (!op->head) |
|
|
1226 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1227 | |
|
|
1228 | return 0; |
|
|
1229 | } |
|
|
1230 | } |
|
|
1231 | |
|
|
1232 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1233 | |
1291 | |
1234 | /* Ideally, the caller figures this out. However, it complicates a lot |
1292 | /* Ideally, the caller figures this out. However, it complicates a lot |
1235 | * of areas of callers (eg, anything that uses find_free_spot would now |
1293 | * of areas of callers (eg, anything that uses find_free_spot would now |
1236 | * need extra work |
1294 | * need extra work |
1237 | */ |
1295 | */ |
1238 | op->map = get_map_from_coord (m, &op->x, &op->y); |
1296 | if (!xy_normalise (m, op->x, op->y)) |
1239 | x = op->x; |
1297 | { |
1240 | y = op->y; |
1298 | op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found |
|
|
1299 | return 0; |
|
|
1300 | } |
|
|
1301 | |
|
|
1302 | if (object *more = op->more) |
|
|
1303 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1304 | return 0; |
|
|
1305 | |
|
|
1306 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1307 | |
|
|
1308 | op->map = m; |
|
|
1309 | mapspace &ms = op->ms (); |
1241 | |
1310 | |
1242 | /* this has to be done after we translate the coordinates. |
1311 | /* this has to be done after we translate the coordinates. |
1243 | */ |
1312 | */ |
1244 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1313 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1245 | for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) |
1314 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1246 | if (object::can_merge (op, tmp)) |
1315 | if (object::can_merge (op, tmp)) |
1247 | { |
1316 | { |
|
|
1317 | // TODO: we atcually want to update tmp, not op, |
|
|
1318 | // but some caller surely breaks when we return tmp |
|
|
1319 | // from here :/ |
1248 | op->nrof += tmp->nrof; |
1320 | op->nrof += tmp->nrof; |
1249 | tmp->destroy (); |
1321 | tmp->destroy (1); |
1250 | } |
1322 | } |
1251 | |
1323 | |
1252 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1324 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1253 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1325 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1254 | |
1326 | |
… | |
… | |
1267 | op->below = originator->below; |
1339 | op->below = originator->below; |
1268 | |
1340 | |
1269 | if (op->below) |
1341 | if (op->below) |
1270 | op->below->above = op; |
1342 | op->below->above = op; |
1271 | else |
1343 | else |
1272 | op->ms ().bot = op; |
1344 | ms.bot = op; |
1273 | |
1345 | |
1274 | /* since *below* originator, no need to update top */ |
1346 | /* since *below* originator, no need to update top */ |
1275 | originator->below = op; |
1347 | originator->below = op; |
1276 | } |
1348 | } |
1277 | else |
1349 | else |
1278 | { |
1350 | { |
|
|
1351 | object *top, *floor = NULL; |
|
|
1352 | |
|
|
1353 | top = ms.bot; |
|
|
1354 | |
1279 | /* If there are other objects, then */ |
1355 | /* If there are other objects, then */ |
1280 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1356 | if (top) |
1281 | { |
1357 | { |
1282 | object *last = 0; |
1358 | object *last = 0; |
1283 | |
1359 | |
1284 | /* |
1360 | /* |
1285 | * If there are multiple objects on this space, we do some trickier handling. |
1361 | * If there are multiple objects on this space, we do some trickier handling. |
… | |
… | |
1291 | * once we get to them. This reduces the need to traverse over all of |
1367 | * once we get to them. This reduces the need to traverse over all of |
1292 | * them when adding another one - this saves quite a bit of cpu time |
1368 | * them when adding another one - this saves quite a bit of cpu time |
1293 | * when lots of spells are cast in one area. Currently, it is presumed |
1369 | * when lots of spells are cast in one area. Currently, it is presumed |
1294 | * that flying non pickable objects are spell objects. |
1370 | * that flying non pickable objects are spell objects. |
1295 | */ |
1371 | */ |
1296 | while (top) |
1372 | for (top = ms.bot; top; top = top->above) |
1297 | { |
1373 | { |
1298 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1374 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1299 | floor = top; |
1375 | floor = top; |
1300 | |
1376 | |
1301 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1377 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1304 | top = top->below; |
1380 | top = top->below; |
1305 | break; |
1381 | break; |
1306 | } |
1382 | } |
1307 | |
1383 | |
1308 | last = top; |
1384 | last = top; |
1309 | top = top->above; |
|
|
1310 | } |
1385 | } |
1311 | |
1386 | |
1312 | /* Don't want top to be NULL, so set it to the last valid object */ |
1387 | /* Don't want top to be NULL, so set it to the last valid object */ |
1313 | top = last; |
1388 | top = last; |
1314 | |
1389 | |
… | |
… | |
1316 | * looks like instead of lots of conditions here. |
1391 | * looks like instead of lots of conditions here. |
1317 | * makes things faster, and effectively the same result. |
1392 | * makes things faster, and effectively the same result. |
1318 | */ |
1393 | */ |
1319 | |
1394 | |
1320 | /* Have object 'fall below' other objects that block view. |
1395 | /* Have object 'fall below' other objects that block view. |
1321 | * Unless those objects are exits, type 66 |
1396 | * Unless those objects are exits. |
1322 | * If INS_ON_TOP is used, don't do this processing |
1397 | * If INS_ON_TOP is used, don't do this processing |
1323 | * Need to find the object that in fact blocks view, otherwise |
1398 | * Need to find the object that in fact blocks view, otherwise |
1324 | * stacking is a bit odd. |
1399 | * stacking is a bit odd. |
1325 | */ |
1400 | */ |
1326 | if (!(flag & INS_ON_TOP) && |
1401 | if (!(flag & INS_ON_TOP) |
1327 | (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1402 | && ms.flags () & P_BLOCKSVIEW |
|
|
1403 | && (op->face && !faces [op->face].visibility)) |
1328 | { |
1404 | { |
1329 | for (last = top; last != floor; last = last->below) |
1405 | for (last = top; last != floor; last = last->below) |
1330 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1406 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1331 | break; |
1407 | break; |
|
|
1408 | |
1332 | /* Check to see if we found the object that blocks view, |
1409 | /* Check to see if we found the object that blocks view, |
1333 | * and make sure we have a below pointer for it so that |
1410 | * and make sure we have a below pointer for it so that |
1334 | * we can get inserted below this one, which requires we |
1411 | * we can get inserted below this one, which requires we |
1335 | * set top to the object below us. |
1412 | * set top to the object below us. |
1336 | */ |
1413 | */ |
1337 | if (last && last->below && last != floor) |
1414 | if (last && last->below && last != floor) |
1338 | top = last->below; |
1415 | top = last->below; |
1339 | } |
1416 | } |
1340 | } /* If objects on this space */ |
1417 | } /* If objects on this space */ |
1341 | |
1418 | |
1342 | if (flag & INS_MAP_LOAD) |
|
|
1343 | top = GET_MAP_TOP (op->map, op->x, op->y); |
|
|
1344 | |
|
|
1345 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1419 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1346 | top = floor; |
1420 | top = floor; |
1347 | |
1421 | |
1348 | /* Top is the object that our object (op) is going to get inserted above. |
1422 | /* Top is the object that our object (op) is going to get inserted above. |
1349 | */ |
1423 | */ |
1350 | |
1424 | |
1351 | /* First object on this space */ |
1425 | /* First object on this space */ |
1352 | if (!top) |
1426 | if (!top) |
1353 | { |
1427 | { |
1354 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1428 | op->above = ms.bot; |
1355 | |
1429 | |
1356 | if (op->above) |
1430 | if (op->above) |
1357 | op->above->below = op; |
1431 | op->above->below = op; |
1358 | |
1432 | |
1359 | op->below = 0; |
1433 | op->below = 0; |
1360 | op->ms ().bot = op; |
1434 | ms.bot = op; |
1361 | } |
1435 | } |
1362 | else |
1436 | else |
1363 | { /* get inserted into the stack above top */ |
1437 | { /* get inserted into the stack above top */ |
1364 | op->above = top->above; |
1438 | op->above = top->above; |
1365 | |
1439 | |
… | |
… | |
1369 | op->below = top; |
1443 | op->below = top; |
1370 | top->above = op; |
1444 | top->above = op; |
1371 | } |
1445 | } |
1372 | |
1446 | |
1373 | if (!op->above) |
1447 | if (!op->above) |
1374 | op->ms ().top = op; |
1448 | ms.top = op; |
1375 | } /* else not INS_BELOW_ORIGINATOR */ |
1449 | } /* else not INS_BELOW_ORIGINATOR */ |
1376 | |
1450 | |
1377 | if (op->type == PLAYER) |
1451 | if (op->type == PLAYER) |
1378 | { |
1452 | { |
1379 | op->contr->do_los = 1; |
1453 | op->contr->do_los = 1; |
1380 | ++op->map->players; |
1454 | ++op->map->players; |
1381 | op->map->last_access = runtime; |
1455 | op->map->touch (); |
1382 | } |
1456 | } |
1383 | |
1457 | |
1384 | op->map->dirty = true; |
1458 | op->map->dirty = true; |
1385 | |
1459 | |
1386 | /* If we have a floor, we know the player, if any, will be above |
|
|
1387 | * it, so save a few ticks and start from there. |
|
|
1388 | */ |
|
|
1389 | if (!(flag & INS_MAP_LOAD)) |
|
|
1390 | if (object *pl = op->ms ().player ()) |
1460 | if (object *pl = ms.player ()) |
|
|
1461 | //TODO: the floorbox prev/next might need updating |
|
|
1462 | //esrv_send_item (pl, op); |
|
|
1463 | //TODO: update floorbox to preserve ordering |
1391 | if (pl->contr->ns) |
1464 | if (pl->contr->ns) |
1392 | pl->contr->ns->floorbox_update (); |
1465 | pl->contr->ns->floorbox_update (); |
1393 | |
1466 | |
1394 | /* If this object glows, it may affect lighting conditions that are |
1467 | /* If this object glows, it may affect lighting conditions that are |
1395 | * visible to others on this map. But update_all_los is really |
1468 | * visible to others on this map. But update_all_los is really |
1396 | * an inefficient way to do this, as it means los for all players |
1469 | * an inefficient way to do this, as it means los for all players |
1397 | * on the map will get recalculated. The players could very well |
1470 | * on the map will get recalculated. The players could very well |
1398 | * be far away from this change and not affected in any way - |
1471 | * be far away from this change and not affected in any way - |
1399 | * this should get redone to only look for players within range, |
1472 | * this should get redone to only look for players within range, |
1400 | * or just updating the P_NEED_UPDATE for spaces within this area |
1473 | * or just updating the P_UPTODATE for spaces within this area |
1401 | * of effect may be sufficient. |
1474 | * of effect may be sufficient. |
1402 | */ |
1475 | */ |
1403 | if (op->map->darkness && (op->glow_radius != 0)) |
1476 | if (op->map->darkness && (op->glow_radius != 0)) |
1404 | update_all_los (op->map, op->x, op->y); |
1477 | update_all_los (op->map, op->x, op->y); |
1405 | |
1478 | |
… | |
… | |
1416 | * blocked() and wall() work properly), and these flags are updated by |
1489 | * blocked() and wall() work properly), and these flags are updated by |
1417 | * update_object(). |
1490 | * update_object(). |
1418 | */ |
1491 | */ |
1419 | |
1492 | |
1420 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1493 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1421 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1494 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1422 | { |
1495 | { |
1423 | if (check_move_on (op, originator)) |
1496 | if (check_move_on (op, originator)) |
1424 | return 0; |
1497 | return 0; |
1425 | |
1498 | |
1426 | /* If we are a multi part object, lets work our way through the check |
1499 | /* If we are a multi part object, lets work our way through the check |
1427 | * walk on's. |
1500 | * walk on's. |
1428 | */ |
1501 | */ |
1429 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1502 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1430 | if (check_move_on (tmp, originator)) |
1503 | if (check_move_on (tmp, originator)) |
1431 | return 0; |
1504 | return 0; |
1432 | } |
1505 | } |
1433 | |
1506 | |
1434 | return op; |
1507 | return op; |
… | |
… | |
1439 | * op is the object to insert it under: supplies x and the map. |
1512 | * op is the object to insert it under: supplies x and the map. |
1440 | */ |
1513 | */ |
1441 | void |
1514 | void |
1442 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1515 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1443 | { |
1516 | { |
1444 | object *tmp, *tmp1; |
|
|
1445 | |
|
|
1446 | /* first search for itself and remove any old instances */ |
1517 | /* first search for itself and remove any old instances */ |
1447 | |
1518 | |
1448 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above) |
1519 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1449 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1520 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1450 | tmp->destroy (); |
1521 | tmp->destroy (1); |
1451 | |
1522 | |
1452 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1523 | object *tmp = arch_to_object (archetype::find (arch_string)); |
1453 | |
1524 | |
1454 | tmp1->x = op->x; |
1525 | tmp->x = op->x; |
1455 | tmp1->y = op->y; |
1526 | tmp->y = op->y; |
|
|
1527 | |
1456 | insert_ob_in_map (tmp1, op->map, op, 0); |
1528 | insert_ob_in_map (tmp, op->map, op, 0); |
1457 | } |
1529 | } |
1458 | |
1530 | |
1459 | object * |
1531 | object * |
1460 | object::insert_at (object *where, object *originator, int flags) |
1532 | object::insert_at (object *where, object *originator, int flags) |
1461 | { |
1533 | { |
|
|
1534 | if (where->env) |
|
|
1535 | return where->env->insert (this); |
|
|
1536 | else |
1462 | where->map->insert (this, where->x, where->y, originator, flags); |
1537 | return where->map->insert (this, where->x, where->y, originator, flags); |
1463 | } |
1538 | } |
1464 | |
1539 | |
1465 | /* |
1540 | /* |
1466 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
|
|
1467 | * is returned contains nr objects, and the remaining parts contains |
|
|
1468 | * the rest (or is removed and freed if that number is 0). |
|
|
1469 | * On failure, NULL is returned, and the reason put into the |
|
|
1470 | * global static errmsg array. |
|
|
1471 | */ |
|
|
1472 | object * |
|
|
1473 | get_split_ob (object *orig_ob, uint32 nr) |
|
|
1474 | { |
|
|
1475 | object *newob; |
|
|
1476 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
|
|
1477 | |
|
|
1478 | if (orig_ob->nrof < nr) |
|
|
1479 | { |
|
|
1480 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
|
|
1481 | return NULL; |
|
|
1482 | } |
|
|
1483 | |
|
|
1484 | newob = object_create_clone (orig_ob); |
|
|
1485 | |
|
|
1486 | if ((orig_ob->nrof -= nr) < 1) |
|
|
1487 | orig_ob->destroy (1); |
|
|
1488 | else if (!is_removed) |
|
|
1489 | { |
|
|
1490 | if (orig_ob->env != NULL) |
|
|
1491 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
|
|
1492 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
|
|
1493 | { |
|
|
1494 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
|
|
1495 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
|
|
1496 | return NULL; |
|
|
1497 | } |
|
|
1498 | } |
|
|
1499 | |
|
|
1500 | newob->nrof = nr; |
|
|
1501 | |
|
|
1502 | return newob; |
|
|
1503 | } |
|
|
1504 | |
|
|
1505 | /* |
|
|
1506 | * decrease_ob_nr(object, number) decreases a specified number from |
1541 | * decrease(object, number) decreases a specified number from |
1507 | * the amount of an object. If the amount reaches 0, the object |
1542 | * the amount of an object. If the amount reaches 0, the object |
1508 | * is subsequently removed and freed. |
1543 | * is subsequently removed and freed. |
1509 | * |
1544 | * |
1510 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1545 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1511 | */ |
1546 | */ |
|
|
1547 | bool |
|
|
1548 | object::decrease (sint32 nr) |
|
|
1549 | { |
|
|
1550 | if (!nr) |
|
|
1551 | return true; |
1512 | |
1552 | |
|
|
1553 | nr = min (nr, nrof); |
|
|
1554 | |
|
|
1555 | nrof -= nr; |
|
|
1556 | |
|
|
1557 | if (nrof) |
|
|
1558 | { |
|
|
1559 | adjust_weight (env, -weight * nr); // carrying == 0 |
|
|
1560 | |
|
|
1561 | if (object *pl = visible_to ()) |
|
|
1562 | esrv_update_item (UPD_NROF, pl, this); |
|
|
1563 | |
|
|
1564 | return true; |
|
|
1565 | } |
|
|
1566 | else |
|
|
1567 | { |
|
|
1568 | destroy (1); |
|
|
1569 | return false; |
|
|
1570 | } |
|
|
1571 | } |
|
|
1572 | |
|
|
1573 | /* |
|
|
1574 | * split(ob,nr) splits up ob into two parts. The part which |
|
|
1575 | * is returned contains nr objects, and the remaining parts contains |
|
|
1576 | * the rest (or is removed and returned if that number is 0). |
|
|
1577 | * On failure, NULL is returned. |
|
|
1578 | */ |
1513 | object * |
1579 | object * |
1514 | decrease_ob_nr (object *op, uint32 i) |
1580 | object::split (sint32 nr) |
1515 | { |
1581 | { |
1516 | object *tmp; |
1582 | int have = number_of (); |
1517 | |
1583 | |
1518 | if (i == 0) /* objects with op->nrof require this check */ |
1584 | if (have < nr) |
1519 | return op; |
1585 | return 0; |
1520 | |
1586 | else if (have == nr) |
1521 | if (i > op->nrof) |
|
|
1522 | i = op->nrof; |
|
|
1523 | |
|
|
1524 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1525 | op->nrof -= i; |
|
|
1526 | else if (op->env) |
|
|
1527 | { |
1587 | { |
1528 | /* is this object in the players inventory, or sub container |
|
|
1529 | * therein? |
|
|
1530 | */ |
|
|
1531 | tmp = op->in_player (); |
|
|
1532 | /* nope. Is this a container the player has opened? |
|
|
1533 | * If so, set tmp to that player. |
|
|
1534 | * IMO, searching through all the players will mostly |
|
|
1535 | * likely be quicker than following op->env to the map, |
|
|
1536 | * and then searching the map for a player. |
|
|
1537 | */ |
|
|
1538 | if (!tmp) |
|
|
1539 | for_all_players (pl) |
|
|
1540 | if (pl->ob->container == op->env) |
|
|
1541 | { |
|
|
1542 | tmp = pl->ob; |
|
|
1543 | break; |
|
|
1544 | } |
|
|
1545 | |
|
|
1546 | if (i < op->nrof) |
|
|
1547 | { |
|
|
1548 | sub_weight (op->env, op->weight * i); |
|
|
1549 | op->nrof -= i; |
|
|
1550 | if (tmp) |
|
|
1551 | esrv_send_item (tmp, op); |
|
|
1552 | } |
|
|
1553 | else |
|
|
1554 | { |
|
|
1555 | op->remove (); |
1588 | remove (); |
1556 | op->nrof = 0; |
1589 | return this; |
1557 | if (tmp) |
|
|
1558 | esrv_del_item (tmp->contr, op->count); |
|
|
1559 | } |
|
|
1560 | } |
1590 | } |
1561 | else |
1591 | else |
1562 | { |
1592 | { |
1563 | object *above = op->above; |
1593 | decrease (nr); |
1564 | |
1594 | |
1565 | if (i < op->nrof) |
1595 | object *op = deep_clone (); |
1566 | op->nrof -= i; |
1596 | op->nrof = nr; |
1567 | else |
|
|
1568 | { |
|
|
1569 | op->remove (); |
|
|
1570 | op->nrof = 0; |
|
|
1571 | } |
|
|
1572 | |
|
|
1573 | /* Since we just removed op, op->above is null */ |
|
|
1574 | for (tmp = above; tmp; tmp = tmp->above) |
|
|
1575 | if (tmp->type == PLAYER) |
|
|
1576 | { |
|
|
1577 | if (op->nrof) |
|
|
1578 | esrv_send_item (tmp, op); |
|
|
1579 | else |
|
|
1580 | esrv_del_item (tmp->contr, op->count); |
|
|
1581 | } |
|
|
1582 | } |
|
|
1583 | |
|
|
1584 | if (op->nrof) |
|
|
1585 | return op; |
1597 | return op; |
1586 | else |
|
|
1587 | { |
|
|
1588 | op->destroy (); |
|
|
1589 | return 0; |
|
|
1590 | } |
|
|
1591 | } |
|
|
1592 | |
|
|
1593 | /* |
|
|
1594 | * add_weight(object, weight) adds the specified weight to an object, |
|
|
1595 | * and also updates how much the environment(s) is/are carrying. |
|
|
1596 | */ |
|
|
1597 | |
|
|
1598 | void |
|
|
1599 | add_weight (object *op, signed long weight) |
|
|
1600 | { |
|
|
1601 | while (op != NULL) |
|
|
1602 | { |
|
|
1603 | if (op->type == CONTAINER) |
|
|
1604 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
1605 | |
|
|
1606 | op->carrying += weight; |
|
|
1607 | op = op->env; |
|
|
1608 | } |
1598 | } |
1609 | } |
1599 | } |
1610 | |
1600 | |
1611 | object * |
1601 | object * |
1612 | insert_ob_in_ob (object *op, object *where) |
1602 | insert_ob_in_ob (object *op, object *where) |
… | |
… | |
1617 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1607 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1618 | free (dump); |
1608 | free (dump); |
1619 | return op; |
1609 | return op; |
1620 | } |
1610 | } |
1621 | |
1611 | |
1622 | if (where->head) |
1612 | if (where->head_ () != where) |
1623 | { |
1613 | { |
1624 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1614 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1625 | where = where->head; |
1615 | where = where->head; |
1626 | } |
1616 | } |
1627 | |
1617 | |
1628 | return where->insert (op); |
1618 | return where->insert (op); |
1629 | } |
1619 | } |
… | |
… | |
1634 | * inside the object environment. |
1624 | * inside the object environment. |
1635 | * |
1625 | * |
1636 | * The function returns now pointer to inserted item, and return value can |
1626 | * The function returns now pointer to inserted item, and return value can |
1637 | * be != op, if items are merged. -Tero |
1627 | * be != op, if items are merged. -Tero |
1638 | */ |
1628 | */ |
1639 | |
|
|
1640 | object * |
1629 | object * |
1641 | object::insert (object *op) |
1630 | object::insert (object *op) |
1642 | { |
1631 | { |
1643 | object *tmp, *otmp; |
|
|
1644 | |
|
|
1645 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1646 | op->remove (); |
|
|
1647 | |
|
|
1648 | if (op->more) |
1632 | if (op->more) |
1649 | { |
1633 | { |
1650 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1634 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1651 | return op; |
1635 | return op; |
1652 | } |
1636 | } |
1653 | |
1637 | |
1654 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1638 | op->remove (); |
1655 | CLEAR_FLAG (op, FLAG_REMOVED); |
1639 | |
|
|
1640 | op->flag [FLAG_OBJ_ORIGINAL] = 0; |
|
|
1641 | |
1656 | if (op->nrof) |
1642 | if (op->nrof) |
1657 | { |
|
|
1658 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1643 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1659 | if (object::can_merge (tmp, op)) |
1644 | if (object::can_merge (tmp, op)) |
1660 | { |
1645 | { |
1661 | /* return the original object and remove inserted object |
1646 | /* return the original object and remove inserted object |
1662 | (client needs the original object) */ |
1647 | (client needs the original object) */ |
1663 | tmp->nrof += op->nrof; |
1648 | tmp->nrof += op->nrof; |
1664 | /* Weight handling gets pretty funky. Since we are adding to |
1649 | |
1665 | * tmp->nrof, we need to increase the weight. |
1650 | if (object *pl = tmp->visible_to ()) |
1666 | */ |
1651 | esrv_update_item (UPD_NROF, pl, tmp); |
|
|
1652 | |
1667 | add_weight (this, op->weight * op->nrof); |
1653 | adjust_weight (this, op->total_weight ()); |
1668 | SET_FLAG (op, FLAG_REMOVED); |
1654 | |
1669 | op->destroy (); /* free the inserted object */ |
1655 | op->destroy (1); |
1670 | op = tmp; |
1656 | op = tmp; |
1671 | op->remove (); /* and fix old object's links */ |
1657 | goto inserted; |
1672 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1673 | break; |
|
|
1674 | } |
1658 | } |
1675 | |
1659 | |
1676 | /* I assume combined objects have no inventory |
1660 | op->owner = 0; // it's his/hers now. period. |
1677 | * We add the weight - this object could have just been removed |
|
|
1678 | * (if it was possible to merge). calling remove_ob will subtract |
|
|
1679 | * the weight, so we need to add it in again, since we actually do |
|
|
1680 | * the linking below |
|
|
1681 | */ |
|
|
1682 | add_weight (this, op->weight * op->nrof); |
|
|
1683 | } |
|
|
1684 | else |
|
|
1685 | add_weight (this, (op->weight + op->carrying)); |
|
|
1686 | |
|
|
1687 | otmp = this->in_player (); |
|
|
1688 | if (otmp && otmp->contr) |
|
|
1689 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
|
|
1690 | otmp->update_stats (); |
|
|
1691 | |
|
|
1692 | op->map = 0; |
1661 | op->map = 0; |
1693 | op->env = this; |
1662 | op->x = 0; |
|
|
1663 | op->y = 0; |
|
|
1664 | |
1694 | op->above = 0; |
1665 | op->above = 0; |
1695 | op->below = 0; |
1666 | op->below = inv; |
1696 | op->x = 0, op->y = 0; |
1667 | op->env = this; |
1697 | |
1668 | |
|
|
1669 | if (inv) |
|
|
1670 | inv->above = op; |
|
|
1671 | |
|
|
1672 | inv = op; |
|
|
1673 | |
|
|
1674 | op->flag [FLAG_REMOVED] = 0; |
|
|
1675 | |
|
|
1676 | if (object *pl = op->visible_to ()) |
|
|
1677 | esrv_send_item (pl, op); |
|
|
1678 | |
|
|
1679 | adjust_weight (this, op->total_weight ()); |
|
|
1680 | |
|
|
1681 | inserted: |
1698 | /* reset the light list and los of the players on the map */ |
1682 | /* reset the light list and los of the players on the map */ |
1699 | if ((op->glow_radius != 0) && map) |
1683 | if (op->glow_radius && map && map->darkness) |
1700 | { |
|
|
1701 | #ifdef DEBUG_LIGHTS |
|
|
1702 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
|
|
1703 | #endif /* DEBUG_LIGHTS */ |
|
|
1704 | if (map->darkness) |
|
|
1705 | update_all_los (map, x, y); |
1684 | update_all_los (map, x, y); |
1706 | } |
|
|
1707 | |
1685 | |
1708 | /* Client has no idea of ordering so lets not bother ordering it here. |
1686 | // if this is a player's inventory, update stats |
1709 | * It sure simplifies this function... |
1687 | if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER]) |
1710 | */ |
1688 | update_stats (); |
1711 | if (!inv) |
|
|
1712 | inv = op; |
|
|
1713 | else |
|
|
1714 | { |
|
|
1715 | op->below = inv; |
|
|
1716 | op->below->above = op; |
|
|
1717 | inv = op; |
|
|
1718 | } |
|
|
1719 | |
1689 | |
1720 | INVOKE_OBJECT (INSERT, this); |
1690 | INVOKE_OBJECT (INSERT, this); |
1721 | |
1691 | |
1722 | return op; |
1692 | return op; |
1723 | } |
1693 | } |
… | |
… | |
1776 | |
1746 | |
1777 | /* The objects have to be checked from top to bottom. |
1747 | /* The objects have to be checked from top to bottom. |
1778 | * Hence, we first go to the top: |
1748 | * Hence, we first go to the top: |
1779 | */ |
1749 | */ |
1780 | |
1750 | |
1781 | for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp && tmp->above; tmp = tmp->above) |
1751 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
1782 | { |
1752 | { |
1783 | /* Trim the search when we find the first other spell effect |
1753 | /* Trim the search when we find the first other spell effect |
1784 | * this helps performance so that if a space has 50 spell objects, |
1754 | * this helps performance so that if a space has 50 spell objects, |
1785 | * we don't need to check all of them. |
1755 | * we don't need to check all of them. |
1786 | */ |
1756 | */ |
… | |
… | |
1804 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1774 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1805 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1775 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1806 | { |
1776 | { |
1807 | |
1777 | |
1808 | float |
1778 | float |
1809 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1779 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1810 | |
1780 | |
1811 | if (op->type == PLAYER) |
1781 | if (op->type == PLAYER) |
1812 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1782 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1813 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1783 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1814 | diff /= 4.0; |
1784 | diff /= 4.0; |
… | |
… | |
1844 | * The first matching object is returned, or NULL if none. |
1814 | * The first matching object is returned, or NULL if none. |
1845 | */ |
1815 | */ |
1846 | object * |
1816 | object * |
1847 | present_arch (const archetype *at, maptile *m, int x, int y) |
1817 | present_arch (const archetype *at, maptile *m, int x, int y) |
1848 | { |
1818 | { |
1849 | if (m == NULL || out_of_map (m, x, y)) |
1819 | if (!m || out_of_map (m, x, y)) |
1850 | { |
1820 | { |
1851 | LOG (llevError, "Present_arch called outside map.\n"); |
1821 | LOG (llevError, "Present_arch called outside map.\n"); |
1852 | return NULL; |
1822 | return NULL; |
1853 | } |
1823 | } |
1854 | |
1824 | |
1855 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1825 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1856 | if (tmp->arch == at) |
1826 | if (tmp->arch->archname == at->archname) |
1857 | return tmp; |
1827 | return tmp; |
1858 | |
1828 | |
1859 | return NULL; |
1829 | return NULL; |
1860 | } |
1830 | } |
1861 | |
1831 | |
… | |
… | |
1871 | { |
1841 | { |
1872 | LOG (llevError, "Present called outside map.\n"); |
1842 | LOG (llevError, "Present called outside map.\n"); |
1873 | return NULL; |
1843 | return NULL; |
1874 | } |
1844 | } |
1875 | |
1845 | |
1876 | for (object *tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above) |
1846 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1877 | if (tmp->type == type) |
1847 | if (tmp->type == type) |
1878 | return tmp; |
1848 | return tmp; |
1879 | |
1849 | |
1880 | return NULL; |
1850 | return NULL; |
1881 | } |
1851 | } |
… | |
… | |
1925 | * The first matching object is returned, or NULL if none. |
1895 | * The first matching object is returned, or NULL if none. |
1926 | */ |
1896 | */ |
1927 | object * |
1897 | object * |
1928 | present_arch_in_ob (const archetype *at, const object *op) |
1898 | present_arch_in_ob (const archetype *at, const object *op) |
1929 | { |
1899 | { |
1930 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1900 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1931 | if (tmp->arch == at) |
1901 | if (tmp->arch->archname == at->archname) |
1932 | return tmp; |
1902 | return tmp; |
1933 | |
1903 | |
1934 | return NULL; |
1904 | return NULL; |
1935 | } |
1905 | } |
1936 | |
1906 | |
… | |
… | |
1938 | * activate recursively a flag on an object inventory |
1908 | * activate recursively a flag on an object inventory |
1939 | */ |
1909 | */ |
1940 | void |
1910 | void |
1941 | flag_inv (object *op, int flag) |
1911 | flag_inv (object *op, int flag) |
1942 | { |
1912 | { |
1943 | if (op->inv) |
|
|
1944 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1913 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1945 | { |
1914 | { |
1946 | SET_FLAG (tmp, flag); |
1915 | SET_FLAG (tmp, flag); |
1947 | flag_inv (tmp, flag); |
1916 | flag_inv (tmp, flag); |
1948 | } |
1917 | } |
1949 | } |
1918 | } |
1950 | |
1919 | |
1951 | /* |
1920 | /* |
1952 | * deactivate recursively a flag on an object inventory |
1921 | * deactivate recursively a flag on an object inventory |
1953 | */ |
1922 | */ |
1954 | void |
1923 | void |
1955 | unflag_inv (object *op, int flag) |
1924 | unflag_inv (object *op, int flag) |
1956 | { |
1925 | { |
1957 | if (op->inv) |
|
|
1958 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1926 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1959 | { |
1927 | { |
1960 | CLEAR_FLAG (tmp, flag); |
1928 | CLEAR_FLAG (tmp, flag); |
1961 | unflag_inv (tmp, flag); |
1929 | unflag_inv (tmp, flag); |
1962 | } |
1930 | } |
1963 | } |
|
|
1964 | |
|
|
1965 | /* |
|
|
1966 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
1967 | * all it's inventory (recursively). |
|
|
1968 | * If checksums are used, a player will get set_cheat called for |
|
|
1969 | * him/her-self and all object carried by a call to this function. |
|
|
1970 | */ |
|
|
1971 | void |
|
|
1972 | set_cheat (object *op) |
|
|
1973 | { |
|
|
1974 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
1975 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
1976 | } |
1931 | } |
1977 | |
1932 | |
1978 | /* |
1933 | /* |
1979 | * find_free_spot(object, map, x, y, start, stop) will search for |
1934 | * find_free_spot(object, map, x, y, start, stop) will search for |
1980 | * a spot at the given map and coordinates which will be able to contain |
1935 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
1982 | * to search (see the freearr_x/y[] definition). |
1937 | * to search (see the freearr_x/y[] definition). |
1983 | * It returns a random choice among the alternatives found. |
1938 | * It returns a random choice among the alternatives found. |
1984 | * start and stop are where to start relative to the free_arr array (1,9 |
1939 | * start and stop are where to start relative to the free_arr array (1,9 |
1985 | * does all 4 immediate directions). This returns the index into the |
1940 | * does all 4 immediate directions). This returns the index into the |
1986 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1941 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1987 | * Note - this only checks to see if there is space for the head of the |
|
|
1988 | * object - if it is a multispace object, this should be called for all |
|
|
1989 | * pieces. |
|
|
1990 | * Note2: This function does correctly handle tiled maps, but does not |
1942 | * Note: This function does correctly handle tiled maps, but does not |
1991 | * inform the caller. However, insert_ob_in_map will update as |
1943 | * inform the caller. However, insert_ob_in_map will update as |
1992 | * necessary, so the caller shouldn't need to do any special work. |
1944 | * necessary, so the caller shouldn't need to do any special work. |
1993 | * Note - updated to take an object instead of archetype - this is necessary |
1945 | * Note - updated to take an object instead of archetype - this is necessary |
1994 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1946 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1995 | * to know if the space in question will block the object. We can't use |
1947 | * to know if the space in question will block the object. We can't use |
… | |
… | |
1997 | * customized, changed states, etc. |
1949 | * customized, changed states, etc. |
1998 | */ |
1950 | */ |
1999 | int |
1951 | int |
2000 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1952 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2001 | { |
1953 | { |
|
|
1954 | int altern[SIZEOFFREE]; |
2002 | int index = 0, flag; |
1955 | int index = 0, flag; |
2003 | int altern[SIZEOFFREE]; |
|
|
2004 | |
1956 | |
2005 | for (int i = start; i < stop; i++) |
1957 | for (int i = start; i < stop; i++) |
2006 | { |
1958 | { |
2007 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
1959 | mapxy pos (m, x, y); pos.move (i); |
2008 | if (!flag) |
1960 | |
|
|
1961 | if (!pos.normalise ()) |
|
|
1962 | continue; |
|
|
1963 | |
|
|
1964 | mapspace &ms = *pos; |
|
|
1965 | |
|
|
1966 | if (ms.flags () & P_IS_ALIVE) |
|
|
1967 | continue; |
|
|
1968 | |
|
|
1969 | /* However, often |
|
|
1970 | * ob doesn't have any move type (when used to place exits) |
|
|
1971 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
1972 | */ |
|
|
1973 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
1974 | { |
2009 | altern [index++] = i; |
1975 | altern [index++] = i; |
|
|
1976 | continue; |
|
|
1977 | } |
2010 | |
1978 | |
2011 | /* Basically, if we find a wall on a space, we cut down the search size. |
1979 | /* Basically, if we find a wall on a space, we cut down the search size. |
2012 | * In this way, we won't return spaces that are on another side of a wall. |
1980 | * In this way, we won't return spaces that are on another side of a wall. |
2013 | * This mostly work, but it cuts down the search size in all directions - |
1981 | * This mostly work, but it cuts down the search size in all directions - |
2014 | * if the space being examined only has a wall to the north and empty |
1982 | * if the space being examined only has a wall to the north and empty |
2015 | * spaces in all the other directions, this will reduce the search space |
1983 | * spaces in all the other directions, this will reduce the search space |
2016 | * to only the spaces immediately surrounding the target area, and |
1984 | * to only the spaces immediately surrounding the target area, and |
2017 | * won't look 2 spaces south of the target space. |
1985 | * won't look 2 spaces south of the target space. |
2018 | */ |
1986 | */ |
2019 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
1987 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
1988 | { |
2020 | stop = maxfree[i]; |
1989 | stop = maxfree[i]; |
|
|
1990 | continue; |
|
|
1991 | } |
|
|
1992 | |
|
|
1993 | /* Note it is intentional that we check ob - the movement type of the |
|
|
1994 | * head of the object should correspond for the entire object. |
|
|
1995 | */ |
|
|
1996 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
1997 | continue; |
|
|
1998 | |
|
|
1999 | if (ob->blocked (m, pos.x, pos.y)) |
|
|
2000 | continue; |
|
|
2001 | |
|
|
2002 | altern [index++] = i; |
2021 | } |
2003 | } |
2022 | |
2004 | |
2023 | if (!index) |
2005 | if (!index) |
2024 | return -1; |
2006 | return -1; |
2025 | |
2007 | |
2026 | return altern[RANDOM () % index]; |
2008 | return altern [rndm (index)]; |
2027 | } |
2009 | } |
2028 | |
2010 | |
2029 | /* |
2011 | /* |
2030 | * find_first_free_spot(archetype, maptile, x, y) works like |
2012 | * find_first_free_spot(archetype, maptile, x, y) works like |
2031 | * find_free_spot(), but it will search max number of squares. |
2013 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
2034 | */ |
2016 | */ |
2035 | int |
2017 | int |
2036 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2018 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2037 | { |
2019 | { |
2038 | for (int i = 0; i < SIZEOFFREE; i++) |
2020 | for (int i = 0; i < SIZEOFFREE; i++) |
2039 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2021 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2040 | return i; |
2022 | return i; |
2041 | |
2023 | |
2042 | return -1; |
2024 | return -1; |
2043 | } |
2025 | } |
2044 | |
2026 | |
… | |
… | |
2052 | { |
2034 | { |
2053 | arr += begin; |
2035 | arr += begin; |
2054 | end -= begin; |
2036 | end -= begin; |
2055 | |
2037 | |
2056 | while (--end) |
2038 | while (--end) |
2057 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2039 | swap (arr [end], arr [rndm (end + 1)]); |
2058 | } |
2040 | } |
2059 | |
2041 | |
2060 | /* new function to make monster searching more efficient, and effective! |
2042 | /* new function to make monster searching more efficient, and effective! |
2061 | * This basically returns a randomized array (in the passed pointer) of |
2043 | * This basically returns a randomized array (in the passed pointer) of |
2062 | * the spaces to find monsters. In this way, it won't always look for |
2044 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2098 | object *tmp; |
2080 | object *tmp; |
2099 | maptile *mp; |
2081 | maptile *mp; |
2100 | |
2082 | |
2101 | MoveType blocked, move_type; |
2083 | MoveType blocked, move_type; |
2102 | |
2084 | |
2103 | if (exclude && exclude->head) |
2085 | if (exclude && exclude->head_ () != exclude) |
2104 | { |
2086 | { |
2105 | exclude = exclude->head; |
2087 | exclude = exclude->head; |
2106 | move_type = exclude->move_type; |
2088 | move_type = exclude->move_type; |
2107 | } |
2089 | } |
2108 | else |
2090 | else |
… | |
… | |
2131 | max = maxfree[i]; |
2113 | max = maxfree[i]; |
2132 | else if (mflags & P_IS_ALIVE) |
2114 | else if (mflags & P_IS_ALIVE) |
2133 | { |
2115 | { |
2134 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2116 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2135 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2117 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2136 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2118 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2137 | break; |
2119 | break; |
2138 | |
2120 | |
2139 | if (tmp) |
2121 | if (tmp) |
2140 | return freedir[i]; |
2122 | return freedir[i]; |
2141 | } |
2123 | } |
… | |
… | |
2196 | |
2178 | |
2197 | return 3; |
2179 | return 3; |
2198 | } |
2180 | } |
2199 | |
2181 | |
2200 | /* |
2182 | /* |
2201 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
2202 | * the "absolute" direction of a number (it actually takes care of |
|
|
2203 | * "overflow" in previous calculations of a direction). |
|
|
2204 | */ |
|
|
2205 | |
|
|
2206 | int |
|
|
2207 | absdir (int d) |
|
|
2208 | { |
|
|
2209 | while (d < 1) |
|
|
2210 | d += 8; |
|
|
2211 | |
|
|
2212 | while (d > 8) |
|
|
2213 | d -= 8; |
|
|
2214 | |
|
|
2215 | return d; |
|
|
2216 | } |
|
|
2217 | |
|
|
2218 | /* |
|
|
2219 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2183 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2220 | * between two directions (which are expected to be absolute (see absdir()) |
2184 | * between two directions (which are expected to be absolute (see absdir()) |
2221 | */ |
2185 | */ |
2222 | |
|
|
2223 | int |
2186 | int |
2224 | dirdiff (int dir1, int dir2) |
2187 | dirdiff (int dir1, int dir2) |
2225 | { |
2188 | { |
2226 | int d; |
2189 | int d; |
2227 | |
2190 | |
… | |
… | |
2340 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2303 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2341 | * core dumps if they do. |
2304 | * core dumps if they do. |
2342 | * |
2305 | * |
2343 | * Add a check so we can't pick up invisible objects (0.93.8) |
2306 | * Add a check so we can't pick up invisible objects (0.93.8) |
2344 | */ |
2307 | */ |
2345 | |
|
|
2346 | int |
2308 | int |
2347 | can_pick (const object *who, const object *item) |
2309 | can_pick (const object *who, const object *item) |
2348 | { |
2310 | { |
2349 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2311 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2350 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2312 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
… | |
… | |
2353 | |
2315 | |
2354 | /* |
2316 | /* |
2355 | * create clone from object to another |
2317 | * create clone from object to another |
2356 | */ |
2318 | */ |
2357 | object * |
2319 | object * |
2358 | object_create_clone (object *asrc) |
2320 | object::deep_clone () |
2359 | { |
2321 | { |
2360 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2322 | assert (("deep_clone called on non-head object", is_head ())); |
2361 | |
2323 | |
2362 | if (!asrc) |
2324 | object *dst = clone (); |
2363 | return 0; |
|
|
2364 | |
2325 | |
2365 | src = asrc; |
2326 | object *prev = dst; |
2366 | if (src->head) |
|
|
2367 | src = src->head; |
|
|
2368 | |
|
|
2369 | prev = 0; |
|
|
2370 | for (part = src; part; part = part->more) |
2327 | for (object *part = this->more; part; part = part->more) |
2371 | { |
2328 | { |
2372 | tmp = part->clone (); |
2329 | object *tmp = part->clone (); |
2373 | tmp->x -= src->x; |
|
|
2374 | tmp->y -= src->y; |
|
|
2375 | |
|
|
2376 | if (!part->head) |
|
|
2377 | { |
|
|
2378 | dst = tmp; |
|
|
2379 | tmp->head = 0; |
|
|
2380 | } |
|
|
2381 | else |
|
|
2382 | tmp->head = dst; |
2330 | tmp->head = dst; |
2383 | |
|
|
2384 | tmp->more = 0; |
|
|
2385 | |
|
|
2386 | if (prev) |
|
|
2387 | prev->more = tmp; |
2331 | prev->more = tmp; |
2388 | |
|
|
2389 | prev = tmp; |
2332 | prev = tmp; |
2390 | } |
2333 | } |
2391 | |
2334 | |
2392 | for (item = src->inv; item; item = item->below) |
2335 | for (object *item = inv; item; item = item->below) |
2393 | insert_ob_in_ob (object_create_clone (item), dst); |
2336 | insert_ob_in_ob (item->deep_clone (), dst); |
2394 | |
2337 | |
2395 | return dst; |
2338 | return dst; |
2396 | } |
|
|
2397 | |
|
|
2398 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2399 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2400 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2401 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2402 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2403 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2404 | object * |
|
|
2405 | load_object_str (const char *obstr) |
|
|
2406 | { |
|
|
2407 | object *op; |
|
|
2408 | char filename[MAX_BUF]; |
|
|
2409 | |
|
|
2410 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2411 | |
|
|
2412 | FILE *tempfile = fopen (filename, "w"); |
|
|
2413 | |
|
|
2414 | if (tempfile == NULL) |
|
|
2415 | { |
|
|
2416 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2417 | return NULL; |
|
|
2418 | } |
|
|
2419 | |
|
|
2420 | fprintf (tempfile, obstr); |
|
|
2421 | fclose (tempfile); |
|
|
2422 | |
|
|
2423 | op = object::create (); |
|
|
2424 | |
|
|
2425 | object_thawer thawer (filename); |
|
|
2426 | |
|
|
2427 | if (thawer) |
|
|
2428 | load_object (thawer, op, 0); |
|
|
2429 | |
|
|
2430 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2431 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2432 | |
|
|
2433 | return op; |
|
|
2434 | } |
2339 | } |
2435 | |
2340 | |
2436 | /* This returns the first object in who's inventory that |
2341 | /* This returns the first object in who's inventory that |
2437 | * has the same type and subtype match. |
2342 | * has the same type and subtype match. |
2438 | * returns NULL if no match. |
2343 | * returns NULL if no match. |
… | |
… | |
2445 | return tmp; |
2350 | return tmp; |
2446 | |
2351 | |
2447 | return 0; |
2352 | return 0; |
2448 | } |
2353 | } |
2449 | |
2354 | |
2450 | /* If ob has a field named key, return the link from the list, |
2355 | const shstr & |
2451 | * otherwise return NULL. |
2356 | object::kv_get (const shstr &key) const |
2452 | * |
|
|
2453 | * key must be a passed in shared string - otherwise, this won't |
|
|
2454 | * do the desired thing. |
|
|
2455 | */ |
|
|
2456 | key_value * |
|
|
2457 | get_ob_key_link (const object *ob, const char *key) |
|
|
2458 | { |
2357 | { |
2459 | for (key_value *link = ob->key_values; link; link = link->next) |
2358 | for (key_value *kv = key_values; kv; kv = kv->next) |
2460 | if (link->key == key) |
2359 | if (kv->key == key) |
2461 | return link; |
|
|
2462 | |
|
|
2463 | return 0; |
|
|
2464 | } |
|
|
2465 | |
|
|
2466 | /* |
|
|
2467 | * Returns the value of op has an extra_field for key, or NULL. |
|
|
2468 | * |
|
|
2469 | * The argument doesn't need to be a shared string. |
|
|
2470 | * |
|
|
2471 | * The returned string is shared. |
|
|
2472 | */ |
|
|
2473 | const char * |
|
|
2474 | get_ob_key_value (const object *op, const char *const key) |
|
|
2475 | { |
|
|
2476 | key_value *link; |
|
|
2477 | shstr_cmp canonical_key (key); |
|
|
2478 | |
|
|
2479 | if (!canonical_key) |
|
|
2480 | { |
|
|
2481 | /* 1. There being a field named key on any object |
|
|
2482 | * implies there'd be a shared string to find. |
|
|
2483 | * 2. Since there isn't, no object has this field. |
|
|
2484 | * 3. Therefore, *this* object doesn't have this field. |
|
|
2485 | */ |
|
|
2486 | return 0; |
|
|
2487 | } |
|
|
2488 | |
|
|
2489 | /* This is copied from get_ob_key_link() above - |
|
|
2490 | * only 4 lines, and saves the function call overhead. |
|
|
2491 | */ |
|
|
2492 | for (link = op->key_values; link; link = link->next) |
|
|
2493 | if (link->key == canonical_key) |
|
|
2494 | return link->value; |
2360 | return kv->value; |
2495 | |
2361 | |
2496 | return 0; |
2362 | return shstr_null; |
2497 | } |
2363 | } |
2498 | |
2364 | |
2499 | |
2365 | void |
2500 | /* |
2366 | object::kv_set (const shstr &key, const shstr &value) |
2501 | * Updates the canonical_key in op to value. |
|
|
2502 | * |
|
|
2503 | * canonical_key is a shared string (value doesn't have to be). |
|
|
2504 | * |
|
|
2505 | * Unless add_key is TRUE, it won't add fields, only change the value of existing |
|
|
2506 | * keys. |
|
|
2507 | * |
|
|
2508 | * Returns TRUE on success. |
|
|
2509 | */ |
|
|
2510 | int |
|
|
2511 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
|
|
2512 | { |
2367 | { |
2513 | key_value *field = NULL, *last = NULL; |
2368 | for (key_value *kv = key_values; kv; kv = kv->next) |
2514 | |
2369 | if (kv->key == key) |
2515 | for (field = op->key_values; field != NULL; field = field->next) |
|
|
2516 | { |
|
|
2517 | if (field->key != canonical_key) |
|
|
2518 | { |
2370 | { |
2519 | last = field; |
2371 | kv->value = value; |
2520 | continue; |
2372 | return; |
2521 | } |
2373 | } |
2522 | |
2374 | |
2523 | if (value) |
2375 | key_value *kv = new key_value; |
2524 | field->value = value; |
2376 | |
2525 | else |
2377 | kv->next = key_values; |
|
|
2378 | kv->key = key; |
|
|
2379 | kv->value = value; |
|
|
2380 | |
|
|
2381 | key_values = kv; |
|
|
2382 | } |
|
|
2383 | |
|
|
2384 | void |
|
|
2385 | object::kv_del (const shstr &key) |
|
|
2386 | { |
|
|
2387 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
|
|
2388 | if ((*kvp)->key == key) |
2526 | { |
2389 | { |
2527 | /* Basically, if the archetype has this key set, |
2390 | key_value *kv = *kvp; |
2528 | * we need to store the null value so when we save |
2391 | *kvp = (*kvp)->next; |
2529 | * it, we save the empty value so that when we load, |
2392 | delete kv; |
2530 | * we get this value back again. |
2393 | return; |
2531 | */ |
|
|
2532 | if (get_ob_key_link (&op->arch->clone, canonical_key)) |
|
|
2533 | field->value = 0; |
|
|
2534 | else |
|
|
2535 | { |
|
|
2536 | if (last) |
|
|
2537 | last->next = field->next; |
|
|
2538 | else |
|
|
2539 | op->key_values = field->next; |
|
|
2540 | |
|
|
2541 | delete field; |
|
|
2542 | } |
|
|
2543 | } |
2394 | } |
2544 | return TRUE; |
|
|
2545 | } |
|
|
2546 | /* IF we get here, key doesn't exist */ |
|
|
2547 | |
|
|
2548 | /* No field, we'll have to add it. */ |
|
|
2549 | |
|
|
2550 | if (!add_key) |
|
|
2551 | return FALSE; |
|
|
2552 | |
|
|
2553 | /* There isn't any good reason to store a null |
|
|
2554 | * value in the key/value list. If the archetype has |
|
|
2555 | * this key, then we should also have it, so shouldn't |
|
|
2556 | * be here. If user wants to store empty strings, |
|
|
2557 | * should pass in "" |
|
|
2558 | */ |
|
|
2559 | if (value == NULL) |
|
|
2560 | return TRUE; |
|
|
2561 | |
|
|
2562 | field = new key_value; |
|
|
2563 | |
|
|
2564 | field->key = canonical_key; |
|
|
2565 | field->value = value; |
|
|
2566 | /* Usual prepend-addition. */ |
|
|
2567 | field->next = op->key_values; |
|
|
2568 | op->key_values = field; |
|
|
2569 | |
|
|
2570 | return TRUE; |
|
|
2571 | } |
|
|
2572 | |
|
|
2573 | /* |
|
|
2574 | * Updates the key in op to value. |
|
|
2575 | * |
|
|
2576 | * If add_key is FALSE, this will only update existing keys, |
|
|
2577 | * and not add new ones. |
|
|
2578 | * In general, should be little reason FALSE is ever passed in for add_key |
|
|
2579 | * |
|
|
2580 | * Returns TRUE on success. |
|
|
2581 | */ |
|
|
2582 | int |
|
|
2583 | set_ob_key_value (object *op, const char *key, const char *value, int add_key) |
|
|
2584 | { |
|
|
2585 | shstr key_ (key); |
|
|
2586 | |
|
|
2587 | return set_ob_key_value_s (op, key_, value, add_key); |
|
|
2588 | } |
2395 | } |
2589 | |
2396 | |
2590 | object::depth_iterator::depth_iterator (object *container) |
2397 | object::depth_iterator::depth_iterator (object *container) |
2591 | : iterator_base (container) |
2398 | : iterator_base (container) |
2592 | { |
2399 | { |
… | |
… | |
2606 | } |
2413 | } |
2607 | else |
2414 | else |
2608 | item = item->env; |
2415 | item = item->env; |
2609 | } |
2416 | } |
2610 | |
2417 | |
2611 | |
|
|
2612 | const char * |
2418 | const char * |
2613 | object::flag_desc (char *desc, int len) const |
2419 | object::flag_desc (char *desc, int len) const |
2614 | { |
2420 | { |
2615 | char *p = desc; |
2421 | char *p = desc; |
2616 | bool first = true; |
2422 | bool first = true; |
|
|
2423 | |
|
|
2424 | *p = 0; |
2617 | |
2425 | |
2618 | for (int i = 0; i < NUM_FLAGS; i++) |
2426 | for (int i = 0; i < NUM_FLAGS; i++) |
2619 | { |
2427 | { |
2620 | if (len <= 10) // magic constant! |
2428 | if (len <= 10) // magic constant! |
2621 | { |
2429 | { |
2622 | snprintf (p, len, ",..."); |
2430 | snprintf (p, len, ",..."); |
2623 | break; |
2431 | break; |
2624 | } |
2432 | } |
2625 | |
2433 | |
2626 | if (flag[i]) |
2434 | if (flag [i]) |
2627 | { |
2435 | { |
2628 | int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
2436 | int cnt = snprintf (p, len, "%s%d", first ? "" : ",", i); |
2629 | len -= cnt; |
2437 | len -= cnt; |
2630 | p += cnt; |
2438 | p += cnt; |
2631 | first = false; |
2439 | first = false; |
… | |
… | |
2633 | } |
2441 | } |
2634 | |
2442 | |
2635 | return desc; |
2443 | return desc; |
2636 | } |
2444 | } |
2637 | |
2445 | |
2638 | // return a suitable string describing an objetc in enough detail to find it |
2446 | // return a suitable string describing an object in enough detail to find it |
2639 | const char * |
2447 | const char * |
2640 | object::debug_desc (char *info) const |
2448 | object::debug_desc (char *info) const |
2641 | { |
2449 | { |
2642 | char flagdesc[512]; |
2450 | char flagdesc[512]; |
2643 | char info2[256 * 4]; |
2451 | char info2[256 * 4]; |
2644 | char *p = info; |
2452 | char *p = info; |
2645 | |
2453 | |
2646 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}", |
2454 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2647 | count, uuid.seq, |
2455 | count, |
|
|
2456 | uuid.c_str (), |
2648 | &name, |
2457 | &name, |
2649 | title ? "\",title:" : "", |
2458 | title ? "\",title:\"" : "", |
2650 | title ? (const char *)title : "", |
2459 | title ? (const char *)title : "", |
2651 | flag_desc (flagdesc, 512), type); |
2460 | flag_desc (flagdesc, 512), type); |
2652 | |
2461 | |
2653 | if (env) |
2462 | if (!flag[FLAG_REMOVED] && env) |
2654 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2463 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2655 | |
2464 | |
2656 | if (map) |
2465 | if (map) |
2657 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2466 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2658 | |
2467 | |
… | |
… | |
2660 | } |
2469 | } |
2661 | |
2470 | |
2662 | const char * |
2471 | const char * |
2663 | object::debug_desc () const |
2472 | object::debug_desc () const |
2664 | { |
2473 | { |
2665 | static char info[256 * 3]; |
2474 | static char info[3][256 * 4]; |
|
|
2475 | static int info_idx; |
|
|
2476 | |
2666 | return debug_desc (info); |
2477 | return debug_desc (info [++info_idx % 3]); |
2667 | } |
2478 | } |
2668 | |
2479 | |
|
|
2480 | struct region * |
|
|
2481 | object::region () const |
|
|
2482 | { |
|
|
2483 | return map ? map->region (x, y) |
|
|
2484 | : region::default_region (); |
|
|
2485 | } |
|
|
2486 | |
|
|
2487 | const materialtype_t * |
|
|
2488 | object::dominant_material () const |
|
|
2489 | { |
|
|
2490 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2491 | return mt; |
|
|
2492 | |
|
|
2493 | return name_to_material (shstr_unknown); |
|
|
2494 | } |
|
|
2495 | |
|
|
2496 | void |
|
|
2497 | object::open_container (object *new_container) |
|
|
2498 | { |
|
|
2499 | if (container == new_container) |
|
|
2500 | return; |
|
|
2501 | |
|
|
2502 | object *old_container = container; |
|
|
2503 | |
|
|
2504 | if (old_container) |
|
|
2505 | { |
|
|
2506 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2507 | return; |
|
|
2508 | |
|
|
2509 | #if 0 |
|
|
2510 | // remove the "Close old_container" object. |
|
|
2511 | if (object *closer = old_container->inv) |
|
|
2512 | if (closer->type == CLOSE_CON) |
|
|
2513 | closer->destroy (); |
|
|
2514 | #endif |
|
|
2515 | |
|
|
2516 | // make sure the container is available |
|
|
2517 | esrv_send_item (this, old_container); |
|
|
2518 | |
|
|
2519 | old_container->flag [FLAG_APPLIED] = false; |
|
|
2520 | container = 0; |
|
|
2521 | |
|
|
2522 | // client needs item update to make it work, client bug requires this to be separate |
|
|
2523 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2524 | |
|
|
2525 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2526 | play_sound (sound_find ("chest_close")); |
|
|
2527 | } |
|
|
2528 | |
|
|
2529 | if (new_container) |
|
|
2530 | { |
|
|
2531 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2532 | return; |
|
|
2533 | |
|
|
2534 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2535 | #if 0 |
|
|
2536 | // insert the "Close Container" object. |
|
|
2537 | if (archetype *closer = new_container->other_arch) |
|
|
2538 | { |
|
|
2539 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2540 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2541 | new_container->insert (closer); |
|
|
2542 | } |
|
|
2543 | #endif |
|
|
2544 | |
|
|
2545 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2546 | |
|
|
2547 | // make sure the container is available, client bug requires this to be separate |
|
|
2548 | esrv_send_item (this, new_container); |
|
|
2549 | |
|
|
2550 | new_container->flag [FLAG_APPLIED] = true; |
|
|
2551 | container = new_container; |
|
|
2552 | |
|
|
2553 | // client needs flag change |
|
|
2554 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2555 | esrv_send_inventory (this, new_container); |
|
|
2556 | play_sound (sound_find ("chest_open")); |
|
|
2557 | } |
|
|
2558 | // else if (!old_container->env && contr && contr->ns) |
|
|
2559 | // contr->ns->floorbox_reset (); |
|
|
2560 | } |
|
|
2561 | |
|
|
2562 | object * |
|
|
2563 | object::force_find (const shstr name) |
|
|
2564 | { |
|
|
2565 | /* cycle through his inventory to look for the MARK we want to |
|
|
2566 | * place |
|
|
2567 | */ |
|
|
2568 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2569 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2570 | return splay (tmp); |
|
|
2571 | |
|
|
2572 | return 0; |
|
|
2573 | } |
|
|
2574 | |
|
|
2575 | void |
|
|
2576 | object::force_add (const shstr name, int duration) |
|
|
2577 | { |
|
|
2578 | if (object *force = force_find (name)) |
|
|
2579 | force->destroy (); |
|
|
2580 | |
|
|
2581 | object *force = get_archetype (FORCE_NAME); |
|
|
2582 | |
|
|
2583 | force->slaying = name; |
|
|
2584 | force->stats.food = 1; |
|
|
2585 | force->speed_left = -1.f; |
|
|
2586 | |
|
|
2587 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2588 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2589 | force->flag [FLAG_APPLIED] = true; |
|
|
2590 | |
|
|
2591 | insert (force); |
|
|
2592 | } |
|
|
2593 | |
|
|
2594 | void |
|
|
2595 | object::play_sound (faceidx sound) |
|
|
2596 | { |
|
|
2597 | if (!sound) |
|
|
2598 | return; |
|
|
2599 | |
|
|
2600 | if (flag [FLAG_REMOVED]) |
|
|
2601 | return; |
|
|
2602 | |
|
|
2603 | if (env) |
|
|
2604 | { |
|
|
2605 | if (object *pl = in_player ()) |
|
|
2606 | pl->contr->play_sound (sound); |
|
|
2607 | } |
|
|
2608 | else |
|
|
2609 | map->play_sound (sound, x, y); |
|
|
2610 | } |
|
|
2611 | |