-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
; This testcase failed due to a bad assertion in SymbolTable.cpp, removed in
; the 1.20 revision. Basically the symbol table assumed that if there was an
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
; This testcase used to fail due to a lack of this diff in Value.cpp:
; diff -r1.16 Value.cpp
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
%Hosp = type { i32, i32, i32, { \2*, { i32, i32, i32, { [4 x \3], \2, \5, %Hosp, i32, i32 }* }*, \2* }, { \2*, { i32, i32, i32, { [4 x \3], \2, \5, %Hosp, i32, i32 }* }*, \2* }, { \2*, { i32, i32, i32, { [4 x \3], \2, \5, %Hosp, i32, i32 }* }*, \2* }, { \2*, { i32, i32, i32, { [4 x \3], \2, \5, %Hosp, i32, i32 }* }*, \2* } }
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
; Method arguments were being checked for collisions at the global scope before
; the method object was created by the parser. Because of this, false
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
; Another name collision problem. Here the problem was that if a forward
; declaration for a method was found, that this would cause spurious conflicts
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
type { { \2 *, \4 ** },
{ \2 *, \4 ** }
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
%t = type { { \2*, \2 },
{ \2*, \2 }
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
%Hosp = type { { \2*, { \2, %Hosp }* }, { \2*, { \2, %Hosp }* } }
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
; It looks like the assembler is not forward resolving the function declaraion
; correctly.
; This file takes about 48 __MINUTES__ to assemble using as. This is WAY too
; long. The type resolution code needs to be sped up a lot.
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
%ALL_INTERSECTIONS_METHOD = type i32 (%OBJECT*, %RAY*, %ISTACK*)*
%BBOX = type { %BBOX_VECT, %BBOX_VECT }
%BBOX_TREE = type { i16, i16, %BBOX, %BBOX_TREE** }
; Make sure we don't get an assertion failure, even though this is a parse
; error
-; RUN: not llvm-as < %s -o /dev/null -f |& grep {No arguments}
+; RUN: not llvm-as %s -o /dev/null -f |& grep {No arguments}
%ty = type void (i32)
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
define void @test(i32 %X) {
call void @test( i32 6 )
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
@.LC0 = internal global [12 x i8] c"hello world\00" ; <[12 x i8]*> [#uses=1]
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
@.LC0 = internal global [12 x i8] c"hello world\00" ; <[12 x i8]*> [#uses=1]
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
; Dominance relationships is not calculated correctly for unreachable blocks,
; which causes the verifier to barf on this input.
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
; This testcase comes from the following really simple c file:
;; int foo[30000]
;;; We should not be soo slow for such a simple case!
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
declare i32 @"ArrayRef"([100 x i32] * %Array)
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
@X = external global i32*
@X1 = external global %T*
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
@spell_order = global [4 x i8] c"\FF\00\F7\00"
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
; There should be absolutely no problem with this testcase.
define i32 @test(i32 %arg1, i32 %arg2) {
; This bug was caused by two CPR's existing for the same global variable,
; colliding in the Module level CPR map.
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
define void @test() {
call void (...)* bitcast (void (i16*, i32)* @AddString to void (...)*)( i16* null, i32 0 )
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
; Check minimal switch statement
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
; Test that shift instructions can be used in constant expressions.
global i32 3670016
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
; The old C front-end never generated empty structures, now the new one
; can. For some reason we never handled them in the parser. Weird.
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
%MidFnTy = type void (%MidFnTy*)
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
%T = type i32
@X = global i32* null ; <i32**> [#uses=0]
-; RUN: not llvm-as < %s -o /dev/null -f |& grep {Undefined type remains}
+; RUN: not llvm-as %s -o /dev/null -f |& grep {Undefined type remains}
; END.
@d_reduction_0_dparser_gram = global {
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
; %inc2 uses it's own value, but that's ok, as it's unreachable!
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
define i32* @t1({ float, i32 }* %X) {
%W = getelementptr { float, i32 }* %X, i32 20, i32 1 ; <i32*> [#uses=0]
; Check to see that the verifier does not take an outrageous amount of time on
; this testcase.
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
%"complex long double" = type { double, double }
%"struct.std::dcomplex" = type { %"complex long double" }
;; The bytecode writer was trying to treat undef values as ConstantArray's when
;; they looked like strings.
-;; RUN: llvm-as < %s -o /dev/null -f
+;; RUN: llvm-as %s -o /dev/null -f
@G = internal global [8 x i8] undef
; Test for PR463. This program is erroneous, but should not crash llvm-as.
-; RUN: not llvm-as < %s -o /dev/null -f |& \
+; RUN: not llvm-as %s -o /dev/null -f |& \
; RUN: grep {Cannot create a null initialized value of this type}
@.FOO = internal global %struct.none zeroinitializer
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
define void @test() {
call {i32} @foo()
; The assembler should catch an undefined argument type .
-; RUN: not llvm-as < %s -o /dev/null -f |& grep {Reference to abstract argument}
+; RUN: not llvm-as %s -o /dev/null -f |& grep {Reference to abstract argument}
; %typedef.bc_struct = type opaque
; Test Case for PR1080
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
@str = internal constant [4 x i8] c"-ga\00" ; <[4 x i8]*> [#uses=2]
; PR1117
-; RUN: not llvm-as < %s -o /dev/null -f |& grep {invalid cast opcode for cast from}
+; RUN: not llvm-as %s -o /dev/null -f |& grep {invalid cast opcode for cast from}
define i8* @nada(i64 %X) {
%result = trunc i64 %X to i8*
; PR1117
-; RUN: not llvm-as < %s -o /dev/null -f |& grep {invalid cast opcode for cast from}
+; RUN: not llvm-as %s -o /dev/null -f |& grep {invalid cast opcode for cast from}
@X = constant i8* trunc (i64 0 to i8*)
-; RUN: not llvm-as < %s -o /dev/null -f |& grep {Call to invalid LLVM intrinsic}
+; RUN: not llvm-as %s -o /dev/null -f |& grep {Call to invalid LLVM intrinsic}
declare i32 @llvm.foobar(i32 %foo)
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
define i32 @test(i1 %C, i32 %V1, i32 %V2) {
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
define void @test(i32* %P, i32* %Q) {
entry:
-; RUN: llvm-as < %s -o - | llc
+; RUN: llvm-as %s -o - | llc
; This caused the backend to assert out with:
; SparcInstrInfo.cpp:103: failed assertion `0 && "Unexpected unsigned type"'
-; RUN: llvm-as < %s -o - | llc
+; RUN: llvm-as %s -o - | llc
; July 6, 2002 -- LLC Regression test
; This test case checks if the integer CC register %xcc (or %ccr)
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
@.LC0 = internal global [10 x i8] c"argc: %d\0A\00" ; <[10 x i8]*> [#uses=1]
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define i32 @foo(i32 %X, i32 %Y, double %A) {
-; RUN: llvm-as < %s -o %t.bc -f
+; RUN: llvm-as %s -o %t.bc -f
; RUN: lli %t.bc > /dev/null
define i32 @main() {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define i32 @main() {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
; We were accidentally inverting the signedness of right shifts. Whoops.
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define i32 @main() {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define i32 @bar(i8* %X) {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
target datalayout = "e-p:32:32"
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
; Testcase distilled from 256.bzip2.
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
; Testcase distilled from 256.bzip2.
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
; This testcase failed to work because two variable sized allocas confused the
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
;
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
; This testcase exposes a bug in the local register allocator where it runs out
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
@A = global i32 0 ; <i32*> [#uses=1]
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli -debug-only=jit %t.bc |& not grep {Finished CodeGen of .*Function: F}
@.str_1 = internal constant [7 x i8] c"IN F!\0A\00" ; <[7 x i8]*> [#uses=1]
@.str_2 = internal constant [7 x i8] c"IN G!\0A\00" ; <[7 x i8]*> [#uses=1]
-; RUN: llvm-as < %s -o - | lli -force-interpreter
+; RUN: llvm-as %s -o - | lli -force-interpreter
; PR1836
define i32 @main() {
-; RUN: llvm-as < %s -o - | lli -force-interpreter
+; RUN: llvm-as %s -o - | lli -force-interpreter
target datalayout = "E"
-; RUN: llvm-as < %s -o - | lli -force-interpreter
+; RUN: llvm-as %s -o - | lli -force-interpreter
target datalayout = "e"
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
@.LC0 = internal global [12 x i8] c"Hello World\00" ; <[12 x i8]*> [#uses=1]
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
@X = global i32 7 ; <i32*> [#uses=0]
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define i32 @main() {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define i32 @bar() {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
; test unconditional branch
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
declare void @exit(i32)
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define i32 @foo() {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
; This tests to make sure that we can evaluate weird constant expressions
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define double @test(double* %DP, double %Arg) {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define void @test(i8* %P, i16* %P.upgrd.1, i32* %P.upgrd.2, i64* %P.upgrd.3) {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define i32 @main() {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define i32 @main() {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define i32 @main() {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
; test phi node
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
; test return instructions
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define i32 @main() {
-; RUN: llvm-as < %s -f -o %t.bc
+; RUN: llvm-as %s -f -o %t.bc
; RUN: lli %t.bc > /dev/null
define i32 @main() {
-; RUN: not llvm-as < %s -o /dev/null -f |& grep \
+; RUN: not llvm-as %s -o /dev/null -f |& grep \
; RUN: "Redefinition of global variable named 'B'"
; END.
; one...
; RUN: echo {define internal i32 @foo() \{ ret i32 7 \} } | llvm-as > %t.1.bc
-; RUN: llvm-as < %s -o %t.2.bc -f
+; RUN: llvm-as %s -o %t.2.bc -f
; RUN: llvm-link %t.1.bc %t.2.bc | llvm-dis | grep @foo() | grep -v internal
define i32 @foo() { ret i32 0 }
; RUN: echo {@X = linkonce global i32 5 \
; RUN: define linkonce i32 @foo() \{ ret i32 7 \} } | llvm-as > %t.1.bc
-; RUN: llvm-as < %s -o %t.2.bc -f
+; RUN: llvm-as %s -o %t.2.bc -f
; RUN: llvm-link %t.1.bc %t.2.bc
@X = external global i32
; RUN: echo { define linkonce void @foo() \{ ret void \} } | \
; RUN: llvm-as -o %t.2.bc -f
-; RUN: llvm-as < %s -o %t.1.bc -f
+; RUN: llvm-as %s -o %t.1.bc -f
; RUN: llvm-link %t.1.bc %t.2.bc | llvm-dis | grep foo | grep linkonce
declare void @foo()
; the same type to be created!
; RUN: echo {%T = type i32} | llvm-as > %t.2.bc
-; RUN: llvm-as < %s -f > %t.1.bc
+; RUN: llvm-as %s -f -o %t.1.bc
; RUN: llvm-link %t.1.bc %t.2.bc
%T = type opaque
-; RUN: llvm-as < %s -f -o %t1.bc
+; RUN: llvm-as %s -f -o %t1.bc
; RUN: llvm-as < %p/2004-05-07-TypeResolution2.ll -o %t2.bc -f
; RUN: llvm-link -f -o %t3.bc %t1.bc %t2.bc
-; RUN: llvm-as < %s -f -o %t1.bc
+; RUN: llvm-as %s -f -o %t1.bc
; RUN: llvm-link -f -o %t2.bc %t1.bc
target datalayout = "E-p:32:32"
-; RUN: llvm-as < %s -o - | opt -inline | llvm-dis | grep nounwind
-; RUN: llvm-as < %s -o - | opt -inline | llvm-dis | grep unreachable
+; RUN: llvm-as %s -o - | opt -inline | llvm-dis | grep nounwind
+; RUN: llvm-as %s -o - | opt -inline | llvm-dis | grep unreachable
declare i1 @extern()
; be eliminated. In many cases the setCC is also eliminated based on the
; constant value and the range of the casted value.
;
-; RUN: llvm-as < %s -o - | opt -instcombine | llvm-dis | \
+; RUN: llvm-as %s -o - | opt -instcombine | llvm-dis | \
; RUN: notcast .*int
; END.
define i1 @lt_signed_to_large_unsigned(i8 %SB) {
; The optimizer should be able to remove cast operation here.
-; RUN: llvm-as < %s -o - | opt -instcombine | llvm-dis | \
+; RUN: llvm-as %s -o - | opt -instcombine | llvm-dis | \
; RUN: not grep sext.*i32
define i1 @eq_signed_to_small_unsigned(i8 %SB) {
-; RUN: not llvm-as < %s -o /dev/null
+; RUN: not llvm-as %s -o /dev/null
%struct = type { }
-; RUN: not llvm-as < %s -o /dev/null -f
+; RUN: not llvm-as %s -o /dev/null -f
declare void @h(i32 byval %num)
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
%s = type opaque
declare void @h(%s* byval %num)
-; RUN: llvm-as < %s -o /dev/null -f
+; RUN: llvm-as %s -o /dev/null -f
%struct.foo = type { i64 }
declare void @h(%struct.foo* byval %num)
-; RUN: not llvm-as < %s -f |& grep {not verify as correct}
+; RUN: not llvm-as %s -f |& grep {not verify as correct}
; PR1042
define i32 @foo() {