ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/server/main.C
Revision: 1.122
Committed: Fri Apr 11 21:09:53 2008 UTC (16 years, 1 month ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.121: +2 -3 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     #include <../random_maps/random_map.h>
32     #include <../random_maps/rproto.h>
33     #include "path.h"
34    
35     static char days[7][4] = {
36 root 1.20 "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
37     };
38 elmex 1.1
39 root 1.20 void
40 root 1.23 version (object *op)
41 root 1.20 {
42 root 1.121 new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION);
43 root 1.63
44 root 1.121 #if 0
45 root 1.20 new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:");
46 root 1.63 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 root 1.84 new_draw_info (NDI_UNIQUE, 0, op, "");
50     new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:");
51 root 1.63 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 root 1.71 new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>");
60 root 1.63 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 root 1.84 new_draw_info (NDI_UNIQUE, 0, op, "");
92 root 1.20 new_draw_info (NDI_UNIQUE, 0, op, "Images and art:");
93     new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner");
94 root 1.63 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 root 1.84 new_draw_info (NDI_UNIQUE, 0, op, "");
99 root 1.20 new_draw_info (NDI_UNIQUE, 0, op, "And many more!");
100 root 1.121 #endif
101 root 1.20 }
102    
103 elmex 1.1 /* This is a basic little function to put the player back to his
104     * savebed. We do some error checking - its possible that the
105     * savebed map may no longer exist, so we make sure the player
106     * goes someplace.
107     */
108 root 1.20 void
109 root 1.23 enter_player_savebed (object *op)
110 elmex 1.1 {
111 root 1.63 object *tmp = object::create ();
112 root 1.20 EXIT_PATH (tmp) = op->contr->savebed_map;
113     EXIT_X (tmp) = op->contr->bed_x;
114     EXIT_Y (tmp) = op->contr->bed_y;
115 root 1.62 op->enter_exit (tmp);
116 root 1.41 tmp->destroy ();
117 elmex 1.1 }
118    
119     /*
120 root 1.62 * enter_map(): Moves the player and pets from current map (if any) to
121 elmex 1.1 * new map. map, x, y must be set. map is the map we are moving the
122     * player to - it could be the map he just came from if the load failed for
123     * whatever reason. If default map coordinates are to be used, then
124     * the function that calls this should figure them out.
125     */
126 root 1.62 void
127     object::enter_map (maptile *newmap, int x, int y)
128 root 1.20 {
129 root 1.72 if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY)
130 root 1.69 return;
131    
132 root 1.20 if (out_of_map (newmap, x, y))
133     {
134 root 1.62 LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y);
135 root 1.58 x = newmap->enter_x;
136     y = newmap->enter_y;
137 root 1.20 if (out_of_map (newmap, x, y))
138     {
139     LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n",
140 root 1.62 &newmap->path, x, y, newmap->width, newmap->height);
141     new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed");
142 root 1.20 return;
143     }
144     }
145 root 1.31
146 root 1.78 if (contr && map != newmap && map)
147 root 1.65 if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr)))
148     return;
149    
150 root 1.82 // remove, so stupid ob_locked does not trigger a failure
151 root 1.65 remove ();
152    
153 root 1.20 /* try to find a spot for the player */
154 root 1.117 if (blocked (newmap, x, y))
155 root 1.20 { /* First choice blocked */
156     /* We try to find a spot for the player, starting closest in.
157     * We could use find_first_free_spot, but that doesn't randomize it at all,
158     * So for example, if the north space is free, you would always end up there even
159     * if other spaces around are available.
160     * Note that for the second and third calls, we could start at a position other
161     * than one, but then we could end up on the other side of walls and so forth.
162     */
163 root 1.62 int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1);
164 root 1.23
165 root 1.20 if (i == -1)
166     {
167 root 1.62 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1);
168 root 1.20 if (i == -1)
169 root 1.62 i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE);
170 root 1.20 }
171 root 1.31
172 root 1.20 if (i != -1)
173     {
174     x += freearr_x[i];
175     y += freearr_y[i];
176     }
177     else
178 root 1.62 /* not much we can do in this case. */
179     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);
180     }
181 elmex 1.1
182 root 1.78 if (contr && map != newmap)
183 root 1.69 {
184     if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y)))
185     return;
186 root 1.31
187 root 1.69 if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y)))
188     return;
189     }
190 root 1.20
191 root 1.62 this->x = x;
192     this->y = y;
193     map = newmap;
194 root 1.20
195 root 1.62 insert_ob_in_map (this, map, 0, INS_NO_WALK_ON);
196 root 1.20
197 root 1.82 enemy = 0;
198 root 1.20
199 root 1.62 if (contr)
200 root 1.20 {
201 root 1.70 contr->maplevel = newmap->path;
202 root 1.62 contr->count = 0;
203 root 1.20 }
204    
205     /* Update any golems */
206 root 1.99 if (type == PLAYER)
207 root 1.100 if (object *golem = contr->golem)
208 root 1.99 {
209     int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE);
210    
211     if (i < 0)
212     golem->destroy ();
213     else
214     {
215     newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]);
216     golem->direction = find_dir_2 (x - golem->x, y - golem->y);
217     }
218     }
219 root 1.31
220 root 1.20 /* since the players map is already loaded, we don't need to worry
221     * about pending objects.
222     */
223     remove_all_pets (newmap);
224 elmex 1.1 }
225    
226     /* process_players1 and process_players2 do all the player related stuff.
227     * I moved it out of process events and process_map. This was to some
228     * extent for debugging as well as to get a better idea of the time used
229     * by the various functions. process_players1() does the processing before
230     * objects have been updated, process_players2() does the processing that
231     * is needed after the players have been updated.
232     */
233 root 1.46 static void
234     process_players1 ()
235 elmex 1.1 {
236 root 1.20 /* Basically, we keep looping until all the players have done their actions. */
237 root 1.94 for (int flag = 1; flag != 0;)
238 root 1.20 {
239     flag = 0;
240 root 1.56 for_all_players (pl)
241 root 1.20 {
242 root 1.56 pl->refcnt_chk ();
243 elmex 1.1
244 root 1.109 if (expect_false (!pl->ob || !pl->ns || !pl->ob->active))
245 root 1.20 continue;
246    
247 root 1.106 if (handle_newcs_player (pl->ob))
248     flag = 1;
249     }
250     }
251 root 1.46
252 root 1.55 for_all_players (pl)
253 root 1.20 {
254 root 1.102 object *ob = pl->ob;
255    
256 root 1.109 if (expect_false (!ob || !pl->ns || !ob->active))
257 root 1.56 continue;
258    
259 root 1.102 do_some_living (ob);
260 elmex 1.1 }
261     }
262    
263 root 1.46 static void
264     process_players2 ()
265 elmex 1.1 {
266 root 1.20 /* Then check if any players should use weapon-speed instead of speed */
267 root 1.55 for_all_players (pl)
268 root 1.20 {
269 root 1.106 pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp);
270     pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed);
271 elmex 1.1 }
272     }
273    
274 root 1.20 void
275 root 1.46 process_events ()
276 root 1.20 {
277 root 1.46 process_players1 ();
278 elmex 1.1
279 root 1.81 for_all_actives (op)
280 root 1.20 {
281     /* Now process op */
282 root 1.109 if (expect_false (QUERY_FLAG (op, FLAG_FREED)))
283 root 1.20 {
284     LOG (llevError, "BUG: process_events(): Free object on list\n");
285 root 1.59 op->set_speed (0);
286 root 1.20 continue;
287     }
288    
289 root 1.109 if (expect_false (!op->has_active_speed ()))
290 root 1.20 {
291 elmex 1.66 LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), "
292     "but is on active list\n", op->debug_desc (), op->speed);
293 root 1.59 op->set_speed (0);
294 root 1.20 continue;
295 root 1.14 }
296    
297 root 1.109 if (expect_false (op->flag [FLAG_REMOVED]))
298 root 1.20 {
299 root 1.96 LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n",
300     op->debug_desc ());
301 root 1.59 op->set_speed (0);
302 root 1.20 continue;
303 root 1.14 }
304    
305 root 1.46 /* Animate the object. Bug or feature that anim_speed
306 root 1.20 * is based on ticks, and not the creatures speed?
307     */
308     if (op->anim_speed && op->last_anim >= op->anim_speed)
309     {
310 root 1.102 animate_object (op, op->contr ? op->facing : op->direction);
311 root 1.20 op->last_anim = 1;
312     }
313     else
314 root 1.102 ++op->last_anim;
315 elmex 1.1
316 root 1.102 if (op->speed_left > 0.f)
317 root 1.20 {
318     --op->speed_left;
319     process_object (op);
320 root 1.28
321     if (op->destroyed ())
322 root 1.20 continue;
323 root 1.14 }
324 root 1.28
325 root 1.102 if (!op->contr)
326     op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed));
327 elmex 1.1 }
328    
329 root 1.46 process_players2 ();
330 elmex 1.1 }
331    
332 root 1.62 /* clean up everything before exiting */
333 root 1.20 void
334 root 1.62 emergency_save ()
335 root 1.20 {
336 root 1.62 LOG (llevDebug, "emergency save begin.\n");
337 elmex 1.1
338 root 1.83 cfperl_emergency_save ();
339 root 1.62
340     LOG (llevDebug, "saving book archive.\n");
341     write_book_archive ();
342 root 1.47
343 root 1.62 LOG (llevDebug, "emergency save done.\n");
344 elmex 1.1 }
345    
346 root 1.79 // send all clients some informational text
347     static void
348     cleanup_inform (const char *cause, bool make_core)
349     {
350 root 1.114 int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN);
351 root 1.83
352 root 1.111 new_draw_info_format (flags, 0, 0, "The server will now shutdown.");
353     new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause);
354 root 1.79
355     if (make_core)
356 root 1.111 new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved.");
357 root 1.79 else
358 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.");
359 root 1.79
360 root 1.111 new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE);
361 root 1.79
362 root 1.113 client::flush_sockets ();
363 root 1.79 }
364    
365 elmex 1.1 /* clean up everything before exiting */
366 root 1.20 void
367 root 1.79 cleanup (const char *cause, bool make_core)
368 elmex 1.1 {
369 root 1.84 if (make_core)
370 root 1.85 fork_abort (cause);
371 root 1.84
372 root 1.79 LOG (llevError, "cleanup cause: %s\n", cause);
373    
374     if (!make_core)
375     cleanup_inform (cause, make_core);
376    
377 root 1.62 LOG (llevDebug, "cleanup begin.\n");
378    
379 root 1.65 if (init_done && !in_cleanup)
380 root 1.67 {
381     in_cleanup = true;
382     emergency_save ();
383     }
384     else
385     in_cleanup = true;
386 root 1.29
387 root 1.62 LOG (llevDebug, "running cleanup handlers.\n");
388     INVOKE_GLOBAL (CLEANUP);
389 root 1.23
390 root 1.62 LOG (llevDebug, "cleanup done.\n");
391 root 1.25
392 root 1.49 if (make_core)
393 root 1.79 {
394     cleanup_inform (cause, make_core);
395 root 1.91 cfperl_cleanup (make_core);
396 root 1.84 _exit (1);
397 root 1.79 }
398 root 1.49 else
399 root 1.88 {
400 root 1.115 new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting.");
401     new_draw_info_format (NDI_REPLY | NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE);
402 root 1.113 client::flush_sockets ();
403 root 1.91 cfperl_cleanup (make_core);
404 root 1.88 _exit (0);
405     }
406 elmex 1.1 }
407    
408     /*
409 root 1.73 * do_specials() is a collection of functions to call from time to time.
410 elmex 1.1 * Modified 2000-1-14 MSW to use the global pticks count to determine how
411     * often to do things. This will allow us to spred them out more often.
412     * I use prime numbers for the factor count - in that way, it is less likely
413     * these actions will fall on the same tick (compared to say using 500/2500/15000
414     * which would mean on that 15,000 tick count a whole bunch of stuff gets
415     * done). Of course, there can still be times where multiple specials are
416     * done on the same tick, but that will happen very infrequently
417     *
418     * I also think this code makes it easier to see how often we really are
419     * doing the various things.
420     */
421 root 1.20 void
422     do_specials (void)
423     {
424 root 1.122 shstr::gc ();
425    
426 root 1.109 if (expect_false (!(pticks % TICKS_PER_HOUR)))
427 root 1.95 adjust_daylight ();
428 elmex 1.1
429 root 1.109 if (expect_false (!(pticks % 2503)))
430 root 1.20 fix_weight (); /* Hack to fix weightproblems caused by bugs */
431 elmex 1.1
432 root 1.109 if (expect_false (!(pticks % 5003)))
433 root 1.20 write_book_archive ();
434 elmex 1.1
435 root 1.109 if (expect_false (!(pticks % 5009)))
436 root 1.20 clean_friendly_list ();
437 elmex 1.1
438 root 1.109 if (expect_false (!(pticks % 5011)))
439 root 1.20 obsolete_parties ();
440 elmex 1.1
441 root 1.109 if (expect_false (!(pticks % 12503)))
442 root 1.20 fix_luck ();
443 elmex 1.1 }
444    
445 root 1.20 void
446     server_tick ()
447 root 1.2 {
448 root 1.44 // first do the user visible stuff
449 root 1.12 INVOKE_GLOBAL (CLOCK);
450 root 1.113 process_events (); // "do" something with objects with speed
451     client::clock (); // draw client maps etc.
452 root 1.44
453     // then do some bookkeeping, should not really be here
454 root 1.20 do_specials (); /* Routines called from time to time. */
455 root 1.56 attachable::check_mortals ();
456 root 1.5
457     ++pticks;
458 root 1.2 }
459    
460 root 1.87 #if 0
461     // used fro benchmarking (x86/amd64-specific)
462     typedef unsigned long tval;
463     typedef unsigned long long stamp64;
464    
465     extern inline tval
466     stamp (void)
467     {
468     tval tsc;
469     asm volatile ("rdtsc":"=a" (tsc)::"edx");
470    
471     return tsc;
472     }
473    
474     extern inline tval
475     measure (tval t)
476     {
477     tval tsc;
478     asm volatile ("rdtsc":"=a" (tsc)::"edx");
479    
480     if (tsc > t)
481     return tsc - t;
482     else
483     return t - tsc;
484     }
485    
486     int
487     main (int argc, char **argv)
488     {
489     rand_gen rg(0);
490     tval fastest = 0x7fffffff;
491     for (int loop = 10000; loop--; )
492     {
493     tval s = stamp ();
494     volatile int i = rg.get_int(25);
495     fastest = min (fastest, measure (s));
496     }
497    
498     //printf ("fastest %d\n", fastest);
499     for (int i = 0; i < 1024*1024*3; ++i)
500     {
501     char c = rg.get_int (256);
502     write (2, &c, 1);
503     }
504     }
505    
506     #else
507    
508     // normal main
509 root 1.20 int
510     main (int argc, char **argv)
511 elmex 1.1 {
512 root 1.6 settings.argc = argc;
513     settings.argv = argv;
514    
515     init (argc, argv);
516    
517     for (;;)
518     cfperl_main ();
519 root 1.64 }
520 root 1.87 #endif
521 root 1.4
522 root 1.116 #if 0
523     int xyzzy ()
524     {
525     return rndm(8);
526     }
527    
528     void xyzzy (object_ptr &a, object_ptr &o)
529     {
530     asm volatile ("int3");
531     a = o;
532     asm volatile ("int3");
533     }
534     #endif
535