1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra 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 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) 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, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License 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 |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | #include <global.h> |
25 | #include <global.h> |
… | |
… | |
32 | |
33 | |
33 | #include <../random_maps/random_map.h> |
34 | #include <../random_maps/random_map.h> |
34 | #include <../random_maps/rproto.h> |
35 | #include <../random_maps/rproto.h> |
35 | #include "path.h" |
36 | #include "path.h" |
36 | |
37 | |
37 | static char days[7][4] = { |
|
|
38 | "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" |
|
|
39 | }; |
|
|
40 | |
|
|
41 | void |
38 | void |
42 | version (object *op) |
39 | version (object *op) |
43 | { |
40 | { |
44 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION); |
41 | new_draw_info_format (NDI_UNIQUE, 0, op, "This is Deliantra v%s", VERSION); |
45 | |
|
|
46 | #if 0 |
|
|
47 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
|
|
48 | 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 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
|
|
52 | new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:"); |
|
|
53 | 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 | new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>"); |
|
|
62 | 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 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
|
|
94 | new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
|
|
95 | new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
|
|
96 | 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 | new_draw_info (NDI_UNIQUE, 0, op, ""); |
|
|
101 | new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
|
|
102 | #endif |
|
|
103 | } |
42 | } |
104 | |
43 | |
105 | /* 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 |
106 | * savebed. We do some error checking - its possible that the |
45 | * savebed. We do some error checking - its possible that the |
107 | * 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 |
… | |
… | |
142 | |
81 | |
143 | if (contr && map != newmap && map) |
82 | if (contr && map != newmap && map) |
144 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
83 | if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
145 | return; |
84 | return; |
146 | |
85 | |
147 | // remove, so stupid ob_locked does not trigger a failure |
86 | // remove, so stupid blocked does not trigger a failure |
148 | remove (); |
87 | remove (); |
149 | |
88 | |
150 | /* try to find a spot for the player */ |
89 | /* try to find a spot for the player */ |
151 | if (blocked (newmap, x, y)) |
90 | if (blocked (newmap, x, y)) |
152 | { /* First choice blocked */ |
91 | { /* First choice blocked */ |
… | |
… | |
157 | * 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 |
158 | * 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. |
159 | */ |
98 | */ |
160 | 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); |
161 | |
100 | |
162 | if (i == -1) |
101 | if (i < 0) |
163 | { |
102 | { |
164 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
103 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
165 | if (i == -1) |
104 | if (i < 0) |
166 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
105 | i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
167 | } |
106 | } |
168 | |
107 | |
169 | if (i != -1) |
108 | if (i >= 0) |
170 | { |
109 | { |
171 | x += freearr_x[i]; |
110 | x += freearr_x[i]; |
172 | y += freearr_y[i]; |
111 | y += freearr_y[i]; |
173 | } |
112 | } |
174 | else |
113 | else |
… | |
… | |
183 | |
122 | |
184 | 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))) |
185 | return; |
124 | return; |
186 | } |
125 | } |
187 | |
126 | |
188 | this->x = x; |
127 | newmap->insert (this, x, y, 0, INS_NO_WALK_ON); |
189 | this->y = y; |
|
|
190 | map = newmap; |
|
|
191 | |
|
|
192 | insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
|
|
193 | |
128 | |
194 | enemy = 0; |
129 | enemy = 0; |
195 | |
130 | |
196 | if (contr) |
131 | if (contr) |
197 | { |
132 | { |
… | |
… | |
204 | if (object *golem = contr->golem) |
139 | if (object *golem = contr->golem) |
205 | { |
140 | { |
206 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
141 | int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
207 | |
142 | |
208 | if (i < 0) |
143 | if (i < 0) |
209 | { |
|
|
210 | golem->destroy_inv (true); // be explicit about dropping |
|
|
211 | golem->destroy (true); |
144 | golem->drop_and_destroy (); |
212 | } |
|
|
213 | else |
145 | else |
214 | { |
146 | { |
215 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
147 | newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
216 | golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
148 | golem->direction = find_dir_2 (golem->x - x, golem->y - y); |
217 | } |
149 | } |
218 | } |
150 | } |
219 | |
151 | |
220 | /* since the players map is already loaded, we don't need to worry |
152 | /* since the players map is already loaded, we don't need to worry |
221 | * about pending objects. |
153 | * about pending objects. |
… | |
… | |
251 | |
183 | |
252 | for_all_players (pl) |
184 | for_all_players (pl) |
253 | { |
185 | { |
254 | object *ob = pl->ob; |
186 | object *ob = pl->ob; |
255 | |
187 | |
|
|
188 | // process_objects destroys the speed_left value |
|
|
189 | pl->speed_left_save = ob->speed_left; |
|
|
190 | |
256 | if (expect_false (!ob || !pl->ns || !ob->active)) |
191 | if (expect_false (!ob || !pl->ns || !ob->active)) |
257 | continue; |
192 | continue; |
258 | |
193 | |
259 | do_some_living (ob); |
194 | do_some_living (ob); |
260 | } |
195 | } |
… | |
… | |
264 | process_players2 () |
199 | process_players2 () |
265 | { |
200 | { |
266 | /* Then check if any players should use weapon-speed instead of speed */ |
201 | /* Then check if any players should use weapon-speed instead of speed */ |
267 | for_all_players (pl) |
202 | for_all_players (pl) |
268 | { |
203 | { |
|
|
204 | // restore speed_left value saved by process_players1 |
|
|
205 | pl->ob->speed_left = pl->speed_left_save; |
|
|
206 | |
269 | pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
207 | 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); |
208 | pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
271 | } |
209 | } |
272 | } |
210 | } |
273 | |
211 | |
274 | void |
212 | static void |
275 | process_events () |
213 | process_events () |
276 | { |
214 | { |
277 | process_players1 (); |
215 | process_players1 (); |
278 | |
216 | |
279 | for_all_actives (op) |
217 | for_all_actives (op) |
280 | { |
218 | { |
|
|
219 | // try to prefetch some stuff we expect to need |
|
|
220 | // obviously, it should be grouped into the same cacheline. |
|
|
221 | // preliminary results indicate that this gives halves the speed |
|
|
222 | // used for the inner loop |
|
|
223 | if (_i < actives.size ()) // HACK, rely on _i :/ |
|
|
224 | { |
|
|
225 | object *next = actives [_i + 1]; |
|
|
226 | |
|
|
227 | prefetch (&next->flag , 0, 1); |
|
|
228 | prefetch (&next->speed , 0, 1); |
|
|
229 | prefetch (&next->anim_speed, 0, 1); |
|
|
230 | prefetch (&next->contr , 0, 1); |
|
|
231 | } |
|
|
232 | |
281 | /* Now process op */ |
233 | /* Now process op */ |
282 | if (expect_false (QUERY_FLAG (op, FLAG_FREED))) |
234 | if (expect_false (op->flag [FLAG_FREED])) |
283 | { |
235 | { |
284 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
236 | LOG (llevError, "BUG: process_events(): Free object on list\n"); |
285 | op->set_speed (0); |
237 | op->set_speed (0); |
286 | continue; |
238 | continue; |
287 | } |
239 | } |
… | |
… | |
317 | { |
269 | { |
318 | --op->speed_left; |
270 | --op->speed_left; |
319 | process_object (op); |
271 | process_object (op); |
320 | } |
272 | } |
321 | |
273 | |
322 | if (expect_true (!op->contr)) |
274 | // this will destroy the speed_left value for players, but |
|
|
275 | // process_players1 and ..2 save/restore the real value, |
|
|
276 | // so we can avoid a costly test here. |
323 | op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); |
277 | op->speed_left = min (op->speed, op->speed_left + op->speed); |
324 | } |
278 | } |
325 | |
279 | |
326 | process_players2 (); |
280 | process_players2 (); |
327 | } |
281 | } |
328 | |
282 | |
… | |
… | |
412 | * done on the same tick, but that will happen very infrequently |
366 | * done on the same tick, but that will happen very infrequently |
413 | * |
367 | * |
414 | * I also think this code makes it easier to see how often we really are |
368 | * I also think this code makes it easier to see how often we really are |
415 | * doing the various things. |
369 | * doing the various things. |
416 | */ |
370 | */ |
417 | void |
371 | static void |
418 | do_specials (void) |
372 | do_specials () |
419 | { |
373 | { |
420 | shstr::gc (); |
374 | shstr::gc (); |
421 | archetype::gc (); |
375 | archetype::gc (); |
422 | |
376 | |
423 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
377 | if (expect_false (!(pticks % TICKS_PER_HOUR))) |
424 | adjust_daylight (); |
378 | maptile::adjust_daylight (); |
425 | |
379 | |
426 | if (expect_false (!(pticks % 2503))) |
380 | if (expect_false (!(pticks % 2503))) |
427 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
381 | fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
428 | |
382 | |
429 | if (expect_false (!(pticks % 5003))) |
383 | if (expect_false (!(pticks % 5003))) |
… | |
… | |
450 | // then do some bookkeeping, should not really be here |
404 | // then do some bookkeeping, should not really be here |
451 | do_specials (); /* Routines called from time to time. */ |
405 | do_specials (); /* Routines called from time to time. */ |
452 | attachable::check_mortals (); |
406 | attachable::check_mortals (); |
453 | |
407 | |
454 | ++pticks; |
408 | ++pticks; |
455 | } |
|
|
456 | |
409 | |
457 | #if 0 |
410 | if (object::object_count >= RESTART_COUNT) |
458 | // used fro benchmarking (x86/amd64-specific) |
411 | cleanup ("running out of protocol ID values - need full restart"); |
459 | typedef unsigned long tval; |
|
|
460 | typedef unsigned long long stamp64; |
|
|
461 | |
|
|
462 | extern inline tval |
|
|
463 | stamp (void) |
|
|
464 | { |
|
|
465 | tval tsc; |
|
|
466 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
467 | |
|
|
468 | return tsc; |
|
|
469 | } |
412 | } |
470 | |
|
|
471 | extern inline tval |
|
|
472 | measure (tval t) |
|
|
473 | { |
|
|
474 | tval tsc; |
|
|
475 | asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
|
|
476 | |
|
|
477 | if (tsc > t) |
|
|
478 | return tsc - t; |
|
|
479 | else |
|
|
480 | return t - tsc; |
|
|
481 | } |
|
|
482 | |
|
|
483 | int |
|
|
484 | main (int argc, char **argv) |
|
|
485 | { |
|
|
486 | rand_gen rg(0); |
|
|
487 | tval fastest = 0x7fffffff; |
|
|
488 | for (int loop = 10000; loop--; ) |
|
|
489 | { |
|
|
490 | tval s = stamp (); |
|
|
491 | volatile int i = rg.get_int(25); |
|
|
492 | fastest = min (fastest, measure (s)); |
|
|
493 | } |
|
|
494 | |
|
|
495 | //printf ("fastest %d\n", fastest); |
|
|
496 | for (int i = 0; i < 1024*1024*3; ++i) |
|
|
497 | { |
|
|
498 | char c = rg.get_int (256); |
|
|
499 | write (2, &c, 1); |
|
|
500 | } |
|
|
501 | } |
|
|
502 | |
|
|
503 | #else |
|
|
504 | |
|
|
505 | #if 0 // just goofing around, look elsewhere |
|
|
506 | |
|
|
507 | #include <malloc.h> |
|
|
508 | #include <execinfo.h> |
|
|
509 | |
|
|
510 | static void tr_on (); |
|
|
511 | static void tr_off (); |
|
|
512 | |
|
|
513 | static SMUTEX(tr_mutex); |
|
|
514 | |
|
|
515 | #define ltr_off() SMUTEX_LOCK (tr_mutex); tr_off () |
|
|
516 | #define ltr_on() tr_on (); SMUTEX_UNLOCK (tr_mutex); |
|
|
517 | |
|
|
518 | static void * |
|
|
519 | tr_malloc (size_t size, const void *caller) |
|
|
520 | { |
|
|
521 | ltr_off (); |
|
|
522 | |
|
|
523 | void *bt [8]; |
|
|
524 | backtrace (bt, 8); |
|
|
525 | |
|
|
526 | void *ptr = malloc (size); |
|
|
527 | |
|
|
528 | ltr_on (); |
|
|
529 | return (char *)ptr; |
|
|
530 | } |
|
|
531 | |
|
|
532 | static void |
|
|
533 | tr_free (void *ptr, const void *caller) |
|
|
534 | { |
|
|
535 | ltr_off (); |
|
|
536 | |
|
|
537 | free (ptr); |
|
|
538 | |
|
|
539 | ltr_on (); |
|
|
540 | } |
|
|
541 | |
|
|
542 | void static * |
|
|
543 | tr_realloc (void *ptr, size_t size, const void *caller) |
|
|
544 | { |
|
|
545 | ltr_off (); |
|
|
546 | |
|
|
547 | void *nptr = realloc (ptr, size); |
|
|
548 | |
|
|
549 | ltr_on (); |
|
|
550 | return nptr; |
|
|
551 | } |
|
|
552 | |
|
|
553 | static void * |
|
|
554 | tr_memalign (size_t size, size_t alignment, const void *caller) |
|
|
555 | { |
|
|
556 | ltr_off (); |
|
|
557 | |
|
|
558 | void *ptr = memalign (size, alignment < 16 ? 16 : alignment); |
|
|
559 | |
|
|
560 | ltr_on (); |
|
|
561 | return ptr; |
|
|
562 | } |
|
|
563 | |
|
|
564 | static void |
|
|
565 | tr_on () |
|
|
566 | { |
|
|
567 | __malloc_hook = tr_malloc; |
|
|
568 | __realloc_hook = tr_realloc; |
|
|
569 | __free_hook = tr_free; |
|
|
570 | __memalign_hook = tr_memalign; |
|
|
571 | } |
|
|
572 | |
|
|
573 | static void |
|
|
574 | tr_off () |
|
|
575 | { |
|
|
576 | __malloc_hook = 0; |
|
|
577 | __realloc_hook = 0; |
|
|
578 | __free_hook = 0; |
|
|
579 | __memalign_hook = 0; |
|
|
580 | } |
|
|
581 | |
|
|
582 | void (*__malloc_initialize_hook)(void) = tr_on; |
|
|
583 | |
|
|
584 | #endif |
|
|
585 | |
413 | |
586 | // normal main |
414 | // normal main |
587 | int |
415 | int |
588 | main (int argc, char **argv) |
416 | main (int argc, char **argv) |
589 | { |
417 | { |
590 | settings.argc = argc; |
418 | settings.argc = argc; |
591 | settings.argv = argv; |
419 | settings.argv = argv; |
592 | |
420 | |
|
|
421 | rndm.seed (time (0)); |
593 | g_thread_init (0); // for the slice allocator only |
422 | g_thread_init (0); // for the slice allocator only |
594 | |
423 | |
595 | init (argc, argv); |
424 | init (argc, argv); |
596 | |
425 | |
597 | for (;;) |
426 | for (;;) |
598 | cfperl_main (); |
427 | cfperl_main (); |
599 | } |
428 | } |
600 | #endif |
|
|
601 | |
429 | |
602 | #if 0 |
|
|
603 | int xyzzy () |
|
|
604 | { |
|
|
605 | return rndm(8); |
|
|
606 | } |
|
|
607 | |
|
|
608 | void xyzzy (object_ptr &a, object_ptr &o) |
|
|
609 | { |
|
|
610 | asm volatile ("int3"); |
|
|
611 | a = o; |
|
|
612 | asm volatile ("int3"); |
|
|
613 | } |
|
|
614 | #endif |
|
|
615 | |
|
|