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-Thread: 103376,ed3a51e96a1c868b X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news3.google.com!feeder.news-service.com!weretis.net!feeder4.news.weretis.net!newsfeed.utanet.at!newsfeed01.chello.at!newsfeed.arcor.de!newsspool1.arcor-online.net!news.arcor.de.POSTED!not-for-mail Date: Thu, 24 Feb 2011 10:51:51 +0100 From: Georg Bauhaus User-Agent: Mozilla/5.0 (Macintosh; U; Intel Mac OS X 10.6; en-US; rv:1.9.2.14) Gecko/20110123 Thunderbird/3.1.8 MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Using local storage pools... References: <7elam6trrv39c3p9iop4fiduqa1jrat4r4@4ax.com> <1s8rimsarxcf5$.11o58i7ssmfic.dlg@40tude.net> <17i1ytb9bptzk$.1b6rl6rjp4p79.dlg@40tude.net> In-Reply-To: <17i1ytb9bptzk$.1b6rl6rjp4p79.dlg@40tude.net> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit Message-ID: <4d662a37$0$7659$9b4e6d93@newsspool1.arcor-online.net> Organization: Arcor NNTP-Posting-Date: 24 Feb 2011 10:51:51 CET NNTP-Posting-Host: eb7e1b8f.newsspool1.arcor-online.net X-Trace: DXC=fD4V`ILJPfg;iVb[J9ZZP`ic==]BZ:afn4Fo<]lROoRa<`=YMgDjhgbkkVBCm`oO1jPCY\c7>ejVhkBRIbHH`[D`aS On 2/24/11 10:26 AM, Dmitry A. Kazakov wrote: > On Wed, 23 Feb 2011 23:55:05 +0000, Brian Drummond wrote: > >> The other : the shootout rules explicitly disallow implementing your own pool. > > Huh: > > type Nodes_Arena is array (1..) of aliased Node; > Last_Allocated : Integer := 0; > > function Create return not null access Node is > begin > Last_Allocated := Last_Allocated + 1; > return Nodes_Arena (Last_Allocated)'Access; > end Create; > > This is it an implementation of arena. How can this be disallowed? "Each program should ... "allocate, walk, and deallocate many bottom-up binary trees * allocate a tree * walk the tree nodes, checksum the node items (and maybe deallocate the node) * deallocate the tree ... "Note: these programs are being measured with the default initial heap size - the measurements may be very different with a larger initial heap size or GC tuning. "Please don't implement your own custom memory pool or free list." "The binary-trees benchmark is a simplistic adaptation of Hans Boehm's GCBench, (http://www.hpl.hp.com/personal/Hans_Boehm/gc/gc_bench/applet/GCBench.java) which in turn was adapted from a benchmark by John Ellis and Pete Kovac." http://shootout.alioth.debian.org/u32/performance.php?test=binarytrees