ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/server/main.C
(Generate patch)

Comparing deliantra/server/server/main.C (file contents):
Revision 1.111 by root, Sun Jun 24 04:09:29 2007 UTC vs.
Revision 1.156 by root, Wed Apr 21 07:10:01 2010 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 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 * Crossfire TRT is free software; you can redistribute it and/or modify it 8 * Deliantra is free software: you can redistribute it and/or modify it under
9 * under the terms of the GNU General Public License as published by the Free 9 * the terms of the Affero GNU General Public License as published by the
10 * Software Foundation; either version 2 of the License, or (at your option) 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * any later version. 11 * option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, but 13 * This program is distributed in the hope that it will be useful,
14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * 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 along 18 * You should have received a copy of the Affero GNU General Public License
19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 19 * and the GNU General Public License along with this program. If not, see
20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail to <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 <glib.h>
33
32#include <../random_maps/random_map.h> 34#include <../random_maps/random_map.h>
33#include <../random_maps/rproto.h> 35#include <../random_maps/rproto.h>
34#include "path.h" 36#include "path.h"
35 37
36static char days[7][4] = {
37 "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
38};
39
40void 38void
41version (object *op) 39version (object *op)
42{ 40{
43 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);
44
45 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:");
46 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>");
47 new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>");
48 new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>");
49 new_draw_info (NDI_UNIQUE, 0, op, "");
50 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:");
51 new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>");
52 new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>");
53 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>");
54 new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>");
55 new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>");
56 new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>");
57 new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>");
58 new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>");
59 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>");
60 new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>");
61 new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>");
62 new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>");
63 new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>");
64 new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>");
65 new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>");
66 new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>");
67 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>");
68 new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>");
69 new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>");
70 new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>");
71 new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>");
72 new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>");
73 new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>");
74 new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>");
75 new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>");
76 new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>");
77 new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>");
78 new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>");
79 new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>");
80 new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>");
81 new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>");
82 new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>");
83 new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>");
84 new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>");
85 new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>");
86 new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>");
87 new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>");
88 new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>");
89 new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>");
90 new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n");
91 new_draw_info (NDI_UNIQUE, 0, op, "");
92 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:");
93 new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner");
94 new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>");
95 new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>");
96 new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>");
97 new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>");
98 new_draw_info (NDI_UNIQUE, 0, op, "");
99 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
100} 42}
101 43
102/* 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
103 * savebed. We do some error checking - its possible that the 45 * savebed. We do some error checking - its possible that the
104 * savebed map may no longer exist, so we make sure the player 46 * savebed map may no longer exist, so we make sure the player
105 * goes someplace. 47 * goes someplace.
106 */ 48 */
107void 49void
108enter_player_savebed (object *op) 50enter_player_savebed (object *op)
109{ 51{
110 object *tmp = object::create (); 52 op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y);
111 EXIT_PATH (tmp) = op->contr->savebed_map;
112 EXIT_X (tmp) = op->contr->bed_x;
113 EXIT_Y (tmp) = op->contr->bed_y;
114 op->enter_exit (tmp);
115 tmp->destroy ();
116} 53}
117 54
118/* 55/*
119 * enter_map(): Moves the player and pets from current map (if any) to 56 * enter_map(): Moves the player and pets from current map (if any) to
120 * new map. map, x, y must be set. map is the map we are moving the 57 * new map. map, x, y must be set. map is the map we are moving the
… …
123 * the function that calls this should figure them out. 60 * the function that calls this should figure them out.
124 */ 61 */
125void 62void
126object::enter_map (maptile *newmap, int x, int y) 63object::enter_map (maptile *newmap, int x, int y)
127{ 64{
128 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) 65 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE)
129 return; 66 return;
130 67
131 if (out_of_map (newmap, x, y)) 68 if (out_of_map (newmap, x, y))
132 { 69 {
133 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); 70 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
… …
144 81
145 if (contr && map != newmap && map) 82 if (contr && map != newmap && map)
146 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) 83 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
147 return; 84 return;
148 85
149 // remove, so stupid ob_locked does not trigger a failure 86 // remove, so stupid blocked does not trigger a failure
150 remove (); 87 remove ();
151 88
152 /* try to find a spot for the player */ 89 /* try to find a spot for the player */
153 if (ob_blocked (this, newmap, x, y)) 90 if (blocked (newmap, x, y))
154 { /* First choice blocked */ 91 { /* First choice blocked */
155 /* We try to find a spot for the player, starting closest in. 92 /* We try to find a spot for the player, starting closest in.
156 * We could use find_first_free_spot, but that doesn't randomize it at all, 93 * We could use find_first_free_spot, but that doesn't randomize it at all,
157 * So for example, if the north space is free, you would always end up there even 94 * So for example, if the north space is free, you would always end up there even
158 * if other spaces around are available. 95 * if other spaces around are available.
159 * Note that for the second and third calls, we could start at a position other 96 * Note that for the second and third calls, we could start at a position other
160 * than one, but then we could end up on the other side of walls and so forth. 97 * than one, but then we could end up on the other side of walls and so forth.
161 */ 98 */
162 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); 99 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1);
163 100
164 if (i == -1) 101 if (i < 0)
165 { 102 {
166 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); 103 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
167 if (i == -1) 104 if (i < 0)
168 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); 105 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
169 } 106 }
170 107
171 if (i != -1) 108 if (i >= 0)
172 { 109 {
173 x += freearr_x[i]; 110 x += freearr_x[i];
174 y += freearr_y[i]; 111 y += freearr_y[i];
175 } 112 }
176 else 113 else
… …
185 122
186 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) 123 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
187 return; 124 return;
188 } 125 }
189 126
190 this->x = x;
191 this->y = y;
192 map = newmap;
193
194 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
195
196 enemy = 0; 127 enemy = 0;
197 128
129 newmap->insert (this, x, y, 0, INS_NO_WALK_ON);
130
131 if (map == newmap)
132 {
198 if (contr) 133 if (contr)
199 { 134 {
200 contr->maplevel = newmap->path; 135 contr->maplevel = newmap->path;
201 contr->count = 0; 136 contr->count = 0;
202 }
203 137
204 /* Update any golems */ 138 /* Update any golems */
205 if (type == PLAYER)
206 if (object *golem = contr->golem) 139 if (object *golem = contr->golem)
207 { 140 {
208 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); 141 int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
209 142
210 if (i < 0) 143 if (i < 0)
211 golem->destroy (); 144 golem->drop_and_destroy ();
212 else 145 else
213 { 146 {
214 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); 147 newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
215 golem->direction = find_dir_2 (x - golem->x, y - golem->y); 148 golem->direction = find_dir_2 (golem->x - x, golem->y - y);
149 }
216 } 150 }
217 } 151 }
218 152
219 /* since the players map is already loaded, we don't need to worry 153 /* since the players map is already loaded, we don't need to worry
220 * about pending objects. 154 * about pending objects.
221 */ 155 */
222 remove_all_pets (newmap); 156 move_all_pets ();
157 }
223} 158}
224 159
225/* process_players1 and process_players2 do all the player related stuff. 160/* process_players1 and process_players2 do all the player related stuff.
226 * I moved it out of process events and process_map. This was to some 161 * I moved it out of process events and process_map. This was to some
227 * extent for debugging as well as to get a better idea of the time used 162 * extent for debugging as well as to get a better idea of the time used
… …
250 185
251 for_all_players (pl) 186 for_all_players (pl)
252 { 187 {
253 object *ob = pl->ob; 188 object *ob = pl->ob;
254 189
190 // process_objects destroys the speed_left value
191 pl->speed_left_save = ob->speed_left;
192
255 if (expect_false (!ob || !pl->ns || !ob->active)) 193 if (expect_false (!ob || !pl->ns || !ob->active))
256 continue; 194 continue;
257 195
258 do_some_living (ob); 196 do_some_living (ob);
259 } 197 }
… …
263process_players2 () 201process_players2 ()
264{ 202{
265 /* Then check if any players should use weapon-speed instead of speed */ 203 /* Then check if any players should use weapon-speed instead of speed */
266 for_all_players (pl) 204 for_all_players (pl)
267 { 205 {
206 // restore speed_left value saved by process_players1
207 pl->ob->speed_left = pl->speed_left_save;
208
268 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); 209 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
269 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); 210 pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
270 } 211 }
271} 212}
272 213
273void 214static void
274process_events () 215process_events ()
275{ 216{
276 process_players1 (); 217 process_players1 ();
277 218
278 for_all_actives (op) 219 for_all_actives (op)
279 { 220 {
221 // try to prefetch some stuff we expect to need
222 // obviously, it should be grouped into the same cacheline.
223 // preliminary results indicate that this gives halves the speed
224 // used for the inner loop
225 if (_i < actives.size ()) // HACK, rely on _i :/
226 {
227 object *next = actives [_i + 1];
228
229 prefetch (&next->flag , 0, 1);
230 prefetch (&next->speed , 0, 1);
231 prefetch (&next->anim_speed, 0, 1);
232 prefetch (&next->contr , 0, 1);
233 }
234
280 /* Now process op */ 235 /* Now process op */
281 if (expect_false (QUERY_FLAG (op, FLAG_FREED))) 236 if (expect_false (op->flag [FLAG_FREED]))
282 { 237 {
283 LOG (llevError, "BUG: process_events(): Free object on list\n"); 238 LOG (llevError, "BUG: process_events(): Free object on list\n");
284 op->set_speed (0); 239 op->set_speed (0);
285 continue; 240 continue;
286 } 241 }
… …
310 op->last_anim = 1; 265 op->last_anim = 1;
311 } 266 }
312 else 267 else
313 ++op->last_anim; 268 ++op->last_anim;
314 269
315 if (op->speed_left > 0.f) 270 if (expect_false (op->speed_left > 0.f))
316 { 271 {
317 --op->speed_left; 272 --op->speed_left;
318 process_object (op); 273 process_object (op);
319
320 if (op->destroyed ())
321 continue;
322 } 274 }
323 275
324 if (!op->contr) 276 // this will destroy the speed_left value for players, but
277 // process_players1 and ..2 save/restore the real value,
278 // so we can avoid a costly test here.
325 op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); 279 op->speed_left = min (op->speed, op->speed_left + op->speed);
326 } 280 }
327 281
328 process_players2 (); 282 process_players2 ();
329} 283}
330 284
… …
344 298
345// send all clients some informational text 299// send all clients some informational text
346static void 300static void
347cleanup_inform (const char *cause, bool make_core) 301cleanup_inform (const char *cause, bool make_core)
348{ 302{
349 int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); 303 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
350 304
351 new_draw_info_format (flags, 0, 0, "The server will now shutdown."); 305 new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
352 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause); 306 new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
353 307
354 if (make_core) 308 if (make_core)
… …
356 else 310 else
357 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now."); 311 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.");
358 312
359 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE); 313 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
360 314
361 flush_sockets (); 315 client::flush_sockets ();
362} 316}
363 317
364/* clean up everything before exiting */ 318/* clean up everything before exiting */
365void 319void
366cleanup (const char *cause, bool make_core) 320cleanup (const char *cause, bool make_core)
… …
386 LOG (llevDebug, "running cleanup handlers.\n"); 340 LOG (llevDebug, "running cleanup handlers.\n");
387 INVOKE_GLOBAL (CLEANUP); 341 INVOKE_GLOBAL (CLEANUP);
388 342
389 LOG (llevDebug, "cleanup done.\n"); 343 LOG (llevDebug, "cleanup done.\n");
390 344
345 log_cleanup ();
346
391 if (make_core) 347 if (make_core)
392 {
393 cleanup_inform (cause, make_core); 348 cleanup_inform (cause, make_core);
394 cfperl_cleanup (make_core);
395 _exit (1);
396 }
397 else 349 else
398 { 350 {
399 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting."); 351 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
400 new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE); 352 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
401 flush_sockets (); 353 client::flush_sockets ();
354 }
355
402 cfperl_cleanup (make_core); 356 cfperl_cleanup (make_core);
403 _exit (0); 357 _exit (make_core);
404 }
405}
406
407int
408forbid_play (void)
409{
410#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE)
411 char buf[MAX_BUF], day[MAX_BUF];
412 FILE *fp;
413 time_t clock;
414 struct tm *tm;
415 int i, start, stop, forbit = 0, comp;
416
417 clock = time (NULL);
418 tm = (struct tm *) localtime (&clock);
419
420 sprintf (buf, "%s/%s", settings.confdir, PERM_FILE);
421 if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL)
422 return 0;
423
424 while (fgets (buf, MAX_BUF, fp))
425 {
426 if (buf[0] == '#')
427 continue;
428
429 if (!strncmp (buf, "msg", 3))
430 {
431 if (forbit)
432 while (fgets (buf, MAX_BUF, fp)) /* print message */
433 fputs (buf, logfile);
434 break;
435 }
436 else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3)
437 {
438 LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n");
439 continue;
440 }
441
442 for (i = 0; i < 7; i++)
443 {
444 if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop))
445 forbit = 1;
446 }
447 }
448
449 close_and_delete (fp, comp);
450
451 return forbit;
452#else
453 return 0;
454#endif
455} 358}
456 359
457/* 360/*
458 * do_specials() is a collection of functions to call from time to time. 361 * do_specials() is a collection of functions to call from time to time.
459 * Modified 2000-1-14 MSW to use the global pticks count to determine how 362 * Modified 2000-1-14 MSW to use the global pticks count to determine how
… …
465 * done on the same tick, but that will happen very infrequently 368 * done on the same tick, but that will happen very infrequently
466 * 369 *
467 * I also think this code makes it easier to see how often we really are 370 * I also think this code makes it easier to see how often we really are
468 * doing the various things. 371 * doing the various things.
469 */ 372 */
470void 373static void
471do_specials (void) 374do_specials ()
472{ 375{
376 shstr::gc ();
377 archetype::gc ();
378
473 if (expect_false (!(pticks % TICKS_PER_HOUR))) 379 if (expect_false (!(pticks % TICKS_PER_HOUR)))
474 adjust_daylight (); 380 maptile::adjust_daylight ();
475
476 if (expect_false (!(pticks % 7)))
477 shstr::gc ();
478 381
479 if (expect_false (!(pticks % 2503))) 382 if (expect_false (!(pticks % 2503)))
480 fix_weight (); /* Hack to fix weightproblems caused by bugs */ 383 fix_weight (); /* Hack to fix weightproblems caused by bugs */
481 384
482 if (expect_false (!(pticks % 5003))) 385 if (expect_false (!(pticks % 5003)))
… …
494 397
495void 398void
496server_tick () 399server_tick ()
497{ 400{
498 // first do the user visible stuff 401 // first do the user visible stuff
499 doeric_server ();
500 INVOKE_GLOBAL (CLOCK); 402 INVOKE_GLOBAL (CLOCK);
501 process_events (); /* "do" something with objects with speed */ 403 process_events (); // "do" something with objects with speed
502 flush_sockets (); 404 client::clock (); // draw client maps etc.
503 405
504 // then do some bookkeeping, should not really be here 406 // then do some bookkeeping, should not really be here
505 do_specials (); /* Routines called from time to time. */ 407 do_specials (); /* Routines called from time to time. */
506 attachable::check_mortals (); 408 attachable::check_mortals ();
507 409
508 ++pticks; 410 ++pticks;
509}
510 411
511#if 0 412 if (object::object_count >= RESTART_COUNT)
512// used fro benchmarking (x86/amd64-specific) 413 cleanup ("running out of protocol ID values - need full restart");
513typedef unsigned long tval;
514typedef unsigned long long stamp64;
515
516extern inline tval
517stamp (void)
518{
519 tval tsc;
520 asm volatile ("rdtsc":"=a" (tsc)::"edx");
521
522 return tsc;
523} 414}
524
525extern inline tval
526measure (tval t)
527{
528 tval tsc;
529 asm volatile ("rdtsc":"=a" (tsc)::"edx");
530
531 if (tsc > t)
532 return tsc - t;
533 else
534 return t - tsc;
535}
536
537int
538main (int argc, char **argv)
539{
540 rand_gen rg(0);
541 tval fastest = 0x7fffffff;
542 for (int loop = 10000; loop--; )
543 {
544 tval s = stamp ();
545 volatile int i = rg.get_int(25);
546 fastest = min (fastest, measure (s));
547 }
548
549 //printf ("fastest %d\n", fastest);
550 for (int i = 0; i < 1024*1024*3; ++i)
551 {
552 char c = rg.get_int (256);
553 write (2, &c, 1);
554 }
555}
556
557#else
558 415
559// normal main 416// normal main
560int 417int
561main (int argc, char **argv) 418main (int argc, char **argv)
562{ 419{
563 settings.argc = argc; 420 settings.argc = argc;
564 settings.argv = argv; 421 settings.argv = argv;
422
423 rndm.seed (time (0));
424 g_thread_init (0); // for the slice allocator only
565 425
566 init (argc, argv); 426 init (argc, argv);
567
568 initPlugins ();
569 427
570 for (;;) 428 for (;;)
571 cfperl_main (); 429 cfperl_main ();
572} 430}
573#endif
574 431

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines