ldstopt.c 29.9 KB
Newer Older
Michael Beck's avatar
Michael Beck committed
1
2
3
4
/*
 * Project:     libFIRM
 * File name:   ir/opt/ldstopt.c
 * Purpose:     load store optimizations
Michael Beck's avatar
Michael Beck committed
5
 * Author:      Michael Beck
Michael Beck's avatar
Michael Beck committed
6
7
 * Created:
 * CVS-ID:      $Id$
Götz Lindenmaier's avatar
Götz Lindenmaier committed
8
 * Copyright:   (c) 1998-2004 Universitt Karlsruhe
Michael Beck's avatar
Michael Beck committed
9
10
 * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
 */
Michael Beck's avatar
Michael Beck committed
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif

#ifdef HAVE_ALLOCA_H
#include <alloca.h>
#endif
#ifdef HAVE_MALLOC_H
#include <malloc.h>
#endif
#ifdef HAVE_STRING_H
# include <string.h>
#endif

Michael Beck's avatar
Michael Beck committed
25
26
27
28
29
30
31
32
33
34
35
36
# include "irnode_t.h"
# include "irgraph_t.h"
# include "irmode_t.h"
# include "iropt_t.h"
# include "ircons_t.h"
# include "irgmod.h"
# include "irgwalk.h"
# include "irvrfy.h"
# include "tv_t.h"
# include "dbginfo_t.h"
# include "iropt_dbg.h"
# include "irflag_t.h"
Michael Beck's avatar
Michael Beck committed
37
# include "array.h"
38
# include "irhooks.h"
39
# include "irtools.h"
40
41
42
43
44
# include "opt_polymorphy.h"

#ifdef DO_CACHEOPT
#include "cacheopt/cachesim.h"
#endif
Michael Beck's avatar
Michael Beck committed
45
46
47
48
49
50

#undef IMAX
#define IMAX(a,b)	((a) > (b) ? (a) : (b))

#define MAX_PROJ	IMAX(pn_Load_max, pn_Store_max)

51
52
53
54
55
enum changes_t {
  DF_CHANGED = 1,       /**< data flow changed */
  CF_CHANGED = 2,       /**< control flow changed */
};

Michael Beck's avatar
Michael Beck committed
56
57
58
59
60
/**
 * walker environment
 */
typedef struct _walk_env_t {
  struct obstack obst;		/**< list of all stores */
61
  unsigned changes;             /**< a bitmask of graph changes */
Michael Beck's avatar
Michael Beck committed
62
63
} walk_env_t;

64
65
66
67
68
69
70
/**
 * flags for Load/Store
 */
enum ldst_flags_t {
  LDST_VISITED = 1              /**< if set, this Load/Store is already visited */
};

Michael Beck's avatar
Michael Beck committed
71
72
73
74
/**
 * a Load/Store info
 */
typedef struct _ldst_info_t {
75
76
77
78
  ir_node  *projs[MAX_PROJ];    /**< list of Proj's of this node */
  ir_node  *exc_block;          /**< the exception block if available */
  int      exc_idx;             /**< predecessor index in the exception block */
  unsigned flags;               /**< flags */
79
  unsigned visited;             /**< visited counter for breaking loops */
Michael Beck's avatar
Michael Beck committed
80
81
} ldst_info_t;

82
83
84
85
86
/**
 * flags for control flow
 */
enum block_flags_t {
  BLOCK_HAS_COND = 1,      /**< Block has conditional control flow */
87
  BLOCK_HAS_EXC  = 2       /**< Block has exceptional control flow */
88
89
90
91
92
93
94
95
96
};

/**
 * a Block info
 */
typedef struct _block_info_t {
  unsigned flags;               /**< flags for the block */
} block_info_t;

97
98
99
100
101
102
103
/** the master visited flag for loop detection. */
static unsigned master_visited = 0;

#define INC_MASTER()       ++master_visited
#define MARK_NODE(info)    (info)->visited = master_visited
#define NODE_VISITED(info) (info)->visited >= master_visited

Michael Beck's avatar
Michael Beck committed
104
105
106
/**
 * get the Load/Store info of a node
 */
107
static ldst_info_t *get_ldst_info(ir_node *node, walk_env_t *env)
Michael Beck's avatar
Michael Beck committed
108
109
110
111
112
113
114
115
116
117
118
119
120
{
  ldst_info_t *info = get_irn_link(node);

  if (! info) {
    info = obstack_alloc(&env->obst, sizeof(*info));

    memset(info, 0, sizeof(*info));

    set_irn_link(node, info);
  }
  return info;
}

121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
/**
 * get the Block info of a node
 */
static block_info_t *get_block_info(ir_node *node, walk_env_t *env)
{
  block_info_t *info = get_irn_link(node);

  if (! info) {
    info = obstack_alloc(&env->obst, sizeof(*info));

    memset(info, 0, sizeof(*info));

    set_irn_link(node, info);
  }
  return info;
}

Michael Beck's avatar
Michael Beck committed
138
/**
Michael Beck's avatar
Michael Beck committed
139
 * update the projection info for a Load/Store
Michael Beck's avatar
Michael Beck committed
140
 */
141
static unsigned update_projs(ldst_info_t *info, ir_node *proj)
Michael Beck's avatar
Michael Beck committed
142
143
144
145
146
147
148
149
{
  long nr = get_Proj_proj(proj);

  assert(0 <= nr && nr <= MAX_PROJ && "Wrong proj from LoadStore");

  if (info->projs[nr]) {
    /* there is already one, do CSE */
    exchange(proj, info->projs[nr]);
150
    return DF_CHANGED;
Michael Beck's avatar
Michael Beck committed
151
  }
Michael Beck's avatar
Michael Beck committed
152
  else {
Michael Beck's avatar
Michael Beck committed
153
    info->projs[nr] = proj;
Michael Beck's avatar
Michael Beck committed
154
155
156
157
158
    return 0;
  }
}

