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