File: 2002-02-14-EntryNodePreds.c

package info (click to toggle)
llvm-2.7 2.7-6
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 59,992 kB
  • ctags: 49,499
  • sloc: cpp: 373,792; ansic: 16,885; sh: 12,614; asm: 6,809; ada: 3,083; ml: 2,942; python: 2,671; perl: 2,404; makefile: 1,691; pascal: 1,235; exp: 399; objc: 291; lisp: 184; csh: 117; xml: 38; f90: 36
file content (37 lines) | stat: -rw-r--r-- 719 bytes parent folder | download | duplicates (2) 
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: %llvmgcc -S %s -o - | llvm-as -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;
    }
  }
}