intrinsics.ll 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449
  1. ; RUN: opt -instcombine -S < %s | FileCheck %s
  2. %overflow.result = type {i8, i1}
  3. %ov.result.32 = type { i32, i1 }
  4. declare %overflow.result @llvm.uadd.with.overflow.i8(i8, i8) nounwind readnone
  5. declare %overflow.result @llvm.umul.with.overflow.i8(i8, i8) nounwind readnone
  6. declare %ov.result.32 @llvm.sadd.with.overflow.i32(i32, i32) nounwind readnone
  7. declare %ov.result.32 @llvm.uadd.with.overflow.i32(i32, i32) nounwind readnone
  8. declare %ov.result.32 @llvm.ssub.with.overflow.i32(i32, i32) nounwind readnone
  9. declare %ov.result.32 @llvm.usub.with.overflow.i32(i32, i32) nounwind readnone
  10. declare %ov.result.32 @llvm.smul.with.overflow.i32(i32, i32) nounwind readnone
  11. declare %ov.result.32 @llvm.umul.with.overflow.i32(i32, i32) nounwind readnone
  12. declare double @llvm.powi.f64(double, i32) nounwind readonly
  13. declare i32 @llvm.cttz.i32(i32, i1) nounwind readnone
  14. declare i32 @llvm.ctlz.i32(i32, i1) nounwind readnone
  15. declare i32 @llvm.ctpop.i32(i32) nounwind readnone
  16. declare i8 @llvm.ctlz.i8(i8, i1) nounwind readnone
  17. declare double @llvm.cos.f64(double %Val) nounwind readonly
  18. declare double @llvm.sin.f64(double %Val) nounwind readonly
  19. define i8 @uaddtest1(i8 %A, i8 %B) {
  20. %x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %A, i8 %B)
  21. %y = extractvalue %overflow.result %x, 0
  22. ret i8 %y
  23. ; CHECK-LABEL: @uaddtest1(
  24. ; CHECK-NEXT: %y = add i8 %A, %B
  25. ; CHECK-NEXT: ret i8 %y
  26. }
  27. define i8 @uaddtest2(i8 %A, i8 %B, i1* %overflowPtr) {
  28. %and.A = and i8 %A, 127
  29. %and.B = and i8 %B, 127
  30. %x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %and.A, i8 %and.B)
  31. %y = extractvalue %overflow.result %x, 0
  32. %z = extractvalue %overflow.result %x, 1
  33. store i1 %z, i1* %overflowPtr
  34. ret i8 %y
  35. ; CHECK-LABEL: @uaddtest2(
  36. ; CHECK-NEXT: %and.A = and i8 %A, 127
  37. ; CHECK-NEXT: %and.B = and i8 %B, 127
  38. ; CHECK-NEXT: %x = add nuw i8 %and.A, %and.B
  39. ; CHECK-NEXT: store i1 false, i1* %overflowPtr
  40. ; CHECK-NEXT: ret i8 %x
  41. }
  42. define i8 @uaddtest3(i8 %A, i8 %B, i1* %overflowPtr) {
  43. %or.A = or i8 %A, -128
  44. %or.B = or i8 %B, -128
  45. %x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %or.A, i8 %or.B)
  46. %y = extractvalue %overflow.result %x, 0
  47. %z = extractvalue %overflow.result %x, 1
  48. store i1 %z, i1* %overflowPtr
  49. ret i8 %y
  50. ; CHECK-LABEL: @uaddtest3(
  51. ; CHECK-NEXT: %or.A = or i8 %A, -128
  52. ; CHECK-NEXT: %or.B = or i8 %B, -128
  53. ; CHECK-NEXT: %x = add i8 %or.A, %or.B
  54. ; CHECK-NEXT: store i1 true, i1* %overflowPtr
  55. ; CHECK-NEXT: ret i8 %x
  56. }
  57. define i8 @uaddtest4(i8 %A, i1* %overflowPtr) {
  58. %x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 undef, i8 %A)
  59. %y = extractvalue %overflow.result %x, 0
  60. %z = extractvalue %overflow.result %x, 1
  61. store i1 %z, i1* %overflowPtr
  62. ret i8 %y
  63. ; CHECK-LABEL: @uaddtest4(
  64. ; CHECK-NEXT: ret i8 undef
  65. }
  66. define i8 @uaddtest5(i8 %A, i1* %overflowPtr) {
  67. %x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 0, i8 %A)
  68. %y = extractvalue %overflow.result %x, 0
  69. %z = extractvalue %overflow.result %x, 1
  70. store i1 %z, i1* %overflowPtr
  71. ret i8 %y
  72. ; CHECK-LABEL: @uaddtest5(
  73. ; CHECK: ret i8 %A
  74. }
  75. define i1 @uaddtest6(i8 %A, i8 %B) {
  76. %x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %A, i8 -4)
  77. %z = extractvalue %overflow.result %x, 1
  78. ret i1 %z
  79. ; CHECK-LABEL: @uaddtest6(
  80. ; CHECK-NEXT: %z = icmp ugt i8 %A, 3
  81. ; CHECK-NEXT: ret i1 %z
  82. }
  83. define i8 @uaddtest7(i8 %A, i8 %B) {
  84. %x = call %overflow.result @llvm.uadd.with.overflow.i8(i8 %A, i8 %B)
  85. %z = extractvalue %overflow.result %x, 0
  86. ret i8 %z
  87. ; CHECK-LABEL: @uaddtest7(
  88. ; CHECK-NEXT: %z = add i8 %A, %B
  89. ; CHECK-NEXT: ret i8 %z
  90. }
  91. ; PR20194
  92. define %ov.result.32 @saddtest_nsw(i8 %a, i8 %b) {
  93. %A = sext i8 %a to i32
  94. %B = sext i8 %b to i32
  95. %x = call %ov.result.32 @llvm.sadd.with.overflow.i32(i32 %A, i32 %B)
  96. ret %ov.result.32 %x
  97. ; CHECK-LABEL: @saddtest_nsw
  98. ; CHECK: %x = add nsw i32 %A, %B
  99. ; CHECK-NEXT: %1 = insertvalue %ov.result.32 { i32 undef, i1 false }, i32 %x, 0
  100. ; CHECK-NEXT: ret %ov.result.32 %1
  101. }
  102. define %ov.result.32 @uaddtest_nuw(i32 %a, i32 %b) {
  103. %A = and i32 %a, 2147483647
  104. %B = and i32 %b, 2147483647
  105. %x = call %ov.result.32 @llvm.uadd.with.overflow.i32(i32 %A, i32 %B)
  106. ret %ov.result.32 %x
  107. ; CHECK-LABEL: @uaddtest_nuw
  108. ; CHECK: %x = add nuw i32 %A, %B
  109. ; CHECK-NEXT: %1 = insertvalue %ov.result.32 { i32 undef, i1 false }, i32 %x, 0
  110. ; CHECK-NEXT: ret %ov.result.32 %1
  111. }
  112. define %ov.result.32 @ssubtest_nsw(i8 %a, i8 %b) {
  113. %A = sext i8 %a to i32
  114. %B = sext i8 %b to i32
  115. %x = call %ov.result.32 @llvm.ssub.with.overflow.i32(i32 %A, i32 %B)
  116. ret %ov.result.32 %x
  117. ; CHECK-LABEL: @ssubtest_nsw
  118. ; CHECK: %x = sub nsw i32 %A, %B
  119. ; CHECK-NEXT: %1 = insertvalue %ov.result.32 { i32 undef, i1 false }, i32 %x, 0
  120. ; CHECK-NEXT: ret %ov.result.32 %1
  121. }
  122. define %ov.result.32 @usubtest_nuw(i32 %a, i32 %b) {
  123. %A = or i32 %a, 2147483648
  124. %B = and i32 %b, 2147483647
  125. %x = call %ov.result.32 @llvm.usub.with.overflow.i32(i32 %A, i32 %B)
  126. ret %ov.result.32 %x
  127. ; CHECK-LABEL: @usubtest_nuw
  128. ; CHECK: %x = sub nuw i32 %A, %B
  129. ; CHECK-NEXT: %1 = insertvalue %ov.result.32 { i32 undef, i1 false }, i32 %x, 0
  130. ; CHECK-NEXT: ret %ov.result.32 %1
  131. }
  132. define %ov.result.32 @smultest1_nsw(i32 %a, i32 %b) {
  133. %A = and i32 %a, 4095 ; 0xfff
  134. %B = and i32 %b, 524287; 0x7ffff
  135. %x = call %ov.result.32 @llvm.smul.with.overflow.i32(i32 %A, i32 %B)
  136. ret %ov.result.32 %x
  137. ; CHECK-LABEL: @smultest1_nsw
  138. ; CHECK: %x = mul nuw nsw i32 %A, %B
  139. ; CHECK-NEXT: %1 = insertvalue %ov.result.32 { i32 undef, i1 false }, i32 %x, 0
  140. ; CHECK-NEXT: ret %ov.result.32 %1
  141. }
  142. define %ov.result.32 @smultest2_nsw(i32 %a, i32 %b) {
  143. %A = ashr i32 %a, 16
  144. %B = ashr i32 %b, 16
  145. %x = call %ov.result.32 @llvm.smul.with.overflow.i32(i32 %A, i32 %B)
  146. ret %ov.result.32 %x
  147. ; CHECK-LABEL: @smultest2_nsw
  148. ; CHECK: %x = mul nsw i32 %A, %B
  149. ; CHECK-NEXT: %1 = insertvalue %ov.result.32 { i32 undef, i1 false }, i32 %x, 0
  150. ; CHECK-NEXT: ret %ov.result.32 %1
  151. }
  152. define %ov.result.32 @smultest3_sw(i32 %a, i32 %b) {
  153. %A = ashr i32 %a, 16
  154. %B = ashr i32 %b, 15
  155. %x = call %ov.result.32 @llvm.smul.with.overflow.i32(i32 %A, i32 %B)
  156. ret %ov.result.32 %x
  157. ; CHECK-LABEL: @smultest3_sw
  158. ; CHECK: %x = call %ov.result.32 @llvm.smul.with.overflow.i32(i32 %A, i32 %B)
  159. ; CHECK-NEXT: ret %ov.result.32 %x
  160. }
  161. define %ov.result.32 @umultest_nuw(i32 %a, i32 %b) {
  162. %A = and i32 %a, 65535 ; 0xffff
  163. %B = and i32 %b, 65535 ; 0xffff
  164. %x = call %ov.result.32 @llvm.umul.with.overflow.i32(i32 %A, i32 %B)
  165. ret %ov.result.32 %x
  166. ; CHECK-LABEL: @umultest_nuw
  167. ; CHECK: %x = mul nuw i32 %A, %B
  168. ; CHECK-NEXT: %1 = insertvalue %ov.result.32 { i32 undef, i1 false }, i32 %x, 0
  169. ; CHECK-NEXT: ret %ov.result.32 %1
  170. }
  171. define i8 @umultest1(i8 %A, i1* %overflowPtr) {
  172. %x = call %overflow.result @llvm.umul.with.overflow.i8(i8 0, i8 %A)
  173. %y = extractvalue %overflow.result %x, 0
  174. %z = extractvalue %overflow.result %x, 1
  175. store i1 %z, i1* %overflowPtr
  176. ret i8 %y
  177. ; CHECK-LABEL: @umultest1(
  178. ; CHECK-NEXT: store i1 false, i1* %overflowPtr
  179. ; CHECK-NEXT: ret i8 0
  180. }
  181. define i8 @umultest2(i8 %A, i1* %overflowPtr) {
  182. %x = call %overflow.result @llvm.umul.with.overflow.i8(i8 1, i8 %A)
  183. %y = extractvalue %overflow.result %x, 0
  184. %z = extractvalue %overflow.result %x, 1
  185. store i1 %z, i1* %overflowPtr
  186. ret i8 %y
  187. ; CHECK-LABEL: @umultest2(
  188. ; CHECK-NEXT: store i1 false, i1* %overflowPtr
  189. ; CHECK-NEXT: ret i8 %A
  190. }
  191. define i32 @umultest3(i32 %n) nounwind {
  192. %shr = lshr i32 %n, 2
  193. %mul = call %ov.result.32 @llvm.umul.with.overflow.i32(i32 %shr, i32 3)
  194. %ov = extractvalue %ov.result.32 %mul, 1
  195. %res = extractvalue %ov.result.32 %mul, 0
  196. %ret = select i1 %ov, i32 -1, i32 %res
  197. ret i32 %ret
  198. ; CHECK-LABEL: @umultest3(
  199. ; CHECK-NEXT: shr
  200. ; CHECK-NEXT: mul nuw
  201. ; CHECK-NEXT: ret
  202. }
  203. define i32 @umultest4(i32 %n) nounwind {
  204. %shr = lshr i32 %n, 1
  205. %mul = call %ov.result.32 @llvm.umul.with.overflow.i32(i32 %shr, i32 4)
  206. %ov = extractvalue %ov.result.32 %mul, 1
  207. %res = extractvalue %ov.result.32 %mul, 0
  208. %ret = select i1 %ov, i32 -1, i32 %res
  209. ret i32 %ret
  210. ; CHECK-LABEL: @umultest4(
  211. ; CHECK: umul.with.overflow
  212. }
  213. define %ov.result.32 @umultest5(i32 %x, i32 %y) nounwind {
  214. %or_x = or i32 %x, 2147483648
  215. %or_y = or i32 %y, 2147483648
  216. %mul = call %ov.result.32 @llvm.umul.with.overflow.i32(i32 %or_x, i32 %or_y)
  217. ret %ov.result.32 %mul
  218. ; CHECK-LABEL: @umultest5(
  219. ; CHECK-NEXT: %[[or_x:.*]] = or i32 %x, -2147483648
  220. ; CHECK-NEXT: %[[or_y:.*]] = or i32 %y, -2147483648
  221. ; CHECK-NEXT: %[[mul:.*]] = mul i32 %[[or_x]], %[[or_y]]
  222. ; CHECK-NEXT: %[[ret:.*]] = insertvalue %ov.result.32 { i32 undef, i1 true }, i32 %[[mul]], 0
  223. ; CHECK-NEXT: ret %ov.result.32 %[[ret]]
  224. }
  225. define void @powi(double %V, double *%P) {
  226. entry:
  227. %A = tail call double @llvm.powi.f64(double %V, i32 -1) nounwind
  228. store volatile double %A, double* %P
  229. %B = tail call double @llvm.powi.f64(double %V, i32 0) nounwind
  230. store volatile double %B, double* %P
  231. %C = tail call double @llvm.powi.f64(double %V, i32 1) nounwind
  232. store volatile double %C, double* %P
  233. ret void
  234. ; CHECK-LABEL: @powi(
  235. ; CHECK: %A = fdiv double 1.0{{.*}}, %V
  236. ; CHECK: store volatile double %A,
  237. ; CHECK: store volatile double 1.0
  238. ; CHECK: store volatile double %V
  239. }
  240. define i32 @cttz(i32 %a) {
  241. entry:
  242. %or = or i32 %a, 8
  243. %and = and i32 %or, -8
  244. %count = tail call i32 @llvm.cttz.i32(i32 %and, i1 true) nounwind readnone
  245. ret i32 %count
  246. ; CHECK-LABEL: @cttz(
  247. ; CHECK-NEXT: entry:
  248. ; CHECK-NEXT: ret i32 3
  249. }
  250. define i8 @ctlz(i8 %a) {
  251. entry:
  252. %or = or i8 %a, 32
  253. %and = and i8 %or, 63
  254. %count = tail call i8 @llvm.ctlz.i8(i8 %and, i1 true) nounwind readnone
  255. ret i8 %count
  256. ; CHECK-LABEL: @ctlz(
  257. ; CHECK-NEXT: entry:
  258. ; CHECK-NEXT: ret i8 2
  259. }
  260. define void @cmp.simplify(i32 %a, i32 %b, i1* %c) {
  261. entry:
  262. %lz = tail call i32 @llvm.ctlz.i32(i32 %a, i1 false) nounwind readnone
  263. %lz.cmp = icmp eq i32 %lz, 32
  264. store volatile i1 %lz.cmp, i1* %c
  265. %tz = tail call i32 @llvm.cttz.i32(i32 %a, i1 false) nounwind readnone
  266. %tz.cmp = icmp ne i32 %tz, 32
  267. store volatile i1 %tz.cmp, i1* %c
  268. %pop = tail call i32 @llvm.ctpop.i32(i32 %b) nounwind readnone
  269. %pop.cmp = icmp eq i32 %pop, 0
  270. store volatile i1 %pop.cmp, i1* %c
  271. ret void
  272. ; CHECK: @cmp.simplify
  273. ; CHECK-NEXT: entry:
  274. ; CHECK-NEXT: %lz.cmp = icmp eq i32 %a, 0
  275. ; CHECK-NEXT: store volatile i1 %lz.cmp, i1* %c
  276. ; CHECK-NEXT: %tz.cmp = icmp ne i32 %a, 0
  277. ; CHECK-NEXT: store volatile i1 %tz.cmp, i1* %c
  278. ; CHECK-NEXT: %pop.cmp = icmp eq i32 %b, 0
  279. ; CHECK-NEXT: store volatile i1 %pop.cmp, i1* %c
  280. }
  281. define i32 @cttz_simplify1a(i32 %x) nounwind readnone ssp {
  282. %tmp1 = tail call i32 @llvm.ctlz.i32(i32 %x, i1 false)
  283. %shr3 = lshr i32 %tmp1, 5
  284. ret i32 %shr3
  285. ; CHECK-LABEL: @cttz_simplify1a(
  286. ; CHECK: icmp eq i32 %x, 0
  287. ; CHECK-NEXT: zext i1
  288. ; CHECK-NEXT: ret i32
  289. }
  290. define i32 @cttz_simplify1b(i32 %x) nounwind readnone ssp {
  291. %tmp1 = tail call i32 @llvm.ctlz.i32(i32 %x, i1 true)
  292. %shr3 = lshr i32 %tmp1, 5
  293. ret i32 %shr3
  294. ; CHECK-LABEL: @cttz_simplify1b(
  295. ; CHECK-NEXT: ret i32 0
  296. }
  297. define i32 @ctlz_undef(i32 %Value) nounwind {
  298. %ctlz = call i32 @llvm.ctlz.i32(i32 0, i1 true)
  299. ret i32 %ctlz
  300. ; CHECK-LABEL: @ctlz_undef(
  301. ; CHECK-NEXT: ret i32 undef
  302. }
  303. define i32 @cttz_undef(i32 %Value) nounwind {
  304. %cttz = call i32 @llvm.cttz.i32(i32 0, i1 true)
  305. ret i32 %cttz
  306. ; CHECK-LABEL: @cttz_undef(
  307. ; CHECK-NEXT: ret i32 undef
  308. }
  309. define i32 @ctlz_select(i32 %Value) nounwind {
  310. %tobool = icmp ne i32 %Value, 0
  311. %ctlz = call i32 @llvm.ctlz.i32(i32 %Value, i1 true)
  312. %s = select i1 %tobool, i32 %ctlz, i32 32
  313. ret i32 %s
  314. ; CHECK-LABEL: @ctlz_select(
  315. ; CHECK-NEXT: call i32 @llvm.ctlz.i32(i32 %Value, i1 false)
  316. ; CHECK-NEXT: ret i32
  317. }
  318. define i32 @cttz_select(i32 %Value) nounwind {
  319. %tobool = icmp ne i32 %Value, 0
  320. %cttz = call i32 @llvm.cttz.i32(i32 %Value, i1 true)
  321. %s = select i1 %tobool, i32 %cttz, i32 32
  322. ret i32 %s
  323. ; CHECK-LABEL: @cttz_select(
  324. ; CHECK-NEXT: call i32 @llvm.cttz.i32(i32 %Value, i1 false)
  325. ; CHECK-NEXT: ret i32
  326. }
  327. ; CHECK-LABEL: @overflow_div_add(
  328. ; CHECK: ret i1 false
  329. define i1 @overflow_div_add(i32 %v1, i32 %v2) nounwind {
  330. entry:
  331. %div = sdiv i32 %v1, 2
  332. %t = call %ov.result.32 @llvm.sadd.with.overflow.i32(i32 %div, i32 1)
  333. %obit = extractvalue %ov.result.32 %t, 1
  334. ret i1 %obit
  335. }
  336. ; CHECK-LABEL: @overflow_div_sub(
  337. ; CHECK: ret i1 false
  338. define i1 @overflow_div_sub(i32 %v1, i32 %v2) nounwind {
  339. entry:
  340. ; Check cases where the known sign bits are larger than the word size.
  341. %a = ashr i32 %v1, 18
  342. %div = sdiv i32 %a, 65536
  343. %t = call %ov.result.32 @llvm.ssub.with.overflow.i32(i32 %div, i32 1)
  344. %obit = extractvalue %ov.result.32 %t, 1
  345. ret i1 %obit
  346. }
  347. ; CHECK-LABEL: @overflow_mod_mul(
  348. ; CHECK: ret i1 false
  349. define i1 @overflow_mod_mul(i32 %v1, i32 %v2) nounwind {
  350. entry:
  351. %rem = srem i32 %v1, 1000
  352. %t = call %ov.result.32 @llvm.smul.with.overflow.i32(i32 %rem, i32 %rem)
  353. %obit = extractvalue %ov.result.32 %t, 1
  354. ret i1 %obit
  355. }
  356. ; CHECK-LABEL: @overflow_mod_overflow_mul(
  357. ; CHECK-NOT: ret i1 false
  358. define i1 @overflow_mod_overflow_mul(i32 %v1, i32 %v2) nounwind {
  359. entry:
  360. %rem = srem i32 %v1, 65537
  361. ; This may overflow because the result of the mul operands may be greater than 16bits
  362. ; and the result greater than 32.
  363. %t = call %ov.result.32 @llvm.smul.with.overflow.i32(i32 %rem, i32 %rem)
  364. %obit = extractvalue %ov.result.32 %t, 1
  365. ret i1 %obit
  366. }
  367. define %ov.result.32 @ssubtest_reorder(i8 %a) {
  368. %A = sext i8 %a to i32
  369. %x = call %ov.result.32 @llvm.ssub.with.overflow.i32(i32 0, i32 %A)
  370. ret %ov.result.32 %x
  371. ; CHECK-LABEL: @ssubtest_reorder
  372. ; CHECK: %x = sub nsw i32 0, %A
  373. ; CHECK-NEXT: %1 = insertvalue %ov.result.32 { i32 undef, i1 false }, i32 %x, 0
  374. ; CHECK-NEXT: ret %ov.result.32 %1
  375. }
  376. define %ov.result.32 @never_overflows_ssub_test0(i32 %a) {
  377. %x = call %ov.result.32 @llvm.ssub.with.overflow.i32(i32 %a, i32 0)
  378. ret %ov.result.32 %x
  379. ; CHECK-LABEL: @never_overflows_ssub_test0
  380. ; CHECK-NEXT: %[[x:.*]] = insertvalue %ov.result.32 { i32 undef, i1 false }, i32 %a, 0
  381. ; CHECK-NEXT: ret %ov.result.32 %[[x]]
  382. }
  383. define void @cos(double *%P) {
  384. entry:
  385. %B = tail call double @llvm.cos.f64(double 0.0) nounwind
  386. store volatile double %B, double* %P
  387. ret void
  388. ; CHECK-LABEL: @cos(
  389. ; CHECK: store volatile double 1.000000e+00, double* %P
  390. }
  391. define void @sin(double *%P) {
  392. entry:
  393. %B = tail call double @llvm.sin.f64(double 0.0) nounwind
  394. store volatile double %B, double* %P
  395. ret void
  396. ; CHECK-LABEL: @sin(
  397. ; CHECK: store volatile double 0.000000e+00, double* %P
  398. }