6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-28 19:31:58 +00:00
Code Issues Projects Releases Wiki Activity

Some more correction to the examples, thanks to Chris Lattner.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@29696 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Reid Spencer 2006-08-15 03:57:05 +00:00
parent 920baeee80
commit 1c6f87d665
1 changed files with 7 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
docs/GetElementPtr.html
View File

@ -77,21 +77,24 @@
<pre>
AType* Foo;
...
X = Foo[1];</pre>
X = &amp;Foo-&gt;F;</pre>
<p>it is natural to think that there is only one index, the constant value
<tt>1</tt>. This results from C allowing you to treat pointers and arrays as
equivalent. LLVM doesn't. In this example, Foo is a pointer. That pointer must
be indexed. To arrive at the same address location as the C code, you would
provide the GEP instruction with two indices. The first indexes through the
pointer, the second index the second element of the array.</p>
pointer, the second index the element of the structure just as if it was:</p>
<pre>
X = &amp;Foo[0].F;</pre>
<p>Sometimes this question gets rephrased as:</p>
<blockquote><i>Why is it okay to index through the first pointer, but
subsequent pointers won't be dereferenced?</i></blockquote>
<p>The answer is simply because memory does not have to be accessed to
perform the computation. The first operand to the GEP instruction must be a
value of a pointer type. The value of the pointer is provided directly to
the GEP instruction without any need for accessing memory. It must,
therefore be indexed like any other operand. Consider this example:</p>
the GEP instruction as an operand without any need for accessing memory. It
must, therefore be indexed and requires an index operand. Consider this
example:</p>
<pre>
struct munger_struct {
int f1;