File: abcopt_large_cfg.sil.gyb

package info (click to toggle)
swiftlang 6.0.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 2,519,992 kB
  • sloc: cpp: 9,107,863; ansic: 2,040,022; asm: 1,135,751; python: 296,500; objc: 82,456; f90: 60,502; lisp: 34,951; pascal: 19,946; sh: 18,133; perl: 7,482; ml: 4,937; javascript: 4,117; makefile: 3,840; awk: 3,535; xml: 914; fortran: 619; cs: 573; ruby: 573
file content (84 lines) | stat: -rw-r--r-- 2,693 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
// RUN: %empty-directory(%t)
// RUN: %gyb %s > %t/main.sil

// Check that the optimization does not crash due to a stack overflow.

// RUN: %target-sil-opt -sil-verify-none -abcopts  %t/main.sil | %FileCheck %s

sil_stage canonical

import Builtin
import Swift
import SwiftShims

struct ArrayIntBuffer {
  var storage : Builtin.NativeObject
}

struct ArrayInt{
  var buffer : ArrayIntBuffer
}

sil [ossa] @take_array : $@convention(thin) (@inout ArrayInt) -> () {
bb0(%0 : $*ArrayInt):
  unreachable
}


sil public_external [ossa] [_semantics "array.check_subscript"] @checkbounds : $@convention(method) (Int32, Bool, @owned ArrayInt) -> _DependenceToken {
bb0(%0: $Int32, %1: $Bool, %2: @owned $ArrayInt):
    unreachable
}

// CHECK-LABEL: sil [ossa] @test_very_deep_domtree :

// Currently there is nothing ot check here, because the optimization bails in
// this case.
// In future we might check that even with a deep domtree it can hoist the check.

// CHECK-LABEL: } // end sil function 'test_very_deep_domtree'
sil [ossa] @test_very_deep_domtree : $@convention(thin) (Int32, @inout ArrayInt) -> Int32 {
bb0(%0 : $Int32, %1 : $*ArrayInt):
  %%2 = integer_literal $Builtin.Int1, -1
  %%3 = struct $Bool (%2 : $Builtin.Int1)
  %%4 = struct_extract %0 : $Int32, #Int32._value
  %%5 = integer_literal $Builtin.Int32, 0
  br bb1(%5 : $Builtin.Int32)

bb1(%10 : $Builtin.Int32):

% for i in range(50000):
  br bb${i+2}
bb${i+2}:
% end

  br bb200000

bb200000:
  %%11 = struct $Int32 (%10 : $Builtin.Int32)
  %%12 = function_ref @checkbounds : $@convention(method) (Int32, Bool, @owned ArrayInt) -> _DependenceToken
  %%13 = load [copy] %1 : $*ArrayInt
  %%17 = apply %12(%11, %3, %13) : $@convention(method) (Int32, Bool, @owned ArrayInt) -> _DependenceToken
  %%18 = integer_literal $Builtin.Int32, 1
  %%19 = integer_literal $Builtin.Int1, -1
  %%20 = builtin "sadd_with_overflow_Int32"(%10 : $Builtin.Int32, %18 : $Builtin.Int32, %19 : $Builtin.Int1) : $(Builtin.Int32, Builtin.Int1)
  %%21 = tuple_extract %20 : $(Builtin.Int32, Builtin.Int1), 0
  %%22 = tuple_extract %20 : $(Builtin.Int32, Builtin.Int1), 1
  cond_fail %22 : $Builtin.Int1, ""
  %%24 = builtin "cmp_eq_Int32"(%21 : $Builtin.Int32, %4 : $Builtin.Int32) : $Builtin.Int1
  cond_br %24, bb200002, bb200001

bb200001:
  br bb1(%21 : $Builtin.Int32)

bb200002:
  %%27 = function_ref @take_array : $@convention(thin) (@inout ArrayInt) -> ()
  %%28 = apply %27(%1) : $@convention(thin) (@inout ArrayInt) -> ()
  %%29 = load [copy] %1 : $*ArrayInt
  %%30 = apply %12(%11, %3, %29) : $@convention(method) (Int32, Bool, @owned ArrayInt) -> _DependenceToken
  %%33 = struct $Int32 (%21 : $Builtin.Int32)
  return %33 : $Int32
}