/**
159
160
161
162
163
 * update the exception block info for a Load/Store node.
 *
 * @param info   the load/store info struct
 * @param block  the exception handler block for this load/store
 * @param pos    the control flow input of the block
Michael Beck's avatar
Michael Beck committed
164
 */
165
static unsigned update_exc(ldst_info_t *info, ir_node *block, int pos)
Michael Beck's avatar
Michael Beck committed
166
167
168
169
170
171
{
  assert(info->exc_block == NULL && "more than one exception block found");

  info->exc_block = block;
  info->exc_idx   = pos;
  return 0;
Michael Beck's avatar
Michael Beck committed
172
173
}

174
175
#define get_irn_out_n(node)     (unsigned)PTR_TO_INT(get_irn_link(node))
#define set_irn_out_n(node, n)  set_irn_link(adr, INT_TO_PTR(n))
176

Michael Beck's avatar
Michael Beck committed
177
178
/**
 * walker, collects all Load/Store/Proj nodes
179
 *
180
 * walks from Start -> End
Michael Beck's avatar
Michael Beck committed
181
 */
Michael Beck's avatar
Michael Beck committed
182
static void collect_nodes(ir_node *node, void *env)
Michael Beck's avatar
Michael Beck committed
183
{
184
  ir_op       *op = get_irn_op(node);
185
  ir_node     *pred, *blk, *pred_blk;
186
  ldst_info_t *ldst_info;
Michael Beck's avatar
Michael Beck committed
187
188
  walk_env_t  *wenv = env;

189
  if (op == op_Proj) {
190
191
192
    ir_node *adr;
    ir_op *op;

Michael Beck's avatar
Michael Beck committed
193
    pred = get_Proj_pred(node);
194
    op   = get_irn_op(pred);
Michael Beck's avatar
Michael Beck committed
195

196
    if (op == op_Load) {
197
      ldst_info = get_ldst_info(pred, wenv);
Michael Beck's avatar
Michael Beck committed
198

199
      wenv->changes |= update_projs(ldst_info, node);
200

201
202
203
204
205
206
      if ((ldst_info->flags & LDST_VISITED) == 0) {
        adr = get_Load_ptr(pred);
        set_irn_out_n(adr, get_irn_out_n(adr) + 1);

        ldst_info->flags |= LDST_VISITED;
      }
207
208
209
210
211
212
213
214
215
216
217
218
219

      /*
       * Place the Proj's to the same block as the
       * predecessor Load. This is always ok and prevents
       * "non-SSA" form after optimizations if the Proj
       * is in a wrong block.
       */
      blk      = get_nodes_block(node);
      pred_blk = get_nodes_block(pred);
      if (blk != pred_blk) {
        wenv->changes |= DF_CHANGED;
        set_nodes_block(node, pred_blk);
      }
220
221
222
223
224
225
    }
    else if (op == op_Store) {
      ldst_info = get_ldst_info(pred, wenv);

      wenv->changes |= update_projs(ldst_info, node);

226
227
228
229
230
231
      if ((ldst_info->flags & LDST_VISITED) == 0) {
        adr = get_Store_ptr(pred);
        set_irn_out_n(adr, get_irn_out_n(adr) + 1);

        ldst_info->flags |= LDST_VISITED;
      }
232
233
234
235
236
237
238
239
240
241
242
243
244

      /*
       * Place the Proj's to the same block as the
       * predecessor Store. This is always ok and prevents
       * "non-SSA" form after optimizations if the Proj
       * is in a wrong block.
       */
      blk      = get_nodes_block(node);
      pred_blk = get_nodes_block(pred);
      if (blk != pred_blk) {
        wenv->changes |= DF_CHANGED;
        set_nodes_block(node, pred_blk);
      }
Michael Beck's avatar
Michael Beck committed
245
246
    }
  }
247
  else if (op == op_Block) { /* check, if it's an exception block */
248
    int i;
Michael Beck's avatar
Michael Beck committed
249

250
    for (i = get_Block_n_cfgpreds(node) - 1; i >= 0; --i) {
251
252
253
      ir_node      *pred_block;
      block_info_t *bl_info;

Michael Beck's avatar
Michael Beck committed
254
255
      pred = skip_Proj(get_Block_cfgpred(node, i));

256
257
      /* ignore Bad predecessors, they will be removed later */
      if (is_Bad(pred))
258
        continue;
259
260
261
262
263

      pred_block = get_nodes_block(pred);
      bl_info    = get_block_info(pred_block, wenv);

      if (is_fragile_op(pred))
264
265
266
	      bl_info->flags |= BLOCK_HAS_EXC;
      else if (is_irn_forking(pred))
        bl_info->flags |= BLOCK_HAS_COND;
267

Michael Beck's avatar
Michael Beck committed
268
      if (get_irn_op(pred) == op_Load || get_irn_op(pred) == op_Store) {
269
        ldst_info = get_ldst_info(pred, wenv);
Michael Beck's avatar
Michael Beck committed
270

271
        wenv->changes |= update_exc(ldst_info, node, i);
Michael Beck's avatar
Michael Beck committed
272
      }
Michael Beck's avatar
Michael Beck committed
273
274
275
276
    }
  }
}

Michael Beck's avatar
Michael Beck committed
277
/**
278
 * Returns an entity if the address ptr points to a constant one.
Michael Beck's avatar
Michael Beck committed
279
280
281
282
283
284
285
286
287
288
 */
