File: 2002-03-14-BrokenSSA.c

package info (click to toggle)
llvm-toolchain-3.4 1%3A3.4.2-13
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 253,236 kB
  • ctags: 276,203
  • sloc: cpp: 1,665,580; ansic: 298,647; asm: 206,157; objc: 84,350; python: 73,119; sh: 23,466; perl: 5,679; makefile: 5,542; ml: 5,250; pascal: 2,467; lisp: 1,420; xml: 679; cs: 236; csh: 117
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;
}