1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
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 (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
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 Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
… | |
… | |
28 | #include <sproto.h> |
29 | #include <sproto.h> |
29 | #include <time.h> |
30 | #include <time.h> |
30 | |
31 | |
31 | #include <glib.h> |
32 | #include <glib.h> |
32 | |
33 | |
33 | #include <../random_maps/random_map.h> |
34 | #include <rmg.h> |
34 | #include <../random_maps/rproto.h> |
35 | #include <rproto.h> |
35 | #include "path.h" |
36 | #include "path.h" |
36 | |
|
|
37 | static char days[7][4] = { |
|
|
38 | "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" |
|
|
39 | }; |
|
|
40 | |
37 | |
41 | void |
38 | void |
42 | version (object *op) |
39 | version (object *op) |
43 | { |
40 | { |
44 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION); |
41 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION); |
45 | |
|
|
46 | #if 0 |
|
|
47 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
|
|
48 | new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); |
|
|
49 | new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); |
|
|
50 | new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>"); |
|
|
51 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
|
|
52 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:"); |
|
|
53 | new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>"); |
|
|
54 | new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>"); |
|
|
55 | new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>"); |
|
|
56 | new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>"); |
|
|
57 | new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>"); |
|
|
58 | new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>"); |
|
|
59 | new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>"); |
|
|
60 | new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>"); |
|
|
61 | new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>"); |
|
|
62 | new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>"); |
|
|
63 | new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>"); |
|
|
64 | new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>"); |
|
|
65 | new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>"); |
|
|
66 | new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>"); |
|
|
67 | new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>"); |
|
|
68 | new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>"); |
|
|
69 | new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>"); |
|
|
70 | new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>"); |
|
|
71 | new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>"); |
|
|
72 | new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>"); |
|
|
73 | new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>"); |
|
|
74 | new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>"); |
|
|
75 | new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>"); |
|
|
76 | new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>"); |
|
|
77 | new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>"); |
|
|
78 | new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>"); |
|
|
79 | new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>"); |
|
|
80 | new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>"); |
|
|
81 | new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>"); |
|
|
82 | new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>"); |
|
|
83 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>"); |
|
|
84 | new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>"); |
|
|
85 | new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>"); |
|
|
86 | new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>"); |
|
|
87 | new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>"); |
|
|
88 | new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>"); |
|
|
89 | new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>"); |
|
|
90 | new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>"); |
|
|
91 | new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>"); |
|
|
92 | new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n"); |
|
|
93 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
|
|
94 | new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
|
|
95 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
|
|
96 | new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>"); |
|
|
97 | new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>"); |
|
|
98 | new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>"); |
|
|
99 | new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>"); |
|
|
100 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
|
|
101 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
|
|
102 | #endif |
|
|
103 | } |
42 | } |
104 | |
43 | |
105 | /* This is a basic little function to put the player back to his |
44 | /* This is a basic little function to put the player back to his |
106 | * savebed. We do some error checking - its possible that the |
45 | * savebed. |
107 | * savebed map may no longer exist, so we make sure the player |
|
|
108 | * goes someplace. |
|
|
109 | */ |
46 | */ |
110 | void |
47 | void |
111 | enter_player_savebed (object *op) |
48 | enter_player_savebed (object *op) |
112 | { |
49 | { |
113 | op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y); |
50 | op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y); |
… | |
… | |
118 | * new map. map, x, y must be set. map is the map we are moving the |
55 | * new map. map, x, y must be set. map is the map we are moving the |
119 | * player to - it could be the map he just came from if the load failed for |
56 | * player to - it could be the map he just came from if the load failed for |
120 | * whatever reason. If default map coordinates are to be used, then |
57 | * whatever reason. If default map coordinates are to be used, then |
121 | * the function that calls this should figure them out. |
58 | * the function that calls this should figure them out. |
122 | */ |
59 | */ |
123 | void |
60 | bool |
124 | object::enter_map (maptile *newmap, int x, int y) |
61 | object::enter_map (maptile *newmap, int x, int y) |
125 | { |
62 | { |
126 | if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE) |
63 | if (destroyed () || !newmap || !newmap->linkable ()) |
127 | return; |
64 | return false; |
128 | |
65 | |
129 | if (out_of_map (newmap, x, y)) |
66 | if (out_of_map (newmap, x, y)) |
130 | { |
67 | { |
131 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
68 | LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
132 | x = newmap->enter_x; |
69 | x = newmap->enter_x; |
… | |
… | |
134 | if (out_of_map (newmap, x, y)) |
71 | if (out_of_map (newmap, x, y)) |
135 | { |
72 | { |
136 | LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n", |
73 | LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n", |
137 | &newmap->path, x, y, newmap->width, newmap->height); |
74 | &newmap->path, x, y, newmap->width, newmap->height); |
138 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
75 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
139 | return; |
76 | return false; |
140 | } |
77 | } |
141 | } |
78 | } |
142 | |
79 | |
143 | if (contr && map != newmap && map) |
80 | if (contr && map != newmap && map) |
144 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
81 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
145 | return; |
82 | return false; |
146 | |
83 | |
147 | // remove, so stupid ob_locked does not trigger a failure |
84 | // remove, so stupid blocked does not trigger a failure |
148 | remove (); |
85 | remove (); |
149 | |
86 | |
150 | /* try to find a spot for the player */ |
87 | /* try to find a spot for the player */ |
151 | if (blocked (newmap, x, y)) |
88 | if (blocked (newmap, x, y)) |
152 | { /* First choice blocked */ |
89 | { /* First choice blocked */ |
… | |
… | |
157 | * Note that for the second and third calls, we could start at a position other |
94 | * Note that for the second and third calls, we could start at a position other |
158 | * than one, but then we could end up on the other side of walls and so forth. |
95 | * than one, but then we could end up on the other side of walls and so forth. |
159 | */ |
96 | */ |
160 | int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); |
97 | int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); |
161 | |
98 | |
162 | if (i == -1) |
99 | if (i < 0) |
163 | { |
100 | { |
164 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
101 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
165 | if (i == -1) |
102 | if (i < 0) |
166 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
103 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
167 | } |
104 | } |
168 | |
105 | |
169 | if (i != -1) |
106 | if (i >= 0) |
|
|
107 | { |
|
|
108 | maptile *m = newmap; |
|
|
109 | sint16 nx = x + freearr_x[i]; |
|
|
110 | sint16 ny = y + freearr_y[i]; |
|
|
111 | |
|
|
112 | if (xy_normalise (m, nx, ny)) |
170 | { |
113 | { |
171 | x += freearr_x[i]; |
114 | newmap = m; |
172 | y += freearr_y[i]; |
115 | x = nx; |
|
|
116 | y = ny; |
|
|
117 | } |
173 | } |
118 | } |
174 | else |
119 | else |
175 | /* not much we can do in this case. */ |
120 | /* not much we can do in this case. */ |
176 | LOG (llevInfo, "enter_map: Could not find free spot for player - will dump on top of object (%s: %d, %d)\n", &newmap->path, x, y); |
121 | LOG (llevInfo, "enter_map: Could not find free spot for player - will dump on top of object (%s: %d, %d)\n", &newmap->path, x, y); |
177 | } |
122 | } |
178 | |
123 | |
179 | if (contr && map != newmap) |
124 | if (contr && map != newmap) |
180 | { |
125 | { |
181 | if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
126 | if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
182 | return; |
127 | return false; |
183 | |
128 | |
184 | if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
129 | if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
185 | return; |
130 | return false; |
186 | } |
131 | } |
187 | |
|
|
188 | this->x = x; |
|
|
189 | this->y = y; |
|
|
190 | map = newmap; |
|
|
191 | |
|
|
192 | insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
|
|
193 | |
132 | |
194 | enemy = 0; |
133 | enemy = 0; |
195 | |
134 | |
|
|
135 | newmap->activate (); // workaround for activate activating everyhing on the map, includign the palyer on the {link} map |
|
|
136 | //newmap->insert (this, x, y); |
|
|
137 | newmap->insert (this, x, y, 0, INS_NO_AUTO_EXIT); |
|
|
138 | prefetch_surrounding_maps (); |
|
|
139 | |
|
|
140 | if (map == newmap) // see if we actually arrived there - insert might trigger a teleport |
|
|
141 | { |
196 | if (contr) |
142 | if (contr) |
197 | { |
143 | { |
198 | contr->maplevel = newmap->path; |
144 | contr->maplevel = newmap->path; |
199 | contr->count = 0; |
145 | contr->count = 0; |
200 | } |
|
|
201 | |
146 | |
202 | /* Update any golems */ |
147 | /* Update any golems */ |
203 | if (type == PLAYER) |
|
|
204 | if (object *golem = contr->golem) |
148 | if (object *golem = contr->golem) |
205 | { |
149 | { |
206 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
150 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
207 | |
151 | |
208 | if (i < 0) |
152 | if (i < 0) |
209 | golem->drop_and_destroy (); |
153 | golem->drop_and_destroy (); |
210 | else |
154 | else |
211 | { |
155 | { |
212 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
156 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
213 | golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
157 | golem->direction = find_dir_2 (golem->x - x, golem->y - y); |
|
|
158 | } |
214 | } |
159 | } |
215 | } |
160 | } |
216 | |
161 | |
217 | /* since the players map is already loaded, we don't need to worry |
162 | /* since the players map is already loaded, we don't need to worry |
218 | * about pending objects. |
163 | * about pending objects. |
219 | */ |
164 | */ |
220 | remove_all_pets (newmap); |
165 | move_all_pets (); |
|
|
166 | |
|
|
167 | return true; |
|
|
168 | } |
|
|
169 | |
|
|
170 | return false; |
221 | } |
171 | } |
222 | |
172 | |
223 | /* process_players1 and process_players2 do all the player related stuff. |
173 | /* process_players1 and process_players2 do all the player related stuff. |
224 | * I moved it out of process events and process_map. This was to some |
174 | * I moved it out of process events and process_map. This was to some |
225 | * extent for debugging as well as to get a better idea of the time used |
175 | * extent for debugging as well as to get a better idea of the time used |
… | |
… | |
248 | |
198 | |
249 | for_all_players (pl) |
199 | for_all_players (pl) |
250 | { |
200 | { |
251 | object *ob = pl->ob; |
201 | object *ob = pl->ob; |
252 | |
202 | |
|
|
203 | // process_objects destroys the speed_left value |
|
|
204 | pl->speed_left_save = ob->speed_left; |
|
|
205 | |
253 | if (expect_false (!ob || !pl->ns || !ob->active)) |
206 | if (expect_false (!ob || !pl->ns || !ob->active)) |
254 | continue; |
207 | continue; |
255 | |
208 | |
256 | do_some_living (ob); |
209 | do_some_living (ob); |
257 | } |
210 | } |
… | |
… | |
261 | process_players2 () |
214 | process_players2 () |
262 | { |
215 | { |
263 | /* Then check if any players should use weapon-speed instead of speed */ |
216 | /* Then check if any players should use weapon-speed instead of speed */ |
264 | for_all_players (pl) |
217 | for_all_players (pl) |
265 | { |
218 | { |
|
|
219 | // restore speed_left value saved by process_players1 |
|
|
220 | pl->ob->speed_left = pl->speed_left_save; |
|
|
221 | |
266 | pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
222 | pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
267 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
223 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
268 | } |
224 | } |
269 | } |
225 | } |
270 | |
226 | |
271 | void |
227 | static void |
272 | process_events () |
228 | process_events () |
273 | { |
229 | { |
274 | process_players1 (); |
230 | process_players1 (); |
275 | |
231 | |
276 | for_all_actives (op) |
232 | for_all_actives (op) |
277 | { |
233 | { |
|
|
234 | // try to prefetch some stuff we expect to need |
|
|
235 | // obviously, it should be grouped into the same cacheline. |
|
|
236 | // preliminary results indicate that this gives halves the speed |
|
|
237 | // used for the inner loop |
|
|
238 | if (_i < actives.size ()) // HACK, rely on _i :/ |
|
|
239 | { |
|
|
240 | object *next = actives [_i + 1]; |
|
|
241 | |
|
|
242 | prefetch (&next->flag , 0, 1); |
|
|
243 | prefetch (&next->speed , 0, 1); |
|
|
244 | prefetch (&next->anim_speed, 0, 1); |
|
|
245 | prefetch (&next->contr , 0, 1); |
|
|
246 | } |
|
|
247 | |
278 | /* Now process op */ |
248 | /* Now process op */ |
279 | if (expect_false (QUERY_FLAG (op, FLAG_FREED))) |
249 | if (expect_false (op->flag [FLAG_FREED])) |
280 | { |
250 | { |
281 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
251 | LOG (llevError, "BUG: process_events(): Free object on list (%s)\n", op->debug_desc ()); |
282 | op->set_speed (0); |
252 | op->set_speed (0); |
283 | continue; |
253 | continue; |
284 | } |
254 | } |
285 | |
255 | |
286 | if (expect_false (!op->has_active_speed ())) |
256 | if (expect_false (!op->has_active_speed ())) |
… | |
… | |
314 | { |
284 | { |
315 | --op->speed_left; |
285 | --op->speed_left; |
316 | process_object (op); |
286 | process_object (op); |
317 | } |
287 | } |
318 | |
288 | |
319 | if (expect_true (!op->contr)) |
289 | // this will destroy the speed_left value for players, but |
|
|
290 | // process_players1 and ..2 save/restore the real value, |
|
|
291 | // so we can avoid a costly test here. |
320 | op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); |
292 | op->speed_left = min (op->speed, op->speed_left + op->speed); |
321 | } |
293 | } |
322 | |
294 | |
323 | process_players2 (); |
295 | process_players2 (); |
324 | } |
296 | } |
325 | |
297 | |
326 | /* clean up everything before exiting */ |
298 | /* clean up everything before exiting */ |
327 | void |
299 | void |
328 | emergency_save () |
300 | emergency_save () |
329 | { |
301 | { |
330 | LOG (llevDebug, "emergency save begin.\n"); |
302 | LOG (llevInfo, "emergency_save: enter\n"); |
|
|
303 | |
|
|
304 | LOG (llevInfo, "emergency_save: saving book archive\n"); |
|
|
305 | write_book_archive (); |
331 | |
306 | |
332 | cfperl_emergency_save (); |
307 | cfperl_emergency_save (); |
333 | |
308 | |
334 | LOG (llevDebug, "saving book archive.\n"); |
|
|
335 | write_book_archive (); |
|
|
336 | |
|
|
337 | LOG (llevDebug, "emergency save done.\n"); |
309 | LOG (llevInfo, "emergency_save: leave\n"); |
338 | } |
310 | } |
339 | |
311 | |
340 | // send all clients some informational text |
312 | // send all clients some informational text |
341 | static void |
313 | static void |
342 | cleanup_inform (const char *cause, bool make_core) |
314 | cleanup_inform (const char *cause, bool make_core) |
… | |
… | |
361 | cleanup (const char *cause, bool make_core) |
333 | cleanup (const char *cause, bool make_core) |
362 | { |
334 | { |
363 | if (make_core) |
335 | if (make_core) |
364 | fork_abort (cause); |
336 | fork_abort (cause); |
365 | |
337 | |
366 | LOG (llevError, "cleanup cause: %s\n", cause); |
338 | LOG (make_core ? llevError : llevInfo, "cleanup cause: %s\n", cause); |
367 | |
339 | |
368 | if (!make_core) |
340 | if (!make_core) |
369 | cleanup_inform (cause, make_core); |
341 | cleanup_inform (cause, make_core); |
370 | |
342 | |
371 | LOG (llevDebug, "cleanup begin.\n"); |
343 | LOG (llevDebug, "cleanup begin.\n"); |
… | |
… | |
398 | _exit (make_core); |
370 | _exit (make_core); |
399 | } |
371 | } |
400 | |
372 | |
401 | /* |
373 | /* |
402 | * do_specials() is a collection of functions to call from time to time. |
374 | * do_specials() is a collection of functions to call from time to time. |
403 | * Modified 2000-1-14 MSW to use the global pticks count to determine how |
375 | * Modified 2000-1-14 MSW to use the global server_tick count to determine how |
404 | * often to do things. This will allow us to spred them out more often. |
376 | * often to do things. This will allow us to spred them out more often. |
405 | * I use prime numbers for the factor count - in that way, it is less likely |
377 | * I use prime numbers for the factor count - in that way, it is less likely |
406 | * these actions will fall on the same tick (compared to say using 500/2500/15000 |
378 | * these actions will fall on the same tick (compared to say using 500/2500/15000 |
407 | * which would mean on that 15,000 tick count a whole bunch of stuff gets |
379 | * which would mean on that 15,000 tick count a whole bunch of stuff gets |
408 | * done). Of course, there can still be times where multiple specials are |
380 | * done). Of course, there can still be times where multiple specials are |
409 | * done on the same tick, but that will happen very infrequently |
381 | * done on the same tick, but that will happen very infrequently |
410 | * |
382 | * |
411 | * I also think this code makes it easier to see how often we really are |
383 | * I also think this code makes it easier to see how often we really are |
412 | * doing the various things. |
384 | * doing the various things. |
413 | */ |
385 | */ |
414 | void |
386 | static void |
415 | do_specials (void) |
387 | do_specials () |
416 | { |
388 | { |
417 | shstr::gc (); |
389 | shstr::gc (); |
418 | archetype::gc (); |
390 | archetype::gc (); |
419 | |
391 | |
420 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
392 | if (expect_false (!(server_tick % TICKS_PER_HOUR))) |
421 | maptile::adjust_daylight (); |
393 | maptile::adjust_daylight (); |
422 | |
394 | |
423 | if (expect_false (!(pticks % 2503))) |
395 | if (expect_false (!(server_tick % 2503))) |
424 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
396 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
425 | |
397 | |
426 | if (expect_false (!(pticks % 5003))) |
398 | if (expect_false (!(server_tick % 5003))) |
427 | write_book_archive (); |
399 | write_book_archive (); |
428 | |
400 | |
429 | if (expect_false (!(pticks % 5009))) |
401 | if (expect_false (!(server_tick % 5009))) |
430 | clean_friendly_list (); |
402 | clean_friendly_list (); |
431 | |
403 | |
432 | if (expect_false (!(pticks % 5011))) |
404 | if (expect_false (!(server_tick % 5011))) |
433 | obsolete_parties (); |
405 | obsolete_parties (); |
434 | |
406 | |
435 | if (expect_false (!(pticks % 12503))) |
407 | if (expect_false (!(server_tick % 12503))) |
436 | fix_luck (); |
408 | fix_luck (); |
437 | } |
409 | } |
438 | |
410 | |
439 | void |
411 | void |
440 | server_tick () |
412 | one_tick () |
441 | { |
413 | { |
442 | // first do the user visible stuff |
414 | // first do the user visible stuff |
443 | INVOKE_GLOBAL (CLOCK); |
415 | INVOKE_GLOBAL (CLOCK); |
444 | process_events (); // "do" something with objects with speed |
416 | process_events (); // "do" something with objects with speed |
445 | client::clock (); // draw client maps etc. |
417 | client::clock (); // draw client maps etc. |
446 | |
418 | |
447 | // then do some bookkeeping, should not really be here |
419 | // then do some bookkeeping, should not really be here |
448 | do_specials (); /* Routines called from time to time. */ |
420 | do_specials (); /* Routines called from time to time. */ |
449 | attachable::check_mortals (); |
421 | attachable::check_mortals (); |
450 | |
422 | |
451 | ++pticks; |
423 | // now that we aggressively reuse id's, this is very unlikely to happen... |
|
|
424 | if (object::object_count >= RESTART_COUNT) |
|
|
425 | cleanup ("running out of protocol ID values - need full restart"); |
452 | } |
426 | } |
453 | |
|
|
454 | #if 0 |
|
|
455 | // used fro benchmarking (x86/amd64-specific) |
|
|
456 | typedef unsigned long tval; |
|
|
457 | typedef unsigned long long stamp64; |
|
|
458 | |
|
|
459 | extern inline tval |
|
|
460 | stamp (void) |
|
|
461 | { |
|
|
462 | tval tsc; |
|
|
463 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
464 | |
|
|
465 | return tsc; |
|
|
466 | } |
|
|
467 | |
|
|
468 | extern inline tval |
|
|
469 | measure (tval t) |
|
|
470 | { |
|
|
471 | tval tsc; |
|
|
472 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
473 | |
|
|
474 | if (tsc > t) |
|
|
475 | return tsc - t; |
|
|
476 | else |
|
|
477 | return t - tsc; |
|
|
478 | } |
|
|
479 | |
|
|
480 | int |
|
|
481 | main (int argc, char **argv) |
|
|
482 | { |
|
|
483 | rand_gen rg(0); |
|
|
484 | tval fastest = 0x7fffffff; |
|
|
485 | for (int loop = 10000; loop--; ) |
|
|
486 | { |
|
|
487 | tval s = stamp (); |
|
|
488 | volatile int i = rg.get_int(25); |
|
|
489 | fastest = min (fastest, measure (s)); |
|
|
490 | } |
|
|
491 | |
|
|
492 | //printf ("fastest %d\n", fastest); |
|
|
493 | for (int i = 0; i < 1024*1024*3; ++i) |
|
|
494 | { |
|
|
495 | char c = rg.get_int (256); |
|
|
496 | write (2, &c, 1); |
|
|
497 | } |
|
|
498 | } |
|
|
499 | |
|
|
500 | #else |
|
|
501 | |
|
|
502 | #if 0 // just goofing around, look elsewhere |
|
|
503 | |
|
|
504 | #include <malloc.h> |
|
|
505 | #include <execinfo.h> |
|
|
506 | |
|
|
507 | static void tr_on (); |
|
|
508 | static void tr_off (); |
|
|
509 | |
|
|
510 | static SMUTEX(tr_mutex); |
|
|
511 | |
|
|
512 | #define ltr_off() SMUTEX_LOCK (tr_mutex); tr_off () |
|
|
513 | #define ltr_on() tr_on (); SMUTEX_UNLOCK (tr_mutex); |
|
|
514 | |
|
|
515 | static void * |
|
|
516 | tr_malloc (size_t size, const void *caller) |
|
|
517 | { |
|
|
518 | ltr_off (); |
|
|
519 | |
|
|
520 | void *bt [8]; |
|
|
521 | backtrace (bt, 8); |
|
|
522 | |
|
|
523 | void *ptr = malloc (size); |
|
|
524 | |
|
|
525 | ltr_on (); |
|
|
526 | return (char *)ptr; |
|
|
527 | } |
|
|
528 | |
|
|
529 | static void |
|
|
530 | tr_free (void *ptr, const void *caller) |
|
|
531 | { |
|
|
532 | ltr_off (); |
|
|
533 | |
|
|
534 | free (ptr); |
|
|
535 | |
|
|
536 | ltr_on (); |
|
|
537 | } |
|
|
538 | |
|
|
539 | void static * |
|
|
540 | tr_realloc (void *ptr, size_t size, const void *caller) |
|
|
541 | { |
|
|
542 | ltr_off (); |
|
|
543 | |
|
|
544 | void *nptr = realloc (ptr, size); |
|
|
545 | |
|
|
546 | ltr_on (); |
|
|
547 | return nptr; |
|
|
548 | } |
|
|
549 | |
|
|
550 | static void * |
|
|
551 | tr_memalign (size_t size, size_t alignment, const void *caller) |
|
|
552 | { |
|
|
553 | ltr_off (); |
|
|
554 | |
|
|
555 | void *ptr = memalign (size, alignment < 16 ? 16 : alignment); |
|
|
556 | |
|
|
557 | ltr_on (); |
|
|
558 | return ptr; |
|
|
559 | } |
|
|
560 | |
|
|
561 | static void |
|
|
562 | tr_on () |
|
|
563 | { |
|
|
564 | __malloc_hook = tr_malloc; |
|
|
565 | __realloc_hook = tr_realloc; |
|
|
566 | __free_hook = tr_free; |
|
|
567 | __memalign_hook = tr_memalign; |
|
|
568 | } |
|
|
569 | |
|
|
570 | static void |
|
|
571 | tr_off () |
|
|
572 | { |
|
|
573 | __malloc_hook = 0; |
|
|
574 | __realloc_hook = 0; |
|
|
575 | __free_hook = 0; |
|
|
576 | __memalign_hook = 0; |
|
|
577 | } |
|
|
578 | |
|
|
579 | void (*__malloc_initialize_hook)(void) = tr_on; |
|
|
580 | |
|
|
581 | #endif |
|
|
582 | |
427 | |
583 | // normal main |
428 | // normal main |
584 | int |
429 | int |
585 | main (int argc, char **argv) |
430 | main (int argc, char **argv) |
586 | { |
431 | { |
587 | settings.argc = argc; |
432 | settings.argc = argc; |
588 | settings.argv = argv; |
433 | settings.argv = argv; |
589 | |
434 | |
|
|
435 | rndm.seed (time (0)); |
590 | g_thread_init (0); // for the slice allocator only |
436 | g_thread_init (0); // for the slice allocator only |
591 | |
437 | |
|
|
438 | // temporary(?) testing hack |
|
|
439 | if (argc >= 2 && !strcmp (argv [1], "--noise")) |
|
|
440 | { |
|
|
441 | void noise_test (); |
|
|
442 | noise_test (); |
|
|
443 | exit (0); |
|
|
444 | } |
|
|
445 | |
|
|
446 | #if 0 |
|
|
447 | // code sometiems used for timing benchmarks |
|
|
448 | random_number_generator<freeciv_random_generator> rng; |
|
|
449 | rng.seed(0); |
|
|
450 | for (int i = 0; i < 10; ++i) |
|
|
451 | printf ("%08x\n", rng.get_u32()); |
|
|
452 | for (int i = 0; i < 1000000; ++i) |
|
|
453 | volatile int r = rng.get_u32 (); |
|
|
454 | cstamp s = stamp (); |
|
|
455 | for (int i = 0; i < 1000000; ++i) |
|
|
456 | volatile int r = rng.next (); |
|
|
457 | printf ("c %d\n", (int)measure (s)); |
|
|
458 | exit (0); |
|
|
459 | #endif |
|
|
460 | |
592 | init (argc, argv); |
461 | init (argc, argv); |
593 | |
462 | |
594 | for (;;) |
463 | for (;;) |
595 | cfperl_main (); |
464 | cfperl_main (); |
596 | } |
465 | } |
597 | #endif |
|
|
598 | |
466 | |
599 | #if 0 |
|
|
600 | int xyzzy () |
|
|
601 | { |
|
|
602 | return rndm(8); |
|
|
603 | } |
|
|
604 | |
|
|
605 | void xyzzy (object_ptr &a, object_ptr &o) |
|
|
606 | { |
|
|
607 | asm volatile ("int3"); |
|
|
608 | a = o; |
|
|
609 | asm volatile ("int3"); |
|
|
610 | } |
|
|
611 | #endif |
|
|
612 | |
|
|