static entity *find_constant_entity(ir_node *ptr)
{
  for (;;) {
    ir_op *op = get_irn_op(ptr);

    if (op == op_SymConst && (get_SymConst_kind(ptr) == symconst_addr_ent)) {
      return get_SymConst_entity(ptr);
    }
    else if (op == op_Sel) {
289
290
      entity  *ent = get_Sel_entity(ptr);
      ir_type *tp  = get_entity_owner(ent);
Michael Beck's avatar
Michael Beck committed
291

Michael Beck's avatar
Michael Beck committed
292
      /* Do not fiddle with polymorphism. */
293
      if (is_Class_type(get_entity_owner(ent)) &&
Michael Beck's avatar
Michael Beck committed
294
295
296
          ((get_entity_n_overwrites(ent)    != 0) ||
           (get_entity_n_overwrittenby(ent) != 0)   ) )
        return NULL;
297
298

      if (variability_constant == get_entity_variability(ent))
Michael Beck's avatar
Michael Beck committed
299
        return ent;
300

301
      if (is_Array_type(tp)) {
Michael Beck's avatar
Michael Beck committed
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
        /* check bounds */
        int i, n;

        for (i = 0, n = get_Sel_n_indexs(ptr); i < n; ++i) {
          ir_node *bound;
          tarval *tlower, *tupper;
          ir_node *index = get_Sel_index(ptr, i);
          tarval *tv     = computed_value(index);

          /* check if the index is constant */
          if (tv == tarval_bad)
            return NULL;

          bound  = get_array_lower_bound(tp, i);
          tlower = computed_value(bound);
          bound  = get_array_upper_bound(tp, i);
          tupper = computed_value(bound);

          if (tlower == tarval_bad || tupper == tarval_bad)
            return NULL;

323
          if (tarval_cmp(tv, tlower) & pn_Cmp_Lt)
Michael Beck's avatar
Michael Beck committed
324
            return NULL;
325
          if (tarval_cmp(tupper, tv) & pn_Cmp_Lt)
Michael Beck's avatar
Michael Beck committed
326
327
328
329
330
331
332
333
334
335
336
337
338
339
            return NULL;

          /* ok, bounds check finished */
        }
      }

      /* try next */
      ptr = get_Sel_ptr(ptr);
    }
    else
      return NULL;
  }
}

Michael Beck's avatar
Michael Beck committed
340
341
342
/**
 * Return the Selection index of a Sel node from dimension n
 */
343
344
345
346
347
348
static long get_Sel_array_index_long(ir_node *n, int dim) {
  ir_node *index = get_Sel_index(n, dim);
  assert(get_irn_op(index) == op_Const);
  return get_tarval_long(get_Const_tarval(index));
}

Michael Beck's avatar
Michael Beck committed
349
350
351
352
353
354
355
356
/**
 * Returns the accessed component graph path for an
 * node computing an address.
 *
 * @param ptr    the node computing the address
 * @param depth  current depth in steps upward from the root
 *               of the address
 */
Götz Lindenmaier's avatar
bugfix    
Götz Lindenmaier committed
357
static compound_graph_path *rec_get_accessed_path(ir_node *ptr, int depth) {
Michael Beck's avatar
Michael Beck committed
358
359
360
361
  compound_graph_path *res = NULL;
  entity              *root, *field;
  int                 path_len, pos;

362
  if (get_irn_op(ptr) == op_SymConst) {
Michael Beck's avatar
Michael Beck committed
363
364
365
366
    /* a SymConst. If the depth is 0, this is an access to a global
     * entity and we don't need a component path, else we know
     * at least it's length.
     */
367
    assert(get_SymConst_kind(ptr) == symconst_addr_ent);
Michael Beck's avatar
Michael Beck committed
368
    root = get_SymConst_entity(ptr);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
369
    res = (depth == 0) ? NULL : new_compound_graph_path(get_entity_type(root), depth);
Michael Beck's avatar
Michael Beck committed
370
371
  }
  else {
372
    assert(get_irn_op(ptr) == op_Sel);
Michael Beck's avatar
Michael Beck committed
373
    /* it's a Sel, go up until we find the root */
374
    res = rec_get_accessed_path(get_Sel_ptr(ptr), depth+1);
Michael Beck's avatar
Michael Beck committed
375
376
377

    /* fill up the step in the path at the current position */
    field    = get_Sel_entity(ptr);
Michael Beck's avatar
Michael Beck committed
378
    path_len = get_compound_graph_path_length(res);
Michael Beck's avatar
Michael Beck committed
379
    pos      = path_len - depth - 1;
380
    set_compound_graph_path_node(res, pos, field);
Michael Beck's avatar
Michael Beck committed
381

382
383
384
385
386
387
388
389
    if (is_Array_type(get_entity_owner(field))) {
      assert(get_Sel_n_indexs(ptr) == 1 && "multi dim arrays not implemented");
      set_compound_graph_path_array_index(res, pos, get_Sel_array_index_long(ptr, 0));
    }
  }
  return res;
}

Götz Lindenmaier's avatar
bugfix    
Götz Lindenmaier committed
390
/** Returns an access path or NULL.  The access path is only
Michael Beck's avatar
Michael Beck committed
391
392
 *  valid, if the graph is in phase_high and _no_ address computation is used.
 */
Götz Lindenmaier's avatar
bugfix    
Götz Lindenmaier committed
393
static compound_graph_path *get_accessed_path(ir_node *ptr) {
394
395
396
  return rec_get_accessed_path(ptr, 0);
}

