mirror of
https://github.com/RPCSX/llvm.git
synced 2024-11-24 20:29:53 +00:00
21f77df7b6
update.py:
import fileinput
import sys
import re
alias_match_prefix = r"(.*(?:=|:|^)\s*(?:external |)(?:(?:private|internal|linkonce|linkonce_odr|weak|weak_odr|common|appending|extern_weak|available_externally) )?(?:default |hidden |protected )?(?:dllimport |dllexport )?(?:unnamed_addr |)(?:thread_local(?:\([a-z]*\))? )?alias"
plain = re.compile(alias_match_prefix + r" (.*?))(| addrspace\(\d+\) *)\*($| *(?:%|@|null|undef|blockaddress|addrspacecast|\[\[[a-zA-Z]|\{\{).*$)")
cast = re.compile(alias_match_prefix + r") ((?:bitcast|inttoptr|addrspacecast)\s*\(.* to (.*?)(| addrspace\(\d+\) *)\*\)\s*(?:;.*)?$)")
gep = re.compile(alias_match_prefix + r") ((?:getelementptr)\s*(?:inbounds)?\s*\((?P<type>.*), (?P=type)(?:\s*addrspace\(\d+\)\s*)?\* .*\)\s*(?:;.*)?$)")
def conv(line):
m = re.match(cast, line)
if m:
return m.group(1) + " " + m.group(3) + ", " + m.group(2)
m = re.match(gep, line)
if m:
return m.group(1) + " " + m.group(3) + ", " + m.group(2)
m = re.match(plain, line)
if m:
return m.group(1) + ", " + m.group(2) + m.group(3) + "*" + m.group(4) + "\n"
return line
for line in sys.stdin:
sys.stdout.write(conv(line))
apply.sh:
for name in "$@"
do
python3 `dirname "$0"`/update.py < "$name" > "$name.tmp" && mv "$name.tmp" "$name"
rm -f "$name.tmp"
done
The actual commands:
From llvm/src:
find test/ -name *.ll | xargs ./apply.sh
From llvm/src/tools/clang:
find test/ -name *.mm -o -name *.m -o -name *.cpp -o -name *.c | xargs -I '{}' ../../apply.sh "{}"
From llvm/src/tools/polly:
find test/ -name *.ll | xargs ./apply.sh
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@247378 91177308-0d34-0410-b5e6-96231b3b80d8
41 lines
1.2 KiB
LLVM
41 lines
1.2 KiB
LLVM
; RUN: opt -S < %s -instcombine | FileCheck %s
|
|
|
|
target datalayout = "e-p1:16:16-p2:32:32-p3:64:64"
|
|
|
|
@G1 = global i32 42, align 1
|
|
@G2 = global i32 42
|
|
@G3 = global [4 x i8] zeroinitializer, align 1
|
|
|
|
@A1 = alias i32, bitcast (i8* getelementptr inbounds ([4 x i8], [4 x i8]* @G3, i32 0, i32 2) to i32*)
|
|
@A2 = alias i32, inttoptr (i64 and (i64 ptrtoint (i8* getelementptr inbounds ([4 x i8], [4 x i8]* @G3, i32 0, i32 3) to i64), i64 -4) to i32*)
|
|
|
|
define i64 @f1() {
|
|
; This cannot be constant folded because G1 is underaligned.
|
|
; CHECK-LABEL: @f1(
|
|
; CHECK: ret i64 and
|
|
ret i64 and (i64 ptrtoint (i32* @G1 to i64), i64 1)
|
|
}
|
|
|
|
define i64 @f2() {
|
|
; The preferred alignment for G2 allows this one to foled to zero.
|
|
; CHECK-LABEL: @f2(
|
|
; CHECK: ret i64 0
|
|
ret i64 and (i64 ptrtoint (i32* @G2 to i64), i64 1)
|
|
}
|
|
|
|
define i64 @g1() {
|
|
; This cannot be constant folded because A1 aliases G3 which is underalaigned.
|
|
; CHECK-LABEL: @g1(
|
|
; CHECK: ret i64 and
|
|
ret i64 and (i64 ptrtoint (i32* @A1 to i64), i64 1)
|
|
}
|
|
|
|
define i64 @g2() {
|
|
; While A2 also aliases G3 which is underaligned, the math of A2 forces a
|
|
; certain alignment allowing this to fold to zero.
|
|
; CHECK-LABEL: @g2(
|
|
; CHECK: ret i64 0
|
|
ret i64 and (i64 ptrtoint (i32* @A2 to i64), i64 1)
|
|
}
|
|
|