1SKIP: FAILED
2
3vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:46:11 warning: code is unreachable
4          return;
5          ^^^^^^
6
7vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:60:11 warning: code is unreachable
8          return;
9          ^^^^^^
10
11vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:62:9 warning: code is unreachable
12        return;
13        ^^^^^^
14
15vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:105:11 warning: code is unreachable
16          return;
17          ^^^^^^
18
19vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:119:11 warning: code is unreachable
20          return;
21          ^^^^^^
22
23vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:121:9 warning: code is unreachable
24        return;
25        ^^^^^^
26
27vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:164:11 warning: code is unreachable
28          return;
29          ^^^^^^
30
31vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:178:11 warning: code is unreachable
32          return;
33          ^^^^^^
34
35vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:180:9 warning: code is unreachable
36        return;
37        ^^^^^^
38
39vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:223:11 warning: code is unreachable
40          return;
41          ^^^^^^
42
43vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:237:11 warning: code is unreachable
44          return;
45          ^^^^^^
46
47vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:239:9 warning: code is unreachable
48        return;
49        ^^^^^^
50
51vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:282:11 warning: code is unreachable
52          return;
53          ^^^^^^
54
55vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:296:11 warning: code is unreachable
56          return;
57          ^^^^^^
58
59vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:298:9 warning: code is unreachable
60        return;
61        ^^^^^^
62
63vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:341:11 warning: code is unreachable
64          return;
65          ^^^^^^
66
67vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:355:11 warning: code is unreachable
68          return;
69          ^^^^^^
70
71vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:357:9 warning: code is unreachable
72        return;
73        ^^^^^^
74
75vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:400:11 warning: code is unreachable
76          return;
77          ^^^^^^
78
79vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:414:11 warning: code is unreachable
80          return;
81          ^^^^^^
82
83vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:416:9 warning: code is unreachable
84        return;
85        ^^^^^^
86
87vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:459:11 warning: code is unreachable
88          return;
89          ^^^^^^
90
91vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:473:11 warning: code is unreachable
92          return;
93          ^^^^^^
94
95vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:475:9 warning: code is unreachable
96        return;
97        ^^^^^^
98
99vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:518:11 warning: code is unreachable
100          return;
101          ^^^^^^
102
103vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:532:11 warning: code is unreachable
104          return;
105          ^^^^^^
106
107vk-gl-cts/graphicsfuzz/stable-binarysearch-tree-false-if-discard-loop/0.wgsl:534:9 warning: code is unreachable
108        return;
109        ^^^^^^
110
111struct BST {
112  int data;
113  int leftIndex;
114  int rightIndex;
115};
116
117static float4 x_GLF_color = float4(0.0f, 0.0f, 0.0f, 0.0f);
118
119void main_1() {
120  BST tree[10] = (BST[10])0;
121  int x_356 = 0;
122  int x_58_phi = 0;
123  bool x_86_phi = false;
124  int x_353_phi = 0;
125  int x_356_phi = 0;
126  int x_358_phi = 0;
127  const BST tint_symbol_1 = {9, -1, -1};
128  tree[0] = tint_symbol_1;
129  0u;
130  do {
131    x_58_phi = 0;
132    [loop] while (true) {
133      int x_84 = 0;
134      int x_76 = 0;
135      int x_59 = 0;
136      int x_59_phi = 0;
137      const int x_58 = x_58_phi;
138      x_86_phi = false;
139      if ((x_58 <= 1)) {
140      } else {
141        break;
142      }
143      const int x_65 = tree[x_58].data;
144      if ((5 <= x_65)) {
145        const int x_78_save = x_58;
146        const int x_79 = tree[x_78_save].leftIndex;
147        if ((x_79 == -1)) {
148          tree[x_78_save].leftIndex = 1;
149          const BST tint_symbol_2 = {5, -1, -1};
150          tree[1] = tint_symbol_2;
151          x_86_phi = true;
152          break;
153        } else {
154          x_84 = tree[x_78_save].leftIndex;
155          x_59_phi = x_84;
156          {
157            x_59 = x_59_phi;
158            x_58_phi = x_59;
159          }
160          continue;
161        }
162        return;
163      } else {
164        const int x_70_save = x_58;
165        const int x_71 = tree[x_70_save].rightIndex;
166        if ((x_71 == -1)) {
167          tree[x_70_save].rightIndex = 1;
168          const BST tint_symbol_3 = {5, -1, -1};
169          tree[1] = tint_symbol_3;
170          x_86_phi = true;
171          break;
172        } else {
173          x_76 = tree[x_70_save].rightIndex;
174          x_59_phi = x_76;
175          {
176            x_59 = x_59_phi;
177            x_58_phi = x_59;
178          }
179          continue;
180        }
181        return;
182      }
183      return;
184      {
185        x_59 = x_59_phi;
186        x_58_phi = x_59;
187      }
188    }
189    if (x_86_phi) {
190      break;
191    }
192  } while (false);
193  int x_91_phi = 0;
194  bool x_119_phi = false;
195  0u;
196  do {
197    x_91_phi = 0;
198    [loop] while (true) {
199      int x_117 = 0;
200      int x_109 = 0;
201      int x_92 = 0;
202      int x_92_phi = 0;
203      const int x_91 = x_91_phi;
204      x_119_phi = false;
205      if ((x_91 <= 2)) {
206      } else {
207        break;
208      }
209      const int x_98 = tree[x_91].data;
210      if ((12 <= x_98)) {
211        const int x_111_save = x_91;
212        const int x_112 = tree[x_111_save].leftIndex;
213        if ((x_112 == -1)) {
214          tree[x_111_save].leftIndex = 2;
215          const BST tint_symbol_4 = {12, -1, -1};
216          tree[2] = tint_symbol_4;
217          x_119_phi = true;
218          break;
219        } else {
220          x_117 = tree[x_111_save].leftIndex;
221          x_92_phi = x_117;
222          {
223            x_92 = x_92_phi;
224            x_91_phi = x_92;
225          }
226          continue;
227        }
228        return;
229      } else {
230        const int x_103_save = x_91;
231        const int x_104 = tree[x_103_save].rightIndex;
232        if ((x_104 == -1)) {
233          tree[x_103_save].rightIndex = 2;
234          const BST tint_symbol_5 = {12, -1, -1};
235          tree[2] = tint_symbol_5;
236          x_119_phi = true;
237          break;
238        } else {
239          x_109 = tree[x_103_save].rightIndex;
240          x_92_phi = x_109;
241          {
242            x_92 = x_92_phi;
243            x_91_phi = x_92;
244          }
245          continue;
246        }
247        return;
248      }
249      return;
250      {
251        x_92 = x_92_phi;
252        x_91_phi = x_92;
253      }
254    }
255    if (x_119_phi) {
256      break;
257    }
258  } while (false);
259  int x_124_phi = 0;
260  bool x_152_phi = false;
261  0u;
262  do {
263    x_124_phi = 0;
264    [loop] while (true) {
265      int x_150 = 0;
266      int x_142 = 0;
267      int x_125 = 0;
268      int x_125_phi = 0;
269      const int x_124 = x_124_phi;
270      x_152_phi = false;
271      if ((x_124 <= 3)) {
272      } else {
273        break;
274      }
275      const int x_131 = tree[x_124].data;
276      if ((15 <= x_131)) {
277        const int x_144_save = x_124;
278        const int x_145 = tree[x_144_save].leftIndex;
279        if ((x_145 == -1)) {
280          tree[x_144_save].leftIndex = 3;
281          const BST tint_symbol_6 = {15, -1, -1};
282          tree[3] = tint_symbol_6;
283          x_152_phi = true;
284          break;
285        } else {
286          x_150 = tree[x_144_save].leftIndex;
287          x_125_phi = x_150;
288          {
289            x_125 = x_125_phi;
290            x_124_phi = x_125;
291          }
292          continue;
293        }
294        return;
295      } else {
296        const int x_136_save = x_124;
297        const int x_137 = tree[x_136_save].rightIndex;
298        if ((x_137 == -1)) {
299          tree[x_136_save].rightIndex = 3;
300          const BST tint_symbol_7 = {15, -1, -1};
301          tree[3] = tint_symbol_7;
302          x_152_phi = true;
303          break;
304        } else {
305          x_142 = tree[x_136_save].rightIndex;
306          x_125_phi = x_142;
307          {
308            x_125 = x_125_phi;
309            x_124_phi = x_125;
310          }
311          continue;
312        }
313        return;
314      }
315      return;
316      {
317        x_125 = x_125_phi;
318        x_124_phi = x_125;
319      }
320    }
321    if (x_152_phi) {
322      break;
323    }
324  } while (false);
325  int x_157_phi = 0;
326  bool x_185_phi = false;
327  0u;
328  do {
329    x_157_phi = 0;
330    [loop] while (true) {
331      int x_183 = 0;
332      int x_175 = 0;
333      int x_158 = 0;
334      int x_158_phi = 0;
335      const int x_157 = x_157_phi;
336      x_185_phi = false;
337      if ((x_157 <= 4)) {
338      } else {
339        break;
340      }
341      const int x_164 = tree[x_157].data;
342      if ((7 <= x_164)) {
343        const int x_177_save = x_157;
344        const int x_178 = tree[x_177_save].leftIndex;
345        if ((x_178 == -1)) {
346          tree[x_177_save].leftIndex = 4;
347          const BST tint_symbol_8 = {7, -1, -1};
348          tree[4] = tint_symbol_8;
349          x_185_phi = true;
350          break;
351        } else {
352          x_183 = tree[x_177_save].leftIndex;
353          x_158_phi = x_183;
354          {
355            x_158 = x_158_phi;
356            x_157_phi = x_158;
357          }
358          continue;
359        }
360        return;
361      } else {
362        const int x_169_save = x_157;
363        const int x_170 = tree[x_169_save].rightIndex;
364        if ((x_170 == -1)) {
365          tree[x_169_save].rightIndex = 4;
366          const BST tint_symbol_9 = {7, -1, -1};
367          tree[4] = tint_symbol_9;
368          x_185_phi = true;
369          break;
370        } else {
371          x_175 = tree[x_169_save].rightIndex;
372          x_158_phi = x_175;
373          {
374            x_158 = x_158_phi;
375            x_157_phi = x_158;
376          }
377          continue;
378        }
379        return;
380      }
381      return;
382      {
383        x_158 = x_158_phi;
384        x_157_phi = x_158;
385      }
386    }
387    if (x_185_phi) {
388      break;
389    }
390  } while (false);
391  int x_190_phi = 0;
392  bool x_218_phi = false;
393  0u;
394  do {
395    x_190_phi = 0;
396    [loop] while (true) {
397      int x_216 = 0;
398      int x_208 = 0;
399      int x_191 = 0;
400      int x_191_phi = 0;
401      const int x_190 = x_190_phi;
402      x_218_phi = false;
403      if ((x_190 <= 5)) {
404      } else {
405        break;
406      }
407      const int x_197 = tree[x_190].data;
408      if ((8 <= x_197)) {
409        const int x_210_save = x_190;
410        const int x_211 = tree[x_210_save].leftIndex;
411        if ((x_211 == -1)) {
412          tree[x_210_save].leftIndex = 5;
413          const BST tint_symbol_10 = {8, -1, -1};
414          tree[5] = tint_symbol_10;
415          x_218_phi = true;
416          break;
417        } else {
418          x_216 = tree[x_210_save].leftIndex;
419          x_191_phi = x_216;
420          {
421            x_191 = x_191_phi;
422            x_190_phi = x_191;
423          }
424          continue;
425        }
426        return;
427      } else {
428        const int x_202_save = x_190;
429        const int x_203 = tree[x_202_save].rightIndex;
430        if ((x_203 == -1)) {
431          tree[x_202_save].rightIndex = 5;
432          const BST tint_symbol_11 = {8, -1, -1};
433          tree[5] = tint_symbol_11;
434          x_218_phi = true;
435          break;
436        } else {
437          x_208 = tree[x_202_save].rightIndex;
438          x_191_phi = x_208;
439          {
440            x_191 = x_191_phi;
441            x_190_phi = x_191;
442          }
443          continue;
444        }
445        return;
446      }
447      return;
448      {
449        x_191 = x_191_phi;
450        x_190_phi = x_191;
451      }
452    }
453    if (x_218_phi) {
454      break;
455    }
456  } while (false);
457  int x_223_phi = 0;
458  bool x_251_phi = false;
459  0u;
460  do {
461    x_223_phi = 0;
462    [loop] while (true) {
463      int x_249 = 0;
464      int x_241 = 0;
465      int x_224 = 0;
466      int x_224_phi = 0;
467      const int x_223 = x_223_phi;
468      x_251_phi = false;
469      if ((x_223 <= 6)) {
470      } else {
471        break;
472      }
473      const int x_230 = tree[x_223].data;
474      if ((2 <= x_230)) {
475        const int x_243_save = x_223;
476        const int x_244 = tree[x_243_save].leftIndex;
477        if ((x_244 == -1)) {
478          tree[x_243_save].leftIndex = 6;
479          const BST tint_symbol_12 = {2, -1, -1};
480          tree[6] = tint_symbol_12;
481          x_251_phi = true;
482          break;
483        } else {
484          x_249 = tree[x_243_save].leftIndex;
485          x_224_phi = x_249;
486          {
487            x_224 = x_224_phi;
488            x_223_phi = x_224;
489          }
490          continue;
491        }
492        return;
493      } else {
494        const int x_235_save = x_223;
495        const int x_236 = tree[x_235_save].rightIndex;
496        if ((x_236 == -1)) {
497          tree[x_235_save].rightIndex = 6;
498          const BST tint_symbol_13 = {2, -1, -1};
499          tree[6] = tint_symbol_13;
500          x_251_phi = true;
501          break;
502        } else {
503          x_241 = tree[x_235_save].rightIndex;
504          x_224_phi = x_241;
505          {
506            x_224 = x_224_phi;
507            x_223_phi = x_224;
508          }
509          continue;
510        }
511        return;
512      }
513      return;
514      {
515        x_224 = x_224_phi;
516        x_223_phi = x_224;
517      }
518    }
519    if (x_251_phi) {
520      break;
521    }
522  } while (false);
523  int x_256_phi = 0;
524  bool x_284_phi = false;
525  0u;
526  do {
527    x_256_phi = 0;
528    [loop] while (true) {
529      int x_282 = 0;
530      int x_274 = 0;
531      int x_257 = 0;
532      int x_257_phi = 0;
533      const int x_256 = x_256_phi;
534      x_284_phi = false;
535      if ((x_256 <= 7)) {
536      } else {
537        break;
538      }
539      const int x_263 = tree[x_256].data;
540      if ((6 <= x_263)) {
541        const int x_276_save = x_256;
542        const int x_277 = tree[x_276_save].leftIndex;
543        if ((x_277 == -1)) {
544          tree[x_276_save].leftIndex = 7;
545          const BST tint_symbol_14 = {6, -1, -1};
546          tree[7] = tint_symbol_14;
547          x_284_phi = true;
548          break;
549        } else {
550          x_282 = tree[x_276_save].leftIndex;
551          x_257_phi = x_282;
552          {
553            x_257 = x_257_phi;
554            x_256_phi = x_257;
555          }
556          continue;
557        }
558        return;
559      } else {
560        const int x_268_save = x_256;
561        const int x_269 = tree[x_268_save].rightIndex;
562        if ((x_269 == -1)) {
563          tree[x_268_save].rightIndex = 7;
564          const BST tint_symbol_15 = {6, -1, -1};
565          tree[7] = tint_symbol_15;
566          x_284_phi = true;
567          break;
568        } else {
569          x_274 = tree[x_268_save].rightIndex;
570          x_257_phi = x_274;
571          {
572            x_257 = x_257_phi;
573            x_256_phi = x_257;
574          }
575          continue;
576        }
577        return;
578      }
579      return;
580      {
581        x_257 = x_257_phi;
582        x_256_phi = x_257;
583      }
584    }
585    if (x_284_phi) {
586      break;
587    }
588  } while (false);
589  int x_289_phi = 0;
590  bool x_317_phi = false;
591  0u;
592  do {
593    x_289_phi = 0;
594    [loop] while (true) {
595      int x_315 = 0;
596      int x_307 = 0;
597      int x_290 = 0;
598      int x_290_phi = 0;
599      const int x_289 = x_289_phi;
600      x_317_phi = false;
601      if ((x_289 <= 8)) {
602      } else {
603        break;
604      }
605      const int x_296 = tree[x_289].data;
606      if ((17 <= x_296)) {
607        const int x_309_save = x_289;
608        const int x_310 = tree[x_309_save].leftIndex;
609        if ((x_310 == -1)) {
610          tree[x_309_save].leftIndex = 8;
611          const BST tint_symbol_16 = {17, -1, -1};
612          tree[8] = tint_symbol_16;
613          x_317_phi = true;
614          break;
615        } else {
616          x_315 = tree[x_309_save].leftIndex;
617          x_290_phi = x_315;
618          {
619            x_290 = x_290_phi;
620            x_289_phi = x_290;
621          }
622          continue;
623        }
624        return;
625      } else {
626        const int x_301_save = x_289;
627        const int x_302 = tree[x_301_save].rightIndex;
628        if ((x_302 == -1)) {
629          tree[x_301_save].rightIndex = 8;
630          const BST tint_symbol_17 = {17, -1, -1};
631          tree[8] = tint_symbol_17;
632          x_317_phi = true;
633          break;
634        } else {
635          x_307 = tree[x_301_save].rightIndex;
636          x_290_phi = x_307;
637          {
638            x_290 = x_290_phi;
639            x_289_phi = x_290;
640          }
641          continue;
642        }
643        return;
644      }
645      return;
646      {
647        x_290 = x_290_phi;
648        x_289_phi = x_290;
649      }
650    }
651    if (x_317_phi) {
652      break;
653    }
654  } while (false);
655  int x_322_phi = 0;
656  bool x_350_phi = false;
657  0u;
658  do {
659    x_322_phi = 0;
660    [loop] while (true) {
661      int x_348 = 0;
662      int x_340 = 0;
663      int x_323 = 0;
664      int x_323_phi = 0;
665      const int x_322 = x_322_phi;
666      x_350_phi = false;
667      if ((x_322 <= 9)) {
668      } else {
669        break;
670      }
671      const int x_329 = tree[x_322].data;
672      if ((13 <= x_329)) {
673        const int x_342_save = x_322;
674        const int x_343 = tree[x_342_save].leftIndex;
675        if ((x_343 == -1)) {
676          tree[x_342_save].leftIndex = 9;
677          const BST tint_symbol_18 = {13, -1, -1};
678          tree[9] = tint_symbol_18;
679          x_350_phi = true;
680          break;
681        } else {
682          x_348 = tree[x_342_save].leftIndex;
683          x_323_phi = x_348;
684          {
685            x_323 = x_323_phi;
686            x_322_phi = x_323;
687          }
688          continue;
689        }
690        return;
691      } else {
692        const int x_334_save = x_322;
693        const int x_335 = tree[x_334_save].rightIndex;
694        if ((x_335 == -1)) {
695          tree[x_334_save].rightIndex = 9;
696          const BST tint_symbol_19 = {13, -1, -1};
697          tree[9] = tint_symbol_19;
698          x_350_phi = true;
699          break;
700        } else {
701          x_340 = tree[x_334_save].rightIndex;
702          x_323_phi = x_340;
703          {
704            x_323 = x_323_phi;
705            x_322_phi = x_323;
706          }
707          continue;
708        }
709        return;
710      }
711      return;
712      {
713        x_323 = x_323_phi;
714        x_322_phi = x_323;
715      }
716    }
717    if (x_350_phi) {
718      break;
719    }
720  } while (false);
721  x_353_phi = 0;
722  x_356_phi = 0;
723  x_358_phi = 0;
724  [loop] while (true) {
725    int x_381 = 0;
726    int x_391 = 0;
727    int x_396 = 0;
728    int x_359 = 0;
729    int x_354_phi = 0;
730    int x_357_phi = 0;
731    const int x_353 = x_353_phi;
732    x_356 = x_356_phi;
733    const int x_358 = x_358_phi;
734    if ((x_358 < 20)) {
735    } else {
736      break;
737    }
738    int x_366_phi = 0;
739    int x_381_phi = 0;
740    bool x_382_phi = false;
741    0u;
742    do {
743      x_366_phi = 0;
744      [loop] while (true) {
745        const int x_366 = x_366_phi;
746        x_381_phi = x_353;
747        x_382_phi = false;
748        if ((x_366 != -1)) {
749        } else {
750          break;
751        }
752        const BST x_373 = tree[x_366];
753        const int x_374 = x_373.data;
754        const int x_375 = x_373.leftIndex;
755        const int x_376 = x_373.rightIndex;
756        if ((x_374 == x_358)) {
757          x_381_phi = x_358;
758          x_382_phi = true;
759          break;
760        }
761        {
762          x_366_phi = ((x_358 > x_374) ? x_376 : x_375);
763        }
764      }
765      x_381 = x_381_phi;
766      const bool x_382 = x_382_phi;
767      x_354_phi = x_381;
768      if (x_382) {
769        break;
770      }
771      x_354_phi = -1;
772    } while (false);
773    int x_354 = 0;
774    int x_390 = 0;
775    int x_395 = 0;
776    int x_391_phi = 0;
777    int x_396_phi = 0;
778    x_354 = x_354_phi;
779    switch(x_358) {
780      case 2:
781      case 5:
782      case 6:
783      case 7:
784      case 8:
785      case 9:
786      case 12:
787      case 13:
788      case 15:
789      case 17: {
790        x_391_phi = x_356;
791        if ((x_354 == asint(x_358))) {
792          x_390 = asint((x_356 + asint(1)));
793          x_391_phi = x_390;
794        }
795        x_391 = x_391_phi;
796        x_357_phi = x_391;
797        break;
798      }
799      default: {
800        x_396_phi = x_356;
801        if ((x_354 == asint(-1))) {
802          x_395 = asint((x_356 + asint(1)));
803          x_396_phi = x_395;
804        }
805        x_396 = x_396_phi;
806        x_357_phi = x_396;
807        break;
808      }
809    }
810    const int x_357 = x_357_phi;
811    {
812      x_359 = (x_358 + 1);
813      x_353_phi = x_354;
814      x_356_phi = x_357;
815      x_358_phi = x_359;
816    }
817  }
818  if ((x_356 == asint(20))) {
819    x_GLF_color = float4(1.0f, 0.0f, 0.0f, 1.0f);
820  } else {
821    x_GLF_color = float4(0.0f, 0.0f, 1.0f, 1.0f);
822  }
823  return;
824}
825
826struct main_out {
827  float4 x_GLF_color_1;
828};
829struct tint_symbol {
830  float4 x_GLF_color_1 : SV_Target0;
831};
832
833main_out main_inner() {
834  main_1();
835  const main_out tint_symbol_20 = {x_GLF_color};
836  return tint_symbol_20;
837}
838
839tint_symbol main() {
840  const main_out inner_result = main_inner();
841  tint_symbol wrapper_result = (tint_symbol)0;
842  wrapper_result.x_GLF_color_1 = inner_result.x_GLF_color_1;
843  return wrapper_result;
844}
845C:\src\tint\test\Shader@0x000001F23007A140(82,5-17): warning X3557: loop only executes for 1 iteration(s), forcing loop to unroll
846C:\src\tint\test\Shader@0x000001F23007A140(22,12-23): warning X3557: loop only executes for 0 iteration(s), consider removing [loop]
847C:\src\tint\test\Shader@0x000001F23007A140(148,5-17): warning X3557: loop only executes for 1 iteration(s), forcing loop to unroll
848C:\src\tint\test\Shader@0x000001F23007A140(214,5-17): warning X3557: loop only executes for 1 iteration(s), forcing loop to unroll
849C:\src\tint\test\Shader@0x000001F23007A140(280,5-17): warning X3557: loop only executes for 1 iteration(s), forcing loop to unroll
850C:\src\tint\test\Shader@0x000001F23007A140(346,5-17): warning X3557: loop only executes for 1 iteration(s), forcing loop to unroll
851C:\src\tint\test\Shader@0x000001F23007A140(412,5-17): warning X3557: loop only executes for 1 iteration(s), forcing loop to unroll
852C:\src\tint\test\Shader@0x000001F23007A140(478,5-17): warning X3557: loop only executes for 1 iteration(s), forcing loop to unroll
853C:\src\tint\test\Shader@0x000001F23007A140(544,5-17): warning X3557: loop only executes for 1 iteration(s), forcing loop to unroll
854C:\src\tint\test\Shader@0x000001F23007A140(610,5-17): warning X3557: loop only executes for 1 iteration(s), forcing loop to unroll
855C:\src\tint\test\Shader@0x000001F23007A140(662,7-19): warning X3557: loop only executes for 1 iteration(s), forcing loop to unroll
856internal error: compilation aborted unexpectedly
857
858