From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on inbox.vuxu.org X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=ham autolearn_force=no version=3.4.4 Received: (qmail 6842 invoked from network); 2 Aug 2021 04:43:54 -0000 Received: from 1ess.inri.net (216.126.196.35) by inbox.vuxu.org with ESMTPUTF8; 2 Aug 2021 04:43:54 -0000 Received: from mimir.eigenstate.org ([206.124.132.107]) by 1ess; Sun Aug 1 20:00:05 -0400 2021 Received: from abbatoir.myfiosgateway.com (pool-74-108-56-225.nycmny.fios.verizon.net [74.108.56.225]) by mimir.eigenstate.org (OpenSMTPD) with ESMTPSA id 959166d3 (TLSv1.2:ECDHE-RSA-AES256-SHA:256:NO) for <9front@9front.org>; Sun, 1 Aug 2021 16:53:09 -0700 (PDT) Message-ID: <92BC9BB66CE6AA73D2754A565F337131@eigenstate.org> To: 9front@9front.org Date: Sun, 01 Aug 2021 19:53:07 -0400 From: ori@eigenstate.org In-Reply-To: MIME-Version: 1.0 Content-Type: text/plain; charset="US-ASCII" Content-Transfer-Encoding: 7bit List-ID: <9front.9front.org> List-Help: X-Glyph: ➈ X-Bullshit: RESTful hardware cache-scale JSON software extension browser Subject: Re: [9front] make arrays big: qsort edition Reply-To: 9front@9front.org Precedence: bulk Quoth Nick Owens : > are you able to test this change with a very large array? Yes, but not easily. This is work towards fixing that. Here's a program that creates a large array using brk. #include #include extern char end[]; usize sorted; int intcmp(void *a, void *b) { sorted++; return *(int*)b-*(int*)a; } void main(int argc, char **argv) { usize n; int *p; n = 8ULL*1024*1024*1024; if(brk(end + sizeof(int)*n) == -1) sysfatal("brk: %r"); p = (void*)end; qsort(p, n, sizeof(int), intcmp); fprint(2, "%zd\n", sorted); }