mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 19:23:23 +01:00
608f08d699
This makes the 'verifyFunction' and 'verifyModule' functions totally independent operations on the LLVM IR. It also cleans up their API a bit by lifting the abort behavior into their clients and just using an optional raw_ostream parameter to control printing. The implementation of the verifier is now just an InstVisitor with no multiple inheritance. It also is significantly more const-correct, and hides the const violations internally. The two layers that force us to break const correctness are building a DomTree and dispatching through the InstVisitor. A new VerifierPass is used to implement the legacy pass manager interface in terms of the other pieces. The error messages produced may be slightly different now, and we may have slightly different short circuiting behavior with different usage models of the verifier, but generally everything works equivalently and this unblocks wiring the verifier up to the new pass manager. llvm-svn: 199569
22 lines
738 B
LLVM
22 lines
738 B
LLVM
; RUN: not llvm-as < %s 2>&1 | FileCheck %s
|
|
; CHECK: assembly parsed, but does not verify as correct
|
|
; PR7316
|
|
|
|
target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:32"
|
|
target triple = "x86-unknown-unknown"
|
|
@aa = global [32 x i8] zeroinitializer, align 1
|
|
@bb = global [16 x i8] zeroinitializer, align 1
|
|
define void @x() nounwind {
|
|
L.0:
|
|
%0 = getelementptr [32 x i8]* @aa, i32 0, i32 4
|
|
%1 = bitcast i8* %0 to [16 x i8]*
|
|
%2 = bitcast [16 x i8]* %1 to [0 x i8]*
|
|
%3 = getelementptr [16 x i8]* @bb
|
|
%4 = bitcast [16 x i8]* %3 to [0 x i8]*
|
|
call void @llvm.memcpy.i32([0 x i8]* %2, [0 x i8]* %4, i32 16, i32 1)
|
|
br label %return
|
|
return:
|
|
ret void
|
|
}
|
|
declare void @llvm.memcpy.i32([0 x i8]*, [0 x i8]*, i32, i32) nounwind
|