File: 2002-02-14-EntryNodePreds.c

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,998,520 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (37 lines) | stat: -rw-r--r-- 715 bytes parent folder | download | duplicates (38) 
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
 
// RUN: %clang_cc1 -emit-llvm %s  -o /dev/null

/* GCC Used to generate code that contained a branch to the entry node of 
 * the do_merge function.  This is illegal LLVM code.  To fix this, GCC now
 * inserts an entry node regardless of whether or not it has to insert allocas.
 */

struct edge_rec
{
  struct VERTEX *v;
  struct edge_rec *next;
  int wasseen;
  int more_data;
};

typedef struct edge_rec *QUAD_EDGE;

typedef struct {
  QUAD_EDGE left, right;
} EDGE_PAIR;

struct EDGE_STACK {
    int ptr;
    QUAD_EDGE *elts;
    int stack_size;
};

int do_merge(QUAD_EDGE ldo, QUAD_EDGE rdo) {
  int lvalid;
  QUAD_EDGE basel,rcand;
  while (1) {
    if (!lvalid) {
      return (int)basel->next;
    }
  }
}