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