Michael Beck's avatar
Michael Beck committed
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
/**
 * Follow the memory chain as long as there are only Loads
 * and try to replace current Load or Store by a previous one.
 * Note that in unreachable loops it might happen that we reach
 * load again, as well as we can fall into a cycle.
 * We break such cycles using a special visited flag.
 *
 * INC_MASTER() must be called before dive into
 */
static unsigned follow_Load_chain(ir_node *load, ir_node *curr) {
  unsigned res = 0;
  ldst_info_t *info = get_irn_link(load);
  ir_node *pred;
  ir_node *ptr       = get_Load_ptr(load);
  ir_node *mem       = get_Load_mem(load);
  ir_mode *load_mode = get_Load_mode(load);

  for (pred = curr; load != pred; pred = skip_Proj(get_Load_mem(pred))) {
    ldst_info_t *pred_info = get_irn_link(pred);

    /*
     * BEWARE: one might think that checking the modes is useless, because
     * if the pointers are identical, they refer to the same object.
     * This is only true in strong typed languages, not in C were the following
     * is possible a = *(ir_type1 *)p; b = *(ir_type2 *)p ...
     */

    if (get_irn_op(pred) == op_Store && get_Store_ptr(pred) == ptr &&
        get_irn_mode(get_Store_value(pred)) == load_mode) {
      /*
       * a Load immediately after a Store -- a read after write.
       * We may remove the Load, if both Load & Store does not have an exception handler
       * OR they are in the same block. In the latter case the Load cannot
       * throw an exception when the previous Store was quiet.
       *
       * Why we need to check for Store Exception? If the Store cannot
       * be executed (ROM) the exception handler might simply jump into
       * the load block :-(
       * We could make it a little bit better if we would know that the exception
       * handler of the Store jumps directly to the end...
       */
      if ((!pred_info->projs[pn_Store_X_except] && !info->projs[pn_Load_X_except]) ||
          get_nodes_block(load) == get_nodes_block(pred)) {
        ir_node *value = get_Store_value(pred);

        DBG_OPT_RAW(load, value);
        if (info->projs[pn_Load_M])
          exchange(info->projs[pn_Load_M], mem);

        /* no exception */
        if (info->projs[pn_Load_X_except]) {
          exchange( info->projs[pn_Load_X_except], new_Bad());
          res |= CF_CHANGED;
        }

        if (info->projs[pn_Load_res])
          exchange(info->projs[pn_Load_res], value);

        return res | DF_CHANGED;
      }
    }
    else if (get_irn_op(pred) == op_Load && get_Load_ptr(pred) == ptr &&
             get_Load_mode(pred) == load_mode) {
      /*
       * a Load after a Load -- a read after read.
       * We may remove the second Load, if it does not have an exception handler
       * OR they are in the same block. In the later case the Load cannot
       * throw an exception when the previous Load was quiet.
       *
       * Here, there is no need to check if the previous Load has an exception
       * hander because they would have exact the same exception...
       */
      if (! info->projs[pn_Load_X_except] || get_nodes_block(load) == get_nodes_block(pred)) {
        DBG_OPT_RAR(load, pred);

        if (pred_info->projs[pn_Load_res]) {
          /* we need a data proj from the previous load for this optimization */
          if (info->projs[pn_Load_res])
            exchange(info->projs[pn_Load_res], pred_info->projs[pn_Load_res]);

          if (info->projs[pn_Load_M])
            exchange(info->projs[pn_Load_M], mem);
        }
        else {
          if (info->projs[pn_Load_res]) {
            set_Proj_pred(info->projs[pn_Load_res], pred);
            set_nodes_block(info->projs[pn_Load_res], get_nodes_block(pred));
            pred_info->projs[pn_Load_res] = info->projs[pn_Load_res];
          }
          if (info->projs[pn_Load_M]) {
            /* Actually, this if should not be necessary.  Construct the Loads
               properly!!! */
            exchange(info->projs[pn_Load_M], mem);
          }
        }

        /* no exception */
        if (info->projs[pn_Load_X_except]) {
          exchange(info->projs[pn_Load_X_except], new_Bad());
          res |= CF_CHANGED;
        }

        return res |= DF_CHANGED;
      }
    }

    /* follow only Load chains */
    if (get_irn_op(pred) != op_Load)
      break;

    /* check for cycles */
    if (NODE_VISITED(pred_info))
      break;
    MARK_NODE(pred_info);
  }

  if (get_irn_op(pred) == op_Sync) {
    int i;

    /* handle all Sync predecessors */
    for (i = get_Sync_n_preds(pred) - 1; i >= 0; --i) {
      res |= follow_Load_chain(load, skip_Proj(get_Sync_pred(pred, i)));
      if (res)
        break;
    }
  }

  return res;
}

Michael Beck's avatar
Michael Beck committed
527
528
529
/**
 * optimize a Load
 */
