maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/llvm/test/CodeGen/X86/global-fill.ll

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

32 lines
884 B
LLVM
Raw Normal View History

[AsmPrinter] Make isRepeatedByteSequence smarter about odd integer types - zext the value to alloc size first, then check if the value repeats with zero padding included. If so we can still emit a .space - Do the checking with APInt.isSplat(8), which handles non-pow2 types - Also handle large constants (bit width > 64) - In a ConstantArray all elements have the same type, so it's sufficient to check the first constant recursively and then just compare if all following constants are the same by pointer compare llvm-svn: 239977
2015-06-18 07:55:17 +08:00
; RUN: llc -mtriple=x86_64-apple-darwin < %s | FileCheck %s
@test1 = global [2 x i24] [i24 -1, i24 -1]
; CHECK-LABEL: test1:
[AsmPrinter] Fix emission of non-standard integer constants for BE targets The code assumed that zero-extending the integer constant to the designated alloc size would be fine even for BE targets, but that's not the case as that pulls in zeros from the MSB side while we actually expect the padding zeros to go after the LSB. I've changed the codepath handling the constant integers to use the store size for both small(er than u64) and big constants and then add zero padding right after that. Differential Revision: https://reviews.llvm.org/D78011
2020-04-28 05:56:30 +08:00
; CHECK-NEXT: .short 65535
; CHECK-NEXT: .byte 255
; CHECK-NEXT: .space 1
; CHECK-NEXT: .short 65535
; CHECK-NEXT: .byte 255
; CHECK-NEXT: .space 1
[AsmPrinter] Make isRepeatedByteSequence smarter about odd integer types - zext the value to alloc size first, then check if the value repeats with zero padding included. If so we can still emit a .space - Do the checking with APInt.isSplat(8), which handles non-pow2 types - Also handle large constants (bit width > 64) - In a ConstantArray all elements have the same type, so it's sufficient to check the first constant recursively and then just compare if all following constants are the same by pointer compare llvm-svn: 239977
2015-06-18 07:55:17 +08:00
@test2 = global [2 x i7] [i7 1, i7 1]
; CHECK-LABEL: test2:
; CHECK-NEXT: .space 2,1
@test3 = global [4 x i128] [i128 -1, i128 -1, i128 -1, i128 -1]
; CHECK-LABEL: test3:
; CHECK-NEXT: .space 64,255
@test4 = global [3 x i16] [i16 257, i16 257, i16 257]
; CHECK-LABEL: test4:
; CHECK-NEXT: .space 6,1
@test5 = global [2 x [2 x i16]] [[2 x i16] [i16 257, i16 257], [2 x i16] [i16 -1, i16 -1]]
; CHECK-LABEL: test5:
; CHECK-NEXT: .space 4,1
; CHECK-NEXT: .space 4,255
@test6 = global [2 x [2 x i16]] [[2 x i16] [i16 257, i16 257], [2 x i16] [i16 257, i16 257]]
; CHECK-LABEL: test6:
; CHECK-NEXT: .space 8,1