mirrors/binutils-gdb
1
0
Fork 0
mirror of https://sourceware.org/git/binutils-gdb.git synced 2024-11-25 02:53:48 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

2000-09-02 Kazu Hirata <kazu@hxi.com>

Browse Source 
* config/tc-ia64.c: Fix formatting.
This commit is contained in:
Kazu Hirata 2000-09-03 00:04:40 +00:00
parent 18e03609ef
commit 197865e878
2 changed files with 224 additions and 222 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
gas/ChangeLog
View File

@ -1,3 +1,7 @@
2000-09-02 Kazu Hirata <kazu@hxi.com>
* config/tc-ia64.c: Fix formatting.
2000-09-02 Nick Clifton <nickc@redhat.com>
* configure.in: Increase version number to 2.10.91.

66
gas/config/tc-ia64.c
View File

@ -1093,7 +1093,6 @@ output_P3_format (f, rtype, reg)
(*f) (2, bytes, NULL);
}
static void
output_P4_format (f, imask, imask_size)
vbyte_func f;
@ -4050,7 +4049,7 @@ print_prmask (mask)
char *comma = "";
for (regno = 0;regno < 64;regno++)
{
if (mask & ((valueT)1<<regno))
if (mask & ((valueT) 1<<regno))
{
fprintf (stderr, "%s p%d", comma, regno);
comma = ",";
@ -4166,9 +4165,9 @@ dot_pred_rel (type)
{
case 'c':
if (count == 0)
mask = ~(valueT)0;
mask = ~(valueT) 0;
clear_qp_mutex (mask);
clear_qp_implies (mask, (valueT)0);
clear_qp_implies (mask, (valueT) 0);
break;
case 'i':
if (count != 2 || p1 == -1 || p2 == -1)
@ -4704,7 +4703,7 @@ operand_match (idesc, index, e)
{
int lobits = e->X_add_number & 0x3;
if (((bfd_vma) e->X_add_number & 0x3C) != 0 && lobits == 0)
e->X_add_number |= (bfd_vma)0x3;
e->X_add_number |= (bfd_vma) 0x3;
return 1;
}
break;
@ -4742,7 +4741,7 @@ operand_match (idesc, index, e)
if (e->X_add_number >= 0
&& (e->X_add_number & ((bfd_vma) 1 << 16)) != 0)
{
e->X_add_number |= ~(((bfd_vma)1 << 17) - 1);
e->X_add_number |= ~(((bfd_vma) 1 << 17) - 1);
}
return 1;
}
@ -4798,8 +4797,8 @@ operand_match (idesc, index, e)
/* Sign-extend 32-bit unsigned numbers, so that the following range
checks will work. */
val = e->X_add_number;
if (((val & (~(bfd_vma)0 << 32)) == 0)
&& ((val & ((bfd_vma)1 << 31)) != 0))
if (((val & (~(bfd_vma) 0 << 32)) == 0)
&& ((val & ((bfd_vma) 1 << 31)) != 0))
val = ((val << 32) >> 32);
/* Check for 0x100000000. This is valid because
@ -4838,8 +4837,8 @@ operand_match (idesc, index, e)
/* Sign-extend 32-bit unsigned numbers, so that the following range
checks will work. */
val = e->X_add_number;
if (((val & (~(bfd_vma)0 << 32)) == 0)
&& ((val & ((bfd_vma)1 << 31)) != 0))
if (((val & (~(bfd_vma) 0 << 32)) == 0)
&& ((val & ((bfd_vma) 1 << 31)) != 0))
val = ((val << 32) >> 32);
}
else
@ -6925,11 +6924,11 @@ dep->name, idesc->name, (rsrc_write?"write":"read"), note)
&& idesc->operands[0] == IA64_OPND_PR)
{
mask = CURR_SLOT.opnd[2].X_add_number;
if (mask & ((valueT)1<<16))
mask |= ~(valueT)0xffff;
if (mask & ((valueT) 1<<16))
mask |= ~(valueT) 0xffff;
for (i=1;i < 63;i++)
{
if (mask & ((valueT)1<<i))
if (mask & ((valueT) 1<<i))
{
specs[count] = tmpl;
specs[count++].index = i;
@ -7148,7 +7147,7 @@ dep->name, idesc->name, (rsrc_write?"write":"read"), note)
{
UNHANDLED;
}
if (mask & ((valueT)1<<dep->regindex))
if (mask & ((valueT) 1<<dep->regindex))
{
specs[count++] = tmpl;
}
@ -7432,7 +7431,7 @@ dep->name, idesc->name, (rsrc_write?"write":"read"), note)
valueT mask = 0;
if (idesc->operands[2] == IA64_OPND_IMM17)
mask = CURR_SLOT.opnd[2].X_add_number;
if (mask & ((valueT)1<<63))
if (mask & ((valueT) 1<<63))
{
specs[count++] = tmpl;
}
@ -7528,7 +7527,7 @@ clear_qp_branch_flag (mask)
int i;
for (i = 0;i < regdepslen;i++)
{
valueT bit = ((valueT)1 << regdeps[i].qp_regno);
valueT bit = ((valueT) 1 << regdeps[i].qp_regno);
if ((bit & mask) != 0)
{
regdeps[i].link_to_qp_branch = 0;
@ -7578,8 +7577,8 @@ clear_qp_implies (p1_mask, p2_mask)
i = 0;
while (i < qp_implieslen)
{
if ((((valueT)1 << qp_implies[i].p1) & p1_mask) != 0
|| (((valueT)1 << qp_implies[i].p2) & p2_mask) != 0)
if ((((valueT) 1 << qp_implies[i].p1) & p1_mask) != 0
|| (((valueT) 1 << qp_implies[i].p2) & p2_mask) != 0)
{
if (md.debug_dv)
fprintf (stderr, "Clearing implied relation PR%d->PR%d\n",
@ -7643,8 +7642,8 @@ add_qp_imply (p1, p2)
}
/* Add in mutex relations implied by this implies relation; for each mutex
relation containing p2, duplicate it and replace p2 with p1. */
bit = (valueT)1 << p1;
mask = (valueT)1 << p2;
bit = (valueT) 1 << p1;
mask = (valueT) 1 << p2;
for (i=0;i < qp_mutexeslen;i++)
{
if (qp_mutexes[i].prmask & mask)
@ -7652,7 +7651,6 @@ add_qp_imply (p1, p2)
}
}
/* Add the PRs specified in the mask to the mutex list; this means that only
one of the PRs can be true at any time. PR0 should never be included in
the mask. */
@ -7724,23 +7722,23 @@ note_register_values (idesc)
|| idesc->operands[i] == IA64_OPND_P2)
{
int regno = CURR_SLOT.opnd[i].X_add_number - REG_P;
qp_changemask |= (valueT)1 << regno;
qp_changemask |= (valueT) 1 << regno;
}
else if (idesc->operands[i] == IA64_OPND_PR)
{
if (idesc->operands[2] & (valueT)0x10000)
qp_changemask = ~(valueT)0x1FFFF | idesc->operands[2];
if (idesc->operands[2] & (valueT) 0x10000)
qp_changemask = ~(valueT) 0x1FFFF | idesc->operands[2];
else
qp_changemask = idesc->operands[2];
break;
}
else if (idesc->operands[i] == IA64_OPND_PR_ROT)
{
if (idesc->operands[1] & ((valueT)1 << 43))
qp_changemask = ~(valueT)0xFFFFFFFFFFF | idesc->operands[1];
if (idesc->operands[1] & ((valueT) 1 << 43))
qp_changemask = ~(valueT) 0xFFFFFFFFFFF | idesc->operands[1];
else
qp_changemask = idesc->operands[1];
qp_changemask &= ~(valueT)0xFFFF;
qp_changemask &= ~(valueT) 0xFFFF;
break;
}
}
@ -7752,7 +7750,7 @@ note_register_values (idesc)
/* invalidate rotating registers on insns which affect RRBs in CFM */
if (idesc->flags & IA64_OPCODE_MOD_RRBS)
{
qp_changemask |= ~(valueT)0xFFFF;
qp_changemask |= ~(valueT) 0xFFFF;
if (strcmp (idesc->name, "clrrrb.pr") != 0)
{
for (i=32;i < 32+md.rot.num_regs;i++)
@ -7776,8 +7774,8 @@ note_register_values (idesc)
|| is_taken_branch (idesc))
{
clear_register_values ();
clear_qp_mutex (~(valueT)0);
clear_qp_implies (~(valueT)0, ~(valueT)0);
clear_qp_mutex (~(valueT) 0);
clear_qp_implies (~(valueT) 0, ~(valueT) 0);
}
/* Look for mutex and implies relations */
else if ((idesc->operands[0] == IA64_OPND_P1
@ -7787,8 +7785,8 @@ note_register_values (idesc)
{
int p1 = CURR_SLOT.opnd[0].X_add_number - REG_P;
int p2 = CURR_SLOT.opnd[1].X_add_number - REG_P;
valueT p1mask = (valueT)1 << p1;
valueT p2mask = (valueT)1 << p2;
valueT p1mask = (valueT) 1 << p1;
valueT p2mask = (valueT) 1 << p2;
/* if one of the PRs is PR0, we can't really do anything */
if (p1 == 0 || p2 == 0)
@ -7878,7 +7876,7 @@ qp_mutex (p1, p2, path)
if (p1 != p2)
{
mask = ((valueT)1<<p1) | (valueT)1<<p2;
mask = ((valueT) 1<<p1) | (valueT) 1<<p2;
for (i=0;i < qp_mutexeslen;i++)
{
if (qp_mutexes[i].path >= path
@ -9271,7 +9269,7 @@ md_section_align (seg, size)
valueT size;
{
int align = bfd_get_section_alignment (stdoutput, seg);
valueT mask = ((valueT)1 << align) - 1;
valueT mask = ((valueT) 1 << align) - 1;
return (size + mask) & ~mask;
}