RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-13 22:58:50 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Remove colloquialisms from the documentation.

Browse Source 
llvm-svn: 20233
This commit is contained in:
Misha Brukman 2005-02-17 22:22:24 +00:00
parent ea2c511191
commit 31efbcc81c
1 changed files with 4 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
docs/CodeGenerator.html
View File

@ -899,8 +899,7 @@ implementations.</p>
<div class="doc_text">
<p>
The x86 has a very, uhm, flexible, way of accessing memory. It is capable of
<p>The x86 has a very flexible way of accessing memory. It is capable of
forming memory addresses of the following expression directly in integer
instructions (which use ModR/M addressing):</p>
@ -908,9 +907,9 @@ instructions (which use ModR/M addressing):</p>
Base+[1,2,4,8]*IndexReg+Disp32
</pre>
<p>Wow, that's crazy. In order to represent this, LLVM tracks no less than 4
operands for each memory operand of this form. This means that the "load" form
of 'mov' has the following "Operands" in this order:</p>
<p>In order to represent this, LLVM tracks no less than 4 operands for each
memory operand of this form. This means that the "load" form of 'mov' has the
following <tt>MachineOperand</tt>s in this order:</p>
<pre>
Index: 0 | 1 2 3 4