diff options
| author | Thomas Neumann <tneumann@users.sourceforge.net> | 2007-06-30 10:52:30 +0000 |
|---|---|---|
| committer | Thomas Neumann <tneumann@gcc.gnu.org> | 2007-06-30 10:52:30 +0000 |
| commit | c5274326e08088f3fddff1f94e035a0352362fd0 (patch) | |
| tree | 8419d77742232e2a832b7b3fc66904637698ca40 /gcc/ipa-utils.c | |
| parent | 23512eb32c50149c0096a77726edb1220a816cdc (diff) | |
| download | gcc-c5274326e08088f3fddff1f94e035a0352362fd0.zip gcc-c5274326e08088f3fddff1f94e035a0352362fd0.tar.gz gcc-c5274326e08088f3fddff1f94e035a0352362fd0.tar.bz2 | |
ipa.c (cgraph_postorder): Cast according to the coding conventions.
* ipa.c (cgraph_postorder): Cast according to the coding conventions.
(cgraph_remove_unreachable_nodes): Likewise.
* ipa-cp.c (ipcp_propagate_stage): Use BOTTOM instead of integer 0.
* ipa-inline.c (update_caller_keys): Cast according to the coding
conventions.
(cgraph_decide_recursive_inlining): Likewise.
(cgraph_decide_inlining_of_small_function): Likewise.
(try_inline): Likewise.
(cgraph_decide_inlining_incrementally): Likewise.
* ipa-pure-const.c (get_function_state): Likewise.
(scan_function): Likewise.
(analyze_function): Likewise.
(static_execute): Likewise.
* gcc/ipa-reference.c (scan_for_static_refs): Likewise.
(merge_callee_local_info): Likewise.
(analyze_function): Use type safe memory macros.
(static_execute): Likewise. Cast according to the coding conventions.
* ipa-type-escape.c (scan_for_regs): Cast according to the coding
conventions.
* ipa-utils.c (searchc): Likewise. Avoid using C++ keywords as variable
names.
(ipa_utils_reduced_inorder): Likewise. Use type safe memory macros.
* ipa-utils.h (struct ipa_dfa_info): Avoid using C++ keywords as
variable names.
From-SVN: r126140
Diffstat (limited to 'gcc/ipa-utils.c')
| -rw-r--r-- | gcc/ipa-utils.c | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/gcc/ipa-utils.c b/gcc/ipa-utils.c index f0025c7..8b7aeaf 100644 --- a/gcc/ipa-utils.c +++ b/gcc/ipa-utils.c @@ -86,10 +86,10 @@ static void searchc (struct searchc_env* env, struct cgraph_node *v) { struct cgraph_edge *edge; - struct ipa_dfs_info *v_info = v->aux; + struct ipa_dfs_info *v_info = (struct ipa_dfs_info *) v->aux; /* mark node as old */ - v_info->new = false; + v_info->new_node = false; splay_tree_remove (env->nodes_marked_new, v->uid); v_info->dfn_number = env->count; @@ -107,8 +107,8 @@ searchc (struct searchc_env* env, struct cgraph_node *v) w = cgraph_master_clone (w); if (w && w->aux) { - w_info = w->aux; - if (w_info->new) + w_info = (struct ipa_dfs_info *) w->aux; + if (w_info->new_node) { searchc (env, w); v_info->low_link = @@ -132,7 +132,7 @@ searchc (struct searchc_env* env, struct cgraph_node *v) struct ipa_dfs_info *x_info; do { x = env->stack[--(env->stack_size)]; - x_info = x->aux; + x_info = (struct ipa_dfs_info *) x->aux; x_info->on_stack = false; if (env->reduce) @@ -177,10 +177,10 @@ ipa_utils_reduced_inorder (struct cgraph_node **order, AVAIL_OVERWRITABLE)))) { /* Reuse the info if it is already there. */ - struct ipa_dfs_info *info = node->aux; + struct ipa_dfs_info *info = (struct ipa_dfs_info *) node->aux; if (!info) - info = xcalloc (1, sizeof (struct ipa_dfs_info)); - info->new = true; + info = XCNEW (struct ipa_dfs_info); + info->new_node = true; info->on_stack = false; info->next_cycle = NULL; node->aux = info; |