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. */ |
… | |
… | |
429 | break; |
428 | break; |
430 | |
429 | |
431 | return op; |
430 | return op; |
432 | } |
431 | } |
433 | |
432 | |
434 | void |
|
|
435 | free_all_object_data () |
|
|
436 | { |
|
|
437 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
438 | } |
|
|
439 | |
|
|
440 | /* |
433 | /* |
441 | * 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 |
442 | * skill and experience objects. |
435 | * skill and experience objects. |
443 | * ACTUALLY NO! investigate! TODO |
436 | * ACTUALLY NO! investigate! TODO |
444 | */ |
437 | */ |
… | |
… | |
603 | |
596 | |
604 | void |
597 | void |
605 | object::instantiate () |
598 | object::instantiate () |
606 | { |
599 | { |
607 | if (!uuid.seq) // HACK |
600 | if (!uuid.seq) // HACK |
608 | uuid = gen_uuid (); |
601 | uuid = UUID::gen (); |
609 | |
602 | |
610 | speed_left = -0.1f; |
603 | speed_left = -0.1f; |
611 | /* 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 |
612 | * 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. |
613 | * 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 |
… | |
… | |
772 | static int object_count; |
765 | static int object_count; |
773 | |
766 | |
774 | void object::link () |
767 | void object::link () |
775 | { |
768 | { |
776 | assert (!index);//D |
769 | assert (!index);//D |
777 | uuid = gen_uuid (); |
770 | uuid = UUID::gen (); |
778 | count = ++object_count; |
771 | count = ++object_count; |
779 | |
772 | |
780 | refcnt_inc (); |
773 | refcnt_inc (); |
781 | objects.insert (this); |
774 | objects.insert (this); |
782 | } |
775 | } |
… | |
… | |
935 | |
928 | |
936 | freed_map->path = "<freed objects map>"; |
929 | freed_map->path = "<freed objects map>"; |
937 | freed_map->name = "/internal/freed_objects_map"; |
930 | freed_map->name = "/internal/freed_objects_map"; |
938 | freed_map->width = 3; |
931 | freed_map->width = 3; |
939 | freed_map->height = 3; |
932 | freed_map->height = 3; |
|
|
933 | freed_map->nodrop = 1; |
940 | |
934 | |
941 | freed_map->alloc (); |
935 | freed_map->alloc (); |
942 | freed_map->in_memory = MAP_IN_MEMORY; |
936 | freed_map->in_memory = MAP_IN_MEMORY; |
943 | } |
937 | } |
944 | |
938 | |
… | |
… | |
2018 | |
2012 | |
2019 | /* However, often |
2013 | /* However, often |
2020 | * ob doesn't have any move type (when used to place exits) |
2014 | * ob doesn't have any move type (when used to place exits) |
2021 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
2015 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
2022 | */ |
2016 | */ |
2023 | if (ob->move_type == 0 && ms.move_block != MOVE_ALL) |
2017 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
2024 | { |
2018 | { |
2025 | altern [index++] = i; |
2019 | altern [index++] = i; |
2026 | continue; |
2020 | continue; |
2027 | } |
2021 | } |
2028 | |
2022 | |