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.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.c')
| -rw-r--r-- | gcc/ipa.c | 6 |
1 files changed, 3 insertions, 3 deletions
@@ -58,7 +58,7 @@ cgraph_postorder (struct cgraph_node **order) { while (node2->aux != &last) { - edge = node2->aux; + edge = (struct cgraph_edge *) node2->aux; if (edge->next_caller) node2->aux = edge->next_caller; else @@ -98,7 +98,7 @@ cgraph_postorder (struct cgraph_node **order) bool cgraph_remove_unreachable_nodes (bool before_inlining_p, FILE *file) { - struct cgraph_node *first = (void *) 1; + struct cgraph_node *first = (struct cgraph_node *) (void *) 1; struct cgraph_node *node, *next; bool changed = false; int insns = 0; @@ -131,7 +131,7 @@ cgraph_remove_unreachable_nodes (bool before_inlining_p, FILE *file) { struct cgraph_edge *e; node = first; - first = first->aux; + first = (struct cgraph_node *) first->aux; for (e = node->callees; e; e = e->next_callee) if (!e->callee->aux |