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