Tek-Tips is the largest IT community on the Internet today!
Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!
-
Congratulations Mike Lewis on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!
Memory allocation in C
- Thread starter hecker
- Start date
As far as I know. Malloc allocates a continuous chunk of memory. But if you are making a linked list kind of thing. Then it is not necessary that all the nodes are contiguously allocated. <br><br>For eg, <br>int *p;<br>p = (int*)malloc(20* sizeof(int));<br>will allocate contigous memory of 20 integer bytes.<br>So that when you do p+n where n is >=0 and <20 . then you can traverse the next element (just like array).<br><br>Please let me know if I am wrong. <p>Siddhartha Singh<br><a href=mailto:siddhu_singh@hotmail.com>siddhu_singh@hotmail.com</a><br><a href=siddhu.freehosting.net> </a><br>
derekludwig
Programmer
As Sigghartha Singh stated:<br><br> <FONT FACE=monospace>p = (int*)malloc(20* sizeof(int));</font><br><br>will allocate a contiguous block of memory, as stated in the malloc(3C) manual page: <b>malloc</b>() and <b>free</b>() provide a simple general-purpose memory allocation package. <b>malloc</b>() returns a pointer to a block of at least size bytes suitably aligned for any use.<br><br>The one addition I wanted to make is that multiple blocks of memory allocated by malloc() are not necessarily contiguous. I've spent too many hours trying to debug a program because a programmer made this assumption.<br><br>-- Derek Ludwig [ <A HREF="mailto:derek@ludwig.com">derek@ludwig.com</A> ]
rotovegasBoy
Programmer
As Derek said the memory allocated by one call to malloc returns a contiguous chunk of memory. multiple calls means multiple chunks and to complicate things realloc generally will move the chunk around (actually new chunk with old data 
all these calls can cause memory fragmentation resulting in lots of spare memory but split into small unusable chunks. when you're repeatedly calling the malloc family it is iwse to allocate memory in large steps if possible (ie don't expand an array to hold one more integer when you know more will follow) this will make your programs more efficient.
all these calls can cause memory fragmentation resulting in lots of spare memory but split into small unusable chunks. when you're repeatedly calling the malloc family it is iwse to allocate memory in large steps if possible (ie don't expand an array to hold one more integer when you know more will follow) this will make your programs more efficient. - Thread starter
- #5
thats right but in case if we try to allocate a big chunk of memory using malloc which is larger than the available biggest contiguous free block in memory. What will happen in that case ? So can we be always sure that memory block returned by malloc is contiguous ?
Dear hecker,<br><br>You asked: <br><br>>So can we be always sure that memory block returned by malloc is contiguous ? <br><br>My understanding is, Yes. You can actually be denied a memory allocation (out of memory) if there is not a large enough contiguious block available.<br><br>Memory fragmentation is a somewhat complicated issue since compilers and operating systems handle this differently. For instance on some platforms you can use third party heap management systems that will specifically address memory fragmentation.<br><br>Also the nature of your application certainly may increase your exposure to this issue, for instance server processes that are expected to run unattended for long periods of time without being shut down.<br><br>"But, that's just my opinion... I could be wrong".<br>-pete
- Status
