1 /* Variable tracking routines for the GNU compiler.
2 Copyright (C) 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it
7 under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GCC is distributed in the hope that it will be useful, but WITHOUT
12 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
13 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
14 License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING. If not, write to the Free
18 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
21 /* This file contains the variable tracking pass. It computes where
22 variables are located (which registers or where in memory) at each position
23 in instruction stream and emits notes describing the locations.
24 Debug information (DWARF2 location lists) is finally generated from
26 With this debug information, it is possible to show variables
27 even when debugging optimized code.
29 How does the variable tracking pass work?
31 First, it scans RTL code for uses, stores and clobbers (register/memory
32 references in instructions), for call insns and for stack adjustments
33 separately for each basic block and saves them to an array of micro
35 The micro operations of one instruction are ordered so that
36 pre-modifying stack adjustment < use < use with no var < call insn <
37 < set < clobber < post-modifying stack adjustment
39 Then, a forward dataflow analysis is performed to find out how locations
40 of variables change through code and to propagate the variable locations
41 along control flow graph.
42 The IN set for basic block BB is computed as a union of OUT sets of BB's
43 predecessors, the OUT set for BB is copied from the IN set for BB and
44 is changed according to micro operations in BB.
46 The IN and OUT sets for basic blocks consist of a current stack adjustment
47 (used for adjusting offset of variables addressed using stack pointer),
48 the table of structures describing the locations of parts of a variable
49 and for each physical register a linked list for each physical register.
50 The linked list is a list of variable parts stored in the register,
51 i.e. it is a list of triplets (reg, decl, offset) where decl is
52 REG_EXPR (reg) and offset is REG_OFFSET (reg). The linked list is used for
53 effective deleting appropriate variable parts when we set or clobber the
56 There may be more than one variable part in a register. The linked lists
57 should be pretty short so it is a good data structure here.
58 For example in the following code, register allocator may assign same
59 register to variables A and B, and both of them are stored in the same
72 Finally, the NOTE_INSN_VAR_LOCATION notes describing the variable locations
73 are emitted to appropriate positions in RTL code. Each such a note describes
74 the location of one variable at the point in instruction stream where the
75 note is. There is no need to emit a note for each variable before each
76 instruction, we only emit these notes where the location of variable changes
77 (this means that we also emit notes for changes between the OUT set of the
78 previous block and the IN set of the current block).
80 The notes consist of two parts:
81 1. the declaration (from REG_EXPR or MEM_EXPR)
82 2. the location of a variable - it is either a simple register/memory
83 reference (for simple variables, for example int),
84 or a parallel of register/memory references (for a large variables
85 which consist of several parts, for example long long).
91 #include "coretypes.h"
95 #include "hard-reg-set.h"
96 #include "basic-block.h"
99 #include "insn-config.h"
102 #include "alloc-pool.h"
108 /* Type of micro operation. */
109 enum micro_operation_type
111 MO_USE
, /* Use location (REG or MEM). */
112 MO_USE_NO_VAR
,/* Use location which is not associated with a variable
113 or the variable is not trackable. */
114 MO_SET
, /* Set location. */
115 MO_CLOBBER
, /* Clobber location. */
116 MO_CALL
, /* Call insn. */
117 MO_ADJUST
/* Adjust stack pointer. */
120 /* Where shall the note be emitted? BEFORE or AFTER the instruction. */
123 EMIT_NOTE_BEFORE_INSN
,
127 /* Structure holding information about micro operation. */
128 typedef struct micro_operation_def
130 /* Type of micro operation. */
131 enum micro_operation_type type
;
137 /* Stack adjustment. */
138 HOST_WIDE_INT adjust
;
141 /* The instruction which the micro operation is in. */
145 /* Structure for passing some other parameters to function
146 emit_note_insn_var_location. */
147 typedef struct emit_note_data_def
149 /* The instruction which the note will be emitted before/after. */
152 /* Where the note will be emitted (before/after insn)? */
153 enum emit_note_where where
;
156 /* Description of location of a part of a variable. The content of a physical
157 register is described by a chain of these structures.
158 The chains are pretty short (usually 1 or 2 elements) and thus
159 chain is the best data structure. */
160 typedef struct attrs_def
162 /* Pointer to next member of the list. */
163 struct attrs_def
*next
;
165 /* The rtx of register. */
168 /* The declaration corresponding to LOC. */
171 /* Offset from start of DECL. */
172 HOST_WIDE_INT offset
;
175 /* Structure holding the IN or OUT set for a basic block. */
176 typedef struct dataflow_set_def
178 /* Adjustment of stack offset. */
179 HOST_WIDE_INT stack_adjust
;
181 /* Attributes for registers (lists of attrs). */
182 attrs regs
[FIRST_PSEUDO_REGISTER
];
184 /* Variable locations. */
188 /* The structure (one for each basic block) containing the information
189 needed for variable tracking. */
190 typedef struct variable_tracking_info_def
192 /* Number of micro operations stored in the MOS array. */
195 /* The array of micro operations. */
196 micro_operation
*mos
;
198 /* The IN and OUT set for dataflow analysis. */
202 /* Has the block been visited in DFS? */
204 } *variable_tracking_info
;
206 /* Structure for chaining the locations. */
207 typedef struct location_chain_def
209 /* Next element in the chain. */
210 struct location_chain_def
*next
;
212 /* The location (REG or MEM). */
216 /* Structure describing one part of variable. */
217 typedef struct variable_part_def
219 /* Chain of locations of the part. */
220 location_chain loc_chain
;
222 /* Location which was last emitted to location list. */
225 /* The offset in the variable. */
226 HOST_WIDE_INT offset
;
229 /* Maximum number of location parts. */
230 #define MAX_VAR_PARTS 16
232 /* Structure describing where the variable is located. */
233 typedef struct variable_def
235 /* The declaration of the variable. */
238 /* Reference count. */
241 /* Number of variable parts. */
244 /* The variable parts. */
245 variable_part var_part
[MAX_VAR_PARTS
];
248 /* Hash function for DECL for VARIABLE_HTAB. */
249 #define VARIABLE_HASH_VAL(decl) (DECL_UID (decl))
251 /* Pointer to the BB's information specific to variable tracking pass. */
252 #define VTI(BB) ((variable_tracking_info) (BB)->aux)
254 /* Alloc pool for struct attrs_def. */
255 static alloc_pool attrs_pool
;
257 /* Alloc pool for struct variable_def. */
258 static alloc_pool var_pool
;
260 /* Alloc pool for struct location_chain_def. */
261 static alloc_pool loc_chain_pool
;
263 /* Changed variables, notes will be emitted for them. */
264 static htab_t changed_variables
;
266 /* Shall notes be emitted? */
267 static bool emit_notes
;
269 /* Fake variable for stack pointer. */
270 tree frame_base_decl
;
272 /* Stack adjust caused by function prologue. */
273 static HOST_WIDE_INT frame_stack_adjust
;
275 /* Local function prototypes. */
276 static void stack_adjust_offset_pre_post (rtx
, HOST_WIDE_INT
*,
278 static void insn_stack_adjust_offset_pre_post (rtx
, HOST_WIDE_INT
*,
280 static void bb_stack_adjust_offset (basic_block
);
281 static HOST_WIDE_INT
prologue_stack_adjust (void);
282 static bool vt_stack_adjustments (void);
283 static rtx
adjust_stack_reference (rtx
, HOST_WIDE_INT
);
284 static hashval_t
variable_htab_hash (const void *);
285 static int variable_htab_eq (const void *, const void *);
286 static void variable_htab_free (void *);
288 static void init_attrs_list_set (attrs
*);
289 static void attrs_list_clear (attrs
*);
290 static attrs
attrs_list_member (attrs
, tree
, HOST_WIDE_INT
);
291 static void attrs_list_insert (attrs
*, tree
, HOST_WIDE_INT
, rtx
);
292 static void attrs_list_copy (attrs
*, attrs
);
293 static void attrs_list_union (attrs
*, attrs
);
295 static void vars_clear (htab_t
);
296 static variable
unshare_variable (dataflow_set
*set
, variable var
);
297 static int vars_copy_1 (void **, void *);
298 static void vars_copy (htab_t
, htab_t
);
299 static void var_reg_delete_and_set (dataflow_set
*, rtx
);
300 static void var_reg_delete (dataflow_set
*, rtx
);
301 static void var_regno_delete (dataflow_set
*, int);
302 static void var_mem_delete_and_set (dataflow_set
*, rtx
);
303 static void var_mem_delete (dataflow_set
*, rtx
);
305 static void dataflow_set_init (dataflow_set
*, int);
306 static void dataflow_set_clear (dataflow_set
*);
307 static void dataflow_set_copy (dataflow_set
*, dataflow_set
*);
308 static int variable_union_info_cmp_pos (const void *, const void *);
309 static int variable_union (void **, void *);
310 static void dataflow_set_union (dataflow_set
*, dataflow_set
*);
311 static bool variable_part_different_p (variable_part
*, variable_part
*);
312 static bool variable_different_p (variable
, variable
, bool);
313 static int dataflow_set_different_1 (void **, void *);
314 static int dataflow_set_different_2 (void **, void *);
315 static bool dataflow_set_different (dataflow_set
*, dataflow_set
*);
316 static void dataflow_set_destroy (dataflow_set
*);
318 static bool contains_symbol_ref (rtx
);
319 static bool track_expr_p (tree
);
320 static int count_uses (rtx
*, void *);
321 static void count_uses_1 (rtx
*, void *);
322 static void count_stores (rtx
, rtx
, void *);
323 static int add_uses (rtx
*, void *);
324 static void add_uses_1 (rtx
*, void *);
325 static void add_stores (rtx
, rtx
, void *);
326 static bool compute_bb_dataflow (basic_block
);
327 static void vt_find_locations (void);
329 static void dump_attrs_list (attrs
);
330 static int dump_variable (void **, void *);
331 static void dump_vars (htab_t
);
332 static void dump_dataflow_set (dataflow_set
*);
333 static void dump_dataflow_sets (void);
335 static void variable_was_changed (variable
, htab_t
);
336 static void set_frame_base_location (dataflow_set
*, rtx
);
337 static void set_variable_part (dataflow_set
*, rtx
, tree
, HOST_WIDE_INT
);
338 static void delete_variable_part (dataflow_set
*, rtx
, tree
, HOST_WIDE_INT
);
339 static int emit_note_insn_var_location (void **, void *);
340 static void emit_notes_for_changes (rtx
, enum emit_note_where
);
341 static int emit_notes_for_differences_1 (void **, void *);
342 static int emit_notes_for_differences_2 (void **, void *);
343 static void emit_notes_for_differences (rtx
, dataflow_set
*, dataflow_set
*);
344 static void emit_notes_in_bb (basic_block
);
345 static void vt_emit_notes (void);
347 static bool vt_get_decl_and_offset (rtx
, tree
*, HOST_WIDE_INT
*);
348 static void vt_add_function_parameters (void);
349 static void vt_initialize (void);
350 static void vt_finalize (void);
352 /* Given a SET, calculate the amount of stack adjustment it contains
353 PRE- and POST-modifying stack pointer.
354 This function is similar to stack_adjust_offset. */
357 stack_adjust_offset_pre_post (rtx pattern
, HOST_WIDE_INT
*pre
,
360 rtx src
= SET_SRC (pattern
);
361 rtx dest
= SET_DEST (pattern
);
364 if (dest
== stack_pointer_rtx
)
366 /* (set (reg sp) (plus (reg sp) (const_int))) */
367 code
= GET_CODE (src
);
368 if (! (code
== PLUS
|| code
== MINUS
)
369 || XEXP (src
, 0) != stack_pointer_rtx
370 || GET_CODE (XEXP (src
, 1)) != CONST_INT
)
374 *post
+= INTVAL (XEXP (src
, 1));
376 *post
-= INTVAL (XEXP (src
, 1));
378 else if (MEM_P (dest
))
380 /* (set (mem (pre_dec (reg sp))) (foo)) */
381 src
= XEXP (dest
, 0);
382 code
= GET_CODE (src
);
388 if (XEXP (src
, 0) == stack_pointer_rtx
)
390 rtx val
= XEXP (XEXP (src
, 1), 1);
391 /* We handle only adjustments by constant amount. */
392 gcc_assert (GET_CODE (XEXP (src
, 1)) == PLUS
&&
393 GET_CODE (val
) == CONST_INT
);
395 if (code
== PRE_MODIFY
)
396 *pre
-= INTVAL (val
);
398 *post
-= INTVAL (val
);
404 if (XEXP (src
, 0) == stack_pointer_rtx
)
406 *pre
+= GET_MODE_SIZE (GET_MODE (dest
));
412 if (XEXP (src
, 0) == stack_pointer_rtx
)
414 *post
+= GET_MODE_SIZE (GET_MODE (dest
));
420 if (XEXP (src
, 0) == stack_pointer_rtx
)
422 *pre
-= GET_MODE_SIZE (GET_MODE (dest
));
428 if (XEXP (src
, 0) == stack_pointer_rtx
)
430 *post
-= GET_MODE_SIZE (GET_MODE (dest
));
441 /* Given an INSN, calculate the amount of stack adjustment it contains
442 PRE- and POST-modifying stack pointer. */
445 insn_stack_adjust_offset_pre_post (rtx insn
, HOST_WIDE_INT
*pre
,
451 if (GET_CODE (PATTERN (insn
)) == SET
)
452 stack_adjust_offset_pre_post (PATTERN (insn
), pre
, post
);
453 else if (GET_CODE (PATTERN (insn
)) == PARALLEL
454 || GET_CODE (PATTERN (insn
)) == SEQUENCE
)
458 /* There may be stack adjustments inside compound insns. Search
460 for ( i
= XVECLEN (PATTERN (insn
), 0) - 1; i
>= 0; i
--)
461 if (GET_CODE (XVECEXP (PATTERN (insn
), 0, i
)) == SET
)
462 stack_adjust_offset_pre_post (XVECEXP (PATTERN (insn
), 0, i
),
467 /* Compute stack adjustment in basic block BB. */
470 bb_stack_adjust_offset (basic_block bb
)
472 HOST_WIDE_INT offset
;
475 offset
= VTI (bb
)->in
.stack_adjust
;
476 for (i
= 0; i
< VTI (bb
)->n_mos
; i
++)
478 if (VTI (bb
)->mos
[i
].type
== MO_ADJUST
)
479 offset
+= VTI (bb
)->mos
[i
].u
.adjust
;
480 else if (VTI (bb
)->mos
[i
].type
!= MO_CALL
)
482 if (MEM_P (VTI (bb
)->mos
[i
].u
.loc
))
484 VTI (bb
)->mos
[i
].u
.loc
485 = adjust_stack_reference (VTI (bb
)->mos
[i
].u
.loc
, -offset
);
489 VTI (bb
)->out
.stack_adjust
= offset
;
492 /* Compute stack adjustment caused by function prologue. */
495 prologue_stack_adjust (void)
497 HOST_WIDE_INT offset
= 0;
498 basic_block bb
= ENTRY_BLOCK_PTR
->next_bb
;
505 end
= NEXT_INSN (BB_END (bb
));
506 for (insn
= BB_HEAD (bb
); insn
!= end
; insn
= NEXT_INSN (insn
))
509 && NOTE_LINE_NUMBER (insn
) == NOTE_INSN_PROLOGUE_END
)
516 insn_stack_adjust_offset_pre_post (insn
, &tmp
, &tmp
);
524 /* Compute stack adjustments for all blocks by traversing DFS tree.
525 Return true when the adjustments on all incoming edges are consistent.
526 Heavily borrowed from flow_depth_first_order_compute. */
529 vt_stack_adjustments (void)
531 edge_iterator
*stack
;
534 /* Initialize entry block. */
535 VTI (ENTRY_BLOCK_PTR
)->visited
= true;
536 VTI (ENTRY_BLOCK_PTR
)->out
.stack_adjust
= frame_stack_adjust
;
538 /* Allocate stack for back-tracking up CFG. */
539 stack
= xmalloc ((n_basic_blocks
+ 1) * sizeof (edge_iterator
));
542 /* Push the first edge on to the stack. */
543 stack
[sp
++] = ei_start (ENTRY_BLOCK_PTR
->succs
);
551 /* Look at the edge on the top of the stack. */
553 src
= ei_edge (ei
)->src
;
554 dest
= ei_edge (ei
)->dest
;
556 /* Check if the edge destination has been visited yet. */
557 if (!VTI (dest
)->visited
)
559 VTI (dest
)->visited
= true;
560 VTI (dest
)->in
.stack_adjust
= VTI (src
)->out
.stack_adjust
;
561 bb_stack_adjust_offset (dest
);
563 if (EDGE_COUNT (dest
->succs
) > 0)
564 /* Since the DEST node has been visited for the first
565 time, check its successors. */
566 stack
[sp
++] = ei_start (dest
->succs
);
570 /* Check whether the adjustments on the edges are the same. */
571 if (VTI (dest
)->in
.stack_adjust
!= VTI (src
)->out
.stack_adjust
)
577 if (! ei_one_before_end_p (ei
))
578 /* Go to the next edge. */
579 ei_next (&stack
[sp
- 1]);
581 /* Return to previous level if there are no more edges. */
590 /* Adjust stack reference MEM by ADJUSTMENT bytes and return the new rtx. */
593 adjust_stack_reference (rtx mem
, HOST_WIDE_INT adjustment
)
601 adjusted_mem
= copy_rtx (mem
);
602 XEXP (adjusted_mem
, 0) = replace_rtx (XEXP (adjusted_mem
, 0),
604 gen_rtx_PLUS (Pmode
, stack_pointer_rtx
,
605 GEN_INT (adjustment
)));
606 tmp
= simplify_rtx (XEXP (adjusted_mem
, 0));
608 XEXP (adjusted_mem
, 0) = tmp
;
613 /* The hash function for variable_htab, computes the hash value
614 from the declaration of variable X. */
617 variable_htab_hash (const void *x
)
619 const variable v
= (const variable
) x
;
621 return (VARIABLE_HASH_VAL (v
->decl
));
624 /* Compare the declaration of variable X with declaration Y. */
627 variable_htab_eq (const void *x
, const void *y
)
629 const variable v
= (const variable
) x
;
630 const tree decl
= (const tree
) y
;
632 return (VARIABLE_HASH_VAL (v
->decl
) == VARIABLE_HASH_VAL (decl
));
635 /* Free the element of VARIABLE_HTAB (its type is struct variable_def). */
638 variable_htab_free (void *elem
)
641 variable var
= (variable
) elem
;
642 location_chain node
, next
;
644 gcc_assert (var
->refcount
> 0);
647 if (var
->refcount
> 0)
650 for (i
= 0; i
< var
->n_var_parts
; i
++)
652 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= next
)
655 pool_free (loc_chain_pool
, node
);
657 var
->var_part
[i
].loc_chain
= NULL
;
659 pool_free (var_pool
, var
);
662 /* Initialize the set (array) SET of attrs to empty lists. */
665 init_attrs_list_set (attrs
*set
)
669 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
673 /* Make the list *LISTP empty. */
676 attrs_list_clear (attrs
*listp
)
680 for (list
= *listp
; list
; list
= next
)
683 pool_free (attrs_pool
, list
);
688 /* Return true if the pair of DECL and OFFSET is the member of the LIST. */
691 attrs_list_member (attrs list
, tree decl
, HOST_WIDE_INT offset
)
693 for (; list
; list
= list
->next
)
694 if (list
->decl
== decl
&& list
->offset
== offset
)
699 /* Insert the triplet DECL, OFFSET, LOC to the list *LISTP. */
702 attrs_list_insert (attrs
*listp
, tree decl
, HOST_WIDE_INT offset
, rtx loc
)
706 list
= pool_alloc (attrs_pool
);
709 list
->offset
= offset
;
714 /* Copy all nodes from SRC and create a list *DSTP of the copies. */
717 attrs_list_copy (attrs
*dstp
, attrs src
)
721 attrs_list_clear (dstp
);
722 for (; src
; src
= src
->next
)
724 n
= pool_alloc (attrs_pool
);
727 n
->offset
= src
->offset
;
733 /* Add all nodes from SRC which are not in *DSTP to *DSTP. */
736 attrs_list_union (attrs
*dstp
, attrs src
)
738 for (; src
; src
= src
->next
)
740 if (!attrs_list_member (*dstp
, src
->decl
, src
->offset
))
741 attrs_list_insert (dstp
, src
->decl
, src
->offset
, src
->loc
);
745 /* Delete all variables from hash table VARS. */
748 vars_clear (htab_t vars
)
753 /* Return a copy of a variable VAR and insert it to dataflow set SET. */
756 unshare_variable (dataflow_set
*set
, variable var
)
762 new_var
= pool_alloc (var_pool
);
763 new_var
->decl
= var
->decl
;
764 new_var
->refcount
= 1;
766 new_var
->n_var_parts
= var
->n_var_parts
;
768 for (i
= 0; i
< var
->n_var_parts
; i
++)
771 location_chain
*nextp
;
773 new_var
->var_part
[i
].offset
= var
->var_part
[i
].offset
;
774 nextp
= &new_var
->var_part
[i
].loc_chain
;
775 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
777 location_chain new_lc
;
779 new_lc
= pool_alloc (loc_chain_pool
);
781 new_lc
->loc
= node
->loc
;
784 nextp
= &new_lc
->next
;
787 /* We are at the basic block boundary when copying variable description
788 so set the CUR_LOC to be the first element of the chain. */
789 if (new_var
->var_part
[i
].loc_chain
)
790 new_var
->var_part
[i
].cur_loc
= new_var
->var_part
[i
].loc_chain
->loc
;
792 new_var
->var_part
[i
].cur_loc
= NULL
;
795 slot
= htab_find_slot_with_hash (set
->vars
, new_var
->decl
,
796 VARIABLE_HASH_VAL (new_var
->decl
),
802 /* Add a variable from *SLOT to hash table DATA and increase its reference
806 vars_copy_1 (void **slot
, void *data
)
808 htab_t dst
= (htab_t
) data
;
811 src
= *(variable
*) slot
;
814 dstp
= (variable
*) htab_find_slot_with_hash (dst
, src
->decl
,
815 VARIABLE_HASH_VAL (src
->decl
),
819 /* Continue traversing the hash table. */
823 /* Copy all variables from hash table SRC to hash table DST. */
826 vars_copy (htab_t dst
, htab_t src
)
829 htab_traverse (src
, vars_copy_1
, dst
);
832 /* Delete current content of register LOC in dataflow set SET
833 and set the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). */
836 var_reg_delete_and_set (dataflow_set
*set
, rtx loc
)
838 tree decl
= REG_EXPR (loc
);
839 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
843 nextp
= &set
->regs
[REGNO (loc
)];
844 for (node
= *nextp
; node
; node
= next
)
847 if (node
->decl
!= decl
|| node
->offset
!= offset
)
849 delete_variable_part (set
, node
->loc
, node
->decl
, node
->offset
);
850 pool_free (attrs_pool
, node
);
859 if (set
->regs
[REGNO (loc
)] == NULL
)
860 attrs_list_insert (&set
->regs
[REGNO (loc
)], decl
, offset
, loc
);
861 set_variable_part (set
, loc
, decl
, offset
);
864 /* Delete current content of register LOC in dataflow set SET. */
867 var_reg_delete (dataflow_set
*set
, rtx loc
)
869 attrs
*reg
= &set
->regs
[REGNO (loc
)];
872 for (node
= *reg
; node
; node
= next
)
875 delete_variable_part (set
, node
->loc
, node
->decl
, node
->offset
);
876 pool_free (attrs_pool
, node
);
881 /* Delete content of register with number REGNO in dataflow set SET. */
884 var_regno_delete (dataflow_set
*set
, int regno
)
886 attrs
*reg
= &set
->regs
[regno
];
889 for (node
= *reg
; node
; node
= next
)
892 delete_variable_part (set
, node
->loc
, node
->decl
, node
->offset
);
893 pool_free (attrs_pool
, node
);
898 /* Delete and set the location part of variable MEM_EXPR (LOC)
899 in dataflow set SET to LOC.
900 Adjust the address first if it is stack pointer based. */
903 var_mem_delete_and_set (dataflow_set
*set
, rtx loc
)
905 tree decl
= MEM_EXPR (loc
);
906 HOST_WIDE_INT offset
= MEM_OFFSET (loc
) ? INTVAL (MEM_OFFSET (loc
)) : 0;
908 set_variable_part (set
, loc
, decl
, offset
);
911 /* Delete the location part LOC from dataflow set SET.
912 Adjust the address first if it is stack pointer based. */
915 var_mem_delete (dataflow_set
*set
, rtx loc
)
917 tree decl
= MEM_EXPR (loc
);
918 HOST_WIDE_INT offset
= MEM_OFFSET (loc
) ? INTVAL (MEM_OFFSET (loc
)) : 0;
920 delete_variable_part (set
, loc
, decl
, offset
);
923 /* Initialize dataflow set SET to be empty.
924 VARS_SIZE is the initial size of hash table VARS. */
927 dataflow_set_init (dataflow_set
*set
, int vars_size
)
929 init_attrs_list_set (set
->regs
);
930 set
->vars
= htab_create (vars_size
, variable_htab_hash
, variable_htab_eq
,
932 set
->stack_adjust
= 0;
935 /* Delete the contents of dataflow set SET. */
938 dataflow_set_clear (dataflow_set
*set
)
942 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
943 attrs_list_clear (&set
->regs
[i
]);
945 vars_clear (set
->vars
);
948 /* Copy the contents of dataflow set SRC to DST. */
951 dataflow_set_copy (dataflow_set
*dst
, dataflow_set
*src
)
955 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
956 attrs_list_copy (&dst
->regs
[i
], src
->regs
[i
]);
958 vars_copy (dst
->vars
, src
->vars
);
959 dst
->stack_adjust
= src
->stack_adjust
;
962 /* Information for merging lists of locations for a given offset of variable.
964 struct variable_union_info
966 /* Node of the location chain. */
969 /* The sum of positions in the input chains. */
972 /* The position in the chains of SRC and DST dataflow sets. */
977 /* Compare function for qsort, order the structures by POS element. */
980 variable_union_info_cmp_pos (const void *n1
, const void *n2
)
982 const struct variable_union_info
*i1
= n1
;
983 const struct variable_union_info
*i2
= n2
;
985 if (i1
->pos
!= i2
->pos
)
986 return i1
->pos
- i2
->pos
;
988 return (i1
->pos_dst
- i2
->pos_dst
);
991 /* Compute union of location parts of variable *SLOT and the same variable
992 from hash table DATA. Compute "sorted" union of the location chains
993 for common offsets, i.e. the locations of a variable part are sorted by
994 a priority where the priority is the sum of the positions in the 2 chains
995 (if a location is only in one list the position in the second list is
996 defined to be larger than the length of the chains).
997 When we are updating the location parts the newest location is in the
998 beginning of the chain, so when we do the described "sorted" union
999 we keep the newest locations in the beginning. */
1002 variable_union (void **slot
, void *data
)
1004 variable src
, dst
, *dstp
;
1005 dataflow_set
*set
= (dataflow_set
*) data
;
1008 src
= *(variable
*) slot
;
1009 dstp
= (variable
*) htab_find_slot_with_hash (set
->vars
, src
->decl
,
1010 VARIABLE_HASH_VAL (src
->decl
),
1016 /* If CUR_LOC of some variable part is not the first element of
1017 the location chain we are going to change it so we have to make
1018 a copy of the variable. */
1019 for (k
= 0; k
< src
->n_var_parts
; k
++)
1021 gcc_assert (!src
->var_part
[k
].loc_chain
1022 == !src
->var_part
[k
].cur_loc
);
1023 if (src
->var_part
[k
].loc_chain
)
1025 gcc_assert (src
->var_part
[k
].cur_loc
);
1026 if (src
->var_part
[k
].cur_loc
!= src
->var_part
[k
].loc_chain
->loc
)
1030 if (k
< src
->n_var_parts
)
1031 unshare_variable (set
, src
);
1035 /* Continue traversing the hash table. */
1041 gcc_assert (src
->n_var_parts
);
1043 /* Count the number of location parts, result is K. */
1044 for (i
= 0, j
= 0, k
= 0;
1045 i
< src
->n_var_parts
&& j
< dst
->n_var_parts
; k
++)
1047 if (src
->var_part
[i
].offset
== dst
->var_part
[j
].offset
)
1052 else if (src
->var_part
[i
].offset
< dst
->var_part
[j
].offset
)
1057 k
+= src
->n_var_parts
- i
;
1058 k
+= dst
->n_var_parts
- j
;
1060 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
1061 thus there are at most MAX_VAR_PARTS different offsets. */
1062 gcc_assert (k
<= MAX_VAR_PARTS
);
1064 if (dst
->refcount
> 1 && dst
->n_var_parts
!= k
)
1065 dst
= unshare_variable (set
, dst
);
1067 i
= src
->n_var_parts
- 1;
1068 j
= dst
->n_var_parts
- 1;
1069 dst
->n_var_parts
= k
;
1071 for (k
--; k
>= 0; k
--)
1073 location_chain node
, node2
;
1075 if (i
>= 0 && j
>= 0
1076 && src
->var_part
[i
].offset
== dst
->var_part
[j
].offset
)
1078 /* Compute the "sorted" union of the chains, i.e. the locations which
1079 are in both chains go first, they are sorted by the sum of
1080 positions in the chains. */
1083 struct variable_union_info
*vui
;
1085 /* If DST is shared compare the location chains.
1086 If they are different we will modify the chain in DST with
1087 high probability so make a copy of DST. */
1088 if (dst
->refcount
> 1)
1090 for (node
= src
->var_part
[i
].loc_chain
,
1091 node2
= dst
->var_part
[j
].loc_chain
; node
&& node2
;
1092 node
= node
->next
, node2
= node2
->next
)
1094 if (!((REG_P (node2
->loc
)
1095 && REG_P (node
->loc
)
1096 && REGNO (node2
->loc
) == REGNO (node
->loc
))
1097 || rtx_equal_p (node2
->loc
, node
->loc
)))
1101 dst
= unshare_variable (set
, dst
);
1105 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
1108 for (node
= dst
->var_part
[j
].loc_chain
; node
; node
= node
->next
)
1110 vui
= xcalloc (src_l
+ dst_l
, sizeof (struct variable_union_info
));
1112 /* Fill in the locations from DST. */
1113 for (node
= dst
->var_part
[j
].loc_chain
, jj
= 0; node
;
1114 node
= node
->next
, jj
++)
1117 vui
[jj
].pos_dst
= jj
;
1119 /* Value larger than a sum of 2 valid positions. */
1120 vui
[jj
].pos_src
= src_l
+ dst_l
;
1123 /* Fill in the locations from SRC. */
1125 for (node
= src
->var_part
[i
].loc_chain
, ii
= 0; node
;
1126 node
= node
->next
, ii
++)
1128 /* Find location from NODE. */
1129 for (jj
= 0; jj
< dst_l
; jj
++)
1131 if ((REG_P (vui
[jj
].lc
->loc
)
1132 && REG_P (node
->loc
)
1133 && REGNO (vui
[jj
].lc
->loc
) == REGNO (node
->loc
))
1134 || rtx_equal_p (vui
[jj
].lc
->loc
, node
->loc
))
1136 vui
[jj
].pos_src
= ii
;
1140 if (jj
>= dst_l
) /* The location has not been found. */
1142 location_chain new_node
;
1144 /* Copy the location from SRC. */
1145 new_node
= pool_alloc (loc_chain_pool
);
1146 new_node
->loc
= node
->loc
;
1147 vui
[n
].lc
= new_node
;
1148 vui
[n
].pos_src
= ii
;
1149 vui
[n
].pos_dst
= src_l
+ dst_l
;
1154 for (ii
= 0; ii
< src_l
+ dst_l
; ii
++)
1155 vui
[ii
].pos
= vui
[ii
].pos_src
+ vui
[ii
].pos_dst
;
1157 qsort (vui
, n
, sizeof (struct variable_union_info
),
1158 variable_union_info_cmp_pos
);
1160 /* Reconnect the nodes in sorted order. */
1161 for (ii
= 1; ii
< n
; ii
++)
1162 vui
[ii
- 1].lc
->next
= vui
[ii
].lc
;
1163 vui
[n
- 1].lc
->next
= NULL
;
1165 dst
->var_part
[k
].loc_chain
= vui
[0].lc
;
1166 dst
->var_part
[k
].offset
= dst
->var_part
[j
].offset
;
1172 else if ((i
>= 0 && j
>= 0
1173 && src
->var_part
[i
].offset
< dst
->var_part
[j
].offset
)
1176 dst
->var_part
[k
] = dst
->var_part
[j
];
1179 else if ((i
>= 0 && j
>= 0
1180 && src
->var_part
[i
].offset
> dst
->var_part
[j
].offset
)
1183 location_chain
*nextp
;
1185 /* Copy the chain from SRC. */
1186 nextp
= &dst
->var_part
[k
].loc_chain
;
1187 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
1189 location_chain new_lc
;
1191 new_lc
= pool_alloc (loc_chain_pool
);
1192 new_lc
->next
= NULL
;
1193 new_lc
->loc
= node
->loc
;
1196 nextp
= &new_lc
->next
;
1199 dst
->var_part
[k
].offset
= src
->var_part
[i
].offset
;
1203 /* We are at the basic block boundary when computing union
1204 so set the CUR_LOC to be the first element of the chain. */
1205 if (dst
->var_part
[k
].loc_chain
)
1206 dst
->var_part
[k
].cur_loc
= dst
->var_part
[k
].loc_chain
->loc
;
1208 dst
->var_part
[k
].cur_loc
= NULL
;
1211 /* Continue traversing the hash table. */
1215 /* Compute union of dataflow sets SRC and DST and store it to DST. */
1218 dataflow_set_union (dataflow_set
*dst
, dataflow_set
*src
)
1222 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1223 attrs_list_union (&dst
->regs
[i
], src
->regs
[i
]);
1225 htab_traverse (src
->vars
, variable_union
, dst
);
1228 /* Flag whether two dataflow sets being compared contain different data. */
1230 dataflow_set_different_value
;
1233 variable_part_different_p (variable_part
*vp1
, variable_part
*vp2
)
1235 location_chain lc1
, lc2
;
1237 for (lc1
= vp1
->loc_chain
; lc1
; lc1
= lc1
->next
)
1239 for (lc2
= vp2
->loc_chain
; lc2
; lc2
= lc2
->next
)
1241 if (REG_P (lc1
->loc
) && REG_P (lc2
->loc
))
1243 if (REGNO (lc1
->loc
) == REGNO (lc2
->loc
))
1246 if (rtx_equal_p (lc1
->loc
, lc2
->loc
))
1255 /* Return true if variables VAR1 and VAR2 are different.
1256 If COMPARE_CURRENT_LOCATION is true compare also the cur_loc of each
1260 variable_different_p (variable var1
, variable var2
,
1261 bool compare_current_location
)
1268 if (var1
->n_var_parts
!= var2
->n_var_parts
)
1271 for (i
= 0; i
< var1
->n_var_parts
; i
++)
1273 if (var1
->var_part
[i
].offset
!= var2
->var_part
[i
].offset
)
1275 if (compare_current_location
)
1277 if (!((REG_P (var1
->var_part
[i
].cur_loc
)
1278 && REG_P (var2
->var_part
[i
].cur_loc
)
1279 && (REGNO (var1
->var_part
[i
].cur_loc
)
1280 == REGNO (var2
->var_part
[i
].cur_loc
)))
1281 || rtx_equal_p (var1
->var_part
[i
].cur_loc
,
1282 var2
->var_part
[i
].cur_loc
)))
1285 if (variable_part_different_p (&var1
->var_part
[i
], &var2
->var_part
[i
]))
1287 if (variable_part_different_p (&var2
->var_part
[i
], &var1
->var_part
[i
]))
1293 /* Compare variable *SLOT with the same variable in hash table DATA
1294 and set DATAFLOW_SET_DIFFERENT_VALUE if they are different. */
1297 dataflow_set_different_1 (void **slot
, void *data
)
1299 htab_t htab
= (htab_t
) data
;
1300 variable var1
, var2
;
1302 var1
= *(variable
*) slot
;
1303 var2
= htab_find_with_hash (htab
, var1
->decl
,
1304 VARIABLE_HASH_VAL (var1
->decl
));
1307 dataflow_set_different_value
= true;
1309 /* Stop traversing the hash table. */
1313 if (variable_different_p (var1
, var2
, false))
1315 dataflow_set_different_value
= true;
1317 /* Stop traversing the hash table. */
1321 /* Continue traversing the hash table. */
1325 /* Compare variable *SLOT with the same variable in hash table DATA
1326 and set DATAFLOW_SET_DIFFERENT_VALUE if they are different. */
1329 dataflow_set_different_2 (void **slot
, void *data
)
1331 htab_t htab
= (htab_t
) data
;
1332 variable var1
, var2
;
1334 var1
= *(variable
*) slot
;
1335 var2
= htab_find_with_hash (htab
, var1
->decl
,
1336 VARIABLE_HASH_VAL (var1
->decl
));
1339 dataflow_set_different_value
= true;
1341 /* Stop traversing the hash table. */
1345 /* If both variables are defined they have been already checked for
1347 gcc_assert (!variable_different_p (var1
, var2
, false));
1349 /* Continue traversing the hash table. */
1353 /* Return true if dataflow sets OLD_SET and NEW_SET differ. */
1356 dataflow_set_different (dataflow_set
*old_set
, dataflow_set
*new_set
)
1358 dataflow_set_different_value
= false;
1360 htab_traverse (old_set
->vars
, dataflow_set_different_1
, new_set
->vars
);
1361 if (!dataflow_set_different_value
)
1363 /* We have compared the variables which are in both hash tables
1364 so now only check whether there are some variables in NEW_SET->VARS
1365 which are not in OLD_SET->VARS. */
1366 htab_traverse (new_set
->vars
, dataflow_set_different_2
, old_set
->vars
);
1368 return dataflow_set_different_value
;
1371 /* Free the contents of dataflow set SET. */
1374 dataflow_set_destroy (dataflow_set
*set
)
1378 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1379 attrs_list_clear (&set
->regs
[i
]);
1381 htab_delete (set
->vars
);
1385 /* Return true if RTL X contains a SYMBOL_REF. */
1388 contains_symbol_ref (rtx x
)
1397 code
= GET_CODE (x
);
1398 if (code
== SYMBOL_REF
)
1401 fmt
= GET_RTX_FORMAT (code
);
1402 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
1406 if (contains_symbol_ref (XEXP (x
, i
)))
1409 else if (fmt
[i
] == 'E')
1412 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
1413 if (contains_symbol_ref (XVECEXP (x
, i
, j
)))
1421 /* Shall EXPR be tracked? */
1424 track_expr_p (tree expr
)
1429 /* If EXPR is not a parameter or a variable do not track it. */
1430 if (TREE_CODE (expr
) != VAR_DECL
&& TREE_CODE (expr
) != PARM_DECL
)
1433 /* It also must have a name... */
1434 if (!DECL_NAME (expr
))
1437 /* ... and a RTL assigned to it. */
1438 decl_rtl
= DECL_RTL_IF_SET (expr
);
1442 /* If this expression is really a debug alias of some other declaration, we
1443 don't need to track this expression if the ultimate declaration is
1446 if (DECL_DEBUG_EXPR_IS_FROM (realdecl
) && DECL_DEBUG_EXPR (realdecl
))
1448 realdecl
= DECL_DEBUG_EXPR (realdecl
);
1449 /* ??? We don't yet know how to emit DW_OP_piece for variable
1450 that has been SRA'ed. */
1451 if (!DECL_P (realdecl
))
1455 /* Do not track EXPR if REALDECL it should be ignored for debugging
1457 if (DECL_IGNORED_P (realdecl
))
1460 /* Do not track global variables until we are able to emit correct location
1462 if (TREE_STATIC (realdecl
))
1465 /* When the EXPR is a DECL for alias of some variable (see example)
1466 the TREE_STATIC flag is not used. Disable tracking all DECLs whose
1467 DECL_RTL contains SYMBOL_REF.
1470 extern char **_dl_argv_internal __attribute__ ((alias ("_dl_argv")));
1473 if (MEM_P (decl_rtl
)
1474 && contains_symbol_ref (XEXP (decl_rtl
, 0)))
1477 /* If RTX is a memory it should not be very large (because it would be
1478 an array or struct). */
1479 if (MEM_P (decl_rtl
))
1481 /* Do not track structures and arrays. */
1482 if (GET_MODE (decl_rtl
) == BLKmode
)
1484 if (MEM_SIZE (decl_rtl
)
1485 && INTVAL (MEM_SIZE (decl_rtl
)) > MAX_VAR_PARTS
)
1492 /* Count uses (register and memory references) LOC which will be tracked.
1493 INSN is instruction which the LOC is part of. */
1496 count_uses (rtx
*loc
, void *insn
)
1498 basic_block bb
= BLOCK_FOR_INSN ((rtx
) insn
);
1502 gcc_assert (REGNO (*loc
) < FIRST_PSEUDO_REGISTER
);
1505 else if (MEM_P (*loc
)
1507 && track_expr_p (MEM_EXPR (*loc
)))
1515 /* Helper function for finding all uses of REG/MEM in X in insn INSN. */
1518 count_uses_1 (rtx
*x
, void *insn
)
1520 for_each_rtx (x
, count_uses
, insn
);
1523 /* Count stores (register and memory references) LOC which will be tracked.
1524 INSN is instruction which the LOC is part of. */
1527 count_stores (rtx loc
, rtx expr ATTRIBUTE_UNUSED
, void *insn
)
1529 count_uses (&loc
, insn
);
1532 /* Add uses (register and memory references) LOC which will be tracked
1533 to VTI (bb)->mos. INSN is instruction which the LOC is part of. */
1536 add_uses (rtx
*loc
, void *insn
)
1540 basic_block bb
= BLOCK_FOR_INSN ((rtx
) insn
);
1541 micro_operation
*mo
= VTI (bb
)->mos
+ VTI (bb
)->n_mos
++;
1543 mo
->type
= ((REG_EXPR (*loc
) && track_expr_p (REG_EXPR (*loc
)))
1544 ? MO_USE
: MO_USE_NO_VAR
);
1546 mo
->insn
= (rtx
) insn
;
1548 else if (MEM_P (*loc
)
1550 && track_expr_p (MEM_EXPR (*loc
)))
1552 basic_block bb
= BLOCK_FOR_INSN ((rtx
) insn
);
1553 micro_operation
*mo
= VTI (bb
)->mos
+ VTI (bb
)->n_mos
++;
1557 mo
->insn
= (rtx
) insn
;
1563 /* Helper function for finding all uses of REG/MEM in X in insn INSN. */
1566 add_uses_1 (rtx
*x
, void *insn
)
1568 for_each_rtx (x
, add_uses
, insn
);
1571 /* Add stores (register and memory references) LOC which will be tracked
1572 to VTI (bb)->mos. EXPR is the RTL expression containing the store.
1573 INSN is instruction which the LOC is part of. */
1576 add_stores (rtx loc
, rtx expr
, void *insn
)
1580 basic_block bb
= BLOCK_FOR_INSN ((rtx
) insn
);
1581 micro_operation
*mo
= VTI (bb
)->mos
+ VTI (bb
)->n_mos
++;
1583 mo
->type
= ((GET_CODE (expr
) != CLOBBER
&& REG_EXPR (loc
)
1584 && track_expr_p (REG_EXPR (loc
)))
1585 ? MO_SET
: MO_CLOBBER
);
1587 mo
->insn
= (rtx
) insn
;
1589 else if (MEM_P (loc
)
1591 && track_expr_p (MEM_EXPR (loc
)))
1593 basic_block bb
= BLOCK_FOR_INSN ((rtx
) insn
);
1594 micro_operation
*mo
= VTI (bb
)->mos
+ VTI (bb
)->n_mos
++;
1596 mo
->type
= GET_CODE (expr
) == CLOBBER
? MO_CLOBBER
: MO_SET
;
1598 mo
->insn
= (rtx
) insn
;
1602 /* Compute the changes of variable locations in the basic block BB. */
1605 compute_bb_dataflow (basic_block bb
)
1609 dataflow_set old_out
;
1610 dataflow_set
*in
= &VTI (bb
)->in
;
1611 dataflow_set
*out
= &VTI (bb
)->out
;
1613 dataflow_set_init (&old_out
, htab_elements (VTI (bb
)->out
.vars
) + 3);
1614 dataflow_set_copy (&old_out
, out
);
1615 dataflow_set_copy (out
, in
);
1617 n
= VTI (bb
)->n_mos
;
1618 for (i
= 0; i
< n
; i
++)
1620 switch (VTI (bb
)->mos
[i
].type
)
1623 for (r
= 0; r
< FIRST_PSEUDO_REGISTER
; r
++)
1624 if (TEST_HARD_REG_BIT (call_used_reg_set
, r
))
1625 var_regno_delete (out
, r
);
1631 rtx loc
= VTI (bb
)->mos
[i
].u
.loc
;
1634 var_reg_delete_and_set (out
, loc
);
1635 else if (MEM_P (loc
))
1636 var_mem_delete_and_set (out
, loc
);
1643 rtx loc
= VTI (bb
)->mos
[i
].u
.loc
;
1646 var_reg_delete (out
, loc
);
1647 else if (MEM_P (loc
))
1648 var_mem_delete (out
, loc
);
1656 out
->stack_adjust
+= VTI (bb
)->mos
[i
].u
.adjust
;
1657 base
= gen_rtx_MEM (Pmode
, plus_constant (stack_pointer_rtx
,
1658 out
->stack_adjust
));
1659 set_frame_base_location (out
, base
);
1665 changed
= dataflow_set_different (&old_out
, out
);
1666 dataflow_set_destroy (&old_out
);
1670 /* Find the locations of variables in the whole function. */
1673 vt_find_locations (void)
1675 fibheap_t worklist
, pending
, fibheap_swap
;
1676 sbitmap visited
, in_worklist
, in_pending
, sbitmap_swap
;
1683 /* Compute reverse completion order of depth first search of the CFG
1684 so that the data-flow runs faster. */
1685 rc_order
= xmalloc (n_basic_blocks
* sizeof (int));
1686 bb_order
= xmalloc (last_basic_block
* sizeof (int));
1687 flow_depth_first_order_compute (NULL
, rc_order
);
1688 for (i
= 0; i
< n_basic_blocks
; i
++)
1689 bb_order
[rc_order
[i
]] = i
;
1692 worklist
= fibheap_new ();
1693 pending
= fibheap_new ();
1694 visited
= sbitmap_alloc (last_basic_block
);
1695 in_worklist
= sbitmap_alloc (last_basic_block
);
1696 in_pending
= sbitmap_alloc (last_basic_block
);
1697 sbitmap_zero (in_worklist
);
1700 fibheap_insert (pending
, bb_order
[bb
->index
], bb
);
1701 sbitmap_ones (in_pending
);
1703 while (!fibheap_empty (pending
))
1705 fibheap_swap
= pending
;
1707 worklist
= fibheap_swap
;
1708 sbitmap_swap
= in_pending
;
1709 in_pending
= in_worklist
;
1710 in_worklist
= sbitmap_swap
;
1712 sbitmap_zero (visited
);
1714 while (!fibheap_empty (worklist
))
1716 bb
= fibheap_extract_min (worklist
);
1717 RESET_BIT (in_worklist
, bb
->index
);
1718 if (!TEST_BIT (visited
, bb
->index
))
1723 SET_BIT (visited
, bb
->index
);
1725 /* Calculate the IN set as union of predecessor OUT sets. */
1726 dataflow_set_clear (&VTI (bb
)->in
);
1727 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
1729 dataflow_set_union (&VTI (bb
)->in
, &VTI (e
->src
)->out
);
1732 changed
= compute_bb_dataflow (bb
);
1735 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1737 if (e
->dest
== EXIT_BLOCK_PTR
)
1743 if (TEST_BIT (visited
, e
->dest
->index
))
1745 if (!TEST_BIT (in_pending
, e
->dest
->index
))
1747 /* Send E->DEST to next round. */
1748 SET_BIT (in_pending
, e
->dest
->index
);
1749 fibheap_insert (pending
,
1750 bb_order
[e
->dest
->index
],
1754 else if (!TEST_BIT (in_worklist
, e
->dest
->index
))
1756 /* Add E->DEST to current round. */
1757 SET_BIT (in_worklist
, e
->dest
->index
);
1758 fibheap_insert (worklist
, bb_order
[e
->dest
->index
],
1768 fibheap_delete (worklist
);
1769 fibheap_delete (pending
);
1770 sbitmap_free (visited
);
1771 sbitmap_free (in_worklist
);
1772 sbitmap_free (in_pending
);
1775 /* Print the content of the LIST to dump file. */
1778 dump_attrs_list (attrs list
)
1780 for (; list
; list
= list
->next
)
1782 print_mem_expr (dump_file
, list
->decl
);
1783 fprintf (dump_file
, "+");
1784 fprintf (dump_file
, HOST_WIDE_INT_PRINT_DEC
, list
->offset
);
1786 fprintf (dump_file
, "\n");
1789 /* Print the information about variable *SLOT to dump file. */
1792 dump_variable (void **slot
, void *data ATTRIBUTE_UNUSED
)
1794 variable var
= *(variable
*) slot
;
1796 location_chain node
;
1798 fprintf (dump_file
, " name: %s\n",
1799 IDENTIFIER_POINTER (DECL_NAME (var
->decl
)));
1800 for (i
= 0; i
< var
->n_var_parts
; i
++)
1802 fprintf (dump_file
, " offset %ld\n",
1803 (long) var
->var_part
[i
].offset
);
1804 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
1806 fprintf (dump_file
, " ");
1807 print_rtl_single (dump_file
, node
->loc
);
1811 /* Continue traversing the hash table. */
1815 /* Print the information about variables from hash table VARS to dump file. */
1818 dump_vars (htab_t vars
)
1820 if (htab_elements (vars
) > 0)
1822 fprintf (dump_file
, "Variables:\n");
1823 htab_traverse (vars
, dump_variable
, NULL
);
1827 /* Print the dataflow set SET to dump file. */
1830 dump_dataflow_set (dataflow_set
*set
)
1834 fprintf (dump_file
, "Stack adjustment: ");
1835 fprintf (dump_file
, HOST_WIDE_INT_PRINT_DEC
, set
->stack_adjust
);
1836 fprintf (dump_file
, "\n");
1837 for (i
= 1; i
< FIRST_PSEUDO_REGISTER
; i
++)
1841 fprintf (dump_file
, "Reg %d:", i
);
1842 dump_attrs_list (set
->regs
[i
]);
1845 dump_vars (set
->vars
);
1846 fprintf (dump_file
, "\n");
1849 /* Print the IN and OUT sets for each basic block to dump file. */
1852 dump_dataflow_sets (void)
1858 fprintf (dump_file
, "\nBasic block %d:\n", bb
->index
);
1859 fprintf (dump_file
, "IN:\n");
1860 dump_dataflow_set (&VTI (bb
)->in
);
1861 fprintf (dump_file
, "OUT:\n");
1862 dump_dataflow_set (&VTI (bb
)->out
);
1866 /* Add variable VAR to the hash table of changed variables and
1867 if it has no locations delete it from hash table HTAB. */
1870 variable_was_changed (variable var
, htab_t htab
)
1872 hashval_t hash
= VARIABLE_HASH_VAL (var
->decl
);
1878 slot
= (variable
*) htab_find_slot_with_hash (changed_variables
,
1879 var
->decl
, hash
, INSERT
);
1881 if (htab
&& var
->n_var_parts
== 0)
1886 empty_var
= pool_alloc (var_pool
);
1887 empty_var
->decl
= var
->decl
;
1888 empty_var
->refcount
= 1;
1889 empty_var
->n_var_parts
= 0;
1892 old
= htab_find_slot_with_hash (htab
, var
->decl
, hash
,
1895 htab_clear_slot (htab
, old
);
1905 if (var
->n_var_parts
== 0)
1907 void **slot
= htab_find_slot_with_hash (htab
, var
->decl
, hash
,
1910 htab_clear_slot (htab
, slot
);
1915 /* Set the location of frame_base_decl to LOC in dataflow set SET. This
1916 function expects that frame_base_decl has already one location for offset 0
1917 in the variable table. */
1920 set_frame_base_location (dataflow_set
*set
, rtx loc
)
1924 var
= htab_find_with_hash (set
->vars
, frame_base_decl
,
1925 VARIABLE_HASH_VAL (frame_base_decl
));
1927 gcc_assert (var
->n_var_parts
== 1);
1928 gcc_assert (!var
->var_part
[0].offset
);
1929 gcc_assert (var
->var_part
[0].loc_chain
);
1931 /* If frame_base_decl is shared unshare it first. */
1932 if (var
->refcount
> 1)
1933 var
= unshare_variable (set
, var
);
1935 var
->var_part
[0].loc_chain
->loc
= loc
;
1936 var
->var_part
[0].cur_loc
= loc
;
1937 variable_was_changed (var
, set
->vars
);
1940 /* Set the part of variable's location in the dataflow set SET. The variable
1941 part is specified by variable's declaration DECL and offset OFFSET and the
1942 part's location by LOC. */
1945 set_variable_part (dataflow_set
*set
, rtx loc
, tree decl
, HOST_WIDE_INT offset
)
1948 location_chain node
, next
;
1949 location_chain
*nextp
;
1953 slot
= htab_find_slot_with_hash (set
->vars
, decl
,
1954 VARIABLE_HASH_VAL (decl
), INSERT
);
1957 /* Create new variable information. */
1958 var
= pool_alloc (var_pool
);
1961 var
->n_var_parts
= 1;
1962 var
->var_part
[0].offset
= offset
;
1963 var
->var_part
[0].loc_chain
= NULL
;
1964 var
->var_part
[0].cur_loc
= NULL
;
1970 var
= (variable
) *slot
;
1972 /* Find the location part. */
1974 high
= var
->n_var_parts
;
1977 pos
= (low
+ high
) / 2;
1978 if (var
->var_part
[pos
].offset
< offset
)
1985 if (pos
< var
->n_var_parts
&& var
->var_part
[pos
].offset
== offset
)
1987 node
= var
->var_part
[pos
].loc_chain
;
1990 && ((REG_P (node
->loc
) && REG_P (loc
)
1991 && REGNO (node
->loc
) == REGNO (loc
))
1992 || rtx_equal_p (node
->loc
, loc
)))
1994 /* LOC is in the beginning of the chain so we have nothing
2000 /* We have to make a copy of a shared variable. */
2001 if (var
->refcount
> 1)
2002 var
= unshare_variable (set
, var
);
2007 /* We have not found the location part, new one will be created. */
2009 /* We have to make a copy of the shared variable. */
2010 if (var
->refcount
> 1)
2011 var
= unshare_variable (set
, var
);
2013 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
2014 thus there are at most MAX_VAR_PARTS different offsets. */
2015 gcc_assert (var
->n_var_parts
< MAX_VAR_PARTS
);
2017 /* We have to move the elements of array starting at index low to the
2019 for (high
= var
->n_var_parts
; high
> low
; high
--)
2020 var
->var_part
[high
] = var
->var_part
[high
- 1];
2023 var
->var_part
[pos
].offset
= offset
;
2024 var
->var_part
[pos
].loc_chain
= NULL
;
2025 var
->var_part
[pos
].cur_loc
= NULL
;
2029 /* Delete the location from the list. */
2030 nextp
= &var
->var_part
[pos
].loc_chain
;
2031 for (node
= var
->var_part
[pos
].loc_chain
; node
; node
= next
)
2034 if ((REG_P (node
->loc
) && REG_P (loc
)
2035 && REGNO (node
->loc
) == REGNO (loc
))
2036 || rtx_equal_p (node
->loc
, loc
))
2038 pool_free (loc_chain_pool
, node
);
2043 nextp
= &node
->next
;
2046 /* Add the location to the beginning. */
2047 node
= pool_alloc (loc_chain_pool
);
2049 node
->next
= var
->var_part
[pos
].loc_chain
;
2050 var
->var_part
[pos
].loc_chain
= node
;
2052 /* If no location was emitted do so. */
2053 if (var
->var_part
[pos
].cur_loc
== NULL
)
2055 var
->var_part
[pos
].cur_loc
= loc
;
2056 variable_was_changed (var
, set
->vars
);
2060 /* Delete the part of variable's location from dataflow set SET. The variable
2061 part is specified by variable's declaration DECL and offset OFFSET and the
2062 part's location by LOC. */
2065 delete_variable_part (dataflow_set
*set
, rtx loc
, tree decl
,
2066 HOST_WIDE_INT offset
)
2071 slot
= htab_find_slot_with_hash (set
->vars
, decl
, VARIABLE_HASH_VAL (decl
),
2075 variable var
= (variable
) *slot
;
2077 /* Find the location part. */
2079 high
= var
->n_var_parts
;
2082 pos
= (low
+ high
) / 2;
2083 if (var
->var_part
[pos
].offset
< offset
)
2090 if (pos
< var
->n_var_parts
&& var
->var_part
[pos
].offset
== offset
)
2092 location_chain node
, next
;
2093 location_chain
*nextp
;
2096 if (var
->refcount
> 1)
2098 /* If the variable contains the location part we have to
2099 make a copy of the variable. */
2100 for (node
= var
->var_part
[pos
].loc_chain
; node
;
2103 if ((REG_P (node
->loc
) && REG_P (loc
)
2104 && REGNO (node
->loc
) == REGNO (loc
))
2105 || rtx_equal_p (node
->loc
, loc
))
2107 var
= unshare_variable (set
, var
);
2113 /* Delete the location part. */
2114 nextp
= &var
->var_part
[pos
].loc_chain
;
2115 for (node
= *nextp
; node
; node
= next
)
2118 if ((REG_P (node
->loc
) && REG_P (loc
)
2119 && REGNO (node
->loc
) == REGNO (loc
))
2120 || rtx_equal_p (node
->loc
, loc
))
2122 pool_free (loc_chain_pool
, node
);
2127 nextp
= &node
->next
;
2130 /* If we have deleted the location which was last emitted
2131 we have to emit new location so add the variable to set
2132 of changed variables. */
2133 if (var
->var_part
[pos
].cur_loc
2135 && REG_P (var
->var_part
[pos
].cur_loc
)
2136 && REGNO (loc
) == REGNO (var
->var_part
[pos
].cur_loc
))
2137 || rtx_equal_p (loc
, var
->var_part
[pos
].cur_loc
)))
2140 if (var
->var_part
[pos
].loc_chain
)
2141 var
->var_part
[pos
].cur_loc
= var
->var_part
[pos
].loc_chain
->loc
;
2146 if (var
->var_part
[pos
].loc_chain
== NULL
)
2149 while (pos
< var
->n_var_parts
)
2151 var
->var_part
[pos
] = var
->var_part
[pos
+ 1];
2156 variable_was_changed (var
, set
->vars
);
2161 /* Emit the NOTE_INSN_VAR_LOCATION for variable *VARP. DATA contains
2162 additional parameters: WHERE specifies whether the note shall be emitted
2163 before of after instruction INSN. */
2166 emit_note_insn_var_location (void **varp
, void *data
)
2168 variable var
= *(variable
*) varp
;
2169 rtx insn
= ((emit_note_data
*)data
)->insn
;
2170 enum emit_note_where where
= ((emit_note_data
*)data
)->where
;
2172 int i
, j
, n_var_parts
;
2174 HOST_WIDE_INT last_limit
;
2175 tree type_size_unit
;
2176 HOST_WIDE_INT offsets
[MAX_VAR_PARTS
];
2177 rtx loc
[MAX_VAR_PARTS
];
2179 gcc_assert (var
->decl
);
2184 for (i
= 0; i
< var
->n_var_parts
; i
++)
2186 enum machine_mode mode
, wider_mode
;
2188 if (last_limit
< var
->var_part
[i
].offset
)
2193 else if (last_limit
> var
->var_part
[i
].offset
)
2195 offsets
[n_var_parts
] = var
->var_part
[i
].offset
;
2196 loc
[n_var_parts
] = var
->var_part
[i
].loc_chain
->loc
;
2197 mode
= GET_MODE (loc
[n_var_parts
]);
2198 last_limit
= offsets
[n_var_parts
] + GET_MODE_SIZE (mode
);
2200 /* Attempt to merge adjacent registers or memory. */
2201 wider_mode
= GET_MODE_WIDER_MODE (mode
);
2202 for (j
= i
+ 1; j
< var
->n_var_parts
; j
++)
2203 if (last_limit
<= var
->var_part
[j
].offset
)
2205 if (j
< var
->n_var_parts
2206 && wider_mode
!= VOIDmode
2207 && GET_CODE (loc
[n_var_parts
])
2208 == GET_CODE (var
->var_part
[j
].loc_chain
->loc
)
2209 && mode
== GET_MODE (var
->var_part
[j
].loc_chain
->loc
)
2210 && last_limit
== var
->var_part
[j
].offset
)
2213 rtx loc2
= var
->var_part
[j
].loc_chain
->loc
;
2215 if (REG_P (loc
[n_var_parts
])
2216 && hard_regno_nregs
[REGNO (loc
[n_var_parts
])][mode
] * 2
2217 == hard_regno_nregs
[REGNO (loc
[n_var_parts
])][wider_mode
]
2218 && REGNO (loc
[n_var_parts
])
2219 + hard_regno_nregs
[REGNO (loc
[n_var_parts
])][mode
]
2222 if (! WORDS_BIG_ENDIAN
&& ! BYTES_BIG_ENDIAN
)
2223 new_loc
= simplify_subreg (wider_mode
, loc
[n_var_parts
],
2225 else if (WORDS_BIG_ENDIAN
&& BYTES_BIG_ENDIAN
)
2226 new_loc
= simplify_subreg (wider_mode
, loc2
, mode
, 0);
2229 if (!REG_P (new_loc
)
2230 || REGNO (new_loc
) != REGNO (loc
[n_var_parts
]))
2233 REG_ATTRS (new_loc
) = REG_ATTRS (loc
[n_var_parts
]);
2236 else if (MEM_P (loc
[n_var_parts
])
2237 && GET_CODE (XEXP (loc2
, 0)) == PLUS
2238 && GET_CODE (XEXP (XEXP (loc2
, 0), 0)) == REG
2239 && GET_CODE (XEXP (XEXP (loc2
, 0), 1)) == CONST_INT
)
2241 if ((GET_CODE (XEXP (loc
[n_var_parts
], 0)) == REG
2242 && rtx_equal_p (XEXP (loc
[n_var_parts
], 0),
2243 XEXP (XEXP (loc2
, 0), 0))
2244 && INTVAL (XEXP (XEXP (loc2
, 0), 1))
2245 == GET_MODE_SIZE (mode
))
2246 || (GET_CODE (XEXP (loc
[n_var_parts
], 0)) == PLUS
2247 && GET_CODE (XEXP (XEXP (loc
[n_var_parts
], 0), 1))
2249 && rtx_equal_p (XEXP (XEXP (loc
[n_var_parts
], 0), 0),
2250 XEXP (XEXP (loc2
, 0), 0))
2251 && INTVAL (XEXP (XEXP (loc
[n_var_parts
], 0), 1))
2252 + GET_MODE_SIZE (mode
)
2253 == INTVAL (XEXP (XEXP (loc2
, 0), 1))))
2254 new_loc
= adjust_address_nv (loc
[n_var_parts
],
2260 loc
[n_var_parts
] = new_loc
;
2262 last_limit
= offsets
[n_var_parts
] + GET_MODE_SIZE (mode
);
2268 type_size_unit
= TYPE_SIZE_UNIT (TREE_TYPE (var
->decl
));
2269 if ((unsigned HOST_WIDE_INT
) last_limit
< TREE_INT_CST_LOW (type_size_unit
))
2272 if (where
== EMIT_NOTE_AFTER_INSN
)
2273 note
= emit_note_after (NOTE_INSN_VAR_LOCATION
, insn
);
2275 note
= emit_note_before (NOTE_INSN_VAR_LOCATION
, insn
);
2279 NOTE_VAR_LOCATION (note
) = gen_rtx_VAR_LOCATION (VOIDmode
, var
->decl
,
2282 else if (n_var_parts
== 1)
2285 = gen_rtx_EXPR_LIST (VOIDmode
, loc
[0], GEN_INT (offsets
[0]));
2287 NOTE_VAR_LOCATION (note
) = gen_rtx_VAR_LOCATION (VOIDmode
, var
->decl
,
2290 else if (n_var_parts
)
2294 for (i
= 0; i
< n_var_parts
; i
++)
2296 = gen_rtx_EXPR_LIST (VOIDmode
, loc
[i
], GEN_INT (offsets
[i
]));
2298 parallel
= gen_rtx_PARALLEL (VOIDmode
,
2299 gen_rtvec_v (n_var_parts
, loc
));
2300 NOTE_VAR_LOCATION (note
) = gen_rtx_VAR_LOCATION (VOIDmode
, var
->decl
,
2304 htab_clear_slot (changed_variables
, varp
);
2306 /* When there are no location parts the variable has been already
2307 removed from hash table and a new empty variable was created.
2308 Free the empty variable. */
2309 if (var
->n_var_parts
== 0)
2311 pool_free (var_pool
, var
);
2314 /* Continue traversing the hash table. */
2318 /* Emit NOTE_INSN_VAR_LOCATION note for each variable from a chain
2319 CHANGED_VARIABLES and delete this chain. WHERE specifies whether the notes
2320 shall be emitted before of after instruction INSN. */
2323 emit_notes_for_changes (rtx insn
, enum emit_note_where where
)
2325 emit_note_data data
;
2329 htab_traverse (changed_variables
, emit_note_insn_var_location
, &data
);
2332 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it differs from the
2333 same variable in hash table DATA or is not there at all. */
2336 emit_notes_for_differences_1 (void **slot
, void *data
)
2338 htab_t new_vars
= (htab_t
) data
;
2339 variable old_var
, new_var
;
2341 old_var
= *(variable
*) slot
;
2342 new_var
= htab_find_with_hash (new_vars
, old_var
->decl
,
2343 VARIABLE_HASH_VAL (old_var
->decl
));
2347 /* Variable has disappeared. */
2350 empty_var
= pool_alloc (var_pool
);
2351 empty_var
->decl
= old_var
->decl
;
2352 empty_var
->refcount
= 1;
2353 empty_var
->n_var_parts
= 0;
2354 variable_was_changed (empty_var
, NULL
);
2356 else if (variable_different_p (old_var
, new_var
, true))
2358 variable_was_changed (new_var
, NULL
);
2361 /* Continue traversing the hash table. */
2365 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it is not in hash
2369 emit_notes_for_differences_2 (void **slot
, void *data
)
2371 htab_t old_vars
= (htab_t
) data
;
2372 variable old_var
, new_var
;
2374 new_var
= *(variable
*) slot
;
2375 old_var
= htab_find_with_hash (old_vars
, new_var
->decl
,
2376 VARIABLE_HASH_VAL (new_var
->decl
));
2379 /* Variable has appeared. */
2380 variable_was_changed (new_var
, NULL
);
2383 /* Continue traversing the hash table. */
2387 /* Emit notes before INSN for differences between dataflow sets OLD_SET and
2391 emit_notes_for_differences (rtx insn
, dataflow_set
*old_set
,
2392 dataflow_set
*new_set
)
2394 htab_traverse (old_set
->vars
, emit_notes_for_differences_1
, new_set
->vars
);
2395 htab_traverse (new_set
->vars
, emit_notes_for_differences_2
, old_set
->vars
);
2396 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
);
2399 /* Emit the notes for changes of location parts in the basic block BB. */
2402 emit_notes_in_bb (basic_block bb
)
2407 dataflow_set_init (&set
, htab_elements (VTI (bb
)->in
.vars
) + 3);
2408 dataflow_set_copy (&set
, &VTI (bb
)->in
);
2410 for (i
= 0; i
< VTI (bb
)->n_mos
; i
++)
2412 rtx insn
= VTI (bb
)->mos
[i
].insn
;
2414 switch (VTI (bb
)->mos
[i
].type
)
2420 for (r
= 0; r
< FIRST_PSEUDO_REGISTER
; r
++)
2421 if (TEST_HARD_REG_BIT (call_used_reg_set
, r
))
2423 var_regno_delete (&set
, r
);
2425 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
);
2432 rtx loc
= VTI (bb
)->mos
[i
].u
.loc
;
2435 var_reg_delete_and_set (&set
, loc
);
2437 var_mem_delete_and_set (&set
, loc
);
2439 if (VTI (bb
)->mos
[i
].type
== MO_USE
)
2440 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
);
2442 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
);
2449 rtx loc
= VTI (bb
)->mos
[i
].u
.loc
;
2452 var_reg_delete (&set
, loc
);
2454 var_mem_delete (&set
, loc
);
2456 if (VTI (bb
)->mos
[i
].type
== MO_USE_NO_VAR
)
2457 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
);
2459 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
);
2467 set
.stack_adjust
+= VTI (bb
)->mos
[i
].u
.adjust
;
2468 base
= gen_rtx_MEM (Pmode
, plus_constant (stack_pointer_rtx
,
2470 set_frame_base_location (&set
, base
);
2471 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
);
2476 dataflow_set_destroy (&set
);
2479 /* Emit notes for the whole function. */
2482 vt_emit_notes (void)
2485 dataflow_set
*last_out
;
2488 gcc_assert (!htab_elements (changed_variables
));
2490 /* Enable emitting notes by functions (mainly by set_variable_part and
2491 delete_variable_part). */
2494 dataflow_set_init (&empty
, 7);
2499 /* Emit the notes for changes of variable locations between two
2500 subsequent basic blocks. */
2501 emit_notes_for_differences (BB_HEAD (bb
), last_out
, &VTI (bb
)->in
);
2503 /* Emit the notes for the changes in the basic block itself. */
2504 emit_notes_in_bb (bb
);
2506 last_out
= &VTI (bb
)->out
;
2508 dataflow_set_destroy (&empty
);
2512 /* If there is a declaration and offset associated with register/memory RTL
2513 assign declaration to *DECLP and offset to *OFFSETP, and return true. */
2516 vt_get_decl_and_offset (rtx rtl
, tree
*declp
, HOST_WIDE_INT
*offsetp
)
2520 if (REG_ATTRS (rtl
))
2522 *declp
= REG_EXPR (rtl
);
2523 *offsetp
= REG_OFFSET (rtl
);
2527 else if (MEM_P (rtl
))
2529 if (MEM_ATTRS (rtl
))
2531 *declp
= MEM_EXPR (rtl
);
2532 *offsetp
= MEM_OFFSET (rtl
) ? INTVAL (MEM_OFFSET (rtl
)) : 0;
2539 /* Insert function parameters to IN and OUT sets of ENTRY_BLOCK. */
2542 vt_add_function_parameters (void)
2546 for (parm
= DECL_ARGUMENTS (current_function_decl
);
2547 parm
; parm
= TREE_CHAIN (parm
))
2549 rtx decl_rtl
= DECL_RTL_IF_SET (parm
);
2550 rtx incoming
= DECL_INCOMING_RTL (parm
);
2552 HOST_WIDE_INT offset
;
2555 if (TREE_CODE (parm
) != PARM_DECL
)
2558 if (!DECL_NAME (parm
))
2561 if (!decl_rtl
|| !incoming
)
2564 if (GET_MODE (decl_rtl
) == BLKmode
|| GET_MODE (incoming
) == BLKmode
)
2567 if (!vt_get_decl_and_offset (incoming
, &decl
, &offset
))
2568 if (!vt_get_decl_and_offset (decl_rtl
, &decl
, &offset
))
2574 gcc_assert (parm
== decl
);
2576 incoming
= eliminate_regs (incoming
, 0, NULL_RTX
);
2577 out
= &VTI (ENTRY_BLOCK_PTR
)->out
;
2579 if (REG_P (incoming
))
2581 gcc_assert (REGNO (incoming
) < FIRST_PSEUDO_REGISTER
);
2582 attrs_list_insert (&out
->regs
[REGNO (incoming
)],
2583 parm
, offset
, incoming
);
2584 set_variable_part (out
, incoming
, parm
, offset
);
2586 else if (MEM_P (incoming
))
2588 set_variable_part (out
, incoming
, parm
, offset
);
2593 /* Allocate and initialize the data structures for variable tracking
2594 and parse the RTL to get the micro operations. */
2597 vt_initialize (void)
2601 alloc_aux_for_blocks (sizeof (struct variable_tracking_info_def
));
2606 HOST_WIDE_INT pre
, post
;
2608 /* Count the number of micro operations. */
2609 VTI (bb
)->n_mos
= 0;
2610 for (insn
= BB_HEAD (bb
); insn
!= NEXT_INSN (BB_END (bb
));
2611 insn
= NEXT_INSN (insn
))
2615 if (!frame_pointer_needed
)
2617 insn_stack_adjust_offset_pre_post (insn
, &pre
, &post
);
2623 note_uses (&PATTERN (insn
), count_uses_1
, insn
);
2624 note_stores (PATTERN (insn
), count_stores
, insn
);
2630 /* Add the micro-operations to the array. */
2631 VTI (bb
)->mos
= xmalloc (VTI (bb
)->n_mos
2632 * sizeof (struct micro_operation_def
));
2633 VTI (bb
)->n_mos
= 0;
2634 for (insn
= BB_HEAD (bb
); insn
!= NEXT_INSN (BB_END (bb
));
2635 insn
= NEXT_INSN (insn
))
2641 if (!frame_pointer_needed
)
2643 insn_stack_adjust_offset_pre_post (insn
, &pre
, &post
);
2646 micro_operation
*mo
= VTI (bb
)->mos
+ VTI (bb
)->n_mos
++;
2648 mo
->type
= MO_ADJUST
;
2654 n1
= VTI (bb
)->n_mos
;
2655 note_uses (&PATTERN (insn
), add_uses_1
, insn
);
2656 n2
= VTI (bb
)->n_mos
- 1;
2658 /* Order the MO_USEs to be before MO_USE_NO_VARs. */
2661 while (n1
< n2
&& VTI (bb
)->mos
[n1
].type
== MO_USE
)
2663 while (n1
< n2
&& VTI (bb
)->mos
[n2
].type
== MO_USE_NO_VAR
)
2669 sw
= VTI (bb
)->mos
[n1
];
2670 VTI (bb
)->mos
[n1
] = VTI (bb
)->mos
[n2
];
2671 VTI (bb
)->mos
[n2
] = sw
;
2677 micro_operation
*mo
= VTI (bb
)->mos
+ VTI (bb
)->n_mos
++;
2683 n1
= VTI (bb
)->n_mos
;
2684 note_stores (PATTERN (insn
), add_stores
, insn
);
2685 n2
= VTI (bb
)->n_mos
- 1;
2687 /* Order the MO_SETs to be before MO_CLOBBERs. */
2690 while (n1
< n2
&& VTI (bb
)->mos
[n1
].type
== MO_SET
)
2692 while (n1
< n2
&& VTI (bb
)->mos
[n2
].type
== MO_CLOBBER
)
2698 sw
= VTI (bb
)->mos
[n1
];
2699 VTI (bb
)->mos
[n1
] = VTI (bb
)->mos
[n2
];
2700 VTI (bb
)->mos
[n2
] = sw
;
2704 if (!frame_pointer_needed
&& post
)
2706 micro_operation
*mo
= VTI (bb
)->mos
+ VTI (bb
)->n_mos
++;
2708 mo
->type
= MO_ADJUST
;
2709 mo
->u
.adjust
= post
;
2716 /* Init the IN and OUT sets. */
2719 VTI (bb
)->visited
= false;
2720 dataflow_set_init (&VTI (bb
)->in
, 7);
2721 dataflow_set_init (&VTI (bb
)->out
, 7);
2724 attrs_pool
= create_alloc_pool ("attrs_def pool",
2725 sizeof (struct attrs_def
), 1024);
2726 var_pool
= create_alloc_pool ("variable_def pool",
2727 sizeof (struct variable_def
), 64);
2728 loc_chain_pool
= create_alloc_pool ("location_chain_def pool",
2729 sizeof (struct location_chain_def
),
2731 changed_variables
= htab_create (10, variable_htab_hash
, variable_htab_eq
,
2733 vt_add_function_parameters ();
2735 if (!frame_pointer_needed
)
2739 /* Create fake variable for tracking stack pointer changes. */
2740 frame_base_decl
= make_node (VAR_DECL
);
2741 DECL_NAME (frame_base_decl
) = get_identifier ("___frame_base_decl");
2742 TREE_TYPE (frame_base_decl
) = char_type_node
;
2743 DECL_ARTIFICIAL (frame_base_decl
) = 1;
2744 DECL_IGNORED_P (frame_base_decl
) = 1;
2746 /* Set its initial "location". */
2747 frame_stack_adjust
= -prologue_stack_adjust ();
2748 base
= gen_rtx_MEM (Pmode
, plus_constant (stack_pointer_rtx
,
2749 frame_stack_adjust
));
2750 set_variable_part (&VTI (ENTRY_BLOCK_PTR
)->out
, base
, frame_base_decl
, 0);
2754 frame_base_decl
= NULL
;
2758 /* Free the data structures needed for variable tracking. */
2767 free (VTI (bb
)->mos
);
2772 dataflow_set_destroy (&VTI (bb
)->in
);
2773 dataflow_set_destroy (&VTI (bb
)->out
);
2775 free_aux_for_blocks ();
2776 free_alloc_pool (attrs_pool
);
2777 free_alloc_pool (var_pool
);
2778 free_alloc_pool (loc_chain_pool
);
2779 htab_delete (changed_variables
);
2782 /* The entry point to variable tracking pass. */
2785 variable_tracking_main (void)
2787 if (n_basic_blocks
> 500 && n_edges
/ n_basic_blocks
>= 20)
2790 mark_dfs_back_edges ();
2792 if (!frame_pointer_needed
)
2794 if (!vt_stack_adjustments ())
2801 vt_find_locations ();
2806 dump_dataflow_sets ();
2807 dump_flow_info (dump_file
);