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