[InstCombine] Prevent memcpy generation for small data size

[hiraditya]

Summary

InstCombine pass converts @llvm.memcpy to either memcpy or LD/ST depending on if the data size is greater than 8 bytes or not.
However for different targets, 8 bytes may be smaller.
Hence, we queried target datalayout to find the threshold.

Worked in collaboration with Aditya Kumar

[DIVYA]

Updated array2.ll testcase file

[spatel]

lib/Transforms/InstCombine/InstCombineCalls.cpp

202–203

Why 32? I'm not sure what it means if there are no legal types in the DL. Please add a code comment to explain.

206

This code comment isn't correct any more.

test/Transforms/InstCombine/builtin_memcpy_pattern.ll

1

1. The test should be limited to -instcombine, not -O2.
2. The tests here have way too much extraneous stuff. Please minimize to just the IR necessary to show the transform.
3. You can check the tests in ahead of this patch to show the current IR, then this patch will just show the diffs from the existing code.
4. Please use the script at util/update_tests_checks.py to auto-generate the complete CHECK lines.

[hiraditya]

lib/Transforms/InstCombine/InstCombineCalls.cpp

202–203

Why 32?

32 because we want to default to 8, same as the previous behavior before this patch.

I'm not sure what it means if there are no legal types in the DL. Please add a code comment to explain.

For example, in test cases when the target datalayout is not specified, DL.getLargestLegalIntTypeSizeInBits() returns 0.

[DIVYA]

• removed some comments
• added testcase with different datalayout

[DIVYA]

ping

[spatel]

lib/Transforms/InstCombine/InstCombineCalls.cpp

185–186

This comment is wrong now? I'm still confused about the current behavior and what this patch is changing.

Did you see my earlier comment to check in minimal tests to trunk before this patch so we have a baseline view of the current behavior? Do the tests really need loops, attributes, globals, etc?

If there are no legal types in the DL, why wouldn't we just bail out rather than assuming that 32-bit and smaller is safe/desirable to transform?

[DIVYA]

• Added a diff for the output before and after applying the patch
• Removed some comments

[DIVYA]

lib/Transforms/InstCombine/InstCombineCalls.cpp

185–186

The test contains loops to show that builtin_memcpy within the loops , will also be converted to either memcpy or store and load operations depending on the maximum allowed stores

[DIVYA]

Diff for test/Transforms/InstCombine/builtin_memcpy_patterns.ll

TESTCASE1
Before applying the patch

define void @foo(i8* %a, i8* %b) local_unnamed_addr #0 {
entry:

call void @llvm.memcpy.p0i8.p0i8.i64(i8* %a, i8* %b, i64 16, i32 1, i1 false)
ret void

}

After Applying the patch

define void @foo(i8* %a, i8* %b) local_unnamed_addr #0 {
entry:

%0 = bitcast i8* %b to i128*
%1 = bitcast i8* %a to i128*
%2 = load i128, i128* %0, align 1
store i128 %2, i128* %1, align 1
ret void

}

TESTCASE2

Before Applying the patch

%0 = bitcast i32* %add.ptr to i8*
%add.ptr3 = getelementptr inbounds [16 x i32], [16 x i32]* @b, i64 0, i64 %idx.ext
%1 = bitcast i32* %add.ptr3 to i8*
call void @llvm.memcpy.p0i8.p0i8.i64(i8* %0, i8* %1, i64 16, i32 4, i1 false)
%inc = add nsw i32 %i.0, 1

After Applying the patch

%0 = bitcast i32* %add.ptr3 to i128*
%1 = bitcast i32* %add.ptr to i128*
%2 = load i128, i128* %0, align 16
store i128 %2, i128* %1, align 4

[spatel]

This patch as uploaded makes even less sense to me than before:

1. There are no tests to show the diff.
2. You've changed the code rather than an assertion in an unrelated test to show a functional difference?

I've checked in some extra tests where I think your patch will fire here:
https://reviews.llvm.org/rL310611

Please update this patch to include that and then explain the intent of each diff.

