projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
removed old unused files
[libfirm]
/
ir
/
be
/
benode.c
diff --git
a/ir/be/benode.c
b/ir/be/benode.c
index
70cd604
..
79739b7
100644
(file)
--- a/
ir/be/benode.c
+++ b/
ir/be/benode.c
@@
-5,7
+5,7
@@
*
* Backend node support.
*
*
* Backend node support.
*
- * This file prov
di
es Perm, Copy, Spill and Reload nodes.
+ * This file prov
id
es Perm, Copy, Spill and Reload nodes.
*
* Copyright (C) 2005 Universitaet Karlsruhe
* Released under the GPL
*
* Copyright (C) 2005 Universitaet Karlsruhe
* Released under the GPL
@@
-92,7
+92,7
@@
typedef struct {
typedef struct {
be_node_attr_t node_attr;
int offset; /**< The offset by which the stack shall be increased/decreased. */
typedef struct {
be_node_attr_t node_attr;
int offset; /**< The offset by which the stack shall be increased/decreased. */
- be_stack_dir_t dir; /**< The direction in which the stack shall be modified (
along or in the other direction
). */
+ be_stack_dir_t dir; /**< The direction in which the stack shall be modified (
expand or shrink
). */
} be_stack_attr_t;
typedef struct {
} be_stack_attr_t;
typedef struct {
@@
-344,7
+344,7
@@
ir_node *be_new_Call(ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_n
ir_node *irn;
ir_node **real_in;
ir_node *irn;
ir_node **real_in;
- real_in = malloc(sizeof(real_in[0]) * (real_n));
+ real_in =
x
malloc(sizeof(real_in[0]) * (real_n));
real_in[0] = mem;
real_in[1] = sp;
real_in[0] = mem;
real_in[1] = sp;
@@
-370,9
+370,9
@@
void be_Call_set_entity(ir_node *call, entity *ent)
a->ent = ent;
}
a->ent = ent;
}
-ir_node *be_new_Return(ir_graph *irg, ir_node *bl, int n, ir_node *in[])
+ir_node *be_new_Return(
dbg_info *dbg,
ir_graph *irg, ir_node *bl, int n, ir_node *in[])
{
{
- ir_node *irn = new_ir_node(
NULL
, irg, bl, op_be_Return, mode_X, n, in);
+ ir_node *irn = new_ir_node(
dbg
, irg, bl, op_be_Return, mode_X, n, in);
init_node_attr(irn, n);
return irn;
init_node_attr(irn, n);
return irn;
@@
-531,7
+531,7
@@
ir_node *be_new_CopyKeep(const arch_register_class_t *cls, ir_graph *irg, ir_nod
in[0] = src;
memcpy(&in[1], in_keep, n * sizeof(in[0]));
irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
in[0] = src;
memcpy(&in[1], in_keep, n * sizeof(in[0]));
irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in);
- init_node_attr(irn, n);
+ init_node_attr(irn, n
+ 1
);
be_node_set_reg_class(irn, OUT_POS(0), cls);
be_node_set_reg_class(irn, 0, cls);
be_node_set_reg_class(irn, OUT_POS(0), cls);
be_node_set_reg_class(irn, 0, cls);
@@
-1278,7
+1278,7
@@
static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason)
{
be_stack_attr_t *a = (be_stack_attr_t *) at;
fprintf(f, "offset: %u\n", a->offset);
{
be_stack_attr_t *a = (be_stack_attr_t *) at;
fprintf(f, "offset: %u\n", a->offset);
- fprintf(f, "direction: %s\n", a->dir == be_stack_dir_
along ? "along" : "against
");
+ fprintf(f, "direction: %s\n", a->dir == be_stack_dir_
expand ? "expand" : "shrink
");
}
break;
}
}
break;
}