2014-12-03 23:38:08 +00:00
|
|
|
; RUN: llc -O0 -relocation-model=pic -disable-fp-elim < %s | FileCheck %s
|
2010-06-26 00:39:23 +00:00
|
|
|
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64"
|
|
|
|
target triple = "x86_64-apple-darwin10"
|
|
|
|
|
|
|
|
; This file contains functions that may crash llc -O0
|
|
|
|
|
|
|
|
; The DIV8 instruction produces results in AH and AL, but we don't want to use
|
|
|
|
; AH in 64-bit mode. The hack used must not generate copyFromReg nodes for
|
|
|
|
; aliased registers (AX and AL) - RegAllocFast does not like that.
|
|
|
|
; PR7312
|
|
|
|
define i32 @div8() nounwind {
|
|
|
|
entry:
|
|
|
|
%0 = trunc i64 undef to i8 ; <i8> [#uses=3]
|
|
|
|
%1 = udiv i8 0, %0 ; <i8> [#uses=1]
|
|
|
|
%2 = urem i8 0, %0 ; <i8> [#uses=1]
|
|
|
|
%3 = icmp uge i8 %2, %0 ; <i1> [#uses=1]
|
|
|
|
br i1 %3, label %"40", label %"39"
|
|
|
|
|
|
|
|
"39": ; preds = %"36"
|
|
|
|
%4 = zext i8 %1 to i32 ; <i32> [#uses=1]
|
|
|
|
%5 = mul nsw i32 %4, undef ; <i32> [#uses=1]
|
|
|
|
%6 = add nsw i32 %5, undef ; <i32> [#uses=1]
|
|
|
|
%7 = icmp ne i32 %6, undef ; <i1> [#uses=1]
|
|
|
|
br i1 %7, label %"40", label %"41"
|
|
|
|
|
|
|
|
"40": ; preds = %"39", %"36"
|
|
|
|
unreachable
|
|
|
|
|
|
|
|
"41": ; preds = %"39"
|
|
|
|
unreachable
|
|
|
|
}
|
2014-12-03 23:38:08 +00:00
|
|
|
|
|
|
|
; When using fast isel, sdiv is lowered into a sequence of CQO + DIV64.
|
|
|
|
; CQO defines implicitly AX and DIV64 uses it implicitly too.
|
|
|
|
; When an instruction gets between those two, RegAllocFast was reusing
|
|
|
|
; AX for the vreg defined in between and the compiler crashed.
|
|
|
|
;
|
|
|
|
; An instruction gets between CQO and DIV64 because the load is folded
|
|
|
|
; into the division but it requires a sign extension.
|
|
|
|
; PR21700
|
|
|
|
; CHECK-LABEL: addressModeWith32bitIndex:
|
|
|
|
; CHECK: cqto
|
|
|
|
; CHECK-NEXT: movslq
|
|
|
|
; CHECK-NEXT: idivq
|
|
|
|
; CHECK: retq
|
|
|
|
define i64 @addressModeWith32bitIndex(i32 %V) {
|
[opaque pointer type] Add textual IR support for explicit type parameter to getelementptr instruction
One of several parallel first steps to remove the target type of pointers,
replacing them with a single opaque pointer type.
This adds an explicit type parameter to the gep instruction so that when the
first parameter becomes an opaque pointer type, the type to gep through is
still available to the instructions.
* This doesn't modify gep operators, only instructions (operators will be
handled separately)
* Textual IR changes only. Bitcode (including upgrade) and changing the
in-memory representation will be in separate changes.
* geps of vectors are transformed as:
getelementptr <4 x float*> %x, ...
->getelementptr float, <4 x float*> %x, ...
Then, once the opaque pointer type is introduced, this will ultimately look
like:
getelementptr float, <4 x ptr> %x
with the unambiguous interpretation that it is a vector of pointers to float.
* address spaces remain on the pointer, not the type:
getelementptr float addrspace(1)* %x
->getelementptr float, float addrspace(1)* %x
Then, eventually:
getelementptr float, ptr addrspace(1) %x
Importantly, the massive amount of test case churn has been automated by
same crappy python code. I had to manually update a few test cases that
wouldn't fit the script's model (r228970,r229196,r229197,r229198). The
python script just massages stdin and writes the result to stdout, I
then wrapped that in a shell script to handle replacing files, then
using the usual find+xargs to migrate all the files.
update.py:
import fileinput
import sys
import re
ibrep = re.compile(r"(^.*?[^%\w]getelementptr inbounds )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
normrep = re.compile( r"(^.*?[^%\w]getelementptr )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
def conv(match, line):
if not match:
return line
line = match.groups()[0]
if len(match.groups()[5]) == 0:
line += match.groups()[2]
line += match.groups()[3]
line += ", "
line += match.groups()[1]
line += "\n"
return line
for line in sys.stdin:
if line.find("getelementptr ") == line.find("getelementptr inbounds"):
if line.find("getelementptr inbounds") != line.find("getelementptr inbounds ("):
line = conv(re.match(ibrep, line), line)
elif line.find("getelementptr ") != line.find("getelementptr ("):
line = conv(re.match(normrep, line), line)
sys.stdout.write(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
After that, check-all (with llvm, clang, clang-tools-extra, lld,
compiler-rt, and polly all checked out).
The extra 'rm' in the apply.sh script is due to a few files in clang's test
suite using interesting unicode stuff that my python script was throwing
exceptions on. None of those files needed to be migrated, so it seemed
sufficient to ignore those cases.
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7636
llvm-svn: 230786
2015-02-27 19:29:02 +00:00
|
|
|
%gep = getelementptr i64, i64* null, i32 %V
|
2015-02-27 21:17:42 +00:00
|
|
|
%load = load i64, i64* %gep
|
2014-12-03 23:38:08 +00:00
|
|
|
%sdiv = sdiv i64 0, %load
|
|
|
|
ret i64 %sdiv
|
|
|
|
}
|