Commit e89993b3 by Andrew Pinski Committed by Andrew Pinski

tree-mudflap.c: Fix whitespace issues.

2007-06-14  Andrew Pinski  <andrew_pinski@playstation.sony.com>

        * tree-mudflap.c: Fix whitespace issues.

From-SVN: r125733
parent 83f6221b
2007-06-14 Andrew Pinski <andrew_pinski@playstation.sony.com>
* tree-mudflap.c: Fix whitespace issues.
2007-06-15 Kazu Hirata <kazu@codesourcery.com> 2007-06-15 Kazu Hirata <kazu@codesourcery.com>
* config/m68k/m68k.c (ASM_DOT, ASM_DOTW, ASM_DOTL): Remove. * config/m68k/m68k.c (ASM_DOT, ASM_DOTW, ASM_DOTL): Remove.
......
...@@ -333,11 +333,17 @@ mf_make_mf_cache_struct_type (tree field_type) ...@@ -333,11 +333,17 @@ mf_make_mf_cache_struct_type (tree field_type)
#define build_function_type_1(rtype, arg1) \ #define build_function_type_1(rtype, arg1) \
build_function_type (rtype, tree_cons (0, arg1, void_list_node)) build_function_type (rtype, tree_cons (0, arg1, void_list_node))
#define build_function_type_3(rtype, arg1, arg2, arg3) \ #define build_function_type_3(rtype, arg1, arg2, arg3) \
build_function_type (rtype, tree_cons (0, arg1, tree_cons (0, arg2, \ build_function_type (rtype, \
tree_cons (0, arg3, void_list_node)))) tree_cons (0, arg1, \
tree_cons (0, arg2, \
tree_cons (0, arg3, \
void_list_node))))
#define build_function_type_4(rtype, arg1, arg2, arg3, arg4) \ #define build_function_type_4(rtype, arg1, arg2, arg3, arg4) \
build_function_type (rtype, tree_cons (0, arg1, tree_cons (0, arg2, \ build_function_type (rtype, \
tree_cons (0, arg3, tree_cons (0, arg4, \ tree_cons (0, arg1, \
tree_cons (0, arg2, \
tree_cons (0, arg3, \
tree_cons (0, arg4, \
void_list_node))))) void_list_node)))))
/* Initialize the global tree nodes that correspond to mf-runtime.h /* Initialize the global tree nodes that correspond to mf-runtime.h
...@@ -571,9 +577,11 @@ mf_build_check_statement_for (tree base, tree limit, ...@@ -571,9 +577,11 @@ mf_build_check_statement_for (tree base, tree limit,
/* Build: __mf_elem = &__mf_lookup_cache [(__mf_base >> __mf_shift) /* Build: __mf_elem = &__mf_lookup_cache [(__mf_base >> __mf_shift)
& __mf_mask]. */ & __mf_mask]. */
t = build2 (RSHIFT_EXPR, mf_uintptr_type, mf_base, t = build2 (RSHIFT_EXPR, mf_uintptr_type, mf_base,
(flag_mudflap_threads ? mf_cache_shift_decl : mf_cache_shift_decl_l)); flag_mudflap_threads ? mf_cache_shift_decl
: mf_cache_shift_decl_l);
t = build2 (BIT_AND_EXPR, mf_uintptr_type, t, t = build2 (BIT_AND_EXPR, mf_uintptr_type, t,
(flag_mudflap_threads ? mf_cache_mask_decl : mf_cache_mask_decl_l)); flag_mudflap_threads ? mf_cache_mask_decl
: mf_cache_mask_decl_l);
t = build4 (ARRAY_REF, t = build4 (ARRAY_REF,
TREE_TYPE (TREE_TYPE (mf_cache_array_decl)), TREE_TYPE (TREE_TYPE (mf_cache_array_decl)),
mf_cache_array_decl, t, NULL_TREE, NULL_TREE); mf_cache_array_decl, t, NULL_TREE, NULL_TREE);
...@@ -699,7 +707,8 @@ mf_decl_eligible_p (tree decl) ...@@ -699,7 +707,8 @@ mf_decl_eligible_p (tree decl)
/* The decl must have its address taken. In the case of /* The decl must have its address taken. In the case of
arrays, this flag is also set if the indexes are not arrays, this flag is also set if the indexes are not
compile-time known valid constants. */ compile-time known valid constants. */
&& TREE_ADDRESSABLE (decl) /* XXX: not sufficient: return-by-value structs! */ /* XXX: not sufficient: return-by-value structs! */
&& TREE_ADDRESSABLE (decl)
/* The type of the variable must be complete. */ /* The type of the variable must be complete. */
&& COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (decl)) && COMPLETE_OR_VOID_TYPE_P (TREE_TYPE (decl))
/* The decl hasn't been decomposed somehow. */ /* The decl hasn't been decomposed somehow. */
...@@ -758,7 +767,8 @@ mf_xform_derefs_1 (block_stmt_iterator *iter, tree *tp, ...@@ -758,7 +767,8 @@ mf_xform_derefs_1 (block_stmt_iterator *iter, tree *tp,
while (1) while (1)
{ {
if (bitfield_ref_p && elt == NULL_TREE if (bitfield_ref_p && elt == NULL_TREE
&& (TREE_CODE (var) == ARRAY_REF || TREE_CODE (var) == COMPONENT_REF)) && (TREE_CODE (var) == ARRAY_REF
|| TREE_CODE (var) == COMPONENT_REF))
elt = var; elt = var;
if (TREE_CODE (var) == ARRAY_REF) if (TREE_CODE (var) == ARRAY_REF)
...@@ -787,7 +797,8 @@ mf_xform_derefs_1 (block_stmt_iterator *iter, tree *tp, ...@@ -787,7 +797,8 @@ mf_xform_derefs_1 (block_stmt_iterator *iter, tree *tp,
return; return;
else else
{ {
base = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (var)), var); base = build1 (ADDR_EXPR,
build_pointer_type (TREE_TYPE (var)), var);
break; break;
} }
} }
...@@ -810,7 +821,8 @@ mf_xform_derefs_1 (block_stmt_iterator *iter, tree *tp, ...@@ -810,7 +821,8 @@ mf_xform_derefs_1 (block_stmt_iterator *iter, tree *tp,
size = DECL_SIZE_UNIT (field); size = DECL_SIZE_UNIT (field);
if (elt) if (elt)
elt = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (elt)), elt); elt = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (elt)),
elt);
addr = fold_convert (ptr_type_node, elt ? elt : base); addr = fold_convert (ptr_type_node, elt ? elt : base);
addr = fold_build2 (PLUS_EXPR, ptr_type_node, addr = fold_build2 (PLUS_EXPR, ptr_type_node,
addr, fold_convert (ptr_type_node, addr, fold_convert (ptr_type_node,
...@@ -1031,7 +1043,8 @@ mx_register_decls (tree decl, tree *stmt_list) ...@@ -1031,7 +1043,8 @@ mx_register_decls (tree decl, tree *stmt_list)
IDENTIFIER_POINTER (DECL_NAME (decl))); IDENTIFIER_POINTER (DECL_NAME (decl)));
else else
{ {
tsi_link_before (&initially_stmts, register_fncall, TSI_SAME_STMT); tsi_link_before (&initially_stmts, register_fncall,
TSI_SAME_STMT);
/* Accumulate the FINALLY piece. */ /* Accumulate the FINALLY piece. */
append_to_statement_list (unregister_fncall, &finally_stmts); append_to_statement_list (unregister_fncall, &finally_stmts);
...@@ -1117,7 +1130,8 @@ mf_mark (tree t) ...@@ -1117,7 +1130,8 @@ mf_mark (tree t)
void **slot; void **slot;
if (marked_trees == NULL) if (marked_trees == NULL)
marked_trees = htab_create_ggc (31, htab_hash_pointer, htab_eq_pointer, NULL); marked_trees = htab_create_ggc (31, htab_hash_pointer, htab_eq_pointer,
NULL);
slot = htab_find_slot (marked_trees, t, INSERT); slot = htab_find_slot (marked_trees, t, INSERT);
*slot = t; *slot = t;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment