analyze_irg_args.c 12.7 KB
Newer Older
1
/*
Michael Beck's avatar
Michael Beck committed
2
 * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
Matthias Braun's avatar
Matthias Braun committed
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
 *
 * 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.
18
19
20
 */

/**
Matthias Braun's avatar
Matthias Braun committed
21
22
 * @file
 * @brief      read/write analyze of graph argument, which have mode reference.
Michael Beck's avatar
Michael Beck committed
23
 * @author     Beyhan Veliev
24
25
26
 */
#include "config.h"

27
#include <stdlib.h>
28
29
30
31

#include "irouts.h"
#include "irnode_t.h"
#include "irmode_t.h"
32
#include "array_t.h"
33
34
35
36
37
38
39
#include "irprog.h"
#include "entity_t.h"

#include "analyze_irg_args.h"

/**
 * Walk recursive the successors of a graph argument
40
 * with mode reference and mark if it will be read,
Michael Beck's avatar
Michael Beck committed
41
 * written or stored.
42
43
44
45
 *
 * @param arg   The graph argument with mode reference,
 *             that must be checked.
 */
46
static ptr_access_kind analyze_arg(ir_node *arg, ptr_access_kind bits)
47
{
48
49
50
51
	int i, p;
	ir_node *succ;

	/* We must visit a node once to avoid endless recursion.*/
52
	mark_irn_visited(arg);
53
54
55
56
57

	for (i = get_irn_n_outs(arg) - 1; i >= 0; --i) {
		succ = get_irn_out(arg, i);

		/* We was here.*/
58
		if (irn_visited(succ))
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
			continue;

		/* We should not walk over the memory edge.*/
		if (get_irn_mode(succ) == mode_M)
			continue;

		/* If we reach with the recursion a Call node and our reference
		   isn't the address of this Call we accept that the reference will
		   be read and written if the graph of the method represented by
		   "Call" isn't computed else we analyze that graph. If our
		   reference is the address of this
		   Call node that mean the reference will be read.*/
		switch (get_irn_opcode(succ)) {

		case iro_Call: {
			ir_node *ptr  = get_Call_ptr(succ);

			if (ptr == arg) {
				/* Hmm: not sure what this is, most likely a read */
				bits |= ptr_access_read;
			} else {
				ir_entity *meth_ent;

82
83
				if (is_SymConst_addr_ent(ptr)) {
					meth_ent = get_SymConst_entity(ptr);
84
85
86
87
88
89
90
91
92

					for (p = get_Call_n_params(succ) - 1; p >= 0; --p) {
						if (get_Call_param(succ, p) == arg) {
							/* an arg can be used more than once ! */
							bits |= get_method_param_access(meth_ent, p);
						}
					}
				} else if (is_Sel(ptr) && get_irp_callee_info_state() == irg_callee_info_consistent) {
					/* is be a polymorphic call but callee information is available */
93
94
					int n_params = get_Call_n_params(succ);
					int c;
95
96

					/* simply look into ALL possible callees */
97
98
					for (c = get_Call_n_callees(succ) - 1; c >= 0; --c) {
						meth_ent = get_Call_callee(succ, c);
99
100

						/* unknown_entity is used to signal that we don't know what is called */
101
						if (is_unknown_entity(meth_ent)) {
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
							bits |= ptr_access_all;
							break;
						}

						for (p = n_params - 1; p >= 0; --p) {
							if (get_Call_param(succ, p) == arg) {
								/* an arg can be used more than once ! */
								bits |= get_method_param_access(meth_ent, p);
							}
						}
					}
				} else /* can do anything */
					bits |= ptr_access_all;
			}

			/* search stops here anyway */
			continue;
		}
		case iro_Store:
			/* We have reached a Store node => the reference is written or stored. */
			if (get_Store_ptr(succ) == arg) {
				/* written to */
				bits |= ptr_access_write;
			} else {
				/* stored itself */
				bits |= ptr_access_store;
			}

			/* search stops here anyway */
			continue;

		case iro_Load:
			/* We have reached a Load node => the reference is read. */
			bits |= ptr_access_read;

			/* search stops here anyway */
			continue;

		case iro_Conv:
			/* our address is casted into something unknown. Break our search. */
			bits = ptr_access_all;
			break;

		default:
			break;
		}

		/* If we know that, the argument will be read, write and stored, we
		   can break the recursion.*/
		if (bits == ptr_access_all) {
			bits = ptr_access_all;
			break;
		}

		/*
		 * A calculation that do not lead to a reference mode ends our search.
		 * This is dangerous: It would allow to cast into integer and that cast back ...
		 * so, when we detect a Conv we go mad, see the Conv case above.
		 */
		if (!mode_is_reference(get_irn_mode(succ)))
			continue;

		/* follow further the address calculation */
		bits = analyze_arg(succ, bits);
	}
	set_irn_link(arg, NULL);
	return bits;
169
170
171
172
173
174
175
176
}

