ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/server/main.C
Revision: 1.126
Committed: Sun Apr 20 06:20:38 2008 UTC (16 years, 1 month ago) by root
Content type: text/plain
Branch: MAIN
CVS Tags: rel-2_52
Changes since 1.125: +4 -0 lines
Log Message: 
*** empty log message ***

File Contents

# User Rev Content
1 elmex 1.1 /*
2 root 1.120 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 root 1.108 *
4 root 1.120 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 root 1.108 * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team
6     * Copyright (©) 1992,2007 Frank Tore Johansen
7     *
8 root 1.120 * Deliantra is free software: you can redistribute it and/or modify
9 root 1.112 * it under the terms of the GNU General Public License as published by
10     * the Free Software Foundation, either version 3 of the License, or
11     * (at your option) any later version.
12 root 1.108 *
13 root 1.112 * This program is distributed in the hope that it will be useful,
14     * but WITHOUT ANY WARRANTY; without even the implied warranty of
15     * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16     * GNU General Public License for more details.
17 root 1.108 *
18 root 1.112 * You should have received a copy of the GNU General Public License
19     * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 root 1.108 *
21 root 1.120 * The authors can be reached via e-mail to <support@deliantra.net>
22 root 1.84 */
23 elmex 1.1
24     #include <global.h>
25     #include <object.h>
26     #include <tod.h>
27    
28 root 1.47 #include <sproto.h>
29     #include <time.h>
30 elmex 1.1
31 root 1.126 #include <glib.h>
32    
33 elmex 1.1 #include <../random_maps/random_map.h>
34     #include <../random_maps/rproto.h>
35     #include "path.h"
36    
37     static char days[7][4] = {
38 root 1.20 "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
39     };
40 elmex 1.1
41 root 1.20 void
42 root 1.23 version (object *op)
43 root 1.20 {
44 root 1.121 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION);
45 root 1.63
46 root 1.121 #if 0
47 root 1.20 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:");
48 root 1.63 new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>");
49     new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>");
50     new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>");
51 root 1.84 new_draw_info (NDI_UNIQUE, 0, op, "");
52     new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:");
53 root 1.63 new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>");
54     new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>");
55     new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>");
56     new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>");
57     new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>");
58     new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>");
59     new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>");
60     new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>");
61 root 1.71 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>");
62 root 1.63 new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>");
63     new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>");
64     new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>");
65     new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>");
66     new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>");
67     new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>");
68     new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>");
69     new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>");
70     new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>");
71     new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>");
72     new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>");
73     new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>");
74     new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>");
75     new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>");
76     new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>");
77     new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>");
78     new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>");
79     new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>");
80     new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>");
81     new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>");
82     new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>");
83     new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>");
84     new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>");
85     new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>");
86     new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>");
87     new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>");
88     new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>");
89     new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>");
90     new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>");
91     new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>");
92     new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n");
93 root 1.84 new_draw_info (NDI_UNIQUE, 0, op, "");
94 root 1.20 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:");
95     new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner");
96 root 1.63 new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>");
97     new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>");
98     new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>");
99     new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>");
100 root 1.84 new_draw_info (NDI_UNIQUE, 0, op, "");
101 root 1.20 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
102 root 1.121 #endif
103 root 1.20 }
104    
105 elmex 1.1 /* This is a basic little function to put the player back to his
106     * savebed. We do some error checking - its possible that the
107     * savebed map may no longer exist, so we make sure the player
108     * goes someplace.
109     */
110 root 1.20 void
111 root 1.23 enter_player_savebed (object *op)
112 elmex 1.1 {
113 root 1.63 object *tmp = object::create ();
114 root 1.20 EXIT_PATH (tmp) = op->contr->savebed_map;
115     EXIT_X (tmp) = op->contr->bed_x;
116     EXIT_Y (tmp) = op->contr->bed_y;
117 root 1.62 op->enter_exit (tmp);
118 root 1.41 tmp->destroy ();
119 elmex 1.1 }
120    
121     /*
122 root 1.62 * enter_map(): Moves the player and pets from current map (if any) to
123 elmex 1.1 * 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
125     * whatever reason. If default map coordinates are to be used, then
126     * the function that calls this should figure them out.
127     */
128 root 1.62 void
129     object::enter_map (maptile *newmap, int x, int y)
130 root 1.20 {
131 root 1.124 if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE)
132 root 1.69 return;
133    
134 root 1.20 if (out_of_map (newmap, x, y))
135     {
136 root 1.62 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
137 root 1.58 x = newmap->enter_x;
138     y = newmap->enter_y;
139 root 1.20 if (out_of_map (newmap, x, y))
140     {
141     LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n",
142 root 1.62 &newmap->path, x, y, newmap->width, newmap->height);
143     new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
144 root 1.20 return;
145     }
146     }
147 root 1.31
148 root 1.78 if (contr && map != newmap && map)
149 root 1.65 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
150     return;
151    
152 root 1.82 // remove, so stupid ob_locked does not trigger a failure
153 root 1.65 remove ();
154    
155 root 1.20 /* try to find a spot for the player */
156 root 1.117 if (blocked (newmap, x, y))
157 root 1.20 { /* First choice blocked */
158     /* 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,
160     * So for example, if the north space is free, you would always end up there even
161     * if other spaces around are available.
162     * 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.
164     */
165 root 1.62 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1);
166 root 1.23
167 root 1.20 if (i == -1)
168     {
169 root 1.62 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
170 root 1.20 if (i == -1)
171 root 1.62 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
172 root 1.20 }
173 root 1.31
174 root 1.20 if (i != -1)
175     {
176     x += freearr_x[i];
177     y += freearr_y[i];
178     }
179     else
180 root 1.62 /* 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);
182     }
183 elmex 1.1
184 root 1.78 if (contr && map != newmap)
185 root 1.69 {
186     if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y)))
187     return;
188 root 1.31
189 root 1.69 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
190     return;
191     }
192 root 1.20
193 root 1.62 this->x = x;
194     this->y = y;
195     map = newmap;
196 root 1.20
197 root 1.62 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
198 root 1.20
199 root 1.82 enemy = 0;
200 root 1.20
201 root 1.62 if (contr)
202 root 1.20 {
203 root 1.70 contr->maplevel = newmap->path;
204 root 1.62 contr->count = 0;
205 root 1.20 }
206    
207     /* Update any golems */
208 root 1.99 if (type == PLAYER)
209 root 1.100 if (object *golem = contr->golem)
210 root 1.99 {
211     int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
212    
213     if (i < 0)
214     golem->destroy ();
215     else
216     {
217     newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
218     golem->direction = find_dir_2 (x - golem->x, y - golem->y);
219     }
220     }
221 root 1.31
222 root 1.20 /* since the players map is already loaded, we don't need to worry
223     * about pending objects.
224     */
225     remove_all_pets (newmap);
226 elmex 1.1 }
227    
228     /* process_players1 and process_players2 do all the player related stuff.
229     * I moved it out of process events and process_map. This was to some
230     * extent for debugging as well as to get a better idea of the time used
231     * by the various functions. process_players1() does the processing before
232     * objects have been updated, process_players2() does the processing that
233     * is needed after the players have been updated.
234     */
235 root 1.46 static void
236     process_players1 ()
237 elmex 1.1 {
238 root 1.20 /* Basically, we keep looping until all the players have done their actions. */
239 root 1.94 for (int flag = 1; flag != 0;)
240 root 1.20 {
241     flag = 0;
242 root 1.56 for_all_players (pl)
243 root 1.20 {
244 root 1.56 pl->refcnt_chk ();
245 elmex 1.1
246 root 1.109 if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
247 root 1.20 continue;
248    
249 root 1.106 if (handle_newcs_player (pl->ob))
250     flag = 1;
251     }
252     }
253 root 1.46
254 root 1.55 for_all_players (pl)
255 root 1.20 {
256 root 1.102 object *ob = pl->ob;
257    
258 root 1.109 if (expect_false (!ob || !pl->ns || !ob->active))
259 root 1.56 continue;
260    
261 root 1.102 do_some_living (ob);
262 elmex 1.1 }
263     }
264    
265 root 1.46 static void
266     process_players2 ()
267 elmex 1.1 {
268 root 1.20 /* Then check if any players should use weapon-speed instead of speed */
269 root 1.55 for_all_players (pl)
270 root 1.20 {
271 root 1.106 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
272     pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
273 elmex 1.1 }
274     }
275    
276 root 1.20 void
277 root 1.46 process_events ()
278 root 1.20 {
279 root 1.46 process_players1 ();
280 elmex 1.1
281 root 1.81 for_all_actives (op)
282 root 1.20 {
283     /* Now process op */
284 root 1.109 if (expect_false (QUERY_FLAG (op, FLAG_FREED)))
285 root 1.20 {
286     LOG (llevError, "BUG: process_events(): Free object on list\n");
287 root 1.59 op->set_speed (0);
288 root 1.20 continue;
289     }
290    
291 root 1.109 if (expect_false (!op->has_active_speed ()))
292 root 1.20 {
293 elmex 1.66 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
294     "but is on active list\n", op->debug_desc (), op->speed);
295 root 1.59 op->set_speed (0);
296 root 1.20 continue;
297 root 1.14 }
298    
299 root 1.109 if (expect_false (op->flag [FLAG_REMOVED]))
300 root 1.20 {
301 root 1.96 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
302     op->debug_desc ());
303 root 1.59 op->set_speed (0);
304 root 1.20 continue;
305 root 1.14 }
306    
307 root 1.46 /* Animate the object. Bug or feature that anim_speed
308 root 1.20 * is based on ticks, and not the creatures speed?
309     */
310     if (op->anim_speed && op->last_anim >= op->anim_speed)
311     {
312 root 1.102 animate_object (op, op->contr ? op->facing : op->direction);
313 root 1.20 op->last_anim = 1;
314     }
315     else
316 root 1.102 ++op->last_anim;
317 elmex 1.1
318 root 1.102 if (op->speed_left > 0.f)
319 root 1.20 {
320     --op->speed_left;
321     process_object (op);
322 root 1.28
323     if (op->destroyed ())
324 root 1.20 continue;
325 root 1.14 }
326 root 1.28
327 root 1.102 if (!op->contr)
328     op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
329 elmex 1.1 }
330    
331 root 1.46 process_players2 ();
332 elmex 1.1 }
333    
334 root 1.62 /* clean up everything before exiting */
335 root 1.20 void
336 root 1.62 emergency_save ()
337 root 1.20 {
338 root 1.62 LOG (llevDebug, "emergency save begin.\n");
339 elmex 1.1
340 root 1.83 cfperl_emergency_save ();
341 root 1.62
342     LOG (llevDebug, "saving book archive.\n");
343     write_book_archive ();
344 root 1.47
345 root 1.62 LOG (llevDebug, "emergency save done.\n");
346 elmex 1.1 }
347    
348 root 1.79 // send all clients some informational text
349     static void
350     cleanup_inform (const char *cause, bool make_core)
351     {
352 root 1.114 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
353 root 1.83
354 root 1.111 new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
355     new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
356 root 1.79
357     if (make_core)
358 root 1.111 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
359 root 1.79 else
360 root 1.111 new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now.");
361 root 1.79
362 root 1.111 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
363 root 1.79
364 root 1.113 client::flush_sockets ();
365 root 1.79 }
366    
367 elmex 1.1 /* clean up everything before exiting */
368 root 1.20 void
369 root 1.79 cleanup (const char *cause, bool make_core)
370 elmex 1.1 {
371 root 1.84 if (make_core)
372 root 1.85 fork_abort (cause);
373 root 1.84
374 root 1.79 LOG (llevError, "cleanup cause: %s\n", cause);
375    
376     if (!make_core)
377     cleanup_inform (cause, make_core);
378    
379 root 1.62 LOG (llevDebug, "cleanup begin.\n");
380    
381 root 1.65 if (init_done && !in_cleanup)
382 root 1.67 {
383     in_cleanup = true;
384     emergency_save ();
385     }
386     else
387     in_cleanup = true;
388 root 1.29
389 root 1.62 LOG (llevDebug, "running cleanup handlers.\n");
390     INVOKE_GLOBAL (CLEANUP);
391 root 1.23
392 root 1.62 LOG (llevDebug, "cleanup done.\n");
393 root 1.25
394 root 1.123 log_cleanup ();
395    
396 root 1.49 if (make_core)
397 root 1.79 {
398     cleanup_inform (cause, make_core);
399 root 1.91 cfperl_cleanup (make_core);
400 root 1.84 _exit (1);
401 root 1.79 }
402 root 1.49 else
403 root 1.88 {
404 root 1.115 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
405     new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
406 root 1.113 client::flush_sockets ();
407 root 1.91 cfperl_cleanup (make_core);
408 root 1.88 _exit (0);
409     }
410 elmex 1.1 }
411    
412     /*
413 root 1.73 * do_specials() is a collection of functions to call from time to time.
414 elmex 1.1 * Modified 2000-1-14 MSW to use the global pticks count to determine how
415     * often to do things. This will allow us to spred them out more often.
416     * I use prime numbers for the factor count - in that way, it is less likely
417     * these actions will fall on the same tick (compared to say using 500/2500/15000
418     * which would mean on that 15,000 tick count a whole bunch of stuff gets
419     * done). Of course, there can still be times where multiple specials are
420     * done on the same tick, but that will happen very infrequently
421     *
422     * I also think this code makes it easier to see how often we really are
423     * doing the various things.
424     */
425 root 1.20 void
426     do_specials (void)
427     {
428 root 1.122 shstr::gc ();
429 root 1.125 archetype::gc ();
430 root 1.122
431 root 1.109 if (expect_false (!(pticks % TICKS_PER_HOUR)))
432 root 1.95 adjust_daylight ();
433 elmex 1.1
434 root 1.109 if (expect_false (!(pticks % 2503)))
435 root 1.20 fix_weight (); /* Hack to fix weightproblems caused by bugs */
436 elmex 1.1
437 root 1.109 if (expect_false (!(pticks % 5003)))
438 root 1.20 write_book_archive ();
439 elmex 1.1
440 root 1.109 if (expect_false (!(pticks % 5009)))
441 root 1.20 clean_friendly_list ();
442 elmex 1.1
443 root 1.109 if (expect_false (!(pticks % 5011)))
444 root 1.20 obsolete_parties ();
445 elmex 1.1
446 root 1.109 if (expect_false (!(pticks % 12503)))
447 root 1.20 fix_luck ();
448 elmex 1.1 }
449    
450 root 1.20 void
451     server_tick ()
452 root 1.2 {
453 root 1.44 // first do the user visible stuff
454 root 1.12 INVOKE_GLOBAL (CLOCK);
455 root 1.113 process_events (); // "do" something with objects with speed
456     client::clock (); // draw client maps etc.
457 root 1.44
458     // then do some bookkeeping, should not really be here
459 root 1.20 do_specials (); /* Routines called from time to time. */
460 root 1.56 attachable::check_mortals ();
461 root 1.5
462     ++pticks;
463 root 1.2 }
464    
465 root 1.87 #if 0
466     // used fro benchmarking (x86/amd64-specific)
467     typedef unsigned long tval;
468     typedef unsigned long long stamp64;
469    
470     extern inline tval
471     stamp (void)
472     {
473     tval tsc;
474     asm volatile ("rdtsc":"=a" (tsc)::"edx");
475    
476     return tsc;
477     }
478    
479     extern inline tval
480     measure (tval t)
481     {
482     tval tsc;
483     asm volatile ("rdtsc":"=a" (tsc)::"edx");
484    
485     if (tsc > t)
486     return tsc - t;
487     else
488     return t - tsc;
489     }
490    
491     int
492     main (int argc, char **argv)
493     {
494     rand_gen rg(0);
495     tval fastest = 0x7fffffff;
496     for (int loop = 10000; loop--; )
497     {
498     tval s = stamp ();
499     volatile int i = rg.get_int(25);
500     fastest = min (fastest, measure (s));
501     }
502    
503     //printf ("fastest %d\n", fastest);
504     for (int i = 0; i < 1024*1024*3; ++i)
505     {
506     char c = rg.get_int (256);
507     write (2, &c, 1);
508     }
509     }
510    
511     #else
512    
513     // normal main
514 root 1.20 int
515     main (int argc, char **argv)
516 elmex 1.1 {
517 root 1.6 settings.argc = argc;
518     settings.argv = argv;
519    
520 root 1.126 g_thread_init (0); // for the slice allocator only
521    
522 root 1.6 init (argc, argv);
523    
524     for (;;)
525     cfperl_main ();
526 root 1.64 }
527 root 1.87 #endif
528 root 1.4
529 root 1.116 #if 0
530     int xyzzy ()
531     {
532     return rndm(8);
533     }
534    
535     void xyzzy (object_ptr &a, object_ptr &o)
536     {
537     asm volatile ("int3");
538     a = o;
539     asm volatile ("int3");
540     }
541     #endif
542