irnode.c 42.9 KB
Newer Older
Christian Schäfer's avatar
Christian Schäfer committed
1
2
3
4
/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
** All rights reserved.
**
** Authors: Martin Trapp, Christian Schaefer, Goetz Lindenmaier
Götz Lindenmaier's avatar
Götz Lindenmaier committed
5
**
Christian Schäfer's avatar
Christian Schäfer committed
6
7
*/

Boris Boesler's avatar
added    
Boris Boesler committed
8
9
10
11
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif

Götz Lindenmaier's avatar
Götz Lindenmaier committed
12
#include "irnode_t.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
13
14
#include "irgraph_t.h"
#include "ident_t.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
15
#include "irmode_t.h"
16
#include "typegmod_t.h"
Christian Schäfer's avatar
Christian Schäfer committed
17
18
#include "array.h"

Götz Lindenmaier's avatar
Götz Lindenmaier committed
19
20
21
22
#ifdef DEBUG_libfirm
#include "irprog.h"
#endif

Götz Lindenmaier's avatar
Götz Lindenmaier committed
23
24
25
26
27
28
/* some constants fixing the positions of nodes predecessors
   in the in array */
#define CALL_PARAM_OFFSET 2
#define SEL_INDEX_OFFSET 2
#define RETURN_RESULT_OFFSET 1  /* mem is not a result */

Christian Schäfer's avatar
Christian Schäfer committed
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
static char *pnc_name_arr [] = {"False", "Eq", "Lt", "Le",
				"Gt", "Ge", "Lg", "Leg", "Uo",
				"Ue", "Ul", "Ule", "Ug", "Uge",
				"Ne", "True" };

inline char *get_pnc_string(int pnc) {
  return pnc_name_arr[pnc];
}


int
get_negated_pnc(int pnc) {
  switch (pnc) {
  case False: return True;  break;
  case Eq:    return Ne;    break;
  case Lt:    return Uge;   break;
  case Le:    return Ug;    break;
  case Gt:    return Ule;   break;
  case Ge:    return Ul;    break;
  case Lg:    return Ue;    break;
  case Leg:   return Uo;    break;
  case Uo:    return Leg;   break;
  case Ue:    return Lg;    break;
  case Ul:    return Ge;    break;
  case Ule:   return Gt;    break;
  case Ug:    return Le;    break;
  case Uge:   return Lt;    break;
  case Ne:    return Eq;    break;
  case True:  return False; break;
  }
  return 99; /* to shut up gcc */
}

static char *pns_name_arr [] = {"initial_exec", "global_store",
				"frame_base", "globals", "args"};

static char *symconst_name_arr [] = {"type_tag", "size", "linkage_ptr_info"};

void
init_irnode (void)
{
}

/* irnode constructor                                             */
/* create a new irnode in irg, with an op, mode, arity and        */
/* some incoming irnodes                                          */
/* this constructor is used in every specified irnode constructor */
inline ir_node *
new_ir_node (ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mode,
	     int arity, ir_node **in)
{
  ir_node *res;
  int node_size = offsetof (ir_node, attr) +  op->attr_size;

  res = (ir_node *) obstack_alloc (irg->obst, node_size);

  res->kind = k_ir_node;
  res->op = op;
  res->mode = mode;
88
  res->visited = 0;
Christian Schäfer's avatar
Christian Schäfer committed
89
90
91
92
93
94
95
96
  res->link = NULL;
  if (arity < 0) {
    res->in = NEW_ARR_F (ir_node *, 1);
  } else {
    res->in = NEW_ARR_D (ir_node *, irg->obst, (arity+1));
    memcpy (&res->in[1], in, sizeof (ir_node *) * arity);
  }
  res->in[0] = block;
Götz Lindenmaier's avatar
Götz Lindenmaier committed
97
98
99
100
101

#ifdef DEBUG_libfirm
  res->node_nr = get_irp_new_node_nr();
#endif

Christian Schäfer's avatar
Christian Schäfer committed
102
103
104
  return res;
}

Götz Lindenmaier's avatar
Götz Lindenmaier committed
105
106
107
108
109
110
111
/* Copies all attributes stored in the old node to the new node.
   Assumes both have the same opcode and sufficient size. */
void
copy_attrs (ir_node *old, ir_node *new) {
  assert (get_irn_opcode(old) == get_irn_opcode(new));
  memcpy (&new->attr, &old->attr, get_op_attr_size(get_irn_op(old)));
}
Christian Schäfer's avatar
Christian Schäfer committed
112
113
114
115
116
117
118
119
120
121
122
123
124

