* config/tc-hppa.c: Include dwarf2dbg.h if OBJ_ELF. Declare
[deliverable/binutils-gdb.git] / gas / config / tc-hppa.c
CommitLineData
252b5132 1/* tc-hppa.c -- Assemble for the PA
49309057
ILT
2 Copyright (C) 1989, 93, 94, 95, 96, 97, 98, 1999
3 Free Software Foundation, Inc.
252b5132
RH
4
5 This file is part of GAS, the GNU Assembler.
6
7 GAS is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
10 any later version.
11
12 GAS is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with GAS; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
20 02111-1307, USA. */
21
22
23/* HP PA-RISC support was contributed by the Center for Software Science
24 at the University of Utah. */
25
26#include <stdio.h>
27#include <ctype.h>
28
29#include "as.h"
30#include "subsegs.h"
31
32#include "bfd/libhppa.h"
33#include "bfd/libbfd.h"
34
35/* Be careful, this file includes data *declarations*. */
36#include "opcode/hppa.h"
37
49863f82
JL
38#if defined (OBJ_ELF) && defined (OBJ_SOM)
39error only one of OBJ_ELF and OBJ_SOM can be defined
40#endif
41
2d93dcc4
JL
42/* If we are using ELF, then we probably can support dwarf2 debug
43 records. Furthermore, if we are supporting dwarf2 debug records,
44 then we want to use the assembler support for compact line numbers. */
45#ifdef OBJ_ELF
46#include "dwarf2dbg.h"
47struct dwarf2_line_info debug_line;
48#endif
49
252b5132
RH
50/* A "convient" place to put object file dependencies which do
51 not need to be seen outside of tc-hppa.c. */
52#ifdef OBJ_ELF
252b5132 53/* Object file formats specify relocation types. */
b388df87 54typedef elf_hppa_reloc_type reloc_type;
252b5132
RH
55
56/* Object file formats specify BFD symbol types. */
57typedef elf_symbol_type obj_symbol_type;
58
b388df87 59#ifdef BFD64
252b5132 60/* How to generate a relocation. */
b388df87
JL
61#define hppa_gen_reloc_type _bfd_elf64_hppa_gen_reloc_type
62#else
63#define hppa_gen_reloc_type _bfd_elf32_hppa_gen_reloc_type
64#endif
252b5132
RH
65
66/* ELF objects can have versions, but apparently do not have anywhere
67 to store a copyright string. */
68#define obj_version obj_elf_version
69#define obj_copyright obj_elf_version
46031ca9
JL
70
71#define UNWIND_SECTION_NAME ".PARISC.unwind"
252b5132
RH
72#endif
73
74#ifdef OBJ_SOM
75/* Names of various debugging spaces/subspaces. */
76#define GDB_DEBUG_SPACE_NAME "$GDB_DEBUG$"
77#define GDB_STRINGS_SUBSPACE_NAME "$GDB_STRINGS$"
78#define GDB_SYMBOLS_SUBSPACE_NAME "$GDB_SYMBOLS$"
79#define UNWIND_SECTION_NAME "$UNWIND$"
80
81/* Object file formats specify relocation types. */
82typedef int reloc_type;
83
84/* SOM objects can have both a version string and a copyright string. */
85#define obj_version obj_som_version
86#define obj_copyright obj_som_copyright
87
252b5132
RH
88/* How to generate a relocation. */
89#define hppa_gen_reloc_type hppa_som_gen_reloc_type
90
91/* Object file formats specify BFD symbol types. */
92typedef som_symbol_type obj_symbol_type;
93
94/* This apparently isn't in older versions of hpux reloc.h. */
95#ifndef R_DLT_REL
96#define R_DLT_REL 0x78
97#endif
98#endif
99
100#ifndef R_N0SEL
101#define R_N0SEL 0xd8
102#endif
103
104#ifndef R_N1SEL
105#define R_N1SEL 0xd9
106#endif
107
108/* Various structures and types used internally in tc-hppa.c. */
109
110/* Unwind table and descriptor. FIXME: Sync this with GDB version. */
111
112struct unwind_desc
113 {
114 unsigned int cannot_unwind:1;
115 unsigned int millicode:1;
116 unsigned int millicode_save_rest:1;
117 unsigned int region_desc:2;
118 unsigned int save_sr:2;
119 unsigned int entry_fr:4;
120 unsigned int entry_gr:5;
121 unsigned int args_stored:1;
122 unsigned int call_fr:5;
123 unsigned int call_gr:5;
124 unsigned int save_sp:1;
125 unsigned int save_rp:1;
126 unsigned int save_rp_in_frame:1;
127 unsigned int extn_ptr_defined:1;
128 unsigned int cleanup_defined:1;
129
130 unsigned int hpe_interrupt_marker:1;
131 unsigned int hpux_interrupt_marker:1;
132 unsigned int reserved:3;
133 unsigned int frame_size:27;
134 };
135
136struct unwind_table
137 {
138 /* Starting and ending offsets of the region described by
139 descriptor. */
140 unsigned int start_offset;
141 unsigned int end_offset;
142 struct unwind_desc descriptor;
143 };
144
145/* This structure is used by the .callinfo, .enter, .leave pseudo-ops to
146 control the entry and exit code they generate. It is also used in
147 creation of the correct stack unwind descriptors.
148
149 NOTE: GAS does not support .enter and .leave for the generation of
150 prologues and epilogues. FIXME.
151
152 The fields in structure roughly correspond to the arguments available on the
153 .callinfo pseudo-op. */
154
155struct call_info
156 {
157 /* The unwind descriptor being built. */
158 struct unwind_table ci_unwind;
159
160 /* Name of this function. */
161 symbolS *start_symbol;
162
163 /* (temporary) symbol used to mark the end of this function. */
164 symbolS *end_symbol;
165
166 /* Next entry in the chain. */
167 struct call_info *ci_next;
168 };
169
170/* Operand formats for FP instructions. Note not all FP instructions
171 allow all four formats to be used (for example fmpysub only allows
172 SGL and DBL). */
173typedef enum
174 {
175 SGL, DBL, ILLEGAL_FMT, QUAD, W, UW, DW, UDW, QW, UQW
176 }
177fp_operand_format;
178
179/* This fully describes the symbol types which may be attached to
180 an EXPORT or IMPORT directive. Only SOM uses this formation
181 (ELF has no need for it). */
182typedef enum
183 {
184 SYMBOL_TYPE_UNKNOWN,
185 SYMBOL_TYPE_ABSOLUTE,
186 SYMBOL_TYPE_CODE,
187 SYMBOL_TYPE_DATA,
188 SYMBOL_TYPE_ENTRY,
189 SYMBOL_TYPE_MILLICODE,
190 SYMBOL_TYPE_PLABEL,
191 SYMBOL_TYPE_PRI_PROG,
192 SYMBOL_TYPE_SEC_PROG,
193 }
194pa_symbol_type;
195
196/* This structure contains information needed to assemble
197 individual instructions. */
198struct pa_it
199 {
200 /* Holds the opcode after parsing by pa_ip. */
201 unsigned long opcode;
202
203 /* Holds an expression associated with the current instruction. */
204 expressionS exp;
205
206 /* Does this instruction use PC-relative addressing. */
207 int pcrel;
208
209 /* Floating point formats for operand1 and operand2. */
210 fp_operand_format fpof1;
211 fp_operand_format fpof2;
212
213
214 /* Holds the field selector for this instruction
215 (for example L%, LR%, etc). */
216 long field_selector;
217
218 /* Holds any argument relocation bits associated with this
219 instruction. (instruction should be some sort of call). */
220 long arg_reloc;
221
222 /* The format specification for this instruction. */
223 int format;
224
225 /* The relocation (if any) associated with this instruction. */
226 reloc_type reloc;
227 };
228
229/* PA-89 floating point registers are arranged like this:
230
231
232 +--------------+--------------+
233 | 0 or 16L | 16 or 16R |
234 +--------------+--------------+
235 | 1 or 17L | 17 or 17R |
236 +--------------+--------------+
237 | | |
238
239 . . .
240 . . .
241 . . .
242
243 | | |
244 +--------------+--------------+
245 | 14 or 30L | 30 or 30R |
246 +--------------+--------------+
247 | 15 or 31L | 31 or 31R |
248 +--------------+--------------+
249
250
251 The following is a version of pa_parse_number that
252 handles the L/R notation and returns the correct
253 value to put into the instruction register field.
254 The correct value to put into the instruction is
255 encoded in the structure 'pa_11_fp_reg_struct'. */
256
257struct pa_11_fp_reg_struct
258 {
259 /* The register number. */
260 char number_part;
261
262 /* L/R selector. */
263 char l_r_select;
264 };
265
266/* Additional information needed to build argument relocation stubs. */
267struct call_desc
268 {
269 /* The argument relocation specification. */
270 unsigned int arg_reloc;
271
272 /* Number of arguments. */
273 unsigned int arg_count;
274 };
275
49863f82 276#ifdef OBJ_SOM
252b5132
RH
277/* This structure defines an entry in the subspace dictionary
278 chain. */
279
280struct subspace_dictionary_chain
281 {
282 /* Nonzero if this space has been defined by the user code. */
283 unsigned int ssd_defined;
284
285 /* Name of this subspace. */
286 char *ssd_name;
287
288 /* GAS segment and subsegment associated with this subspace. */
289 asection *ssd_seg;
290 int ssd_subseg;
291
292 /* Next space in the subspace dictionary chain. */
293 struct subspace_dictionary_chain *ssd_next;
294 };
295
296typedef struct subspace_dictionary_chain ssd_chain_struct;
297
298/* This structure defines an entry in the subspace dictionary
299 chain. */
300
301struct space_dictionary_chain
302 {
303 /* Nonzero if this space has been defined by the user code or
304 as a default space. */
305 unsigned int sd_defined;
306
307 /* Nonzero if this spaces has been defined by the user code. */
308 unsigned int sd_user_defined;
309
310 /* The space number (or index). */
311 unsigned int sd_spnum;
312
313 /* The name of this subspace. */
314 char *sd_name;
315
316 /* GAS segment to which this subspace corresponds. */
317 asection *sd_seg;
318
319 /* Current subsegment number being used. */
320 int sd_last_subseg;
321
322 /* The chain of subspaces contained within this space. */
323 ssd_chain_struct *sd_subspaces;
324
325 /* The next entry in the space dictionary chain. */
326 struct space_dictionary_chain *sd_next;
327 };
328
329typedef struct space_dictionary_chain sd_chain_struct;
330
252b5132
RH
331/* This structure defines attributes of the default subspace
332 dictionary entries. */
333
334struct default_subspace_dict
335 {
336 /* Name of the subspace. */
337 char *name;
338
339 /* FIXME. Is this still needed? */
340 char defined;
341
342 /* Nonzero if this subspace is loadable. */
343 char loadable;
344
345 /* Nonzero if this subspace contains only code. */
346 char code_only;
347
348 /* Nonzero if this is a common subspace. */
349 char common;
350
351 /* Nonzero if this is a common subspace which allows symbols
352 to be multiply defined. */
353 char dup_common;
354
355 /* Nonzero if this subspace should be zero filled. */
356 char zero;
357
358 /* Sort key for this subspace. */
359 unsigned char sort;
360
361 /* Access control bits for this subspace. Can represent RWX access
362 as well as privilege level changes for gateways. */
363 int access;
364
365 /* Index of containing space. */
366 int space_index;
367
368 /* Alignment (in bytes) of this subspace. */
369 int alignment;
370
371 /* Quadrant within space where this subspace should be loaded. */
372 int quadrant;
373
374 /* An index into the default spaces array. */
375 int def_space_index;
376
252b5132
RH
377 /* Subsegment associated with this subspace. */
378 subsegT subsegment;
379 };
380
381/* This structure defines attributes of the default space
382 dictionary entries. */
383
384struct default_space_dict
385 {
386 /* Name of the space. */
387 char *name;
388
389 /* Space number. It is possible to identify spaces within
390 assembly code numerically! */
391 int spnum;
392
393 /* Nonzero if this space is loadable. */
394 char loadable;
395
396 /* Nonzero if this space is "defined". FIXME is still needed */
397 char defined;
398
399 /* Nonzero if this space can not be shared. */
400 char private;
401
402 /* Sort key for this space. */
403 unsigned char sort;
404
405 /* Segment associated with this space. */
406 asection *segment;
252b5132 407 };
49863f82
JL
408#endif
409
410/* Structure for previous label tracking. Needed so that alignments,
411 callinfo declarations, etc can be easily attached to a particular
412 label. */
413typedef struct label_symbol_struct
414 {
415 struct symbol *lss_label;
416#ifdef OBJ_SOM
417 sd_chain_struct *lss_space;
418#endif
419#ifdef OBJ_ELF
420 segT lss_segment;
421#endif
422 struct label_symbol_struct *lss_next;
423 }
424label_symbol_struct;
252b5132
RH
425
426/* Extra information needed to perform fixups (relocations) on the PA. */
427struct hppa_fix_struct
428 {
429 /* The field selector. */
430 enum hppa_reloc_field_selector_type_alt fx_r_field;
431
432 /* Type of fixup. */
433 int fx_r_type;
434
435 /* Format of fixup. */
436 int fx_r_format;
437
438 /* Argument relocation bits. */
439 long fx_arg_reloc;
440
441 /* The segment this fixup appears in. */
442 segT segment;
443 };
444
445/* Structure to hold information about predefined registers. */
446
447struct pd_reg
448 {
449 char *name;
450 int value;
451 };
452
453/* This structure defines the mapping from a FP condition string
454 to a condition number which can be recorded in an instruction. */
455struct fp_cond_map
456 {
457 char *string;
458 int cond;
459 };
460
461/* This structure defines a mapping from a field selector
462 string to a field selector type. */
463struct selector_entry
464 {
465 char *prefix;
466 int field_selector;
467 };
468
469/* Prototypes for functions local to tc-hppa.c. */
470
49863f82 471#ifdef OBJ_SOM
252b5132 472static void pa_check_current_space_and_subspace PARAMS ((void));
49863f82
JL
473#endif
474
252b5132
RH
475static fp_operand_format pa_parse_fp_format PARAMS ((char **s));
476static void pa_cons PARAMS ((int));
477static void pa_data PARAMS ((int));
478static void pa_float_cons PARAMS ((int));
479static void pa_fill PARAMS ((int));
480static void pa_lcomm PARAMS ((int));
481static void pa_lsym PARAMS ((int));
482static void pa_stringer PARAMS ((int));
483static void pa_text PARAMS ((int));
484static void pa_version PARAMS ((int));
485static int pa_parse_fp_cmp_cond PARAMS ((char **));
486static int get_expression PARAMS ((char *));
487static int pa_get_absolute_expression PARAMS ((struct pa_it *, char **));
488static int evaluate_absolute PARAMS ((struct pa_it *));
489static unsigned int pa_build_arg_reloc PARAMS ((char *));
490static unsigned int pa_align_arg_reloc PARAMS ((unsigned int, unsigned int));
491static int pa_parse_nullif PARAMS ((char **));
492static int pa_parse_nonneg_cmpsub_cmpltr PARAMS ((char **, int));
493static int pa_parse_neg_cmpsub_cmpltr PARAMS ((char **, int));
494static int pa_parse_neg_add_cmpltr PARAMS ((char **, int));
495static int pa_parse_nonneg_add_cmpltr PARAMS ((char **, int));
252b5132
RH
496static void pa_block PARAMS ((int));
497static void pa_brtab PARAMS ((int));
498static void pa_try PARAMS ((int));
499static void pa_call PARAMS ((int));
500static void pa_call_args PARAMS ((struct call_desc *));
501static void pa_callinfo PARAMS ((int));
502static void pa_code PARAMS ((int));
503static void pa_comm PARAMS ((int));
252b5132
RH
504static void pa_copyright PARAMS ((int));
505static void pa_end PARAMS ((int));
506static void pa_enter PARAMS ((int));
507static void pa_entry PARAMS ((int));
508static void pa_equ PARAMS ((int));
509static void pa_exit PARAMS ((int));
510static void pa_export PARAMS ((int));
511static void pa_type_args PARAMS ((symbolS *, int));
512static void pa_import PARAMS ((int));
513static void pa_label PARAMS ((int));
514static void pa_leave PARAMS ((int));
515static void pa_level PARAMS ((int));
516static void pa_origin PARAMS ((int));
517static void pa_proc PARAMS ((int));
518static void pa_procend PARAMS ((int));
252b5132
RH
519static void pa_param PARAMS ((int));
520static void pa_undefine_label PARAMS ((void));
521static int need_pa11_opcode PARAMS ((struct pa_it *,
522 struct pa_11_fp_reg_struct *));
523static int pa_parse_number PARAMS ((char **, struct pa_11_fp_reg_struct *));
524static label_symbol_struct *pa_get_label PARAMS ((void));
49863f82
JL
525#ifdef OBJ_SOM
526static void pa_compiler PARAMS ((int));
527static void pa_align PARAMS ((int));
528static void pa_space PARAMS ((int));
529static void pa_spnum PARAMS ((int));
530static void pa_subspace PARAMS ((int));
252b5132
RH
531static sd_chain_struct *create_new_space PARAMS ((char *, int, int,
532 int, int, int,
533 asection *, int));
534static ssd_chain_struct *create_new_subspace PARAMS ((sd_chain_struct *,
535 char *, int, int,
536 int, int, int,
537 int, int, int, int,
538 int, asection *));
539static ssd_chain_struct *update_subspace PARAMS ((sd_chain_struct *,
540 char *, int, int, int,
541 int, int, int, int,
542 int, int, int,
543 asection *));
544static sd_chain_struct *is_defined_space PARAMS ((char *));
545static ssd_chain_struct *is_defined_subspace PARAMS ((char *));
546static sd_chain_struct *pa_segment_to_space PARAMS ((asection *));
547static ssd_chain_struct *pa_subsegment_to_subspace PARAMS ((asection *,
548 subsegT));
549static sd_chain_struct *pa_find_space_by_number PARAMS ((int));
550static unsigned int pa_subspace_start PARAMS ((sd_chain_struct *, int));
49863f82
JL
551static sd_chain_struct *pa_parse_space_stmt PARAMS ((char *, int));
552static int pa_next_subseg PARAMS ((sd_chain_struct *));
553static void pa_spaces_begin PARAMS ((void));
554#endif
252b5132
RH
555static void pa_ip PARAMS ((char *));
556static void fix_new_hppa PARAMS ((fragS *, int, int, symbolS *,
557 long, expressionS *, int,
558 bfd_reloc_code_real_type,
559 enum hppa_reloc_field_selector_type_alt,
560 int, long, int *));
561static int is_end_of_statement PARAMS ((void));
562static int reg_name_search PARAMS ((char *));
563static int pa_chk_field_selector PARAMS ((char **));
564static int is_same_frag PARAMS ((fragS *, fragS *));
565static void process_exit PARAMS ((void));
252b5132 566static int log2 PARAMS ((int));
252b5132 567static unsigned int pa_stringer_aux PARAMS ((char *));
252b5132
RH
568
569#ifdef OBJ_ELF
570static void hppa_elf_mark_end_of_function PARAMS ((void));
571static void pa_build_unwind_subspace PARAMS ((struct call_info *));
572#endif
573
574/* File and gloally scoped variable declarations. */
575
49863f82 576#ifdef OBJ_SOM
252b5132
RH
577/* Root and final entry in the space chain. */
578static sd_chain_struct *space_dict_root;
579static sd_chain_struct *space_dict_last;
580
581/* The current space and subspace. */
582static sd_chain_struct *current_space;
583static ssd_chain_struct *current_subspace;
49863f82 584#endif
252b5132
RH
585
586/* Root of the call_info chain. */
587static struct call_info *call_info_root;
588
589/* The last call_info (for functions) structure
590 seen so it can be associated with fixups and
591 function labels. */
592static struct call_info *last_call_info;
593
594/* The last call description (for actual calls). */
595static struct call_desc last_call_desc;
596
597/* handle of the OPCODE hash table */
598static struct hash_control *op_hash = NULL;
599
600/* This array holds the chars that always start a comment. If the
601 pre-processor is disabled, these aren't very useful. */
602const char comment_chars[] = ";";
603
604/* Table of pseudo ops for the PA. FIXME -- how many of these
605 are now redundant with the overall GAS and the object file
606 dependent tables? */
607const pseudo_typeS md_pseudo_table[] =
608{
609 /* align pseudo-ops on the PA specify the actual alignment requested,
610 not the log2 of the requested alignment. */
49863f82 611#ifdef OBJ_SOM
252b5132 612 {"align", pa_align, 8},
49863f82
JL
613#endif
614#ifdef OBJ_ELF
615 {"align", s_align_bytes, 8},
616#endif
252b5132
RH
617 {"begin_brtab", pa_brtab, 1},
618 {"begin_try", pa_try, 1},
619 {"block", pa_block, 1},
620 {"blockz", pa_block, 0},
621 {"byte", pa_cons, 1},
622 {"call", pa_call, 0},
623 {"callinfo", pa_callinfo, 0},
624 {"code", pa_code, 0},
625 {"comm", pa_comm, 0},
626#ifdef OBJ_SOM
627 {"compiler", pa_compiler, 0},
628#endif
629 {"copyright", pa_copyright, 0},
630 {"data", pa_data, 0},
631 {"double", pa_float_cons, 'd'},
077db52a 632 {"dword", pa_cons, 8},
252b5132
RH
633 {"end", pa_end, 0},
634 {"end_brtab", pa_brtab, 0},
635 {"end_try", pa_try, 0},
636 {"enter", pa_enter, 0},
637 {"entry", pa_entry, 0},
638 {"equ", pa_equ, 0},
639 {"exit", pa_exit, 0},
640 {"export", pa_export, 0},
2d93dcc4
JL
641#ifdef OBJ_ELF
642 { "file", dwarf2_directive_file },
643#endif
252b5132
RH
644 {"fill", pa_fill, 0},
645 {"float", pa_float_cons, 'f'},
646 {"half", pa_cons, 2},
647 {"import", pa_import, 0},
648 {"int", pa_cons, 4},
649 {"label", pa_label, 0},
650 {"lcomm", pa_lcomm, 0},
651 {"leave", pa_leave, 0},
652 {"level", pa_level, 0},
2d93dcc4
JL
653#ifdef OBJ_ELF
654 { "loc", dwarf2_directive_loc },
655#endif
252b5132
RH
656 {"long", pa_cons, 4},
657 {"lsym", pa_lsym, 0},
49863f82 658#ifdef OBJ_SOM
252b5132 659 {"nsubspa", pa_subspace, 1},
49863f82 660#endif
252b5132
RH
661 {"octa", pa_cons, 16},
662 {"org", pa_origin, 0},
663 {"origin", pa_origin, 0},
664 {"param", pa_param, 0},
665 {"proc", pa_proc, 0},
666 {"procend", pa_procend, 0},
667 {"quad", pa_cons, 8},
668 {"reg", pa_equ, 1},
669 {"short", pa_cons, 2},
670 {"single", pa_float_cons, 'f'},
49863f82 671#ifdef OBJ_SOM
252b5132
RH
672 {"space", pa_space, 0},
673 {"spnum", pa_spnum, 0},
49863f82 674#endif
252b5132
RH
675 {"string", pa_stringer, 0},
676 {"stringz", pa_stringer, 1},
49863f82 677#ifdef OBJ_SOM
252b5132 678 {"subspa", pa_subspace, 0},
49863f82 679#endif
252b5132
RH
680 {"text", pa_text, 0},
681 {"version", pa_version, 0},
682 {"word", pa_cons, 4},
683 {NULL, 0, 0}
684};
685
686/* This array holds the chars that only start a comment at the beginning of
687 a line. If the line seems to have the form '# 123 filename'
688 .line and .file directives will appear in the pre-processed output.
689
690 Note that input_file.c hand checks for '#' at the beginning of the
691 first line of the input file. This is because the compiler outputs
692 #NO_APP at the beginning of its output.
693
694 Also note that C style comments will always work. */
695const char line_comment_chars[] = "#";
696
697/* This array holds the characters which act as line separators. */
698const char line_separator_chars[] = "!";
699
700/* Chars that can be used to separate mant from exp in floating point nums. */
701const char EXP_CHARS[] = "eE";
702
703/* Chars that mean this number is a floating point constant.
704 As in 0f12.456 or 0d1.2345e12.
705
706 Be aware that MAXIMUM_NUMBER_OF_CHARS_FOR_FLOAT may have to be
707 changed in read.c. Ideally it shouldn't hae to know abou it at
708 all, but nothing is ideal around here. */
709const char FLT_CHARS[] = "rRsSfFdDxXpP";
710
711static struct pa_it the_insn;
712
713/* Points to the end of an expression just parsed by get_expressoin
714 and friends. FIXME. This shouldn't be handled with a file-global
715 variable. */
716static char *expr_end;
717
718/* Nonzero if a .callinfo appeared within the current procedure. */
719static int callinfo_found;
720
721/* Nonzero if the assembler is currently within a .entry/.exit pair. */
722static int within_entry_exit;
723
724/* Nonzero if the assembler is currently within a procedure definition. */
725static int within_procedure;
726
727/* Handle on strucutre which keep track of the last symbol
728 seen in each subspace. */
729static label_symbol_struct *label_symbols_rootp = NULL;
730
731/* Holds the last field selector. */
732static int hppa_field_selector;
733
0f4f8b56
JL
734/* Nonzero when strict syntax checking is enabled. Zero otherwise.
735
736 Each opcode in the table has a flag which indicates whether or not
737 strict syntax checking should be enabled for that instruction. */
738static int strict = 0;
739
993142d5 740#ifdef OBJ_SOM
252b5132
RH
741/* A dummy bfd symbol so that all relocations have symbols of some kind. */
742static symbolS *dummy_symbol;
993142d5 743#endif
252b5132
RH
744
745/* Nonzero if errors are to be printed. */
746static int print_errors = 1;
747
748/* List of registers that are pre-defined:
749
750 Each general register has one predefined name of the form
751 %r<REGNUM> which has the value <REGNUM>.
752
753 Space and control registers are handled in a similar manner,
754 but use %sr<REGNUM> and %cr<REGNUM> as their predefined names.
755
756 Likewise for the floating point registers, but of the form
757 %fr<REGNUM>. Floating point registers have additional predefined
758 names with 'L' and 'R' suffixes (e.g. %fr19L, %fr19R) which
759 again have the value <REGNUM>.
760
761 Many registers also have synonyms:
762
763 %r26 - %r23 have %arg0 - %arg3 as synonyms
764 %r28 - %r29 have %ret0 - %ret1 as synonyms
765 %r30 has %sp as a synonym
766 %r27 has %dp as a synonym
767 %r2 has %rp as a synonym
768
769 Almost every control register has a synonym; they are not listed
770 here for brevity.
771
772 The table is sorted. Suitable for searching by a binary search. */
773
774static const struct pd_reg pre_defined_registers[] =
775{
776 {"%arg0", 26},
777 {"%arg1", 25},
778 {"%arg2", 24},
779 {"%arg3", 23},
780 {"%cr0", 0},
781 {"%cr10", 10},
782 {"%cr11", 11},
783 {"%cr12", 12},
784 {"%cr13", 13},
785 {"%cr14", 14},
786 {"%cr15", 15},
787 {"%cr16", 16},
788 {"%cr17", 17},
789 {"%cr18", 18},
790 {"%cr19", 19},
791 {"%cr20", 20},
792 {"%cr21", 21},
793 {"%cr22", 22},
794 {"%cr23", 23},
795 {"%cr24", 24},
796 {"%cr25", 25},
797 {"%cr26", 26},
798 {"%cr27", 27},
799 {"%cr28", 28},
800 {"%cr29", 29},
801 {"%cr30", 30},
802 {"%cr31", 31},
803 {"%cr8", 8},
804 {"%cr9", 9},
805 {"%dp", 27},
806 {"%eiem", 15},
807 {"%eirr", 23},
808 {"%fr0", 0},
809 {"%fr0l", 0},
810 {"%fr0r", 0},
811 {"%fr1", 1},
812 {"%fr10", 10},
813 {"%fr10l", 10},
814 {"%fr10r", 10},
815 {"%fr11", 11},
816 {"%fr11l", 11},
817 {"%fr11r", 11},
818 {"%fr12", 12},
819 {"%fr12l", 12},
820 {"%fr12r", 12},
821 {"%fr13", 13},
822 {"%fr13l", 13},
823 {"%fr13r", 13},
824 {"%fr14", 14},
825 {"%fr14l", 14},
826 {"%fr14r", 14},
827 {"%fr15", 15},
828 {"%fr15l", 15},
829 {"%fr15r", 15},
830 {"%fr16", 16},
831 {"%fr16l", 16},
832 {"%fr16r", 16},
833 {"%fr17", 17},
834 {"%fr17l", 17},
835 {"%fr17r", 17},
836 {"%fr18", 18},
837 {"%fr18l", 18},
838 {"%fr18r", 18},
839 {"%fr19", 19},
840 {"%fr19l", 19},
841 {"%fr19r", 19},
842 {"%fr1l", 1},
843 {"%fr1r", 1},
844 {"%fr2", 2},
845 {"%fr20", 20},
846 {"%fr20l", 20},
847 {"%fr20r", 20},
848 {"%fr21", 21},
849 {"%fr21l", 21},
850 {"%fr21r", 21},
851 {"%fr22", 22},
852 {"%fr22l", 22},
853 {"%fr22r", 22},
854 {"%fr23", 23},
855 {"%fr23l", 23},
856 {"%fr23r", 23},
857 {"%fr24", 24},
858 {"%fr24l", 24},
859 {"%fr24r", 24},
860 {"%fr25", 25},
861 {"%fr25l", 25},
862 {"%fr25r", 25},
863 {"%fr26", 26},
864 {"%fr26l", 26},
865 {"%fr26r", 26},
866 {"%fr27", 27},
867 {"%fr27l", 27},
868 {"%fr27r", 27},
869 {"%fr28", 28},
870 {"%fr28l", 28},
871 {"%fr28r", 28},
872 {"%fr29", 29},
873 {"%fr29l", 29},
874 {"%fr29r", 29},
875 {"%fr2l", 2},
876 {"%fr2r", 2},
877 {"%fr3", 3},
878 {"%fr30", 30},
879 {"%fr30l", 30},
880 {"%fr30r", 30},
881 {"%fr31", 31},
882 {"%fr31l", 31},
883 {"%fr31r", 31},
884 {"%fr3l", 3},
885 {"%fr3r", 3},
886 {"%fr4", 4},
887 {"%fr4l", 4},
888 {"%fr4r", 4},
889 {"%fr5", 5},
890 {"%fr5l", 5},
891 {"%fr5r", 5},
892 {"%fr6", 6},
893 {"%fr6l", 6},
894 {"%fr6r", 6},
895 {"%fr7", 7},
896 {"%fr7l", 7},
897 {"%fr7r", 7},
898 {"%fr8", 8},
899 {"%fr8l", 8},
900 {"%fr8r", 8},
901 {"%fr9", 9},
902 {"%fr9l", 9},
903 {"%fr9r", 9},
904 {"%hta", 25},
905 {"%iir", 19},
906 {"%ior", 21},
907 {"%ipsw", 22},
908 {"%isr", 20},
909 {"%itmr", 16},
910 {"%iva", 14},
911 {"%pcoq", 18},
912 {"%pcsq", 17},
913 {"%pidr1", 8},
914 {"%pidr2", 9},
915 {"%pidr3", 12},
916 {"%pidr4", 13},
917 {"%ppda", 24},
918 {"%r0", 0},
919 {"%r1", 1},
920 {"%r10", 10},
921 {"%r11", 11},
922 {"%r12", 12},
923 {"%r13", 13},
924 {"%r14", 14},
925 {"%r15", 15},
926 {"%r16", 16},
927 {"%r17", 17},
928 {"%r18", 18},
929 {"%r19", 19},
930 {"%r2", 2},
931 {"%r20", 20},
932 {"%r21", 21},
933 {"%r22", 22},
934 {"%r23", 23},
935 {"%r24", 24},
936 {"%r25", 25},
937 {"%r26", 26},
938 {"%r27", 27},
939 {"%r28", 28},
940 {"%r29", 29},
941 {"%r3", 3},
942 {"%r30", 30},
943 {"%r31", 31},
944 {"%r4", 4},
945 {"%r5", 5},
946 {"%r6", 6},
947 {"%r7", 7},
948 {"%r8", 8},
949 {"%r9", 9},
950 {"%rctr", 0},
951 {"%ret0", 28},
952 {"%ret1", 29},
953 {"%rp", 2},
954 {"%sar", 11},
955 {"%sp", 30},
956 {"%sr0", 0},
957 {"%sr1", 1},
958 {"%sr2", 2},
959 {"%sr3", 3},
960 {"%sr4", 4},
961 {"%sr5", 5},
962 {"%sr6", 6},
963 {"%sr7", 7},
964 {"%tr0", 24},
965 {"%tr1", 25},
966 {"%tr2", 26},
967 {"%tr3", 27},
968 {"%tr4", 28},
969 {"%tr5", 29},
970 {"%tr6", 30},
971 {"%tr7", 31}
972};
973
974/* This table is sorted by order of the length of the string. This is
975 so we check for <> before we check for <. If we had a <> and checked
976 for < first, we would get a false match. */
977static const struct fp_cond_map fp_cond_map[] =
978{
979 {"false?", 0},
980 {"false", 1},
981 {"true?", 30},
982 {"true", 31},
983 {"!<=>", 3},
984 {"!?>=", 8},
985 {"!?<=", 16},
986 {"!<>", 7},
987 {"!>=", 11},
988 {"!?>", 12},
989 {"?<=", 14},
990 {"!<=", 19},
991 {"!?<", 20},
992 {"?>=", 22},
993 {"!?=", 24},
994 {"!=t", 27},
995 {"<=>", 29},
996 {"=t", 5},
997 {"?=", 6},
998 {"?<", 10},
999 {"<=", 13},
1000 {"!>", 15},
1001 {"?>", 18},
1002 {">=", 21},
1003 {"!<", 23},
1004 {"<>", 25},
1005 {"!=", 26},
1006 {"!?", 28},
1007 {"?", 2},
1008 {"=", 4},
1009 {"<", 9},
1010 {">", 17}
1011};
1012
1013static const struct selector_entry selector_table[] =
1014{
1015 {"f", e_fsel},
1016 {"l", e_lsel},
1017 {"ld", e_ldsel},
1018 {"lp", e_lpsel},
1019 {"lr", e_lrsel},
1020 {"ls", e_lssel},
1021 {"lt", e_ltsel},
39ba5561 1022 {"ltp", e_ltpsel},
252b5132
RH
1023 {"n", e_nsel},
1024 {"nl", e_nlsel},
1025 {"nlr", e_nlrsel},
1026 {"p", e_psel},
1027 {"r", e_rsel},
1028 {"rd", e_rdsel},
1029 {"rp", e_rpsel},
1030 {"rr", e_rrsel},
1031 {"rs", e_rssel},
1032 {"rt", e_rtsel},
39ba5561 1033 {"rtp", e_rtpsel},
252b5132
RH
1034 {"t", e_tsel},
1035};
1036
49863f82 1037#ifdef OBJ_SOM
252b5132
RH
1038/* default space and subspace dictionaries */
1039
1040#define GDB_SYMBOLS GDB_SYMBOLS_SUBSPACE_NAME
1041#define GDB_STRINGS GDB_STRINGS_SUBSPACE_NAME
1042
1043/* pre-defined subsegments (subspaces) for the HPPA. */
1044#define SUBSEG_CODE 0
1045#define SUBSEG_LIT 1
1046#define SUBSEG_MILLI 2
1047#define SUBSEG_DATA 0
1048#define SUBSEG_BSS 2
1049#define SUBSEG_UNWIND 3
1050#define SUBSEG_GDB_STRINGS 0
1051#define SUBSEG_GDB_SYMBOLS 1
1052
1053static struct default_subspace_dict pa_def_subspaces[] =
1054{
49863f82
JL
1055 {"$CODE$", 1, 1, 1, 0, 0, 0, 24, 0x2c, 0, 8, 0, 0, SUBSEG_CODE},
1056 {"$DATA$", 1, 1, 0, 0, 0, 0, 24, 0x1f, 1, 8, 1, 1, SUBSEG_DATA},
1057 {"$LIT$", 1, 1, 0, 0, 0, 0, 16, 0x2c, 0, 8, 0, 0, SUBSEG_LIT},
1058 {"$MILLICODE$", 1, 1, 0, 0, 0, 0, 8, 0x2c, 0, 8, 0, 0, SUBSEG_MILLI},
1059 {"$BSS$", 1, 1, 0, 0, 0, 1, 80, 0x1f, 1, 8, 1, 1, SUBSEG_BSS},
252b5132
RH
1060 {NULL, 0, 1, 0, 0, 0, 0, 255, 0x1f, 0, 4, 0, 0, 0}
1061};
1062
1063static struct default_space_dict pa_def_spaces[] =
1064{
49863f82
JL
1065 {"$TEXT$", 0, 1, 1, 0, 8, ASEC_NULL},
1066 {"$PRIVATE$", 1, 1, 1, 1, 16, ASEC_NULL},
1067 {NULL, 0, 0, 0, 0, 0, ASEC_NULL}
252b5132
RH
1068};
1069
1070/* Misc local definitions used by the assembler. */
1071
252b5132
RH
1072/* These macros are used to maintain spaces/subspaces. */
1073#define SPACE_DEFINED(space_chain) (space_chain)->sd_defined
1074#define SPACE_USER_DEFINED(space_chain) (space_chain)->sd_user_defined
1075#define SPACE_SPNUM(space_chain) (space_chain)->sd_spnum
1076#define SPACE_NAME(space_chain) (space_chain)->sd_name
1077
1078#define SUBSPACE_DEFINED(ss_chain) (ss_chain)->ssd_defined
1079#define SUBSPACE_NAME(ss_chain) (ss_chain)->ssd_name
49863f82
JL
1080#endif
1081
1082/* Return nonzero if the string pointed to by S potentially represents
1083 a right or left half of a FP register */
1084#define IS_R_SELECT(S) (*(S) == 'R' || *(S) == 'r')
1085#define IS_L_SELECT(S) (*(S) == 'L' || *(S) == 'l')
252b5132
RH
1086
1087/* Insert FIELD into OPCODE starting at bit START. Continue pa_ip
1088 main loop after insertion. */
1089
1090#define INSERT_FIELD_AND_CONTINUE(OPCODE, FIELD, START) \
1091 { \
1092 ((OPCODE) |= (FIELD) << (START)); \
1093 continue; \
1094 }
1095
1096/* Simple range checking for FIELD againt HIGH and LOW bounds.
1097 IGNORE is used to suppress the error message. */
1098
1099#define CHECK_FIELD(FIELD, HIGH, LOW, IGNORE) \
1100 { \
1101 if ((FIELD) > (HIGH) || (FIELD) < (LOW)) \
1102 { \
1103 if (! IGNORE) \
1104 as_bad (_("Field out of range [%d..%d] (%d)."), (LOW), (HIGH), \
1105 (int) (FIELD));\
1106 break; \
1107 } \
1108 }
1109
1110#define is_DP_relative(exp) \
1111 ((exp).X_op == O_subtract \
a0f75b47 1112 && strcmp (S_GET_NAME ((exp).X_op_symbol), "$global$") == 0)
252b5132
RH
1113
1114#define is_PC_relative(exp) \
1115 ((exp).X_op == O_subtract \
a0f75b47 1116 && strcmp (S_GET_NAME ((exp).X_op_symbol), "$PIC_pcrel$0") == 0)
252b5132
RH
1117
1118/* We need some complex handling for stabs (sym1 - sym2). Luckily, we'll
1119 always be able to reduce the expression to a constant, so we don't
1120 need real complex handling yet. */
1121#define is_complex(exp) \
1122 ((exp).X_op != O_constant && (exp).X_op != O_symbol)
1123
1124/* Actual functions to implement the PA specific code for the assembler. */
1125
1126/* Called before writing the object file. Make sure entry/exit and
1127 proc/procend pairs match. */
1128
1129void
1130pa_check_eof ()
1131{
1132 if (within_entry_exit)
1133 as_fatal (_("Missing .exit\n"));
1134
1135 if (within_procedure)
1136 as_fatal (_("Missing .procend\n"));
1137}
1138
252b5132
RH
1139/* Returns a pointer to the label_symbol_struct for the current space.
1140 or NULL if no label_symbol_struct exists for the current space. */
1141
1142static label_symbol_struct *
1143pa_get_label ()
1144{
1145 label_symbol_struct *label_chain;
252b5132
RH
1146
1147 for (label_chain = label_symbols_rootp;
1148 label_chain;
1149 label_chain = label_chain->lss_next)
49863f82
JL
1150 {
1151#ifdef OBJ_SOM
1152 if (current_space == label_chain->lss_space && label_chain->lss_label)
1153 return label_chain;
1154#endif
1155#ifdef OBJ_ELF
1156 if (now_seg == label_chain->lss_segment && label_chain->lss_label)
252b5132 1157 return label_chain;
49863f82
JL
1158#endif
1159 }
252b5132
RH
1160
1161 return NULL;
1162}
1163
1164/* Defines a label for the current space. If one is already defined,
1165 this function will replace it with the new label. */
1166
1167void
1168pa_define_label (symbol)
1169 symbolS *symbol;
1170{
1171 label_symbol_struct *label_chain = pa_get_label ();
252b5132
RH
1172
1173 if (label_chain)
1174 label_chain->lss_label = symbol;
1175 else
1176 {
1177 /* Create a new label entry and add it to the head of the chain. */
1178 label_chain
1179 = (label_symbol_struct *) xmalloc (sizeof (label_symbol_struct));
1180 label_chain->lss_label = symbol;
49863f82
JL
1181#ifdef OBJ_SOM
1182 label_chain->lss_space = current_space;
1183#endif
1184#ifdef OBJ_ELF
1185 label_chain->lss_segment = now_seg;
1186#endif
252b5132
RH
1187 label_chain->lss_next = NULL;
1188
1189 if (label_symbols_rootp)
1190 label_chain->lss_next = label_symbols_rootp;
1191
1192 label_symbols_rootp = label_chain;
1193 }
1194}
1195
1196/* Removes a label definition for the current space.
1197 If there is no label_symbol_struct entry, then no action is taken. */
1198
1199static void
1200pa_undefine_label ()
1201{
1202 label_symbol_struct *label_chain;
1203 label_symbol_struct *prev_label_chain = NULL;
252b5132
RH
1204
1205 for (label_chain = label_symbols_rootp;
1206 label_chain;
1207 label_chain = label_chain->lss_next)
1208 {
49863f82
JL
1209 if (1
1210#ifdef OBJ_SOM
1211 && current_space == label_chain->lss_space && label_chain->lss_label
1212#endif
1213#ifdef OBJ_ELF
1214 && now_seg == label_chain->lss_segment && label_chain->lss_label
1215#endif
1216 )
252b5132
RH
1217 {
1218 /* Remove the label from the chain and free its memory. */
1219 if (prev_label_chain)
1220 prev_label_chain->lss_next = label_chain->lss_next;
1221 else
1222 label_symbols_rootp = label_chain->lss_next;
1223
1224 free (label_chain);
1225 break;
1226 }
1227 prev_label_chain = label_chain;
1228 }
1229}
1230
1231
1232/* An HPPA-specific version of fix_new. This is required because the HPPA
1233 code needs to keep track of some extra stuff. Each call to fix_new_hppa
1234 results in the creation of an instance of an hppa_fix_struct. An
1235 hppa_fix_struct stores the extra information along with a pointer to the
1236 original fixS. This is attached to the original fixup via the
1237 tc_fix_data field. */
1238
1239static void
1240fix_new_hppa (frag, where, size, add_symbol, offset, exp, pcrel,
1241 r_type, r_field, r_format, arg_reloc, unwind_bits)
1242 fragS *frag;
1243 int where;
1244 int size;
1245 symbolS *add_symbol;
1246 long offset;
1247 expressionS *exp;
1248 int pcrel;
1249 bfd_reloc_code_real_type r_type;
1250 enum hppa_reloc_field_selector_type_alt r_field;
1251 int r_format;
1252 long arg_reloc;
1253 int* unwind_bits;
1254{
1255 fixS *new_fix;
1256
1257 struct hppa_fix_struct *hppa_fix = (struct hppa_fix_struct *)
1258 obstack_alloc (&notes, sizeof (struct hppa_fix_struct));
1259
1260 if (exp != NULL)
1261 new_fix = fix_new_exp (frag, where, size, exp, pcrel, r_type);
1262 else
1263 new_fix = fix_new (frag, where, size, add_symbol, offset, pcrel, r_type);
1264 new_fix->tc_fix_data = (void *) hppa_fix;
1265 hppa_fix->fx_r_type = r_type;
1266 hppa_fix->fx_r_field = r_field;
1267 hppa_fix->fx_r_format = r_format;
1268 hppa_fix->fx_arg_reloc = arg_reloc;
1269 hppa_fix->segment = now_seg;
1270#ifdef OBJ_SOM
1271 if (r_type == R_ENTRY || r_type == R_EXIT)
1272 new_fix->fx_offset = *unwind_bits;
1273#endif
1274
1275 /* foo-$global$ is used to access non-automatic storage. $global$
1276 is really just a marker and has served its purpose, so eliminate
1277 it now so as not to confuse write.c. */
1278 if (new_fix->fx_subsy
1279 && !strcmp (S_GET_NAME (new_fix->fx_subsy), "$global$"))
1280 new_fix->fx_subsy = NULL;
1281}
1282
1283/* Parse a .byte, .word, .long expression for the HPPA. Called by
1284 cons via the TC_PARSE_CONS_EXPRESSION macro. */
1285
1286void
1287parse_cons_expression_hppa (exp)
1288 expressionS *exp;
1289{
1290 hppa_field_selector = pa_chk_field_selector (&input_line_pointer);
1291 expression (exp);
1292}
1293
1294/* This fix_new is called by cons via TC_CONS_FIX_NEW.
1295 hppa_field_selector is set by the parse_cons_expression_hppa. */
1296
1297void
1298cons_fix_new_hppa (frag, where, size, exp)
1299 fragS *frag;
1300 int where;
1301 int size;
1302 expressionS *exp;
1303{
1304 unsigned int rel_type;
1305
1306 /* Get a base relocation type. */
1307 if (is_DP_relative (*exp))
1308 rel_type = R_HPPA_GOTOFF;
1309 else if (is_complex (*exp))
1310 rel_type = R_HPPA_COMPLEX;
1311 else
1312 rel_type = R_HPPA;
1313
1314 if (hppa_field_selector != e_psel && hppa_field_selector != e_fsel)
1315 as_warn (_("Invalid field selector. Assuming F%%."));
1316
1317 fix_new_hppa (frag, where, size,
1318 (symbolS *) NULL, (offsetT) 0, exp, 0, rel_type,
077db52a 1319 hppa_field_selector, size * 8, 0, NULL);
252b5132
RH
1320
1321 /* Reset field selector to its default state. */
1322 hppa_field_selector = 0;
1323}
1324
1325/* This function is called once, at assembler startup time. It should
1326 set up all the tables, etc. that the MD part of the assembler will need. */
1327
1328void
1329md_begin ()
1330{
1331 const char *retval = NULL;
1332 int lose = 0;
1333 unsigned int i = 0;
1334
1335 last_call_info = NULL;
1336 call_info_root = NULL;
1337
1338 /* Set the default machine type. */
1339 if (!bfd_set_arch_mach (stdoutput, bfd_arch_hppa, 10))
1340 as_warn (_("could not set architecture and machine"));
1341
1342 /* Folding of text and data segments fails miserably on the PA.
1343 Warn user and disable "-R" option. */
1344 if (flag_readonly_data_in_text)
1345 {
1346 as_warn (_("-R option not supported on this target."));
1347 flag_readonly_data_in_text = 0;
1348 }
1349
49863f82 1350#ifdef OBJ_SOM
252b5132 1351 pa_spaces_begin ();
49863f82 1352#endif
252b5132
RH
1353
1354 op_hash = hash_new ();
1355
1356 while (i < NUMOPCODES)
1357 {
1358 const char *name = pa_opcodes[i].name;
1359 retval = hash_insert (op_hash, name, (struct pa_opcode *) &pa_opcodes[i]);
1360 if (retval != NULL && *retval != '\0')
1361 {
1362 as_fatal (_("Internal error: can't hash `%s': %s\n"), name, retval);
1363 lose = 1;
1364 }
1365 do
1366 {
1367 if ((pa_opcodes[i].match & pa_opcodes[i].mask)
1368 != pa_opcodes[i].match)
1369 {
1370 fprintf (stderr, _("internal error: losing opcode: `%s' \"%s\"\n"),
1371 pa_opcodes[i].name, pa_opcodes[i].args);
1372 lose = 1;
1373 }
1374 ++i;
1375 }
1376 while (i < NUMOPCODES && !strcmp (pa_opcodes[i].name, name));
1377 }
1378
1379 if (lose)
1380 as_fatal (_("Broken assembler. No assembly attempted."));
1381
49863f82 1382#ifdef OBJ_SOM
252b5132
RH
1383 /* SOM will change text_section. To make sure we never put
1384 anything into the old one switch to the new one now. */
1385 subseg_set (text_section, 0);
49863f82 1386#endif
252b5132 1387
993142d5 1388#ifdef OBJ_SOM
252b5132
RH
1389 dummy_symbol = symbol_find_or_make ("L$dummy");
1390 S_SET_SEGMENT (dummy_symbol, text_section);
993142d5
ILT
1391 /* Force the symbol to be converted to a real symbol. */
1392 (void) symbol_get_bfdsym (dummy_symbol);
1393#endif
252b5132
RH
1394}
1395
1396/* Assemble a single instruction storing it into a frag. */
1397void
1398md_assemble (str)
1399 char *str;
1400{
1401 char *to;
1402
1403 /* The had better be something to assemble. */
1404 assert (str);
1405
1406 /* If we are within a procedure definition, make sure we've
1407 defined a label for the procedure; handle case where the
1408 label was defined after the .PROC directive.
1409
1410 Note there's not need to diddle with the segment or fragment
1411 for the label symbol in this case. We have already switched
1412 into the new $CODE$ subspace at this point. */
1413 if (within_procedure && last_call_info->start_symbol == NULL)
1414 {
1415 label_symbol_struct *label_symbol = pa_get_label ();
1416
1417 if (label_symbol)
1418 {
1419 if (label_symbol->lss_label)
1420 {
1421 last_call_info->start_symbol = label_symbol->lss_label;
a0f75b47
ILT
1422 symbol_get_bfdsym (label_symbol->lss_label)->flags
1423 |= BSF_FUNCTION;
252b5132
RH
1424#ifdef OBJ_SOM
1425 /* Also handle allocation of a fixup to hold the unwind
1426 information when the label appears after the proc/procend. */
1427 if (within_entry_exit)
1428 {
1429 char *where = frag_more (0);
1430
1431 fix_new_hppa (frag_now, where - frag_now->fr_literal, 0,
1432 NULL, (offsetT) 0, NULL,
1433 0, R_HPPA_ENTRY, e_fsel, 0, 0,
1434 (int *)&last_call_info->ci_unwind.descriptor);
1435 }
1436#endif
1437 }
1438 else
1439 as_bad (_("Missing function name for .PROC (corrupted label chain)"));
1440 }
1441 else
1442 as_bad (_("Missing function name for .PROC"));
1443 }
1444
1445 /* Assemble the instruction. Results are saved into "the_insn". */
1446 pa_ip (str);
1447
1448 /* Get somewhere to put the assembled instrution. */
1449 to = frag_more (4);
1450
1451 /* Output the opcode. */
1452 md_number_to_chars (to, the_insn.opcode, 4);
1453
1454 /* If necessary output more stuff. */
1455 if (the_insn.reloc != R_HPPA_NONE)
1456 fix_new_hppa (frag_now, (to - frag_now->fr_literal), 4, NULL,
1457 (offsetT) 0, &the_insn.exp, the_insn.pcrel,
1458 the_insn.reloc, the_insn.field_selector,
1459 the_insn.format, the_insn.arg_reloc, NULL);
2d93dcc4
JL
1460
1461#ifdef OBJ_ELF
1462 if (debug_type == DEBUG_DWARF2)
1463 dwarf2_where (&debug_line);
1464#endif
1465
252b5132
RH
1466}
1467
1468/* Do the real work for assembling a single instruction. Store results
1469 into the global "the_insn" variable. */
1470
1471static void
1472pa_ip (str)
1473 char *str;
1474{
1475 char *error_message = "";
1476 char *s, c, *argstart, *name, *save_s;
1477 const char *args;
1478 int match = FALSE;
1479 int comma = 0;
1480 int cmpltr, nullif, flag, cond, num;
1481 unsigned long opcode;
1482 struct pa_opcode *insn;
1483
49863f82 1484#ifdef OBJ_SOM
252b5132
RH
1485 /* We must have a valid space and subspace. */
1486 pa_check_current_space_and_subspace ();
49863f82 1487#endif
252b5132 1488
b1c5e0ee
JL
1489 /* Convert everything up to the first whitespace character into lower
1490 case. */
1491 for (s = str; *s != ' ' && *s != '\t' && *s != '\n' && *s != '\0'; s++)
1492 if (isupper (*s))
1493 *s = tolower (*s);
1494
252b5132
RH
1495 /* Skip to something interesting. */
1496 for (s = str; isupper (*s) || islower (*s) || (*s >= '0' && *s <= '3'); ++s)
1497 ;
1498
1499 switch (*s)
1500 {
1501
1502 case '\0':
1503 break;
1504
1505 case ',':
1506 comma = 1;
1507
1508 /*FALLTHROUGH */
1509
1510 case ' ':
1511 *s++ = '\0';
1512 break;
1513
1514 default:
1515 as_fatal (_("Unknown opcode: `%s'"), str);
1516 }
1517
1518 save_s = str;
1519
252b5132
RH
1520 /* Look up the opcode in the has table. */
1521 if ((insn = (struct pa_opcode *) hash_find (op_hash, str)) == NULL)
1522 {
1523 as_bad ("Unknown opcode: `%s'", str);
1524 return;
1525 }
1526
1527 if (comma)
1528 {
1529 *--s = ',';
1530 }
1531
1532 /* Mark the location where arguments for the instruction start, then
1533 start processing them. */
1534 argstart = s;
1535 for (;;)
1536 {
1537 /* Do some initialization. */
1538 opcode = insn->match;
0f4f8b56 1539 strict = (insn->flags & FLAG_STRICT);
252b5132
RH
1540 memset (&the_insn, 0, sizeof (the_insn));
1541
1542 the_insn.reloc = R_HPPA_NONE;
1543
1544 /* If this instruction is specific to a particular architecture,
1545 then set a new architecture. */
1546 /* But do not automatically promote to pa2.0. The automatic promotion
1547 crud is for compatability with HP's old assemblers only. */
1548 if (insn->arch < 20
1549 && bfd_get_mach (stdoutput) < insn->arch)
1550 {
1551 if (!bfd_set_arch_mach (stdoutput, bfd_arch_hppa, insn->arch))
1552 as_warn (_("could not update architecture and machine"));
1553 }
1554 else if (bfd_get_mach (stdoutput) < insn->arch)
1555 {
1556 match = FALSE;
1557 goto failed;
1558 }
1559
1560 /* Build the opcode, checking as we go to make
1561 sure that the operands match. */
1562 for (args = insn->args;; ++args)
1563 {
680ef6de
JL
1564 /* Absorb white space in instruction. */
1565 while (*s == ' ' || *s == '\t')
1566 s++;
1567
252b5132
RH
1568 switch (*args)
1569 {
1570
1571 /* End of arguments. */
1572 case '\0':
1573 if (*s == '\0')
1574 match = TRUE;
1575 break;
1576
1577 case '+':
1578 if (*s == '+')
1579 {
1580 ++s;
1581 continue;
1582 }
1583 if (*s == '-')
1584 continue;
1585 break;
1586
1587 /* These must match exactly. */
1588 case '(':
1589 case ')':
1590 case ',':
1591 case ' ':
1592 if (*s++ == *args)
1593 continue;
1594 break;
1595
1596 /* Handle a 5 bit register or control register field at 10. */
1597 case 'b':
1598 case '^':
0f4f8b56
JL
1599 /* This should be more strict. Small steps. */
1600 if (strict && *s != '%')
1601 break;
e7c1f43c 1602 num = pa_parse_number (&s, 0);
252b5132
RH
1603 CHECK_FIELD (num, 31, 0, 0);
1604 INSERT_FIELD_AND_CONTINUE (opcode, num, 21);
1605
a97685e9
JL
1606 /* Handle %sar or %cr11. No bits get set, we just verify that it
1607 is there. */
1608 case '!':
1609 /* Skip whitespace before register. */
1610 while (*s == ' ' || *s == '\t')
1611 s = s + 1;
1612
1613 if (!strncasecmp(s, "%sar", 4))
1614 {
1615 s += 4;
1616 continue;
1617 }
1618 else if (!strncasecmp(s, "%cr11", 5))
1619 {
1620 s += 5;
1621 continue;
1622 }
1623 break;
1624
252b5132
RH
1625 /* Handle a 5 bit register field at 15. */
1626 case 'x':
0f4f8b56
JL
1627 /* This should be more strict. Small steps. */
1628 if (strict && *s != '%')
1629 break;
e7c1f43c 1630 num = pa_parse_number (&s, 0);
252b5132
RH
1631 CHECK_FIELD (num, 31, 0, 0);
1632 INSERT_FIELD_AND_CONTINUE (opcode, num, 16);
1633
1634 /* Handle a 5 bit register field at 31. */
252b5132 1635 case 't':
0f4f8b56
JL
1636 /* This should be more strict. Small steps. */
1637 if (strict && *s != '%')
1638 break;
e7c1f43c 1639 num = pa_parse_number (&s, 0);
252b5132
RH
1640 CHECK_FIELD (num, 31, 0, 0);
1641 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
1642
413c94ba
JL
1643 /* Handle a 5 bit register field at 10 and 15. */
1644 case 'a':
0f4f8b56
JL
1645 /* This should be more strict. Small steps. */
1646 if (strict && *s != '%')
1647 break;
e7c1f43c 1648 num = pa_parse_number (&s, 0);
413c94ba
JL
1649 CHECK_FIELD (num, 31, 0, 0);
1650 opcode |= num << 16;
1651 INSERT_FIELD_AND_CONTINUE (opcode, num, 21);
1652
252b5132
RH
1653 /* Handle a 5 bit field length at 31. */
1654 case 'T':
1655 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
1656 if (strict && the_insn.exp.X_op != O_constant)
1657 break;
252b5132
RH
1658 s = expr_end;
1659 CHECK_FIELD (num, 32, 1, 0);
1660 INSERT_FIELD_AND_CONTINUE (opcode, 32 - num, 0);
1661
1662 /* Handle a 5 bit immediate at 15. */
1663 case '5':
1664 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
1665 if (strict && the_insn.exp.X_op != O_constant)
1666 break;
252b5132 1667 s = expr_end;
0f4f8b56
JL
1668 /* When in strict mode, we want to just reject this
1669 match instead of giving an out of range error. */
1670 CHECK_FIELD (num, 15, -16, strict);
252b5132
RH
1671 low_sign_unext (num, 5, &num);
1672 INSERT_FIELD_AND_CONTINUE (opcode, num, 16);
1673
1674 /* Handle a 5 bit immediate at 31. */
1675 case 'V':
1676 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
1677 if (strict && the_insn.exp.X_op != O_constant)
1678 break;
252b5132 1679 s = expr_end;
0f4f8b56
JL
1680 /* When in strict mode, we want to just reject this
1681 match instead of giving an out of range error. */
1682 CHECK_FIELD (num, 15, -16, strict)
252b5132
RH
1683 low_sign_unext (num, 5, &num);
1684 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
1685
1686 /* Handle an unsigned 5 bit immediate at 31. */
1687 case 'r':
1688 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
1689 if (strict && the_insn.exp.X_op != O_constant)
1690 break;
252b5132
RH
1691 s = expr_end;
1692 CHECK_FIELD (num, 31, 0, 0);
0f4f8b56 1693 INSERT_FIELD_AND_CONTINUE (opcode, num, strict);
252b5132
RH
1694
1695 /* Handle an unsigned 5 bit immediate at 15. */
1696 case 'R':
1697 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
1698 if (strict && the_insn.exp.X_op != O_constant)
1699 break;
252b5132 1700 s = expr_end;
0f4f8b56 1701 CHECK_FIELD (num, 31, 0, strict);
252b5132
RH
1702 INSERT_FIELD_AND_CONTINUE (opcode, num, 16);
1703
680ef6de
JL
1704 /* Handle an unsigned 10 bit immediate at 15. */
1705 case 'U':
1706 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
1707 if (strict && the_insn.exp.X_op != O_constant)
1708 break;
680ef6de 1709 s = expr_end;
0f4f8b56 1710 CHECK_FIELD (num, 1023, 0, strict);
680ef6de
JL
1711 INSERT_FIELD_AND_CONTINUE (opcode, num, 16);
1712
252b5132
RH
1713 /* Handle a 2 bit space identifier at 17. */
1714 case 's':
0f4f8b56
JL
1715 /* This should be more strict. Small steps. */
1716 if (strict && *s != '%')
1717 break;
e7c1f43c 1718 num = pa_parse_number (&s, 0);
252b5132
RH
1719 CHECK_FIELD (num, 3, 0, 1);
1720 INSERT_FIELD_AND_CONTINUE (opcode, num, 14);
1721
1722 /* Handle a 3 bit space identifier at 18. */
1723 case 'S':
0f4f8b56
JL
1724 /* This should be more strict. Small steps. */
1725 if (strict && *s != '%')
1726 break;
e7c1f43c 1727 num = pa_parse_number (&s, 0);
252b5132
RH
1728 CHECK_FIELD (num, 7, 0, 1);
1729 dis_assemble_3 (num, &num);
1730 INSERT_FIELD_AND_CONTINUE (opcode, num, 13);
1731
28252e61 1732 /* Handle all completers. */
252b5132 1733 case 'c':
28252e61
JL
1734 switch (*++args)
1735 {
1736
1737 /* Handle a completer for an indexing load or store. */
1738 case 'x':
252b5132 1739 {
28252e61
JL
1740 int uu = 0;
1741 int m = 0;
1742 int i = 0;
1743 while (*s == ',' && i < 2)
252b5132 1744 {
28252e61
JL
1745 s++;
1746 if (strncasecmp (s, "sm", 2) == 0)
1747 {
1748 uu = 1;
1749 m = 1;
1750 s++;
1751 i++;
1752 }
1753 else if (strncasecmp (s, "m", 1) == 0)
1754 m = 1;
1755 else if (strncasecmp (s, "s", 1) == 0)
1756 uu = 1;
0f4f8b56
JL
1757 /* When in strict mode this is a match failure. */
1758 else if (strict)
1759 break;
28252e61
JL
1760 else
1761 as_bad (_("Invalid Indexed Load Completer."));
252b5132
RH
1762 s++;
1763 i++;
1764 }
28252e61
JL
1765 if (i > 2)
1766 as_bad (_("Invalid Indexed Load Completer Syntax."));
1767 opcode |= m << 5;
1768 INSERT_FIELD_AND_CONTINUE (opcode, uu, 13);
252b5132 1769 }
252b5132 1770
28252e61
JL
1771 /* Handle a short load/store completer. */
1772 case 'm':
252b5132 1773 {
28252e61
JL
1774 int a = 0;
1775 int m = 0;
1776 if (*s == ',')
252b5132 1777 {
28252e61
JL
1778 s++;
1779 if (strncasecmp (s, "ma", 2) == 0)
1780 {
1781 a = 0;
1782 m = 1;
1783 }
1784 else if (strncasecmp (s, "mb", 2) == 0)
1785 {
1786 a = 1;
1787 m = 1;
1788 }
0f4f8b56
JL
1789 /* When in strict mode this is a match failure. */
1790 else if (strict)
1791 break;
28252e61
JL
1792 else
1793 as_bad (_("Invalid Short Load/Store Completer."));
1794 s += 2;
252b5132 1795 }
252b5132 1796
252b5132
RH
1797 opcode |= m << 5;
1798 INSERT_FIELD_AND_CONTINUE (opcode, a, 13);
1799 }
252b5132 1800
28252e61
JL
1801 /* Handle a stbys completer. */
1802 case 's':
252b5132 1803 {
28252e61
JL
1804 int a = 0;
1805 int m = 0;
1806 int i = 0;
1807 while (*s == ',' && i < 2)
1808 {
1809 s++;
1810 if (strncasecmp (s, "m", 1) == 0)
1811 m = 1;
1812 else if (strncasecmp (s, "b", 1) == 0)
1813 a = 0;
1814 else if (strncasecmp (s, "e", 1) == 0)
1815 a = 1;
0f4f8b56
JL
1816 /* When in strict mode this is a match failure. */
1817 else if (strict)
1818 break;
28252e61
JL
1819 else
1820 as_bad (_("Invalid Store Bytes Short Completer"));
1821 s++;
1822 i++;
1823 }
1824 if (i > 2)
252b5132 1825 as_bad (_("Invalid Store Bytes Short Completer"));
28252e61
JL
1826 opcode |= m << 5;
1827 INSERT_FIELD_AND_CONTINUE (opcode, a, 13);
252b5132 1828 }
28252e61 1829
680ef6de
JL
1830 /* Handle a local processor completer. */
1831 case 'L':
1832 if (strncasecmp (s, ",l", 2) != 0)
1833 break;
1834 s += 2;
1835 continue;
1836
1837 /* Handle a PROBE read/write completer. */
1838 case 'w':
1839 flag = 0;
1840 if (!strncasecmp (s, ",w", 2))
1841 {
1842 flag = 1;
1843 s += 2;
1844 }
1845 else if (!strncasecmp (s, ",r", 2))
1846 {
1847 flag = 0;
1848 s += 2;
1849 }
1850
1851 INSERT_FIELD_AND_CONTINUE (opcode, flag, 6);
1852
1853 /* Handle MFCTL wide completer. */
1854 case 'W':
1855 if (strncasecmp (s, ",w", 2) != 0)
1856 break;
1857 s += 2;
1858 continue;
1859
1860 /* Handle an RFI restore completer. */
1861 case 'r':
1862 flag = 0;
1863 if (!strncasecmp (s, ",r", 2))
1864 {
1865 flag = 5;
1866 s += 2;
1867 }
1868
1869 INSERT_FIELD_AND_CONTINUE (opcode, flag, 5);
1870
28252e61
JL
1871 /* Handle a system control completer. */
1872 case 'Z':
1873 if (*s == ',' && (*(s + 1) == 'm' || *(s + 1) == 'M'))
1874 {
1875 flag = 1;
1876 s += 2;
1877 }
1878 else
1879 flag = 0;
1880
1881 INSERT_FIELD_AND_CONTINUE (opcode, flag, 5);
1882
680ef6de
JL
1883 /* Handle intermediate/final completer for DCOR. */
1884 case 'i':
1885 flag = 0;
1886 if (!strncasecmp (s, ",i", 2))
1887 {
1888 flag = 1;
1889 s += 2;
1890 }
1891
1892 INSERT_FIELD_AND_CONTINUE (opcode, flag, 6);
1893
9e4f2d3a
JL
1894 /* Handle zero/sign extension completer. */
1895 case 'z':
1896 flag = 1;
1897 if (!strncasecmp (s, ",z", 2))
1898 {
1899 flag = 0;
1900 s += 2;
1901 }
1902
1903 INSERT_FIELD_AND_CONTINUE (opcode, flag, 10);
1904
680ef6de
JL
1905 /* Handle add completer. */
1906 case 'a':
1907 flag = 1;
1908 if (!strncasecmp (s, ",l", 2))
1909 {
1910 flag = 2;
1911 s += 2;
1912 }
1913 else if (!strncasecmp (s, ",tsv", 4))
1914 {
1915 flag = 3;
1916 s += 4;
1917 }
1918
1919 INSERT_FIELD_AND_CONTINUE (opcode, flag, 10);
1920
1921 /* Handle 64 bit carry for ADD. */
1922 case 'Y':
1923 flag = 0;
1924 if (!strncasecmp (s, ",dc,tsv", 7) ||
1925 !strncasecmp (s, ",tsv,dc", 7))
1926 {
1927 flag = 1;
1928 s += 7;
1929 }
1930 else if (!strncasecmp (s, ",dc", 3))
1931 {
1932 flag = 0;
1933 s += 3;
1934 }
1935 else
1936 break;
1937
1938 INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
1939
1940 /* Handle 32 bit carry for ADD. */
1941 case 'y':
1942 flag = 0;
1943 if (!strncasecmp (s, ",c,tsv", 6) ||
1944 !strncasecmp (s, ",tsv,c", 6))
1945 {
1946 flag = 1;
1947 s += 6;
1948 }
1949 else if (!strncasecmp (s, ",c", 2))
1950 {
1951 flag = 0;
1952 s += 2;
1953 }
1954 else
1955 break;
1956
1957 INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
1958
1959 /* Handle trap on signed overflow. */
1960 case 'v':
1961 flag = 0;
1962 if (!strncasecmp (s, ",tsv", 4))
1963 {
1964 flag = 1;
1965 s += 4;
1966 }
1967
1968 INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
1969
1970 /* Handle trap on condition and overflow. */
1971 case 't':
1972 flag = 0;
1973 if (!strncasecmp (s, ",tc,tsv", 7) ||
1974 !strncasecmp (s, ",tsv,tc", 7))
1975 {
1976 flag = 1;
1977 s += 7;
1978 }
1979 else if (!strncasecmp (s, ",tc", 3))
1980 {
1981 flag = 0;
1982 s += 3;
1983 }
1984 else
1985 break;
1986
1987 INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
1988
1989 /* Handle 64 bit borrow for SUB. */
1990 case 'B':
1991 flag = 0;
1992 if (!strncasecmp (s, ",db,tsv", 7) ||
1993 !strncasecmp (s, ",tsv,db", 7))
1994 {
1995 flag = 1;
1996 s += 7;
1997 }
1998 else if (!strncasecmp (s, ",db", 3))
1999 {
2000 flag = 0;
2001 s += 3;
2002 }
2003 else
2004 break;
2005
2006 INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
2007
2008 /* Handle 32 bit borrow for SUB. */
2009 case 'b':
2010 flag = 0;
2011 if (!strncasecmp (s, ",b,tsv", 6) ||
2012 !strncasecmp (s, ",tsv,b", 6))
2013 {
2014 flag = 1;
2015 s += 6;
2016 }
2017 else if (!strncasecmp (s, ",b", 2))
2018 {
2019 flag = 0;
2020 s += 2;
2021 }
2022 else
2023 break;
2024
2025 INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
2026
2027 /* Handle trap condition completer for UADDCM. */
2028 case 'T':
2029 flag = 0;
2030 if (!strncasecmp (s, ",tc", 3))
2031 {
2032 flag = 1;
2033 s += 3;
2034 }
2035
2036 INSERT_FIELD_AND_CONTINUE (opcode, flag, 6);
2037
413c94ba
JL
2038 /* Handle signed/unsigned at 21. */
2039 case 'S':
2040 {
2041 int sign = 1;
2042 if (strncasecmp (s, ",s", 2) == 0)
2043 {
2044 sign = 1;
2045 s += 2;
2046 }
2047 else if (strncasecmp (s, ",u", 2) == 0)
2048 {
2049 sign = 0;
2050 s += 2;
2051 }
2052
2053 INSERT_FIELD_AND_CONTINUE (opcode, sign, 10);
2054 }
2055
2056 /* Handle left/right combination at 17:18. */
2057 case 'h':
2058 if (*s++ == ',')
2059 {
2060 int lr = 0;
2061 if (*s == 'r')
2062 lr = 2;
2063 else if (*s == 'l')
2064 lr = 0;
2065 else
2066 as_bad(_("Invalid left/right combination completer"));
2067
2068 s++;
2069 INSERT_FIELD_AND_CONTINUE (opcode, lr, 13);
2070 }
2071 else
2072 as_bad(_("Invalid left/right combination completer"));
2073 break;
2074
2075 /* Handle saturation at 24:25. */
2076 case 'H':
2077 {
2078 int sat = 3;
2079 if (strncasecmp (s, ",ss", 3) == 0)
2080 {
2081 sat = 1;
2082 s += 3;
2083 }
2084 else if (strncasecmp (s, ",us", 3) == 0)
2085 {
2086 sat = 0;
2087 s += 3;
2088 }
2089
2090 INSERT_FIELD_AND_CONTINUE (opcode, sat, 6);
2091 }
2092
2093 /* Handle permutation completer. */
2094 case '*':
2095 if (*s++ == ',')
2096 {
2097 int permloc[4] = {13,10,8,6};
2098 int perm = 0;
2099 int i = 0;
2100 for (; i < 4; i++)
2101 {
2102 switch (*s++)
2103 {
2104 case '0':
2105 perm = 0;
2106 break;
2107 case '1':
2108 perm = 1;
2109 break;
2110 case '2':
2111 perm = 2;
2112 break;
2113 case '3':
2114 perm = 3;
2115 break;
2116 default:
2117 as_bad(_("Invalid permutation completer"));
2118 }
2119 opcode |= perm << permloc[i];
2120 }
2121 continue;
2122 }
2123 else
2124 as_bad(_("Invalid permutation completer"));
2125 break;
2126
28252e61
JL
2127 default:
2128 abort ();
2129 }
2130 break;
252b5132 2131
55a914bc 2132 /* Handle all conditions. */
252b5132 2133 case '?':
55a914bc
JL
2134 {
2135 args++;
2136 switch (*args)
2137 {
2138 /* Handle FP compare conditions. */
2139 case 'f':
2140 cond = pa_parse_fp_cmp_cond (&s);
2141 INSERT_FIELD_AND_CONTINUE (opcode, cond, 0);
2142
2143 /* Handle an add condition. */
9a913dfb 2144 case 'A':
55a914bc
JL
2145 case 'a':
2146 cmpltr = 0;
2147 flag = 0;
2148 if (*s == ',')
2149 {
2150 s++;
9a913dfb
JL
2151
2152 /* 64 bit conditions. */
2153 if (*args == 'A')
2154 {
2155 if (*s == '*')
2156 s++;
2157 else
2158 break;
2159 }
17d9105c
JL
2160 else if (*s == '*')
2161 break;
55a914bc 2162 name = s;
9a913dfb 2163
680ef6de 2164 name = s;
55a914bc
JL
2165 while (*s != ',' && *s != ' ' && *s != '\t')
2166 s += 1;
2167 c = *s;
2168 *s = 0x00;
2169 if (strcmp (name, "=") == 0)
2170 cmpltr = 1;
2171 else if (strcmp (name, "<") == 0)
2172 cmpltr = 2;
2173 else if (strcmp (name, "<=") == 0)
2174 cmpltr = 3;
2175 else if (strcasecmp (name, "nuv") == 0)
2176 cmpltr = 4;
2177 else if (strcasecmp (name, "znv") == 0)
2178 cmpltr = 5;
2179 else if (strcasecmp (name, "sv") == 0)
2180 cmpltr = 6;
2181 else if (strcasecmp (name, "od") == 0)
2182 cmpltr = 7;
2183 else if (strcasecmp (name, "tr") == 0)
2184 {
2185 cmpltr = 0;
2186 flag = 1;
2187 }
2188 else if (strcmp (name, "<>") == 0)
2189 {
2190 cmpltr = 1;
2191 flag = 1;
2192 }
2193 else if (strcmp (name, ">=") == 0)
2194 {
2195 cmpltr = 2;
2196 flag = 1;
2197 }
2198 else if (strcmp (name, ">") == 0)
2199 {
2200 cmpltr = 3;
2201 flag = 1;
2202 }
2203 else if (strcasecmp (name, "uv") == 0)
2204 {
2205 cmpltr = 4;
2206 flag = 1;
2207 }
2208 else if (strcasecmp (name, "vnz") == 0)
2209 {
2210 cmpltr = 5;
2211 flag = 1;
2212 }
2213 else if (strcasecmp (name, "nsv") == 0)
2214 {
2215 cmpltr = 6;
2216 flag = 1;
2217 }
2218 else if (strcasecmp (name, "ev") == 0)
2219 {
2220 cmpltr = 7;
2221 flag = 1;
2222 }
9a913dfb
JL
2223 /* ",*" is a valid condition. */
2224 else if (*args == 'a')
55a914bc
JL
2225 as_bad (_("Invalid Add Condition: %s"), name);
2226 *s = c;
2227 }
2228 opcode |= cmpltr << 13;
2229 INSERT_FIELD_AND_CONTINUE (opcode, flag, 12);
252b5132 2230
55a914bc
JL
2231 /* Handle non-negated add and branch condition. */
2232 case 'd':
2233 cmpltr = pa_parse_nonneg_add_cmpltr (&s, 1);
2234 if (cmpltr < 0)
2235 {
2236 as_bad (_("Invalid Compare/Subtract Condition: %c"), *s);
2237 cmpltr = 0;
2238 }
2239 INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 13);
2240
9a913dfb
JL
2241 /* Handle negated add and branch condition. */
2242 case 'D':
2243 abort ();
2244
2245 /* Handle wide-mode non-negated add and branch condition. */
2246 case 'w':
2247 abort ();
2248
2249 /* Handle wide-mode negated add and branch condition. */
2250 case 'W':
2251 abort();
2252
55a914bc
JL
2253 /* Handle a negated or non-negated add and branch
2254 condition. */
2255 case '@':
2256 save_s = s;
2257 cmpltr = pa_parse_nonneg_add_cmpltr (&s, 1);
2258 if (cmpltr < 0)
2259 {
2260 s = save_s;
2261 cmpltr = pa_parse_neg_add_cmpltr (&s, 1);
2262 if (cmpltr < 0)
2263 {
2264 as_bad (_("Invalid Compare/Subtract Condition"));
2265 cmpltr = 0;
2266 }
2267 else
2268 {
2269 /* Negated condition requires an opcode change. */
2270 opcode |= 1 << 27;
2271 }
2272 }
2273 INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 13);
252b5132 2274
55a914bc 2275 /* Handle branch on bit conditions. */
9a913dfb 2276 case 'B':
55a914bc
JL
2277 case 'b':
2278 cmpltr = 0;
2279 if (*s == ',')
2280 {
2281 s++;
9a913dfb
JL
2282
2283 if (*args == 'B')
2284 {
2285 if (*s == '*')
2286 s++;
2287 else
2288 break;
2289 }
17d9105c
JL
2290 else if (*s == '*')
2291 break;
9a913dfb 2292
55a914bc
JL
2293 if (strncmp (s, "<", 1) == 0)
2294 {
2295 cmpltr = 0;
2296 s++;
2297 }
2298 else if (strncmp (s, ">=", 2) == 0)
2299 {
2300 cmpltr = 1;
2301 s += 2;
2302 }
2303 else
2304 as_bad (_("Invalid Bit Branch Condition: %c"), *s);
2305 }
2306 INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 15);
252b5132 2307
55a914bc 2308 /* Handle a compare/subtract condition. */
9a913dfb 2309 case 'S':
55a914bc
JL
2310 case 's':
2311 cmpltr = 0;
2312 flag = 0;
2313 if (*s == ',')
2314 {
2315 s++;
9a913dfb
JL
2316
2317 /* 64 bit conditions. */
2318 if (*args == 'S')
2319 {
2320 if (*s == '*')
2321 s++;
2322 else
2323 break;
2324 }
17d9105c
JL
2325 else if (*s == '*')
2326 break;
55a914bc 2327 name = s;
9a913dfb 2328
680ef6de 2329 name = s;
55a914bc
JL
2330 while (*s != ',' && *s != ' ' && *s != '\t')
2331 s += 1;
2332 c = *s;
2333 *s = 0x00;
2334 if (strcmp (name, "=") == 0)
2335 cmpltr = 1;
2336 else if (strcmp (name, "<") == 0)
2337 cmpltr = 2;
2338 else if (strcmp (name, "<=") == 0)
2339 cmpltr = 3;
2340 else if (strcasecmp (name, "<<") == 0)
2341 cmpltr = 4;
2342 else if (strcasecmp (name, "<<=") == 0)
2343 cmpltr = 5;
2344 else if (strcasecmp (name, "sv") == 0)
2345 cmpltr = 6;
2346 else if (strcasecmp (name, "od") == 0)
2347 cmpltr = 7;
2348 else if (strcasecmp (name, "tr") == 0)
2349 {
2350 cmpltr = 0;
2351 flag = 1;
2352 }
2353 else if (strcmp (name, "<>") == 0)
2354 {
2355 cmpltr = 1;
2356 flag = 1;
2357 }
2358 else if (strcmp (name, ">=") == 0)
2359 {
2360 cmpltr = 2;
2361 flag = 1;
2362 }
2363 else if (strcmp (name, ">") == 0)
2364 {
2365 cmpltr = 3;
2366 flag = 1;
2367 }
2368 else if (strcasecmp (name, ">>=") == 0)
2369 {
2370 cmpltr = 4;
2371 flag = 1;
2372 }
2373 else if (strcasecmp (name, ">>") == 0)
2374 {
2375 cmpltr = 5;
2376 flag = 1;
2377 }
2378 else if (strcasecmp (name, "nsv") == 0)
2379 {
2380 cmpltr = 6;
2381 flag = 1;
2382 }
2383 else if (strcasecmp (name, "ev") == 0)
2384 {
2385 cmpltr = 7;
2386 flag = 1;
2387 }
9a913dfb
JL
2388 /* ",*" is a valid condition. */
2389 else if (*args != 'S')
55a914bc
JL
2390 as_bad (_("Invalid Compare/Subtract Condition: %s"),
2391 name);
2392 *s = c;
2393 }
2394 opcode |= cmpltr << 13;
2395 INSERT_FIELD_AND_CONTINUE (opcode, flag, 12);
252b5132 2396
55a914bc
JL
2397 /* Handle a non-negated compare condition. */
2398 case 't':
2399 cmpltr = pa_parse_nonneg_cmpsub_cmpltr (&s, 1);
2400 if (cmpltr < 0)
2401 {
2402 as_bad (_("Invalid Compare/Subtract Condition: %c"), *s);
2403 cmpltr = 0;
2404 }
2405 INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 13);
9a913dfb
JL
2406
2407 /* Handle a negated compare condition. */
2408 case 'T':
2409 abort ();
2410
2411 /* Handle a 64 bit non-negated compare condition. */
2412 case 'r':
2413 abort ();
2414
2415 /* Handle a 64 bit negated compare condition. */
2416 case 'R':
2417 abort ();
2418
2419 /* Handle a 64 bit cmpib condition. */
2420 case 'Q':
2421 abort ();
55a914bc
JL
2422
2423 /* Handle a negated or non-negated compare/subtract
2424 condition. */
2425 case 'n':
2426 save_s = s;
2427 cmpltr = pa_parse_nonneg_cmpsub_cmpltr (&s, 1);
2428 if (cmpltr < 0)
2429 {
2430 s = save_s;
2431 cmpltr = pa_parse_neg_cmpsub_cmpltr (&s, 1);
2432 if (cmpltr < 0)
2433 {
2434 as_bad (_("Invalid Compare/Subtract Condition."));
2435 cmpltr = 0;
2436 }
2437 else
2438 {
2439 /* Negated condition requires an opcode change. */
2440 opcode |= 1 << 27;
2441 }
2442 }
2443
2444 INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 13);
2445
2446 /* Handle a logical instruction condition. */
9a913dfb 2447 case 'L':
55a914bc
JL
2448 case 'l':
2449 cmpltr = 0;
2450 flag = 0;
2451 if (*s == ',')
2452 {
2453 s++;
9a913dfb
JL
2454
2455 /* 64 bit conditions. */
2456 if (*args == 'L')
2457 {
2458 if (*s == '*')
2459 s++;
2460 else
2461 break;
2462 }
17d9105c
JL
2463 else if (*s == '*')
2464 break;
55a914bc 2465 name = s;
9a913dfb 2466
680ef6de 2467 name = s;
55a914bc
JL
2468 while (*s != ',' && *s != ' ' && *s != '\t')
2469 s += 1;
2470 c = *s;
2471 *s = 0x00;
2472
2473
2474 if (strcmp (name, "=") == 0)
2475 cmpltr = 1;
2476 else if (strcmp (name, "<") == 0)
2477 cmpltr = 2;
2478 else if (strcmp (name, "<=") == 0)
2479 cmpltr = 3;
2480 else if (strcasecmp (name, "od") == 0)
2481 cmpltr = 7;
2482 else if (strcasecmp (name, "tr") == 0)
2483 {
2484 cmpltr = 0;
2485 flag = 1;
2486 }
2487 else if (strcmp (name, "<>") == 0)
2488 {
2489 cmpltr = 1;
2490 flag = 1;
2491 }
2492 else if (strcmp (name, ">=") == 0)
2493 {
2494 cmpltr = 2;
2495 flag = 1;
2496 }
2497 else if (strcmp (name, ">") == 0)
2498 {
2499 cmpltr = 3;
2500 flag = 1;
2501 }
2502 else if (strcasecmp (name, "ev") == 0)
2503 {
2504 cmpltr = 7;
2505 flag = 1;
2506 }
9a913dfb
JL
2507 /* ",*" is a valid condition. */
2508 else if (*args != 'L')
55a914bc
JL
2509 as_bad (_("Invalid Logical Instruction Condition."));
2510 *s = c;
2511 }
2512 opcode |= cmpltr << 13;
2513 INSERT_FIELD_AND_CONTINUE (opcode, flag, 12);
2514
2515 /* Handle a shift/extract/deposit condition. */
9a913dfb 2516 case 'X':
55a914bc
JL
2517 case 'x':
2518 case 'y':
2519 cmpltr = 0;
2520 if (*s == ',')
2521 {
2522 save_s = s++;
2523
9a913dfb
JL
2524 /* 64 bit conditions. */
2525 if (*args == 'X')
2526 {
2527 if (*s == '*')
2528 s++;
2529 else
2530 break;
2531 }
17d9105c
JL
2532 else if (*s == '*')
2533 break;
55a914bc 2534 name = s;
9a913dfb 2535
680ef6de 2536 name = s;
55a914bc
JL
2537 while (*s != ',' && *s != ' ' && *s != '\t')
2538 s += 1;
2539 c = *s;
2540 *s = 0x00;
2541 if (strcmp (name, "=") == 0)
2542 cmpltr = 1;
2543 else if (strcmp (name, "<") == 0)
2544 cmpltr = 2;
2545 else if (strcasecmp (name, "od") == 0)
2546 cmpltr = 3;
2547 else if (strcasecmp (name, "tr") == 0)
2548 cmpltr = 4;
2549 else if (strcmp (name, "<>") == 0)
2550 cmpltr = 5;
2551 else if (strcmp (name, ">=") == 0)
2552 cmpltr = 6;
2553 else if (strcasecmp (name, "ev") == 0)
2554 cmpltr = 7;
2555 /* Handle movb,n. Put things back the way they were.
2556 This includes moving s back to where it started. */
2557 else if (strcasecmp (name, "n") == 0 && *args == 'y')
2558 {
2559 *s = c;
2560 s = save_s;
2561 continue;
2562 }
9a913dfb
JL
2563 /* ",*" is a valid condition. */
2564 else if (*args != 'X')
55a914bc
JL
2565 as_bad (_("Invalid Shift/Extract/Deposit Condition."));
2566 *s = c;
2567 }
2568 INSERT_FIELD_AND_CONTINUE (opcode, cmpltr, 13);
252b5132 2569
55a914bc 2570 /* Handle a unit instruction condition. */
9a913dfb
JL
2571 case 'U':
2572 case 'u':
55a914bc
JL
2573 cmpltr = 0;
2574 flag = 0;
2575 if (*s == ',')
2576 {
2577 s++;
2578
9a913dfb
JL
2579 /* 64 bit conditions. */
2580 if (*args == 'U')
2581 {
2582 if (*s == '*')
2583 s++;
2584 else
2585 break;
2586 }
17d9105c
JL
2587 else if (*s == '*')
2588 break;
9a913dfb 2589
55a914bc
JL
2590 if (strncasecmp (s, "sbz", 3) == 0)
2591 {
2592 cmpltr = 2;
2593 s += 3;
2594 }
2595 else if (strncasecmp (s, "shz", 3) == 0)
2596 {
2597 cmpltr = 3;
2598 s += 3;
2599 }
2600 else if (strncasecmp (s, "sdc", 3) == 0)
2601 {
2602 cmpltr = 4;
2603 s += 3;
2604 }
2605 else if (strncasecmp (s, "sbc", 3) == 0)
2606 {
2607 cmpltr = 6;
2608 s += 3;
2609 }
2610 else if (strncasecmp (s, "shc", 3) == 0)
2611 {
2612 cmpltr = 7;
2613 s += 3;
2614 }
2615 else if (strncasecmp (s, "tr", 2) == 0)
2616 {
2617 cmpltr = 0;
2618 flag = 1;
2619 s += 2;
2620 }
2621 else if (strncasecmp (s, "nbz", 3) == 0)
2622 {
2623 cmpltr = 2;
2624 flag = 1;
2625 s += 3;
2626 }
2627 else if (strncasecmp (s, "nhz", 3) == 0)
2628 {
2629 cmpltr = 3;
2630 flag = 1;
2631 s += 3;
2632 }
2633 else if (strncasecmp (s, "ndc", 3) == 0)
2634 {
2635 cmpltr = 4;
2636 flag = 1;
2637 s += 3;
2638 }
2639 else if (strncasecmp (s, "nbc", 3) == 0)
2640 {
2641 cmpltr = 6;
2642 flag = 1;
2643 s += 3;
2644 }
2645 else if (strncasecmp (s, "nhc", 3) == 0)
2646 {
2647 cmpltr = 7;
2648 flag = 1;
2649 s += 3;
2650 }
9a913dfb
JL
2651 /* ",*" is a valid condition. */
2652 else if (*args != 'U')
55a914bc
JL
2653 as_bad (_("Invalid Unit Instruction Condition."));
2654 }
2655 opcode |= cmpltr << 13;
2656 INSERT_FIELD_AND_CONTINUE (opcode, flag, 12);
252b5132 2657
55a914bc
JL
2658 default:
2659 abort ();
2660 }
0741736b 2661 break;
55a914bc 2662 }
252b5132 2663
252b5132
RH
2664 /* Handle a nullification completer for branch instructions. */
2665 case 'n':
2666 nullif = pa_parse_nullif (&s);
2667 INSERT_FIELD_AND_CONTINUE (opcode, nullif, 1);
2668
2669 /* Handle a nullification completer for copr and spop insns. */
2670 case 'N':
2671 nullif = pa_parse_nullif (&s);
2672 INSERT_FIELD_AND_CONTINUE (opcode, nullif, 5);
2673
2674
2675 /* Handle a 11 bit immediate at 31. */
2676 case 'i':
2677 the_insn.field_selector = pa_chk_field_selector (&s);
2678 get_expression (s);
2679 s = expr_end;
2680 if (the_insn.exp.X_op == O_constant)
2681 {
2682 num = evaluate_absolute (&the_insn);
2683 CHECK_FIELD (num, 1023, -1024, 0);
2684 low_sign_unext (num, 11, &num);
2685 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
2686 }
2687 else
2688 {
2689 if (is_DP_relative (the_insn.exp))
2690 the_insn.reloc = R_HPPA_GOTOFF;
2691 else if (is_PC_relative (the_insn.exp))
2692 the_insn.reloc = R_HPPA_PCREL_CALL;
2693 else
2694 the_insn.reloc = R_HPPA;
2695 the_insn.format = 11;
2696 continue;
2697 }
2698
2699
2700 /* Handle a 14 bit immediate at 31. */
2701 case 'j':
2702 the_insn.field_selector = pa_chk_field_selector (&s);
2703 get_expression (s);
2704 s = expr_end;
2705 if (the_insn.exp.X_op == O_constant)
2706 {
2707 num = evaluate_absolute (&the_insn);
2708 CHECK_FIELD (num, 8191, -8192, 0);
2709 low_sign_unext (num, 14, &num);
2710 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
2711 }
2712 else
2713 {
2714 if (is_DP_relative (the_insn.exp))
2715 the_insn.reloc = R_HPPA_GOTOFF;
2716 else if (is_PC_relative (the_insn.exp))
2717 the_insn.reloc = R_HPPA_PCREL_CALL;
2718 else
2719 the_insn.reloc = R_HPPA;
2720 the_insn.format = 14;
2721 continue;
2722 }
2723
2724 /* Handle a 21 bit immediate at 31. */
2725 case 'k':
2726 the_insn.field_selector = pa_chk_field_selector (&s);
2727 get_expression (s);
2728 s = expr_end;
2729 if (the_insn.exp.X_op == O_constant)
2730 {
2731 num = evaluate_absolute (&the_insn);
2732 CHECK_FIELD (num >> 11, 1048575, -1048576, 0);
2733 dis_assemble_21 (num, &num);
2734 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
2735 }
2736 else
2737 {
2738 if (is_DP_relative (the_insn.exp))
2739 the_insn.reloc = R_HPPA_GOTOFF;
2740 else if (is_PC_relative (the_insn.exp))
2741 the_insn.reloc = R_HPPA_PCREL_CALL;
2742 else
2743 the_insn.reloc = R_HPPA;
2744 the_insn.format = 21;
2745 continue;
2746 }
2747
2748 /* Handle a 12 bit branch displacement. */
2749 case 'w':
2750 the_insn.field_selector = pa_chk_field_selector (&s);
2751 get_expression (s);
2752 s = expr_end;
2753 the_insn.pcrel = 1;
2754 if (!strcmp (S_GET_NAME (the_insn.exp.X_add_symbol), "L$0\001"))
2755 {
2756 unsigned int w1, w, result;
2757
2758 num = evaluate_absolute (&the_insn);
2759 if (num % 4)
2760 {
2761 as_bad (_("Branch to unaligned address"));
2762 break;
2763 }
2764 CHECK_FIELD (num, 8199, -8184, 0);
2765 sign_unext ((num - 8) >> 2, 12, &result);
2766 dis_assemble_12 (result, &w1, &w);
2767 INSERT_FIELD_AND_CONTINUE (opcode, ((w1 << 2) | w), 0);
2768 }
2769 else
2770 {
2771 the_insn.reloc = R_HPPA_PCREL_CALL;
2772 the_insn.format = 12;
2773 the_insn.arg_reloc = last_call_desc.arg_reloc;
2774 memset (&last_call_desc, 0, sizeof (struct call_desc));
2775 s = expr_end;
2776 continue;
2777 }
2778
2779 /* Handle a 17 bit branch displacement. */
2780 case 'W':
2781 the_insn.field_selector = pa_chk_field_selector (&s);
2782 get_expression (s);
2783 s = expr_end;
2784 the_insn.pcrel = 1;
2785 if (!the_insn.exp.X_add_symbol
2786 || !strcmp (S_GET_NAME (the_insn.exp.X_add_symbol),
2787 "L$0\001"))
2788 {
2789 unsigned int w2, w1, w, result;
2790
2791 num = evaluate_absolute (&the_insn);
2792 if (num % 4)
2793 {
2794 as_bad (_("Branch to unaligned address"));
2795 break;
2796 }
2797 CHECK_FIELD (num, 262143, -262144, 0);
2798
2799 if (the_insn.exp.X_add_symbol)
2800 num -= 8;
2801
2802 sign_unext (num >> 2, 17, &result);
2803 dis_assemble_17 (result, &w1, &w2, &w);
2804 INSERT_FIELD_AND_CONTINUE (opcode,
2805 ((w2 << 2) | (w1 << 16) | w), 0);
2806 }
2807 else
2808 {
2809 the_insn.reloc = R_HPPA_PCREL_CALL;
2810 the_insn.format = 17;
2811 the_insn.arg_reloc = last_call_desc.arg_reloc;
2812 memset (&last_call_desc, 0, sizeof (struct call_desc));
2813 continue;
2814 }
2815
2816 /* Handle an absolute 17 bit branch target. */
2817 case 'z':
2818 the_insn.field_selector = pa_chk_field_selector (&s);
2819 get_expression (s);
2820 s = expr_end;
2821 the_insn.pcrel = 0;
2822 if (!the_insn.exp.X_add_symbol
2823 || !strcmp (S_GET_NAME (the_insn.exp.X_add_symbol),
2824 "L$0\001"))
2825 {
2826 unsigned int w2, w1, w, result;
2827
2828 num = evaluate_absolute (&the_insn);
2829 if (num % 4)
2830 {
2831 as_bad (_("Branch to unaligned address"));
2832 break;
2833 }
2834 CHECK_FIELD (num, 262143, -262144, 0);
2835
2836 if (the_insn.exp.X_add_symbol)
2837 num -= 8;
2838
2839 sign_unext (num >> 2, 17, &result);
2840 dis_assemble_17 (result, &w1, &w2, &w);
2841 INSERT_FIELD_AND_CONTINUE (opcode,
2842 ((w2 << 2) | (w1 << 16) | w), 0);
2843 }
2844 else
2845 {
2846 the_insn.reloc = R_HPPA_ABS_CALL;
2847 the_insn.format = 17;
2848 the_insn.arg_reloc = last_call_desc.arg_reloc;
2849 memset (&last_call_desc, 0, sizeof (struct call_desc));
2850 continue;
2851 }
2852
4964086a
JL
2853 /* Handle '%r1' implicit operand of addil instruction. */
2854 case 'Z':
2855 if (*s == ',' && *(s + 1) == '%' && *(s + 3) == '1'
2856 && (*(s + 2) == 'r' || *(s + 2) == 'R'))
2857 {
2858 s += 4;
2859 continue;
2860 }
2861 else
2862 break;
2863
a97685e9
JL
2864 /* Handle a 2 bit shift count at 25. */
2865 case '.':
2866 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2867 if (strict && the_insn.exp.X_op != O_constant)
2868 break;
a97685e9 2869 s = expr_end;
0f4f8b56 2870 CHECK_FIELD (num, 3, 1, strict);
a97685e9
JL
2871 INSERT_FIELD_AND_CONTINUE (opcode, num, 6);
2872
413c94ba
JL
2873 /* Handle a 4 bit shift count at 25. */
2874 case '*':
2875 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2876 if (strict && the_insn.exp.X_op != O_constant)
2877 break;
413c94ba 2878 s = expr_end;
0f4f8b56 2879 CHECK_FIELD (num, 15, 0, strict);
413c94ba
JL
2880 INSERT_FIELD_AND_CONTINUE (opcode, num, 6);
2881
252b5132
RH
2882 /* Handle a 5 bit shift count at 26. */
2883 case 'p':
2884 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2885 if (strict && the_insn.exp.X_op != O_constant)
2886 break;
252b5132 2887 s = expr_end;
0f4f8b56 2888 CHECK_FIELD (num, 31, 0, strict);
252b5132
RH
2889 INSERT_FIELD_AND_CONTINUE (opcode, 31 - num, 5);
2890
a97685e9
JL
2891 /* Handle a 6 bit shift count at 20,22:26. */
2892 case '~':
2893 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2894 if (strict && the_insn.exp.X_op != O_constant)
2895 break;
a97685e9 2896 s = expr_end;
0f4f8b56 2897 CHECK_FIELD (num, 63, 0, strict);
a97685e9
JL
2898 num = 63 - num;
2899 opcode |= (num & 0x20) << 6;
2900 INSERT_FIELD_AND_CONTINUE (opcode, num & 0x1f, 5);
2901
9e4f2d3a
JL
2902 /* Handle a 6 bit field length at 23,27:31. */
2903 case '%':
2904 flag = 0;
2905 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2906 if (strict && the_insn.exp.X_op != O_constant)
2907 break;
9e4f2d3a 2908 s = expr_end;
0f4f8b56 2909 CHECK_FIELD (num, 64, 1, strict);
9e4f2d3a
JL
2910 num--;
2911 opcode |= (num & 0x20) << 3;
2912 num = 31 - (num & 0x1f);
2913 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
2914
2915 /* Handle a 6 bit field length at 19,27:31. */
2916 case '|':
2917 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2918 if (strict && the_insn.exp.X_op != O_constant)
2919 break;
9e4f2d3a 2920 s = expr_end;
0f4f8b56 2921 CHECK_FIELD (num, 64, 1, strict);
9e4f2d3a
JL
2922 num--;
2923 opcode |= (num & 0x20) << 7;
2924 num = 31 - (num & 0x1f);
2925 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
2926
252b5132
RH
2927 /* Handle a 5 bit bit position at 26. */
2928 case 'P':
2929 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2930 if (strict && the_insn.exp.X_op != O_constant)
2931 break;
252b5132 2932 s = expr_end;
0f4f8b56 2933 CHECK_FIELD (num, 31, 0, strict);
252b5132
RH
2934 INSERT_FIELD_AND_CONTINUE (opcode, num, 5);
2935
9e4f2d3a
JL
2936 /* Handle a 6 bit bit position at 20,22:26. */
2937 case 'q':
2938 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2939 if (strict && the_insn.exp.X_op != O_constant)
2940 break;
9e4f2d3a 2941 s = expr_end;
0f4f8b56 2942 CHECK_FIELD (num, 63, 0, strict);
9e4f2d3a
JL
2943 opcode |= (num & 0x20) << 6;
2944 INSERT_FIELD_AND_CONTINUE (opcode, num & 0x1f, 5);
2945
252b5132
RH
2946 /* Handle a 5 bit immediate at 10. */
2947 case 'Q':
252b5132 2948 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2949 if (strict && the_insn.exp.X_op != O_constant)
2950 break;
252b5132
RH
2951 if (the_insn.exp.X_op != O_constant)
2952 break;
2953 s = expr_end;
0f4f8b56 2954 CHECK_FIELD (num, 31, 0, strict);
252b5132
RH
2955 INSERT_FIELD_AND_CONTINUE (opcode, num, 21);
2956
a97685e9
JL
2957 /* Handle a 9 bit immediate at 28. */
2958 case '$':
2959 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2960 if (strict && the_insn.exp.X_op != O_constant)
2961 break;
a97685e9 2962 s = expr_end;
0f4f8b56 2963 CHECK_FIELD (num, 511, 1, strict);
a97685e9
JL
2964 INSERT_FIELD_AND_CONTINUE (opcode, num, 3);
2965
252b5132
RH
2966 /* Handle a 13 bit immediate at 18. */
2967 case 'A':
2968 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2969 if (strict && the_insn.exp.X_op != O_constant)
2970 break;
252b5132 2971 s = expr_end;
0f4f8b56 2972 CHECK_FIELD (num, 8191, 0, strict);
252b5132
RH
2973 INSERT_FIELD_AND_CONTINUE (opcode, num, 13);
2974
2975 /* Handle a 26 bit immediate at 31. */
2976 case 'D':
2977 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2978 if (strict && the_insn.exp.X_op != O_constant)
2979 break;
252b5132 2980 s = expr_end;
0f4f8b56 2981 CHECK_FIELD (num, 671108864, 0, strict);
252b5132
RH
2982 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
2983
2984 /* Handle a 3 bit SFU identifier at 25. */
97e1581b 2985 case 'v':
252b5132
RH
2986 if (*s++ != ',')
2987 as_bad (_("Invalid SFU identifier"));
2988 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2989 if (strict && the_insn.exp.X_op != O_constant)
2990 break;
252b5132 2991 s = expr_end;
0f4f8b56 2992 CHECK_FIELD (num, 7, 0, strict);
252b5132
RH
2993 INSERT_FIELD_AND_CONTINUE (opcode, num, 6);
2994
2995 /* Handle a 20 bit SOP field for spop0. */
2996 case 'O':
2997 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
2998 if (strict && the_insn.exp.X_op != O_constant)
2999 break;
252b5132 3000 s = expr_end;
0f4f8b56 3001 CHECK_FIELD (num, 1048575, 0, strict);
252b5132
RH
3002 num = (num & 0x1f) | ((num & 0x000fffe0) << 6);
3003 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
3004
3005 /* Handle a 15bit SOP field for spop1. */
3006 case 'o':
3007 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
3008 if (strict && the_insn.exp.X_op != O_constant)
3009 break;
252b5132 3010 s = expr_end;
0f4f8b56 3011 CHECK_FIELD (num, 32767, 0, strict);
252b5132
RH
3012 INSERT_FIELD_AND_CONTINUE (opcode, num, 11);
3013
3014 /* Handle a 10bit SOP field for spop3. */
3015 case '0':
3016 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
3017 if (strict && the_insn.exp.X_op != O_constant)
3018 break;
252b5132 3019 s = expr_end;
0f4f8b56 3020 CHECK_FIELD (num, 1023, 0, strict);
252b5132
RH
3021 num = (num & 0x1f) | ((num & 0x000003e0) << 6);
3022 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
3023
3024 /* Handle a 15 bit SOP field for spop2. */
3025 case '1':
3026 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
3027 if (strict && the_insn.exp.X_op != O_constant)
3028 break;
252b5132 3029 s = expr_end;
0f4f8b56 3030 CHECK_FIELD (num, 32767, 0, strict);
252b5132
RH
3031 num = (num & 0x1f) | ((num & 0x00007fe0) << 6);
3032 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
3033
3034 /* Handle a 3-bit co-processor ID field. */
3035 case 'u':
3036 if (*s++ != ',')
3037 as_bad (_("Invalid COPR identifier"));
3038 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
3039 if (strict && the_insn.exp.X_op != O_constant)
3040 break;
252b5132 3041 s = expr_end;
0f4f8b56 3042 CHECK_FIELD (num, 7, 0, strict);
252b5132
RH
3043 INSERT_FIELD_AND_CONTINUE (opcode, num, 6);
3044
3045 /* Handle a 22bit SOP field for copr. */
3046 case '2':
3047 num = pa_get_absolute_expression (&the_insn, &s);
0f4f8b56
JL
3048 if (strict && the_insn.exp.X_op != O_constant)
3049 break;
252b5132 3050 s = expr_end;
0f4f8b56 3051 CHECK_FIELD (num, 4194303, 0, strict);
252b5132
RH
3052 num = (num & 0x1f) | ((num & 0x003fffe0) << 4);
3053 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
3054
3055
3056 /* Handle a source FP operand format completer. */
3057 case 'F':
3058 flag = pa_parse_fp_format (&s);
3059 the_insn.fpof1 = flag;
3060 INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
3061
3062 /* Handle a destination FP operand format completer. */
3063 case 'G':
3064 /* pa_parse_format needs the ',' prefix. */
3065 s--;
3066 flag = pa_parse_fp_format (&s);
3067 the_insn.fpof2 = flag;
3068 INSERT_FIELD_AND_CONTINUE (opcode, flag, 13);
3069
9ecc05f0
JL
3070 /* Handle a source FP operand format completer at 20. */
3071 case 'I':
3072 flag = pa_parse_fp_format (&s);
3073 the_insn.fpof1 = flag;
3074 INSERT_FIELD_AND_CONTINUE (opcode, flag, 11);
3075
97e1581b
JL
3076 /* Handle a floating point operand format at 26.
3077 Only allows single and double precision. */
3078 case 'H':
3079 flag = pa_parse_fp_format (&s);
3080 switch (flag)
3081 {
3082 case SGL:
3083 opcode |= 0x20;
3084 case DBL:
3085 the_insn.fpof1 = flag;
3086 continue;
252b5132 3087
97e1581b
JL
3088 case QUAD:
3089 case ILLEGAL_FMT:
3090 default:
3091 as_bad (_("Invalid Floating Point Operand Format."));
3092 }
3093 break;
252b5132 3094
97e1581b
JL
3095 /* Handle all floating point registers. */
3096 case 'f':
3097 switch (*++args)
3098 {
3099 /* Float target register. */
3100 case 't':
0f4f8b56
JL
3101 /* This should be more strict. Small steps. */
3102 if (strict && *s != '%')
3103 break;
e7c1f43c 3104 num = pa_parse_number (&s, 0);
97e1581b
JL
3105 CHECK_FIELD (num, 31, 0, 0);
3106 INSERT_FIELD_AND_CONTINUE (opcode, num, 0);
252b5132 3107
97e1581b
JL
3108 /* Float target register with L/R selection. */
3109 case 'T':
252b5132 3110 {
97e1581b 3111 struct pa_11_fp_reg_struct result;
252b5132 3112
0f4f8b56
JL
3113 /* This should be more strict. Small steps. */
3114 if (strict && *s != '%')
3115 break;
e7c1f43c 3116 pa_parse_number (&s, &result);
97e1581b
JL
3117 CHECK_FIELD (result.number_part, 31, 0, 0);
3118 opcode |= result.number_part;
b53fcc20 3119
97e1581b
JL
3120 /* 0x30 opcodes are FP arithmetic operation opcodes
3121 and need to be turned into 0x38 opcodes. This
3122 is not necessary for loads/stores. */
3123 if (need_pa11_opcode (&the_insn, &result)
3124 && ((opcode & 0xfc000000) == 0x30000000))
3125 opcode |= 1 << 27;
b53fcc20 3126
97e1581b
JL
3127 INSERT_FIELD_AND_CONTINUE (opcode, result.l_r_select & 1, 6);
3128 }
252b5132 3129
97e1581b
JL
3130 /* Float operand 1. */
3131 case 'a':
3132 {
3133 struct pa_11_fp_reg_struct result;
252b5132 3134
0f4f8b56
JL
3135 /* This should be more strict. Small steps. */
3136 if (strict && *s != '%')
3137 break;
e7c1f43c 3138 pa_parse_number (&s, &result);
97e1581b
JL
3139 CHECK_FIELD (result.number_part, 31, 0, 0);
3140 opcode |= result.number_part << 21;
3141 if (need_pa11_opcode (&the_insn, &result))
3142 {
3143 opcode |= (result.l_r_select & 1) << 7;
3144 opcode |= 1 << 27;
3145 }
3146 continue;
3147 }
252b5132 3148
97e1581b
JL
3149 /* Float operand 1 with L/R selection. */
3150 case 'A':
252b5132 3151 {
97e1581b
JL
3152 struct pa_11_fp_reg_struct result;
3153
0f4f8b56
JL
3154 /* This should be more strict. Small steps. */
3155 if (strict && *s != '%')
3156 break;
e7c1f43c 3157 pa_parse_number (&s, &result);
97e1581b
JL
3158 CHECK_FIELD (result.number_part, 31, 0, 0);
3159 opcode |= result.number_part << 21;
3160 opcode |= (result.l_r_select & 1) << 7;
3161 continue;
252b5132 3162 }
252b5132 3163
97e1581b
JL
3164 /* Float operand 2. */
3165 case 'b':
3166 {
3167 struct pa_11_fp_reg_struct result;
252b5132 3168
0f4f8b56
JL
3169 /* This should be more strict. Small steps. */
3170 if (strict && *s != '%')
3171 break;
e7c1f43c 3172 pa_parse_number (&s, &result);
97e1581b
JL
3173 CHECK_FIELD (result.number_part, 31, 0, 0);
3174 opcode |= (result.number_part & 0x1f) << 16;
3175 if (need_pa11_opcode (&the_insn, &result))
3176 {
3177 opcode |= (result.l_r_select & 1) << 12;
3178 opcode |= 1 << 27;
3179 }
3180 continue;
3181 }
3182
3183 /* Float operand 2 with L/R selection. */
3184 case 'B':
252b5132 3185 {
97e1581b
JL
3186 struct pa_11_fp_reg_struct result;
3187
0f4f8b56
JL
3188 /* This should be more strict. Small steps. */
3189 if (strict && *s != '%')
3190 break;
e7c1f43c 3191 pa_parse_number (&s, &result);
97e1581b
JL
3192 CHECK_FIELD (result.number_part, 31, 0, 0);
3193 opcode |= (result.number_part & 0x1f) << 16;
252b5132 3194 opcode |= (result.l_r_select & 1) << 12;
97e1581b 3195 continue;
252b5132 3196 }
252b5132 3197
97e1581b
JL
3198 /* Float operand 3 for fmpyfadd, fmpynfadd. */
3199 case 'C':
3200 {
3201 struct pa_11_fp_reg_struct result;
3202 int regnum;
3203
0f4f8b56
JL
3204 /* This should be more strict. Small steps. */
3205 if (strict && *s != '%')
3206 break;
e7c1f43c 3207 pa_parse_number (&s, &result);
97e1581b
JL
3208 CHECK_FIELD (result.number_part, 31, 0, 0);
3209 opcode |= (result.number_part & 0x1c) << 11;
3210 opcode |= (result.number_part & 0x3) << 9;
3211 opcode |= (result.l_r_select & 1) << 8;
3212 continue;
3213 }
b53fcc20 3214
97e1581b
JL
3215 /* Float mult operand 1 for fmpyadd, fmpysub */
3216 case 'i':
3217 {
3218 struct pa_11_fp_reg_struct result;
b53fcc20 3219
0f4f8b56
JL
3220 /* This should be more strict. Small steps. */
3221 if (strict && *s != '%')
3222 break;
e7c1f43c 3223 pa_parse_number (&s, &result);
97e1581b
JL
3224 CHECK_FIELD (result.number_part, 31, 0, 0);
3225 if (the_insn.fpof1 == SGL)
3226 {
3227 if (result.number_part < 16)
3228 {
3229 as_bad (_("Invalid register for single precision fmpyadd or fmpysub"));
3230 break;
3231 }
252b5132 3232
97e1581b
JL
3233 result.number_part &= 0xF;
3234 result.number_part |= (result.l_r_select & 1) << 4;
3235 }
3236 INSERT_FIELD_AND_CONTINUE (opcode, result.number_part, 21);
3237 }
3238
3239 /* Float mult operand 2 for fmpyadd, fmpysub */
3240 case 'j':
252b5132 3241 {
97e1581b
JL
3242 struct pa_11_fp_reg_struct result;
3243
0f4f8b56
JL
3244 /* This should be more strict. Small steps. */
3245 if (strict && *s != '%')
3246 break;
e7c1f43c 3247 pa_parse_number (&s, &result);
97e1581b
JL
3248 CHECK_FIELD (result.number_part, 31, 0, 0);
3249 if (the_insn.fpof1 == SGL)
252b5132 3250 {
97e1581b
JL
3251 if (result.number_part < 16)
3252 {
3253 as_bad (_("Invalid register for single precision fmpyadd or fmpysub"));
3254 break;
3255 }
3256 result.number_part &= 0xF;
3257 result.number_part |= (result.l_r_select & 1) << 4;
252b5132 3258 }
97e1581b 3259 INSERT_FIELD_AND_CONTINUE (opcode, result.number_part, 16);
252b5132 3260 }
252b5132 3261
97e1581b
JL
3262 /* Float mult target for fmpyadd, fmpysub */
3263 case 'k':
252b5132 3264 {
97e1581b
JL
3265 struct pa_11_fp_reg_struct result;
3266
0f4f8b56
JL
3267 /* This should be more strict. Small steps. */
3268 if (strict && *s != '%')
3269 break;
e7c1f43c 3270 pa_parse_number (&s, &result);
97e1581b
JL
3271 CHECK_FIELD (result.number_part, 31, 0, 0);
3272 if (the_insn.fpof1 == SGL)
252b5132 3273 {
97e1581b
JL
3274 if (result.number_part < 16)
3275 {
3276 as_bad (_("Invalid register for single precision fmpyadd or fmpysub"));
3277 break;
3278 }
3279 result.number_part &= 0xF;
3280 result.number_part |= (result.l_r_select & 1) << 4;
252b5132 3281 }
97e1581b 3282 INSERT_FIELD_AND_CONTINUE (opcode, result.number_part, 0);
252b5132 3283 }
252b5132 3284
97e1581b
JL
3285 /* Float add operand 1 for fmpyadd, fmpysub */
3286 case 'l':
252b5132 3287 {
97e1581b
JL
3288 struct pa_11_fp_reg_struct result;
3289
0f4f8b56
JL
3290 /* This should be more strict. Small steps. */
3291 if (strict && *s != '%')
3292 break;
e7c1f43c 3293 pa_parse_number (&s, &result);
97e1581b
JL
3294 CHECK_FIELD (result.number_part, 31, 0, 0);
3295 if (the_insn.fpof1 == SGL)
252b5132 3296 {
97e1581b
JL
3297 if (result.number_part < 16)
3298 {
3299 as_bad (_("Invalid register for single precision fmpyadd or fmpysub"));
3300 break;
3301 }
3302 result.number_part &= 0xF;
3303 result.number_part |= (result.l_r_select & 1) << 4;
252b5132 3304 }
97e1581b 3305 INSERT_FIELD_AND_CONTINUE (opcode, result.number_part, 6);
252b5132 3306 }
252b5132 3307
97e1581b
JL
3308 /* Float add target for fmpyadd, fmpysub */
3309 case 'm':
252b5132 3310 {
97e1581b
JL
3311 struct pa_11_fp_reg_struct result;
3312
0f4f8b56
JL
3313 /* This should be more strict. Small steps. */
3314 if (strict && *s != '%')
3315 break;
e7c1f43c 3316 pa_parse_number (&s, &result);
97e1581b
JL
3317 CHECK_FIELD (result.number_part, 31, 0, 0);
3318 if (the_insn.fpof1 == SGL)
252b5132 3319 {
97e1581b
JL
3320 if (result.number_part < 16)
3321 {
3322 as_bad (_("Invalid register for single precision fmpyadd or fmpysub"));
3323 break;
3324 }
3325 result.number_part &= 0xF;
3326 result.number_part |= (result.l_r_select & 1) << 4;
252b5132 3327 }
97e1581b 3328 INSERT_FIELD_AND_CONTINUE (opcode, result.number_part, 11);
252b5132 3329 }
252b5132 3330
97e1581b
JL
3331 default:
3332 abort ();
3333 }
3334 break;
3335
3336 /* Handle L/R register halves like 'x'. */
3337 case 'e':
252b5132
RH
3338 {
3339 struct pa_11_fp_reg_struct result;
3340
0f4f8b56
JL
3341 /* This should be more strict. Small steps. */
3342 if (strict && *s != '%')
3343 break;
e7c1f43c 3344 pa_parse_number (&s, &result);
252b5132 3345 CHECK_FIELD (result.number_part, 31, 0, 0);
97e1581b
JL
3346 opcode |= (result.number_part & 0x1f) << 16;
3347 if (need_pa11_opcode (&the_insn, &result))
252b5132 3348 {
97e1581b 3349 opcode |= (result.l_r_select & 1) << 1;
252b5132 3350 }
97e1581b 3351 continue;
252b5132
RH
3352 }
3353
252b5132
RH
3354 default:
3355 abort ();
3356 }
3357 break;
3358 }
3359
3360 failed:
3361 /* Check if the args matched. */
3362 if (match == FALSE)
3363 {
3364 if (&insn[1] - pa_opcodes < (int) NUMOPCODES
3365 && !strcmp (insn->name, insn[1].name))
3366 {
3367 ++insn;
3368 s = argstart;
3369 continue;
3370 }
3371 else
3372 {
3373 as_bad (_("Invalid operands %s"), error_message);
3374 return;
3375 }
3376 }
3377 break;
3378 }
3379
2d93dcc4
JL
3380#ifdef OBJ_ELF
3381 if (debug_type == DEBUG_DWARF2)
3382 {
3383 bfd_vma addr;
3384
3385 addr = frag_now->fr_address + frag_now_fix ();
3386 dwarf2_gen_line_info (addr, &debug_line);
3387 }
3388#endif
3389
252b5132
RH
3390 the_insn.opcode = opcode;
3391}
3392
3393/* Turn a string in input_line_pointer into a floating point constant of type
3394 type, and store the appropriate bytes in *litP. The number of LITTLENUMS
3395 emitted is stored in *sizeP . An error message or NULL is returned. */
3396
3397#define MAX_LITTLENUMS 6
3398
3399char *
3400md_atof (type, litP, sizeP)
3401 char type;
3402 char *litP;
3403 int *sizeP;
3404{
3405 int prec;
3406 LITTLENUM_TYPE words[MAX_LITTLENUMS];
3407 LITTLENUM_TYPE *wordP;
3408 char *t;
3409
3410 switch (type)
3411 {
3412
3413 case 'f':
3414 case 'F':
3415 case 's':
3416 case 'S':
3417 prec = 2;
3418 break;
3419
3420 case 'd':
3421 case 'D':
3422 case 'r':
3423 case 'R':
3424 prec = 4;
3425 break;
3426
3427 case 'x':
3428 case 'X':
3429 prec = 6;
3430 break;
3431
3432 case 'p':
3433 case 'P':
3434 prec = 6;
3435 break;
3436
3437 default:
3438 *sizeP = 0;
3439 return _("Bad call to MD_ATOF()");
3440 }
3441 t = atof_ieee (input_line_pointer, type, words);
3442 if (t)
3443 input_line_pointer = t;
3444 *sizeP = prec * sizeof (LITTLENUM_TYPE);
3445 for (wordP = words; prec--;)
3446 {
3447 md_number_to_chars (litP, (valueT) (*wordP++), sizeof (LITTLENUM_TYPE));
3448 litP += sizeof (LITTLENUM_TYPE);
3449 }
3450 return NULL;
3451}
3452
3453/* Write out big-endian. */
3454
3455void
3456md_number_to_chars (buf, val, n)
3457 char *buf;
3458 valueT val;
3459 int n;
3460{
3461 number_to_chars_bigendian (buf, val, n);
3462}
3463
3464/* Translate internal representation of relocation info to BFD target
3465 format. */
3466
3467arelent **
3468tc_gen_reloc (section, fixp)
3469 asection *section;
3470 fixS *fixp;
3471{
3472 arelent *reloc;
3473 struct hppa_fix_struct *hppa_fixp;
3474 bfd_reloc_code_real_type code;
3475 static arelent *no_relocs = NULL;
3476 arelent **relocs;
3477 bfd_reloc_code_real_type **codes;
3478 int n_relocs;
3479 int i;
3480
3481 hppa_fixp = (struct hppa_fix_struct *) fixp->tc_fix_data;
3482 if (fixp->fx_addsy == 0)
3483 return &no_relocs;
3484 assert (hppa_fixp != 0);
3485 assert (section != 0);
3486
3487 reloc = (arelent *) xmalloc (sizeof (arelent));
3488
a0f75b47
ILT
3489 reloc->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
3490 *reloc->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_addsy);
252b5132
RH
3491 codes = (bfd_reloc_code_real_type **) hppa_gen_reloc_type (stdoutput,
3492 fixp->fx_r_type,
3493 hppa_fixp->fx_r_format,
3494 hppa_fixp->fx_r_field,
3495 fixp->fx_subsy != NULL,
a0f75b47 3496 symbol_get_bfdsym (fixp->fx_addsy));
252b5132
RH
3497
3498 if (codes == NULL)
3499 abort ();
3500
3501 for (n_relocs = 0; codes[n_relocs]; n_relocs++)
3502 ;
3503
3504 relocs = (arelent **) xmalloc (sizeof (arelent *) * n_relocs + 1);
3505 reloc = (arelent *) xmalloc (sizeof (arelent) * n_relocs);
3506 for (i = 0; i < n_relocs; i++)
3507 relocs[i] = &reloc[i];
3508
3509 relocs[n_relocs] = NULL;
3510
3511#ifdef OBJ_ELF
3512 switch (fixp->fx_r_type)
3513 {
3514 default:
3515 assert (n_relocs == 1);
3516
3517 code = *codes[0];
3518
a0f75b47
ILT
3519 reloc->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
3520 *reloc->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_addsy);
252b5132
RH
3521 reloc->howto = bfd_reloc_type_lookup (stdoutput, code);
3522 reloc->address = fixp->fx_frag->fr_address + fixp->fx_where;
3523 reloc->addend = 0; /* default */
3524
3525 assert (reloc->howto && code == reloc->howto->type);
3526
3527 /* Now, do any processing that is dependent on the relocation type. */
3528 switch (code)
3529 {
3530 case R_PARISC_DLTREL21L:
3531 case R_PARISC_DLTREL14R:
3532 case R_PARISC_DLTREL14F:
3533 case R_PARISC_PLABEL32:
3534 case R_PARISC_PLABEL21L:
3535 case R_PARISC_PLABEL14R:
3536 /* For plabel relocations, the addend of the
3537 relocation should be either 0 (no static link) or 2
3538 (static link required).
3539
3540 FIXME: We always assume no static link!
3541
3542 We also slam a zero addend into the DLT relative relocs;
3543 it doesn't make a lot of sense to use any addend since
3544 it gets you a different (eg unknown) DLT entry. */
3545 reloc->addend = 0;
3546 break;
3547
3548 case R_PARISC_PCREL21L:
3549 case R_PARISC_PCREL17R:
3550 case R_PARISC_PCREL17F:
3551 case R_PARISC_PCREL17C:
3552 case R_PARISC_PCREL14R:
3553 case R_PARISC_PCREL14F:
3554 /* The constant is stored in the instruction. */
3555 reloc->addend = HPPA_R_ADDEND (hppa_fixp->fx_arg_reloc, 0);
3556 break;
3557 default:
3558 reloc->addend = fixp->fx_offset;
3559 break;
3560 }
3561 break;
3562 }
3563#else /* OBJ_SOM */
3564
3565 /* Walk over reach relocation returned by the BFD backend. */
3566 for (i = 0; i < n_relocs; i++)
3567 {
3568 code = *codes[i];
3569
398e8c25
ILT
3570 relocs[i]->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
3571 *relocs[i]->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_addsy);
252b5132
RH
3572 relocs[i]->howto = bfd_reloc_type_lookup (stdoutput, code);
3573 relocs[i]->address = fixp->fx_frag->fr_address + fixp->fx_where;
3574
3575 switch (code)
3576 {
3577 case R_COMP2:
3578 /* The only time we ever use a R_COMP2 fixup is for the difference
3579 of two symbols. With that in mind we fill in all four
3580 relocs now and break out of the loop. */
3581 assert (i == 1);
993142d5 3582 relocs[0]->sym_ptr_ptr = (asymbol **) &(bfd_abs_symbol);
252b5132
RH
3583 relocs[0]->howto = bfd_reloc_type_lookup (stdoutput, *codes[0]);
3584 relocs[0]->address = fixp->fx_frag->fr_address + fixp->fx_where;
3585 relocs[0]->addend = 0;
993142d5
ILT
3586 relocs[1]->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
3587 *relocs[1]->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_addsy);
252b5132
RH
3588 relocs[1]->howto = bfd_reloc_type_lookup (stdoutput, *codes[1]);
3589 relocs[1]->address = fixp->fx_frag->fr_address + fixp->fx_where;
3590 relocs[1]->addend = 0;
993142d5
ILT
3591 relocs[2]->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
3592 *relocs[2]->sym_ptr_ptr = symbol_get_bfdsym (fixp->fx_subsy);
252b5132
RH
3593 relocs[2]->howto = bfd_reloc_type_lookup (stdoutput, *codes[2]);
3594 relocs[2]->address = fixp->fx_frag->fr_address + fixp->fx_where;
3595 relocs[2]->addend = 0;
993142d5 3596 relocs[3]->sym_ptr_ptr = (asymbol **) &(bfd_abs_symbol);
252b5132
RH
3597 relocs[3]->howto = bfd_reloc_type_lookup (stdoutput, *codes[3]);
3598 relocs[3]->address = fixp->fx_frag->fr_address + fixp->fx_where;
3599 relocs[3]->addend = 0;
993142d5 3600 relocs[4]->sym_ptr_ptr = (asymbol **) &(bfd_abs_symbol);
252b5132
RH
3601 relocs[4]->howto = bfd_reloc_type_lookup (stdoutput, *codes[4]);
3602 relocs[4]->address = fixp->fx_frag->fr_address + fixp->fx_where;
3603 relocs[4]->addend = 0;
3604 goto done;
3605 case R_PCREL_CALL:
3606 case R_ABS_CALL:
3607 relocs[i]->addend = HPPA_R_ADDEND (hppa_fixp->fx_arg_reloc, 0);
3608 break;
3609
3610 case R_DLT_REL:
3611 case R_DATA_PLABEL:
3612 case R_CODE_PLABEL:
3613 /* For plabel relocations, the addend of the
3614 relocation should be either 0 (no static link) or 2
3615 (static link required).
3616
3617 FIXME: We always assume no static link!
3618
3619 We also slam a zero addend into the DLT relative relocs;
3620 it doesn't make a lot of sense to use any addend since
3621 it gets you a different (eg unknown) DLT entry. */
3622 relocs[i]->addend = 0;
3623 break;
3624
3625 case R_N_MODE:
3626 case R_S_MODE:
3627 case R_D_MODE:
3628 case R_R_MODE:
3629 case R_FSEL:
3630 case R_LSEL:
3631 case R_RSEL:
3632 case R_BEGIN_BRTAB:
3633 case R_END_BRTAB:
3634 case R_BEGIN_TRY:
3635 case R_N0SEL:
3636 case R_N1SEL:
3637 /* There is no symbol or addend associated with these fixups. */
993142d5
ILT
3638 relocs[i]->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
3639 *relocs[i]->sym_ptr_ptr = symbol_get_bfdsym (dummy_symbol);
252b5132
RH
3640 relocs[i]->addend = 0;
3641 break;
3642
3643 case R_END_TRY:
3644 case R_ENTRY:
3645 case R_EXIT:
3646 /* There is no symbol associated with these fixups. */
993142d5
ILT
3647 relocs[i]->sym_ptr_ptr = (asymbol **) xmalloc (sizeof (asymbol *));
3648 *relocs[i]->sym_ptr_ptr = symbol_get_bfdsym (dummy_symbol);
252b5132
RH
3649 relocs[i]->addend = fixp->fx_offset;
3650 break;
3651
3652 default:
3653 relocs[i]->addend = fixp->fx_offset;
3654 }
3655 }
3656
3657 done:
3658#endif
3659
3660 return relocs;
3661}
3662
3663/* Process any machine dependent frag types. */
3664
3665void
3666md_convert_frag (abfd, sec, fragP)
3667 register bfd *abfd;
3668 register asection *sec;
3669 register fragS *fragP;
3670{
3671 unsigned int address;
3672
3673 if (fragP->fr_type == rs_machine_dependent)
3674 {
3675 switch ((int) fragP->fr_subtype)
3676 {
3677 case 0:
3678 fragP->fr_type = rs_fill;
3679 know (fragP->fr_var == 1);
3680 know (fragP->fr_next);
3681 address = fragP->fr_address + fragP->fr_fix;
3682 if (address % fragP->fr_offset)
3683 {
3684 fragP->fr_offset =
3685 fragP->fr_next->fr_address
3686 - fragP->fr_address
3687 - fragP->fr_fix;
3688 }
3689 else
3690 fragP->fr_offset = 0;
3691 break;
3692 }
3693 }
3694}
3695
3696/* Round up a section size to the appropriate boundary. */
3697
3698valueT
3699md_section_align (segment, size)
3700 asection *segment;
3701 valueT size;
3702{
3703 int align = bfd_get_section_alignment (stdoutput, segment);
3704 int align2 = (1 << align) - 1;
3705
3706 return (size + align2) & ~align2;
3707}
3708
3709/* Return the approximate size of a frag before relaxation has occurred. */
3710int
3711md_estimate_size_before_relax (fragP, segment)
3712 register fragS *fragP;
3713 asection *segment;
3714{
3715 int size;
3716
3717 size = 0;
3718
3719 while ((fragP->fr_fix + size) % fragP->fr_offset)
3720 size++;
3721
3722 return size;
3723}
3724\f
3725CONST char *md_shortopts = "";
3726struct option md_longopts[] = {
3727 {NULL, no_argument, NULL, 0}
3728};
3729size_t md_longopts_size = sizeof(md_longopts);
3730
3731int
3732md_parse_option (c, arg)
3733 int c;
3734 char *arg;
3735{
3736 return 0;
3737}
3738
3739void
3740md_show_usage (stream)
3741 FILE *stream;
3742{
3743}
3744\f
3745/* We have no need to default values of symbols. */
3746
3747symbolS *
3748md_undefined_symbol (name)
3749 char *name;
3750{
3751 return 0;
3752}
3753
3754/* Apply a fixup to an instruction. */
3755
3756int
3757md_apply_fix (fixP, valp)
3758 fixS *fixP;
3759 valueT *valp;
3760{
3761 char *buf = fixP->fx_where + fixP->fx_frag->fr_literal;
3762 struct hppa_fix_struct *hppa_fixP;
3763 long new_val, result = 0;
3764 unsigned int w1, w2, w, resulti;
3765
3766 hppa_fixP = (struct hppa_fix_struct *) fixP->tc_fix_data;
3767 /* SOM uses R_HPPA_ENTRY and R_HPPA_EXIT relocations which can
3768 never be "applied" (they are just markers). Likewise for
3769 R_HPPA_BEGIN_BRTAB and R_HPPA_END_BRTAB. */
3770#ifdef OBJ_SOM
3771 if (fixP->fx_r_type == R_HPPA_ENTRY
3772 || fixP->fx_r_type == R_HPPA_EXIT
3773 || fixP->fx_r_type == R_HPPA_BEGIN_BRTAB
3774 || fixP->fx_r_type == R_HPPA_END_BRTAB
3775 || fixP->fx_r_type == R_HPPA_BEGIN_TRY)
3776 return 1;
3777
3778 /* Disgusting. We must set fx_offset ourselves -- R_HPPA_END_TRY
3779 fixups are considered not adjustable, which in turn causes
3780 adjust_reloc_syms to not set fx_offset. Ugh. */
3781 if (fixP->fx_r_type == R_HPPA_END_TRY)
3782 {
3783 fixP->fx_offset = *valp;
3784 return 1;
3785 }
3786#endif
3787
3788 /* There should have been an HPPA specific fixup associated
3789 with the GAS fixup. */
3790 if (hppa_fixP)
3791 {
3792 unsigned long buf_wd = bfd_get_32 (stdoutput, buf);
3793 unsigned char fmt = bfd_hppa_insn2fmt (buf_wd);
3794
3795 /* If there is a symbol associated with this fixup, then it's something
3796 which will need a SOM relocation (except for some PC-relative relocs).
3797 In such cases we should treat the "val" or "addend" as zero since it
3798 will be added in as needed from fx_offset in tc_gen_reloc. */
3799 if ((fixP->fx_addsy != NULL
3800 || fixP->fx_r_type == R_HPPA_NONE)
3801#ifdef OBJ_SOM
3802 && fmt != 32
3803#endif
3804 )
90700a53 3805 new_val = ((fmt == 12 || fmt == 17 || fmt == 22) ? 8 : 0);
252b5132
RH
3806#ifdef OBJ_SOM
3807 /* These field selectors imply that we do not want an addend. */
3808 else if (hppa_fixP->fx_r_field == e_psel
3809 || hppa_fixP->fx_r_field == e_rpsel
3810 || hppa_fixP->fx_r_field == e_lpsel
3811 || hppa_fixP->fx_r_field == e_tsel
3812 || hppa_fixP->fx_r_field == e_rtsel
3813 || hppa_fixP->fx_r_field == e_ltsel)
90700a53 3814 new_val = ((fmt == 12 || fmt == 17 || fmt == 22) ? 8 : 0);
252b5132
RH
3815 /* This is truely disgusting. The machine independent code blindly
3816 adds in the value of the symbol being relocated against. Damn! */
3817 else if (fmt == 32
3818 && fixP->fx_addsy != NULL
3819 && S_GET_SEGMENT (fixP->fx_addsy) != bfd_com_section_ptr)
3820 new_val = hppa_field_adjust (*valp - S_GET_VALUE (fixP->fx_addsy),
3821 0, hppa_fixP->fx_r_field);
3822#endif
3823 else
3824 new_val = hppa_field_adjust (*valp, 0, hppa_fixP->fx_r_field);
3825
3826 /* Handle pc-relative exceptions from above. */
3827#define arg_reloc_stub_needed(CALLER, CALLEE) \
3828 ((CALLEE) && (CALLER) && ((CALLEE) != (CALLER)))
90700a53 3829 if ((fmt == 12 || fmt == 17 || fmt == 22)
252b5132
RH
3830 && fixP->fx_addsy
3831 && fixP->fx_pcrel
49863f82 3832#ifdef OBJ_SOM
252b5132 3833 && !arg_reloc_stub_needed ((long) ((obj_symbol_type *)
a0f75b47
ILT
3834 symbol_get_bfdsym (fixP->fx_addsy))->tc_data.ap.hppa_arg_reloc,
3835 hppa_fixP->fx_arg_reloc)
49863f82 3836#endif
90700a53 3837 && (((int)(*valp) > -262144 && (int)(*valp) < 262143) && fmt != 22)
252b5132
RH
3838 && S_GET_SEGMENT (fixP->fx_addsy) == hppa_fixP->segment
3839 && !(fixP->fx_subsy
3840 && S_GET_SEGMENT (fixP->fx_subsy) != hppa_fixP->segment))
3841
3842 new_val = hppa_field_adjust (*valp, 0, hppa_fixP->fx_r_field);
3843#undef arg_reloc_stub_needed
3844
3845 switch (fmt)
3846 {
3847 /* Handle all opcodes with the 'j' operand type. */
3848 case 14:
3849 CHECK_FIELD (new_val, 8191, -8192, 0);
3850
3851 /* Mask off 14 bits to be changed. */
3852 bfd_put_32 (stdoutput,
3853 bfd_get_32 (stdoutput, buf) & 0xffffc000,
3854 buf);
3855 low_sign_unext (new_val, 14, &resulti);
3856 result = resulti;
3857 break;
3858
3859 /* Handle all opcodes with the 'k' operand type. */
3860 case 21:
3861 CHECK_FIELD (new_val, 2097152, 0, 0);
3862
3863 /* Mask off 21 bits to be changed. */
3864 bfd_put_32 (stdoutput,
3865 bfd_get_32 (stdoutput, buf) & 0xffe00000,
3866 buf);
3867 dis_assemble_21 (new_val, &resulti);
3868 result = resulti;
3869 break;
3870
3871 /* Handle all the opcodes with the 'i' operand type. */
3872 case 11:
3873 CHECK_FIELD (new_val, 1023, -1023, 0);
3874
3875 /* Mask off 11 bits to be changed. */
3876 bfd_put_32 (stdoutput,
3877 bfd_get_32 (stdoutput, buf) & 0xffff800,
3878 buf);
3879 low_sign_unext (new_val, 11, &resulti);
3880 result = resulti;
3881 break;
3882
3883 /* Handle all the opcodes with the 'w' operand type. */
3884 case 12:
3885 CHECK_FIELD (new_val, 8199, -8184, 0);
3886
3887 /* Mask off 11 bits to be changed. */
3888 sign_unext ((new_val - 8) >> 2, 12, &resulti);
3889 bfd_put_32 (stdoutput,
3890 bfd_get_32 (stdoutput, buf) & 0xffffe002,
3891 buf);
3892
3893 dis_assemble_12 (resulti, &w1, &w);
3894 result = ((w1 << 2) | w);
3895 break;
3896
3897 /* Handle some of the opcodes with the 'W' operand type. */
3898 case 17:
3899 {
3900 int distance = *valp;
3901
3902 CHECK_FIELD (new_val, 262143, -262144, 0);
3903
3904 /* If this is an absolute branch (ie no link) with an out of
3905 range target, then we want to complain. */
3906 if (fixP->fx_r_type == R_HPPA_PCREL_CALL
3907 && (distance > 262143 || distance < -262144)
3908 && (bfd_get_32 (stdoutput, buf) & 0xffe00000) == 0xe8000000)
3909 CHECK_FIELD (distance, 262143, -262144, 0);
3910
3911 /* Mask off 17 bits to be changed. */
3912 bfd_put_32 (stdoutput,
3913 bfd_get_32 (stdoutput, buf) & 0xffe0e002,
3914 buf);
3915 sign_unext ((new_val - 8) >> 2, 17, &resulti);
3916 dis_assemble_17 (resulti, &w1, &w2, &w);
3917 result = ((w2 << 2) | (w1 << 16) | w);
3918 break;
3919 }
3920
3921 case 32:
3922 result = 0;
3923 bfd_put_32 (stdoutput, new_val, buf);
3924 break;
3925
3926 default:
3927 as_bad (_("Unknown relocation encountered in md_apply_fix."));
3928 return 0;
3929 }
3930
3931 /* Insert the relocation. */
3932 bfd_put_32 (stdoutput, bfd_get_32 (stdoutput, buf) | result, buf);
3933 return 1;
3934 }
3935 else
3936 {
3937 printf (_("no hppa_fixup entry for this fixup (fixP = 0x%x, type = 0x%x)\n"),
3938 (unsigned int) fixP, fixP->fx_r_type);
3939 return 0;
3940 }
3941}
3942
3943/* Exactly what point is a PC-relative offset relative TO?
3944 On the PA, they're relative to the address of the offset. */
3945
3946long
3947md_pcrel_from (fixP)
3948 fixS *fixP;
3949{
3950 return fixP->fx_where + fixP->fx_frag->fr_address;
3951}
3952
3953/* Return nonzero if the input line pointer is at the end of
3954 a statement. */
3955
3956static int
3957is_end_of_statement ()
3958{
3959 return ((*input_line_pointer == '\n')
3960 || (*input_line_pointer == ';')
3961 || (*input_line_pointer == '!'));
3962}
3963
3964/* Read a number from S. The number might come in one of many forms,
3965 the most common will be a hex or decimal constant, but it could be
3966 a pre-defined register (Yuk!), or an absolute symbol.
3967
3968 Return a number or -1 for failure.
3969
3970 When parsing PA-89 FP register numbers RESULT will be
3971 the address of a structure to return information about
3972 L/R half of FP registers, store results there as appropriate.
3973
3974 pa_parse_number can not handle negative constants and will fail
3975 horribly if it is passed such a constant. */
3976
3977static int
3978pa_parse_number (s, result)
3979 char **s;
3980 struct pa_11_fp_reg_struct *result;
3981{
3982 int num;
3983 char *name;
3984 char c;
3985 symbolS *sym;
3986 int status;
3987 char *p = *s;
3988
3989 /* Skip whitespace before the number. */
3990 while (*p == ' ' || *p == '\t')
3991 p = p + 1;
3992
3993 /* Store info in RESULT if requested by caller. */
3994 if (result)
3995 {
3996 result->number_part = -1;
3997 result->l_r_select = -1;
3998 }
3999 num = -1;
4000
4001 if (isdigit (*p))
4002 {
4003 /* Looks like a number. */
4004 num = 0;
4005
4006 if (*p == '0' && (*(p + 1) == 'x' || *(p + 1) == 'X'))
4007 {
4008 /* The number is specified in hex. */
4009 p += 2;
4010 while (isdigit (*p) || ((*p >= 'a') && (*p <= 'f'))
4011 || ((*p >= 'A') && (*p <= 'F')))
4012 {
4013 if (isdigit (*p))
4014 num = num * 16 + *p - '0';
4015 else if (*p >= 'a' && *p <= 'f')
4016 num = num * 16 + *p - 'a' + 10;
4017 else
4018 num = num * 16 + *p - 'A' + 10;
4019 ++p;
4020 }
4021 }
4022 else
4023 {
4024 /* The number is specified in decimal. */
4025 while (isdigit (*p))
4026 {
4027 num = num * 10 + *p - '0';
4028 ++p;
4029 }
4030 }
4031
4032 /* Store info in RESULT if requested by the caller. */
4033 if (result)
4034 {
4035 result->number_part = num;
4036
4037 if (IS_R_SELECT (p))
4038 {
4039 result->l_r_select = 1;
4040 ++p;
4041 }
4042 else if (IS_L_SELECT (p))
4043 {
4044 result->l_r_select = 0;
4045 ++p;
4046 }
4047 else
4048 result->l_r_select = 0;
4049 }
4050 }
4051 else if (*p == '%')
4052 {
4053 /* The number might be a predefined register. */
4054 num = 0;
4055 name = p;
4056 p++;
4057 c = *p;
4058 /* Tege hack: Special case for general registers as the general
4059 code makes a binary search with case translation, and is VERY
4060 slow. */
4061 if (c == 'r')
4062 {
4063 p++;
4064 if (*p == 'e' && *(p + 1) == 't'
4065 && (*(p + 2) == '0' || *(p + 2) == '1'))
4066 {
4067 p += 2;
4068 num = *p - '0' + 28;
4069 p++;
4070 }
4071 else if (*p == 'p')
4072 {
4073 num = 2;
4074 p++;
4075 }
4076 else if (!isdigit (*p))
4077 {
4078 if (print_errors)
4079 as_bad (_("Undefined register: '%s'."), name);
4080 num = -1;
4081 }
4082 else
4083 {
4084 do
4085 num = num * 10 + *p++ - '0';
4086 while (isdigit (*p));
4087 }
4088 }
4089 else
4090 {
4091 /* Do a normal register search. */
4092 while (is_part_of_name (c))
4093 {
4094 p = p + 1;
4095 c = *p;
4096 }
4097 *p = 0;
4098 status = reg_name_search (name);
4099 if (status >= 0)
4100 num = status;
4101 else
4102 {
4103 if (print_errors)
4104 as_bad (_("Undefined register: '%s'."), name);
4105 num = -1;
4106 }
4107 *p = c;
4108 }
4109
4110 /* Store info in RESULT if requested by caller. */
4111 if (result)
4112 {
4113 result->number_part = num;
4114 if (IS_R_SELECT (p - 1))
4115 result->l_r_select = 1;
4116 else if (IS_L_SELECT (p - 1))
4117 result->l_r_select = 0;
4118 else
4119 result->l_r_select = 0;
4120 }
4121 }
4122 else
4123 {
4124 /* And finally, it could be a symbol in the absolute section which
4125 is effectively a constant. */
4126 num = 0;
4127 name = p;
4128 c = *p;
4129 while (is_part_of_name (c))
4130 {
4131 p = p + 1;
4132 c = *p;
4133 }
4134 *p = 0;
4135 if ((sym = symbol_find (name)) != NULL)
4136 {
4137 if (S_GET_SEGMENT (sym) == &bfd_abs_section)
4138 num = S_GET_VALUE (sym);
4139 else
4140 {
4141 if (print_errors)
4142 as_bad (_("Non-absolute symbol: '%s'."), name);
4143 num = -1;
4144 }
4145 }
4146 else
4147 {
4148 /* There is where we'd come for an undefined symbol
4149 or for an empty string. For an empty string we
4150 will return zero. That's a concession made for
4151 compatability with the braindamaged HP assemblers. */
4152 if (*name == 0)
4153 num = 0;
4154 else
4155 {
4156 if (print_errors)
4157 as_bad (_("Undefined absolute constant: '%s'."), name);
4158 num = -1;
4159 }
4160 }
4161 *p = c;
4162
4163 /* Store info in RESULT if requested by caller. */
4164 if (result)
4165 {
4166 result->number_part = num;
4167 if (IS_R_SELECT (p - 1))
4168 result->l_r_select = 1;
4169 else if (IS_L_SELECT (p - 1))
4170 result->l_r_select = 0;
4171 else
4172 result->l_r_select = 0;
4173 }
4174 }
4175
4176 *s = p;
4177 return num;
4178}
4179
4180#define REG_NAME_CNT (sizeof(pre_defined_registers) / sizeof(struct pd_reg))
4181
4182/* Given NAME, find the register number associated with that name, return
4183 the integer value associated with the given name or -1 on failure. */
4184
4185static int
4186reg_name_search (name)
4187 char *name;
4188{
4189 int middle, low, high;
4190 int cmp;
4191
4192 low = 0;
4193 high = REG_NAME_CNT - 1;
4194
4195 do
4196 {
4197 middle = (low + high) / 2;
4198 cmp = strcasecmp (name, pre_defined_registers[middle].name);
4199 if (cmp < 0)
4200 high = middle - 1;
4201 else if (cmp > 0)
4202 low = middle + 1;
4203 else
4204 return pre_defined_registers[middle].value;
4205 }
4206 while (low <= high);
4207
4208 return -1;
4209}
4210
4211
4212/* Return nonzero if the given INSN and L/R information will require
4213 a new PA-1.1 opcode. */
4214
4215static int
4216need_pa11_opcode (insn, result)
4217 struct pa_it *insn;
4218 struct pa_11_fp_reg_struct *result;
4219{
4220 if (result->l_r_select == 1 && !(insn->fpof1 == DBL && insn->fpof2 == DBL))
4221 {
4222 /* If this instruction is specific to a particular architecture,
4223 then set a new architecture. */
4224 if (bfd_get_mach (stdoutput) < pa11)
4225 {
4226 if (!bfd_set_arch_mach (stdoutput, bfd_arch_hppa, pa11))
4227 as_warn (_("could not update architecture and machine"));
4228 }
4229 return TRUE;
4230 }
4231 else
4232 return FALSE;
4233}
4234
4235/* Parse a condition for a fcmp instruction. Return the numerical
4236 code associated with the condition. */
4237
4238static int
4239pa_parse_fp_cmp_cond (s)
4240 char **s;
4241{
4242 int cond, i;
4243
4244 cond = 0;
4245
4246 for (i = 0; i < 32; i++)
4247 {
4248 if (strncasecmp (*s, fp_cond_map[i].string,
4249 strlen (fp_cond_map[i].string)) == 0)
4250 {
4251 cond = fp_cond_map[i].cond;
4252 *s += strlen (fp_cond_map[i].string);
4253 /* If not a complete match, back up the input string and
4254 report an error. */
4255 if (**s != ' ' && **s != '\t')
4256 {
4257 *s -= strlen (fp_cond_map[i].string);
4258 break;
4259 }
4260 while (**s == ' ' || **s == '\t')
4261 *s = *s + 1;
4262 return cond;
4263 }
4264 }
4265
4266 as_bad (_("Invalid FP Compare Condition: %s"), *s);
4267
4268 /* Advance over the bogus completer. */
4269 while (**s != ',' && **s != ' ' && **s != '\t')
4270 *s += 1;
4271
4272 return 0;
4273}
4274
4275
4276/* Parse an FP operand format completer returning the completer
4277 type. */
4278
4279static fp_operand_format
4280pa_parse_fp_format (s)
4281 char **s;
4282{
4283 int format;
4284
4285 format = SGL;
4286 if (**s == ',')
4287 {
4288 *s += 1;
4289 if (strncasecmp (*s, "sgl", 3) == 0)
4290 {
4291 format = SGL;
4292 *s += 4;
4293 }
4294 else if (strncasecmp (*s, "dbl", 3) == 0)
4295 {
4296 format = DBL;
4297 *s += 4;
4298 }
4299 else if (strncasecmp (*s, "quad", 4) == 0)
4300 {
4301 format = QUAD;
4302 *s += 5;
4303 }
4304 else
4305 {
4306 format = ILLEGAL_FMT;
4307 as_bad (_("Invalid FP Operand Format: %3s"), *s);
4308 }
4309 }
4310
4311 return format;
4312}
4313
4314/* Convert from a selector string into a selector type. */
4315
4316static int
4317pa_chk_field_selector (str)
4318 char **str;
4319{
4320 int middle, low, high;
4321 int cmp;
4322 char name[4];
4323
4324 /* Read past any whitespace. */
4325 /* FIXME: should we read past newlines and formfeeds??? */
4326 while (**str == ' ' || **str == '\t' || **str == '\n' || **str == '\f')
4327 *str = *str + 1;
4328
4329 if ((*str)[1] == '\'' || (*str)[1] == '%')
4330 name[0] = tolower ((*str)[0]),
4331 name[1] = 0;
4332 else if ((*str)[2] == '\'' || (*str)[2] == '%')
4333 name[0] = tolower ((*str)[0]),
4334 name[1] = tolower ((*str)[1]),
4335 name[2] = 0;
252b5132
RH
4336 else if ((*str)[3] == '\'' || (*str)[3] == '%')
4337 name[0] = tolower ((*str)[0]),
4338 name[1] = tolower ((*str)[1]),
4339 name[2] = tolower ((*str)[2]),
4340 name[3] = 0;
252b5132
RH
4341 else
4342 return e_fsel;
4343
4344 low = 0;
4345 high = sizeof (selector_table) / sizeof (struct selector_entry) - 1;
4346
4347 do
4348 {
4349 middle = (low + high) / 2;
4350 cmp = strcmp (name, selector_table[middle].prefix);
4351 if (cmp < 0)
4352 high = middle - 1;
4353 else if (cmp > 0)
4354 low = middle + 1;
4355 else
4356 {
4357 *str += strlen (name) + 1;
4358#ifndef OBJ_SOM
4359 if (selector_table[middle].field_selector == e_nsel)
4360 return e_fsel;
4361#endif
4362 return selector_table[middle].field_selector;
4363 }
4364 }
4365 while (low <= high);
4366
4367 return e_fsel;
4368}
4369
4370/* Mark (via expr_end) the end of an expression (I think). FIXME. */
4371
4372static int
4373get_expression (str)
4374 char *str;
4375{
4376 char *save_in;
4377 asection *seg;
4378
4379 save_in = input_line_pointer;
4380 input_line_pointer = str;
4381 seg = expression (&the_insn.exp);
4382 if (!(seg == absolute_section
4383 || seg == undefined_section
4384 || SEG_NORMAL (seg)))
4385 {
4386 as_warn (_("Bad segment in expression."));
4387 expr_end = input_line_pointer;
4388 input_line_pointer = save_in;
4389 return 1;
4390 }
4391 expr_end = input_line_pointer;
4392 input_line_pointer = save_in;
4393 return 0;
4394}
4395
4396/* Mark (via expr_end) the end of an absolute expression. FIXME. */
4397static int
4398pa_get_absolute_expression (insn, strp)
4399 struct pa_it *insn;
4400 char **strp;
4401{
4402 char *save_in;
4403
4404 insn->field_selector = pa_chk_field_selector (strp);
4405 save_in = input_line_pointer;
4406 input_line_pointer = *strp;
4407 expression (&insn->exp);
4408 /* This is not perfect, but is a huge improvement over doing nothing.
4409
4410 The PA assembly syntax is ambigious in a variety of ways. Consider
4411 this string "4 %r5" Is that the number 4 followed by the register
4412 r5, or is that 4 MOD 5?
4413
4414 If we get a modulo expresion When looking for an absolute, we try
4415 again cutting off the input string at the first whitespace character. */
4416 if (insn->exp.X_op == O_modulus)
4417 {
4418 char *s, c;
4419 int retval;
4420
4421 input_line_pointer = *strp;
4422 s = *strp;
4423 while (*s != ',' && *s != ' ' && *s != '\t')
4424 s++;
4425
4426 c = *s;
4427 *s = 0;
4428
4429 retval = pa_get_absolute_expression (insn, strp);
4430
4431 input_line_pointer = save_in;
4432 *s = c;
4433 return evaluate_absolute (insn);
4434 }
0f4f8b56
JL
4435 /* When in strict mode we have a non-match, fix up the pointers
4436 and return to our caller. */
4437 if (insn->exp.X_op != O_constant && strict)
4438 {
4439 expr_end = input_line_pointer;
4440 input_line_pointer = save_in;
4441 return 0;
4442 }
252b5132
RH
4443 if (insn->exp.X_op != O_constant)
4444 {
4445 as_bad (_("Bad segment (should be absolute)."));
4446 expr_end = input_line_pointer;
4447 input_line_pointer = save_in;
4448 return 0;
4449 }
4450 expr_end = input_line_pointer;
4451 input_line_pointer = save_in;
4452 return evaluate_absolute (insn);
4453}
4454
4455/* Evaluate an absolute expression EXP which may be modified by
4456 the selector FIELD_SELECTOR. Return the value of the expression. */
4457static int
4458evaluate_absolute (insn)
4459 struct pa_it *insn;
4460{
4461 int value;
4462 expressionS exp;
4463 int field_selector = insn->field_selector;
4464
4465 exp = insn->exp;
4466 value = exp.X_add_number;
4467
4468 switch (field_selector)
4469 {
4470 /* No change. */
4471 case e_fsel:
4472 break;
4473
4474 /* If bit 21 is on then add 0x800 and arithmetic shift right 11 bits. */
4475 case e_lssel:
4476 if (value & 0x00000400)
4477 value += 0x800;
4478 value = (value & 0xfffff800) >> 11;
4479 break;
4480
4481 /* Sign extend from bit 21. */
4482 case e_rssel:
4483 if (value & 0x00000400)
4484 value |= 0xfffff800;
4485 else
4486 value &= 0x7ff;
4487 break;
4488
4489 /* Arithmetic shift right 11 bits. */
4490 case e_lsel:
4491 value = (value & 0xfffff800) >> 11;
4492 break;
4493
4494 /* Set bits 0-20 to zero. */
4495 case e_rsel:
4496 value = value & 0x7ff;
4497 break;
4498
4499 /* Add 0x800 and arithmetic shift right 11 bits. */
4500 case e_ldsel:
4501 value += 0x800;
4502 value = (value & 0xfffff800) >> 11;
4503 break;
4504
4505 /* Set bitgs 0-21 to one. */
4506 case e_rdsel:
4507 value |= 0xfffff800;
4508 break;
4509
4510#define RSEL_ROUND(c) (((c) + 0x1000) & ~0x1fff)
4511 case e_rrsel:
4512 value = (RSEL_ROUND (value) & 0x7ff) + (value - RSEL_ROUND (value));
4513 break;
4514
4515 case e_lrsel:
4516 value = (RSEL_ROUND (value) >> 11) & 0x1fffff;
4517 break;
4518#undef RSEL_ROUND
4519
4520 default:
4521 BAD_CASE (field_selector);
4522 break;
4523 }
4524 return value;
4525}
4526
4527/* Given an argument location specification return the associated
4528 argument location number. */
4529
4530static unsigned int
4531pa_build_arg_reloc (type_name)
4532 char *type_name;
4533{
4534
4535 if (strncasecmp (type_name, "no", 2) == 0)
4536 return 0;
4537 if (strncasecmp (type_name, "gr", 2) == 0)
4538 return 1;
4539 else if (strncasecmp (type_name, "fr", 2) == 0)
4540 return 2;
4541 else if (strncasecmp (type_name, "fu", 2) == 0)
4542 return 3;
4543 else
4544 as_bad (_("Invalid argument location: %s\n"), type_name);
4545
4546 return 0;
4547}
4548
4549/* Encode and return an argument relocation specification for
4550 the given register in the location specified by arg_reloc. */
4551
4552static unsigned int
4553pa_align_arg_reloc (reg, arg_reloc)
4554 unsigned int reg;
4555 unsigned int arg_reloc;
4556{
4557 unsigned int new_reloc;
4558
4559 new_reloc = arg_reloc;
4560 switch (reg)
4561 {
4562 case 0:
4563 new_reloc <<= 8;
4564 break;
4565 case 1:
4566 new_reloc <<= 6;
4567 break;
4568 case 2:
4569 new_reloc <<= 4;
4570 break;
4571 case 3:
4572 new_reloc <<= 2;
4573 break;
4574 default:
4575 as_bad (_("Invalid argument description: %d"), reg);
4576 }
4577
4578 return new_reloc;
4579}
4580
4581/* Parse a PA nullification completer (,n). Return nonzero if the
4582 completer was found; return zero if no completer was found. */
4583
4584static int
4585pa_parse_nullif (s)
4586 char **s;
4587{
4588 int nullif;
4589
4590 nullif = 0;
4591 if (**s == ',')
4592 {
4593 *s = *s + 1;
4594 if (strncasecmp (*s, "n", 1) == 0)
4595 nullif = 1;
4596 else
4597 {
4598 as_bad (_("Invalid Nullification: (%c)"), **s);
4599 nullif = 0;
4600 }
4601 *s = *s + 1;
4602 }
4603
4604 return nullif;
4605}
4606
4607/* Parse a non-negated compare/subtract completer returning the
4608 number (for encoding in instrutions) of the given completer.
4609
4610 ISBRANCH specifies whether or not this is parsing a condition
4611 completer for a branch (vs a nullification completer for a
4612 computational instruction. */
4613
4614static int
4615pa_parse_nonneg_cmpsub_cmpltr (s, isbranch)
4616 char **s;
4617 int isbranch;
4618{
4619 int cmpltr;
4620 char *name = *s + 1;
4621 char c;
4622 char *save_s = *s;
4623 int nullify = 0;
4624
4625 cmpltr = 0;
4626 if (**s == ',')
4627 {
4628 *s += 1;
4629 while (**s != ',' && **s != ' ' && **s != '\t')
4630 *s += 1;
4631 c = **s;
4632 **s = 0x00;
4633
4634
4635 if (strcmp (name, "=") == 0)
4636 {
4637 cmpltr = 1;
4638 }
4639 else if (strcmp (name, "<") == 0)
4640 {
4641 cmpltr = 2;
4642 }
4643 else if (strcmp (name, "<=") == 0)
4644 {
4645 cmpltr = 3;
4646 }
4647 else if (strcmp (name, "<<") == 0)
4648 {
4649 cmpltr = 4;
4650 }
4651 else if (strcmp (name, "<<=") == 0)
4652 {
4653 cmpltr = 5;
4654 }
4655 else if (strcasecmp (name, "sv") == 0)
4656 {
4657 cmpltr = 6;
4658 }
4659 else if (strcasecmp (name, "od") == 0)
4660 {
4661 cmpltr = 7;
4662 }
4663 /* If we have something like addb,n then there is no condition
4664 completer. */
4665 else if (strcasecmp (name, "n") == 0 && isbranch)
4666 {
4667 cmpltr = 0;
4668 nullify = 1;
4669 }
4670 else
4671 {
4672 cmpltr = -1;
4673 }
4674 **s = c;
4675 }
4676
4677 /* Reset pointers if this was really a ,n for a branch instruction. */
4678 if (nullify)
4679 *s = save_s;
4680
4681
4682 return cmpltr;
4683}
4684
4685/* Parse a negated compare/subtract completer returning the
4686 number (for encoding in instrutions) of the given completer.
4687
4688 ISBRANCH specifies whether or not this is parsing a condition
4689 completer for a branch (vs a nullification completer for a
4690 computational instruction. */
4691
4692static int
4693pa_parse_neg_cmpsub_cmpltr (s, isbranch)
4694 char **s;
4695 int isbranch;
4696{
4697 int cmpltr;
4698 char *name = *s + 1;
4699 char c;
4700 char *save_s = *s;
4701 int nullify = 0;
4702
4703 cmpltr = 0;
4704 if (**s == ',')
4705 {
4706 *s += 1;
4707 while (**s != ',' && **s != ' ' && **s != '\t')
4708 *s += 1;
4709 c = **s;
4710 **s = 0x00;
4711
4712
4713 if (strcasecmp (name, "tr") == 0)
4714 {
4715 cmpltr = 0;
4716 }
4717 else if (strcmp (name, "<>") == 0)
4718 {
4719 cmpltr = 1;
4720 }
4721 else if (strcmp (name, ">=") == 0)
4722 {
4723 cmpltr = 2;
4724 }
4725 else if (strcmp (name, ">") == 0)
4726 {
4727 cmpltr = 3;
4728 }
4729 else if (strcmp (name, ">>=") == 0)
4730 {
4731 cmpltr = 4;
4732 }
4733 else if (strcmp (name, ">>") == 0)
4734 {
4735 cmpltr = 5;
4736 }
4737 else if (strcasecmp (name, "nsv") == 0)
4738 {
4739 cmpltr = 6;
4740 }
4741 else if (strcasecmp (name, "ev") == 0)
4742 {
4743 cmpltr = 7;
4744 }
4745 /* If we have something like addb,n then there is no condition
4746 completer. */
4747 else if (strcasecmp (name, "n") == 0 && isbranch)
4748 {
4749 cmpltr = 0;
4750 nullify = 1;
4751 }
4752 else
4753 {
4754 cmpltr = -1;
4755 }
4756 **s = c;
4757 }
4758
4759 /* Reset pointers if this was really a ,n for a branch instruction. */
4760 if (nullify)
4761 *s = save_s;
4762
4763
4764 return cmpltr;
4765}
4766
4767
4768/* Parse a non-negated addition completer returning the number
4769 (for encoding in instrutions) of the given completer.
4770
4771 ISBRANCH specifies whether or not this is parsing a condition
4772 completer for a branch (vs a nullification completer for a
4773 computational instruction. */
4774
4775static int
4776pa_parse_nonneg_add_cmpltr (s, isbranch)
4777 char **s;
4778 int isbranch;
4779{
4780 int cmpltr;
4781 char *name = *s + 1;
4782 char c;
4783 char *save_s = *s;
4784
4785 cmpltr = 0;
4786 if (**s == ',')
4787 {
4788 *s += 1;
4789 while (**s != ',' && **s != ' ' && **s != '\t')
4790 *s += 1;
4791 c = **s;
4792 **s = 0x00;
4793 if (strcmp (name, "=") == 0)
4794 {
4795 cmpltr = 1;
4796 }
4797 else if (strcmp (name, "<") == 0)
4798 {
4799 cmpltr = 2;
4800 }
4801 else if (strcmp (name, "<=") == 0)
4802 {
4803 cmpltr = 3;
4804 }
4805 else if (strcasecmp (name, "nuv") == 0)
4806 {
4807 cmpltr = 4;
4808 }
4809 else if (strcasecmp (name, "znv") == 0)
4810 {
4811 cmpltr = 5;
4812 }
4813 else if (strcasecmp (name, "sv") == 0)
4814 {
4815 cmpltr = 6;
4816 }
4817 else if (strcasecmp (name, "od") == 0)
4818 {
4819 cmpltr = 7;
4820 }
4821 /* If we have something like addb,n then there is no condition
4822 completer. */
4823 else if (strcasecmp (name, "n") == 0 && isbranch)
4824 {
4825 cmpltr = 0;
4826 }
4827 else
4828 {
4829 cmpltr = -1;
4830 }
4831 **s = c;
4832 }
4833
4834 /* Reset pointers if this was really a ,n for a branch instruction. */
4835 if (cmpltr == 0 && *name == 'n' && isbranch)
4836 *s = save_s;
4837
4838 return cmpltr;
4839}
4840
4841/* Parse a negated addition completer returning the number
4842 (for encoding in instrutions) of the given completer.
4843
4844 ISBRANCH specifies whether or not this is parsing a condition
4845 completer for a branch (vs a nullification completer for a
4846 computational instruction). */
4847
4848static int
4849pa_parse_neg_add_cmpltr (s, isbranch)
4850 char **s;
4851 int isbranch;
4852{
4853 int cmpltr;
4854 char *name = *s + 1;
4855 char c;
4856 char *save_s = *s;
4857
4858 cmpltr = 0;
4859 if (**s == ',')
4860 {
4861 *s += 1;
4862 while (**s != ',' && **s != ' ' && **s != '\t')
4863 *s += 1;
4864 c = **s;
4865 **s = 0x00;
4866 if (strcasecmp (name, "tr") == 0)
4867 {
4868 cmpltr = 0;
4869 }
4870 else if (strcmp (name, "<>") == 0)
4871 {
4872 cmpltr = 1;
4873 }
4874 else if (strcmp (name, ">=") == 0)
4875 {
4876 cmpltr = 2;
4877 }
4878 else if (strcmp (name, ">") == 0)
4879 {
4880 cmpltr = 3;
4881 }
4882 else if (strcasecmp (name, "uv") == 0)
4883 {
4884 cmpltr = 4;
4885 }
4886 else if (strcasecmp (name, "vnz") == 0)
4887 {
4888 cmpltr = 5;
4889 }
4890 else if (strcasecmp (name, "nsv") == 0)
4891 {
4892 cmpltr = 6;
4893 }
4894 else if (strcasecmp (name, "ev") == 0)
4895 {
4896 cmpltr = 7;
4897 }
4898 /* If we have something like addb,n then there is no condition
4899 completer. */
4900 else if (strcasecmp (name, "n") == 0 && isbranch)
4901 {
4902 cmpltr = 0;
4903 }
4904 else
4905 {
4906 cmpltr = -1;
4907 }
4908 **s = c;
4909 }
4910
4911 /* Reset pointers if this was really a ,n for a branch instruction. */
4912 if (cmpltr == 0 && *name == 'n' && isbranch)
4913 *s = save_s;
4914
4915 return cmpltr;
4916}
4917
49863f82 4918#ifdef OBJ_SOM
252b5132
RH
4919/* Handle an alignment directive. Special so that we can update the
4920 alignment of the subspace if necessary. */
4921static void
4922pa_align (bytes)
4923{
4924 /* We must have a valid space and subspace. */
4925 pa_check_current_space_and_subspace ();
4926
4927 /* Let the generic gas code do most of the work. */
4928 s_align_bytes (bytes);
4929
4930 /* If bytes is a power of 2, then update the current subspace's
4931 alignment if necessary. */
4932 if (log2 (bytes) != -1)
4933 record_alignment (current_subspace->ssd_seg, log2 (bytes));
4934}
49863f82 4935#endif
252b5132
RH
4936
4937/* Handle a .BLOCK type pseudo-op. */
4938
4939static void
4940pa_block (z)
4941 int z;
4942{
4943 char *p;
4944 long int temp_fill;
4945 unsigned int temp_size;
4946 unsigned int i;
4947
49863f82 4948#ifdef OBJ_SOM
252b5132
RH
4949 /* We must have a valid space and subspace. */
4950 pa_check_current_space_and_subspace ();
49863f82 4951#endif
252b5132
RH
4952
4953 temp_size = get_absolute_expression ();
4954
4955 /* Always fill with zeros, that's what the HP assembler does. */
4956 temp_fill = 0;
4957
4958 p = frag_var (rs_fill, (int) temp_size, (int) temp_size,
4959 (relax_substateT) 0, (symbolS *) 0, (offsetT) 1, NULL);
4960 memset (p, 0, temp_size);
4961
4962 /* Convert 2 bytes at a time. */
4963
4964 for (i = 0; i < temp_size; i += 2)
4965 {
4966 md_number_to_chars (p + i,
4967 (valueT) temp_fill,
4968 (int) ((temp_size - i) > 2 ? 2 : (temp_size - i)));
4969 }
4970
4971 pa_undefine_label ();
4972 demand_empty_rest_of_line ();
4973}
4974
4975/* Handle a .begin_brtab and .end_brtab pseudo-op. */
4976
4977static void
4978pa_brtab (begin)
4979 int begin;
4980{
4981
4982#ifdef OBJ_SOM
4983 /* The BRTAB relocations are only availble in SOM (to denote
4984 the beginning and end of branch tables). */
4985 char *where = frag_more (0);
4986
4987 fix_new_hppa (frag_now, where - frag_now->fr_literal, 0,
4988 NULL, (offsetT) 0, NULL,
4989 0, begin ? R_HPPA_BEGIN_BRTAB : R_HPPA_END_BRTAB,
4990 e_fsel, 0, 0, NULL);
4991#endif
4992
4993 demand_empty_rest_of_line ();
4994}
4995
4996/* Handle a .begin_try and .end_try pseudo-op. */
4997
4998static void
4999pa_try (begin)
5000 int begin;
5001{
5002#ifdef OBJ_SOM
5003 expressionS exp;
5004 char *where = frag_more (0);
5005
5006 if (! begin)
5007 expression (&exp);
5008
5009 /* The TRY relocations are only availble in SOM (to denote
5010 the beginning and end of exception handling regions). */
5011
5012 fix_new_hppa (frag_now, where - frag_now->fr_literal, 0,
5013 NULL, (offsetT) 0, begin ? NULL : &exp,
5014 0, begin ? R_HPPA_BEGIN_TRY : R_HPPA_END_TRY,
5015 e_fsel, 0, 0, NULL);
5016#endif
5017
5018 demand_empty_rest_of_line ();
5019}
5020
5021/* Handle a .CALL pseudo-op. This involves storing away information
5022 about where arguments are to be found so the linker can detect
5023 (and correct) argument location mismatches between caller and callee. */
5024
5025static void
5026pa_call (unused)
5027 int unused;
5028{
49863f82 5029#ifdef OBJ_SOM
252b5132
RH
5030 /* We must have a valid space and subspace. */
5031 pa_check_current_space_and_subspace ();
49863f82 5032#endif
252b5132
RH
5033
5034 pa_call_args (&last_call_desc);
5035 demand_empty_rest_of_line ();
5036}
5037
5038/* Do the dirty work of building a call descriptor which describes
5039 where the caller placed arguments to a function call. */
5040
5041static void
5042pa_call_args (call_desc)
5043 struct call_desc *call_desc;
5044{
5045 char *name, c, *p;
5046 unsigned int temp, arg_reloc;
5047
5048 while (!is_end_of_statement ())
5049 {
5050 name = input_line_pointer;
5051 c = get_symbol_end ();
5052 /* Process a source argument. */
5053 if ((strncasecmp (name, "argw", 4) == 0))
5054 {
5055 temp = atoi (name + 4);
5056 p = input_line_pointer;
5057 *p = c;
5058 input_line_pointer++;
5059 name = input_line_pointer;
5060 c = get_symbol_end ();
5061 arg_reloc = pa_build_arg_reloc (name);
5062 call_desc->arg_reloc |= pa_align_arg_reloc (temp, arg_reloc);
5063 }
5064 /* Process a return value. */
5065 else if ((strncasecmp (name, "rtnval", 6) == 0))
5066 {
5067 p = input_line_pointer;
5068 *p = c;
5069 input_line_pointer++;
5070 name = input_line_pointer;
5071 c = get_symbol_end ();
5072 arg_reloc = pa_build_arg_reloc (name);
5073 call_desc->arg_reloc |= (arg_reloc & 0x3);
5074 }
5075 else
5076 {
5077 as_bad (_("Invalid .CALL argument: %s"), name);
5078 }
5079 p = input_line_pointer;
5080 *p = c;
5081 if (!is_end_of_statement ())
5082 input_line_pointer++;
5083 }
5084}
5085
5086/* Return TRUE if FRAG1 and FRAG2 are the same. */
5087
5088static int
5089is_same_frag (frag1, frag2)
5090 fragS *frag1;
5091 fragS *frag2;
5092{
5093
5094 if (frag1 == NULL)
5095 return (FALSE);
5096 else if (frag2 == NULL)
5097 return (FALSE);
5098 else if (frag1 == frag2)
5099 return (TRUE);
5100 else if (frag2->fr_type == rs_fill && frag2->fr_fix == 0)
5101 return (is_same_frag (frag1, frag2->fr_next));
5102 else
5103 return (FALSE);
5104}
5105
5106#ifdef OBJ_ELF
5107/* Build an entry in the UNWIND subspace from the given function
5108 attributes in CALL_INFO. This is not needed for SOM as using
5109 R_ENTRY and R_EXIT relocations allow the linker to handle building
5110 of the unwind spaces. */
5111
5112static void
5113pa_build_unwind_subspace (call_info)
5114 struct call_info *call_info;
5115{
5116 char *unwind;
5117 asection *seg, *save_seg;
46031ca9 5118 asymbol *sym;
252b5132 5119 subsegT subseg, save_subseg;
46031ca9 5120 int i, reloc;
252b5132
RH
5121 char c, *p;
5122
9100134c
JL
5123 if (bfd_get_arch_info (stdoutput)->bits_per_address == 32)
5124 reloc = R_PARISC_DIR32;
46031ca9 5125 else
9100134c 5126 reloc = R_PARISC_SEGREL32;
46031ca9 5127
252b5132
RH
5128 /* Get into the right seg/subseg. This may involve creating
5129 the seg the first time through. Make sure to have the
5130 old seg/subseg so that we can reset things when we are done. */
252b5132
RH
5131 seg = bfd_get_section_by_name (stdoutput, UNWIND_SECTION_NAME);
5132 if (seg == ASEC_NULL)
5133 {
5134 seg = bfd_make_section_old_way (stdoutput, UNWIND_SECTION_NAME);
5135 bfd_set_section_flags (stdoutput, seg,
5136 SEC_READONLY | SEC_HAS_CONTENTS
b100be66
JL
5137 | SEC_LOAD | SEC_RELOC | SEC_ALLOC | SEC_DATA);
5138 bfd_set_section_alignment (stdoutput, seg, 2);
252b5132
RH
5139 }
5140
5141 save_seg = now_seg;
5142 save_subseg = now_subseg;
46031ca9 5143 subseg_set (seg, 0);
252b5132
RH
5144
5145
5146 /* Get some space to hold relocation information for the unwind
5147 descriptor. */
5148 p = frag_more (4);
5149 md_number_to_chars (p, 0, 4);
5150
5151 /* Relocation info. for start offset of the function. */
5152 fix_new_hppa (frag_now, p - frag_now->fr_literal, 4,
5153 call_info->start_symbol, (offsetT) 0,
46031ca9
JL
5154 (expressionS *) NULL, 0, reloc,
5155 e_fsel, 32, 0, NULL);
252b5132
RH
5156
5157 p = frag_more (4);
5158 md_number_to_chars (p, 0, 4);
5159
5160 /* Relocation info. for end offset of the function.
5161
5162 Because we allow reductions of 32bit relocations for ELF, this will be
5163 reduced to section_sym + offset which avoids putting the temporary
5164 symbol into the symbol table. It (should) end up giving the same
5165 value as call_info->start_symbol + function size once the linker is
5166 finished with its work. */
5167
5168 fix_new_hppa (frag_now, p - frag_now->fr_literal, 4,
5169 call_info->end_symbol, (offsetT) 0,
46031ca9
JL
5170 (expressionS *) NULL, 0, reloc,
5171 e_fsel, 32, 0, NULL);
252b5132
RH
5172
5173 /* Dump it. */
5174 unwind = (char *) &call_info->ci_unwind;
5175 for (i = 8; i < sizeof (struct unwind_table); i++)
5176 {
5177 c = *(unwind + i);
5178 {
5179 FRAG_APPEND_1_CHAR (c);
5180 }
5181 }
5182
5183 /* Return back to the original segment/subsegment. */
5184 subseg_set (save_seg, save_subseg);
5185}
5186#endif
5187
5188/* Process a .CALLINFO pseudo-op. This information is used later
5189 to build unwind descriptors and maybe one day to support
5190 .ENTER and .LEAVE. */
5191
5192static void
5193pa_callinfo (unused)
5194 int unused;
5195{
5196 char *name, c, *p;
5197 int temp;
5198
49863f82 5199#ifdef OBJ_SOM
252b5132
RH
5200 /* We must have a valid space and subspace. */
5201 pa_check_current_space_and_subspace ();
49863f82 5202#endif
252b5132
RH
5203
5204 /* .CALLINFO must appear within a procedure definition. */
5205 if (!within_procedure)
5206 as_bad (_(".callinfo is not within a procedure definition"));
5207
5208 /* Mark the fact that we found the .CALLINFO for the
5209 current procedure. */
5210 callinfo_found = TRUE;
5211
5212 /* Iterate over the .CALLINFO arguments. */
5213 while (!is_end_of_statement ())
5214 {
5215 name = input_line_pointer;
5216 c = get_symbol_end ();
5217 /* Frame size specification. */
5218 if ((strncasecmp (name, "frame", 5) == 0))
5219 {
5220 p = input_line_pointer;
5221 *p = c;
5222 input_line_pointer++;
5223 temp = get_absolute_expression ();
5224 if ((temp & 0x3) != 0)
5225 {
5226 as_bad (_("FRAME parameter must be a multiple of 8: %d\n"), temp);
5227 temp = 0;
5228 }
5229
5230 /* callinfo is in bytes and unwind_desc is in 8 byte units. */
5231 last_call_info->ci_unwind.descriptor.frame_size = temp / 8;
5232
5233 }
5234 /* Entry register (GR, GR and SR) specifications. */
5235 else if ((strncasecmp (name, "entry_gr", 8) == 0))
5236 {
5237 p = input_line_pointer;
5238 *p = c;
5239 input_line_pointer++;
5240 temp = get_absolute_expression ();
5241 /* The HP assembler accepts 19 as the high bound for ENTRY_GR
5242 even though %r19 is caller saved. I think this is a bug in
5243 the HP assembler, and we are not going to emulate it. */
5244 if (temp < 3 || temp > 18)
5245 as_bad (_("Value for ENTRY_GR must be in the range 3..18\n"));
5246 last_call_info->ci_unwind.descriptor.entry_gr = temp - 2;
5247 }
5248 else if ((strncasecmp (name, "entry_fr", 8) == 0))
5249 {
5250 p = input_line_pointer;
5251 *p = c;
5252 input_line_pointer++;
5253 temp = get_absolute_expression ();
5254 /* Similarly the HP assembler takes 31 as the high bound even
5255 though %fr21 is the last callee saved floating point register. */
5256 if (temp < 12 || temp > 21)
5257 as_bad (_("Value for ENTRY_FR must be in the range 12..21\n"));
5258 last_call_info->ci_unwind.descriptor.entry_fr = temp - 11;
5259 }
5260 else if ((strncasecmp (name, "entry_sr", 8) == 0))
5261 {
5262 p = input_line_pointer;
5263 *p = c;
5264 input_line_pointer++;
5265 temp = get_absolute_expression ();
5266 if (temp != 3)
5267 as_bad (_("Value for ENTRY_SR must be 3\n"));
5268 }
5269 /* Note whether or not this function performs any calls. */
5270 else if ((strncasecmp (name, "calls", 5) == 0) ||
5271 (strncasecmp (name, "caller", 6) == 0))
5272 {
5273 p = input_line_pointer;
5274 *p = c;
5275 }
5276 else if ((strncasecmp (name, "no_calls", 8) == 0))
5277 {
5278 p = input_line_pointer;
5279 *p = c;
5280 }
5281 /* Should RP be saved into the stack. */
5282 else if ((strncasecmp (name, "save_rp", 7) == 0))
5283 {
5284 p = input_line_pointer;
5285 *p = c;
5286 last_call_info->ci_unwind.descriptor.save_rp = 1;
5287 }
5288 /* Likewise for SP. */
5289 else if ((strncasecmp (name, "save_sp", 7) == 0))
5290 {
5291 p = input_line_pointer;
5292 *p = c;
5293 last_call_info->ci_unwind.descriptor.save_sp = 1;
5294 }
5295 /* Is this an unwindable procedure. If so mark it so
5296 in the unwind descriptor. */
5297 else if ((strncasecmp (name, "no_unwind", 9) == 0))
5298 {
5299 p = input_line_pointer;
5300 *p = c;
5301 last_call_info->ci_unwind.descriptor.cannot_unwind = 1;
5302 }
5303 /* Is this an interrupt routine. If so mark it in the
5304 unwind descriptor. */
5305 else if ((strncasecmp (name, "hpux_int", 7) == 0))
5306 {
5307 p = input_line_pointer;
5308 *p = c;
5309 last_call_info->ci_unwind.descriptor.hpux_interrupt_marker = 1;
5310 }
5311 /* Is this a millicode routine. "millicode" isn't in my
5312 assembler manual, but my copy is old. The HP assembler
5313 accepts it, and there's a place in the unwind descriptor
5314 to drop the information, so we'll accept it too. */
5315 else if ((strncasecmp (name, "millicode", 9) == 0))
5316 {
5317 p = input_line_pointer;
5318 *p = c;
5319 last_call_info->ci_unwind.descriptor.millicode = 1;
5320 }
5321 else
5322 {
5323 as_bad (_("Invalid .CALLINFO argument: %s"), name);
5324 *input_line_pointer = c;
5325 }
5326 if (!is_end_of_statement ())
5327 input_line_pointer++;
5328 }
5329
5330 demand_empty_rest_of_line ();
5331}
5332
5333/* Switch into the code subspace. */
5334
5335static void
5336pa_code (unused)
5337 int unused;
5338{
49863f82 5339#ifdef OBJ_SOM
252b5132
RH
5340 current_space = is_defined_space ("$TEXT$");
5341 current_subspace
5342 = pa_subsegment_to_subspace (current_space->sd_seg, 0);
49863f82 5343#endif
252b5132
RH
5344 s_text (0);
5345 pa_undefine_label ();
5346}
5347
5348/* This is different than the standard GAS s_comm(). On HP9000/800 machines,
5349 the .comm pseudo-op has the following symtax:
5350
5351 <label> .comm <length>
5352
5353 where <label> is optional and is a symbol whose address will be the start of
5354 a block of memory <length> bytes long. <length> must be an absolute
5355 expression. <length> bytes will be allocated in the current space
5356 and subspace.
5357
5358 Also note the label may not even be on the same line as the .comm.
5359
5360 This difference in syntax means the colon function will be called
5361 on the symbol before we arrive in pa_comm. colon will set a number
5362 of attributes of the symbol that need to be fixed here. In particular
5363 the value, section pointer, fragment pointer, flags, etc. What
5364 a pain.
5365
5366 This also makes error detection all but impossible. */
5367
5368static void
5369pa_comm (unused)
5370 int unused;
5371{
5372 unsigned int size;
5373 symbolS *symbol;
5374 label_symbol_struct *label_symbol = pa_get_label ();
5375
5376 if (label_symbol)
5377 symbol = label_symbol->lss_label;
5378 else
5379 symbol = NULL;
5380
5381 SKIP_WHITESPACE ();
5382 size = get_absolute_expression ();
5383
5384 if (symbol)
5385 {
5386 S_SET_VALUE (symbol, size);
5387 S_SET_SEGMENT (symbol, bfd_und_section_ptr);
5388 S_SET_EXTERNAL (symbol);
5389
5390 /* colon() has already set the frag to the current location in the
5391 current subspace; we need to reset the fragment to the zero address
5392 fragment. We also need to reset the segment pointer. */
a0f75b47 5393 symbol_set_frag (symbol, &zero_address_frag);
252b5132
RH
5394 }
5395 demand_empty_rest_of_line ();
5396}
5397
5398/* Process a .END pseudo-op. */
5399
5400static void
5401pa_end (unused)
5402 int unused;
5403{
5404 demand_empty_rest_of_line ();
5405}
5406
5407/* Process a .ENTER pseudo-op. This is not supported. */
5408static void
5409pa_enter (unused)
5410 int unused;
5411{
49863f82 5412#ifdef OBJ_SOM
252b5132
RH
5413 /* We must have a valid space and subspace. */
5414 pa_check_current_space_and_subspace ();
49863f82 5415#endif
252b5132
RH
5416
5417 as_bad (_("The .ENTER pseudo-op is not supported"));
5418 demand_empty_rest_of_line ();
5419}
5420
5421/* Process a .ENTRY pseudo-op. .ENTRY marks the beginning of the
5422 procesure. */
5423static void
5424pa_entry (unused)
5425 int unused;
5426{
49863f82 5427#ifdef OBJ_SOM
252b5132
RH
5428 /* We must have a valid space and subspace. */
5429 pa_check_current_space_and_subspace ();
49863f82 5430#endif
252b5132
RH
5431
5432 if (!within_procedure)
5433 as_bad (_("Misplaced .entry. Ignored."));
5434 else
5435 {
5436 if (!callinfo_found)
5437 as_bad (_("Missing .callinfo."));
5438 }
5439 demand_empty_rest_of_line ();
5440 within_entry_exit = TRUE;
5441
5442#ifdef OBJ_SOM
5443 /* SOM defers building of unwind descriptors until the link phase.
5444 The assembler is responsible for creating an R_ENTRY relocation
5445 to mark the beginning of a region and hold the unwind bits, and
5446 for creating an R_EXIT relocation to mark the end of the region.
5447
5448 FIXME. ELF should be using the same conventions! The problem
5449 is an unwind requires too much relocation space. Hmmm. Maybe
5450 if we split the unwind bits up between the relocations which
5451 denote the entry and exit points. */
5452 if (last_call_info->start_symbol != NULL)
5453 {
5454 char *where = frag_more (0);
5455
5456 fix_new_hppa (frag_now, where - frag_now->fr_literal, 0,
5457 NULL, (offsetT) 0, NULL,
5458 0, R_HPPA_ENTRY, e_fsel, 0, 0,
5459 (int *) &last_call_info->ci_unwind.descriptor);
5460 }
5461#endif
5462}
5463
5464/* Handle a .EQU pseudo-op. */
5465
5466static void
5467pa_equ (reg)
5468 int reg;
5469{
5470 label_symbol_struct *label_symbol = pa_get_label ();
5471 symbolS *symbol;
5472
5473 if (label_symbol)
5474 {
5475 symbol = label_symbol->lss_label;
5476 if (reg)
5477 S_SET_VALUE (symbol, pa_parse_number (&input_line_pointer, 0));
5478 else
5479 S_SET_VALUE (symbol, (unsigned int) get_absolute_expression ());
5480 S_SET_SEGMENT (symbol, bfd_abs_section_ptr);
5481 }
5482 else
5483 {
5484 if (reg)
5485 as_bad (_(".REG must use a label"));
5486 else
5487 as_bad (_(".EQU must use a label"));
5488 }
5489
5490 pa_undefine_label ();
5491 demand_empty_rest_of_line ();
5492}
5493
5494/* Helper function. Does processing for the end of a function. This
5495 usually involves creating some relocations or building special
5496 symbols to mark the end of the function. */
5497
5498static void
5499process_exit ()
5500{
5501 char *where;
5502
5503 where = frag_more (0);
5504
5505#ifdef OBJ_ELF
5506 /* Mark the end of the function, stuff away the location of the frag
5507 for the end of the function, and finally call pa_build_unwind_subspace
5508 to add an entry in the unwind table. */
5509 hppa_elf_mark_end_of_function ();
5510 pa_build_unwind_subspace (last_call_info);
5511#else
5512 /* SOM defers building of unwind descriptors until the link phase.
5513 The assembler is responsible for creating an R_ENTRY relocation
5514 to mark the beginning of a region and hold the unwind bits, and
5515 for creating an R_EXIT relocation to mark the end of the region.
5516
5517 FIXME. ELF should be using the same conventions! The problem
5518 is an unwind requires too much relocation space. Hmmm. Maybe
5519 if we split the unwind bits up between the relocations which
5520 denote the entry and exit points. */
5521 fix_new_hppa (frag_now, where - frag_now->fr_literal, 0,
5522 NULL, (offsetT) 0,
5523 NULL, 0, R_HPPA_EXIT, e_fsel, 0, 0,
5524 (int *) &last_call_info->ci_unwind.descriptor + 1);
5525#endif
5526}
5527
5528/* Process a .EXIT pseudo-op. */
5529
5530static void
5531pa_exit (unused)
5532 int unused;
5533{
49863f82 5534#ifdef OBJ_SOM
252b5132
RH
5535 /* We must have a valid space and subspace. */
5536 pa_check_current_space_and_subspace ();
49863f82 5537#endif
252b5132
RH
5538
5539 if (!within_procedure)
5540 as_bad (_(".EXIT must appear within a procedure"));
5541 else
5542 {
5543 if (!callinfo_found)
5544 as_bad (_("Missing .callinfo"));
5545 else
5546 {
5547 if (!within_entry_exit)
5548 as_bad (_("No .ENTRY for this .EXIT"));
5549 else
5550 {
5551 within_entry_exit = FALSE;
5552 process_exit ();
5553 }
5554 }
5555 }
5556 demand_empty_rest_of_line ();
5557}
5558
5559/* Process a .EXPORT directive. This makes functions external
5560 and provides information such as argument relocation entries
5561 to callers. */
5562
5563static void
5564pa_export (unused)
5565 int unused;
5566{
5567 char *name, c, *p;
5568 symbolS *symbol;
5569
5570 name = input_line_pointer;
5571 c = get_symbol_end ();
5572 /* Make sure the given symbol exists. */
5573 if ((symbol = symbol_find_or_make (name)) == NULL)
5574 {
5575 as_bad (_("Cannot define export symbol: %s\n"), name);
5576 p = input_line_pointer;
5577 *p = c;
5578 input_line_pointer++;
5579 }
5580 else
5581 {
5582 /* OK. Set the external bits and process argument relocations. */
5583 S_SET_EXTERNAL (symbol);
5584 p = input_line_pointer;
5585 *p = c;
5586 if (!is_end_of_statement ())
5587 {
5588 input_line_pointer++;
5589 pa_type_args (symbol, 1);
5590 }
5591 }
5592
5593 demand_empty_rest_of_line ();
5594}
5595
5596/* Helper function to process arguments to a .EXPORT pseudo-op. */
5597
5598static void
5599pa_type_args (symbolP, is_export)
5600 symbolS *symbolP;
5601 int is_export;
5602{
5603 char *name, c, *p;
5604 unsigned int temp, arg_reloc;
5605 pa_symbol_type type = SYMBOL_TYPE_UNKNOWN;
a0f75b47 5606 obj_symbol_type *symbol = (obj_symbol_type *) symbol_get_bfdsym (symbolP);
252b5132
RH
5607
5608 if (strncasecmp (input_line_pointer, "absolute", 8) == 0)
5609
5610 {
5611 input_line_pointer += 8;
a0f75b47 5612 symbol_get_bfdsym (symbolP)->flags &= ~BSF_FUNCTION;
252b5132
RH
5613 S_SET_SEGMENT (symbolP, bfd_abs_section_ptr);
5614 type = SYMBOL_TYPE_ABSOLUTE;
5615 }
5616 else if (strncasecmp (input_line_pointer, "code", 4) == 0)
5617 {
5618 input_line_pointer += 4;
5619 /* IMPORTing/EXPORTing CODE types for functions is meaningless for SOM,
5620 instead one should be IMPORTing/EXPORTing ENTRY types.
5621
5622 Complain if one tries to EXPORT a CODE type since that's never
5623 done. Both GCC and HP C still try to IMPORT CODE types, so
5624 silently fix them to be ENTRY types. */
a0f75b47 5625 if (S_IS_FUNCTION (symbolP))
252b5132
RH
5626 {
5627 if (is_export)
a0f75b47
ILT
5628 as_tsktsk (_("Using ENTRY rather than CODE in export directive for %s"),
5629 S_GET_NAME (symbolP));
252b5132 5630
a0f75b47 5631 symbol_get_bfdsym (symbolP)->flags |= BSF_FUNCTION;
252b5132
RH
5632 type = SYMBOL_TYPE_ENTRY;
5633 }
5634 else
5635 {
a0f75b47 5636 symbol_get_bfdsym (symbolP)->flags &= ~BSF_FUNCTION;
252b5132
RH
5637 type = SYMBOL_TYPE_CODE;
5638 }
5639 }
5640 else if (strncasecmp (input_line_pointer, "data", 4) == 0)
5641 {
5642 input_line_pointer += 4;
a0f75b47 5643 symbol_get_bfdsym (symbolP)->flags &= ~BSF_FUNCTION;
252b5132
RH
5644 type = SYMBOL_TYPE_DATA;
5645 }
5646 else if ((strncasecmp (input_line_pointer, "entry", 5) == 0))
5647 {
5648 input_line_pointer += 5;
a0f75b47 5649 symbol_get_bfdsym (symbolP)->flags |= BSF_FUNCTION;
252b5132
RH
5650 type = SYMBOL_TYPE_ENTRY;
5651 }
5652 else if (strncasecmp (input_line_pointer, "millicode", 9) == 0)
5653 {
5654 input_line_pointer += 9;
a0f75b47 5655 symbol_get_bfdsym (symbolP)->flags |= BSF_FUNCTION;
252b5132
RH
5656 type = SYMBOL_TYPE_MILLICODE;
5657 }
5658 else if (strncasecmp (input_line_pointer, "plabel", 6) == 0)
5659 {
5660 input_line_pointer += 6;
a0f75b47 5661 symbol_get_bfdsym (symbolP)->flags &= ~BSF_FUNCTION;
252b5132
RH
5662 type = SYMBOL_TYPE_PLABEL;
5663 }
5664 else if (strncasecmp (input_line_pointer, "pri_prog", 8) == 0)
5665 {
5666 input_line_pointer += 8;
a0f75b47 5667 symbol_get_bfdsym (symbolP)->flags |= BSF_FUNCTION;
252b5132
RH
5668 type = SYMBOL_TYPE_PRI_PROG;
5669 }
5670 else if (strncasecmp (input_line_pointer, "sec_prog", 8) == 0)
5671 {
5672 input_line_pointer += 8;
a0f75b47 5673 symbol_get_bfdsym (symbolP)->flags |= BSF_FUNCTION;
252b5132
RH
5674 type = SYMBOL_TYPE_SEC_PROG;
5675 }
5676
5677 /* SOM requires much more information about symbol types
5678 than BFD understands. This is how we get this information
5679 to the SOM BFD backend. */
5680#ifdef obj_set_symbol_type
a0f75b47 5681 obj_set_symbol_type (symbol_get_bfdsym (symbolP), (int) type);
252b5132
RH
5682#endif
5683
5684 /* Now that the type of the exported symbol has been handled,
5685 handle any argument relocation information. */
5686 while (!is_end_of_statement ())
5687 {
5688 if (*input_line_pointer == ',')
5689 input_line_pointer++;
5690 name = input_line_pointer;
5691 c = get_symbol_end ();
5692 /* Argument sources. */
5693 if ((strncasecmp (name, "argw", 4) == 0))
5694 {
5695 p = input_line_pointer;
5696 *p = c;
5697 input_line_pointer++;
5698 temp = atoi (name + 4);
5699 name = input_line_pointer;
5700 c = get_symbol_end ();
5701 arg_reloc = pa_align_arg_reloc (temp, pa_build_arg_reloc (name));
49863f82 5702#ifdef OBJ_SOM
252b5132 5703 symbol->tc_data.ap.hppa_arg_reloc |= arg_reloc;
49863f82 5704#endif
252b5132
RH
5705 *input_line_pointer = c;
5706 }
5707 /* The return value. */
5708 else if ((strncasecmp (name, "rtnval", 6)) == 0)
5709 {
5710 p = input_line_pointer;
5711 *p = c;
5712 input_line_pointer++;
5713 name = input_line_pointer;
5714 c = get_symbol_end ();
5715 arg_reloc = pa_build_arg_reloc (name);
49863f82 5716#ifdef OBJ_SOM
252b5132 5717 symbol->tc_data.ap.hppa_arg_reloc |= arg_reloc;
49863f82 5718#endif
252b5132
RH
5719 *input_line_pointer = c;
5720 }
5721 /* Privelege level. */
5722 else if ((strncasecmp (name, "priv_lev", 8)) == 0)
5723 {
5724 p = input_line_pointer;
5725 *p = c;
5726 input_line_pointer++;
5727 temp = atoi (input_line_pointer);
49863f82 5728#ifdef OBJ_SOM
252b5132 5729 symbol->tc_data.ap.hppa_priv_level = temp;
49863f82 5730#endif
252b5132
RH
5731 c = get_symbol_end ();
5732 *input_line_pointer = c;
5733 }
5734 else
5735 {
5736 as_bad (_("Undefined .EXPORT/.IMPORT argument (ignored): %s"), name);
5737 p = input_line_pointer;
5738 *p = c;
5739 }
5740 if (!is_end_of_statement ())
5741 input_line_pointer++;
5742 }
5743}
5744
5745/* Handle an .IMPORT pseudo-op. Any symbol referenced in a given
5746 assembly file must either be defined in the assembly file, or
5747 explicitly IMPORTED from another. */
5748
5749static void
5750pa_import (unused)
5751 int unused;
5752{
5753 char *name, c, *p;
5754 symbolS *symbol;
5755
5756 name = input_line_pointer;
5757 c = get_symbol_end ();
5758
5759 symbol = symbol_find (name);
5760 /* Ugh. We might be importing a symbol defined earlier in the file,
5761 in which case all the code below will really screw things up
5762 (set the wrong segment, symbol flags & type, etc). */
5763 if (symbol == NULL || !S_IS_DEFINED (symbol))
5764 {
5765 symbol = symbol_find_or_make (name);
5766 p = input_line_pointer;
5767 *p = c;
5768
5769 if (!is_end_of_statement ())
5770 {
5771 input_line_pointer++;
5772 pa_type_args (symbol, 0);
5773 }
5774 else
5775 {
5776 /* Sigh. To be compatable with the HP assembler and to help
5777 poorly written assembly code, we assign a type based on
5778 the the current segment. Note only BSF_FUNCTION really
5779 matters, we do not need to set the full SYMBOL_TYPE_* info. */
5780 if (now_seg == text_section)
a0f75b47 5781 symbol_get_bfdsym (symbol)->flags |= BSF_FUNCTION;
252b5132
RH
5782
5783 /* If the section is undefined, then the symbol is undefined
5784 Since this is an import, leave the section undefined. */
5785 S_SET_SEGMENT (symbol, bfd_und_section_ptr);
5786 }
5787 }
5788 else
5789 {
5790 /* The symbol was already defined. Just eat everything up to
5791 the end of the current statement. */
5792 while (!is_end_of_statement ())
5793 input_line_pointer++;
5794 }
5795
5796 demand_empty_rest_of_line ();
5797}
5798
5799/* Handle a .LABEL pseudo-op. */
5800
5801static void
5802pa_label (unused)
5803 int unused;
5804{
5805 char *name, c, *p;
5806
5807 name = input_line_pointer;
5808 c = get_symbol_end ();
5809
5810 if (strlen (name) > 0)
5811 {
5812 colon (name);
5813 p = input_line_pointer;
5814 *p = c;
5815 }
5816 else
5817 {
5818 as_warn (_("Missing label name on .LABEL"));
5819 }
5820
5821 if (!is_end_of_statement ())
5822 {
5823 as_warn (_("extra .LABEL arguments ignored."));
5824 ignore_rest_of_line ();
5825 }
5826 demand_empty_rest_of_line ();
5827}
5828
5829/* Handle a .LEAVE pseudo-op. This is not supported yet. */
5830
5831static void
5832pa_leave (unused)
5833 int unused;
5834{
49863f82 5835#ifdef OBJ_SOM
252b5132
RH
5836 /* We must have a valid space and subspace. */
5837 pa_check_current_space_and_subspace ();
49863f82 5838#endif
252b5132
RH
5839
5840 as_bad (_("The .LEAVE pseudo-op is not supported"));
5841 demand_empty_rest_of_line ();
5842}
5843
5844/* Handle a .LEVEL pseudo-op. */
5845
5846static void
5847pa_level (unused)
5848 int unused;
5849{
5850 char *level;
5851
5852 level = input_line_pointer;
5853 if (strncmp (level, "1.0", 3) == 0)
5854 {
5855 input_line_pointer += 3;
5856 if (!bfd_set_arch_mach (stdoutput, bfd_arch_hppa, 10))
5857 as_warn (_("could not set architecture and machine"));
5858 }
5859 else if (strncmp (level, "1.1", 3) == 0)
5860 {
5861 input_line_pointer += 3;
5862 if (!bfd_set_arch_mach (stdoutput, bfd_arch_hppa, 11))
5863 as_warn (_("could not set architecture and machine"));
5864 }
46031ca9
JL
5865 else if (strncmp (level, "2.0w", 4) == 0)
5866 {
5867 input_line_pointer += 4;
5868 if (!bfd_set_arch_mach (stdoutput, bfd_arch_hppa, 25))
5869 as_warn (_("could not set architecture and machine"));
5870 }
252b5132
RH
5871 else if (strncmp (level, "2.0", 3) == 0)
5872 {
5873 input_line_pointer += 3;
5874 if (!bfd_set_arch_mach (stdoutput, bfd_arch_hppa, 20))
5875 as_warn (_("could not set architecture and machine"));
5876 }
5877 else
5878 {
5879 as_bad (_("Unrecognized .LEVEL argument\n"));
5880 ignore_rest_of_line ();
5881 }
5882 demand_empty_rest_of_line ();
5883}
5884
5885/* Handle a .ORIGIN pseudo-op. */
5886
5887static void
5888pa_origin (unused)
5889 int unused;
5890{
49863f82 5891#ifdef OBJ_SOM
252b5132
RH
5892 /* We must have a valid space and subspace. */
5893 pa_check_current_space_and_subspace ();
49863f82 5894#endif
252b5132
RH
5895
5896 s_org (0);
5897 pa_undefine_label ();
5898}
5899
5900/* Handle a .PARAM pseudo-op. This is much like a .EXPORT, except it
5901 is for static functions. FIXME. Should share more code with .EXPORT. */
5902
5903static void
5904pa_param (unused)
5905 int unused;
5906{
5907 char *name, c, *p;
5908 symbolS *symbol;
5909
5910 name = input_line_pointer;
5911 c = get_symbol_end ();
5912
5913 if ((symbol = symbol_find_or_make (name)) == NULL)
5914 {
5915 as_bad (_("Cannot define static symbol: %s\n"), name);
5916 p = input_line_pointer;
5917 *p = c;
5918 input_line_pointer++;
5919 }
5920 else
5921 {
5922 S_CLEAR_EXTERNAL (symbol);
5923 p = input_line_pointer;
5924 *p = c;
5925 if (!is_end_of_statement ())
5926 {
5927 input_line_pointer++;
5928 pa_type_args (symbol, 0);
5929 }
5930 }
5931
5932 demand_empty_rest_of_line ();
5933}
5934
5935/* Handle a .PROC pseudo-op. It is used to mark the beginning
5936 of a procedure from a syntatical point of view. */
5937
5938static void
5939pa_proc (unused)
5940 int unused;
5941{
5942 struct call_info *call_info;
5943
49863f82 5944#ifdef OBJ_SOM
252b5132
RH
5945 /* We must have a valid space and subspace. */
5946 pa_check_current_space_and_subspace ();
49863f82 5947#endif
252b5132
RH
5948
5949 if (within_procedure)
5950 as_fatal (_("Nested procedures"));
5951
5952 /* Reset global variables for new procedure. */
5953 callinfo_found = FALSE;
5954 within_procedure = TRUE;
5955
5956 /* Create another call_info structure. */
5957 call_info = (struct call_info *) xmalloc (sizeof (struct call_info));
5958
5959 if (!call_info)
5960 as_fatal (_("Cannot allocate unwind descriptor\n"));
5961
5962 memset (call_info, 0, sizeof (struct call_info));
5963
5964 call_info->ci_next = NULL;
5965
5966 if (call_info_root == NULL)
5967 {
5968 call_info_root = call_info;
5969 last_call_info = call_info;
5970 }
5971 else
5972 {
5973 last_call_info->ci_next = call_info;
5974 last_call_info = call_info;
5975 }
5976
5977 /* set up defaults on call_info structure */
5978
5979 call_info->ci_unwind.descriptor.cannot_unwind = 0;
5980 call_info->ci_unwind.descriptor.region_desc = 1;
5981 call_info->ci_unwind.descriptor.hpux_interrupt_marker = 0;
5982
5983 /* If we got a .PROC pseudo-op, we know that the function is defined
5984 locally. Make sure it gets into the symbol table. */
5985 {
5986 label_symbol_struct *label_symbol = pa_get_label ();
5987
5988 if (label_symbol)
5989 {
5990 if (label_symbol->lss_label)
5991 {
5992 last_call_info->start_symbol = label_symbol->lss_label;
a0f75b47 5993 symbol_get_bfdsym (label_symbol->lss_label)->flags |= BSF_FUNCTION;
252b5132
RH
5994 }
5995 else
5996 as_bad (_("Missing function name for .PROC (corrupted label chain)"));
5997 }
5998 else
5999 last_call_info->start_symbol = NULL;
6000 }
6001
6002 demand_empty_rest_of_line ();
6003}
6004
6005/* Process the syntatical end of a procedure. Make sure all the
6006 appropriate pseudo-ops were found within the procedure. */
6007
6008static void
6009pa_procend (unused)
6010 int unused;
6011{
6012
49863f82 6013#ifdef OBJ_SOM
252b5132
RH
6014 /* We must have a valid space and subspace. */
6015 pa_check_current_space_and_subspace ();
49863f82 6016#endif
252b5132
RH
6017
6018 /* If we are within a procedure definition, make sure we've
6019 defined a label for the procedure; handle case where the
6020 label was defined after the .PROC directive.
6021
6022 Note there's not need to diddle with the segment or fragment
6023 for the label symbol in this case. We have already switched
6024 into the new $CODE$ subspace at this point. */
6025 if (within_procedure && last_call_info->start_symbol == NULL)
6026 {
6027 label_symbol_struct *label_symbol = pa_get_label ();
6028
6029 if (label_symbol)
6030 {
6031 if (label_symbol->lss_label)
6032 {
6033 last_call_info->start_symbol = label_symbol->lss_label;
a0f75b47
ILT
6034 symbol_get_bfdsym (label_symbol->lss_label)->flags
6035 |= BSF_FUNCTION;
252b5132
RH
6036#ifdef OBJ_SOM
6037 /* Also handle allocation of a fixup to hold the unwind
6038 information when the label appears after the proc/procend. */
6039 if (within_entry_exit)
6040 {
6041 char *where = frag_more (0);
6042
6043 fix_new_hppa (frag_now, where - frag_now->fr_literal, 0,
6044 NULL, (offsetT) 0, NULL,
6045 0, R_HPPA_ENTRY, e_fsel, 0, 0,
6046 (int *) &last_call_info->ci_unwind.descriptor);
6047 }
6048#endif
6049 }
6050 else
6051 as_bad (_("Missing function name for .PROC (corrupted label chain)"));
6052 }
6053 else
6054 as_bad (_("Missing function name for .PROC"));
6055 }
6056
6057 if (!within_procedure)
6058 as_bad (_("misplaced .procend"));
6059
6060 if (!callinfo_found)
6061 as_bad (_("Missing .callinfo for this procedure"));
6062
6063 if (within_entry_exit)
6064 as_bad (_("Missing .EXIT for a .ENTRY"));
6065
6066#ifdef OBJ_ELF
6067 /* ELF needs to mark the end of each function so that it can compute
6068 the size of the function (apparently its needed in the symbol table). */
6069 hppa_elf_mark_end_of_function ();
6070#endif
6071
6072 within_procedure = FALSE;
6073 demand_empty_rest_of_line ();
6074 pa_undefine_label ();
6075}
6076
49863f82
JL
6077/* If VALUE is an exact power of two between zero and 2^31, then
6078 return log2 (VALUE). Else return -1. */
6079
6080static int
6081log2 (value)
6082 int value;
6083{
6084 int shift = 0;
6085
6086 while ((1 << shift) != value && shift < 32)
6087 shift++;
6088
6089 if (shift >= 32)
6090 return -1;
6091 else
6092 return shift;
6093}
6094
6095
6096#ifdef OBJ_SOM
6097/* Check to make sure we have a valid space and subspace. */
6098
6099static void
6100pa_check_current_space_and_subspace ()
6101{
6102 if (current_space == NULL)
6103 as_fatal (_("Not in a space.\n"));
6104
6105 if (current_subspace == NULL)
6106 as_fatal (_("Not in a subspace.\n"));
6107}
6108
252b5132
RH
6109/* Parse the parameters to a .SPACE directive; if CREATE_FLAG is nonzero,
6110 then create a new space entry to hold the information specified
6111 by the parameters to the .SPACE directive. */
6112
6113static sd_chain_struct *
6114pa_parse_space_stmt (space_name, create_flag)
6115 char *space_name;
6116 int create_flag;
6117{
6118 char *name, *ptemp, c;
6119 char loadable, defined, private, sort;
6120 int spnum, temp;
6121 asection *seg = NULL;
6122 sd_chain_struct *space;
6123
6124 /* load default values */
6125 spnum = 0;
6126 sort = 0;
6127 loadable = TRUE;
6128 defined = TRUE;
6129 private = FALSE;
6130 if (strcmp (space_name, "$TEXT$") == 0)
6131 {
6132 seg = pa_def_spaces[0].segment;
6133 defined = pa_def_spaces[0].defined;
6134 private = pa_def_spaces[0].private;
6135 sort = pa_def_spaces[0].sort;
6136 spnum = pa_def_spaces[0].spnum;
6137 }
6138 else if (strcmp (space_name, "$PRIVATE$") == 0)
6139 {
6140 seg = pa_def_spaces[1].segment;
6141 defined = pa_def_spaces[1].defined;
6142 private = pa_def_spaces[1].private;
6143 sort = pa_def_spaces[1].sort;
6144 spnum = pa_def_spaces[1].spnum;
6145 }
6146
6147 if (!is_end_of_statement ())
6148 {
6149 print_errors = FALSE;
6150 ptemp = input_line_pointer + 1;
6151 /* First see if the space was specified as a number rather than
6152 as a name. According to the PA assembly manual the rest of
6153 the line should be ignored. */
6154 temp = pa_parse_number (&ptemp, 0);
6155 if (temp >= 0)
6156 {
6157 spnum = temp;
6158 input_line_pointer = ptemp;
6159 }
6160 else
6161 {
6162 while (!is_end_of_statement ())
6163 {
6164 input_line_pointer++;
6165 name = input_line_pointer;
6166 c = get_symbol_end ();
6167 if ((strncasecmp (name, "spnum", 5) == 0))
6168 {
6169 *input_line_pointer = c;
6170 input_line_pointer++;
6171 spnum = get_absolute_expression ();
6172 }
6173 else if ((strncasecmp (name, "sort", 4) == 0))
6174 {
6175 *input_line_pointer = c;
6176 input_line_pointer++;
6177 sort = get_absolute_expression ();
6178 }
6179 else if ((strncasecmp (name, "unloadable", 10) == 0))
6180 {
6181 *input_line_pointer = c;
6182 loadable = FALSE;
6183 }
6184 else if ((strncasecmp (name, "notdefined", 10) == 0))
6185 {
6186 *input_line_pointer = c;
6187 defined = FALSE;
6188 }
6189 else if ((strncasecmp (name, "private", 7) == 0))
6190 {
6191 *input_line_pointer = c;
6192 private = TRUE;
6193 }
6194 else
6195 {
6196 as_bad (_("Invalid .SPACE argument"));
6197 *input_line_pointer = c;
6198 if (!is_end_of_statement ())
6199 input_line_pointer++;
6200 }
6201 }
6202 }
6203 print_errors = TRUE;
6204 }
6205
6206 if (create_flag && seg == NULL)
6207 seg = subseg_new (space_name, 0);
6208
6209 /* If create_flag is nonzero, then create the new space with
6210 the attributes computed above. Else set the values in
6211 an already existing space -- this can only happen for
6212 the first occurence of a built-in space. */
6213 if (create_flag)
6214 space = create_new_space (space_name, spnum, loadable, defined,
6215 private, sort, seg, 1);
6216 else
6217 {
6218 space = is_defined_space (space_name);
6219 SPACE_SPNUM (space) = spnum;
6220 SPACE_DEFINED (space) = defined & 1;
6221 SPACE_USER_DEFINED (space) = 1;
6222 }
6223
6224#ifdef obj_set_section_attributes
6225 obj_set_section_attributes (seg, defined, private, sort, spnum);
6226#endif
6227
6228 return space;
6229}
6230
6231/* Handle a .SPACE pseudo-op; this switches the current space to the
6232 given space, creating the new space if necessary. */
6233
6234static void
6235pa_space (unused)
6236 int unused;
6237{
6238 char *name, c, *space_name, *save_s;
6239 int temp;
6240 sd_chain_struct *sd_chain;
6241
6242 if (within_procedure)
6243 {
6244 as_bad (_("Can\'t change spaces within a procedure definition. Ignored"));
6245 ignore_rest_of_line ();
6246 }
6247 else
6248 {
6249 /* Check for some of the predefined spaces. FIXME: most of the code
6250 below is repeated several times, can we extract the common parts
6251 and place them into a subroutine or something similar? */
6252 /* FIXME Is this (and the next IF stmt) really right?
6253 What if INPUT_LINE_POINTER points to "$TEXT$FOO"? */
6254 if (strncmp (input_line_pointer, "$TEXT$", 6) == 0)
6255 {
6256 input_line_pointer += 6;
6257 sd_chain = is_defined_space ("$TEXT$");
6258 if (sd_chain == NULL)
6259 sd_chain = pa_parse_space_stmt ("$TEXT$", 1);
6260 else if (SPACE_USER_DEFINED (sd_chain) == 0)
6261 sd_chain = pa_parse_space_stmt ("$TEXT$", 0);
6262
6263 current_space = sd_chain;
6264 subseg_set (text_section, sd_chain->sd_last_subseg);
6265 current_subspace
6266 = pa_subsegment_to_subspace (text_section,
6267 sd_chain->sd_last_subseg);
6268 demand_empty_rest_of_line ();
6269 return;
6270 }
6271 if (strncmp (input_line_pointer, "$PRIVATE$", 9) == 0)
6272 {
6273 input_line_pointer += 9;
6274 sd_chain = is_defined_space ("$PRIVATE$");
6275 if (sd_chain == NULL)
6276 sd_chain = pa_parse_space_stmt ("$PRIVATE$", 1);
6277 else if (SPACE_USER_DEFINED (sd_chain) == 0)
6278 sd_chain = pa_parse_space_stmt ("$PRIVATE$", 0);
6279
6280 current_space = sd_chain;
6281 subseg_set (data_section, sd_chain->sd_last_subseg);
6282 current_subspace
6283 = pa_subsegment_to_subspace (data_section,
6284 sd_chain->sd_last_subseg);
6285 demand_empty_rest_of_line ();
6286 return;
6287 }
6288 if (!strncasecmp (input_line_pointer,
6289 GDB_DEBUG_SPACE_NAME,
6290 strlen (GDB_DEBUG_SPACE_NAME)))
6291 {
6292 input_line_pointer += strlen (GDB_DEBUG_SPACE_NAME);
6293 sd_chain = is_defined_space (GDB_DEBUG_SPACE_NAME);
6294 if (sd_chain == NULL)
6295 sd_chain = pa_parse_space_stmt (GDB_DEBUG_SPACE_NAME, 1);
6296 else if (SPACE_USER_DEFINED (sd_chain) == 0)
6297 sd_chain = pa_parse_space_stmt (GDB_DEBUG_SPACE_NAME, 0);
6298
6299 current_space = sd_chain;
6300
6301 {
6302 asection *gdb_section
6303 = bfd_make_section_old_way (stdoutput, GDB_DEBUG_SPACE_NAME);
6304
6305 subseg_set (gdb_section, sd_chain->sd_last_subseg);
6306 current_subspace
6307 = pa_subsegment_to_subspace (gdb_section,
6308 sd_chain->sd_last_subseg);
6309 }
6310 demand_empty_rest_of_line ();
6311 return;
6312 }
6313
6314 /* It could be a space specified by number. */
6315 print_errors = 0;
6316 save_s = input_line_pointer;
6317 if ((temp = pa_parse_number (&input_line_pointer, 0)) >= 0)
6318 {
6319 if ((sd_chain = pa_find_space_by_number (temp)))
6320 {
6321 current_space = sd_chain;
6322
6323 subseg_set (sd_chain->sd_seg, sd_chain->sd_last_subseg);
6324 current_subspace
6325 = pa_subsegment_to_subspace (sd_chain->sd_seg,
6326 sd_chain->sd_last_subseg);
6327 demand_empty_rest_of_line ();
6328 return;
6329 }
6330 }
6331
6332 /* Not a number, attempt to create a new space. */
6333 print_errors = 1;
6334 input_line_pointer = save_s;
6335 name = input_line_pointer;
6336 c = get_symbol_end ();
6337 space_name = xmalloc (strlen (name) + 1);
6338 strcpy (space_name, name);
6339 *input_line_pointer = c;
6340
6341 sd_chain = pa_parse_space_stmt (space_name, 1);
6342 current_space = sd_chain;
6343
6344 subseg_set (sd_chain->sd_seg, sd_chain->sd_last_subseg);
6345 current_subspace = pa_subsegment_to_subspace (sd_chain->sd_seg,
6346 sd_chain->sd_last_subseg);
6347 demand_empty_rest_of_line ();
6348 }
6349}
6350
6351/* Switch to a new space. (I think). FIXME. */
6352
6353static void
6354pa_spnum (unused)
6355 int unused;
6356{
6357 char *name;
6358 char c;
6359 char *p;
6360 sd_chain_struct *space;
6361
6362 name = input_line_pointer;
6363 c = get_symbol_end ();
6364 space = is_defined_space (name);
6365 if (space)
6366 {
6367 p = frag_more (4);
6368 md_number_to_chars (p, SPACE_SPNUM (space), 4);
6369 }
6370 else
6371 as_warn (_("Undefined space: '%s' Assuming space number = 0."), name);
6372
6373 *input_line_pointer = c;
6374 demand_empty_rest_of_line ();
6375}
6376
252b5132
RH
6377/* Handle a .SUBSPACE pseudo-op; this switches the current subspace to the
6378 given subspace, creating the new subspace if necessary.
6379
6380 FIXME. Should mirror pa_space more closely, in particular how
6381 they're broken up into subroutines. */
6382
6383static void
6384pa_subspace (create_new)
6385 int create_new;
6386{
49863f82 6387 char *name, *ss_name, c;
252b5132
RH
6388 char loadable, code_only, common, dup_common, zero, sort;
6389 int i, access, space_index, alignment, quadrant, applicable, flags;
6390 sd_chain_struct *space;
6391 ssd_chain_struct *ssd;
6392 asection *section;
6393
6394 if (current_space == NULL)
6395 as_fatal (_("Must be in a space before changing or declaring subspaces.\n"));
6396
6397 if (within_procedure)
6398 {
6399 as_bad (_("Can\'t change subspaces within a procedure definition. Ignored"));
6400 ignore_rest_of_line ();
6401 }
6402 else
6403 {
6404 name = input_line_pointer;
6405 c = get_symbol_end ();
6406 ss_name = xmalloc (strlen (name) + 1);
6407 strcpy (ss_name, name);
6408 *input_line_pointer = c;
6409
6410 /* Load default values. */
6411 sort = 0;
6412 access = 0x7f;
6413 loadable = 1;
6414 common = 0;
6415 dup_common = 0;
6416 code_only = 0;
6417 zero = 0;
6418 space_index = ~0;
6419 alignment = 1;
6420 quadrant = 0;
252b5132
RH
6421
6422 space = current_space;
6423 if (create_new)
6424 ssd = NULL;
6425 else
6426 ssd = is_defined_subspace (ss_name);
6427 /* Allow user to override the builtin attributes of subspaces. But
6428 only allow the attributes to be changed once! */
6429 if (ssd && SUBSPACE_DEFINED (ssd))
6430 {
6431 subseg_set (ssd->ssd_seg, ssd->ssd_subseg);
6432 current_subspace = ssd;
6433 if (!is_end_of_statement ())
6434 as_warn (_("Parameters of an existing subspace can\'t be modified"));
6435 demand_empty_rest_of_line ();
6436 return;
6437 }
6438 else
6439 {
6440 /* A new subspace. Load default values if it matches one of
6441 the builtin subspaces. */
6442 i = 0;
6443 while (pa_def_subspaces[i].name)
6444 {
6445 if (strcasecmp (pa_def_subspaces[i].name, ss_name) == 0)
6446 {
6447 loadable = pa_def_subspaces[i].loadable;
6448 common = pa_def_subspaces[i].common;
6449 dup_common = pa_def_subspaces[i].dup_common;
6450 code_only = pa_def_subspaces[i].code_only;
6451 zero = pa_def_subspaces[i].zero;
6452 space_index = pa_def_subspaces[i].space_index;
6453 alignment = pa_def_subspaces[i].alignment;
6454 quadrant = pa_def_subspaces[i].quadrant;
6455 access = pa_def_subspaces[i].access;
6456 sort = pa_def_subspaces[i].sort;
252b5132
RH
6457 break;
6458 }
6459 i++;
6460 }
6461 }
6462
6463 /* We should be working with a new subspace now. Fill in
6464 any information as specified by the user. */
6465 if (!is_end_of_statement ())
6466 {
6467 input_line_pointer++;
6468 while (!is_end_of_statement ())
6469 {
6470 name = input_line_pointer;
6471 c = get_symbol_end ();
6472 if ((strncasecmp (name, "quad", 4) == 0))
6473 {
6474 *input_line_pointer = c;
6475 input_line_pointer++;
6476 quadrant = get_absolute_expression ();
6477 }
6478 else if ((strncasecmp (name, "align", 5) == 0))
6479 {
6480 *input_line_pointer = c;
6481 input_line_pointer++;
6482 alignment = get_absolute_expression ();
6483 if (log2 (alignment) == -1)
6484 {
6485 as_bad (_("Alignment must be a power of 2"));
6486 alignment = 1;
6487 }
6488 }
6489 else if ((strncasecmp (name, "access", 6) == 0))
6490 {
6491 *input_line_pointer = c;
6492 input_line_pointer++;
6493 access = get_absolute_expression ();
6494 }
6495 else if ((strncasecmp (name, "sort", 4) == 0))
6496 {
6497 *input_line_pointer = c;
6498 input_line_pointer++;
6499 sort = get_absolute_expression ();
6500 }
6501 else if ((strncasecmp (name, "code_only", 9) == 0))
6502 {
6503 *input_line_pointer = c;
6504 code_only = 1;
6505 }
6506 else if ((strncasecmp (name, "unloadable", 10) == 0))
6507 {
6508 *input_line_pointer = c;
6509 loadable = 0;
6510 }
6511 else if ((strncasecmp (name, "common", 6) == 0))
6512 {
6513 *input_line_pointer = c;
6514 common = 1;
6515 }
6516 else if ((strncasecmp (name, "dup_comm", 8) == 0))
6517 {
6518 *input_line_pointer = c;
6519 dup_common = 1;
6520 }
6521 else if ((strncasecmp (name, "zero", 4) == 0))
6522 {
6523 *input_line_pointer = c;
6524 zero = 1;
6525 }
6526 else if ((strncasecmp (name, "first", 5) == 0))
6527 as_bad (_("FIRST not supported as a .SUBSPACE argument"));
6528 else
6529 as_bad (_("Invalid .SUBSPACE argument"));
6530 if (!is_end_of_statement ())
6531 input_line_pointer++;
6532 }
6533 }
6534
6535 /* Compute a reasonable set of BFD flags based on the information
6536 in the .subspace directive. */
6537 applicable = bfd_applicable_section_flags (stdoutput);
6538 flags = 0;
6539 if (loadable)
6540 flags |= (SEC_ALLOC | SEC_LOAD);
6541 if (code_only)
6542 flags |= SEC_CODE;
6543 if (common || dup_common)
6544 flags |= SEC_IS_COMMON;
6545
6546 flags |= SEC_RELOC | SEC_HAS_CONTENTS;
6547
6548 /* This is a zero-filled subspace (eg BSS). */
6549 if (zero)
6550 flags &= ~(SEC_LOAD | SEC_HAS_CONTENTS);
6551
6552 applicable &= flags;
6553
6554 /* If this is an existing subspace, then we want to use the
6555 segment already associated with the subspace.
6556
6557 FIXME NOW! ELF BFD doesn't appear to be ready to deal with
6558 lots of sections. It might be a problem in the PA ELF
6559 code, I do not know yet. For now avoid creating anything
6560 but the "standard" sections for ELF. */
6561 if (create_new)
6562 section = subseg_force_new (ss_name, 0);
6563 else if (ssd)
6564 section = ssd->ssd_seg;
252b5132
RH
6565 else
6566 section = subseg_new (ss_name, 0);
6567
6568 if (zero)
6569 seg_info (section)->bss = 1;
6570
6571 /* Now set the flags. */
6572 bfd_set_section_flags (stdoutput, section, applicable);
6573
6574 /* Record any alignment request for this section. */
6575 record_alignment (section, log2 (alignment));
6576
6577 /* Set the starting offset for this section. */
6578 bfd_set_section_vma (stdoutput, section,
6579 pa_subspace_start (space, quadrant));
6580
6581 /* Now that all the flags are set, update an existing subspace,
6582 or create a new one. */
6583 if (ssd)
6584
6585 current_subspace = update_subspace (space, ss_name, loadable,
6586 code_only, common, dup_common,
6587 sort, zero, access, space_index,
6588 alignment, quadrant,
6589 section);
6590 else
6591 current_subspace = create_new_subspace (space, ss_name, loadable,
6592 code_only, common,
6593 dup_common, zero, sort,
6594 access, space_index,
6595 alignment, quadrant, section);
6596
6597 demand_empty_rest_of_line ();
6598 current_subspace->ssd_seg = section;
6599 subseg_set (current_subspace->ssd_seg, current_subspace->ssd_subseg);
6600 }
6601 SUBSPACE_DEFINED (current_subspace) = 1;
6602}
6603
6604
6605/* Create default space and subspace dictionaries. */
6606
6607static void
6608pa_spaces_begin ()
6609{
6610 int i;
6611
6612 space_dict_root = NULL;
6613 space_dict_last = NULL;
6614
6615 i = 0;
6616 while (pa_def_spaces[i].name)
6617 {
6618 char *name;
6619
6620 /* Pick the right name to use for the new section. */
49863f82 6621 name = pa_def_spaces[i].name;
252b5132
RH
6622
6623 pa_def_spaces[i].segment = subseg_new (name, 0);
6624 create_new_space (pa_def_spaces[i].name, pa_def_spaces[i].spnum,
6625 pa_def_spaces[i].loadable, pa_def_spaces[i].defined,
6626 pa_def_spaces[i].private, pa_def_spaces[i].sort,
6627 pa_def_spaces[i].segment, 0);
6628 i++;
6629 }
6630
6631 i = 0;
6632 while (pa_def_subspaces[i].name)
6633 {
6634 char *name;
6635 int applicable, subsegment;
6636 asection *segment = NULL;
6637 sd_chain_struct *space;
6638
6639 /* Pick the right name for the new section and pick the right
6640 subsegment number. */
49863f82
JL
6641 name = pa_def_subspaces[i].name;
6642 subsegment = 0;
252b5132
RH
6643
6644 /* Create the new section. */
6645 segment = subseg_new (name, subsegment);
6646
6647
6648 /* For SOM we want to replace the standard .text, .data, and .bss
6649 sections with our own. We also want to set BFD flags for
6650 all the built-in subspaces. */
49863f82 6651 if (!strcmp (pa_def_subspaces[i].name, "$CODE$"))
252b5132
RH
6652 {
6653 text_section = segment;
6654 applicable = bfd_applicable_section_flags (stdoutput);
6655 bfd_set_section_flags (stdoutput, segment,
6656 applicable & (SEC_ALLOC | SEC_LOAD
6657 | SEC_RELOC | SEC_CODE
6658 | SEC_READONLY
6659 | SEC_HAS_CONTENTS));
6660 }
49863f82 6661 else if (!strcmp (pa_def_subspaces[i].name, "$DATA$"))
252b5132
RH
6662 {
6663 data_section = segment;
6664 applicable = bfd_applicable_section_flags (stdoutput);
6665 bfd_set_section_flags (stdoutput, segment,
6666 applicable & (SEC_ALLOC | SEC_LOAD
6667 | SEC_RELOC
6668 | SEC_HAS_CONTENTS));
6669
6670
6671 }
49863f82 6672 else if (!strcmp (pa_def_subspaces[i].name, "$BSS$"))
252b5132
RH
6673 {
6674 bss_section = segment;
6675 applicable = bfd_applicable_section_flags (stdoutput);
6676 bfd_set_section_flags (stdoutput, segment,
6677 applicable & SEC_ALLOC);
6678 }
49863f82 6679 else if (!strcmp (pa_def_subspaces[i].name, "$LIT$"))
252b5132
RH
6680 {
6681 applicable = bfd_applicable_section_flags (stdoutput);
6682 bfd_set_section_flags (stdoutput, segment,
6683 applicable & (SEC_ALLOC | SEC_LOAD
6684 | SEC_RELOC
6685 | SEC_READONLY
6686 | SEC_HAS_CONTENTS));
6687 }
49863f82 6688 else if (!strcmp (pa_def_subspaces[i].name, "$MILLICODE$"))
252b5132
RH
6689 {
6690 applicable = bfd_applicable_section_flags (stdoutput);
6691 bfd_set_section_flags (stdoutput, segment,
6692 applicable & (SEC_ALLOC | SEC_LOAD
6693 | SEC_RELOC
6694 | SEC_READONLY
6695 | SEC_HAS_CONTENTS));
6696 }
49863f82 6697 else if (!strcmp (pa_def_subspaces[i].name, "$UNWIND$"))
252b5132
RH
6698 {
6699 applicable = bfd_applicable_section_flags (stdoutput);
6700 bfd_set_section_flags (stdoutput, segment,
6701 applicable & (SEC_ALLOC | SEC_LOAD
6702 | SEC_RELOC
6703 | SEC_READONLY
6704 | SEC_HAS_CONTENTS));
6705 }
6706
6707 /* Find the space associated with this subspace. */
6708 space = pa_segment_to_space (pa_def_spaces[pa_def_subspaces[i].
6709 def_space_index].segment);
6710 if (space == NULL)
6711 {
6712 as_fatal (_("Internal error: Unable to find containing space for %s."),
6713 pa_def_subspaces[i].name);
6714 }
6715
6716 create_new_subspace (space, name,
6717 pa_def_subspaces[i].loadable,
6718 pa_def_subspaces[i].code_only,
6719 pa_def_subspaces[i].common,
6720 pa_def_subspaces[i].dup_common,
6721 pa_def_subspaces[i].zero,
6722 pa_def_subspaces[i].sort,
6723 pa_def_subspaces[i].access,
6724 pa_def_subspaces[i].space_index,
6725 pa_def_subspaces[i].alignment,
6726 pa_def_subspaces[i].quadrant,
6727 segment);
6728 i++;
6729 }
6730}
6731
6732
6733
6734/* Create a new space NAME, with the appropriate flags as defined
6735 by the given parameters. */
6736
6737static sd_chain_struct *
6738create_new_space (name, spnum, loadable, defined, private,
6739 sort, seg, user_defined)
6740 char *name;
6741 int spnum;
6742 int loadable;
6743 int defined;
6744 int private;
6745 int sort;
6746 asection *seg;
6747 int user_defined;
6748{
6749 sd_chain_struct *chain_entry;
6750
6751 chain_entry = (sd_chain_struct *) xmalloc (sizeof (sd_chain_struct));
6752 if (!chain_entry)
6753 as_fatal (_("Out of memory: could not allocate new space chain entry: %s\n"),
6754 name);
6755
6756 SPACE_NAME (chain_entry) = (char *) xmalloc (strlen (name) + 1);
6757 strcpy (SPACE_NAME (chain_entry), name);
6758 SPACE_DEFINED (chain_entry) = defined;
6759 SPACE_USER_DEFINED (chain_entry) = user_defined;
6760 SPACE_SPNUM (chain_entry) = spnum;
6761
6762 chain_entry->sd_seg = seg;
6763 chain_entry->sd_last_subseg = -1;
6764 chain_entry->sd_subspaces = NULL;
6765 chain_entry->sd_next = NULL;
6766
6767 /* Find spot for the new space based on its sort key. */
6768 if (!space_dict_last)
6769 space_dict_last = chain_entry;
6770
6771 if (space_dict_root == NULL)
6772 space_dict_root = chain_entry;
6773 else
6774 {
6775 sd_chain_struct *chain_pointer;
6776 sd_chain_struct *prev_chain_pointer;
6777
6778 chain_pointer = space_dict_root;
6779 prev_chain_pointer = NULL;
6780
6781 while (chain_pointer)
6782 {
6783 prev_chain_pointer = chain_pointer;
6784 chain_pointer = chain_pointer->sd_next;
6785 }
6786
6787 /* At this point we've found the correct place to add the new
6788 entry. So add it and update the linked lists as appropriate. */
6789 if (prev_chain_pointer)
6790 {
6791 chain_entry->sd_next = chain_pointer;
6792 prev_chain_pointer->sd_next = chain_entry;
6793 }
6794 else
6795 {
6796 space_dict_root = chain_entry;
6797 chain_entry->sd_next = chain_pointer;
6798 }
6799
6800 if (chain_entry->sd_next == NULL)
6801 space_dict_last = chain_entry;
6802 }
6803
6804 /* This is here to catch predefined spaces which do not get
6805 modified by the user's input. Another call is found at
6806 the bottom of pa_parse_space_stmt to handle cases where
6807 the user modifies a predefined space. */
6808#ifdef obj_set_section_attributes
6809 obj_set_section_attributes (seg, defined, private, sort, spnum);
6810#endif
6811
6812 return chain_entry;
6813}
6814
6815/* Create a new subspace NAME, with the appropriate flags as defined
6816 by the given parameters.
6817
6818 Add the new subspace to the subspace dictionary chain in numerical
6819 order as defined by the SORT entries. */
6820
6821static ssd_chain_struct *
6822create_new_subspace (space, name, loadable, code_only, common,
6823 dup_common, is_zero, sort, access, space_index,
6824 alignment, quadrant, seg)
6825 sd_chain_struct *space;
6826 char *name;
6827 int loadable, code_only, common, dup_common, is_zero;
6828 int sort;
6829 int access;
6830 int space_index;
6831 int alignment;
6832 int quadrant;
6833 asection *seg;
6834{
6835 ssd_chain_struct *chain_entry;
6836
6837 chain_entry = (ssd_chain_struct *) xmalloc (sizeof (ssd_chain_struct));
6838 if (!chain_entry)
6839 as_fatal (_("Out of memory: could not allocate new subspace chain entry: %s\n"), name);
6840
6841 SUBSPACE_NAME (chain_entry) = (char *) xmalloc (strlen (name) + 1);
6842 strcpy (SUBSPACE_NAME (chain_entry), name);
6843
6844 /* Initialize subspace_defined. When we hit a .subspace directive
6845 we'll set it to 1 which "locks-in" the subspace attributes. */
6846 SUBSPACE_DEFINED (chain_entry) = 0;
6847
49863f82 6848 chain_entry->ssd_subseg = 0;
252b5132
RH
6849 chain_entry->ssd_seg = seg;
6850 chain_entry->ssd_next = NULL;
6851
6852 /* Find spot for the new subspace based on its sort key. */
6853 if (space->sd_subspaces == NULL)
6854 space->sd_subspaces = chain_entry;
6855 else
6856 {
6857 ssd_chain_struct *chain_pointer;
6858 ssd_chain_struct *prev_chain_pointer;
6859
6860 chain_pointer = space->sd_subspaces;
6861 prev_chain_pointer = NULL;
6862
6863 while (chain_pointer)
6864 {
6865 prev_chain_pointer = chain_pointer;
6866 chain_pointer = chain_pointer->ssd_next;
6867 }
6868
6869 /* Now we have somewhere to put the new entry. Insert it and update
6870 the links. */
6871 if (prev_chain_pointer)
6872 {
6873 chain_entry->ssd_next = chain_pointer;
6874 prev_chain_pointer->ssd_next = chain_entry;
6875 }
6876 else
6877 {
6878 space->sd_subspaces = chain_entry;
6879 chain_entry->ssd_next = chain_pointer;
6880 }
6881 }
6882
6883#ifdef obj_set_subsection_attributes
6884 obj_set_subsection_attributes (seg, space->sd_seg, access,
6885 sort, quadrant);
6886#endif
6887
6888 return chain_entry;
6889}
6890
6891/* Update the information for the given subspace based upon the
6892 various arguments. Return the modified subspace chain entry. */
6893
6894static ssd_chain_struct *
6895update_subspace (space, name, loadable, code_only, common, dup_common, sort,
6896 zero, access, space_index, alignment, quadrant, section)
6897 sd_chain_struct *space;
6898 char *name;
6899 int loadable;
6900 int code_only;
6901 int common;
6902 int dup_common;
6903 int zero;
6904 int sort;
6905 int access;
6906 int space_index;
6907 int alignment;
6908 int quadrant;
6909 asection *section;
6910{
6911 ssd_chain_struct *chain_entry;
6912
6913 chain_entry = is_defined_subspace (name);
6914
6915#ifdef obj_set_subsection_attributes
6916 obj_set_subsection_attributes (section, space->sd_seg, access,
6917 sort, quadrant);
6918#endif
6919
6920 return chain_entry;
6921}
6922
6923/* Return the space chain entry for the space with the name NAME or
6924 NULL if no such space exists. */
6925
6926static sd_chain_struct *
6927is_defined_space (name)
6928 char *name;
6929{
6930 sd_chain_struct *chain_pointer;
6931
6932 for (chain_pointer = space_dict_root;
6933 chain_pointer;
6934 chain_pointer = chain_pointer->sd_next)
6935 {
6936 if (strcmp (SPACE_NAME (chain_pointer), name) == 0)
6937 return chain_pointer;
6938 }
6939
6940 /* No mapping from segment to space was found. Return NULL. */
6941 return NULL;
6942}
6943
6944/* Find and return the space associated with the given seg. If no mapping
6945 from the given seg to a space is found, then return NULL.
6946
6947 Unlike subspaces, the number of spaces is not expected to grow much,
6948 so a linear exhaustive search is OK here. */
6949
6950static sd_chain_struct *
6951pa_segment_to_space (seg)
6952 asection *seg;
6953{
6954 sd_chain_struct *space_chain;
6955
6956 /* Walk through each space looking for the correct mapping. */
6957 for (space_chain = space_dict_root;
6958 space_chain;
6959 space_chain = space_chain->sd_next)
6960 {
6961 if (space_chain->sd_seg == seg)
6962 return space_chain;
6963 }
6964
6965 /* Mapping was not found. Return NULL. */
6966 return NULL;
6967}
6968
6969/* Return the space chain entry for the subspace with the name NAME or
6970 NULL if no such subspace exists.
6971
6972 Uses a linear search through all the spaces and subspaces, this may
6973 not be appropriate if we ever being placing each function in its
6974 own subspace. */
6975
6976static ssd_chain_struct *
6977is_defined_subspace (name)
6978 char *name;
6979{
6980 sd_chain_struct *space_chain;
6981 ssd_chain_struct *subspace_chain;
6982
6983 /* Walk through each space. */
6984 for (space_chain = space_dict_root;
6985 space_chain;
6986 space_chain = space_chain->sd_next)
6987 {
6988 /* Walk through each subspace looking for a name which matches. */
6989 for (subspace_chain = space_chain->sd_subspaces;
6990 subspace_chain;
6991 subspace_chain = subspace_chain->ssd_next)
6992 if (strcmp (SUBSPACE_NAME (subspace_chain), name) == 0)
6993 return subspace_chain;
6994 }
6995
6996 /* Subspace wasn't found. Return NULL. */
6997 return NULL;
6998}
6999
7000/* Find and return the subspace associated with the given seg. If no
7001 mapping from the given seg to a subspace is found, then return NULL.
7002
7003 If we ever put each procedure/function within its own subspace
7004 (to make life easier on the compiler and linker), then this will have
7005 to become more efficient. */
7006
7007static ssd_chain_struct *
7008pa_subsegment_to_subspace (seg, subseg)
7009 asection *seg;
7010 subsegT subseg;
7011{
7012 sd_chain_struct *space_chain;
7013 ssd_chain_struct *subspace_chain;
7014
7015 /* Walk through each space. */
7016 for (space_chain = space_dict_root;
7017 space_chain;
7018 space_chain = space_chain->sd_next)
7019 {
7020 if (space_chain->sd_seg == seg)
7021 {
7022 /* Walk through each subspace within each space looking for
7023 the correct mapping. */
7024 for (subspace_chain = space_chain->sd_subspaces;
7025 subspace_chain;
7026 subspace_chain = subspace_chain->ssd_next)
7027 if (subspace_chain->ssd_subseg == (int) subseg)
7028 return subspace_chain;
7029 }
7030 }
7031
7032 /* No mapping from subsegment to subspace found. Return NULL. */
7033 return NULL;
7034}
7035
7036/* Given a number, try and find a space with the name number.
7037
7038 Return a pointer to a space dictionary chain entry for the space
7039 that was found or NULL on failure. */
7040
7041static sd_chain_struct *
7042pa_find_space_by_number (number)
7043 int number;
7044{
7045 sd_chain_struct *space_chain;
7046
7047 for (space_chain = space_dict_root;
7048 space_chain;
7049 space_chain = space_chain->sd_next)
7050 {
7051 if (SPACE_SPNUM (space_chain) == (unsigned int) number)
7052 return space_chain;
7053 }
7054
7055 /* No appropriate space found. Return NULL. */
7056 return NULL;
7057}
7058
7059/* Return the starting address for the given subspace. If the starting
7060 address is unknown then return zero. */
7061
7062static unsigned int
7063pa_subspace_start (space, quadrant)
7064 sd_chain_struct *space;
7065 int quadrant;
7066{
252b5132
RH
7067 /* FIXME. Assumes everyone puts read/write data at 0x4000000, this
7068 is not correct for the PA OSF1 port. */
7069 if ((strcmp (SPACE_NAME (space), "$PRIVATE$") == 0) && quadrant == 1)
7070 return 0x40000000;
7071 else if (space->sd_seg == data_section && quadrant == 1)
7072 return 0x40000000;
7073 else
7074 return 0;
252b5132
RH
7075 return 0;
7076}
7077
7078/* FIXME. Needs documentation. */
7079static int
7080pa_next_subseg (space)
7081 sd_chain_struct *space;
7082{
7083
7084 space->sd_last_subseg++;
7085 return space->sd_last_subseg;
7086}
49863f82 7087#endif
252b5132
RH
7088
7089/* Helper function for pa_stringer. Used to find the end of
7090 a string. */
7091
7092static unsigned int
7093pa_stringer_aux (s)
7094 char *s;
7095{
7096 unsigned int c = *s & CHAR_MASK;
7097
49863f82 7098#ifdef OBJ_SOM
252b5132
RH
7099 /* We must have a valid space and subspace. */
7100 pa_check_current_space_and_subspace ();
49863f82 7101#endif
252b5132
RH
7102
7103 switch (c)
7104 {
7105 case '\"':
7106 c = NOT_A_CHAR;
7107 break;
7108 default:
7109 break;
7110 }
7111 return c;
7112}
7113
7114/* Handle a .STRING type pseudo-op. */
7115
7116static void
7117pa_stringer (append_zero)
7118 int append_zero;
7119{
7120 char *s, num_buf[4];
7121 unsigned int c;
7122 int i;
7123
7124 /* Preprocess the string to handle PA-specific escape sequences.
7125 For example, \xDD where DD is a hexidecimal number should be
7126 changed to \OOO where OOO is an octal number. */
7127
7128 /* Skip the opening quote. */
7129 s = input_line_pointer + 1;
7130
7131 while (is_a_char (c = pa_stringer_aux (s++)))
7132 {
7133 if (c == '\\')
7134 {
7135 c = *s;
7136 switch (c)
7137 {
7138 /* Handle \x<num>. */
7139 case 'x':
7140 {
7141 unsigned int number;
7142 int num_digit;
7143 char dg;
7144 char *s_start = s;
7145
7146 /* Get pas the 'x'. */
7147 s++;
7148 for (num_digit = 0, number = 0, dg = *s;
7149 num_digit < 2
7150 && (isdigit (dg) || (dg >= 'a' && dg <= 'f')
7151 || (dg >= 'A' && dg <= 'F'));
7152 num_digit++)
7153 {
7154 if (isdigit (dg))
7155 number = number * 16 + dg - '0';
7156 else if (dg >= 'a' && dg <= 'f')
7157 number = number * 16 + dg - 'a' + 10;
7158 else
7159 number = number * 16 + dg - 'A' + 10;
7160
7161 s++;
7162 dg = *s;
7163 }
7164 if (num_digit > 0)
7165 {
7166 switch (num_digit)
7167 {
7168 case 1:
7169 sprintf (num_buf, "%02o", number);
7170 break;
7171 case 2:
7172 sprintf (num_buf, "%03o", number);
7173 break;
7174 }
7175 for (i = 0; i <= num_digit; i++)
7176 s_start[i] = num_buf[i];
7177 }
7178 break;
7179 }
7180 /* This might be a "\"", skip over the escaped char. */
7181 default:
7182 s++;
7183 break;
7184 }
7185 }
7186 }
7187 stringer (append_zero);
7188 pa_undefine_label ();
7189}
7190
7191/* Handle a .VERSION pseudo-op. */
7192
7193static void
7194pa_version (unused)
7195 int unused;
7196{
7197 obj_version (0);
7198 pa_undefine_label ();
7199}
7200
7201#ifdef OBJ_SOM
7202
7203/* Handle a .COMPILER pseudo-op. */
7204
7205static void
7206pa_compiler (unused)
7207 int unused;
7208{
7209 obj_som_compiler (0);
7210 pa_undefine_label ();
7211}
7212
7213#endif
7214
7215/* Handle a .COPYRIGHT pseudo-op. */
7216
7217static void
7218pa_copyright (unused)
7219 int unused;
7220{
7221 obj_copyright (0);
7222 pa_undefine_label ();
7223}
7224
7225/* Just like a normal cons, but when finished we have to undefine
7226 the latest space label. */
7227
7228static void
7229pa_cons (nbytes)
7230 int nbytes;
7231{
7232 cons (nbytes);
7233 pa_undefine_label ();
7234}
7235
7236/* Switch to the data space. As usual delete our label. */
7237
7238static void
7239pa_data (unused)
7240 int unused;
7241{
49863f82 7242#ifdef OBJ_SOM
252b5132
RH
7243 current_space = is_defined_space ("$PRIVATE$");
7244 current_subspace
7245 = pa_subsegment_to_subspace (current_space->sd_seg, 0);
49863f82 7246#endif
252b5132
RH
7247 s_data (0);
7248 pa_undefine_label ();
7249}
7250
7251/* Like float_cons, but we need to undefine our label. */
7252
7253static void
7254pa_float_cons (float_type)
7255 int float_type;
7256{
7257 float_cons (float_type);
7258 pa_undefine_label ();
7259}
7260
7261/* Like s_fill, but delete our label when finished. */
7262
7263static void
7264pa_fill (unused)
7265 int unused;
7266{
49863f82 7267#ifdef OBJ_SOM
252b5132
RH
7268 /* We must have a valid space and subspace. */
7269 pa_check_current_space_and_subspace ();
49863f82 7270#endif
252b5132
RH
7271
7272 s_fill (0);
7273 pa_undefine_label ();
7274}
7275
7276/* Like lcomm, but delete our label when finished. */
7277
7278static void
7279pa_lcomm (needs_align)
7280 int needs_align;
7281{
49863f82 7282#ifdef OBJ_SOM
252b5132
RH
7283 /* We must have a valid space and subspace. */
7284 pa_check_current_space_and_subspace ();
49863f82 7285#endif
252b5132
RH
7286
7287 s_lcomm (needs_align);
7288 pa_undefine_label ();
7289}
7290
7291/* Like lsym, but delete our label when finished. */
7292
7293static void
7294pa_lsym (unused)
7295 int unused;
7296{
49863f82 7297#ifdef OBJ_SOM
252b5132
RH
7298 /* We must have a valid space and subspace. */
7299 pa_check_current_space_and_subspace ();
49863f82 7300#endif
252b5132
RH
7301
7302 s_lsym (0);
7303 pa_undefine_label ();
7304}
7305
7306/* Switch to the text space. Like s_text, but delete our
7307 label when finished. */
7308static void
7309pa_text (unused)
7310 int unused;
7311{
49863f82 7312#ifdef OBJ_SOM
252b5132
RH
7313 current_space = is_defined_space ("$TEXT$");
7314 current_subspace
7315 = pa_subsegment_to_subspace (current_space->sd_seg, 0);
49863f82 7316#endif
252b5132
RH
7317
7318 s_text (0);
7319 pa_undefine_label ();
7320}
7321
7322/* On the PA relocations which involve function symbols must not be
7323 adjusted. This so that the linker can know when/how to create argument
7324 relocation stubs for indirect calls and calls to static functions.
7325
7326 "T" field selectors create DLT relative fixups for accessing
7327 globals and statics in PIC code; each DLT relative fixup creates
7328 an entry in the DLT table. The entries contain the address of
7329 the final target (eg accessing "foo" would create a DLT entry
7330 with the address of "foo").
7331
7332 Unfortunately, the HP linker doesn't take into account any addend
7333 when generating the DLT; so accessing $LIT$+8 puts the address of
7334 $LIT$ into the DLT rather than the address of $LIT$+8.
7335
7336 The end result is we can't perform relocation symbol reductions for
7337 any fixup which creates entries in the DLT (eg they use "T" field
7338 selectors).
7339
7340 Reject reductions involving symbols with external scope; such
7341 reductions make life a living hell for object file editors.
7342
7343 FIXME. Also reject R_HPPA relocations which are 32bits wide in
7344 the code space. The SOM BFD backend doesn't know how to pull the
7345 right bits out of an instruction. */
7346
7347int
7348hppa_fix_adjustable (fixp)
7349 fixS *fixp;
7350{
7351 struct hppa_fix_struct *hppa_fix;
7352
7353 hppa_fix = (struct hppa_fix_struct *) fixp->tc_fix_data;
7354
7355#ifdef OBJ_SOM
7356 /* Reject reductions of symbols in 32bit relocs. */
7357 if (fixp->fx_r_type == R_HPPA && hppa_fix->fx_r_format == 32)
7358 return 0;
7359
7360 /* Reject reductions of symbols in sym1-sym2 expressions when
7361 the fixup will occur in a CODE subspace.
7362
7363 XXX FIXME: Long term we probably want to reject all of these;
7364 for example reducing in the debug section would lose if we ever
7365 supported using the optimizing hp linker. */
7366 if (fixp->fx_addsy
7367 && fixp->fx_subsy
7368 && (hppa_fix->segment->flags & SEC_CODE))
7369 {
7370 /* Apparently sy_used_in_reloc never gets set for sub symbols. */
398e8c25 7371 symbol_mark_used_in_reloc (fixp->fx_subsy);
252b5132
RH
7372 return 0;
7373 }
7374
7375 /* We can't adjust any relocs that use LR% and RR% field selectors.
7376 That confuses the HP linker. */
7377 if (hppa_fix->fx_r_field == e_lrsel
7378 || hppa_fix->fx_r_field == e_rrsel
7379 || hppa_fix->fx_r_field == e_nlrsel)
7380 return 0;
7381#endif
7382
7383 /* Reject reductions of symbols in DLT relative relocs,
7384 relocations with plabels. */
7385 if (hppa_fix->fx_r_field == e_tsel
7386 || hppa_fix->fx_r_field == e_ltsel
7387 || hppa_fix->fx_r_field == e_rtsel
7388 || hppa_fix->fx_r_field == e_psel
7389 || hppa_fix->fx_r_field == e_rpsel
7390 || hppa_fix->fx_r_field == e_lpsel)
7391 return 0;
7392
a0f75b47 7393 if (fixp->fx_addsy && S_IS_EXTERNAL (fixp->fx_addsy))
252b5132
RH
7394 return 0;
7395
7396 /* Reject absolute calls (jumps). */
7397 if (hppa_fix->fx_r_type == R_HPPA_ABS_CALL)
7398 return 0;
7399
7400 /* Reject reductions of function symbols. */
a0f75b47 7401 if (fixp->fx_addsy == 0 || ! S_IS_FUNCTION (fixp->fx_addsy))
252b5132
RH
7402 return 1;
7403
7404 return 0;
7405}
7406
7407/* Return nonzero if the fixup in FIXP will require a relocation,
7408 even it if appears that the fixup could be completely handled
7409 within GAS. */
7410
7411int
7412hppa_force_relocation (fixp)
7413 fixS *fixp;
7414{
7415 struct hppa_fix_struct *hppa_fixp;
7416 int distance;
7417
7418 hppa_fixp = (struct hppa_fix_struct *) fixp->tc_fix_data;
7419#ifdef OBJ_SOM
7420 if (fixp->fx_r_type == R_HPPA_ENTRY || fixp->fx_r_type == R_HPPA_EXIT
7421 || fixp->fx_r_type == R_HPPA_BEGIN_BRTAB
7422 || fixp->fx_r_type == R_HPPA_END_BRTAB
7423 || fixp->fx_r_type == R_HPPA_BEGIN_TRY
7424 || fixp->fx_r_type == R_HPPA_END_TRY
7425 || (fixp->fx_addsy != NULL && fixp->fx_subsy != NULL
7426 && (hppa_fixp->segment->flags & SEC_CODE) != 0))
7427 return 1;
7428#endif
7429
7430#define arg_reloc_stub_needed(CALLER, CALLEE) \
7431 ((CALLEE) && (CALLER) && ((CALLEE) != (CALLER)))
7432
49863f82 7433#ifdef OBJ_SOM
252b5132
RH
7434 /* It is necessary to force PC-relative calls/jumps to have a relocation
7435 entry if they're going to need either a argument relocation or long
7436 call stub. FIXME. Can't we need the same for absolute calls? */
7437 if (fixp->fx_pcrel && fixp->fx_addsy
7438 && (arg_reloc_stub_needed ((long) ((obj_symbol_type *)
a0f75b47
ILT
7439 symbol_get_bfdsym (fixp->fx_addsy))->tc_data.ap.hppa_arg_reloc,
7440 hppa_fixp->fx_arg_reloc)))
252b5132 7441 return 1;
49863f82 7442#endif
252b5132
RH
7443 distance = (fixp->fx_offset + S_GET_VALUE (fixp->fx_addsy)
7444 - md_pcrel_from (fixp));
7445 /* Now check and see if we're going to need a long-branch stub. */
7446 if (fixp->fx_r_type == R_HPPA_PCREL_CALL
7447 && (distance > 262143 || distance < -262144))
7448 return 1;
7449
7450 if (fixp->fx_r_type == R_HPPA_ABS_CALL)
7451 return 1;
7452#undef arg_reloc_stub_needed
7453
7454 /* No need (yet) to force another relocations to be emitted. */
7455 return 0;
7456}
7457
7458/* Now for some ELF specific code. FIXME. */
7459#ifdef OBJ_ELF
7460/* Mark the end of a function so that it's possible to compute
7461 the size of the function in hppa_elf_final_processing. */
7462
7463static void
7464hppa_elf_mark_end_of_function ()
7465{
7466 /* ELF does not have EXIT relocations. All we do is create a
7467 temporary symbol marking the end of the function. */
7468 char *name = (char *)
7469 xmalloc (strlen ("L$\001end_") +
7470 strlen (S_GET_NAME (last_call_info->start_symbol)) + 1);
7471
7472 if (name)
7473 {
7474 symbolS *symbolP;
7475
7476 strcpy (name, "L$\001end_");
7477 strcat (name, S_GET_NAME (last_call_info->start_symbol));
7478
7479 /* If we have a .exit followed by a .procend, then the
7480 symbol will have already been defined. */
7481 symbolP = symbol_find (name);
7482 if (symbolP)
7483 {
7484 /* The symbol has already been defined! This can
7485 happen if we have a .exit followed by a .procend.
7486
7487 This is *not* an error. All we want to do is free
7488 the memory we just allocated for the name and continue. */
7489 xfree (name);
7490 }
7491 else
7492 {
7493 /* symbol value should be the offset of the
7494 last instruction of the function */
7495 symbolP = symbol_new (name, now_seg, (valueT) (frag_now_fix () - 4),
7496 frag_now);
7497
7498 assert (symbolP);
a0f75b47 7499 S_CLEAR_EXTERNAL (symbolP);
252b5132
RH
7500 symbol_table_insert (symbolP);
7501 }
7502
7503 if (symbolP)
7504 last_call_info->end_symbol = symbolP;
7505 else
7506 as_bad (_("Symbol '%s' could not be created."), name);
7507
7508 }
7509 else
7510 as_bad (_("No memory for symbol name."));
7511
7512}
7513
7514/* For ELF, this function serves one purpose: to setup the st_size
7515 field of STT_FUNC symbols. To do this, we need to scan the
7516 call_info structure list, determining st_size in by taking the
7517 difference in the address of the beginning/end marker symbols. */
7518
7519void
7520elf_hppa_final_processing ()
7521{
7522 struct call_info *call_info_pointer;
7523
7524 for (call_info_pointer = call_info_root;
7525 call_info_pointer;
7526 call_info_pointer = call_info_pointer->ci_next)
7527 {
7528 elf_symbol_type *esym
a0f75b47
ILT
7529 = ((elf_symbol_type *)
7530 symbol_get_bfdsym (call_info_pointer->start_symbol));
252b5132
RH
7531 esym->internal_elf_sym.st_size =
7532 S_GET_VALUE (call_info_pointer->end_symbol)
7533 - S_GET_VALUE (call_info_pointer->start_symbol) + 4;
7534 }
7535}
7536#endif
2d93dcc4
JL
7537
7538#ifdef OBJ_ELF
7539pa_end_of_source ()
7540{
7541 if (debug_type == DEBUG_DWARF2)
7542 dwarf2_finish ();
7543}
7544#endif
This page took 0.34532 seconds and 4 git commands to generate.