Copyright (C) 1994, Digital Equipment Corporation |All rights reserved. | See the file COPYRIGHT for a full description. | | Last modified on Mon Jul 24 10:19:29 PDT 1995 by detlefs | modified on Fri Nov 18 17:32:30 PST 1994 by kalsow | modified on Sun Feb 21 14:18:42 PST 1993 by jdd | modified on Tue Jun 16 10:41:17 PDT 1992 by muller | modified on Mon Jun 8 11:25:23 PDT 1992 by meehan
RTutils
provides information on the heap. This interface is subject
to change without notice.
INTERFACERTutils ; TYPE HeapPresentation = { ByTypecode, ByNumber, ByByteCount }; PROCEDURE Heap (suppressZeros := FALSE; presentation := HeapPresentation.ByTypecode; byTypeHierarchy := FALSE; window := LAST(INTEGER));
This prints a table of all the known types and some simple statistics about them (count, total size in bytes for all such objects, average size). IfsuppressZeros
is true, then nothing will be printed for a type that has no instances in the heap. Thepresentation
argument controls the order in which types appear:ByTypeCode
indicates that types are printed in ascending typecode order,ByNumber
indicates they are presented in order of decreasing count, andByByteCount
indicates that they are printed in order of decreasing space usage. ThebyTypeHierarchy
controls whether a separate report detailing the contents of the heap by the subtype relation is printed. That is, if object typesB
andC
are (the only) subtypes ofA
, this report would include a line forA
aggregating the numbers forB
andC
. Thewindow
arguments limits how many types are printed. The table is printed on stderr using RTIO.
PROCEDURE NewHeap (suppressZeros := TRUE; presentation := HeapPresentation.ByTypecode; byTypeHierarchy := FALSE; window := LAST(INTEGER));
This prints only the incremental information since the last call to Heap
or NewHeap. The arguments have the same meaning as in Heap.
END RTutils.