1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
|
(***********************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * INRIA-Rocquencourt & LRI-CNRS-Orsay *)
(* \VV/ *************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(***********************************************************************)
(* $Id$ *)
open Gc
let word_length = Sys.word_size / 8
let int_size = Sys.word_size - 1
let float_of_time t = float_of_int t /. 100.
let time_of_float f = int_of_float (f *. 100.)
let get_time () =
let {Unix.tms_utime = ut;Unix.tms_stime = st} = Unix.times () in
time_of_float (ut +. st)
(* Since ocaml 3.01, gc statistics are in float *)
let get_alloc () =
(* If you are unlucky, a minor collection can occur between the *)
(* measurements and produces allocation; we trigger a minor *)
(* collection in advance to be sure the measure is not corrupted *)
Gc.minor ();
Gc.allocated_bytes ()
(* Rem: overhead was 16 bytes in ocaml 3.00 (long int) *)
(* Rem: overhead is 100 bytes in ocaml 3.01 (double) *)
let get_alloc_overhead =
let mark1 = get_alloc () in
let mark2 = get_alloc () in
let mark3 = get_alloc () in
(* If you are unlucky, a major collection can occur between the *)
(* measurements; with two measures the risk decreases *)
min (mark2 -. mark1) (mark3 -. mark2)
let last_alloc = ref 0.0 (* set by init_profile () *)
let spent_alloc () =
let now = get_alloc () in
let before = !last_alloc in
last_alloc := now;
now -. before -. get_alloc_overhead
(* Profile records *)
type profile_key = {
mutable owntime : int;
mutable tottime : int;
mutable ownalloc : float;
mutable totalloc : float;
mutable owncount : int;
mutable intcount : int;
mutable immcount : int;
}
let create_record () = {
owntime=0;
tottime=0;
ownalloc=0.0;
totalloc=0.0;
owncount=0;
intcount=0;
immcount=0
}
let ajoute_totalloc e dw = e.totalloc <- e.totalloc +. dw
let ajoute_ownalloc e dw = e.ownalloc <- e.ownalloc +. dw
let reset_record (n,e) =
e.owntime <- 0;
e.tottime <- 0;
e.ownalloc <- 0.0;
e.totalloc <- 0.0;
e.owncount <- 0;
e.intcount <- 0;
e.immcount <- 0
(* Profile tables *)
let prof_table = ref []
let stack = ref []
let init_time = ref 0
let init_alloc = ref 0.0
let reset_profile () = List.iter reset_record !prof_table
let init_profile () =
let outside = create_record () in
stack := [outside];
last_alloc := get_alloc ();
init_alloc := !last_alloc;
init_time := get_time ();
outside.tottime <- - !init_time;
outside.owntime <- - !init_time
let ajoute n o =
o.owntime <- o.owntime + n.owntime;
o.tottime <- o.tottime + n.tottime;
ajoute_ownalloc o n.ownalloc;
ajoute_totalloc o n.totalloc;
o.owncount <- o.owncount + n.owncount;
o.intcount <- o.intcount + n.intcount;
o.immcount <- o.immcount + n.immcount
let ajoute_to_list ((name,n) as e) l =
try ajoute n (List.assoc name l); l
with Not_found -> e::l
let magic = 1249
let merge_profile filename (curr_table, curr_outside, curr_total as new_data) =
let (old_table, old_outside, old_total) =
try
let c = open_in filename in
if input_binary_int c <> magic
then Printf.printf "Incompatible recording file: %s\n" filename;
let old_data = input_value c in
close_in c;
old_data
with Sys_error msg ->
(Printf.printf "Unable to open %s: %s\n" filename msg;
new_data) in
let updated_data =
let updated_table = List.fold_right ajoute_to_list curr_table old_table in
ajoute curr_outside old_outside;
ajoute curr_total old_total;
(updated_table, old_outside, old_total) in
begin
(try
let c =
open_out_gen
[Open_creat;Open_wronly;Open_trunc;Open_binary] 0o644 filename in
output_binary_int c magic;
output_value c updated_data;
close_out c
with Sys_error _ -> Printf.printf "Unable to create recording file");
updated_data
end
(************************************************)
(* Compute a rough estimation of time overheads *)
(* Time and space are not measured in the same way *)
(* Byte allocation is an exact number and for long runs, the total
number of allocated bytes may exceed the maximum integer capacity
(2^31 on 32-bits architectures); therefore, allocation is measured
by small steps, total allocations are computed by adding elementary
measures and carries are controled from step to step *)
(* Unix measure of time is approximative and shoitt delays are often
unperceivable; therefore, total times are measured in one (big)
step to avoid rounding errors and to get the best possible
approximation *)
(*
---------- start profile for f1
overheadA| ...
---------- [1w1] 1st call to get_time for f1
overheadB| ...
---------- start f1
real 1 | ...
---------- start profile for 1st call to f2 inside f1
overheadA| ...
---------- [2w1] 1st call to get_time for 1st f2
overheadB| ...
---------- start 1st f2
real 2 | ...
---------- end 1st f2
overheadC| ...
---------- [2w1] 2nd call to get_time for 1st f2
overheadD| ...
---------- end profile for 1st f2
real 1 | ...
---------- start profile for 2nd call to f2 inside f1
overheadA| ...
---------- [2'w1] 1st call to get_time for 2nd f2
overheadB| ...
---------- start 2nd f2
real 2' | ...
---------- end 2nd f2
overheadC| ...
---------- [2'w2] 2nd call to get_time for 2nd f2
overheadD| ...
---------- end profile for f2
real 1 | ...
---------- end f1
overheadC| ...
---------- [1w1'] 2nd call to get_time for f1
overheadD| ...
---------- end profile for f1
When profiling f2, overheadB + overheadC should be subtracted from measure
and overheadA + overheadB + overheadC + overheadD should be subtracted from
the amount for f1
Then the relevant overheads are :
"overheadB + overheadC" to be subtracted to the measure of f as many time as f is called and
"overheadA + overheadB + overheadC + overheadD" to be subtracted to
the measure of f as many time as f calls a profiled function (itself
included)
*)
let dummy_last_alloc = ref 0.0
let dummy_spent_alloc () =
let now = get_alloc () in
let before = !last_alloc in
last_alloc := now;
now -. before
let dummy_f x = x
let dummy_stack = ref [create_record ()]
let dummy_ov = 0
let loops = 10000
let time_overhead_A_D () =
let e = create_record () in
let before = get_time () in
for i=1 to loops do
(* This is a copy of profile1 for overhead estimation *)
let dw = dummy_spent_alloc () in
match !dummy_stack with [] -> assert false | p::_ ->
ajoute_ownalloc p dw;
ajoute_totalloc p dw;
e.owncount <- e.owncount + 1;
if not (p==e) then stack := e::!stack;
let totalloc0 = e.totalloc in
let intcount0 = e.intcount in
let dt = get_time () - 1 in
e.tottime <- dt + dummy_ov; e.owntime <- e.owntime + e.tottime;
ajoute_ownalloc p dw;
ajoute_totalloc p dw;
p.owntime <- p.owntime - e.tottime;
ajoute_totalloc p (e.totalloc-.totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !dummy_stack with [] -> assert false | _::s -> stack := s);
dummy_last_alloc := get_alloc ()
done;
let after = get_time () in
let beforeloop = get_time () in
for i=1 to loops do () done;
let afterloop = get_time () in
float_of_int ((after - before) - (afterloop - beforeloop))
/. float_of_int loops
let time_overhead_B_C () =
let dummy_x = 0 in
let before = get_time () in
for i=1 to loops do
try
dummy_last_alloc := get_alloc ();
let r = dummy_f dummy_x in
let dw = dummy_spent_alloc () in
let dt = get_time () in
()
with _ -> assert false
done;
let after = get_time () in
let beforeloop = get_time () in
for i=1 to loops do () done;
let afterloop = get_time () in
float_of_int ((after - before) - (afterloop - beforeloop))
/. float_of_int loops
let compute_alloc lo = lo /. (float_of_int word_length)
(************************************************)
(* End a profiling session and print the result *)
let format_profile (table, outside, total) =
print_newline ();
Printf.printf
"%-23s %9s %9s %10s %10s %10s\n"
"Function name" "Own time" "Tot. time" "Own alloc" "Tot. alloc" "Calls ";
let l = Sort.list (fun (_,{tottime=p}) (_,{tottime=p'}) -> p > p') table in
List.iter (fun (name,e) ->
Printf.printf
"%-23s %9.2f %9.2f %10.0f %10.0f %6d %6d\n"
name
(float_of_time e.owntime) (float_of_time e.tottime)
(compute_alloc e.ownalloc)
(compute_alloc e.totalloc)
e.owncount e.intcount)
l;
Printf.printf "%-23s %9.2f %9.2f %10.0f %10.0f %6d\n"
"others"
(float_of_time outside.owntime) (float_of_time outside.tottime)
(compute_alloc outside.ownalloc)
(compute_alloc outside.totalloc)
outside.intcount;
(* Here, own contains overhead time/alloc *)
Printf.printf "%-23s %9.2f %9.2f %10.0f %10.0f\n"
"Est. overhead/total"
(float_of_time total.owntime) (float_of_time total.tottime)
(compute_alloc total.ownalloc)
(compute_alloc total.totalloc);
Printf.printf
"Time in seconds and allocation in words (1 word = %d bytes)\n"
word_length
let recording_file = ref ""
let set_recording s = recording_file := s
let adjust_time ov_bc ov_ad e =
let bc_imm = float_of_int e.owncount *. ov_bc in
let ad_imm = float_of_int e.immcount *. ov_ad in
let abcd_all = float_of_int e.intcount *. (ov_ad +. ov_bc) in
{e with
tottime = e.tottime - int_of_float (abcd_all +. bc_imm);
owntime = e.owntime - int_of_float (ad_imm +. bc_imm) }
let close_profile print =
let dw = spent_alloc () in
let t = get_time () in
match !stack with
| [outside] ->
outside.tottime <- outside.tottime + t;
outside.owntime <- outside.owntime + t;
ajoute_ownalloc outside dw;
ajoute_totalloc outside dw;
if List.length !prof_table <> 0 then begin
let ov_bc = time_overhead_B_C () (* B+C overhead *) in
let ov_ad = time_overhead_A_D () (* A+D overhead *) in
let adjust (n,e) = (n, adjust_time ov_bc ov_ad e) in
let adjtable = List.map adjust !prof_table in
let adjoutside = adjust_time ov_bc ov_ad outside in
let totalloc = !last_alloc -. !init_alloc in
let total = create_record () in
total.tottime <- outside.tottime;
total.totalloc <- totalloc;
(* We compute estimations of overhead, put into "own" fields *)
total.owntime <- outside.tottime - adjoutside.tottime;
total.ownalloc <- totalloc -. outside.totalloc;
let current_data = (adjtable, adjoutside, total) in
let updated_data =
match !recording_file with
| "" -> current_data
| name -> merge_profile !recording_file current_data
in
if print then format_profile updated_data;
init_profile ()
end
| _ -> failwith "Inconsistency"
let append_profile () = close_profile false
let print_profile () = close_profile true
let declare_profile name =
if name = "___outside___" or name = "___total___" then
failwith ("Error: "^name^" is a reserved keyword");
let e = create_record () in
prof_table := (name,e)::!prof_table;
e
(* Default initialisation, may be overriden *)
let _ = init_profile ()
(******************************)
(* Entry points for profiling *)
let profile1 e f a =
let dw = spent_alloc () in
match !stack with [] -> assert false | p::_ ->
(* We add spent alloc since last measure to current caller own/total alloc *)
ajoute_ownalloc p dw;
ajoute_totalloc p dw;
e.owncount <- e.owncount + 1;
if not (p==e) then stack := e::!stack;
let totalloc0 = e.totalloc in
let intcount0 = e.intcount in
let t = get_time () in
try
last_alloc := get_alloc ();
let r = f a in
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
r
with exn ->
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
raise exn
let profile2 e f a b =
let dw = spent_alloc () in
match !stack with [] -> assert false | p::_ ->
(* We add spent alloc since last measure to current caller own/total alloc *)
ajoute_ownalloc p dw;
ajoute_totalloc p dw;
e.owncount <- e.owncount + 1;
if not (p==e) then stack := e::!stack;
let totalloc0 = e.totalloc in
let intcount0 = e.intcount in
let t = get_time () in
try
last_alloc := get_alloc ();
let r = f a b in
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
r
with exn ->
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
raise exn
let profile3 e f a b c =
let dw = spent_alloc () in
match !stack with [] -> assert false | p::_ ->
(* We add spent alloc since last measure to current caller own/total alloc *)
ajoute_ownalloc p dw;
ajoute_totalloc p dw;
e.owncount <- e.owncount + 1;
if not (p==e) then stack := e::!stack;
let totalloc0 = e.totalloc in
let intcount0 = e.intcount in
let t = get_time () in
try
last_alloc := get_alloc ();
let r = f a b c in
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
r
with exn ->
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
raise exn
let profile4 e f a b c d =
let dw = spent_alloc () in
match !stack with [] -> assert false | p::_ ->
(* We add spent alloc since last measure to current caller own/total alloc *)
ajoute_ownalloc p dw;
ajoute_totalloc p dw;
e.owncount <- e.owncount + 1;
if not (p==e) then stack := e::!stack;
let totalloc0 = e.totalloc in
let intcount0 = e.intcount in
let t = get_time () in
try
last_alloc := get_alloc ();
let r = f a b c d in
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
r
with exn ->
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
raise exn
let profile5 e f a b c d g =
let dw = spent_alloc () in
match !stack with [] -> assert false | p::_ ->
(* We add spent alloc since last measure to current caller own/total alloc *)
ajoute_ownalloc p dw;
ajoute_totalloc p dw;
e.owncount <- e.owncount + 1;
if not (p==e) then stack := e::!stack;
let totalloc0 = e.totalloc in
let intcount0 = e.intcount in
let t = get_time () in
try
last_alloc := get_alloc ();
let r = f a b c d g in
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
r
with exn ->
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
raise exn
let profile6 e f a b c d g h =
let dw = spent_alloc () in
match !stack with [] -> assert false | p::_ ->
(* We add spent alloc since last measure to current caller own/total alloc *)
ajoute_ownalloc p dw;
ajoute_totalloc p dw;
e.owncount <- e.owncount + 1;
if not (p==e) then stack := e::!stack;
let totalloc0 = e.totalloc in
let intcount0 = e.intcount in
let t = get_time () in
try
last_alloc := get_alloc ();
let r = f a b c d g h in
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
r
with exn ->
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
raise exn
let profile7 e f a b c d g h i =
let dw = spent_alloc () in
match !stack with [] -> assert false | p::_ ->
(* We add spent alloc since last measure to current caller own/total alloc *)
ajoute_ownalloc p dw;
ajoute_totalloc p dw;
e.owncount <- e.owncount + 1;
if not (p==e) then stack := e::!stack;
let totalloc0 = e.totalloc in
let intcount0 = e.intcount in
let t = get_time () in
try
last_alloc := get_alloc ();
let r = f a b c d g h i in
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
r
with exn ->
let dw = spent_alloc () in
let dt = get_time () - t in
e.tottime <- e.tottime + dt; e.owntime <- e.owntime + dt;
ajoute_ownalloc e dw;
ajoute_totalloc e dw;
p.owntime <- p.owntime - dt;
ajoute_totalloc p (e.totalloc -. totalloc0);
p.intcount <- p.intcount + e.intcount - intcount0 + 1;
p.immcount <- p.immcount + 1;
if not (p==e) then
(match !stack with [] -> assert false | _::s -> stack := s);
last_alloc := get_alloc ();
raise exn
(* Some utilities to compute the logical and physical sizes and depth
of ML objects *)
open Obj
let c = ref 0
let s = ref 0
let b = ref 0
let m = ref 0
let rec obj_stats d t =
if is_int t then m := max d !m
else if tag t >= no_scan_tag then
if tag t = string_tag then
(c := !c + size t; b := !b + 1; m := max d !m)
else if tag t = double_tag then
(s := !s + 2; b := !b + 1; m := max d !m)
else if tag t = double_array_tag then
(s := !s + 2 * size t; b := !b + 1; m := max d !m)
else (b := !b + 1; m := max d !m)
else
let n = Obj.size t in
s := !s + n; b := !b + 1;
block_stats (d + 1) (n - 1) t
and block_stats d i t =
if i >= 0 then (obj_stats d (field t i); block_stats d (i-1) t)
let obj_stats a =
c := 0; s:= 0; b:= 0; m:= 0;
obj_stats 0 (Obj.repr a);
(!c, !s + !b, !m)
module H = Hashtbl.Make(
struct
type t = Obj.t
let equal = (==)
let hash o = Hashtbl.hash (magic o : int)
end)
let tbl = H.create 13
let rec obj_shared_size s t =
if is_int t then s
else if H.mem tbl t then s
else begin
H.add tbl t ();
let n = Obj.size t in
if tag t >= no_scan_tag then
if tag t = string_tag then (c := !c + n; s + 1)
else if tag t = double_tag then s + 3
else if tag t = double_array_tag then s + 2 * n + 1
else s + 1
else
block_shared_size (s + n + 1) (n - 1) t
end
and block_shared_size s i t =
if i < 0 then s
else block_shared_size (obj_shared_size s (field t i)) (i-1) t
let obj_shared_size a =
H.clear tbl;
c := 0;
let s = obj_shared_size 0 (Obj.repr a) in
(s, !c)
let print_logical_stats a =
let (c, s, d) = obj_stats a in
Printf.printf "Expanded size: %10d (str: %8d) Depth: %6d\n" (s+c) c d
let print_stats a =
let (c1, s, d) = obj_stats a in
let (c2, o) = obj_shared_size a in
Printf.printf "Size: %8d (str: %8d) (exp: %10d) Depth: %6d\n"
(o + c2) c2 (s + c1) d
(*
let _ = Gc.set { (Gc.get()) with Gc.verbose = 13 }
*)
|