blob: fe877cbd6505313aabb61354a311086c68ae0b52 [file] [log] [blame]
/* tc-hppa.c -- Assemble for the PA
Copyright 1989, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001
Free Software Foundation, Inc.
This file is part of GAS, the GNU Assembler.
GAS is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
GAS is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with GAS; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA. */
/* HP PA-RISC support was contributed by the Center for Software Science
at the University of Utah. */
#include <stdio.h>
#include <ctype.h>
#include "as.h"
#include "subsegs.h"
#include "bfd/libhppa.h"
/* Be careful, this file includes data *declarations*. */
#include "opcode/hppa.h"
#if defined (OBJ_ELF) && defined (OBJ_SOM)
error only one of OBJ_ELF and OBJ_SOM can be defined
#endif
/* If we are using ELF, then we probably can support dwarf2 debug
records. Furthermore, if we are supporting dwarf2 debug records,
then we want to use the assembler support for compact line numbers. */
#ifdef OBJ_ELF
#include "dwarf2dbg.h"
/* A "convient" place to put object file dependencies which do
not need to be seen outside of tc-hppa.c. */
/* Object file formats specify relocation types. */
typedef enum elf_hppa_reloc_type reloc_type;
/* Object file formats specify BFD symbol types. */
typedef elf_symbol_type obj_symbol_type;
#define symbol_arg_reloc_info(sym)\
(((obj_symbol_type *) symbol_get_bfdsym (sym))->tc_data.hppa_arg_reloc)
#if TARGET_ARCH_SIZE == 64
/* How to generate a relocation. */
#define hppa_gen_reloc_type _bfd_elf64_hppa_gen_reloc_type
#else
#define hppa_gen_reloc_type _bfd_elf32_hppa_gen_reloc_type
#endif
/* ELF objects can have versions, but apparently do not have anywhere
to store a copyright string. */
#define obj_version obj_elf_version
#define obj_copyright obj_elf_version
#define UNWIND_SECTION_NAME ".PARISC.unwind"
#endif /* OBJ_ELF */
#ifdef OBJ_SOM
/* Names of various debugging spaces/subspaces. */
#define GDB_DEBUG_SPACE_NAME "$GDB_DEBUG$"
#define GDB_STRINGS_SUBSPACE_NAME "$GDB_STRINGS$"
#define GDB_SYMBOLS_SUBSPACE_NAME "$GDB_SYMBOLS$"
#define UNWIND_SECTION_NAME "$UNWIND$"
/* Object file formats specify relocation types. */
typedef int reloc_type;
/* SOM objects can have both a version string and a copyright string. */
#define obj_version obj_som_version
#define obj_copyright obj_som_copyright
/* How to generate a relocation. */
#define hppa_gen_reloc_type hppa_som_gen_reloc_type
/* Object file formats specify BFD symbol types. */
typedef som_symbol_type obj_symbol_type;
#define symbol_arg_reloc_info(sym)\
(((obj_symbol_type *) symbol_get_bfdsym (sym))->tc_data.ap.hppa_arg_reloc)
/* This apparently isn't in older versions of hpux reloc.h. */
#ifndef R_DLT_REL
#define R_DLT_REL 0x78
#endif
#ifndef R_N0SEL
#define R_N0SEL 0xd8
#endif
#ifndef R_N1SEL
#define R_N1SEL 0xd9
#endif
#endif /* OBJ_SOM */
#if TARGET_ARCH_SIZE == 64
#define DEFAULT_LEVEL 25
#else
#define DEFAULT_LEVEL 10
#endif
/* Various structures and types used internally in tc-hppa.c. */
/* Unwind table and descriptor. FIXME: Sync this with GDB version. */
struct unwind_desc
{
unsigned int cannot_unwind:1;
unsigned int millicode:1;
unsigned int millicode_save_rest:1;
unsigned int region_desc:2;
unsigned int save_sr:2;
unsigned int entry_fr:4;
unsigned int entry_gr:5;
unsigned int args_stored:1;
unsigned int call_fr:5;
unsigned int call_gr:5;
unsigned int save_sp:1;
unsigned int save_rp:1;
unsigned int save_rp_in_frame:1;
unsigned int extn_ptr_defined:1;
unsigned int cleanup_defined:1;
unsigned int hpe_interrupt_marker:1;
unsigned int hpux_interrupt_marker:1;
unsigned int reserved:3;
unsigned int frame_size:27;
};
/* We can't rely on compilers placing bitfields in any particular
place, so use these macros when dumping unwind descriptors to
object files. */
#define UNWIND_LOW32(U) \
(((U)->cannot_unwind << 31) \
| ((U)->millicode << 30) \
| ((U)->millicode_save_rest << 29) \
| ((U)->region_desc << 27) \
| ((U)->save_sr << 25) \
| ((U)->entry_fr << 21) \
| ((U)->entry_gr << 16) \
| ((U)->args_stored << 15) \
| ((U)->call_fr << 10) \
| ((U)->call_gr << 5) \
| ((U)->save_sp << 4) \
| ((U)->save_rp << 3) \
| ((U)->save_rp_in_frame << 2) \
| ((U)->extn_ptr_defined << 1) \
| ((U)->cleanup_defined << 0))
#define UNWIND_HIGH32(U) \
(((U)->hpe_interrupt_marker << 31) \
| ((U)->hpux_interrupt_marker << 30) \
| ((U)->frame_size << 0))
struct unwind_table
{
/* Starting and ending offsets of the region described by
descriptor. */
unsigned int start_offset;
unsigned int end_offset;
struct unwind_desc descriptor;
};
/* This structure is used by the .callinfo, .enter, .leave pseudo-ops to
control the entry and exit code they generate. It is also used in
creation of the correct stack unwind descriptors.
NOTE: GAS does not support .enter and .leave for the generation of
prologues and epilogues. FIXME.
The fields in structure roughly correspond to the arguments available on the
.callinfo pseudo-op. */
struct call_info
{
/* The unwind descriptor being built. */
struct unwind_table ci_unwind;
/* Name of this function. */
symbolS *start_symbol;
/* (temporary) symbol used to mark the end of this function. */
symbolS *end_symbol;
/* Next entry in the chain. */
struct call_info *ci_next;
};
/* Operand formats for FP instructions. Note not all FP instructions
allow all four formats to be used (for example fmpysub only allows
SGL and DBL). */
typedef enum
{
SGL, DBL, ILLEGAL_FMT, QUAD, W, UW, DW, UDW, QW, UQW
}
fp_operand_format;
/* This fully describes the symbol types which may be attached to
an EXPORT or IMPORT directive. Only SOM uses this formation
(ELF has no need for it). */
typedef enum
{
SYMBOL_TYPE_UNKNOWN,
SYMBOL_TYPE_ABSOLUTE,
SYMBOL_TYPE_CODE,
SYMBOL_TYPE_DATA,
SYMBOL_TYPE_ENTRY,
SYMBOL_TYPE_MILLICODE,
SYMBOL_TYPE_PLABEL,
SYMBOL_TYPE_PRI_PROG,
SYMBOL_TYPE_SEC_PROG,
}
pa_symbol_type;
/* This structure contains information needed to assemble
individual instructions. */
struct pa_it
{
/* Holds the opcode after parsing by pa_ip. */
unsigned long opcode;
/* Holds an expression associated with the current instruction. */
expressionS exp;
/* Does this instruction use PC-relative addressing. */
int pcrel;
/* Floating point formats for operand1 and operand2. */
fp_operand_format fpof1;
fp_operand_format fpof2;
/* Whether or not we saw a truncation request on an fcnv insn. */
int trunc;
/* Holds the field selector for this instruction
(for example L%, LR%, etc). */
long field_selector;
/* Holds any argument relocation bits associated with this
instruction. (instruction should be some sort of call). */
unsigned int arg_reloc;
/* The format specification for this instruction. */
int format;
/* The relocation (if any) associated with this instruction. */
reloc_type reloc;
};
/* PA-89 floating point registers are arranged like this:
+--------------+--------------+
| 0 or 16L | 16 or 16R |
+--------------+--------------+
| 1 or 17L | 17 or 17R |
+--------------+--------------+
| | |
. . .
. . .
. . .
| | |
+--------------+--------------+
| 14 or 30L | 30 or 30R |
+--------------+--------------+
| 15 or 31L | 31 or 31R |
+--------------+--------------+ */
/* Additional information needed to build argument relocation stubs. */
struct call_desc
{
/* The argument relocation specification. */
unsigned int arg_reloc;
/* Number of arguments. */
unsigned int arg_count;
};
#ifdef OBJ_SOM
/* This structure defines an entry in the subspace dictionary
chain. */
struct subspace_dictionary_chain
{
/* Nonzero if this space has been defined by the user code. */
unsigned int ssd_defined;
/* Name of this subspace. */
char *ssd_name;
/* GAS segment and subsegment associated with this subspace. */
asection *ssd_seg;
int ssd_subseg;
/* Next space in the subspace dictionary chain. */
struct subspace_dictionary_chain *ssd_next;
};
typedef struct subspace_dictionary_chain ssd_chain_struct;
/* This structure defines an entry in the subspace dictionary
chain. */
struct space_dictionary_chain
{
/* Nonzero if this space has been defined by the user code or
as a default space. */
unsigned int sd_defined;
/* Nonzero if this spaces has been defined by the user code. */
unsigned int sd_user_defined;
/* The space number (or index). */
unsigned int sd_spnum;
/* The name of this subspace. */
char *sd_name;
/* GAS segment to which this subspace corresponds. */
asection *sd_seg;
/* Current subsegment number being used. */
int sd_last_subseg;
/* The chain of subspaces contained within this space. */
ssd_chain_struct *sd_subspaces;
/* The next entry in the space dictionary chain. */
struct space_dictionary_chain *sd_next;
};
typedef struct space_dictionary_chain sd_chain_struct;
/* This structure defines attributes of the default subspace
dictionary entries. */
struct default_subspace_dict
{
/* Name of the subspace. */
char *name;
/* FIXME. Is this still needed? */
char defined;
/* Nonzero if this subspace is loadable. */
char loadable;
/* Nonzero if this subspace contains only code. */
char code_only;
/* Nonzero if this is a common subspace. */
char common;
/* Nonzero if this is a common subspace which allows symbols
to be multiply defined. */
char dup_common;
/* Nonzero if this subspace should be zero filled. */
char zero;
/* Sort key for this subspace. */
unsigned char sort;
/* Access control bits for this subspace. Can represent RWX access
as well as privilege level changes for gateways. */
int access;
/* Index of containing space. */
int space_index;
/* Alignment (in bytes) of this subspace. */
int alignment;
/* Quadrant within space where this subspace should be loaded. */
int quadrant;
/* An index into the default spaces array. */
int def_space_index;
/* Subsegment associated with this subspace. */
subsegT subsegment;
};
/* This structure defines attributes of the default space
dictionary entries. */
struct default_space_dict
{
/* Name of the space. */
char *name;
/* Space number. It is possible to identify spaces within
assembly code numerically! */
int spnum;
/* Nonzero if this space is loadable. */
char loadable;
/* Nonzero if this space is "defined". FIXME is still needed */
char defined;
/* Nonzero if this space can not be shared. */
char private;
/* Sort key for this space. */
unsigned char sort;
/* Segment associated with this space. */
asection *segment;
};
#endif
/* Structure for previous label tracking. Needed so that alignments,
callinfo declarations, etc can be easily attached to a particular
label. */
typedef struct label_symbol_struct
{
struct symbol *lss_label;
#ifdef OBJ_SOM
sd_chain_struct *lss_space;
#endif
#ifdef OBJ_ELF
segT lss_segment;
#endif
struct label_symbol_struct *lss_next;
}
label_symbol_struct;
/* Extra information needed to perform fixups (relocations) on the PA. */
struct hppa_fix_struct
{
/* The field selector. */
enum hppa_reloc_field_selector_type_alt fx_r_field;
/* Type of fixup. */
int fx_r_type;
/* Format of fixup. */
int fx_r_format;
/* Argument relocation bits. */
unsigned int fx_arg_reloc;
/* The segment this fixup appears in. */
segT segment;
};
/* Structure to hold information about predefined registers. */
struct pd_reg
{
char *name;
int value;
};
/* This structure defines the mapping from a FP condition string
to a condition number which can be recorded in an instruction. */
struct fp_cond_map
{
char *string;
int cond;
};
/* This structure defines a mapping from a field selector
string to a field selector type. */
struct selector_entry
{
char *prefix;
int field_selector;
};
/* Prototypes for functions local to tc-hppa.c. */
#ifdef OBJ_SOM
static void pa_check_current_space_and_subspace PARAMS ((void));
#endif
#if !(defined (OBJ_ELF) && defined (TE_LINUX))
static void pa_text PARAMS ((int));
static void pa_data PARAMS ((int));
static void pa_comm PARAMS ((int));
#endif
static fp_operand_format pa_parse_fp_format PARAMS ((char **s));
static void pa_cons PARAMS ((int));
static void pa_float_cons PARAMS ((int));
static void pa_fill PARAMS ((int));
static void pa_lcomm PARAMS ((int));
static void pa_lsym PARAMS ((int));
static void pa_stringer PARAMS ((int));
static void pa_version PARAMS ((int));
static int pa_parse_fp_cmp_cond PARAMS ((char **));
static int get_expression PARAMS ((char *));
static int pa_get_absolute_expression PARAMS ((struct pa_it *, char **));
static int evaluate_absolute PARAMS ((struct pa_it *));
static unsigned int pa_build_arg_reloc PARAMS ((char *));
static unsigned int pa_align_arg_reloc PARAMS ((unsigned int, unsigned int));
static int pa_parse_nullif PARAMS ((char **));
static int pa_parse_nonneg_cmpsub_cmpltr PARAMS ((char **, int));
static int pa_parse_neg_cmpsub_cmpltr PARAMS ((char **, int));
static int pa_parse_neg_add_cmpltr PARAMS ((char **, int));
static int pa_parse_nonneg_add_cmpltr PARAMS ((char **, int));
static int pa_parse_cmpb_64_cmpltr PARAMS ((char **));
static int pa_parse_cmpib_64_cmpltr PARAMS ((char **));
static int pa_parse_addb_64_cmpltr PARAMS ((char **));
static void pa_block PARAMS ((int));
static void pa_brtab PARAMS ((int));
static void pa_try PARAMS ((int));
static void pa_call PARAMS ((int));
static void pa_call_args PARAMS ((struct call_desc *));
static void pa_callinfo PARAMS ((int));
static void pa_copyright PARAMS ((int));
static void pa_end PARAMS ((int));
static void pa_enter PARAMS ((int));
static void pa_entry PARAMS ((int));
static void pa_equ PARAMS ((int));
static void pa_exit PARAMS ((int));
static void pa_export PARAMS ((int));
static void pa_type_args PARAMS ((symbolS *, int));
static void pa_import PARAMS ((int));
static void pa_label PARAMS ((int));
static void pa_leave PARAMS ((int));
static void pa_level PARAMS ((int));
static void pa_origin PARAMS ((int));
static void pa_proc PARAMS ((int));
static void pa_procend PARAMS ((int));
static void pa_param PARAMS ((int));
static void pa_undefine_label PARAMS ((void));
static int need_pa11_opcode PARAMS ((void));
static int pa_parse_number PARAMS ((char **, int));
static label_symbol_struct *pa_get_label PARAMS ((void));
#ifdef OBJ_SOM
static int log2 PARAMS ((int));
static void pa_compiler PARAMS ((int));
static void pa_align PARAMS ((int));
static void pa_space PARAMS ((int));
static void pa_spnum PARAMS ((int));
static void pa_subspace PARAMS ((int));
static sd_chain_struct *create_new_space PARAMS ((char *, int, int,
int, int, int,
asection *, int));
static ssd_chain_struct *create_new_subspace PARAMS ((sd_chain_struct *,
char *, int, int,
int, int, int,
int, int, int, int,
int, asection *));
static ssd_chain_struct *update_subspace PARAMS ((sd_chain_struct *,
char *, int, int, int,
int, int, int, int,
int, int, int,
asection *));
static sd_chain_struct *is_defined_space PARAMS ((char *));
static ssd_chain_struct *is_defined_subspace PARAMS ((char *));
static sd_chain_struct *pa_segment_to_space PARAMS ((asection *));
static ssd_chain_struct *pa_subsegment_to_subspace PARAMS ((asection *,
subsegT));
static sd_chain_struct *pa_find_space_by_number PARAMS ((int));
static unsigned int pa_subspace_start PARAMS ((sd_chain_struct *, int));
static sd_chain_struct *pa_parse_space_stmt PARAMS ((char *, int));
static int pa_next_subseg PARAMS ((sd_chain_struct *));
static void pa_spaces_begin PARAMS ((void));
#endif
static void pa_ip PARAMS ((char *));
static void fix_new_hppa PARAMS ((fragS *, int, int, symbolS *,
offsetT, expressionS *, int,
bfd_reloc_code_real_type,
enum hppa_reloc_field_selector_type_alt,
int, unsigned int, int));
static int is_end_of_statement PARAMS ((void));
static int reg_name_search PARAMS ((char *));
static int pa_chk_field_selector PARAMS ((char **));
static int is_same_frag PARAMS ((fragS *, fragS *));
static void process_exit PARAMS ((void));
static unsigned int pa_stringer_aux PARAMS ((char *));
static fp_operand_format pa_parse_fp_cnv_format PARAMS ((char **s));
static int pa_parse_ftest_gfx_completer PARAMS ((char **));
#ifdef OBJ_ELF
static void hppa_elf_mark_end_of_function PARAMS ((void));
static void pa_build_unwind_subspace PARAMS ((struct call_info *));
static void pa_vtable_entry PARAMS ((int));
static void pa_vtable_inherit PARAMS ((int));
#endif
/* File and gloally scoped variable declarations. */
#ifdef OBJ_SOM
/* Root and final entry in the space chain. */
static sd_chain_struct *space_dict_root;
static sd_chain_struct *space_dict_last;
/* The current space and subspace. */
static sd_chain_struct *current_space;
static ssd_chain_struct *current_subspace;
#endif
/* Root of the call_info chain. */
static struct call_info *call_info_root;
/* The last call_info (for functions) structure
seen so it can be associated with fixups and
function labels. */
static struct call_info *last_call_info;
/* The last call description (for actual calls). */
static struct call_desc last_call_desc;
/* handle of the OPCODE hash table */
static struct hash_control *op_hash = NULL;
/* Table of pseudo ops for the PA. FIXME -- how many of these
are now redundant with the overall GAS and the object file
dependent tables? */
const pseudo_typeS md_pseudo_table[] =
{
/* align pseudo-ops on the PA specify the actual alignment requested,
not the log2 of the requested alignment. */
#ifdef OBJ_SOM
{"align", pa_align, 8},
#endif
#ifdef OBJ_ELF
{"align", s_align_bytes, 8},
#endif
{"begin_brtab", pa_brtab, 1},
{"begin_try", pa_try, 1},
{"block", pa_block, 1},
{"blockz", pa_block, 0},
{"byte", pa_cons, 1},
{"call", pa_call, 0},
{"callinfo", pa_callinfo, 0},
#if defined (OBJ_ELF) && defined (TE_LINUX)
{"code", obj_elf_text, 0},
#else
{"code", pa_text, 0},
{"comm", pa_comm, 0},
#endif
#ifdef OBJ_SOM
{"compiler", pa_compiler, 0},
#endif
{"copyright", pa_copyright, 0},
#if !(defined (OBJ_ELF) && defined (TE_LINUX))
{"data", pa_data, 0},
#endif
{"double", pa_float_cons, 'd'},
{"dword", pa_cons, 8},
{"end", pa_end, 0},
{"end_brtab", pa_brtab, 0},
#if !(defined (OBJ_ELF) && defined (TE_LINUX))
{"end_try", pa_try, 0},
#endif
{"enter", pa_enter, 0},
{"entry", pa_entry, 0},
{"equ", pa_equ, 0},
{"exit", pa_exit, 0},
{"export", pa_export, 0},
#ifdef OBJ_ELF
{"file", dwarf2_directive_file, 0 },
#endif
{"fill", pa_fill, 0},
{"float", pa_float_cons, 'f'},
{"half", pa_cons, 2},
{"import", pa_import, 0},
{"int", pa_cons, 4},
{"label", pa_label, 0},
{"lcomm", pa_lcomm, 0},
{"leave", pa_leave, 0},
{"level", pa_level, 0},
#ifdef OBJ_ELF
{"loc", dwarf2_directive_loc, 0 },
#endif
{"long", pa_cons, 4},
{"lsym", pa_lsym, 0},
#ifdef OBJ_SOM
{"nsubspa", pa_subspace, 1},
#endif
{"octa", pa_cons, 16},
{"org", pa_origin, 0},
{"origin", pa_origin, 0},
{"param", pa_param, 0},
{"proc", pa_proc, 0},
{"procend", pa_procend, 0},
{"quad", pa_cons, 8},
{"reg", pa_equ, 1},
{"short", pa_cons, 2},
{"single", pa_float_cons, 'f'},
#ifdef OBJ_SOM
{"space", pa_space, 0},
{"spnum", pa_spnum, 0},
#endif
{"string", pa_stringer, 0},
{"stringz", pa_stringer, 1},
#ifdef OBJ_SOM
{"subspa", pa_subspace, 0},
#endif
#if !(defined (OBJ_ELF) && defined (TE_LINUX))
{"text", pa_text, 0},
#endif
{"version", pa_version, 0},
#ifdef OBJ_ELF
{"vtable_entry", pa_vtable_entry, 0},
{"vtable_inherit", pa_vtable_inherit, 0},
#endif
{"word", pa_cons, 4},
{NULL, 0, 0}
};
/* This array holds the chars that only start a comment at the beginning of
a line. If the line seems to have the form '# 123 filename'
.line and .file directives will appear in the pre-processed output.
Note that input_file.c hand checks for '#' at the beginning of the
first line of the input file. This is because the compiler outputs
#NO_APP at the beginning of its output.
Also note that C style comments will always work. */
const char line_comment_chars[] = "#";
/* This array holds the chars that always start a comment. If the
pre-processor is disabled, these aren't very useful. */
const char comment_chars[] = ";";
/* This array holds the characters which act as line separators. */
const char line_separator_chars[] = "!";
/* Chars that can be used to separate mant from exp in floating point nums. */
const char EXP_CHARS[] = "eE";
/* Chars that mean this number is a floating point constant.
As in 0f12.456 or 0d1.2345e12.
Be aware that MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT may have to be
changed in read.c. Ideally it shouldn't hae to know abou it at
all, but nothing is ideal around here. */
const char FLT_CHARS[] = "rRsSfFdDxXpP";
static struct pa_it the_insn;
/* Points to the end of an expression just parsed by get_expressoin
and friends. FIXME. This shouldn't be handled with a file-global
variable. */
static char *expr_end;
/* Nonzero if a .callinfo appeared within the current procedure. */
static int callinfo_found;
/* Nonzero if the assembler is currently within a .entry/.exit pair. */
static int within_entry_exit;
/* Nonzero if the assembler is currently within a procedure definition. */
static int within_procedure;
/* Handle on structure which keep track of the last symbol
seen in each subspace. */
static label_symbol_struct *label_symbols_rootp = NULL;
/* Holds the last field selector. */
static int hppa_field_selector;
/* Nonzero when strict syntax checking is enabled. Zero otherwise.
Each opcode in the table has a flag which indicates whether or not
strict syntax checking should be enabled for that instruction. */
static int strict = 0;
/* pa_parse_number returns values in `pa_number'. Mostly
pa_parse_number is used to return a register number, with floating
point registers being numbered from FP_REG_BASE upwards.
The bit specified with FP_REG_RSEL is set if the floating point
register has a `r' suffix. */
#define FP_REG_BASE 64
#define FP_REG_RSEL 128
static int pa_number;
#ifdef OBJ_SOM
/* A dummy bfd symbol so that all relocations have symbols of some kind. */
static symbolS *dummy_symbol;
#endif
/* Nonzero if errors are to be printed. */
static int print_errors = 1;
/* List of registers that are pre-defined:
Each general register has one predefined name of the form
%r<REGNUM> which has the value <REGNUM>.
Space and control registers are handled in a similar manner,
but use %sr<REGNUM> and %cr<REGNUM> as their predefined names.
Likewise for the floating point registers, but of the form
%fr<REGNUM>. Floating point registers have additional predefined
names with 'L' and 'R' suffixes (e.g. %fr19L, %fr19R) which
again have the value <REGNUM>.
Many registers also have synonyms:
%r26 - %r23 have %arg0 - %arg3 as synonyms
%r28 - %r29 have %ret0 - %ret1 as synonyms
%r30 has %sp as a synonym
%r27 has %dp as a synonym
%r2 has %rp as a synonym
Almost every control register has a synonym; they are not listed
here for brevity.
The table is sorted. Suitable for searching by a binary search. */
static const struct pd_reg pre_defined_registers[] =
{
{"%arg0", 26},
{"%arg1", 25},
{"%arg2", 24},
{"%arg3", 23},
{"%cr0", 0},
{"%cr10", 10},
{"%cr11", 11},
{"%cr12", 12},
{"%cr13", 13},
{"%cr14", 14},
{"%cr15", 15},
{"%cr16", 16},
{"%cr17", 17},
{"%cr18", 18},
{"%cr19", 19},
{"%cr20", 20},
{"%cr21", 21},
{"%cr22", 22},
{"%cr23", 23},
{"%cr24", 24},
{"%cr25", 25},
{"%cr26", 26},
{"%cr27", 27},
{"%cr28", 28},
{"%cr29", 29},
{"%cr30", 30},
{"%cr31", 31},
{"%cr8", 8},
{"%cr9", 9},
{"%dp", 27},
{"%eiem", 15},
{"%eirr", 23},
{"%fr0", 0 + FP_REG_BASE},
{"%fr0l", 0 + FP_REG_BASE},
{"%fr0r", 0 + FP_REG_BASE + FP_REG_RSEL},
{"%fr1", 1 + FP_REG_BASE},
{"%fr10", 10 + FP_REG_BASE},
{"%fr10l", 10 + FP_REG_BASE},
{"%fr10r", 10 + FP_REG_BASE + FP_REG_RSEL},
{"%fr11", 11 + FP_REG_BASE},
{"%fr11l", 11 + FP_REG_BASE},
{"%fr11r", 11 + FP_REG_BASE + FP_REG_RSEL},
{"%fr12", 12 + FP_REG_BASE},
{"%fr12l", 12 + FP_REG_BASE},
{"%fr12r", 12 + FP_REG_BASE + FP_REG_RSEL},
{"%fr13", 13 + FP_REG_BASE},
{"%fr13l", 13 + FP_REG_BASE},
{"%fr13r", 13 + FP_REG_BASE + FP_REG_RSEL},
{"%fr14", 14 + FP_REG_BASE},
{"%fr14l", 14 + FP_REG_BASE},
{"%fr14r", 14 + FP_REG_BASE + FP_REG_RSEL},
{"%fr15", 15 + FP_REG_BASE},
{"%fr15l", 15 + FP_REG_BASE},
{"%fr15r", 15 + FP_REG_BASE + FP_REG_RSEL},
{"%fr16", 16 + FP_REG_BASE},
{"%fr16l", 16 + FP_REG_BASE},
{"%fr16r", 16 + FP_REG_BASE + FP_REG_RSEL},
{"%fr17", 17 + FP_REG_BASE},
{"%fr17l", 17 + FP_REG_BASE},
{"%fr17r", 17 + FP_REG_BASE + FP_REG_RSEL},
{"%fr18", 18 + FP_REG_BASE},
{"%fr18l", 18 + FP_REG_BASE},
{"%fr18r", 18 + FP_REG_BASE + FP_REG_RSEL},
{"%fr19", 19 + FP_REG_BASE},
{"%fr19l", 19 + FP_REG_BASE},
{"%fr19r", 19 + FP_REG_BASE + FP_REG_RSEL},
{"%fr1l", 1 + FP_REG_BASE},
{"%fr1r", 1 + FP_REG_BASE + FP_REG_RSEL},
{"%fr2", 2 + FP_REG_BASE},
{"%fr20", 20 + FP_REG_BASE},
{"%fr20l", 20 + FP_REG_BASE},
{"%fr20r", 20 + FP_REG_BASE + FP_REG_RSEL},
{"%fr21", 21 + FP_REG_BASE},
{"%fr21l", 21 + FP_REG_BASE},
{"%fr21r", 21 + FP_REG_BASE + FP_REG_RSEL},
{"%fr22", 22 + FP_REG_BASE},
{"%fr22l", 22 + FP_REG_BASE},
{"%fr22r", 22 + FP_REG_BASE + FP_REG_RSEL},
{"%fr23", 23 + FP_REG_BASE},
{"%fr23l", 23 + FP_REG_BASE},
{"%fr23r", 23 + FP_REG_BASE + FP_REG_RSEL},
{"%fr24", 24 + FP_REG_BASE},
{"%fr24l", 24 + FP_REG_BASE},
{"%fr24r", 24 + FP_REG_BASE + FP_REG_RSEL},
{"%fr25", 25 + FP_REG_BASE},
{"%fr25l", 25 + FP_REG_BASE},
{"%fr25r", 25 + FP_REG_BASE + FP_REG_RSEL},
{"%fr26", 26 + FP_REG_BASE},
{"%fr26l", 26 + FP_REG_BASE},
{"%fr26r", 26 + FP_REG_BASE + FP_REG_RSEL},
{"%fr27", 27 + FP_REG_BASE},
{"%fr27l", 27 + FP_REG_BASE},
{"%fr27r", 27 + FP_REG_BASE + FP_REG_RSEL},
{"%fr28", 28 + FP_REG_BASE},
{"%fr28l", 28 + FP_REG_BASE},
{"%fr28r", 28 + FP_REG_BASE + FP_REG_RSEL},
{"%fr29", 29 + FP_REG_BASE},
{"%fr29l", 29 + FP_REG_BASE},
{"%fr29r", 29 + FP_REG_BASE + FP_REG_RSEL},
{"%fr2l", 2 + FP_REG_BASE},
{"%fr2r", 2 + FP_REG_BASE + FP_REG_RSEL},
{"%fr3", 3 + FP_REG_BASE},
{"%fr30", 30 + FP_REG_BASE},
{"%fr30l", 30 + FP_REG_BASE},
{"%fr30r", 30 + FP_REG_BASE + FP_REG_RSEL},
{"%fr31", 31 + FP_REG_BASE},
{"%fr31l", 31 + FP_REG_BASE},
{"%fr31r", 31 + FP_REG_BASE + FP_REG_RSEL},
{"%fr3l", 3 + FP_REG_BASE},
{"%fr3r", 3 + FP_REG_BASE + FP_REG_RSEL},
{"%fr4", 4 + FP_REG_BASE},
{"%fr4l", 4 + FP_REG_BASE},
{"%fr4r", 4 + FP_REG_BASE + FP_REG_RSEL},
{"%fr5", 5 + FP_REG_BASE},
{"%fr5l", 5 + FP_REG_BASE},
{"%fr5r", 5 + FP_REG_BASE + FP_REG_RSEL},
{"%fr6", 6 + FP_REG_BASE},
{"%fr6l", 6 + FP_REG_BASE},
{"%fr6r", 6 + FP_REG_BASE + FP_REG_RSEL},
{"%fr7", 7 + FP_REG_BASE},
{"%fr7l", 7 + FP_REG_BASE},
{"%fr7r", 7 + FP_REG_BASE + FP_REG_RSEL},
{"%fr8", 8 + FP_REG_BASE},
{"%fr8l", 8 + FP_REG_BASE},
{"%fr8r", 8 + FP_REG_BASE + FP_REG_RSEL},
{"%fr9", 9 + FP_REG_BASE},
{"%fr9l", 9 + FP_REG_BASE},
{"%fr9r", 9 + FP_REG_BASE + FP_REG_RSEL},
{"%hta", 25},
{"%iir", 19},
{"%ior", 21},
{"%ipsw", 22},
{"%isr", 20},
{"%itmr", 16},
{"%iva", 14},
{"%pcoq", 18},
{"%pcsq", 17},
{"%pidr1", 8},
{"%pidr2", 9},
{"%pidr3", 12},
{"%pidr4", 13},
{"%ppda", 24},
{"%r0", 0},
{"%r1", 1},
{"%r10", 10},
{"%r11", 11},
{"%r12", 12},
{"%r13", 13},
{"%r14", 14},
{"%r15", 15},
{"%r16", 16},
{"%r17", 17},
{"%r18", 18},
{"%r19", 19},
{"%r2", 2},
{"%r20", 20},
{"%r21", 21},
{"%r22", 22},
{"%r23", 23},
{"%r24", 24},
{"%r25", 25},
{"%r26", 26},
{"%r27", 27},
{"%r28", 28},
{"%r29", 29},
{"%r3", 3},
{"%r30", 30},
{"%r31", 31},
{"%r4", 4},
{"%r5", 5},
{"%r6", 6},
{"%r7", 7},
{"%r8", 8},
{"%r9", 9},
{"%rctr", 0},
{"%ret0", 28},
{"%ret1", 29},
{"%rp", 2},
{"%sar", 11},
{"%sp", 30},
{"%sr0", 0},
{"%sr1", 1},
{"%sr2", 2},
{"%sr3", 3},
{"%sr4", 4},
{"%sr5", 5},
{"%sr6", 6},
{"%sr7", 7},
{"%tr0", 24},
{"%tr1", 25},
{"%tr2", 26},
{"%tr3", 27},
{"%tr4", 28},
{"%tr5", 29},
{"%tr6", 30},
{"%tr7", 31}
};
/* This table is sorted by order of the length of the string. This is
so we check for <> before we check for <. If we had a <> and checked
for < first, we would get a false match. */
static const struct fp_cond_map fp_cond_map[] =
{
{"false?", 0},
{"false", 1},
{"true?", 30},
{"true", 31},
{"!<=>", 3},
{"!?>=", 8},
{"!?<=", 16},
{"!<>", 7},
{"!>=", 11},
{"!?>", 12},
{"?<=", 14},
{"!<=", 19},
{"!?<", 20},
{"?>=", 22},
{"!?=", 24},
{"!=t", 27},
{"<=>", 29},
{"=t", 5},
{"?=", 6},
{"?<", 10},
{"<=", 13},
{"!>", 15},
{"?>", 18},
{">=", 21},
{"!<", 23},
{"<>", 25},
{"!=", 26},
{"!?", 28},
{"?", 2},
{"=", 4},
{"<", 9},
{">", 17}
};
static const struct selector_entry selector_table[] =
{
{"f", e_fsel},
{"l", e_lsel},
{"ld", e_ldsel},
{"lp", e_lpsel},
{"lr", e_lrsel},
{"ls", e_lssel},
{"lt", e_ltsel},
{"ltp", e_ltpsel},
{"n", e_nsel},
{"nl", e_nlsel},
{"nlr", e_nlrsel},
{"p", e_psel},
{"r", e_rsel},
{"rd", e_rdsel},
{"rp", e_rpsel},
{"rr", e_rrsel},
{"rs", e_rssel},
{"rt", e_rtsel},
{"rtp", e_rtpsel},
{"t", e_tsel},
};
#ifdef OBJ_SOM
/* default space and subspace dictionaries */
#define GDB_SYMBOLS GDB_SYMBOLS_SUBSPACE_NAME
#define GDB_STRINGS GDB_STRINGS_SUBSPACE_NAME
/* pre-defined subsegments (subspaces) for the HPPA. */
#define SUBSEG_CODE 0
#define SUBSEG_LIT 1
#define SUBSEG_MILLI 2
#define SUBSEG_DATA 0
#define SUBSEG_BSS 2
#define SUBSEG_UNWIND 3
#define SUBSEG_GDB_STRINGS 0
#define SUBSEG_GDB_SYMBOLS 1
static struct default_subspace_dict pa_def_subspaces[] =
{
{"$CODE$", 1, 1, 1, 0, 0, 0, 24, 0x2c, 0, 8, 0, 0, SUBSEG_CODE},
{"$DATA$", 1, 1, 0, 0, 0, 0, 24, 0x1f, 1, 8, 1, 1, SUBSEG_DATA},
{"$LIT$", 1, 1, 0, 0, 0, 0, 16, 0x2c, 0, 8, 0, 0, SUBSEG_LIT},
{"$MILLICODE$", 1, 1, 0, 0, 0, 0, 8, 0x2c, 0, 8, 0, 0, SUBSEG_MILLI},
{"$BSS$", 1, 1, 0, 0, 0, 1, 80, 0x1f, 1, 8, 1, 1, SUBSEG_BSS},
{NULL, 0, 1, 0, 0, 0, 0, 255, 0x1f, 0, 4, 0, 0, 0}
};
static struct default_space_dict pa_def_spaces[] =
{
{"$TEXT$", 0, 1, 1, 0, 8, ASEC_NULL},
{"$PRIVATE$", 1, 1, 1, 1, 16, ASEC_NULL},
{NULL, 0, 0, 0, 0, 0, ASEC_NULL}
};
/* Misc local definitions used by the assembler. */
/* These macros are used to maintain spaces/subspaces. */
#define SPACE_DEFINED(space_chain) (space_chain)->sd_defined
#define SPACE_USER_DEFINED(space_chain) (space_chain)->sd_user_defined
#define SPACE_SPNUM(space_chain) (space_chain)->sd_spnum
#define SPACE_NAME(space_chain) (space_chain)->sd_name
#define SUBSPACE_DEFINED(ss_chain) (ss_chain)->ssd_defined
#define SUBSPACE_NAME(ss_chain) (ss_chain)->ssd_name
#endif
/* Return nonzero if the string pointed to by S potentially represents
a right or left half of a FP register */
#define IS_R_SELECT(S) (*(S) == 'R' || *(S) == 'r')
#define IS_L_SELECT(S) (*(S) == 'L' || *(S) == 'l')
/* Insert FIELD into OPCODE starting at bit START. Continue pa_ip
main loop after insertion. */
#define INSERT_FIELD_AND_CONTINUE(OPCODE, FIELD, START) \
{ \
((OPCODE) |= (FIELD) << (START)); \
continue; \
}
/* Simple range checking for FIELD againt HIGH and LOW bounds.
IGNORE is used to suppress the error message. */
#define CHECK_FIELD(FIELD, HIGH, LOW, IGNORE) \
{ \
if ((FIELD) > (HIGH) || (FIELD) < (LOW)) \
{ \
if (! IGNORE) \
as_bad (_("Field out of range [%d..%d] (%d)."), (LOW), (HIGH), \
(int) (FIELD));\
break; \
} \
}
/* Simple alignment checking for FIELD againt ALIGN (a power of two).
IGNORE is used to suppress the error message. */
#define CHECK_ALIGN(FIELD, ALIGN, IGNORE) \
{ \
if ((FIELD) & ((ALIGN) - 1)) \
{ \
if (! IGNORE) \
as_bad (_("Field not properly aligned [%d] (%d)."), (ALIGN), \
(int) (FIELD));\
break; \
} \
}
#define is_DP_relative(exp) \
((exp).X_op == O_subtract \
&& strcmp (S_GET_NAME ((exp).X_op_symbol), "$global$") == 0)
#define is_PC_relative(exp) \
((exp).X_op == O_subtract \
&& strcmp (S_GET_NAME ((exp).X_op_symbol), "$PIC_pcrel$0") == 0)
/* We need some complex handling for stabs (sym1 - sym2). Luckily, we'll
always be able to reduce the expression to a constant, so we don't
need real complex handling yet. */
#define is_complex(exp) \
((exp).X_op != O_constant && (exp).X_op != O_symbol)
/* Actual functions to implement the PA specific code for the assembler. */
/* Called before writing the object file. Make sure entry/exit and
proc/procend pairs match. */
void
pa_check_eof ()
{
if (within_entry_exit)
as_fatal (_("Missing .exit\n"));
if (within_procedure)
as_fatal (_("Missing .procend\n"));
}
/* Returns a pointer to the label_symbol_struct for the current space.
or NULL if no label_symbol_struct exists for the current space. */
static label_symbol_struct *
pa_get_label ()
{
label_symbol_struct *label_chain;
for (label_chain = label_symbols_rootp;
label_chain;
label_chain = label_chain->lss_next)
{
#ifdef OBJ_SOM
if (current_space == label_chain->lss_space && label_chain->lss_label)
return label_chain;
#endif
#ifdef OBJ_ELF
if (now_seg == label_chain->lss_segment && label_chain->lss_label)
return label_chain;
#endif
}
return NULL;
}
/* Defines a label for the current space. If one is already defined,
this function will replace it with the new label. */
void
pa_define_label (symbol)
symbolS *symbol;
{
label_symbol_struct *label_chain = pa_get_label ();
if (label_chain)
label_chain->lss_label = symbol;
else
{
/* Create a new label entry and add it to the head of the chain. */
label_chain
= (label_symbol_struct *) xmalloc (sizeof (label_symbol_struct));
label_chain->lss_label = symbol;
#ifdef OBJ_SOM
label_chain->lss_space = current_space;
#endif
#ifdef OBJ_ELF
label_chain->lss_segment = now_seg;
#endif
label_chain->lss_next = NULL;
if (label_symbols_rootp)
label_chain->lss_next = label_symbols_rootp;
label_symbols_rootp = label_chain;
}
}
/* Removes a label definition for the current space.
If there is no label_symbol_struct entry, then no action is taken. */
static void
pa_undefine_label ()
{
label_symbol_struct *label_chain;
label_symbol_struct *prev_label_chain = NULL;
for (label_chain = label_symbols_rootp;
label_chain;
label_chain = label_chain->lss_next)
{
if (1
#ifdef OBJ_SOM
&& current_space == label_chain->lss_space && label_chain->lss_label
#endif
#ifdef OBJ_ELF
&& now_seg == label_chain->lss_segment && label_chain->lss_label
#endif
)
{
/* Remove the label from the chain and free its memory. */
if (prev_label_chain)
prev_label_chain->lss_next = label_chain->lss_next;
else
label_symbols_rootp = label_chain->lss_next;
free (label_chain);
break;
}
prev_label_chain = label_chain;
}
}
/* An HPPA-specific version of fix_new. This is required because the HPPA
code needs to keep track of some extra stuff. Each call to fix_new_hppa
results in the creation of an instance of an hppa_fix_struct. An
hppa_fix_struct stores the extra information along with a pointer to the
original fixS. This is attached to the original fixup via the
tc_fix_data field. */
static void
fix_new_hppa (frag, where, size, add_symbol, offset, exp, pcrel,
r_type, r_field, r_format, arg_reloc, unwind_bits)
fragS *frag;
int where;
int size;
symbolS *add_symbol;
offsetT offset;
expressionS *exp;
int pcrel;
bfd_reloc_code_real_type r_type;
enum hppa_reloc_field_selector_type_alt r_field;
int r_format;
unsigned int arg_reloc;
int unwind_bits ATTRIBUTE_UNUSED;
{
fixS *new_fix;
struct hppa_fix_struct *hppa_fix = (struct hppa_fix_struct *)
obstack_alloc (&notes, sizeof (struct hppa_fix_struct));
if (exp != NULL)
new_fix = fix_new_exp (frag, where, size, exp, pcrel, r_type);
else
new_fix = fix_new (frag, where, size, add_symbol, offset, pcrel, r_type);
new_fix->tc_fix_data = (void *) hppa_fix;
hppa_fix->fx_r_type = r_type;
hppa_fix->fx_r_field = r_field;
hppa_fix->fx_r_format = r_format;
hppa_fix->fx_arg_reloc = arg_reloc;
hppa_fix->segment = now_seg;
#ifdef OBJ_SOM
if (r_type == R_ENTRY || r_type == R_EXIT)
new_fix->fx_offset = unwind_bits;
#endif
/* foo-$global$ is used to access non-automatic storage. $global$
is really just a marker and has served its purpose, so eliminate
it now so as not to confuse write.c. Ditto for $PIC_pcrel$0. */
if (new_fix->fx_subsy
&& (strcmp (S_GET_NAME (new_fix->fx_subsy), "$global$") == 0
|| strcmp (S_GET_NAME (new_fix->fx_subsy), "$PIC_pcrel$0") == 0))
new_fix->fx_subsy = NULL;
}
/* Parse a .byte, .word, .long expression for the HPPA. Called by
cons via the TC_PARSE_CONS_EXPRESSION macro. */
void
parse_cons_expression_hppa (exp)
expressionS *exp;
{
hppa_field_selector = pa_chk_field_selector (&input_line_pointer);
expression (exp);
}
/* This fix_new is called by cons via TC_CONS_FIX_NEW.
hppa_field_selector is set by the parse_cons_expression_hppa. */
void
cons_fix_new_hppa (frag, where, size, exp)
fragS *frag;
int where;
int size;
expressionS *exp;
{
unsigned int rel_type;
/* Get a base relocation type. */
if (is_DP_relative (*exp))
rel_type = R_HPPA_GOTOFF;
else if (is_complex (*exp))
rel_type = R_HPPA_COMPLEX;
else
rel_type = R_HPPA;
if (hppa_field_selector != e_psel && hppa_field_selector != e_fsel)
{
as_warn (_("Invalid field selector. Assuming F%%."));
hppa_field_selector = e_fsel;
}
fix_new_hppa (frag, where, size,
(symbolS *) NULL, (offsetT) 0, exp, 0, rel_type,
hppa_field_selector, size * 8, 0, 0);
/* Reset field selector to its default state. */
hppa_field_selector = 0;
}
/* This function is called once, at assembler startup time. It should
set up all the tables, etc. that the MD part of the assembler will need. */
void
md_begin ()
{
const char *retval = NULL;
int lose = 0;
unsigned int i = 0;
last_call_info = NULL;
call_info_root = NULL;
/* Set the default machine type. */
if (!bfd_set_arch_mach (stdoutput, bfd_arch_hppa, DEFAULT_LEVEL))
as_warn (_("could not set architecture and machine"));
/* Folding of text and data segments fails miserably on the PA.
Warn user and disable "-R" option. */
if (flag_readonly_data_in_text)
{
as_warn (_("-R option not supported on this target."));
flag_readonly_data_in_text = 0;
}
#ifdef OBJ_SOM
pa_spaces_begin ();
#endif
op_hash = hash_new ();
while (i < NUMOPCODES)
{
const char *name = pa_opcodes[i].name;
retval = hash_insert (op_hash, name, (struct pa_opcode *) &pa_opcodes[i]);
if (retval != NULL && *retval != '\0')
{
as_fatal (_("Internal error: can't hash `%s': %s\n"), name, retval);
lose = 1;
}
do
{
if ((pa_opcodes[i].match & pa_opcodes[i].mask)
!= pa_opcodes[i].match)
{
fprintf (stderr, _("internal error: losing opcode: `%s' \"%s\"\n"),
pa_opcodes[i].name, pa_opcodes[i].args);
lose = 1;
}
++i;
}
while (i < NUMOPCODES && !strcmp (pa_opcodes[i].name, name));
}
if (lose)
as_fatal (_("Broken assembler. No assembly attempted."));
#ifdef OBJ_SOM
/* SOM will change text_section. To make sure we never put
anything into the old one switch to the new one now. */
subseg_set (text_section, 0);
#endif
#ifdef OBJ_SOM
dummy_symbol = symbol_find_or_make ("L$dummy");
S_SET_SEGMENT (dummy_symbol, text_section);
/* Force the symbol to be converted to a real symbol. */
(void) symbol_get_bfdsym (dummy_symbol);
#endif
}
/* Assemble a single instruction storing it into a frag. */
void
md_assemble (str)
char *str;
{
char *to;
/* The had better be something to assemble. */
assert (str);
/* If we are within a procedure definition, make sure we've
defined a label for the procedure; handle case where the
label was defined after the .PROC directive.
Note there's not need to diddle with the segment or fragment
for the label symbol in this case. We have already switched
into the new $CODE$ subspace at this point. */
if (within_procedure && last_call_info->start_symbol == NULL)
{
label_symbol_struct *label_symbol = pa_get_label ();
if (label_symbol)
{
if (label_symbol->lss_label)
{
last_call_info->start_symbol = label_symbol->lss_label;
symbol_get_bfdsym (label_symbol->lss_label)->flags
|= BSF_FUNCTION;
#ifdef OBJ_SOM
/* Also handle allocation of a fixup to hold the unwind
information when the label appears after the proc/procend. */
if (within_entry_exit)
{
char *where;
unsigned int u;
where = frag_more (0);
u = UNWIND_LOW32 (&last_call_info->ci_unwind.descriptor);
fix_new_hppa (frag_now, where - frag_now->fr_literal, 0,
NULL, (offsetT) 0, NULL,
0, R_HPPA_ENTRY, e_fsel, 0, 0, u);
}
#endif
}
else
as_bad (_("Missing function name for .PROC (corrupted label chain)"));
}
else
as_bad (_("Missing function name for .PROC"));
}
/* Assemble the instruction. Results are saved into "the_insn". */
pa_ip (str);
/* Get somewhere to put the assembled instrution. */
to = frag_more (4);
/* Output the opcode. */
md_number_to_chars (to, the_insn.opcode, 4);
/* If necessary output more stuff. */
if (the_insn.reloc != R_HPPA_NONE)
fix_new_hppa (frag_now, (to - frag_now->fr_literal), 4, NULL,
(offsetT) 0, &the_insn.exp, the_insn.pcrel,
the_insn.reloc, the_insn.field_selector,
the_insn.format, the_insn.arg_reloc, 0);
#ifdef OBJ_ELF
dwarf2_emit_insn (4);
#endif
}
/* Do the real work for assembling a single instruction. Store results
into the global "the_insn" variable. */
static void
pa_ip (str)
char *str;
{
char *error_message = "";
char *s, c, *argstart, *name, *save_s;
const char *args;
int match = FALSE;
int comma = 0;
int cmpltr, nullif, flag, cond, num;
unsigned long opcode;
struct pa_opcode *insn;
#ifdef OBJ_SOM
/* We must have a valid space and subspace. */
pa_check_current_space_and_subspace ();
#endif
/* Convert everything up to the first whitespace character into lower
case. */
for (s = str; *s != ' ' && *s != '\t' && *s != '\n' && *s != '\0'; s++)
if (isupper (*s))
*s = tolower (*s);
/* Skip to something interesting. */
for (s = str; isupper (*s) || islower (*s) || (*s >= '0' && *s <= '3'); ++s)
;
switch (*s)
{
case '\0':
break;
case ',':
comma = 1;
/*FALLTHROUGH */
case ' ':
*s++ = '\0';
break;
default:
as_fatal (_("Unknown opcode: `%s'"), str);
}
save_s = str;
/* Look up the opcode in the has table. */
if ((insn = (struct pa_opcode *) hash_find (op_hash, str)) == NULL)
{
as_bad ("Unknown opcode: `%s'", str);
return;
}
if (comma)
{
*--s = ',';
}
/* Mark the location where arguments for the instruction start, then
start processing them. */
argstart = s;
for (;;)
{
/* Do some initialization. */
opcode = insn->match;
strict = (insn->flags & FLAG_STRICT);
memset (&the_insn, 0, sizeof (the_insn));
the_insn.reloc = R_HPPA_NONE;
/* If this instruction is specific to a particular architecture,
then set a new architecture. */
/* But do not automatically promote to pa2.0. The automatic promotion
crud is for compatability with HP's old assemblers only. */
if (insn->arch < 20
&& bfd_get_mach (stdoutput) < insn->arch)
{
if (!bfd_set_arch_mach (stdoutput, bfd_arch_hppa, insn->arch))
as_warn (_("could not update architecture and machine"));
}
else if (bfd_get_mach (stdoutput) < insn->arch)
{
match = FALSE;
goto failed;
}
/* Build the opcode, checking as we go to make
sure that the operands match. */
for (args = insn->args;; ++args)
{
/* Absorb white space in instruction. */
while (*s == ' ' || *s == '\t')
s++;
switch (*args)
{
/* End of arguments. */
case '\0':
if (*s == '\0')
match = TRUE;
break;
case '+':
if (*s == '+')
{
++s;
continue;
}
if (*s == '-')
continue;
break;
/* These must match exactly. */
case '(':
case ')':
case ',':
case ' ':
if (*s++ == *args)
continue;
break;
/* Handle a 5 bit register or control register field at 10. */
case 'b':
case '^':
if (!pa_parse_number (&s, 0))
break;
num = pa_number;
CHECK_FIELD (num, 31, 0, 0);
INSERT_FIELD_AND_CONTINUE (opcode, num, 21);
/* Handle %sar or %cr11. No bits get set, we just verify that it
is there. */
case '!':
/* Skip whitespace before register. */
while (*s == ' ' || *s == '\t')
s = s + 1;
if (!strncasecmp(s, "%sar", 4))
{
s += 4;
continue;
}
else if (!strncasecmp(s, "%cr11", 5))
{
s += 5;
continue;
}
break;
/* Handle a 5 bit register field at 15. */
case 'x':
if (!pa_parse_number (&s, 0))
break;
num = pa_number;
CHECK_FIELD (num, 31, 0, 0);
INSERT_FIELD_AND_CONTINUE (opcode, num, 16);
/* Handle a 5 bit register field at 31. */
case 't':
if (!pa_parse_number (&s, 0))
break;
num = pa_number;
CHECK_FIELD (num, 31, 0, 0);
INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
/* Handle a 5 bit register field at 10 and 15. */
case 'a':
if (!pa_parse_number (&s, 0))
break;
num = pa_number;
CHECK_FIELD (num, 31, 0, 0);
opcode |= num << 16;
INSERT_FIELD_AND_CONTINUE (opcode, num, 21);
/* Handle a 5 bit field length at 31. */
case 'T':
num = pa_get_absolute_expression (&the_insn, &s);
if (strict && the_insn.exp.X_op != O_constant)
break;
s = expr_end;
CHECK_FIELD (num, 32, 1, 0);
INSERT_FIELD_AND_CONTINUE (opcode, 32 - num, 0);
/* Handle a 5 bit immediate at 15. */
case '5':
num = pa_get_absolute_expression (&the_insn, &s);
if (strict && the_insn.exp.X_op != O_constant)
break;
s = expr_end;
/* When in strict mode, we want to just reject this
match instead of giving an out of range error. */
CHECK_FIELD (num, 15, -16, strict);
num = low_sign_unext (num, 5);
INSERT_FIELD_AND_CONTINUE (opcode, num, 16);
/* Handle a 5 bit immediate at 31. */
case 'V':
num = pa_get_absolute_expression (&the_insn, &s);
if (strict && the_insn.exp.X_op != O_constant)
break;
s = expr_end;
/* When in strict mode, we want to just reject this
match instead of giving an out of range error. */
CHECK_FIELD (num, 15, -16, strict);
num = low_sign_unext (num, 5);
INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
/* Handle an unsigned 5 bit immediate at 31. */
case 'r':
num = pa_get_absolute_expression (&the_insn, &s);
if (strict && the_insn.exp.X_op != O_constant)
break;
s = expr_end;
CHECK_FIELD (num, 31, 0, strict);
INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
/* Handle an unsigned 5 bit immediate at 15. */
case 'R':
num = pa_get_absolute_expression (&the_insn, &s);
if (strict && the_insn.exp.X_op != O_constant)
break;
s = expr_end;
CHECK_FIELD (num, 31, 0, strict);
INSERT_FIELD_AND_CONTINUE (opcode, num, 16);
/* Handle an unsigned 10 bit immediate at 15. */
case 'U':
num = pa_get_absolute_expression (&the_insn, &s);
if (strict && the_insn.exp.X_op != O_constant)
break;
s = expr_end;
CHECK_FIELD (num, 1023, 0, strict);
INSERT_FIELD_AND_CONTINUE (opcode, num, 16);
/* Handle a 2 bit space identifier at 17. */
case 's':
if (!pa_parse_number (&s, 0))
break;
num = pa_number;
CHECK_FIELD (num, 3, 0, 1);
INSERT_FIELD_AND_CONTINUE (opcode, num, 14);
/* Handle a 3 bit space identifier at 18. */
case 'S':
if (!pa_parse_number (&s, 0))
break;
num = pa_number;
CHECK_FIELD (num, 7, 0, 1);
opcode |= re_assemble_3 (num);
continue;
/* Handle all completers. */
case 'c':
switch (*++args)
{
/* Handle a completer for an indexing load or store. */
case 'x':
{
int uu = 0;
int m = 0;
int i = 0;
while (*s == ',' && i < 2)
{
s++;
if (strncasecmp (s, "sm", 2) == 0)
{
uu = 1;
m = 1;
s++;
i++;
}
else if (strncasecmp (s, "m", 1) == 0)
m = 1;
else if ((strncasecmp (s, "s ", 2) == 0)
|| (strncasecmp (s, "s,", 2) == 0))
uu = 1;
/* When in strict mode this is a match failure. */
else if (strict)
{
s--;
break;
}
else
as_bad (_("Invalid Indexed Load Completer."));
s++;
i++;
}
if (i > 2)
as_bad (_("Invalid Indexed Load Completer Syntax."));
opcode |= m << 5;
INSERT_FIELD_AND_CONTINUE (opcode, uu, 13);
}
/* Handle a short load/store completer. */
case 'm':
case 'q':
case 'J':
case 'e':
{
int a = 0;
int m = 0;
if (*s == ',')
{
int found = 0;
s++;
if (strncasecmp (s, "ma", 2) == 0)
{
a = 0;
m = 1;
found = 1;
}
else if (strncasecmp (s, "mb", 2) == 0)
{
a = 1;
m = 1;
found = 1;
}
/* When in strict mode, pass through for cache op. */
if (!found && strict)
s--;
else
{
if (!found)
as_bad (_("Invalid Short Load/Store Completer."));
s += 2;
}
}
/* If we did not get a ma/mb completer, then we do not
consider this a positive match for 'ce'. */
else if (*args == 'e')
break;
/* 'J', 'm' and 'q' are the same, except for where they
encode the before/after field. */
if (*args == 'm')
{
opcode |= m << 5;
INSERT_FIELD_AND_CONTINUE (opcode, a, 13);
}
else if (*args == 'q')
{
opcode |= m << 3;
INSERT_FIELD_AND_CONTINUE (opcode, a, 2);
}
else if (*args == 'J')
{
/* M bit is explicit in the major opcode. */
INSERT_FIELD_AND_CONTINUE (opcode, a, 2);
}
else if (*args == 'e')
{
/* Stash the ma/mb flag temporarily in the
instruction. We will use (and remove it)
later when handling 'J', 'K', '<' & '>'. */
opcode |= a;
continue;
}
}
/* Handle a stbys completer. */
case 's':
{
int a = 0;
int m = 0;
int i = 0;
while (*s == ',' && i < 2)
{
s++;
if (strncasecmp (s, "m", 1) == 0)
m = 1;
else if ((strncasecmp (s, "b ", 2) == 0)
|| (strncasecmp (s, "b,", 2) == 0))
a = 0;
else if (strncasecmp (s, "e", 1) == 0)
a = 1;
/* When in strict mode this is a match failure. */
else if (strict)
{
s--;
break;
}
else
as_bad (_("Invalid Store Bytes Short Completer"));
s++;
i++;
}
if (i > 2)
as_bad (_("Invalid Store Bytes Short Completer"));
opcode |= m << 5;
INSERT_FIELD_AND_CONTINUE (opcode, a, 13);
}
/* Handle load cache hint completer. */
case 'c':
cmpltr = 0;
if (!strncmp(s, ",sl", 3))
{
s += 3;
cmpltr = 2;
}
INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 10);
/* Handle store cache hint completer. */
case 'C':
cmpltr = 0;
if (!strncmp(s, ",sl", 3))
{
s += 3;
cmpltr = 2;
}
else if (!strncmp(s, ",bc", 3))
{
s += 3;
cmpltr = 1;
}
INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 10);
/* Handle load and clear cache hint completer. */
case 'd':
cmpltr = 0;
if (!strncmp(s, ",co", 3))
{
s += 3;
cmpltr = 1;
}
INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 10);
/* Handle load ordering completer. */
case 'o':
if (strncmp(s, ",o", 2) != 0)
break;
s += 2;
continue;
/* Handle a branch gate completer. */
case 'g':
if (strncasecmp (s, ",gate", 5) != 0)
break;
s += 5;
continue;
/* Handle a branch link and push completer. */
case 'p':
if (strncasecmp (s, ",l,push", 7) != 0)
break;
s += 7;
continue;
/* Handle a branch link completer. */
case 'l':
if (strncasecmp (s, ",l", 2) != 0)
break;
s += 2;
continue;
/* Handle a branch pop completer. */
case 'P':
if (strncasecmp (s, ",pop", 4) != 0)
break;
s += 4;
continue;
/* Handle a local processor completer. */
case 'L':
if (strncasecmp (s, ",l", 2) != 0)
break;
s += 2;
continue;
/* Handle a PROBE read/write completer. */
case 'w':
flag = 0;
if (!strncasecmp (s, ",w", 2))
{
flag = 1;
s += 2;
}
else if (!strncasecmp (s, ",r", 2))
{
flag = 0;
s += 2;
}
INSERT_FIELD_AND_CONTINUE (opcode, flag, 6);
/* Handle MFCTL wide completer. */
case 'W':
if (strncasecmp (s, ",w", 2) != 0)
break;
s += 2;
continue;
/* Handle an RFI restore completer. */
case 'r':
flag = 0;
if (!strncasecmp (s, ",r", 2))
{
flag = 5;
s += 2;
}
INSERT_FIELD_AND_CONTINUE (opcode, flag, 5);
/* Handle a system control completer. */
case 'Z':
if (*s == ',' && (*(s + 1) == 'm' || *(s + 1) == 'M'))
{
flag = 1;
s += 2;
}
else
flag = 0;
INSERT_FIELD_AND_CONTINUE (opcode, flag, 5);
/* Handle intermediate/final completer for DCOR. */
case 'i':
flag = 0;
if (!strncasecmp (s, ",i", 2))
{
flag = 1;
s += 2;
}
INSERT_FIELD_AND_CONTINUE (opcode, flag, 6);
/* Handle zero/sign extension completer. */
case 'z':
flag = 1;
if (!strncasecmp (s, ",z", 2))
{
flag = 0;
s += 2;
}
INSERT_FIELD_AND_CONTINUE (opcode, flag, 10);
/* Handle add completer. */
case 'a':
flag = 1;
if (!strncasecmp (s, ",l", 2))
{
flag = 2;
s += 2;
}
else if (!strncasecmp (s, ",tsv", 4))
{
flag = 3;
s += 4;
}
INSERT_FIELD_AND_CONTINUE (opcode, flag, 10);
/* Handle 64 bit carry for ADD. */
case 'Y':
flag = 0;
if (!strncasecmp (s, ",dc,tsv", 7) ||
!strncasecmp (s, ",tsv,dc", 7))
{
flag = 1;
s += 7;
}
else if (!strncasecmp (s, ",dc", 3))
{
flag = 0;
s += 3;
}
else
break;
INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
/* Handle 32 bit carry for ADD. */
case 'y':
flag = 0;
if (!strncasecmp (s, ",c,tsv", 6) ||
!strncasecmp (s, ",tsv,c", 6))
{
flag = 1;
s += 6;
}
else if (!strncasecmp (s, ",c", 2))
{
flag = 0;
s += 2;
}
else
break;
INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
/* Handle trap on signed overflow. */
case 'v':
flag = 0;
if (!strncasecmp (s, ",tsv", 4))
{
flag = 1;
s += 4;
}
INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
/* Handle trap on condition and overflow. */
case 't':
flag = 0;
if (!strncasecmp (s, ",tc,tsv", 7) ||
!strncasecmp (s, ",tsv,tc", 7))
{
flag = 1;
s += 7;
}
else if (!strncasecmp (s, ",tc", 3))
{
flag = 0;
s += 3;
}
else
break;
INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
/* Handle 64 bit borrow for SUB. */
case 'B':
flag = 0;
if (!strncasecmp (s, ",db,tsv", 7) ||
!strncasecmp (s, ",tsv,db", 7))
{
flag = 1;
s += 7;
}
else if (!strncasecmp (s, ",db", 3))
{
flag = 0;
s += 3;
}
else
break;
INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
/* Handle 32 bit borrow for SUB. */
case 'b':
flag = 0;
if (!strncasecmp (s, ",b,tsv", 6) ||
!strncasecmp (s, ",tsv,b", 6))
{
flag = 1;
s += 6;
}
else if (!strncasecmp (s, ",b", 2))
{
flag = 0;
s += 2;
}
else
break;
INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
/* Handle trap condition completer for UADDCM. */
case 'T':
flag = 0;
if (!strncasecmp (s, ",tc", 3))
{
flag = 1;
s += 3;
}
INSERT_FIELD_AND_CONTINUE (opcode, flag, 6);
/* Handle signed/unsigned at 21. */
case 'S':
{
int sign = 1;
if (strncasecmp (s, ",s", 2) == 0)
{
sign = 1;
s += 2;
}
else if (strncasecmp (s, ",u", 2) == 0)
{
sign = 0;
s += 2;
}
INSERT_FIELD_AND_CONTINUE (opcode, sign, 10);
}
/* Handle left/right combination at 17:18. */
case 'h':
if (*s++ == ',')
{
int lr = 0;
if (*s == 'r')
lr = 2;
else if (*s == 'l')
lr = 0;
else
as_bad(_("Invalid left/right combination completer"));
s++;
INSERT_FIELD_AND_CONTINUE (opcode, lr, 13);
}
else
as_bad(_("Invalid left/right combination completer"));
break;
/* Handle saturation at 24:25. */
case 'H':
{
int sat = 3;
if (strncasecmp (s, ",ss", 3) == 0)
{
sat = 1;
s += 3;
}
else if (strncasecmp (s, ",us", 3) == 0)
{
sat = 0;
s += 3;
}
INSERT_FIELD_AND_CONTINUE (opcode, sat, 6);
}
/* Handle permutation completer. */
case '*':
if (*s++ == ',')
{
int permloc[4];
int perm = 0;
int i = 0;
permloc[0] = 13;
permloc[1] = 10;
permloc[2] = 8;
permloc[3] = 6;
for (; i < 4; i++)
{
switch (*s++)
{
case '0':
perm = 0;
break;
case '1':
perm = 1;
break;
case '2':
perm = 2;
break;
case '3':
perm = 3;
break;
default:
as_bad(_("Invalid permutation completer"));
}
opcode |= perm << permloc[i];
}
continue;
}
else
as_bad(_("Invalid permutation completer"));
break;
default:
abort ();
}
break;
/* Handle all conditions. */
case '?':
{
args++;
switch (*args)
{
/* Handle FP compare conditions. */
case 'f':
cond = pa_parse_fp_cmp_cond (&s);
INSERT_FIELD_AND_CONTINUE (opcode, cond, 0);
/* Handle an add condition. */
case 'A':
case 'a':
cmpltr = 0;
flag = 0;
if (*s == ',')
{
s++;
/* 64 bit conditions. */
if (*args == 'A')
{
if (*s == '*')
s++;
else
break;
}
else if (*s == '*')
break;
name = s;
name = s;
while (*s != ',' && *s != ' ' && *s != '\t')
s += 1;
c = *s;
*s = 0x00;
if (strcmp (name, "=") == 0)
cmpltr = 1;
else if (strcmp (name, "<") == 0)
cmpltr = 2;
else if (strcmp (name, "<=") == 0)
cmpltr = 3;
else if (strcasecmp (name, "nuv") == 0)
cmpltr = 4;
else if (strcasecmp (name, "znv") == 0)
cmpltr = 5;
else if (strcasecmp (name, "sv") == 0)
cmpltr = 6;
else if (strcasecmp (name, "od") == 0)
cmpltr = 7;
else if (strcasecmp (name, "tr") == 0)
{
cmpltr = 0;
flag = 1;
}
else if (strcmp (name, "<>") == 0)
{
cmpltr = 1;
flag = 1;
}
else if (strcmp (name, ">=") == 0)
{
cmpltr = 2;
flag = 1;
}
else if (strcmp (name, ">") == 0)
{
cmpltr = 3;
flag = 1;
}
else if (strcasecmp (name, "uv") == 0)
{
cmpltr = 4;
flag = 1;
}
else if (strcasecmp (name, "vnz") == 0)
{
cmpltr = 5;
flag = 1;
}
else if (strcasecmp (name, "nsv") == 0)
{
cmpltr = 6;
flag = 1;
}
else if (strcasecmp (name, "ev") == 0)
{
cmpltr = 7;
flag = 1;
}
/* ",*" is a valid condition. */
else if (*args == 'a')
as_bad (_("Invalid Add Condition: %s"), name);
*s = c;
}
opcode |= cmpltr << 13;
INSERT_FIELD_AND_CONTINUE (opcode, flag, 12);
/* Handle non-negated add and branch condition. */
case 'd':
cmpltr = pa_parse_nonneg_add_cmpltr (&s, 1);
if (cmpltr < 0)
{
as_bad (_("Invalid Add and Branch Condition: %c"), *s);
cmpltr = 0;
}
INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 13);
/* Handle 64 bit wide-mode add and branch condition. */
case 'W':
cmpltr = pa_parse_addb_64_cmpltr (&s);
if (cmpltr < 0)
{
as_bad (_("Invalid Add and Branch Condition: %c"), *s);
cmpltr = 0;
}
else
{
/* Negated condition requires an opcode change. */
opcode |= (cmpltr & 8) << 24;
}
INSERT_FIELD_AND_CONTINUE (opcode, cmpltr & 7, 13);
/* Handle a negated or non-negated add and branch
condition. */
case '@':
save_s = s;
cmpltr = pa_parse_nonneg_add_cmpltr (&s, 1);
if (cmpltr < 0)
{
s = save_s;
cmpltr = pa_parse_neg_add_cmpltr (&s, 1);
if (cmpltr < 0)
{
as_bad (_("Invalid Compare/Subtract Condition"));
cmpltr = 0;
}
else
{
/* Negated condition requires an opcode change. */
opcode |= 1 << 27;
}
}
INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 13);
/* Handle branch on bit conditions. */
case 'B':
case 'b':
cmpltr = 0;
if (*s == ',')
{
s++;
if (*args == 'B')
{
if (*s == '*')
s++;
else
break;
}
else if (*s == '*')
break;
if (strncmp (s, "<", 1) == 0)
{
cmpltr = 0;
s++;
}
else if (strncmp (s, ">=", 2) == 0)
{
cmpltr = 1;
s += 2;
}
else
as_bad (_("Invalid Bit Branch Condition: %c"), *s);
}
INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 15);
/* Handle a compare/subtract condition. */
case 'S':
case 's':
cmpltr = 0;
flag = 0;
if (*s == ',')
{
s++;
/* 64 bit conditions. */
if (*args == 'S')
{
if (*s == '*')
s++;
else
break;
}
else if (*s == '*')
break;
name = s;
name = s;
while (*s != ',' && *s != ' ' && *s != '\t')
s += 1;
c = *s;
*s = 0x00;
if (strcmp (name, "=") == 0)
cmpltr = 1;
else if (strcmp (name, "<") == 0)
cmpltr = 2;
else if (strcmp (name, "<=") == 0)
cmpltr = 3;
else if (strcasecmp (name, "<<") == 0)
cmpltr = 4;
else if (strcasecmp (name, "<<=") == 0)
cmpltr = 5;
else if (strcasecmp (name, "sv") == 0)
cmpltr = 6;
else if (strcasecmp (name, "od") == 0)
cmpltr = 7;
else if (strcasecmp (name, "tr") == 0)
{
cmpltr = 0;
flag = 1;
}
else if (strcmp (name, "<>") == 0)
{
cmpltr = 1;
flag = 1;
}
else if (strcmp (name, ">=") == 0)
{
cmpltr = 2;
flag = 1;
}
else if (strcmp (name, ">") == 0)
{
cmpltr = 3;
flag = 1;
}
else if (strcasecmp (name, ">>=") == 0)
{
cmpltr = 4;
flag = 1;
}
else if (strcasecmp (name, ">>") == 0)
{
cmpltr = 5;
flag = 1;
}
else if (strcasecmp (name, "nsv") == 0)
{
cmpltr = 6;
flag = 1;
}
else if (strcasecmp (name, "ev") == 0)
{
cmpltr = 7;
flag = 1;
}
/* ",*" is a valid condition. */
else if (*args != 'S')
as_bad (_("Invalid Compare/Subtract Condition: %s"),
name);
*s = c;
}
opcode |= cmpltr << 13;
INSERT_FIELD_AND_CONTINUE (opcode, flag, 12);
/* Handle a non-negated compare condition. */
case 't':
cmpltr = pa_parse_nonneg_cmpsub_cmpltr (&s, 1);
if (cmpltr < 0)
{
as_bad (_("Invalid Compare/Subtract Condition: %c"), *s);
cmpltr = 0;
}
INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 13);
/* Handle a 32 bit compare and branch condition. */
case 'n':
save_s = s;
cmpltr = pa_parse_nonneg_cmpsub_cmpltr (&s, 1);
if (cmpltr < 0)
{
s = save_s;
cmpltr = pa_parse_neg_cmpsub_cmpltr (&s, 1);
if (cmpltr < 0)
{
as_bad (_("Invalid Compare and Branch Condition."));
cmpltr = 0;
}
else
{
/* Negated condition requires an opcode change. */
opcode |= 1 << 27;
}
}
INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 13);
/* Handle a 64 bit compare and branch condition. */
case 'N':
cmpltr = pa_parse_cmpb_64_cmpltr (&s);
if (cmpltr >= 0)
{
/* Negated condition requires an opcode change. */
opcode |= (cmpltr & 8) << 26;
}
else
/* Not a 64 bit cond. Give 32 bit a chance. */
break;
INSERT_FIELD_AND_CONTINUE (opcode, cmpltr & 7, 13);
/* Handle a 64 bit cmpib condition. */
case 'Q':
cmpltr = pa_parse_cmpib_64_cmpltr (&s);
if (cmpltr < 0)
/* Not a 64 bit cond. Give 32 bit a chance. */
break;
INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 13);
/* Handle a logical instruction condition. */
case 'L':
case 'l':
cmpltr = 0;
flag = 0;
if (*s == ',')
{
s++;
/* 64 bit conditions. */
if (*args == 'L')
{
if (*s == '*')
s++;
else
break;
}
else if (*s == '*')
break;
name = s;
while (*s != ',' && *s != ' ' && *s != '\t')
s += 1;
c = *s;
*s = 0x00;
if (strcmp (name, "=") == 0)
cmpltr = 1;
else if (strcmp (name, "<") == 0)
cmpltr = 2;
else if (strcmp (name, "<=") == 0)
cmpltr = 3;
else if (strcasecmp (name, "od") == 0)
cmpltr = 7;
else if (strcasecmp (name, "tr") == 0)
{
cmpltr = 0;
flag = 1;
}
else if (strcmp (name, "<>") == 0)
{
cmpltr = 1;
flag = 1;
}
else if (strcmp (name, ">=") == 0)
{
cmpltr = 2;
flag = 1;
}
else if (strcmp (name, ">") == 0)
{
cmpltr = 3;
flag = 1;
}
else if (strcasecmp (name, "ev") == 0)
{
cmpltr = 7;
flag = 1;
}
/* ",*" is a valid condition. */
else if (*args != 'L')
as_bad (_("Invalid Logical Instruction Condition."));
*s = c;
}
opcode |= cmpltr << 13;
INSERT_FIELD_AND_CONTINUE (opcode, flag, 12);
/* Handle a shift/extract/deposit condition. */
case 'X':
case 'x':
case 'y':
cmpltr = 0;
if (*s == ',')
{
save_s = s++;
/* 64 bit conditions. */
if (*args == 'X')
{
if (*s == '*')
s++;
else
break;
}
else if (*s == '*')
break;
name = s;
while (*s != ',' && *s != ' ' && *s != '\t')
s += 1;
c = *s;
*s = 0x00;
if (strcmp (name, "=") == 0)
cmpltr = 1;
else if (strcmp (name, "<") == 0)
cmpltr = 2;
else if (strcasecmp (name, "od") == 0)
cmpltr = 3;
else if (strcasecmp (name, "tr") == 0)
cmpltr = 4;
else if (strcmp (name, "<>") == 0)
cmpltr = 5;
else if (strcmp (name, ">=") == 0)
cmpltr = 6;
else if (strcasecmp (name, "ev") == 0)
cmpltr = 7;
/* Handle movb,n. Put things back the way they were.
This includes moving s back to where it started. */
else if (strcasecmp (name, "n") == 0 && *args == 'y')
{
*s = c;
s = save_s;
continue;
}
/* ",*" is a valid condition. */
else if (*args != 'X')
as_bad (_("Invalid Shift/Extract/Deposit Condition."));
*s = c;
}
INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 13);
/* Handle a unit instruction condition. */
case 'U':
case 'u':
cmpltr = 0;
flag = 0;
if (*s == ',')
{
s++;
/* 64 bit conditions. */
if (*args == 'U')
{
if (*s == '*')