lower_calls.c 19.4 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
/*
2
 * Copyright (C) 1995-2011 University of Karlsruhe.  All right reserved.
Christian Würdig's avatar
Christian Würdig committed
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 *
 * This file is part of libFirm.
 *
 * This file may be distributed and/or modified under the terms of the
 * GNU General Public License version 2 as published by the Free Software
 * Foundation and appearing in the file LICENSE.GPL included in the
 * packaging of this file.
 *
 * Licensees holding valid libFirm Professional Edition licenses may use
 * this file in accordance with the libFirm Commercial License.
 * Agreement provided with the Software.
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE.
 */

Michael Beck's avatar
Michael Beck committed
20
21
22
23
24
/**
 * @file
 * @brief   Lowering of Calls with compound parameters and return types.
 * @author  Michael Beck
 * @version $Id$
25
26
27
 */
#include "config.h"

28
29
30
#include <stdbool.h>

#include "lower_calls.h"
31
#include "lowering.h"
32
33
34
35
36
37
38
#include "irprog_t.h"
#include "irnode_t.h"
#include "type_t.h"
#include "irmode_t.h"
#include "ircons.h"
#include "irgmod.h"
#include "irgwalk.h"
39
#include "irmemory.h"
40
#include "irtools.h"
41
#include "iroptimize.h"
42
#include "array_t.h"
43
#include "pmap.h"
44
#include "error.h"
45

46
47
static pmap *pointer_types;
static pmap *lowered_mtps;
48
49
50
51
52

/**
 * Default implementation for finding a pointer type for a given element type.
 * Simple create a new one.
 */
53
static ir_type *get_pointer_type(ir_type *dest_type)
54
{
55
56
57
58
	ir_type *res = (ir_type*)pmap_get(pointer_types, dest_type);
	if (res == NULL) {
		res = new_type_pointer(dest_type);
		pmap_insert(pointer_types, dest_type, res);
59
60
	}
	return res;
61
}
62
63
64
65
66

/**
 * Creates a new lowered type for a method type with compound
 * arguments. The new type is associated to the old one and returned.
 */