/* IR-Nodes with attributes */
int
ir_node_print (XP_PAR1, const xprintf_info *info ATTRIBUTE((unused)), XP_PARN)
{
  int printed = 0;
  ir_node *np = XP_GETARG (ir_node *, 0);

  if (!np) {
    XPS ("<null ir_node>");
    return printed;
  }

Götz Lindenmaier's avatar
Götz Lindenmaier committed
125
  XPF1 ("%I", get_irn_opident(np));
Christian Schäfer's avatar
Christian Schäfer committed
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149

  switch (get_irn_opcode (np)) {	/* node label */
  case iro_Const:
    XPF1 ("%I", get_irn_mode(np)->name);
    XPS (" : ");
    XPF1 ("%v", get_irn_const_attr);
    break;
  case iro_Proj:
    if (get_irn_modecode (np) == irm_b) {
      XPC (" ");
      XP (pnc_name_arr[get_irn_proj_attr(np)]);
    } else if (get_irn_opcode (get_irn_in (np)[1]) == iro_Start) {
      XPC (" ");
      XP (pns_name_arr[get_irn_proj_attr(np)]);
    } else {
      XPF1 ("%I", get_irn_mode(np)->name);
      XPC (" ");
      XPF1 ("%d", get_irn_proj_attr(np));
    }
    break;
  case iro_SymConst:
    XPF1 ("%I", get_irn_mode(np)->name);
    XPC  (" ");
    XP   (symconst_name_arr[get_irn_symconst_attr(np).num]);
150
    XPF1 (" %#N", get_type_ident(get_SymConst_type(np)));
Christian Schäfer's avatar
Christian Schäfer committed
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
    break;
  case iro_Start:		/* don't dump mode of these */
  case iro_Cond:
  case iro_Block:
  case iro_Call:
  case iro_Jmp:
  case iro_Return:
  case iro_End:
    break;
  default:
    XPF1 ("%I", get_irn_mode(np)->name);
  }

  return printed;
}

/** getting some parameters from ir_nodes **/

/* returns the number of predecessors without the block predecessor. */
inline int
get_irn_arity (ir_node *node)
{
Götz Lindenmaier's avatar
Götz Lindenmaier committed
173
  assert(node);
Christian Schäfer's avatar
Christian Schäfer committed
174
175
176
  return (ARR_LEN((node)->in)-1);
}

177
178
179
180
181
182
/* Returns the array with ins. This array is shifted with respect to the
   array accessed by get_irn_n: The block operand is at position 0 not -1.
   (@@@ This should be changed.)
   The order of the predecessors in this array is not guaranteed, except that
   lists of operands as predecessors of Block or arguments of a Call are
   consecutive. */
Christian Schäfer's avatar
Christian Schäfer committed
183
184
185
186
187
188
189
inline ir_node **
get_irn_in (ir_node *node)
{
  assert (node);
  return ((node)->in);
}

190
191
192
193
194
195
196
197
198
199
200
inline void
set_irn_in (ir_node *node, int arity, ir_node **in) {
  assert(node);
  if (arity != get_irn_arity(node)) {
    ir_node *block = node->in[0];
    node->in = NEW_ARR_D (ir_node *, current_ir_graph->obst, (arity+1));
    node->in[0] = block;
  }
  memcpy (&node->in[1], in, sizeof (ir_node *) * arity);
}

Christian Schäfer's avatar
Christian Schäfer committed
201
202
203
/* to iterate through the predecessors without touching the array */
/* To iterate over the operands iterate from 0 to i < get_irn_arity(),
   to iterate includind the Block predecessor iterate from i = -1 to
204
205
   i < get_irn_arity.
   If it is a block, the entry -1 is NULL. */
