-; RUN: llc < %s\r
-\r
-; This test formerly failed because of wrong custom lowering for\r
-; fptosi of ppc_fp128.\r
-\r
-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"\r
-target triple = "powerpc-unknown-linux-gnu"\r
-\r
-%core.time.TickDuration = type { i64 }\r
-\r
-@_D4core4time12TickDuration11ticksPerSecyl = global i64 0\r
-@.str5 = internal unnamed_addr constant [40 x i8] c"..\5Cldc\5Cruntime\5Cdruntime\5Csrc\5Ccore\5Ctime.d\00"\r
-@.str83 = internal constant [10 x i8] c"null this\00"\r
-@.modulefilename = internal constant { i32, i8* } { i32 39, i8* getelementptr inbounds ([40 x i8]* @.str5, i32 0, i32 0) }\r
-\r
-declare i8* @_d_assert_msg({ i32, i8* }, { i32, i8* }, i32)\r
-\r
-\r
-define weak_odr fastcc i64 @_D4core4time12TickDuration30__T2toVAyaa7_7365636f6e6473TlZ2toMxFNaNbNfZl(%core.time.TickDuration* %.this_arg) {\r
-entry:\r
- %unitsPerSec = alloca i64, align 8\r
- %tmp = icmp ne %core.time.TickDuration* %.this_arg, null\r
- br i1 %tmp, label %noassert, label %assert\r
-\r
-assert: ; preds = %entry\r
- %tmp1 = load { i32, i8* }* @.modulefilename\r
- %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)\r
- unreachable\r
-\r
-noassert: ; preds = %entry\r
- %tmp2 = getelementptr %core.time.TickDuration* %.this_arg, i32 0, i32 0\r
- %tmp3 = load i64* %tmp2\r
- %tmp4 = sitofp i64 %tmp3 to ppc_fp128\r
- %tmp5 = load i64* @_D4core4time12TickDuration11ticksPerSecyl\r
- %tmp6 = sitofp i64 %tmp5 to ppc_fp128\r
- %tmp7 = fdiv ppc_fp128 %tmp6, 0xM80000000000000000000000000000000\r
- %tmp8 = fdiv ppc_fp128 %tmp4, %tmp7\r
- %tmp9 = fptosi ppc_fp128 %tmp8 to i64\r
- ret i64 %tmp9\r
-}\r
-\r
+; 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
+}
+
-//===- MCJITMemoryManagerTest.cpp - Unit tests for the JIT memory manager -===//\r
-//\r
-// The LLVM Compiler Infrastructure\r
-//\r
-// This file is distributed under the University of Illinois Open Source\r
-// License. See LICENSE.TXT for details.\r
-//\r
-//===----------------------------------------------------------------------===//\r
-\r
-#include "llvm/ExecutionEngine/SectionMemoryManager.h"\r
-#include "llvm/ADT/OwningPtr.h"\r
-#include "llvm/ExecutionEngine/JIT.h"\r
-#include "gtest/gtest.h"\r
-\r
-using namespace llvm;\r
-\r
-namespace {\r
-\r
-TEST(MCJITMemoryManagerTest, BasicAllocations) {\r
- OwningPtr<SectionMemoryManager> MemMgr(new SectionMemoryManager());\r
-\r
- uint8_t *code1 = MemMgr->allocateCodeSection(256, 0, 1);\r
- uint8_t *data1 = MemMgr->allocateDataSection(256, 0, 2, true);\r
- uint8_t *code2 = MemMgr->allocateCodeSection(256, 0, 3);\r
- uint8_t *data2 = MemMgr->allocateDataSection(256, 0, 4, false);\r
-\r
- EXPECT_NE((uint8_t*)0, code1);\r
- EXPECT_NE((uint8_t*)0, code2);\r
- EXPECT_NE((uint8_t*)0, data1);\r
- EXPECT_NE((uint8_t*)0, data2);\r
-\r
- // Initialize the data\r
- for (unsigned i = 0; i < 256; ++i) {\r
- code1[i] = 1;\r
- code2[i] = 2;\r
- data1[i] = 3;\r
- data2[i] = 4;\r
- }\r
-\r
- // Verify the data (this is checking for overlaps in the addresses)\r
- for (unsigned i = 0; i < 256; ++i) {\r
- EXPECT_EQ(1, code1[i]);\r
- EXPECT_EQ(2, code2[i]);\r
- EXPECT_EQ(3, data1[i]);\r
- EXPECT_EQ(4, data2[i]);\r
- }\r
-\r
- std::string Error;\r
- EXPECT_FALSE(MemMgr->finalizeMemory(&Error));\r
-}\r
-\r
-TEST(MCJITMemoryManagerTest, LargeAllocations) {\r
- OwningPtr<SectionMemoryManager> MemMgr(new SectionMemoryManager());\r
-\r
- uint8_t *code1 = MemMgr->allocateCodeSection(0x100000, 0, 1);\r
- uint8_t *data1 = MemMgr->allocateDataSection(0x100000, 0, 2, true);\r
- uint8_t *code2 = MemMgr->allocateCodeSection(0x100000, 0, 3);\r
- uint8_t *data2 = MemMgr->allocateDataSection(0x100000, 0, 4, false);\r
-\r
- EXPECT_NE((uint8_t*)0, code1);\r
- EXPECT_NE((uint8_t*)0, code2);\r
- EXPECT_NE((uint8_t*)0, data1);\r
- EXPECT_NE((uint8_t*)0, data2);\r
-\r
- // Initialize the data\r
- for (unsigned i = 0; i < 0x100000; ++i) {\r
- code1[i] = 1;\r
- code2[i] = 2;\r
- data1[i] = 3;\r
- data2[i] = 4;\r
- }\r
-\r
- // Verify the data (this is checking for overlaps in the addresses)\r
- for (unsigned i = 0; i < 0x100000; ++i) {\r
- EXPECT_EQ(1, code1[i]);\r
- EXPECT_EQ(2, code2[i]);\r
- EXPECT_EQ(3, data1[i]);\r
- EXPECT_EQ(4, data2[i]);\r
- }\r
-\r
- std::string Error;\r
- EXPECT_FALSE(MemMgr->finalizeMemory(&Error));\r
-}\r
-\r
-TEST(MCJITMemoryManagerTest, ManyAllocations) {\r
- OwningPtr<SectionMemoryManager> MemMgr(new SectionMemoryManager());\r
-\r
- uint8_t* code[10000];\r
- uint8_t* data[10000];\r
-\r
- for (unsigned i = 0; i < 10000; ++i) {\r
- const bool isReadOnly = i % 2 == 0;\r
-\r
- code[i] = MemMgr->allocateCodeSection(32, 0, 1);\r
- data[i] = MemMgr->allocateDataSection(32, 0, 2, isReadOnly);\r
-\r
- for (unsigned j = 0; j < 32; j++) {\r
- code[i][j] = 1 + (i % 254);\r
- data[i][j] = 2 + (i % 254);\r
- }\r
-\r
- EXPECT_NE((uint8_t *)0, code[i]);\r
- EXPECT_NE((uint8_t *)0, data[i]);\r
- }\r
-\r
- // Verify the data (this is checking for overlaps in the addresses)\r
- for (unsigned i = 0; i < 10000; ++i) {\r
- for (unsigned j = 0; j < 32;j++ ) {\r
- uint8_t ExpectedCode = 1 + (i % 254);\r
- uint8_t ExpectedData = 2 + (i % 254);\r
- EXPECT_EQ(ExpectedCode, code[i][j]);\r
- EXPECT_EQ(ExpectedData, data[i][j]);\r
- }\r
- }\r
-\r
- std::string Error;\r
- EXPECT_FALSE(MemMgr->finalizeMemory(&Error));\r
-}\r
-\r
-TEST(MCJITMemoryManagerTest, ManyVariedAllocations) {\r
- OwningPtr<SectionMemoryManager> MemMgr(new SectionMemoryManager());\r
-\r
- uint8_t* code[10000];\r
- uint8_t* data[10000];\r
-\r
- for (unsigned i = 0; i < 10000; ++i) {\r
- uintptr_t CodeSize = i % 16 + 1;\r
- uintptr_t DataSize = i % 8 + 1;\r
-\r
- bool isReadOnly = i % 3 == 0;\r
- unsigned Align = 8 << (i % 4);\r
-\r
- code[i] = MemMgr->allocateCodeSection(CodeSize, Align, i);\r
- data[i] = MemMgr->allocateDataSection(DataSize, Align, i + 10000,\r
- isReadOnly);\r
-\r
- for (unsigned j = 0; j < CodeSize; j++) {\r
- code[i][j] = 1 + (i % 254);\r
- }\r
-\r
- for (unsigned j = 0; j < DataSize; j++) {\r
- data[i][j] = 2 + (i % 254);\r
- }\r
-\r
- EXPECT_NE((uint8_t *)0, code[i]);\r
- EXPECT_NE((uint8_t *)0, data[i]);\r
-\r
- uintptr_t CodeAlign = Align ? (uintptr_t)code[i] % Align : 0;\r
- uintptr_t DataAlign = Align ? (uintptr_t)data[i] % Align : 0;\r
-\r
- EXPECT_EQ((uintptr_t)0, CodeAlign);\r
- EXPECT_EQ((uintptr_t)0, DataAlign);\r
- }\r
-\r
- for (unsigned i = 0; i < 10000; ++i) {\r
- uintptr_t CodeSize = i % 16 + 1;\r
- uintptr_t DataSize = i % 8 + 1;\r
-\r
- for (unsigned j = 0; j < CodeSize; j++) {\r
- uint8_t ExpectedCode = 1 + (i % 254);\r
- EXPECT_EQ(ExpectedCode, code[i][j]);\r
- }\r
-\r
- for (unsigned j = 0; j < DataSize; j++) {\r
- uint8_t ExpectedData = 2 + (i % 254);\r
- EXPECT_EQ(ExpectedData, data[i][j]); \r
- }\r
- }\r
-}\r
-\r
-} // Namespace\r
-\r
+//===- 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<SectionMemoryManager> 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<SectionMemoryManager> 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<SectionMemoryManager> 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<SectionMemoryManager> 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
+
projects / oota-llvm.git / commitdiff