llvm-6502/test/Bitcode/use-list-order.ll
Duncan P. N. Exon Smith 43b54db2a4 UseListOrder: Visit global values
When predicting use-list order, we visit functions in reverse order
followed by `GlobalValue`s and write out use-lists at the first
opportunity.  In the reader, this will translate to *after* the last use
has been added.

For this to work, we actually need to descend into `GlobalValue`s.
Added a targeted test in `use-list-order.ll` and `RUN` lines to the
newly passing tests in `test/Bitcode`.

There are two remaining failures in `test/Bitcode`:

  - blockaddress.ll: I haven't thought through how to model the way
    block addresses change the order of use-lists (or how to work around
    it).

  - metadata-2.ll: There's an old-style `@llvm.used` global array here
    that I suspect the .ll parser isn't upgrading properly.  When it
    round-trips through bitcode, the .bc reader *does* upgrade it, so
    the extra variable (`i8* null`) has an extra use, and the shuffle
    vector doesn't match.

    I think the fix is to upgrade old-style global arrays (or reject
    them?) in the .ll parser.

This is part of PR5680.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@214321 91177308-0d34-0410-b5e6-96231b3b80d8
2014-07-30 17:51:09 +00:00

108 lines
1.9 KiB
LLVM

; RUN: verify-uselistorder < %s -preserve-bc-use-list-order -num-shuffles=5
@a = global [4 x i1] [i1 0, i1 1, i1 0, i1 1]
@b = alias i1* getelementptr ([4 x i1]* @a, i64 0, i64 2)
; Check use-list order of constants used by globals.
@glob1 = global i5 7
@glob2 = global i5 7
@glob3 = global i5 7
; Check use-list order between variables and aliases.
@target = global i3 zeroinitializer
@alias1 = alias i3* @target
@alias2 = alias i3* @target
@alias3 = alias i3* @target
@var1 = global i3* @target
@var2 = global i3* @target
@var3 = global i3* @target
; Check use-list order for a global when used both by a global and in a
; function.
@globalAndFunction = global i4 4
@globalAndFunctionGlobalUser = global i4* @globalAndFunction
define i64 @f(i64 %f) {
entry:
%sum = add i64 %f, 0
ret i64 %sum
}
define i64 @g(i64 %g) {
entry:
%sum = add i64 %g, 0
ret i64 %sum
}
define i64 @h(i64 %h) {
entry:
%sum = add i64 %h, 0
ret i64 %sum
}
define i64 @i(i64 %i) {
entry:
%sum = add i64 %i, 1
ret i64 %sum
}
define i64 @j(i64 %j) {
entry:
%sum = add i64 %j, 1
ret i64 %sum
}
define i64 @k(i64 %k) {
entry:
%sum = add i64 %k, 1
ret i64 %sum
}
define i64 @l(i64 %l) {
entry:
%sum = add i64 %l, 1
ret i64 %sum
}
define i1 @loadb() {
entry:
%b = load i1* @b
ret i1 %b
}
define i1 @loada() {
entry:
%a = load i1* getelementptr ([4 x i1]* @a, i64 0, i64 2)
ret i1 %a
}
define i32 @f32(i32 %a, i32 %b, i32 %c, i32 %d) {
entry:
br label %first
second:
%eh = mul i32 %e, %h
%sum = add i32 %eh, %ef
br label %exit
exit:
%product = phi i32 [%ef, %first], [%sum, %second]
ret i32 %product
first:
%e = add i32 %a, 7
%f = add i32 %b, 7
%g = add i32 %c, 8
%h = add i32 %d, 8
%ef = mul i32 %e, %f
%gh = mul i32 %g, %h
%gotosecond = icmp slt i32 %gh, -9
br i1 %gotosecond, label %second, label %exit
}
define i4 @globalAndFunctionFunctionUser() {
entry:
%local = load i4* @globalAndFunction
ret i4 %local
}