Christian Schäfer's avatar
Christian Schäfer committed
206
207
208
209
inline ir_node *
get_irn_n (ir_node *node, int n)
{
  assert (node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
210
  assert (get_irn_arity (node) > n);
Christian Schäfer's avatar
Christian Schäfer committed
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
  return skip_nop(node->in[n+1]);
}

inline void
set_irn_n (ir_node *node, int n, ir_node *in)
{
  assert (node);
  assert (get_irn_arity (node) > n);
  node->in[n+1] = in;
}

inline ir_mode *
get_irn_mode (ir_node *node)
{
  assert (node);
  return node->mode;
}

inline modecode
get_irn_modecode (ir_node *node)
{
  assert (node);
  return node->mode->code;
}

Götz Lindenmaier's avatar
Götz Lindenmaier committed
236
237

inline ident *
Götz Lindenmaier's avatar
Götz Lindenmaier committed
238
get_irn_modeident (ir_node *node)
Götz Lindenmaier's avatar
Götz Lindenmaier committed
239
240
241
242
243
{
  assert(node);
  return node->mode->name;
}

Christian Schäfer's avatar
Christian Schäfer committed
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
inline ir_op *
get_irn_op (ir_node *node)
{
  assert (node);
  return node->op;
}

/* should be private to the library: */
inline void
set_irn_op (ir_node *node, ir_op *op)
{
  assert (node);
  node->op = op;
}

Götz Lindenmaier's avatar
Götz Lindenmaier committed
259
260
inline opcode
get_irn_opcode (ir_node *node)
261
262
{
  assert (node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
263
264
265
  return node->op->code;
}

Götz Lindenmaier's avatar
Götz Lindenmaier committed
266
inline const char *
Götz Lindenmaier's avatar
Götz Lindenmaier committed
267
get_irn_opname (ir_node *node)
Götz Lindenmaier's avatar
Götz Lindenmaier committed
268
269
270
271
272
273
274
{
  assert(node);
  return id_to_str(node->op->name);
}

inline ident *
get_irn_opident (ir_node *node)
Götz Lindenmaier's avatar
Götz Lindenmaier committed
275
276
277
{
  assert(node);
  return node->op->name;
278
279
280
281
282
283
284
285
286
}

inline unsigned long
get_irn_visited (ir_node *node)
{
  assert (node);
  return node->visited;
}

Götz Lindenmaier's avatar
Götz Lindenmaier committed
287
288
inline void
set_irn_visited (ir_node *node, unsigned long visited)
Christian Schäfer's avatar
Christian Schäfer committed
289
290
{
  assert (node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
291
  node->visited = visited;
Christian Schäfer's avatar
Christian Schäfer committed
292
293
294
295
296
297
298
299
300
301
302
303
304
}
inline void
set_irn_link (ir_node *node, ir_node *link) {
  assert (node);
  node->link = link;
}

inline ir_node *
get_irn_link (ir_node *node) {
  assert (node);
  return node->link;
}

Götz Lindenmaier's avatar
Götz Lindenmaier committed
305
306
307
308
309
310
311
312
313
#ifdef DEBUG_libfirm
/* Outputs a unique number for this node */
inline long
get_irn_node_nr(ir_node *node) {
  assert(node);
  return node->node_nr;
}
#endif

Christian Schäfer's avatar
Christian Schäfer committed
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
inline tarval *
get_irn_const_attr (ir_node *node)
{
  assert (node->op == op_Const);
  return node->attr.con;
}

inline long
get_irn_proj_attr (ir_node *node)
{
  assert (node->op == op_Proj);
  return node->attr.proj;
}

inline alloc_attr
get_irn_alloc_attr (ir_node *node)
{
  assert (node->op == op_Alloc);
  return node->attr.a;
}

inline type *
get_irn_free_attr     (ir_node *node)
{
  assert (node->op == op_Free);
339
  return node->attr.f = skip_tid(node->attr.f);
Christian Schäfer's avatar
Christian Schäfer committed
340
341
342
343
344
345
346
347
348
}

inline symconst_attr
get_irn_symconst_attr (ir_node *node)
{
  assert (node->op == op_SymConst);
  return node->attr.i;
}

349
inline type *
Christian Schäfer's avatar
Christian Schäfer committed
350
351
352
get_irn_call_attr (ir_node *node)
{
  assert (node->op == op_Call);
353
  return node->attr.call = skip_tid(node->attr.call);
Christian Schäfer's avatar
Christian Schäfer committed
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
}

inline sel_attr
get_irn_sel_attr (ir_node *node)
{
  assert (node->op == op_Sel);
  return node->attr.s;
}

inline int
get_irn_phi_attr (ir_node *node)
{
  assert (node->op == op_Phi);
  return node->attr.phi0_pos;
}

inline block_attr
get_irn_block_attr (ir_node *node)
{
  assert (node->op == op_Block);
  return node->attr.block;
}

/** manipulate fields of individual nodes **/

/* this works for all except Block */
ir_node *
get_nodes_Block (ir_node *node) {
  assert (!(node->op == op_Block));
  return get_irn_n(node, -1);
}

inline void
set_nodes_Block (ir_node *node, ir_node *block) {
  assert (!(node->op == op_Block));
  set_irn_n(node, -1, block);
}

392
393
394
395
396
397
398
399
/* Returns an array with the predecessors of the Block. Depending on
   the implementation of the graph datastructure this can be a copy of
   the internal representation of predecessors as well as the internal
   array itself. Therefore writing to this array might obstruct the ir. */
inline ir_node **
get_Block_cfgpred_arr (ir_node *node)
{
  assert ((node->op == op_Block));
Götz Lindenmaier's avatar
Götz Lindenmaier committed
400
  return (ir_node **)&(get_irn_in(node)[1]);
401
402
403
}


Christian Schäfer's avatar
Christian Schäfer committed
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
inline int
get_Block_n_cfgpreds (ir_node *node) {
  assert ((node->op == op_Block));
  return (get_irn_arity(node));
}

/*
inline void
set_Block_n_cfgpreds (ir_node *node, int n_preds) {
  assert ((node->op == op_Block));
}
*/

inline ir_node *
get_Block_cfgpred (ir_node *node, int pos) {
  assert (node->op == op_Block);
  return get_irn_n(node, pos);
}

inline void
set_Block_cfgpred (ir_node *node, int pos, ir_node *pred) {
  assert (node->op == op_Block);
  set_irn_n(node, pos, pred);
}

inline bool
get_Block_matured (ir_node *node) {
  assert (node->op == op_Block);
  return node->attr.block.matured;
}

inline void
set_Block_matured (ir_node *node, bool matured) {
  assert (node->op == op_Block);
  node->attr.block.matured = matured;
}
inline unsigned long
441
get_Block_block_visited (ir_node *node) {
Christian Schäfer's avatar
Christian Schäfer committed
442
  assert (node->op == op_Block);
443
  return node->attr.block.block_visited;
Christian Schäfer's avatar
Christian Schäfer committed
444
445
446
}

inline void
447
set_Block_block_visited (ir_node *node, unsigned long visit) {
Christian Schäfer's avatar
Christian Schäfer committed
448
  assert (node->op == op_Block);
449
  node->attr.block.block_visited = visit;
Christian Schäfer's avatar
Christian Schäfer committed
450
451
452
453
454
455
456
457
458
459
460
461
462
}

inline ir_node *
get_Block_graph_arr (ir_node *node, int pos) {
  assert (node->op == op_Block);
  return node->attr.block.graph_arr[pos+1];
}

inline void
set_Block_graph_arr (ir_node *node, int pos, ir_node *value) {
  assert (node->op == op_Block);
  node->attr.block.graph_arr[pos+1] = value;
}
Götz Lindenmaier's avatar
Götz Lindenmaier committed
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
/*
> Implementing the case construct (which is where the constant Proj node is
> important) involves far more than simply determining the constant values.
> We could argue that this is more properly a function of the translator from
> Firm to the target machine.  That could be done if there was some way of
> projecting "default" out of the Cond node.
I know it's complicated.
Basically there are two proglems:
 - determining the gaps between the projs
 - determining the biggest case constant to konw the proj number for
   the default node.
I see several solutions:
1. Introduce a ProjDefault node.  Solves both problems.
   This means to extend all optimizations executed during construction.
2. Give the Cond node for switch two flavors:
   a) there are no gaps in the projs  (existing flavor)
   b) gaps may exist, default proj is still the Proj with the largest
      projection number.  This covers also the gaps.
3. Fix the semantic of the Cond to that of 2b)

Solution 2 seems to be the best:
Computing the gaps in the Firm representation is not too hard, i.e.,
libfirm can implement a routine that transforms betweeen the two
flavours.  This is also possible for 1) but 2) does not require to
change any existing optimization.
Further it should be far simpler to determine the biggest constant than
to compute all gaps.
I don't want to choose 3) as 2a) seems to have advantages for
dataflow analysis and 3) does not allow to convert the representation to
2a).
*/
Christian Schäfer's avatar
Christian Schäfer committed
494
495
496
497
498
499
500
501
502
503
504
505
inline ir_node *
get_Cond_selector (ir_node *node) {
  assert (node->op == op_Cond);
  return get_irn_n(node, 0);
}

inline void
set_Cond_selector (ir_node *node, ir_node *selector) {
  assert (node->op == op_Cond);
  set_irn_n(node, 0, selector);
}

506
507
508
inline cond_kind
get_Cond_kind (ir_node *node) {
  assert (node->op == op_Cond);
509
  return node->attr.c.kind;
510
511
512
513
514
}

inline void
set_Cond_kind (ir_node *node, cond_kind kind) {
  assert (node->op == op_Cond);
515
  node->attr.c.kind = kind;
516
517
}

Christian Schäfer's avatar
Christian Schäfer committed
518
519
inline ir_node *
get_Return_mem (ir_node *node) {
520
  assert (node->op == op_Return);
Christian Schäfer's avatar
Christian Schäfer committed
521
522
523
524
525
526
527
528
529
  return get_irn_n(node, 0);
}

inline void
set_Return_mem (ir_node *node, ir_node *mem) {
  assert (node->op == op_Return);
  set_irn_n(node, 0, mem);
}

530
531
532
533
inline ir_node **
get_Return_res_arr (ir_node *node)
{
  assert ((node->op == op_Return));
Götz Lindenmaier's avatar
Götz Lindenmaier committed
534
  if (get_Return_n_res(node) > 0)
Götz Lindenmaier's avatar
Götz Lindenmaier committed
535
    return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
536
537
  else
    return NULL;
538
539
}

Christian Schäfer's avatar
Christian Schäfer committed
540
541
542
inline int
get_Return_n_res (ir_node *node) {
  assert (node->op == op_Return);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
543
  return (get_irn_arity(node) - RETURN_RESULT_OFFSET);
Christian Schäfer's avatar
Christian Schäfer committed
544
545
546
547
548
549
550
551
552
553
554
555
}

/*
inline void
set_Return_n_res (ir_node *node, int results) {
  assert (node->op == op_Return);
}
*/

inline ir_node *
get_Return_res (ir_node *node, int pos) {
  assert (node->op == op_Return);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
556
  assert (get_Return_n_res(node) > pos);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
557
  return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
Christian Schäfer's avatar
Christian Schäfer committed
558
559
560
561
}

inline void
set_Return_res (ir_node *node, int pos, ir_node *res){
562
  assert (node->op == op_Return);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
563
  set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
Christian Schäfer's avatar
Christian Schäfer committed
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
}

inline ir_node *
get_Raise_mem (ir_node *node) {
  assert (node->op == op_Return);
  return get_irn_n(node, 0);
}

inline void
set_Raise_mem (ir_node *node, ir_node *mem) {
  assert (node->op == op_Raise);
  set_irn_n(node, 0, mem);
}

inline ir_node *
get_Raise_exo_ptr (ir_node *node) {
  assert (node->op == op_Raise);
  return get_irn_n(node, 1);
}

inline void
set_Raise_exo_ptr (ir_node *node, ir_node *exo_ptr) {
  assert (node->op == op_Raise);
  set_irn_n(node, 1, exo_ptr);
}

inline tarval *get_Const_tarval (ir_node *node) {
  assert (node->op == op_Const);
  return get_irn_const_attr(node);
}

inline void
set_Const_tarval (ir_node *node, tarval *con) {
  assert (node->op == op_Const);
  node->attr.con = con;
}

inline symconst_kind
get_SymConst_kind (ir_node *node) {
  assert (node->op == op_SymConst);
  return node->attr.i.num;
}

inline void
set_SymConst_kind (ir_node *node, symconst_kind num) {
  assert (node->op == op_SymConst);
  node->attr.i.num = num;
}

inline type *
get_SymConst_type (ir_node *node) {
  assert (   (node->op == op_SymConst)
          && (   get_SymConst_kind(node) == type_tag
              || get_SymConst_kind(node) == size));
618
  return node->attr.i.tori.typ = skip_tid(node->attr.i.tori.typ);
Christian Schäfer's avatar
Christian Schäfer committed
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
}

inline void
set_SymConst_type (ir_node *node, type *type) {
  assert (   (node->op == op_SymConst)
          && (   get_SymConst_kind(node) == type_tag
              || get_SymConst_kind(node) == size));
  node->attr.i.tori.typ = type;
}

inline ident *
get_SymConst_ptrinfo (ir_node *node) {
  assert (   (node->op == op_SymConst)
          && (get_SymConst_kind(node) == linkage_ptr_info));
  return node->attr.i.tori.ptrinfo;
}

inline void
set_SymConst_ptrinfo (ir_node *node, ident *ptrinfo) {
  assert (   (node->op == op_SymConst)
          && (get_SymConst_kind(node) == linkage_ptr_info));
  node->attr.i.tori.ptrinfo = ptrinfo;
}

Götz Lindenmaier's avatar
Götz Lindenmaier committed
643
644
645
646
647
648
649
650
651
652
653
654
inline type_or_id_p
get_SymConst_type_or_id (ir_node *node) {
  assert (node->op == op_SymConst);
  return &(node->attr.i.tori);
}

inline void
set_SymConst_type_or_id (ir_node *node, type_or_id_p tori) {
  assert (node->op == op_SymConst);
  memcpy (&(node->attr.i.tori), tori, sizeof(type_or_id));
}

Christian Schäfer's avatar
Christian Schäfer committed
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
inline ir_node *
get_Sel_mem (ir_node *node) {
  assert (node->op == op_Sel);
  return get_irn_n(node, 0);
}

inline void
set_Sel_mem (ir_node *node, ir_node *mem) {
  assert (node->op == op_Sel);
  set_irn_n(node, 0, mem);
}

inline ir_node *
get_Sel_ptr (ir_node *node) {
  assert (node->op == op_Sel);
  return get_irn_n(node, 1);
}

inline void
set_Sel_ptr (ir_node *node, ir_node *ptr) {
  assert (node->op == op_Sel);
  set_irn_n(node, 1, ptr);
}

679
680
681
682
inline ir_node **
get_Sel_index_arr (ir_node *node)
{
  assert ((node->op == op_Sel));
Götz Lindenmaier's avatar
Götz Lindenmaier committed
683
  if (get_Sel_n_index(node) > 0)
Götz Lindenmaier's avatar
Götz Lindenmaier committed
684
    return (ir_node **)& get_irn_in(node)[SEL_INDEX_OFFSET + 1];
Götz Lindenmaier's avatar
Götz Lindenmaier committed
685
686
  else
    return NULL;
687
688
}

Christian Schäfer's avatar
Christian Schäfer committed
689
690
691
inline int
get_Sel_n_index (ir_node *node) {
  assert (node->op == op_Sel);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
692
  return (get_irn_arity(node) - SEL_INDEX_OFFSET);
Christian Schäfer's avatar
Christian Schäfer committed
693
694
695
696
697
698
699
700
701
702
703
704
}

/*
inline void
set_Sel_n_index (ir_node *node, int n_index) {
  assert (node->op == op_Sel);
}
*/

inline ir_node *
get_Sel_index (ir_node *node, int pos) {
  assert (node->op == op_Sel);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
705
  return get_irn_n(node, pos + SEL_INDEX_OFFSET);
Christian Schäfer's avatar
Christian Schäfer committed
706
707
708
709
710
}

inline void
set_Sel_index (ir_node *node, int pos, ir_node *index) {
  assert (node->op == op_Sel);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
711
  set_irn_n(node, pos + SEL_INDEX_OFFSET, index);
Christian Schäfer's avatar
Christian Schäfer committed
712
713
714
715
716
717
718
719
720
721
722
723
724
725
}

inline entity *
get_Sel_entity (ir_node *node) {
  assert (node->op == op_Sel);
  return node->attr.s.ent;
}

inline void
set_Sel_entity (ir_node *node, entity *ent) {
  assert (node->op == op_Sel);
  node->attr.s.ent = ent;
}

Götz Lindenmaier's avatar
Götz Lindenmaier committed
726
inline linkage_type
Christian Schäfer's avatar
Christian Schäfer committed
727
728
729
730
731
732
get_Sel_linkage_type (ir_node *node) {
  assert (node->op == op_Sel);
  return node->attr.s.ltyp;
}

inline void
Götz Lindenmaier's avatar
Götz Lindenmaier committed
733
set_Sel_linkage_type (ir_node *node, linkage_type lt) {
Christian Schäfer's avatar
Christian Schäfer committed
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
  assert (node->op == op_Sel);
  node->attr.s.ltyp = lt;
}

inline ir_node *
get_Call_mem (ir_node *node) {
  assert (node->op == op_Call);
  return get_irn_n(node, 0);
}

inline void
set_Call_mem (ir_node *node, ir_node *mem) {
  assert (node->op == op_Call);
  set_irn_n(node, 0, mem);
}

inline ir_node *
get_Call_ptr (ir_node *node) {
  assert (node->op == op_Call);
  return get_irn_n(node, 1);
}

inline void
set_Call_ptr (ir_node *node, ir_node *ptr) {
  assert (node->op == op_Call);
  set_irn_n(node, 1, ptr);
}

762
763
764
inline ir_node **
get_Call_param_arr (ir_node *node) {
  assert (node->op == op_Call);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
765
  return (ir_node **)&get_irn_in(node)[CALL_PARAM_OFFSET + 1];
766
767
}

Christian Schäfer's avatar
Christian Schäfer committed
768
inline int
Götz Lindenmaier's avatar
Götz Lindenmaier committed
769
get_Call_n_params (ir_node *node)  {
Christian Schäfer's avatar
Christian Schäfer committed
770
  assert (node->op == op_Call);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
771
  return (get_irn_arity(node) - CALL_PARAM_OFFSET);
Christian Schäfer's avatar
Christian Schäfer committed
772
773
}

Götz Lindenmaier's avatar
Götz Lindenmaier committed
774
775
776
777
778
inline int
get_Call_arity (ir_node *node) {
  return get_Call_n_params(node);
}

Christian Schäfer's avatar
Christian Schäfer committed
779
780
781
782
783
784
785
786
787
/* inline void
set_Call_arity (ir_node *node, ir_node *arity) {
  assert (node->op == op_Call);
}
*/

inline ir_node *
get_Call_param (ir_node *node, int pos) {
  assert (node->op == op_Call);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
788
  return get_irn_n(node, pos + CALL_PARAM_OFFSET);
Christian Schäfer's avatar
Christian Schäfer committed
789
790
791
792
793
}

inline void
set_Call_param (ir_node *node, int pos, ir_node *param) {
  assert (node->op == op_Call);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
794
  set_irn_n(node, pos + CALL_PARAM_OFFSET, param);
Christian Schäfer's avatar
Christian Schäfer committed
795
796
}

797
inline type *
Christian Schäfer's avatar
Christian Schäfer committed
798
799
get_Call_type (ir_node *node) {
  assert (node->op == op_Call);
800
  return node->attr.call = skip_tid(node->attr.call);
Christian Schäfer's avatar
Christian Schäfer committed
801
802
803
}

inline void
804
set_Call_type (ir_node *node, type *type) {
Christian Schäfer's avatar
Christian Schäfer committed
805
  assert (node->op == op_Call);
806
  assert (is_method_type(type));
Christian Schäfer's avatar
Christian Schäfer committed
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
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
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
  node->attr.call = type;
}

/* For unary and binary arithmetic operations the access to the
   operands can be factored out.  Left is the first, right the
   second arithmetic value  as listed in tech report 0999-33.
   unops are: Minus, Abs, Not, Conv
   binops are: Add, Sub, Mul, Quot, DivMod, Div, Mod, And, Or, Eor, Shl,
   Shr, Shrs, Rotate, Cmp */

int
is_unop (ir_node *node) {
  return ( node->op == op_Minus ||
           node->op == op_Abs  ||
	   node->op == op_Not  ||
           node->op == op_Conv );
}

inline ir_node *
get_unop_op (ir_node *node) {
  assert ( node->op == op_Minus ||
           node->op == op_Abs  ||
	    node->op == op_Not  ||
           node->op == op_Conv );
  switch (get_irn_opcode (node)) {
    case iro_Minus: return get_Minus_op(node); break;
    case iro_Abs:   return get_Abs_op(node);   break;
    case iro_Not:   return get_Not_op(node);   break;
    case iro_Conv:  return get_Conv_op(node);  break;
    default: return NULL;
  }
}

inline void
set_unop_op (ir_node *node, ir_node *op) {
    assert (node->op == op_Minus ||
	    node->op == op_Abs   ||
	    node->op == op_Not   ||
	    node->op == op_Conv    );
    switch (get_irn_opcode (node)) {
    case iro_Minus:   set_Minus_op(node, op); break;
    case iro_Abs:     set_Abs_op(node, op);   break;
    case iro_Not:     set_Not_op(node, op);   break;
    case iro_Conv:    set_Conv_op(node, op);  break;
    default:  ;
    }

}

int
is_binop (ir_node *node) {
  return (node->op == op_Add    ||
          node->op == op_Sub    ||
          node->op == op_Mul    ||
          node->op == op_Quot   ||
          node->op == op_DivMod ||
          node->op == op_Div    ||
          node->op == op_Mod    ||
          node->op == op_And    ||
          node->op == op_Or     ||
          node->op == op_Eor    ||
          node->op == op_Shl    ||
          node->op == op_Shr    ||
          node->op == op_Shrs   ||
	  node->op == op_Rot    ||
          node->op == op_Cmp      );
}

inline ir_node *
get_binop_left (ir_node *node) {
  assert (node->op == op_Add    ||
          node->op == op_Sub    ||
          node->op == op_Mul    ||
          node->op == op_Quot   ||
          node->op == op_DivMod ||
          node->op == op_Div    ||
          node->op == op_Mod    ||
          node->op == op_And    ||
          node->op == op_Or     ||
          node->op == op_Eor    ||
          node->op == op_Shl    ||
          node->op == op_Shr    ||
          node->op == op_Shrs   ||
	  node->op == op_Rot    ||
          node->op == op_Cmp      );

    switch (get_irn_opcode (node)) {
      case iro_Add   :     return get_Add_left(node);  break;
      case iro_Sub   :     return get_Sub_left(node);  break;
      case iro_Mul   :     return get_Mul_left(node);  break;
      case iro_Quot  :     return get_Quot_left(node); break;
      case iro_DivMod:     return get_DivMod_left(node);  break;
      case iro_Div   :     return get_Div_left(node);  break;
      case iro_Mod   :     return get_Mod_left(node);  break;
      case iro_And   :     return get_And_left(node);  break;
      case iro_Or    :     return get_Or_left(node);   break;
      case iro_Eor   :     return get_Eor_left(node);  break;
      case iro_Shl   :     return get_Shl_left(node);  break;
      case iro_Shr   :     return get_Shr_left(node);  break;
      case iro_Shrs  :     return get_Shrs_left(node); break;
      case iro_Rot   :     return get_Rot_left(node);  break;
      case iro_Cmp   :     return get_Cmp_left(node);  break;
    default:  return NULL;
  };
}

inline void
set_binop_left (ir_node *node, ir_node *left) {
  assert (node->op == op_Add    ||
          node->op == op_Sub    ||
          node->op == op_Mul    ||
          node->op == op_Quot   ||
          node->op == op_DivMod ||
          node->op == op_Div    ||
          node->op == op_Mod    ||
          node->op == op_And    ||
          node->op == op_Or     ||
          node->op == op_Eor    ||
          node->op == op_Shl    ||
          node->op == op_Shr    ||
	  node->op == op_Shrs   ||
	  node->op == op_Rot    ||
          node->op == op_Cmp      );

    switch (get_irn_opcode (node)) {
      case iro_Add   :     set_Add_left(node, left);  break;
      case iro_Sub   :     set_Sub_left(node, left);  break;
      case iro_Mul   :     set_Mul_left(node, left);  break;
      case iro_Quot  :     set_Quot_left(node, left); break;
      case iro_DivMod:     set_DivMod_left(node, left);  break;
      case iro_Div   :     set_Div_left(node, left);  break;
      case iro_Mod   :     set_Mod_left(node, left);  break;
      case iro_And   :     set_And_left(node, left);  break;
      case iro_Or    :     set_Or_left(node, left);   break;
      case iro_Eor   :     set_Eor_left(node, left);  break;
      case iro_Shl   :     set_Shl_left(node, left);  break;
      case iro_Shr   :     set_Shr_left(node, left);  break;
      case iro_Shrs  :     set_Shrs_left(node, left); break;
      case iro_Rot   :     set_Rot_left(node, left);  break;
      case iro_Cmp   :     set_Cmp_left(node, left);  break;
    default:  ;
  };
}

inline ir_node *
get_binop_right (ir_node *node) {
  assert (node->op == op_Add    ||
          node->op == op_Sub    ||
          node->op == op_Mul    ||
          node->op == op_Quot   ||
          node->op == op_DivMod ||
          node->op == op_Div    ||
          node->op == op_Mod    ||
          node->op == op_And    ||
          node->op == op_Or     ||
          node->op == op_Eor    ||
          node->op == op_Shl    ||
          node->op == op_Shr    ||
          node->op == op_Shrs   ||
          node->op == op_Rot    ||
          node->op == op_Cmp      );

    switch (get_irn_opcode (node)) {
      case iro_Add   :     return get_Add_right(node);  break;
      case iro_Sub   :     return get_Sub_right(node);  break;
      case iro_Mul   :     return get_Mul_right(node);  break;
      case iro_Quot  :     return get_Quot_right(node); break;
      case iro_DivMod:     return get_DivMod_right(node);  break;
      case iro_Div   :     return get_Div_right(node);  break;
      case iro_Mod   :     return get_Mod_right(node);  break;
      case iro_And   :     return get_And_right(node);  break;
      case iro_Or    :     return get_Or_right(node);   break;
      case iro_Eor   :     return get_Eor_right(node);  break;
      case iro_Shl   :     return get_Shl_right(node);  break;
      case iro_Shr   :     return get_Shr_right(node);  break;
      case iro_Shrs  :     return get_Shrs_right(node); break;
      case iro_Rot   :     return get_Rot_right(node);  break;
      case iro_Cmp   :     return get_Cmp_right(node);  break;
    default:  return NULL;
  };
}

inline void
set_binop_right (ir_node *node, ir_node *right) {
  assert (node->op == op_Add    ||
          node->op == op_Sub    ||
          node->op == op_Mul    ||
          node->op == op_Quot   ||
          node->op == op_DivMod ||
          node->op == op_Div    ||
          node->op == op_Mod    ||
          node->op == op_And    ||
          node->op == op_Or     ||
          node->op == op_Eor    ||