From e0a34353ee4bf0d990c55f6a9f593666bffb69ab Mon Sep 17 00:00:00 2001 From: Duncan Sands Date: Mon, 5 Nov 2007 15:15:50 +0000 Subject: Trivial fixes. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43707 91177308-0d34-0410-b5e6-96231b3b80d8 --- docs/tutorial/JITTutorial1.html | 4 ++-- docs/tutorial/JITTutorial2.html | 6 +++--- 2 files changed, 5 insertions(+), 5 deletions(-) (limited to 'docs/tutorial') diff --git a/docs/tutorial/JITTutorial1.html b/docs/tutorial/JITTutorial1.html index 9819c77..14af4e9 100644 --- a/docs/tutorial/JITTutorial1.html +++ b/docs/tutorial/JITTutorial1.html @@ -91,7 +91,7 @@ int main(int argc, char**argv) {

Finally, we instantiate an LLVM PassManager and run the PrintModulePass on our module. LLVM uses an explicit pass infrastructure to manage optimizations and various other things. A PassManager, 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.

-

Now onto the interesting part: creating a populating a module. Here’s the first chunk of our makeLLVMModule():

+

Now onto the interesting part: creating and populating a module. Here’s the first chunk of our makeLLVMModule():

@@ -191,4 +191,4 @@ Module* makeLLVMModule() {
 
 
 
-
\ No newline at end of file
+
diff --git a/docs/tutorial/JITTutorial2.html b/docs/tutorial/JITTutorial2.html
index 63efd6a..06d0df1 100644
--- a/docs/tutorial/JITTutorial2.html
+++ b/docs/tutorial/JITTutorial2.html
@@ -47,7 +47,7 @@ unsigned gcd(unsigned x, unsigned y) {
 
 
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 LLVM Language Reference Manual and convince yourself that it is, in fact, the GCD algorithm.

 
-
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 PrintModulePass on it.  Even the first segment of  makeLLVMModule() looks the same, because gcd happens the have the same prototype as our mul_add function.

+
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 PrintModulePass on it.  Even the first segment of  makeLLVMModule() looks the same, because gcd happens to have the same prototype as our mul_add function.

 
 

 
@@ -162,7 +162,7 @@ Module* makeLLVMModule() {
 

 

 
-
And that's it!  You can compile your code and execute your code in the same way as before, by executing:

+
And that's it!  You can compile and execute your code in the same way as before, by doing:

 
 

 
@@ -187,4 +187,4 @@ Module* makeLLVMModule() {
 
 
 
-
\ No newline at end of file
+
-- 
cgit v1.1