From f4bc9b180221c139a60b0c3121bd6eedb555b741 Mon Sep 17 00:00:00 2001 From: Owen Anderson Date: Mon, 19 Nov 2007 16:10:59 +0000 Subject: [PATCH] Teach me to do stuff late at night. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@44236 91177308-0d34-0410-b5e6-96231b3b80d8 --- docs/tutorial/JITTutorial2.html | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/tutorial/JITTutorial2.html b/docs/tutorial/JITTutorial2.html index c28524e44a6..261a7949e8c 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 practically the same as from the 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 essentially the same, except that gcd takes one more parameter than mul_add.

+

The first part of our code is practically the same as from the 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 essentially the same, except that gcd takes one fewer parameter than mul_add.