530
static unsigned optimize_load(ir_node *load)
Michael Beck's avatar
Michael Beck committed
531
532
533
{
  ldst_info_t *info = get_irn_link(load);
  ir_mode *load_mode = get_Load_mode(load);
Michael Beck's avatar
Michael Beck committed
534
  ir_node *mem, *ptr, *new_node;
Michael Beck's avatar
Michael Beck committed
535
  entity *ent;
536
  unsigned res = 0;
Michael Beck's avatar
Michael Beck committed
537

Michael Beck's avatar
Michael Beck committed
538
539
540
541
  /* do NOT touch volatile loads for now */
  if (get_Load_volatility(load) == volatility_is_volatile)
    return 0;

542
543
544
545
  /* the address of the load to be optimized */
  ptr = get_Load_ptr(load);

  /*
Michael Beck's avatar
Michael Beck committed
546
547
548
   * Check if we can remove the exception from a Load:
   * This can be done, if the address is from an Sel(Alloc) and
   * the Sel type is a subtype of the allocated type.
549
550
551
552
553
   *
   * This optimizes some often used OO constructs,
   * like x = new O; x->t;
   */
  if (info->projs[pn_Load_X_except]) {
Michael Beck's avatar
Michael Beck committed
554
    if (is_Sel(ptr)) {
555
556
      ir_node *mem = get_Sel_mem(ptr);

Götz Lindenmaier's avatar
Götz Lindenmaier committed
557
      if (get_irn_op(skip_Proj(mem)) == op_Alloc) {
558
        /* ok, check the types */
559
560
561
        entity  *ent    = get_Sel_entity(ptr);
        ir_type *s_type = get_entity_type(ent);
        ir_type *a_type = get_Alloc_type(mem);
562

563
        if (is_SubClass_of(s_type, a_type)) {
564
          /* ok, condition met: there can't be an exception because
Michael Beck's avatar
Michael Beck committed
565
           * Alloc guarantees that enough memory was allocated */
566
567
568

          exchange(info->projs[pn_Load_X_except], new_Bad());
          info->projs[pn_Load_X_except] = NULL;
569
          res |= CF_CHANGED;
570
571
572
        }
      }
    }
573
574
    else if ((get_irn_op(skip_Proj(ptr)) == op_Alloc) ||
	     ((get_irn_op(ptr) == op_Cast) && (get_irn_op(skip_Proj(get_Cast_op(ptr))) == op_Alloc))) {
575
576
577
578
579
580
581
      /* simple case: a direct load after an Alloc. Firm Alloc throw
       * an exception in case of out-of-memory. So, there is no way for an
       * exception in this load.
       * This code is constructed by the "exception lowering" in the Jack compiler.
       */
       exchange(info->projs[pn_Load_X_except], new_Bad());
       info->projs[pn_Load_X_except] = NULL;
582
       res |= CF_CHANGED;
583
584
585
    }
  }

Michael Beck's avatar
Michael Beck committed
586
587
  /* the mem of the Load. Must still be returned after optimization */
  mem  = get_Load_mem(load);
Michael Beck's avatar
Michael Beck committed
588
589
590
591

  if (! info->projs[pn_Load_res] && ! info->projs[pn_Load_X_except]) {
    /* a Load which value is neither used nor exception checked, remove it */
    exchange(info->projs[pn_Load_M], mem);
592

593
    return res | DF_CHANGED;
Michael Beck's avatar
Michael Beck committed
594
  }
Michael Beck's avatar
Michael Beck committed
595

596
  /* Load from a constant polymorphic field, where we can resolve
Michael Beck's avatar
Michael Beck committed
597
     polymorphism. */
Michael Beck's avatar
Michael Beck committed
598
  new_node = transform_node_Load(load);
599
600
601
602
603
604
605
606
607
608
609
  if (new_node != load) {
    if (info->projs[pn_Load_M]) {
      exchange(info->projs[pn_Load_M], mem);
      info->projs[pn_Load_M] = NULL;
    }
    if (info->projs[pn_Load_X_except]) {
      exchange(info->projs[pn_Load_X_except], new_Bad());
      info->projs[pn_Load_X_except] = NULL;
    }
    if (info->projs[pn_Load_res])
      exchange(info->projs[pn_Load_res], new_node);
610
    return res | DF_CHANGED;
611
612
  }

Michael Beck's avatar
Michael Beck committed
613
614
615
  /* check if we can determine the entity that will be loaded */
  ent = find_constant_entity(ptr);
  if (ent) {
616
617
618
619
620
621
622
623
624
    if ((allocation_static == get_entity_allocation(ent)) &&
        (visibility_external_allocated != get_entity_visibility(ent))) {
      /* a static allocation that is not external: there should be NO exception
       * when loading. */

      /* no exception, clear the info field as it might be checked later again */
      if (info->projs[pn_Load_X_except]) {
        exchange(info->projs[pn_Load_X_except], new_Bad());
        info->projs[pn_Load_X_except] = NULL;
625
        res |= CF_CHANGED;
626
627
      }

Götz Lindenmaier's avatar
bugfix    
Götz Lindenmaier committed
628
      if (variability_constant == get_entity_variability(ent)
Michael Beck's avatar
Michael Beck committed
629
630
631
632
633
	        && is_atomic_entity(ent)) {
        /* Might not be atomic after
           lowering of Sels.  In this
           case we could also load, but
           it's more complicated. */
634
635
636
637
638
        /* more simpler case: we load the content of a constant value:
         * replace it by the constant itself
         */

        /* no memory */
Michael Beck's avatar
Michael Beck committed
639
        if (info->projs[pn_Load_M]) {
640
          exchange(info->projs[pn_Load_M], mem);
641
          res |= DF_CHANGED;
Michael Beck's avatar
Michael Beck committed
642
        }
643
644

        /* no result :-) */
Michael Beck's avatar
Michael Beck committed
645
646
        if (info->projs[pn_Load_res]) {
          if (is_atomic_entity(ent)) {
647
            ir_node *c = copy_const_value(get_irn_dbg_info(load), get_atomic_ent_value(ent));
648

Michael Beck's avatar
Michael Beck committed
649
650
            DBG_OPT_RC(load, c);
            exchange(info->projs[pn_Load_res], c);
651
            return DF_CHANGED | res;
Michael Beck's avatar
Michael Beck committed
652
653
654
655
          }
        }
      }
      else if (variability_constant == get_entity_variability(ent)) {
Michael Beck's avatar
Michael Beck committed
656
657
        compound_graph_path *path = get_accessed_path(ptr);

Michael Beck's avatar
Michael Beck committed
658
659
660
661
        if (path) {
          ir_node *c;

          assert(is_proper_compound_graph_path(path, get_compound_graph_path_length(path)-1));
Götz Lindenmaier's avatar
Götz Lindenmaier committed
662
          /*
Michael Beck's avatar
Michael Beck committed
663
664
665
666
667
668
669
670
671
672
          {
            int j;
            for (j = 0; j < get_compound_graph_path_length(path); ++j) {
              entity *node = get_compound_graph_path_node(path, j);
              fprintf(stdout, ".%s", get_entity_name(node));
              if (is_Array_type(get_entity_owner(node)))
                      fprintf(stdout, "[%d]", get_compound_graph_path_array_index(path, j));
            }
            printf("\n");
          }
Michael Beck's avatar
Michael Beck committed
673
674
675
676
          */

          c = get_compound_ent_value_by_path(ent, path);
          free_compound_graph_path(path);
677

Michael Beck's avatar
Michael Beck committed
678
679
680
681
          /* printf("  cons: "); DDMN(c); */

          if (info->projs[pn_Load_M]) {
            exchange(info->projs[pn_Load_M], mem);
682
            res |= DF_CHANGED;
Michael Beck's avatar
Michael Beck committed
683
684
          }
          if (info->projs[pn_Load_res]) {
685
            exchange(info->projs[pn_Load_res], copy_const_value(get_irn_dbg_info(load), c));
686
            return res | DF_CHANGED;
Michael Beck's avatar
Michael Beck committed
687
688
689
690
691
692
693
694
695
696
697
698
699
          }
        }
        else {
          /*  We can not determine a correct access path.  E.g., in jack, we load
	            a byte from an object to generate an exception.   Happens in test program
	            Reflectiontest.
          printf(">>>>>>>>>>>>> Found access to constant entity %s in function %s\n", get_entity_name(ent),
           get_entity_name(get_irg_entity(current_ir_graph)));
          printf("  load: "); DDMN(load);
          printf("  ptr:  "); DDMN(ptr);
          */
        }
      }
700
701
702
    }
  }

703
704
705
  /* Check, if the address of this load is used more than once.
   * If not, this load cannot be removed in any case. */
  if (get_irn_out_n(ptr) <= 1)
Michael Beck's avatar
Michael Beck committed
706
    return res;
707

708
709
710
711
712
713
  /*
   * follow the memory chain as long as there are only Loads
   * and try to replace current Load or Store by a previous one.
   * Note that in unreachable loops it might happen that we reach
   * load again, as well as we can fall into a cycle.
   * We break such cycles using a special visited flag.
Michael Beck's avatar
Michael Beck committed
714
   */
715
  INC_MASTER();
Michael Beck's avatar
Michael Beck committed
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
  res = follow_Load_chain(load, skip_Proj(mem));
  return res;
}

