From 99057116f60505795c19151a7dab94abf50041be Mon Sep 17 00:00:00 2001 From: Owen Anderson Date: Mon, 19 Nov 2007 07:44:43 +0000 Subject: Fix a factually incorrect statement pointed out by Max Hailperin. llvm-svn: 44228 --- llvm/docs/tutorial/JITTutorial2.html | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'llvm/docs') diff --git a/llvm/docs/tutorial/JITTutorial2.html b/llvm/docs/tutorial/JITTutorial2.html index 06d0df1bde9..c28524e44a6 100644 --- a/llvm/docs/tutorial/JITTutorial2.html +++ b/llvm/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 to have the same prototype as our mul_add function.

+

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.

-- 
cgit v1.2.3