1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | |
3 | * |
|
|
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
6 | |
7 | * |
7 | This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | 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 |
9 | the Free Software Foundation; either version 2 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | (at your option) any later version. |
11 | * option) any later version. |
11 | |
12 | * |
12 | This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
16 | |
17 | * |
17 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
18 | 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 |
19 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * <http://www.gnu.org/licenses/>. |
20 | |
21 | * |
21 | 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> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
25 | #include <object.h> |
26 | #include <object.h> |
26 | #include <tod.h> |
27 | #include <tod.h> |
27 | |
28 | |
28 | #ifdef HAVE_DES_H |
|
|
29 | # include <des.h> |
|
|
30 | #else |
|
|
31 | # ifdef HAVE_CRYPT_H |
|
|
32 | # include <crypt.h> |
|
|
33 | # endif |
|
|
34 | #endif |
|
|
35 | |
|
|
36 | #include <sproto.h> |
29 | #include <sproto.h> |
37 | #include <time.h> |
30 | #include <time.h> |
38 | |
31 | |
39 | #include <../random_maps/random_map.h> |
32 | #include <glib.h> |
40 | #include <../random_maps/rproto.h> |
33 | |
|
|
34 | #include <rmg.h> |
|
|
35 | #include <rproto.h> |
41 | #include "path.h" |
36 | #include "path.h" |
42 | |
|
|
43 | static char days[7][4] = { |
|
|
44 | "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" |
|
|
45 | }; |
|
|
46 | |
37 | |
47 | void |
38 | void |
48 | version (object *op) |
39 | version (object *op) |
49 | { |
40 | { |
50 | if (op != NULL) |
|
|
51 | clear_win_info (op); |
|
|
52 | |
|
|
53 | 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); |
54 | |
|
|
55 | /* If in a socket, don't print out the list of authors. It confuses the |
|
|
56 | * crossclient program. |
|
|
57 | */ |
|
|
58 | if (op == NULL) |
|
|
59 | return; |
|
|
60 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
|
|
61 | new_draw_info (NDI_UNIQUE, 0, op, "mwedel@sonic.net (Mark Wedel)"); |
|
|
62 | new_draw_info (NDI_UNIQUE, 0, op, "frankj@ifi.uio.no (Frank Tore Johansen)"); |
|
|
63 | new_draw_info (NDI_UNIQUE, 0, op, "kjetilho@ifi.uio.no (Kjetil Torgrim Homme)"); |
|
|
64 | new_draw_info (NDI_UNIQUE, 0, op, "tvangod@ecst.csuchico.edu (Tyler Van Gorder)"); |
|
|
65 | new_draw_info (NDI_UNIQUE, 0, op, "elmroth@cd.chalmers.se (Tony Elmroth)"); |
|
|
66 | new_draw_info (NDI_UNIQUE, 0, op, "dougal.scott@fcit.monasu.edu.au (Dougal Scott)"); |
|
|
67 | new_draw_info (NDI_UNIQUE, 0, op, "wchuang@athena.mit.edu (William)"); |
|
|
68 | new_draw_info (NDI_UNIQUE, 0, op, "ftww@cs.su.oz.au (Geoff Bailey)"); |
|
|
69 | new_draw_info (NDI_UNIQUE, 0, op, "jorgens@flipper.pvv.unit.no (Kjetil Wiekhorst Jxrgensen)"); |
|
|
70 | new_draw_info (NDI_UNIQUE, 0, op, "c.blackwood@rdt.monash.edu.au (Cameron Blackwood)"); |
|
|
71 | new_draw_info (NDI_UNIQUE, 0, op, "jtraub+@cmu.edu (Joseph L. Traub)"); |
|
|
72 | new_draw_info (NDI_UNIQUE, 0, op, "rgg@aaii.oz.au (Rupert G. Goldie)"); |
|
|
73 | new_draw_info (NDI_UNIQUE, 0, op, "eanders+@cmu.edu (Eric A. Anderson)"); |
|
|
74 | new_draw_info (NDI_UNIQUE, 0, op, "eneq@Prag.DoCS.UU.SE (Rickard Eneqvist)"); |
|
|
75 | new_draw_info (NDI_UNIQUE, 0, op, "Jarkko.Sonninen@lut.fi (Jarkko Sonninen)"); |
|
|
76 | new_draw_info (NDI_UNIQUE, 0, op, "kholland@sunlab.cit.cornell.du (Karl Holland)"); |
|
|
77 | new_draw_info (NDI_UNIQUE, 0, op, "vick@bern.docs.uu.se (Mikael Lundgren)"); |
|
|
78 | new_draw_info (NDI_UNIQUE, 0, op, "mol@meryl.csd.uu.se (Mikael Olsson)"); |
|
|
79 | new_draw_info (NDI_UNIQUE, 0, op, "Tero.Haatanen@lut.fi (Tero Haatanen)"); |
|
|
80 | new_draw_info (NDI_UNIQUE, 0, op, "ylitalo@student.docs.uu.se (Lasse Ylitalo)"); |
|
|
81 | new_draw_info (NDI_UNIQUE, 0, op, "anipa@guru.magic.fi (Niilo Neuvo)"); |
|
|
82 | new_draw_info (NDI_UNIQUE, 0, op, "mta@modeemi.cs.tut.fi (Markku J{rvinen)"); |
|
|
83 | new_draw_info (NDI_UNIQUE, 0, op, "meunier@inf.enst.fr (Sylvain Meunier)"); |
|
|
84 | new_draw_info (NDI_UNIQUE, 0, op, "jfosback@darmok.uoregon.edu (Jason Fosback)"); |
|
|
85 | new_draw_info (NDI_UNIQUE, 0, op, "cedman@capitalist.princeton.edu (Carl Edman)"); |
|
|
86 | new_draw_info (NDI_UNIQUE, 0, op, "henrich@crh.cl.msu.edu (Charles Henrich)"); |
|
|
87 | new_draw_info (NDI_UNIQUE, 0, op, "schmid@fb3-s7.math.tu-berlin.de (Gregor Schmid)"); |
|
|
88 | new_draw_info (NDI_UNIQUE, 0, op, "quinet@montefiore.ulg.ac.be (Raphael Quinet)"); |
|
|
89 | new_draw_info (NDI_UNIQUE, 0, op, "jam@modeemi.cs.tut.fi (Jari Vanhala)"); |
|
|
90 | new_draw_info (NDI_UNIQUE, 0, op, "kivinen@joker.cs.hut.fi (Tero Kivinen)"); |
|
|
91 | new_draw_info (NDI_UNIQUE, 0, op, "peterm@soda.berkeley.edu (Peter Mardahl)"); |
|
|
92 | new_draw_info (NDI_UNIQUE, 0, op, "matt@cs.odu.edu (Matthew Zeher)"); |
|
|
93 | new_draw_info (NDI_UNIQUE, 0, op, "srt@sun-dimas.aero.org (Scott R. Turner)"); |
|
|
94 | new_draw_info (NDI_UNIQUE, 0, op, "huma@netcom.com (Ben Fennema)"); |
|
|
95 | new_draw_info (NDI_UNIQUE, 0, op, "njw@cs.city.ac.uk (Nick Williams)"); |
|
|
96 | new_draw_info (NDI_UNIQUE, 0, op, "Wacren@Gin.ObsPM.Fr (Laurent Wacrenier)"); |
|
|
97 | new_draw_info (NDI_UNIQUE, 0, op, "thomas@astro.psu.edu (Brian Thomas)"); |
|
|
98 | new_draw_info (NDI_UNIQUE, 0, op, "jsm@axon.ksc.nasa.gov (John Steven Moerk)"); |
|
|
99 | new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David [david.delbecq@mailandnews.com]"); |
|
|
100 | new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann [yann.chachkoff@mailandnews.com]\n"); |
|
|
101 | new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
|
|
102 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
|
|
103 | new_draw_info (NDI_UNIQUE, 0, op, "David Gervais [david_eg@mail.com]"); |
|
|
104 | new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura [ita@gold.koma.jaeri.go.jp]"); |
|
|
105 | new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner [hansjoerg.malthaner@danet.de]"); |
|
|
106 | new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg [maxmc@telia.com]"); |
|
|
107 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
|
|
108 | } |
|
|
109 | |
|
|
110 | void |
|
|
111 | info_keys (object *op) |
|
|
112 | { |
|
|
113 | clear_win_info (op); |
|
|
114 | new_draw_info (NDI_UNIQUE, 0, op, "Push `hjklynub' to walk in a direction."); |
|
|
115 | new_draw_info (NDI_UNIQUE, 0, op, "Shift + dir = fire, Ctrl + dir = run"); |
|
|
116 | new_draw_info (NDI_UNIQUE, 0, op, "(To fire at yourself, hit `.'"); |
|
|
117 | new_draw_info (NDI_UNIQUE, 0, op, "To attack, walk into the monsters."); |
|
|
118 | new_draw_info (NDI_UNIQUE, 0, op, "\" = speak ' = extended command"); |
|
|
119 | new_draw_info (NDI_UNIQUE, 0, op, "i = inventory , = get : = look"); |
|
|
120 | new_draw_info (NDI_UNIQUE, 0, op, "<> = rotate d = drop ? = help"); |
|
|
121 | new_draw_info (NDI_UNIQUE, 0, op, "a = apply A = apply below t = throw"); |
|
|
122 | new_draw_info (NDI_UNIQUE, 0, op, "e = examine E = exa below @ = autopick"); |
|
|
123 | new_draw_info (NDI_UNIQUE, 0, op, "C = configure s = brace v = version"); |
|
|
124 | new_draw_info (NDI_UNIQUE, 0, op, "+- = change range <tab> = browse spells"); |
|
|
125 | new_draw_info (NDI_UNIQUE, 0, op, "x = change inventory type"); |
|
|
126 | new_draw_info (NDI_UNIQUE, 0, op, "Mouse: L = examine, M = apply, R = drop/get"); |
|
|
127 | new_draw_info (NDI_UNIQUE, 0, op, "'help = info about extended commands."); |
|
|
128 | new_draw_info (NDI_UNIQUE, 0, op, "Ctrl-R = refresh Ctrl-C = clear"); |
|
|
129 | new_draw_info (NDI_UNIQUE, 0, op, "You can type a number before most commands."); |
|
|
130 | new_draw_info (NDI_UNIQUE, 0, op, "(For instance 3d drops 3 items.)"); |
|
|
131 | } |
42 | } |
132 | |
43 | |
133 | /* 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 |
134 | * savebed. We do some error checking - its possible that the |
45 | * savebed. |
135 | * savebed map may no longer exist, so we make sure the player |
|
|
136 | * goes someplace. |
|
|
137 | */ |
46 | */ |
138 | void |
47 | void |
139 | enter_player_savebed (object *op) |
48 | enter_player_savebed (object *op) |
140 | { |
49 | { |
141 | maptile *oldmap = op->map; |
50 | op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y); |
142 | object *tmp; |
|
|
143 | |
|
|
144 | tmp = object::create (); |
|
|
145 | |
|
|
146 | EXIT_PATH (tmp) = op->contr->savebed_map; |
|
|
147 | EXIT_X (tmp) = op->contr->bed_x; |
|
|
148 | EXIT_Y (tmp) = op->contr->bed_y; |
|
|
149 | op->enter_exit (tmp); |
|
|
150 | |
|
|
151 | /* If the player has not changed maps and the name does not match |
|
|
152 | * that of the savebed, his savebed map is gone. Lets go back |
|
|
153 | * to the emergency path. Update what the players savebed is |
|
|
154 | * while we're at it. |
|
|
155 | */ |
|
|
156 | //TODO: must go - move to interim map |
|
|
157 | if (oldmap == op->map && strcmp (op->contr->savebed_map, oldmap->path)) |
|
|
158 | { |
|
|
159 | LOG (llevDebug, "Player %s savebed location %s is invalid - going to emergency location\n", |
|
|
160 | &op->name, op->contr->savebed_map); |
|
|
161 | strcpy (op->contr->savebed_map, "/world/world_105_115"); |
|
|
162 | op->contr->bed_x = 5; |
|
|
163 | op->contr->bed_y = 37; |
|
|
164 | EXIT_PATH (tmp) = op->contr->savebed_map; |
|
|
165 | EXIT_X (tmp) = op->contr->bed_x; |
|
|
166 | EXIT_Y (tmp) = op->contr->bed_y; |
|
|
167 | op->enter_exit (tmp); |
|
|
168 | } |
|
|
169 | |
|
|
170 | tmp->destroy (); |
|
|
171 | } |
51 | } |
172 | |
52 | |
173 | /* |
53 | /* |
174 | * 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 |
175 | * 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 |
176 | * 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 |
177 | * whatever reason. If default map coordinates are to be used, then |
57 | * whatever reason. If default map coordinates are to be used, then |
178 | * the function that calls this should figure them out. |
58 | * the function that calls this should figure them out. |
179 | */ |
59 | */ |
180 | void |
60 | bool |
181 | object::enter_map (maptile *newmap, int x, int y) |
61 | object::enter_map (maptile *newmap, int x, int y) |
182 | { |
62 | { |
183 | if (!newmap->load ()) |
63 | if (destroyed () || !newmap || !newmap->linkable ()) |
184 | return; |
64 | return false; |
185 | |
65 | |
186 | if (out_of_map (newmap, x, y)) |
66 | if (out_of_map (newmap, x, y)) |
187 | { |
67 | { |
188 | 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); |
189 | x = newmap->enter_x; |
69 | x = newmap->enter_x; |
… | |
… | |
191 | if (out_of_map (newmap, x, y)) |
71 | if (out_of_map (newmap, x, y)) |
192 | { |
72 | { |
193 | 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", |
194 | &newmap->path, x, y, newmap->width, newmap->height); |
74 | &newmap->path, x, y, newmap->width, newmap->height); |
195 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
75 | new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
196 | return; |
76 | return false; |
197 | } |
77 | } |
198 | } |
78 | } |
|
|
79 | |
|
|
80 | if (contr && map != newmap && map) |
|
|
81 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
|
|
82 | return false; |
|
|
83 | |
|
|
84 | // remove, so stupid blocked does not trigger a failure |
|
|
85 | remove (); |
199 | |
86 | |
200 | /* try to find a spot for the player */ |
87 | /* try to find a spot for the player */ |
201 | if (ob_blocked (this, newmap, x, y)) |
88 | if (blocked (newmap, x, y)) |
202 | { /* First choice blocked */ |
89 | { /* First choice blocked */ |
203 | /* 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. |
204 | * 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, |
205 | * 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 |
206 | * if other spaces around are available. |
93 | * if other spaces around are available. |
207 | * 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 |
208 | * 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. |
209 | */ |
96 | */ |
210 | 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); |
211 | |
98 | |
212 | if (i == -1) |
99 | if (i < 0) |
213 | { |
100 | { |
214 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
101 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
215 | if (i == -1) |
102 | if (i < 0) |
216 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
103 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
217 | } |
104 | } |
218 | |
105 | |
219 | 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)) |
220 | { |
113 | { |
221 | x += freearr_x[i]; |
114 | newmap = m; |
222 | y += freearr_y[i]; |
115 | x = nx; |
|
|
116 | y = ny; |
|
|
117 | } |
223 | } |
118 | } |
224 | else |
119 | else |
225 | /* not much we can do in this case. */ |
120 | /* not much we can do in this case. */ |
226 | 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); |
227 | } |
122 | } |
228 | |
123 | |
229 | if (map) |
124 | if (contr && map != newmap) |
230 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
125 | { |
231 | return; |
|
|
232 | |
|
|
233 | 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))) |
234 | return; |
127 | return false; |
235 | |
128 | |
236 | 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))) |
237 | return; |
130 | return false; |
|
|
131 | } |
238 | |
132 | |
239 | /* If it is a player login, he has yet to be inserted anyplace. |
|
|
240 | * otherwise, we need to deal with removing the player here. |
|
|
241 | */ |
|
|
242 | remove (); |
|
|
243 | |
|
|
244 | this->x = x; |
|
|
245 | this->y = y; |
|
|
246 | map = newmap; |
|
|
247 | |
|
|
248 | insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
|
|
249 | |
|
|
250 | newmap->timeout = 0; |
|
|
251 | enemy = NULL; |
133 | enemy = 0; |
252 | |
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 | { |
253 | if (contr) |
142 | if (contr) |
254 | { |
143 | { |
255 | strcpy (contr->maplevel, newmap->path); |
144 | contr->maplevel = newmap->path; |
256 | contr->count = 0; |
145 | contr->count = 0; |
257 | } |
|
|
258 | |
146 | |
259 | /* Update any golems */ |
147 | /* Update any golems */ |
260 | if (type == PLAYER && contr->ranges[range_golem]) |
148 | if (object *golem = contr->golem) |
261 | { |
|
|
262 | int i = find_free_spot (contr->ranges[range_golem], newmap, |
|
|
263 | x, y, 1, SIZEOFFREE); |
|
|
264 | |
|
|
265 | contr->ranges[range_golem]->remove (); |
|
|
266 | |
|
|
267 | if (i == -1) |
|
|
268 | { |
|
|
269 | remove_friendly_object (contr->ranges[range_golem]); |
|
|
270 | contr->ranges[range_golem]->destroy (); |
|
|
271 | contr->ranges[range_golem] = 0; |
|
|
272 | } |
|
|
273 | else |
|
|
274 | { |
|
|
275 | for (object *tmp = contr->ranges[range_golem]; tmp != NULL; tmp = tmp->more) |
|
|
276 | { |
149 | { |
277 | tmp->x = x + freearr_x[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.x); |
150 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
278 | tmp->y = y + freearr_y[i] + (tmp->arch == NULL ? 0 : tmp->arch->clone.y); |
151 | |
279 | tmp->map = newmap; |
152 | if (i < 0) |
|
|
153 | golem->drop_and_destroy (); |
|
|
154 | else |
|
|
155 | { |
|
|
156 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
|
|
157 | golem->direction = find_dir_2 (golem->x - x, golem->y - y); |
|
|
158 | } |
280 | } |
159 | } |
281 | |
|
|
282 | insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0); |
|
|
283 | contr->ranges[range_golem]->direction = |
|
|
284 | find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y); |
|
|
285 | } |
160 | } |
286 | } |
|
|
287 | |
161 | |
288 | direction = 0; |
|
|
289 | |
|
|
290 | /* 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 |
291 | * about pending objects. |
163 | * about pending objects. |
292 | */ |
164 | */ |
293 | remove_all_pets (newmap); |
165 | move_all_pets (); |
294 | } |
|
|
295 | |
166 | |
296 | /* clean_path takes a path and replaces all / with _ |
167 | return true; |
297 | * We do a strcpy so that we do not change the original string. |
168 | } |
298 | */ |
|
|
299 | char * |
|
|
300 | clean_path (const char *file) |
|
|
301 | { |
|
|
302 | static char newpath[MAX_BUF], *cp; |
|
|
303 | assign (newpath, file); |
|
|
304 | |
169 | |
305 | for (cp = newpath; *cp != '\0'; cp++) |
170 | return false; |
306 | if (*cp == '/') |
|
|
307 | *cp = '_'; |
|
|
308 | |
|
|
309 | return newpath; |
|
|
310 | } |
|
|
311 | |
|
|
312 | /* unclean_path takes a path and replaces all _ with / |
|
|
313 | * This basically undoes clean path. |
|
|
314 | * We do a strcpy so that we do not change the original string. |
|
|
315 | * We are smart enough to start after the last / in case we |
|
|
316 | * are getting passed a string that points to a unique map |
|
|
317 | * path. |
|
|
318 | */ |
|
|
319 | char * |
|
|
320 | unclean_path (const char *src) |
|
|
321 | { |
|
|
322 | static char newpath[MAX_BUF], *cp; |
|
|
323 | |
|
|
324 | cp = strrchr (src, '/'); |
|
|
325 | assign (newpath, cp ? cp + 1 : src); |
|
|
326 | |
|
|
327 | for (cp = newpath; *cp != '\0'; cp++) |
|
|
328 | if (*cp == '_') |
|
|
329 | *cp = '/'; |
|
|
330 | |
|
|
331 | return newpath; |
|
|
332 | } |
171 | } |
333 | |
172 | |
334 | /* process_players1 and process_players2 do all the player related stuff. |
173 | /* process_players1 and process_players2 do all the player related stuff. |
335 | * 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 |
336 | * 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 |
… | |
… | |
339 | * is needed after the players have been updated. |
178 | * is needed after the players have been updated. |
340 | */ |
179 | */ |
341 | static void |
180 | static void |
342 | process_players1 () |
181 | process_players1 () |
343 | { |
182 | { |
344 | int flag; |
|
|
345 | |
|
|
346 | /* Basically, we keep looping until all the players have done their actions. */ |
183 | /* Basically, we keep looping until all the players have done their actions. */ |
347 | for (flag = 1; flag != 0;) |
184 | for (int flag = 1; flag != 0;) |
348 | { |
185 | { |
349 | flag = 0; |
186 | flag = 0; |
350 | for_all_players (pl) |
187 | for_all_players (pl) |
351 | { |
188 | { |
352 | pl->refcnt_chk (); |
189 | pl->refcnt_chk (); |
353 | |
190 | |
354 | if (!pl->ob || !pl->ns) |
191 | if (expect_false (!pl->ob || !pl->ns || !pl->ob->active)) |
355 | continue; |
192 | continue; |
356 | |
193 | |
357 | if (pl->ob->speed_left > 0) |
|
|
358 | if (handle_newcs_player (pl->ob)) |
194 | if (handle_newcs_player (pl->ob)) |
359 | flag = 1; |
195 | flag = 1; |
360 | |
|
|
361 | /* If the player is not actively playing, don't make a |
|
|
362 | * backup save - nothing to save anyway. Plus, the |
|
|
363 | * map may not longer be valid. This can happen when the |
|
|
364 | * player quits - they exist for purposes of tracking on the map, |
|
|
365 | * but don't actually reside on any actual map. |
|
|
366 | */ |
|
|
367 | if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
368 | continue; |
|
|
369 | |
|
|
370 | #ifdef AUTOSAVE |
|
|
371 | /* check for ST_PLAYING state so that we don't try to save off when |
|
|
372 | * the player is logging in. |
|
|
373 | */ |
|
|
374 | if ((pl->last_save_tick + AUTOSAVE) < (uint32) pticks && pl->ns->state == ST_PLAYING) |
|
|
375 | { |
|
|
376 | pl->ob->contr->save (); |
|
|
377 | pl->last_save_tick = pticks; |
|
|
378 | } |
196 | } |
379 | #endif |
197 | } |
380 | } /* end of for loop for all the players */ |
|
|
381 | } /* for flag */ |
|
|
382 | |
198 | |
383 | for_all_players (pl) |
199 | for_all_players (pl) |
384 | { |
200 | { |
385 | if (!pl->ob || !pl->ns) |
201 | object *ob = pl->ob; |
|
|
202 | |
|
|
203 | // process_objects destroys the speed_left value |
|
|
204 | pl->speed_left_save = ob->speed_left; |
|
|
205 | |
|
|
206 | if (expect_false (!ob || !pl->ns || !ob->active)) |
386 | continue; |
207 | continue; |
387 | |
208 | |
388 | if (settings.casting_time) |
|
|
389 | { |
|
|
390 | if (pl->ob->casting_time > 0) |
|
|
391 | { |
|
|
392 | pl->ob->casting_time--; |
|
|
393 | pl->ob->start_holding = 1; |
|
|
394 | } |
|
|
395 | |
|
|
396 | /* set spell_state so we can update the range in stats field */ |
|
|
397 | if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1)) |
|
|
398 | pl->ob->start_holding = 0; |
|
|
399 | } |
|
|
400 | |
|
|
401 | do_some_living (pl->ob); |
209 | do_some_living (ob); |
402 | } |
210 | } |
403 | } |
211 | } |
404 | |
212 | |
405 | static void |
213 | static void |
406 | process_players2 () |
214 | process_players2 () |
407 | { |
215 | { |
408 | /* 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 */ |
409 | for_all_players (pl) |
217 | for_all_players (pl) |
410 | { |
218 | { |
411 | /* The code that did weapon_sp handling here was out of place - |
219 | // restore speed_left value saved by process_players1 |
412 | * this isn't called until after the player has finished there |
|
|
413 | * actions, and is thus out of place. All we do here is bounds |
|
|
414 | * checking. |
|
|
415 | */ |
|
|
416 | if (pl->has_hit) |
|
|
417 | { |
|
|
418 | if (pl->ob->speed_left > pl->weapon_sp) |
|
|
419 | pl->ob->speed_left = pl->weapon_sp; |
|
|
420 | |
|
|
421 | /* This needs to be here - if the player is running, we need to |
|
|
422 | * clear this each tick, but new commands are not being received |
|
|
423 | * so execute_newserver_command() is never called |
|
|
424 | */ |
|
|
425 | pl->has_hit = 0; |
|
|
426 | } |
|
|
427 | else if (pl->ob->speed_left > pl->ob->speed) |
|
|
428 | pl->ob->speed_left = pl->ob->speed; |
220 | pl->ob->speed_left = pl->speed_left_save; |
429 | } |
|
|
430 | } |
|
|
431 | |
221 | |
432 | void |
222 | pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
|
|
223 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
|
|
224 | } |
|
|
225 | } |
|
|
226 | |
|
|
227 | static void |
433 | process_events () |
228 | process_events () |
434 | { |
229 | { |
435 | object *op; |
|
|
436 | |
|
|
437 | static object_ptr marker_; |
|
|
438 | |
|
|
439 | if (!marker_) |
|
|
440 | marker_ = object::create (); |
|
|
441 | |
|
|
442 | object *marker = marker_; |
|
|
443 | |
|
|
444 | process_players1 (); |
230 | process_players1 (); |
445 | |
231 | |
446 | marker->active_next = active_objects; |
232 | for_all_actives (op) |
447 | |
|
|
448 | if (marker->active_next) |
|
|
449 | marker->active_next->active_prev = marker; |
|
|
450 | |
|
|
451 | marker->active_prev = 0; |
|
|
452 | active_objects = marker; |
|
|
453 | |
|
|
454 | while (marker->active_next) |
|
|
455 | { |
233 | { |
456 | op = marker->active_next; |
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]; |
457 | |
241 | |
458 | /* Move marker forward - swap op and marker */ |
242 | prefetch (&next->flag , 0, 1); |
459 | op->active_prev = marker->active_prev; |
243 | prefetch (&next->speed , 0, 1); |
460 | |
244 | prefetch (&next->anim_speed, 0, 1); |
461 | if (op->active_prev) |
245 | prefetch (&next->contr , 0, 1); |
462 | op->active_prev->active_next = op; |
246 | } |
463 | else |
|
|
464 | active_objects = op; |
|
|
465 | |
|
|
466 | marker->active_next = op->active_next; |
|
|
467 | |
|
|
468 | if (marker->active_next) |
|
|
469 | marker->active_next->active_prev = marker; |
|
|
470 | |
|
|
471 | marker->active_prev = op; |
|
|
472 | op->active_next = marker; |
|
|
473 | |
247 | |
474 | /* Now process op */ |
248 | /* Now process op */ |
475 | if (QUERY_FLAG (op, FLAG_FREED)) |
249 | if (expect_false (op->flag [FLAG_FREED])) |
476 | { |
250 | { |
477 | 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 ()); |
478 | op->set_speed (0); |
252 | op->set_speed (0); |
479 | continue; |
253 | continue; |
480 | } |
254 | } |
481 | |
255 | |
482 | /* I've seen occasional crashes due to this - the object is removed, |
256 | if (expect_false (!op->has_active_speed ())) |
483 | * and thus the map it points to (last map it was on) may be bogus |
|
|
484 | * The real bug is to try to find out the cause of this - someone |
|
|
485 | * is probably calling remove_ob without either an insert_ob or |
|
|
486 | * free_object afterwards, leaving an object dangling. But I'd |
|
|
487 | * rather log this and continue on instead of crashing. |
|
|
488 | * Don't remove players - when a player quits, the object is in |
|
|
489 | * sort of a limbo, of removed, but something we want to keep |
|
|
490 | * around. |
|
|
491 | */ |
|
|
492 | if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY) |
|
|
493 | { |
|
|
494 | LOG (llevError, "BUG: process_events(): Removed object on list\n"); |
|
|
495 | char *dump = dump_object (op); |
|
|
496 | LOG (llevError, dump); |
|
|
497 | free (dump); |
|
|
498 | op->destroy (); |
|
|
499 | continue; |
|
|
500 | } |
257 | { |
501 | |
|
|
502 | if (!op->speed) |
|
|
503 | { |
|
|
504 | LOG (llevError, "BUG: process_events(): Object %s has no speed, " |
258 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
505 | "but is on active list\n", &op->arch->name); |
259 | "but is on active list\n", op->debug_desc (), op->speed); |
506 | op->set_speed (0); |
260 | op->set_speed (0); |
507 | continue; |
261 | continue; |
508 | } |
262 | } |
509 | |
263 | |
510 | if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) |
264 | if (expect_false (op->flag [FLAG_REMOVED])) |
511 | { |
265 | { |
512 | LOG (llevError, "BUG: process_events(): Object without map or " |
266 | LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
513 | "inventory is on active list: %s (%d)\n", &op->name, op->count); |
267 | op->debug_desc ()); |
514 | op->set_speed (0); |
268 | op->set_speed (0); |
515 | continue; |
269 | continue; |
516 | } |
270 | } |
517 | |
271 | |
518 | /* Animate the object. Bug or feature that anim_speed |
272 | /* Animate the object. Bug or feature that anim_speed |
519 | * is based on ticks, and not the creatures speed? |
273 | * is based on ticks, and not the creatures speed? |
520 | */ |
274 | */ |
521 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
275 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
522 | { |
276 | { |
523 | if ((op->type == PLAYER)) |
|
|
524 | animate_object (op, op->facing); |
|
|
525 | else |
|
|
526 | animate_object (op, op->direction); |
277 | animate_object (op, op->contr ? op->facing : op->direction); |
527 | |
|
|
528 | op->last_anim = 1; |
278 | op->last_anim = 1; |
529 | } |
279 | } |
530 | else |
280 | else |
531 | op->last_anim++; |
281 | ++op->last_anim; |
532 | |
282 | |
533 | if (op->speed_left > 0) |
283 | if (expect_false (op->speed_left > 0.f)) |
534 | { |
|
|
535 | #if 0 |
|
|
536 | /* I've seen occasional crashes in move_symptom() with it |
|
|
537 | * crashing because op is removed - add some debugging to |
|
|
538 | * track if it is removed at this point. |
|
|
539 | * This unfortunately is a bit too verbose it seems - not sure |
|
|
540 | * why - I think what happens is a map is freed or something and |
|
|
541 | * some objects get 'lost' - removed never to be reclaimed. |
|
|
542 | * removed objects generally shouldn't exist. |
|
|
543 | */ |
|
|
544 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
545 | { |
284 | { |
546 | LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null"); |
|
|
547 | } |
|
|
548 | #endif |
|
|
549 | --op->speed_left; |
285 | --op->speed_left; |
550 | process_object (op); |
286 | process_object (op); |
551 | |
|
|
552 | if (op->destroyed ()) |
|
|
553 | continue; |
|
|
554 | } |
287 | } |
555 | |
288 | |
556 | if (settings.casting_time == TRUE && op->casting_time > 0) |
289 | // this will destroy the speed_left value for players, but |
557 | op->casting_time--; |
290 | // process_players1 and ..2 save/restore the real value, |
558 | |
291 | // so we can avoid a costly test here. |
559 | if (op->speed_left <= 0) |
292 | op->speed_left = min (op->speed, op->speed_left + op->speed); |
560 | op->speed_left += FABS (op->speed); |
|
|
561 | } |
293 | } |
562 | |
|
|
563 | /* Remove marker object from active list */ |
|
|
564 | if (marker->active_prev != NULL) |
|
|
565 | marker->active_prev->active_next = NULL; |
|
|
566 | else |
|
|
567 | active_objects = NULL; |
|
|
568 | |
294 | |
569 | process_players2 (); |
295 | process_players2 (); |
570 | } |
296 | } |
571 | |
297 | |
572 | /* clean up everything before exiting */ |
298 | /* clean up everything before exiting */ |
573 | void |
299 | void |
574 | emergency_save () |
300 | emergency_save () |
575 | { |
301 | { |
576 | LOG (llevDebug, "emergency save begin.\n"); |
302 | LOG (llevInfo, "emergency_save: enter\n"); |
577 | |
303 | |
578 | LOG (llevDebug, "saving players.\n"); |
304 | LOG (llevInfo, "emergency_save: saving book archive\n"); |
579 | for_all_players (pl) |
|
|
580 | pl->save (1); |
|
|
581 | |
|
|
582 | // for_all_players (pl) |
|
|
583 | // if (pl->ob) |
|
|
584 | // pl->ob->remove (); |
|
|
585 | |
|
|
586 | LOG (llevDebug, "saving maps.\n"); |
|
|
587 | maptile::emergency_save (); |
|
|
588 | |
|
|
589 | LOG (llevDebug, "saving book archive.\n"); |
|
|
590 | write_book_archive (); |
305 | write_book_archive (); |
591 | |
306 | |
|
|
307 | cfperl_emergency_save (); |
|
|
308 | |
592 | LOG (llevDebug, "emergency save done.\n"); |
309 | LOG (llevInfo, "emergency_save: leave\n"); |
|
|
310 | } |
|
|
311 | |
|
|
312 | // send all clients some informational text |
|
|
313 | static void |
|
|
314 | cleanup_inform (const char *cause, bool make_core) |
|
|
315 | { |
|
|
316 | int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
|
|
317 | |
|
|
318 | new_draw_info_format (flags, 0, 0, "The server will now shutdown."); |
|
|
319 | new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause); |
|
|
320 | |
|
|
321 | if (make_core) |
|
|
322 | new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved."); |
|
|
323 | else |
|
|
324 | new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now."); |
|
|
325 | |
|
|
326 | new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE); |
|
|
327 | |
|
|
328 | client::flush_sockets (); |
593 | } |
329 | } |
594 | |
330 | |
595 | /* clean up everything before exiting */ |
331 | /* clean up everything before exiting */ |
596 | void |
332 | void |
597 | cleanup (bool make_core) |
333 | cleanup (const char *cause, bool make_core) |
598 | { |
334 | { |
|
|
335 | if (make_core) |
|
|
336 | fork_abort (cause); |
|
|
337 | |
|
|
338 | LOG (make_core ? llevError : llevInfo, "cleanup cause: %s\n", cause); |
|
|
339 | |
|
|
340 | if (!make_core) |
|
|
341 | cleanup_inform (cause, make_core); |
|
|
342 | |
599 | LOG (llevDebug, "cleanup begin.\n"); |
343 | LOG (llevDebug, "cleanup begin.\n"); |
600 | |
344 | |
|
|
345 | if (init_done && !in_cleanup) |
|
|
346 | { |
601 | in_cleanup = true; |
347 | in_cleanup = true; |
602 | |
|
|
603 | if (init_done) |
|
|
604 | emergency_save (); |
348 | emergency_save (); |
|
|
349 | } |
|
|
350 | else |
|
|
351 | in_cleanup = true; |
605 | |
352 | |
606 | LOG (llevDebug, "running cleanup handlers.\n"); |
353 | LOG (llevDebug, "running cleanup handlers.\n"); |
607 | INVOKE_GLOBAL (CLEANUP); |
354 | INVOKE_GLOBAL (CLEANUP); |
608 | |
355 | |
609 | LOG (llevDebug, "cleanup done.\n"); |
356 | LOG (llevDebug, "cleanup done.\n"); |
610 | |
357 | |
|
|
358 | log_cleanup (); |
|
|
359 | |
611 | if (make_core) |
360 | if (make_core) |
612 | abort (); |
361 | cleanup_inform (cause, make_core); |
613 | else |
362 | else |
614 | _exit (0); |
|
|
615 | } |
|
|
616 | |
|
|
617 | void |
|
|
618 | leave (player *pl, int draw_exit) |
|
|
619 | { |
|
|
620 | if (pl) |
|
|
621 | { |
|
|
622 | if (pl->ob->type != DEAD_OBJECT) |
|
|
623 | { |
|
|
624 | /* If a hidden dm dropped connection do not create |
|
|
625 | * inconsistencies by showing that they have left the game |
|
|
626 | */ |
|
|
627 | if (!(QUERY_FLAG (pl->ob, FLAG_WIZ) && pl->ob->contr->hidden) |
|
|
628 | && draw_exit) |
|
|
629 | { |
|
|
630 | if (pl->ob->map) |
|
|
631 | { |
|
|
632 | INVOKE_PLAYER (LOGOUT, pl); |
|
|
633 | LOG (llevInfo, "LOGOUT: Player named %s from ip %s\n", &pl->ob->name, pl->ns->host); |
|
|
634 | } |
|
|
635 | |
|
|
636 | char buf[MAX_BUF]; |
|
|
637 | |
|
|
638 | sprintf (buf, "%s left the game.", &pl->ob->name); |
|
|
639 | new_draw_info (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, 0, buf); |
|
|
640 | } |
|
|
641 | |
|
|
642 | pl->ob->remove (); |
|
|
643 | pl->ob->type = DEAD_OBJECT; /* To avoid problems with inventory window */ |
|
|
644 | } |
|
|
645 | |
|
|
646 | /* We do this so that the socket handling routine can do the final |
|
|
647 | * cleanup. We also leave that loop to actually handle the freeing |
|
|
648 | * of the data. |
|
|
649 | */ |
|
|
650 | if (pl->ns) |
|
|
651 | pl->ns->destroy (); |
|
|
652 | |
|
|
653 | } |
363 | { |
654 | } |
364 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting."); |
655 | |
365 | new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE); |
656 | int |
366 | client::flush_sockets (); |
657 | forbid_play (void) |
|
|
658 | { |
|
|
659 | #if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE) |
|
|
660 | char buf[MAX_BUF], day[MAX_BUF]; |
|
|
661 | FILE *fp; |
|
|
662 | time_t clock; |
|
|
663 | struct tm *tm; |
|
|
664 | int i, start, stop, forbit = 0, comp; |
|
|
665 | |
|
|
666 | clock = time (NULL); |
|
|
667 | tm = (struct tm *) localtime (&clock); |
|
|
668 | |
|
|
669 | sprintf (buf, "%s/%s", settings.confdir, PERM_FILE); |
|
|
670 | if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
|
|
671 | return 0; |
|
|
672 | |
|
|
673 | while (fgets (buf, MAX_BUF, fp)) |
|
|
674 | { |
367 | } |
675 | if (buf[0] == '#') |
|
|
676 | continue; |
|
|
677 | if (!strncmp (buf, "msg", 3)) |
|
|
678 | { |
|
|
679 | if (forbit) |
|
|
680 | while (fgets (buf, MAX_BUF, fp)) /* print message */ |
|
|
681 | fputs (buf, logfile); |
|
|
682 | break; |
|
|
683 | |
368 | |
684 | } |
369 | cfperl_cleanup (make_core); |
685 | else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
370 | _exit (make_core); |
686 | { |
|
|
687 | LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
|
|
688 | continue; |
|
|
689 | } |
|
|
690 | |
|
|
691 | for (i = 0; i < 7; i++) |
|
|
692 | { |
|
|
693 | if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop)) |
|
|
694 | forbit = 1; |
|
|
695 | } |
|
|
696 | } |
|
|
697 | |
|
|
698 | close_and_delete (fp, comp); |
|
|
699 | |
|
|
700 | return forbit; |
|
|
701 | #else |
|
|
702 | return 0; |
|
|
703 | #endif |
|
|
704 | } |
371 | } |
705 | |
372 | |
706 | /* |
373 | /* |
707 | * 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. |
708 | * 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 |
709 | * 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. |
710 | * 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 |
711 | * 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 |
712 | * 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 |
713 | * 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 |
714 | * done on the same tick, but that will happen very infrequently |
381 | * done on the same tick, but that will happen very infrequently |
715 | * |
382 | * |
716 | * 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 |
717 | * doing the various things. |
384 | * doing the various things. |
718 | */ |
385 | */ |
|
|
386 | static void |
|
|
387 | do_specials () |
|
|
388 | { |
|
|
389 | shstr::gc (); |
|
|
390 | archetype::gc (); |
719 | |
391 | |
720 | extern unsigned long todtick; |
392 | if (expect_false (!(server_tick % TICKS_PER_HOUR))) |
|
|
393 | maptile::adjust_daylight (); |
|
|
394 | |
|
|
395 | if (expect_false (!(server_tick % 2503))) |
|
|
396 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
|
|
397 | |
|
|
398 | if (expect_false (!(server_tick % 5003))) |
|
|
399 | write_book_archive (); |
|
|
400 | |
|
|
401 | if (expect_false (!(server_tick % 5009))) |
|
|
402 | clean_friendly_list (); |
|
|
403 | |
|
|
404 | if (expect_false (!(server_tick % 5011))) |
|
|
405 | obsolete_parties (); |
|
|
406 | |
|
|
407 | if (expect_false (!(server_tick % 12503))) |
|
|
408 | fix_luck (); |
|
|
409 | } |
721 | |
410 | |
722 | void |
411 | void |
723 | do_specials (void) |
412 | one_tick () |
724 | { |
|
|
725 | if (!(pticks % PTICKS_PER_CLOCK)) |
|
|
726 | tick_the_clock (); |
|
|
727 | |
|
|
728 | if (!(pticks % 7)) |
|
|
729 | shstr::gc (); |
|
|
730 | |
|
|
731 | if (!(pticks % 2503)) |
|
|
732 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
|
|
733 | |
|
|
734 | if (!(pticks % 5003)) |
|
|
735 | write_book_archive (); |
|
|
736 | |
|
|
737 | if (!(pticks % 5009)) |
|
|
738 | clean_friendly_list (); |
|
|
739 | |
|
|
740 | if (!(pticks % 5011)) |
|
|
741 | obsolete_parties (); |
|
|
742 | |
|
|
743 | if (!(pticks % 12503)) |
|
|
744 | fix_luck (); |
|
|
745 | } |
|
|
746 | |
|
|
747 | void |
|
|
748 | server_tick () |
|
|
749 | { |
413 | { |
750 | // first do the user visible stuff |
414 | // first do the user visible stuff |
751 | doeric_server (); |
|
|
752 | INVOKE_GLOBAL (CLOCK); |
415 | INVOKE_GLOBAL (CLOCK); |
753 | process_events (); /* "do" something with objects with speed */ |
416 | process_events (); // "do" something with objects with speed |
754 | flush_sockets (); |
417 | client::clock (); // draw client maps etc. |
755 | |
418 | |
756 | // then do some bookkeeping, should not really be here |
419 | // then do some bookkeeping, should not really be here |
757 | do_specials (); /* Routines called from time to time. */ |
420 | do_specials (); /* Routines called from time to time. */ |
758 | attachable::check_mortals (); |
421 | attachable::check_mortals (); |
759 | |
422 | |
760 | ++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"); |
761 | } |
426 | } |
762 | |
427 | |
|
|
428 | // normal main |
763 | int |
429 | int |
764 | main (int argc, char **argv) |
430 | main (int argc, char **argv) |
765 | { |
431 | { |
766 | settings.argc = argc; |
432 | settings.argc = argc; |
767 | settings.argv = argv; |
433 | settings.argv = argv; |
768 | |
434 | |
|
|
435 | rndm.seed (time (0)); |
|
|
436 | g_thread_init (0); // for the slice allocator only |
|
|
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 | |
769 | init (argc, argv); |
461 | init (argc, argv); |
770 | |
|
|
771 | initPlugins (); |
|
|
772 | |
462 | |
773 | for (;;) |
463 | for (;;) |
774 | cfperl_main (); |
464 | cfperl_main (); |
775 | |
|
|
776 | // unreached |
|
|
777 | cleanup (); |
|
|
778 | |
|
|
779 | return 0; |
|
|
780 | } |
465 | } |
|
|
466 | |