/**
 * follow the memory chain as long as there are only Loads.
 *
 * INC_MASTER() must be called before dive into
 */
static unsigned follow_Load_chain_for_Store(ir_node *store, ir_node *curr) {
  unsigned res = 0;
  ldst_info_t *info = get_irn_link(store);
  ir_node *pred;
  ir_node *ptr = get_Store_ptr(store);
  ir_node *mem = get_Store_mem(store);
  ir_node *value = get_Store_value(store);
  ir_mode *mode  = get_irn_mode(value);
  ir_node *block = get_nodes_block(store);

  for (pred = curr; pred != store; pred = skip_Proj(get_Load_mem(pred))) {
Michael Beck's avatar
Michael Beck committed
736
    ldst_info_t *pred_info = get_irn_link(pred);
737

Michael Beck's avatar
Michael Beck committed
738
    /*
739
740
     * BEWARE: one might think that checking the modes is useless, because
     * if the pointers are identical, they refer to the same object.
Michael Beck's avatar
Michael Beck committed
741
742
     * This is only true in strong typed languages, not is C were the following
     * is possible *(ir_type1 *)p = a; *(ir_type2 *)p = b ...
Michael Beck's avatar
Michael Beck committed
743
     */
744
    if (get_irn_op(pred) == op_Store && get_Store_ptr(pred) == ptr &&
Michael Beck's avatar
Michael Beck committed
745
        get_nodes_block(pred) == block && get_irn_mode(get_Store_value(pred)) == mode) {
746
      /*
Michael Beck's avatar
Michael Beck committed
747
748
       * a Store after a Store in the same block -- a write after write.
       * We may remove the first Store, if it does not have an exception handler.
749
       *
Michael Beck's avatar
Michael Beck committed
750
       * TODO: What, if both have the same exception handler ???
751
       */
Michael Beck's avatar
Michael Beck committed
752
753
754
755
      if (get_Store_volatility(pred) != volatility_is_volatile && !pred_info->projs[pn_Store_X_except]) {
        DBG_OPT_WAW(pred, store);
        exchange( pred_info->projs[pn_Store_M], get_Store_mem(pred) );
        return DF_CHANGED;
Michael Beck's avatar
Michael Beck committed
756
      }
757
758
    }
    else if (get_irn_op(pred) == op_Load && get_Load_ptr(pred) == ptr &&
Michael Beck's avatar
Michael Beck committed
759
             value == pred_info->projs[pn_Load_res]) {
760
      /*
Michael Beck's avatar
Michael Beck committed
761
762
       * a Store of a value after a Load -- a write after read.
       * We may remove the second Store, if it does not have an exception handler.
763
       */
Michael Beck's avatar
Michael Beck committed
764
765
766
767
      if (! info->projs[pn_Store_X_except]) {
        DBG_OPT_WAR(store, pred);
        exchange( info->projs[pn_Store_M], mem );
        return DF_CHANGED;
Michael Beck's avatar
Michael Beck committed
768
769
      }
    }
770

771
    /* follow only Load chains */
772
773
    if (get_irn_op(pred) != op_Load)
      break;
774
775

    /* check for cycles */
Michael Beck's avatar
Michael Beck committed
776
    if (NODE_VISITED(pred_info))
777
      break;
Michael Beck's avatar
Michael Beck committed
778
    MARK_NODE(pred_info);
779
  }
Michael Beck's avatar
Michael Beck committed
780
781
782
783
784
785
786
787
788
789
790

  if (get_irn_op(pred) == op_Sync) {
    int i;

    /* handle all Sync predecessors */
    for (i = get_Sync_n_preds(pred) - 1; i >= 0; --i) {
      res |= follow_Load_chain_for_Store(store, skip_Proj(get_Sync_pred(pred, i)));
      if (res)
        break;
    }
  }
Michael Beck's avatar
Michael Beck committed
791
792
793
794
795
796
  return res;
}

