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