6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-03-04 05:31:51 +00:00
Code Issues Projects Releases Wiki Activity

Trivial fixes.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43707 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Duncan Sands 2007-11-05 15:15:50 +00:00
parent db807edd66
commit e0a34353ee
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
docs/tutorial/JITTutorial1.html
View File

@ -91,7 +91,7 @@ int main(int argc, char**argv) {
<p>Finally, we instantiate an LLVM <code>PassManager</code> and run the <code>PrintModulePass</code> on our module. LLVM uses an explicit pass infrastructure to manage optimizations and various other things. A <code>PassManager</code>, as should be obvious from its name, manages passes: it is responsible for scheduling them, invoking them, and insuring the proper disposal after we’re done with them. For this example, we’re just using a trivial pass that prints out our module in textual form.</p>
<p>Now onto the interesting part: creating a populating a module. Here’s the first chunk of our <code>makeLLVMModule()</code>:</p>
<p>Now onto the interesting part: creating and populating a module. Here’s the first chunk of our <code>makeLLVMModule()</code>:</p>
<div class="doc_code">
<pre>
@ -191,4 +191,4 @@ Module* makeLLVMModule() {
</address>
</body>
</html>
</html>

6
docs/tutorial/JITTutorial2.html
View File

@ -47,7 +47,7 @@ unsigned gcd(unsigned x, unsigned y) {
<p>The above is a graphical representation of a program in LLVM IR. It places each basic block on a node of a graph, and uses directed edges to indicate flow control. These blocks will be serialized when written to a text or bitcode file, but it is often useful conceptually to think of them as a graph. Again, if you are unsure about the code in the diagram, you should skim through the <a href="../LangRef.html">LLVM Language Reference Manual</a> and convince yourself that it is, in fact, the GCD algorithm.</p>
<p>The first part of our code is the same as from first tutorial. The same basic setup is required: creating a module, verifying it, and running the <code>PrintModulePass</code> on it. Even the first segment of <code>makeLLVMModule()</code> looks the same, because <code>gcd</code> happens the have the same prototype as our <code>mul_add</code> function.</p>
<p>The first part of our code is the same as from first tutorial. The same basic setup is required: creating a module, verifying it, and running the <code>PrintModulePass</code> on it. Even the first segment of <code>makeLLVMModule()</code> looks the same, because <code>gcd</code> happens to have the same prototype as our <code>mul_add</code> function.</p>
<div class="doc_code">
<pre>
@ -162,7 +162,7 @@ Module* makeLLVMModule() {
</pre>
</div>
<p>And that's it! You can compile your code and execute your code in the same way as before, by executing:</p>
<p>And that's it! You can compile and execute your code in the same way as before, by doing:</p>
<div class="doc_code">
<pre>
@ -187,4 +187,4 @@ Module* makeLLVMModule() {
</address>
</body>
</html>
</html>