1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
… | |
… | |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
|
|
25 | sub/add_weight will transcend the environment updating the carrying |
|
|
26 | variable. */ |
|
|
27 | #include <global.h> |
24 | #include <global.h> |
28 | #include <stdio.h> |
25 | #include <stdio.h> |
29 | #include <sys/types.h> |
26 | #include <sys/types.h> |
30 | #include <sys/uio.h> |
27 | #include <sys/uio.h> |
31 | #include <object.h> |
28 | #include <object.h> |
32 | #include <funcpoint.h> |
|
|
33 | #include <sproto.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 |
191 | // some objects are unmergable |
208 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
192 | if (!ob1->nrof || !ob2->nrof) |
209 | * value could not be stored in a sint32 (which unfortunately sometimes is |
193 | return 0; |
210 | * used to store nrof). |
194 | |
|
|
195 | /* Do not merge objects if nrof would overflow. First part checks |
|
|
196 | * for unsigned overflow (2c), second part checks whether the result |
|
|
197 | * would fit into a 32 bit signed int, which is often used to hold |
|
|
198 | * nrof values. |
211 | */ |
199 | */ |
212 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
200 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
213 | return 0; |
201 | return 0; |
214 | |
202 | |
215 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
203 | /* 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 |
204 | * 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 |
205 | * 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 |
206 | * are not equal - just if it has been identified, the been_applied |
219 | * flags lose any meaning. |
207 | * flags lose any meaning. |
220 | */ |
208 | */ |
221 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
209 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
222 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
210 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
223 | |
211 | |
224 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
212 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
225 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
213 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
226 | |
214 | |
227 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
215 | if (ob1->arch->archname != ob2->arch->archname |
228 | || ob1->arch != ob2->arch |
|
|
229 | || ob1->name != ob2->name |
216 | || ob1->name != ob2->name |
230 | || ob1->title != ob2->title |
217 | || ob1->title != ob2->title |
231 | || ob1->msg != ob2->msg |
218 | || ob1->msg != ob2->msg |
232 | || ob1->weight != ob2->weight |
219 | || 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 |
220 | || ob1->attacktype != ob2->attacktype |
236 | || ob1->magic != ob2->magic |
221 | || ob1->magic != ob2->magic |
237 | || ob1->slaying != ob2->slaying |
222 | || ob1->slaying != ob2->slaying |
238 | || ob1->skill != ob2->skill |
223 | || ob1->skill != ob2->skill |
239 | || ob1->value != ob2->value |
224 | || ob1->value != ob2->value |
240 | || ob1->animation_id != ob2->animation_id |
225 | || ob1->animation_id != ob2->animation_id |
|
|
226 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other |
241 | || ob1->client_type != ob2->client_type |
227 | || ob1->client_type != ob2->client_type |
242 | || ob1->materialname != ob2->materialname |
228 | || ob1->materialname != ob2->materialname |
243 | || ob1->lore != ob2->lore |
229 | || ob1->lore != ob2->lore |
244 | || ob1->subtype != ob2->subtype |
230 | || ob1->subtype != ob2->subtype |
245 | || ob1->move_type != ob2->move_type |
231 | || ob1->move_type != ob2->move_type |
246 | || ob1->move_block != ob2->move_block |
232 | || ob1->move_block != ob2->move_block |
247 | || ob1->move_allow != ob2->move_allow |
233 | || ob1->move_allow != ob2->move_allow |
248 | || ob1->move_on != ob2->move_on |
234 | || ob1->move_on != ob2->move_on |
249 | || ob1->move_off != ob2->move_off |
235 | || ob1->move_off != ob2->move_off |
250 | || ob1->move_slow != ob2->move_slow |
236 | || ob1->move_slow != ob2->move_slow |
251 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
237 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
|
|
238 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
239 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
252 | return 0; |
240 | return 0; |
253 | |
241 | |
|
|
242 | if ((ob1->flag ^ ob2->flag) |
|
|
243 | .reset (FLAG_INV_LOCKED) |
|
|
244 | .reset (FLAG_CLIENT_SENT) |
|
|
245 | .reset (FLAG_REMOVED) |
|
|
246 | .any ()) |
|
|
247 | return 0; |
|
|
248 | |
254 | /* This is really a spellbook check - really, we should |
249 | /* This is really a spellbook check - we should in general |
255 | * check all objects in the inventory. |
250 | * not merge objects with real inventories, as splitting them |
|
|
251 | * is hard. |
256 | */ |
252 | */ |
257 | if (ob1->inv || ob2->inv) |
253 | if (ob1->inv || ob2->inv) |
258 | { |
254 | { |
259 | /* if one object has inventory but the other doesn't, not equiv */ |
255 | if (!(ob1->inv && ob2->inv)) |
260 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
256 | return 0; /* inventories differ in length */ |
261 | return 0; |
|
|
262 | |
257 | |
263 | /* Now check to see if the two inventory objects could merge */ |
258 | if (ob1->inv->below || ob2->inv->below) |
|
|
259 | return 0; /* more than one object in inv */ |
|
|
260 | |
264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
261 | if (!object::can_merge (ob1->inv, ob2->inv)) |
265 | return 0; |
262 | return 0; /* inventory objects differ */ |
266 | |
263 | |
267 | /* inventory ok - still need to check rest of this object to see |
264 | /* inventory ok - still need to check rest of this object to see |
268 | * if it is valid. |
265 | * if it is valid. |
269 | */ |
266 | */ |
270 | } |
267 | } |
… | |
… | |
289 | if (ob1->level != ob2->level) |
286 | if (ob1->level != ob2->level) |
290 | return 0; |
287 | return 0; |
291 | break; |
288 | break; |
292 | } |
289 | } |
293 | |
290 | |
294 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
291 | if (ob1->key_values || ob2->key_values) |
295 | { |
292 | { |
296 | /* At least one of these has key_values. */ |
293 | /* At least one of these has key_values. */ |
297 | if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) |
294 | if ((!ob1->key_values) != (!ob2->key_values)) |
298 | /* One has fields, but the other one doesn't. */ |
295 | return 0; /* One has fields, but the other one doesn't. */ |
299 | return 0; |
296 | |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
297 | if (!compare_ob_value_lists (ob1, ob2)) |
301 | return 0; |
298 | return 0; |
302 | } |
299 | } |
303 | |
300 | |
304 | if (ob1->self || ob2->self) |
301 | if (ob1->self || ob2->self) |
305 | { |
302 | { |
306 | ob1->optimise (); |
303 | ob1->optimise (); |
307 | ob2->optimise (); |
304 | ob2->optimise (); |
308 | |
305 | |
309 | if (ob1->self || ob2->self) |
306 | if (ob1->self || ob2->self) |
|
|
307 | { |
|
|
308 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
|
|
309 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
|
|
310 | |
|
|
311 | if (k1 != k2) |
|
|
312 | return 0; |
|
|
313 | |
|
|
314 | if (k1 == 0) |
|
|
315 | return 1; |
|
|
316 | |
310 | if (!cfperl_can_merge (ob1, ob2)) |
317 | if (!cfperl_can_merge (ob1, ob2)) |
311 | return 0; |
318 | return 0; |
|
|
319 | } |
312 | } |
320 | } |
313 | |
321 | |
314 | /* Everything passes, must be OK. */ |
322 | /* Everything passes, must be OK. */ |
315 | return 1; |
323 | return 1; |
316 | } |
324 | } |
317 | |
325 | |
|
|
326 | // find player who can see this object |
|
|
327 | object * |
|
|
328 | object::visible_to () const |
|
|
329 | { |
|
|
330 | if (client_visible () && !flag [FLAG_REMOVED]) |
|
|
331 | { |
|
|
332 | // see if we are in a container of sorts |
|
|
333 | if (env) |
|
|
334 | { |
|
|
335 | // the player inventory itself is always visible |
|
|
336 | if (env->type == PLAYER) |
|
|
337 | return env; |
|
|
338 | |
|
|
339 | // else a player could have our env open |
|
|
340 | object *envest = env->outer_env (); |
|
|
341 | |
|
|
342 | // the player itself is always on a map, so we will find him here |
|
|
343 | // even if our inv is in a player. |
|
|
344 | if (envest->is_on_map ()) |
|
|
345 | if (object *pl = envest->ms ().player ()) |
|
|
346 | if (pl->container == env) |
|
|
347 | return pl; |
|
|
348 | } |
|
|
349 | else |
|
|
350 | { |
|
|
351 | // maybe there is a player standing on the same mapspace |
|
|
352 | // this will catch the case where "this" is a player |
|
|
353 | if (object *pl = ms ().player ()) |
|
|
354 | if (!pl->container || this == pl->container) |
|
|
355 | return pl; |
|
|
356 | } |
|
|
357 | } |
|
|
358 | |
|
|
359 | return 0; |
|
|
360 | } |
|
|
361 | |
|
|
362 | // adjust weight per container type ("of holding") |
|
|
363 | static sint32 |
|
|
364 | weight_adjust_for (object *op, sint32 weight) |
|
|
365 | { |
|
|
366 | return op->type == CONTAINER |
|
|
367 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
|
|
368 | : weight; |
|
|
369 | } |
|
|
370 | |
318 | /* |
371 | /* |
|
|
372 | * adjust_weight(object, weight) adds the specified weight to an object, |
|
|
373 | * and also updates how much the environment(s) is/are carrying. |
|
|
374 | */ |
|
|
375 | static void |
|
|
376 | adjust_weight (object *op, sint32 weight) |
|
|
377 | { |
|
|
378 | while (op) |
|
|
379 | { |
|
|
380 | // adjust by actual difference to account for rounding errors |
|
|
381 | // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct |
|
|
382 | weight = weight_adjust_for (op, op->carrying) |
|
|
383 | - weight_adjust_for (op, op->carrying - weight); |
|
|
384 | |
|
|
385 | if (!weight) |
|
|
386 | return; |
|
|
387 | |
|
|
388 | op->carrying += weight; |
|
|
389 | |
|
|
390 | if (object *pl = op->visible_to ()) |
|
|
391 | if (pl != op) // player is handled lazily |
|
|
392 | esrv_update_item (UPD_WEIGHT, pl, op); |
|
|
393 | |
|
|
394 | op = op->env; |
|
|
395 | } |
|
|
396 | } |
|
|
397 | |
|
|
398 | /* |
319 | * sum_weight() is a recursive function which calculates the weight |
399 | * this is a recursive function which calculates the weight |
320 | * an object is carrying. It goes through in figures out how much |
400 | * an object is carrying. It goes through op and figures out how much |
321 | * containers are carrying, and sums it up. |
401 | * containers are carrying, and sums it up. |
322 | */ |
402 | */ |
323 | long |
403 | void |
324 | sum_weight (object *op) |
404 | object::update_weight () |
325 | { |
405 | { |
326 | long sum; |
406 | sint32 sum = 0; |
327 | object *inv; |
|
|
328 | |
407 | |
329 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
408 | for (object *op = inv; op; op = op->below) |
330 | { |
409 | { |
331 | if (inv->inv) |
410 | if (op->inv) |
332 | sum_weight (inv); |
411 | op->update_weight (); |
333 | |
412 | |
334 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
413 | sum += op->total_weight (); |
|
|
414 | } |
|
|
415 | |
|
|
416 | sum = weight_adjust_for (this, sum); |
|
|
417 | |
|
|
418 | if (sum != carrying) |
335 | } |
419 | { |
336 | |
|
|
337 | if (op->type == CONTAINER && op->stats.Str) |
|
|
338 | sum = (sum * (100 - op->stats.Str)) / 100; |
|
|
339 | |
|
|
340 | if (op->carrying != sum) |
|
|
341 | op->carrying = sum; |
420 | carrying = sum; |
342 | |
421 | |
343 | return sum; |
422 | if (object *pl = visible_to ()) |
|
|
423 | if (pl != this) // player is handled lazily |
|
|
424 | esrv_update_item (UPD_WEIGHT, pl, this); |
|
|
425 | } |
344 | } |
426 | } |
345 | |
427 | |
346 | /** |
428 | /* |
347 | * Return the outermost environment object for a given object. |
429 | * Used by: Server DM commands: dumpbelow, dump. Some error messages. |
348 | */ |
|
|
349 | |
|
|
350 | object * |
|
|
351 | object_get_env_recursive (object *op) |
|
|
352 | { |
|
|
353 | while (op->env != NULL) |
|
|
354 | op = op->env; |
|
|
355 | return op; |
|
|
356 | } |
|
|
357 | |
|
|
358 | /* |
|
|
359 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
|
|
360 | * Some error messages. |
|
|
361 | * The result of the dump is stored in the static global errmsg array. |
|
|
362 | */ |
430 | */ |
363 | char * |
431 | char * |
364 | dump_object (object *op) |
432 | dump_object (object *op) |
365 | { |
433 | { |
366 | if (!op) |
434 | if (!op) |
… | |
… | |
380 | get_nearest_part (object *op, const object *pl) |
448 | get_nearest_part (object *op, const object *pl) |
381 | { |
449 | { |
382 | object *tmp, *closest; |
450 | object *tmp, *closest; |
383 | int last_dist, i; |
451 | int last_dist, i; |
384 | |
452 | |
385 | if (op->more == NULL) |
453 | if (!op->more) |
386 | return op; |
454 | return op; |
|
|
455 | |
387 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more) |
456 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
457 | tmp; |
|
|
458 | tmp = tmp->more) |
388 | if ((i = distance (tmp, pl)) < last_dist) |
459 | if ((i = distance (tmp, pl)) < last_dist) |
389 | closest = tmp, last_dist = i; |
460 | closest = tmp, last_dist = i; |
|
|
461 | |
390 | return closest; |
462 | return closest; |
391 | } |
463 | } |
392 | |
464 | |
393 | /* |
465 | /* |
394 | * Returns the object which has the count-variable equal to the argument. |
466 | * Returns the object which has the count-variable equal to the argument. |
|
|
467 | * VERRRY slow. |
395 | */ |
468 | */ |
396 | object * |
469 | object * |
397 | find_object (tag_t i) |
470 | find_object (tag_t i) |
398 | { |
471 | { |
399 | for_all_objects (op) |
472 | for_all_objects (op) |
… | |
… | |
410 | */ |
483 | */ |
411 | object * |
484 | object * |
412 | find_object_name (const char *str) |
485 | find_object_name (const char *str) |
413 | { |
486 | { |
414 | shstr_cmp str_ (str); |
487 | shstr_cmp str_ (str); |
415 | object *op; |
|
|
416 | |
488 | |
|
|
489 | if (str_) |
417 | for_all_objects (op) |
490 | for_all_objects (op) |
418 | if (op->name == str_) |
491 | if (op->name == str_) |
419 | break; |
492 | return op; |
420 | |
493 | |
421 | return op; |
494 | return 0; |
422 | } |
|
|
423 | |
|
|
424 | void |
|
|
425 | free_all_object_data () |
|
|
426 | { |
|
|
427 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
428 | } |
495 | } |
429 | |
496 | |
430 | /* |
497 | /* |
431 | * Sets the owner and sets the skill and exp pointers to owner's current |
498 | * Sets the owner and sets the skill and exp pointers to owner's current |
432 | * skill and experience objects. |
499 | * skill and experience objects. |
… | |
… | |
437 | { |
504 | { |
438 | // allow objects which own objects |
505 | // allow objects which own objects |
439 | if (owner) |
506 | if (owner) |
440 | while (owner->owner) |
507 | while (owner->owner) |
441 | owner = owner->owner; |
508 | owner = owner->owner; |
|
|
509 | |
|
|
510 | if (flag [FLAG_FREED]) |
|
|
511 | { |
|
|
512 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
|
|
513 | return; |
|
|
514 | } |
442 | |
515 | |
443 | this->owner = owner; |
516 | this->owner = owner; |
444 | } |
517 | } |
445 | |
518 | |
446 | int |
519 | int |
… | |
… | |
524 | } |
597 | } |
525 | |
598 | |
526 | op->key_values = 0; |
599 | op->key_values = 0; |
527 | } |
600 | } |
528 | |
601 | |
529 | object & |
602 | /* |
530 | object::operator =(const object &src) |
603 | * copy_to first frees everything allocated by the dst object, |
|
|
604 | * and then copies the contents of itself into the second |
|
|
605 | * object, allocating what needs to be allocated. Basically, any |
|
|
606 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
607 | * if the first object is freed, the pointers in the new object |
|
|
608 | * will point at garbage. |
|
|
609 | */ |
|
|
610 | void |
|
|
611 | object::copy_to (object *dst) |
531 | { |
612 | { |
532 | bool is_freed = flag [FLAG_FREED]; |
613 | dst->remove (); |
533 | bool is_removed = flag [FLAG_REMOVED]; |
|
|
534 | |
|
|
535 | *(object_copy *)this = src; |
614 | *(object_copy *)dst = *this; |
536 | |
|
|
537 | flag [FLAG_FREED] = is_freed; |
|
|
538 | flag [FLAG_REMOVED] = is_removed; |
615 | dst->flag [FLAG_REMOVED] = true; |
539 | |
616 | |
540 | /* Copy over key_values, if any. */ |
617 | /* Copy over key_values, if any. */ |
541 | if (src.key_values) |
618 | if (key_values) |
542 | { |
619 | { |
543 | key_value *tail = 0; |
620 | key_value *tail = 0; |
544 | key_values = 0; |
621 | dst->key_values = 0; |
545 | |
622 | |
546 | for (key_value *i = src.key_values; i; i = i->next) |
623 | for (key_value *i = key_values; i; i = i->next) |
547 | { |
624 | { |
548 | key_value *new_link = new key_value; |
625 | key_value *new_link = new key_value; |
549 | |
626 | |
550 | new_link->next = 0; |
627 | new_link->next = 0; |
551 | new_link->key = i->key; |
628 | new_link->key = i->key; |
552 | new_link->value = i->value; |
629 | new_link->value = i->value; |
553 | |
630 | |
554 | /* Try and be clever here, too. */ |
631 | /* Try and be clever here, too. */ |
555 | if (!key_values) |
632 | if (!dst->key_values) |
556 | { |
633 | { |
557 | key_values = new_link; |
634 | dst->key_values = new_link; |
558 | tail = new_link; |
635 | tail = new_link; |
559 | } |
636 | } |
560 | else |
637 | else |
561 | { |
638 | { |
562 | tail->next = new_link; |
639 | tail->next = new_link; |
563 | tail = new_link; |
640 | tail = new_link; |
564 | } |
641 | } |
565 | } |
642 | } |
566 | } |
643 | } |
567 | } |
|
|
568 | |
|
|
569 | /* |
|
|
570 | * copy_to first frees everything allocated by the dst object, |
|
|
571 | * and then copies the contents of itself into the second |
|
|
572 | * object, allocating what needs to be allocated. Basically, any |
|
|
573 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
574 | * if the first object is freed, the pointers in the new object |
|
|
575 | * will point at garbage. |
|
|
576 | */ |
|
|
577 | void |
|
|
578 | object::copy_to (object *dst) |
|
|
579 | { |
|
|
580 | *dst = *this; |
|
|
581 | |
644 | |
582 | if (speed < 0) |
645 | if (speed < 0) |
583 | dst->speed_left -= rndm (); |
646 | dst->speed_left -= rndm (); |
584 | |
647 | |
585 | dst->set_speed (dst->speed); |
648 | dst->set_speed (dst->speed); |
… | |
… | |
587 | |
650 | |
588 | void |
651 | void |
589 | object::instantiate () |
652 | object::instantiate () |
590 | { |
653 | { |
591 | if (!uuid.seq) // HACK |
654 | if (!uuid.seq) // HACK |
592 | uuid = gen_uuid (); |
655 | uuid = UUID::gen (); |
593 | |
656 | |
594 | speed_left = -0.1f; |
657 | speed_left = -0.1f; |
595 | /* copy the body_info to the body_used - this is only really |
658 | /* copy the body_info to the body_used - this is only really |
596 | * need for monsters, but doesn't hurt to do it for everything. |
659 | * need for monsters, but doesn't hurt to do it for everything. |
597 | * by doing so, when a monster is created, it has good starting |
660 | * by doing so, when a monster is created, it has good starting |
… | |
… | |
607 | object * |
670 | object * |
608 | object::clone () |
671 | object::clone () |
609 | { |
672 | { |
610 | object *neu = create (); |
673 | object *neu = create (); |
611 | copy_to (neu); |
674 | copy_to (neu); |
|
|
675 | neu->map = map; // not copied by copy_to |
612 | return neu; |
676 | return neu; |
613 | } |
677 | } |
614 | |
678 | |
615 | /* |
679 | /* |
616 | * If an object with the IS_TURNABLE() flag needs to be turned due |
680 | * If an object with the IS_TURNABLE() flag needs to be turned due |
… | |
… | |
667 | * UP_OBJ_FACE: only the objects face has changed. |
731 | * UP_OBJ_FACE: only the objects face has changed. |
668 | */ |
732 | */ |
669 | void |
733 | void |
670 | update_object (object *op, int action) |
734 | update_object (object *op, int action) |
671 | { |
735 | { |
672 | if (op == NULL) |
736 | if (!op) |
673 | { |
737 | { |
674 | /* this should never happen */ |
738 | /* this should never happen */ |
675 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
739 | LOG (llevError | logBacktrace, "update_object() called for NULL object.\n"); |
676 | return; |
740 | return; |
677 | } |
741 | } |
678 | |
742 | |
679 | if (op->env) |
743 | if (!op->is_on_map ()) |
680 | { |
744 | { |
681 | /* Animation is currently handled by client, so nothing |
745 | /* Animation is currently handled by client, so nothing |
682 | * to do in this case. |
746 | * to do in this case. |
683 | */ |
747 | */ |
684 | return; |
748 | return; |
685 | } |
749 | } |
686 | |
|
|
687 | /* If the map is saving, don't do anything as everything is |
|
|
688 | * going to get freed anyways. |
|
|
689 | */ |
|
|
690 | if (!op->map || op->map->in_memory == MAP_SAVING) |
|
|
691 | return; |
|
|
692 | |
750 | |
693 | /* make sure the object is within map boundaries */ |
751 | /* make sure the object is within map boundaries */ |
694 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
752 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
695 | { |
753 | { |
696 | LOG (llevError, "update_object() called for object out of map!\n"); |
754 | LOG (llevError, "update_object() called for object out of map!\n"); |
… | |
… | |
756 | static int object_count; |
814 | static int object_count; |
757 | |
815 | |
758 | void object::link () |
816 | void object::link () |
759 | { |
817 | { |
760 | assert (!index);//D |
818 | assert (!index);//D |
761 | uuid = gen_uuid (); |
819 | uuid = UUID::gen (); |
762 | count = ++object_count; |
820 | count = ++object_count; |
763 | |
821 | |
764 | refcnt_inc (); |
822 | refcnt_inc (); |
765 | objects.insert (this); |
823 | objects.insert (this); |
766 | } |
824 | } |
… | |
… | |
839 | object::destroy_inv (bool drop_to_ground) |
897 | object::destroy_inv (bool drop_to_ground) |
840 | { |
898 | { |
841 | // need to check first, because the checks below might segfault |
899 | // need to check first, because the checks below might segfault |
842 | // as we might be on an invalid mapspace and crossfire code |
900 | // as we might be on an invalid mapspace and crossfire code |
843 | // is too buggy to ensure that the inventory is empty. |
901 | // is too buggy to ensure that the inventory is empty. |
844 | // corollary: if you create arrows etc. with stuff in tis inventory, |
902 | // corollary: if you create arrows etc. with stuff in its inventory, |
845 | // cf will crash below with off-map x and y |
903 | // cf will crash below with off-map x and y |
846 | if (!inv) |
904 | if (!inv) |
847 | return; |
905 | return; |
848 | |
906 | |
849 | /* Only if the space blocks everything do we not process - |
907 | /* Only if the space blocks everything do we not process - |
850 | * if some form of movement is allowed, let objects |
908 | * if some form of movement is allowed, let objects |
851 | * drop on that space. |
909 | * drop on that space. |
852 | */ |
910 | */ |
853 | if (!drop_to_ground |
911 | if (!drop_to_ground |
854 | || !map |
912 | || !map |
855 | || map->in_memory != MAP_IN_MEMORY |
913 | || map->in_memory != MAP_ACTIVE |
856 | || map->nodrop |
914 | || map->no_drop |
857 | || ms ().move_block == MOVE_ALL) |
915 | || ms ().move_block == MOVE_ALL) |
858 | { |
916 | { |
859 | while (inv) |
917 | while (inv) |
860 | { |
918 | { |
861 | inv->destroy_inv (drop_to_ground); |
919 | inv->destroy_inv (false); |
862 | inv->destroy (); |
920 | inv->destroy (); |
863 | } |
921 | } |
864 | } |
922 | } |
865 | else |
923 | else |
866 | { /* Put objects in inventory onto this space */ |
924 | { /* Put objects in inventory onto this space */ |
… | |
… | |
872 | || op->flag [FLAG_NO_DROP] |
930 | || op->flag [FLAG_NO_DROP] |
873 | || op->type == RUNE |
931 | || op->type == RUNE |
874 | || op->type == TRAP |
932 | || op->type == TRAP |
875 | || op->flag [FLAG_IS_A_TEMPLATE] |
933 | || op->flag [FLAG_IS_A_TEMPLATE] |
876 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
934 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
877 | op->destroy (); |
935 | op->destroy (true); |
878 | else |
936 | else |
879 | map->insert (op, x, y); |
937 | map->insert (op, x, y); |
880 | } |
938 | } |
881 | } |
939 | } |
882 | } |
940 | } |
… | |
… | |
886 | object *op = new object; |
944 | object *op = new object; |
887 | op->link (); |
945 | op->link (); |
888 | return op; |
946 | return op; |
889 | } |
947 | } |
890 | |
948 | |
|
|
949 | static struct freed_map : maptile |
|
|
950 | { |
|
|
951 | freed_map () |
|
|
952 | { |
|
|
953 | path = "<freed objects map>"; |
|
|
954 | name = "/internal/freed_objects_map"; |
|
|
955 | width = 3; |
|
|
956 | height = 3; |
|
|
957 | no_drop = 1; |
|
|
958 | no_reset = 1; |
|
|
959 | |
|
|
960 | alloc (); |
|
|
961 | in_memory = MAP_ACTIVE; |
|
|
962 | } |
|
|
963 | |
|
|
964 | ~freed_map () |
|
|
965 | { |
|
|
966 | destroy (); |
|
|
967 | } |
|
|
968 | } freed_map; // freed objects are moved here to avoid crashes |
|
|
969 | |
891 | void |
970 | void |
892 | object::do_destroy () |
971 | object::do_destroy () |
893 | { |
972 | { |
894 | attachable::do_destroy (); |
|
|
895 | |
|
|
896 | if (flag [FLAG_IS_LINKED]) |
973 | if (flag [FLAG_IS_LINKED]) |
897 | remove_button_link (this); |
974 | remove_button_link (this); |
898 | |
975 | |
899 | if (flag [FLAG_FRIENDLY]) |
976 | if (flag [FLAG_FRIENDLY]) |
900 | remove_friendly_object (this); |
977 | remove_friendly_object (this); |
901 | |
978 | |
902 | if (!flag [FLAG_REMOVED]) |
|
|
903 | remove (); |
979 | remove (); |
904 | |
980 | |
905 | destroy_inv (true); |
981 | attachable::do_destroy (); |
906 | |
982 | |
907 | deactivate (); |
983 | deactivate (); |
908 | unlink (); |
984 | unlink (); |
909 | |
985 | |
910 | flag [FLAG_FREED] = 1; |
986 | flag [FLAG_FREED] = 1; |
911 | |
987 | |
912 | // hack to ensure that freed objects still have a valid map |
988 | // hack to ensure that freed objects still have a valid map |
913 | { |
|
|
914 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
915 | |
|
|
916 | if (!freed_map) |
|
|
917 | { |
|
|
918 | freed_map = new maptile; |
|
|
919 | |
|
|
920 | freed_map->path = "<freed objects map>"; |
|
|
921 | freed_map->name = "/internal/freed_objects_map"; |
|
|
922 | freed_map->width = 3; |
|
|
923 | freed_map->height = 3; |
|
|
924 | |
|
|
925 | freed_map->alloc (); |
|
|
926 | freed_map->in_memory = MAP_IN_MEMORY; |
|
|
927 | } |
|
|
928 | |
|
|
929 | map = freed_map; |
989 | map = &freed_map; |
930 | x = 1; |
990 | x = 1; |
931 | y = 1; |
991 | y = 1; |
932 | } |
|
|
933 | |
992 | |
934 | if (more) |
993 | if (more) |
935 | { |
994 | { |
936 | more->destroy (); |
995 | more->destroy (); |
937 | more = 0; |
996 | more = 0; |
… | |
… | |
950 | object::destroy (bool destroy_inventory) |
1009 | object::destroy (bool destroy_inventory) |
951 | { |
1010 | { |
952 | if (destroyed ()) |
1011 | if (destroyed ()) |
953 | return; |
1012 | return; |
954 | |
1013 | |
|
|
1014 | if (!is_head () && !head->destroyed ()) |
|
|
1015 | { |
|
|
1016 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
|
|
1017 | head->destroy (destroy_inventory); |
|
|
1018 | return; |
|
|
1019 | } |
|
|
1020 | |
955 | if (destroy_inventory) |
1021 | destroy_inv (!destroy_inventory); |
956 | destroy_inv (false); |
|
|
957 | |
1022 | |
958 | if (is_head ()) |
1023 | if (is_head ()) |
959 | if (sound_destroy) |
1024 | if (sound_destroy) |
960 | play_sound (sound_destroy); |
1025 | play_sound (sound_destroy); |
961 | else if (flag [FLAG_MONSTER]) |
1026 | else if (flag [FLAG_MONSTER]) |
962 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
1027 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
963 | |
1028 | |
964 | attachable::destroy (); |
1029 | attachable::destroy (); |
965 | } |
|
|
966 | |
|
|
967 | /* |
|
|
968 | * sub_weight() recursively (outwards) subtracts a number from the |
|
|
969 | * weight of an object (and what is carried by it's environment(s)). |
|
|
970 | */ |
|
|
971 | void |
|
|
972 | sub_weight (object *op, signed long weight) |
|
|
973 | { |
|
|
974 | while (op != NULL) |
|
|
975 | { |
|
|
976 | if (op->type == CONTAINER) |
|
|
977 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
978 | |
|
|
979 | op->carrying -= weight; |
|
|
980 | op = op->env; |
|
|
981 | } |
|
|
982 | } |
1030 | } |
983 | |
1031 | |
984 | /* op->remove (): |
1032 | /* op->remove (): |
985 | * This function removes the object op from the linked list of objects |
1033 | * This function removes the object op from the linked list of objects |
986 | * which it is currently tied to. When this function is done, the |
1034 | * which it is currently tied to. When this function is done, the |
… | |
… | |
992 | object::do_remove () |
1040 | object::do_remove () |
993 | { |
1041 | { |
994 | object *tmp, *last = 0; |
1042 | object *tmp, *last = 0; |
995 | object *otmp; |
1043 | object *otmp; |
996 | |
1044 | |
997 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1045 | if (flag [FLAG_REMOVED]) |
998 | return; |
1046 | return; |
999 | |
1047 | |
1000 | SET_FLAG (this, FLAG_REMOVED); |
|
|
1001 | INVOKE_OBJECT (REMOVE, this); |
1048 | INVOKE_OBJECT (REMOVE, this); |
|
|
1049 | |
|
|
1050 | flag [FLAG_REMOVED] = true; |
1002 | |
1051 | |
1003 | if (more) |
1052 | if (more) |
1004 | more->remove (); |
1053 | more->remove (); |
1005 | |
1054 | |
1006 | /* |
1055 | /* |
1007 | * In this case, the object to be removed is in someones |
1056 | * In this case, the object to be removed is in someones |
1008 | * inventory. |
1057 | * inventory. |
1009 | */ |
1058 | */ |
1010 | if (env) |
1059 | if (env) |
1011 | { |
1060 | { |
1012 | if (nrof) |
1061 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1013 | sub_weight (env, weight * nrof); |
1062 | if (object *pl = visible_to ()) |
1014 | else |
1063 | esrv_del_item (pl->contr, count); |
1015 | sub_weight (env, weight + carrying); |
1064 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
|
|
1065 | |
|
|
1066 | adjust_weight (env, -total_weight ()); |
|
|
1067 | |
|
|
1068 | /* we set up values so that it could be inserted into |
|
|
1069 | * the map, but we don't actually do that - it is up |
|
|
1070 | * to the caller to decide what we want to do. |
|
|
1071 | */ |
|
|
1072 | map = env->map; |
|
|
1073 | x = env->x; |
|
|
1074 | y = env->y; |
|
|
1075 | |
|
|
1076 | // make sure cmov optimisation is applicable |
|
|
1077 | *(above ? &above->below : &env->inv) = below; |
|
|
1078 | *(below ? &below->above : &above ) = above; // &above is just a dummy |
|
|
1079 | |
|
|
1080 | above = 0; |
|
|
1081 | below = 0; |
|
|
1082 | env = 0; |
1016 | |
1083 | |
1017 | /* NO_FIX_PLAYER is set when a great many changes are being |
1084 | /* NO_FIX_PLAYER is set when a great many changes are being |
1018 | * made to players inventory. If set, avoiding the call |
1085 | * made to players inventory. If set, avoiding the call |
1019 | * to save cpu time. |
1086 | * to save cpu time. |
1020 | */ |
1087 | */ |
1021 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1088 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1022 | otmp->update_stats (); |
1089 | otmp->update_stats (); |
1023 | |
|
|
1024 | if (above) |
|
|
1025 | above->below = below; |
|
|
1026 | else |
|
|
1027 | env->inv = below; |
|
|
1028 | |
|
|
1029 | if (below) |
|
|
1030 | below->above = above; |
|
|
1031 | |
|
|
1032 | /* we set up values so that it could be inserted into |
|
|
1033 | * the map, but we don't actually do that - it is up |
|
|
1034 | * to the caller to decide what we want to do. |
|
|
1035 | */ |
|
|
1036 | x = env->x, y = env->y; |
|
|
1037 | map = env->map; |
|
|
1038 | above = 0, below = 0; |
|
|
1039 | env = 0; |
|
|
1040 | } |
1090 | } |
1041 | else if (map) |
1091 | else if (map) |
1042 | { |
1092 | { |
1043 | if (type == PLAYER) |
|
|
1044 | { |
|
|
1045 | // leaving a spot always closes any open container on the ground |
|
|
1046 | if (container && !container->env) |
|
|
1047 | // this causes spurious floorbox updates, but it ensures |
|
|
1048 | // that the CLOSE event is being sent. |
|
|
1049 | close_container (); |
|
|
1050 | |
|
|
1051 | --map->players; |
|
|
1052 | map->touch (); |
|
|
1053 | } |
|
|
1054 | |
|
|
1055 | map->dirty = true; |
1093 | map->dirty = true; |
1056 | mapspace &ms = this->ms (); |
1094 | mapspace &ms = this->ms (); |
1057 | |
1095 | |
|
|
1096 | if (object *pl = ms.player ()) |
|
|
1097 | { |
|
|
1098 | if (type == PLAYER) // this == pl(!) |
|
|
1099 | { |
|
|
1100 | // leaving a spot always closes any open container on the ground |
|
|
1101 | if (container && !container->env) |
|
|
1102 | // this causes spurious floorbox updates, but it ensures |
|
|
1103 | // that the CLOSE event is being sent. |
|
|
1104 | close_container (); |
|
|
1105 | |
|
|
1106 | --map->players; |
|
|
1107 | map->touch (); |
|
|
1108 | } |
|
|
1109 | else if (pl->container == this) |
|
|
1110 | { |
|
|
1111 | // removing a container should close it |
|
|
1112 | close_container (); |
|
|
1113 | } |
|
|
1114 | |
|
|
1115 | esrv_del_item (pl->contr, count); |
|
|
1116 | } |
|
|
1117 | |
1058 | /* link the object above us */ |
1118 | /* link the object above us */ |
1059 | if (above) |
1119 | // re-link, make sure compiler can easily use cmove |
1060 | above->below = below; |
1120 | *(above ? &above->below : &ms.top) = below; |
1061 | else |
1121 | *(below ? &below->above : &ms.bot) = above; |
1062 | ms.top = below; /* we were top, set new top */ |
|
|
1063 | |
|
|
1064 | /* Relink the object below us, if there is one */ |
|
|
1065 | if (below) |
|
|
1066 | below->above = above; |
|
|
1067 | else |
|
|
1068 | { |
|
|
1069 | /* Nothing below, which means we need to relink map object for this space |
|
|
1070 | * use translated coordinates in case some oddness with map tiling is |
|
|
1071 | * evident |
|
|
1072 | */ |
|
|
1073 | if (GET_MAP_OB (map, x, y) != this) |
|
|
1074 | 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 ()); |
|
|
1075 | |
|
|
1076 | ms.bot = above; /* goes on above it. */ |
|
|
1077 | } |
|
|
1078 | |
1122 | |
1079 | above = 0; |
1123 | above = 0; |
1080 | below = 0; |
1124 | below = 0; |
1081 | |
1125 | |
1082 | if (map->in_memory == MAP_SAVING) |
1126 | if (map->in_memory == MAP_SAVING) |
… | |
… | |
1091 | * removed (most likely destroyed), update the player view |
1135 | * removed (most likely destroyed), update the player view |
1092 | * appropriately. |
1136 | * appropriately. |
1093 | */ |
1137 | */ |
1094 | pl->close_container (); |
1138 | pl->close_container (); |
1095 | |
1139 | |
|
|
1140 | //TODO: the floorbox prev/next might need updating |
|
|
1141 | //esrv_del_item (pl->contr, count); |
|
|
1142 | //TODO: update floorbox to preserve ordering |
|
|
1143 | if (pl->contr->ns) |
1096 | pl->contr->ns->floorbox_update (); |
1144 | pl->contr->ns->floorbox_update (); |
1097 | } |
1145 | } |
1098 | |
1146 | |
1099 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1147 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1100 | { |
1148 | { |
1101 | /* No point updating the players look faces if he is the object |
1149 | /* No point updating the players look faces if he is the object |
… | |
… | |
1140 | merge_ob (object *op, object *top) |
1188 | merge_ob (object *op, object *top) |
1141 | { |
1189 | { |
1142 | if (!op->nrof) |
1190 | if (!op->nrof) |
1143 | return 0; |
1191 | return 0; |
1144 | |
1192 | |
1145 | if (top) |
1193 | if (!top) |
1146 | for (top = op; top && top->above; top = top->above) |
1194 | for (top = op; top && top->above; top = top->above) |
1147 | ; |
1195 | ; |
1148 | |
1196 | |
1149 | for (; top; top = top->below) |
1197 | for (; top; top = top->below) |
1150 | { |
|
|
1151 | if (top == op) |
|
|
1152 | continue; |
|
|
1153 | |
|
|
1154 | if (object::can_merge (op, top)) |
1198 | if (object::can_merge (op, top)) |
1155 | { |
1199 | { |
1156 | top->nrof += op->nrof; |
1200 | top->nrof += op->nrof; |
1157 | |
1201 | |
1158 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1202 | if (object *pl = top->visible_to ()) |
1159 | op->weight = 0; /* Don't want any adjustements now */ |
1203 | esrv_update_item (UPD_NROF, pl, top); |
|
|
1204 | |
|
|
1205 | op->weight = 0; // cancel the addition above |
|
|
1206 | op->carrying = 0; // must be 0 already |
|
|
1207 | |
1160 | op->destroy (); |
1208 | op->destroy (1); |
|
|
1209 | |
1161 | return top; |
1210 | return top; |
1162 | } |
1211 | } |
1163 | } |
|
|
1164 | |
1212 | |
1165 | return 0; |
1213 | return 0; |
1166 | } |
1214 | } |
1167 | |
1215 | |
1168 | void |
1216 | void |
… | |
… | |
1193 | * job preparing multi-part monsters. |
1241 | * job preparing multi-part monsters. |
1194 | */ |
1242 | */ |
1195 | object * |
1243 | object * |
1196 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1244 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1197 | { |
1245 | { |
|
|
1246 | op->remove (); |
|
|
1247 | |
1198 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1248 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1199 | { |
1249 | { |
1200 | tmp->x = x + tmp->arch->x; |
1250 | tmp->x = x + tmp->arch->x; |
1201 | tmp->y = y + tmp->arch->y; |
1251 | tmp->y = y + tmp->arch->y; |
1202 | } |
1252 | } |
… | |
… | |
1225 | * just 'op' otherwise |
1275 | * just 'op' otherwise |
1226 | */ |
1276 | */ |
1227 | object * |
1277 | object * |
1228 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1278 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1229 | { |
1279 | { |
1230 | assert (!op->flag [FLAG_FREED]); |
1280 | if (op->is_on_map ()) |
1231 | |
|
|
1232 | object *top, *floor = NULL; |
|
|
1233 | |
|
|
1234 | op->remove (); |
|
|
1235 | |
|
|
1236 | if (out_of_map (m, op->x, op->y)) |
|
|
1237 | { |
1281 | { |
1238 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1282 | LOG (llevError, "insert_ob_in_map called for object already on map"); |
1239 | #ifdef MANY_CORES |
|
|
1240 | /* Better to catch this here, as otherwise the next use of this object |
|
|
1241 | * is likely to cause a crash. Better to find out where it is getting |
|
|
1242 | * improperly inserted. |
|
|
1243 | */ |
|
|
1244 | abort (); |
1283 | abort (); |
1245 | #endif |
1284 | } |
1246 | return op; |
1285 | |
|
|
1286 | if (op->env) |
1247 | } |
1287 | { |
|
|
1288 | LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)"); |
|
|
1289 | op->remove (); |
|
|
1290 | } |
1248 | |
1291 | |
1249 | if (object *more = op->more) |
1292 | if (op->face && !face_info (op->face))//D TODO: remove soon |
1250 | if (!insert_ob_in_map (more, m, originator, flag)) |
1293 | {//D |
1251 | return 0; |
1294 | LOG (llevError | logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D |
1252 | |
1295 | op->face = 1;//D |
1253 | CLEAR_FLAG (op, FLAG_REMOVED); |
1296 | }//D |
1254 | |
1297 | |
1255 | /* Ideally, the caller figures this out. However, it complicates a lot |
1298 | /* Ideally, the caller figures this out. However, it complicates a lot |
1256 | * of areas of callers (eg, anything that uses find_free_spot would now |
1299 | * of areas of callers (eg, anything that uses find_free_spot would now |
1257 | * need extra work |
1300 | * need extra work |
1258 | */ |
1301 | */ |
1259 | if (!xy_normalise (m, op->x, op->y)) |
1302 | if (!xy_normalise (m, op->x, op->y)) |
|
|
1303 | { |
|
|
1304 | op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found |
1260 | return 0; |
1305 | return 0; |
|
|
1306 | } |
|
|
1307 | |
|
|
1308 | if (object *more = op->more) |
|
|
1309 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1310 | return 0; |
|
|
1311 | |
|
|
1312 | CLEAR_FLAG (op, FLAG_REMOVED); |
1261 | |
1313 | |
1262 | op->map = m; |
1314 | op->map = m; |
1263 | mapspace &ms = op->ms (); |
1315 | mapspace &ms = op->ms (); |
1264 | |
1316 | |
1265 | /* this has to be done after we translate the coordinates. |
1317 | /* this has to be done after we translate the coordinates. |
1266 | */ |
1318 | */ |
1267 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1319 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1268 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1320 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1269 | if (object::can_merge (op, tmp)) |
1321 | if (object::can_merge (op, tmp)) |
1270 | { |
1322 | { |
|
|
1323 | // TODO: we actually want to update tmp, not op, |
|
|
1324 | // but some caller surely breaks when we return tmp |
|
|
1325 | // from here :/ |
1271 | op->nrof += tmp->nrof; |
1326 | op->nrof += tmp->nrof; |
1272 | tmp->destroy (); |
1327 | tmp->destroy (1); |
1273 | } |
1328 | } |
1274 | |
1329 | |
1275 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1330 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1276 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1331 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1277 | |
1332 | |
… | |
… | |
1284 | { |
1339 | { |
1285 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1340 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1286 | abort (); |
1341 | abort (); |
1287 | } |
1342 | } |
1288 | |
1343 | |
|
|
1344 | if (!originator->is_on_map ()) |
|
|
1345 | LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", |
|
|
1346 | op->debug_desc (), originator->debug_desc ()); |
|
|
1347 | |
1289 | op->above = originator; |
1348 | op->above = originator; |
1290 | op->below = originator->below; |
1349 | op->below = originator->below; |
1291 | |
|
|
1292 | if (op->below) |
|
|
1293 | op->below->above = op; |
|
|
1294 | else |
|
|
1295 | ms.bot = op; |
|
|
1296 | |
|
|
1297 | /* since *below* originator, no need to update top */ |
|
|
1298 | originator->below = op; |
1350 | originator->below = op; |
|
|
1351 | |
|
|
1352 | *(op->below ? &op->below->above : &ms.bot) = op; |
1299 | } |
1353 | } |
1300 | else |
1354 | else |
1301 | { |
1355 | { |
1302 | top = ms.bot; |
1356 | object *floor = 0; |
|
|
1357 | object *top = ms.top; |
1303 | |
1358 | |
1304 | /* If there are other objects, then */ |
1359 | /* If there are other objects, then */ |
1305 | if ((!(flag & INS_MAP_LOAD)) && top) |
1360 | if (top) |
1306 | { |
1361 | { |
1307 | object *last = 0; |
|
|
1308 | |
|
|
1309 | /* |
1362 | /* |
1310 | * If there are multiple objects on this space, we do some trickier handling. |
1363 | * If there are multiple objects on this space, we do some trickier handling. |
1311 | * We've already dealt with merging if appropriate. |
1364 | * We've already dealt with merging if appropriate. |
1312 | * Generally, we want to put the new object on top. But if |
1365 | * Generally, we want to put the new object on top. But if |
1313 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1366 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
… | |
… | |
1316 | * once we get to them. This reduces the need to traverse over all of |
1369 | * once we get to them. This reduces the need to traverse over all of |
1317 | * them when adding another one - this saves quite a bit of cpu time |
1370 | * them when adding another one - this saves quite a bit of cpu time |
1318 | * when lots of spells are cast in one area. Currently, it is presumed |
1371 | * when lots of spells are cast in one area. Currently, it is presumed |
1319 | * that flying non pickable objects are spell objects. |
1372 | * that flying non pickable objects are spell objects. |
1320 | */ |
1373 | */ |
1321 | for (top = ms.bot; top; top = top->above) |
1374 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1322 | { |
1375 | { |
1323 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1376 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR)) |
1324 | floor = top; |
1377 | floor = tmp; |
1325 | |
1378 | |
1326 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1379 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1327 | { |
1380 | { |
1328 | /* We insert above top, so we want this object below this */ |
1381 | /* We insert above top, so we want this object below this */ |
1329 | top = top->below; |
1382 | top = tmp->below; |
1330 | break; |
1383 | break; |
1331 | } |
1384 | } |
1332 | |
1385 | |
1333 | last = top; |
1386 | top = tmp; |
1334 | } |
1387 | } |
1335 | |
|
|
1336 | /* Don't want top to be NULL, so set it to the last valid object */ |
|
|
1337 | top = last; |
|
|
1338 | |
1388 | |
1339 | /* We let update_position deal with figuring out what the space |
1389 | /* We let update_position deal with figuring out what the space |
1340 | * looks like instead of lots of conditions here. |
1390 | * looks like instead of lots of conditions here. |
1341 | * makes things faster, and effectively the same result. |
1391 | * makes things faster, and effectively the same result. |
1342 | */ |
1392 | */ |
… | |
… | |
1349 | */ |
1399 | */ |
1350 | if (!(flag & INS_ON_TOP) |
1400 | if (!(flag & INS_ON_TOP) |
1351 | && ms.flags () & P_BLOCKSVIEW |
1401 | && ms.flags () & P_BLOCKSVIEW |
1352 | && (op->face && !faces [op->face].visibility)) |
1402 | && (op->face && !faces [op->face].visibility)) |
1353 | { |
1403 | { |
|
|
1404 | object *last; |
|
|
1405 | |
1354 | for (last = top; last != floor; last = last->below) |
1406 | for (last = top; last != floor; last = last->below) |
1355 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1407 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1356 | break; |
1408 | break; |
1357 | |
1409 | |
1358 | /* Check to see if we found the object that blocks view, |
1410 | /* Check to see if we found the object that blocks view, |
… | |
… | |
1362 | */ |
1414 | */ |
1363 | if (last && last->below && last != floor) |
1415 | if (last && last->below && last != floor) |
1364 | top = last->below; |
1416 | top = last->below; |
1365 | } |
1417 | } |
1366 | } /* If objects on this space */ |
1418 | } /* If objects on this space */ |
1367 | if (flag & INS_MAP_LOAD) |
|
|
1368 | top = ms.top; |
|
|
1369 | |
1419 | |
1370 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1420 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1371 | top = floor; |
1421 | top = floor; |
1372 | |
1422 | |
1373 | /* Top is the object that our object (op) is going to get inserted above. |
1423 | // insert object above top, or bottom-most if top = 0 |
1374 | */ |
|
|
1375 | |
|
|
1376 | /* First object on this space */ |
|
|
1377 | if (!top) |
1424 | if (!top) |
1378 | { |
1425 | { |
|
|
1426 | op->below = 0; |
1379 | op->above = ms.bot; |
1427 | op->above = ms.bot; |
1380 | |
|
|
1381 | if (op->above) |
|
|
1382 | op->above->below = op; |
|
|
1383 | |
|
|
1384 | op->below = 0; |
|
|
1385 | ms.bot = op; |
1428 | ms.bot = op; |
|
|
1429 | |
|
|
1430 | *(op->above ? &op->above->below : &ms.top) = op; |
1386 | } |
1431 | } |
1387 | else |
1432 | else |
1388 | { /* get inserted into the stack above top */ |
1433 | { |
1389 | op->above = top->above; |
1434 | op->above = top->above; |
1390 | |
|
|
1391 | if (op->above) |
|
|
1392 | op->above->below = op; |
1435 | top->above = op; |
1393 | |
1436 | |
1394 | op->below = top; |
1437 | op->below = top; |
1395 | top->above = op; |
1438 | *(op->above ? &op->above->below : &ms.top) = op; |
1396 | } |
1439 | } |
1397 | |
1440 | } |
1398 | if (!op->above) |
|
|
1399 | ms.top = op; |
|
|
1400 | } /* else not INS_BELOW_ORIGINATOR */ |
|
|
1401 | |
1441 | |
1402 | if (op->type == PLAYER) |
1442 | if (op->type == PLAYER) |
1403 | { |
1443 | { |
1404 | op->contr->do_los = 1; |
1444 | op->contr->do_los = 1; |
1405 | ++op->map->players; |
1445 | ++op->map->players; |
1406 | op->map->touch (); |
1446 | op->map->touch (); |
1407 | } |
1447 | } |
1408 | |
1448 | |
1409 | op->map->dirty = true; |
1449 | op->map->dirty = true; |
1410 | |
1450 | |
1411 | if (!(flag & INS_MAP_LOAD)) |
|
|
1412 | if (object *pl = ms.player ()) |
1451 | if (object *pl = ms.player ()) |
|
|
1452 | //TODO: the floorbox prev/next might need updating |
|
|
1453 | //esrv_send_item (pl, op); |
|
|
1454 | //TODO: update floorbox to preserve ordering |
|
|
1455 | if (pl->contr->ns) |
1413 | pl->contr->ns->floorbox_update (); |
1456 | pl->contr->ns->floorbox_update (); |
1414 | |
1457 | |
1415 | /* If this object glows, it may affect lighting conditions that are |
1458 | /* If this object glows, it may affect lighting conditions that are |
1416 | * visible to others on this map. But update_all_los is really |
1459 | * visible to others on this map. But update_all_los is really |
1417 | * an inefficient way to do this, as it means los for all players |
1460 | * an inefficient way to do this, as it means los for all players |
… | |
… | |
1460 | * op is the object to insert it under: supplies x and the map. |
1503 | * op is the object to insert it under: supplies x and the map. |
1461 | */ |
1504 | */ |
1462 | void |
1505 | void |
1463 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1506 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1464 | { |
1507 | { |
1465 | object *tmp, *tmp1; |
|
|
1466 | |
|
|
1467 | /* first search for itself and remove any old instances */ |
1508 | /* first search for itself and remove any old instances */ |
1468 | |
1509 | |
1469 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1510 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1470 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1511 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1471 | tmp->destroy (); |
1512 | tmp->destroy (1); |
1472 | |
1513 | |
1473 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1514 | object *tmp = arch_to_object (archetype::find (arch_string)); |
1474 | |
1515 | |
1475 | tmp1->x = op->x; |
1516 | tmp->x = op->x; |
1476 | tmp1->y = op->y; |
1517 | tmp->y = op->y; |
|
|
1518 | |
1477 | insert_ob_in_map (tmp1, op->map, op, 0); |
1519 | insert_ob_in_map (tmp, op->map, op, 0); |
1478 | } |
1520 | } |
1479 | |
1521 | |
1480 | object * |
1522 | object * |
1481 | object::insert_at (object *where, object *originator, int flags) |
1523 | object::insert_at (object *where, object *originator, int flags) |
1482 | { |
1524 | { |
|
|
1525 | if (where->env) |
|
|
1526 | return where->env->insert (this); |
|
|
1527 | else |
1483 | return where->map->insert (this, where->x, where->y, originator, flags); |
1528 | return where->map->insert (this, where->x, where->y, originator, flags); |
1484 | } |
1529 | } |
1485 | |
1530 | |
1486 | /* |
1531 | /* |
1487 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
|
|
1488 | * is returned contains nr objects, and the remaining parts contains |
|
|
1489 | * the rest (or is removed and freed if that number is 0). |
|
|
1490 | * On failure, NULL is returned, and the reason put into the |
|
|
1491 | * global static errmsg array. |
|
|
1492 | */ |
|
|
1493 | object * |
|
|
1494 | get_split_ob (object *orig_ob, uint32 nr) |
|
|
1495 | { |
|
|
1496 | object *newob; |
|
|
1497 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
|
|
1498 | |
|
|
1499 | if (orig_ob->nrof < nr) |
|
|
1500 | { |
|
|
1501 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
|
|
1502 | return NULL; |
|
|
1503 | } |
|
|
1504 | |
|
|
1505 | newob = object_create_clone (orig_ob); |
|
|
1506 | |
|
|
1507 | if ((orig_ob->nrof -= nr) < 1) |
|
|
1508 | orig_ob->destroy (1); |
|
|
1509 | else if (!is_removed) |
|
|
1510 | { |
|
|
1511 | if (orig_ob->env != NULL) |
|
|
1512 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
|
|
1513 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
|
|
1514 | { |
|
|
1515 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
|
|
1516 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
|
|
1517 | return NULL; |
|
|
1518 | } |
|
|
1519 | } |
|
|
1520 | |
|
|
1521 | newob->nrof = nr; |
|
|
1522 | |
|
|
1523 | return newob; |
|
|
1524 | } |
|
|
1525 | |
|
|
1526 | /* |
|
|
1527 | * decrease_ob_nr(object, number) decreases a specified number from |
1532 | * decrease(object, number) decreases a specified number from |
1528 | * the amount of an object. If the amount reaches 0, the object |
1533 | * the amount of an object. If the amount reaches 0, the object |
1529 | * is subsequently removed and freed. |
1534 | * is subsequently removed and freed. |
1530 | * |
1535 | * |
1531 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1536 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1532 | */ |
1537 | */ |
|
|
1538 | bool |
|
|
1539 | object::decrease (sint32 nr) |
|
|
1540 | { |
|
|
1541 | if (!nr) |
|
|
1542 | return true; |
|
|
1543 | |
|
|
1544 | nr = min (nr, nrof); |
|
|
1545 | |
|
|
1546 | nrof -= nr; |
|
|
1547 | |
|
|
1548 | if (nrof) |
|
|
1549 | { |
|
|
1550 | adjust_weight (env, -weight * nr); // carrying == 0 |
|
|
1551 | |
|
|
1552 | if (object *pl = visible_to ()) |
|
|
1553 | esrv_update_item (UPD_NROF, pl, this); |
|
|
1554 | |
|
|
1555 | return true; |
|
|
1556 | } |
|
|
1557 | else |
|
|
1558 | { |
|
|
1559 | destroy (1); |
|
|
1560 | return false; |
|
|
1561 | } |
|
|
1562 | } |
|
|
1563 | |
|
|
1564 | /* |
|
|
1565 | * split(ob,nr) splits up ob into two parts. The part which |
|
|
1566 | * is returned contains nr objects, and the remaining parts contains |
|
|
1567 | * the rest (or is removed and returned if that number is 0). |
|
|
1568 | * On failure, NULL is returned. |
|
|
1569 | */ |
1533 | object * |
1570 | object * |
1534 | decrease_ob_nr (object *op, uint32 i) |
1571 | object::split (sint32 nr) |
1535 | { |
1572 | { |
1536 | object *tmp; |
1573 | int have = number_of (); |
1537 | |
1574 | |
1538 | if (i == 0) /* objects with op->nrof require this check */ |
1575 | if (have < nr) |
1539 | return op; |
1576 | return 0; |
1540 | |
1577 | else if (have == nr) |
1541 | if (i > op->nrof) |
|
|
1542 | i = op->nrof; |
|
|
1543 | |
|
|
1544 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1545 | op->nrof -= i; |
|
|
1546 | else if (op->env) |
|
|
1547 | { |
1578 | { |
1548 | /* is this object in the players inventory, or sub container |
|
|
1549 | * therein? |
|
|
1550 | */ |
|
|
1551 | tmp = op->in_player (); |
|
|
1552 | /* nope. Is this a container the player has opened? |
|
|
1553 | * If so, set tmp to that player. |
|
|
1554 | * IMO, searching through all the players will mostly |
|
|
1555 | * likely be quicker than following op->env to the map, |
|
|
1556 | * and then searching the map for a player. |
|
|
1557 | */ |
|
|
1558 | if (!tmp) |
|
|
1559 | for_all_players (pl) |
|
|
1560 | if (pl->ob->container == op->env) |
|
|
1561 | { |
|
|
1562 | tmp = pl->ob; |
|
|
1563 | break; |
|
|
1564 | } |
|
|
1565 | |
|
|
1566 | if (i < op->nrof) |
|
|
1567 | { |
|
|
1568 | sub_weight (op->env, op->weight * i); |
|
|
1569 | op->nrof -= i; |
|
|
1570 | if (tmp) |
|
|
1571 | esrv_send_item (tmp, op); |
|
|
1572 | } |
|
|
1573 | else |
|
|
1574 | { |
|
|
1575 | op->remove (); |
1579 | remove (); |
1576 | op->nrof = 0; |
1580 | return this; |
1577 | if (tmp) |
|
|
1578 | esrv_del_item (tmp->contr, op->count); |
|
|
1579 | } |
|
|
1580 | } |
1581 | } |
1581 | else |
1582 | else |
1582 | { |
1583 | { |
1583 | object *above = op->above; |
1584 | decrease (nr); |
1584 | |
1585 | |
1585 | if (i < op->nrof) |
1586 | object *op = deep_clone (); |
1586 | op->nrof -= i; |
1587 | op->nrof = nr; |
1587 | else |
|
|
1588 | { |
|
|
1589 | op->remove (); |
|
|
1590 | op->nrof = 0; |
|
|
1591 | } |
|
|
1592 | |
|
|
1593 | /* Since we just removed op, op->above is null */ |
|
|
1594 | for (tmp = above; tmp; tmp = tmp->above) |
|
|
1595 | if (tmp->type == PLAYER) |
|
|
1596 | { |
|
|
1597 | if (op->nrof) |
|
|
1598 | esrv_send_item (tmp, op); |
|
|
1599 | else |
|
|
1600 | esrv_del_item (tmp->contr, op->count); |
|
|
1601 | } |
|
|
1602 | } |
|
|
1603 | |
|
|
1604 | if (op->nrof) |
|
|
1605 | return op; |
1588 | return op; |
1606 | else |
|
|
1607 | { |
|
|
1608 | op->destroy (); |
|
|
1609 | return 0; |
|
|
1610 | } |
|
|
1611 | } |
|
|
1612 | |
|
|
1613 | /* |
|
|
1614 | * add_weight(object, weight) adds the specified weight to an object, |
|
|
1615 | * and also updates how much the environment(s) is/are carrying. |
|
|
1616 | */ |
|
|
1617 | void |
|
|
1618 | add_weight (object *op, signed long weight) |
|
|
1619 | { |
|
|
1620 | while (op != NULL) |
|
|
1621 | { |
|
|
1622 | if (op->type == CONTAINER) |
|
|
1623 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
1624 | |
|
|
1625 | op->carrying += weight; |
|
|
1626 | op = op->env; |
|
|
1627 | } |
1589 | } |
1628 | } |
1590 | } |
1629 | |
1591 | |
1630 | object * |
1592 | object * |
1631 | insert_ob_in_ob (object *op, object *where) |
1593 | insert_ob_in_ob (object *op, object *where) |
… | |
… | |
1656 | * be != op, if items are merged. -Tero |
1618 | * be != op, if items are merged. -Tero |
1657 | */ |
1619 | */ |
1658 | object * |
1620 | object * |
1659 | object::insert (object *op) |
1621 | object::insert (object *op) |
1660 | { |
1622 | { |
1661 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1662 | op->remove (); |
|
|
1663 | |
|
|
1664 | if (op->more) |
1623 | if (op->more) |
1665 | { |
1624 | { |
1666 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1625 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1667 | return op; |
1626 | return op; |
1668 | } |
1627 | } |
1669 | |
1628 | |
1670 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1629 | op->remove (); |
1671 | CLEAR_FLAG (op, FLAG_REMOVED); |
1630 | |
|
|
1631 | op->flag [FLAG_OBJ_ORIGINAL] = 0; |
1672 | |
1632 | |
1673 | if (op->nrof) |
1633 | if (op->nrof) |
1674 | { |
|
|
1675 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1634 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1676 | if (object::can_merge (tmp, op)) |
1635 | if (object::can_merge (tmp, op)) |
1677 | { |
1636 | { |
1678 | /* return the original object and remove inserted object |
1637 | /* return the original object and remove inserted object |
1679 | (client needs the original object) */ |
1638 | (client needs the original object) */ |
1680 | tmp->nrof += op->nrof; |
1639 | tmp->nrof += op->nrof; |
1681 | /* Weight handling gets pretty funky. Since we are adding to |
1640 | |
1682 | * tmp->nrof, we need to increase the weight. |
1641 | if (object *pl = tmp->visible_to ()) |
1683 | */ |
1642 | esrv_update_item (UPD_NROF, pl, tmp); |
|
|
1643 | |
1684 | add_weight (this, op->weight * op->nrof); |
1644 | adjust_weight (this, op->total_weight ()); |
1685 | SET_FLAG (op, FLAG_REMOVED); |
1645 | |
1686 | op->destroy (); /* free the inserted object */ |
1646 | op->destroy (1); |
1687 | op = tmp; |
1647 | op = tmp; |
1688 | op->remove (); /* and fix old object's links */ |
1648 | goto inserted; |
1689 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1690 | break; |
|
|
1691 | } |
1649 | } |
1692 | |
1650 | |
1693 | /* I assume combined objects have no inventory |
|
|
1694 | * We add the weight - this object could have just been removed |
|
|
1695 | * (if it was possible to merge). calling remove_ob will subtract |
|
|
1696 | * the weight, so we need to add it in again, since we actually do |
|
|
1697 | * the linking below |
|
|
1698 | */ |
|
|
1699 | add_weight (this, op->weight * op->nrof); |
|
|
1700 | } |
|
|
1701 | else |
|
|
1702 | add_weight (this, (op->weight + op->carrying)); |
|
|
1703 | |
|
|
1704 | if (object *otmp = this->in_player ()) |
|
|
1705 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
|
|
1706 | otmp->update_stats (); |
|
|
1707 | |
|
|
1708 | op->owner = 0; // its his/hers now. period. |
1651 | op->owner = 0; // it's his/hers now. period. |
1709 | op->map = 0; |
1652 | op->map = 0; |
|
|
1653 | op->x = 0; |
|
|
1654 | op->y = 0; |
|
|
1655 | |
|
|
1656 | op->above = 0; |
|
|
1657 | op->below = inv; |
1710 | op->env = this; |
1658 | op->env = this; |
1711 | op->above = 0; |
|
|
1712 | op->below = 0; |
|
|
1713 | op->x = op->y = 0; |
|
|
1714 | |
1659 | |
|
|
1660 | if (inv) |
|
|
1661 | inv->above = op; |
|
|
1662 | |
|
|
1663 | inv = op; |
|
|
1664 | |
|
|
1665 | op->flag [FLAG_REMOVED] = 0; |
|
|
1666 | |
|
|
1667 | if (object *pl = op->visible_to ()) |
|
|
1668 | esrv_send_item (pl, op); |
|
|
1669 | |
|
|
1670 | adjust_weight (this, op->total_weight ()); |
|
|
1671 | |
|
|
1672 | inserted: |
1715 | /* reset the light list and los of the players on the map */ |
1673 | /* reset the light list and los of the players on the map */ |
1716 | if (op->glow_radius && map) |
1674 | if (op->glow_radius && map && map->darkness) |
1717 | { |
|
|
1718 | #ifdef DEBUG_LIGHTS |
|
|
1719 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
|
|
1720 | #endif /* DEBUG_LIGHTS */ |
|
|
1721 | if (map->darkness) |
|
|
1722 | update_all_los (map, x, y); |
1675 | update_all_los (map, x, y); |
1723 | } |
|
|
1724 | |
1676 | |
1725 | /* Client has no idea of ordering so lets not bother ordering it here. |
1677 | // if this is a player's inventory, update stats |
1726 | * It sure simplifies this function... |
1678 | if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER]) |
1727 | */ |
1679 | update_stats (); |
1728 | if (!inv) |
|
|
1729 | inv = op; |
|
|
1730 | else |
|
|
1731 | { |
|
|
1732 | op->below = inv; |
|
|
1733 | op->below->above = op; |
|
|
1734 | inv = op; |
|
|
1735 | } |
|
|
1736 | |
1680 | |
1737 | INVOKE_OBJECT (INSERT, this); |
1681 | INVOKE_OBJECT (INSERT, this); |
1738 | |
1682 | |
1739 | return op; |
1683 | return op; |
1740 | } |
1684 | } |
… | |
… | |
1868 | LOG (llevError, "Present_arch called outside map.\n"); |
1812 | LOG (llevError, "Present_arch called outside map.\n"); |
1869 | return NULL; |
1813 | return NULL; |
1870 | } |
1814 | } |
1871 | |
1815 | |
1872 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1816 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1873 | if (tmp->arch == at) |
1817 | if (tmp->arch->archname == at->archname) |
1874 | return tmp; |
1818 | return tmp; |
1875 | |
1819 | |
1876 | return NULL; |
1820 | return NULL; |
1877 | } |
1821 | } |
1878 | |
1822 | |
… | |
… | |
1942 | * The first matching object is returned, or NULL if none. |
1886 | * The first matching object is returned, or NULL if none. |
1943 | */ |
1887 | */ |
1944 | object * |
1888 | object * |
1945 | present_arch_in_ob (const archetype *at, const object *op) |
1889 | present_arch_in_ob (const archetype *at, const object *op) |
1946 | { |
1890 | { |
1947 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1891 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1948 | if (tmp->arch == at) |
1892 | if (tmp->arch->archname == at->archname) |
1949 | return tmp; |
1893 | return tmp; |
1950 | |
1894 | |
1951 | return NULL; |
1895 | return NULL; |
1952 | } |
1896 | } |
1953 | |
1897 | |
… | |
… | |
1955 | * activate recursively a flag on an object inventory |
1899 | * activate recursively a flag on an object inventory |
1956 | */ |
1900 | */ |
1957 | void |
1901 | void |
1958 | flag_inv (object *op, int flag) |
1902 | flag_inv (object *op, int flag) |
1959 | { |
1903 | { |
1960 | if (op->inv) |
|
|
1961 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1904 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1962 | { |
1905 | { |
1963 | SET_FLAG (tmp, flag); |
1906 | SET_FLAG (tmp, flag); |
1964 | flag_inv (tmp, flag); |
1907 | flag_inv (tmp, flag); |
1965 | } |
1908 | } |
1966 | } |
1909 | } |
1967 | |
1910 | |
1968 | /* |
1911 | /* |
1969 | * deactivate recursively a flag on an object inventory |
1912 | * deactivate recursively a flag on an object inventory |
1970 | */ |
1913 | */ |
1971 | void |
1914 | void |
1972 | unflag_inv (object *op, int flag) |
1915 | unflag_inv (object *op, int flag) |
1973 | { |
1916 | { |
1974 | if (op->inv) |
|
|
1975 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1917 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1976 | { |
1918 | { |
1977 | CLEAR_FLAG (tmp, flag); |
1919 | CLEAR_FLAG (tmp, flag); |
1978 | unflag_inv (tmp, flag); |
1920 | unflag_inv (tmp, flag); |
1979 | } |
1921 | } |
1980 | } |
1922 | } |
1981 | |
1923 | |
1982 | /* |
1924 | /* |
1983 | * find_free_spot(object, map, x, y, start, stop) will search for |
1925 | * find_free_spot(object, map, x, y, start, stop) will search for |
1984 | * a spot at the given map and coordinates which will be able to contain |
1926 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
1986 | * to search (see the freearr_x/y[] definition). |
1928 | * to search (see the freearr_x/y[] definition). |
1987 | * It returns a random choice among the alternatives found. |
1929 | * It returns a random choice among the alternatives found. |
1988 | * start and stop are where to start relative to the free_arr array (1,9 |
1930 | * start and stop are where to start relative to the free_arr array (1,9 |
1989 | * does all 4 immediate directions). This returns the index into the |
1931 | * does all 4 immediate directions). This returns the index into the |
1990 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1932 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1991 | * Note - this only checks to see if there is space for the head of the |
|
|
1992 | * object - if it is a multispace object, this should be called for all |
|
|
1993 | * pieces. |
|
|
1994 | * Note2: This function does correctly handle tiled maps, but does not |
1933 | * Note: This function does correctly handle tiled maps, but does not |
1995 | * inform the caller. However, insert_ob_in_map will update as |
1934 | * inform the caller. However, insert_ob_in_map will update as |
1996 | * necessary, so the caller shouldn't need to do any special work. |
1935 | * necessary, so the caller shouldn't need to do any special work. |
1997 | * Note - updated to take an object instead of archetype - this is necessary |
1936 | * Note - updated to take an object instead of archetype - this is necessary |
1998 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1937 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1999 | * to know if the space in question will block the object. We can't use |
1938 | * to know if the space in question will block the object. We can't use |
… | |
… | |
2001 | * customized, changed states, etc. |
1940 | * customized, changed states, etc. |
2002 | */ |
1941 | */ |
2003 | int |
1942 | int |
2004 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1943 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2005 | { |
1944 | { |
|
|
1945 | int altern[SIZEOFFREE]; |
2006 | int index = 0, flag; |
1946 | int index = 0, flag; |
2007 | int altern[SIZEOFFREE]; |
|
|
2008 | |
1947 | |
2009 | for (int i = start; i < stop; i++) |
1948 | for (int i = start; i < stop; i++) |
2010 | { |
1949 | { |
2011 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
1950 | mapxy pos (m, x, y); pos.move (i); |
2012 | if (!flag) |
1951 | |
|
|
1952 | if (!pos.normalise ()) |
|
|
1953 | continue; |
|
|
1954 | |
|
|
1955 | mapspace &ms = *pos; |
|
|
1956 | |
|
|
1957 | if (ms.flags () & P_IS_ALIVE) |
|
|
1958 | continue; |
|
|
1959 | |
|
|
1960 | /* However, often |
|
|
1961 | * ob doesn't have any move type (when used to place exits) |
|
|
1962 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
1963 | */ |
|
|
1964 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
1965 | { |
2013 | altern [index++] = i; |
1966 | altern [index++] = i; |
|
|
1967 | continue; |
|
|
1968 | } |
2014 | |
1969 | |
2015 | /* Basically, if we find a wall on a space, we cut down the search size. |
1970 | /* Basically, if we find a wall on a space, we cut down the search size. |
2016 | * In this way, we won't return spaces that are on another side of a wall. |
1971 | * In this way, we won't return spaces that are on another side of a wall. |
2017 | * This mostly work, but it cuts down the search size in all directions - |
1972 | * This mostly work, but it cuts down the search size in all directions - |
2018 | * if the space being examined only has a wall to the north and empty |
1973 | * if the space being examined only has a wall to the north and empty |
2019 | * spaces in all the other directions, this will reduce the search space |
1974 | * spaces in all the other directions, this will reduce the search space |
2020 | * to only the spaces immediately surrounding the target area, and |
1975 | * to only the spaces immediately surrounding the target area, and |
2021 | * won't look 2 spaces south of the target space. |
1976 | * won't look 2 spaces south of the target space. |
2022 | */ |
1977 | */ |
2023 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
1978 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
1979 | { |
2024 | stop = maxfree[i]; |
1980 | stop = maxfree[i]; |
|
|
1981 | continue; |
|
|
1982 | } |
|
|
1983 | |
|
|
1984 | /* Note it is intentional that we check ob - the movement type of the |
|
|
1985 | * head of the object should correspond for the entire object. |
|
|
1986 | */ |
|
|
1987 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
1988 | continue; |
|
|
1989 | |
|
|
1990 | if (ob->blocked (m, pos.x, pos.y)) |
|
|
1991 | continue; |
|
|
1992 | |
|
|
1993 | altern [index++] = i; |
2025 | } |
1994 | } |
2026 | |
1995 | |
2027 | if (!index) |
1996 | if (!index) |
2028 | return -1; |
1997 | return -1; |
2029 | |
1998 | |
… | |
… | |
2038 | */ |
2007 | */ |
2039 | int |
2008 | int |
2040 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2009 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2041 | { |
2010 | { |
2042 | for (int i = 0; i < SIZEOFFREE; i++) |
2011 | for (int i = 0; i < SIZEOFFREE; i++) |
2043 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2012 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2044 | return i; |
2013 | return i; |
2045 | |
2014 | |
2046 | return -1; |
2015 | return -1; |
2047 | } |
2016 | } |
2048 | |
2017 | |
… | |
… | |
2337 | |
2306 | |
2338 | /* |
2307 | /* |
2339 | * create clone from object to another |
2308 | * create clone from object to another |
2340 | */ |
2309 | */ |
2341 | object * |
2310 | object * |
2342 | object_create_clone (object *asrc) |
2311 | object::deep_clone () |
2343 | { |
2312 | { |
2344 | object *dst = 0, *tmp, *src, *prev, *item; |
2313 | assert (("deep_clone called on non-head object", is_head ())); |
2345 | |
2314 | |
2346 | if (!asrc) |
2315 | object *dst = clone (); |
2347 | return 0; |
|
|
2348 | |
2316 | |
2349 | src = asrc->head_ (); |
2317 | object *prev = dst; |
2350 | |
|
|
2351 | prev = 0; |
|
|
2352 | for (object *part = src; part; part = part->more) |
2318 | for (object *part = this->more; part; part = part->more) |
2353 | { |
2319 | { |
2354 | tmp = part->clone (); |
2320 | object *tmp = part->clone (); |
2355 | tmp->x -= src->x; |
|
|
2356 | tmp->y -= src->y; |
|
|
2357 | |
|
|
2358 | if (!part->head) |
|
|
2359 | { |
|
|
2360 | dst = tmp; |
|
|
2361 | tmp->head = 0; |
|
|
2362 | } |
|
|
2363 | else |
|
|
2364 | tmp->head = dst; |
2321 | tmp->head = dst; |
2365 | |
|
|
2366 | tmp->more = 0; |
|
|
2367 | |
|
|
2368 | if (prev) |
|
|
2369 | prev->more = tmp; |
2322 | prev->more = tmp; |
2370 | |
|
|
2371 | prev = tmp; |
2323 | prev = tmp; |
2372 | } |
2324 | } |
2373 | |
2325 | |
2374 | for (item = src->inv; item; item = item->below) |
2326 | for (object *item = inv; item; item = item->below) |
2375 | insert_ob_in_ob (object_create_clone (item), dst); |
2327 | insert_ob_in_ob (item->deep_clone (), dst); |
2376 | |
2328 | |
2377 | return dst; |
2329 | return dst; |
2378 | } |
2330 | } |
2379 | |
2331 | |
2380 | /* This returns the first object in who's inventory that |
2332 | /* This returns the first object in who's inventory that |
… | |
… | |
2389 | return tmp; |
2341 | return tmp; |
2390 | |
2342 | |
2391 | return 0; |
2343 | return 0; |
2392 | } |
2344 | } |
2393 | |
2345 | |
2394 | /* If ob has a field named key, return the link from the list, |
2346 | const shstr & |
2395 | * otherwise return NULL. |
2347 | object::kv_get (const shstr &key) const |
2396 | * |
|
|
2397 | * key must be a passed in shared string - otherwise, this won't |
|
|
2398 | * do the desired thing. |
|
|
2399 | */ |
|
|
2400 | key_value * |
|
|
2401 | get_ob_key_link (const object *ob, const char *key) |
|
|
2402 | { |
2348 | { |
2403 | for (key_value *link = ob->key_values; link; link = link->next) |
2349 | for (key_value *kv = key_values; kv; kv = kv->next) |
2404 | if (link->key == key) |
2350 | if (kv->key == key) |
2405 | return link; |
|
|
2406 | |
|
|
2407 | return 0; |
|
|
2408 | } |
|
|
2409 | |
|
|
2410 | /* |
|
|
2411 | * Returns the value of op has an extra_field for key, or NULL. |
|
|
2412 | * |
|
|
2413 | * The argument doesn't need to be a shared string. |
|
|
2414 | * |
|
|
2415 | * The returned string is shared. |
|
|
2416 | */ |
|
|
2417 | const char * |
|
|
2418 | get_ob_key_value (const object *op, const char *const key) |
|
|
2419 | { |
|
|
2420 | key_value *link; |
|
|
2421 | shstr_cmp canonical_key (key); |
|
|
2422 | |
|
|
2423 | if (!canonical_key) |
|
|
2424 | { |
|
|
2425 | /* 1. There being a field named key on any object |
|
|
2426 | * implies there'd be a shared string to find. |
|
|
2427 | * 2. Since there isn't, no object has this field. |
|
|
2428 | * 3. Therefore, *this* object doesn't have this field. |
|
|
2429 | */ |
|
|
2430 | return 0; |
|
|
2431 | } |
|
|
2432 | |
|
|
2433 | /* This is copied from get_ob_key_link() above - |
|
|
2434 | * only 4 lines, and saves the function call overhead. |
|
|
2435 | */ |
|
|
2436 | for (link = op->key_values; link; link = link->next) |
|
|
2437 | if (link->key == canonical_key) |
|
|
2438 | return link->value; |
2351 | return kv->value; |
2439 | |
2352 | |
2440 | return 0; |
2353 | return shstr_null; |
2441 | } |
2354 | } |
2442 | |
2355 | |
2443 | /* |
2356 | void |
2444 | * Updates the canonical_key in op to value. |
2357 | object::kv_set (const shstr &key, const shstr &value) |
2445 | * |
|
|
2446 | * canonical_key is a shared string (value doesn't have to be). |
|
|
2447 | * |
|
|
2448 | * Unless add_key is TRUE, it won't add fields, only change the value of existing |
|
|
2449 | * keys. |
|
|
2450 | * |
|
|
2451 | * Returns TRUE on success. |
|
|
2452 | */ |
|
|
2453 | int |
|
|
2454 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
|
|
2455 | { |
2358 | { |
2456 | key_value *field = NULL, *last = NULL; |
2359 | for (key_value *kv = key_values; kv; kv = kv->next) |
2457 | |
2360 | if (kv->key == key) |
2458 | for (field = op->key_values; field != NULL; field = field->next) |
|
|
2459 | { |
|
|
2460 | if (field->key != canonical_key) |
|
|
2461 | { |
2361 | { |
2462 | last = field; |
2362 | kv->value = value; |
2463 | continue; |
2363 | return; |
2464 | } |
2364 | } |
2465 | |
2365 | |
2466 | if (value) |
2366 | key_value *kv = new key_value; |
2467 | field->value = value; |
2367 | |
2468 | else |
2368 | kv->next = key_values; |
|
|
2369 | kv->key = key; |
|
|
2370 | kv->value = value; |
|
|
2371 | |
|
|
2372 | key_values = kv; |
|
|
2373 | } |
|
|
2374 | |
|
|
2375 | void |
|
|
2376 | object::kv_del (const shstr &key) |
|
|
2377 | { |
|
|
2378 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
|
|
2379 | if ((*kvp)->key == key) |
2469 | { |
2380 | { |
2470 | /* Basically, if the archetype has this key set, |
2381 | key_value *kv = *kvp; |
2471 | * we need to store the null value so when we save |
2382 | *kvp = (*kvp)->next; |
2472 | * it, we save the empty value so that when we load, |
2383 | delete kv; |
2473 | * we get this value back again. |
2384 | return; |
2474 | */ |
|
|
2475 | if (get_ob_key_link (op->arch, canonical_key)) |
|
|
2476 | field->value = 0; |
|
|
2477 | else |
|
|
2478 | { |
|
|
2479 | if (last) |
|
|
2480 | last->next = field->next; |
|
|
2481 | else |
|
|
2482 | op->key_values = field->next; |
|
|
2483 | |
|
|
2484 | delete field; |
|
|
2485 | } |
|
|
2486 | } |
2385 | } |
2487 | return TRUE; |
|
|
2488 | } |
|
|
2489 | /* IF we get here, key doesn't exist */ |
|
|
2490 | |
|
|
2491 | /* No field, we'll have to add it. */ |
|
|
2492 | |
|
|
2493 | if (!add_key) |
|
|
2494 | return FALSE; |
|
|
2495 | |
|
|
2496 | /* There isn't any good reason to store a null |
|
|
2497 | * value in the key/value list. If the archetype has |
|
|
2498 | * this key, then we should also have it, so shouldn't |
|
|
2499 | * be here. If user wants to store empty strings, |
|
|
2500 | * should pass in "" |
|
|
2501 | */ |
|
|
2502 | if (value == NULL) |
|
|
2503 | return TRUE; |
|
|
2504 | |
|
|
2505 | field = new key_value; |
|
|
2506 | |
|
|
2507 | field->key = canonical_key; |
|
|
2508 | field->value = value; |
|
|
2509 | /* Usual prepend-addition. */ |
|
|
2510 | field->next = op->key_values; |
|
|
2511 | op->key_values = field; |
|
|
2512 | |
|
|
2513 | return TRUE; |
|
|
2514 | } |
|
|
2515 | |
|
|
2516 | /* |
|
|
2517 | * Updates the key in op to value. |
|
|
2518 | * |
|
|
2519 | * If add_key is FALSE, this will only update existing keys, |
|
|
2520 | * and not add new ones. |
|
|
2521 | * In general, should be little reason FALSE is ever passed in for add_key |
|
|
2522 | * |
|
|
2523 | * Returns TRUE on success. |
|
|
2524 | */ |
|
|
2525 | int |
|
|
2526 | set_ob_key_value (object *op, const char *key, const char *value, int add_key) |
|
|
2527 | { |
|
|
2528 | shstr key_ (key); |
|
|
2529 | |
|
|
2530 | return set_ob_key_value_s (op, key_, value, add_key); |
|
|
2531 | } |
2386 | } |
2532 | |
2387 | |
2533 | object::depth_iterator::depth_iterator (object *container) |
2388 | object::depth_iterator::depth_iterator (object *container) |
2534 | : iterator_base (container) |
2389 | : iterator_base (container) |
2535 | { |
2390 | { |
… | |
… | |
2585 | { |
2440 | { |
2586 | char flagdesc[512]; |
2441 | char flagdesc[512]; |
2587 | char info2[256 * 4]; |
2442 | char info2[256 * 4]; |
2588 | char *p = info; |
2443 | char *p = info; |
2589 | |
2444 | |
2590 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2445 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}", |
2591 | count, uuid.seq, |
2446 | count, |
|
|
2447 | uuid.c_str (), |
2592 | &name, |
2448 | &name, |
2593 | title ? "\",title:\"" : "", |
2449 | title ? ",title:\"" : "", |
2594 | title ? (const char *)title : "", |
2450 | title ? (const char *)title : "", |
|
|
2451 | title ? "\"" : "", |
2595 | flag_desc (flagdesc, 512), type); |
2452 | flag_desc (flagdesc, 512), type); |
2596 | |
2453 | |
2597 | if (!this->flag[FLAG_REMOVED] && env) |
2454 | if (!flag[FLAG_REMOVED] && env) |
2598 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2455 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2599 | |
2456 | |
2600 | if (map) |
2457 | if (map) |
2601 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2458 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2602 | |
2459 | |
… | |
… | |
2632 | object::open_container (object *new_container) |
2489 | object::open_container (object *new_container) |
2633 | { |
2490 | { |
2634 | if (container == new_container) |
2491 | if (container == new_container) |
2635 | return; |
2492 | return; |
2636 | |
2493 | |
2637 | if (object *old_container = container) |
2494 | object *old_container = container; |
|
|
2495 | |
|
|
2496 | if (old_container) |
2638 | { |
2497 | { |
2639 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2498 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2640 | return; |
2499 | return; |
2641 | |
2500 | |
2642 | #if 0 |
2501 | #if 0 |
… | |
… | |
2644 | if (object *closer = old_container->inv) |
2503 | if (object *closer = old_container->inv) |
2645 | if (closer->type == CLOSE_CON) |
2504 | if (closer->type == CLOSE_CON) |
2646 | closer->destroy (); |
2505 | closer->destroy (); |
2647 | #endif |
2506 | #endif |
2648 | |
2507 | |
|
|
2508 | // make sure the container is available |
|
|
2509 | esrv_send_item (this, old_container); |
|
|
2510 | |
2649 | old_container->flag [FLAG_APPLIED] = 0; |
2511 | old_container->flag [FLAG_APPLIED] = false; |
2650 | container = 0; |
2512 | container = 0; |
2651 | |
2513 | |
|
|
2514 | // client needs item update to make it work, client bug requires this to be separate |
2652 | esrv_update_item (UPD_FLAGS, this, old_container); |
2515 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2516 | |
2653 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2517 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2654 | play_sound (sound_find ("chest_close")); |
2518 | play_sound (sound_find ("chest_close")); |
2655 | } |
2519 | } |
2656 | |
2520 | |
2657 | if (new_container) |
2521 | if (new_container) |
… | |
… | |
2670 | } |
2534 | } |
2671 | #endif |
2535 | #endif |
2672 | |
2536 | |
2673 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2537 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2674 | |
2538 | |
|
|
2539 | // make sure the container is available, client bug requires this to be separate |
|
|
2540 | esrv_send_item (this, new_container); |
|
|
2541 | |
2675 | new_container->flag [FLAG_APPLIED] = 1; |
2542 | new_container->flag [FLAG_APPLIED] = true; |
2676 | container = new_container; |
2543 | container = new_container; |
2677 | |
2544 | |
|
|
2545 | // client needs flag change |
2678 | esrv_update_item (UPD_FLAGS, this, new_container); |
2546 | esrv_update_item (UPD_FLAGS, this, new_container); |
2679 | esrv_send_inventory (this, new_container); |
2547 | esrv_send_inventory (this, new_container); |
2680 | play_sound (sound_find ("chest_open")); |
2548 | play_sound (sound_find ("chest_open")); |
2681 | } |
2549 | } |
|
|
2550 | // else if (!old_container->env && contr && contr->ns) |
|
|
2551 | // contr->ns->floorbox_reset (); |
2682 | } |
2552 | } |
2683 | |
2553 | |
2684 | object * |
2554 | object * |
2685 | object::force_find (const shstr name) |
2555 | object::force_find (const shstr name) |
2686 | { |
2556 | { |
… | |
… | |
2712 | |
2582 | |
2713 | insert (force); |
2583 | insert (force); |
2714 | } |
2584 | } |
2715 | |
2585 | |
2716 | void |
2586 | void |
2717 | object::play_sound (faceidx sound) const |
2587 | object::play_sound (faceidx sound) |
2718 | { |
2588 | { |
2719 | if (!sound) |
2589 | if (!sound) |
2720 | return; |
2590 | return; |
2721 | |
2591 | |
2722 | if (flag [FLAG_REMOVED]) |
2592 | if (flag [FLAG_REMOVED]) |