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