github.com/zach-klippenstein/go@v0.0.0-20150108044943-fcfbeb3adf58/src/cmd/5g/opt.h (about)

     1  // Inferno utils/5c/gc.h
     2  // http://code.google.com/p/inferno-os/source/browse/utils/5c/gc.h
     3  //
     4  //	Copyright © 1994-1999 Lucent Technologies Inc.  All rights reserved.
     5  //	Portions Copyright © 1995-1997 C H Forsyth (forsyth@terzarima.net)
     6  //	Portions Copyright © 1997-1999 Vita Nuova Limited
     7  //	Portions Copyright © 2000-2007 Vita Nuova Holdings Limited (www.vitanuova.com)
     8  //	Portions Copyright © 2004,2006 Bruce Ellis
     9  //	Portions Copyright © 2005-2007 C H Forsyth (forsyth@terzarima.net)
    10  //	Revisions Copyright © 2000-2007 Lucent Technologies Inc. and others
    11  //	Portions Copyright © 2009 The Go Authors.  All rights reserved.
    12  //
    13  // Permission is hereby granted, free of charge, to any person obtaining a copy
    14  // of this software and associated documentation files (the "Software"), to deal
    15  // in the Software without restriction, including without limitation the rights
    16  // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
    17  // copies of the Software, and to permit persons to whom the Software is
    18  // furnished to do so, subject to the following conditions:
    19  //
    20  // The above copyright notice and this permission notice shall be included in
    21  // all copies or substantial portions of the Software.
    22  //
    23  // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
    24  // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
    25  // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
    26  // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
    27  // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
    28  // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
    29  // THE SOFTWARE.
    30  
    31  #include	"../gc/popt.h"
    32  
    33  #define	Z	N
    34  #define	Adr	Addr
    35  
    36  #define	D_HI	D_NONE
    37  #define	D_LO	D_NONE
    38  
    39  #define	BLOAD(r)	band(bnot(r->refbehind), r->refahead)
    40  #define	BSTORE(r)	band(bnot(r->calbehind), r->calahead)
    41  #define	LOAD(r)		(~r->refbehind.b[z] & r->refahead.b[z])
    42  #define	STORE(r)	(~r->calbehind.b[z] & r->calahead.b[z])
    43  
    44  #define	CLOAD	5
    45  #define	CREF	5
    46  #define	CINF	1000
    47  #define	LOOP	3
    48  
    49  typedef	struct	Reg	Reg;
    50  typedef	struct	Rgn	Rgn;
    51  
    52  /*c2go
    53  extern Node *Z;
    54  enum
    55  {
    56  	D_HI = D_NONE,
    57  	D_LO = D_NONE,
    58  	CLOAD = 5,
    59  	CREF = 5,
    60  	CINF = 1000,
    61  	LOOP = 3,
    62  };
    63  
    64  uint32 BLOAD(Reg*);
    65  uint32 BSTORE(Reg*);
    66  uint64 LOAD(Reg*);
    67  uint64 STORE(Reg*);
    68  */
    69  
    70  // A Reg is a wrapper around a single Prog (one instruction) that holds
    71  // register optimization information while the optimizer runs.
    72  // r->prog is the instruction.
    73  // r->prog->opt points back to r.
    74  struct	Reg
    75  {
    76  	Flow	f;
    77  
    78  	Bits	set;  		// regopt variables written by this instruction.
    79  	Bits	use1; 		// regopt variables read by prog->from.
    80  	Bits	use2; 		// regopt variables read by prog->to.
    81  
    82  	// refahead/refbehind are the regopt variables whose current
    83  	// value may be used in the following/preceding instructions
    84  	// up to a CALL (or the value is clobbered).
    85  	Bits	refbehind;
    86  	Bits	refahead;
    87  	// calahead/calbehind are similar, but for variables in
    88  	// instructions that are reachable after hitting at least one
    89  	// CALL.
    90  	Bits	calbehind;
    91  	Bits	calahead;
    92  	Bits	regdiff;
    93  	Bits	act;
    94  
    95  	int32	regu;		// register used bitmap
    96  };
    97  #define	R	((Reg*)0)
    98  /*c2go extern Reg *R; */
    99  
   100  #define	NRGN	600
   101  /*c2go enum { NRGN = 600 }; */
   102  
   103  // A Rgn represents a single regopt variable over a region of code
   104  // where a register could potentially be dedicated to that variable.
   105  // The code encompassed by a Rgn is defined by the flow graph,
   106  // starting at enter, flood-filling forward while varno is refahead
   107  // and backward while varno is refbehind, and following branches.  A
   108  // single variable may be represented by multiple disjoint Rgns and
   109  // each Rgn may choose a different register for that variable.
   110  // Registers are allocated to regions greedily in order of descending
   111  // cost.
   112  struct	Rgn
   113  {
   114  	Reg*	enter;
   115  	short	cost;
   116  	short	varno;
   117  	short	regno;
   118  };
   119  
   120  EXTERN	int32	exregoffset;		// not set
   121  EXTERN	int32	exfregoffset;		// not set
   122  EXTERN	Reg	zreg;
   123  EXTERN	Reg*	freer;
   124  EXTERN	Reg**	rpo2r;
   125  EXTERN	Rgn	region[NRGN];
   126  EXTERN	Rgn*	rgp;
   127  EXTERN	int	nregion;
   128  EXTERN	int	nvar;
   129  EXTERN	int32	regbits;
   130  EXTERN	int32	exregbits;
   131  EXTERN	Bits	externs;
   132  EXTERN	Bits	params;
   133  EXTERN	Bits	consts;
   134  EXTERN	Bits	addrs;
   135  EXTERN	Bits	ivar;
   136  EXTERN	Bits	ovar;
   137  EXTERN	int	change;
   138  EXTERN	int32	maxnr;
   139  EXTERN	int32*	idom;
   140  
   141  EXTERN	struct
   142  {
   143  	int32	ncvtreg;
   144  	int32	nspill;
   145  	int32	nreload;
   146  	int32	ndelmov;
   147  	int32	nvar;
   148  	int32	naddr;
   149  } ostats;
   150  
   151  /*
   152   * reg.c
   153   */
   154  Reg*	rega(void);
   155  int	rcmp(const void*, const void*);
   156  void	regopt(Prog*);
   157  void	addmove(Reg*, int, int, int);
   158  Bits	mkvar(Reg *r, Adr *a);
   159  void	prop(Reg*, Bits, Bits);
   160  void	synch(Reg*, Bits);
   161  uint32	allreg(uint32, Rgn*);
   162  void	paint1(Reg*, int);
   163  uint32	paint2(Reg*, int, int);
   164  void	paint3(Reg*, int, uint32, int);
   165  void	addreg(Adr*, int);
   166  void	dumpit(char *str, Flow *r0, int);
   167  
   168  /*
   169   * peep.c
   170   */
   171  void	peep(Prog*);
   172  void	excise(Flow*);
   173  int	copyu(Prog*, Adr*, Adr*);
   174  
   175  uint32	RtoB(int);
   176  uint32	FtoB(int);
   177  int	BtoR(uint32);
   178  int	BtoF(uint32);
   179  
   180  /*
   181   * prog.c
   182   */
   183  typedef struct ProgInfo ProgInfo;
   184  struct ProgInfo
   185  {
   186  	uint32 flags; // the bits below
   187  };
   188  
   189  enum
   190  {
   191  	// Pseudo-op, like TEXT, GLOBL, TYPE, PCDATA, FUNCDATA.
   192  	Pseudo = 1<<1,
   193  	
   194  	// There's nothing to say about the instruction,
   195  	// but it's still okay to see.
   196  	OK = 1<<2,
   197  
   198  	// Size of right-side write, or right-side read if no write.
   199  	SizeB = 1<<3,
   200  	SizeW = 1<<4,
   201  	SizeL = 1<<5,
   202  	SizeQ = 1<<6,
   203  	SizeF = 1<<7, // float aka float32
   204  	SizeD = 1<<8, // double aka float64
   205  
   206  	// Left side (Prog.from): address taken, read, write.
   207  	LeftAddr = 1<<9,
   208  	LeftRead = 1<<10,
   209  	LeftWrite = 1<<11,
   210  	
   211  	// Register in middle (Prog.reg); only ever read.
   212  	RegRead = 1<<12,
   213  	CanRegRead = 1<<13,
   214  	
   215  	// Right side (Prog.to): address taken, read, write.
   216  	RightAddr = 1<<14,
   217  	RightRead = 1<<15,
   218  	RightWrite = 1<<16,
   219  
   220  	// Instruction kinds
   221  	Move = 1<<17, // straight move
   222  	Conv = 1<<18, // size conversion
   223  	Cjmp = 1<<19, // conditional jump
   224  	Break = 1<<20, // breaks control flow (no fallthrough)
   225  	Call = 1<<21, // function call
   226  	Jump = 1<<22, // jump
   227  	Skip = 1<<23, // data instruction
   228  };
   229  
   230  void proginfo(ProgInfo*, Prog*);
   231  
   232  // To allow use of AJMP and ACALL in ../gc/popt.c.
   233  enum
   234  {
   235  	AJMP = AB,
   236  	ACALL = ABL,
   237  };