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