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