/**
 * Check if a argument of the ir graph with mode
 * reference is read, write or both.
 *
 * @param irg   The ir graph to analyze.
 */
177
178
static void analyze_ent_args(ir_entity *ent)
{
179
180
181
182
183
184
185
	ir_graph *irg;
	ir_node *irg_args, *arg;
	ir_mode *arg_mode;
	int nparams, i;
	long proj_nr;
	ir_type *mtp;
	ptr_access_kind *rw_info;
186

187
188
	mtp     = get_entity_type(ent);
	nparams = get_method_n_params(mtp);
189

190
	ent->attr.mtd_attr.param_access = NEW_ARR_F(ptr_access_kind, nparams);
191

192
193
194
195
196
	/* If the method haven't parameters we have
	 * nothing to do.
	 */
	if (nparams <= 0)
		return;
197

198
	irg = get_entity_irg(ent);
199

200
  /* we have not yet analyzed the graph, set ALL access for pointer args */
201
202
203
204
	for (i = nparams - 1; i >= 0; --i) {
		ir_type *type = get_method_param_type(mtp, i);
		ent->attr.mtd_attr.param_access[i] = is_Pointer_type(type) ? ptr_access_all : ptr_access_none;
	}
205

206
207
208
209
	if (! irg) {
		/* no graph, no better info */
		return;
	}
210

211
	assure_irg_outs(irg);
212

213
	irg_args = get_irg_args(irg);
214

215
216
217
	/* A array to save the information for each argument with
	   mode reference.*/
	NEW_ARR_A(ptr_access_kind, rw_info, nparams);
218

219
220
221
	/* We initialize the element with none state. */
	for (i = nparams - 1; i >= 0; --i)
		rw_info[i] = ptr_access_none;
222

223
224
225
226
227
228
	/* search for arguments with mode reference
	   to analyze them.*/
	for (i = get_irn_n_outs(irg_args) - 1; i >= 0; --i) {
		arg      = get_irn_out(irg_args, i);
		arg_mode = get_irn_mode(arg);
		proj_nr  = get_Proj_proj(arg);
229

230
231
232
		if (mode_is_reference(arg_mode))
			rw_info[proj_nr] |= analyze_arg(arg, rw_info[proj_nr]);
	}
233

234
235
236
	/* copy the temporary info */
	memcpy(ent->attr.mtd_attr.param_access, rw_info,
		nparams * sizeof(ent->attr.mtd_attr.param_access[0]));
237

Michael Beck's avatar
Michael Beck committed
238
#if 0
239
240
241
242
243
244
245
246
247
248
249
250
251
252
	printf("\n%s:\n", get_entity_name(ent));
	for (i = 0; i < nparams; ++i) {
		if (is_Pointer_type(get_method_param_type(mtp, i)))
			if (ent->attr.mtd_attr.param_access[i] != ptr_access_none) {
				printf("  Pointer Arg %d access: ", i);
				if (ent->attr.mtd_attr.param_access[i] & ptr_access_read)
					printf("READ ");
				if (ent->attr.mtd_attr.param_access[i] & ptr_access_write)
					printf("WRITE ");
				if (ent->attr.mtd_attr.param_access[i] & ptr_access_store)
					printf("STORE ");
				printf("\n");
			}
	}
Michael Beck's avatar
Michael Beck committed
253
#endif
254
255
}

