1/* Convert RTL to assembler code and output it, for GNU compiler.
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
4
5This file is part of GCC.
6
7GCC is free software; you can redistribute it and/or modify it under
8the terms of the GNU General Public License as published by the Free
9Software Foundation; either version 2, or (at your option) any later
10version.
11
--- 29 unchanged lines hidden (view full) ---
41 (the one that tests the condition codes) to be modified.
42
43 The code for the function prologue and epilogue are generated
44 directly in assembler by the target functions function_prologue and
45 function_epilogue. Those instructions never exist as rtl. */
46
47#include "config.h"
48#include "system.h"
49
50#include "tree.h"
51#include "rtl.h"
52#include "tm_p.h"
53#include "regs.h"
54#include "insn-config.h"
55#include "insn-attr.h"
56#include "recog.h"
--- 6 unchanged lines hidden (view full) ---
63#include "function.h"
64#include "toplev.h"
65#include "reload.h"
66#include "intl.h"
67#include "basic-block.h"
68#include "target.h"
69#include "debug.h"
70#include "expr.h"
71#include "profile.h"
72#include "cfglayout.h"
73
74#ifdef XCOFF_DEBUGGING_INFO
75#include "xcoffout.h" /* Needed for external data
76 declarations for e.g. AIX 4.x. */
77#endif
78
79#if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
80#include "dwarf2out.h"
81#endif
82
83/* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
84 null default for it to save conditionalization later. */
85#ifndef CC_STATUS_INIT
86#define CC_STATUS_INIT
87#endif
88
89/* How to start an assembler comment. */
90#ifndef ASM_COMMENT_START
--- 10 unchanged lines hidden (view full) ---
101#endif
102
103#if defined(READONLY_DATA_SECTION) || defined(READONLY_DATA_SECTION_ASM_OP)
104#define HAVE_READONLY_DATA_SECTION 1
105#else
106#define HAVE_READONLY_DATA_SECTION 0
107#endif
108
109/* Last insn processed by final_scan_insn. */
110static rtx debug_insn;
111rtx current_output_insn;
112
113/* Line number of last NOTE. */
114static int last_linenum;
115
116/* Highest line number in current block. */
--- 14 unchanged lines hidden (view full) ---
131
132/* Number of operands of this insn, for an `asm' with operands. */
133static unsigned int insn_noperands;
134
135/* Compare optimization flag. */
136
137static rtx last_ignored_compare = 0;
138
139/* Flag indicating this insn is the start of a new basic block. */
140
141static int new_block = 1;
142
143/* Assign a unique number to each insn that is output.
144 This can be used to generate unique local labels. */
145
146static int insn_counter = 0;
147
148#ifdef HAVE_cc0
149/* This variable contains machine-dependent flags (defined in tm.h)
150 set and examined by output routines
--- 13 unchanged lines hidden (view full) ---
164 In life_analysis, or in stupid_life_analysis, this is set
165 up to record the hard regs used explicitly. Reload adds
166 in the hard regs used for holding pseudo regs. Final uses
167 it to generate the code in the function prologue and epilogue
168 to save and restore registers as needed. */
169
170char regs_ever_live[FIRST_PSEUDO_REGISTER];
171
172/* Nonzero means current function must be given a frame pointer.
173 Set in stmt.c if anything is allocated on the stack there.
174 Set in reload1.c if anything is allocated on the stack there. */
175
176int frame_pointer_needed;
177
178/* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
179
180static int block_depth;
181
182/* Nonzero if have enabled APP processing of our assembler output. */
--- 6 unchanged lines hidden (view full) ---
189rtx final_sequence;
190
191#ifdef ASSEMBLER_DIALECT
192
193/* Number of the assembler dialect to use, starting at 0. */
194static int dialect_number;
195#endif
196
197/* Indexed by line number, nonzero if there is a note for that line. */
198
199static char *line_note_exists;
200
201#ifdef HAVE_conditional_execution
202/* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
203rtx current_insn_predicate;
204#endif
205
206struct function_list
207{
208 struct function_list *next; /* next function */
209 const char *name; /* function name */
210 long cfg_checksum; /* function checksum */
211 long count_edges; /* number of intrumented edges in this function */
212};
213
214static struct function_list *functions_head = 0;
215static struct function_list **functions_tail = &functions_head;
216
217#ifdef HAVE_ATTR_length
218static int asm_insn_count PARAMS ((rtx));
219#endif
220static void profile_function PARAMS ((FILE *));
221static void profile_after_prologue PARAMS ((FILE *));
222static void notice_source_line PARAMS ((rtx));
223static rtx walk_alter_subreg PARAMS ((rtx *));
224static void output_asm_name PARAMS ((void));
225static void output_alternate_entry_point PARAMS ((FILE *, rtx));
226static tree get_mem_expr_from_op PARAMS ((rtx, int *));
227static void output_asm_operand_names PARAMS ((rtx *, int *, int));
228static void output_operand PARAMS ((rtx, int));
229#ifdef LEAF_REGISTERS
230static void leaf_renumber_regs PARAMS ((rtx));
231#endif
232#ifdef HAVE_cc0
233static int alter_cond PARAMS ((rtx));
234#endif
235#ifndef ADDR_VEC_ALIGN
236static int final_addr_vec_align PARAMS ((rtx));
237#endif
238#ifdef HAVE_ATTR_length
239static int align_fuzz PARAMS ((rtx, rtx, int, unsigned));
240#endif
241
242/* Initialize data in final at the beginning of a compilation. */
243
244void
245init_final (filename)
246 const char *filename ATTRIBUTE_UNUSED;
247{
248 app_on = 0;
249 final_sequence = 0;
250
251#ifdef ASSEMBLER_DIALECT
252 dialect_number = ASSEMBLER_DIALECT;
253#endif
254}
255
256/* Called at end of source file,
257 to output the arc-profiling table for this entire compilation. */
258
259void
260end_final (filename)
261 const char *filename;
262{
263 if (profile_arc_flag && profile_info.count_instrumented_edges)
264 {
265 char name[20];
266 tree string_type, string_cst;
267 tree structure_decl, structure_value, structure_pointer_type;
268 tree field_decl, decl_chain, value_chain;
269 tree sizeof_field_value, domain_type;
270
271 /* Build types. */
272 string_type = build_pointer_type (char_type_node);
273
274 /* Libgcc2 bb structure. */
275 structure_decl = make_node (RECORD_TYPE);
276 structure_pointer_type = build_pointer_type (structure_decl);
277
278 /* Output the main header, of 7 words:
279 0: 1 if this file is initialized, else 0.
280 1: address of file name (LPBX1).
281 2: address of table of counts (LPBX2).
282 3: number of counts in the table.
283 4: always 0, libgcc2 uses this as a pointer to next ``struct bb''
284
285 The following are GNU extensions:
286
287 5: Number of bytes in this header.
288 6: address of table of function checksums (LPBX7). */
289
290 /* The zero word. */
291 decl_chain =
292 build_decl (FIELD_DECL, get_identifier ("zero_word"),
293 long_integer_type_node);
294 value_chain = build_tree_list (decl_chain,
295 convert (long_integer_type_node,
296 integer_zero_node));
297
298 /* Address of filename. */
299 {
300 char *cwd, *da_filename;
301 int da_filename_len;
302
303 field_decl =
304 build_decl (FIELD_DECL, get_identifier ("filename"), string_type);
305 TREE_CHAIN (field_decl) = decl_chain;
306 decl_chain = field_decl;
307
308 cwd = getpwd ();
309 da_filename_len = strlen (filename) + strlen (cwd) + 4 + 1;
310 da_filename = (char *) alloca (da_filename_len);
311 strcpy (da_filename, cwd);
312 strcat (da_filename, "/");
313 strcat (da_filename, filename);
314 strcat (da_filename, ".da");
315 da_filename_len = strlen (da_filename);
316 string_cst = build_string (da_filename_len + 1, da_filename);
317 domain_type = build_index_type (build_int_2 (da_filename_len, 0));
318 TREE_TYPE (string_cst)
319 = build_array_type (char_type_node, domain_type);
320 value_chain = tree_cons (field_decl,
321 build1 (ADDR_EXPR, string_type, string_cst),
322 value_chain);
323 }
324
325 /* Table of counts. */
326 {
327 tree gcov_type_type = make_unsigned_type (GCOV_TYPE_SIZE);
328 tree gcov_type_pointer_type = build_pointer_type (gcov_type_type);
329 tree domain_tree
330 = build_index_type (build_int_2 (profile_info.
331 count_instrumented_edges - 1, 0));
332 tree gcov_type_array_type
333 = build_array_type (gcov_type_type, domain_tree);
334 tree gcov_type_array_pointer_type
335 = build_pointer_type (gcov_type_array_type);
336 tree counts_table;
337
338 field_decl =
339 build_decl (FIELD_DECL, get_identifier ("counts"),
340 gcov_type_pointer_type);
341 TREE_CHAIN (field_decl) = decl_chain;
342 decl_chain = field_decl;
343
344 /* No values. */
345 counts_table
346 = build (VAR_DECL, gcov_type_array_type, NULL_TREE, NULL_TREE);
347 TREE_STATIC (counts_table) = 1;
348 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
349 DECL_NAME (counts_table) = get_identifier (name);
350 assemble_variable (counts_table, 0, 0, 0);
351
352 value_chain = tree_cons (field_decl,
353 build1 (ADDR_EXPR,
354 gcov_type_array_pointer_type,
355 counts_table), value_chain);
356 }
357
358 /* Count of the # of instrumented arcs. */
359 field_decl
360 = build_decl (FIELD_DECL, get_identifier ("ncounts"),
361 long_integer_type_node);
362 TREE_CHAIN (field_decl) = decl_chain;
363 decl_chain = field_decl;
364
365 value_chain = tree_cons (field_decl,
366 convert (long_integer_type_node,
367 build_int_2 (profile_info.
368 count_instrumented_edges,
369 0)), value_chain);
370 /* Pointer to the next bb. */
371 field_decl
372 = build_decl (FIELD_DECL, get_identifier ("next"),
373 structure_pointer_type);
374 TREE_CHAIN (field_decl) = decl_chain;
375 decl_chain = field_decl;
376
377 value_chain = tree_cons (field_decl, null_pointer_node, value_chain);
378
379 /* sizeof(struct bb). We'll set this after entire structure
380 is laid out. */
381 field_decl
382 = build_decl (FIELD_DECL, get_identifier ("sizeof_bb"),
383 long_integer_type_node);
384 TREE_CHAIN (field_decl) = decl_chain;
385 decl_chain = field_decl;
386
387 sizeof_field_value = tree_cons (field_decl, NULL, value_chain);
388 value_chain = sizeof_field_value;
389
390 /* struct bb_function []. */
391 {
392 struct function_list *item;
393 int num_nodes;
394 tree checksum_field, arc_count_field, name_field;
395 tree domain;
396 tree array_value_chain = NULL_TREE;
397 tree bb_fn_struct_type;
398 tree bb_fn_struct_array_type;
399 tree bb_fn_struct_array_pointer_type;
400 tree bb_fn_struct_pointer_type;
401 tree field_value, field_value_chain;
402
403 bb_fn_struct_type = make_node (RECORD_TYPE);
404
405 checksum_field = build_decl (FIELD_DECL, get_identifier ("checksum"),
406 long_integer_type_node);
407
408 arc_count_field
409 = build_decl (FIELD_DECL, get_identifier ("arc_count"),
410 integer_type_node);
411 TREE_CHAIN (checksum_field) = arc_count_field;
412
413 name_field
414 = build_decl (FIELD_DECL, get_identifier ("name"), string_type);
415 TREE_CHAIN (arc_count_field) = name_field;
416
417 TYPE_FIELDS (bb_fn_struct_type) = checksum_field;
418
419 num_nodes = 0;
420
421 for (item = functions_head; item != 0; item = item->next)
422 num_nodes++;
423
424 /* Note that the array contains a terminator, hence no - 1. */
425 domain = build_index_type (build_int_2 (num_nodes, 0));
426
427 bb_fn_struct_pointer_type = build_pointer_type (bb_fn_struct_type);
428 bb_fn_struct_array_type
429 = build_array_type (bb_fn_struct_type, domain);
430 bb_fn_struct_array_pointer_type
431 = build_pointer_type (bb_fn_struct_array_type);
432
433 layout_type (bb_fn_struct_type);
434 layout_type (bb_fn_struct_pointer_type);
435 layout_type (bb_fn_struct_array_type);
436 layout_type (bb_fn_struct_array_pointer_type);
437
438 for (item = functions_head; item != 0; item = item->next)
439 {
440 size_t name_len;
441
442 /* create constructor for structure. */
443 field_value_chain
444 = build_tree_list (checksum_field,
445 convert (long_integer_type_node,
446 build_int_2 (item->cfg_checksum, 0)));
447 field_value_chain
448 = tree_cons (arc_count_field,
449 convert (integer_type_node,
450 build_int_2 (item->count_edges, 0)),
451 field_value_chain);
452
453 name_len = strlen (item->name);
454 string_cst = build_string (name_len + 1, item->name);
455 domain_type = build_index_type (build_int_2 (name_len, 0));
456 TREE_TYPE (string_cst)
457 = build_array_type (char_type_node, domain_type);
458 field_value_chain = tree_cons (name_field,
459 build1 (ADDR_EXPR, string_type,
460 string_cst),
461 field_value_chain);
462
463 /* Add to chain. */
464 array_value_chain
465 = tree_cons (NULL_TREE, build (CONSTRUCTOR,
466 bb_fn_struct_type, NULL_TREE,
467 nreverse (field_value_chain)),
468 array_value_chain);
469 }
470
471 /* Add terminator. */
472 field_value = build_tree_list (arc_count_field,
473 convert (integer_type_node,
474 build_int_2 (-1, 0)));
475
476 array_value_chain = tree_cons (NULL_TREE,
477 build (CONSTRUCTOR, bb_fn_struct_type,
478 NULL_TREE, field_value),
479 array_value_chain);
480
481
482 /* Create constructor for array. */
483 field_decl
484 = build_decl (FIELD_DECL, get_identifier ("function_infos"),
485 bb_fn_struct_pointer_type);
486 value_chain = tree_cons (field_decl,
487 build1 (ADDR_EXPR,
488 bb_fn_struct_array_pointer_type,
489 build (CONSTRUCTOR,
490 bb_fn_struct_array_type,
491 NULL_TREE,
492 nreverse
493 (array_value_chain))),
494 value_chain);
495 TREE_CHAIN (field_decl) = decl_chain;
496 decl_chain = field_decl;
497 }
498
499 /* Finish structure. */
500 TYPE_FIELDS (structure_decl) = nreverse (decl_chain);
501 layout_type (structure_decl);
502
503 structure_value
504 = build (VAR_DECL, structure_decl, NULL_TREE, NULL_TREE);
505 DECL_INITIAL (structure_value)
506 = build (CONSTRUCTOR, structure_decl, NULL_TREE,
507 nreverse (value_chain));
508 TREE_STATIC (structure_value) = 1;
509 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 0);
510 DECL_NAME (structure_value) = get_identifier (name);
511
512 /* Size of this structure. */
513 TREE_VALUE (sizeof_field_value)
514 = convert (long_integer_type_node,
515 build_int_2 (int_size_in_bytes (structure_decl), 0));
516
517 /* Build structure. */
518 assemble_variable (structure_value, 0, 0, 0);
519 }
520}
521
522/* Default target function prologue and epilogue assembler output.
523
524 If not overridden for epilogue code, then the function body itself
525 contains return instructions wherever needed. */
526void
527default_function_pro_epilogue (file, size)
528 FILE *file ATTRIBUTE_UNUSED;
529 HOST_WIDE_INT size ATTRIBUTE_UNUSED;
530{
531}
532
533/* Default target hook that outputs nothing to a stream. */
534void
535no_asm_to_stream (file)
536 FILE *file ATTRIBUTE_UNUSED;
537{
538}
539
540/* Enable APP processing of subsequent output.
541 Used before the output from an `asm' statement. */
542
543void
544app_enable ()
545{
546 if (! app_on)
547 {
548 fputs (ASM_APP_ON, asm_out_file);
549 app_on = 1;
550 }
551}
552
553/* Disable APP processing of subsequent output.
554 Called from varasm.c before most kinds of output. */
555
556void
557app_disable ()
558{
559 if (app_on)
560 {
561 fputs (ASM_APP_OFF, asm_out_file);
562 app_on = 0;
563 }
564}
565
566/* Return the number of slots filled in the current
567 delayed branch sequence (we don't count the insn needing the
568 delay slot). Zero if not in a delayed branch sequence. */
569
570#ifdef DELAY_SLOTS
571int
572dbr_sequence_length ()
573{
574 if (final_sequence != 0)
575 return XVECLEN (final_sequence, 0) - 1;
576 else
577 return 0;
578}
579#endif
580
--- 36 unchanged lines hidden (view full) ---
617
618static rtx *uid_align;
619static int *uid_shuid;
620static struct label_alignment *label_align;
621
622/* Indicate that branch shortening hasn't yet been done. */
623
624void
625init_insn_lengths ()
626{
627 if (uid_shuid)
628 {
629 free (uid_shuid);
630 uid_shuid = 0;
631 }
632 if (insn_lengths)
633 {
--- 10 unchanged lines hidden (view full) ---
644 uid_align = 0;
645 }
646}
647
648/* Obtain the current length of an insn. If branch shortening has been done,
649 get its actual length. Otherwise, get its maximum length. */
650
651int
652get_attr_length (insn)
653 rtx insn ATTRIBUTE_UNUSED;
654{
655#ifdef HAVE_ATTR_length
656 rtx body;
657 int i;
658 int length = 0;
659
660 if (insn_lengths_max_uid > INSN_UID (insn))
661 return insn_lengths[INSN_UID (insn)];
--- 117 unchanged lines hidden (view full) ---
779#endif
780
781#ifndef JUMP_ALIGN_MAX_SKIP
782#define JUMP_ALIGN_MAX_SKIP align_jumps_max_skip
783#endif
784
785#ifndef ADDR_VEC_ALIGN
786static int
787final_addr_vec_align (addr_vec)
788 rtx addr_vec;
789{
790 int align = GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec)));
791
792 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
793 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
794 return exact_log2 (align);
795
796}
--- 13 unchanged lines hidden (view full) ---
810 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
811
812#define LABEL_TO_MAX_SKIP(LABEL) \
813 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
814
815/* For the benefit of port specific code do this also as a function. */
816
817int
818label_to_alignment (label)
819 rtx label;
820{
821 return LABEL_TO_ALIGNMENT (label);
822}
823
824#ifdef HAVE_ATTR_length
825/* The differences in addresses
826 between a branch and its target might grow or shrink depending on
827 the alignment the start insn of the range (the branch for a forward
--- 18 unchanged lines hidden (view full) ---
846 START and END might grow / shrink due to a different address for start
847 which changes the size of alignment insns between START and END.
848 KNOWN_ALIGN_LOG is the alignment known for START.
849 GROWTH should be ~0 if the objective is to compute potential code size
850 increase, and 0 if the objective is to compute potential shrink.
851 The return value is undefined for any other value of GROWTH. */
852
853static int
854align_fuzz (start, end, known_align_log, growth)
855 rtx start, end;
856 int known_align_log;
857 unsigned growth;
858{
859 int uid = INSN_UID (start);
860 rtx align_label;
861 int known_align = 1 << known_align_log;
862 int end_shuid = INSN_SHUID (end);
863 int fuzz = 0;
864
865 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
--- 22 unchanged lines hidden (view full) ---
888 branch shortening pass, minus a value to account for possible size
889 increase due to alignment. For a backward branch, it is the start
890 address of the branch as known from the current pass, plus a value
891 to account for possible size increase due to alignment.
892 NB.: Therefore, the maximum offset allowed for backward branches needs
893 to exclude the branch size. */
894
895int
896insn_current_reference_address (branch)
897 rtx branch;
898{
899 rtx dest, seq;
900 int seq_uid;
901
902 if (! INSN_ADDRESSES_SET_P ())
903 return 0;
904
905 seq = NEXT_INSN (PREV_INSN (branch));
--- 20 unchanged lines hidden (view full) ---
926 /* Backward branch. */
927 return (insn_current_address
928 + align_fuzz (dest, seq, length_unit_log, ~0));
929 }
930}
931#endif /* HAVE_ATTR_length */
932
933void
934compute_alignments ()
935{
936 int log, max_skip, max_log;
937 basic_block bb;
938
939 if (label_align)
940 {
941 free (label_align);
942 label_align = 0;
943 }
944
945 max_labelno = max_label_num ();
946 min_labelno = get_first_label_num ();
947 label_align = (struct label_alignment *)
948 xcalloc (max_labelno - min_labelno + 1, sizeof (struct label_alignment));
949
950 /* If not optimizing or optimizing for size, don't assign any alignments. */
951 if (! optimize || optimize_size)
952 return;
953
954 FOR_EACH_BB (bb)
955 {
956 rtx label = bb->head;
957 int fallthru_frequency = 0, branch_frequency = 0, has_fallthru = 0;
958 edge e;
959
960 if (GET_CODE (label) != CODE_LABEL)
961 continue;
962 max_log = LABEL_ALIGN (label);
963 max_skip = LABEL_ALIGN_MAX_SKIP;
964
965 for (e = bb->pred; e; e = e->pred_next)
966 {
967 if (e->flags & EDGE_FALLTHRU)
968 has_fallthru = 1, fallthru_frequency += EDGE_FREQUENCY (e);
--- 22 unchanged lines hidden (view full) ---
991 {
992 max_log = log;
993 max_skip = JUMP_ALIGN_MAX_SKIP;
994 }
995 }
996 /* In case block is frequent and reached mostly by non-fallthru edge,
997 align it. It is most likely a first block of loop. */
998 if (has_fallthru
999 && branch_frequency + fallthru_frequency > BB_FREQ_MAX / 10
1000 && branch_frequency > fallthru_frequency * 2)
1001 {
1002 log = LOOP_ALIGN (label);
1003 if (max_log < log)
1004 {
1005 max_log = log;
1006 max_skip = LOOP_ALIGN_MAX_SKIP;
1007 }
1008 }
1009 LABEL_TO_ALIGNMENT (label) = max_log;
1010 LABEL_TO_MAX_SKIP (label) = max_skip;
1011 }
1012}
1013
1014/* Make a pass over all insns and compute their actual lengths by shortening
1015 any branches of variable length if possible. */
1016
1017/* Give a default value for the lowest address in a function. */
1018
1019#ifndef FIRST_INSN_ADDRESS
1020#define FIRST_INSN_ADDRESS 0
1021#endif
1022
1023/* shorten_branches might be called multiple times: for example, the SH
1024 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
1025 In order to do this, it needs proper length information, which it obtains
1026 by calling shorten_branches. This cannot be collapsed with
1027 shorten_branches itself into a single pass unless we also want to integrate
1028 reorg.c, since the branch splitting exposes new instructions with delay
1029 slots. */
1030
1031void
1032shorten_branches (first)
1033 rtx first ATTRIBUTE_UNUSED;
1034{
1035 rtx insn;
1036 int max_uid;
1037 int i;
1038 int max_log;
1039 int max_skip;
1040#ifdef HAVE_ATTR_length
1041#define MAX_CODE_ALIGN 16
--- 4 unchanged lines hidden (view full) ---
1046 int uid;
1047 rtx align_tab[MAX_CODE_ALIGN];
1048
1049#endif
1050
1051 /* Compute maximum UID and allocate label_align / uid_shuid. */
1052 max_uid = get_max_uid ();
1053
1054 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1055
1056 if (max_labelno != max_label_num ())
1057 {
1058 int old = max_labelno;
1059 int n_labels;
1060 int n_old_labels;
1061
1062 max_labelno = max_label_num ();
1063
1064 n_labels = max_labelno - min_labelno + 1;
1065 n_old_labels = old - min_labelno + 1;
1066
1067 label_align = (struct label_alignment *) xrealloc
1068 (label_align, n_labels * sizeof (struct label_alignment));
1069
1070 /* Range of labels grows monotonically in the function. Abort here
1071 means that the initialization of array got lost. */
1072 if (n_old_labels > n_labels)
1073 abort ();
1074
1075 memset (label_align + n_old_labels, 0,
1076 (n_labels - n_old_labels) * sizeof (struct label_alignment));
--- 78 unchanged lines hidden (view full) ---
1155 }
1156 break;
1157 }
1158 }
1159 }
1160#ifdef HAVE_ATTR_length
1161
1162 /* Allocate the rest of the arrays. */
1163 insn_lengths = (int *) xmalloc (max_uid * sizeof (*insn_lengths));
1164 insn_lengths_max_uid = max_uid;
1165 /* Syntax errors can lead to labels being outside of the main insn stream.
1166 Initialize insn_addresses, so that we get reproducible results. */
1167 INSN_ADDRESSES_ALLOC (max_uid);
1168
1169 varying_length = (char *) xcalloc (max_uid, sizeof (char));
1170
1171 /* Initialize uid_align. We scan instructions
1172 from end to start, and keep in align_tab[n] the last seen insn
1173 that does an alignment of at least n+1, i.e. the successor
1174 in the alignment chain for an insn that does / has a known
1175 alignment of n. */
1176 uid_align = (rtx *) xcalloc (max_uid, sizeof *uid_align);
1177
1178 for (i = MAX_CODE_ALIGN; --i >= 0;)
1179 align_tab[i] = NULL_RTX;
1180 seq = get_last_insn ();
1181 for (; seq; seq = PREV_INSN (seq))
1182 {
1183 int uid = INSN_UID (seq);
1184 int log;
--- 60 unchanged lines hidden (view full) ---
1245 flags.min_after_base = min > rel;
1246 flags.max_after_base = max > rel;
1247 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1248 }
1249 }
1250#endif /* CASE_VECTOR_SHORTEN_MODE */
1251
1252 /* Compute initial lengths, addresses, and varying flags for each insn. */
1253 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1254 insn != 0;
1255 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1256 {
1257 uid = INSN_UID (insn);
1258
1259 insn_lengths[uid] = 0;
1260
1261 if (GET_CODE (insn) == CODE_LABEL)
--- 84 unchanged lines hidden (view full) ---
1346 /* Now loop over all the insns finding varying length insns. For each,
1347 get the current insn length. If it has changed, reflect the change.
1348 When nothing changes for a full pass, we are done. */
1349
1350 while (something_changed)
1351 {
1352 something_changed = 0;
1353 insn_current_align = MAX_CODE_ALIGN - 1;
1354 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1355 insn != 0;
1356 insn = NEXT_INSN (insn))
1357 {
1358 int new_length;
1359#ifdef ADJUST_INSN_LENGTH
1360 int tmp_length;
1361#endif
1362 int length_align;
--- 217 unchanged lines hidden (view full) ---
1580}
1581
1582#ifdef HAVE_ATTR_length
1583/* Given the body of an INSN known to be generated by an ASM statement, return
1584 the number of machine instructions likely to be generated for this insn.
1585 This is used to compute its length. */
1586
1587static int
1588asm_insn_count (body)
1589 rtx body;
1590{
1591 const char *template;
1592 int count = 1;
1593
1594 if (GET_CODE (body) == ASM_INPUT)
1595 template = XSTR (body, 0);
1596 else
1597 template = decode_asm_operands (body, NULL, NULL, NULL, NULL);
--- 12 unchanged lines hidden (view full) ---
1610 assembler pseudo-ops have already been output in `assemble_start_function'.
1611
1612 FIRST is the first insn of the rtl for the function being compiled.
1613 FILE is the file to write assembler code to.
1614 OPTIMIZE is nonzero if we should eliminate redundant
1615 test and compare insns. */
1616
1617void
1618final_start_function (first, file, optimize)
1619 rtx first;
1620 FILE *file;
1621 int optimize ATTRIBUTE_UNUSED;
1622{
1623 block_depth = 0;
1624
1625 this_is_asm_operands = 0;
1626
1627#ifdef NON_SAVING_SETJMP
1628 /* A function that calls setjmp should save and restore all the
1629 call-saved registers on a system where longjmp clobbers them. */
1630 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1631 {
1632 int i;
1633
1634 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1635 if (!call_used_regs[i])
1636 regs_ever_live[i] = 1;
1637 }
1638#endif
1639
1640 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1641 notice_source_line (first);
1642 high_block_linenum = high_function_linenum = last_linenum;
1643
1644 (*debug_hooks->begin_prologue) (last_linenum, last_filename);
1645
1646#if defined (DWARF2_UNWIND_INFO) || defined (IA64_UNWIND_INFO)
1647 if (write_symbols != DWARF2_DEBUG && write_symbols != VMS_AND_DWARF2_DEBUG)
1648 dwarf2out_begin_prologue (0, NULL);
1649#endif
--- 15 unchanged lines hidden (view full) ---
1665 dwarf2out_frame_debug (NULL_RTX);
1666#endif
1667
1668 /* If debugging, assign block numbers to all of the blocks in this
1669 function. */
1670 if (write_symbols)
1671 {
1672 remove_unnecessary_notes ();
1673 scope_to_insns_finalize ();
1674 number_blocks (current_function_decl);
1675 /* We never actually put out begin/end notes for the top-level
1676 block in the function. But, conceptually, that block is
1677 always needed. */
1678 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl)) = 1;
1679 }
1680
1681 /* First output the function prologue: code to set up the stack frame. */
1682 (*targetm.asm_out.function_prologue) (file, get_frame_size ());
1683
1684 /* If the machine represents the prologue as RTL, the profiling code must
1685 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1686#ifdef HAVE_prologue
1687 if (! HAVE_prologue)
1688#endif
1689 profile_after_prologue (file);
1690}
1691
1692static void
1693profile_after_prologue (file)
1694 FILE *file ATTRIBUTE_UNUSED;
1695{
1696#ifndef PROFILE_BEFORE_PROLOGUE
1697 if (current_function_profile)
1698 profile_function (file);
1699#endif /* not PROFILE_BEFORE_PROLOGUE */
1700}
1701
1702static void
1703profile_function (file)
1704 FILE *file ATTRIBUTE_UNUSED;
1705{
1706#ifndef NO_PROFILE_COUNTERS
1707 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1708#endif
1709#if defined(ASM_OUTPUT_REG_PUSH)
1710#if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1711 int sval = current_function_returns_struct;
1712#endif
1713#if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1714 int cxt = current_function_needs_context;
1715#endif
1716#endif /* ASM_OUTPUT_REG_PUSH */
1717
1718#ifndef NO_PROFILE_COUNTERS
1719 data_section ();
1720 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1721 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", current_function_funcdef_no);
1722 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, align, 1);
1723#endif
1724
1725 function_section (current_function_decl);
1726
1727#if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1728 if (sval)
1729 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1730#else
1731#if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1732 if (sval)
1733 {
1734 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1735 }
1736#endif
1737#endif
1738
1739#if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1740 if (cxt)
1741 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1742#else
1743#if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1744 if (cxt)
1745 {
--- 11 unchanged lines hidden (view full) ---
1757#if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1758 if (cxt)
1759 {
1760 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1761 }
1762#endif
1763#endif
1764
1765#if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1766 if (sval)
1767 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1768#else
1769#if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1770 if (sval)
1771 {
1772 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1773 }
1774#endif
1775#endif
1776}
1777
1778/* Output assembler code for the end of a function.
1779 For clarity, args are same as those of `final_start_function'
1780 even though not all of them are needed. */
1781
1782void
1783final_end_function ()
1784{
1785 app_disable ();
1786
1787 (*debug_hooks->end_function) (high_function_linenum);
1788
1789 /* Finally, output the function epilogue:
1790 code to restore the stack frame and return to the caller. */
1791 (*targetm.asm_out.function_epilogue) (asm_out_file, get_frame_size ());
--- 15 unchanged lines hidden (view full) ---
1807 just scanning as if we were outputting.
1808 Prescanning deletes and rearranges insns just like ordinary output.
1809 PRESCAN is -2 if we are outputting after having prescanned.
1810 In this case, don't try to delete or rearrange insns
1811 because that has already been done.
1812 Prescanning is done only on certain machines. */
1813
1814void
1815final (first, file, optimize, prescan)
1816 rtx first;
1817 FILE *file;
1818 int optimize;
1819 int prescan;
1820{
1821 rtx insn;
1822 int max_line = 0;
1823 int max_uid = 0;
1824
1825 last_ignored_compare = 0;
1826 new_block = 1;
1827
1828 /* Make a map indicating which line numbers appear in this function.
1829 When producing SDB debugging info, delete troublesome line number
1830 notes from inlined functions in other files as well as duplicate
1831 line number notes. */
1832#ifdef SDB_DEBUGGING_INFO
1833 if (write_symbols == SDB_DEBUG)
1834 {
1835 rtx last = 0;
1836 for (insn = first; insn; insn = NEXT_INSN (insn))
1837 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1838 {
1839 if ((RTX_INTEGRATED_P (insn)
1840 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1841 || (last != 0
1842 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1843 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1844 {
1845 delete_insn (insn); /* Use delete_note. */
1846 continue;
1847 }
1848 last = insn;
1849 if (NOTE_LINE_NUMBER (insn) > max_line)
1850 max_line = NOTE_LINE_NUMBER (insn);
1851 }
1852 }
1853 else
1854#endif
1855 {
1856 for (insn = first; insn; insn = NEXT_INSN (insn))
1857 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1858 max_line = NOTE_LINE_NUMBER (insn);
1859 }
1860
1861 line_note_exists = (char *) xcalloc (max_line + 1, sizeof (char));
1862
1863 for (insn = first; insn; insn = NEXT_INSN (insn))
1864 {
1865 if (INSN_UID (insn) > max_uid) /* find largest UID */
1866 max_uid = INSN_UID (insn);
1867 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1868 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1869#ifdef HAVE_cc0
1870 /* If CC tracking across branches is enabled, record the insn which
1871 jumps to each branch only reached from one place. */
1872 if (optimize && GET_CODE (insn) == JUMP_INSN)
1873 {
1874 rtx lab = JUMP_LABEL (insn);
1875 if (lab && LABEL_NUSES (lab) == 1)
1876 {
--- 19 unchanged lines hidden (view full) ---
1896 insn_current_address = -1;
1897 else
1898 abort ();
1899 }
1900 else
1901 insn_current_address = INSN_ADDRESSES (INSN_UID (insn));
1902#endif /* HAVE_ATTR_length */
1903
1904 insn = final_scan_insn (insn, file, optimize, prescan, 0);
1905 }
1906
1907 /* Store function names for edge-profiling. */
1908 /* ??? Probably should re-use the existing struct function. */
1909
1910 if (cfun->arc_profile)
1911 {
1912 struct function_list *new_item = xmalloc (sizeof (struct function_list));
1913
1914 *functions_tail = new_item;
1915 functions_tail = &new_item->next;
1916
1917 new_item->next = 0;
1918 new_item->name = xstrdup (IDENTIFIER_POINTER
1919 (DECL_ASSEMBLER_NAME (current_function_decl)));
1920 new_item->cfg_checksum = profile_info.current_function_cfg_checksum;
1921 new_item->count_edges = profile_info.count_edges_instrumented_now;
1922 }
1923
1924 free (line_note_exists);
1925 line_note_exists = NULL;
1926}
1927
1928const char *
1929get_insn_template (code, insn)
1930 int code;
1931 rtx insn;
1932{
1933 const void *output = insn_data[code].output;
1934 switch (insn_data[code].output_format)
1935 {
1936 case INSN_OUTPUT_FORMAT_SINGLE:
1937 return (const char *) output;
1938 case INSN_OUTPUT_FORMAT_MULTI:
1939 return ((const char *const *) output)[which_alternative];
1940 case INSN_OUTPUT_FORMAT_FUNCTION:
1941 if (insn == NULL)
1942 abort ();
1943 return (*(insn_output_fn) output) (recog_data.operand, insn);
1944
1945 default:
1946 abort ();
1947 }
1948}
1949
1950/* Emit the appropriate declaration for an alternate-entry-point
1951 symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
1952 LABEL_KIND != LABEL_NORMAL.
1953
1954 The case fall-through in this function is intentional. */
1955static void
1956output_alternate_entry_point (file, insn)
1957 FILE *file;
1958 rtx insn;
1959{
1960 const char *name = LABEL_NAME (insn);
1961
1962 switch (LABEL_KIND (insn))
1963 {
1964 case LABEL_WEAK_ENTRY:
1965#ifdef ASM_WEAKEN_LABEL
1966 ASM_WEAKEN_LABEL (file, name);
--- 14 unchanged lines hidden (view full) ---
1981}
1982
1983/* The final scan for one insn, INSN.
1984 Args are same as in `final', except that INSN
1985 is the insn being scanned.
1986 Value returned is the next insn to be scanned.
1987
1988 NOPEEPHOLES is the flag to disallow peephole processing (currently
1989 used for within delayed branch sequence output). */
1990
1991rtx
1992final_scan_insn (insn, file, optimize, prescan, nopeepholes)
1993 rtx insn;
1994 FILE *file;
1995 int optimize ATTRIBUTE_UNUSED;
1996 int prescan;
1997 int nopeepholes ATTRIBUTE_UNUSED;
1998{
1999#ifdef HAVE_cc0
2000 rtx set;
2001#endif
2002
2003 insn_counter++;
2004
2005 /* Ignore deleted insns. These can occur when we split insns (due to a
--- 22 unchanged lines hidden (view full) ---
2028
2029 case NOTE_INSN_BASIC_BLOCK:
2030#ifdef IA64_UNWIND_INFO
2031 IA64_UNWIND_EMIT (asm_out_file, insn);
2032#endif
2033 if (flag_debug_asm)
2034 fprintf (asm_out_file, "\t%s basic block %d\n",
2035 ASM_COMMENT_START, NOTE_BASIC_BLOCK (insn)->index);
2036 break;
2037
2038 case NOTE_INSN_EH_REGION_BEG:
2039 ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHB",
2040 NOTE_EH_HANDLER (insn));
2041 break;
2042
2043 case NOTE_INSN_EH_REGION_END:
2044 ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHE",
2045 NOTE_EH_HANDLER (insn));
2046 break;
2047
2048 case NOTE_INSN_PROLOGUE_END:
2049 (*targetm.asm_out.function_end_prologue) (file);
2050 profile_after_prologue (file);
2051 break;
2052
2053 case NOTE_INSN_EPILOGUE_BEG:
2054 (*targetm.asm_out.function_begin_epilogue) (file);
2055 break;
2056
2057 case NOTE_INSN_FUNCTION_BEG:
2058 app_disable ();
2059 (*debug_hooks->end_prologue) (last_linenum, last_filename);
2060 break;
2061
2062 case NOTE_INSN_BLOCK_BEG:
2063 if (debug_info_level == DINFO_LEVEL_NORMAL
2064 || debug_info_level == DINFO_LEVEL_VERBOSE
2065 || write_symbols == DWARF_DEBUG
2066 || write_symbols == DWARF2_DEBUG
2067 || write_symbols == VMS_AND_DWARF2_DEBUG
--- 42 unchanged lines hidden (view full) ---
2110 break;
2111
2112 case 0:
2113 break;
2114
2115 default:
2116 if (NOTE_LINE_NUMBER (insn) <= 0)
2117 abort ();
2118
2119 /* This note is a line-number. */
2120 {
2121 rtx note;
2122 int note_after = 0;
2123
2124 /* If there is anything real after this note, output it.
2125 If another line note follows, omit this one. */
2126 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2127 {
2128 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2129 break;
2130
2131 /* These types of notes can be significant
2132 so make sure the preceding line number stays. */
2133 else if (GET_CODE (note) == NOTE
2134 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2135 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2136 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2137 break;
2138 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2139 {
2140 /* Another line note follows; we can delete this note
2141 if no intervening line numbers have notes elsewhere. */
2142 int num;
2143 for (num = NOTE_LINE_NUMBER (insn) + 1;
2144 num < NOTE_LINE_NUMBER (note);
2145 num++)
2146 if (line_note_exists[num])
2147 break;
2148
2149 if (num >= NOTE_LINE_NUMBER (note))
2150 note_after = 1;
2151 break;
2152 }
2153 }
2154
2155 /* Output this line note if it is the first or the last line
2156 note in a row. */
2157 if (!note_after)
2158 {
2159 notice_source_line (insn);
2160 (*debug_hooks->source_line) (last_linenum, last_filename);
2161 }
2162 }
2163 break;
2164 }
2165 break;
2166
2167 case BARRIER:
2168#if defined (DWARF2_UNWIND_INFO)
2169 if (dwarf2out_do_frame ())
2170 dwarf2out_frame_debug (insn);
--- 47 unchanged lines hidden (view full) ---
2218 {
2219 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2220 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2221 }
2222 }
2223#endif
2224 if (prescan > 0)
2225 break;
2226 new_block = 1;
2227
2228#ifdef FINAL_PRESCAN_LABEL
2229 FINAL_PRESCAN_INSN (insn, NULL, 0);
2230#endif
2231
2232 if (LABEL_NAME (insn))
2233 (*debug_hooks->label) (insn);
2234
2235 if (app_on)
2236 {
2237 fputs (ASM_APP_OFF, file);
2238 app_on = 0;
2239 }
--- 29 unchanged lines hidden (view full) ---
2269 }
2270 else
2271 function_section (current_function_decl);
2272
2273#ifdef ASM_OUTPUT_CASE_LABEL
2274 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2275 NEXT_INSN (insn));
2276#else
2277 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2278#endif
2279#endif
2280 break;
2281 }
2282 }
2283 if (LABEL_ALT_ENTRY_P (insn))
2284 output_alternate_entry_point (file, insn);
2285 else
2286 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2287 break;
2288
2289 default:
2290 {
2291 rtx body = PATTERN (insn);
2292 int insn_code_number;
2293 const char *template;
2294 rtx note;
2295
2296 /* An INSN, JUMP_INSN or CALL_INSN.
2297 First check for special kinds that recog doesn't recognize. */
2298
2299 if (GET_CODE (body) == USE /* These are just declarations */
2300 || GET_CODE (body) == CLOBBER)
2301 break;
2302
2303#ifdef HAVE_cc0
2304 /* If there is a REG_CC_SETTER note on this insn, it means that
2305 the setting of the condition code was done in the delay slot
2306 of the insn that branched here. So recover the cc status
2307 from the insn that set it. */
--- 73 unchanged lines hidden (view full) ---
2381 insn);
2382#endif
2383#endif
2384
2385 function_section (current_function_decl);
2386
2387 break;
2388 }
2389
2390 if (GET_CODE (body) == ASM_INPUT)
2391 {
2392 const char *string = XSTR (body, 0);
2393
2394 /* There's no telling what that did to the condition codes. */
2395 CC_STATUS_INIT;
2396 if (prescan > 0)
--- 10 unchanged lines hidden (view full) ---
2407 }
2408 break;
2409 }
2410
2411 /* Detect `asm' construct with operands. */
2412 if (asm_noperands (body) >= 0)
2413 {
2414 unsigned int noperands = asm_noperands (body);
2415 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2416 const char *string;
2417
2418 /* There's no telling what that did to the condition codes. */
2419 CC_STATUS_INIT;
2420 if (prescan > 0)
2421 break;
2422
2423 /* Get out the operand values. */
2424 string = decode_asm_operands (body, ops, NULL, NULL, NULL);
2425 /* Inhibit aborts on what would otherwise be compiler bugs. */
2426 insn_noperands = noperands;
2427 this_is_asm_operands = insn;
2428
2429 /* Output the insn using them. */
2430 if (string[0])
2431 {
2432 if (! app_on)
2433 {
2434 fputs (ASM_APP_ON, file);
2435 app_on = 1;
2436 }
--- 15 unchanged lines hidden (view full) ---
2452 /* A delayed-branch sequence */
2453 int i;
2454 rtx next;
2455
2456 if (prescan > 0)
2457 break;
2458 final_sequence = body;
2459
2460 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2461 force the restoration of a comparison that was previously
2462 thought unnecessary. If that happens, cancel this sequence
2463 and cause that insn to be restored. */
2464
2465 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2466 if (next != XVECEXP (body, 0, 1))
2467 {
2468 final_sequence = 0;
2469 return next;
2470 }
2471
2472 for (i = 1; i < XVECLEN (body, 0); i++)
2473 {
2474 rtx insn = XVECEXP (body, 0, i);
2475 rtx next = NEXT_INSN (insn);
2476 /* We loop in case any instruction in a delay slot gets
2477 split. */
2478 do
2479 insn = final_scan_insn (insn, file, 0, prescan, 1);
2480 while (insn != next);
2481 }
2482#ifdef DBR_OUTPUT_SEQEND
2483 DBR_OUTPUT_SEQEND (file);
2484#endif
2485 final_sequence = 0;
2486
2487 /* If the insn requiring the delay slot was a CALL_INSN, the
--- 20 unchanged lines hidden (view full) ---
2508 This is done only when optimizing; if not optimizing,
2509 it should be possible for the user to alter a variable
2510 with the debugger in between statements
2511 and the next statement should reexamine the variable
2512 to compute the condition codes. */
2513
2514 if (optimize)
2515 {
2516#if 0
2517 rtx set = single_set (insn);
2518#endif
2519
2520 if (set
2521 && GET_CODE (SET_DEST (set)) == CC0
2522 && insn != last_ignored_compare)
2523 {
2524 if (GET_CODE (SET_SRC (set)) == SUBREG)
2525 SET_SRC (set) = alter_subreg (&SET_SRC (set));
2526 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2527 {
--- 151 unchanged lines hidden (view full) ---
2679 /* When peepholing, if there were notes within the peephole,
2680 emit them before the peephole. */
2681 if (next != 0 && next != NEXT_INSN (insn))
2682 {
2683 rtx prev = PREV_INSN (insn);
2684
2685 for (note = NEXT_INSN (insn); note != next;
2686 note = NEXT_INSN (note))
2687 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2688
2689 /* In case this is prescan, put the notes
2690 in proper position for later rescan. */
2691 note = NEXT_INSN (insn);
2692 PREV_INSN (note) = prev;
2693 NEXT_INSN (prev) = note;
2694 NEXT_INSN (PREV_INSN (next)) = insn;
2695 PREV_INSN (insn) = PREV_INSN (next);
--- 64 unchanged lines hidden (view full) ---
2760 which follows a deleted test insn, and that test insn
2761 needs to be reinserted. */
2762 if (template == 0)
2763 {
2764 rtx prev;
2765
2766 if (prev_nonnote_insn (insn) != last_ignored_compare)
2767 abort ();
2768 new_block = 0;
2769
2770 /* We have already processed the notes between the setter and
2771 the user. Make sure we don't process them again, this is
2772 particularly important if one of the notes is a block
2773 scope note or an EH note. */
2774 for (prev = insn;
2775 prev != last_ignored_compare;
2776 prev = PREV_INSN (prev))
--- 17 unchanged lines hidden (view full) ---
2794
2795#ifdef HAVE_ATTR_length
2796 /* This instruction should have been split in shorten_branches,
2797 to ensure that we would have valid length info for the
2798 splitees. */
2799 abort ();
2800#endif
2801
2802 new_block = 0;
2803 return new;
2804 }
2805
2806 if (prescan > 0)
2807 break;
2808
2809#ifdef IA64_UNWIND_INFO
2810 IA64_UNWIND_EMIT (asm_out_file, insn);
2811#endif
2812 /* Output assembler code from the template. */
2813
2814 output_asm_insn (template, recog_data.operand);
2815
2816#if defined (DWARF2_UNWIND_INFO)
2817#if defined (HAVE_prologue)
2818 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2819 dwarf2out_frame_debug (insn);
2820#else
2821 if (!ACCUMULATE_OUTGOING_ARGS
2822 && GET_CODE (insn) == INSN
2823 && dwarf2out_do_frame ())
2824 dwarf2out_frame_debug (insn);
2825#endif
2826#endif
2827
2828#if 0
2829 /* It's not at all clear why we did this and doing so interferes
2830 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2831 with this out. */
2832
2833 /* Mark this insn as having been output. */
2834 INSN_DELETED_P (insn) = 1;
2835#endif
2836
2837 /* Emit information for vtable gc. */
2838 note = find_reg_note (insn, REG_VTABLE_REF, NULL_RTX);
2839 if (note)
2840 assemble_vtable_entry (XEXP (XEXP (note, 0), 0),
2841 INTVAL (XEXP (XEXP (note, 0), 1)));
2842
2843 current_output_insn = debug_insn = 0;
2844 }
2845 }
2846 return NEXT_INSN (insn);
2847}
2848
2849/* Output debugging info to the assembler file FILE
2850 based on the NOTE-insn INSN, assumed to be a line number. */
2851
2852static void
2853notice_source_line (insn)
2854 rtx insn;
2855{
2856 const char *filename = NOTE_SOURCE_FILE (insn);
2857
2858 last_filename = filename;
2859 last_linenum = NOTE_LINE_NUMBER (insn);
2860 high_block_linenum = MAX (last_linenum, high_block_linenum);
2861 high_function_linenum = MAX (last_linenum, high_function_linenum);
2862}
2863
2864/* For each operand in INSN, simplify (subreg (reg)) so that it refers
2865 directly to the desired hard register. */
2866
2867void
2868cleanup_subreg_operands (insn)
2869 rtx insn;
2870{
2871 int i;
2872 extract_insn_cached (insn);
2873 for (i = 0; i < recog_data.n_operands; i++)
2874 {
2875 /* The following test cannot use recog_data.operand when tesing
2876 for a SUBREG: the underlying object might have been changed
2877 already if we are inside a match_operator expression that
2878 matches the else clause. Instead we test the underlying
2879 expression directly. */
2880 if (GET_CODE (*recog_data.operand_loc[i]) == SUBREG)
2881 recog_data.operand[i] = alter_subreg (recog_data.operand_loc[i]);
2882 else if (GET_CODE (recog_data.operand[i]) == PLUS
2883 || GET_CODE (recog_data.operand[i]) == MULT
--- 11 unchanged lines hidden (view full) ---
2895 *recog_data.dup_loc[i] = walk_alter_subreg (recog_data.dup_loc[i]);
2896 }
2897}
2898
2899/* If X is a SUBREG, replace it with a REG or a MEM,
2900 based on the thing it is a subreg of. */
2901
2902rtx
2903alter_subreg (xp)
2904 rtx *xp;
2905{
2906 rtx x = *xp;
2907 rtx y = SUBREG_REG (x);
2908
2909 /* simplify_subreg does not remove subreg from volatile references.
2910 We are required to. */
2911 if (GET_CODE (y) == MEM)
2912 *xp = adjust_address (y, GET_MODE (x), SUBREG_BYTE (x));
2913 else
2914 {
2915 rtx new = simplify_subreg (GET_MODE (x), y, GET_MODE (y),
2916 SUBREG_BYTE (x));
2917
2918 if (new != 0)
2919 *xp = new;
2920 /* Simplify_subreg can't handle some REG cases, but we have to. */
2921 else if (GET_CODE (y) == REG)
2922 {
2923 unsigned int regno = subreg_hard_regno (x, 1);
2924 PUT_CODE (x, REG);
2925 REGNO (x) = regno;
2926 ORIGINAL_REGNO (x) = ORIGINAL_REGNO (y);
2927 /* This field has a different meaning for REGs and SUBREGs. Make
2928 sure to clear it! */
2929 RTX_FLAG (x, used) = 0;
2930 }
2931 else
2932 abort ();
2933 }
2934
2935 return *xp;
2936}
2937
2938/* Do alter_subreg on all the SUBREGs contained in X. */
2939
2940static rtx
2941walk_alter_subreg (xp)
2942 rtx *xp;
2943{
2944 rtx x = *xp;
2945 switch (GET_CODE (x))
2946 {
2947 case PLUS:
2948 case MULT:
2949 XEXP (x, 0) = walk_alter_subreg (&XEXP (x, 0));
2950 XEXP (x, 1) = walk_alter_subreg (&XEXP (x, 1));
--- 20 unchanged lines hidden (view full) ---
2971 Not all of the bits there can be handled at this level in all cases.
2972
2973 The value is normally 0.
2974 1 means that the condition has become always true.
2975 -1 means that the condition has become always false.
2976 2 means that COND has been altered. */
2977
2978static int
2979alter_cond (cond)
2980 rtx cond;
2981{
2982 int value = 0;
2983
2984 if (cc_status.flags & CC_REVERSED)
2985 {
2986 value = 2;
2987 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
2988 }
--- 136 unchanged lines hidden (view full) ---
3125 return value;
3126}
3127#endif
3128
3129/* Report inconsistency between the assembler template and the operands.
3130 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3131
3132void
3133output_operand_lossage VPARAMS ((const char *msgid, ...))
3134{
3135 char *fmt_string;
3136 char *new_message;
3137 const char *pfx_str;
3138 VA_OPEN (ap, msgid);
3139 VA_FIXEDARG (ap, const char *, msgid);
3140
3141 pfx_str = this_is_asm_operands ? _("invalid `asm': ") : "output_operand: ";
3142 asprintf (&fmt_string, "%s%s", pfx_str, _(msgid));
3143 vasprintf (&new_message, fmt_string, ap);
3144
3145 if (this_is_asm_operands)
3146 error_for_asm (this_is_asm_operands, "%s", new_message);
3147 else
3148 internal_error ("%s", new_message);
3149
3150 free (fmt_string);
3151 free (new_message);
3152 VA_CLOSE (ap);
3153}
3154
3155/* Output of assembler code from a template, and its subroutines. */
3156
3157/* Annotate the assembly with a comment describing the pattern and
3158 alternative used. */
3159
3160static void
3161output_asm_name ()
3162{
3163 if (debug_insn)
3164 {
3165 int num = INSN_CODE (debug_insn);
3166 fprintf (asm_out_file, "\t%s %d\t%s",
3167 ASM_COMMENT_START, INSN_UID (debug_insn),
3168 insn_data[num].name);
3169 if (insn_data[num].n_alternatives > 1)
--- 8 unchanged lines hidden (view full) ---
3178 }
3179}
3180
3181/* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3182 or its address, return that expr . Set *PADDRESSP to 1 if the expr
3183 corresponds to the address of the object and 0 if to the object. */
3184
3185static tree
3186get_mem_expr_from_op (op, paddressp)
3187 rtx op;
3188 int *paddressp;
3189{
3190 tree expr;
3191 int inner_addressp;
3192
3193 *paddressp = 0;
3194
3195 if (op == NULL)
3196 return 0;
3197
3198 if (GET_CODE (op) == REG && ORIGINAL_REGNO (op) >= FIRST_PSEUDO_REGISTER)
3199 return REGNO_DECL (ORIGINAL_REGNO (op));
3200 else if (GET_CODE (op) != MEM)
3201 return 0;
3202
3203 if (MEM_EXPR (op) != 0)
3204 return MEM_EXPR (op);
3205
3206 /* Otherwise we have an address, so indicate it and look at the address. */
3207 *paddressp = 1;
--- 16 unchanged lines hidden (view full) ---
3224 return inner_addressp ? 0 : expr;
3225}
3226
3227/* Output operand names for assembler instructions. OPERANDS is the
3228 operand vector, OPORDER is the order to write the operands, and NOPS
3229 is the number of operands to write. */
3230
3231static void
3232output_asm_operand_names (operands, oporder, nops)
3233 rtx *operands;
3234 int *oporder;
3235 int nops;
3236{
3237 int wrote = 0;
3238 int i;
3239
3240 for (i = 0; i < nops; i++)
3241 {
3242 int addressp;
3243 tree expr = get_mem_expr_from_op (operands[oporder[i]], &addressp);
3244
3245 if (expr)
3246 {
3247 fprintf (asm_out_file, "%c%s %s",
3248 wrote ? ',' : '\t', wrote ? "" : ASM_COMMENT_START,
3249 addressp ? "*" : "");
3250 print_mem_expr (asm_out_file, expr);
3251 wrote = 1;
3252 }
3253 }
3254}
3255
3256/* Output text from TEMPLATE to the assembler output file,
3257 obeying %-directions to substitute operands taken from
3258 the vector OPERANDS.
3259
3260 %N (for N a digit) means print operand N in usual manner.
--- 4 unchanged lines hidden (view full) ---
3265 %aN means expect operand N to be a memory address
3266 (not a memory reference!) and print a reference
3267 to that address.
3268 %nN means expect operand N to be a constant
3269 and print a constant expression for minus the value
3270 of the operand, with no other punctuation. */
3271
3272void
3273output_asm_insn (template, operands)
3274 const char *template;
3275 rtx *operands;
3276{
3277 const char *p;
3278 int c;
3279#ifdef ASSEMBLER_DIALECT
3280 int dialect = 0;
3281#endif
3282 int oporder[MAX_RECOG_OPERANDS];
3283 char opoutput[MAX_RECOG_OPERANDS];
--- 189 unchanged lines hidden (view full) ---
3473 output_asm_name ();
3474
3475 putc ('\n', asm_out_file);
3476}
3477
3478/* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3479
3480void
3481output_asm_label (x)
3482 rtx x;
3483{
3484 char buf[256];
3485
3486 if (GET_CODE (x) == LABEL_REF)
3487 x = XEXP (x, 0);
3488 if (GET_CODE (x) == CODE_LABEL
3489 || (GET_CODE (x) == NOTE
3490 && NOTE_LINE_NUMBER (x) == NOTE_INSN_DELETED_LABEL))
--- 10 unchanged lines hidden (view full) ---
3501 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3502 between the % and the digits.
3503 When CODE is a non-letter, X is 0.
3504
3505 The meanings of the letters are machine-dependent and controlled
3506 by PRINT_OPERAND. */
3507
3508static void
3509output_operand (x, code)
3510 rtx x;
3511 int code ATTRIBUTE_UNUSED;
3512{
3513 if (x && GET_CODE (x) == SUBREG)
3514 x = alter_subreg (&x);
3515
3516 /* If X is a pseudo-register, abort now rather than writing trash to the
3517 assembler file. */
3518
3519 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3520 abort ();
3521
3522 PRINT_OPERAND (asm_out_file, x, code);
3523}
3524
3525/* Print a memory reference operand for address X
3526 using machine-dependent assembler syntax.
3527 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3528
3529void
3530output_address (x)
3531 rtx x;
3532{
3533 walk_alter_subreg (&x);
3534 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3535}
3536
3537/* Print an integer constant expression in assembler syntax.
3538 Addition and subtraction are the only arithmetic
3539 that may appear in these expressions. */
3540
3541void
3542output_addr_const (file, x)
3543 FILE *file;
3544 rtx x;
3545{
3546 char buf[256];
3547
3548 restart:
3549 switch (GET_CODE (x))
3550 {
3551 case PC:
3552 putc ('.', file);
--- 105 unchanged lines hidden (view full) ---
3658}
3659
3660/* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3661 %R prints the value of REGISTER_PREFIX.
3662 %L prints the value of LOCAL_LABEL_PREFIX.
3663 %U prints the value of USER_LABEL_PREFIX.
3664 %I prints the value of IMMEDIATE_PREFIX.
3665 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3666 Also supported are %d, %x, %s, %e, %f, %g and %%.
3667
3668 We handle alternate assembler dialects here, just like output_asm_insn. */
3669
3670void
3671asm_fprintf VPARAMS ((FILE *file, const char *p, ...))
3672{
3673 char buf[10];
3674 char *q, c;
3675
3676 VA_OPEN (argptr, p);
3677 VA_FIXEDARG (argptr, FILE *, file);
3678 VA_FIXEDARG (argptr, const char *, p);
3679
3680 buf[0] = '%';
3681
3682 while ((c = *p++))
3683 switch (c)
3684 {
3685#ifdef ASSEMBLER_DIALECT
3686 case '{':
--- 21 unchanged lines hidden (view full) ---
3708
3709 case '}':
3710 break;
3711#endif
3712
3713 case '%':
3714 c = *p++;
3715 q = &buf[1];
3716 while (ISDIGIT (c) || c == '.')
3717 {
3718 *q++ = c;
3719 c = *p++;
3720 }
3721 switch (c)
3722 {
3723 case '%':
3724 fprintf (file, "%%");
3725 break;
3726
3727 case 'd': case 'i': case 'u':
3728 case 'x': case 'p': case 'X':
3729 case 'o':
3730 *q++ = c;
3731 *q = 0;
3732 fprintf (file, buf, va_arg (argptr, int));
3733 break;
3734
3735 case 'w':
3736 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3737 but we do not check for those cases. It means that the value
3738 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3739
3740#if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3741#else
3742#if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3743 *q++ = 'l';
3744#else
3745 *q++ = 'l';
3746 *q++ = 'l';
3747#endif
3748#endif
3749
3750 *q++ = *p++;
3751 *q = 0;
3752 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3753 break;
3754
3755 case 'l':
3756 *q++ = c;
3757 *q++ = *p++;
3758 *q = 0;
3759 fprintf (file, buf, va_arg (argptr, long));
3760 break;
3761
3762 case 'e':
3763 case 'f':
3764 case 'g':
3765 *q++ = c;
3766 *q = 0;
3767 fprintf (file, buf, va_arg (argptr, double));
3768 break;
3769
3770 case 's':
3771 *q++ = c;
3772 *q = 0;
3773 fprintf (file, buf, va_arg (argptr, char *));
3774 break;
3775
--- 21 unchanged lines hidden (view full) ---
3797#endif
3798 break;
3799
3800 case 'U':
3801 fputs (user_label_prefix, file);
3802 break;
3803
3804#ifdef ASM_FPRINTF_EXTENSIONS
3805 /* Upper case letters are reserved for general use by asm_fprintf
3806 and so are not available to target specific code. In order to
3807 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3808 they are defined here. As they get turned into real extensions
3809 to asm_fprintf they should be removed from this list. */
3810 case 'A': case 'B': case 'C': case 'D': case 'E':
3811 case 'F': case 'G': case 'H': case 'J': case 'K':
3812 case 'M': case 'N': case 'P': case 'Q': case 'S':
3813 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3814 break;
3815
3816 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3817#endif
3818 default:
3819 abort ();
3820 }
3821 break;
3822
3823 default:
3824 fputc (c, file);
3825 }
3826 VA_CLOSE (argptr);
3827}
3828
3829/* Split up a CONST_DOUBLE or integer constant rtx
3830 into two rtx's for single words,
3831 storing in *FIRST the word that comes first in memory in the target
3832 and in *SECOND the other. */
3833
3834void
3835split_double (value, first, second)
3836 rtx value;
3837 rtx *first, *second;
3838{
3839 if (GET_CODE (value) == CONST_INT)
3840 {
3841 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3842 {
3843 /* In this case the CONST_INT holds both target words.
3844 Extract the bits from it into two word-sized pieces.
3845 Sign extend each half to HOST_WIDE_INT. */
--- 122 unchanged lines hidden (view full) ---
3968 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3969 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3970 }
3971}
3972
3973/* Return nonzero if this function has no function calls. */
3974
3975int
3976leaf_function_p ()
3977{
3978 rtx insn;
3979 rtx link;
3980
3981 if (current_function_profile || profile_arc_flag)
3982 return 0;
3983
3984 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
--- 26 unchanged lines hidden (view full) ---
4011 return 1;
4012}
4013
4014/* Return 1 if branch is a forward branch.
4015 Uses insn_shuid array, so it works only in the final pass. May be used by
4016 output templates to customary add branch prediction hints.
4017 */
4018int
4019final_forward_branch_p (insn)
4020 rtx insn;
4021{
4022 int insn_id, label_id;
4023 if (!uid_shuid)
4024 abort ();
4025 insn_id = INSN_SHUID (insn);
4026 label_id = INSN_SHUID (JUMP_LABEL (insn));
4027 /* We've hit some insns that does not have id information available. */
4028 if (!insn_id || !label_id)
--- 11 unchanged lines hidden (view full) ---
4040 uses the "output" registers instead. */
4041
4042#ifdef LEAF_REGISTERS
4043
4044/* Return 1 if this function uses only the registers that can be
4045 safely renumbered. */
4046
4047int
4048only_leaf_regs_used ()
4049{
4050 int i;
4051 char *permitted_reg_in_leaf_functions = LEAF_REGISTERS;
4052
4053 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4054 if ((regs_ever_live[i] || global_regs[i])
4055 && ! permitted_reg_in_leaf_functions[i])
4056 return 0;
4057
4058 if (current_function_uses_pic_offset_table
4059 && pic_offset_table_rtx != 0
4060 && GET_CODE (pic_offset_table_rtx) == REG
4061 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4062 return 0;
4063
4064 return 1;
4065}
4066
4067/* Scan all instructions and renumber all registers into those
4068 available in leaf functions. */
4069
4070static void
4071leaf_renumber_regs (first)
4072 rtx first;
4073{
4074 rtx insn;
4075
4076 /* Renumber only the actual patterns.
4077 The reg-notes can contain frame pointer refs,
4078 and renumbering them could crash, and should not be needed. */
4079 for (insn = first; insn; insn = NEXT_INSN (insn))
4080 if (INSN_P (insn))
--- 4 unchanged lines hidden (view full) ---
4085 if (INSN_P (XEXP (insn, 0)))
4086 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4087}
4088
4089/* Scan IN_RTX and its subexpressions, and renumber all regs into those
4090 available in leaf functions. */
4091
4092void
4093leaf_renumber_regs_insn (in_rtx)
4094 rtx in_rtx;
4095{
4096 int i, j;
4097 const char *format_ptr;
4098
4099 if (in_rtx == 0)
4100 return;
4101
4102 /* Renumber all input-registers into output-registers.
--- 60 unchanged lines hidden (view full) ---
4163 case 'u':
4164 break;
4165
4166 default:
4167 abort ();
4168 }
4169}
4170#endif
2 Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997,
3 1998, 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
4
5This file is part of GCC.
6
7GCC is free software; you can redistribute it and/or modify it under
8the terms of the GNU General Public License as published by the Free
9Software Foundation; either version 2, or (at your option) any later
10version.
11
--- 29 unchanged lines hidden (view full) ---
41 (the one that tests the condition codes) to be modified.
42
43 The code for the function prologue and epilogue are generated
44 directly in assembler by the target functions function_prologue and
45 function_epilogue. Those instructions never exist as rtl. */
46
47#include "config.h"
48#include "system.h"
49
50#include "tree.h"
51#include "rtl.h"
52#include "tm_p.h"
53#include "regs.h"
54#include "insn-config.h"
55#include "insn-attr.h"
56#include "recog.h"
--- 6 unchanged lines hidden (view full) ---
63#include "function.h"
64#include "toplev.h"
65#include "reload.h"
66#include "intl.h"
67#include "basic-block.h"
68#include "target.h"
69#include "debug.h"
70#include "expr.h"
71#include "profile.h"
72#include "cfglayout.h"
73
74#ifdef XCOFF_DEBUGGING_INFO
75#include "xcoffout.h" /* Needed for external data
76 declarations for e.g. AIX 4.x. */
77#endif
78
79#if defined (DWARF2_UNWIND_INFO) || defined (DWARF2_DEBUGGING_INFO)
80#include "dwarf2out.h"
81#endif
82
83/* If we aren't using cc0, CC_STATUS_INIT shouldn't exist. So define a
84 null default for it to save conditionalization later. */
85#ifndef CC_STATUS_INIT
86#define CC_STATUS_INIT
87#endif
88
89/* How to start an assembler comment. */
90#ifndef ASM_COMMENT_START
--- 10 unchanged lines hidden (view full) ---
101#endif
102
103#if defined(READONLY_DATA_SECTION) || defined(READONLY_DATA_SECTION_ASM_OP)
104#define HAVE_READONLY_DATA_SECTION 1
105#else
106#define HAVE_READONLY_DATA_SECTION 0
107#endif
108
109/* Last insn processed by final_scan_insn. */
110static rtx debug_insn;
111rtx current_output_insn;
112
113/* Line number of last NOTE. */
114static int last_linenum;
115
116/* Highest line number in current block. */
--- 14 unchanged lines hidden (view full) ---
131
132/* Number of operands of this insn, for an `asm' with operands. */
133static unsigned int insn_noperands;
134
135/* Compare optimization flag. */
136
137static rtx last_ignored_compare = 0;
138
139/* Flag indicating this insn is the start of a new basic block. */
140
141static int new_block = 1;
142
143/* Assign a unique number to each insn that is output.
144 This can be used to generate unique local labels. */
145
146static int insn_counter = 0;
147
148#ifdef HAVE_cc0
149/* This variable contains machine-dependent flags (defined in tm.h)
150 set and examined by output routines
--- 13 unchanged lines hidden (view full) ---
164 In life_analysis, or in stupid_life_analysis, this is set
165 up to record the hard regs used explicitly. Reload adds
166 in the hard regs used for holding pseudo regs. Final uses
167 it to generate the code in the function prologue and epilogue
168 to save and restore registers as needed. */
169
170char regs_ever_live[FIRST_PSEUDO_REGISTER];
171
172/* Nonzero means current function must be given a frame pointer.
173 Set in stmt.c if anything is allocated on the stack there.
174 Set in reload1.c if anything is allocated on the stack there. */
175
176int frame_pointer_needed;
177
178/* Number of unmatched NOTE_INSN_BLOCK_BEG notes we have seen. */
179
180static int block_depth;
181
182/* Nonzero if have enabled APP processing of our assembler output. */
--- 6 unchanged lines hidden (view full) ---
189rtx final_sequence;
190
191#ifdef ASSEMBLER_DIALECT
192
193/* Number of the assembler dialect to use, starting at 0. */
194static int dialect_number;
195#endif
196
197/* Indexed by line number, nonzero if there is a note for that line. */
198
199static char *line_note_exists;
200
201#ifdef HAVE_conditional_execution
202/* Nonnull if the insn currently being emitted was a COND_EXEC pattern. */
203rtx current_insn_predicate;
204#endif
205
206struct function_list
207{
208 struct function_list *next; /* next function */
209 const char *name; /* function name */
210 long cfg_checksum; /* function checksum */
211 long count_edges; /* number of intrumented edges in this function */
212};
213
214static struct function_list *functions_head = 0;
215static struct function_list **functions_tail = &functions_head;
216
217#ifdef HAVE_ATTR_length
218static int asm_insn_count PARAMS ((rtx));
219#endif
220static void profile_function PARAMS ((FILE *));
221static void profile_after_prologue PARAMS ((FILE *));
222static void notice_source_line PARAMS ((rtx));
223static rtx walk_alter_subreg PARAMS ((rtx *));
224static void output_asm_name PARAMS ((void));
225static void output_alternate_entry_point PARAMS ((FILE *, rtx));
226static tree get_mem_expr_from_op PARAMS ((rtx, int *));
227static void output_asm_operand_names PARAMS ((rtx *, int *, int));
228static void output_operand PARAMS ((rtx, int));
229#ifdef LEAF_REGISTERS
230static void leaf_renumber_regs PARAMS ((rtx));
231#endif
232#ifdef HAVE_cc0
233static int alter_cond PARAMS ((rtx));
234#endif
235#ifndef ADDR_VEC_ALIGN
236static int final_addr_vec_align PARAMS ((rtx));
237#endif
238#ifdef HAVE_ATTR_length
239static int align_fuzz PARAMS ((rtx, rtx, int, unsigned));
240#endif
241
242/* Initialize data in final at the beginning of a compilation. */
243
244void
245init_final (filename)
246 const char *filename ATTRIBUTE_UNUSED;
247{
248 app_on = 0;
249 final_sequence = 0;
250
251#ifdef ASSEMBLER_DIALECT
252 dialect_number = ASSEMBLER_DIALECT;
253#endif
254}
255
256/* Called at end of source file,
257 to output the arc-profiling table for this entire compilation. */
258
259void
260end_final (filename)
261 const char *filename;
262{
263 if (profile_arc_flag && profile_info.count_instrumented_edges)
264 {
265 char name[20];
266 tree string_type, string_cst;
267 tree structure_decl, structure_value, structure_pointer_type;
268 tree field_decl, decl_chain, value_chain;
269 tree sizeof_field_value, domain_type;
270
271 /* Build types. */
272 string_type = build_pointer_type (char_type_node);
273
274 /* Libgcc2 bb structure. */
275 structure_decl = make_node (RECORD_TYPE);
276 structure_pointer_type = build_pointer_type (structure_decl);
277
278 /* Output the main header, of 7 words:
279 0: 1 if this file is initialized, else 0.
280 1: address of file name (LPBX1).
281 2: address of table of counts (LPBX2).
282 3: number of counts in the table.
283 4: always 0, libgcc2 uses this as a pointer to next ``struct bb''
284
285 The following are GNU extensions:
286
287 5: Number of bytes in this header.
288 6: address of table of function checksums (LPBX7). */
289
290 /* The zero word. */
291 decl_chain =
292 build_decl (FIELD_DECL, get_identifier ("zero_word"),
293 long_integer_type_node);
294 value_chain = build_tree_list (decl_chain,
295 convert (long_integer_type_node,
296 integer_zero_node));
297
298 /* Address of filename. */
299 {
300 char *cwd, *da_filename;
301 int da_filename_len;
302
303 field_decl =
304 build_decl (FIELD_DECL, get_identifier ("filename"), string_type);
305 TREE_CHAIN (field_decl) = decl_chain;
306 decl_chain = field_decl;
307
308 cwd = getpwd ();
309 da_filename_len = strlen (filename) + strlen (cwd) + 4 + 1;
310 da_filename = (char *) alloca (da_filename_len);
311 strcpy (da_filename, cwd);
312 strcat (da_filename, "/");
313 strcat (da_filename, filename);
314 strcat (da_filename, ".da");
315 da_filename_len = strlen (da_filename);
316 string_cst = build_string (da_filename_len + 1, da_filename);
317 domain_type = build_index_type (build_int_2 (da_filename_len, 0));
318 TREE_TYPE (string_cst)
319 = build_array_type (char_type_node, domain_type);
320 value_chain = tree_cons (field_decl,
321 build1 (ADDR_EXPR, string_type, string_cst),
322 value_chain);
323 }
324
325 /* Table of counts. */
326 {
327 tree gcov_type_type = make_unsigned_type (GCOV_TYPE_SIZE);
328 tree gcov_type_pointer_type = build_pointer_type (gcov_type_type);
329 tree domain_tree
330 = build_index_type (build_int_2 (profile_info.
331 count_instrumented_edges - 1, 0));
332 tree gcov_type_array_type
333 = build_array_type (gcov_type_type, domain_tree);
334 tree gcov_type_array_pointer_type
335 = build_pointer_type (gcov_type_array_type);
336 tree counts_table;
337
338 field_decl =
339 build_decl (FIELD_DECL, get_identifier ("counts"),
340 gcov_type_pointer_type);
341 TREE_CHAIN (field_decl) = decl_chain;
342 decl_chain = field_decl;
343
344 /* No values. */
345 counts_table
346 = build (VAR_DECL, gcov_type_array_type, NULL_TREE, NULL_TREE);
347 TREE_STATIC (counts_table) = 1;
348 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 2);
349 DECL_NAME (counts_table) = get_identifier (name);
350 assemble_variable (counts_table, 0, 0, 0);
351
352 value_chain = tree_cons (field_decl,
353 build1 (ADDR_EXPR,
354 gcov_type_array_pointer_type,
355 counts_table), value_chain);
356 }
357
358 /* Count of the # of instrumented arcs. */
359 field_decl
360 = build_decl (FIELD_DECL, get_identifier ("ncounts"),
361 long_integer_type_node);
362 TREE_CHAIN (field_decl) = decl_chain;
363 decl_chain = field_decl;
364
365 value_chain = tree_cons (field_decl,
366 convert (long_integer_type_node,
367 build_int_2 (profile_info.
368 count_instrumented_edges,
369 0)), value_chain);
370 /* Pointer to the next bb. */
371 field_decl
372 = build_decl (FIELD_DECL, get_identifier ("next"),
373 structure_pointer_type);
374 TREE_CHAIN (field_decl) = decl_chain;
375 decl_chain = field_decl;
376
377 value_chain = tree_cons (field_decl, null_pointer_node, value_chain);
378
379 /* sizeof(struct bb). We'll set this after entire structure
380 is laid out. */
381 field_decl
382 = build_decl (FIELD_DECL, get_identifier ("sizeof_bb"),
383 long_integer_type_node);
384 TREE_CHAIN (field_decl) = decl_chain;
385 decl_chain = field_decl;
386
387 sizeof_field_value = tree_cons (field_decl, NULL, value_chain);
388 value_chain = sizeof_field_value;
389
390 /* struct bb_function []. */
391 {
392 struct function_list *item;
393 int num_nodes;
394 tree checksum_field, arc_count_field, name_field;
395 tree domain;
396 tree array_value_chain = NULL_TREE;
397 tree bb_fn_struct_type;
398 tree bb_fn_struct_array_type;
399 tree bb_fn_struct_array_pointer_type;
400 tree bb_fn_struct_pointer_type;
401 tree field_value, field_value_chain;
402
403 bb_fn_struct_type = make_node (RECORD_TYPE);
404
405 checksum_field = build_decl (FIELD_DECL, get_identifier ("checksum"),
406 long_integer_type_node);
407
408 arc_count_field
409 = build_decl (FIELD_DECL, get_identifier ("arc_count"),
410 integer_type_node);
411 TREE_CHAIN (checksum_field) = arc_count_field;
412
413 name_field
414 = build_decl (FIELD_DECL, get_identifier ("name"), string_type);
415 TREE_CHAIN (arc_count_field) = name_field;
416
417 TYPE_FIELDS (bb_fn_struct_type) = checksum_field;
418
419 num_nodes = 0;
420
421 for (item = functions_head; item != 0; item = item->next)
422 num_nodes++;
423
424 /* Note that the array contains a terminator, hence no - 1. */
425 domain = build_index_type (build_int_2 (num_nodes, 0));
426
427 bb_fn_struct_pointer_type = build_pointer_type (bb_fn_struct_type);
428 bb_fn_struct_array_type
429 = build_array_type (bb_fn_struct_type, domain);
430 bb_fn_struct_array_pointer_type
431 = build_pointer_type (bb_fn_struct_array_type);
432
433 layout_type (bb_fn_struct_type);
434 layout_type (bb_fn_struct_pointer_type);
435 layout_type (bb_fn_struct_array_type);
436 layout_type (bb_fn_struct_array_pointer_type);
437
438 for (item = functions_head; item != 0; item = item->next)
439 {
440 size_t name_len;
441
442 /* create constructor for structure. */
443 field_value_chain
444 = build_tree_list (checksum_field,
445 convert (long_integer_type_node,
446 build_int_2 (item->cfg_checksum, 0)));
447 field_value_chain
448 = tree_cons (arc_count_field,
449 convert (integer_type_node,
450 build_int_2 (item->count_edges, 0)),
451 field_value_chain);
452
453 name_len = strlen (item->name);
454 string_cst = build_string (name_len + 1, item->name);
455 domain_type = build_index_type (build_int_2 (name_len, 0));
456 TREE_TYPE (string_cst)
457 = build_array_type (char_type_node, domain_type);
458 field_value_chain = tree_cons (name_field,
459 build1 (ADDR_EXPR, string_type,
460 string_cst),
461 field_value_chain);
462
463 /* Add to chain. */
464 array_value_chain
465 = tree_cons (NULL_TREE, build (CONSTRUCTOR,
466 bb_fn_struct_type, NULL_TREE,
467 nreverse (field_value_chain)),
468 array_value_chain);
469 }
470
471 /* Add terminator. */
472 field_value = build_tree_list (arc_count_field,
473 convert (integer_type_node,
474 build_int_2 (-1, 0)));
475
476 array_value_chain = tree_cons (NULL_TREE,
477 build (CONSTRUCTOR, bb_fn_struct_type,
478 NULL_TREE, field_value),
479 array_value_chain);
480
481
482 /* Create constructor for array. */
483 field_decl
484 = build_decl (FIELD_DECL, get_identifier ("function_infos"),
485 bb_fn_struct_pointer_type);
486 value_chain = tree_cons (field_decl,
487 build1 (ADDR_EXPR,
488 bb_fn_struct_array_pointer_type,
489 build (CONSTRUCTOR,
490 bb_fn_struct_array_type,
491 NULL_TREE,
492 nreverse
493 (array_value_chain))),
494 value_chain);
495 TREE_CHAIN (field_decl) = decl_chain;
496 decl_chain = field_decl;
497 }
498
499 /* Finish structure. */
500 TYPE_FIELDS (structure_decl) = nreverse (decl_chain);
501 layout_type (structure_decl);
502
503 structure_value
504 = build (VAR_DECL, structure_decl, NULL_TREE, NULL_TREE);
505 DECL_INITIAL (structure_value)
506 = build (CONSTRUCTOR, structure_decl, NULL_TREE,
507 nreverse (value_chain));
508 TREE_STATIC (structure_value) = 1;
509 ASM_GENERATE_INTERNAL_LABEL (name, "LPBX", 0);
510 DECL_NAME (structure_value) = get_identifier (name);
511
512 /* Size of this structure. */
513 TREE_VALUE (sizeof_field_value)
514 = convert (long_integer_type_node,
515 build_int_2 (int_size_in_bytes (structure_decl), 0));
516
517 /* Build structure. */
518 assemble_variable (structure_value, 0, 0, 0);
519 }
520}
521
522/* Default target function prologue and epilogue assembler output.
523
524 If not overridden for epilogue code, then the function body itself
525 contains return instructions wherever needed. */
526void
527default_function_pro_epilogue (file, size)
528 FILE *file ATTRIBUTE_UNUSED;
529 HOST_WIDE_INT size ATTRIBUTE_UNUSED;
530{
531}
532
533/* Default target hook that outputs nothing to a stream. */
534void
535no_asm_to_stream (file)
536 FILE *file ATTRIBUTE_UNUSED;
537{
538}
539
540/* Enable APP processing of subsequent output.
541 Used before the output from an `asm' statement. */
542
543void
544app_enable ()
545{
546 if (! app_on)
547 {
548 fputs (ASM_APP_ON, asm_out_file);
549 app_on = 1;
550 }
551}
552
553/* Disable APP processing of subsequent output.
554 Called from varasm.c before most kinds of output. */
555
556void
557app_disable ()
558{
559 if (app_on)
560 {
561 fputs (ASM_APP_OFF, asm_out_file);
562 app_on = 0;
563 }
564}
565
566/* Return the number of slots filled in the current
567 delayed branch sequence (we don't count the insn needing the
568 delay slot). Zero if not in a delayed branch sequence. */
569
570#ifdef DELAY_SLOTS
571int
572dbr_sequence_length ()
573{
574 if (final_sequence != 0)
575 return XVECLEN (final_sequence, 0) - 1;
576 else
577 return 0;
578}
579#endif
580
--- 36 unchanged lines hidden (view full) ---
617
618static rtx *uid_align;
619static int *uid_shuid;
620static struct label_alignment *label_align;
621
622/* Indicate that branch shortening hasn't yet been done. */
623
624void
625init_insn_lengths ()
626{
627 if (uid_shuid)
628 {
629 free (uid_shuid);
630 uid_shuid = 0;
631 }
632 if (insn_lengths)
633 {
--- 10 unchanged lines hidden (view full) ---
644 uid_align = 0;
645 }
646}
647
648/* Obtain the current length of an insn. If branch shortening has been done,
649 get its actual length. Otherwise, get its maximum length. */
650
651int
652get_attr_length (insn)
653 rtx insn ATTRIBUTE_UNUSED;
654{
655#ifdef HAVE_ATTR_length
656 rtx body;
657 int i;
658 int length = 0;
659
660 if (insn_lengths_max_uid > INSN_UID (insn))
661 return insn_lengths[INSN_UID (insn)];
--- 117 unchanged lines hidden (view full) ---
779#endif
780
781#ifndef JUMP_ALIGN_MAX_SKIP
782#define JUMP_ALIGN_MAX_SKIP align_jumps_max_skip
783#endif
784
785#ifndef ADDR_VEC_ALIGN
786static int
787final_addr_vec_align (addr_vec)
788 rtx addr_vec;
789{
790 int align = GET_MODE_SIZE (GET_MODE (PATTERN (addr_vec)));
791
792 if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT)
793 align = BIGGEST_ALIGNMENT / BITS_PER_UNIT;
794 return exact_log2 (align);
795
796}
--- 13 unchanged lines hidden (view full) ---
810 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].alignment)
811
812#define LABEL_TO_MAX_SKIP(LABEL) \
813 (label_align[CODE_LABEL_NUMBER (LABEL) - min_labelno].max_skip)
814
815/* For the benefit of port specific code do this also as a function. */
816
817int
818label_to_alignment (label)
819 rtx label;
820{
821 return LABEL_TO_ALIGNMENT (label);
822}
823
824#ifdef HAVE_ATTR_length
825/* The differences in addresses
826 between a branch and its target might grow or shrink depending on
827 the alignment the start insn of the range (the branch for a forward
--- 18 unchanged lines hidden (view full) ---
846 START and END might grow / shrink due to a different address for start
847 which changes the size of alignment insns between START and END.
848 KNOWN_ALIGN_LOG is the alignment known for START.
849 GROWTH should be ~0 if the objective is to compute potential code size
850 increase, and 0 if the objective is to compute potential shrink.
851 The return value is undefined for any other value of GROWTH. */
852
853static int
854align_fuzz (start, end, known_align_log, growth)
855 rtx start, end;
856 int known_align_log;
857 unsigned growth;
858{
859 int uid = INSN_UID (start);
860 rtx align_label;
861 int known_align = 1 << known_align_log;
862 int end_shuid = INSN_SHUID (end);
863 int fuzz = 0;
864
865 for (align_label = uid_align[uid]; align_label; align_label = uid_align[uid])
--- 22 unchanged lines hidden (view full) ---
888 branch shortening pass, minus a value to account for possible size
889 increase due to alignment. For a backward branch, it is the start
890 address of the branch as known from the current pass, plus a value
891 to account for possible size increase due to alignment.
892 NB.: Therefore, the maximum offset allowed for backward branches needs
893 to exclude the branch size. */
894
895int
896insn_current_reference_address (branch)
897 rtx branch;
898{
899 rtx dest, seq;
900 int seq_uid;
901
902 if (! INSN_ADDRESSES_SET_P ())
903 return 0;
904
905 seq = NEXT_INSN (PREV_INSN (branch));
--- 20 unchanged lines hidden (view full) ---
926 /* Backward branch. */
927 return (insn_current_address
928 + align_fuzz (dest, seq, length_unit_log, ~0));
929 }
930}
931#endif /* HAVE_ATTR_length */
932
933void
934compute_alignments ()
935{
936 int log, max_skip, max_log;
937 basic_block bb;
938
939 if (label_align)
940 {
941 free (label_align);
942 label_align = 0;
943 }
944
945 max_labelno = max_label_num ();
946 min_labelno = get_first_label_num ();
947 label_align = (struct label_alignment *)
948 xcalloc (max_labelno - min_labelno + 1, sizeof (struct label_alignment));
949
950 /* If not optimizing or optimizing for size, don't assign any alignments. */
951 if (! optimize || optimize_size)
952 return;
953
954 FOR_EACH_BB (bb)
955 {
956 rtx label = bb->head;
957 int fallthru_frequency = 0, branch_frequency = 0, has_fallthru = 0;
958 edge e;
959
960 if (GET_CODE (label) != CODE_LABEL)
961 continue;
962 max_log = LABEL_ALIGN (label);
963 max_skip = LABEL_ALIGN_MAX_SKIP;
964
965 for (e = bb->pred; e; e = e->pred_next)
966 {
967 if (e->flags & EDGE_FALLTHRU)
968 has_fallthru = 1, fallthru_frequency += EDGE_FREQUENCY (e);
--- 22 unchanged lines hidden (view full) ---
991 {
992 max_log = log;
993 max_skip = JUMP_ALIGN_MAX_SKIP;
994 }
995 }
996 /* In case block is frequent and reached mostly by non-fallthru edge,
997 align it. It is most likely a first block of loop. */
998 if (has_fallthru
999 && branch_frequency + fallthru_frequency > BB_FREQ_MAX / 10
1000 && branch_frequency > fallthru_frequency * 2)
1001 {
1002 log = LOOP_ALIGN (label);
1003 if (max_log < log)
1004 {
1005 max_log = log;
1006 max_skip = LOOP_ALIGN_MAX_SKIP;
1007 }
1008 }
1009 LABEL_TO_ALIGNMENT (label) = max_log;
1010 LABEL_TO_MAX_SKIP (label) = max_skip;
1011 }
1012}
1013
1014/* Make a pass over all insns and compute their actual lengths by shortening
1015 any branches of variable length if possible. */
1016
1017/* Give a default value for the lowest address in a function. */
1018
1019#ifndef FIRST_INSN_ADDRESS
1020#define FIRST_INSN_ADDRESS 0
1021#endif
1022
1023/* shorten_branches might be called multiple times: for example, the SH
1024 port splits out-of-range conditional branches in MACHINE_DEPENDENT_REORG.
1025 In order to do this, it needs proper length information, which it obtains
1026 by calling shorten_branches. This cannot be collapsed with
1027 shorten_branches itself into a single pass unless we also want to integrate
1028 reorg.c, since the branch splitting exposes new instructions with delay
1029 slots. */
1030
1031void
1032shorten_branches (first)
1033 rtx first ATTRIBUTE_UNUSED;
1034{
1035 rtx insn;
1036 int max_uid;
1037 int i;
1038 int max_log;
1039 int max_skip;
1040#ifdef HAVE_ATTR_length
1041#define MAX_CODE_ALIGN 16
--- 4 unchanged lines hidden (view full) ---
1046 int uid;
1047 rtx align_tab[MAX_CODE_ALIGN];
1048
1049#endif
1050
1051 /* Compute maximum UID and allocate label_align / uid_shuid. */
1052 max_uid = get_max_uid ();
1053
1054 uid_shuid = (int *) xmalloc (max_uid * sizeof *uid_shuid);
1055
1056 if (max_labelno != max_label_num ())
1057 {
1058 int old = max_labelno;
1059 int n_labels;
1060 int n_old_labels;
1061
1062 max_labelno = max_label_num ();
1063
1064 n_labels = max_labelno - min_labelno + 1;
1065 n_old_labels = old - min_labelno + 1;
1066
1067 label_align = (struct label_alignment *) xrealloc
1068 (label_align, n_labels * sizeof (struct label_alignment));
1069
1070 /* Range of labels grows monotonically in the function. Abort here
1071 means that the initialization of array got lost. */
1072 if (n_old_labels > n_labels)
1073 abort ();
1074
1075 memset (label_align + n_old_labels, 0,
1076 (n_labels - n_old_labels) * sizeof (struct label_alignment));
--- 78 unchanged lines hidden (view full) ---
1155 }
1156 break;
1157 }
1158 }
1159 }
1160#ifdef HAVE_ATTR_length
1161
1162 /* Allocate the rest of the arrays. */
1163 insn_lengths = (int *) xmalloc (max_uid * sizeof (*insn_lengths));
1164 insn_lengths_max_uid = max_uid;
1165 /* Syntax errors can lead to labels being outside of the main insn stream.
1166 Initialize insn_addresses, so that we get reproducible results. */
1167 INSN_ADDRESSES_ALLOC (max_uid);
1168
1169 varying_length = (char *) xcalloc (max_uid, sizeof (char));
1170
1171 /* Initialize uid_align. We scan instructions
1172 from end to start, and keep in align_tab[n] the last seen insn
1173 that does an alignment of at least n+1, i.e. the successor
1174 in the alignment chain for an insn that does / has a known
1175 alignment of n. */
1176 uid_align = (rtx *) xcalloc (max_uid, sizeof *uid_align);
1177
1178 for (i = MAX_CODE_ALIGN; --i >= 0;)
1179 align_tab[i] = NULL_RTX;
1180 seq = get_last_insn ();
1181 for (; seq; seq = PREV_INSN (seq))
1182 {
1183 int uid = INSN_UID (seq);
1184 int log;
--- 60 unchanged lines hidden (view full) ---
1245 flags.min_after_base = min > rel;
1246 flags.max_after_base = max > rel;
1247 ADDR_DIFF_VEC_FLAGS (pat) = flags;
1248 }
1249 }
1250#endif /* CASE_VECTOR_SHORTEN_MODE */
1251
1252 /* Compute initial lengths, addresses, and varying flags for each insn. */
1253 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1254 insn != 0;
1255 insn_current_address += insn_lengths[uid], insn = NEXT_INSN (insn))
1256 {
1257 uid = INSN_UID (insn);
1258
1259 insn_lengths[uid] = 0;
1260
1261 if (GET_CODE (insn) == CODE_LABEL)
--- 84 unchanged lines hidden (view full) ---
1346 /* Now loop over all the insns finding varying length insns. For each,
1347 get the current insn length. If it has changed, reflect the change.
1348 When nothing changes for a full pass, we are done. */
1349
1350 while (something_changed)
1351 {
1352 something_changed = 0;
1353 insn_current_align = MAX_CODE_ALIGN - 1;
1354 for (insn_current_address = FIRST_INSN_ADDRESS, insn = first;
1355 insn != 0;
1356 insn = NEXT_INSN (insn))
1357 {
1358 int new_length;
1359#ifdef ADJUST_INSN_LENGTH
1360 int tmp_length;
1361#endif
1362 int length_align;
--- 217 unchanged lines hidden (view full) ---
1580}
1581
1582#ifdef HAVE_ATTR_length
1583/* Given the body of an INSN known to be generated by an ASM statement, return
1584 the number of machine instructions likely to be generated for this insn.
1585 This is used to compute its length. */
1586
1587static int
1588asm_insn_count (body)
1589 rtx body;
1590{
1591 const char *template;
1592 int count = 1;
1593
1594 if (GET_CODE (body) == ASM_INPUT)
1595 template = XSTR (body, 0);
1596 else
1597 template = decode_asm_operands (body, NULL, NULL, NULL, NULL);
--- 12 unchanged lines hidden (view full) ---
1610 assembler pseudo-ops have already been output in `assemble_start_function'.
1611
1612 FIRST is the first insn of the rtl for the function being compiled.
1613 FILE is the file to write assembler code to.
1614 OPTIMIZE is nonzero if we should eliminate redundant
1615 test and compare insns. */
1616
1617void
1618final_start_function (first, file, optimize)
1619 rtx first;
1620 FILE *file;
1621 int optimize ATTRIBUTE_UNUSED;
1622{
1623 block_depth = 0;
1624
1625 this_is_asm_operands = 0;
1626
1627#ifdef NON_SAVING_SETJMP
1628 /* A function that calls setjmp should save and restore all the
1629 call-saved registers on a system where longjmp clobbers them. */
1630 if (NON_SAVING_SETJMP && current_function_calls_setjmp)
1631 {
1632 int i;
1633
1634 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1635 if (!call_used_regs[i])
1636 regs_ever_live[i] = 1;
1637 }
1638#endif
1639
1640 if (NOTE_LINE_NUMBER (first) != NOTE_INSN_DELETED)
1641 notice_source_line (first);
1642 high_block_linenum = high_function_linenum = last_linenum;
1643
1644 (*debug_hooks->begin_prologue) (last_linenum, last_filename);
1645
1646#if defined (DWARF2_UNWIND_INFO) || defined (IA64_UNWIND_INFO)
1647 if (write_symbols != DWARF2_DEBUG && write_symbols != VMS_AND_DWARF2_DEBUG)
1648 dwarf2out_begin_prologue (0, NULL);
1649#endif
--- 15 unchanged lines hidden (view full) ---
1665 dwarf2out_frame_debug (NULL_RTX);
1666#endif
1667
1668 /* If debugging, assign block numbers to all of the blocks in this
1669 function. */
1670 if (write_symbols)
1671 {
1672 remove_unnecessary_notes ();
1673 scope_to_insns_finalize ();
1674 number_blocks (current_function_decl);
1675 /* We never actually put out begin/end notes for the top-level
1676 block in the function. But, conceptually, that block is
1677 always needed. */
1678 TREE_ASM_WRITTEN (DECL_INITIAL (current_function_decl)) = 1;
1679 }
1680
1681 /* First output the function prologue: code to set up the stack frame. */
1682 (*targetm.asm_out.function_prologue) (file, get_frame_size ());
1683
1684 /* If the machine represents the prologue as RTL, the profiling code must
1685 be emitted when NOTE_INSN_PROLOGUE_END is scanned. */
1686#ifdef HAVE_prologue
1687 if (! HAVE_prologue)
1688#endif
1689 profile_after_prologue (file);
1690}
1691
1692static void
1693profile_after_prologue (file)
1694 FILE *file ATTRIBUTE_UNUSED;
1695{
1696#ifndef PROFILE_BEFORE_PROLOGUE
1697 if (current_function_profile)
1698 profile_function (file);
1699#endif /* not PROFILE_BEFORE_PROLOGUE */
1700}
1701
1702static void
1703profile_function (file)
1704 FILE *file ATTRIBUTE_UNUSED;
1705{
1706#ifndef NO_PROFILE_COUNTERS
1707 int align = MIN (BIGGEST_ALIGNMENT, LONG_TYPE_SIZE);
1708#endif
1709#if defined(ASM_OUTPUT_REG_PUSH)
1710#if defined(STRUCT_VALUE_INCOMING_REGNUM) || defined(STRUCT_VALUE_REGNUM)
1711 int sval = current_function_returns_struct;
1712#endif
1713#if defined(STATIC_CHAIN_INCOMING_REGNUM) || defined(STATIC_CHAIN_REGNUM)
1714 int cxt = current_function_needs_context;
1715#endif
1716#endif /* ASM_OUTPUT_REG_PUSH */
1717
1718#ifndef NO_PROFILE_COUNTERS
1719 data_section ();
1720 ASM_OUTPUT_ALIGN (file, floor_log2 (align / BITS_PER_UNIT));
1721 ASM_OUTPUT_INTERNAL_LABEL (file, "LP", current_function_funcdef_no);
1722 assemble_integer (const0_rtx, LONG_TYPE_SIZE / BITS_PER_UNIT, align, 1);
1723#endif
1724
1725 function_section (current_function_decl);
1726
1727#if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1728 if (sval)
1729 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_INCOMING_REGNUM);
1730#else
1731#if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1732 if (sval)
1733 {
1734 ASM_OUTPUT_REG_PUSH (file, STRUCT_VALUE_REGNUM);
1735 }
1736#endif
1737#endif
1738
1739#if defined(STATIC_CHAIN_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1740 if (cxt)
1741 ASM_OUTPUT_REG_PUSH (file, STATIC_CHAIN_INCOMING_REGNUM);
1742#else
1743#if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1744 if (cxt)
1745 {
--- 11 unchanged lines hidden (view full) ---
1757#if defined(STATIC_CHAIN_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1758 if (cxt)
1759 {
1760 ASM_OUTPUT_REG_POP (file, STATIC_CHAIN_REGNUM);
1761 }
1762#endif
1763#endif
1764
1765#if defined(STRUCT_VALUE_INCOMING_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1766 if (sval)
1767 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_INCOMING_REGNUM);
1768#else
1769#if defined(STRUCT_VALUE_REGNUM) && defined(ASM_OUTPUT_REG_PUSH)
1770 if (sval)
1771 {
1772 ASM_OUTPUT_REG_POP (file, STRUCT_VALUE_REGNUM);
1773 }
1774#endif
1775#endif
1776}
1777
1778/* Output assembler code for the end of a function.
1779 For clarity, args are same as those of `final_start_function'
1780 even though not all of them are needed. */
1781
1782void
1783final_end_function ()
1784{
1785 app_disable ();
1786
1787 (*debug_hooks->end_function) (high_function_linenum);
1788
1789 /* Finally, output the function epilogue:
1790 code to restore the stack frame and return to the caller. */
1791 (*targetm.asm_out.function_epilogue) (asm_out_file, get_frame_size ());
--- 15 unchanged lines hidden (view full) ---
1807 just scanning as if we were outputting.
1808 Prescanning deletes and rearranges insns just like ordinary output.
1809 PRESCAN is -2 if we are outputting after having prescanned.
1810 In this case, don't try to delete or rearrange insns
1811 because that has already been done.
1812 Prescanning is done only on certain machines. */
1813
1814void
1815final (first, file, optimize, prescan)
1816 rtx first;
1817 FILE *file;
1818 int optimize;
1819 int prescan;
1820{
1821 rtx insn;
1822 int max_line = 0;
1823 int max_uid = 0;
1824
1825 last_ignored_compare = 0;
1826 new_block = 1;
1827
1828 /* Make a map indicating which line numbers appear in this function.
1829 When producing SDB debugging info, delete troublesome line number
1830 notes from inlined functions in other files as well as duplicate
1831 line number notes. */
1832#ifdef SDB_DEBUGGING_INFO
1833 if (write_symbols == SDB_DEBUG)
1834 {
1835 rtx last = 0;
1836 for (insn = first; insn; insn = NEXT_INSN (insn))
1837 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1838 {
1839 if ((RTX_INTEGRATED_P (insn)
1840 && strcmp (NOTE_SOURCE_FILE (insn), main_input_filename) != 0)
1841 || (last != 0
1842 && NOTE_LINE_NUMBER (insn) == NOTE_LINE_NUMBER (last)
1843 && NOTE_SOURCE_FILE (insn) == NOTE_SOURCE_FILE (last)))
1844 {
1845 delete_insn (insn); /* Use delete_note. */
1846 continue;
1847 }
1848 last = insn;
1849 if (NOTE_LINE_NUMBER (insn) > max_line)
1850 max_line = NOTE_LINE_NUMBER (insn);
1851 }
1852 }
1853 else
1854#endif
1855 {
1856 for (insn = first; insn; insn = NEXT_INSN (insn))
1857 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > max_line)
1858 max_line = NOTE_LINE_NUMBER (insn);
1859 }
1860
1861 line_note_exists = (char *) xcalloc (max_line + 1, sizeof (char));
1862
1863 for (insn = first; insn; insn = NEXT_INSN (insn))
1864 {
1865 if (INSN_UID (insn) > max_uid) /* find largest UID */
1866 max_uid = INSN_UID (insn);
1867 if (GET_CODE (insn) == NOTE && NOTE_LINE_NUMBER (insn) > 0)
1868 line_note_exists[NOTE_LINE_NUMBER (insn)] = 1;
1869#ifdef HAVE_cc0
1870 /* If CC tracking across branches is enabled, record the insn which
1871 jumps to each branch only reached from one place. */
1872 if (optimize && GET_CODE (insn) == JUMP_INSN)
1873 {
1874 rtx lab = JUMP_LABEL (insn);
1875 if (lab && LABEL_NUSES (lab) == 1)
1876 {
--- 19 unchanged lines hidden (view full) ---
1896 insn_current_address = -1;
1897 else
1898 abort ();
1899 }
1900 else
1901 insn_current_address = INSN_ADDRESSES (INSN_UID (insn));
1902#endif /* HAVE_ATTR_length */
1903
1904 insn = final_scan_insn (insn, file, optimize, prescan, 0);
1905 }
1906
1907 /* Store function names for edge-profiling. */
1908 /* ??? Probably should re-use the existing struct function. */
1909
1910 if (cfun->arc_profile)
1911 {
1912 struct function_list *new_item = xmalloc (sizeof (struct function_list));
1913
1914 *functions_tail = new_item;
1915 functions_tail = &new_item->next;
1916
1917 new_item->next = 0;
1918 new_item->name = xstrdup (IDENTIFIER_POINTER
1919 (DECL_ASSEMBLER_NAME (current_function_decl)));
1920 new_item->cfg_checksum = profile_info.current_function_cfg_checksum;
1921 new_item->count_edges = profile_info.count_edges_instrumented_now;
1922 }
1923
1924 free (line_note_exists);
1925 line_note_exists = NULL;
1926}
1927
1928const char *
1929get_insn_template (code, insn)
1930 int code;
1931 rtx insn;
1932{
1933 const void *output = insn_data[code].output;
1934 switch (insn_data[code].output_format)
1935 {
1936 case INSN_OUTPUT_FORMAT_SINGLE:
1937 return (const char *) output;
1938 case INSN_OUTPUT_FORMAT_MULTI:
1939 return ((const char *const *) output)[which_alternative];
1940 case INSN_OUTPUT_FORMAT_FUNCTION:
1941 if (insn == NULL)
1942 abort ();
1943 return (*(insn_output_fn) output) (recog_data.operand, insn);
1944
1945 default:
1946 abort ();
1947 }
1948}
1949
1950/* Emit the appropriate declaration for an alternate-entry-point
1951 symbol represented by INSN, to FILE. INSN is a CODE_LABEL with
1952 LABEL_KIND != LABEL_NORMAL.
1953
1954 The case fall-through in this function is intentional. */
1955static void
1956output_alternate_entry_point (file, insn)
1957 FILE *file;
1958 rtx insn;
1959{
1960 const char *name = LABEL_NAME (insn);
1961
1962 switch (LABEL_KIND (insn))
1963 {
1964 case LABEL_WEAK_ENTRY:
1965#ifdef ASM_WEAKEN_LABEL
1966 ASM_WEAKEN_LABEL (file, name);
--- 14 unchanged lines hidden (view full) ---
1981}
1982
1983/* The final scan for one insn, INSN.
1984 Args are same as in `final', except that INSN
1985 is the insn being scanned.
1986 Value returned is the next insn to be scanned.
1987
1988 NOPEEPHOLES is the flag to disallow peephole processing (currently
1989 used for within delayed branch sequence output). */
1990
1991rtx
1992final_scan_insn (insn, file, optimize, prescan, nopeepholes)
1993 rtx insn;
1994 FILE *file;
1995 int optimize ATTRIBUTE_UNUSED;
1996 int prescan;
1997 int nopeepholes ATTRIBUTE_UNUSED;
1998{
1999#ifdef HAVE_cc0
2000 rtx set;
2001#endif
2002
2003 insn_counter++;
2004
2005 /* Ignore deleted insns. These can occur when we split insns (due to a
--- 22 unchanged lines hidden (view full) ---
2028
2029 case NOTE_INSN_BASIC_BLOCK:
2030#ifdef IA64_UNWIND_INFO
2031 IA64_UNWIND_EMIT (asm_out_file, insn);
2032#endif
2033 if (flag_debug_asm)
2034 fprintf (asm_out_file, "\t%s basic block %d\n",
2035 ASM_COMMENT_START, NOTE_BASIC_BLOCK (insn)->index);
2036 break;
2037
2038 case NOTE_INSN_EH_REGION_BEG:
2039 ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHB",
2040 NOTE_EH_HANDLER (insn));
2041 break;
2042
2043 case NOTE_INSN_EH_REGION_END:
2044 ASM_OUTPUT_DEBUG_LABEL (asm_out_file, "LEHE",
2045 NOTE_EH_HANDLER (insn));
2046 break;
2047
2048 case NOTE_INSN_PROLOGUE_END:
2049 (*targetm.asm_out.function_end_prologue) (file);
2050 profile_after_prologue (file);
2051 break;
2052
2053 case NOTE_INSN_EPILOGUE_BEG:
2054 (*targetm.asm_out.function_begin_epilogue) (file);
2055 break;
2056
2057 case NOTE_INSN_FUNCTION_BEG:
2058 app_disable ();
2059 (*debug_hooks->end_prologue) (last_linenum, last_filename);
2060 break;
2061
2062 case NOTE_INSN_BLOCK_BEG:
2063 if (debug_info_level == DINFO_LEVEL_NORMAL
2064 || debug_info_level == DINFO_LEVEL_VERBOSE
2065 || write_symbols == DWARF_DEBUG
2066 || write_symbols == DWARF2_DEBUG
2067 || write_symbols == VMS_AND_DWARF2_DEBUG
--- 42 unchanged lines hidden (view full) ---
2110 break;
2111
2112 case 0:
2113 break;
2114
2115 default:
2116 if (NOTE_LINE_NUMBER (insn) <= 0)
2117 abort ();
2118
2119 /* This note is a line-number. */
2120 {
2121 rtx note;
2122 int note_after = 0;
2123
2124 /* If there is anything real after this note, output it.
2125 If another line note follows, omit this one. */
2126 for (note = NEXT_INSN (insn); note; note = NEXT_INSN (note))
2127 {
2128 if (GET_CODE (note) != NOTE && GET_CODE (note) != CODE_LABEL)
2129 break;
2130
2131 /* These types of notes can be significant
2132 so make sure the preceding line number stays. */
2133 else if (GET_CODE (note) == NOTE
2134 && (NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_BEG
2135 || NOTE_LINE_NUMBER (note) == NOTE_INSN_BLOCK_END
2136 || NOTE_LINE_NUMBER (note) == NOTE_INSN_FUNCTION_BEG))
2137 break;
2138 else if (GET_CODE (note) == NOTE && NOTE_LINE_NUMBER (note) > 0)
2139 {
2140 /* Another line note follows; we can delete this note
2141 if no intervening line numbers have notes elsewhere. */
2142 int num;
2143 for (num = NOTE_LINE_NUMBER (insn) + 1;
2144 num < NOTE_LINE_NUMBER (note);
2145 num++)
2146 if (line_note_exists[num])
2147 break;
2148
2149 if (num >= NOTE_LINE_NUMBER (note))
2150 note_after = 1;
2151 break;
2152 }
2153 }
2154
2155 /* Output this line note if it is the first or the last line
2156 note in a row. */
2157 if (!note_after)
2158 {
2159 notice_source_line (insn);
2160 (*debug_hooks->source_line) (last_linenum, last_filename);
2161 }
2162 }
2163 break;
2164 }
2165 break;
2166
2167 case BARRIER:
2168#if defined (DWARF2_UNWIND_INFO)
2169 if (dwarf2out_do_frame ())
2170 dwarf2out_frame_debug (insn);
--- 47 unchanged lines hidden (view full) ---
2218 {
2219 NOTICE_UPDATE_CC (PATTERN (prev), prev);
2220 NOTICE_UPDATE_CC (PATTERN (jump), jump);
2221 }
2222 }
2223#endif
2224 if (prescan > 0)
2225 break;
2226 new_block = 1;
2227
2228#ifdef FINAL_PRESCAN_LABEL
2229 FINAL_PRESCAN_INSN (insn, NULL, 0);
2230#endif
2231
2232 if (LABEL_NAME (insn))
2233 (*debug_hooks->label) (insn);
2234
2235 if (app_on)
2236 {
2237 fputs (ASM_APP_OFF, file);
2238 app_on = 0;
2239 }
--- 29 unchanged lines hidden (view full) ---
2269 }
2270 else
2271 function_section (current_function_decl);
2272
2273#ifdef ASM_OUTPUT_CASE_LABEL
2274 ASM_OUTPUT_CASE_LABEL (file, "L", CODE_LABEL_NUMBER (insn),
2275 NEXT_INSN (insn));
2276#else
2277 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2278#endif
2279#endif
2280 break;
2281 }
2282 }
2283 if (LABEL_ALT_ENTRY_P (insn))
2284 output_alternate_entry_point (file, insn);
2285 else
2286 ASM_OUTPUT_INTERNAL_LABEL (file, "L", CODE_LABEL_NUMBER (insn));
2287 break;
2288
2289 default:
2290 {
2291 rtx body = PATTERN (insn);
2292 int insn_code_number;
2293 const char *template;
2294 rtx note;
2295
2296 /* An INSN, JUMP_INSN or CALL_INSN.
2297 First check for special kinds that recog doesn't recognize. */
2298
2299 if (GET_CODE (body) == USE /* These are just declarations */
2300 || GET_CODE (body) == CLOBBER)
2301 break;
2302
2303#ifdef HAVE_cc0
2304 /* If there is a REG_CC_SETTER note on this insn, it means that
2305 the setting of the condition code was done in the delay slot
2306 of the insn that branched here. So recover the cc status
2307 from the insn that set it. */
--- 73 unchanged lines hidden (view full) ---
2381 insn);
2382#endif
2383#endif
2384
2385 function_section (current_function_decl);
2386
2387 break;
2388 }
2389
2390 if (GET_CODE (body) == ASM_INPUT)
2391 {
2392 const char *string = XSTR (body, 0);
2393
2394 /* There's no telling what that did to the condition codes. */
2395 CC_STATUS_INIT;
2396 if (prescan > 0)
--- 10 unchanged lines hidden (view full) ---
2407 }
2408 break;
2409 }
2410
2411 /* Detect `asm' construct with operands. */
2412 if (asm_noperands (body) >= 0)
2413 {
2414 unsigned int noperands = asm_noperands (body);
2415 rtx *ops = (rtx *) alloca (noperands * sizeof (rtx));
2416 const char *string;
2417
2418 /* There's no telling what that did to the condition codes. */
2419 CC_STATUS_INIT;
2420 if (prescan > 0)
2421 break;
2422
2423 /* Get out the operand values. */
2424 string = decode_asm_operands (body, ops, NULL, NULL, NULL);
2425 /* Inhibit aborts on what would otherwise be compiler bugs. */
2426 insn_noperands = noperands;
2427 this_is_asm_operands = insn;
2428
2429 /* Output the insn using them. */
2430 if (string[0])
2431 {
2432 if (! app_on)
2433 {
2434 fputs (ASM_APP_ON, file);
2435 app_on = 1;
2436 }
--- 15 unchanged lines hidden (view full) ---
2452 /* A delayed-branch sequence */
2453 int i;
2454 rtx next;
2455
2456 if (prescan > 0)
2457 break;
2458 final_sequence = body;
2459
2460 /* The first insn in this SEQUENCE might be a JUMP_INSN that will
2461 force the restoration of a comparison that was previously
2462 thought unnecessary. If that happens, cancel this sequence
2463 and cause that insn to be restored. */
2464
2465 next = final_scan_insn (XVECEXP (body, 0, 0), file, 0, prescan, 1);
2466 if (next != XVECEXP (body, 0, 1))
2467 {
2468 final_sequence = 0;
2469 return next;
2470 }
2471
2472 for (i = 1; i < XVECLEN (body, 0); i++)
2473 {
2474 rtx insn = XVECEXP (body, 0, i);
2475 rtx next = NEXT_INSN (insn);
2476 /* We loop in case any instruction in a delay slot gets
2477 split. */
2478 do
2479 insn = final_scan_insn (insn, file, 0, prescan, 1);
2480 while (insn != next);
2481 }
2482#ifdef DBR_OUTPUT_SEQEND
2483 DBR_OUTPUT_SEQEND (file);
2484#endif
2485 final_sequence = 0;
2486
2487 /* If the insn requiring the delay slot was a CALL_INSN, the
--- 20 unchanged lines hidden (view full) ---
2508 This is done only when optimizing; if not optimizing,
2509 it should be possible for the user to alter a variable
2510 with the debugger in between statements
2511 and the next statement should reexamine the variable
2512 to compute the condition codes. */
2513
2514 if (optimize)
2515 {
2516#if 0
2517 rtx set = single_set (insn);
2518#endif
2519
2520 if (set
2521 && GET_CODE (SET_DEST (set)) == CC0
2522 && insn != last_ignored_compare)
2523 {
2524 if (GET_CODE (SET_SRC (set)) == SUBREG)
2525 SET_SRC (set) = alter_subreg (&SET_SRC (set));
2526 else if (GET_CODE (SET_SRC (set)) == COMPARE)
2527 {
--- 151 unchanged lines hidden (view full) ---
2679 /* When peepholing, if there were notes within the peephole,
2680 emit them before the peephole. */
2681 if (next != 0 && next != NEXT_INSN (insn))
2682 {
2683 rtx prev = PREV_INSN (insn);
2684
2685 for (note = NEXT_INSN (insn); note != next;
2686 note = NEXT_INSN (note))
2687 final_scan_insn (note, file, optimize, prescan, nopeepholes);
2688
2689 /* In case this is prescan, put the notes
2690 in proper position for later rescan. */
2691 note = NEXT_INSN (insn);
2692 PREV_INSN (note) = prev;
2693 NEXT_INSN (prev) = note;
2694 NEXT_INSN (PREV_INSN (next)) = insn;
2695 PREV_INSN (insn) = PREV_INSN (next);
--- 64 unchanged lines hidden (view full) ---
2760 which follows a deleted test insn, and that test insn
2761 needs to be reinserted. */
2762 if (template == 0)
2763 {
2764 rtx prev;
2765
2766 if (prev_nonnote_insn (insn) != last_ignored_compare)
2767 abort ();
2768 new_block = 0;
2769
2770 /* We have already processed the notes between the setter and
2771 the user. Make sure we don't process them again, this is
2772 particularly important if one of the notes is a block
2773 scope note or an EH note. */
2774 for (prev = insn;
2775 prev != last_ignored_compare;
2776 prev = PREV_INSN (prev))
--- 17 unchanged lines hidden (view full) ---
2794
2795#ifdef HAVE_ATTR_length
2796 /* This instruction should have been split in shorten_branches,
2797 to ensure that we would have valid length info for the
2798 splitees. */
2799 abort ();
2800#endif
2801
2802 new_block = 0;
2803 return new;
2804 }
2805
2806 if (prescan > 0)
2807 break;
2808
2809#ifdef IA64_UNWIND_INFO
2810 IA64_UNWIND_EMIT (asm_out_file, insn);
2811#endif
2812 /* Output assembler code from the template. */
2813
2814 output_asm_insn (template, recog_data.operand);
2815
2816#if defined (DWARF2_UNWIND_INFO)
2817#if defined (HAVE_prologue)
2818 if (GET_CODE (insn) == INSN && dwarf2out_do_frame ())
2819 dwarf2out_frame_debug (insn);
2820#else
2821 if (!ACCUMULATE_OUTGOING_ARGS
2822 && GET_CODE (insn) == INSN
2823 && dwarf2out_do_frame ())
2824 dwarf2out_frame_debug (insn);
2825#endif
2826#endif
2827
2828#if 0
2829 /* It's not at all clear why we did this and doing so interferes
2830 with tests we'd like to do to use REG_WAS_0 notes, so let's try
2831 with this out. */
2832
2833 /* Mark this insn as having been output. */
2834 INSN_DELETED_P (insn) = 1;
2835#endif
2836
2837 /* Emit information for vtable gc. */
2838 note = find_reg_note (insn, REG_VTABLE_REF, NULL_RTX);
2839 if (note)
2840 assemble_vtable_entry (XEXP (XEXP (note, 0), 0),
2841 INTVAL (XEXP (XEXP (note, 0), 1)));
2842
2843 current_output_insn = debug_insn = 0;
2844 }
2845 }
2846 return NEXT_INSN (insn);
2847}
2848
2849/* Output debugging info to the assembler file FILE
2850 based on the NOTE-insn INSN, assumed to be a line number. */
2851
2852static void
2853notice_source_line (insn)
2854 rtx insn;
2855{
2856 const char *filename = NOTE_SOURCE_FILE (insn);
2857
2858 last_filename = filename;
2859 last_linenum = NOTE_LINE_NUMBER (insn);
2860 high_block_linenum = MAX (last_linenum, high_block_linenum);
2861 high_function_linenum = MAX (last_linenum, high_function_linenum);
2862}
2863
2864/* For each operand in INSN, simplify (subreg (reg)) so that it refers
2865 directly to the desired hard register. */
2866
2867void
2868cleanup_subreg_operands (insn)
2869 rtx insn;
2870{
2871 int i;
2872 extract_insn_cached (insn);
2873 for (i = 0; i < recog_data.n_operands; i++)
2874 {
2875 /* The following test cannot use recog_data.operand when tesing
2876 for a SUBREG: the underlying object might have been changed
2877 already if we are inside a match_operator expression that
2878 matches the else clause. Instead we test the underlying
2879 expression directly. */
2880 if (GET_CODE (*recog_data.operand_loc[i]) == SUBREG)
2881 recog_data.operand[i] = alter_subreg (recog_data.operand_loc[i]);
2882 else if (GET_CODE (recog_data.operand[i]) == PLUS
2883 || GET_CODE (recog_data.operand[i]) == MULT
--- 11 unchanged lines hidden (view full) ---
2895 *recog_data.dup_loc[i] = walk_alter_subreg (recog_data.dup_loc[i]);
2896 }
2897}
2898
2899/* If X is a SUBREG, replace it with a REG or a MEM,
2900 based on the thing it is a subreg of. */
2901
2902rtx
2903alter_subreg (xp)
2904 rtx *xp;
2905{
2906 rtx x = *xp;
2907 rtx y = SUBREG_REG (x);
2908
2909 /* simplify_subreg does not remove subreg from volatile references.
2910 We are required to. */
2911 if (GET_CODE (y) == MEM)
2912 *xp = adjust_address (y, GET_MODE (x), SUBREG_BYTE (x));
2913 else
2914 {
2915 rtx new = simplify_subreg (GET_MODE (x), y, GET_MODE (y),
2916 SUBREG_BYTE (x));
2917
2918 if (new != 0)
2919 *xp = new;
2920 /* Simplify_subreg can't handle some REG cases, but we have to. */
2921 else if (GET_CODE (y) == REG)
2922 {
2923 unsigned int regno = subreg_hard_regno (x, 1);
2924 PUT_CODE (x, REG);
2925 REGNO (x) = regno;
2926 ORIGINAL_REGNO (x) = ORIGINAL_REGNO (y);
2927 /* This field has a different meaning for REGs and SUBREGs. Make
2928 sure to clear it! */
2929 RTX_FLAG (x, used) = 0;
2930 }
2931 else
2932 abort ();
2933 }
2934
2935 return *xp;
2936}
2937
2938/* Do alter_subreg on all the SUBREGs contained in X. */
2939
2940static rtx
2941walk_alter_subreg (xp)
2942 rtx *xp;
2943{
2944 rtx x = *xp;
2945 switch (GET_CODE (x))
2946 {
2947 case PLUS:
2948 case MULT:
2949 XEXP (x, 0) = walk_alter_subreg (&XEXP (x, 0));
2950 XEXP (x, 1) = walk_alter_subreg (&XEXP (x, 1));
--- 20 unchanged lines hidden (view full) ---
2971 Not all of the bits there can be handled at this level in all cases.
2972
2973 The value is normally 0.
2974 1 means that the condition has become always true.
2975 -1 means that the condition has become always false.
2976 2 means that COND has been altered. */
2977
2978static int
2979alter_cond (cond)
2980 rtx cond;
2981{
2982 int value = 0;
2983
2984 if (cc_status.flags & CC_REVERSED)
2985 {
2986 value = 2;
2987 PUT_CODE (cond, swap_condition (GET_CODE (cond)));
2988 }
--- 136 unchanged lines hidden (view full) ---
3125 return value;
3126}
3127#endif
3128
3129/* Report inconsistency between the assembler template and the operands.
3130 In an `asm', it's the user's fault; otherwise, the compiler's fault. */
3131
3132void
3133output_operand_lossage VPARAMS ((const char *msgid, ...))
3134{
3135 char *fmt_string;
3136 char *new_message;
3137 const char *pfx_str;
3138 VA_OPEN (ap, msgid);
3139 VA_FIXEDARG (ap, const char *, msgid);
3140
3141 pfx_str = this_is_asm_operands ? _("invalid `asm': ") : "output_operand: ";
3142 asprintf (&fmt_string, "%s%s", pfx_str, _(msgid));
3143 vasprintf (&new_message, fmt_string, ap);
3144
3145 if (this_is_asm_operands)
3146 error_for_asm (this_is_asm_operands, "%s", new_message);
3147 else
3148 internal_error ("%s", new_message);
3149
3150 free (fmt_string);
3151 free (new_message);
3152 VA_CLOSE (ap);
3153}
3154
3155/* Output of assembler code from a template, and its subroutines. */
3156
3157/* Annotate the assembly with a comment describing the pattern and
3158 alternative used. */
3159
3160static void
3161output_asm_name ()
3162{
3163 if (debug_insn)
3164 {
3165 int num = INSN_CODE (debug_insn);
3166 fprintf (asm_out_file, "\t%s %d\t%s",
3167 ASM_COMMENT_START, INSN_UID (debug_insn),
3168 insn_data[num].name);
3169 if (insn_data[num].n_alternatives > 1)
--- 8 unchanged lines hidden (view full) ---
3178 }
3179}
3180
3181/* If OP is a REG or MEM and we can find a MEM_EXPR corresponding to it
3182 or its address, return that expr . Set *PADDRESSP to 1 if the expr
3183 corresponds to the address of the object and 0 if to the object. */
3184
3185static tree
3186get_mem_expr_from_op (op, paddressp)
3187 rtx op;
3188 int *paddressp;
3189{
3190 tree expr;
3191 int inner_addressp;
3192
3193 *paddressp = 0;
3194
3195 if (op == NULL)
3196 return 0;
3197
3198 if (GET_CODE (op) == REG && ORIGINAL_REGNO (op) >= FIRST_PSEUDO_REGISTER)
3199 return REGNO_DECL (ORIGINAL_REGNO (op));
3200 else if (GET_CODE (op) != MEM)
3201 return 0;
3202
3203 if (MEM_EXPR (op) != 0)
3204 return MEM_EXPR (op);
3205
3206 /* Otherwise we have an address, so indicate it and look at the address. */
3207 *paddressp = 1;
--- 16 unchanged lines hidden (view full) ---
3224 return inner_addressp ? 0 : expr;
3225}
3226
3227/* Output operand names for assembler instructions. OPERANDS is the
3228 operand vector, OPORDER is the order to write the operands, and NOPS
3229 is the number of operands to write. */
3230
3231static void
3232output_asm_operand_names (operands, oporder, nops)
3233 rtx *operands;
3234 int *oporder;
3235 int nops;
3236{
3237 int wrote = 0;
3238 int i;
3239
3240 for (i = 0; i < nops; i++)
3241 {
3242 int addressp;
3243 tree expr = get_mem_expr_from_op (operands[oporder[i]], &addressp);
3244
3245 if (expr)
3246 {
3247 fprintf (asm_out_file, "%c%s %s",
3248 wrote ? ',' : '\t', wrote ? "" : ASM_COMMENT_START,
3249 addressp ? "*" : "");
3250 print_mem_expr (asm_out_file, expr);
3251 wrote = 1;
3252 }
3253 }
3254}
3255
3256/* Output text from TEMPLATE to the assembler output file,
3257 obeying %-directions to substitute operands taken from
3258 the vector OPERANDS.
3259
3260 %N (for N a digit) means print operand N in usual manner.
--- 4 unchanged lines hidden (view full) ---
3265 %aN means expect operand N to be a memory address
3266 (not a memory reference!) and print a reference
3267 to that address.
3268 %nN means expect operand N to be a constant
3269 and print a constant expression for minus the value
3270 of the operand, with no other punctuation. */
3271
3272void
3273output_asm_insn (template, operands)
3274 const char *template;
3275 rtx *operands;
3276{
3277 const char *p;
3278 int c;
3279#ifdef ASSEMBLER_DIALECT
3280 int dialect = 0;
3281#endif
3282 int oporder[MAX_RECOG_OPERANDS];
3283 char opoutput[MAX_RECOG_OPERANDS];
--- 189 unchanged lines hidden (view full) ---
3473 output_asm_name ();
3474
3475 putc ('\n', asm_out_file);
3476}
3477
3478/* Output a LABEL_REF, or a bare CODE_LABEL, as an assembler symbol. */
3479
3480void
3481output_asm_label (x)
3482 rtx x;
3483{
3484 char buf[256];
3485
3486 if (GET_CODE (x) == LABEL_REF)
3487 x = XEXP (x, 0);
3488 if (GET_CODE (x) == CODE_LABEL
3489 || (GET_CODE (x) == NOTE
3490 && NOTE_LINE_NUMBER (x) == NOTE_INSN_DELETED_LABEL))
--- 10 unchanged lines hidden (view full) ---
3501 such as 'z' if the spec was `%z3'. CODE is 0 if there was no char
3502 between the % and the digits.
3503 When CODE is a non-letter, X is 0.
3504
3505 The meanings of the letters are machine-dependent and controlled
3506 by PRINT_OPERAND. */
3507
3508static void
3509output_operand (x, code)
3510 rtx x;
3511 int code ATTRIBUTE_UNUSED;
3512{
3513 if (x && GET_CODE (x) == SUBREG)
3514 x = alter_subreg (&x);
3515
3516 /* If X is a pseudo-register, abort now rather than writing trash to the
3517 assembler file. */
3518
3519 if (x && GET_CODE (x) == REG && REGNO (x) >= FIRST_PSEUDO_REGISTER)
3520 abort ();
3521
3522 PRINT_OPERAND (asm_out_file, x, code);
3523}
3524
3525/* Print a memory reference operand for address X
3526 using machine-dependent assembler syntax.
3527 The macro PRINT_OPERAND_ADDRESS exists just to control this function. */
3528
3529void
3530output_address (x)
3531 rtx x;
3532{
3533 walk_alter_subreg (&x);
3534 PRINT_OPERAND_ADDRESS (asm_out_file, x);
3535}
3536
3537/* Print an integer constant expression in assembler syntax.
3538 Addition and subtraction are the only arithmetic
3539 that may appear in these expressions. */
3540
3541void
3542output_addr_const (file, x)
3543 FILE *file;
3544 rtx x;
3545{
3546 char buf[256];
3547
3548 restart:
3549 switch (GET_CODE (x))
3550 {
3551 case PC:
3552 putc ('.', file);
--- 105 unchanged lines hidden (view full) ---
3658}
3659
3660/* A poor man's fprintf, with the added features of %I, %R, %L, and %U.
3661 %R prints the value of REGISTER_PREFIX.
3662 %L prints the value of LOCAL_LABEL_PREFIX.
3663 %U prints the value of USER_LABEL_PREFIX.
3664 %I prints the value of IMMEDIATE_PREFIX.
3665 %O runs ASM_OUTPUT_OPCODE to transform what follows in the string.
3666 Also supported are %d, %x, %s, %e, %f, %g and %%.
3667
3668 We handle alternate assembler dialects here, just like output_asm_insn. */
3669
3670void
3671asm_fprintf VPARAMS ((FILE *file, const char *p, ...))
3672{
3673 char buf[10];
3674 char *q, c;
3675
3676 VA_OPEN (argptr, p);
3677 VA_FIXEDARG (argptr, FILE *, file);
3678 VA_FIXEDARG (argptr, const char *, p);
3679
3680 buf[0] = '%';
3681
3682 while ((c = *p++))
3683 switch (c)
3684 {
3685#ifdef ASSEMBLER_DIALECT
3686 case '{':
--- 21 unchanged lines hidden (view full) ---
3708
3709 case '}':
3710 break;
3711#endif
3712
3713 case '%':
3714 c = *p++;
3715 q = &buf[1];
3716 while (ISDIGIT (c) || c == '.')
3717 {
3718 *q++ = c;
3719 c = *p++;
3720 }
3721 switch (c)
3722 {
3723 case '%':
3724 fprintf (file, "%%");
3725 break;
3726
3727 case 'd': case 'i': case 'u':
3728 case 'x': case 'p': case 'X':
3729 case 'o':
3730 *q++ = c;
3731 *q = 0;
3732 fprintf (file, buf, va_arg (argptr, int));
3733 break;
3734
3735 case 'w':
3736 /* This is a prefix to the 'd', 'i', 'u', 'x', 'p', and 'X' cases,
3737 but we do not check for those cases. It means that the value
3738 is a HOST_WIDE_INT, which may be either `int' or `long'. */
3739
3740#if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
3741#else
3742#if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
3743 *q++ = 'l';
3744#else
3745 *q++ = 'l';
3746 *q++ = 'l';
3747#endif
3748#endif
3749
3750 *q++ = *p++;
3751 *q = 0;
3752 fprintf (file, buf, va_arg (argptr, HOST_WIDE_INT));
3753 break;
3754
3755 case 'l':
3756 *q++ = c;
3757 *q++ = *p++;
3758 *q = 0;
3759 fprintf (file, buf, va_arg (argptr, long));
3760 break;
3761
3762 case 'e':
3763 case 'f':
3764 case 'g':
3765 *q++ = c;
3766 *q = 0;
3767 fprintf (file, buf, va_arg (argptr, double));
3768 break;
3769
3770 case 's':
3771 *q++ = c;
3772 *q = 0;
3773 fprintf (file, buf, va_arg (argptr, char *));
3774 break;
3775
--- 21 unchanged lines hidden (view full) ---
3797#endif
3798 break;
3799
3800 case 'U':
3801 fputs (user_label_prefix, file);
3802 break;
3803
3804#ifdef ASM_FPRINTF_EXTENSIONS
3805 /* Upper case letters are reserved for general use by asm_fprintf
3806 and so are not available to target specific code. In order to
3807 prevent the ASM_FPRINTF_EXTENSIONS macro from using them then,
3808 they are defined here. As they get turned into real extensions
3809 to asm_fprintf they should be removed from this list. */
3810 case 'A': case 'B': case 'C': case 'D': case 'E':
3811 case 'F': case 'G': case 'H': case 'J': case 'K':
3812 case 'M': case 'N': case 'P': case 'Q': case 'S':
3813 case 'T': case 'V': case 'W': case 'Y': case 'Z':
3814 break;
3815
3816 ASM_FPRINTF_EXTENSIONS (file, argptr, p)
3817#endif
3818 default:
3819 abort ();
3820 }
3821 break;
3822
3823 default:
3824 fputc (c, file);
3825 }
3826 VA_CLOSE (argptr);
3827}
3828
3829/* Split up a CONST_DOUBLE or integer constant rtx
3830 into two rtx's for single words,
3831 storing in *FIRST the word that comes first in memory in the target
3832 and in *SECOND the other. */
3833
3834void
3835split_double (value, first, second)
3836 rtx value;
3837 rtx *first, *second;
3838{
3839 if (GET_CODE (value) == CONST_INT)
3840 {
3841 if (HOST_BITS_PER_WIDE_INT >= (2 * BITS_PER_WORD))
3842 {
3843 /* In this case the CONST_INT holds both target words.
3844 Extract the bits from it into two word-sized pieces.
3845 Sign extend each half to HOST_WIDE_INT. */
--- 122 unchanged lines hidden (view full) ---
3968 *first = GEN_INT ((HOST_WIDE_INT) l[0]);
3969 *second = GEN_INT ((HOST_WIDE_INT) l[1]);
3970 }
3971}
3972
3973/* Return nonzero if this function has no function calls. */
3974
3975int
3976leaf_function_p ()
3977{
3978 rtx insn;
3979 rtx link;
3980
3981 if (current_function_profile || profile_arc_flag)
3982 return 0;
3983
3984 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
--- 26 unchanged lines hidden (view full) ---
4011 return 1;
4012}
4013
4014/* Return 1 if branch is a forward branch.
4015 Uses insn_shuid array, so it works only in the final pass. May be used by
4016 output templates to customary add branch prediction hints.
4017 */
4018int
4019final_forward_branch_p (insn)
4020 rtx insn;
4021{
4022 int insn_id, label_id;
4023 if (!uid_shuid)
4024 abort ();
4025 insn_id = INSN_SHUID (insn);
4026 label_id = INSN_SHUID (JUMP_LABEL (insn));
4027 /* We've hit some insns that does not have id information available. */
4028 if (!insn_id || !label_id)
--- 11 unchanged lines hidden (view full) ---
4040 uses the "output" registers instead. */
4041
4042#ifdef LEAF_REGISTERS
4043
4044/* Return 1 if this function uses only the registers that can be
4045 safely renumbered. */
4046
4047int
4048only_leaf_regs_used ()
4049{
4050 int i;
4051 char *permitted_reg_in_leaf_functions = LEAF_REGISTERS;
4052
4053 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4054 if ((regs_ever_live[i] || global_regs[i])
4055 && ! permitted_reg_in_leaf_functions[i])
4056 return 0;
4057
4058 if (current_function_uses_pic_offset_table
4059 && pic_offset_table_rtx != 0
4060 && GET_CODE (pic_offset_table_rtx) == REG
4061 && ! permitted_reg_in_leaf_functions[REGNO (pic_offset_table_rtx)])
4062 return 0;
4063
4064 return 1;
4065}
4066
4067/* Scan all instructions and renumber all registers into those
4068 available in leaf functions. */
4069
4070static void
4071leaf_renumber_regs (first)
4072 rtx first;
4073{
4074 rtx insn;
4075
4076 /* Renumber only the actual patterns.
4077 The reg-notes can contain frame pointer refs,
4078 and renumbering them could crash, and should not be needed. */
4079 for (insn = first; insn; insn = NEXT_INSN (insn))
4080 if (INSN_P (insn))
--- 4 unchanged lines hidden (view full) ---
4085 if (INSN_P (XEXP (insn, 0)))
4086 leaf_renumber_regs_insn (PATTERN (XEXP (insn, 0)));
4087}
4088
4089/* Scan IN_RTX and its subexpressions, and renumber all regs into those
4090 available in leaf functions. */
4091
4092void
4093leaf_renumber_regs_insn (in_rtx)
4094 rtx in_rtx;
4095{
4096 int i, j;
4097 const char *format_ptr;
4098
4099 if (in_rtx == 0)
4100 return;
4101
4102 /* Renumber all input-registers into output-registers.
--- 60 unchanged lines hidden (view full) ---
4163 case 'u':
4164 break;
4165
4166 default:
4167 abort ();
4168 }
4169}
4170#endif