6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-09-27 15:57:13 +00:00
Code Issues Projects Releases Wiki Activity

Update example to new syntax.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@48910 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Nick Lewycky 2008-03-28 06:46:51 +00:00
parent 7f0965e7da
commit 0c78ac11dd
2 changed files with 9 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
docs/Passes.html
View File

@ -1864,7 +1864,7 @@ if (i == j)
<li>The code is in valid SSA form.</li>
<li>It should be illegal to put a label into any other type (like a
structure) or to return one. [except constant arrays!]</li>
<li>Only phi nodes can be self referential: <tt>%x = add int %x, %x</tt> is
<li>Only phi nodes can be self referential: <tt>%x = add i32 %x, %x</tt> is
invalid.</li>
<li>PHI nodes must have an entry for each predecessor, with no extras.</li>
<li>PHI nodes must be the first thing in a basic block, all grouped

10
lib/VMCore/Verifier.cpp
View File

@ -21,7 +21,7 @@
// * The code is in valid SSA form
// * It should be illegal to put a label into any other type (like a structure)
// or to return one. [except constant arrays!]
// * Only phi nodes can be self referential: 'add int %0, %0 ; <int>:0' is bad
// * Only phi nodes can be self referential: 'add i32 %0, %0 ; <int>:0' is bad
// * PHI nodes must have an entry for each predecessor, with no extras.
// * PHI nodes must be the first thing in a basic block, all grouped together
// * PHI nodes must have at least one entry
@ -530,6 +530,12 @@ void Verifier::visitBasicBlock(BasicBlock &BB) {
// Ensure that basic blocks have terminators!
Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
// Ensure that the BB doesn't point out of its Function for unwinding.
Assert2(!BB.getUnwindDest() ||
BB.getUnwindDest()->getParent() == BB.getParent(),
"Basic Block unwinds to block in different function!",
&BB, BB.getUnwindDest());
// Check constraints that this basic block imposes on all of the PHI nodes in
// it.
if (isa<PHINode>(BB.front())) {
@ -1217,7 +1223,7 @@ void Verifier::visitInstruction(Instruction &I) {
}
// Definition must dominate use unless use is unreachable!
Assert2(DT->dominates(OpBlock, BB) ||
Assert2(DT->dominates(Op, &I) ||
!DT->dominates(&BB->getParent()->getEntryBlock(), BB),
"Instruction does not dominate all uses!", Op, &I);
} else {