256
257
void analyze_irg_args(ir_graph *irg)
{
258
	ir_entity *ent;
259

260
261
	if (irg == get_const_code_irg())
		return;
262

263
264
265
	ent = get_irg_entity(irg);
	if (! ent)
		return;
266

267
268
	if (! ent->attr.mtd_attr.param_access)
		analyze_ent_args(ent);
269
270
}

271
ptr_access_kind get_method_param_access(ir_entity *ent, size_t pos)
272
{
273
#ifndef NDEBUG
274
275
	ir_type *mtp = get_entity_type(ent);
	int is_variadic = get_method_variadicity(mtp) == variadicity_variadic;
276

277
	assert(is_variadic || pos < get_method_n_params(mtp));
278
#endif
279

280
281
282
283
284
285
	if (ent->attr.mtd_attr.param_access) {
		if (pos < ARR_LEN(ent->attr.mtd_attr.param_access))
			return ent->attr.mtd_attr.param_access[pos];
		else
			return ptr_access_all;
	}
286

287
	analyze_ent_args(ent);
288

289
290
291
292
	if (pos < ARR_LEN(ent->attr.mtd_attr.param_access))
		return ent->attr.mtd_attr.param_access[pos];
	else
		return ptr_access_all;
293
294
}

295
/* Weights for parameters */
296
enum args_weight {
297
298
299
300
301
302
	null_weight          = 0,   /**< If can't be anything optimized. */
	binop_weight         = 1,   /**< If the argument have mode_weight and take part in binop. */
	const_binop_weight   = 1,   /**< If the argument have mode_weight and take part in binop with a constant.*/
	cmp_weight           = 4,   /**< If the argument take part in cmp. */
	const_cmp_weight     = 10,  /**< If the argument take part in cmp with a constant. */
	indirect_call_weight = 125, /**< If the argument is the address of an indirect Call. */
303
304
};

305
/**
306
 * Compute the weight of a method parameter
307
 *
308
 * @param arg  The parameter them weight muss be computed.
309
 */
310
311
static unsigned calc_method_param_weight(ir_node *arg)
{
312
	int      i, j, k;
313
314
315
316
	ir_node  *succ, *op;
	unsigned weight = null_weight;

	/* We mark the nodes to avoid endless recursion */
317
	mark_irn_visited(arg);
318
319
320
321
322

	for (i = get_irn_n_outs(arg) - 1; i >= 0; i--) {
		succ = get_irn_out(arg, i);

		/* We was here.*/
323
		if (irn_visited(succ))
324
325
326
327
328
329
			continue;

		/* We should not walk over the memory edge.*/
		if (get_irn_mode(succ) == mode_M)
			continue;

330
331
332
333
334
335
336
337
338
		switch (get_irn_opcode(succ)) {
		case iro_Call:
			if (get_Call_ptr(succ) == arg) {
				/* the arguments is used as an pointer input for a call,
				   we can probably change an indirect Call into a direct one. */
				weight += indirect_call_weight;
			}
			break;
		case iro_Cmp:
339
340
341
342
343
344
345
346
347
348
349
			/* We have reached a cmp and we must increase the
			   weight with the cmp_weight. */
			if (get_Cmp_left(succ) == arg)
				op = get_Cmp_right(succ);
			else
				op = get_Cmp_left(succ);

			if (is_irn_constlike(op)) {
				weight += const_cmp_weight;
			} else
				weight += cmp_weight;
350
351
			break;
		case iro_Cond:
352
353
			/* the argument is used for a SwitchCond, a big win */
			weight += const_cmp_weight * get_irn_n_outs(succ);
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
			break;
		case iro_Id:
			/* when looking backward we might find Id nodes */
			weight += calc_method_param_weight(succ);
			break;
		case iro_Tuple:
			/* unoptimized tuple */
			for (j = get_Tuple_n_preds(succ) - 1; j >= 0; --j) {
				ir_node *pred = get_Tuple_pred(succ, j);
				if (pred == arg) {
					/* look for Proj(j) */
					for (k = get_irn_n_outs(succ) - 1; k >= 0; --k) {
						ir_node *succ_succ = get_irn_out(succ, k);
						if (is_Proj(succ_succ)) {
							if (get_Proj_proj(succ_succ) == j) {
								/* found */
								weight += calc_method_param_weight(succ_succ);
							}
						} else {
							/* this should NOT happen */
						}
					}
				}
			}
			break;
		default:
			if (is_binop(succ)) {
				/* We have reached a BinOp and we must increase the
				   weight with the binop_weight. If the other operand of the
				   BinOp is a constant we increase the weight with const_binop_weight
				   and call the function recursive.
				 */
				if (get_binop_left(succ) == arg)
					op = get_binop_right(succ);
				else
					op = get_binop_left(succ);

				if (is_irn_constlike(op)) {
					weight += const_binop_weight;
					weight += calc_method_param_weight(succ);
				} else
					weight += binop_weight;
			} else if (is_unop(succ)) {
				/* We have reached a binop and we must increase the
				   weight with the const_binop_weight and call the function recursive.*/
399
400
				weight += const_binop_weight;
				weight += calc_method_param_weight(succ);
401
402
			}
			break;
403
404
405
406
		}
	}
	set_irn_link(arg, NULL);
	return weight;
407
408
409
}

