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