WWW-www.enlightenment.org pushed a commit to branch master.


commit b90686bce9b87684bdf3148d81cb6522ec05af54
Author: Raster <ras...@rasterman.com>
Date:   Wed Jun 17 23:03:30 2015 -0700

    Wiki page start changed with summary [] by Raster
 pages/docs/c/start.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/pages/docs/c/start.txt b/pages/docs/c/start.txt
index 7456794..6f7d398 100644
--- a/pages/docs/c/start.txt
+++ b/pages/docs/c/start.txt
@@ -495,7 +495,7 @@ Generally you allocate memory with functions such as 
''malloc()'', ''calloc()'',
 The memory of your process, other than memory used to store the 
code/instructions loaded from disk, is primarily made up of 2 elements. The 
[[http://en.wikipedia.org/wiki/Call_stack|stack]] and the 
[[http://en.wikipedia.org/wiki/Memory_management|heap]]. Your memory space will 
generally look something as follows, often with the stack high up in memory (at 
high addresses) and pieces of code from the process and libraries mapped in 
from disk, as well as heap space being allocated there too [...]
-{{ memstackheap.svg?nolink |Complete memory space diagram }}
+{{ memheapstack.svg?nolink |Complete memory space diagram }}
 The stack is managed for you mostly by the compiler and runtime. As the 
application runs, every time a function is called, a new blob of memory is 
"pushed" at the "top" of the stack (conceptually stacks grow.. thus the top is 
where the newest item(s) are on the stack, but often the stack grows down in 
memory, so to push you subtract values from the top of the stack and to pop, 
you add again). This memory contains the parameters passed to each function, 
and will contain return values from [...]


Reply via email to