forked from OSchip/llvm-project
3336f681e3
Summary:
This change adds some verification in the IR verifier around struct path
TBAA metadata.
Other than some basic sanity checks (e.g. we get constant integers where
we expect constant integers), this checks:
- That by the time an struct access tuple `(base-type, offset)` is
"reduced" to a scalar base type, the offset is `0`. For instance, in
C++ you can't start from, say `("struct-a", 16)`, and end up with
`("int", 4)` -- by the time the base type is `"int"`, the offset
better be zero. In particular, a variant of this invariant is needed
for `llvm::getMostGenericTBAA` to be correct.
- That there are no cycles in a struct path.
- That struct type nodes have their offsets listed in an ascending
order.
- That when generating the struct access path, you eventually reach the
access type listed in the tbaa tag node.
Reviewers: dexonsmith, chandlerc, reames, mehdi_amini, manmanren
Subscribers: mcrosier, llvm-commits
Differential Revision: https://reviews.llvm.org/D26438
llvm-svn: 289402
|
||
|---|---|---|
| .. | ||
| 2008-11-27-EntryMunge.ll | ||
| 2010-08-26-and.ll | ||
| 2011-04-02-SimplifyDeadBlock.ll | ||
| 2011-04-14-InfLoop.ll | ||
| 2012-07-19-NoSuccessorIndirectBr.ll | ||
| and-and-cond.ll | ||
| and-cond.ll | ||
| assume-edge-dom.ll | ||
| assume.ll | ||
| basic.ll | ||
| branch-no-const.ll | ||
| compare.ll | ||
| conservative-lvi.ll | ||
| crash-assertingvh.ll | ||
| crash.ll | ||
| degenerate-phi.ll | ||
| implied-cond.ll | ||
| indirectbr.ll | ||
| induction.ll | ||
| landing-pad.ll | ||
| lvi-load.ll | ||
| no-irreducible-loops.ll | ||
| or-undef.ll | ||
| phi-eq.ll | ||
| phi-known.ll | ||
| pr9331.ll | ||
| pr15851_hang.ll | ||
| pr22086.ll | ||
| pr26096.ll | ||
| pr27840.ll | ||
| select.ll | ||
| static-profile.ll | ||
| thread-cmp.ll | ||
| thread-loads.ll | ||
| update-edge-weight.ll | ||