mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-04 01:42:09 +00:00
Added a note about a new verification the verifier should do
Removed a redundant check git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@100 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
7b6f5a3ee9
commit
1be1d79a1d
@ -10,13 +10,13 @@
|
||||
// with the same name as something in the symbol table, but with a different
|
||||
// address as what is in the symbol table...
|
||||
// . Both of a binary operator's parameters are the same type
|
||||
// . Only PHI nodes can refer to themselves
|
||||
// . All of the constants in a switch statement are of the correct type
|
||||
// . 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!]
|
||||
// . Right now 'add bool 0, 0' is valid. This isn't particularly good.
|
||||
// . Only phi nodes can be self referential: 'add int 0, 0 ; <int>:0' is bad
|
||||
// . PHI nodes must have an entry for each predecessor, with no extras.
|
||||
// . All other things that are tested by asserts spread about the code...
|
||||
// . All basic blocks should only end with terminator insts, not contain them
|
||||
// . All methods must have >= 1 basic block
|
||||
|
Loading…
Reference in New Issue
Block a user