* Copyright (c) 1980 Regents of the University of California.
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
* @(#)optim.h 5.1 (Berkeley) 6/7/85
* structure to hold trees for optimization
typedef struct slt
*Slotp
;
extern Slotp firstslot
, lastslot
; /* first, last slots in buffer */
extern int numslots
; /* number of slots */
Slotp
newslot(), optbuff(), optinsert();
struct Ctlframe
*cpframe();
** Structures for cse analysis
typedef struct IDblock
*idptr
;
typedef struct VALUEnode
*valuen
;
typedef struct IDlist
*idlptr
;
typedef struct DUPlist
*duplptr
;
typedef struct NODElist
*nodelptr
;
valuen initval
, assgnval
;
* structure to hold information on basic blocks
valuen headnode
, tailnode
;
struct bblock
*next
, *prev
;
typedef struct bblock
*Bblockp
;
extern Bblockp firstblock
; /* first block in buffer */
extern Bblockp lastblock
; /* last block in buffer */
/* data structure for optloop and regalloc routines */