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