mirror of
https://github.com/RPCSX/llvm.git
synced 2024-11-29 22:50:47 +00:00
4177e6fff5
This was done through the aid of a terrible Perl creation. I will not paste any of the horrors here. Suffice to say, it require multiple staged rounds of replacements, state carried between, and a few nested-construct-parsing hacks that I'm not proud of. It happens, by luck, to be able to deal with all the TCL-quoting patterns in evidence in the LLVM test suite. If anyone is maintaining large out-of-tree test trees, feel free to poke me and I'll send you the steps I used to convert things, as well as answer any painful questions etc. IRC works best for this type of thing I find. Once converted, switch the LLVM lit config to use ShTests the same as Clang. In addition to being able to delete large amounts of Python code from 'lit', this will also simplify the entire test suite and some of lit's architecture. Finally, the test suite runs 33% faster on Linux now. ;] For my 16-hardware-thread (2x 4-core xeon e5520): 36s -> 24s git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@159525 91177308-0d34-0410-b5e6-96231b3b80d8
28 lines
450 B
LLVM
28 lines
450 B
LLVM
; RUN: opt < %s -lcssa -S -verify-loop-info | grep "[%]tmp33 = load i1\*\* [%]tmp"
|
|
; PR6546
|
|
|
|
; LCSSA doesn't need to transform uses in blocks not reachable
|
|
; from the entry block.
|
|
|
|
define fastcc void @dfs() nounwind {
|
|
bb:
|
|
br label %bb44
|
|
|
|
bb44:
|
|
br i1 undef, label %bb7, label %bb45
|
|
|
|
bb7:
|
|
%tmp = bitcast i1** undef to i1**
|
|
br label %bb15
|
|
|
|
bb15:
|
|
br label %bb44
|
|
|
|
bb32:
|
|
%tmp33 = load i1** %tmp, align 8
|
|
br label %bb45
|
|
|
|
bb45:
|
|
unreachable
|
|
}
|