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=-0.3 required=5.0 tests=BAYES_00, REPLYTO_WITHOUT_TO_CC autolearn=no 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!news4.google.com!feeder.news-service.com!feeder.news-service.com!216.196.110.144.MISMATCH!border3.nntp.ams.giganews.com!Xl.tags.giganews.com!border1.nntp.ams.giganews.com!nntp.giganews.com!local2.nntp.ams.giganews.com!nntp.bt.com!news.bt.com.POSTED!not-for-mail NNTP-Posting-Date: Wed, 23 Feb 2011 17:52:11 -0600 From: Brian Drummond Newsgroups: comp.lang.ada Subject: Re: Using local storage pools... Date: Wed, 23 Feb 2011 23:55:05 +0000 Reply-To: brian@shapes.demon.co.uk Message-ID: References: <7elam6trrv39c3p9iop4fiduqa1jrat4r4@4ax.com> <1s8rimsarxcf5$.11o58i7ssmfic.dlg@40tude.net> X-Newsreader: Forte Agent 1.7/32.534 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Usenet-Provider: http://www.giganews.com X-AuthenticatedUsername: NoAuthUser X-Trace: sv3-UOqGCk28Pqg0Lw3xgDXEb79DG5Xa4uu1lmwmQsVgCHTk71dH9cUjCsnPbkyQL+tSLtapC+iNriuPXvt!bA7QZOE2P0ADedR5N/PiL2Imcgn1rhD4Bciiej10lBMWckR/n8E3HWmuywn6ZYvPFVWE5tgQVEoa!8e8= X-Complaints-To: abuse@btinternet.com X-DMCA-Complaints-To: abuse@btinternet.com X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly X-Postfilter: 1.3.40 X-Original-Bytes: 2137 Xref: g2news1.google.com comp.lang.ada:17571 Date: 2011-02-23T23:55:05+00:00 List-Id: On Wed, 23 Feb 2011 21:42:49 +0100, "Dmitry A. Kazakov" wrote: >On Wed, 23 Feb 2011 19:01:22 +0000, Brian Drummond wrote: > >> I am trying to learn a little about storage pools, with a view to (hopefully) >> using local pools to improve the Binary_Trees benchmark in the same way as some >> of the faster C benchmarks. > >Why don't you implement an arena pool? It is a quite common technique to >allocate nodes of a tree in an arena and never deallocate them explicitly. >I am always use this for the nodes of the abstract syntax tree (AST). Note >that since arena never deallocates, allocation in arena becomes trivial. Two reasons : one trivial. The trivial one: I have never heard of arena pools until now! But that can be fixed. The other : the shootout rules explicitly disallow implementing your own pool. (But importing one from available libraries seems to be permitted; so is there a suitable candidate?) - Brian