File: access_dom_loop.sil

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 (111 lines) | stat: -rw-r--r-- 2,905 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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
// RUN: %target-sil-opt -access-enforcement-dom %s -enable-sil-verify-all | %FileCheck %s
//
// Test AccessEnforcementDom in the presence of loops.
// For loops with accessors, see also access_dom_call.sil.

sil_stage canonical

import Builtin
import Swift
import SwiftShims

struct X {
  @_hasStorage var i: Int64 { get set }
  init(i: Int64)
  init()
}

var globalX: X

sil_global hidden @globalX : $X

// Insert one preheader check for the outer access only.
// CHECK-LABEL: sil @testDomLoopRDMD : $@convention(thin) () -> () {
// CHECK: [[A:%.*]] = begin_access [read] [dynamic] [no_nested_conflict] [[GA:%.*]] : $*X
// CHECK: end_access [[A]]
// CHECK: bb3:
// CHECK: begin_access [read] [static] [no_nested_conflict] [[GA]] : $*X
// CHECK: begin_access [modify] [dynamic] [no_nested_conflict] [[GA]] : $*X
// CHECK-LABEL: } // end sil function 'testDomLoopRDMD'
sil @testDomLoopRDMD : $@convention(thin) () -> () {
bb0:
  %0 = global_addr @globalX: $*X
  br bb1
  
bb1:
  br bb2

bb2:
  br bb3
  
bb3:
  %4 = begin_access [read] [dynamic] [no_nested_conflict] %0 : $*X
  %6 = begin_access [modify] [dynamic] [no_nested_conflict] %0 : $*X
  end_access %6 : $*X
  end_access %4 : $*X
  %cond = integer_literal $Builtin.Int1, 1
  cond_br %cond, bb2, bb4

bb4:
  %10 = tuple ()
  return %10 : $()
}

// No, do cannot optimize a nested loop access.
// CHECK-LABEL: sil @testDomLoopRSMD : $@convention(thin) () -> () {
// CHECK-NOT: begin_access
// CHECK: bb3:
// CHECK: begin_access [read] [static] [no_nested_conflict] [[GA:%.*]] : $*X
// CHECK: begin_access [modify] [dynamic] [no_nested_conflict] [[GA]] : $*X
// CHECK-LABEL: } // end sil function 'testDomLoopRSMD'
sil @testDomLoopRSMD : $@convention(thin) () -> () {
bb0:
  %0 = global_addr @globalX: $*X
  br bb1
  
bb1:
  br bb2

bb2:
  br bb3
  
bb3:
  %4 = begin_access [read] [static] [no_nested_conflict] %0 : $*X
  %6 = begin_access [modify] [dynamic] [no_nested_conflict] %0 : $*X
  end_access %6 : $*X
  end_access %4 : $*X
  %cond = integer_literal $Builtin.Int1, 1
  cond_br %cond, bb2, bb4

bb4:
  %10 = tuple ()
  return %10 : $()
}

// Yes, insert a preheader check for unidentifiable access (address argument).
// CHECK-LABEL: sil @testDomLoopUnidentified : $@convention(thin) (@inout Int64) -> () {
// CHECK: [[A:%.*]] = begin_access [modify] [dynamic] [no_nested_conflict] [[GA:%.*]] : $*Int64
// CHECK: end_access [[A]]
// CHECK: bb3:
// CHECK: begin_access [modify] [static] [no_nested_conflict] [[GA]] : $*Int64
// CHECK-LABEL: } // end sil function 'testDomLoopUnidentified'
sil @testDomLoopUnidentified : $@convention(thin) (@inout Int64) -> () {
bb0(%0 : $*Int64):
  br bb1
  
bb1:
  br bb2

bb2:
  br bb3
  
bb3:
  %6 = begin_access [modify] [dynamic] [no_nested_conflict] %0 : $*Int64
  end_access %6 : $*Int64
  %cond = integer_literal $Builtin.Int1, 1
  cond_br %cond, bb2, bb4

bb4:
  %10 = tuple ()
  return %10 : $()
}