From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,a6c65cbc407987fe X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-11-18 08:44:07 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!news-FFM2.ecrc.net!news.iks-jena.de!not-for-mail From: Lutz Donnerhacke Newsgroups: comp.lang.ada Subject: Re: dynamic multithreading Date: Mon, 18 Nov 2002 16:44:07 +0000 (UTC) Organization: IKS GmbH Jena Message-ID: References: <3DD3D841.CD16A4CB@canal-plus.fr> <8MCB9.8643$8o1.1371873@news.xtra.co.nz> <3DD8AEAC.241AD1F8@canal-plus.fr> NNTP-Posting-Host: taranis.iks-jena.de X-Trace: branwen.iks-jena.de 1037637847 25533 217.17.192.37 (18 Nov 2002 16:44:07 GMT) X-Complaints-To: usenet@iks-jena.de NNTP-Posting-Date: Mon, 18 Nov 2002 16:44:07 +0000 (UTC) User-Agent: slrn/0.9.7.4 (Linux) Xref: archiver1.google.com comp.lang.ada:31057 Date: 2002-11-18T16:44:07+00:00 List-Id: * Preben Randhol wrote: > Lutz Donnerhacke wrote: >> Not necessary. This kind of "Garbage collection" is easy to implement: Free >> all allocated data assigned to variables of a specific type if this type >> goes out of space. > > But it doesn't make sense, because you can have two access variables. The current variables can be ignored. I write only about the type of them. > If the inner variable goes out of scope it should not free up the rest of > the objects. declare type A_Access is access A; a : A_Access := new A; -- Instance 1. begin a := new A; -- Instance 2: Leaks memory (Instance 1) declare b : A_Access := a; begin b := new A; -- Instance 3. a := b; -- Leaks memory (Instance 2) end; end; -- Frees all three instances. > I can understand if what you are talking about is a type with Finalize, > but then you need to call Free in the Finalize function. No, this not the Ada approach.