mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-11-01 00:11:00 +00:00
7c9c6ed761
Essentially the same as the GEP change in r230786.
A similar migration script can be used to update test cases, though a few more
test case improvements/changes were required this time around: (r229269-r229278)
import fileinput
import sys
import re
pat = re.compile(r"((?:=|:|^)\s*load (?:atomic )?(?:volatile )?(.*?))(| addrspace\(\d+\) *)\*($| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$)")
for line in sys.stdin:
sys.stdout.write(re.sub(pat, r"\1, \2\3*\4", line))
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7649
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@230794 91177308-0d34-0410-b5e6-96231b3b80d8
56 lines
1.8 KiB
LLVM
56 lines
1.8 KiB
LLVM
; RUN: opt -S -gvn -enable-load-pre < %s | FileCheck %s
|
|
;
|
|
; Make sure the load in bb3.backedge is removed and moved into bb1 after the
|
|
; call. This makes the non-call case faster.
|
|
;
|
|
; This test is derived from this C++ code (GCC PR 37810):
|
|
; void g();
|
|
; struct A {
|
|
; int n; int m;
|
|
; A& operator++(void) { ++n; if (n == m) g(); return *this; }
|
|
; A() : n(0), m(0) { }
|
|
; friend bool operator!=(A const& a1, A const& a2) { return a1.n != a2.n; }
|
|
; };
|
|
; void testfunction(A& iter) { A const end; while (iter != end) ++iter; }
|
|
;
|
|
target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:128:128"
|
|
target triple = "i386-apple-darwin7"
|
|
%struct.A = type { i32, i32 }
|
|
|
|
define void @_Z12testfunctionR1A(%struct.A* %iter) {
|
|
entry:
|
|
%0 = getelementptr %struct.A, %struct.A* %iter, i32 0, i32 0 ; <i32*> [#uses=3]
|
|
%1 = load i32, i32* %0, align 4 ; <i32> [#uses=2]
|
|
%2 = icmp eq i32 %1, 0 ; <i1> [#uses=1]
|
|
br i1 %2, label %return, label %bb.nph
|
|
|
|
bb.nph: ; preds = %entry
|
|
%3 = getelementptr %struct.A, %struct.A* %iter, i32 0, i32 1 ; <i32*> [#uses=1]
|
|
br label %bb
|
|
|
|
bb: ; preds = %bb3.backedge, %bb.nph
|
|
%.rle = phi i32 [ %1, %bb.nph ], [ %7, %bb3.backedge ] ; <i32> [#uses=1]
|
|
%4 = add i32 %.rle, 1 ; <i32> [#uses=2]
|
|
store i32 %4, i32* %0, align 4
|
|
%5 = load i32, i32* %3, align 4 ; <i32> [#uses=1]
|
|
%6 = icmp eq i32 %4, %5 ; <i1> [#uses=1]
|
|
br i1 %6, label %bb1, label %bb3.backedge
|
|
|
|
bb1: ; preds = %bb
|
|
tail call void @_Z1gv()
|
|
br label %bb3.backedge
|
|
|
|
bb3.backedge: ; preds = %bb, %bb1
|
|
; CHECK: bb3.backedge:
|
|
; CHECK-NEXT: phi
|
|
; CHECK-NEXT: icmp
|
|
%7 = load i32, i32* %0, align 4 ; <i32> [#uses=2]
|
|
%8 = icmp eq i32 %7, 0 ; <i1> [#uses=1]
|
|
br i1 %8, label %return, label %bb
|
|
|
|
return: ; preds = %bb3.backedge, %entry
|
|
ret void
|
|
}
|
|
|
|
declare void @_Z1gv()
|