mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-14 23:48:56 +00:00
d5118c8f78
multiple edges between two blocks is linear. If the caller is iterating all edges leaving a BB that would be a square time algorithm. It is more efficient to have the callers handle that case. Currently the only callers are: * GVN: already avoids the multiple edge case. * Verifier: could only hit this assert when looking at an invalid invoke. Since it already rejects the invoke, just avoid computing the dominance for it. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@162113 91177308-0d34-0410-b5e6-96231b3b80d8 |
||
---|---|---|
.. | ||
2002-04-13-RetTypes.ll | ||
2002-11-05-GetelementptrPointers.ll | ||
2004-05-21-SwitchConstantMismatch.ll | ||
2006-07-11-StoreStruct.ll | ||
2006-10-15-AddrLabel.ll | ||
2006-12-12-IntrinsicDefine.ll | ||
2007-12-21-InvokeParamAttrs.ll | ||
2008-01-11-VarargAttrs.ll | ||
2008-03-01-AllocaSized.ll | ||
2008-08-22-MemCpyAlignment.ll | ||
2008-11-15-RetVoid.ll | ||
2009-05-29-InvokeResult1.ll | ||
2009-05-29-InvokeResult2.ll | ||
2009-05-29-InvokeResult3.ll | ||
2010-08-07-PointerIntrinsic.ll | ||
aliasing-chain.ll | ||
AmbiguousPhi.ll | ||
byval-1.ll | ||
byval-4.ll | ||
cttz-undef-arg.ll | ||
dominates.ll | ||
fpmath.ll | ||
gcread-ptrptr.ll | ||
gcroot-alloca.ll | ||
gcroot-meta.ll | ||
gcroot-ptrptr.ll | ||
gcwrite-ptrptr.ll | ||
invoke.ll | ||
lit.local.cfg | ||
PhiGrouping.ll | ||
range-1.ll | ||
range-2.ll | ||
README.txt | ||
SelfReferential.ll |
This directory contains testcases that the verifier is supposed to detect as malformed LLVM code. Testcases for situations that the verifier incorrectly identifies as malformed should go in the test/Assembler directory.