Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>The stack grows <strong>downward</strong>. A <code>push</code> subtracts from the stack pointer (esp) and a <code>pop</code> adds to esp. You have to keep that in mind to understand a lot of this.</p> <pre><code>8048394:8d 4c 24 04 lea 0x4(%esp),%ecx ; ?? </code></pre> <p>lea = Load Effective Address</p> <p>This saves the address of the thing that lies 4 bytes into the stack. Since this is 32 bit (4 byte word) x86 code that means the second item on the stack. Since this is the code of a function (main in this case) the 4 bytes that are at the top of the stack is the return address.</p> <pre><code>8048398:83 e4 f0 and $0xfffffff0,%esp ; ?? </code></pre> <p>This code makes sure that the stack is aligned to 16 bytes. After this operation esp will be less than or equal to what it was before this operation, so the stack may grow, which protects anything that might already be on the stack. This is sometimes done in <code>main</code> just in case the function is called with an unaligned stack, which can cause things to be really slow (16 byte is a cache line width on x86, I think, though 4 byte alignment is what is really important here). If main has a unaligned stack the rest of the program will too.</p> <pre><code> 804839b:ff 71 fc pushl -0x4(%ecx) ; ?? </code></pre> <p>Since ecx was loaded before as a pointer to the thing on the other side of the return address from the previous top of the stack, so since this has a -4 index this refers to back to the return address for the current function being pushed back to the top of the stack so that main can return normally. (Push is magic and seems to be able to both load and store from to different places in RAM in the same instruction).</p> <pre><code> 804839e:55 push %ebp ; Store the Base pointer 804839f:89 e5 mov %esp,%ebp ; Initialize the Base pointer with the stack pointer 80483a1:51 push %ecx ; ?? 80483a2:83 ec 4c sub $0x4c,%esp ; ?? </code></pre> <p>This is mostly the standard function prologue (the previous stuff was special for main). This is making a stack frame (area between ebp and esp) where local variables can live. ebp is pushed so that the old stack frame can be restored in the epilogue (at the end of the current function).</p> <pre><code>80483a5:c7 45 f8 0c 00 00 00 movl $0xc,-0x8(%ebp) ; Move 12 into -0x8(%ebp) 80483ac:c7 45 f4 14 00 00 00 movl $0x14,-0xc(%ebp) ; Move 20 into -0xc(%ebp) 80483b3:8b 45 f8 mov -0x8(%ebp),%eax ; Move 12@-0x8(%ebp) into eax 80483b6:83 c0 7b add $0x7b,%eax ; Add 123 to 12@eax 80483b9:89 45 f4 mov %eax,-0xc(%ebp) ; Store the result into b@-0xc(%ebp) 80483bc:b8 00 00 00 00 mov $0x0,%eax ; Move 0 into eax </code></pre> <p>eax is where integer function return values are stored. This is setting up to return 0 from main.</p> <pre><code>80483c1:83 c4 10 add $0x10,%esp ; ?? 80483c4:59 pop %ecx ; ?? 80483c5:5d pop %ebp ; ?? 80483c6:8d 61 fc lea -0x4(%ecx),%esp ; ?? </code></pre> <p>This is the function epilogue. It is more difficult to understand because of the weird stack alignment code at the beginning. I'm having a little bit of trouble figuring out why the stack is being adjusted by a lower amount this time than in the prologue, though.</p> <p>It if obvious that this particular code was not compiled with optimizations on. If it were there probably wouldn't be much there since the compiler can see that even if it did not do the math listed in your <code>main</code> the end result of the program is the same. With programs that do actually do something (have side effects or results) it sometimes easier to read lightly optimized code (-O1 or -0s arguments to gcc).</p> <p>Reading assembly generated by a compiler is often much easier for functions that aren't <code>main</code>. If you want to read to understand the code then write yourself a function that takes some arguments to produce a result or that works on global variables, and you will be able to understand it better.</p> <p>Another thing that will probably help you is to just have gcc generate the assembly files for you, rather than disassembling them. The <code>-S</code> flag tells it to generate this (but not to generate other files), and names the assembly files with a <code>.s</code> on the end. This should be easier for you to read than the disassembled versions.</p>
    singulars
    1. This table or related slice is empty.
    1. POUnderstanding the purpose of some assembly statements
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USTony
    1. USnategoose
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POUnderstanding the purpose of some assembly statements
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COThanks for your time. Very detailed explanation. Just what I was looking for.
      singulars
      1. PO
      1. USLegend
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload