RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-01 07:30:33 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

fix typos

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43682 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2007-11-04 19:42:13 +00:00
parent fe6575c2bf
commit 2e5d07e3ea
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
docs/tutorial/LangImpl7.html
View File

@ -130,7 +130,7 @@ logic.</p>
in SSA form, it does not require (or permit) memory objects to be in SSA form.
In the example above, note that the loads from G and H are direct accesses to
G and H: they are not renamed or versioned. This differs from some other
compiler systems, which does try to version memory objects. In LLVM, instead of
compiler systems, which do try to version memory objects. In LLVM, instead of
encoding dataflow analysis of memory into the LLVM IR, it is handled with <a
href="../WritingAnLLVMPass.html">Analysis Passes</a> which are computed on
demand.</p>
@ -267,7 +267,7 @@ more powerful and can promote structs, "unions", and arrays in many cases.</li>
<p>
All of these properties are easy to satisfy for most imperative languages, and
we'll illustrated this below with Kaleidoscope. The final question you may be
we'll illustrate this below with Kaleidoscope. The final question you may be
asking is: should I bother with this nonsense for my front-end? Wouldn't it be
better if I just did SSA construction directly, avoiding use of the mem2reg
optimization pass? In short, we strongly recommend that use you this technique