1 |
/* |
2 |
* This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 |
* |
4 |
* Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 |
* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
6 |
* Copyright (©) 1992,2007 Frank Tore Johansen |
7 |
* |
8 |
* Deliantra is free software: you can redistribute it and/or modify |
9 |
* 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 |
* |
13 |
* 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 |
* |
18 |
* 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 |
* |
21 |
* The authors can be reached via e-mail to <support@deliantra.net> |
22 |
*/ |
23 |
|
24 |
#include <global.h> |
25 |
#include <object.h> |
26 |
#include <tod.h> |
27 |
|
28 |
#include <sproto.h> |
29 |
#include <time.h> |
30 |
|
31 |
#include <glib.h> |
32 |
|
33 |
#include <../random_maps/random_map.h> |
34 |
#include <../random_maps/rproto.h> |
35 |
#include "path.h" |
36 |
|
37 |
static char days[7][4] = { |
38 |
"Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" |
39 |
}; |
40 |
|
41 |
void |
42 |
version (object *op) |
43 |
{ |
44 |
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 |
} |
104 |
|
105 |
/* 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 |
void |
111 |
enter_player_savebed (object *op) |
112 |
{ |
113 |
op->player_goto (op->contr->savebed_map, op->contr->bed_x, op->contr->bed_y); |
114 |
} |
115 |
|
116 |
/* |
117 |
* enter_map(): Moves the player and pets from current map (if any) to |
118 |
* 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 |
void |
124 |
object::enter_map (maptile *newmap, int x, int y) |
125 |
{ |
126 |
if (destroyed () || !newmap || newmap->in_memory != MAP_ACTIVE) |
127 |
return; |
128 |
|
129 |
if (out_of_map (newmap, x, y)) |
130 |
{ |
131 |
LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
132 |
x = newmap->enter_x; |
133 |
y = newmap->enter_y; |
134 |
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 |
&newmap->path, x, y, newmap->width, newmap->height); |
138 |
new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
139 |
return; |
140 |
} |
141 |
} |
142 |
|
143 |
if (contr && map != newmap && map) |
144 |
if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
145 |
return; |
146 |
|
147 |
// remove, so stupid ob_locked does not trigger a failure |
148 |
remove (); |
149 |
|
150 |
/* try to find a spot for the player */ |
151 |
if (blocked (newmap, x, y)) |
152 |
{ /* 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 |
int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); |
161 |
|
162 |
if (i == -1) |
163 |
{ |
164 |
i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
165 |
if (i == -1) |
166 |
i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
167 |
} |
168 |
|
169 |
if (i != -1) |
170 |
{ |
171 |
x += freearr_x[i]; |
172 |
y += freearr_y[i]; |
173 |
} |
174 |
else |
175 |
/* 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 |
|
179 |
if (contr && map != newmap) |
180 |
{ |
181 |
if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
182 |
return; |
183 |
|
184 |
if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
185 |
return; |
186 |
} |
187 |
|
188 |
this->x = x; |
189 |
this->y = y; |
190 |
map = newmap; |
191 |
|
192 |
insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
193 |
|
194 |
enemy = 0; |
195 |
|
196 |
if (contr) |
197 |
{ |
198 |
contr->maplevel = newmap->path; |
199 |
contr->count = 0; |
200 |
} |
201 |
|
202 |
/* Update any golems */ |
203 |
if (type == PLAYER) |
204 |
if (object *golem = contr->golem) |
205 |
{ |
206 |
int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
207 |
|
208 |
if (i < 0) |
209 |
golem->drop_and_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 |
|
217 |
/* since the players map is already loaded, we don't need to worry |
218 |
* about pending objects. |
219 |
*/ |
220 |
remove_all_pets (newmap); |
221 |
} |
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 |
static void |
231 |
process_players1 () |
232 |
{ |
233 |
/* Basically, we keep looping until all the players have done their actions. */ |
234 |
for (int flag = 1; flag != 0;) |
235 |
{ |
236 |
flag = 0; |
237 |
for_all_players (pl) |
238 |
{ |
239 |
pl->refcnt_chk (); |
240 |
|
241 |
if (expect_false (!pl->ob || !pl->ns || !pl->ob->active)) |
242 |
continue; |
243 |
|
244 |
if (handle_newcs_player (pl->ob)) |
245 |
flag = 1; |
246 |
} |
247 |
} |
248 |
|
249 |
for_all_players (pl) |
250 |
{ |
251 |
object *ob = pl->ob; |
252 |
|
253 |
if (expect_false (!ob || !pl->ns || !ob->active)) |
254 |
continue; |
255 |
|
256 |
do_some_living (ob); |
257 |
} |
258 |
} |
259 |
|
260 |
static void |
261 |
process_players2 () |
262 |
{ |
263 |
/* Then check if any players should use weapon-speed instead of speed */ |
264 |
for_all_players (pl) |
265 |
{ |
266 |
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 |
} |
269 |
} |
270 |
|
271 |
void |
272 |
process_events () |
273 |
{ |
274 |
process_players1 (); |
275 |
|
276 |
for_all_actives (op) |
277 |
{ |
278 |
/* Now process op */ |
279 |
if (expect_false (QUERY_FLAG (op, FLAG_FREED))) |
280 |
{ |
281 |
LOG (llevError, "BUG: process_events(): Free object on list\n"); |
282 |
op->set_speed (0); |
283 |
continue; |
284 |
} |
285 |
|
286 |
if (expect_false (!op->has_active_speed ())) |
287 |
{ |
288 |
LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
289 |
"but is on active list\n", op->debug_desc (), op->speed); |
290 |
op->set_speed (0); |
291 |
continue; |
292 |
} |
293 |
|
294 |
if (expect_false (op->flag [FLAG_REMOVED])) |
295 |
{ |
296 |
LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
297 |
op->debug_desc ()); |
298 |
op->set_speed (0); |
299 |
continue; |
300 |
} |
301 |
|
302 |
/* Animate the object. Bug or feature that anim_speed |
303 |
* is based on ticks, and not the creatures speed? |
304 |
*/ |
305 |
if (op->anim_speed && op->last_anim >= op->anim_speed) |
306 |
{ |
307 |
animate_object (op, op->contr ? op->facing : op->direction); |
308 |
op->last_anim = 1; |
309 |
} |
310 |
else |
311 |
++op->last_anim; |
312 |
|
313 |
if (expect_false (op->speed_left > 0.f)) |
314 |
{ |
315 |
--op->speed_left; |
316 |
process_object (op); |
317 |
} |
318 |
|
319 |
if (expect_true (!op->contr)) |
320 |
op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); |
321 |
} |
322 |
|
323 |
process_players2 (); |
324 |
} |
325 |
|
326 |
/* clean up everything before exiting */ |
327 |
void |
328 |
emergency_save () |
329 |
{ |
330 |
LOG (llevDebug, "emergency save begin.\n"); |
331 |
|
332 |
cfperl_emergency_save (); |
333 |
|
334 |
LOG (llevDebug, "saving book archive.\n"); |
335 |
write_book_archive (); |
336 |
|
337 |
LOG (llevDebug, "emergency save done.\n"); |
338 |
} |
339 |
|
340 |
// send all clients some informational text |
341 |
static void |
342 |
cleanup_inform (const char *cause, bool make_core) |
343 |
{ |
344 |
int flags = NDI_REPLY | NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
345 |
|
346 |
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 |
|
349 |
if (make_core) |
350 |
new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved."); |
351 |
else |
352 |
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 |
|
354 |
new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE); |
355 |
|
356 |
client::flush_sockets (); |
357 |
} |
358 |
|
359 |
/* clean up everything before exiting */ |
360 |
void |
361 |
cleanup (const char *cause, bool make_core) |
362 |
{ |
363 |
if (make_core) |
364 |
fork_abort (cause); |
365 |
|
366 |
LOG (llevError, "cleanup cause: %s\n", cause); |
367 |
|
368 |
if (!make_core) |
369 |
cleanup_inform (cause, make_core); |
370 |
|
371 |
LOG (llevDebug, "cleanup begin.\n"); |
372 |
|
373 |
if (init_done && !in_cleanup) |
374 |
{ |
375 |
in_cleanup = true; |
376 |
emergency_save (); |
377 |
} |
378 |
else |
379 |
in_cleanup = true; |
380 |
|
381 |
LOG (llevDebug, "running cleanup handlers.\n"); |
382 |
INVOKE_GLOBAL (CLEANUP); |
383 |
|
384 |
LOG (llevDebug, "cleanup done.\n"); |
385 |
|
386 |
log_cleanup (); |
387 |
|
388 |
if (make_core) |
389 |
cleanup_inform (cause, make_core); |
390 |
else |
391 |
{ |
392 |
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 |
client::flush_sockets (); |
395 |
} |
396 |
|
397 |
cfperl_cleanup (make_core); |
398 |
_exit (make_core); |
399 |
} |
400 |
|
401 |
/* |
402 |
* do_specials() is a collection of functions to call from time to time. |
403 |
* 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 |
void |
415 |
do_specials (void) |
416 |
{ |
417 |
shstr::gc (); |
418 |
archetype::gc (); |
419 |
|
420 |
if (expect_false (!(pticks % TICKS_PER_HOUR))) |
421 |
maptile::adjust_daylight (); |
422 |
|
423 |
if (expect_false (!(pticks % 2503))) |
424 |
fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
425 |
|
426 |
if (expect_false (!(pticks % 5003))) |
427 |
write_book_archive (); |
428 |
|
429 |
if (expect_false (!(pticks % 5009))) |
430 |
clean_friendly_list (); |
431 |
|
432 |
if (expect_false (!(pticks % 5011))) |
433 |
obsolete_parties (); |
434 |
|
435 |
if (expect_false (!(pticks % 12503))) |
436 |
fix_luck (); |
437 |
} |
438 |
|
439 |
void |
440 |
server_tick () |
441 |
{ |
442 |
// first do the user visible stuff |
443 |
INVOKE_GLOBAL (CLOCK); |
444 |
process_events (); // "do" something with objects with speed |
445 |
client::clock (); // draw client maps etc. |
446 |
|
447 |
// then do some bookkeeping, should not really be here |
448 |
do_specials (); /* Routines called from time to time. */ |
449 |
attachable::check_mortals (); |
450 |
|
451 |
++pticks; |
452 |
} |
453 |
|
454 |
#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 |
#if 0 // just goofing around, look elsewhere |
503 |
|
504 |
#include <malloc.h> |
505 |
#include <execinfo.h> |
506 |
|
507 |
static void tr_on (); |
508 |
static void tr_off (); |
509 |
|
510 |
static SMUTEX(tr_mutex); |
511 |
|
512 |
#define ltr_off() SMUTEX_LOCK (tr_mutex); tr_off () |
513 |
#define ltr_on() tr_on (); SMUTEX_UNLOCK (tr_mutex); |
514 |
|
515 |
static void * |
516 |
tr_malloc (size_t size, const void *caller) |
517 |
{ |
518 |
ltr_off (); |
519 |
|
520 |
void *bt [8]; |
521 |
backtrace (bt, 8); |
522 |
|
523 |
void *ptr = malloc (size); |
524 |
|
525 |
ltr_on (); |
526 |
return (char *)ptr; |
527 |
} |
528 |
|
529 |
static void |
530 |
tr_free (void *ptr, const void *caller) |
531 |
{ |
532 |
ltr_off (); |
533 |
|
534 |
free (ptr); |
535 |
|
536 |
ltr_on (); |
537 |
} |
538 |
|
539 |
void static * |
540 |
tr_realloc (void *ptr, size_t size, const void *caller) |
541 |
{ |
542 |
ltr_off (); |
543 |
|
544 |
void *nptr = realloc (ptr, size); |
545 |
|
546 |
ltr_on (); |
547 |
return nptr; |
548 |
} |
549 |
|
550 |
static void * |
551 |
tr_memalign (size_t size, size_t alignment, const void *caller) |
552 |
{ |
553 |
ltr_off (); |
554 |
|
555 |
void *ptr = memalign (size, alignment < 16 ? 16 : alignment); |
556 |
|
557 |
ltr_on (); |
558 |
return ptr; |
559 |
} |
560 |
|
561 |
static void |
562 |
tr_on () |
563 |
{ |
564 |
__malloc_hook = tr_malloc; |
565 |
__realloc_hook = tr_realloc; |
566 |
__free_hook = tr_free; |
567 |
__memalign_hook = tr_memalign; |
568 |
} |
569 |
|
570 |
static void |
571 |
tr_off () |
572 |
{ |
573 |
__malloc_hook = 0; |
574 |
__realloc_hook = 0; |
575 |
__free_hook = 0; |
576 |
__memalign_hook = 0; |
577 |
} |
578 |
|
579 |
void (*__malloc_initialize_hook)(void) = tr_on; |
580 |
|
581 |
#endif |
582 |
|
583 |
// normal main |
584 |
int |
585 |
main (int argc, char **argv) |
586 |
{ |
587 |
settings.argc = argc; |
588 |
settings.argv = argv; |
589 |
|
590 |
rndm.seed (time (0)); |
591 |
g_thread_init (0); // for the slice allocator only |
592 |
|
593 |
init (argc, argv); |
594 |
|
595 |
for (;;) |
596 |
cfperl_main (); |
597 |
} |
598 |
#endif |
599 |
|
600 |
#if 0 |
601 |
int xyzzy () |
602 |
{ |
603 |
return rndm(8); |
604 |
} |
605 |
|
606 |
void xyzzy (object_ptr &a, object_ptr &o) |
607 |
{ |
608 |
asm volatile ("int3"); |
609 |
a = o; |
610 |
asm volatile ("int3"); |
611 |
} |
612 |
#endif |
613 |
|