File: 2002-03-14-BrokenSSA.c

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-6~deb11u1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 1,418,812 kB
  • sloc: cpp: 5,290,827; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,900; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,892; xml: 953; cs: 573; fortran: 539
file content (17 lines) | stat: -rw-r--r-- 342 bytes parent folder | download | duplicates (25) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
 
// RUN: %clang_cc1 -emit-llvm %s  -o /dev/null

/* This code used to break GCC's SSA computation code.  It would create
   uses of B & C that are not dominated by their definitions.  See:
   http://gcc.gnu.org/ml/gcc/2002-03/msg00697.html
 */
int bar();
int foo()
{
  int a,b,c;

  a = b + c;
  b = bar();
  c = bar();
  return a + b + c;
}