1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * (at your option) any later version. |
11 | * (at your option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
… | |
… | |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * |
20 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
22 | */ |
23 | |
23 | |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
25 | sub/add_weight will transcend the environment updating the carrying |
25 | sub/add_weight will transcend the environment updating the carrying |
26 | variable. */ |
26 | variable. */ |
… | |
… | |
33 | #include <sproto.h> |
33 | #include <sproto.h> |
34 | #include <loader.h> |
34 | #include <loader.h> |
35 | |
35 | |
36 | #include <bitset> |
36 | #include <bitset> |
37 | |
37 | |
38 | int nrofallocobjects = 0; |
38 | UUID UUID::cur; |
39 | static UUID uuid; |
|
|
40 | const uint64 UUID_SKIP = 1<<19; |
39 | static const uint64 UUID_SKIP = 1<<19; |
41 | |
40 | |
42 | objectvec objects; |
41 | objectvec objects; |
43 | activevec actives; |
42 | activevec actives; |
44 | |
43 | |
45 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
44 | 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, |
… | |
… | |
70 | { |
69 | { |
71 | LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); |
70 | LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); |
72 | return; |
71 | return; |
73 | } |
72 | } |
74 | |
73 | |
75 | fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2); |
74 | fprintf (fp, "<1,%llx>\n", (unsigned long long)UUID::cur.seq + UUID_SKIP * 2); |
76 | fclose (fp); |
75 | fclose (fp); |
77 | rename (filename2, filename1); |
76 | rename (filename2, filename1); |
78 | } |
77 | } |
79 | |
78 | |
80 | static void |
79 | static void |
… | |
… | |
89 | if (!(fp = fopen (filename, "r"))) |
88 | if (!(fp = fopen (filename, "r"))) |
90 | { |
89 | { |
91 | if (errno == ENOENT) |
90 | if (errno == ENOENT) |
92 | { |
91 | { |
93 | LOG (llevInfo, "RESET uid to 1\n"); |
92 | LOG (llevInfo, "RESET uid to 1\n"); |
94 | uuid.seq = 0; |
93 | UUID::cur.seq = 0; |
95 | write_uuid (); |
94 | write_uuid (); |
96 | return; |
95 | return; |
97 | } |
96 | } |
98 | |
97 | |
99 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
98 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
… | |
… | |
106 | { |
105 | { |
107 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
106 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
108 | _exit (1); |
107 | _exit (1); |
109 | } |
108 | } |
110 | |
109 | |
111 | uuid.seq = uid; |
110 | UUID::cur.seq = uid; |
112 | write_uuid (); |
111 | write_uuid (); |
113 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
112 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
114 | fclose (fp); |
113 | fclose (fp); |
115 | } |
114 | } |
116 | |
115 | |
117 | UUID |
116 | UUID |
118 | gen_uuid () |
117 | UUID::gen () |
119 | { |
118 | { |
120 | UUID uid; |
119 | UUID uid; |
121 | |
120 | |
122 | uid.seq = ++uuid.seq; |
121 | uid.seq = ++cur.seq; |
123 | |
122 | |
124 | if (!(uuid.seq & (UUID_SKIP - 1))) |
123 | if (!(cur.seq & (UUID_SKIP - 1))) |
125 | write_uuid (); |
124 | write_uuid (); |
126 | |
125 | |
127 | return uid; |
126 | return uid; |
128 | } |
127 | } |
129 | |
128 | |
130 | void |
129 | void |
131 | init_uuid () |
130 | UUID::init () |
132 | { |
131 | { |
133 | read_uuid (); |
132 | read_uuid (); |
134 | } |
133 | } |
135 | |
134 | |
136 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
135 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
… | |
… | |
254 | /* This is really a spellbook check - really, we should |
253 | /* This is really a spellbook check - really, we should |
255 | * check all objects in the inventory. |
254 | * check all objects in the inventory. |
256 | */ |
255 | */ |
257 | if (ob1->inv || ob2->inv) |
256 | if (ob1->inv || ob2->inv) |
258 | { |
257 | { |
259 | /* if one object has inventory but the other doesn't, not equiv */ |
258 | if (!(ob1->inv && ob2->inv)) |
260 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
259 | return 0; /* inventories differ in length */ |
261 | return 0; |
|
|
262 | |
260 | |
263 | /* Now check to see if the two inventory objects could merge */ |
261 | if (ob1->inv->below || ob2->inv->below) |
|
|
262 | return 0; /* more than one object in inv */ |
|
|
263 | |
264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
265 | return 0; |
265 | return 0; /* inventory objexts differ */ |
266 | |
266 | |
267 | /* inventory ok - still need to check rest of this object to see |
267 | /* inventory ok - still need to check rest of this object to see |
268 | * if it is valid. |
268 | * if it is valid. |
269 | */ |
269 | */ |
270 | } |
270 | } |
… | |
… | |
305 | { |
305 | { |
306 | ob1->optimise (); |
306 | ob1->optimise (); |
307 | ob2->optimise (); |
307 | ob2->optimise (); |
308 | |
308 | |
309 | if (ob1->self || ob2->self) |
309 | if (ob1->self || ob2->self) |
310 | if (!cfperl_can_merge (ob1, ob2)) |
310 | { |
|
|
311 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
|
|
312 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
|
|
313 | |
|
|
314 | if (k1 != k2) |
311 | return 0; |
315 | return 0; |
|
|
316 | else if (k1 == 0) |
|
|
317 | return 1; |
|
|
318 | else if (!cfperl_can_merge (ob1, ob2)) |
|
|
319 | return 0; |
|
|
320 | } |
312 | } |
321 | } |
313 | |
322 | |
314 | /* Everything passes, must be OK. */ |
323 | /* Everything passes, must be OK. */ |
315 | return 1; |
324 | return 1; |
316 | } |
325 | } |
… | |
… | |
419 | break; |
428 | break; |
420 | |
429 | |
421 | return op; |
430 | return op; |
422 | } |
431 | } |
423 | |
432 | |
424 | void |
|
|
425 | free_all_object_data () |
|
|
426 | { |
|
|
427 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
428 | } |
|
|
429 | |
|
|
430 | /* |
433 | /* |
431 | * Sets the owner and sets the skill and exp pointers to owner's current |
434 | * Sets the owner and sets the skill and exp pointers to owner's current |
432 | * skill and experience objects. |
435 | * skill and experience objects. |
433 | * ACTUALLY NO! investigate! TODO |
436 | * ACTUALLY NO! investigate! TODO |
434 | */ |
437 | */ |
… | |
… | |
437 | { |
440 | { |
438 | // allow objects which own objects |
441 | // allow objects which own objects |
439 | if (owner) |
442 | if (owner) |
440 | while (owner->owner) |
443 | while (owner->owner) |
441 | owner = owner->owner; |
444 | owner = owner->owner; |
|
|
445 | |
|
|
446 | if (flag [FLAG_FREED]) |
|
|
447 | { |
|
|
448 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
|
|
449 | return; |
|
|
450 | } |
442 | |
451 | |
443 | this->owner = owner; |
452 | this->owner = owner; |
444 | } |
453 | } |
445 | |
454 | |
446 | int |
455 | int |
… | |
… | |
578 | object::copy_to (object *dst) |
587 | object::copy_to (object *dst) |
579 | { |
588 | { |
580 | *dst = *this; |
589 | *dst = *this; |
581 | |
590 | |
582 | if (speed < 0) |
591 | if (speed < 0) |
583 | dst->speed_left = speed_left - rndm (); |
592 | dst->speed_left -= rndm (); |
584 | |
593 | |
585 | dst->set_speed (dst->speed); |
594 | dst->set_speed (dst->speed); |
586 | } |
595 | } |
587 | |
596 | |
588 | void |
597 | void |
589 | object::instantiate () |
598 | object::instantiate () |
590 | { |
599 | { |
591 | if (!uuid.seq) // HACK |
600 | if (!uuid.seq) // HACK |
592 | uuid = gen_uuid (); |
601 | uuid = UUID::gen (); |
593 | |
602 | |
594 | speed_left = -0.1f; |
603 | speed_left = -0.1f; |
595 | /* copy the body_info to the body_used - this is only really |
604 | /* copy the body_info to the body_used - this is only really |
596 | * need for monsters, but doesn't hurt to do it for everything. |
605 | * need for monsters, but doesn't hurt to do it for everything. |
597 | * by doing so, when a monster is created, it has good starting |
606 | * by doing so, when a monster is created, it has good starting |
… | |
… | |
756 | static int object_count; |
765 | static int object_count; |
757 | |
766 | |
758 | void object::link () |
767 | void object::link () |
759 | { |
768 | { |
760 | assert (!index);//D |
769 | assert (!index);//D |
761 | uuid = gen_uuid (); |
770 | uuid = UUID::gen (); |
762 | count = ++object_count; |
771 | count = ++object_count; |
763 | |
772 | |
764 | refcnt_inc (); |
773 | refcnt_inc (); |
765 | objects.insert (this); |
774 | objects.insert (this); |
766 | } |
775 | } |
… | |
… | |
915 | |
924 | |
916 | if (!freed_map) |
925 | if (!freed_map) |
917 | { |
926 | { |
918 | freed_map = new maptile; |
927 | freed_map = new maptile; |
919 | |
928 | |
|
|
929 | freed_map->path = "<freed objects map>"; |
920 | freed_map->name = "/internal/freed_objects_map"; |
930 | freed_map->name = "/internal/freed_objects_map"; |
921 | freed_map->width = 3; |
931 | freed_map->width = 3; |
922 | freed_map->height = 3; |
932 | freed_map->height = 3; |
|
|
933 | freed_map->nodrop = 1; |
923 | |
934 | |
924 | freed_map->alloc (); |
935 | freed_map->alloc (); |
925 | freed_map->in_memory = MAP_IN_MEMORY; |
936 | freed_map->in_memory = MAP_IN_MEMORY; |
926 | } |
937 | } |
927 | |
938 | |
… | |
… | |
1139 | merge_ob (object *op, object *top) |
1150 | merge_ob (object *op, object *top) |
1140 | { |
1151 | { |
1141 | if (!op->nrof) |
1152 | if (!op->nrof) |
1142 | return 0; |
1153 | return 0; |
1143 | |
1154 | |
1144 | if (top) |
1155 | if (!top) |
1145 | for (top = op; top && top->above; top = top->above) |
1156 | for (top = op; top && top->above; top = top->above) |
1146 | ; |
1157 | ; |
1147 | |
1158 | |
1148 | for (; top; top = top->below) |
1159 | for (; top; top = top->below) |
1149 | { |
1160 | { |
… | |
… | |
1230 | |
1241 | |
1231 | object *top, *floor = NULL; |
1242 | object *top, *floor = NULL; |
1232 | |
1243 | |
1233 | op->remove (); |
1244 | op->remove (); |
1234 | |
1245 | |
1235 | if (out_of_map (m, op->x, op->y)) |
|
|
1236 | { |
|
|
1237 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
|
|
1238 | #ifdef MANY_CORES |
|
|
1239 | /* Better to catch this here, as otherwise the next use of this object |
|
|
1240 | * is likely to cause a crash. Better to find out where it is getting |
|
|
1241 | * improperly inserted. |
|
|
1242 | */ |
|
|
1243 | abort (); |
|
|
1244 | #endif |
|
|
1245 | return op; |
|
|
1246 | } |
|
|
1247 | |
|
|
1248 | if (object *more = op->more) |
|
|
1249 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1250 | return 0; |
|
|
1251 | |
|
|
1252 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1253 | |
|
|
1254 | /* Ideally, the caller figures this out. However, it complicates a lot |
1246 | /* Ideally, the caller figures this out. However, it complicates a lot |
1255 | * of areas of callers (eg, anything that uses find_free_spot would now |
1247 | * of areas of callers (eg, anything that uses find_free_spot would now |
1256 | * need extra work |
1248 | * need extra work |
1257 | */ |
1249 | */ |
1258 | if (!xy_normalise (m, op->x, op->y)) |
1250 | if (!xy_normalise (m, op->x, op->y)) |
|
|
1251 | { |
|
|
1252 | op->destroy (); |
1259 | return 0; |
1253 | return 0; |
|
|
1254 | } |
|
|
1255 | |
|
|
1256 | if (object *more = op->more) |
|
|
1257 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1258 | return 0; |
|
|
1259 | |
|
|
1260 | CLEAR_FLAG (op, FLAG_REMOVED); |
1260 | |
1261 | |
1261 | op->map = m; |
1262 | op->map = m; |
1262 | mapspace &ms = op->ms (); |
1263 | mapspace &ms = op->ms (); |
1263 | |
1264 | |
1264 | /* this has to be done after we translate the coordinates. |
1265 | /* this has to be done after we translate the coordinates. |
… | |
… | |
1299 | else |
1300 | else |
1300 | { |
1301 | { |
1301 | top = ms.bot; |
1302 | top = ms.bot; |
1302 | |
1303 | |
1303 | /* If there are other objects, then */ |
1304 | /* If there are other objects, then */ |
1304 | if ((!(flag & INS_MAP_LOAD)) && top) |
1305 | if (top) |
1305 | { |
1306 | { |
1306 | object *last = 0; |
1307 | object *last = 0; |
1307 | |
1308 | |
1308 | /* |
1309 | /* |
1309 | * If there are multiple objects on this space, we do some trickier handling. |
1310 | * If there are multiple objects on this space, we do some trickier handling. |
… | |
… | |
1361 | */ |
1362 | */ |
1362 | if (last && last->below && last != floor) |
1363 | if (last && last->below && last != floor) |
1363 | top = last->below; |
1364 | top = last->below; |
1364 | } |
1365 | } |
1365 | } /* If objects on this space */ |
1366 | } /* If objects on this space */ |
1366 | if (flag & INS_MAP_LOAD) |
|
|
1367 | top = ms.top; |
|
|
1368 | |
1367 | |
1369 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1368 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1370 | top = floor; |
1369 | top = floor; |
1371 | |
1370 | |
1372 | /* Top is the object that our object (op) is going to get inserted above. |
1371 | /* Top is the object that our object (op) is going to get inserted above. |
… | |
… | |
1405 | op->map->touch (); |
1404 | op->map->touch (); |
1406 | } |
1405 | } |
1407 | |
1406 | |
1408 | op->map->dirty = true; |
1407 | op->map->dirty = true; |
1409 | |
1408 | |
1410 | if (!(flag & INS_MAP_LOAD)) |
|
|
1411 | if (object *pl = ms.player ()) |
1409 | if (object *pl = ms.player ()) |
1412 | pl->contr->ns->floorbox_update (); |
1410 | pl->contr->ns->floorbox_update (); |
1413 | |
1411 | |
1414 | /* If this object glows, it may affect lighting conditions that are |
1412 | /* If this object glows, it may affect lighting conditions that are |
1415 | * visible to others on this map. But update_all_los is really |
1413 | * visible to others on this map. But update_all_los is really |
1416 | * an inefficient way to do this, as it means los for all players |
1414 | * an inefficient way to do this, as it means los for all players |
1417 | * on the map will get recalculated. The players could very well |
1415 | * on the map will get recalculated. The players could very well |
… | |
… | |
1954 | * activate recursively a flag on an object inventory |
1952 | * activate recursively a flag on an object inventory |
1955 | */ |
1953 | */ |
1956 | void |
1954 | void |
1957 | flag_inv (object *op, int flag) |
1955 | flag_inv (object *op, int flag) |
1958 | { |
1956 | { |
1959 | if (op->inv) |
|
|
1960 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1957 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1961 | { |
1958 | { |
1962 | SET_FLAG (tmp, flag); |
1959 | SET_FLAG (tmp, flag); |
1963 | flag_inv (tmp, flag); |
1960 | flag_inv (tmp, flag); |
1964 | } |
1961 | } |
1965 | } |
1962 | } |
1966 | |
1963 | |
1967 | /* |
1964 | /* |
1968 | * deactivate recursively a flag on an object inventory |
1965 | * deactivate recursively a flag on an object inventory |
1969 | */ |
1966 | */ |
1970 | void |
1967 | void |
1971 | unflag_inv (object *op, int flag) |
1968 | unflag_inv (object *op, int flag) |
1972 | { |
1969 | { |
1973 | if (op->inv) |
|
|
1974 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1970 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1975 | { |
1971 | { |
1976 | CLEAR_FLAG (tmp, flag); |
1972 | CLEAR_FLAG (tmp, flag); |
1977 | unflag_inv (tmp, flag); |
1973 | unflag_inv (tmp, flag); |
1978 | } |
1974 | } |
1979 | } |
1975 | } |
1980 | |
1976 | |
1981 | /* |
1977 | /* |
1982 | * find_free_spot(object, map, x, y, start, stop) will search for |
1978 | * find_free_spot(object, map, x, y, start, stop) will search for |
1983 | * a spot at the given map and coordinates which will be able to contain |
1979 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
1985 | * to search (see the freearr_x/y[] definition). |
1981 | * to search (see the freearr_x/y[] definition). |
1986 | * It returns a random choice among the alternatives found. |
1982 | * It returns a random choice among the alternatives found. |
1987 | * start and stop are where to start relative to the free_arr array (1,9 |
1983 | * start and stop are where to start relative to the free_arr array (1,9 |
1988 | * does all 4 immediate directions). This returns the index into the |
1984 | * does all 4 immediate directions). This returns the index into the |
1989 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1985 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1990 | * Note - this only checks to see if there is space for the head of the |
|
|
1991 | * object - if it is a multispace object, this should be called for all |
|
|
1992 | * pieces. |
|
|
1993 | * Note2: This function does correctly handle tiled maps, but does not |
1986 | * Note: This function does correctly handle tiled maps, but does not |
1994 | * inform the caller. However, insert_ob_in_map will update as |
1987 | * inform the caller. However, insert_ob_in_map will update as |
1995 | * necessary, so the caller shouldn't need to do any special work. |
1988 | * necessary, so the caller shouldn't need to do any special work. |
1996 | * Note - updated to take an object instead of archetype - this is necessary |
1989 | * Note - updated to take an object instead of archetype - this is necessary |
1997 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1990 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1998 | * to know if the space in question will block the object. We can't use |
1991 | * to know if the space in question will block the object. We can't use |
… | |
… | |
2000 | * customized, changed states, etc. |
1993 | * customized, changed states, etc. |
2001 | */ |
1994 | */ |
2002 | int |
1995 | int |
2003 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1996 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2004 | { |
1997 | { |
|
|
1998 | int altern[SIZEOFFREE]; |
2005 | int index = 0, flag; |
1999 | int index = 0, flag; |
2006 | int altern[SIZEOFFREE]; |
|
|
2007 | |
2000 | |
2008 | for (int i = start; i < stop; i++) |
2001 | for (int i = start; i < stop; i++) |
2009 | { |
2002 | { |
2010 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
2003 | mapxy pos (m, x, y); pos.move (i); |
2011 | if (!flag) |
2004 | |
|
|
2005 | if (!pos.normalise ()) |
|
|
2006 | continue; |
|
|
2007 | |
|
|
2008 | mapspace &ms = *pos; |
|
|
2009 | |
|
|
2010 | if (ms.flags () & P_IS_ALIVE) |
|
|
2011 | continue; |
|
|
2012 | |
|
|
2013 | /* However, often |
|
|
2014 | * ob doesn't have any move type (when used to place exits) |
|
|
2015 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
2016 | */ |
|
|
2017 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
2018 | { |
2012 | altern [index++] = i; |
2019 | altern [index++] = i; |
|
|
2020 | continue; |
|
|
2021 | } |
2013 | |
2022 | |
2014 | /* Basically, if we find a wall on a space, we cut down the search size. |
2023 | /* Basically, if we find a wall on a space, we cut down the search size. |
2015 | * In this way, we won't return spaces that are on another side of a wall. |
2024 | * In this way, we won't return spaces that are on another side of a wall. |
2016 | * This mostly work, but it cuts down the search size in all directions - |
2025 | * This mostly work, but it cuts down the search size in all directions - |
2017 | * if the space being examined only has a wall to the north and empty |
2026 | * if the space being examined only has a wall to the north and empty |
2018 | * spaces in all the other directions, this will reduce the search space |
2027 | * spaces in all the other directions, this will reduce the search space |
2019 | * to only the spaces immediately surrounding the target area, and |
2028 | * to only the spaces immediately surrounding the target area, and |
2020 | * won't look 2 spaces south of the target space. |
2029 | * won't look 2 spaces south of the target space. |
2021 | */ |
2030 | */ |
2022 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
2031 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
2032 | { |
2023 | stop = maxfree[i]; |
2033 | stop = maxfree[i]; |
|
|
2034 | continue; |
|
|
2035 | } |
|
|
2036 | |
|
|
2037 | /* Note it is intentional that we check ob - the movement type of the |
|
|
2038 | * head of the object should correspond for the entire object. |
|
|
2039 | */ |
|
|
2040 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
2041 | continue; |
|
|
2042 | |
|
|
2043 | if (ob->blocked (m, pos.x, pos.y)) |
|
|
2044 | continue; |
|
|
2045 | |
|
|
2046 | altern [index++] = i; |
2024 | } |
2047 | } |
2025 | |
2048 | |
2026 | if (!index) |
2049 | if (!index) |
2027 | return -1; |
2050 | return -1; |
2028 | |
2051 | |
… | |
… | |
2037 | */ |
2060 | */ |
2038 | int |
2061 | int |
2039 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2062 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2040 | { |
2063 | { |
2041 | for (int i = 0; i < SIZEOFFREE; i++) |
2064 | for (int i = 0; i < SIZEOFFREE; i++) |
2042 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2065 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2043 | return i; |
2066 | return i; |
2044 | |
2067 | |
2045 | return -1; |
2068 | return -1; |
2046 | } |
2069 | } |
2047 | |
2070 | |