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