Malloc, return address order.

[Manu]

Hello,

Can we say that the return addresses from the various malloc function
calls, in a program, will always be in a predefined order (increasing
or decreasing, depeding on how the heap is managed) ?

regards
Manu

 

[Keith Thompson]

Can we say that the return addresses from the various malloc function
calls, in a program, will always be in a predefined order (increasing
or decreasing, depeding on how the heap is managed) ?

No.

 

[Richard Tobin]

Can we say that the return addresses from the various malloc function
calls, in a program, will always be in a predefined order (increasing
or decreasing, depeding on how the heap is managed) ?

No. Even supposing your implementation happened to allocate memory
sequentially (which is not required, and many implementations don't),
what do you think would happen after you freed some memory? The point
of freeing it is so that it can be used again.

-- Richard

 

[=?ISO-8859-1?Q?=22Nils_O=2E_Sel=E5sdal=22?=]

Hello,

Can we say that the return addresses from the various malloc function
calls, in a program, will always be in a predefined order (increasing
or decreasing, depeding on how the heap is managed) ?

Not at all.

 

[Rod Pemberton]

No.

What no OT complaint about 'heap'?

Specifically, memory paging and memory or heap reuse almost guarantees that
the answer is "No."


Rod Pemberton