WebSVN – tendra.SVN – Diff – /trunk/src/installers/common/construct/tags.h

+/*
+ * Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice,
+ *    this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright notice,
+ *    this list of conditions and the following disclaimer in the documentation
+ *    and/or other materials provided with the distribution.
+ * 3. Neither the name of The TenDRA Project nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific, prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
+ * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
+ * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
+ * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+ * EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+ * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+ * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+ * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * $Id$
+ */
 /*
     		 Crown Copyright (c) 1997
     This TenDRA(r) Computer Program is subject to Copyright
     owned by the United Kingdom Secretary of State for Defence
     acting through the Defence Evaluation and Research Agency
     (DERA).  It is made available to Recipients with a
     royalty-free licence for its use, reproduction, transfer
     to other parties and amendment for any purpose not excluding
     product development provided that any such use et cetera
     shall be deemed to be acceptance of the following conditions:-
         (1) Its Recipients shall ensure that this Notice is
         reproduced upon any copies or amended versions of it;
         (2) Any amended version of it shall be clearly marked to
         show both the nature of and the organisation responsible
         for the relevant amendment or amendments;
         (3) Its onward transfer from a recipient to another
         party shall be deemed to be that party's acceptance of
         these conditions;
         (4) DERA gives no warranty or assurance as to its
         quality or suitability for any purpose and DERA accepts
         no liability whatsoever in relation to any use to which
         it may be put.
 */
 /**********************************************************************
 $Author: release $
 $Date: 1998/01/17 15:55:47 $
 $Revision: 1.1.1.1 $
 $Log: tags.h,v $
  * Revision 1.1  1995/04/06  10:44:05  currie
  * Initial revision
+ *
 ***********************************************************************/
 #ifndef c_diff
 #define ident_tag 1
 #define seq_tag 3
 #define cond_tag 4
 #define power_tag 91
 #define imag_tag 92
 #define make_complex_tag 93
 #define int_to_bitf_tag 94
 #define conj_tag 95
 #define hold_tag 101
 #define hold2_tag 102 /* 102 also used as hold */
 #define initial_value_tag 103 /* removed in common part */
 #define cont_tag 113
 #define field_tag 114
 #define val_tag 115
 #define reff_tag 116
 #define set_stack_limit_tag 206
 #define formal_callee_tag 207
 #define trap_tag 208
 #define asm_tag 209
