1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | * Copyright (C) 2001-2003 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
9 | * it under the terms of the GNU General Public License as published by |
9 | * under the terms of the GNU General Public License as published by the Free |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
11 | * (at your option) any later version. |
11 | * any later version. |
12 | * |
12 | * |
13 | * 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, but |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
16 | * GNU General Public License for more details. |
16 | * for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License along |
19 | * along with this program; if not, write to the Free Software |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
21 | * |
21 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
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 | #ifdef HAVE_DES_H |
|
|
30 | # include <des.h> |
|
|
31 | #else |
|
|
32 | # ifdef HAVE_CRYPT_H |
|
|
33 | # include <crypt.h> |
|
|
34 | # endif |
|
|
35 | #endif |
|
|
36 | |
|
|
37 | #include <sproto.h> |
29 | #include <sproto.h> |
38 | #include <time.h> |
30 | #include <time.h> |
39 | |
31 | |
40 | #include <../random_maps/random_map.h> |
32 | #include <../random_maps/random_map.h> |
41 | #include <../random_maps/rproto.h> |
33 | #include <../random_maps/rproto.h> |
… | |
… | |
46 | }; |
38 | }; |
47 | |
39 | |
48 | void |
40 | void |
49 | version (object *op) |
41 | version (object *op) |
50 | { |
42 | { |
51 | if (op) |
|
|
52 | clear_win_info (op); |
|
|
53 | |
|
|
54 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION); |
43 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION); |
55 | |
44 | |
56 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
45 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
57 | new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); |
46 | new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); |
58 | new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); |
47 | new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); |
… | |
… | |
211 | contr->maplevel = newmap->path; |
200 | contr->maplevel = newmap->path; |
212 | contr->count = 0; |
201 | contr->count = 0; |
213 | } |
202 | } |
214 | |
203 | |
215 | /* Update any golems */ |
204 | /* Update any golems */ |
216 | if (type == PLAYER && contr->ranges[range_golem]) |
205 | if (type == PLAYER) |
217 | { |
206 | if (object *golem = contr->golem) |
218 | int i = find_free_spot (contr->ranges[range_golem], newmap, |
|
|
219 | x, y, 1, SIZEOFFREE); |
|
|
220 | |
|
|
221 | if (i == -1) |
|
|
222 | { |
207 | { |
223 | contr->ranges[range_golem]->destroy (); |
208 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
224 | contr->ranges[range_golem] = 0; |
209 | |
225 | } |
210 | if (i < 0) |
|
|
211 | golem->destroy (); |
226 | else |
212 | else |
227 | { |
|
|
228 | for (object *tmp = contr->ranges[range_golem]; tmp; tmp = tmp->more) |
|
|
229 | { |
213 | { |
230 | tmp->x = x + freearr_x[i] + (tmp->arch ? 0 : tmp->arch->clone.x); |
214 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
231 | tmp->y = y + freearr_y[i] + (tmp->arch ? 0 : tmp->arch->clone.y); |
215 | golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
232 | tmp->map = newmap; |
|
|
233 | } |
216 | } |
234 | |
|
|
235 | insert_ob_in_map (contr->ranges[range_golem], newmap, NULL, 0); |
|
|
236 | contr->ranges[range_golem]->direction = |
|
|
237 | find_dir_2 (x - contr->ranges[range_golem]->x, y - contr->ranges[range_golem]->y); |
|
|
238 | } |
217 | } |
239 | } |
|
|
240 | |
218 | |
241 | /* since the players map is already loaded, we don't need to worry |
219 | /* since the players map is already loaded, we don't need to worry |
242 | * about pending objects. |
220 | * about pending objects. |
243 | */ |
221 | */ |
244 | remove_all_pets (newmap); |
222 | remove_all_pets (newmap); |
… | |
… | |
252 | * is needed after the players have been updated. |
230 | * is needed after the players have been updated. |
253 | */ |
231 | */ |
254 | static void |
232 | static void |
255 | process_players1 () |
233 | process_players1 () |
256 | { |
234 | { |
257 | int flag; |
|
|
258 | |
|
|
259 | /* Basically, we keep looping until all the players have done their actions. */ |
235 | /* Basically, we keep looping until all the players have done their actions. */ |
260 | for (flag = 1; flag != 0;) |
236 | for (int flag = 1; flag != 0;) |
261 | { |
237 | { |
262 | flag = 0; |
238 | flag = 0; |
263 | for_all_players (pl) |
239 | for_all_players (pl) |
264 | { |
240 | { |
265 | pl->refcnt_chk (); |
241 | pl->refcnt_chk (); |
266 | |
242 | |
267 | if (!pl->ob || !pl->ns || !pl->ob->active) |
243 | if (expect_false (!pl->ob || !pl->ns || !pl->ob->active)) |
268 | continue; |
244 | continue; |
269 | |
245 | |
270 | if (pl->ob->speed_left > 0) |
|
|
271 | if (handle_newcs_player (pl->ob)) |
246 | if (handle_newcs_player (pl->ob)) |
272 | flag = 1; |
247 | flag = 1; |
273 | |
248 | } |
274 | /* If the player is not actively playing, don't make a |
249 | } |
275 | * backup save - nothing to save anyway. Plus, the |
|
|
276 | * map may not longer be valid. This can happen when the |
|
|
277 | * player quits - they exist for purposes of tracking on the map, |
|
|
278 | * but don't actually reside on any actual map. |
|
|
279 | */ |
|
|
280 | if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
281 | continue; |
|
|
282 | } /* end of for loop for all the players */ |
|
|
283 | } /* for flag */ |
|
|
284 | |
250 | |
285 | for_all_players (pl) |
251 | for_all_players (pl) |
286 | { |
252 | { |
|
|
253 | object *ob = pl->ob; |
|
|
254 | |
287 | if (!pl->ob || !pl->ns || !pl->ob->active) |
255 | if (expect_false (!ob || !pl->ns || !ob->active)) |
288 | continue; |
256 | continue; |
289 | |
257 | |
290 | if (settings.casting_time) |
|
|
291 | { |
|
|
292 | if (pl->ob->casting_time > 0) |
|
|
293 | { |
|
|
294 | pl->ob->casting_time--; |
|
|
295 | pl->ob->start_holding = 1; |
|
|
296 | } |
|
|
297 | |
|
|
298 | /* set spell_state so we can update the range in stats field */ |
|
|
299 | if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1)) |
|
|
300 | pl->ob->start_holding = 0; |
|
|
301 | } |
|
|
302 | |
|
|
303 | do_some_living (pl->ob); |
258 | do_some_living (ob); |
304 | } |
259 | } |
305 | } |
260 | } |
306 | |
261 | |
307 | static void |
262 | static void |
308 | process_players2 () |
263 | process_players2 () |
309 | { |
264 | { |
310 | /* Then check if any players should use weapon-speed instead of speed */ |
265 | /* Then check if any players should use weapon-speed instead of speed */ |
311 | for_all_players (pl) |
266 | for_all_players (pl) |
312 | { |
267 | { |
313 | /* The code that did weapon_sp handling here was out of place - |
268 | pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
314 | * this isn't called until after the player has finished there |
269 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
315 | * actions, and is thus out of place. All we do here is bounds |
|
|
316 | * checking. |
|
|
317 | */ |
|
|
318 | if (pl->has_hit) |
|
|
319 | { |
|
|
320 | if (pl->ob->speed_left > pl->weapon_sp) |
|
|
321 | pl->ob->speed_left = pl->weapon_sp; |
|
|
322 | |
|
|
323 | /* This needs to be here - if the player is running, we need to |
|
|
324 | * clear this each tick, but new commands are not being received |
|
|
325 | * so execute_newserver_command() is never called |
|
|
326 | */ |
|
|
327 | pl->has_hit = 0; |
|
|
328 | } |
|
|
329 | else if (pl->ob->speed_left > pl->ob->speed) |
|
|
330 | pl->ob->speed_left = pl->ob->speed; |
|
|
331 | } |
270 | } |
332 | } |
271 | } |
333 | |
272 | |
334 | void |
273 | void |
335 | process_events () |
274 | process_events () |
… | |
… | |
337 | process_players1 (); |
276 | process_players1 (); |
338 | |
277 | |
339 | for_all_actives (op) |
278 | for_all_actives (op) |
340 | { |
279 | { |
341 | /* Now process op */ |
280 | /* Now process op */ |
342 | if (QUERY_FLAG (op, FLAG_FREED)) |
281 | if (expect_false (QUERY_FLAG (op, FLAG_FREED))) |
343 | { |
282 | { |
344 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
283 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
345 | op->set_speed (0); |
284 | op->set_speed (0); |
346 | continue; |
285 | continue; |
347 | } |
286 | } |
348 | |
287 | |
349 | /* I've seen occasional crashes due to this - the object is removed, |
|
|
350 | * and thus the map it points to (last map it was on) may be bogus |
|
|
351 | * The real bug is to try to find out the cause of this - someone |
|
|
352 | * is probably calling remove_ob without either an insert_ob or |
|
|
353 | * free_object afterwards, leaving an object dangling. But I'd |
|
|
354 | * rather log this and continue on instead of crashing. |
|
|
355 | * Don't remove players - when a player quits, the object is in |
|
|
356 | * sort of a limbo, of removed, but something we want to keep |
|
|
357 | * around. |
|
|
358 | */ |
|
|
359 | if (QUERY_FLAG (op, FLAG_REMOVED) && op->type != PLAYER && op->map && op->map->in_memory != MAP_IN_MEMORY) |
|
|
360 | { |
|
|
361 | LOG (llevError, "BUG: process_events(): Removed object on list\n"); |
|
|
362 | char *dump = dump_object (op); |
|
|
363 | LOG (llevError, dump); |
|
|
364 | free (dump); |
|
|
365 | op->destroy (); |
|
|
366 | continue; |
|
|
367 | } |
|
|
368 | |
|
|
369 | if (!op->has_active_speed ()) |
288 | if (expect_false (!op->has_active_speed ())) |
370 | { |
289 | { |
371 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
290 | LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
372 | "but is on active list\n", op->debug_desc (), op->speed); |
291 | "but is on active list\n", op->debug_desc (), op->speed); |
373 | op->set_speed (0); |
292 | op->set_speed (0); |
374 | continue; |
293 | continue; |
375 | } |
294 | } |
376 | |
295 | |
377 | if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) |
296 | if (expect_false (op->flag [FLAG_REMOVED])) |
378 | { |
297 | { |
379 | LOG (llevError, "BUG: process_events(): Object without map or " |
298 | LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
380 | "inventory is on active list: %s (%d)\n", &op->name, op->count); |
299 | op->debug_desc ()); |
381 | op->set_speed (0); |
300 | op->set_speed (0); |
382 | continue; |
301 | continue; |
383 | } |
302 | } |
384 | |
303 | |
385 | /* Animate the object. Bug or feature that anim_speed |
304 | /* Animate the object. Bug or feature that anim_speed |
386 | * is based on ticks, and not the creatures speed? |
305 | * is based on ticks, and not the creatures speed? |
387 | */ |
306 | */ |
388 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
307 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
389 | { |
308 | { |
390 | if ((op->type == PLAYER)) |
|
|
391 | animate_object (op, op->facing); |
|
|
392 | else |
|
|
393 | animate_object (op, op->direction); |
309 | animate_object (op, op->contr ? op->facing : op->direction); |
394 | |
|
|
395 | op->last_anim = 1; |
310 | op->last_anim = 1; |
396 | } |
311 | } |
397 | else |
312 | else |
398 | op->last_anim++; |
313 | ++op->last_anim; |
399 | |
314 | |
400 | if (op->speed_left > 0) |
315 | if (op->speed_left > 0.f) |
401 | { |
|
|
402 | #if 0 |
|
|
403 | /* I've seen occasional crashes in move_symptom() with it |
|
|
404 | * crashing because op is removed - add some debugging to |
|
|
405 | * track if it is removed at this point. |
|
|
406 | * This unfortunately is a bit too verbose it seems - not sure |
|
|
407 | * why - I think what happens is a map is freed or something and |
|
|
408 | * some objects get 'lost' - removed never to be reclaimed. |
|
|
409 | * removed objects generally shouldn't exist. |
|
|
410 | */ |
|
|
411 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
412 | { |
316 | { |
413 | LOG (llevDebug, "process_events: calling process_object with removed object %s\n", op->name ? op->name : "null"); |
|
|
414 | } |
|
|
415 | #endif |
|
|
416 | --op->speed_left; |
317 | --op->speed_left; |
417 | process_object (op); |
318 | process_object (op); |
418 | |
319 | |
419 | if (op->destroyed ()) |
320 | if (op->destroyed ()) |
420 | continue; |
321 | continue; |
421 | } |
322 | } |
422 | |
323 | |
423 | if (settings.casting_time == TRUE && op->casting_time > 0) |
324 | if (!op->contr) |
424 | op->casting_time--; |
325 | op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); |
425 | |
|
|
426 | if (op->speed_left <= 0) |
|
|
427 | op->speed_left += FABS (op->speed); |
|
|
428 | } |
326 | } |
429 | |
327 | |
430 | process_players2 (); |
328 | process_players2 (); |
431 | } |
329 | } |
432 | |
330 | |
… | |
… | |
448 | static void |
346 | static void |
449 | cleanup_inform (const char *cause, bool make_core) |
347 | cleanup_inform (const char *cause, bool make_core) |
450 | { |
348 | { |
451 | int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
349 | int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
452 | |
350 | |
453 | new_draw_info_format (flags, 0, 0, "The server will now shutdown.\n"); |
351 | new_draw_info_format (flags, 0, 0, "The server will now shutdown."); |
454 | new_draw_info_format (flags, 0, 0, "Cause for this shtudown: %s\n", cause); |
352 | new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause); |
455 | |
353 | |
456 | if (make_core) |
354 | if (make_core) |
457 | new_draw_info_format (flags, 0, 0, "This is considered a crash.\n"); |
355 | new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved."); |
458 | else |
356 | else |
459 | new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown.\n"); |
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."); |
460 | |
358 | |
461 | new_draw_info_format (flags, 0, 0, "%s\n", CLEANUP_MESSAGE); |
359 | new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE); |
462 | |
360 | |
463 | flush_sockets (); |
361 | flush_sockets (); |
464 | } |
362 | } |
465 | |
363 | |
466 | /* clean up everything before exiting */ |
364 | /* clean up everything before exiting */ |
467 | void |
365 | void |
468 | cleanup (const char *cause, bool make_core) |
366 | cleanup (const char *cause, bool make_core) |
469 | { |
367 | { |
470 | if (make_core) |
368 | if (make_core) |
471 | if (!fork ()) |
369 | fork_abort (cause); |
472 | abort (); |
|
|
473 | |
370 | |
474 | LOG (llevError, "cleanup cause: %s\n", cause); |
371 | LOG (llevError, "cleanup cause: %s\n", cause); |
475 | |
372 | |
476 | if (!make_core) |
373 | if (!make_core) |
477 | cleanup_inform (cause, make_core); |
374 | cleanup_inform (cause, make_core); |
… | |
… | |
492 | LOG (llevDebug, "cleanup done.\n"); |
389 | LOG (llevDebug, "cleanup done.\n"); |
493 | |
390 | |
494 | if (make_core) |
391 | if (make_core) |
495 | { |
392 | { |
496 | cleanup_inform (cause, make_core); |
393 | cleanup_inform (cause, make_core); |
|
|
394 | cfperl_cleanup (make_core); |
497 | _exit (1); |
395 | _exit (1); |
498 | } |
396 | } |
499 | else |
397 | else |
|
|
398 | { |
|
|
399 | new_draw_info_format (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); |
|
|
401 | flush_sockets (); |
|
|
402 | cfperl_cleanup (make_core); |
500 | _exit (0); |
403 | _exit (0); |
|
|
404 | } |
501 | } |
405 | } |
502 | |
406 | |
503 | int |
407 | int |
504 | forbid_play (void) |
408 | forbid_play (void) |
505 | { |
409 | { |
… | |
… | |
561 | * done on the same tick, but that will happen very infrequently |
465 | * done on the same tick, but that will happen very infrequently |
562 | * |
466 | * |
563 | * I also think this code makes it easier to see how often we really are |
467 | * I also think this code makes it easier to see how often we really are |
564 | * doing the various things. |
468 | * doing the various things. |
565 | */ |
469 | */ |
566 | |
|
|
567 | extern unsigned long todtick; |
|
|
568 | |
|
|
569 | void |
470 | void |
570 | do_specials (void) |
471 | do_specials (void) |
571 | { |
472 | { |
572 | if (!(pticks % PTICKS_PER_CLOCK)) |
473 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
573 | tick_the_clock (); |
474 | adjust_daylight (); |
574 | |
475 | |
575 | if (!(pticks % 7)) |
476 | if (expect_false (!(pticks % 7))) |
576 | shstr::gc (); |
477 | shstr::gc (); |
577 | |
478 | |
578 | if (!(pticks % 2503)) |
479 | if (expect_false (!(pticks % 2503))) |
579 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
480 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
580 | |
481 | |
581 | if (!(pticks % 5003)) |
482 | if (expect_false (!(pticks % 5003))) |
582 | write_book_archive (); |
483 | write_book_archive (); |
583 | |
484 | |
584 | if (!(pticks % 5009)) |
485 | if (expect_false (!(pticks % 5009))) |
585 | clean_friendly_list (); |
486 | clean_friendly_list (); |
586 | |
487 | |
587 | if (!(pticks % 5011)) |
488 | if (expect_false (!(pticks % 5011))) |
588 | obsolete_parties (); |
489 | obsolete_parties (); |
589 | |
490 | |
590 | if (!(pticks % 12503)) |
491 | if (expect_false (!(pticks % 12503))) |
591 | fix_luck (); |
492 | fix_luck (); |
592 | } |
493 | } |
593 | |
494 | |
594 | void |
495 | void |
595 | server_tick () |
496 | server_tick () |
… | |
… | |
605 | attachable::check_mortals (); |
506 | attachable::check_mortals (); |
606 | |
507 | |
607 | ++pticks; |
508 | ++pticks; |
608 | } |
509 | } |
609 | |
510 | |
|
|
511 | #if 0 |
|
|
512 | // used fro benchmarking (x86/amd64-specific) |
|
|
513 | typedef unsigned long tval; |
|
|
514 | typedef unsigned long long stamp64; |
|
|
515 | |
|
|
516 | extern inline tval |
|
|
517 | stamp (void) |
|
|
518 | { |
|
|
519 | tval tsc; |
|
|
520 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
521 | |
|
|
522 | return tsc; |
|
|
523 | } |
|
|
524 | |
|
|
525 | extern inline tval |
|
|
526 | measure (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 | |
610 | int |
537 | int |
611 | main (int argc, char **argv) |
538 | main (int argc, char **argv) |
612 | { |
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 | |
|
|
559 | // normal main |
|
|
560 | int |
|
|
561 | main (int argc, char **argv) |
|
|
562 | { |
613 | settings.argc = argc; |
563 | settings.argc = argc; |
614 | settings.argv = argv; |
564 | settings.argv = argv; |
615 | |
565 | |
616 | init (argc, argv); |
566 | init (argc, argv); |
617 | |
567 | |
618 | initPlugins (); |
568 | initPlugins (); |
619 | |
569 | |
620 | for (;;) |
570 | for (;;) |
621 | cfperl_main (); |
571 | cfperl_main (); |
622 | } |
572 | } |
|
|
573 | #endif |
623 | |
574 | |