This question already has answers here:
Explain the concept of a stack frame in a nutshell
(6 answers)
What is an application binary interface (ABI)?
(17 answers)
Closed 2 years ago.
Speaking of the order of parameters, return addresses, local variables and other block statements, how are they pushed inside the stack frame and how that particular order works? I'm having a bit of trouble understanding this concept.
Related
This question already has answers here:
Can someone explain hex offsets to me?
(6 answers)
Closed 8 years ago.
I'm trying to understand what an offset in a hex dump is. In particular, what purpose does an offset serve? I have googled many times but not found anything.
The offset describes where something is in the file. You can obtain and jump to offsets in code using lseek(2) or fseek(3), depending on which I/O system you're using.
This question already has answers here:
How can I store a value at a specific location in the memory?
(4 answers)
Closed 8 years ago.
Is is possible to directly store data into a memory location using C ?
To be more specific,
What if i want to store an integer data to a memory location starting from 00100000. Is it possible ?
Yes it is. You can do this: int*ptr = 00100000; And then do *(ptr) = 10; I highly recommend you don't do this however.
This question already has answers here:
what is meant by normalization in huge pointers
(3 answers)
Closed 9 years ago.
Actually i was studying about huge and far pointers.
I come to know huge pointers are by default in normalized form.
I want to know how can we normalize any pointer?
The huge pointer and far pointer are old concept which live in 16-bit
DOS time. You can search something about DOS programming for more
detail about them.
In 8086 programming (MS DOS), a far pointer is normalized if its offset part is between 0 and 15 (0xF).
This question already has answers here:
Why are two different concepts both called "heap"? [duplicate]
(9 answers)
What is a Memory Heap?
(8 answers)
Closed 9 years ago.
Can anyone explain why the pool of memory managed by malloc() / free() is called a heap?
Based on [1]: http://www.google.com/url?q=http://gee.cs.oswego.edu/dl/html/malloc.html&sa=D&sntz=1&usg=AFQjCNHaQLotbBKKwYqxiiYWN1146BWzFw "Doug Lea's explanation of how his malloc() works",
it's not obvious that the data structure which we call a "heap" is being used at all.
Do we call it a "heap" because it's common for malloc() implementations to use best-fit selection of the memory chunk to return, and that's historically been implemented using a min-heap of chunks, sorted by chunk size?
This question already has answers here:
Closed 12 years ago.
Possible Duplicate:
What is the point of function pointers?
hi all,
I want to get the basic and concrete idea of function pointers in C language.
ie 1) its usage in C
2) main applications it is currently using
3) unique features
4) its scope in embedded applciations etc
Hoping your co operation in this too.
__Kanu
Function Pointers are pointers, that is variables, which point to the address of a function.
Nice example here. Also this answer is a must read.