SDCC and malloc() - allocating much less memory than is available

Posted by Duncan Bayne on Stack Overflow See other posts from Stack Overflow or by Duncan Bayne
Published on 2013-06-27T23:29:35Z Indexed on 2013/07/02 23:06 UTC
Read the original article Hit count: 245

Filed under:

c

|

malloc

|

sdcc

|

retro-computing

|

amstrad

When I run compile this code with SDCC 3.1.0, and run it on an Amstrad CPC 464 (under emulation, with WinCPC 0.9.26 running on Wine):

void _test_malloc()
{
  long idx = 0;
  while (1)
    {
      if (malloc(5))
    {
      printf("%ld\r\n", ++idx);
    }
      else
    {
      printf("done");
      break;
    }
  }
}

... it consistently taps out at 92 malloc()s. I make that 460 bytes, which leads me to a couple of questions:

What is malloc() doing on this system? I was sort of hoping for an order of magnitude more storage even on a 64kB system
The behaviour is consistent on 64kB systems and 128kB systems; do I have to perform some sort of magic to access the additional memory, like manual bank switching?

Related posts about malloc

Malloc corrupting already malloc'd memory in C

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm currently helping a friend debug a program of his, which includes linked lists. His list structure is pretty simple: typedef struct nodo{ int cantUnos; char* numBin; struct nodo* sig; }Nodo; We've got the following code snippet: void insNodo(Nodo** lista, char* auxBin, int auxCantUnos){ … >>> More
Multidimensional array with unequal second dimension size using malloc()

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello, I am playing around with multidimensional array of unequal second dimension size. Lets assume that I need the following data structure: [&ptr0]-[0][1][2][3][4][5][6][7][8][9] [&ptr1]-[0][1][2] [&ptr2]-[0][1][2][3][4] int main() { int *a[3]; int *b; int i; a[0] = (int *)malloc(10… >>> More
Cannot understand how new or malloc does work with BYTE*

as seen on Stack Overflow - Search for 'Stack Overflow'
I trying to allocate memory for 10 bytes BYTE* tmp; tmp = new BYTE[10]; //or tmp = (BYTE*)malloc(10*sizeof(BYTE)); But after new or malloc operation length of *tmp more than 10 (i.e. '\0' char not in 10 position in tmp array) Why? >>> More
C Programming: malloc and free within a loop

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi all, I just started out with C and have very little knowledge about performance issues with malloc() and free(). My question is as such: if I were to call malloc() followed by free() in a while-loop that loops for, say, 20 times, would it run slower compared to if I were to call free() outside… >>> More
Wrapping malloc - C

as seen on Stack Overflow - Search for 'Stack Overflow'
I am a beginner in C. While reading git's source code, I found this wrapper function around malloc. void *xmalloc(size_t size) { void *ret = malloc(size); if (!ret && !size) ret = malloc(1); if (!ret) { release_pack_memory(size, -1); ret = malloc(size); … >>> More

Developer IT

SDCC and malloc() - allocating much less memory than is available - Developer IT

SDCC and malloc() - allocating much less memory than is available

c

malloc

sdcc

retro-computing

amstrad

Related posts about c

Related posts about malloc

Malloc corrupting already malloc'd memory in C

Multidimensional array with unequal second dimension size using malloc()

Cannot understand how new or malloc does work with BYTE*

C Programming: malloc and free within a loop

Wrapping malloc - C

Categories cloud