Re: Memory Useage

[mhamel_98@yahoo.com]

On Jun 9, 1:25 am, Niklas Holsti <niklas.hol...@nospam.please> wrote:
> mhamel...@yahoo.com wrote:
> > Hello c.l.a.  Another question, I have a program that stores data on
> > the disk using sequential_io.  When I later read that data into an
> > array, the memory growth after ingesting a file is much much larger
> > than the disk footprint.  A file that takes 26.8MB on disk (over 134k
> > records) causes the program to swell by over 600MB!  Holy bloatware.
> > A short overview of what I'm trying to do - each sequential_io data
> > file has an associated header file with stuff like number of records,
> > etc.  The header is read, and an array is then created based on how
> > many records are said to be in the data file.  The data file is then
> > read, sticking a node into the array.  Some abbreviated code below,
> > the spec:
>
> > generic
> >   type Node_Type is private;
> > package Node_Manager is
>
> >   package Seq is new Sequential_Io (Node_Type);
>
> >   type Node_Array is array (positive range <>) of Node_Type;
> >   type Node_Ptr is access Node_Array;
>
> Is the actual type for Node_Type a record type with variants? If so, is
> the size of the largest variant much larger than the size of the most
> common variants? I don't know about ObjectAda, but in GNAT the
> Node_Array would have a size that lets you store the largest variant in
> every array element, while the Node_Type objects stored in the
> sequential_io file probably use only as much file-space as the actual
> variant of each object requires.
>
> The solution in GNAT would be to allocate storage for each Node_Type
> object separately and have an array of accesses:
>
>     type Node_Ptr is access Node_Type;
>     type Node_Array is array (positive range <>) of Node_Ptr;
>     type Node_Array_Ptr is access Node_Array;
>
> This increases memory overhead by allocating more blocks from the heap,
> but it may reduce the overall memory requirement if the largest variant
> of Node_Type is much larger than the average variant.
>
> --
> Niklas Holsti
> Tidorum Ltd
> niklas holsti tidorum fi
>        .      @       .- Hide quoted text -
>
> - Show quoted text -

Hi Niklas, no variant records, that's the first question a few other
people asked as well though!

Anyhoo, good news, bad news.  Good news is, this bit of code isn't the
source of the bloat.  The bad news is what is causing it is an
instantiation (several instantiations actually) of a generic Double-
Linked-List package.  Well, back to the drawing board...