832666c45e
* Manually rename BasicBlock to BlockPredecessor BasicBlock is a pair of (Ebb, Inst) that is used to represent the basic block subcomponent of an Ebb that is a predecessor to an Ebb. Eventually we will be able to remove this struct, but for now it makes sense to give it a non-conflicting name so that we can start to transition Ebb to represent a basic block. I have not updated any comments that refer to BasicBlock, as eventually we will remove BlockPredecessor and replace with Block, which is a basic block, so the comments will become correct. * Manually rename SSABuilder block types to avoid conflict SSABuilder has its own Block and BlockData types. These along with associated identifier will cause conflicts in a later commit, so they are renamed to be more verbose here. * Automatically rename 'Ebb' to 'Block' in *.rs * Automatically rename 'EBB' to 'block' in *.rs * Automatically rename 'ebb' to 'block' in *.rs * Automatically rename 'extended basic block' to 'basic block' in *.rs * Automatically rename 'an basic block' to 'a basic block' in *.rs * Manually update comment for `Block` `Block`'s wikipedia article required an update. * Automatically rename 'an `Block`' to 'a `Block`' in *.rs * Automatically rename 'extended_basic_block' to 'basic_block' in *.rs * Automatically rename 'ebb' to 'block' in *.clif * Manually rename clif constant that contains 'ebb' as substring to avoid conflict * Automatically rename filecheck uses of 'EBB' to 'BB' 'regex: EBB' -> 'regex: BB' '$EBB' -> '$BB' * Automatically rename 'EBB' 'Ebb' to 'block' in *.clif * Automatically rename 'an block' to 'a block' in *.clif * Fix broken testcase when function name length increases Test function names are limited to 16 characters. This causes the new longer name to be truncated and fail a filecheck test. An outdated comment was also fixed.
56 lines
1.4 KiB
Plaintext
56 lines
1.4 KiB
Plaintext
test licm
|
|
|
|
target x86_64
|
|
|
|
;; Maybe-trapping readonly load from address that is not
|
|
;; loop-dependent should *not* be hoisted out of loop, though the
|
|
;; address computation can be hoisted.
|
|
|
|
function %hoist_load(i32, i64 vmctx) -> i32 {
|
|
gv0 = vmctx
|
|
gv1 = load.i64 notrap aligned readonly gv0
|
|
heap0 = static gv1, min 0x1_0000, bound 0x1_0000_0000, offset_guard 0x8000_0000, index_type i32
|
|
|
|
block0(v0: i32, v1: i64):
|
|
jump block1(v0, v1)
|
|
|
|
block1(v2: i32, v3: i64):
|
|
v4 = iconst.i32 1
|
|
v5 = heap_addr.i64 heap0, v4, 1
|
|
v6 = load.i32 aligned readonly v5
|
|
v7 = iadd v2, v6
|
|
brz v2, block3(v2)
|
|
jump block2
|
|
|
|
block2:
|
|
v8 = isub v2, v4
|
|
jump block1(v8, v3)
|
|
|
|
block3(v9: i32):
|
|
return v9
|
|
}
|
|
|
|
; sameln: function %hoist_load(i32, i64 vmctx) -> i32 fast {
|
|
; nextln: gv0 = vmctx
|
|
; nextln: gv1 = load.i64 notrap aligned readonly gv0
|
|
; nextln: heap0 = static gv1, min 0x0001_0000, bound 0x0001_0000_0000, offset_guard 0x8000_0000, index_type i32
|
|
; nextln:
|
|
; nextln: block0(v0: i32, v1: i64):
|
|
; nextln: v4 = iconst.i32 1
|
|
; nextln: v5 = heap_addr.i64 heap0, v4, 1
|
|
; nextln: jump block1(v0, v1)
|
|
; nextln:
|
|
; nextln: block1(v2: i32, v3: i64):
|
|
; nextln: v6 = load.i32 aligned readonly v5
|
|
; nextln: v7 = iadd v2, v6
|
|
; nextln: brz v2, block3(v2)
|
|
; nextln: jump block2
|
|
; nextln:
|
|
; nextln: block2:
|
|
; nextln: v8 = isub.i32 v2, v4
|
|
; nextln: jump block1(v8, v3)
|
|
; nextln:
|
|
; nextln: block3(v9: i32):
|
|
; nextln: return v9
|
|
; nextln: }
|