Segmentation fault on large array sizes

Question

The following code gives me a segmentation fault when run on a 2Gb machine, but works on a 4GB machine.

int main()
{
   int c[1000000];
   cout << "done\n";
   return 0;
}

The size of the array is just 4Mb. Is there a limit on the size of an array that can be used in c++?

Answer 1

You're probably just getting a stack overflow here. The array is too big to fit in your program's stack address space.

If you allocate the array on the heap you should be fine, assuming your machine has enough memory.

int* array = new int[1000000];

But remember that this will require you to delete[] the array. An even better solution would be to use std::vector<int> and resize it to 1000000 elements.

Answer 2

You array is being allocated on the stack in this case attempt to allocate an array of the same size using alloc.

Answer 3

In C or C++ local objects are usually allocated on the stack. You are allocating something large on the stack, more than the stack can handle, so you are getting a STACKOVERFLOW.

Don't allocate it local on stack, use some other place instead. This can be achived by making the object global. Global variables are fine, if you don't use the from any other compilation unit. To make sure, this doesn't happen by accident, add a static storage specifier.

This will allocate in the BSS segment, which is a part of the heap:

static int c[1000000];
int main()
{
   cout << "done\n";
   return 0;
}

This will allocate in the DATA segment, which is a part of the heap too:

int c[1000000] = {};
int main()
{
   cout << "done\n";
   return 0;
}

This will allocate somwhere unspecified in the heap:

int main()
{
   int* c = new int[1000000];
   cout << "done\n";
   return 0;
}