#include <limits.h>
#else
#ifndef INT_MAX
-#define INT_MAX (int) (((unsigned)(-1)) >> 1)
+#define INT_MAX (int) (((unsigned) (-1)) >> 1)
#endif
#endif
/* The maximum address skip amount that can be encoded with a special op. */
#define MAX_SPECIAL_ADDR_DELTA SPECIAL_ADDR(255)
-
-struct line_entry
-{
+struct line_entry {
struct line_entry *next;
fragS *frag;
addressT frag_ofs;
struct dwarf2_line_info loc;
};
-struct line_subseg
-{
+struct line_subseg {
struct line_subseg *next;
subsegT subseg;
struct line_entry *head;
struct line_entry **ptail;
};
-struct line_seg
-{
+struct line_seg {
struct line_seg *next;
segT seg;
struct line_subseg *head;
/* Collects data for all line table entries during assembly. */
static struct line_seg *all_segs;
-struct file_entry
-{
+struct file_entry {
char *filename;
unsigned int dir;
};
if (seg == last_seg && subseg == last_subseg)
return last_line_subseg;
- for (s = all_segs; s ; s = s->next)
+ for (s = all_segs; s; s = s->next)
if (s->seg == seg)
goto found_seg;
for (pss = &s->head; (ss = *pss) != NULL ; pss = &ss->next)
{
if (ss->subseg == subseg)
- goto found_subseg;
+ goto found_subseg;
if (ss->subseg > subseg)
break;
}
if (debug_type != DEBUG_DWARF2 && ! loc_directive_seen)
return;
loc_directive_seen = false;
-
+
dwarf2_where (&loc);
dwarf2_gen_line_info (frag_now_fix () - size, &loc);
}
{
files_allocated = i + 32;
files = (struct file_entry *)
- xrealloc (files, (i + 32) * sizeof(struct file_entry));
+ xrealloc (files, (i + 32) * sizeof (struct file_entry));
}
- files[i].filename = xstrdup(filename);
+ files[i].filename = xstrdup (filename);
files[i].dir = 0;
files_in_use = i + 1;
last_used = i;
xrealloc (user_filenum, (num + 16) * sizeof (unsigned int));
/* Zero the new memory. */
- memset (user_filenum + old, 0, (num + 16 - old) * sizeof(unsigned int));
+ memset (user_filenum + old, 0, (num + 16 - old) * sizeof (unsigned int));
}
user_filenum[num] = get_filenum (filename);
listing_source_line (line);
#endif
}
-
\f
static struct frag *
first_frag_for_seg (seg)
{
frchainS *f, *first = NULL;
- for (f = frchain_root; f ; f = f->frch_next)
+ for (f = frchain_root; f; f = f->frch_next)
if (f->frch_seg == seg
&& (! first || first->frch_subseg > f->frch_subseg))
first = f;
{
frchainS *f, *last = NULL;
- for (f = frchain_root; f ; f = f->frch_next)
+ for (f = frchain_root; f; f = f->frch_next)
if (f->frch_seg == seg
&& (! last || last->frch_subseg < f->frch_subseg))
last= f;
/* If a fragment is the last in the chain, special measures must be
taken to find its size before relaxation, since it may be pending
on some subsegment chain. */
- for (fr = frchain_root; fr ; fr = fr->frch_next)
+ for (fr = frchain_root; fr; fr = fr->frch_next)
if (fr->frch_last == frag)
{
return ((char *) obstack_next_free (&fr->frch_obstack)
int len = 0;
/* Scale the address delta by the minimum instruction length. */
-#if DWARF2_LINE_MIN_INSN_LENGTH > 1
+#if DWARF2_LINE_MIN_INSN_LENGTH > 1
assert (addr_delta % DWARF2_LINE_MIN_INSN_LENGTH == 0);
addr_delta /= DWARF2_LINE_MIN_INSN_LENGTH;
#endif
int need_copy = 0;
char *end = p + len;
-#if DWARF2_LINE_MIN_INSN_LENGTH > 1
+#if DWARF2_LINE_MIN_INSN_LENGTH > 1
/* Scale the address delta by the minimum instruction length. */
assert (addr_delta % DWARF2_LINE_MIN_INSN_LENGTH == 0);
addr_delta /= DWARF2_LINE_MIN_INSN_LENGTH;
old_size = frag->fr_subtype;
new_size = dwarf2dbg_estimate_size_before_relax (frag);
-
+
return new_size - old_size;
}
course, have allocated enough memory earlier. */
assert (frag->fr_var >= (int) frag->fr_subtype);
- emit_inc_line_addr (frag->fr_offset, addr_diff,
+ emit_inc_line_addr (frag->fr_offset, addr_diff,
frag->fr_literal + frag->fr_fix, frag->fr_subtype);
frag->fr_fix += frag->fr_subtype;
if (frag == last_frag)
out_inc_line_addr (INT_MAX, last_frag_ofs - frag_ofs);
else
- relax_inc_line_addr (INT_MAX, seg, last_frag, last_frag_ofs,
+ relax_inc_line_addr (INT_MAX, seg, last_frag, last_frag_ofs,
frag, frag_ofs);
}
set_symbol_value_now (prologue_end);
/* For each section, emit a statement program. */
- for (s = all_segs; s ; s = s->next)
+ for (s = all_segs; s; s = s->next)
process_entries (s->seg, s->head->head);
set_symbol_value_now (line_end);
size = 4 + 2 + 4 + 1 + 1;
- skip = 2*addr_size - (size & (2*addr_size - 1));
- if (skip == 2*addr_size)
+ skip = 2 * addr_size - (size & (2 * addr_size - 1));
+ if (skip == 2 * addr_size)
skip = 0;
size += skip;
- for (s = all_segs; s ; s = s->next)
- size += 2*addr_size;
+ for (s = all_segs; s; s = s->next)
+ size += 2 * addr_size;
- size += 2*addr_size;
+ size += 2 * addr_size;
subseg_set (aranges_seg, 0);
/* Align the header. */
if (skip)
- frag_align (ffs (2*addr_size) - 1, 0, 0);
+ frag_align (ffs (2 * addr_size) - 1, 0, 0);
- for (s = all_segs; s ; s = s->next)
+ for (s = all_segs; s; s = s->next)
{
fragS *frag;
symbolS *beg, *end;
subseg_set (info_seg, 0);
- info_start = symbol_new_now();
+ info_start = symbol_new_now ();
info_end = symbol_make (fake_label_name);
/* Compilation Unit length. */
#endif
/* For each subsection, chain the debug entries together. */
- for (s = all_segs; s ; s = s->next)
+ for (s = all_segs; s; s = s->next)
{
struct line_subseg *ss = s->head;
struct line_entry **ptail = ss->ptail;
bfd_set_section_flags (stdoutput, aranges_seg, SEC_READONLY);
#endif
- record_alignment (aranges_seg, ffs (2*sizeof_address) - 1);
+ record_alignment (aranges_seg, ffs (2 * sizeof_address) - 1);
out_debug_aranges (aranges_seg, info_seg);
out_debug_abbrev (abbrev_seg);