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