mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-13 20:32:21 +00:00
a420a14276
Summary: We need to add a runtime memcheck for pair of accesses (x,y) where at least one of x and y are writes. Assuming we have w writes and r reads, currently this number is estimated as being w* (w+r-1). This estimation will count (write,write) pairs twice and will overestimate the number of checks required. This change adds a getNumberOfChecks method to RuntimePointerCheck, which will count the number of runtime checks needed (similar in implementation to needsAnyChecking) and uses it to produce the correct number of runtime checks. Test Plan: llvm test suite spec2k spec2k6 Performance results: no changes observed (not surprising since the formula for 1 writer is basically the same, which would covers most cases - at least with the current check limit). Reviewers: anemet Reviewed By: anemet Subscribers: mzolotukhin, llvm-commits Differential Revision: http://reviews.llvm.org/D10217 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@239295 91177308-0d34-0410-b5e6-96231b3b80d8 |
||
|---|---|---|
| .. | ||
| backward-dep-different-types.ll | ||
| number-of-memchecks.ll | ||
| resort-to-memchecks-only.ll | ||
| safe-no-checks.ll | ||
| store-to-invariant-check1.ll | ||
| store-to-invariant-check2.ll | ||
| store-to-invariant-check3.ll | ||
| stride-access-dependence.ll | ||
| underlying-objects-1.ll | ||
| underlying-objects-2.ll | ||
| unsafe-and-rt-checks.ll | ||