1 ------------------------------------------------------------------------------
3 -- GNAT COMPILER COMPONENTS --
5 -- G N A T . D E B U G _ P O O L S --
9 -- Copyright (C) 1992-2004 Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 2, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
20 -- MA 02111-1307, USA. --
22 -- As a special exception, if other files instantiate generics from this --
23 -- unit, or you link this unit with other files to produce an executable, --
24 -- this unit does not by itself cause the resulting executable to be --
25 -- covered by the GNU General Public License. This exception does not --
26 -- however invalidate any other reasons why the executable file might be --
27 -- covered by the GNU Public License. --
29 -- GNAT was originally developed by the GNAT team at New York University. --
30 -- Extensive contributions were provided by Ada Core Technologies Inc. --
32 ------------------------------------------------------------------------------
34 with Ada
.Exceptions
.Traceback
;
35 with GNAT
.IO
; use GNAT
.IO
;
37 with System
.Address_Image
;
38 with System
.Memory
; use System
.Memory
;
39 with System
.Soft_Links
; use System
.Soft_Links
;
41 with System
.Traceback_Entries
; use System
.Traceback_Entries
;
44 with GNAT
.Traceback
; use GNAT
.Traceback
;
46 with Ada
.Unchecked_Conversion
;
48 package body GNAT
.Debug_Pools
is
50 use System
.Storage_Elements
;
52 Default_Alignment
: constant Storage_Offset
:= Standard
'Maximum_Alignment;
53 -- Alignment used for the memory chunks returned by Allocate. Using this
54 -- value garantees that this alignment will be compatible with all types
55 -- and at the same time makes it easy to find the location of the extra
56 -- header allocated for each chunk.
58 Initial_Memory_Size
: constant Storage_Offset
:= 2 ** 26; -- 64 Mb
59 -- Initial size of memory that the debug pool can handle. This is used to
60 -- compute the size of the htable used to monitor the blocks, but this is
61 -- dynamic and will grow as needed. Having a bigger size here means a
62 -- longer setup time, but less time spent later on to grow the array.
64 Max_Ignored_Levels
: constant Natural := 10;
65 -- Maximum number of levels that will be ignored in backtraces. This is so
66 -- that we still have enough significant levels in the tracebacks returned
68 -- The value 10 is chosen as being greater than the maximum callgraph
69 -- in this package. Its actual value is not really relevant, as long as it
70 -- is high enough to make sure we still have enough frames to return to
71 -- the user after we have hidden the frames internal to this package.
73 -----------------------
74 -- Tracebacks_Htable --
75 -----------------------
77 -- This package needs to store one set of tracebacks for each allocation
78 -- point (when was it allocated or deallocated). This would use too much
79 -- memory, so the tracebacks are actually stored in a hash table, and
80 -- we reference elements in this hash table instead.
82 -- This hash-table will remain empty if the discriminant Stack_Trace_Depth
83 -- for the pools is set to 0.
85 -- This table is a global table, that can be shared among all debug pools
88 type Header
is range 1 .. 1023;
89 -- Number of elements in the hash-table
91 type Tracebacks_Array_Access
92 is access GNAT
.Traceback
.Tracebacks_Array
;
94 type Traceback_Kind
is (Alloc
, Dealloc
, Indirect_Alloc
, Indirect_Dealloc
);
96 type Traceback_Htable_Elem
;
97 type Traceback_Htable_Elem_Ptr
98 is access Traceback_Htable_Elem
;
100 type Traceback_Htable_Elem
is record
101 Traceback
: Tracebacks_Array_Access
;
102 Kind
: Traceback_Kind
;
105 Next
: Traceback_Htable_Elem_Ptr
;
109 (E
: Traceback_Htable_Elem_Ptr
;
110 Next
: Traceback_Htable_Elem_Ptr
);
112 (E
: Traceback_Htable_Elem_Ptr
)
113 return Traceback_Htable_Elem_Ptr
;
115 (E
: Traceback_Htable_Elem_Ptr
)
116 return Tracebacks_Array_Access
;
117 function Hash
(T
: Tracebacks_Array_Access
) return Header
;
118 function Equal
(K1
, K2
: Tracebacks_Array_Access
) return Boolean;
119 pragma Inline
(Set_Next
, Next
, Get_Key
, Hash
);
120 -- Subprograms required for instantiation of the htable. See GNAT.HTable.
122 package Backtrace_Htable
is new GNAT
.HTable
.Static_HTable
123 (Header_Num
=> Header
,
124 Element
=> Traceback_Htable_Elem
,
125 Elmt_Ptr
=> Traceback_Htable_Elem_Ptr
,
127 Set_Next
=> Set_Next
,
129 Key
=> Tracebacks_Array_Access
,
134 -----------------------
135 -- Allocations table --
136 -----------------------
138 type Allocation_Header
;
139 type Allocation_Header_Access
is access Allocation_Header
;
141 -- The following record stores extra information that needs to be
142 -- memorized for each block allocated with the special debug pool.
144 type Traceback_Ptr_Or_Address
is new System
.Address
;
145 -- A type that acts as a C union, and is either a System.Address or a
146 -- Traceback_Htable_Elem_Ptr.
148 type Allocation_Header
is record
149 Allocation_Address
: System
.Address
;
150 -- Address of the block returned by malloc, possibly unaligned.
152 Block_Size
: Storage_Offset
;
153 -- Needed only for advanced freeing algorithms (traverse all allocated
154 -- blocks for potential references). This value is negated when the
155 -- chunk of memory has been logically freed by the application. This
156 -- chunk has not been physically released yet.
158 Alloc_Traceback
: Traceback_Htable_Elem_Ptr
;
159 Dealloc_Traceback
: Traceback_Ptr_Or_Address
;
160 -- Pointer to the traceback for the allocation (if the memory chunk is
161 -- still valid), or to the first deallocation otherwise. Make sure this
162 -- is a thin pointer to save space.
164 -- Dealloc_Traceback is also for blocks that are still allocated to
165 -- point to the previous block in the list. This saves space in this
166 -- header, and make manipulation of the lists of allocated pointers
169 Next
: System
.Address
;
170 -- Point to the next block of the same type (either allocated or
171 -- logically freed) in memory. This points to the beginning of the user
172 -- data, and does not include the header of that block.
175 function Header_Of
(Address
: System
.Address
)
176 return Allocation_Header_Access
;
177 pragma Inline
(Header_Of
);
178 -- Return the header corresponding to a previously allocated address
180 function To_Address
is new Ada
.Unchecked_Conversion
181 (Traceback_Ptr_Or_Address
, System
.Address
);
182 function To_Address
is new Ada
.Unchecked_Conversion
183 (System
.Address
, Traceback_Ptr_Or_Address
);
184 function To_Traceback
is new Ada
.Unchecked_Conversion
185 (Traceback_Ptr_Or_Address
, Traceback_Htable_Elem_Ptr
);
186 function To_Traceback
is new Ada
.Unchecked_Conversion
187 (Traceback_Htable_Elem_Ptr
, Traceback_Ptr_Or_Address
);
189 Header_Offset
: constant Storage_Count
190 := Default_Alignment
*
191 ((Allocation_Header
'Size / System
.Storage_Unit
+ Default_Alignment
- 1)
192 / Default_Alignment
);
193 -- Offset of user data after allocation header.
195 Minimum_Allocation
: constant Storage_Count
:=
196 Default_Alignment
- 1
198 -- Minimal allocation: size of allocation_header rounded up to next
199 -- multiple of default alignment + worst-case padding.
201 -----------------------
202 -- Allocations table --
203 -----------------------
205 -- This table is indexed on addresses modulo Default_Alignment, and
206 -- for each index it indicates whether that memory block is valid.
207 -- Its behavior is similar to GNAT.Table, except that we need to pack
208 -- the table to save space, so we cannot reuse GNAT.Table as is.
210 -- This table is the reason why all alignments have to be forced to a
211 -- common value (Default_Alignment), so that this table can be
212 -- kept to a reasonnable size.
214 type Byte
is mod 2 ** System
.Storage_Unit
;
216 Big_Table_Size
: constant Storage_Offset
:=
217 (Storage_Offset
'Last - 1) / Default_Alignment
;
218 type Big_Table
is array (0 .. Big_Table_Size
) of Byte
;
219 -- A simple, flat-array type used to access memory bytes (see the comment
220 -- for Valid_Blocks below).
222 -- It would be cleaner to represent this as a packed array of Boolean.
223 -- However, we cannot specify pragma Pack for such an array, since the
224 -- total size on a 64 bit machine would be too big (> Integer'Last).
226 -- Given an address, we know if it is under control of the debug pool if
227 -- the byte at index:
228 -- ((Address - Edata'Address) / Default_Alignment)
231 -- ((Address - Edata'Address) / Default_Alignment)
235 -- See the subprograms Is_Valid and Set_Valid for proper manipulation of
238 type Table_Ptr
is access Big_Table
;
239 function To_Pointer
is new Ada
.Unchecked_Conversion
240 (System
.Address
, Table_Ptr
);
242 Valid_Blocks
: Table_Ptr
:= null;
243 Valid_Blocks_Size
: Storage_Offset
:= 0;
244 -- These two variables represents a mapping of the currently allocated
245 -- memory. Every time the pool works on an address, we first check that the
246 -- index Address / Default_Alignment is True. If not, this means that this
247 -- address is not under control of the debug pool, and thus this is
248 -- probably an invalid memory access (it could also be a general access
251 -- Note that in fact we never allocate the full size of Big_Table, only a
252 -- slice big enough to manage the currently allocated memory.
254 Edata
: System
.Address
:= System
.Null_Address
;
255 -- Address in memory that matches the index 0 in Valid_Blocks. It is named
256 -- after the symbol _edata, which, on most systems, indicate the lowest
257 -- possible address returned by malloc. Unfortunately, this symbol
258 -- doesn't exist on windows, so we cannot use it instead of this variable.
260 -----------------------
261 -- Local subprograms --
262 -----------------------
264 function Find_Or_Create_Traceback
266 Kind
: Traceback_Kind
;
267 Size
: Storage_Count
;
268 Ignored_Frame_Start
: System
.Address
;
269 Ignored_Frame_End
: System
.Address
)
270 return Traceback_Htable_Elem_Ptr
;
271 -- Return an element matching the current traceback (omitting the frames
272 -- that are in the current package). If this traceback already existed in
273 -- the htable, a pointer to this is returned to spare memory. Null is
274 -- returned if the pool is set not to store tracebacks. If the traceback
275 -- already existed in the table, the count is incremented so that
276 -- Dump_Tracebacks returns useful results.
277 -- All addresses up to, and including, an address between
278 -- Ignored_Frame_Start .. Ignored_Frame_End are ignored.
282 Traceback
: Tracebacks_Array_Access
;
283 Ignored_Frame_Start
: System
.Address
:= System
.Null_Address
;
284 Ignored_Frame_End
: System
.Address
:= System
.Null_Address
);
285 -- Print Traceback to Standard_Output. If Traceback is null, print the
286 -- call_chain at the current location, up to Depth levels, ignoring all
287 -- addresses up to the first one in the range
288 -- Ignored_Frame_Start .. Ignored_Frame_End
290 function Is_Valid
(Storage
: System
.Address
) return Boolean;
291 pragma Inline
(Is_Valid
);
292 -- Return True if Storage is an address that the debug pool has under its
295 procedure Set_Valid
(Storage
: System
.Address
; Value
: Boolean);
296 pragma Inline
(Set_Valid
);
297 -- Mark the address Storage as being under control of the memory pool (if
298 -- Value is True), or not (if Value is False). This procedure will
299 -- reallocate the table Valid_Blocks as needed.
301 procedure Set_Dead_Beef
302 (Storage_Address
: System
.Address
;
303 Size_In_Storage_Elements
: Storage_Count
);
304 -- Set the contents of the memory block pointed to by Storage_Address to
305 -- the 16#DEADBEEF# pattern. If Size_In_Storage_Elements is not a multiple
306 -- of the length of this pattern, the last instance may be partial.
308 procedure Free_Physically
(Pool
: in out Debug_Pool
);
309 -- Start to physically release some memory to the system, until the amount
310 -- of logically (but not physically) freed memory is lower than the
311 -- expected amount in Pool.
313 procedure Allocate_End
;
314 procedure Deallocate_End
;
315 procedure Dereference_End
;
316 -- These procedures are used as markers when computing the stacktraces,
317 -- so that addresses in the debug pool itself are not reported to the user.
319 Code_Address_For_Allocate_End
: System
.Address
;
320 Code_Address_For_Deallocate_End
: System
.Address
;
321 Code_Address_For_Dereference_End
: System
.Address
;
322 -- Taking the address of the above procedures will not work on some
323 -- architectures (HPUX and VMS for instance). Thus we do the same thing
324 -- that is done in a-except.adb, and get the address of labels instead
326 procedure Skip_Levels
328 Trace
: Tracebacks_Array
;
330 Len
: in out Natural;
331 Ignored_Frame_Start
: System
.Address
;
332 Ignored_Frame_End
: System
.Address
);
333 -- Set Start .. Len to the range of values from Trace that should be output
334 -- to the user. This range of values exludes any address prior to the first
335 -- one in Ignored_Frame_Start .. Ignored_Frame_End (basically addresses
336 -- internal to this package). Depth is the number of levels that the user
343 function Header_Of
(Address
: System
.Address
)
344 return Allocation_Header_Access
346 function Convert
is new Ada
.Unchecked_Conversion
347 (System
.Address
, Allocation_Header_Access
);
349 return Convert
(Address
- Header_Offset
);
357 (E
: Traceback_Htable_Elem_Ptr
;
358 Next
: Traceback_Htable_Elem_Ptr
)
369 (E
: Traceback_Htable_Elem_Ptr
)
370 return Traceback_Htable_Elem_Ptr
380 function Equal
(K1
, K2
: Tracebacks_Array_Access
) return Boolean is
381 use Ada
.Exceptions
.Traceback
;
383 return K1
.all = K2
.all;
391 (E
: Traceback_Htable_Elem_Ptr
)
392 return Tracebacks_Array_Access
402 function Hash
(T
: Tracebacks_Array_Access
) return Header
is
403 Result
: Integer_Address
:= 0;
405 for X
in T
'Range loop
406 Result
:= Result
+ To_Integer
(PC_For
(T
(X
)));
408 return Header
(1 + Result
mod Integer_Address
(Header
'Last));
417 Traceback
: Tracebacks_Array_Access
;
418 Ignored_Frame_Start
: System
.Address
:= System
.Null_Address
;
419 Ignored_Frame_End
: System
.Address
:= System
.Null_Address
)
421 procedure Print
(Tr
: Tracebacks_Array
);
422 -- Print the traceback to standard_output
428 procedure Print
(Tr
: Tracebacks_Array
) is
430 for J
in Tr
'Range loop
431 Put
("0x" & Address_Image
(PC_For
(Tr
(J
))) & ' ');
436 -- Start of processing for Put_Line
439 if Traceback
= null then
441 Tr
: aliased Tracebacks_Array
(1 .. Depth
+ Max_Ignored_Levels
);
442 Start
, Len
: Natural;
445 Call_Chain
(Tr
, Len
);
446 Skip_Levels
(Depth
, Tr
, Start
, Len
,
447 Ignored_Frame_Start
, Ignored_Frame_End
);
448 Print
(Tr
(Start
.. Len
));
452 Print
(Traceback
.all);
460 procedure Skip_Levels
462 Trace
: Tracebacks_Array
;
464 Len
: in out Natural;
465 Ignored_Frame_Start
: System
.Address
;
466 Ignored_Frame_End
: System
.Address
)
469 Start
:= Trace
'First;
472 and then (PC_For
(Trace
(Start
)) < Ignored_Frame_Start
473 or else PC_For
(Trace
(Start
)) > Ignored_Frame_End
)
480 -- Just in case: make sure we have a traceback even if Ignore_Till
487 if Len
- Start
+ 1 > Depth
then
488 Len
:= Depth
+ Start
- 1;
492 ------------------------------
493 -- Find_Or_Create_Traceback --
494 ------------------------------
496 function Find_Or_Create_Traceback
498 Kind
: Traceback_Kind
;
499 Size
: Storage_Count
;
500 Ignored_Frame_Start
: System
.Address
;
501 Ignored_Frame_End
: System
.Address
)
502 return Traceback_Htable_Elem_Ptr
505 if Pool
.Stack_Trace_Depth
= 0 then
510 Trace
: aliased Tracebacks_Array
511 (1 .. Integer (Pool
.Stack_Trace_Depth
) + Max_Ignored_Levels
);
512 Len
, Start
: Natural;
513 Elem
: Traceback_Htable_Elem_Ptr
;
516 Call_Chain
(Trace
, Len
);
517 Skip_Levels
(Pool
.Stack_Trace_Depth
, Trace
, Start
, Len
,
518 Ignored_Frame_Start
, Ignored_Frame_End
);
520 -- Check if the traceback is already in the table.
523 Backtrace_Htable
.Get
(Trace
(Start
.. Len
)'Unrestricted_Access);
528 Elem
:= new Traceback_Htable_Elem
'
529 (Traceback => new Tracebacks_Array'(Trace
(Start
.. Len
)),
532 Total
=> Byte_Count
(Size
),
534 Backtrace_Htable
.Set
(Elem
);
537 Elem
.Count
:= Elem
.Count
+ 1;
538 Elem
.Total
:= Elem
.Total
+ Byte_Count
(Size
);
543 end Find_Or_Create_Traceback
;
549 function Is_Valid
(Storage
: System
.Address
) return Boolean is
550 Offset
: constant Storage_Offset
:=
551 (Storage
- Edata
) / Default_Alignment
;
553 Bit
: constant Byte
:= 2 ** Natural (Offset
mod System
.Storage_Unit
);
556 return (Storage
mod Default_Alignment
) = 0
558 and then Offset
< Valid_Blocks_Size
* Storage_Unit
559 and then (Valid_Blocks
(Offset
/ Storage_Unit
) and Bit
) /= 0;
566 procedure Set_Valid
(Storage
: System
.Address
; Value
: Boolean) is
567 Offset
: Storage_Offset
;
569 Bytes
: Storage_Offset
;
570 Tmp
: constant Table_Ptr
:= Valid_Blocks
;
572 Edata_Align
: constant Storage_Offset
:=
573 Default_Alignment
* Storage_Unit
;
575 procedure Memset
(A
: Address
; C
: Integer; N
: size_t
);
576 pragma Import
(C
, Memset
, "memset");
578 procedure Memmove
(Dest
, Src
: Address
; N
: size_t
);
579 pragma Import
(C
, Memmove
, "memmove");
582 -- Allocate, or reallocate, the valid blocks table as needed. We start
583 -- with a size big enough to handle Initial_Memory_Size bytes of memory,
584 -- to avoid too many reallocations. The table will typically be around
585 -- 16Mb in that case, which is still small enough.
587 if Valid_Blocks_Size
= 0 then
588 Valid_Blocks_Size
:= (Initial_Memory_Size
/ Default_Alignment
)
590 Valid_Blocks
:= To_Pointer
(Alloc
(size_t
(Valid_Blocks_Size
)));
593 -- Reset the memory using memset, which is much faster than the
594 -- standard Ada code with "when others"
596 Memset
(Valid_Blocks
.all'Address, 0, size_t
(Valid_Blocks_Size
));
599 -- First case : the new address is outside of the current scope of
600 -- Valid_Blocks, before the current start address. We need to reallocate
601 -- the table accordingly. This should be a rare occurence, since in most
602 -- cases, the first allocation will also have the lowest address. But
603 -- there is no garantee...
605 if Storage
< Edata
then
607 -- The difference between the new Edata and the current one must be
608 -- a multiple of Default_Alignment * Storage_Unit, so that the bit
609 -- representing an address in Valid_Blocks are kept the same.
611 Offset
:= ((Edata
- Storage
) / Edata_Align
+ 1) * Edata_Align
;
612 Offset
:= Offset
/ Default_Alignment
;
613 Bytes
:= Offset
/ Storage_Unit
;
615 To_Pointer
(Alloc
(Size
=> size_t
(Valid_Blocks_Size
+ Bytes
)));
616 Memmove
(Dest
=> Valid_Blocks
.all'Address + Bytes
,
617 Src
=> Tmp
.all'Address,
618 N
=> size_t
(Valid_Blocks_Size
));
619 Memset
(A
=> Valid_Blocks
.all'Address,
621 N
=> size_t
(Bytes
));
622 Free
(Tmp
.all'Address);
623 Valid_Blocks_Size
:= Valid_Blocks_Size
+ Bytes
;
625 -- Take into the account the new start address
626 Edata
:= Storage
- Edata_Align
+ (Edata
- Storage
) mod Edata_Align
;
629 -- Second case : the new address is outside of the current scope of
630 -- Valid_Blocks, so we have to grow the table as appropriate
632 Offset
:= (Storage
- Edata
) / Default_Alignment
;
634 if Offset
>= Valid_Blocks_Size
* System
.Storage_Unit
then
635 Bytes
:= Valid_Blocks_Size
;
638 exit when Offset
<= Bytes
* System
.Storage_Unit
;
641 Valid_Blocks
:= To_Pointer
642 (Realloc
(Ptr
=> Valid_Blocks
.all'Address,
643 Size
=> size_t
(Bytes
)));
645 (Valid_Blocks
.all'Address + Valid_Blocks_Size
,
647 size_t
(Bytes
- Valid_Blocks_Size
));
648 Valid_Blocks_Size
:= Bytes
;
651 Bit
:= 2 ** Natural (Offset
mod System
.Storage_Unit
);
652 Bytes
:= Offset
/ Storage_Unit
;
654 -- Then set the value as valid
657 Valid_Blocks
(Bytes
) := Valid_Blocks
(Bytes
) or Bit
;
659 Valid_Blocks
(Bytes
) := Valid_Blocks
(Bytes
) and (not Bit
);
668 (Pool
: in out Debug_Pool
;
669 Storage_Address
: out Address
;
670 Size_In_Storage_Elements
: Storage_Count
;
671 Alignment
: Storage_Count
)
673 pragma Unreferenced
(Alignment
);
674 -- Ignored, we always force 'Default_Alignment
676 type Local_Storage_Array
is new Storage_Array
677 (1 .. Size_In_Storage_Elements
+ Minimum_Allocation
);
679 type Ptr
is access Local_Storage_Array
;
680 -- On some systems, we might want to physically protect pages
681 -- against writing when they have been freed (of course, this is
682 -- expensive in terms of wasted memory). To do that, all we should
683 -- have to do it to set the size of this array to the page size.
688 Current
: Byte_Count
;
689 Trace
: Traceback_Htable_Elem_Ptr
;
695 -- If necessary, start physically releasing memory. The reason this is
696 -- done here, although Pool.Logically_Deallocated has not changed above,
697 -- is so that we do this only after a series of deallocations (e.g a
698 -- loop that deallocates a big array). If we were doing that in
699 -- Deallocate, we might be physically freeing memory several times
700 -- during the loop, which is expensive.
702 if Pool
.Logically_Deallocated
>
703 Byte_Count
(Pool
.Maximum_Logically_Freed_Memory
)
705 Free_Physically
(Pool
);
708 -- Use standard (ie through malloc) allocations. This automatically
709 -- raises Storage_Error if needed. We also try once more to physically
710 -- release memory, so that even marked blocks, in the advanced scanning,
714 P
:= new Local_Storage_Array
;
717 when Storage_Error
=>
718 Free_Physically
(Pool
);
719 P
:= new Local_Storage_Array
;
722 Storage_Address
:= System
.Null_Address
+ Default_Alignment
723 * (((P
.all'Address + Default_Alignment
- 1) - System
.Null_Address
)
726 pragma Assert
((Storage_Address
- System
.Null_Address
)
727 mod Default_Alignment
= 0);
728 pragma Assert
(Storage_Address
+ Size_In_Storage_Elements
729 <= P
.all'Address + P
'Length);
731 Trace
:= Find_Or_Create_Traceback
732 (Pool
, Alloc
, Size_In_Storage_Elements
,
733 Allocate_Label
'Address, Code_Address_For_Allocate_End
);
735 pragma Warnings
(Off
);
736 -- Turn warning on alignment for convert call off. We know that in
737 -- fact this conversion is safe since P itself is always aligned on
738 -- Default_Alignment.
740 Header_Of
(Storage_Address
).all :=
741 (Allocation_Address
=> P
.all'Address,
742 Alloc_Traceback
=> Trace
,
743 Dealloc_Traceback
=> To_Traceback
(null),
744 Next
=> Pool
.First_Used_Block
,
745 Block_Size
=> Size_In_Storage_Elements
);
747 pragma Warnings
(On
);
749 -- Link this block in the list of used blocks. This will be used to list
750 -- memory leaks in Print_Info, and for the advanced schemes of
751 -- Physical_Free, where we want to traverse all allocated blocks and
752 -- search for possible references.
754 -- We insert in front, since most likely we'll be freeing the most
755 -- recently allocated blocks first (the older one might stay allocated
756 -- for the whole life of the application).
758 if Pool
.First_Used_Block
/= System
.Null_Address
then
759 Header_Of
(Pool
.First_Used_Block
).Dealloc_Traceback
:=
760 To_Address
(Storage_Address
);
763 Pool
.First_Used_Block
:= Storage_Address
;
765 -- Mark the new address as valid
767 Set_Valid
(Storage_Address
, True);
769 -- Update internal data
772 Pool
.Allocated
+ Byte_Count
(Size_In_Storage_Elements
);
774 Current
:= Pool
.Allocated
-
775 Pool
.Logically_Deallocated
-
776 Pool
.Physically_Deallocated
;
778 if Current
> Pool
.High_Water
then
779 Pool
.High_Water
:= Current
;
794 -- DO NOT MOVE, this must be right after Allocate. This is similar to
795 -- what is done in a-except, so that we can hide the traceback frames
796 -- internal to this package
798 procedure Allocate_End
is
800 <<Allocate_End_Label
>>
801 Code_Address_For_Allocate_End
:= Allocate_End_Label
'Address;
808 procedure Set_Dead_Beef
809 (Storage_Address
: System
.Address
;
810 Size_In_Storage_Elements
: Storage_Count
)
812 Dead_Bytes
: constant := 4;
814 type Data
is mod 2 ** (Dead_Bytes
* 8);
815 for Data
'Size use Dead_Bytes
* 8;
817 Dead
: constant Data
:= 16#DEAD_BEEF#
;
819 type Dead_Memory
is array
820 (1 .. Size_In_Storage_Elements
/ Dead_Bytes
) of Data
;
821 type Mem_Ptr
is access Dead_Memory
;
823 type Byte
is mod 2 ** 8;
826 type Dead_Memory_Bytes
is array (0 .. 2) of Byte
;
827 type Dead_Memory_Bytes_Ptr
is access Dead_Memory_Bytes
;
829 function From_Ptr
is new Ada
.Unchecked_Conversion
830 (System
.Address
, Mem_Ptr
);
832 function From_Ptr
is new Ada
.Unchecked_Conversion
833 (System
.Address
, Dead_Memory_Bytes_Ptr
);
835 M
: constant Mem_Ptr
:= From_Ptr
(Storage_Address
);
836 M2
: Dead_Memory_Bytes_Ptr
;
837 Modulo
: constant Storage_Count
:=
838 Size_In_Storage_Elements
mod Dead_Bytes
;
840 M
.all := (others => Dead
);
842 -- Any bytes left (up to three of them)
845 M2
:= From_Ptr
(Storage_Address
+ M
'Length * Dead_Bytes
);
858 ---------------------
859 -- Free_Physically --
860 ---------------------
862 procedure Free_Physically
(Pool
: in out Debug_Pool
) is
863 type Byte
is mod 256;
864 type Byte_Access
is access Byte
;
866 function To_Byte
is new Ada
.Unchecked_Conversion
867 (System
.Address
, Byte_Access
);
869 type Address_Access
is access System
.Address
;
871 function To_Address_Access
is new Ada
.Unchecked_Conversion
872 (System
.Address
, Address_Access
);
874 In_Use_Mark
: constant Byte
:= 16#D#
;
875 Free_Mark
: constant Byte
:= 16#F#
;
877 Total_Freed
: Storage_Count
:= 0;
879 procedure Reset_Marks
;
880 -- Unmark all the logically freed blocks, so that they are considered
881 -- for physical deallocation
884 (H
: Allocation_Header_Access
; A
: System
.Address
; In_Use
: Boolean);
885 -- Mark the user data block starting at A. For a block of size zero,
886 -- nothing is done. For a block with a different size, the first byte
887 -- is set to either "D" (in use) or "F" (free).
889 function Marked
(A
: System
.Address
) return Boolean;
890 -- Return true if the user data block starting at A might be in use
893 procedure Mark_Blocks
;
894 -- Traverse all allocated blocks, and search for possible references
895 -- to logically freed blocks. Mark them appropriately
897 procedure Free_Blocks
(Ignore_Marks
: Boolean);
898 -- Physically release blocks. Only the blocks that haven't been marked
899 -- will be released, unless Ignore_Marks is true.
905 procedure Free_Blocks
(Ignore_Marks
: Boolean) is
906 Header
: Allocation_Header_Access
;
907 Tmp
: System
.Address
:= Pool
.First_Free_Block
;
908 Next
: System
.Address
;
909 Previous
: System
.Address
:= System
.Null_Address
;
912 while Tmp
/= System
.Null_Address
913 and then Total_Freed
< Pool
.Minimum_To_Free
915 Header
:= Header_Of
(Tmp
);
917 -- If we know, or at least assume, the block is no longer
918 -- reference anywhere, we can free it physically.
920 if Ignore_Marks
or else not Marked
(Tmp
) then
923 pragma Suppress
(All_Checks
);
924 -- Suppress the checks on this section. If they are overflow
925 -- errors, it isn't critical, and we'd rather avoid a
926 -- Constraint_Error in that case.
928 -- Note that block_size < zero for freed blocks
930 Pool
.Physically_Deallocated
:=
931 Pool
.Physically_Deallocated
-
932 Byte_Count
(Header
.Block_Size
);
934 Pool
.Logically_Deallocated
:=
935 Pool
.Logically_Deallocated
+
936 Byte_Count
(Header
.Block_Size
);
938 Total_Freed
:= Total_Freed
- Header
.Block_Size
;
942 System
.Memory
.Free
(Header
.Allocation_Address
);
943 Set_Valid
(Tmp
, False);
945 -- Remove this block from the list.
947 if Previous
= System
.Null_Address
then
948 Pool
.First_Free_Block
:= Next
;
950 Header_Of
(Previous
).Next
:= Next
;
967 (H
: Allocation_Header_Access
;
972 if H
.Block_Size
/= 0 then
974 To_Byte
(A
).all := In_Use_Mark
;
976 To_Byte
(A
).all := Free_Mark
;
985 procedure Mark_Blocks
is
986 Tmp
: System
.Address
:= Pool
.First_Used_Block
;
987 Previous
: System
.Address
;
988 Last
: System
.Address
;
989 Pointed
: System
.Address
;
990 Header
: Allocation_Header_Access
;
993 -- For each allocated block, check its contents. Things that look
994 -- like a possible address are used to mark the blocks so that we try
995 -- and keep them, for better detection in case of invalid access.
996 -- This mechanism is far from being fool-proof: it doesn't check the
997 -- stacks of the threads, doesn't check possible memory allocated not
998 -- under control of this debug pool. But it should allow us to catch
1001 while Tmp
/= System
.Null_Address
loop
1003 Last
:= Tmp
+ Header_Of
(Tmp
).Block_Size
;
1004 while Previous
< Last
loop
1005 -- ??? Should we move byte-per-byte, or consider that addresses
1006 -- are always aligned on 4-bytes boundaries ? Let's use the
1009 Pointed
:= To_Address_Access
(Previous
).all;
1010 if Is_Valid
(Pointed
) then
1011 Header
:= Header_Of
(Pointed
);
1013 -- Do not even attempt to mark blocks in use. That would
1014 -- screw up the whole application, of course.
1015 if Header
.Block_Size
< 0 then
1016 Mark
(Header
, Pointed
, In_Use
=> True);
1020 Previous
:= Previous
+ System
.Address
'Size;
1023 Tmp
:= Header_Of
(Tmp
).Next
;
1031 function Marked
(A
: System
.Address
) return Boolean is
1033 return To_Byte
(A
).all = In_Use_Mark
;
1040 procedure Reset_Marks
is
1041 Current
: System
.Address
:= Pool
.First_Free_Block
;
1042 Header
: Allocation_Header_Access
;
1045 while Current
/= System
.Null_Address
loop
1046 Header
:= Header_Of
(Current
);
1047 Mark
(Header
, Current
, False);
1048 Current
:= Header
.Next
;
1052 -- Start of processing for Free_Physically
1057 if Pool
.Advanced_Scanning
then
1058 Reset_Marks
; -- Reset the mark for each freed block
1062 Free_Blocks
(Ignore_Marks
=> not Pool
.Advanced_Scanning
);
1064 -- The contract is that we need to free at least Minimum_To_Free bytes,
1065 -- even if this means freeing marked blocks in the advanced scheme
1067 if Total_Freed
< Pool
.Minimum_To_Free
1068 and then Pool
.Advanced_Scanning
1070 Pool
.Marked_Blocks_Deallocated
:= True;
1071 Free_Blocks
(Ignore_Marks
=> True);
1080 end Free_Physically
;
1086 procedure Deallocate
1087 (Pool
: in out Debug_Pool
;
1088 Storage_Address
: Address
;
1089 Size_In_Storage_Elements
: Storage_Count
;
1090 Alignment
: Storage_Count
)
1092 pragma Unreferenced
(Alignment
);
1094 Header
: constant Allocation_Header_Access
:=
1095 Header_Of
(Storage_Address
);
1097 Previous
: System
.Address
;
1100 <<Deallocate_Label
>>
1102 Valid
:= Is_Valid
(Storage_Address
);
1106 if Pool
.Raise_Exceptions
then
1107 raise Freeing_Not_Allocated_Storage
;
1109 Put
("error: Freeing not allocated storage, at ");
1110 Put_Line
(Pool
.Stack_Trace_Depth
, null,
1111 Deallocate_Label
'Address,
1112 Code_Address_For_Deallocate_End
);
1115 elsif Header
.Block_Size
< 0 then
1117 if Pool
.Raise_Exceptions
then
1118 raise Freeing_Deallocated_Storage
;
1120 Put
("error: Freeing already deallocated storage, at ");
1121 Put_Line
(Pool
.Stack_Trace_Depth
, null,
1122 Deallocate_Label
'Address,
1123 Code_Address_For_Deallocate_End
);
1124 Put
(" Memory already deallocated at ");
1125 Put_Line
(0, To_Traceback
(Header
.Dealloc_Traceback
).Traceback
);
1129 -- Remove this block from the list of used blocks.
1132 To_Address
(Header_Of
(Storage_Address
).Dealloc_Traceback
);
1134 if Previous
= System
.Null_Address
then
1135 Pool
.First_Used_Block
:= Header_Of
(Pool
.First_Used_Block
).Next
;
1137 if Pool
.First_Used_Block
/= System
.Null_Address
then
1138 Header_Of
(Pool
.First_Used_Block
).Dealloc_Traceback
:=
1139 To_Traceback
(null);
1143 Header_Of
(Previous
).Next
:= Header_Of
(Storage_Address
).Next
;
1145 if Header_Of
(Storage_Address
).Next
/= System
.Null_Address
then
1147 (Header_Of
(Storage_Address
).Next
).Dealloc_Traceback
:=
1148 To_Address
(Previous
);
1152 -- Update the header
1155 (Allocation_Address
=> Header
.Allocation_Address
,
1156 Alloc_Traceback
=> Header
.Alloc_Traceback
,
1157 Dealloc_Traceback
=> To_Traceback
1158 (Find_Or_Create_Traceback
1160 Size_In_Storage_Elements
,
1161 Deallocate_Label
'Address,
1162 Code_Address_For_Deallocate_End
)),
1163 Next
=> System
.Null_Address
,
1164 Block_Size
=> -Size_In_Storage_Elements
);
1166 if Pool
.Reset_Content_On_Free
then
1167 Set_Dead_Beef
(Storage_Address
, Size_In_Storage_Elements
);
1170 Pool
.Logically_Deallocated
:=
1171 Pool
.Logically_Deallocated
+
1172 Byte_Count
(Size_In_Storage_Elements
);
1174 -- Link this free block with the others (at the end of the list, so
1175 -- that we can start releasing the older blocks first later on).
1177 if Pool
.First_Free_Block
= System
.Null_Address
then
1178 Pool
.First_Free_Block
:= Storage_Address
;
1179 Pool
.Last_Free_Block
:= Storage_Address
;
1182 Header_Of
(Pool
.Last_Free_Block
).Next
:= Storage_Address
;
1183 Pool
.Last_Free_Block
:= Storage_Address
;
1186 -- Do not physically release the memory here, but in Alloc.
1187 -- See comment there for details.
1198 --------------------
1199 -- Deallocate_End --
1200 --------------------
1202 -- DO NOT MOVE, this must be right after Deallocate
1205 procedure Deallocate_End
is
1207 <<Deallocate_End_Label
>>
1208 Code_Address_For_Deallocate_End
:= Deallocate_End_Label
'Address;
1215 procedure Dereference
1216 (Pool
: in out Debug_Pool
;
1217 Storage_Address
: Address
;
1218 Size_In_Storage_Elements
: Storage_Count
;
1219 Alignment
: Storage_Count
)
1221 pragma Unreferenced
(Alignment
, Size_In_Storage_Elements
);
1223 Valid
: constant Boolean := Is_Valid
(Storage_Address
);
1224 Header
: Allocation_Header_Access
;
1227 -- Locking policy: we do not do any locking in this procedure. The
1228 -- tables are only read, not written to, and although a problem might
1229 -- appear if someone else is modifying the tables at the same time, this
1230 -- race condition is not intended to be detected by this storage_pool (a
1231 -- now invalid pointer would appear as valid). Instead, we prefer
1232 -- optimum performance for dereferences.
1234 <<Dereference_Label
>>
1237 if Pool
.Raise_Exceptions
then
1238 raise Accessing_Not_Allocated_Storage
;
1240 Put
("error: Accessing not allocated storage, at ");
1241 Put_Line
(Pool
.Stack_Trace_Depth
, null,
1242 Dereference_Label
'Address,
1243 Code_Address_For_Dereference_End
);
1247 Header
:= Header_Of
(Storage_Address
);
1249 if Header
.Block_Size
< 0 then
1250 if Pool
.Raise_Exceptions
then
1251 raise Accessing_Deallocated_Storage
;
1253 Put
("error: Accessing deallocated storage, at ");
1255 (Pool
.Stack_Trace_Depth
, null,
1256 Dereference_Label
'Address,
1257 Code_Address_For_Dereference_End
);
1258 Put
(" First deallocation at ");
1259 Put_Line
(0, To_Traceback
(Header
.Dealloc_Traceback
).Traceback
);
1265 ---------------------
1266 -- Dereference_End --
1267 ---------------------
1269 -- DO NOT MOVE: this must be right after Dereference
1272 procedure Dereference_End
is
1274 <<Dereference_End_Label
>>
1275 Code_Address_For_Dereference_End
:= Dereference_End_Label
'Address;
1276 end Dereference_End
;
1282 procedure Print_Info
1284 Cumulate
: Boolean := False;
1285 Display_Slots
: Boolean := False;
1286 Display_Leaks
: Boolean := False)
1288 use System
.Storage_Elements
;
1290 package Backtrace_Htable_Cumulate
is new GNAT
.HTable
.Static_HTable
1291 (Header_Num
=> Header
,
1292 Element
=> Traceback_Htable_Elem
,
1293 Elmt_Ptr
=> Traceback_Htable_Elem_Ptr
,
1295 Set_Next
=> Set_Next
,
1297 Key
=> Tracebacks_Array_Access
,
1301 -- This needs a comment ??? probably some of the ones below do too???
1303 Data
: Traceback_Htable_Elem_Ptr
;
1304 Elem
: Traceback_Htable_Elem_Ptr
;
1305 Current
: System
.Address
;
1306 Header
: Allocation_Header_Access
;
1311 ("Total allocated bytes : " &
1312 Byte_Count
'Image (Pool
.Allocated
));
1315 ("Total logically deallocated bytes : " &
1316 Byte_Count
'Image (Pool
.Logically_Deallocated
));
1319 ("Total physically deallocated bytes : " &
1320 Byte_Count
'Image (Pool
.Physically_Deallocated
));
1322 if Pool
.Marked_Blocks_Deallocated
then
1323 Put_Line
("Marked blocks were physically deallocated. This is");
1324 Put_Line
("potentially dangereous, and you might want to run");
1325 Put_Line
("again with a lower value of Minimum_To_Free");
1329 ("Current Water Mark: " &
1331 (Pool
.Allocated
- Pool
.Logically_Deallocated
1332 - Pool
.Physically_Deallocated
));
1335 ("High Water Mark: " &
1336 Byte_Count
'Image (Pool
.High_Water
));
1340 if Display_Slots
then
1341 Data
:= Backtrace_Htable
.Get_First
;
1342 while Data
/= null loop
1343 if Data
.Kind
in Alloc
.. Dealloc
then
1345 new Traceback_Htable_Elem
'
1346 (Traceback => new Tracebacks_Array'(Data
.Traceback
.all),
1347 Count
=> Data
.Count
,
1349 Total
=> Data
.Total
,
1351 Backtrace_Htable_Cumulate
.Set
(Elem
);
1354 if Data
.Kind
= Alloc
then
1355 K
:= Indirect_Alloc
;
1357 K
:= Indirect_Dealloc
;
1360 -- Propagate the direct call to all its parents
1362 for T
in Data
.Traceback
'First + 1 .. Data
.Traceback
'Last loop
1363 Elem
:= Backtrace_Htable_Cumulate
.Get
1365 (T
.. Data
.Traceback
'Last)'Unrestricted_Access);
1367 -- If not, insert it
1370 Elem
:= new Traceback_Htable_Elem
'
1371 (Traceback => new Tracebacks_Array'
1372 (Data
.Traceback
(T
.. Data
.Traceback
'Last)),
1373 Count
=> Data
.Count
,
1375 Total
=> Data
.Total
,
1377 Backtrace_Htable_Cumulate
.Set
(Elem
);
1379 -- Properly take into account that the subprograms
1380 -- indirectly called might be doing either allocations
1381 -- or deallocations. This needs to be reflected in the
1385 Elem
.Count
:= Elem
.Count
+ Data
.Count
;
1387 if K
= Elem
.Kind
then
1388 Elem
.Total
:= Elem
.Total
+ Data
.Total
;
1390 elsif Elem
.Total
> Data
.Total
then
1391 Elem
.Total
:= Elem
.Total
- Data
.Total
;
1395 Elem
.Total
:= Data
.Total
- Elem
.Total
;
1401 Data
:= Backtrace_Htable
.Get_Next
;
1405 Put_Line
("List of allocations/deallocations: ");
1407 Data
:= Backtrace_Htable_Cumulate
.Get_First
;
1408 while Data
/= null loop
1410 when Alloc
=> Put
("alloc (count:");
1411 when Indirect_Alloc
=> Put
("indirect alloc (count:");
1412 when Dealloc
=> Put
("free (count:");
1413 when Indirect_Dealloc
=> Put
("indirect free (count:");
1416 Put
(Natural'Image (Data
.Count
) & ", total:" &
1417 Byte_Count
'Image (Data
.Total
) & ") ");
1419 for T
in Data
.Traceback
'Range loop
1420 Put
("0x" & Address_Image
(PC_For
(Data
.Traceback
(T
))) & ' ');
1425 Data
:= Backtrace_Htable_Cumulate
.Get_Next
;
1428 Backtrace_Htable_Cumulate
.Reset
;
1431 if Display_Leaks
then
1433 Put_Line
("List of not deallocated blocks:");
1435 -- Do not try to group the blocks with the same stack traces
1436 -- together. This is done by the gnatmem output.
1438 Current
:= Pool
.First_Used_Block
;
1439 while Current
/= System
.Null_Address
loop
1440 Header
:= Header_Of
(Current
);
1442 Put
("Size: " & Storage_Count
'Image (Header
.Block_Size
) & " at: ");
1444 for T
in Header
.Alloc_Traceback
.Traceback
'Range loop
1445 Put
("0x" & Address_Image
1446 (PC_For
(Header
.Alloc_Traceback
.Traceback
(T
))) & ' ');
1450 Current
:= Header
.Next
;
1459 function Storage_Size
(Pool
: Debug_Pool
) return Storage_Count
is
1460 pragma Unreferenced
(Pool
);
1463 return Storage_Count
'Last;
1471 (Pool
: in out Debug_Pool
;
1472 Stack_Trace_Depth
: Natural := Default_Stack_Trace_Depth
;
1473 Maximum_Logically_Freed_Memory
: SSC
:= Default_Max_Freed
;
1474 Minimum_To_Free
: SSC
:= Default_Min_Freed
;
1475 Reset_Content_On_Free
: Boolean := Default_Reset_Content
;
1476 Raise_Exceptions
: Boolean := Default_Raise_Exceptions
;
1477 Advanced_Scanning
: Boolean := Default_Advanced_Scanning
)
1480 Pool
.Stack_Trace_Depth
:= Stack_Trace_Depth
;
1481 Pool
.Maximum_Logically_Freed_Memory
:= Maximum_Logically_Freed_Memory
;
1482 Pool
.Reset_Content_On_Free
:= Reset_Content_On_Free
;
1483 Pool
.Raise_Exceptions
:= Raise_Exceptions
;
1484 Pool
.Minimum_To_Free
:= Minimum_To_Free
;
1485 Pool
.Advanced_Scanning
:= Advanced_Scanning
;
1492 procedure Print_Pool
(A
: System
.Address
) is
1493 Storage
: constant Address
:= A
;
1494 Valid
: constant Boolean := Is_Valid
(Storage
);
1495 Header
: Allocation_Header_Access
;
1498 -- We might get Null_Address if the call from gdb was done
1499 -- incorrectly. For instance, doing a "print_pool(my_var)" passes 0x0,
1500 -- instead of passing the value of my_var
1502 if A
= System
.Null_Address
then
1503 Put_Line
("Memory not under control of the storage pool");
1508 Put_Line
("Memory not under control of the storage pool");
1511 Header
:= Header_Of
(Storage
);
1512 Put_Line
("0x" & Address_Image
(A
)
1513 & " allocated at:");
1514 Put_Line
(0, Header
.Alloc_Traceback
.Traceback
);
1516 if To_Traceback
(Header
.Dealloc_Traceback
) /= null then
1517 Put_Line
("0x" & Address_Image
(A
)
1518 & " logically freed memory, deallocated at:");
1519 Put_Line
(0, To_Traceback
(Header
.Dealloc_Traceback
).Traceback
);
1524 -----------------------
1525 -- Print_Info_Stdout --
1526 -----------------------
1528 procedure Print_Info_Stdout
1530 Cumulate
: Boolean := False;
1531 Display_Slots
: Boolean := False;
1532 Display_Leaks
: Boolean := False)
1534 procedure Internal
is new Print_Info
1535 (Put_Line
=> GNAT
.IO
.Put_Line
,
1536 Put
=> GNAT
.IO
.Put
);
1539 Internal
(Pool
, Cumulate
, Display_Slots
, Display_Leaks
);
1540 end Print_Info_Stdout
;
1546 procedure Dump_Gnatmem
(Pool
: Debug_Pool
; File_Name
: String) is
1547 type File_Ptr
is new System
.Address
;
1549 function fopen
(Path
: String; Mode
: String) return File_Ptr
;
1550 pragma Import
(C
, fopen
);
1553 (Ptr
: System
.Address
;
1563 pragma Import
(C
, fwrite
);
1565 procedure fputc
(C
: Integer; Stream
: File_Ptr
);
1566 pragma Import
(C
, fputc
);
1568 procedure fclose
(Stream
: File_Ptr
);
1569 pragma Import
(C
, fclose
);
1571 Address_Size
: constant size_t
:=
1572 System
.Address
'Max_Size_In_Storage_Elements;
1573 -- Size in bytes of a pointer
1576 Current
: System
.Address
;
1577 Header
: Allocation_Header_Access
;
1578 Actual_Size
: size_t
;
1579 Num_Calls
: Integer;
1580 Tracebk
: Tracebacks_Array_Access
;
1583 File
:= fopen
(File_Name
& ASCII
.NUL
, "wb" & ASCII
.NUL
);
1584 fwrite
("GMEM DUMP" & ASCII
.LF
, 10, 1, File
);
1586 -- List of not deallocated blocks (see Print_Info)
1588 Current
:= Pool
.First_Used_Block
;
1589 while Current
/= System
.Null_Address
loop
1590 Header
:= Header_Of
(Current
);
1592 Actual_Size
:= size_t
(Header
.Block_Size
);
1593 Tracebk
:= Header
.Alloc_Traceback
.Traceback
;
1594 Num_Calls
:= Tracebk
'Length;
1596 -- Code taken from memtrack.adb in GNAT's sources
1597 -- Logs allocation call
1599 -- 'A' <mem addr> <size chunk> <len backtrace> <addr1> ... <addrn>
1601 fputc
(Character'Pos ('A'), File
);
1602 fwrite
(Current
'Address, Address_Size
, 1, File
);
1603 fwrite
(Actual_Size
'Address, size_t
'Max_Size_In_Storage_Elements, 1,
1605 fwrite
(Num_Calls
'Address, Integer'Max_Size_In_Storage_Elements, 1,
1608 for J
in Tracebk
'First .. Tracebk
'First + Num_Calls
- 1 loop
1610 Ptr
: System
.Address
:= PC_For
(Tracebk
(J
));
1612 fwrite
(Ptr
'Address, Address_Size
, 1, File
);
1616 Current
:= Header
.Next
;
1626 end GNAT
.Debug_Pools
;