1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program 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 2 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, write to the Free Software |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * <http://www.gnu.org/licenses/>. |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <global.h> |
25 | #include <global.h> |
26 | #include <object.h> |
26 | #include <object.h> |
27 | #include <tod.h> |
27 | #include <tod.h> |
28 | |
28 | |
29 | #include <sproto.h> |
29 | #include <sproto.h> |
30 | #include <time.h> |
30 | #include <time.h> |
31 | |
31 | |
32 | #include <../random_maps/random_map.h> |
32 | #include <glib.h> |
33 | #include <../random_maps/rproto.h> |
33 | |
|
|
34 | #include <rmg.h> |
|
|
35 | #include <rproto.h> |
34 | #include "path.h" |
36 | #include "path.h" |
35 | |
|
|
36 | static char days[7][4] = { |
|
|
37 | "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" |
|
|
38 | }; |
|
|
39 | |
37 | |
40 | void |
38 | void |
41 | version (object *op) |
39 | version (object *op) |
42 | { |
40 | { |
43 | if (op) |
|
|
44 | clear_win_info (op); |
|
|
45 | |
|
|
46 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION); |
41 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION); |
47 | |
|
|
48 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
|
|
49 | new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); |
|
|
50 | new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); |
|
|
51 | new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>"); |
|
|
52 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
|
|
53 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:"); |
|
|
54 | new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>"); |
|
|
55 | new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>"); |
|
|
56 | new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>"); |
|
|
57 | new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>"); |
|
|
58 | new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>"); |
|
|
59 | new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>"); |
|
|
60 | new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>"); |
|
|
61 | new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>"); |
|
|
62 | new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>"); |
|
|
63 | new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>"); |
|
|
64 | new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>"); |
|
|
65 | new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>"); |
|
|
66 | new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>"); |
|
|
67 | new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>"); |
|
|
68 | new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>"); |
|
|
69 | new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>"); |
|
|
70 | new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>"); |
|
|
71 | new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>"); |
|
|
72 | new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>"); |
|
|
73 | new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>"); |
|
|
74 | new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>"); |
|
|
75 | new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>"); |
|
|
76 | new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>"); |
|
|
77 | new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>"); |
|
|
78 | new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>"); |
|
|
79 | new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>"); |
|
|
80 | new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>"); |
|
|
81 | new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>"); |
|
|
82 | new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>"); |
|
|
83 | new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>"); |
|
|
84 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>"); |
|
|
85 | new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>"); |
|
|
86 | new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>"); |
|
|
87 | new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>"); |
|
|
88 | new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>"); |
|
|
89 | new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>"); |
|
|
90 | new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>"); |
|
|
91 | new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>"); |
|
|
92 | new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>"); |
|
|
93 | new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n"); |
|
|
94 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
|
|
95 | new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
|
|
96 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
|
|
97 | new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>"); |
|
|
98 | new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>"); |
|
|
99 | new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>"); |
|
|
100 | new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>"); |
|
|
101 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
|
|
102 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
|
|
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 | object *tmp = object::create (); |
50 | op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y); |
114 | EXIT_PATH (tmp) = op->contr->savebed_map; |
|
|
115 | EXIT_X (tmp) = op->contr->bed_x; |
|
|
116 | EXIT_Y (tmp) = op->contr->bed_y; |
|
|
117 | op->enter_exit (tmp); |
|
|
118 | tmp->destroy (); |
|
|
119 | } |
51 | } |
120 | |
52 | |
121 | /* |
53 | /* |
122 | * enter_map(): Moves the player and pets from current map (if any) to |
54 | * enter_map(): Moves the player and pets from current map (if any) to |
123 | * 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 |
124 | * 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 |
125 | * whatever reason. If default map coordinates are to be used, then |
57 | * whatever reason. If default map coordinates are to be used, then |
126 | * the function that calls this should figure them out. |
58 | * the function that calls this should figure them out. |
127 | */ |
59 | */ |
128 | void |
60 | bool |
129 | object::enter_map (maptile *newmap, int x, int y) |
61 | object::enter_map (maptile *newmap, int x, int y) |
130 | { |
62 | { |
131 | if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) |
63 | if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE) |
132 | return; |
64 | return false; |
133 | |
65 | |
134 | if (out_of_map (newmap, x, y)) |
66 | if (out_of_map (newmap, x, y)) |
135 | { |
67 | { |
136 | 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); |
137 | x = newmap->enter_x; |
69 | x = newmap->enter_x; |
… | |
… | |
139 | if (out_of_map (newmap, x, y)) |
71 | if (out_of_map (newmap, x, y)) |
140 | { |
72 | { |
141 | 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", |
142 | &newmap->path, x, y, newmap->width, newmap->height); |
74 | &newmap->path, x, y, newmap->width, newmap->height); |
143 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
75 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
144 | return; |
76 | return false; |
145 | } |
77 | } |
146 | } |
78 | } |
147 | |
79 | |
148 | if (contr && map != newmap && map) |
80 | if (contr && map != newmap && map) |
149 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
81 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
150 | return; |
82 | return false; |
151 | |
83 | |
152 | // remove, so stupid ob_locked does not trigger a failure |
84 | // remove, so stupid blocked does not trigger a failure |
153 | remove (); |
85 | remove (); |
154 | |
86 | |
155 | /* try to find a spot for the player */ |
87 | /* try to find a spot for the player */ |
156 | if (ob_blocked (this, newmap, x, y)) |
88 | if (blocked (newmap, x, y)) |
157 | { /* First choice blocked */ |
89 | { /* First choice blocked */ |
158 | /* We try to find a spot for the player, starting closest in. |
90 | /* We try to find a spot for the player, starting closest in. |
159 | * We could use find_first_free_spot, but that doesn't randomize it at all, |
91 | * We could use find_first_free_spot, but that doesn't randomize it at all, |
160 | * So for example, if the north space is free, you would always end up there even |
92 | * So for example, if the north space is free, you would always end up there even |
161 | * if other spaces around are available. |
93 | * if other spaces around are available. |
162 | * 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 |
163 | * 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. |
164 | */ |
96 | */ |
165 | 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); |
166 | |
98 | |
167 | if (i == -1) |
99 | if (i < 0) |
168 | { |
100 | { |
169 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
101 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
170 | if (i == -1) |
102 | if (i < 0) |
171 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
103 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
172 | } |
104 | } |
173 | |
105 | |
174 | 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)) |
175 | { |
113 | { |
176 | x += freearr_x[i]; |
114 | newmap = m; |
177 | y += freearr_y[i]; |
115 | x = nx; |
|
|
116 | y = ny; |
|
|
117 | } |
178 | } |
118 | } |
179 | else |
119 | else |
180 | /* not much we can do in this case. */ |
120 | /* not much we can do in this case. */ |
181 | 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); |
182 | } |
122 | } |
183 | |
123 | |
184 | if (contr && map != newmap) |
124 | if (contr && map != newmap) |
185 | { |
125 | { |
186 | 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))) |
187 | return; |
127 | return false; |
188 | |
128 | |
189 | 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))) |
190 | return; |
130 | return false; |
191 | } |
131 | } |
192 | |
|
|
193 | this->x = x; |
|
|
194 | this->y = y; |
|
|
195 | map = newmap; |
|
|
196 | |
|
|
197 | insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
|
|
198 | |
132 | |
199 | enemy = 0; |
133 | enemy = 0; |
200 | |
134 | |
|
|
135 | //newmap->insert (this, x, y); |
|
|
136 | newmap->insert (this, x, y, 0, INS_NO_AUTO_EXIT); |
|
|
137 | |
|
|
138 | if (map == newmap) // see if we actually arrived there - insert might trigger a teleport |
|
|
139 | { |
201 | if (contr) |
140 | if (contr) |
202 | { |
141 | { |
203 | contr->maplevel = newmap->path; |
142 | contr->maplevel = newmap->path; |
204 | contr->count = 0; |
143 | contr->count = 0; |
205 | } |
|
|
206 | |
144 | |
207 | /* Update any golems */ |
145 | /* Update any golems */ |
208 | if (type == PLAYER && contr->ranges[range_golem]) |
146 | if (object *golem = contr->golem) |
209 | { |
147 | { |
210 | int i = find_free_spot (contr->ranges[range_golem], newmap, x, y, 1, SIZEOFFREE); |
148 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
211 | |
149 | |
212 | if (i < 0) |
150 | if (i < 0) |
|
|
151 | golem->drop_and_destroy (); |
|
|
152 | else |
|
|
153 | { |
|
|
154 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
|
|
155 | golem->direction = find_dir_2 (golem->x - x, golem->y - y); |
|
|
156 | } |
|
|
157 | } |
213 | { |
158 | } |
214 | contr->ranges[range_golem]->destroy (); |
|
|
215 | contr->ranges[range_golem] = 0; |
|
|
216 | } |
|
|
217 | else |
|
|
218 | { |
|
|
219 | newmap->insert (contr->ranges[range_golem], x + freearr_x[i], y + freearr_y[i]); |
|
|
220 | |
159 | |
221 | contr->ranges[range_golem]->direction = |
|
|
222 | find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y); |
|
|
223 | } |
|
|
224 | } |
|
|
225 | |
|
|
226 | /* since the players map is already loaded, we don't need to worry |
160 | /* since the players map is already loaded, we don't need to worry |
227 | * about pending objects. |
161 | * about pending objects. |
228 | */ |
162 | */ |
229 | remove_all_pets (newmap); |
163 | move_all_pets (); |
|
|
164 | |
|
|
165 | return true; |
|
|
166 | } |
|
|
167 | |
|
|
168 | return false; |
230 | } |
169 | } |
231 | |
170 | |
232 | /* process_players1 and process_players2 do all the player related stuff. |
171 | /* process_players1 and process_players2 do all the player related stuff. |
233 | * I moved it out of process events and process_map. This was to some |
172 | * I moved it out of process events and process_map. This was to some |
234 | * extent for debugging as well as to get a better idea of the time used |
173 | * extent for debugging as well as to get a better idea of the time used |
… | |
… | |
237 | * is needed after the players have been updated. |
176 | * is needed after the players have been updated. |
238 | */ |
177 | */ |
239 | static void |
178 | static void |
240 | process_players1 () |
179 | process_players1 () |
241 | { |
180 | { |
242 | int flag; |
|
|
243 | |
|
|
244 | /* Basically, we keep looping until all the players have done their actions. */ |
181 | /* Basically, we keep looping until all the players have done their actions. */ |
245 | for (flag = 1; flag != 0;) |
182 | for (int flag = 1; flag != 0;) |
246 | { |
183 | { |
247 | flag = 0; |
184 | flag = 0; |
248 | for_all_players (pl) |
185 | for_all_players (pl) |
249 | { |
186 | { |
250 | pl->refcnt_chk (); |
187 | pl->refcnt_chk (); |
251 | |
188 | |
252 | if (!pl->ob || !pl->ns || !pl->ob->active) |
189 | if (expect_false (!pl->ob || !pl->ns || !pl->ob->active)) |
253 | continue; |
190 | continue; |
254 | |
191 | |
255 | if (pl->ob->speed_left > 0) |
|
|
256 | if (handle_newcs_player (pl->ob)) |
192 | if (handle_newcs_player (pl->ob)) |
257 | flag = 1; |
193 | flag = 1; |
258 | |
194 | } |
259 | /* If the player is not actively playing, don't make a |
195 | } |
260 | * backup save - nothing to save anyway. Plus, the |
|
|
261 | * map may not longer be valid. This can happen when the |
|
|
262 | * player quits - they exist for purposes of tracking on the map, |
|
|
263 | * but don't actually reside on any actual map. |
|
|
264 | */ |
|
|
265 | if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
266 | continue; |
|
|
267 | } /* end of for loop for all the players */ |
|
|
268 | } /* for flag */ |
|
|
269 | |
196 | |
270 | for_all_players (pl) |
197 | for_all_players (pl) |
271 | { |
198 | { |
|
|
199 | object *ob = pl->ob; |
|
|
200 | |
|
|
201 | // process_objects destroys the speed_left value |
|
|
202 | pl->speed_left_save = ob->speed_left; |
|
|
203 | |
272 | if (!pl->ob || !pl->ns || !pl->ob->active) |
204 | if (expect_false (!ob || !pl->ns || !ob->active)) |
273 | continue; |
205 | continue; |
274 | |
206 | |
275 | if (settings.casting_time) |
|
|
276 | { |
|
|
277 | if (pl->ob->casting_time > 0) |
|
|
278 | { |
|
|
279 | pl->ob->casting_time--; |
|
|
280 | pl->ob->start_holding = 1; |
|
|
281 | } |
|
|
282 | |
|
|
283 | /* set spell_state so we can update the range in stats field */ |
|
|
284 | if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1)) |
|
|
285 | pl->ob->start_holding = 0; |
|
|
286 | } |
|
|
287 | |
|
|
288 | do_some_living (pl->ob); |
207 | do_some_living (ob); |
289 | } |
208 | } |
290 | } |
209 | } |
291 | |
210 | |
292 | static void |
211 | static void |
293 | process_players2 () |
212 | process_players2 () |
294 | { |
213 | { |
295 | /* Then check if any players should use weapon-speed instead of speed */ |
214 | /* Then check if any players should use weapon-speed instead of speed */ |
296 | for_all_players (pl) |
215 | for_all_players (pl) |
297 | { |
216 | { |
298 | /* The code that did weapon_sp handling here was out of place - |
217 | // restore speed_left value saved by process_players1 |
299 | * this isn't called until after the player has finished there |
|
|
300 | * actions, and is thus out of place. All we do here is bounds |
|
|
301 | * checking. |
|
|
302 | */ |
|
|
303 | if (pl->has_hit) |
|
|
304 | { |
|
|
305 | if (pl->ob->speed_left > pl->weapon_sp) |
|
|
306 | pl->ob->speed_left = pl->weapon_sp; |
|
|
307 | |
|
|
308 | /* This needs to be here - if the player is running, we need to |
|
|
309 | * clear this each tick, but new commands are not being received |
|
|
310 | * so execute_newserver_command() is never called |
|
|
311 | */ |
|
|
312 | pl->has_hit = 0; |
|
|
313 | } |
|
|
314 | else if (pl->ob->speed_left > pl->ob->speed) |
|
|
315 | pl->ob->speed_left = pl->ob->speed; |
218 | pl->ob->speed_left = pl->speed_left_save; |
316 | } |
|
|
317 | } |
|
|
318 | |
219 | |
319 | void |
220 | pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
|
|
221 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
|
|
222 | } |
|
|
223 | } |
|
|
224 | |
|
|
225 | static void |
320 | process_events () |
226 | process_events () |
321 | { |
227 | { |
322 | process_players1 (); |
228 | process_players1 (); |
323 | |
229 | |
324 | for_all_actives (op) |
230 | for_all_actives (op) |
325 | { |
231 | { |
|
|
232 | // try to prefetch some stuff we expect to need |
|
|
233 | // obviously, it should be grouped into the same cacheline. |
|
|
234 | // preliminary results indicate that this gives halves the speed |
|
|
235 | // used for the inner loop |
|
|
236 | if (_i < actives.size ()) // HACK, rely on _i :/ |
|
|
237 | { |
|
|
238 | object *next = actives [_i + 1]; |
|
|
239 | |
|
|
240 | prefetch (&next->flag , 0, 1); |
|
|
241 | prefetch (&next->speed , 0, 1); |
|
|
242 | prefetch (&next->anim_speed, 0, 1); |
|
|
243 | prefetch (&next->contr , 0, 1); |
|
|
244 | } |
|
|
245 | |
326 | /* Now process op */ |
246 | /* Now process op */ |
327 | if (QUERY_FLAG (op, FLAG_FREED)) |
247 | if (expect_false (op->flag [FLAG_FREED])) |
328 | { |
248 | { |
329 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
249 | LOG (llevError, "BUG: process_events(): Free object on list (%s)\n", op->debug_desc ()); |
330 | op->set_speed (0); |
250 | op->set_speed (0); |
331 | continue; |
251 | continue; |
332 | } |
252 | } |
333 | |
253 | |
334 | /* I've seen occasional crashes due to this - the object is removed, |
|
|
335 | * and thus the map it points to (last map it was on) may be bogus |
|
|
336 | * The real bug is to try to find out the cause of this - someone |
|
|
337 | * is probably calling remove_ob without either an insert_ob or |
|
|
338 | * free_object afterwards, leaving an object dangling. But I'd |
|
|
339 | * rather log this and continue on instead of crashing. |
|
|
340 | * Don't remove players - when a player quits, the object is in |
|
|
341 | * sort of a limbo, of removed, but something we want to keep |
|
|
342 | * around. |
|
|
343 | */ |
|
|
344 | if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY) |
|
|
345 | { |
|
|
346 | LOG (llevError, "BUG: process_events(): Removed object on list\n"); |
|
|
347 | char *dump = dump_object (op); |
|
|
348 | LOG (llevError, dump); |
|
|
349 | free (dump); |
|
|
350 | op->destroy (); |
|
|
351 | continue; |
|
|
352 | } |
|
|
353 | |
|
|
354 | if (!op->has_active_speed ()) |
254 | if (expect_false (!op->has_active_speed ())) |
355 | { |
255 | { |
356 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
256 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
357 | "but is on active list\n", op->debug_desc (), op->speed); |
257 | "but is on active list\n", op->debug_desc (), op->speed); |
358 | op->set_speed (0); |
258 | op->set_speed (0); |
359 | continue; |
259 | continue; |
360 | } |
260 | } |
361 | |
261 | |
362 | if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) |
262 | if (expect_false (op->flag [FLAG_REMOVED])) |
363 | { |
263 | { |
364 | LOG (llevError, "BUG: process_events(): Object without map or " |
264 | LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
365 | "inventory is on active list: %s (%d)\n", &op->name, op->count); |
265 | op->debug_desc ()); |
366 | op->set_speed (0); |
266 | op->set_speed (0); |
367 | continue; |
267 | continue; |
368 | } |
268 | } |
369 | |
269 | |
370 | /* Animate the object. Bug or feature that anim_speed |
270 | /* Animate the object. Bug or feature that anim_speed |
371 | * is based on ticks, and not the creatures speed? |
271 | * is based on ticks, and not the creatures speed? |
372 | */ |
272 | */ |
373 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
273 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
374 | { |
274 | { |
375 | if ((op->type == PLAYER)) |
|
|
376 | animate_object (op, op->facing); |
|
|
377 | else |
|
|
378 | animate_object (op, op->direction); |
275 | animate_object (op, op->contr ? op->facing : op->direction); |
379 | |
|
|
380 | op->last_anim = 1; |
276 | op->last_anim = 1; |
381 | } |
277 | } |
382 | else |
278 | else |
383 | op->last_anim++; |
279 | ++op->last_anim; |
384 | |
280 | |
385 | if (op->speed_left > 0) |
281 | if (expect_false (op->speed_left > 0.f)) |
386 | { |
|
|
387 | #if 0 |
|
|
388 | /* I've seen occasional crashes in move_symptom() with it |
|
|
389 | * crashing because op is removed - add some debugging to |
|
|
390 | * track if it is removed at this point. |
|
|
391 | * This unfortunately is a bit too verbose it seems - not sure |
|
|
392 | * why - I think what happens is a map is freed or something and |
|
|
393 | * some objects get 'lost' - removed never to be reclaimed. |
|
|
394 | * removed objects generally shouldn't exist. |
|
|
395 | */ |
|
|
396 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
397 | { |
282 | { |
398 | LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null"); |
|
|
399 | } |
|
|
400 | #endif |
|
|
401 | --op->speed_left; |
283 | --op->speed_left; |
402 | process_object (op); |
284 | process_object (op); |
403 | |
|
|
404 | if (op->destroyed ()) |
|
|
405 | continue; |
|
|
406 | } |
285 | } |
407 | |
286 | |
408 | if (settings.casting_time == TRUE && op->casting_time > 0) |
287 | // this will destroy the speed_left value for players, but |
409 | op->casting_time--; |
288 | // process_players1 and ..2 save/restore the real value, |
410 | |
289 | // so we can avoid a costly test here. |
411 | if (op->speed_left <= 0) |
290 | op->speed_left = min (op->speed, op->speed_left + op->speed); |
412 | op->speed_left += FABS (op->speed); |
|
|
413 | } |
291 | } |
414 | |
292 | |
415 | process_players2 (); |
293 | process_players2 (); |
416 | } |
294 | } |
417 | |
295 | |
418 | /* clean up everything before exiting */ |
296 | /* clean up everything before exiting */ |
419 | void |
297 | void |
420 | emergency_save () |
298 | emergency_save () |
421 | { |
299 | { |
422 | LOG (llevDebug, "emergency save begin.\n"); |
300 | LOG (llevInfo, "emergency_save: enter\n"); |
|
|
301 | |
|
|
302 | LOG (llevInfo, "emergency_save: saving book archive\n"); |
|
|
303 | write_book_archive (); |
423 | |
304 | |
424 | cfperl_emergency_save (); |
305 | cfperl_emergency_save (); |
425 | |
306 | |
426 | LOG (llevDebug, "saving book archive.\n"); |
|
|
427 | write_book_archive (); |
|
|
428 | |
|
|
429 | LOG (llevDebug, "emergency save done.\n"); |
307 | LOG (llevInfo, "emergency_save: leave\n"); |
430 | } |
308 | } |
431 | |
309 | |
432 | // send all clients some informational text |
310 | // send all clients some informational text |
433 | static void |
311 | static void |
434 | cleanup_inform (const char *cause, bool make_core) |
312 | cleanup_inform (const char *cause, bool make_core) |
435 | { |
313 | { |
436 | int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
314 | int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
437 | |
315 | |
438 | new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); |
316 | new_draw_info_format (flags, 0, 0, "The server will now shutdown."); |
439 | new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s\n", cause); |
317 | new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause); |
440 | |
318 | |
441 | if (make_core) |
319 | if (make_core) |
442 | new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.\n"); |
320 | new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved."); |
443 | else |
321 | else |
444 | new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players have been saved.\n"); |
322 | new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now."); |
445 | |
323 | |
446 | new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); |
324 | new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE); |
447 | |
325 | |
448 | flush_sockets (); |
326 | client::flush_sockets (); |
449 | } |
327 | } |
450 | |
328 | |
451 | /* clean up everything before exiting */ |
329 | /* clean up everything before exiting */ |
452 | void |
330 | void |
453 | cleanup (const char *cause, bool make_core) |
331 | cleanup (const char *cause, bool make_core) |
454 | { |
332 | { |
455 | if (make_core) |
333 | if (make_core) |
456 | fork_abort (cause); |
334 | fork_abort (cause); |
457 | |
335 | |
458 | LOG (llevError, "cleanup cause: %s\n", cause); |
336 | LOG (make_core ? llevError : llevInfo, "cleanup cause: %s\n", cause); |
459 | |
337 | |
460 | if (!make_core) |
338 | if (!make_core) |
461 | cleanup_inform (cause, make_core); |
339 | cleanup_inform (cause, make_core); |
462 | |
340 | |
463 | LOG (llevDebug, "cleanup begin.\n"); |
341 | LOG (llevDebug, "cleanup begin.\n"); |
… | |
… | |
473 | LOG (llevDebug, "running cleanup handlers.\n"); |
351 | LOG (llevDebug, "running cleanup handlers.\n"); |
474 | INVOKE_GLOBAL (CLEANUP); |
352 | INVOKE_GLOBAL (CLEANUP); |
475 | |
353 | |
476 | LOG (llevDebug, "cleanup done.\n"); |
354 | LOG (llevDebug, "cleanup done.\n"); |
477 | |
355 | |
|
|
356 | log_cleanup (); |
|
|
357 | |
478 | if (make_core) |
358 | if (make_core) |
479 | { |
|
|
480 | cleanup_inform (cause, make_core); |
359 | cleanup_inform (cause, make_core); |
481 | _exit (1); |
|
|
482 | } |
|
|
483 | else |
360 | else |
484 | _exit (0); |
|
|
485 | } |
|
|
486 | |
|
|
487 | int |
|
|
488 | forbid_play (void) |
|
|
489 | { |
|
|
490 | #if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE) |
|
|
491 | char buf[MAX_BUF], day[MAX_BUF]; |
|
|
492 | FILE *fp; |
|
|
493 | time_t clock; |
|
|
494 | struct tm *tm; |
|
|
495 | int i, start, stop, forbit = 0, comp; |
|
|
496 | |
|
|
497 | clock = time (NULL); |
|
|
498 | tm = (struct tm *) localtime (&clock); |
|
|
499 | |
|
|
500 | sprintf (buf, "%s/%s", settings.confdir, PERM_FILE); |
|
|
501 | if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
|
|
502 | return 0; |
|
|
503 | |
|
|
504 | while (fgets (buf, MAX_BUF, fp)) |
|
|
505 | { |
|
|
506 | if (buf[0] == '#') |
|
|
507 | continue; |
|
|
508 | |
|
|
509 | if (!strncmp (buf, "msg", 3)) |
|
|
510 | { |
|
|
511 | if (forbit) |
|
|
512 | while (fgets (buf, MAX_BUF, fp)) /* print message */ |
|
|
513 | fputs (buf, logfile); |
|
|
514 | break; |
|
|
515 | } |
|
|
516 | else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
|
|
517 | { |
|
|
518 | LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
|
|
519 | continue; |
|
|
520 | } |
|
|
521 | |
|
|
522 | for (i = 0; i < 7; i++) |
|
|
523 | { |
|
|
524 | if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop)) |
|
|
525 | forbit = 1; |
|
|
526 | } |
|
|
527 | } |
361 | { |
|
|
362 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting."); |
|
|
363 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE); |
|
|
364 | client::flush_sockets (); |
|
|
365 | } |
528 | |
366 | |
529 | close_and_delete (fp, comp); |
367 | cfperl_cleanup (make_core); |
530 | |
368 | _exit (make_core); |
531 | return forbit; |
|
|
532 | #else |
|
|
533 | return 0; |
|
|
534 | #endif |
|
|
535 | } |
369 | } |
536 | |
370 | |
537 | /* |
371 | /* |
538 | * do_specials() is a collection of functions to call from time to time. |
372 | * do_specials() is a collection of functions to call from time to time. |
539 | * Modified 2000-1-14 MSW to use the global pticks count to determine how |
373 | * Modified 2000-1-14 MSW to use the global pticks count to determine how |
… | |
… | |
545 | * done on the same tick, but that will happen very infrequently |
379 | * done on the same tick, but that will happen very infrequently |
546 | * |
380 | * |
547 | * I also think this code makes it easier to see how often we really are |
381 | * I also think this code makes it easier to see how often we really are |
548 | * doing the various things. |
382 | * doing the various things. |
549 | */ |
383 | */ |
550 | |
384 | static void |
551 | extern unsigned long todtick; |
|
|
552 | |
|
|
553 | void |
|
|
554 | do_specials (void) |
385 | do_specials () |
555 | { |
386 | { |
556 | if (!(pticks % PTICKS_PER_CLOCK)) |
|
|
557 | tick_the_clock (); |
|
|
558 | |
|
|
559 | if (!(pticks % 7)) |
|
|
560 | shstr::gc (); |
387 | shstr::gc (); |
|
|
388 | archetype::gc (); |
561 | |
389 | |
|
|
390 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
|
|
391 | maptile::adjust_daylight (); |
|
|
392 | |
562 | if (!(pticks % 2503)) |
393 | if (expect_false (!(pticks % 2503))) |
563 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
394 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
564 | |
395 | |
565 | if (!(pticks % 5003)) |
396 | if (expect_false (!(pticks % 5003))) |
566 | write_book_archive (); |
397 | write_book_archive (); |
567 | |
398 | |
568 | if (!(pticks % 5009)) |
399 | if (expect_false (!(pticks % 5009))) |
569 | clean_friendly_list (); |
400 | clean_friendly_list (); |
570 | |
401 | |
571 | if (!(pticks % 5011)) |
402 | if (expect_false (!(pticks % 5011))) |
572 | obsolete_parties (); |
403 | obsolete_parties (); |
573 | |
404 | |
574 | if (!(pticks % 12503)) |
405 | if (expect_false (!(pticks % 12503))) |
575 | fix_luck (); |
406 | fix_luck (); |
576 | } |
407 | } |
577 | |
408 | |
578 | void |
409 | void |
579 | server_tick () |
410 | server_tick () |
580 | { |
411 | { |
581 | // first do the user visible stuff |
412 | // first do the user visible stuff |
582 | doeric_server (); |
|
|
583 | INVOKE_GLOBAL (CLOCK); |
413 | INVOKE_GLOBAL (CLOCK); |
584 | process_events (); /* "do" something with objects with speed */ |
414 | process_events (); // "do" something with objects with speed |
585 | flush_sockets (); |
415 | client::clock (); // draw client maps etc. |
586 | |
416 | |
587 | // then do some bookkeeping, should not really be here |
417 | // then do some bookkeeping, should not really be here |
588 | do_specials (); /* Routines called from time to time. */ |
418 | do_specials (); /* Routines called from time to time. */ |
589 | attachable::check_mortals (); |
419 | attachable::check_mortals (); |
590 | |
420 | |
591 | ++pticks; |
421 | ++pticks; |
592 | } |
|
|
593 | |
422 | |
594 | #if 0 |
423 | if (object::object_count >= RESTART_COUNT) |
595 | // used fro benchmarking (x86/amd64-specific) |
424 | cleanup ("running out of protocol ID values - need full restart"); |
596 | typedef unsigned long tval; |
|
|
597 | typedef unsigned long long stamp64; |
|
|
598 | |
|
|
599 | extern inline tval |
|
|
600 | stamp (void) |
|
|
601 | { |
|
|
602 | tval tsc; |
|
|
603 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
604 | |
|
|
605 | return tsc; |
|
|
606 | } |
425 | } |
607 | |
|
|
608 | extern inline tval |
|
|
609 | measure (tval t) |
|
|
610 | { |
|
|
611 | tval tsc; |
|
|
612 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
613 | |
|
|
614 | if (tsc > t) |
|
|
615 | return tsc - t; |
|
|
616 | else |
|
|
617 | return t - tsc; |
|
|
618 | } |
|
|
619 | |
|
|
620 | int |
|
|
621 | main (int argc, char **argv) |
|
|
622 | { |
|
|
623 | rand_gen rg(0); |
|
|
624 | tval fastest = 0x7fffffff; |
|
|
625 | for (int loop = 10000; loop--; ) |
|
|
626 | { |
|
|
627 | tval s = stamp (); |
|
|
628 | volatile int i = rg.get_int(25); |
|
|
629 | fastest = min (fastest, measure (s)); |
|
|
630 | } |
|
|
631 | |
|
|
632 | //printf ("fastest %d\n", fastest); |
|
|
633 | for (int i = 0; i < 1024*1024*3; ++i) |
|
|
634 | { |
|
|
635 | char c = rg.get_int (256); |
|
|
636 | write (2, &c, 1); |
|
|
637 | } |
|
|
638 | } |
|
|
639 | |
|
|
640 | #else |
|
|
641 | |
426 | |
642 | // normal main |
427 | // normal main |
643 | int |
428 | int |
644 | main (int argc, char **argv) |
429 | main (int argc, char **argv) |
645 | { |
430 | { |
646 | settings.argc = argc; |
431 | settings.argc = argc; |
647 | settings.argv = argv; |
432 | settings.argv = argv; |
648 | |
433 | |
|
|
434 | rndm.seed (time (0)); |
|
|
435 | g_thread_init (0); // for the slice allocator only |
|
|
436 | |
|
|
437 | #if 0 |
|
|
438 | // code sometiems used for timing benchmarks |
|
|
439 | random_number_generator<freeciv_random_generator> rng; |
|
|
440 | rng.seed(0); |
|
|
441 | for (int i = 0; i < 10; ++i) |
|
|
442 | printf ("%08x\n", rng.get_u32()); |
|
|
443 | for (int i = 0; i < 1000000; ++i) |
|
|
444 | volatile int r = rng.get_u32 (); |
|
|
445 | cstamp s = stamp (); |
|
|
446 | for (int i = 0; i < 1000000; ++i) |
|
|
447 | volatile int r = rng.next (); |
|
|
448 | printf ("c %d\n", (int)measure (s)); |
|
|
449 | exit (0); |
|
|
450 | #endif |
|
|
451 | |
649 | init (argc, argv); |
452 | init (argc, argv); |
650 | |
|
|
651 | initPlugins (); |
|
|
652 | |
453 | |
653 | for (;;) |
454 | for (;;) |
654 | cfperl_main (); |
455 | cfperl_main (); |
655 | } |
456 | } |
656 | #endif |
|
|
657 | |
457 | |