67
static ir_type *lower_mtp(compound_call_lowering_flags flags, ir_type *mtp)
68
{
69
70
71
72
73
74
75
76
77
78
79
80
81
82
	bool      must_be_lowered = false;
	ir_type  *lowered;
	ir_type **params;
	ir_type **results;
	size_t    n_ress;
	size_t    n_params;
	size_t    nn_ress;
	size_t    nn_params;
	size_t    i;

	if (!is_Method_type(mtp))
		return mtp;

	lowered = (ir_type*)pmap_get(lowered_mtps, mtp);
83
	if (lowered != NULL)
84
85
		return lowered;

86
87
88
89
90
91
92
	/* check if the type has to be lowered at all */
	n_ress = get_method_n_ress(mtp);
	for (i = 0; i < n_ress; ++i) {
		ir_type *res_tp = get_method_res_type(mtp, i);
		if (is_compound_type(res_tp)) {
			must_be_lowered = true;
			break;
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
	}
	if (!must_be_lowered)
		return mtp;

	n_params  = get_method_n_params(mtp);
	results   = ALLOCANZ(ir_type*, n_ress);
	params    = ALLOCANZ(ir_type*, n_params + n_ress);
	nn_ress   = 0;
	nn_params = 0;

	/* add a hidden parameter in front for every compound result */
	for (i = 0; i < n_ress; ++i) {
		ir_type *res_tp = get_method_res_type(mtp, i);

		if (is_compound_type(res_tp)) {
			/* this compound will be allocated on callers stack and its
			   address will be transmitted as a hidden parameter. */
			ir_type *ptr_tp = get_pointer_type(res_tp);
			params[nn_params++] = ptr_tp;
			if (flags & LF_RETURN_HIDDEN)
				results[nn_ress++] = ptr_tp;
		} else {
			/* scalar result */
			results[nn_ress++] = res_tp;
118
119
		}
	}
120
121
122
123
124
125
	/* copy over parameter types */
	for (i = 0; i < n_params; ++i) {
		params[nn_params++] = get_method_param_type(mtp, i);
	}
	assert(nn_ress <= n_ress);
	assert(nn_params <= n_params + n_ress);
126
127

	/* create the new type */
128
	lowered = new_d_type_method(nn_params, nn_ress, get_type_dbg_info(mtp));
129
130
131
132
133
134
135

	/* fill it */
	for (i = 0; i < nn_params; ++i)
		set_method_param_type(lowered, i, params[i]);
	for (i = 0; i < nn_ress; ++i)
		set_method_res_type(lowered, i, results[i]);

136
	set_method_variadicity(lowered, get_method_variadicity(mtp));
137
138

	/* associate the lowered type with the original one for easier access */
139
	set_method_calling_convention(lowered, get_method_calling_convention(mtp) | cc_compound_ret);
140

141
	set_lowered_type(mtp, lowered);
142
	pmap_insert(lowered_mtps, mtp, lowered);
143
144

	return lowered;
145
146
147
}

/**
148
149
150
151
 * A call list entry.
 */
typedef struct cl_entry cl_entry;
struct cl_entry {
152
153
154
	cl_entry *next;   /**< Pointer to the next entry. */
	ir_node  *call;   /**< Pointer to the Call node. */
	ir_node  *copyb;  /**< List of all CopyB nodes. */
155
156
157
158
};

/**
 * Walker environment for fix_args_and_collect_calls().
159
 */
160
typedef struct wlk_env_t {
Michael Beck's avatar
Michael Beck committed
161
	size_t               arg_shift;        /**< The Argument index shift for parameters. */
162
163
164
	struct obstack       obst;             /**< An obstack to allocate the data on. */
	cl_entry             *cl_list;         /**< The call list. */
	pmap                 *dummy_map;       /**< A map for finding the dummy arguments. */
165
	compound_call_lowering_flags flags;
166
167
	ir_type              *lowered_mtp;     /**< The lowered method type of the current irg if any. */
	ir_type              *value_params;    /**< The value params type if any. */
168
169
	unsigned             only_local_mem:1; /**< Set if only local memory access was found. */
	unsigned             changed:1;        /**< Set if the current graph was changed. */
170
171
172
} wlk_env;

/**
173
174
175
176
177
178
179
 * Return the call list entry of a call node.
 * If no entry exists yet, allocate one and enter the node into
 * the call list of the environment.
 *
 * @param call   A Call node.
 * @param env    The environment.
 */
180
181
static cl_entry *get_Call_entry(ir_node *call, wlk_env *env)
{
182
	cl_entry *res = (cl_entry*)get_irn_link(call);
183
	if (res == NULL) {
184
		res = OALLOC(&env->obst, cl_entry);
185
186
187
188
189
190
191
		res->next  = env->cl_list;
		res->call  = call;
		res->copyb = NULL;
		set_irn_link(call, res);
		env->cl_list = res;
	}
	return res;
192
193
194
}

/**
195
196
197
198
199
200
 * Finds the base address of an address by skipping Sel's and address
 * calculation.
 *
 * @param adr   the address
 * @param pEnt  points to the base entity if any
 */
201
202
static ir_node *find_base_adr(ir_node *ptr, ir_entity **pEnt)
{
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
	ir_entity *ent = NULL;
	assert(mode_is_reference(get_irn_mode(ptr)));

	for (;;) {
		if (is_Sel(ptr)) {
			ent = get_Sel_entity(ptr);
			ptr = get_Sel_ptr(ptr);
		}
		else if (is_Add(ptr)) {
			ir_node *left = get_Add_left(ptr);
			if (mode_is_reference(get_irn_mode(left)))
				ptr = left;
			else
				ptr = get_Add_right(ptr);
			ent = NULL;
		} else if (is_Sub(ptr)) {
			ptr = get_Sub_left(ptr);
			ent = NULL;
		} else {
			*pEnt = ent;
			return ptr;
		}
	}
}

/**
 * Check if a given pointer represents non-local memory.
 */
231
232
static void check_ptr(ir_node *ptr, wlk_env *env)
{
233
234
235
236
237
	ir_storage_class_class_t sc;
	ir_entity                *ent;

	/* still alias free */
	ptr = find_base_adr(ptr, &ent);
238
	sc  = get_base_sc(classify_pointer(ptr, ent));
239
240
241
242
243
244
	if (sc != ir_sc_localvar && sc != ir_sc_malloced) {
		/* non-local memory access */
		env->only_local_mem = 0;
	}
}

245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
/*
 * Returns non-zero if a Call is surely a self-recursive Call.
 * Beware: if this functions returns 0, the call might be self-recursive!
 */
static bool is_self_recursive_Call(const ir_node *call)
{
	const ir_node *callee = get_Call_ptr(call);

	if (is_SymConst_addr_ent(callee)) {
		const ir_entity *ent = get_SymConst_entity(callee);
		const ir_graph  *irg = get_entity_irg(ent);
		if (irg == get_irn_irg(call))
			return 1;
	}
	return 0;
}

262
263
/**
 * Post walker: shift all parameter indexes
264
 * and collect Calls with compound returns in the call list.
265
266
 * If a non-alias free memory access is found, reset the alias free
 * flag.
267
 */
268
269
static void fix_args_and_collect_calls(ir_node *n, void *ctx)
{
270
	wlk_env *env = (wlk_env*)ctx;
271
	ir_type *ctp;
272
273
274
	ir_node *ptr;

	switch (get_irn_opcode(n)) {
275
276
277
278
279
	case iro_Sel:
		if (env->lowered_mtp != NULL && env->value_params != NULL) {
			ir_entity *ent = get_Sel_entity(n);

			if (get_entity_owner(ent) == env->value_params) {
Michael Beck's avatar
Michael Beck committed
280
				size_t pos = get_struct_member_index(env->value_params, ent) + env->arg_shift;
281
282
283
284
				ir_entity *new_ent;

				new_ent = get_method_value_param_ent(env->lowered_mtp, pos);
				set_entity_ident(new_ent, get_entity_ident(ent));
Michael Beck's avatar
Michael Beck committed
285
				set_Sel_entity(n, new_ent);
286
287
288
			}
		}
		break;
289
290
291
292
293
294
295
296
297
298
	case iro_Load:
	case iro_Store:
		if (env->only_local_mem) {
			ptr = get_irn_n(n, 1);
			check_ptr(ptr, env);
		}
		break;
	case iro_Proj:
		if (env->arg_shift > 0) {
			ir_node *pred = get_Proj_pred(n);
299
			ir_graph *irg = get_irn_irg(n);
300
301

			/* Fix the argument numbers */
302
			if (pred == get_irg_args(irg)) {
303
304
305
306
307
308
				long pnr = get_Proj_proj(n);
				set_Proj_proj(n, pnr + env->arg_shift);
				env->changed = 1;
			}
		}
		break;
309
310
311
	case iro_Call: {
		size_t i;
		size_t n_res;
312
313
314
		if (! is_self_recursive_Call(n)) {
			/* any non self recursive call might access global memory */
			env->only_local_mem = 0;
315
		}
316

317
		ctp = get_Call_type(n);
318
319
320
321
322
323
324
325
326
		/* check for compound returns */
		for (i = 0, n_res = get_method_n_ress(ctp); i < n_res; ++i) {
			if (is_compound_type(get_method_res_type(ctp, i))) {
				/*
				 * This is a call with a compound return. As the result
				 * might be ignored, we must put it in the list.
				 */
				(void)get_Call_entry(n, env);
				break;
327
328
			}
		}
329
		break;
330
331
332
	}
	case iro_CopyB: {
		ir_node *src = get_CopyB_src(n);
333
334
335
336
337
		if (env->only_local_mem) {
			check_ptr(get_CopyB_src(n), env);
			if (env->only_local_mem)
				check_ptr(get_CopyB_dst(n), env);
		}
338
339
340
341
342
343
344
345
346
347
348
349
		/* check for compound returns */
		if (is_Proj(src)) {
			ir_node *proj = get_Proj_pred(src);
			if (is_Proj(proj) && get_Proj_proj(proj) == pn_Call_T_result) {
				ir_node *call = get_Proj_pred(proj);
				if (is_Call(call)) {
					ctp = get_Call_type(call);
					if (is_compound_type(get_method_res_type(ctp, get_Proj_proj(src)))) {
						/* found a CopyB from compound Call result */
						cl_entry *e = get_Call_entry(call, env);
						set_irn_link(n, e->copyb);
						e->copyb = n;
350
351
352
					}
				}
			}
353
		}
354
		break;
355
	}
356
357
358
	default:
		/* do nothing */
		break;
359
	}
360
361
362
}

/**
363
364
 * Returns non-zero if a node is a compound address
 * of a frame-type entity.
365
366
367
368
 *
 * @param ft   the frame type
 * @param adr  the node
 */
369
static bool is_compound_address(ir_type *ft, ir_node *adr)
370
{
371
372
373
	ir_entity *ent;

	if (! is_Sel(adr))
374
		return false;
375
	if (get_Sel_n_indexs(adr) != 0)
376
		return false;
377
378
	ent = get_Sel_entity(adr);
	return get_entity_owner(ent) == ft;
379
380
}

381
/** A pair for the copy-return-optimization. */
382
typedef struct cr_pair {
383
384
	ir_entity *ent; /**< the entity than can be removed from the frame */
	ir_node *arg;   /**< the argument that replaces the entities address */
385
386
387
388
389
390
} cr_pair;

/**
 * Post walker: fixes all entities addresses for the copy-return
 * optimization.
 *
yb9976's avatar
yb9976 committed
391
 * Note: We expect the length of the cr_pair array (i.e. number of compound
392
393
 * return values) to be 1 (C, C++) in almost all cases, so ignore the
 * linear search complexity here.
394
 */
395
396
static void do_copy_return_opt(ir_node *n, void *ctx)
{
397
398
	if (is_Sel(n)) {
		ir_entity *ent = get_Sel_entity(n);
399
400
		cr_pair   *arr = (cr_pair*)ctx;
		size_t    i, l;
401

402
		for (i = 0, l = ARR_LEN(arr); i < l; ++i) {
403
404
405
406
407
408
			if (ent == arr[i].ent) {
				exchange(n, arr[i].arg);
				break;
			}
		}
	}
409
410
411
}

/**
412
413
414
415
416
417
418
419
420
421
422
 * Return a Sel node that selects a dummy argument of type tp.
 * Dummy arguments are only needed once and we use a map
 * to store them.
 * We could even assign all dummy arguments the same offset
 * in the frame type ...
 *
 * @param irg    the graph
 * @param block  the block where a newly create Sel should be placed
 * @param tp     the type of the dummy entity that should be create
 * @param env    the environment
 */
423
424
static ir_node *get_dummy_sel(ir_graph *irg, ir_node *block, ir_type *tp,
                              wlk_env *env)
425
{
426
427
428
429
430
	ir_entity *ent;
	pmap_entry *e;

	/* use a map the check if we already create such an entity */
	e = pmap_find(env->dummy_map, tp);
431
	if (e) {
432
		ent = (ir_entity*)e->value;
433
	} else {
434
		ir_type *ft = get_irg_frame_type(irg);
435
436
		ident   *dummy_id = id_unique("dummy.%u");
		ent = new_entity(ft, dummy_id, tp);
437
438
439
440
		pmap_insert(env->dummy_map, tp, ent);

		if (get_type_state(ft) == layout_fixed) {
			/* Fix the layout again */
441
			panic("Fixed layout not implemented");
442
443
		}
	}
444
	return new_r_simpleSel(block, get_irg_no_mem(irg), get_irg_frame(irg), ent);
445
446
447
448
449
450
451
452
453
454
455
}

/**
 * Add the hidden parameter from the CopyB node to the Call node.
 *
 * @param irg    the graph
 * @param n_com  number of compound results (will be number of hidden parameters)
 * @param ins    in array to store the hidden parameters into
 * @param entry  the call list
 * @param env    the environment
 */
456
457
static void add_hidden_param(ir_graph *irg, size_t n_com, ir_node **ins,
                             cl_entry *entry, wlk_env *env)
458
{
459
	ir_node *p, *n, *mem, *blk;
Michael Beck's avatar
Michael Beck committed
460
	size_t n_args;
461
462
463

	n_args = 0;
	for (p = entry->copyb; p; p = n) {
464
465
466
		ir_node *src = get_CopyB_src(p);
		size_t   idx = get_Proj_proj(src);
		n = (ir_node*)get_irn_link(p);
467
468
469
470
471
472

		ins[idx] = get_CopyB_dst(p);
		mem      = get_CopyB_mem(p);
		blk      = get_nodes_block(p);

		/* get rid of the CopyB */
473
		turn_into_tuple(p, pn_CopyB_max+1);
474
		set_Tuple_pred(p, pn_CopyB_M,         mem);
475
		set_Tuple_pred(p, pn_CopyB_X_regular, new_r_Jmp(blk));
Matthias Braun's avatar
Matthias Braun committed
476
		set_Tuple_pred(p, pn_CopyB_X_except,  new_r_Bad(irg, mode_X));
477
478
479
480
481
482
		++n_args;
	}

	/* now create dummy entities for function with ignored return value */
	if (n_args < n_com) {
		ir_type *ctp = get_Call_type(entry->call);
483
484
		size_t   i;
		size_t   j;
485

486
487
		if (is_lowered_type(ctp))
			ctp = get_associated_type(ctp);
488
489
490
491
492
493
494
495
496
497

		for (j = i = 0; i < get_method_n_ress(ctp); ++i) {
			ir_type *rtp = get_method_res_type(ctp, i);
			if (is_compound_type(rtp)) {
				if (ins[j] == NULL)
					ins[j] = get_dummy_sel(irg, get_nodes_block(entry->call), rtp, env);
				++j;
			}
		}
	}
498
499
500
501
}

/**
 * Fix all calls on a call list by adding hidden parameters.
502
 *
503
504
505
 * @param irg  the graph
 * @param env  the environment
 */
506
507
static void fix_call_list(ir_graph *irg, wlk_env *env)
{
508
509
510
	cl_entry *p;
	ir_node *call, **new_in;
	ir_type *ctp, *lowered_mtp;
Michael Beck's avatar
Michael Beck committed
511
	size_t i, n_res, n_params, n_com, pos;
512
513
514
515
516

	new_in = NEW_ARR_F(ir_node *, 0);
	for (p = env->cl_list; p; p = p->next) {
		call = p->call;
		ctp = get_Call_type(call);
517
		lowered_mtp = lower_mtp(env->flags, ctp);
518
519
520
521
522
		set_Call_type(call, lowered_mtp);

		n_params = get_Call_n_params(call);

		n_com = 0;
Michael Beck's avatar
Michael Beck committed
523
		for (i = 0, n_res = get_method_n_ress(ctp); i < n_res; ++i) {
524
525
526
527
528
529
			if (is_compound_type(get_method_res_type(ctp, i)))
				++n_com;
		}
		pos = 2;
		ARR_RESIZE(ir_node *, new_in, n_params + n_com + pos);
		memset(new_in, 0, sizeof(*new_in) * (n_params + n_com + pos));
530
531
		add_hidden_param(irg, n_com, &new_in[pos], p, env);
		pos += n_com;
532
533
534
535
536
537
538
539
		/* copy all other parameters */
		for (i = 0; i < n_params; ++i)
			new_in[pos++] = get_Call_param(call, i);
		new_in[0] = get_Call_mem(call);
		new_in[1] = get_Call_ptr(call);

		set_irn_in(call, n_params + n_com + 2, new_in);
	}
540
541
542
543
544
545
546
547
}

/**
 * Transform a graph. If it has compound parameter returns,
 * remove them and use the hidden parameter instead.
 * If it calls methods with compound parameter returns, add hidden
 * parameters.
 *
548
549
 * @param irg  the graph to transform
 */
550
static void transform_irg(compound_call_lowering_flags flags, ir_graph *irg)
551
{
552
553
	ir_entity  *ent = get_irg_entity(irg);
	ir_type    *mtp, *lowered_mtp, *tp, *ft;
Michael Beck's avatar
Michael Beck committed
554
	size_t     i, j, k, n_ress = 0, n_ret_com = 0;
555
	size_t     n_cr_opt;
556
557
558
	ir_node    **new_in, *ret, *endbl, *bl, *mem, *copy;
	cr_pair    *cr_opt;
	wlk_env    env;
559
560
561

	mtp = get_entity_type(ent);

562
563
564
565
	/* calculate the number of compound returns */
	n_ress = get_method_n_ress(mtp);
	for (n_ret_com = i = 0; i < n_ress; ++i) {
		tp = get_method_res_type(mtp, i);
566

567
568
		if (is_compound_type(tp))
			++n_ret_com;
569
570
571
572
573
574
575
	}

	if (n_ret_com) {
		/* much easier if we have only one return */
		normalize_one_return(irg);

		/* This graph has a compound argument. Create a new type */
576
		lowered_mtp = lower_mtp(flags, mtp);
577
578
		set_entity_type(ent, lowered_mtp);

579
580
		/* hidden arguments are added first */
		env.arg_shift    = n_ret_com;
581
582
583
	} else {
		/* we must only search for calls */
		env.arg_shift = 0;
584
		lowered_mtp   = NULL;
585
586
	}
	obstack_init(&env.obst);
587
588
	env.cl_list        = NULL;
	env.dummy_map      = pmap_create_ex(8);
589
	env.flags          = flags;
590
591
	env.lowered_mtp    = lowered_mtp;
	env.value_params   = get_method_value_param_type(mtp);
592
593
	env.only_local_mem = 1;
	env.changed        = 0;
594
595
596
597
598
599
600
601
602
603
604

	/* scan the code, fix argument numbers and collect calls. */
	irg_walk_graph(irg, firm_clear_link, fix_args_and_collect_calls, &env);

	/* fix all calls */
	if (env.cl_list) {
		fix_call_list(irg, &env);
		env.changed = 1;
	}

	if (n_ret_com) {
Michael Beck's avatar
Michael Beck committed
605
606
		int idx;

607
608
609
		/* STEP 1: find the return. This is simple, we have normalized the graph. */
		endbl = get_irg_end_block(irg);
		ret = NULL;
Michael Beck's avatar
Michael Beck committed
610
611
		for (idx = get_Block_n_cfgpreds(endbl) - 1; idx >= 0; --idx) {
			ir_node *pred = get_Block_cfgpred(endbl, idx);
612
613
614
615
616
617

			if (is_Return(pred)) {
				ret = pred;
				break;
			}
		}
Andreas Zwinkau's avatar
Andreas Zwinkau committed
618
619

		/* in case of infinite loops, there might be no return */
Andreas Zwinkau's avatar
Andreas Zwinkau committed
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
		if (ret != NULL) {
			/*
			 * Now fix the Return node of the current graph.
			 */
			env.changed = 1;

			/*
			 * STEP 2: fix it. For all compound return values add a CopyB,
			 * all others are copied.
			 */
			NEW_ARR_A(ir_node *, new_in, n_ress + 1);

			bl  = get_nodes_block(ret);
			mem = get_Return_mem(ret);

			ft = get_irg_frame_type(irg);
			NEW_ARR_A(cr_pair, cr_opt, n_ret_com);
			n_cr_opt = 0;
			for (j = 1, i = k = 0; i < n_ress; ++i) {
				ir_node *pred = get_Return_res(ret, i);
				tp = get_method_res_type(mtp, i);

				if (is_compound_type(tp)) {
					ir_node *arg = get_irg_args(irg);
644
					arg = new_r_Proj(arg, mode_P_data, k);
Andreas Zwinkau's avatar
Andreas Zwinkau committed
645
646
647
					++k;

					if (is_Unknown(pred)) {
648
649
						/* The Return(Unknown) is the Firm construct for a
						 * missing return. Do nothing. */
Andreas Zwinkau's avatar
Andreas Zwinkau committed
650
651
					} else {
						/**
652
653
654
						 * Sorrily detecting that copy-return is possible isn't
						 * that simple. We must check, that the hidden address
						 * is alias free during the whole function.
Andreas Zwinkau's avatar
Andreas Zwinkau committed
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
						 * A simple heuristic: all Loads/Stores inside
						 * the function access only local frame.
						 */
						if (env.only_local_mem && is_compound_address(ft, pred)) {
							/* we can do the copy-return optimization here */
							cr_opt[n_cr_opt].ent = get_Sel_entity(pred);
							cr_opt[n_cr_opt].arg = arg;
							++n_cr_opt;
						} else { /* copy-return optimization is impossible, do the copy. */
							copy = new_r_CopyB(
									bl,
									mem,
									arg,
									pred,
									tp
									);
							mem = new_r_Proj(copy, mode_M, pn_CopyB_M);
						}
673
					}
674
					if (flags & LF_RETURN_HIDDEN) {
Andreas Zwinkau's avatar
Andreas Zwinkau committed
675
676
677
678
679
						new_in[j] = arg;
						++j;
					}
				} else { /* scalar return value */
					new_in[j] = pred;
680
681
682
					++j;
				}
			}
Andreas Zwinkau's avatar
Andreas Zwinkau committed
683
684
685
			/* replace the in of the Return */
			new_in[0] = mem;
			set_irn_in(ret, j, new_in);
686

Andreas Zwinkau's avatar
Andreas Zwinkau committed
687
			if (n_cr_opt > 0) {
688
689
				size_t c;
				size_t n;
690

Andreas Zwinkau's avatar
Andreas Zwinkau committed
691
				irg_walk_graph(irg, NULL, do_copy_return_opt, cr_opt);
692

693
694
				for (c = 0, n = ARR_LEN(cr_opt); c < n; ++c) {
					free_entity(cr_opt[c].ent);
Andreas Zwinkau's avatar
Andreas Zwinkau committed
695
				}
696
697
			}
		}
698
	}
699
700
701

	pmap_destroy(env.dummy_map);
	obstack_free(&env.obst, NULL);
702
}
703

704
static void lower_method_types(type_or_ent tore, void *env)
705
{
706
707
	const compound_call_lowering_flags *flags
		= (const compound_call_lowering_flags*)env;
708
709

	/* fix method entities */
710
	if (is_entity(tore.ent)) {
711
712
713
714
		ir_entity *ent     = tore.ent;
		ir_type   *tp      = get_entity_type(ent);
		ir_type   *lowered = lower_mtp(*flags, tp);
		set_entity_type(ent, lowered);
715
	} else {
716
		ir_type *tp = tore.typ;
717
718
719

		/* fix pointer to methods */
		if (is_Pointer_type(tp)) {
720
721
722
			ir_type *points_to         = get_pointer_points_to_type(tp);
			ir_type *lowered_points_to = lower_mtp(*flags, points_to);
			set_pointer_points_to_type(tp, lowered_points_to);
723
724
		}
	}
725
726
}

727
void lower_calls_with_compounds(compound_call_lowering_flags flags)
728
{
Michael Beck's avatar
Michael Beck committed
729
	size_t i, n;
730

731
732
	pointer_types = pmap_create();
	lowered_mtps = pmap_create();
733

734
	/* first step: Transform all graphs */
Michael Beck's avatar
Michael Beck committed
735
	for (i = 0, n = get_irp_n_irgs(); i < n; ++i) {
736
737
		ir_graph *irg = get_irp_irg(i);
		transform_irg(flags, irg);
738
	}
739

740
	/* second step: Lower all method types of visible entities */
741
	type_walk(NULL, lower_method_types, &flags);
742

743
744
	pmap_destroy(lowered_mtps);
	pmap_destroy(pointer_types);
745
}