/**
 * optimize a Store
 */
797
static unsigned optimize_store(ir_node *store)
Michael Beck's avatar
Michael Beck committed
798
799
{
  ldst_info_t *info = get_irn_link(store);
Michael Beck's avatar
Michael Beck committed
800
  ir_node *ptr, *mem;
Michael Beck's avatar
Michael Beck committed
801
802
803
804

  if (get_Store_volatility(store) == volatility_is_volatile)
    return 0;

Michael Beck's avatar
Michael Beck committed
805
  ptr = get_Store_ptr(store);
806
807
808
809
810
811

  /* Check, if the address of this load is used more than once.
   * If not, this load cannot be removed in any case. */
  if (get_irn_out_n(ptr) <= 1)
    return 0;

Michael Beck's avatar
Michael Beck committed
812
  mem = get_Store_mem(store);
Michael Beck's avatar
Michael Beck committed
813

814
  /* follow the memory chain as long as there are only Loads */
815
  INC_MASTER();
Michael Beck's avatar
Michael Beck committed
816
  return follow_Load_chain_for_Store(store, skip_Proj(mem));
Michael Beck's avatar
Michael Beck committed
817
818
}

Michael Beck's avatar
Michael Beck committed
819
/**
820
 * walker, optimizes Phi after Stores to identical places:
Michael Beck's avatar
Michael Beck committed
821
 * Does the following optimization:
822
 * @verbatim
Michael Beck's avatar
Michael Beck committed
823
824
825
826
 *
 *   val1   val2   val3          val1  val2  val3
 *    |      |      |               \    |    /
 *   Str    Str    Str               \   |   /
827
 *      \    |    /                   PhiData
Michael Beck's avatar
Michael Beck committed
828
829
 *       \   |   /                       |
 *        \  |  /                       Str
830
 *          PhiM
Michael Beck's avatar
Michael Beck committed
831
 *
832
 * @endverbatim
833
834
 * This reduces the number of stores and allows for predicated execution.
 * Moves Stores back to the end of a function which may be bad.
Michael Beck's avatar
Michael Beck committed
835
 *
836
 * This is only possible if the predecessor blocks have only one successor.
Michael Beck's avatar
Michael Beck committed
837
 */