-#define is_o(t) ((t)>=cont_tag && (t)<=make_stack_limit_tag)
+#define is_o(t)	((t) >= cont_tag && (t) <= make_stack_limit_tag)
-#define is_a(t) ((t)>=plus_tag && (t)<=make_stack_limit_tag)
+#define is_a(t)	((t) >= plus_tag && (t) <= make_stack_limit_tag)
-#endif
+#endif /* c_diff */
 /***********************************************************************
 NOTE that an exp can occur in just one place in the tree, because of
 the backward pointers. Except for name_tag the general structure is
 that an exp has a son which is nilexp or its first argument exp. The
 next argument is the bro of the first, the next the bro of that etc.
 The last argument has the last field set and its bro is the head exp
 of the construction. In a name_tag the son contains the ident_tag which
 declares the identity or variable being used. case, env_offset and string
 are also special cases.
 The pt field is used in goto and test-like constructions to hold the
 labst being jumped to. It is used in ident and name constructions
 to hold a list of uses of a declaration.
 A name_tag or an exp with at pt to a labst MUST NOT be removed from
 the tree without the usage count being decreased. In the case of name_tag
 the exp must be removed from the pt-list which starts in the pt
 of the defining ident_tag. kill_exp does these operations. It
 also applies kill_exp recursively to all arguments.
 For constructions not involving tags or labels, install_fns.c contains
 examples of ways of constructing exps which may be used during
 TDF transformations. However, at the time when the functions in
 install_fns.c are being used, tags and labels are represented by
 indexes into arrays. During TDF transformations this is no longer so.
 have these represented in the props field. as in expmacs.h.
 An exp should normally have hold_check applied to it after being created.
 abs_tag: Represents integer abs construction.
 	son(e) is arg1.
 	shape is sh(arg1).
 	pt(e) is labst if error_jump, nilexp otherwise.
 absbool_tag: Represents comparison and conversion to boolean.
 	     Only produced (by check.c) is has_setcc is 1.
 	son(e) is arg1.
 	bro(arg1) is arg2.
 	shape is a variety shape.
 	ntest is represented in props, qv.
 	pt(e) is nilexp.
 	no(e) is 0.
 	Delivers 1 in shape if arg1 ntest arg2, 0 otherwise.
 addptr_tag: Adds pointer and offset to produce pointer.
 	son(e) is arg1 (pointer).
 	bro(arg1) is arg2 (offset).
 	shape is pointer(al2(sh(arg2))).
 	pt(e) is nilexp.
 	no(e) is 0.
 alloca_tag: Represents local_alloc construction.
 	son(e) is arg1.
 	shape is pointer(x).
 	no(e) is 0.
 	props(e) is 0.
 	pt(e) is nilexp.
 and_tag: represents and
 	son(e) is a brother list of argument, all of the same shape.
 	shape is shape of son(e). This may be changed in some installers
 		by chvar_tag transformations in check - only if
 		has_byte_ops is 1.
 	no(e) is 0.
 	pt(e) is nilexp.
 apply_tag: Represents apply_proc construction.
 	son(e) is arg1
 	bro(son(e)) is arg2 in the form of a brother list of zero or
 		more exps.
 	shape is result_shape.
 concatnof_tag: represents concat nof
 	son(e) is arg1.
 	bro(arg1) is arg2
 		arg1 and arg2 will be nof(m, s) and nof(n, s)
-	shape is nof(m+n, s)
+	shape is nof(m + n, s)
 	no(e) is 0.
 	pt(e) is nilexp.
 cond_tag: Represents conditional construction.
 	son(e) is first.
 	pt(e) is labst if error_jump, nilexp otherwise.
 	Remember to increment labst count if used.
 fneg_tag: represents floating negation.
 	son(e) is arg1.
 	shape is sh(arg1).
 	no(e) is 0.
 	pt(e) is labst if error_jump, nilexp otherwise.
 	Remember to increment labst count if used.
 fplus_tag: represents floating addition.
 	son(e) is a brother list of argument, all of the same shape.
 		At least two arguments. After check any constants will
 		have been combined into one, which will be the last exp
 	For identify: son(e) is definition, bro(son(e)) is body.
 	For variable: son(e) is init, bro(son(e)) is body.
 	The shape of the result is the shape of body.
         The no(e) is a count of the number of uses.
         The pt(e) is the start of a chain of uses through name_tag's.
 	Properties in the props field are defined in expmacs.h
 	Create an ident_tag using me_startid, add name_tag uses of it
 	using me_obtain, complete the definition using me_complete_id.
 labst_tag: Represents exps which are destination of jumps. Produced from
 	alt of conditional, body of repeat and each place of labelled.
 	son(e) is a holder.
 	bro(son(e)) is the destination exp.
 	shape is shape of bro(son(e)).
 	pt(e) is nilexp.
 	Properties in the props field are defined in expmacs.h
 	The holder (i.e. the son of the labst) can have any name_tag;
 	its no field is the number of uses of the labst and
 	its bro is the destination exp. No other field is defined.
 last_local_tag: represents last_local construction.
 	son(e) is nilexp.
 	shape is top.
 	pt(e) is pointer(x).
 	no(e) is 0.
 local_free_all_tag: represents local_free_all construction.
 	son(e) is nilexp.
 	shape is top.
 	pt(e) is nilexp.
 	no(e) is 0.
 local_free_tag: Represents local_free construction.
 make_lv_tag: represents make label value.
 	son(e) is nilexp.
 	shape is lv.
 	pt(e) is labst.
 	no(e) is 0.
 	Remember to increment labst count.
 max_tag:
 min_tag: represent maximum and minimum integer ops.
 	son(e) is arg1.
 	bro(arg1) is arg2.
 	no(e) is 0.
 	pt(e) is nilexp.
 minptr_tag: Represents subtract_pointers construction.
 	son(e) is arg1
 	bro(son(e)) is arg2
 	shape is offset(al1(arg2),al1(arg1))
 	pt(e) is nilexp.
 	no(e) is 0.
 minus_tag: represents subtraction.
 	This is replaced by addition of negation by check.c.
 mod_tag: Represents rem1 construction.
 	son(e) is arg1.
 	bro(son(e)) is arg2
 	shape is sh(arg1)
 	pt(e) is labst if error_jump, nilexp otherwise.
 	no(e) is 0.
 movecont_tag: Represents move_some construction.
 	son(e) is arg1.
 	bro(son(e)) is arg2.
 	bro(bro(son(e))) is arg3.
 	shape is top.
 	pt(e) is nilexp.
 	no(e) is 0.
 	pt(e) is nilexp.
 offset_add_tag: Represents offset_add construction.
 	son(e) is arg1
 	bro(son(e)) is arg2.
 	shape is offset(max(al1(arg1),al1(arg2)),al2(arg2))
 	pt(e) is nilexp.
 	no(e) is 0.
 offset_div_tag: Represents offset_div construction.
 	son(e) is arg1
 	bro(son(e)) is arg2.
 	shape is integer(v).
 	pt(e) is nilexp.
 	no(e) is 0.
 offset_div_by_int_tag: Represents offset_div_by_int construction.
 	son(e) is arg1
 	bro(son(e)) is arg2.
 	shape is offset(x,x)
 	pt(e) is nilexp.
 	no(e) is 0.
 offset_max_tag: Represents offset_max construction.
 	son(e) is arg1
 	bro(son(e)) is arg2.
 	shape is offset(max(al1(arg1),al1(arg2)),max(al2(arg1),al2(arg2)))
 	pt(e) is nilexp.
 	no(e) is 0.
 offset_mult_tag: Represents offset_mult construction.
 	son(e) is arg1
 	bro(son(e)) is arg2.
 	shape is offset(x,x)
 	pt(e) is nilexp.
 	no(e) is 0.
 offset_negate_tag: Represents offset_negate construction.
 	son(e) is arg1
 	shape is offset(x,x)
 	pt(e) is nilexp.
 	no(e) is 0.
 offset_pad_tag: represents offset pad.
 	son(e) is arg1 (offset).
 	shape is offset of required padded shape.
 	no(e) is 0.
 	pt(e) is nilexp.
 offset_subtract_tag: Represents offset_subtract construction.
 	son(e) is arg1
 	bro(son(e)) is arg2.
 	shape is offset(al2(arg1),al2(arg2))
 	pt(e) is nilexp.
 	no(e) is 0.
 or_tag: represents or
 	son(e) is a brother list of argument, all of the same shape.
 		At least two arguments. After check any constants will
 		have been combined into one, which will be the last exp
 		if there is a constant contribution.
 	shape is shape of son(e).
 	no(e) is 0.
 	pt(e) is nilexp.
 plus_tag: represents the combination of plus and minus constructions.
 	son(e) is a brother list of argument, all of the same shape.
 		At least two arguments. After check any constants will
 		have been combined into one, which will be the last exp
 		if there is a constant contribution.
 	shape is shape of son(e).
 	no(e) is 0.
 	pt(e) is destination labst if ov_err is error_jump, otherwise
 		nilexp.
 power_tag: represents integer power.
 	son(e) is arg1.
 	bro(arg1) is arg2.
 	shape is sh(arg1).
 	no(e) is 0.
 	pt(e) is labst if error_jump, nilexp otherwise.
 	Remember to increment labst count if used.
 proc_tag: represents make_proc
 	son(e) is body of procedure, starting with declarations
 		(ident_tag) of parameters.
 	shape is proc.
 	no(e) is 0.
 	pt(e) is shape of return.
 	Properties in the props field are defined in expmacs.h
 prof_tag: represents profile exp.
 	son(e) is nilexp.
 	shape is top.
 	no(e) is expected number of times through this point.
 	pt(e) is nilexp.
 realpart_tag: represents operation to take the real part of a complex.
 	son(e) is arg1 (complex).
 	shape is floating derived from same controls as complex.
 	no(e) is 0.
 	pt(e) is nilexp.
 reff_tag: represents increment of a pointer by a constant offset.
 	son(e) is arg1 (pointer).
 	shape is shape of resulting pointer.
 	shape is shape of body.
 	pt(e) is loop record of this repeat.
 	no(e) is 0.
 	Properties in the props field are defined in expmacs.h
 res_tag: Represents the return construction.
 	son(e) is arg1
 	shape is bottom.
 	pt(e) is nilexp.
 	no(e) is 0.
 	Properties in the props field are defined in expmacs.h
 general_proc_tag:
 	son = (ident for caller-formal as in proc_tag)
 			....
 	      with body = (ident for callee_formal with
 	      			def = formal_callee_tag)
 	      			....
 	      		   with body of proc
 	props = procprops
 	shape is proc.
 	pt(e) is shape of return.
 apply_general_tag:
         son = proc
         bro(son) = exp(tag=0; props = procprops; no = number of otagexps;
         		son = list of otagexps ie caller actuals)
         	   if tag is present in otagexp, then
-        	   		name(otagexp)=caller_tag
+        	   		name(otagexp) = caller_tag
         	   		son(otagexp) = actual
         	   	and postlude will have ident with
         	   		def = caller_name_tag
 				and no(def) = no of corresponding caller_tag
 					in the otagexp list, starting from 0
         	   else otagexp is the actual exp
         bro(bro(son)) = callees =(1) make_callee_list_tag with son list of exps
         	        		and number = number in list
         	        	 (2) make_dynamic_callee_tag with son ptr
         	        	 	and bro(son) size
         	        	 (3) same_callees_tag
 			and props = procprops
         bro(bro(bro(son))) = postlude with tags identified as above
 tail_call_tag:
         son = proc
         bro(son)= (tag=0; props = procprops; son = callees as above)
 untidy_return:
 	son = result exp
 trap_tag:
 	no() = error_code

Subversion Repositories tendra.SVN

(root)/trunk/src/installers/common/construct/tags.h – Rev 2 → 7