| 6 |
7u83 |
1 |
/*
|
|
|
2 |
* Copyright (c) 2002-2005 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 |
/*
|
|
|
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 |
/* 80x86/tv_callees.c */
|
|
|
62 |
|
|
|
63 |
/**********************************************************************
|
|
|
64 |
$Author: release $
|
|
|
65 |
$Date: 1998/01/17 15:55:52 $
|
|
|
66 |
$Revision: 1.1.1.1 $
|
|
|
67 |
$Log: tv_callees.c,v $
|
|
|
68 |
* Revision 1.1.1.1 1998/01/17 15:55:52 release
|
|
|
69 |
* First version to be checked into rolling release.
|
|
|
70 |
*
|
|
|
71 |
* Revision 1.5 1995/10/18 11:24:35 pwe
|
|
|
72 |
* diag struct
|
|
|
73 |
*
|
|
|
74 |
* Revision 1.4 1995/10/16 17:45:55 pwe
|
|
|
75 |
* frame alignments
|
|
|
76 |
*
|
|
|
77 |
* Revision 1.3 1995/08/30 16:06:57 pwe
|
|
|
78 |
* prepare exception trapping
|
|
|
79 |
*
|
|
|
80 |
* Revision 1.2 1995/08/14 13:54:08 pwe
|
|
|
81 |
* several corrections, tail calls and error jumps
|
|
|
82 |
*
|
|
|
83 |
* Revision 1.1 1995/08/04 08:29:50 pwe
|
|
|
84 |
* 4.0 general procs implemented
|
|
|
85 |
*
|
|
|
86 |
**********************************************************************/
|
|
|
87 |
|
|
|
88 |
#include "config.h"
|
|
|
89 |
#include "common_types.h"
|
|
|
90 |
#include "installglob.h"
|
|
|
91 |
#include "externs.h"
|
|
|
92 |
#include "flags.h"
|
|
|
93 |
#include "install_fns.h"
|
|
|
94 |
#include "tags.h"
|
|
|
95 |
#include "expmacs.h"
|
|
|
96 |
#include "exp.h"
|
|
|
97 |
#include "tv_callees.h"
|
|
|
98 |
|
|
|
99 |
|
|
|
100 |
void transform_var_callees
|
|
|
101 |
(void)
|
|
|
102 |
/* Transforms caller arguments of general
|
|
|
103 |
procs with variable callees, to appear
|
|
|
104 |
like a structure whose address is
|
|
|
105 |
another callee. This enables consistent
|
|
|
106 |
coding without demanding a separate
|
|
|
107 |
register for caller argument addressing.
|
|
|
108 |
Also, record need for env_size.
|
|
|
109 |
*/
|
|
|
110 |
{
|
|
|
111 |
dec * my_def = top_def;
|
|
|
112 |
while (my_def != (dec *)0) {
|
|
|
113 |
exp tg = my_def -> dec_u.dec_val.dec_exp;
|
|
|
114 |
if (son(tg)!= nilexp && name(son(tg)) == general_proc_tag
|
|
|
115 |
&& proc_has_vcallees(son(tg))) {
|
|
|
116 |
shape pc_sh = f_pointer(f_callers_alignment(0));
|
|
|
117 |
int param_offset = 0;
|
|
|
118 |
exp gp_body = son(son(tg));
|
|
|
119 |
exp newdec = getexp(sh(gp_body), nilexp, 1, nilexp, nilexp, 0, 0, ident_tag);
|
|
|
120 |
exp newlist = nilexp;
|
|
|
121 |
son(newdec) = getexp(pc_sh, nilexp, 0, nilexp, nilexp, 0, 0, formal_callee_tag);
|
|
|
122 |
|
|
|
123 |
while (name(gp_body) == ident_tag && isparam(gp_body)
|
|
|
124 |
&& name(son(gp_body))!= formal_callee_tag) {
|
|
|
125 |
exp arg_id = gp_body;
|
|
|
126 |
exp oldlist = pt(arg_id);
|
|
|
127 |
gp_body = bro(son(gp_body));
|
|
|
128 |
while (oldlist != nilexp) {
|
|
|
129 |
exp this_n = oldlist;
|
|
|
130 |
exp new_n = getexp(pc_sh, this_n, 1, newdec, newlist, 0, 0, name_tag);
|
|
|
131 |
oldlist = pt(oldlist);
|
|
|
132 |
newlist = new_n;
|
|
|
133 |
no(newdec) ++;
|
|
|
134 |
if (isvar(arg_id)) {
|
|
|
135 |
name(this_n) = reff_tag;
|
|
|
136 |
son(this_n) = new_n;
|
|
|
137 |
no(this_n) += param_offset;
|
|
|
138 |
}
|
|
|
139 |
else {
|
|
|
140 |
exp r = getexp(f_pointer(f_alignment(sh(son(arg_id)))),
|
|
|
141 |
this_n, 1, new_n, nilexp, 0, no(this_n) +param_offset, reff_tag);
|
|
|
142 |
bro(new_n) = r;
|
|
|
143 |
name(this_n) = cont_tag;
|
|
|
144 |
son(this_n) = r;
|
|
|
145 |
}
|
|
|
146 |
pt(this_n) = nilexp;
|
|
|
147 |
}
|
|
|
148 |
|
|
|
149 |
name(arg_id) = 0; /* This may still be accessed by env_offset.
|
|
|
150 |
We need to distinguish the special case.
|
|
|
151 |
*/
|
|
|
152 |
no(arg_id) = param_offset;
|
|
|
153 |
bro(arg_id) = nilexp;
|
|
|
154 |
pt(arg_id) = nilexp;
|
|
|
155 |
param_offset = rounder(param_offset + shape_size(sh(son(arg_id))), param_align);
|
|
|
156 |
retcell(son(arg_id));
|
|
|
157 |
son(arg_id) = nilexp;
|
|
|
158 |
}
|
|
|
159 |
{
|
|
|
160 |
setparam (newdec); /* not var */
|
|
|
161 |
setcaonly(newdec);
|
|
|
162 |
bro(son(newdec)) = gp_body;
|
|
|
163 |
setfather(newdec, gp_body);
|
|
|
164 |
gp_body = newdec;
|
|
|
165 |
}
|
|
|
166 |
son(son(tg)) = gp_body;
|
|
|
167 |
setfather(son(tg),gp_body);
|
|
|
168 |
}
|
|
|
169 |
|
|
|
170 |
if (son(tg)!= nilexp &&
|
|
|
171 |
(name(son(tg)) == proc_tag || name(son(tg)) == general_proc_tag)) {
|
|
|
172 |
exp nlist = pt(tg);
|
|
|
173 |
while (nlist != nilexp) {
|
|
|
174 |
if (name(nlist) == name_tag && last(nlist) && bro(nlist)!= nilexp &&
|
|
|
175 |
name(bro(nlist)) == env_size_tag)
|
|
|
176 |
set_proc_needs_envsize(son(tg));
|
|
|
177 |
nlist = pt(nlist);
|
|
|
178 |
}
|
|
|
179 |
}
|
|
|
180 |
|
|
|
181 |
my_def = my_def -> def_next;
|
|
|
182 |
}
|
|
|
183 |
return;
|
|
|
184 |
}
|