RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-03-06 19:37:56 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

more typos

Browse Source 
llvm-svn: 81499
This commit is contained in:
Chris Lattner 2009-09-11 01:49:31 +00:00
parent c3ef5b0802
commit 1619ca8d56
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
docs/LangRef.html
View File

@ -2021,7 +2021,7 @@ Classifications</a> </div>
Undefined values may be of any type (other than label or void) and be used
anywhere a constant is permitted.</p>
<p>Undefined values are useful, because it indicates to the compiler that the
<p>Undefined values are useful because they indicate to the compiler that the
program is well defined no matter what value is used. This gives the
compiler more freedom to optimize. Here are some examples of (potentially
surprising) transformations that are valid (in pseudo IR):</p>
@ -2058,10 +2058,11 @@ Unsafe:
<p>These logical operations have bits that are not always affected by the input.
For example, if "%X" has a zero bit, then the output of the 'and' operation will
always be a zero, no matter what the corresponding bit from the undef is. As
such, it is unsafe to optimizer or assume that the result of the and is undef.
However, it is safe to assume that all bits of the undef are 0, and optimize the
and to 0. Likewise, it is safe to assume that all the bits of the undef operand
to the or could be set, allowing the or to be folded to -1.</p>
such, it is unsafe to optimize or assume that the result of the and is undef.
However, it is safe to assume that all bits of the undef could be 0, and
optimize the and to 0. Likewise, it is safe to assume that all the bits of
the undef operand to the or could be set, allowing the or to be folded to
-1.</p>
<div class="doc_code">
<pre>