As I mentioned before, you can use a script to update the check lines (please don't hand-edit them):
$ path/to/update_test_checks.py --opt=path/to/build/bin/opt memcpy-to-load.ll

[DIVYA]

• Updated patch rL310611 and added the diff
• added a new testcase

[spatel]

test/Transforms/InstCombine/builtin_memcpy_patterns.ll

3–6 ↗

(On Diff #110787)

I still don't understand what value these tests provide over the existing ones. These are the same llvm.memcpy calls except they are in loops? The transform doesn't depend on loops from what I can tell, so why do we need to test this?

test/Transforms/InstCombine/memcpy-to-load.ll

81 ↗

(On Diff #110787)

That is the existing behavior, but why is that valid now that we're using the datalayout?

93 ↗

(On Diff #110787)

You're mixing bytes and bits here. It makes sense to me that we would use the datalayout to drive this transform, but why are we then ignoring the datalayout and producing load + store of an illegal type (i128)?

[joerg]

What is the advantage of expanding the memcpy intrinsic in InstCombine vs doing it later in the target-specific code?

[spatel]

In D35035#839833, @joerg wrote:

What is the advantage of expanding the memcpy intrinsic in InstCombine vs doing it later in the target-specific code?

I can't answer for 'memcpy' directly, but probably related - I'm looking at cases where late 'memcmp' expansion causes us to miss optimizations in:
https://bugs.llvm.org/show_bug.cgi?id=34032#c13

instcombine is definitely not the IR pass for 'memcmp' expansion. (It's complicated enough to be its own pass, but currently it's a pass-within-a-pass of CGP.)

We could make the argument that the post-IR backend should handle those cases, but I think it would require the collective powers of gvn, cse, instcombine, and simplifycfg.

[joerg]

@spatel: I don't see a reason why we can't (or shouldn't) try to do common-prefix elimination for the memcmp intrinsic. It certainly seems to be better to me to preserve the intrinsics in your case as they should be easier to reason about. That's kind of my question for here too -- why does the expansion allow better code?

[spatel]

In D35035#839852, @joerg wrote:

@spatel: I don't see a reason why we can't (or shouldn't) try to do common-prefix elimination for the memcmp intrinsic. It certainly seems to be better to me to preserve the intrinsics in your case as they should be easier to reason about. That's kind of my question for here too -- why does the expansion allow better code?

Thanks, @joerg . I can't see any reason not to do prefix elimination either. I'm not sure if that will solve everything for that case, but it should make it better. I'll give that a try.

[DIVYA]

test/Transforms/InstCombine/memcpy-to-load.ll

81 ↗

(On Diff #110787)

In test cases when the target datalayout is not specified, DL.getLargestLegalIntTypeSizeInBits() returns 0.For those cases it will have the previous behavious before applying the patch

[craig.topper]

lib/Transforms/InstCombine/InstCombineCalls.cpp

202–203

But the previous behavior allowed 8 bytes so shouldn't it be 64?

206

Is there an extra blank line here?

[hiraditya]

lib/Transforms/InstCombine/InstCombineCalls.cpp

202–203

It's been a while when we submitted the patch but I think you're right unless @DIVYA has some comments. We'll make the changes.

206

We'll fix this.

[SjoerdMeijer]

I would quickly like to check the status of this patch: do you have plans to continue this work? If not, I would like to pick it up.

[hiraditya]

I think this patch is good to go, I can push this if someone accepts. I'll fix the comments.

[spatel]

In D35035#1237401, @hiraditya wrote:

I think this patch is good to go, I can push this if someone accepts. I'll fix the comments.

I still don't understand the (LargestInt == 0) hack. I think everyone agrees that the existing code is wrong, so why preserve the existing behavior if we don't have a valid datalayout? Ie, there's no risk for real targets because they always have a non-zero getLargestLegalIntTypeSizeInBits()?

[hiraditya]

In D35035#1237497, @spatel wrote:

In D35035#1237401, @hiraditya wrote:

I think this patch is good to go, I can push this if someone accepts. I'll fix the comments.

I still don't understand the (LargestInt == 0) hack. I think everyone agrees that the existing code is wrong, so why preserve the existing behavior if we don't have a valid datalayout? Ie, there's no risk for real targets because they always have a non-zero getLargestLegalIntTypeSizeInBits()?

Agreed, I'll remove that part then. That was only to make other testcases happy by preserving existing behavior. Thanks

[lebedev.ri]

In D35035#1238502, @hiraditya wrote:

In D35035#1237497, @spatel wrote:

In D35035#1237401, @hiraditya wrote:

I think this patch is good to go, I can push this if someone accepts. I'll fix the comments.

I still don't understand the (LargestInt == 0) hack. I think everyone agrees that the existing code is wrong, so why preserve the existing behavior if we don't have a valid datalayout? Ie, there's no risk for real targets because they always have a non-zero getLargestLegalIntTypeSizeInBits()?

Agreed, I'll remove that part then. That was only to make other testcases happy by preserving existing behavior. Thanks

Presumably those testcases should simply be updated to contain the expected datalayout?

[hiraditya]

In D35035#1238511, @lebedev.ri wrote:

In D35035#1238502, @hiraditya wrote:

In D35035#1237497, @spatel wrote:

In D35035#1237401, @hiraditya wrote:

I think this patch is good to go, I can push this if someone accepts. I'll fix the comments.

I still don't understand the (LargestInt == 0) hack. I think everyone agrees that the existing code is wrong, so why preserve the existing behavior if we don't have a valid datalayout? Ie, there's no risk for real targets because they always have a non-zero getLargestLegalIntTypeSizeInBits()?

Agreed, I'll remove that part then. That was only to make other testcases happy by preserving existing behavior. Thanks

Presumably those testcases should simply be updated to contain the expected datalayout?

I think so...

[hiraditya]

To fix tests and comments from reviewers.

[hiraditya]

Fix some unit-tests, a few more remaining.

[lebedev.ri]

lib/Transforms/InstCombine/InstCombineCalls.cpp

133

You can check that the Size is power of two here.

139–140

I think we decided that the tests should be updated instead?

142

You overrode LargestInt already, it can't be 0.
This should only be Size > LargestInt.

[hiraditya]

Fixed all testcases, and removed memcpy inlining when target datalayout is not present.

[hiraditya]

Moved the check of Size before checking the LargestInt.

[lebedev.ri]

Code looks good.

test/Transforms/InstCombine/element-atomic-memintrins.ll

101 ↗

(On Diff #167660)

Please just use utils/update_test_checks.py, as stated in the first line of the test.

test/Transforms/InstCombine/memcpy-to-load.ll

76 ↗

(On Diff #167660)

Will running the utils/update_test_checks.py preserve this 'inline' comments?

[lebedev.ri]

lib/Transforms/InstCombine/InstCombineCalls.cpp

133

Actually, please use !isPowerOf2_64(Size).

[hiraditya]

Updated testcases with utils/update_test_checks.py
use isPowerOf2_64

[dmgreen]

lib/Transforms/InstCombine/InstCombineCalls.cpp

140

Are the units of these the same? Or is one bits and the other bytes?

[jfb]

I don't understand why it makes sense to tie this to the larger integer type. I understand that targets might want what you're doing, but tying it to the largest integer type instead of having a separate target-specific value seems odd.
How does this interact with memcpyopt?
Which targets are affected by this change?
Can you please provide size and performance numbers for relevant targets?

lib/Transforms/InstCombine/InstCombineCalls.cpp

139

Why does this make sense? I don't understand why we'd want to tie this to the largest legal integer type, and not have it be its own target parameter.

test/DebugInfo/X86/array2.ll

21

Why change this?

test/Transforms/InstCombine/2007-10-10-EliminateMemCpy.ll

3 ↗

(On Diff #167673)

Why change this?

test/Transforms/InstCombine/alloca.ll

147 ↗

(On Diff #167673)

This test checks that the inalloca remains. Change the test to still test the same thing, don't just delete the CHECK.
https://bugs.llvm.org/show_bug.cgi?id=19569

[hiraditya]

lib/Transforms/InstCombine/InstCombineCalls.cpp

139

We used 'largest legal integer size' because that will fit in a register for sure. I think making a target specific parameter seems reasonable, or maybe using TargetLowering.h:getMaxStoresPerMemcpy() which is already available.

140

Thank you!

[spatel]

lib/Transforms/InstCombine/InstCombineCalls.cpp

139

I'm not understanding this discussion...
This patch is trying to apply some target-based constraint to a questionable (reverse) IR canonicalization that currently just pulls a number out of the air.
The ultimate goal would be to simply always canonicalize to memcpy and not expand it ever in instcombine as mentioned in D52081.
But we don't do that (yet) because we're afraid of missed optimizations that can't be replicated in the backend.
Expanding memcpy for performance using target parameters belongs in a late, target-aware pass (and as mentioned, it already exists), not early in generic instcombine.

[jfb]

lib/Transforms/InstCombine/InstCombineCalls.cpp

139

Let me try to expand a bit, and let me know if that makes sense:

IMO LargestLegalIntTypeSizeInBits doesn't make sense to use here. On ARM I might want to use paired integer load / store for memcpy, or paired Q registers. These have nothing to do with the largest legal integer type. It doesn't matter what the patch is trying to do or what is currently being done: the patch is adding something weird. It shouldn't.

[lebedev.ri]

lib/Transforms/InstCombine/InstCombineCalls.cpp

139

It's replacing magic hardcoded number with a number pulled out of target datalayout.
Should be a new field in target datalayout?
I'm not sure if we can get TargetLowering info from the backend in the middle-end?

[spatel]

lib/Transforms/InstCombine/InstCombineCalls.cpp

139

I agree that this is a strange transform for instcombine. We're trying to safely replace an obviously bogus magic number constraint (8) with something based on target reality.

So this is an intermediate step as I see it. The goal of this patch (and this may be counter to the original goal...) is to not expand memcpy(x, y, 8) on a 32-bit system because that could take >1 load/store pair. The final goal is to not expand memcpy at all.

IIUC, you'd like to make this transform more aggressive rather than more conservative though? Ie, a pair of registers or Q regs are always bigger than LargestLegalIntType (let me know if I'm wrong).

But that's moving us further away from the target-independent canonicalization goal of instcombine. The kind of expansion where we ask if pairs or vector regs are available should be happening in memcpyopt (if it's not, then that should be enhanced in that pass/lowering).

[jfb]

lib/Transforms/InstCombine/InstCombineCalls.cpp

139

All I'm saying is that replacing MagicNumber == 8 with ErroneousUsage == LargestLegalIntTypeSizeInBits isn't what we should be doing.

[hiraditya]

lib/Transforms/InstCombine/InstCombineCalls.cpp

139

Totally agreed with @spatel , ideally we shouldn't be inlining memcpy this early on, we should try to be independent of target specific behavior at instcombine. It be ideal to just not have inlining of memcpy here and do it all in memcpyopt with better cost-model.

[SjoerdMeijer]

The ultimate goal would be to simply always canonicalize to memcpy and not expand it ever in instcombine as mentioned in D52081.

Looks like we all agree on this now.

But we don't do that (yet) because we're afraid of missed optimizations that can't be replicated in the backend.

Perhaps the impact is negligible, non-existent, and we worry about this for nothing. As also suggested earlier, I will try to get some numbers on the table for ARM and AArch64 if we strip out the lowering here, if that is helpful for this discussion, but probably need a day or two to get them.

[hiraditya]

In D35035#1252796, @SjoerdMeijer wrote:

The ultimate goal would be to simply always canonicalize to memcpy and not expand it ever in instcombine as mentioned in D52081.

Looks like we all agree on this now.

But we don't do that (yet) because we're afraid of missed optimizations that can't be replicated in the backend.

Perhaps the impact is negligible, non-existent, and we worry about this for nothing. As also suggested earlier, I will try to get some numbers on the table for ARM and AArch64 if we strip out the lowering here, if that is helpful for this discussion, but probably need a day or two to get them.

If you could provide some numbers, I can go ahead and remove the inlining of memcpy altogether provided the reviewers agree with it, or we can merge this patch which is trying to improve on previously hardcoded numbers.

[spatel]

In D35035#1252829, @hiraditya wrote:

In D35035#1252796, @SjoerdMeijer wrote:

Perhaps the impact is negligible, non-existent, and we worry about this for nothing. As also suggested earlier, I will try to get some numbers on the table for ARM and AArch64 if we strip out the lowering here, if that is helpful for this discussion, but probably need a day or two to get them.

If you could provide some numbers, I can go ahead and remove the inlining of memcpy altogether provided the reviewers agree with it, or we can merge this patch which is trying to improve on previously hardcoded numbers.

Yes, I support removing the expansion entirely, but I don't think we can commit that change without doing some advance perf testing.
And yes, in the best case, we'll discover that there are no regressions because all of the other analyses and lowering will do the transform as intended when it's profitable.

If that doesn't work though, using LargestLegalIntTypeSizeInBits still seems like a good compromise to me. We want to conservatively limit the expansion to a size/type that the target tells us is ok (can be performed with a single load/store), and that's the value that most closely matches what we have today, so we avoid regressions as we work to the goal. It's not the ideal change, but there's precedence for this sort of datalayout use in instcombine (see InstCombiner::shouldChangeType()). Adding a new specifier to the datalayout to account for things like pair ops or vectors doesn't make sense to me - that moves us away from the goal of improving the other passes and removing the expansion in instcombine.

[lebedev.ri]

In D35035#1252975, @spatel wrote:

In D35035#1252829, @hiraditya wrote:

In D35035#1252796, @SjoerdMeijer wrote:

Perhaps the impact is negligible, non-existent, and we worry about this for nothing. As also suggested earlier, I will try to get some numbers on the table for ARM and AArch64 if we strip out the lowering here, if that is helpful for this discussion, but probably need a day or two to get them.

If you could provide some numbers, I can go ahead and remove the inlining of memcpy altogether provided the reviewers agree with it, or we can merge this patch which is trying to improve on previously hardcoded numbers.

Yes, I support removing the expansion entirely, but I don't think we can commit that change without doing some advance perf testing.
And yes, in the best case, we'll discover that there are no regressions because all of the other analyses and lowering will do the transform as intended when it's profitable.

Just to drop a nit, here is a somewhat idiomatic pattern, that is recommended to avoid breaking strict aliasing: https://godbolt.org/z/_JNwOp
If we don't do this memcpy expansion where, will we have memcpy till the backend?
Surely this is not good.

[spatel]

In D35035#1252976, @lebedev.ri wrote:

In D35035#1252975, @spatel wrote:

In D35035#1252829, @hiraditya wrote:

In D35035#1252796, @SjoerdMeijer wrote:

Perhaps the impact is negligible, non-existent, and we worry about this for nothing. As also suggested earlier, I will try to get some numbers on the table for ARM and AArch64 if we strip out the lowering here, if that is helpful for this discussion, but probably need a day or two to get them.

If you could provide some numbers, I can go ahead and remove the inlining of memcpy altogether provided the reviewers agree with it, or we can merge this patch which is trying to improve on previously hardcoded numbers.

Yes, I support removing the expansion entirely, but I don't think we can commit that change without doing some advance perf testing.
And yes, in the best case, we'll discover that there are no regressions because all of the other analyses and lowering will do the transform as intended when it's profitable.

Just to drop a nit, here is a somewhat idiomatic pattern, that is recommended to avoid breaking strict aliasing: https://godbolt.org/z/_JNwOp
If we don't do this memcpy expansion where, will we have memcpy till the backend?
Surely this is not good.

That case (and a couple of similar tests that I tried) are handled by -sroa, so they probably never made it to instcombine in the 1st place. I don't know anything about SROA, but hopefully, it's making that transform using some principled logic. :)

[jfb]

In D35035#1253023, @spatel wrote:

In D35035#1252976, @lebedev.ri wrote:

In D35035#1252975, @spatel wrote:

In D35035#1252829, @hiraditya wrote:

In D35035#1252796, @SjoerdMeijer wrote:

Perhaps the impact is negligible, non-existent, and we worry about this for nothing. As also suggested earlier, I will try to get some numbers on the table for ARM and AArch64 if we strip out the lowering here, if that is helpful for this discussion, but probably need a day or two to get them.

If you could provide some numbers, I can go ahead and remove the inlining of memcpy altogether provided the reviewers agree with it, or we can merge this patch which is trying to improve on previously hardcoded numbers.

Yes, I support removing the expansion entirely, but I don't think we can commit that change without doing some advance perf testing.
And yes, in the best case, we'll discover that there are no regressions because all of the other analyses and lowering will do the transform as intended when it's profitable.

Just to drop a nit, here is a somewhat idiomatic pattern, that is recommended to avoid breaking strict aliasing: https://godbolt.org/z/_JNwOp
If we don't do this memcpy expansion where, will we have memcpy till the backend?
Surely this is not good.

That case (and a couple of similar tests that I tried) are handled by -sroa, so they probably never made it to instcombine in the 1st place. I don't know anything about SROA, but hopefully, it's making that transform using some principled logic. :)

clang also performs some of this work, even at O0.

[hiraditya]

In D35035#1252975, @spatel wrote:

In D35035#1252829, @hiraditya wrote:

In D35035#1252796, @SjoerdMeijer wrote:

Perhaps the impact is negligible, non-existent, and we worry about this for nothing. As also suggested earlier, I will try to get some numbers on the table for ARM and AArch64 if we strip out the lowering here, if that is helpful for this discussion, but probably need a day or two to get them.

If you could provide some numbers, I can go ahead and remove the inlining of memcpy altogether provided the reviewers agree with it, or we can merge this patch which is trying to improve on previously hardcoded numbers.

Yes, I support removing the expansion entirely, but I don't think we can commit that change without doing some advance perf testing.

Makes sense.

And yes, in the best case, we'll discover that there are no regressions because all of the other analyses and lowering will do the transform as intended when it's profitable.

If that doesn't work though, using LargestLegalIntTypeSizeInBits still seems like a good compromise to me. We want to conservatively limit the expansion to a size/type that the target tells us is ok (can be performed with a single load/store), and that's the value that most closely matches what we have today, so we avoid regressions as we work to the goal. It's not the ideal change, but there's precedence for this sort of datalayout use in instcombine (see InstCombiner::shouldChangeType()). Adding a new specifier to the datalayout to account for things like pair ops or vectors doesn't make sense to me - that moves us away from the goal of improving the other passes and removing the expansion in instcombine.

Do you think getting this patch in is a good for now. After some performance analysis if we find that we dont need to inline memcpy here then we can remove this entirely at a later stage.

[spatel]

In D35035#1253827, @hiraditya wrote:

Do you think getting this patch in is a good for now. After some performance analysis if we find that we dont need to inline memcpy here then we can remove this entirely at a later stage.

We should wait for the perf results from @SjoerdMeijer (and anyone else that is in a position to collect benchmark results?).
If the full solution (don't expand at all) is too ambitious, then I support continuing with this patch, but we need to make sure that we've answered @jfb's concerns. Ie, if the datalayout query is too distasteful, what is the alternative?

[SjoerdMeijer]

I am doing some experiments with a hack that simply comments out the call to InstCombiner::SimplifyAnyMemTransfer. I've ran 3 smaller benchmarks. 2 didn't show any difference. The 3rd shows 1 tiny regression and 1 tiny improvement in a test case, and will probably not even show a difference in the geomean. I am doing this as a background task; tomorrow I will ran bigger benchmarks, on different platforms. But I guess we need some numbers for non-Arm platforms too.

[hiraditya]

Any updates?

[SjoerdMeijer]

Oops, sorry, forgot to reply, and also got distracted by a few other things. I ran one bigger benchmark, and didn't see anything worth mentioning. A first preliminary conclusion: looks like we don't miss much by not doing this lowering here. Disclaimer: I've tested only on Arm targets, definitely not on all interesting architecture combinations, and a handful of benchmarks.

[lebedev.ri]

lib/Transforms/InstCombine/InstCombineCalls.cpp

140

I think this is still broken? (and thus, any and all benchmarks thus far are incorrect.)
As it was previously pointed out by @dmgreen, Size is bytes, while LargestInt is clearly in bits.

[hiraditya]

Fix testcases and address comments

[lebedev.ri]

Not sure what is the general consensus wrt this patch, but i guess it now consistently uses bytes.

lib/Transforms/InstCombine/InstCombineCalls.cpp

210

Nit: spaces around /.

[spatel]

In D35035#1281462, @lebedev.ri wrote:

Not sure what is the general consensus wrt this patch, but i guess it now consistently uses bytes.

Agree - the code change looks like what I expected now.

So:

1. Is @jfb objecting to this as an intermediate improvement?
2. If not, there are unanswered comments about the test diffs.
3. There was also an unanswered request for the targets and size/perf improvements for this change (presumably some 32-bit target shows wins).
4. Are there any updates on the perf for the ideal change (removing this expansion completely)?

[jfb]

In D35035#1282236, @spatel wrote:

In D35035#1281462, @lebedev.ri wrote:

Not sure what is the general consensus wrt this patch, but i guess it now consistently uses bytes.

Agree - the code change looks like what I expected now.

So:

1. Is @jfb objecting to this as an intermediate improvement?

My concern is here: https://reviews.llvm.org/D35035#inline-464768
This uses an unrelated constant to drive optimization decisions. Create a new per-target constant.

2. If not, there are unanswered comments about the test diffs.
3. There was also an unanswered request for the targets and size/perf improvements for this change (presumably some 32-bit target shows wins).
4. Are there any updates on the perf for the ideal change (removing this expansion completely)?

I do want to see size and perf results.

[hiraditya]

In D35035#1284164, @jfb wrote:

In D35035#1282236, @spatel wrote:

In D35035#1281462, @lebedev.ri wrote:

Not sure what is the general consensus wrt this patch, but i guess it now consistently uses bytes.

Agree - the code change looks like what I expected now.

So:

1. Is @jfb objecting to this as an intermediate improvement?

My concern is here: https://reviews.llvm.org/D35035#inline-464768
This uses an unrelated constant to drive optimization decisions. Create a new per-target constant.

I think the intent of this patch is to do best-effort without relying a lot on target specific constants. Will it help to have per-target constant only for mem* functions? Could that constant be used to drive other optimizations?

2. If not, there are unanswered comments about the test diffs.
3. There was also an unanswered request for the targets and size/perf improvements for this change (presumably some 32-bit target shows wins).
4. Are there any updates on the perf for the ideal change (removing this expansion completely)?

I do want to see size and perf results.

[jfb]

In D35035#1297082, @hiraditya wrote:

In D35035#1284164, @jfb wrote:

In D35035#1282236, @spatel wrote:

In D35035#1281462, @lebedev.ri wrote:

Not sure what is the general consensus wrt this patch, but i guess it now consistently uses bytes.

Agree - the code change looks like what I expected now.

So:

1. Is @jfb objecting to this as an intermediate improvement?

My concern is here: https://reviews.llvm.org/D35035#inline-464768
This uses an unrelated constant to drive optimization decisions. Create a new per-target constant.

I think the intent of this patch is to do best-effort without relying a lot on target specific constants. Will it help to have per-target constant only for mem* functions? Could that constant be used to drive other optimizations?

Yes, please add a constant which informs this optimization. Don't reuse an unrelated constant for this purpose. Don't use this new constant to dive other unrelated optimizations.

2. If not, there are unanswered comments about the test diffs.
3. There was also an unanswered request for the targets and size/perf improvements for this change (presumably some 32-bit target shows wins).
4. Are there any updates on the perf for the ideal change (removing this expansion completely)?

I do want to see size and perf results.

[mehdi_amini]

In D35035#1253023, @spatel wrote:

That case (and a couple of similar tests that I tried) are handled by -sroa, so they probably never made it to instcombine in the 1st place. I don't know anything about SROA, but hopefully, it's making that transform using some principled logic. :)

FYI: @chandlerc mentioned to me (in the context of https://bugs.llvm.org/show_bug.cgi?id=39780 ) that SROA expects instcombine to handle memcpy and promote them to registers.

lib/Transforms/InstCombine/InstCombineCalls.cpp

139

All I'm saying is that replacing MagicNumber == 8 with ErroneousUsage == LargestLegalIntTypeSizeInBits isn't what we should be doing.

@jfb can you elaborate why we shouldn't do that?

I'm not sure I understand why are you qualifying this as ErroneousUsage?
I can see that it would be suboptimal in some cases (and ideally it would be a TTI), but that does not enough to make it erroneous. I see a rational to consider that if I have a legal integer I can likely load/store it with a single pair of instructions. So it seems to me like a strict improvements over the existing "magic number".

[spatel]

In D35035#1308250, @mehdi_amini wrote:

In D35035#1253023, @spatel wrote:

That case (and a couple of similar tests that I tried) are handled by -sroa, so they probably never made it to instcombine in the 1st place. I don't know anything about SROA, but hopefully, it's making that transform using some principled logic. :)

FYI: @chandlerc mentioned to me (in the context of https://bugs.llvm.org/show_bug.cgi?id=39780 ) that SROA expects instcombine to handle memcpy and promote them to registers.

Is it possible to improve SROA to understand llvm.memcpy instead? IIUC, the memcpy intrinsic is considered canonical form, and the consensus in this review was that we would not expand memcpy in instcombine if that did not cause regressions.

D54887 is proposing a similar change as here, but it's more liberal. It would allow expansion to load/store of weird types (non-power-of-2) as long as they fit in a single integer register. That seems dangerous given that the backend isn't very good at handling those illegal types. Example:

target datalayout = "e-p:64:64:64-p1:32:32:32-p2:16:16:16-n8:16:32:64"
declare void @llvm.memcpy.p0i8.p0i8.i32(i8* nocapture, i8* nocapture, i32, i1) nounwind

define void @copy_3_bytes(i8* %d, i8* %s) {
  call void @llvm.memcpy.p0i8.p0i8.i32(i8* %d, i8* %s, i32 3, i1 false)
  ret void
}

$ opt -instcombine -S memcpy.ll
...
define void @copy_3_bytes(i8* %d, i8* %s) {
  %1 = bitcast i8* %s to i24*
  %2 = bitcast i8* %d to i24*
  %3 = load i24, i24* %1, align 1
  store i24 %3, i24* %2, align 1
  ret void
}

[jfb]

lib/Transforms/InstCombine/InstCombineCalls.cpp

139

Because we should be able to tune this magic number over time, per target, and using LargestLegalIntTypeSizeInBits doesn't allow us to do so. It's trivial to add this new magic number, and default it to LargestLegalIntTypeSizeInBits in the generic target setup. Let's just do that, and then the code is even self-documenting.

[lebedev.ri]

Data layout question wasn't resolved. (just signalling, i don't have a preference one way or another)

[chandlerc]

Thanks Roman.

@alnemr55 - Why did you mark this as accepted? Maybe it was an accidental click? If not, please don't mark things as accepted unless you've been actively participating in the review and the review has genuinely concluded.

[lebedev.ri]

This review seems to be stuck/dead, consider abandoning if no longer relevant.

lib/Transforms/InstCombine/InstCombineCalls.cpp

if (NumElements > 0) {
     Value *Src = AMI->getRawSource();
     Value *Dst = AMI->getRawDest();
     Type *ElementPointerType =
         Type::getIntNPtrTy(AMI->getContext(), ElementSizeInBits,
                            Src->getType()->getPointerAddressSpace());
 
     Value *SrcCasted = Builder->CreatePointerCast(Src, ElementPointerType,
                                                   "memcpy_unfold.src_casted");
     Value *DstCasted = Builder->CreatePointerCast(Dst, ElementPointerType,
                                                   "memcpy_unfold.dst_casted");
 
     for (uint64_t i = 0; i < NumElements; ++i) {
       // Get current element addresses
       ConstantInt *ElementIdxCI =
           ConstantInt::get(AMI->getContext(), APInt(64, i));
       Value *SrcElementAddr =
           Builder->CreateGEP(SrcCasted, ElementIdxCI, "memcpy_unfold.src_addr");
       Value *DstElementAddr =
           Builder->CreateGEP(DstCasted, ElementIdxCI, "memcpy_unfold.dst_addr");
 
       // Load from the source. Transfer alignment information and mark load as
       // unordered atomic.
       LoadInst *Load = Builder->CreateLoad(SrcElementAddr, "memcpy_unfold.val");
       Load->setOrdering(AtomicOrdering::Unordered);
       // We know alignment of the first element. It is also guaranteed by the
       // verifier that element size is less or equal than first element
Instruction *InstCombiner::SimplifyMemTransfer(MemIntrinsic *MI) {
   unsigned MinAlign = std::min(DstAlign, SrcAlign);
   unsigned CopyAlign = MI->getAlignment();
 
   if (CopyAlign < MinAlign) {
     MI->setAlignment(ConstantInt::get(MI->getAlignmentType(), MinAlign, false));
     return MI;
   }
 
   // If MemCpyInst length is 1/2/4/8 bytes then replace memcpy with
   // load/store.
   ConstantInt *MemOpLength = dyn_cast<ConstantInt>(MI->getArgOperand(2));
   if (!MemOpLength) return nullptr;
 
   // Source and destination pointer types are always "i8*" for intrinsic.  See
   // if the size is something we can handle with a single primitive load/store.
   // A single load+store correctly handles overlapping memory in the memmove
   // case.
   uint64_t Size = MemOpLength->getLimitedValue();
   assert(Size && "0-sized memory transferring should be removed already.");
 
-  if (Size > 8 || (Size&(Size-1)))
+
+  // Since we don't have perfect knowledge here, make some assumptions: assume
+  // the maximum allowed stores for memcpy operation is the same size as the 
+  // largest legal integer size. 
+  unsigned LargestInt = DL.getLargestLegalIntTypeSizeInBits();
+  if (LargestInt == 0)
+    LargestInt = 32;
+
+  if (Size > 2*LargestInt/8 || (Size&(Size-1)))
     return nullptr;  // If not 1/2/4/8 bytes, exit.
 
   // Use an integer load+store unless we can find something better.
   unsigned SrcAddrSp =
     cast<PointerType>(MI->getArgOperand(1)->getType())->getAddressSpace();
   unsigned DstAddrSp =
     cast<PointerType>(MI->getArgOperand(0)->getType())->getAddressSpace();
 
   IntegerType* IntType = IntegerType::get(MI->getContext(), Size<<3);
   Type *NewSrcPtrTy = PointerType::get(IntType, SrcAddrSp);
   Type *NewDstPtrTy = PointerType::get(IntType, DstAddrSp);
 
   // If the memcpy has metadata describing the members, see if we can get the

test/DebugInfo/X86/array2.ll

 ; }
 ;
 ; RUN: opt %s -O2 -S -o - | FileCheck %s
 ; Test that we correctly lower dbg.declares for arrays.
 ;
 ; CHECK: define i32 @main
 ; CHECK: call void @llvm.dbg.value(metadata i32 42, i64 0, metadata ![[ARRAY:[0-9]+]], metadata ![[EXPR:[0-9]+]])
 ; CHECK: ![[ARRAY]] = !DILocalVariable(name: "array",{{.*}} line: 6
 ; CHECK: ![[EXPR]] = !DIExpression(DW_OP_LLVM_fragment, 0, 32)
 target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128"
 target triple = "x86_64-apple-macosx10.9.0"
 
 @main.array = private unnamed_addr constant [4 x i32] [i32 0, i32 1, i32 2, i32 3], align 16
 
 ; Function Attrs: nounwind ssp uwtable
 define void @f(i32* %p) #0 !dbg !4 {
 entry:
entry:
   %array = alloca [4 x i32], align 16
   store i32 0, i32* %retval
   store i32 %argc, i32* %argc.addr, align 4
   call void @llvm.dbg.declare(metadata i32* %argc.addr, metadata !23, metadata !DIExpression()), !dbg !24
   store i8** %argv, i8*** %argv.addr, align 8
   call void @llvm.dbg.declare(metadata i8*** %argv.addr, metadata !25, metadata !DIExpression()), !dbg !24
   call void @llvm.dbg.declare(metadata [4 x i32]* %array, metadata !26, metadata !DIExpression()), !dbg !30
   %0 = bitcast [4 x i32]* %array to i8*, !dbg !30
-  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %0, i8* bitcast ([4 x i32]* @main.array to i8*), i64 16, i32 16, i1 false), !dbg !30
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %0, i8* bitcast ([4 x i32]* @main.array to i8*), i64 128, i32 16, i1 false), !dbg !30
   %arraydecay = getelementptr inbounds [4 x i32], [4 x i32]* %array, i32 0, i32 0, !dbg !31
   call void @f(i32* %arraydecay), !dbg !31
   %arrayidx = getelementptr inbounds [4 x i32], [4 x i32]* %array, i32 0, i64 0, !dbg !32
   %1 = load i32, i32* %arrayidx, align 4, !dbg !32
   ret i32 %1, !dbg !32
 }
 
 ; Function Attrs: nounwind

test/Transforms/InstCombine/builtin_memcpy_pattern.ll

+; RUN: opt -O2  < %s -S | FileCheck %s
+
+; ModuleID = '../memcpyTest/for_builtin_memcpy_test.c'
+source_filename = "../memcpyTest/for_builtin_memcpy_test.c"
+target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
+target triple = "x86_64-unknown-linux-gnu"
+
+@foo1.b = private unnamed_addr constant [8 x i32] [i32 3, i32 4, i32 5, i32 56, i32 6, i32 7, i32 78, i32 6], align 16
+@foo2.b = private unnamed_addr constant [8 x i32] [i32 3, i32 4, i32 5, i32 56, i32 6, i32 7, i32 78, i32 6], align 16
+@foo3.b = private unnamed_addr constant [8 x i32] [i32 3, i32 4, i32 5, i32 56, i32 6, i32 7, i32 78, i32 6], align 16
+@foo4.b = private unnamed_addr constant [8 x i32] [i32 3, i32 4, i32 5, i32 56, i32 6, i32 7, i32 78, i32 6], align 16
+@foo5.b = private unnamed_addr constant [8 x i32] [i32 3, i32 4, i32 5, i32 56, i32 6, i32 7, i32 78, i32 6], align 16
+@foo6.b = private unnamed_addr constant [16 x i32] [i32 3, i32 4, i32 5, i32 56, i32 6, i32 7, i32 78, i32 6, i32 3, i32 4, i32 54, i32 5, i32 1, i32 2, i32 3, i32 3], align 16
+
+; Function Attrs: nounwind uwtable
+define void @bar(i8* %a, i8* %b) #0 {
+entry:
+  %a.addr = alloca i8*, align 8
+  %b.addr = alloca i8*, align 8
+  store i8* %a, i8** %a.addr, align 8, !tbaa !2
+  store i8* %b, i8** %b.addr, align 8, !tbaa !2
+  %0 = load i8*, i8** %a.addr, align 8, !tbaa !2
+  %1 = load i8*, i8** %b.addr, align 8, !tbaa !2
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %0, i8* %1, i64 16, i32 1, i1 false)
+  ret void
+; CHECK-LABEL: @bar(
+; CHECK: store
+}
+
+; Function Attrs: argmemonly nounwind
+declare void @llvm.memcpy.p0i8.p0i8.i64(i8* nocapture writeonly, i8* nocapture readonly, i64, i32, i1) #1
+
+; Function Attrs: nounwind uwtable
+define void @foo(i8* %a, i8* %b, i32 %n) #0 {
+entry:
+  %a.addr = alloca i8*, align 8
+  %b.addr = alloca i8*, align 8
+  %n.addr = alloca i32, align 4
+  %i = alloca i32, align 4
+  store i8* %a, i8** %a.addr, align 8, !tbaa !2
+  store i8* %b, i8** %b.addr, align 8, !tbaa !2
+  store i32 %n, i32* %n.addr, align 4, !tbaa !6
+  %0 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.start.p0i8(i64 4, i8* %0) #2
+  store i32 0, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.cond:                                         ; preds = %for.inc, %entry
+  %1 = load i32, i32* %i, align 4, !tbaa !6
+  %2 = load i32, i32* %n.addr, align 4, !tbaa !6
+  %cmp = icmp ult i32 %1, %2
+  br i1 %cmp, label %for.body, label %for.end
+
+for.body:                                         ; preds = %for.cond
+  %3 = load i8*, i8** %a.addr, align 8, !tbaa !2
+  %4 = load i32, i32* %i, align 4, !tbaa !6
+  %idx.ext = sext i32 %4 to i64
+  %add.ptr = getelementptr inbounds i8, i8* %3, i64 %idx.ext
+  %5 = load i8*, i8** %b.addr, align 8, !tbaa !2
+  %6 = load i32, i32* %i, align 4, !tbaa !6
+  %idx.ext1 = sext i32 %6 to i64
+  %add.ptr2 = getelementptr inbounds i8, i8* %5, i64 %idx.ext1
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %add.ptr, i8* %add.ptr2, i64 16, i32 1, i1 false)
+  br label %for.inc
+
+for.inc:                                          ; preds = %for.body
+  %7 = load i32, i32* %i, align 4, !tbaa !6
+  %inc = add nsw i32 %7, 1
+  store i32 %inc, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.end:                                          ; preds = %for.cond
+  %8 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.end.p0i8(i64 4, i8* %8) #2
+  ret void
+; CHECK-LABEL: @foo(
+; CHECK: store
+; CHECK-NOT: @llvm.memcpy.p0i8.p0i8.i64
+}
+
+; Function Attrs: argmemonly nounwind
+declare void @llvm.lifetime.start.p0i8(i64, i8* nocapture) #1
+
+; Function Attrs: argmemonly nounwind
+declare void @llvm.lifetime.end.p0i8(i64, i8* nocapture) #1
+
+; Function Attrs: nounwind uwtable
+define void @foo1(i32* %a, i32 %n) #0 {
+entry:
+  %a.addr = alloca i32*, align 8
+  %n.addr = alloca i32, align 4
+  %b = alloca [8 x i32], align 16
+  %i = alloca i32, align 4
+  store i32* %a, i32** %a.addr, align 8, !tbaa !2
+  store i32 %n, i32* %n.addr, align 4, !tbaa !6
+  %0 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.lifetime.start.p0i8(i64 32, i8* %0) #2
+  %1 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %1, i8* bitcast ([8 x i32]* @foo1.b to i8*), i64 32, i32 16, i1 false)
+  %2 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.start.p0i8(i64 4, i8* %2) #2
+  store i32 0, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.cond:                                         ; preds = %for.inc, %entry
+  %3 = load i32, i32* %i, align 4, !tbaa !6
+  %4 = load i32, i32* %n.addr, align 4, !tbaa !6
+  %cmp = icmp ult i32 %3, %4
+  br i1 %cmp, label %for.body, label %for.end
+
+for.body:                                         ; preds = %for.cond
+  %5 = load i32*, i32** %a.addr, align 8, !tbaa !2
+  %6 = load i32, i32* %i, align 4, !tbaa !6
+  %idx.ext = sext i32 %6 to i64
+  %add.ptr = getelementptr inbounds i32, i32* %5, i64 %idx.ext
+  %7 = bitcast i32* %add.ptr to i8*
+  %arraydecay = getelementptr inbounds [8 x i32], [8 x i32]* %b, i32 0, i32 0
+  %8 = load i32, i32* %i, align 4, !tbaa !6
+  %idx.ext1 = sext i32 %8 to i64
+  %add.ptr2 = getelementptr inbounds i32, i32* %arraydecay, i64 %idx.ext1
+  %9 = bitcast i32* %add.ptr2 to i8*
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %7, i8* %9, i64 4, i32 4, i1 false)
+  br label %for.inc
+
+for.inc:                                          ; preds = %for.body
+  %10 = load i32, i32* %i, align 4, !tbaa !6
+  %inc = add nsw i32 %10, 1
+  store i32 %inc, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.end:                                          ; preds = %for.cond
+  %11 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.end.p0i8(i64 4, i8* %11) #2
+  %12 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.lifetime.end.p0i8(i64 32, i8* %12) #2
+  ret void
+; CHECK-LABEL: @foo1(
+; CHECK: @llvm.memcpy.p0i8.p0i8.i64
+; CHECK-NOT: store
+}
+
+; Function Attrs: nounwind uwtable
+define void @foo2(i32* %a, i32 %n) #0 {
+entry:
+  %a.addr = alloca i32*, align 8
+  %n.addr = alloca i32, align 4
+  %b = alloca [8 x i32], align 16
+  %i = alloca i32, align 4
+  store i32* %a, i32** %a.addr, align 8, !tbaa !2
+  store i32 %n, i32* %n.addr, align 4, !tbaa !6
+  %0 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.lifetime.start.p0i8(i64 32, i8* %0) #2
+  %1 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %1, i8* bitcast ([8 x i32]* @foo2.b to i8*), i64 32, i32 16, i1 false)
+  %2 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.start.p0i8(i64 4, i8* %2) #2
+  store i32 0, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.cond:                                         ; preds = %for.inc, %entry
+  %3 = load i32, i32* %i, align 4, !tbaa !6
+  %4 = load i32, i32* %n.addr, align 4, !tbaa !6
+  %cmp = icmp ult i32 %3, %4
+  br i1 %cmp, label %for.body, label %for.end
+
+for.body:                                         ; preds = %for.cond
+  %5 = load i32*, i32** %a.addr, align 8, !tbaa !2
+  %6 = load i32, i32* %i, align 4, !tbaa !6
+  %idx.ext = sext i32 %6 to i64
+  %add.ptr = getelementptr inbounds i32, i32* %5, i64 %idx.ext
+  %7 = bitcast i32* %add.ptr to i8*
+  %arraydecay = getelementptr inbounds [8 x i32], [8 x i32]* %b, i32 0, i32 0
+  %8 = load i32, i32* %i, align 4, !tbaa !6
+  %idx.ext1 = sext i32 %8 to i64
+  %add.ptr2 = getelementptr inbounds i32, i32* %arraydecay, i64 %idx.ext1
+  %9 = bitcast i32* %add.ptr2 to i8*
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %7, i8* %9, i64 8, i32 4, i1 false)
+  br label %for.inc
+
+for.inc:                                          ; preds = %for.body
+  %10 = load i32, i32* %i, align 4, !tbaa !6
+  %inc = add nsw i32 %10, 1
+  store i32 %inc, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.end:                                          ; preds = %for.cond
+  %11 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.end.p0i8(i64 4, i8* %11) #2
+  %12 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.lifetime.end.p0i8(i64 32, i8* %12) #2
+  ret void
+; CHECK-LABEL: @foo2(
+; CHECK: store
+; CHECK-NOT: @llvm.memcpy.p0i8.p0i8.i64
+}
+
+; Function Attrs: nounwind uwtable
+define void @foo3(i32* %a, i32 %n) #0 {
+entry:
+  %a.addr = alloca i32*, align 8
+  %n.addr = alloca i32, align 4
+  %b = alloca [8 x i32], align 16
+  %i = alloca i32, align 4
+  store i32* %a, i32** %a.addr, align 8, !tbaa !2
+  store i32 %n, i32* %n.addr, align 4, !tbaa !6
+  %0 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.lifetime.start.p0i8(i64 32, i8* %0) #2
+  %1 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %1, i8* bitcast ([8 x i32]* @foo3.b to i8*), i64 32, i32 16, i1 false)
+  %2 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.start.p0i8(i64 4, i8* %2) #2
+  store i32 0, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.cond:                                         ; preds = %for.inc, %entry
+  %3 = load i32, i32* %i, align 4, !tbaa !6
+  %4 = load i32, i32* %n.addr, align 4, !tbaa !6
+  %cmp = icmp ult i32 %3, %4
+  br i1 %cmp, label %for.body, label %for.end
+
+for.body:                                         ; preds = %for.cond
+  %5 = load i32*, i32** %a.addr, align 8, !tbaa !2
+  %6 = load i32, i32* %i, align 4, !tbaa !6
+  %mul = mul nsw i32 2, %6
+  %idx.ext = sext i32 %mul to i64
+  %add.ptr = getelementptr inbounds i32, i32* %5, i64 %idx.ext
+  %7 = bitcast i32* %add.ptr to i8*
+  %arraydecay = getelementptr inbounds [8 x i32], [8 x i32]* %b, i32 0, i32 0
+  %8 = load i32, i32* %i, align 4, !tbaa !6
+  %mul1 = mul nsw i32 2, %8
+  %idx.ext2 = sext i32 %mul1 to i64
+  %add.ptr3 = getelementptr inbounds i32, i32* %arraydecay, i64 %idx.ext2
+  %9 = bitcast i32* %add.ptr3 to i8*
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %7, i8* %9, i64 8, i32 4, i1 false)
+  br label %for.inc
+
+for.inc:                                          ; preds = %for.body
+  %10 = load i32, i32* %i, align 4, !tbaa !6
+  %inc = add nsw i32 %10, 1
+  store i32 %inc, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.end:                                          ; preds = %for.cond
+  %11 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.end.p0i8(i64 4, i8* %11) #2
+  %12 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.lifetime.end.p0i8(i64 32, i8* %12) #2
+  ret void
+; CHECK-LABEL: @foo3(
+; CHECK: @llvm.memcpy.p0i8.p0i8.i64
+; CHECK-NOT: store
+}
+
+; Function Attrs: nounwind uwtable
+define void @foo4(i32* %a, i32 %n) #0 {
+entry:
+  %a.addr = alloca i32*, align 8
+  %n.addr = alloca i32, align 4
+  %b = alloca [8 x i32], align 16
+  %i = alloca i32, align 4
+  store i32* %a, i32** %a.addr, align 8, !tbaa !2
+  store i32 %n, i32* %n.addr, align 4, !tbaa !6
+  %0 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.lifetime.start.p0i8(i64 32, i8* %0) #2
+  %1 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %1, i8* bitcast ([8 x i32]* @foo4.b to i8*), i64 32, i32 16, i1 false)
+  %2 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.start.p0i8(i64 4, i8* %2) #2
+  store i32 0, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.cond:                                         ; preds = %for.inc, %entry
+  %3 = load i32, i32* %i, align 4, !tbaa !6
+  %4 = load i32, i32* %n.addr, align 4, !tbaa !6
+  %cmp = icmp ult i32 %3, %4
+  br i1 %cmp, label %for.body, label %for.end
+
+for.body:                                         ; preds = %for.cond
+  %5 = load i32*, i32** %a.addr, align 8, !tbaa !2
+  %6 = load i32, i32* %i, align 4, !tbaa !6
+  %mul = mul nsw i32 2, %6
+  %idx.ext = sext i32 %mul to i64
+  %add.ptr = getelementptr inbounds i32, i32* %5, i64 %idx.ext
+  %7 = bitcast i32* %add.ptr to i8*
+  %arraydecay = getelementptr inbounds [8 x i32], [8 x i32]* %b, i32 0, i32 0
+  %8 = load i32, i32* %i, align 4, !tbaa !6
+  %mul1 = mul nsw i32 2, %8
+  %idx.ext2 = sext i32 %mul1 to i64
+  %add.ptr3 = getelementptr inbounds i32, i32* %arraydecay, i64 %idx.ext2
+  %9 = bitcast i32* %add.ptr3 to i8*
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %7, i8* %9, i64 16, i32 4, i1 false)
+  br label %for.inc
+
+for.inc:                                          ; preds = %for.body
+  %10 = load i32, i32* %i, align 4, !tbaa !6
+  %inc = add nsw i32 %10, 1
+  store i32 %inc, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.end:                                          ; preds = %for.cond
+  %11 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.end.p0i8(i64 4, i8* %11) #2
+  %12 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.lifetime.end.p0i8(i64 32, i8* %12) #2
+  ret void
+; CHECK-LABEL: @foo4(
+; CHECK: store
+; CHECK-NOT: @llvm.memcpy.p0i8.p0i8.i64
+}
+
+; Function Attrs: nounwind uwtable
+define void @foo5(i32* %a, i32 %n) #0 {
+entry:
+  %a.addr = alloca i32*, align 8
+  %n.addr = alloca i32, align 4
+  %b = alloca [8 x i32], align 16
+  %i = alloca i32, align 4
+  store i32* %a, i32** %a.addr, align 8, !tbaa !2
+  store i32 %n, i32* %n.addr, align 4, !tbaa !6
+  %0 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.lifetime.start.p0i8(i64 32, i8* %0) #2
+  %1 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %1, i8* bitcast ([8 x i32]* @foo5.b to i8*), i64 32, i32 16, i1 false)
+  %2 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.start.p0i8(i64 4, i8* %2) #2
+  store i32 0, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.cond:                                         ; preds = %for.inc, %entry
+  %3 = load i32, i32* %i, align 4, !tbaa !6
+  %4 = load i32, i32* %n.addr, align 4, !tbaa !6
+  %cmp = icmp ult i32 %3, %4
+  br i1 %cmp, label %for.body, label %for.end
+
+for.body:                                         ; preds = %for.cond
+  %5 = load i32*, i32** %a.addr, align 8, !tbaa !2
+  %6 = load i32, i32* %i, align 4, !tbaa !6
+  %mul = mul nsw i32 4, %6
+  %idx.ext = sext i32 %mul to i64
+  %add.ptr = getelementptr inbounds i32, i32* %5, i64 %idx.ext
+  %7 = bitcast i32* %add.ptr to i8*
+  %arraydecay = getelementptr inbounds [8 x i32], [8 x i32]* %b, i32 0, i32 0
+  %8 = load i32, i32* %i, align 4, !tbaa !6
+  %mul1 = mul nsw i32 4, %8
+  %idx.ext2 = sext i32 %mul1 to i64
+  %add.ptr3 = getelementptr inbounds i32, i32* %arraydecay, i64 %idx.ext2
+  %9 = bitcast i32* %add.ptr3 to i8*
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %7, i8* %9, i64 16, i32 4, i1 false)
+  br label %for.inc
+
+for.inc:                                          ; preds = %for.body
+  %10 = load i32, i32* %i, align 4, !tbaa !6
+  %inc = add nsw i32 %10, 1
+  store i32 %inc, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.end:                                          ; preds = %for.cond
+  %11 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.end.p0i8(i64 4, i8* %11) #2
+  %12 = bitcast [8 x i32]* %b to i8*
+  call void @llvm.lifetime.end.p0i8(i64 32, i8* %12) #2
+  ret void
+; CHECK-LABEL: @foo5(
+; CHECK: @llvm.memcpy.p0i8.p0i8.i64
+; CHECK-NOT: store
+}
+
+; Function Attrs: nounwind uwtable
+define void @foo6(i32* %a, i32 %n) #0 {
+entry:
+  %a.addr = alloca i32*, align 8
+  %n.addr = alloca i32, align 4
+  %b = alloca [16 x i32], align 16
+  %i = alloca i32, align 4
+  store i32* %a, i32** %a.addr, align 8, !tbaa !2
+  store i32 %n, i32* %n.addr, align 4, !tbaa !6
+  %0 = bitcast [16 x i32]* %b to i8*
+  call void @llvm.lifetime.start.p0i8(i64 64, i8* %0) #2
+  %1 = bitcast [16 x i32]* %b to i8*
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %1, i8* bitcast ([16 x i32]* @foo6.b to i8*), i64 64, i32 16, i1 false)
+  %2 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.start.p0i8(i64 4, i8* %2) #2
+  store i32 0, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.cond:                                         ; preds = %for.inc, %entry
+  %3 = load i32, i32* %i, align 4, !tbaa !6
+  %4 = load i32, i32* %n.addr, align 4, !tbaa !6
+  %cmp = icmp ult i32 %3, %4
+  br i1 %cmp, label %for.body, label %for.end
+
+for.body:                                         ; preds = %for.cond
+  %5 = load i32*, i32** %a.addr, align 8, !tbaa !2
+  %6 = load i32, i32* %i, align 4, !tbaa !6
+  %mul = mul nsw i32 8, %6
+  %idx.ext = sext i32 %mul to i64
+  %add.ptr = getelementptr inbounds i32, i32* %5, i64 %idx.ext
+  %7 = bitcast i32* %add.ptr to i8*
+  %arraydecay = getelementptr inbounds [16 x i32], [16 x i32]* %b, i32 0, i32 0
+  %8 = load i32, i32* %i, align 4, !tbaa !6
+  %mul1 = mul nsw i32 8, %8
+  %idx.ext2 = sext i32 %mul1 to i64
+  %add.ptr3 = getelementptr inbounds i32, i32* %arraydecay, i64 %idx.ext2
+  %9 = bitcast i32* %add.ptr3 to i8*
+  call void @llvm.memcpy.p0i8.p0i8.i64(i8* %7, i8* %9, i64 32, i32 4, i1 false)
+  br label %for.inc
+
+for.inc:                                          ; preds = %for.body
+  %10 = load i32, i32* %i, align 4, !tbaa !6
+  %inc = add nsw i32 %10, 1
+  store i32 %inc, i32* %i, align 4, !tbaa !6
+  br label %for.cond
+
+for.end:                                          ; preds = %for.cond
+  %11 = bitcast i32* %i to i8*
+  call void @llvm.lifetime.end.p0i8(i64 4, i8* %11) #2
+  %12 = bitcast [16 x i32]* %b to i8*
+  call void @llvm.lifetime.end.p0i8(i64 64, i8* %12) #2
+  ret void
+; CHECK-LABEL: @foo6(
+; CHECK: @llvm.memcpy.p0i8.p0i8.i64
+; CHECK-NOT: store
+}
+
+attributes #0 = { nounwind uwtable "correctly-rounded-divide-sqrt-fp-math"="false" "disable-tail-calls"="false" "less-precise-fpmad"="false" "no-frame-pointer-elim"="false" "no-infs-fp-math"="false" "no-jump-tables"="false" "no-nans-fp-math"="false" "no-signed-zeros-fp-math"="false" "no-trapping-math"="false" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+fxsr,+mmx,+sse,+sse2,+x87" "unsafe-fp-math"="false" "use-soft-float"="false" }
+attributes #1 = { argmemonly nounwind }
+attributes #2 = { nounwind }
+
+!llvm.module.flags = !{!0}
+!llvm.ident = !{!1}
+
+!0 = !{i32 1, !"wchar_size", i32 4}
+!1 = !{!"clang version 5.0.0 (https://github.com/llvm-mirror/clang.git 6cfb5bf41823be28bca09fe72dd3d4b83f4e1be8) (https://github.com/llvm-mirror/llvm.git 26c55932a492b686246e1f5cc85f916622eff8fe)"}
+!2 = !{!3, !3, i64 0}
+!3 = !{!"any pointer", !4, i64 0}
+!4 = !{!"omnipotent char", !5, i64 0}
+!5 = !{!"Simple C/C++ TBAA"}
+!6 = !{!7, !7, i64 0}
+!7 = !{!"int", !4, i64 0}