6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-14 11:32:34 +00:00
Code Issues Projects Releases Wiki Activity

Tidy whitespace.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@61653 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman 2009-01-04 23:44:43 +00:00
parent f24eb39bce
commit 2a08c53238
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
docs/LangRef.html
View File

@ -441,9 +441,9 @@ symbol table entries. Here is an example of the "hello world" module:</p>
<i>; Definition of main function</i> <i>; Definition of main function</i>
define i32 @main() { <i>; i32()* </i> define i32 @main() { <i>; i32()* </i>
<i>; Convert [13x i8 ]* to i8 *...</i> <i>; Convert [13 x i8]* to i8 *...</i>
%cast210 = <a %cast210 = <a
href="#i_getelementptr">getelementptr</a> [13 x i8 ]* @.LC0, i64 0, i64 0 <i>; i8 *</i> href="#i_getelementptr">getelementptr</a> [13 x i8]* @.LC0, i64 0, i64 0 <i>; i8 *</i>
<i>; Call puts function to write out the string to stdout...</i> <i>; Call puts function to write out the string to stdout...</i>
<a <a
@ -1493,7 +1493,7 @@ zero.</p>
<h5>Examples:</h5> <h5>Examples:</h5>
<table class="layout"> <table class="layout">
<tr class="layout"> <tr class="layout">
<td class="left"><tt>[4x i32]*</tt></td> <td class="left"><tt>[4 x i32]*</tt></td>
<td class="left">A <a href="#t_pointer">pointer</a> to <a <td class="left">A <a href="#t_pointer">pointer</a> to <a
href="#t_array">array</a> of four <tt>i32</tt> values.</td> href="#t_array">array</a> of four <tt>i32</tt> values.</td>
</tr> </tr>
@ -2071,15 +2071,15 @@ branches or with a lookup table.</p>
<pre> <pre>
<i>; Emulate a conditional br instruction</i> <i>; Emulate a conditional br instruction</i>
%Val = <a href="#i_zext">zext</a> i1 %value to i32 %Val = <a href="#i_zext">zext</a> i1 %value to i32
switch i32 %Val, label %truedest [i32 0, label %falsedest ] switch i32 %Val, label %truedest [ i32 0, label %falsedest ]
<i>; Emulate an unconditional br instruction</i> <i>; Emulate an unconditional br instruction</i>
switch i32 0, label %dest [ ] switch i32 0, label %dest [ ]
<i>; Implement a jump table:</i> <i>; Implement a jump table:</i>
switch i32 %val, label %otherwise [ i32 0, label %onzero switch i32 %val, label %otherwise [ i32 0, label %onzero
i32 1, label %onone i32 1, label %onone
i32 2, label %ontwo ] i32 2, label %ontwo ]
</pre> </pre>
</div> </div>
@ -3187,7 +3187,7 @@ result is null if there is insufficient memory available.</p>
<h5>Example:</h5> <h5>Example:</h5>
<pre> <pre>
%array = malloc [4 x i8 ] <i>; yields {[%4 x i8]*}:array</i> %array = malloc [4 x i8] <i>; yields {[%4 x i8]*}:array</i>
%size = <a href="#i_add">add</a> i32 2, 2 <i>; yields {i32}:size = i32 4</i> %size = <a href="#i_add">add</a> i32 2, 2 <i>; yields {i32}:size = i32 4</i>
%array1 = malloc i8, i32 4 <i>; yields {i8*}:array1</i> %array1 = malloc i8, i32 4 <i>; yields {i8*}:array1</i>