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