[Git][ghc/ghc][master] testsuite: Drop testheapalloced.c

[Marge Bot (@marge-bot)]

Marge Bot pushed to branch master at Glasgow Haskell Compiler / GHC


Commits:
5f17e21a by Ben Gamari at 2023-01-11T00:57:27-05:00
testsuite: Drop testheapalloced.c

As noted in #22414, this file (which appears to be a benchmark for
characterising the one-step allocator's MBlock cache) is currently 
unreferenced. Remove it.

Closes #22414. 
- - - - -


1 changed file:

- − testsuite/tests/rts/testheapalloced.c


Changes:

=====================================
testsuite/tests/rts/testheapalloced.c deleted
=====================================
@@ -1,100 +0,0 @@
-#include "Rts.h"
-#include "RtsFlags.h"
-#if defined(DEBUG)
-#define INLINE_HEADER
-#endif
-#include "MBlock.h"
-#if defined(DEBUG)
-extern void *getFirstMBlock(void);
-extern void *getNextMBlock(void *mblock);
-#endif
-
-#include <stdio.h>
-#include <string.h>
-
-extern bdescr *allocGroup_lock_lock(uint32_t n);
-extern void freeGroup_lock(bdescr *p);
-
-const int ARRSIZE  = 2000;
-const int LOOPS    = 20000;
-const int MAXALLOC = ((8 * 1024 * 1024) / BLOCK_SIZE - 1);
-//const int MAXALLOC = ((4 * 1024 * 1024) / BLOCK_SIZE - 1);
-const int SEED     = 0xf00f00;
-
-extern StgWord mblocks_allocated;
-
-int main (int argc, char *argv[])
-{
-    int i, j, b;
-
-    bdescr *a[ARRSIZE];
-
-    srand(SEED);
-
-    hs_init(&argc, &argv);
-
-    memset(a, 0, ARRSIZE * sizeof(bdescr*));
-
-    for (i=0; i < LOOPS; i++)
-    {
-        j = rand() % ARRSIZE;
-        if (a[j]) { freeGroup_lock(a[j]); }
-        a[j] = allocGroup_lock(rand() % MAXALLOC + 1);
-    }
-
-#if defined(DEBUG)
-    {
-        void *p;
-        i = 0;
-        for (p = getFirstMBlock(); p != NULL; p = getNextMBlock(p))
-        {
-            if (!HEAP_ALLOCED(p)) barf("%p",p);
-            i++;
-        }
-        printf("%d\n", i);
-    }
-#endif
-
-    {
-        void *p, *base;
-
-        j = 0;
-        base = RtsFlags.GcFlags.heapBase;
-        
-        for (i=0; i < LOOPS*2000; i++)
-        {
-            // this is for testing: generate random addresses anywhere
-            // in the address space.
-            //
-            // 48 bits is: 0x800000000000 - 0x7fffffffffff
-            // so ((StgInt)rand() >> 4) varies between -2^27 and 2^27-1.
-            // and << 20 of this is a random signed 48-bit megablock address
-            //
-            // p = (void*)((StgWord)((StgInt)rand() >> 4) << 20);
-
-            // this is for benchmarking: roughly half of these
-            // addresses will be in the heap.
-            p = base + (((StgWord)rand() << 10) % 
-                        ((StgWord)ARRSIZE * MAXALLOC * BLOCK_SIZE));
-
-            if (HEAP_ALLOCED(p)) {
-                // printf("%p\n",p);
-                j++;
-            }
-        }
-        printf("%d\n", j);
-    }
-
-    printf("misses: %ld, %ld%%\n", mpc_misses, mpc_misses / (LOOPS*20));
-
-    for (i=0; i < ARRSIZE; i++)
-    {
-        if (a[i]) { freeGroup_lock(a[i]); }
-    }
-
-    hs_exit(); // will do a memory leak test
-
-    exit(0);
-}
-
-// 48 bits is: 0x800000000000 - 0x7fffffffffff



View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/5f17e21af6368ec0e615af7de714a3194181f46a

-- 
View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/5f17e21af6368ec0e615af7de714a3194181f46a
You're receiving this email because of your account on gitlab.haskell.org.


-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/ghc-commits/attachments/20230111/dd7b6eb9/attachment-0001.html>