projects / deliverable / binutils-gdb.git / blob
? search:


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