mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-07-19 19:30:10 +00:00
7c65d4345e
Make use of the END. facility on all files > 1K so that we aren't wasting CPU cycles searching for RUN: lines that we'll never find. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@36059 91177308-0d34-0410-b5e6-96231b3b80d8
48 lines
1.2 KiB
LLVM
48 lines
1.2 KiB
LLVM
;
|
|
; Test: ExternalConstant
|
|
;
|
|
; Description:
|
|
; This regression test helps check whether the instruction combining
|
|
; optimization pass correctly handles global variables which are marked
|
|
; as external and constant.
|
|
;
|
|
; If a problem occurs, we should die on an assert(). Otherwise, we
|
|
; should pass through the optimizer without failure.
|
|
;
|
|
; Extra code:
|
|
; RUN: llvm-upgrade < %s | llvm-as | opt -instcombine
|
|
; END.
|
|
;
|
|
|
|
target endian = little
|
|
target pointersize = 32
|
|
%silly = external constant int ; <int*> [#uses=1]
|
|
|
|
implementation ; Functions:
|
|
|
|
declare void %bzero(sbyte*, uint)
|
|
|
|
declare void %bcopy(sbyte*, sbyte*, uint)
|
|
|
|
declare int %bcmp(sbyte*, sbyte*, uint)
|
|
|
|
declare int %fputs(sbyte*, sbyte*)
|
|
|
|
declare int %fputs_unlocked(sbyte*, sbyte*)
|
|
|
|
int %function(int %a.1) {
|
|
entry: ; No predecessors!
|
|
%a.0 = alloca int ; <int*> [#uses=2]
|
|
%result = alloca int ; <int*> [#uses=2]
|
|
store int %a.1, int* %a.0
|
|
%tmp.0 = load int* %a.0 ; <int> [#uses=1]
|
|
%tmp.1 = load int* %silly ; <int> [#uses=1]
|
|
%tmp.2 = add int %tmp.0, %tmp.1 ; <int> [#uses=1]
|
|
store int %tmp.2, int* %result
|
|
br label %return
|
|
|
|
return: ; preds = %entry
|
|
%tmp.3 = load int* %result ; <int> [#uses=1]
|
|
ret int %tmp.3
|
|
}
|