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