1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
|
-- This file is part of SmartEiffel The GNU Eiffel Compiler Tools and Libraries
--
-- SmartEiffel is free software; you can redistribute it and/or modify it
-- under the terms of the GNU General Public License, as published by the
-- Free Software Foundation; either version 2, or (at your option) any later
-- version.
-- SmartEiffel is distributed in the hope that it will be useful but WITHOUT
-- ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
-- FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
-- more details. You should have received a copy of the GNU General Public
-- License along with SmartEiffel; see the file COPYING. If not, write to
-- the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
-- MA 02111-1307, USA.
--
-- Copyright(C) 1994-2002: INRIA - LORIA (INRIA Lorraine) - ESIAL U.H.P.
-- - University of Nancy 1 - FRANCE
-- Copyright(C) 2003: INRIA - LORIA (INRIA Lorraine) - I.U.T. Charlemagne
-- - University of Nancy 2 - FRANCE
--
-- Dominique COLNET, Suzanne COLLIN, Olivier ZENDRA,
-- Philippe RIBET, Cyril ADRIAN
--
-- http://SmartEiffel.loria.fr - SmartEiffel@loria.fr
--
class AGENT_INSTRUCTION
--
-- Some agent is called using the `foo.call([bar]);' notation.
--
inherit CALL_PROC_CALL; INSTRUCTION
creation {PROC_CALL_1} make
feature
arg_count: INTEGER is 1
side_effect_free: BOOLEAN is False
end_mark_comment: BOOLEAN is False
once_pre_computable: BOOLEAN is False
pretty_print is
do
creator.pretty_print
end
to_runnable(ct: E_TYPE): INSTRUCTION is
do
Result := creator.to_runnable(ct)
end
compile_to_c is
do
agent_args.c_agent_definition_call(target)
cpp.put_character(';')
cpp.put_character('%N')
end
simplify_2(container: COMPOUND; index: INTEGER) is
do
end
stupid_switch(run_time_set: RUN_TIME_SET): BOOLEAN is
do
check False end
end
compile_to_jvm is
local
idx: INTEGER; space: INTEGER; fcn: STRING; i_argument: INTEGER
ft: FAKE_TUPLE; tt: TYPE_TUPLE; tp: TYPE_OF_AGENT; point1: INTEGER
point2: INTEGER; point3: INTEGER; point4: INTEGER
index_local: INTEGER; count_local: INTEGER; target_local: INTEGER
do
index_local := code_attribute.extra_local_size1
count_local := code_attribute.extra_local_size1
target_local := code_attribute.extra_local_size1
target.compile_to_jvm
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_class2(fcn)
code_attribute.opcode_checkcast(idx)
code_attribute.opcode_astore( target_local )
-- put open arguments into open_arguments
code_attribute.opcode_aload( target_local )
idx := constant_pool.idx_fieldref3( fcn, as_open_arguments, fz_c2 )
space := target.result_type.jvm_stack_space
ft ?= arguments.expression(1)
tp ?= target.result_type
tt := tp.open
if tt.count > 0 then
code_attribute.opcode_dup
code_attribute.opcode_getfield(idx,space + 1); -- get open_arguments
end
from
i_argument := 1
until
i_argument > ft.count
loop
code_attribute.opcode_dup
code_attribute.opcode_push_integer( i_argument - 1 )
if ft.expression(i_argument).result_type.is_basic_eiffel_expanded then
push_jvm_expanded_argument_to_object_wrapper( ft.expression(i_argument), tt.type(i_argument) )
else
space := ft.expression(i_argument).standard_compile_to_jvm_into( tt.type(i_argument) )
end
code_attribute.opcode_aastore
i_argument := i_argument + 1
end
if tt.count > 0 then
code_attribute.opcode_pop
end
-- fill in open arguments in arguments
-- set up index local
code_attribute.opcode_push_integer( 0 )
code_attribute.opcode_istore( index_local )
-- set up count local
code_attribute.opcode_dup
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_class2(fcn)
idx := constant_pool.idx_fieldref3( fcn, as_open_argument_indices, fz_d3 )
space := target.result_type.jvm_stack_space
code_attribute.opcode_getfield(idx,space + 1); -- get open_arguments_indices
code_attribute.opcode_arraylength; -- get length of open_arguments_indices
code_attribute.opcode_istore( count_local )
code_attribute.opcode_iload( count_local )
code_attribute.opcode_iconst_0
point1 := code_attribute.opcode_if_icmpeq -- jump if open_argument_count empty
-- if open_argument_count > 0, see if open_argument_indices[0] = -1
code_attribute.opcode_dup
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_class2(fcn)
idx := constant_pool.idx_fieldref3( fcn, as_open_argument_indices, fz_d3 )
space := target.result_type.jvm_stack_space
code_attribute.opcode_getfield(idx,space + 1); -- get open_arguments_indices
code_attribute.opcode_iconst_0
code_attribute.opcode_iaload
code_attribute.opcode_iconst_m1
point2 := code_attribute.opcode_if_icmpne -- jump if open_argument_indices[0] /= -1
-- get open_arguments[0] and put it in target
code_attribute.opcode_dup
code_attribute.opcode_dup -- to get open_arguments
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_class2(fcn)
idx := constant_pool.idx_fieldref3( fcn, as_open_arguments, fz_c2 )
space := target.result_type.jvm_stack_space
code_attribute.opcode_getfield(idx,space + 1); -- get open_arguments
code_attribute.opcode_iconst_0 -- index 0 of open_arguments
code_attribute.opcode_aaload -- get open_arguments[0]
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_class2(fcn)
idx := constant_pool.idx_fieldref3( fcn, as_target, fz_21 )
space := target.result_type.jvm_stack_space
code_attribute.opcode_putfield(idx,space + 1); -- set target
-- set open_argument_index to 1
code_attribute.opcode_push_integer( 1 )
code_attribute.opcode_istore( index_local )
code_attribute.resolve_u2_branch( point2 ) -- jumped to here if open_argument_indices[0] /= -1
-- test to see if open_argument_index >= open_argument_count
point4 := code_attribute.program_counter; -- jumped to here from end of "loop" to copy open arguments
--
code_attribute.opcode_iload( index_local )
code_attribute.opcode_iload( count_local )
point3 := code_attribute.opcode_if_icmpge -- jump if open_argument_index >= open_argument_count
-- put open_argument[open_argument_index] into
-- arguments[ open_argument_indices[open_argument_index] ]
code_attribute.opcode_dup
code_attribute.opcode_dup
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_class2(fcn)
idx := constant_pool.idx_fieldref3( fcn, as_arguments, fz_c2 )
space := target.result_type.jvm_stack_space
code_attribute.opcode_getfield(idx,space + 1); -- get arguments
--target.compile_to_jvm
code_attribute.opcode_swap
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_class2(fcn)
idx := constant_pool.idx_fieldref3( fcn, as_open_argument_indices, fz_d3 )
space := target.result_type.jvm_stack_space
code_attribute.opcode_getfield(idx,space + 1); -- get open_arguments_indices
code_attribute.opcode_iload( index_local )
code_attribute.opcode_iaload -- get open_argument_indices[open_argument_index]
code_attribute.opcode_aload( target_local )
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_class2(fcn)
idx := constant_pool.idx_fieldref3( fcn, as_open_arguments, fz_c2 )
space := target.result_type.jvm_stack_space
code_attribute.opcode_getfield(idx,space + 1); -- get open_arguments
code_attribute.opcode_iload( index_local )
code_attribute.opcode_aaload -- get open_argument[open_argument_index]
code_attribute.opcode_aastore -- store argument[open_argument_indices[open_argument_index]] = open_argument[open_argument_index]
-- increment open_argument_index
code_attribute.opcode_iload( index_local )
code_attribute.opcode_iconst_1
code_attribute.opcode_iadd
code_attribute.opcode_istore( index_local )
code_attribute.opcode_goto_backward(point4); -- jump back to top of loop to iterate through open_arguments
code_attribute.resolve_u2_branch( point3 ) -- jumped to here if open_argument_index >= open_argument_count
code_attribute.resolve_u2_branch( point1 ) -- jumped to here if open_argument_count empty
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_class2(fcn)
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_fieldref3( fcn, as_method, fz_21 )
space := target.result_type.jvm_stack_space
code_attribute.opcode_getfield(idx,space + 1); -- get method
idx := constant_pool.idx_class2(fz_java_lang_reflect_method)
code_attribute.opcode_checkcast(idx)
idx := constant_pool.idx_class2(fz_java_lang_reflect_method)
code_attribute.opcode_aload( target_local )
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_class2(fcn)
idx := constant_pool.idx_fieldref3( fcn, as_target, fz_21 )
space := target.result_type.jvm_stack_space
code_attribute.opcode_getfield(idx,space + 1); -- get target
code_attribute.opcode_aload( target_local )
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_class2(fcn)
idx := constant_pool.idx_fieldref3( fcn, as_arguments, fz_c2 )
space := target.result_type.jvm_stack_space
code_attribute.opcode_getfield(idx,space + 1); -- get arguments
idx := constant_pool.idx_methodref3( fz_java_lang_reflect_method, fz_c8, fz_c9 ); -- invoke
code_attribute.opcode_invokevirtual( idx, -1 )
code_attribute.opcode_aload( target_local )
code_attribute.opcode_swap
fcn := target.result_type.run_class.fully_qualified_name
idx := constant_pool.idx_class2(fcn)
idx := constant_pool.idx_fieldref3( fcn, as_last_result, fz_21 )
space := target.result_type.jvm_stack_space
code_attribute.opcode_putfield(idx,space + 1); -- set last_result
end
push_jvm_expanded_argument_to_object_wrapper( arg_expression: EXPRESSION; f_type: E_TYPE ) is
local
idx: INTEGER
space: INTEGER
do
if f_type.is_boolean then
idx := constant_pool.idx_class2(fz_java_lang_boolean)
code_attribute.opcode_new(idx)
code_attribute.opcode_dup
space := arg_expression.standard_compile_to_jvm_into( f_type )
idx := constant_pool.idx_methodref3( fz_java_lang_boolean, fz_35, fz_cb ); -- <init>
code_attribute.opcode_invokespecial( idx, -1 )
elseif f_type.is_character then
idx := constant_pool.idx_class2(fz_java_lang_byte)
code_attribute.opcode_new(idx)
code_attribute.opcode_dup
space := arg_expression.standard_compile_to_jvm_into( f_type )
idx := constant_pool.idx_methodref3( fz_java_lang_byte, fz_35, fz_cc1 ); -- <init>
code_attribute.opcode_invokespecial( idx, -1 )
elseif f_type.is_integer then
idx := constant_pool.idx_class2(fz_java_lang_integer)
code_attribute.opcode_new(idx)
code_attribute.opcode_dup
space := arg_expression.standard_compile_to_jvm_into( f_type )
idx := constant_pool.idx_methodref3( fz_java_lang_integer, fz_35, fz_27 ); -- <init>
code_attribute.opcode_invokespecial( idx, -1 )
elseif f_type.is_real then
idx := constant_pool.idx_class2(fz_java_lang_float)
code_attribute.opcode_new(idx)
code_attribute.opcode_dup
space := arg_expression.standard_compile_to_jvm_into( f_type )
idx := constant_pool.idx_methodref3( fz_java_lang_float, fz_35, fz_ce ); -- <init>
code_attribute.opcode_invokespecial( idx, -1 )
elseif f_type.is_double then
idx := constant_pool.idx_class2(fz_java_lang_double)
code_attribute.opcode_new(idx)
code_attribute.opcode_dup
space := arg_expression.standard_compile_to_jvm_into( f_type )
idx := constant_pool.idx_methodref3( fz_java_lang_double, fz_35, fz_cf ); -- <init>
code_attribute.opcode_invokespecial( idx, -1 )
elseif f_type.is_pointer then
arg_expression.compile_to_jvm
end
end
feature {COMPOUND,INSTRUCTION_WITH_COMMENT}
verify_scoop(allowed: FORMAL_ARG_LIST) is
local
dummy: BOOLEAN
do
if not target.is_current and then target.result_type.is_separate then
if allowed /= Void then
dummy := allowed.verify_scoop(creator.target)
else
target.scoop_error
end
end
end
feature {AGENT_INSTRUCTION_VISITOR}
accept(visitor: AGENT_INSTRUCTION_VISITOR) is
do
visitor.visit_agent_instruction(Current)
end
feature {NONE}
creator: PROC_CALL
-- The `creator' of `Current'.
arguments: EFFECTIVE_ARG_LIST
agent_args: AGENT_ARGS
-- Computed using `feature_name' and `aguments'.
make(c: like creator) is
require
c.target /= Void
c.feature_name.to_string = as_call
c.run_feature.result_type = Void
do
creator := c
target := creator.target
feature_name := creator.feature_name
arguments := creator.arguments
run_feature := creator.run_feature
agent_args := agent_pool.register_agent_call(arguments,run_feature)
ensure
creator = c
target = creator.target
feature_name = creator.feature_name
arguments = creator.arguments
run_feature = creator.run_feature
end
afd_check_hook is
do
end
invariant
target /= Void
feature_name /= Void
run_feature /= Void
end -- AGENT_INSTRUCTION
|