/**
410
 * Calculate a weight for each argument of an entity.
411
412
413
 *
 * @param ent  The entity of the ir_graph.
 */
414
415
static void analyze_method_params_weight(ir_entity *ent)
{
416
417
418
419
	ir_type  *mtp;
	ir_graph *irg;
	int      nparams, i, proj_nr;
	ir_node  *irg_args, *arg;
420

421
422
	mtp      = get_entity_type(ent);
	nparams  = get_method_n_params(mtp);
423

424
425
	/* allocate a new array. currently used as 'analysed' flag */
	ent->attr.mtd_attr.param_weight = NEW_ARR_F(unsigned, nparams);
426

427
428
429
	/* If the method haven't parameters we have nothing to do. */
	if (nparams <= 0)
	  return;
430

431
432
433
	/* First we initialize the parameter weights with 0. */
	for (i = nparams - 1; i >= 0; i--)
		ent->attr.mtd_attr.param_weight[i] = null_weight;
434

435
436
437
438
439
	irg = get_entity_irg(ent);
	if (irg == NULL) {
		/* no graph, no better info */
		return;
	}
440

441
442
	/* Call algorithm that computes the out edges */
	assure_irg_outs(irg);
443

444
445
446
447
	irg_args = get_irg_args(irg);
	for (i = get_irn_n_outs(irg_args) - 1; i >= 0; --i) {
		arg     = get_irn_out(irg_args, i);
		proj_nr = get_Proj_proj(arg);
448
		ent->attr.mtd_attr.param_weight[proj_nr] += calc_method_param_weight(arg);
449
	}
450
451
}

452
unsigned get_method_param_weight(ir_entity *ent, size_t pos)
453
{
454
455
456
457
458
459
	if (ent->attr.mtd_attr.param_weight) {
		if (pos < ARR_LEN(ent->attr.mtd_attr.param_weight))
			return ent->attr.mtd_attr.param_weight[pos];
		else
			return null_weight;
	}
460

461
	analyze_method_params_weight(ent);
462

463
464
465
466
	if (pos < ARR_LEN(ent->attr.mtd_attr.param_weight))
		return ent->attr.mtd_attr.param_weight[pos];
	else
		return null_weight;
467
468
}

469
470
void analyze_irg_args_weight(ir_graph *irg)
{
471
472
473
	ir_entity *entity = get_irg_entity(irg);
	if (entity == NULL)
		return;
474

475
	assert(is_method_entity(entity));
Matthias Braun's avatar
Matthias Braun committed
476
	if (entity->attr.mtd_attr.param_weight != NULL)
477
		return;
478

479
480
	ir_reserve_resources(irg, IR_RESOURCE_IRN_VISITED);
	inc_irg_visited(irg);
Matthias Braun's avatar
Matthias Braun committed
481
	analyze_method_params_weight(entity);
482
	ir_free_resources(irg, IR_RESOURCE_IRN_VISITED);
483
}