838
static unsigned optimize_phi(ir_node *phi, void *env)
Michael Beck's avatar
Michael Beck committed
839
{
840
  walk_env_t *wenv = env;
Michael Beck's avatar
Michael Beck committed
841
  int i, n;
842
  ir_node *store, *old_store, *ptr, *block, *phiM, *phiD, *exc, *projM;
Michael Beck's avatar
Michael Beck committed
843
844
845
846
847
  ir_mode *mode;
  ir_node **inM, **inD;
  int *idx;
  dbg_info *db = NULL;
  ldst_info_t *info;
848
  block_info_t *bl_info;
849
  unsigned res = 0;
Michael Beck's avatar
Michael Beck committed
850
851
852
853
854
855
856
857
858
859

  /* Must be a memory Phi */
  if (get_irn_mode(phi) != mode_M)
    return 0;

  n = get_Phi_n_preds(phi);
  if (n <= 0)
    return 0;

  store = skip_Proj(get_Phi_pred(phi, 0));
860
  old_store = store;
Michael Beck's avatar
Michael Beck committed
861
862
863
  if (get_irn_op(store) != op_Store)
    return 0;

864
865
  /* abort on dead blocks */
  if (is_Block_dead(get_nodes_block(store)))
866
867
    return 0;

868
  /* check if the block has only one successor */
869
870
871
872
  bl_info = get_irn_link(get_nodes_block(store));
  if (bl_info->flags)
    return 0;

Michael Beck's avatar
Michael Beck committed
873
874
875
876
877
878
879
880
881
882
883
884
  /* this is the address of the store */
  ptr  = get_Store_ptr(store);
  mode = get_irn_mode(get_Store_value(store));
  info = get_irn_link(store);
  exc  = info->exc_block;

  for (i = 1; i < n; ++i) {
    ir_node *pred = skip_Proj(get_Phi_pred(phi, i));

    if (get_irn_op(pred) != op_Store)
      return 0;

885
    if (ptr != get_Store_ptr(pred) || mode != get_irn_mode(get_Store_value(pred)))
Michael Beck's avatar
Michael Beck committed
886
887
888
889
890
891
892
      return 0;

    info = get_irn_link(pred);

    /* check, if all stores have the same exception flow */
    if (exc != info->exc_block)
      return 0;
893

894
895
    /* abort on dead blocks */
    if (is_Block_dead(get_nodes_block(store)))
896
897
      return 0;

898
    /* check if the block has only one successor */
899
900
901
    bl_info = get_irn_link(get_nodes_block(store));
    if (bl_info->flags)
      return 0;
Michael Beck's avatar
Michael Beck committed
902
903
904
905
  }

  /*
   * ok, when we are here, we found all predecessors of a Phi that
906
907
908
   * are Stores to the same address and size. That means whatever
   * we do before we enter the block of the Phi, we do a Store.
   * So, we can move the Store to the current block:
Michael Beck's avatar
Michael Beck committed
909
910
911
912
   *
   *   val1    val2    val3          val1  val2  val3
   *    |       |       |               \    |    /
   * | Str | | Str | | Str |             \   |   /
913
   *      \     |     /                   PhiData
Michael Beck's avatar
Michael Beck committed
914
915
   *       \    |    /                       |
   *        \   |   /                       Str
916
   *           PhiM
Michael Beck's avatar
Michael Beck committed
917
   *
918
   * Is only allowed if the predecessor blocks have only one successor.
Michael Beck's avatar
Michael Beck committed
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
   */

  /* first step: collect all inputs */
  NEW_ARR_A(ir_node *, inM, n);
  NEW_ARR_A(ir_node *, inD, n);
  NEW_ARR_A(int, idx, n);

  for (i = 0; i < n; ++i) {
    ir_node *pred = skip_Proj(get_Phi_pred(phi, i));
    info = get_irn_link(pred);

    inM[i] = get_Store_mem(pred);
    inD[i] = get_Store_value(pred);
    idx[i] = info->exc_idx;
  }
  block = get_nodes_block(phi);

  /* second step: create a new memory Phi */
  phiM = new_rd_Phi(get_irn_dbg_info(phi), current_ir_graph, block, n, inM, mode_M);

  /* third step: create a new data Phi */
  phiD = new_rd_Phi(get_irn_dbg_info(phi), current_ir_graph, block, n, inD, mode);

  /* fourth step: create the Store */
  store = new_rd_Store(db, current_ir_graph, block, phiM, ptr, phiD);
944
945
946
947
#ifdef DO_CACHEOPT
  co_set_irn_name(store, co_get_irn_ident(old_store));
#endif

948
949
950
951
  projM = new_rd_Proj(NULL, current_ir_graph, block, store, mode_M, pn_Store_M);

  info = get_ldst_info(store, wenv);
  info->projs[pn_Store_M] = projM;
Michael Beck's avatar
Michael Beck committed
952
953
954
955
956

  /* fifths step: repair exception flow */
  if (exc) {
    ir_node *projX = new_rd_Proj(NULL, current_ir_graph, block, store, mode_X, pn_Store_X_except);

957
958
959
960
    info->projs[pn_Store_X_except] = projX;
    info->exc_block                = exc;
    info->exc_idx                  = idx[0];

Michael Beck's avatar
Michael Beck committed
961
962
963
964
965
966
967
    for (i = 0; i < n; ++i) {
      set_Block_cfgpred(exc, idx[i], projX);
    }

    if (n > 1) {
      /* the exception block should be optimized as some inputs are identical now */
    }
968
969

    res |= CF_CHANGED;
Michael Beck's avatar
Michael Beck committed
970
971
  }

972
  /* sixth step: replace old Phi */
973
  exchange(phi, projM);
Michael Beck's avatar
Michael Beck committed
974

975
  return res | DF_CHANGED;
Michael Beck's avatar
Michael Beck committed
976
977
}

Michael Beck's avatar
Michael Beck committed
978
/**
Michael Beck's avatar
Michael Beck committed
979
 * walker, do the optimizations
Michael Beck's avatar
Michael Beck committed
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
 */
static void do_load_store_optimize(ir_node *n, void *env)
{
  walk_env_t *wenv = env;

  switch (get_irn_opcode(n)) {

  case iro_Load:
    wenv->changes |= optimize_load(n);
    break;

  case iro_Store:
    wenv->changes |= optimize_store(n);
    break;

995
996
  case iro_Phi:
    wenv->changes |= optimize_phi(n, env);
Michael Beck's avatar
Michael Beck committed
997

Michael Beck's avatar
Michael Beck committed
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
  default:
    ;
  }
}

/*
 * do the load store optimization
 */
void optimize_load_store(ir_graph *irg)
{
  walk_env_t env;

  assert(get_irg_phase_state(irg) != phase_building);
1011
1012
  assert(get_irg_pinned(irg) != op_pin_state_floats &&
    "LoadStore optimization needs pinned graph");
Michael Beck's avatar
Michael Beck committed
1013

1014
  if (! get_opt_redundant_loadstore())
Michael Beck's avatar
Michael Beck committed
1015
1016
1017
1018
1019
1020
    return;

  obstack_init(&env.obst);
  env.changes = 0;

  /* init the links, then collect Loads/Stores/Proj's in lists */
1021
  master_visited = 0;
1022
  irg_walk_graph(irg, firm_clear_link, collect_nodes, &env);
Michael Beck's avatar
Michael Beck committed
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032

  /* now we have collected enough information, optimize */
  irg_walk_graph(irg, NULL, do_load_store_optimize, &env);

  obstack_free(&env.obst, NULL);

  /* Handle graph state */
  if (env.changes) {
    if (get_irg_outs_state(current_ir_graph) == outs_consistent)
      set_irg_outs_inconsistent(current_ir_graph);
1033
  }
Michael Beck's avatar
Michael Beck committed
1034

1035
1036
  if (env.changes & CF_CHANGED) {
    /* is this really needed: Yes, control flow changed, block might get Bad. */
1037
    set_irg_doms_inconsistent(current_ir_graph);
Michael Beck's avatar
Michael Beck committed
1038
1039
  }
}