OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

dwarf2out.c: Fix formatting.

Browse Source 
* dwarf2out.c: Fix formatting.
	* varasm.c: Likewise.

From-SVN: r53160
This commit is contained in:
Kazu Hirata 2002-05-04 14:54:13 +00:00 committed by Kazu Hirata
parent 0387639b62
commit c26fbbca7a
3 changed files with 95 additions and 87 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/ChangeLog
View File

@ -1,3 +1,8 @@
2002-05-04 Kazu Hirata <kazu@cs.umass.edu>
* dwarf2out.c: Fix formatting.
* varasm.c: Likewise.
2002-05-04 David Edelsohn <edelsohn@gnu.org>
PR c/6543

13
gcc/dwarf2out.c
View File

@ -969,7 +969,7 @@ stack_adjust_offset (pattern)
/* We handle only adjustments by constant amount. */
if (GET_CODE (XEXP (src, 1)) != PLUS ||
GET_CODE (val) != CONST_INT)
abort();
abort ();
offset = -INTVAL (val);
break;
}
@ -1114,7 +1114,7 @@ flush_queued_reg_saves ()
{
struct queued_reg_save *q, *next;
for (q = queued_reg_saves; q ; q = next)
for (q = queued_reg_saves; q; q = next)
{
dwarf2out_reg_save (last_reg_save_label, REGNO (q->reg), q->cfa_offset);
next = q->next;
@ -1131,7 +1131,7 @@ clobbers_queued_reg_save (insn)
{
struct queued_reg_save *q;
for (q = queued_reg_saves; q ; q = q->next)
for (q = queued_reg_saves; q; q = q->next)
if (modified_in_p (q->reg, insn))
return true;
@ -5679,7 +5679,7 @@ break_out_includes (die)
dw_die_ref unit = NULL;
limbo_die_node *node;
for (ptr = &(die->die_child); *ptr; )
for (ptr = &(die->die_child); *ptr;)
{
dw_die_ref c = *ptr;
@ -5761,6 +5761,7 @@ output_location_lists (die)
output_location_lists (c);
}
/* The format of each DIE (and its attribute value pairs) is encoded in an
abbreviation table. This routine builds the abbreviation table and assigns
a unique abbreviation id for each abbreviation entry. The children of each
@ -6231,7 +6232,7 @@ output_loc_list (list_head)
"Location list base address specifier base");
}
for (curr = list_head; curr != NULL; curr=curr->dw_loc_next)
for (curr = list_head; curr != NULL; curr = curr->dw_loc_next)
{
unsigned long size;
@ -11559,7 +11560,7 @@ mark_limbo_die_list (ptr)
void *ptr ATTRIBUTE_UNUSED;
{
limbo_die_node *node;
for (node = limbo_die_list; node ; node = node->next)
for (node = limbo_die_list; node; node = node->next)
ggc_mark_tree (node->created_for);
}

24
gcc/varasm.c
View File

@ -268,6 +268,7 @@ data_section ()
in_section = in_data;
}
}
/* Tell assembler to ALWAYS switch to data section, in case
it's not sure where it is. */
@ -339,7 +340,7 @@ get_named_section_flags (section)
{
struct in_named_entry **slot;
slot = (struct in_named_entry**)
slot = (struct in_named_entry **)
htab_find_slot_with_hash (in_named_htab, section,
htab_hash_string (section), NO_INSERT);
@ -356,7 +357,7 @@ named_section_first_declaration (name)
{
struct in_named_entry **slot;
slot = (struct in_named_entry**)
slot = (struct in_named_entry **)
htab_find_slot_with_hash (in_named_htab, name,
htab_hash_string (name), NO_INSERT);
if (! (*slot)->declared)
@ -381,7 +382,7 @@ set_named_section_flags (section, flags)
{
struct in_named_entry **slot, *entry;
slot = (struct in_named_entry**)
slot = (struct in_named_entry **)
htab_find_slot_with_hash (in_named_htab, section,
htab_hash_string (section), INSERT);
entry = *slot;
@ -412,7 +413,7 @@ named_section_flags (name, flags)
if (! set_named_section_flags (name, flags))
abort ();
(* targetm.asm_out.named_section) (name, flags);
(*targetm.asm_out.named_section) (name, flags);
if (flags & SECTION_FORGET)
in_section = no_section;
@ -657,7 +658,7 @@ mergeable_string_section (decl, align, flags)
for (i = 0; i < len; i += unit)
{
for (j = 0; j < unit; j++)
if (str [i + j] != '\0')
if (str[i + j] != '\0')
break;
if (j == unit)
break;
@ -1203,7 +1204,7 @@ assemble_start_function (decl, fnname)
{
#ifdef ASM_OUTPUT_MAX_SKIP_ALIGN
ASM_OUTPUT_MAX_SKIP_ALIGN (asm_out_file,
align_functions_log, align_functions-1);
align_functions_log, align_functions - 1);
#else
ASM_OUTPUT_ALIGN (asm_out_file, align_functions_log);
#endif
@ -1373,7 +1374,7 @@ assemble_string (p, size)
static void
asm_emit_uninitialised (decl, name, size, rounded)
tree decl;
const char * name;
const char *name;
int size ATTRIBUTE_UNUSED;
int rounded ATTRIBUTE_UNUSED;
{
@ -2935,7 +2936,7 @@ record_constant_1 (exp)
obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes));
obstack_blank (&permanent_obstack, nbytes);
get_set_constructor_bytes
(exp, (unsigned char *) permanent_obstack.next_free-nbytes,
(exp, (unsigned char *) permanent_obstack.next_free - nbytes,
nbytes);
return;
}
@ -4202,7 +4203,8 @@ mark_constant (current_rtx, data)
if (CONSTANT_POOL_ADDRESS_P (x))
{
struct pool_constant *pool = find_pool_constant (cfun, x);
if (pool->mark == 0) {
if (pool->mark == 0)
{
pool->mark = 1;
for_each_rtx (&(pool->constant), &mark_constant, NULL);
}
@ -4656,7 +4658,7 @@ array_size_for_constructor (val)
return TREE_STRING_LENGTH (val);
max_index = NULL_TREE;
for (i = CONSTRUCTOR_ELTS (val); i ; i = TREE_CHAIN (i))
for (i = CONSTRUCTOR_ELTS (val); i; i = TREE_CHAIN (i))
{
tree index = TREE_PURPOSE (i);
@ -5050,7 +5052,7 @@ weak_finish ()
{
tree t;
for (t = weak_decls; t ; t = TREE_CHAIN (t))
for (t = weak_decls; t; t = TREE_CHAIN (t))
{
tree decl = TREE_VALUE (t);
const char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl));