diff --git a/test/CodeGen/PowerPC/pr16556-2.ll b/test/CodeGen/PowerPC/pr16556-2.ll index f6328ac766a..e2dae4573c7 100644 --- a/test/CodeGen/PowerPC/pr16556-2.ll +++ b/test/CodeGen/PowerPC/pr16556-2.ll @@ -1,41 +1,41 @@ -; RUN: llc < %s - -; This test formerly failed because of wrong custom lowering for -; fptosi of ppc_fp128. - -target datalayout = "E-p:32:32:32-S0-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f16:16:16-f32:32:32-f64:64:64-f128:64:128-v64:64:64-v128:128:128-a0:0:64-n32" -target triple = "powerpc-unknown-linux-gnu" - -%core.time.TickDuration = type { i64 } - -@_D4core4time12TickDuration11ticksPerSecyl = global i64 0 -@.str5 = internal unnamed_addr constant [40 x i8] c"..\5Cldc\5Cruntime\5Cdruntime\5Csrc\5Ccore\5Ctime.d\00" -@.str83 = internal constant [10 x i8] c"null this\00" -@.modulefilename = internal constant { i32, i8* } { i32 39, i8* getelementptr inbounds ([40 x i8]* @.str5, i32 0, i32 0) } - -declare i8* @_d_assert_msg({ i32, i8* }, { i32, i8* }, i32) - - -define weak_odr fastcc i64 @_D4core4time12TickDuration30__T2toVAyaa7_7365636f6e6473TlZ2toMxFNaNbNfZl(%core.time.TickDuration* %.this_arg) { -entry: - %unitsPerSec = alloca i64, align 8 - %tmp = icmp ne %core.time.TickDuration* %.this_arg, null - br i1 %tmp, label %noassert, label %assert - -assert: ; preds = %entry - %tmp1 = load { i32, i8* }* @.modulefilename - %0 = call i8* @_d_assert_msg({ i32, i8* } { i32 9, i8* getelementptr inbounds ([10 x i8]* @.str83, i32 0, i32 0) }, { i32, i8* } %tmp1, i32 1586) - unreachable - -noassert: ; preds = %entry - %tmp2 = getelementptr %core.time.TickDuration* %.this_arg, i32 0, i32 0 - %tmp3 = load i64* %tmp2 - %tmp4 = sitofp i64 %tmp3 to ppc_fp128 - %tmp5 = load i64* @_D4core4time12TickDuration11ticksPerSecyl - %tmp6 = sitofp i64 %tmp5 to ppc_fp128 - %tmp7 = fdiv ppc_fp128 %tmp6, 0xM80000000000000000000000000000000 - %tmp8 = fdiv ppc_fp128 %tmp4, %tmp7 - %tmp9 = fptosi ppc_fp128 %tmp8 to i64 - ret i64 %tmp9 -} - +; RUN: llc < %s + +; This test formerly failed because of wrong custom lowering for +; fptosi of ppc_fp128. + +target datalayout = "E-p:32:32:32-S0-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f16:16:16-f32:32:32-f64:64:64-f128:64:128-v64:64:64-v128:128:128-a0:0:64-n32" +target triple = "powerpc-unknown-linux-gnu" + +%core.time.TickDuration = type { i64 } + +@_D4core4time12TickDuration11ticksPerSecyl = global i64 0 +@.str5 = internal unnamed_addr constant [40 x i8] c"..\5Cldc\5Cruntime\5Cdruntime\5Csrc\5Ccore\5Ctime.d\00" +@.str83 = internal constant [10 x i8] c"null this\00" +@.modulefilename = internal constant { i32, i8* } { i32 39, i8* getelementptr inbounds ([40 x i8]* @.str5, i32 0, i32 0) } + +declare i8* @_d_assert_msg({ i32, i8* }, { i32, i8* }, i32) + + +define weak_odr fastcc i64 @_D4core4time12TickDuration30__T2toVAyaa7_7365636f6e6473TlZ2toMxFNaNbNfZl(%core.time.TickDuration* %.this_arg) { +entry: + %unitsPerSec = alloca i64, align 8 + %tmp = icmp ne %core.time.TickDuration* %.this_arg, null + br i1 %tmp, label %noassert, label %assert + +assert: ; preds = %entry + %tmp1 = load { i32, i8* }* @.modulefilename + %0 = call i8* @_d_assert_msg({ i32, i8* } { i32 9, i8* getelementptr inbounds ([10 x i8]* @.str83, i32 0, i32 0) }, { i32, i8* } %tmp1, i32 1586) + unreachable + +noassert: ; preds = %entry + %tmp2 = getelementptr %core.time.TickDuration* %.this_arg, i32 0, i32 0 + %tmp3 = load i64* %tmp2 + %tmp4 = sitofp i64 %tmp3 to ppc_fp128 + %tmp5 = load i64* @_D4core4time12TickDuration11ticksPerSecyl + %tmp6 = sitofp i64 %tmp5 to ppc_fp128 + %tmp7 = fdiv ppc_fp128 %tmp6, 0xM80000000000000000000000000000000 + %tmp8 = fdiv ppc_fp128 %tmp4, %tmp7 + %tmp9 = fptosi ppc_fp128 %tmp8 to i64 + ret i64 %tmp9 +} + diff --git a/test/CodeGen/X86/avx2-shuffle.ll b/test/CodeGen/X86/avx2-shuffle.ll index cf319cb7fe1..0e6dd297f8d 100644 --- a/test/CodeGen/X86/avx2-shuffle.ll +++ b/test/CodeGen/X86/avx2-shuffle.ll @@ -54,10 +54,10 @@ define <8 x float> @blend_test3(<8 x float> %a, <8 x float> %b) nounwind alwaysi ; CHECK: blend_test4 ; CHECK: vblendpd -; CHECK: ret -define <4 x i64> @blend_test4(<4 x i64> %a, <4 x i64> %b) nounwind alwaysinline { - %t = shufflevector <4 x i64> %a, <4 x i64> %b, <4 x i32> - ret <4 x i64> %t +; CHECK: ret +define <4 x i64> @blend_test4(<4 x i64> %a, <4 x i64> %b) nounwind alwaysinline { + %t = shufflevector <4 x i64> %a, <4 x i64> %b, <4 x i32> + ret <4 x i64> %t } ; CHECK: vpshufhw $27, %ymm diff --git a/unittests/ExecutionEngine/MCJIT/MCJITMemoryManagerTest.cpp b/unittests/ExecutionEngine/MCJIT/MCJITMemoryManagerTest.cpp index 9e0b35395e5..f6dbf984508 100644 --- a/unittests/ExecutionEngine/MCJIT/MCJITMemoryManagerTest.cpp +++ b/unittests/ExecutionEngine/MCJIT/MCJITMemoryManagerTest.cpp @@ -1,172 +1,172 @@ -//===- MCJITMemoryManagerTest.cpp - Unit tests for the JIT memory manager -===// -// -// The LLVM Compiler Infrastructure -// -// This file is distributed under the University of Illinois Open Source -// License. See LICENSE.TXT for details. -// -//===----------------------------------------------------------------------===// - -#include "llvm/ExecutionEngine/SectionMemoryManager.h" -#include "llvm/ADT/OwningPtr.h" -#include "llvm/ExecutionEngine/JIT.h" -#include "gtest/gtest.h" - -using namespace llvm; - -namespace { - -TEST(MCJITMemoryManagerTest, BasicAllocations) { - OwningPtr MemMgr(new SectionMemoryManager()); - - uint8_t *code1 = MemMgr->allocateCodeSection(256, 0, 1); - uint8_t *data1 = MemMgr->allocateDataSection(256, 0, 2, true); - uint8_t *code2 = MemMgr->allocateCodeSection(256, 0, 3); - uint8_t *data2 = MemMgr->allocateDataSection(256, 0, 4, false); - - EXPECT_NE((uint8_t*)0, code1); - EXPECT_NE((uint8_t*)0, code2); - EXPECT_NE((uint8_t*)0, data1); - EXPECT_NE((uint8_t*)0, data2); - - // Initialize the data - for (unsigned i = 0; i < 256; ++i) { - code1[i] = 1; - code2[i] = 2; - data1[i] = 3; - data2[i] = 4; - } - - // Verify the data (this is checking for overlaps in the addresses) - for (unsigned i = 0; i < 256; ++i) { - EXPECT_EQ(1, code1[i]); - EXPECT_EQ(2, code2[i]); - EXPECT_EQ(3, data1[i]); - EXPECT_EQ(4, data2[i]); - } - - std::string Error; - EXPECT_FALSE(MemMgr->finalizeMemory(&Error)); -} - -TEST(MCJITMemoryManagerTest, LargeAllocations) { - OwningPtr MemMgr(new SectionMemoryManager()); - - uint8_t *code1 = MemMgr->allocateCodeSection(0x100000, 0, 1); - uint8_t *data1 = MemMgr->allocateDataSection(0x100000, 0, 2, true); - uint8_t *code2 = MemMgr->allocateCodeSection(0x100000, 0, 3); - uint8_t *data2 = MemMgr->allocateDataSection(0x100000, 0, 4, false); - - EXPECT_NE((uint8_t*)0, code1); - EXPECT_NE((uint8_t*)0, code2); - EXPECT_NE((uint8_t*)0, data1); - EXPECT_NE((uint8_t*)0, data2); - - // Initialize the data - for (unsigned i = 0; i < 0x100000; ++i) { - code1[i] = 1; - code2[i] = 2; - data1[i] = 3; - data2[i] = 4; - } - - // Verify the data (this is checking for overlaps in the addresses) - for (unsigned i = 0; i < 0x100000; ++i) { - EXPECT_EQ(1, code1[i]); - EXPECT_EQ(2, code2[i]); - EXPECT_EQ(3, data1[i]); - EXPECT_EQ(4, data2[i]); - } - - std::string Error; - EXPECT_FALSE(MemMgr->finalizeMemory(&Error)); -} - -TEST(MCJITMemoryManagerTest, ManyAllocations) { - OwningPtr MemMgr(new SectionMemoryManager()); - - uint8_t* code[10000]; - uint8_t* data[10000]; - - for (unsigned i = 0; i < 10000; ++i) { - const bool isReadOnly = i % 2 == 0; - - code[i] = MemMgr->allocateCodeSection(32, 0, 1); - data[i] = MemMgr->allocateDataSection(32, 0, 2, isReadOnly); - - for (unsigned j = 0; j < 32; j++) { - code[i][j] = 1 + (i % 254); - data[i][j] = 2 + (i % 254); - } - - EXPECT_NE((uint8_t *)0, code[i]); - EXPECT_NE((uint8_t *)0, data[i]); - } - - // Verify the data (this is checking for overlaps in the addresses) - for (unsigned i = 0; i < 10000; ++i) { - for (unsigned j = 0; j < 32;j++ ) { - uint8_t ExpectedCode = 1 + (i % 254); - uint8_t ExpectedData = 2 + (i % 254); - EXPECT_EQ(ExpectedCode, code[i][j]); - EXPECT_EQ(ExpectedData, data[i][j]); - } - } - - std::string Error; - EXPECT_FALSE(MemMgr->finalizeMemory(&Error)); -} - -TEST(MCJITMemoryManagerTest, ManyVariedAllocations) { - OwningPtr MemMgr(new SectionMemoryManager()); - - uint8_t* code[10000]; - uint8_t* data[10000]; - - for (unsigned i = 0; i < 10000; ++i) { - uintptr_t CodeSize = i % 16 + 1; - uintptr_t DataSize = i % 8 + 1; - - bool isReadOnly = i % 3 == 0; - unsigned Align = 8 << (i % 4); - - code[i] = MemMgr->allocateCodeSection(CodeSize, Align, i); - data[i] = MemMgr->allocateDataSection(DataSize, Align, i + 10000, - isReadOnly); - - for (unsigned j = 0; j < CodeSize; j++) { - code[i][j] = 1 + (i % 254); - } - - for (unsigned j = 0; j < DataSize; j++) { - data[i][j] = 2 + (i % 254); - } - - EXPECT_NE((uint8_t *)0, code[i]); - EXPECT_NE((uint8_t *)0, data[i]); - - uintptr_t CodeAlign = Align ? (uintptr_t)code[i] % Align : 0; - uintptr_t DataAlign = Align ? (uintptr_t)data[i] % Align : 0; - - EXPECT_EQ((uintptr_t)0, CodeAlign); - EXPECT_EQ((uintptr_t)0, DataAlign); - } - - for (unsigned i = 0; i < 10000; ++i) { - uintptr_t CodeSize = i % 16 + 1; - uintptr_t DataSize = i % 8 + 1; - - for (unsigned j = 0; j < CodeSize; j++) { - uint8_t ExpectedCode = 1 + (i % 254); - EXPECT_EQ(ExpectedCode, code[i][j]); - } - - for (unsigned j = 0; j < DataSize; j++) { - uint8_t ExpectedData = 2 + (i % 254); - EXPECT_EQ(ExpectedData, data[i][j]); - } - } -} - -} // Namespace - +//===- MCJITMemoryManagerTest.cpp - Unit tests for the JIT memory manager -===// +// +// The LLVM Compiler Infrastructure +// +// This file is distributed under the University of Illinois Open Source +// License. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// + +#include "llvm/ExecutionEngine/SectionMemoryManager.h" +#include "llvm/ADT/OwningPtr.h" +#include "llvm/ExecutionEngine/JIT.h" +#include "gtest/gtest.h" + +using namespace llvm; + +namespace { + +TEST(MCJITMemoryManagerTest, BasicAllocations) { + OwningPtr MemMgr(new SectionMemoryManager()); + + uint8_t *code1 = MemMgr->allocateCodeSection(256, 0, 1); + uint8_t *data1 = MemMgr->allocateDataSection(256, 0, 2, true); + uint8_t *code2 = MemMgr->allocateCodeSection(256, 0, 3); + uint8_t *data2 = MemMgr->allocateDataSection(256, 0, 4, false); + + EXPECT_NE((uint8_t*)0, code1); + EXPECT_NE((uint8_t*)0, code2); + EXPECT_NE((uint8_t*)0, data1); + EXPECT_NE((uint8_t*)0, data2); + + // Initialize the data + for (unsigned i = 0; i < 256; ++i) { + code1[i] = 1; + code2[i] = 2; + data1[i] = 3; + data2[i] = 4; + } + + // Verify the data (this is checking for overlaps in the addresses) + for (unsigned i = 0; i < 256; ++i) { + EXPECT_EQ(1, code1[i]); + EXPECT_EQ(2, code2[i]); + EXPECT_EQ(3, data1[i]); + EXPECT_EQ(4, data2[i]); + } + + std::string Error; + EXPECT_FALSE(MemMgr->finalizeMemory(&Error)); +} + +TEST(MCJITMemoryManagerTest, LargeAllocations) { + OwningPtr MemMgr(new SectionMemoryManager()); + + uint8_t *code1 = MemMgr->allocateCodeSection(0x100000, 0, 1); + uint8_t *data1 = MemMgr->allocateDataSection(0x100000, 0, 2, true); + uint8_t *code2 = MemMgr->allocateCodeSection(0x100000, 0, 3); + uint8_t *data2 = MemMgr->allocateDataSection(0x100000, 0, 4, false); + + EXPECT_NE((uint8_t*)0, code1); + EXPECT_NE((uint8_t*)0, code2); + EXPECT_NE((uint8_t*)0, data1); + EXPECT_NE((uint8_t*)0, data2); + + // Initialize the data + for (unsigned i = 0; i < 0x100000; ++i) { + code1[i] = 1; + code2[i] = 2; + data1[i] = 3; + data2[i] = 4; + } + + // Verify the data (this is checking for overlaps in the addresses) + for (unsigned i = 0; i < 0x100000; ++i) { + EXPECT_EQ(1, code1[i]); + EXPECT_EQ(2, code2[i]); + EXPECT_EQ(3, data1[i]); + EXPECT_EQ(4, data2[i]); + } + + std::string Error; + EXPECT_FALSE(MemMgr->finalizeMemory(&Error)); +} + +TEST(MCJITMemoryManagerTest, ManyAllocations) { + OwningPtr MemMgr(new SectionMemoryManager()); + + uint8_t* code[10000]; + uint8_t* data[10000]; + + for (unsigned i = 0; i < 10000; ++i) { + const bool isReadOnly = i % 2 == 0; + + code[i] = MemMgr->allocateCodeSection(32, 0, 1); + data[i] = MemMgr->allocateDataSection(32, 0, 2, isReadOnly); + + for (unsigned j = 0; j < 32; j++) { + code[i][j] = 1 + (i % 254); + data[i][j] = 2 + (i % 254); + } + + EXPECT_NE((uint8_t *)0, code[i]); + EXPECT_NE((uint8_t *)0, data[i]); + } + + // Verify the data (this is checking for overlaps in the addresses) + for (unsigned i = 0; i < 10000; ++i) { + for (unsigned j = 0; j < 32;j++ ) { + uint8_t ExpectedCode = 1 + (i % 254); + uint8_t ExpectedData = 2 + (i % 254); + EXPECT_EQ(ExpectedCode, code[i][j]); + EXPECT_EQ(ExpectedData, data[i][j]); + } + } + + std::string Error; + EXPECT_FALSE(MemMgr->finalizeMemory(&Error)); +} + +TEST(MCJITMemoryManagerTest, ManyVariedAllocations) { + OwningPtr MemMgr(new SectionMemoryManager()); + + uint8_t* code[10000]; + uint8_t* data[10000]; + + for (unsigned i = 0; i < 10000; ++i) { + uintptr_t CodeSize = i % 16 + 1; + uintptr_t DataSize = i % 8 + 1; + + bool isReadOnly = i % 3 == 0; + unsigned Align = 8 << (i % 4); + + code[i] = MemMgr->allocateCodeSection(CodeSize, Align, i); + data[i] = MemMgr->allocateDataSection(DataSize, Align, i + 10000, + isReadOnly); + + for (unsigned j = 0; j < CodeSize; j++) { + code[i][j] = 1 + (i % 254); + } + + for (unsigned j = 0; j < DataSize; j++) { + data[i][j] = 2 + (i % 254); + } + + EXPECT_NE((uint8_t *)0, code[i]); + EXPECT_NE((uint8_t *)0, data[i]); + + uintptr_t CodeAlign = Align ? (uintptr_t)code[i] % Align : 0; + uintptr_t DataAlign = Align ? (uintptr_t)data[i] % Align : 0; + + EXPECT_EQ((uintptr_t)0, CodeAlign); + EXPECT_EQ((uintptr_t)0, DataAlign); + } + + for (unsigned i = 0; i < 10000; ++i) { + uintptr_t CodeSize = i % 16 + 1; + uintptr_t DataSize = i % 8 + 1; + + for (unsigned j = 0; j < CodeSize; j++) { + uint8_t ExpectedCode = 1 + (i % 254); + EXPECT_EQ(ExpectedCode, code[i][j]); + } + + for (unsigned j = 0; j < DataSize; j++) { + uint8_t ExpectedData = 2 + (i % 254); + EXPECT_EQ(ExpectedData, data[i][j]); + } + } +} + +} // Namespace +