Subversion Repositories tendra.SVN

Rev

Rev 5 | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
2 7u83 1
/*
6 7u83 2
 * Copyright (c) 2002-2006 The TenDRA Project <http://www.tendra.org/>.
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions are met:
7
 *
8
 * 1. Redistributions of source code must retain the above copyright notice,
9
 *    this list of conditions and the following disclaimer.
10
 * 2. Redistributions in binary form must reproduce the above copyright notice,
11
 *    this list of conditions and the following disclaimer in the documentation
12
 *    and/or other materials provided with the distribution.
13
 * 3. Neither the name of The TenDRA Project nor the names of its contributors
14
 *    may be used to endorse or promote products derived from this software
15
 *    without specific, prior written permission.
16
 *
17
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
18
 * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
19
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
20
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
21
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
22
 * EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
23
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
24
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
25
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
26
 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
27
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28
 *
29
 * $Id$
30
 */
31
/*
2 7u83 32
    		 Crown Copyright (c) 1997
33
 
34
    This TenDRA(r) Computer Program is subject to Copyright
35
    owned by the United Kingdom Secretary of State for Defence
36
    acting through the Defence Evaluation and Research Agency
37
    (DERA).  It is made available to Recipients with a
38
    royalty-free licence for its use, reproduction, transfer
39
    to other parties and amendment for any purpose not excluding
40
    product development provided that any such use et cetera
41
    shall be deemed to be acceptance of the following conditions:-
42
 
43
        (1) Its Recipients shall ensure that this Notice is
44
        reproduced upon any copies or amended versions of it;
45
 
46
        (2) Any amended version of it shall be clearly marked to
47
        show both the nature of and the organisation responsible
48
        for the relevant amendment or amendments;
49
 
50
        (3) Its onward transfer from a recipient to another
51
        party shall be deemed to be that party's acceptance of
52
        these conditions;
53
 
54
        (4) DERA gives no warranty or assurance as to its
55
        quality or suitability for any purpose and DERA accepts
56
        no liability whatsoever in relation to any use to which
57
        it may be put.
58
*/
59
 
60
 
61
/**********************************************************************
62
$Author: release $
63
$Date: 1998/01/17 15:55:47 $
64
$Revision: 1.1.1.1 $
65
$Log: global_opt.c,v $
66
 * Revision 1.1.1.1  1998/01/17  15:55:47  release
67
 * First version to be checked into rolling release.
68
 *
69
 * Revision 1.4  1995/09/27  12:39:23  currie
70
 * Peters PIC code
71
 *
72
 * Revision 1.3  1995/09/19  11:51:45  currie
73
 * Changed name of init fn +gcc static bug
74
 *
75
 * Revision 1.2  1995/06/09  08:37:40  currie
76
 * loose name tag with diags
77
 *
78
 * Revision 1.1  1995/04/06  10:44:05  currie
79
 * Initial revision
80
 *
81
***********************************************************************/
82
 
83
#include "config.h"
84
#include "common_types.h"
85
#include "installglob.h"
86
#include "exp.h"
87
#include "expmacs.h"
88
#include "tags.h"
89
#include "check.h"
90
#include "flags.h"
91
#include "check_id.h"
92
#include "const.h"
93
#include "foralls.h"
94
#include "shapemacs.h"
95
#include "glopt.h"
96
#include "inline.h"
97
#include "global_opt.h"
98
#include "inl_norm.h"
99
#include "unroll.h"
100
 
101
 
102
/* PROCEDURES */
103
 
104
 
105
/***********************************************************************
106
  checkext examines the external definition e to see if it can be
107
  improved. It returns 1 if it makes a change, 0 otherwise.
108
 ***********************************************************************/
109
 
6 7u83 110
void
111
rec_inl(exp p)
2 7u83 112
{
6 7u83 113
	if (pt(p) != nilexp) {
114
		rec_inl(pt(p));
115
	}
2 7u83 116
 
6 7u83 117
	inline_exp(father(p));
118
	return;
2 7u83 119
}
120
 
6 7u83 121
 
122
void
123
checkext(exp e)
2 7u83 124
{
6 7u83 125
	exp def = son(e);
2 7u83 126
 
6 7u83 127
	/* if it is not used or there is no definition here, do nothing */
128
	if (no(e) == 0 || def == nilexp) {
129
		return;
130
	}
2 7u83 131
 
6 7u83 132
	if ((!PIC_code || brog(e)->dec_u.dec_val.dec_var == 0) && !isvar(e) &&
133
	    (name(def) == val_tag || name(def) == real_tag ||
134
	     name(def) == null_tag)) {
135
		while (pt(e) != nilexp) {
136
			/* substitute constants in */
137
			exp q = pt(e);
138
			if (bro(q) != nilexp) {
139
				/* can be nilexp for diags */
140
				exp d = copy(def);
141
				replace(q, d, nilexp);
142
				kill_exp(q, q);
143
			} else {
144
				pt(e) = pt(q);
145
			}
146
		}
147
		return;
148
	}
2 7u83 149
 
6 7u83 150
	return;
2 7u83 151
}
152
 
153
 
6 7u83 154
void
155
opt_all_exps(void)
2 7u83 156
{
6 7u83 157
	dec *my_def;
2 7u83 158
 
159
#if 0
6 7u83 160
	/* take constant expression out of loops */
161
	if (do_loopconsts)
162
		repeat_consts();
2 7u83 163
#endif
164
 
6 7u83 165
	if (do_unroll) {
166
		unroller();
167
	}
2 7u83 168
 
6 7u83 169
	my_def = top_def;
170
	while (my_def != (dec *)0) {
171
		exp crt_exp = my_def->dec_u.dec_val.dec_exp;
172
		checkext(crt_exp);
173
		glopt(my_def);
174
		my_def = my_def -> def_next;
175
	}
2 7u83 176
 
6 7u83 177
	normalised_inlining();
2 7u83 178
 
179
#if 1
6 7u83 180
	/* take constant expression out of loops */
181
	if (do_loopconsts) {
182
		repeat_consts();
183
	}
2 7u83 184
#endif
185
 
6 7u83 186
	/* replace indexing on loop variable by incremented pointer access */
187
	if (do_foralls) {
188
		forall_opt();
189
	}
2 7u83 190
 
6 7u83 191
	return;
2 7u83 192
}