1 /* Variable tracking routines for the GNU compiler.
2 Copyright (C) 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful, but WITHOUT
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
15 License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
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 #include "tree-pass.h"
109 #include "tree-flow.h"
114 #include "diagnostic.h"
115 #include "tree-pretty-print.h"
116 #include "pointer-set.h"
119 /* var-tracking.c assumes that tree code with the same value as VALUE rtx code
120 has no chance to appear in REG_EXPR/MEM_EXPRs and isn't a decl.
121 Currently the value is the same as IDENTIFIER_NODE, which has such
122 a property. If this compile time assertion ever fails, make sure that
123 the new tree code that equals (int) VALUE has the same property. */
124 extern char check_value_val
[(int) VALUE
== (int) IDENTIFIER_NODE
? 1 : -1];
126 /* Type of micro operation. */
127 enum micro_operation_type
129 MO_USE
, /* Use location (REG or MEM). */
130 MO_USE_NO_VAR
,/* Use location which is not associated with a variable
131 or the variable is not trackable. */
132 MO_VAL_USE
, /* Use location which is associated with a value. */
133 MO_VAL_LOC
, /* Use location which appears in a debug insn. */
134 MO_VAL_SET
, /* Set location associated with a value. */
135 MO_SET
, /* Set location. */
136 MO_COPY
, /* Copy the same portion of a variable from one
137 location to another. */
138 MO_CLOBBER
, /* Clobber location. */
139 MO_CALL
, /* Call insn. */
140 MO_ADJUST
/* Adjust stack pointer. */
144 static const char * const ATTRIBUTE_UNUSED
145 micro_operation_type_name
[] = {
158 /* Where shall the note be emitted? BEFORE or AFTER the instruction.
159 Notes emitted as AFTER_CALL are to take effect during the call,
160 rather than after the call. */
163 EMIT_NOTE_BEFORE_INSN
,
164 EMIT_NOTE_AFTER_INSN
,
165 EMIT_NOTE_AFTER_CALL_INSN
168 /* Structure holding information about micro operation. */
169 typedef struct micro_operation_def
171 /* Type of micro operation. */
172 enum micro_operation_type type
;
174 /* The instruction which the micro operation is in, for MO_USE,
175 MO_USE_NO_VAR, MO_CALL and MO_ADJUST, or the subsequent
176 instruction or note in the original flow (before any var-tracking
177 notes are inserted, to simplify emission of notes), for MO_SET
182 /* Location. For MO_SET and MO_COPY, this is the SET that
183 performs the assignment, if known, otherwise it is the target
184 of the assignment. For MO_VAL_USE and MO_VAL_SET, it is a
185 CONCAT of the VALUE and the LOC associated with it. For
186 MO_VAL_LOC, it is a CONCAT of the VALUE and the VAR_LOCATION
187 associated with it. */
190 /* Stack adjustment. */
191 HOST_WIDE_INT adjust
;
195 DEF_VEC_O(micro_operation
);
196 DEF_VEC_ALLOC_O(micro_operation
,heap
);
198 /* A declaration of a variable, or an RTL value being handled like a
200 typedef void *decl_or_value
;
202 /* Structure for passing some other parameters to function
203 emit_note_insn_var_location. */
204 typedef struct emit_note_data_def
206 /* The instruction which the note will be emitted before/after. */
209 /* Where the note will be emitted (before/after insn)? */
210 enum emit_note_where where
;
212 /* The variables and values active at this point. */
216 /* Description of location of a part of a variable. The content of a physical
217 register is described by a chain of these structures.
218 The chains are pretty short (usually 1 or 2 elements) and thus
219 chain is the best data structure. */
220 typedef struct attrs_def
222 /* Pointer to next member of the list. */
223 struct attrs_def
*next
;
225 /* The rtx of register. */
228 /* The declaration corresponding to LOC. */
231 /* Offset from start of DECL. */
232 HOST_WIDE_INT offset
;
235 /* Structure holding a refcounted hash table. If refcount > 1,
236 it must be first unshared before modified. */
237 typedef struct shared_hash_def
239 /* Reference count. */
242 /* Actual hash table. */
246 /* Structure holding the IN or OUT set for a basic block. */
247 typedef struct dataflow_set_def
249 /* Adjustment of stack offset. */
250 HOST_WIDE_INT stack_adjust
;
252 /* Attributes for registers (lists of attrs). */
253 attrs regs
[FIRST_PSEUDO_REGISTER
];
255 /* Variable locations. */
258 /* Vars that is being traversed. */
259 shared_hash traversed_vars
;
262 /* The structure (one for each basic block) containing the information
263 needed for variable tracking. */
264 typedef struct variable_tracking_info_def
266 /* The vector of micro operations. */
267 VEC(micro_operation
, heap
) *mos
;
269 /* The IN and OUT set for dataflow analysis. */
273 /* The permanent-in dataflow set for this block. This is used to
274 hold values for which we had to compute entry values. ??? This
275 should probably be dynamically allocated, to avoid using more
276 memory in non-debug builds. */
279 /* Has the block been visited in DFS? */
282 /* Has the block been flooded in VTA? */
285 } *variable_tracking_info
;
287 /* Structure for chaining the locations. */
288 typedef struct location_chain_def
290 /* Next element in the chain. */
291 struct location_chain_def
*next
;
293 /* The location (REG, MEM or VALUE). */
296 /* The "value" stored in this location. */
300 enum var_init_status init
;
303 /* Structure describing one part of variable. */
304 typedef struct variable_part_def
306 /* Chain of locations of the part. */
307 location_chain loc_chain
;
309 /* Location which was last emitted to location list. */
312 /* The offset in the variable. */
313 HOST_WIDE_INT offset
;
316 /* Maximum number of location parts. */
317 #define MAX_VAR_PARTS 16
319 /* Structure describing where the variable is located. */
320 typedef struct variable_def
322 /* The declaration of the variable, or an RTL value being handled
323 like a declaration. */
326 /* Reference count. */
329 /* Number of variable parts. */
332 /* True if this variable changed (any of its) cur_loc fields
333 during the current emit_notes_for_changes resp.
334 emit_notes_for_differences call. */
335 bool cur_loc_changed
;
337 /* True if this variable_def struct is currently in the
338 changed_variables hash table. */
339 bool in_changed_variables
;
341 /* The variable parts. */
342 variable_part var_part
[1];
344 typedef const struct variable_def
*const_variable
;
346 /* Structure for chaining backlinks from referenced VALUEs to
347 DVs that are referencing them. */
348 typedef struct value_chain_def
350 /* Next value_chain entry. */
351 struct value_chain_def
*next
;
353 /* The declaration of the variable, or an RTL value
354 being handled like a declaration, whose var_parts[0].loc_chain
355 references the VALUE owning this value_chain. */
358 /* Reference count. */
361 typedef const struct value_chain_def
*const_value_chain
;
363 /* Pointer to the BB's information specific to variable tracking pass. */
364 #define VTI(BB) ((variable_tracking_info) (BB)->aux)
366 /* Macro to access MEM_OFFSET as an HOST_WIDE_INT. Evaluates MEM twice. */
367 #define INT_MEM_OFFSET(mem) (MEM_OFFSET (mem) ? INTVAL (MEM_OFFSET (mem)) : 0)
369 /* Alloc pool for struct attrs_def. */
370 static alloc_pool attrs_pool
;
372 /* Alloc pool for struct variable_def with MAX_VAR_PARTS entries. */
373 static alloc_pool var_pool
;
375 /* Alloc pool for struct variable_def with a single var_part entry. */
376 static alloc_pool valvar_pool
;
378 /* Alloc pool for struct location_chain_def. */
379 static alloc_pool loc_chain_pool
;
381 /* Alloc pool for struct shared_hash_def. */
382 static alloc_pool shared_hash_pool
;
384 /* Alloc pool for struct value_chain_def. */
385 static alloc_pool value_chain_pool
;
387 /* Changed variables, notes will be emitted for them. */
388 static htab_t changed_variables
;
390 /* Links from VALUEs to DVs referencing them in their current loc_chains. */
391 static htab_t value_chains
;
393 /* Shall notes be emitted? */
394 static bool emit_notes
;
396 /* Empty shared hashtable. */
397 static shared_hash empty_shared_hash
;
399 /* Scratch register bitmap used by cselib_expand_value_rtx. */
400 static bitmap scratch_regs
= NULL
;
402 /* Variable used to tell whether cselib_process_insn called our hook. */
403 static bool cselib_hook_called
;
405 /* Local function prototypes. */
406 static void stack_adjust_offset_pre_post (rtx
, HOST_WIDE_INT
*,
408 static void insn_stack_adjust_offset_pre_post (rtx
, HOST_WIDE_INT
*,
410 static bool vt_stack_adjustments (void);
411 static rtx
compute_cfa_pointer (HOST_WIDE_INT
);
412 static hashval_t
variable_htab_hash (const void *);
413 static int variable_htab_eq (const void *, const void *);
414 static void variable_htab_free (void *);
416 static void init_attrs_list_set (attrs
*);
417 static void attrs_list_clear (attrs
*);
418 static attrs
attrs_list_member (attrs
, decl_or_value
, HOST_WIDE_INT
);
419 static void attrs_list_insert (attrs
*, decl_or_value
, HOST_WIDE_INT
, rtx
);
420 static void attrs_list_copy (attrs
*, attrs
);
421 static void attrs_list_union (attrs
*, attrs
);
423 static void **unshare_variable (dataflow_set
*set
, void **slot
, variable var
,
424 enum var_init_status
);
425 static void vars_copy (htab_t
, htab_t
);
426 static tree
var_debug_decl (tree
);
427 static void var_reg_set (dataflow_set
*, rtx
, enum var_init_status
, rtx
);
428 static void var_reg_delete_and_set (dataflow_set
*, rtx
, bool,
429 enum var_init_status
, rtx
);
430 static void var_reg_delete (dataflow_set
*, rtx
, bool);
431 static void var_regno_delete (dataflow_set
*, int);
432 static void var_mem_set (dataflow_set
*, rtx
, enum var_init_status
, rtx
);
433 static void var_mem_delete_and_set (dataflow_set
*, rtx
, bool,
434 enum var_init_status
, rtx
);
435 static void var_mem_delete (dataflow_set
*, rtx
, bool);
437 static void dataflow_set_init (dataflow_set
*);
438 static void dataflow_set_clear (dataflow_set
*);
439 static void dataflow_set_copy (dataflow_set
*, dataflow_set
*);
440 static int variable_union_info_cmp_pos (const void *, const void *);
441 static void dataflow_set_union (dataflow_set
*, dataflow_set
*);
442 static location_chain
find_loc_in_1pdv (rtx
, variable
, htab_t
);
443 static bool canon_value_cmp (rtx
, rtx
);
444 static int loc_cmp (rtx
, rtx
);
445 static bool variable_part_different_p (variable_part
*, variable_part
*);
446 static bool onepart_variable_different_p (variable
, variable
);
447 static bool variable_different_p (variable
, variable
);
448 static bool dataflow_set_different (dataflow_set
*, dataflow_set
*);
449 static void dataflow_set_destroy (dataflow_set
*);
451 static bool contains_symbol_ref (rtx
);
452 static bool track_expr_p (tree
, bool);
453 static bool same_variable_part_p (rtx
, tree
, HOST_WIDE_INT
);
454 static int add_uses (rtx
*, void *);
455 static void add_uses_1 (rtx
*, void *);
456 static void add_stores (rtx
, const_rtx
, void *);
457 static bool compute_bb_dataflow (basic_block
);
458 static bool vt_find_locations (void);
460 static void dump_attrs_list (attrs
);
461 static int dump_var_slot (void **, void *);
462 static void dump_var (variable
);
463 static void dump_vars (htab_t
);
464 static void dump_dataflow_set (dataflow_set
*);
465 static void dump_dataflow_sets (void);
467 static void variable_was_changed (variable
, dataflow_set
*);
468 static void **set_slot_part (dataflow_set
*, rtx
, void **,
469 decl_or_value
, HOST_WIDE_INT
,
470 enum var_init_status
, rtx
);
471 static void set_variable_part (dataflow_set
*, rtx
,
472 decl_or_value
, HOST_WIDE_INT
,
473 enum var_init_status
, rtx
, enum insert_option
);
474 static void **clobber_slot_part (dataflow_set
*, rtx
,
475 void **, HOST_WIDE_INT
, rtx
);
476 static void clobber_variable_part (dataflow_set
*, rtx
,
477 decl_or_value
, HOST_WIDE_INT
, rtx
);
478 static void **delete_slot_part (dataflow_set
*, rtx
, void **, HOST_WIDE_INT
);
479 static void delete_variable_part (dataflow_set
*, rtx
,
480 decl_or_value
, HOST_WIDE_INT
);
481 static int emit_note_insn_var_location (void **, void *);
482 static void emit_notes_for_changes (rtx
, enum emit_note_where
, shared_hash
);
483 static int emit_notes_for_differences_1 (void **, void *);
484 static int emit_notes_for_differences_2 (void **, void *);
485 static void emit_notes_for_differences (rtx
, dataflow_set
*, dataflow_set
*);
486 static void emit_notes_in_bb (basic_block
, dataflow_set
*);
487 static void vt_emit_notes (void);
489 static bool vt_get_decl_and_offset (rtx
, tree
*, HOST_WIDE_INT
*);
490 static void vt_add_function_parameters (void);
491 static bool vt_initialize (void);
492 static void vt_finalize (void);
494 /* Given a SET, calculate the amount of stack adjustment it contains
495 PRE- and POST-modifying stack pointer.
496 This function is similar to stack_adjust_offset. */
499 stack_adjust_offset_pre_post (rtx pattern
, HOST_WIDE_INT
*pre
,
502 rtx src
= SET_SRC (pattern
);
503 rtx dest
= SET_DEST (pattern
);
506 if (dest
== stack_pointer_rtx
)
508 /* (set (reg sp) (plus (reg sp) (const_int))) */
509 code
= GET_CODE (src
);
510 if (! (code
== PLUS
|| code
== MINUS
)
511 || XEXP (src
, 0) != stack_pointer_rtx
512 || !CONST_INT_P (XEXP (src
, 1)))
516 *post
+= INTVAL (XEXP (src
, 1));
518 *post
-= INTVAL (XEXP (src
, 1));
520 else if (MEM_P (dest
))
522 /* (set (mem (pre_dec (reg sp))) (foo)) */
523 src
= XEXP (dest
, 0);
524 code
= GET_CODE (src
);
530 if (XEXP (src
, 0) == stack_pointer_rtx
)
532 rtx val
= XEXP (XEXP (src
, 1), 1);
533 /* We handle only adjustments by constant amount. */
534 gcc_assert (GET_CODE (XEXP (src
, 1)) == PLUS
&&
537 if (code
== PRE_MODIFY
)
538 *pre
-= INTVAL (val
);
540 *post
-= INTVAL (val
);
546 if (XEXP (src
, 0) == stack_pointer_rtx
)
548 *pre
+= GET_MODE_SIZE (GET_MODE (dest
));
554 if (XEXP (src
, 0) == stack_pointer_rtx
)
556 *post
+= GET_MODE_SIZE (GET_MODE (dest
));
562 if (XEXP (src
, 0) == stack_pointer_rtx
)
564 *pre
-= GET_MODE_SIZE (GET_MODE (dest
));
570 if (XEXP (src
, 0) == stack_pointer_rtx
)
572 *post
-= GET_MODE_SIZE (GET_MODE (dest
));
583 /* Given an INSN, calculate the amount of stack adjustment it contains
584 PRE- and POST-modifying stack pointer. */
587 insn_stack_adjust_offset_pre_post (rtx insn
, HOST_WIDE_INT
*pre
,
595 pattern
= PATTERN (insn
);
596 if (RTX_FRAME_RELATED_P (insn
))
598 rtx expr
= find_reg_note (insn
, REG_FRAME_RELATED_EXPR
, NULL_RTX
);
600 pattern
= XEXP (expr
, 0);
603 if (GET_CODE (pattern
) == SET
)
604 stack_adjust_offset_pre_post (pattern
, pre
, post
);
605 else if (GET_CODE (pattern
) == PARALLEL
606 || GET_CODE (pattern
) == SEQUENCE
)
610 /* There may be stack adjustments inside compound insns. Search
612 for ( i
= XVECLEN (pattern
, 0) - 1; i
>= 0; i
--)
613 if (GET_CODE (XVECEXP (pattern
, 0, i
)) == SET
)
614 stack_adjust_offset_pre_post (XVECEXP (pattern
, 0, i
), pre
, post
);
618 /* Compute stack adjustments for all blocks by traversing DFS tree.
619 Return true when the adjustments on all incoming edges are consistent.
620 Heavily borrowed from pre_and_rev_post_order_compute. */
623 vt_stack_adjustments (void)
625 edge_iterator
*stack
;
628 /* Initialize entry block. */
629 VTI (ENTRY_BLOCK_PTR
)->visited
= true;
630 VTI (ENTRY_BLOCK_PTR
)->in
.stack_adjust
= INCOMING_FRAME_SP_OFFSET
;
631 VTI (ENTRY_BLOCK_PTR
)->out
.stack_adjust
= INCOMING_FRAME_SP_OFFSET
;
633 /* Allocate stack for back-tracking up CFG. */
634 stack
= XNEWVEC (edge_iterator
, n_basic_blocks
+ 1);
637 /* Push the first edge on to the stack. */
638 stack
[sp
++] = ei_start (ENTRY_BLOCK_PTR
->succs
);
646 /* Look at the edge on the top of the stack. */
648 src
= ei_edge (ei
)->src
;
649 dest
= ei_edge (ei
)->dest
;
651 /* Check if the edge destination has been visited yet. */
652 if (!VTI (dest
)->visited
)
655 HOST_WIDE_INT pre
, post
, offset
;
656 VTI (dest
)->visited
= true;
657 VTI (dest
)->in
.stack_adjust
= offset
= VTI (src
)->out
.stack_adjust
;
659 if (dest
!= EXIT_BLOCK_PTR
)
660 for (insn
= BB_HEAD (dest
);
661 insn
!= NEXT_INSN (BB_END (dest
));
662 insn
= NEXT_INSN (insn
))
665 insn_stack_adjust_offset_pre_post (insn
, &pre
, &post
);
666 offset
+= pre
+ post
;
669 VTI (dest
)->out
.stack_adjust
= offset
;
671 if (EDGE_COUNT (dest
->succs
) > 0)
672 /* Since the DEST node has been visited for the first
673 time, check its successors. */
674 stack
[sp
++] = ei_start (dest
->succs
);
678 /* Check whether the adjustments on the edges are the same. */
679 if (VTI (dest
)->in
.stack_adjust
!= VTI (src
)->out
.stack_adjust
)
685 if (! ei_one_before_end_p (ei
))
686 /* Go to the next edge. */
687 ei_next (&stack
[sp
- 1]);
689 /* Return to previous level if there are no more edges. */
698 /* Compute a CFA-based value for the stack pointer. */
701 compute_cfa_pointer (HOST_WIDE_INT adjustment
)
705 #ifdef FRAME_POINTER_CFA_OFFSET
706 adjustment
-= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
707 cfa
= plus_constant (frame_pointer_rtx
, adjustment
);
709 adjustment
-= ARG_POINTER_CFA_OFFSET (current_function_decl
);
710 cfa
= plus_constant (arg_pointer_rtx
, adjustment
);
716 /* Adjustment for hard_frame_pointer_rtx to cfa base reg,
717 or -1 if the replacement shouldn't be done. */
718 static HOST_WIDE_INT hard_frame_pointer_adjustment
= -1;
720 /* Data for adjust_mems callback. */
722 struct adjust_mem_data
725 enum machine_mode mem_mode
;
726 HOST_WIDE_INT stack_adjust
;
730 /* Helper for adjust_mems. Return 1 if *loc is unsuitable for
731 transformation of wider mode arithmetics to narrower mode,
732 -1 if it is suitable and subexpressions shouldn't be
733 traversed and 0 if it is suitable and subexpressions should
734 be traversed. Called through for_each_rtx. */
737 use_narrower_mode_test (rtx
*loc
, void *data
)
739 rtx subreg
= (rtx
) data
;
741 if (CONSTANT_P (*loc
))
743 switch (GET_CODE (*loc
))
746 if (cselib_lookup (*loc
, GET_MODE (SUBREG_REG (subreg
)), 0))
754 if (for_each_rtx (&XEXP (*loc
, 0), use_narrower_mode_test
, data
))
763 /* Transform X into narrower mode MODE from wider mode WMODE. */
766 use_narrower_mode (rtx x
, enum machine_mode mode
, enum machine_mode wmode
)
770 return lowpart_subreg (mode
, x
, wmode
);
771 switch (GET_CODE (x
))
774 return lowpart_subreg (mode
, x
, wmode
);
778 op0
= use_narrower_mode (XEXP (x
, 0), mode
, wmode
);
779 op1
= use_narrower_mode (XEXP (x
, 1), mode
, wmode
);
780 return simplify_gen_binary (GET_CODE (x
), mode
, op0
, op1
);
782 op0
= use_narrower_mode (XEXP (x
, 0), mode
, wmode
);
783 return simplify_gen_binary (ASHIFT
, mode
, op0
, XEXP (x
, 1));
789 /* Helper function for adjusting used MEMs. */
792 adjust_mems (rtx loc
, const_rtx old_rtx
, void *data
)
794 struct adjust_mem_data
*amd
= (struct adjust_mem_data
*) data
;
795 rtx mem
, addr
= loc
, tem
;
796 enum machine_mode mem_mode_save
;
798 switch (GET_CODE (loc
))
801 /* Don't do any sp or fp replacements outside of MEM addresses
803 if (amd
->mem_mode
== VOIDmode
&& amd
->store
)
805 if (loc
== stack_pointer_rtx
806 && !frame_pointer_needed
)
807 return compute_cfa_pointer (amd
->stack_adjust
);
808 else if (loc
== hard_frame_pointer_rtx
809 && frame_pointer_needed
810 && hard_frame_pointer_adjustment
!= -1)
811 return compute_cfa_pointer (hard_frame_pointer_adjustment
);
817 mem
= targetm
.delegitimize_address (mem
);
818 if (mem
!= loc
&& !MEM_P (mem
))
819 return simplify_replace_fn_rtx (mem
, old_rtx
, adjust_mems
, data
);
822 addr
= XEXP (mem
, 0);
823 mem_mode_save
= amd
->mem_mode
;
824 amd
->mem_mode
= GET_MODE (mem
);
825 store_save
= amd
->store
;
827 addr
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
828 amd
->store
= store_save
;
829 amd
->mem_mode
= mem_mode_save
;
831 addr
= targetm
.delegitimize_address (addr
);
832 if (addr
!= XEXP (mem
, 0))
833 mem
= replace_equiv_address_nv (mem
, addr
);
835 mem
= avoid_constant_pool_reference (mem
);
839 addr
= gen_rtx_PLUS (GET_MODE (loc
), XEXP (loc
, 0),
840 GEN_INT (GET_CODE (loc
) == PRE_INC
841 ? GET_MODE_SIZE (amd
->mem_mode
)
842 : -GET_MODE_SIZE (amd
->mem_mode
)));
846 addr
= XEXP (loc
, 0);
847 gcc_assert (amd
->mem_mode
!= VOIDmode
&& amd
->mem_mode
!= BLKmode
);
848 addr
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
849 tem
= gen_rtx_PLUS (GET_MODE (loc
), XEXP (loc
, 0),
850 GEN_INT ((GET_CODE (loc
) == PRE_INC
851 || GET_CODE (loc
) == POST_INC
)
852 ? GET_MODE_SIZE (amd
->mem_mode
)
853 : -GET_MODE_SIZE (amd
->mem_mode
)));
854 amd
->side_effects
= alloc_EXPR_LIST (0,
855 gen_rtx_SET (VOIDmode
,
861 addr
= XEXP (loc
, 1);
864 addr
= XEXP (loc
, 0);
865 gcc_assert (amd
->mem_mode
!= VOIDmode
);
866 addr
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
867 amd
->side_effects
= alloc_EXPR_LIST (0,
868 gen_rtx_SET (VOIDmode
,
874 /* First try without delegitimization of whole MEMs and
875 avoid_constant_pool_reference, which is more likely to succeed. */
876 store_save
= amd
->store
;
878 addr
= simplify_replace_fn_rtx (SUBREG_REG (loc
), old_rtx
, adjust_mems
,
880 amd
->store
= store_save
;
881 mem
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
882 if (mem
== SUBREG_REG (loc
))
887 tem
= simplify_gen_subreg (GET_MODE (loc
), mem
,
888 GET_MODE (SUBREG_REG (loc
)),
892 tem
= simplify_gen_subreg (GET_MODE (loc
), addr
,
893 GET_MODE (SUBREG_REG (loc
)),
896 tem
= gen_rtx_raw_SUBREG (GET_MODE (loc
), addr
, SUBREG_BYTE (loc
));
898 if (MAY_HAVE_DEBUG_INSNS
899 && GET_CODE (tem
) == SUBREG
900 && (GET_CODE (SUBREG_REG (tem
)) == PLUS
901 || GET_CODE (SUBREG_REG (tem
)) == MINUS
902 || GET_CODE (SUBREG_REG (tem
)) == MULT
903 || GET_CODE (SUBREG_REG (tem
)) == ASHIFT
)
904 && GET_MODE_CLASS (GET_MODE (tem
)) == MODE_INT
905 && GET_MODE_CLASS (GET_MODE (SUBREG_REG (tem
))) == MODE_INT
906 && GET_MODE_SIZE (GET_MODE (tem
))
907 < GET_MODE_SIZE (GET_MODE (SUBREG_REG (tem
)))
908 && subreg_lowpart_p (tem
)
909 && !for_each_rtx (&SUBREG_REG (tem
), use_narrower_mode_test
, tem
))
910 return use_narrower_mode (SUBREG_REG (tem
), GET_MODE (tem
),
911 GET_MODE (SUBREG_REG (tem
)));
914 /* Don't do any replacements in second and following
915 ASM_OPERANDS of inline-asm with multiple sets.
916 ASM_OPERANDS_INPUT_VEC, ASM_OPERANDS_INPUT_CONSTRAINT_VEC
917 and ASM_OPERANDS_LABEL_VEC need to be equal between
918 all the ASM_OPERANDs in the insn and adjust_insn will
920 if (ASM_OPERANDS_OUTPUT_IDX (loc
) != 0)
929 /* Helper function for replacement of uses. */
932 adjust_mem_uses (rtx
*x
, void *data
)
934 rtx new_x
= simplify_replace_fn_rtx (*x
, NULL_RTX
, adjust_mems
, data
);
936 validate_change (NULL_RTX
, x
, new_x
, true);
939 /* Helper function for replacement of stores. */
942 adjust_mem_stores (rtx loc
, const_rtx expr
, void *data
)
946 rtx new_dest
= simplify_replace_fn_rtx (SET_DEST (expr
), NULL_RTX
,
948 if (new_dest
!= SET_DEST (expr
))
950 rtx xexpr
= CONST_CAST_RTX (expr
);
951 validate_change (NULL_RTX
, &SET_DEST (xexpr
), new_dest
, true);
956 /* Simplify INSN. Remove all {PRE,POST}_{INC,DEC,MODIFY} rtxes,
957 replace them with their value in the insn and add the side-effects
958 as other sets to the insn. */
961 adjust_insn (basic_block bb
, rtx insn
)
963 struct adjust_mem_data amd
;
965 amd
.mem_mode
= VOIDmode
;
966 amd
.stack_adjust
= -VTI (bb
)->out
.stack_adjust
;
967 amd
.side_effects
= NULL_RTX
;
970 note_stores (PATTERN (insn
), adjust_mem_stores
, &amd
);
973 if (GET_CODE (PATTERN (insn
)) == PARALLEL
974 && asm_noperands (PATTERN (insn
)) > 0
975 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == SET
)
980 /* inline-asm with multiple sets is tiny bit more complicated,
981 because the 3 vectors in ASM_OPERANDS need to be shared between
982 all ASM_OPERANDS in the instruction. adjust_mems will
983 not touch ASM_OPERANDS other than the first one, asm_noperands
984 test above needs to be called before that (otherwise it would fail)
985 and afterwards this code fixes it up. */
986 note_uses (&PATTERN (insn
), adjust_mem_uses
, &amd
);
987 body
= PATTERN (insn
);
988 set0
= XVECEXP (body
, 0, 0);
989 gcc_checking_assert (GET_CODE (set0
) == SET
990 && GET_CODE (SET_SRC (set0
)) == ASM_OPERANDS
991 && ASM_OPERANDS_OUTPUT_IDX (SET_SRC (set0
)) == 0);
992 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
993 if (GET_CODE (XVECEXP (body
, 0, i
)) != SET
)
997 set
= XVECEXP (body
, 0, i
);
998 gcc_checking_assert (GET_CODE (SET_SRC (set
)) == ASM_OPERANDS
999 && ASM_OPERANDS_OUTPUT_IDX (SET_SRC (set
))
1001 if (ASM_OPERANDS_INPUT_VEC (SET_SRC (set
))
1002 != ASM_OPERANDS_INPUT_VEC (SET_SRC (set0
))
1003 || ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set
))
1004 != ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set0
))
1005 || ASM_OPERANDS_LABEL_VEC (SET_SRC (set
))
1006 != ASM_OPERANDS_LABEL_VEC (SET_SRC (set0
)))
1008 rtx newsrc
= shallow_copy_rtx (SET_SRC (set
));
1009 ASM_OPERANDS_INPUT_VEC (newsrc
)
1010 = ASM_OPERANDS_INPUT_VEC (SET_SRC (set0
));
1011 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (newsrc
)
1012 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set0
));
1013 ASM_OPERANDS_LABEL_VEC (newsrc
)
1014 = ASM_OPERANDS_LABEL_VEC (SET_SRC (set0
));
1015 validate_change (NULL_RTX
, &SET_SRC (set
), newsrc
, true);
1020 note_uses (&PATTERN (insn
), adjust_mem_uses
, &amd
);
1022 /* For read-only MEMs containing some constant, prefer those
1024 set
= single_set (insn
);
1025 if (set
&& MEM_P (SET_SRC (set
)) && MEM_READONLY_P (SET_SRC (set
)))
1027 rtx note
= find_reg_equal_equiv_note (insn
);
1029 if (note
&& CONSTANT_P (XEXP (note
, 0)))
1030 validate_change (NULL_RTX
, &SET_SRC (set
), XEXP (note
, 0), true);
1033 if (amd
.side_effects
)
1035 rtx
*pat
, new_pat
, s
;
1038 pat
= &PATTERN (insn
);
1039 if (GET_CODE (*pat
) == COND_EXEC
)
1040 pat
= &COND_EXEC_CODE (*pat
);
1041 if (GET_CODE (*pat
) == PARALLEL
)
1042 oldn
= XVECLEN (*pat
, 0);
1045 for (s
= amd
.side_effects
, newn
= 0; s
; newn
++)
1047 new_pat
= gen_rtx_PARALLEL (VOIDmode
, rtvec_alloc (oldn
+ newn
));
1048 if (GET_CODE (*pat
) == PARALLEL
)
1049 for (i
= 0; i
< oldn
; i
++)
1050 XVECEXP (new_pat
, 0, i
) = XVECEXP (*pat
, 0, i
);
1052 XVECEXP (new_pat
, 0, 0) = *pat
;
1053 for (s
= amd
.side_effects
, i
= oldn
; i
< oldn
+ newn
; i
++, s
= XEXP (s
, 1))
1054 XVECEXP (new_pat
, 0, i
) = XEXP (s
, 0);
1055 free_EXPR_LIST_list (&amd
.side_effects
);
1056 validate_change (NULL_RTX
, pat
, new_pat
, true);
1060 /* Return true if a decl_or_value DV is a DECL or NULL. */
1062 dv_is_decl_p (decl_or_value dv
)
1064 return !dv
|| (int) TREE_CODE ((tree
) dv
) != (int) VALUE
;
1067 /* Return true if a decl_or_value is a VALUE rtl. */
1069 dv_is_value_p (decl_or_value dv
)
1071 return dv
&& !dv_is_decl_p (dv
);
1074 /* Return the decl in the decl_or_value. */
1076 dv_as_decl (decl_or_value dv
)
1078 #ifdef ENABLE_CHECKING
1079 gcc_assert (dv_is_decl_p (dv
));
1084 /* Return the value in the decl_or_value. */
1086 dv_as_value (decl_or_value dv
)
1088 #ifdef ENABLE_CHECKING
1089 gcc_assert (dv_is_value_p (dv
));
1094 /* Return the opaque pointer in the decl_or_value. */
1095 static inline void *
1096 dv_as_opaque (decl_or_value dv
)
1101 /* Return true if a decl_or_value must not have more than one variable
1104 dv_onepart_p (decl_or_value dv
)
1108 if (!MAY_HAVE_DEBUG_INSNS
)
1111 if (dv_is_value_p (dv
))
1114 decl
= dv_as_decl (dv
);
1119 if (TREE_CODE (decl
) == DEBUG_EXPR_DECL
)
1122 return (target_for_debug_bind (decl
) != NULL_TREE
);
1125 /* Return the variable pool to be used for dv, depending on whether it
1126 can have multiple parts or not. */
1127 static inline alloc_pool
1128 dv_pool (decl_or_value dv
)
1130 return dv_onepart_p (dv
) ? valvar_pool
: var_pool
;
1133 /* Build a decl_or_value out of a decl. */
1134 static inline decl_or_value
1135 dv_from_decl (tree decl
)
1139 #ifdef ENABLE_CHECKING
1140 gcc_assert (dv_is_decl_p (dv
));
1145 /* Build a decl_or_value out of a value. */
1146 static inline decl_or_value
1147 dv_from_value (rtx value
)
1151 #ifdef ENABLE_CHECKING
1152 gcc_assert (dv_is_value_p (dv
));
1157 extern void debug_dv (decl_or_value dv
);
1160 debug_dv (decl_or_value dv
)
1162 if (dv_is_value_p (dv
))
1163 debug_rtx (dv_as_value (dv
));
1165 debug_generic_stmt (dv_as_decl (dv
));
1168 typedef unsigned int dvuid
;
1170 /* Return the uid of DV. */
1173 dv_uid (decl_or_value dv
)
1175 if (dv_is_value_p (dv
))
1176 return CSELIB_VAL_PTR (dv_as_value (dv
))->uid
;
1178 return DECL_UID (dv_as_decl (dv
));
1181 /* Compute the hash from the uid. */
1183 static inline hashval_t
1184 dv_uid2hash (dvuid uid
)
1189 /* The hash function for a mask table in a shared_htab chain. */
1191 static inline hashval_t
1192 dv_htab_hash (decl_or_value dv
)
1194 return dv_uid2hash (dv_uid (dv
));
1197 /* The hash function for variable_htab, computes the hash value
1198 from the declaration of variable X. */
1201 variable_htab_hash (const void *x
)
1203 const_variable
const v
= (const_variable
) x
;
1205 return dv_htab_hash (v
->dv
);
1208 /* Compare the declaration of variable X with declaration Y. */
1211 variable_htab_eq (const void *x
, const void *y
)
1213 const_variable
const v
= (const_variable
) x
;
1214 decl_or_value dv
= CONST_CAST2 (decl_or_value
, const void *, y
);
1216 return (dv_as_opaque (v
->dv
) == dv_as_opaque (dv
));
1219 /* Free the element of VARIABLE_HTAB (its type is struct variable_def). */
1222 variable_htab_free (void *elem
)
1225 variable var
= (variable
) elem
;
1226 location_chain node
, next
;
1228 gcc_checking_assert (var
->refcount
> 0);
1231 if (var
->refcount
> 0)
1234 for (i
= 0; i
< var
->n_var_parts
; i
++)
1236 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= next
)
1239 pool_free (loc_chain_pool
, node
);
1241 var
->var_part
[i
].loc_chain
= NULL
;
1243 pool_free (dv_pool (var
->dv
), var
);
1246 /* The hash function for value_chains htab, computes the hash value
1250 value_chain_htab_hash (const void *x
)
1252 const_value_chain
const v
= (const_value_chain
) x
;
1254 return dv_htab_hash (v
->dv
);
1257 /* Compare the VALUE X with VALUE Y. */
1260 value_chain_htab_eq (const void *x
, const void *y
)
1262 const_value_chain
const v
= (const_value_chain
) x
;
1263 decl_or_value dv
= CONST_CAST2 (decl_or_value
, const void *, y
);
1265 return dv_as_opaque (v
->dv
) == dv_as_opaque (dv
);
1268 /* Initialize the set (array) SET of attrs to empty lists. */
1271 init_attrs_list_set (attrs
*set
)
1275 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1279 /* Make the list *LISTP empty. */
1282 attrs_list_clear (attrs
*listp
)
1286 for (list
= *listp
; list
; list
= next
)
1289 pool_free (attrs_pool
, list
);
1294 /* Return true if the pair of DECL and OFFSET is the member of the LIST. */
1297 attrs_list_member (attrs list
, decl_or_value dv
, HOST_WIDE_INT offset
)
1299 for (; list
; list
= list
->next
)
1300 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
) && list
->offset
== offset
)
1305 /* Insert the triplet DECL, OFFSET, LOC to the list *LISTP. */
1308 attrs_list_insert (attrs
*listp
, decl_or_value dv
,
1309 HOST_WIDE_INT offset
, rtx loc
)
1313 list
= (attrs
) pool_alloc (attrs_pool
);
1316 list
->offset
= offset
;
1317 list
->next
= *listp
;
1321 /* Copy all nodes from SRC and create a list *DSTP of the copies. */
1324 attrs_list_copy (attrs
*dstp
, attrs src
)
1328 attrs_list_clear (dstp
);
1329 for (; src
; src
= src
->next
)
1331 n
= (attrs
) pool_alloc (attrs_pool
);
1334 n
->offset
= src
->offset
;
1340 /* Add all nodes from SRC which are not in *DSTP to *DSTP. */
1343 attrs_list_union (attrs
*dstp
, attrs src
)
1345 for (; src
; src
= src
->next
)
1347 if (!attrs_list_member (*dstp
, src
->dv
, src
->offset
))
1348 attrs_list_insert (dstp
, src
->dv
, src
->offset
, src
->loc
);
1352 /* Combine nodes that are not onepart nodes from SRC and SRC2 into
1356 attrs_list_mpdv_union (attrs
*dstp
, attrs src
, attrs src2
)
1358 gcc_assert (!*dstp
);
1359 for (; src
; src
= src
->next
)
1361 if (!dv_onepart_p (src
->dv
))
1362 attrs_list_insert (dstp
, src
->dv
, src
->offset
, src
->loc
);
1364 for (src
= src2
; src
; src
= src
->next
)
1366 if (!dv_onepart_p (src
->dv
)
1367 && !attrs_list_member (*dstp
, src
->dv
, src
->offset
))
1368 attrs_list_insert (dstp
, src
->dv
, src
->offset
, src
->loc
);
1372 /* Shared hashtable support. */
1374 /* Return true if VARS is shared. */
1377 shared_hash_shared (shared_hash vars
)
1379 return vars
->refcount
> 1;
1382 /* Return the hash table for VARS. */
1384 static inline htab_t
1385 shared_hash_htab (shared_hash vars
)
1390 /* Return true if VAR is shared, or maybe because VARS is shared. */
1393 shared_var_p (variable var
, shared_hash vars
)
1395 /* Don't count an entry in the changed_variables table as a duplicate. */
1396 return ((var
->refcount
> 1 + (int) var
->in_changed_variables
)
1397 || shared_hash_shared (vars
));
1400 /* Copy variables into a new hash table. */
1403 shared_hash_unshare (shared_hash vars
)
1405 shared_hash new_vars
= (shared_hash
) pool_alloc (shared_hash_pool
);
1406 gcc_assert (vars
->refcount
> 1);
1407 new_vars
->refcount
= 1;
1409 = htab_create (htab_elements (vars
->htab
) + 3, variable_htab_hash
,
1410 variable_htab_eq
, variable_htab_free
);
1411 vars_copy (new_vars
->htab
, vars
->htab
);
1416 /* Increment reference counter on VARS and return it. */
1418 static inline shared_hash
1419 shared_hash_copy (shared_hash vars
)
1425 /* Decrement reference counter and destroy hash table if not shared
1429 shared_hash_destroy (shared_hash vars
)
1431 gcc_checking_assert (vars
->refcount
> 0);
1432 if (--vars
->refcount
== 0)
1434 htab_delete (vars
->htab
);
1435 pool_free (shared_hash_pool
, vars
);
1439 /* Unshare *PVARS if shared and return slot for DV. If INS is
1440 INSERT, insert it if not already present. */
1442 static inline void **
1443 shared_hash_find_slot_unshare_1 (shared_hash
*pvars
, decl_or_value dv
,
1444 hashval_t dvhash
, enum insert_option ins
)
1446 if (shared_hash_shared (*pvars
))
1447 *pvars
= shared_hash_unshare (*pvars
);
1448 return htab_find_slot_with_hash (shared_hash_htab (*pvars
), dv
, dvhash
, ins
);
1451 static inline void **
1452 shared_hash_find_slot_unshare (shared_hash
*pvars
, decl_or_value dv
,
1453 enum insert_option ins
)
1455 return shared_hash_find_slot_unshare_1 (pvars
, dv
, dv_htab_hash (dv
), ins
);
1458 /* Return slot for DV, if it is already present in the hash table.
1459 If it is not present, insert it only VARS is not shared, otherwise
1462 static inline void **
1463 shared_hash_find_slot_1 (shared_hash vars
, decl_or_value dv
, hashval_t dvhash
)
1465 return htab_find_slot_with_hash (shared_hash_htab (vars
), dv
, dvhash
,
1466 shared_hash_shared (vars
)
1467 ? NO_INSERT
: INSERT
);
1470 static inline void **
1471 shared_hash_find_slot (shared_hash vars
, decl_or_value dv
)
1473 return shared_hash_find_slot_1 (vars
, dv
, dv_htab_hash (dv
));
1476 /* Return slot for DV only if it is already present in the hash table. */
1478 static inline void **
1479 shared_hash_find_slot_noinsert_1 (shared_hash vars
, decl_or_value dv
,
1482 return htab_find_slot_with_hash (shared_hash_htab (vars
), dv
, dvhash
,
1486 static inline void **
1487 shared_hash_find_slot_noinsert (shared_hash vars
, decl_or_value dv
)
1489 return shared_hash_find_slot_noinsert_1 (vars
, dv
, dv_htab_hash (dv
));
1492 /* Return variable for DV or NULL if not already present in the hash
1495 static inline variable
1496 shared_hash_find_1 (shared_hash vars
, decl_or_value dv
, hashval_t dvhash
)
1498 return (variable
) htab_find_with_hash (shared_hash_htab (vars
), dv
, dvhash
);
1501 static inline variable
1502 shared_hash_find (shared_hash vars
, decl_or_value dv
)
1504 return shared_hash_find_1 (vars
, dv
, dv_htab_hash (dv
));
1507 /* Return true if TVAL is better than CVAL as a canonival value. We
1508 choose lowest-numbered VALUEs, using the RTX address as a
1509 tie-breaker. The idea is to arrange them into a star topology,
1510 such that all of them are at most one step away from the canonical
1511 value, and the canonical value has backlinks to all of them, in
1512 addition to all the actual locations. We don't enforce this
1513 topology throughout the entire dataflow analysis, though.
1517 canon_value_cmp (rtx tval
, rtx cval
)
1520 || CSELIB_VAL_PTR (tval
)->uid
< CSELIB_VAL_PTR (cval
)->uid
;
1523 static bool dst_can_be_shared
;
1525 /* Return a copy of a variable VAR and insert it to dataflow set SET. */
1528 unshare_variable (dataflow_set
*set
, void **slot
, variable var
,
1529 enum var_init_status initialized
)
1534 new_var
= (variable
) pool_alloc (dv_pool (var
->dv
));
1535 new_var
->dv
= var
->dv
;
1536 new_var
->refcount
= 1;
1538 new_var
->n_var_parts
= var
->n_var_parts
;
1539 new_var
->cur_loc_changed
= var
->cur_loc_changed
;
1540 var
->cur_loc_changed
= false;
1541 new_var
->in_changed_variables
= false;
1543 if (! flag_var_tracking_uninit
)
1544 initialized
= VAR_INIT_STATUS_INITIALIZED
;
1546 for (i
= 0; i
< var
->n_var_parts
; i
++)
1548 location_chain node
;
1549 location_chain
*nextp
;
1551 new_var
->var_part
[i
].offset
= var
->var_part
[i
].offset
;
1552 nextp
= &new_var
->var_part
[i
].loc_chain
;
1553 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
1555 location_chain new_lc
;
1557 new_lc
= (location_chain
) pool_alloc (loc_chain_pool
);
1558 new_lc
->next
= NULL
;
1559 if (node
->init
> initialized
)
1560 new_lc
->init
= node
->init
;
1562 new_lc
->init
= initialized
;
1563 if (node
->set_src
&& !(MEM_P (node
->set_src
)))
1564 new_lc
->set_src
= node
->set_src
;
1566 new_lc
->set_src
= NULL
;
1567 new_lc
->loc
= node
->loc
;
1570 nextp
= &new_lc
->next
;
1573 new_var
->var_part
[i
].cur_loc
= var
->var_part
[i
].cur_loc
;
1576 dst_can_be_shared
= false;
1577 if (shared_hash_shared (set
->vars
))
1578 slot
= shared_hash_find_slot_unshare (&set
->vars
, var
->dv
, NO_INSERT
);
1579 else if (set
->traversed_vars
&& set
->vars
!= set
->traversed_vars
)
1580 slot
= shared_hash_find_slot_noinsert (set
->vars
, var
->dv
);
1582 if (var
->in_changed_variables
)
1585 = htab_find_slot_with_hash (changed_variables
, var
->dv
,
1586 dv_htab_hash (var
->dv
), NO_INSERT
);
1587 gcc_assert (*cslot
== (void *) var
);
1588 var
->in_changed_variables
= false;
1589 variable_htab_free (var
);
1591 new_var
->in_changed_variables
= true;
1596 /* Copy all variables from hash table SRC to hash table DST. */
1599 vars_copy (htab_t dst
, htab_t src
)
1604 FOR_EACH_HTAB_ELEMENT (src
, var
, variable
, hi
)
1608 dstp
= htab_find_slot_with_hash (dst
, var
->dv
,
1609 dv_htab_hash (var
->dv
),
1615 /* Map a decl to its main debug decl. */
1618 var_debug_decl (tree decl
)
1620 if (decl
&& DECL_P (decl
)
1621 && DECL_DEBUG_EXPR_IS_FROM (decl
))
1623 tree debugdecl
= DECL_DEBUG_EXPR (decl
);
1624 if (debugdecl
&& DECL_P (debugdecl
))
1631 /* Set the register LOC to contain DV, OFFSET. */
1634 var_reg_decl_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
1635 decl_or_value dv
, HOST_WIDE_INT offset
, rtx set_src
,
1636 enum insert_option iopt
)
1639 bool decl_p
= dv_is_decl_p (dv
);
1642 dv
= dv_from_decl (var_debug_decl (dv_as_decl (dv
)));
1644 for (node
= set
->regs
[REGNO (loc
)]; node
; node
= node
->next
)
1645 if (dv_as_opaque (node
->dv
) == dv_as_opaque (dv
)
1646 && node
->offset
== offset
)
1649 attrs_list_insert (&set
->regs
[REGNO (loc
)], dv
, offset
, loc
);
1650 set_variable_part (set
, loc
, dv
, offset
, initialized
, set_src
, iopt
);
1653 /* Set the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). */
1656 var_reg_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
1659 tree decl
= REG_EXPR (loc
);
1660 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
1662 var_reg_decl_set (set
, loc
, initialized
,
1663 dv_from_decl (decl
), offset
, set_src
, INSERT
);
1666 static enum var_init_status
1667 get_init_value (dataflow_set
*set
, rtx loc
, decl_or_value dv
)
1671 enum var_init_status ret_val
= VAR_INIT_STATUS_UNKNOWN
;
1673 if (! flag_var_tracking_uninit
)
1674 return VAR_INIT_STATUS_INITIALIZED
;
1676 var
= shared_hash_find (set
->vars
, dv
);
1679 for (i
= 0; i
< var
->n_var_parts
&& ret_val
== VAR_INIT_STATUS_UNKNOWN
; i
++)
1681 location_chain nextp
;
1682 for (nextp
= var
->var_part
[i
].loc_chain
; nextp
; nextp
= nextp
->next
)
1683 if (rtx_equal_p (nextp
->loc
, loc
))
1685 ret_val
= nextp
->init
;
1694 /* Delete current content of register LOC in dataflow set SET and set
1695 the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). If
1696 MODIFY is true, any other live copies of the same variable part are
1697 also deleted from the dataflow set, otherwise the variable part is
1698 assumed to be copied from another location holding the same
1702 var_reg_delete_and_set (dataflow_set
*set
, rtx loc
, bool modify
,
1703 enum var_init_status initialized
, rtx set_src
)
1705 tree decl
= REG_EXPR (loc
);
1706 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
1710 decl
= var_debug_decl (decl
);
1712 if (initialized
== VAR_INIT_STATUS_UNKNOWN
)
1713 initialized
= get_init_value (set
, loc
, dv_from_decl (decl
));
1715 nextp
= &set
->regs
[REGNO (loc
)];
1716 for (node
= *nextp
; node
; node
= next
)
1719 if (dv_as_opaque (node
->dv
) != decl
|| node
->offset
!= offset
)
1721 delete_variable_part (set
, node
->loc
, node
->dv
, node
->offset
);
1722 pool_free (attrs_pool
, node
);
1728 nextp
= &node
->next
;
1732 clobber_variable_part (set
, loc
, dv_from_decl (decl
), offset
, set_src
);
1733 var_reg_set (set
, loc
, initialized
, set_src
);
1736 /* Delete the association of register LOC in dataflow set SET with any
1737 variables that aren't onepart. If CLOBBER is true, also delete any
1738 other live copies of the same variable part, and delete the
1739 association with onepart dvs too. */
1742 var_reg_delete (dataflow_set
*set
, rtx loc
, bool clobber
)
1744 attrs
*nextp
= &set
->regs
[REGNO (loc
)];
1749 tree decl
= REG_EXPR (loc
);
1750 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
1752 decl
= var_debug_decl (decl
);
1754 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, NULL
);
1757 for (node
= *nextp
; node
; node
= next
)
1760 if (clobber
|| !dv_onepart_p (node
->dv
))
1762 delete_variable_part (set
, node
->loc
, node
->dv
, node
->offset
);
1763 pool_free (attrs_pool
, node
);
1767 nextp
= &node
->next
;
1771 /* Delete content of register with number REGNO in dataflow set SET. */
1774 var_regno_delete (dataflow_set
*set
, int regno
)
1776 attrs
*reg
= &set
->regs
[regno
];
1779 for (node
= *reg
; node
; node
= next
)
1782 delete_variable_part (set
, node
->loc
, node
->dv
, node
->offset
);
1783 pool_free (attrs_pool
, node
);
1788 /* Set the location of DV, OFFSET as the MEM LOC. */
1791 var_mem_decl_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
1792 decl_or_value dv
, HOST_WIDE_INT offset
, rtx set_src
,
1793 enum insert_option iopt
)
1795 if (dv_is_decl_p (dv
))
1796 dv
= dv_from_decl (var_debug_decl (dv_as_decl (dv
)));
1798 set_variable_part (set
, loc
, dv
, offset
, initialized
, set_src
, iopt
);
1801 /* Set the location part of variable MEM_EXPR (LOC) in dataflow set
1803 Adjust the address first if it is stack pointer based. */
1806 var_mem_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
1809 tree decl
= MEM_EXPR (loc
);
1810 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
1812 var_mem_decl_set (set
, loc
, initialized
,
1813 dv_from_decl (decl
), offset
, set_src
, INSERT
);
1816 /* Delete and set the location part of variable MEM_EXPR (LOC) in
1817 dataflow set SET to LOC. If MODIFY is true, any other live copies
1818 of the same variable part are also deleted from the dataflow set,
1819 otherwise the variable part is assumed to be copied from another
1820 location holding the same part.
1821 Adjust the address first if it is stack pointer based. */
1824 var_mem_delete_and_set (dataflow_set
*set
, rtx loc
, bool modify
,
1825 enum var_init_status initialized
, rtx set_src
)
1827 tree decl
= MEM_EXPR (loc
);
1828 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
1830 decl
= var_debug_decl (decl
);
1832 if (initialized
== VAR_INIT_STATUS_UNKNOWN
)
1833 initialized
= get_init_value (set
, loc
, dv_from_decl (decl
));
1836 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, set_src
);
1837 var_mem_set (set
, loc
, initialized
, set_src
);
1840 /* Delete the location part LOC from dataflow set SET. If CLOBBER is
1841 true, also delete any other live copies of the same variable part.
1842 Adjust the address first if it is stack pointer based. */
1845 var_mem_delete (dataflow_set
*set
, rtx loc
, bool clobber
)
1847 tree decl
= MEM_EXPR (loc
);
1848 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
1850 decl
= var_debug_decl (decl
);
1852 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, NULL
);
1853 delete_variable_part (set
, loc
, dv_from_decl (decl
), offset
);
1856 /* Bind a value to a location it was just stored in. If MODIFIED
1857 holds, assume the location was modified, detaching it from any
1858 values bound to it. */
1861 val_store (dataflow_set
*set
, rtx val
, rtx loc
, rtx insn
, bool modified
)
1863 cselib_val
*v
= CSELIB_VAL_PTR (val
);
1865 gcc_assert (cselib_preserved_value_p (v
));
1869 fprintf (dump_file
, "%i: ", INSN_UID (insn
));
1870 print_inline_rtx (dump_file
, val
, 0);
1871 fprintf (dump_file
, " stored in ");
1872 print_inline_rtx (dump_file
, loc
, 0);
1875 struct elt_loc_list
*l
;
1876 for (l
= v
->locs
; l
; l
= l
->next
)
1878 fprintf (dump_file
, "\n%i: ", INSN_UID (l
->setting_insn
));
1879 print_inline_rtx (dump_file
, l
->loc
, 0);
1882 fprintf (dump_file
, "\n");
1888 var_regno_delete (set
, REGNO (loc
));
1889 var_reg_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
1890 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
1892 else if (MEM_P (loc
))
1893 var_mem_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
1894 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
1896 set_variable_part (set
, loc
, dv_from_value (val
), 0,
1897 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
1900 /* Reset this node, detaching all its equivalences. Return the slot
1901 in the variable hash table that holds dv, if there is one. */
1904 val_reset (dataflow_set
*set
, decl_or_value dv
)
1906 variable var
= shared_hash_find (set
->vars
, dv
) ;
1907 location_chain node
;
1910 if (!var
|| !var
->n_var_parts
)
1913 gcc_assert (var
->n_var_parts
== 1);
1916 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
1917 if (GET_CODE (node
->loc
) == VALUE
1918 && canon_value_cmp (node
->loc
, cval
))
1921 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
1922 if (GET_CODE (node
->loc
) == VALUE
&& cval
!= node
->loc
)
1924 /* Redirect the equivalence link to the new canonical
1925 value, or simply remove it if it would point at
1928 set_variable_part (set
, cval
, dv_from_value (node
->loc
),
1929 0, node
->init
, node
->set_src
, NO_INSERT
);
1930 delete_variable_part (set
, dv_as_value (dv
),
1931 dv_from_value (node
->loc
), 0);
1936 decl_or_value cdv
= dv_from_value (cval
);
1938 /* Keep the remaining values connected, accummulating links
1939 in the canonical value. */
1940 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
1942 if (node
->loc
== cval
)
1944 else if (GET_CODE (node
->loc
) == REG
)
1945 var_reg_decl_set (set
, node
->loc
, node
->init
, cdv
, 0,
1946 node
->set_src
, NO_INSERT
);
1947 else if (GET_CODE (node
->loc
) == MEM
)
1948 var_mem_decl_set (set
, node
->loc
, node
->init
, cdv
, 0,
1949 node
->set_src
, NO_INSERT
);
1951 set_variable_part (set
, node
->loc
, cdv
, 0,
1952 node
->init
, node
->set_src
, NO_INSERT
);
1956 /* We remove this last, to make sure that the canonical value is not
1957 removed to the point of requiring reinsertion. */
1959 delete_variable_part (set
, dv_as_value (dv
), dv_from_value (cval
), 0);
1961 clobber_variable_part (set
, NULL
, dv
, 0, NULL
);
1963 /* ??? Should we make sure there aren't other available values or
1964 variables whose values involve this one other than by
1965 equivalence? E.g., at the very least we should reset MEMs, those
1966 shouldn't be too hard to find cselib-looking up the value as an
1967 address, then locating the resulting value in our own hash
1971 /* Find the values in a given location and map the val to another
1972 value, if it is unique, or add the location as one holding the
1976 val_resolve (dataflow_set
*set
, rtx val
, rtx loc
, rtx insn
)
1978 decl_or_value dv
= dv_from_value (val
);
1980 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1983 fprintf (dump_file
, "%i: ", INSN_UID (insn
));
1985 fprintf (dump_file
, "head: ");
1986 print_inline_rtx (dump_file
, val
, 0);
1987 fputs (" is at ", dump_file
);
1988 print_inline_rtx (dump_file
, loc
, 0);
1989 fputc ('\n', dump_file
);
1992 val_reset (set
, dv
);
1996 attrs node
, found
= NULL
;
1998 for (node
= set
->regs
[REGNO (loc
)]; node
; node
= node
->next
)
1999 if (dv_is_value_p (node
->dv
)
2000 && GET_MODE (dv_as_value (node
->dv
)) == GET_MODE (loc
))
2004 /* Map incoming equivalences. ??? Wouldn't it be nice if
2005 we just started sharing the location lists? Maybe a
2006 circular list ending at the value itself or some
2008 set_variable_part (set
, dv_as_value (node
->dv
),
2009 dv_from_value (val
), node
->offset
,
2010 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2011 set_variable_part (set
, val
, node
->dv
, node
->offset
,
2012 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2015 /* If we didn't find any equivalence, we need to remember that
2016 this value is held in the named register. */
2018 var_reg_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
2019 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
2021 else if (MEM_P (loc
))
2022 /* ??? Merge equivalent MEMs. */
2023 var_mem_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
2024 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
2026 /* ??? Merge equivalent expressions. */
2027 set_variable_part (set
, loc
, dv_from_value (val
), 0,
2028 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2031 /* Initialize dataflow set SET to be empty.
2032 VARS_SIZE is the initial size of hash table VARS. */
2035 dataflow_set_init (dataflow_set
*set
)
2037 init_attrs_list_set (set
->regs
);
2038 set
->vars
= shared_hash_copy (empty_shared_hash
);
2039 set
->stack_adjust
= 0;
2040 set
->traversed_vars
= NULL
;
2043 /* Delete the contents of dataflow set SET. */
2046 dataflow_set_clear (dataflow_set
*set
)
2050 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2051 attrs_list_clear (&set
->regs
[i
]);
2053 shared_hash_destroy (set
->vars
);
2054 set
->vars
= shared_hash_copy (empty_shared_hash
);
2057 /* Copy the contents of dataflow set SRC to DST. */
2060 dataflow_set_copy (dataflow_set
*dst
, dataflow_set
*src
)
2064 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2065 attrs_list_copy (&dst
->regs
[i
], src
->regs
[i
]);
2067 shared_hash_destroy (dst
->vars
);
2068 dst
->vars
= shared_hash_copy (src
->vars
);
2069 dst
->stack_adjust
= src
->stack_adjust
;
2072 /* Information for merging lists of locations for a given offset of variable.
2074 struct variable_union_info
2076 /* Node of the location chain. */
2079 /* The sum of positions in the input chains. */
2082 /* The position in the chain of DST dataflow set. */
2086 /* Buffer for location list sorting and its allocated size. */
2087 static struct variable_union_info
*vui_vec
;
2088 static int vui_allocated
;
2090 /* Compare function for qsort, order the structures by POS element. */
2093 variable_union_info_cmp_pos (const void *n1
, const void *n2
)
2095 const struct variable_union_info
*const i1
=
2096 (const struct variable_union_info
*) n1
;
2097 const struct variable_union_info
*const i2
=
2098 ( const struct variable_union_info
*) n2
;
2100 if (i1
->pos
!= i2
->pos
)
2101 return i1
->pos
- i2
->pos
;
2103 return (i1
->pos_dst
- i2
->pos_dst
);
2106 /* Compute union of location parts of variable *SLOT and the same variable
2107 from hash table DATA. Compute "sorted" union of the location chains
2108 for common offsets, i.e. the locations of a variable part are sorted by
2109 a priority where the priority is the sum of the positions in the 2 chains
2110 (if a location is only in one list the position in the second list is
2111 defined to be larger than the length of the chains).
2112 When we are updating the location parts the newest location is in the
2113 beginning of the chain, so when we do the described "sorted" union
2114 we keep the newest locations in the beginning. */
2117 variable_union (variable src
, dataflow_set
*set
)
2123 dstp
= shared_hash_find_slot (set
->vars
, src
->dv
);
2124 if (!dstp
|| !*dstp
)
2128 dst_can_be_shared
= false;
2130 dstp
= shared_hash_find_slot_unshare (&set
->vars
, src
->dv
, INSERT
);
2134 /* Continue traversing the hash table. */
2138 dst
= (variable
) *dstp
;
2140 gcc_assert (src
->n_var_parts
);
2142 /* We can combine one-part variables very efficiently, because their
2143 entries are in canonical order. */
2144 if (dv_onepart_p (src
->dv
))
2146 location_chain
*nodep
, dnode
, snode
;
2148 gcc_assert (src
->n_var_parts
== 1
2149 && dst
->n_var_parts
== 1);
2151 snode
= src
->var_part
[0].loc_chain
;
2154 restart_onepart_unshared
:
2155 nodep
= &dst
->var_part
[0].loc_chain
;
2161 int r
= dnode
? loc_cmp (dnode
->loc
, snode
->loc
) : 1;
2165 location_chain nnode
;
2167 if (shared_var_p (dst
, set
->vars
))
2169 dstp
= unshare_variable (set
, dstp
, dst
,
2170 VAR_INIT_STATUS_INITIALIZED
);
2171 dst
= (variable
)*dstp
;
2172 goto restart_onepart_unshared
;
2175 *nodep
= nnode
= (location_chain
) pool_alloc (loc_chain_pool
);
2176 nnode
->loc
= snode
->loc
;
2177 nnode
->init
= snode
->init
;
2178 if (!snode
->set_src
|| MEM_P (snode
->set_src
))
2179 nnode
->set_src
= NULL
;
2181 nnode
->set_src
= snode
->set_src
;
2182 nnode
->next
= dnode
;
2185 #ifdef ENABLE_CHECKING
2187 gcc_assert (rtx_equal_p (dnode
->loc
, snode
->loc
));
2191 snode
= snode
->next
;
2193 nodep
= &dnode
->next
;
2200 /* Count the number of location parts, result is K. */
2201 for (i
= 0, j
= 0, k
= 0;
2202 i
< src
->n_var_parts
&& j
< dst
->n_var_parts
; k
++)
2204 if (src
->var_part
[i
].offset
== dst
->var_part
[j
].offset
)
2209 else if (src
->var_part
[i
].offset
< dst
->var_part
[j
].offset
)
2214 k
+= src
->n_var_parts
- i
;
2215 k
+= dst
->n_var_parts
- j
;
2217 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
2218 thus there are at most MAX_VAR_PARTS different offsets. */
2219 gcc_assert (dv_onepart_p (dst
->dv
) ? k
== 1 : k
<= MAX_VAR_PARTS
);
2221 if (dst
->n_var_parts
!= k
&& shared_var_p (dst
, set
->vars
))
2223 dstp
= unshare_variable (set
, dstp
, dst
, VAR_INIT_STATUS_UNKNOWN
);
2224 dst
= (variable
)*dstp
;
2227 i
= src
->n_var_parts
- 1;
2228 j
= dst
->n_var_parts
- 1;
2229 dst
->n_var_parts
= k
;
2231 for (k
--; k
>= 0; k
--)
2233 location_chain node
, node2
;
2235 if (i
>= 0 && j
>= 0
2236 && src
->var_part
[i
].offset
== dst
->var_part
[j
].offset
)
2238 /* Compute the "sorted" union of the chains, i.e. the locations which
2239 are in both chains go first, they are sorted by the sum of
2240 positions in the chains. */
2243 struct variable_union_info
*vui
;
2245 /* If DST is shared compare the location chains.
2246 If they are different we will modify the chain in DST with
2247 high probability so make a copy of DST. */
2248 if (shared_var_p (dst
, set
->vars
))
2250 for (node
= src
->var_part
[i
].loc_chain
,
2251 node2
= dst
->var_part
[j
].loc_chain
; node
&& node2
;
2252 node
= node
->next
, node2
= node2
->next
)
2254 if (!((REG_P (node2
->loc
)
2255 && REG_P (node
->loc
)
2256 && REGNO (node2
->loc
) == REGNO (node
->loc
))
2257 || rtx_equal_p (node2
->loc
, node
->loc
)))
2259 if (node2
->init
< node
->init
)
2260 node2
->init
= node
->init
;
2266 dstp
= unshare_variable (set
, dstp
, dst
,
2267 VAR_INIT_STATUS_UNKNOWN
);
2268 dst
= (variable
)*dstp
;
2273 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2276 for (node
= dst
->var_part
[j
].loc_chain
; node
; node
= node
->next
)
2281 /* The most common case, much simpler, no qsort is needed. */
2282 location_chain dstnode
= dst
->var_part
[j
].loc_chain
;
2283 dst
->var_part
[k
].loc_chain
= dstnode
;
2284 dst
->var_part
[k
].offset
= dst
->var_part
[j
].offset
;
2286 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2287 if (!((REG_P (dstnode
->loc
)
2288 && REG_P (node
->loc
)
2289 && REGNO (dstnode
->loc
) == REGNO (node
->loc
))
2290 || rtx_equal_p (dstnode
->loc
, node
->loc
)))
2292 location_chain new_node
;
2294 /* Copy the location from SRC. */
2295 new_node
= (location_chain
) pool_alloc (loc_chain_pool
);
2296 new_node
->loc
= node
->loc
;
2297 new_node
->init
= node
->init
;
2298 if (!node
->set_src
|| MEM_P (node
->set_src
))
2299 new_node
->set_src
= NULL
;
2301 new_node
->set_src
= node
->set_src
;
2302 node2
->next
= new_node
;
2309 if (src_l
+ dst_l
> vui_allocated
)
2311 vui_allocated
= MAX (vui_allocated
* 2, src_l
+ dst_l
);
2312 vui_vec
= XRESIZEVEC (struct variable_union_info
, vui_vec
,
2317 /* Fill in the locations from DST. */
2318 for (node
= dst
->var_part
[j
].loc_chain
, jj
= 0; node
;
2319 node
= node
->next
, jj
++)
2322 vui
[jj
].pos_dst
= jj
;
2324 /* Pos plus value larger than a sum of 2 valid positions. */
2325 vui
[jj
].pos
= jj
+ src_l
+ dst_l
;
2328 /* Fill in the locations from SRC. */
2330 for (node
= src
->var_part
[i
].loc_chain
, ii
= 0; node
;
2331 node
= node
->next
, ii
++)
2333 /* Find location from NODE. */
2334 for (jj
= 0; jj
< dst_l
; jj
++)
2336 if ((REG_P (vui
[jj
].lc
->loc
)
2337 && REG_P (node
->loc
)
2338 && REGNO (vui
[jj
].lc
->loc
) == REGNO (node
->loc
))
2339 || rtx_equal_p (vui
[jj
].lc
->loc
, node
->loc
))
2341 vui
[jj
].pos
= jj
+ ii
;
2345 if (jj
>= dst_l
) /* The location has not been found. */
2347 location_chain new_node
;
2349 /* Copy the location from SRC. */
2350 new_node
= (location_chain
) pool_alloc (loc_chain_pool
);
2351 new_node
->loc
= node
->loc
;
2352 new_node
->init
= node
->init
;
2353 if (!node
->set_src
|| MEM_P (node
->set_src
))
2354 new_node
->set_src
= NULL
;
2356 new_node
->set_src
= node
->set_src
;
2357 vui
[n
].lc
= new_node
;
2358 vui
[n
].pos_dst
= src_l
+ dst_l
;
2359 vui
[n
].pos
= ii
+ src_l
+ dst_l
;
2366 /* Special case still very common case. For dst_l == 2
2367 all entries dst_l ... n-1 are sorted, with for i >= dst_l
2368 vui[i].pos == i + src_l + dst_l. */
2369 if (vui
[0].pos
> vui
[1].pos
)
2371 /* Order should be 1, 0, 2... */
2372 dst
->var_part
[k
].loc_chain
= vui
[1].lc
;
2373 vui
[1].lc
->next
= vui
[0].lc
;
2376 vui
[0].lc
->next
= vui
[2].lc
;
2377 vui
[n
- 1].lc
->next
= NULL
;
2380 vui
[0].lc
->next
= NULL
;
2385 dst
->var_part
[k
].loc_chain
= vui
[0].lc
;
2386 if (n
>= 3 && vui
[2].pos
< vui
[1].pos
)
2388 /* Order should be 0, 2, 1, 3... */
2389 vui
[0].lc
->next
= vui
[2].lc
;
2390 vui
[2].lc
->next
= vui
[1].lc
;
2393 vui
[1].lc
->next
= vui
[3].lc
;
2394 vui
[n
- 1].lc
->next
= NULL
;
2397 vui
[1].lc
->next
= NULL
;
2402 /* Order should be 0, 1, 2... */
2404 vui
[n
- 1].lc
->next
= NULL
;
2407 for (; ii
< n
; ii
++)
2408 vui
[ii
- 1].lc
->next
= vui
[ii
].lc
;
2412 qsort (vui
, n
, sizeof (struct variable_union_info
),
2413 variable_union_info_cmp_pos
);
2415 /* Reconnect the nodes in sorted order. */
2416 for (ii
= 1; ii
< n
; ii
++)
2417 vui
[ii
- 1].lc
->next
= vui
[ii
].lc
;
2418 vui
[n
- 1].lc
->next
= NULL
;
2419 dst
->var_part
[k
].loc_chain
= vui
[0].lc
;
2422 dst
->var_part
[k
].offset
= dst
->var_part
[j
].offset
;
2427 else if ((i
>= 0 && j
>= 0
2428 && src
->var_part
[i
].offset
< dst
->var_part
[j
].offset
)
2431 dst
->var_part
[k
] = dst
->var_part
[j
];
2434 else if ((i
>= 0 && j
>= 0
2435 && src
->var_part
[i
].offset
> dst
->var_part
[j
].offset
)
2438 location_chain
*nextp
;
2440 /* Copy the chain from SRC. */
2441 nextp
= &dst
->var_part
[k
].loc_chain
;
2442 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2444 location_chain new_lc
;
2446 new_lc
= (location_chain
) pool_alloc (loc_chain_pool
);
2447 new_lc
->next
= NULL
;
2448 new_lc
->init
= node
->init
;
2449 if (!node
->set_src
|| MEM_P (node
->set_src
))
2450 new_lc
->set_src
= NULL
;
2452 new_lc
->set_src
= node
->set_src
;
2453 new_lc
->loc
= node
->loc
;
2456 nextp
= &new_lc
->next
;
2459 dst
->var_part
[k
].offset
= src
->var_part
[i
].offset
;
2462 dst
->var_part
[k
].cur_loc
= NULL
;
2465 if (flag_var_tracking_uninit
)
2466 for (i
= 0; i
< src
->n_var_parts
&& i
< dst
->n_var_parts
; i
++)
2468 location_chain node
, node2
;
2469 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2470 for (node2
= dst
->var_part
[i
].loc_chain
; node2
; node2
= node2
->next
)
2471 if (rtx_equal_p (node
->loc
, node2
->loc
))
2473 if (node
->init
> node2
->init
)
2474 node2
->init
= node
->init
;
2478 /* Continue traversing the hash table. */
2482 /* Compute union of dataflow sets SRC and DST and store it to DST. */
2485 dataflow_set_union (dataflow_set
*dst
, dataflow_set
*src
)
2489 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2490 attrs_list_union (&dst
->regs
[i
], src
->regs
[i
]);
2492 if (dst
->vars
== empty_shared_hash
)
2494 shared_hash_destroy (dst
->vars
);
2495 dst
->vars
= shared_hash_copy (src
->vars
);
2502 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (src
->vars
), var
, variable
, hi
)
2503 variable_union (var
, dst
);
2507 /* Whether the value is currently being expanded. */
2508 #define VALUE_RECURSED_INTO(x) \
2509 (RTL_FLAG_CHECK2 ("VALUE_RECURSED_INTO", (x), VALUE, DEBUG_EXPR)->used)
2510 /* Whether the value is in changed_variables hash table. */
2511 #define VALUE_CHANGED(x) \
2512 (RTL_FLAG_CHECK1 ("VALUE_CHANGED", (x), VALUE)->frame_related)
2513 /* Whether the decl is in changed_variables hash table. */
2514 #define DECL_CHANGED(x) TREE_VISITED (x)
2516 /* Record that DV has been added into resp. removed from changed_variables
2520 set_dv_changed (decl_or_value dv
, bool newv
)
2522 if (dv_is_value_p (dv
))
2523 VALUE_CHANGED (dv_as_value (dv
)) = newv
;
2525 DECL_CHANGED (dv_as_decl (dv
)) = newv
;
2528 /* Return true if DV is present in changed_variables hash table. */
2531 dv_changed_p (decl_or_value dv
)
2533 return (dv_is_value_p (dv
)
2534 ? VALUE_CHANGED (dv_as_value (dv
))
2535 : DECL_CHANGED (dv_as_decl (dv
)));
2538 /* Return a location list node whose loc is rtx_equal to LOC, in the
2539 location list of a one-part variable or value VAR, or in that of
2540 any values recursively mentioned in the location lists. VARS must
2541 be in star-canonical form. */
2543 static location_chain
2544 find_loc_in_1pdv (rtx loc
, variable var
, htab_t vars
)
2546 location_chain node
;
2547 enum rtx_code loc_code
;
2552 #ifdef ENABLE_CHECKING
2553 gcc_assert (dv_onepart_p (var
->dv
));
2556 if (!var
->n_var_parts
)
2559 #ifdef ENABLE_CHECKING
2560 gcc_assert (var
->var_part
[0].offset
== 0);
2561 gcc_assert (loc
!= dv_as_opaque (var
->dv
));
2564 loc_code
= GET_CODE (loc
);
2565 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
2570 if (GET_CODE (node
->loc
) != loc_code
)
2572 if (GET_CODE (node
->loc
) != VALUE
)
2575 else if (loc
== node
->loc
)
2577 else if (loc_code
!= VALUE
)
2579 if (rtx_equal_p (loc
, node
->loc
))
2584 /* Since we're in star-canonical form, we don't need to visit
2585 non-canonical nodes: one-part variables and non-canonical
2586 values would only point back to the canonical node. */
2587 if (dv_is_value_p (var
->dv
)
2588 && !canon_value_cmp (node
->loc
, dv_as_value (var
->dv
)))
2590 /* Skip all subsequent VALUEs. */
2591 while (node
->next
&& GET_CODE (node
->next
->loc
) == VALUE
)
2594 #ifdef ENABLE_CHECKING
2595 gcc_assert (!canon_value_cmp (node
->loc
,
2596 dv_as_value (var
->dv
)));
2598 if (loc
== node
->loc
)
2604 #ifdef ENABLE_CHECKING
2605 gcc_assert (node
== var
->var_part
[0].loc_chain
);
2606 gcc_assert (!node
->next
);
2609 dv
= dv_from_value (node
->loc
);
2610 rvar
= (variable
) htab_find_with_hash (vars
, dv
, dv_htab_hash (dv
));
2611 return find_loc_in_1pdv (loc
, rvar
, vars
);
2617 /* Hash table iteration argument passed to variable_merge. */
2620 /* The set in which the merge is to be inserted. */
2622 /* The set that we're iterating in. */
2624 /* The set that may contain the other dv we are to merge with. */
2626 /* Number of onepart dvs in src. */
2627 int src_onepart_cnt
;
2630 /* Insert LOC in *DNODE, if it's not there yet. The list must be in
2631 loc_cmp order, and it is maintained as such. */
2634 insert_into_intersection (location_chain
*nodep
, rtx loc
,
2635 enum var_init_status status
)
2637 location_chain node
;
2640 for (node
= *nodep
; node
; nodep
= &node
->next
, node
= *nodep
)
2641 if ((r
= loc_cmp (node
->loc
, loc
)) == 0)
2643 node
->init
= MIN (node
->init
, status
);
2649 node
= (location_chain
) pool_alloc (loc_chain_pool
);
2652 node
->set_src
= NULL
;
2653 node
->init
= status
;
2654 node
->next
= *nodep
;
2658 /* Insert in DEST the intersection the locations present in both
2659 S1NODE and S2VAR, directly or indirectly. S1NODE is from a
2660 variable in DSM->cur, whereas S2VAR is from DSM->src. dvar is in
2664 intersect_loc_chains (rtx val
, location_chain
*dest
, struct dfset_merge
*dsm
,
2665 location_chain s1node
, variable s2var
)
2667 dataflow_set
*s1set
= dsm
->cur
;
2668 dataflow_set
*s2set
= dsm
->src
;
2669 location_chain found
;
2673 location_chain s2node
;
2675 #ifdef ENABLE_CHECKING
2676 gcc_assert (dv_onepart_p (s2var
->dv
));
2679 if (s2var
->n_var_parts
)
2681 #ifdef ENABLE_CHECKING
2682 gcc_assert (s2var
->var_part
[0].offset
== 0);
2684 s2node
= s2var
->var_part
[0].loc_chain
;
2686 for (; s1node
&& s2node
;
2687 s1node
= s1node
->next
, s2node
= s2node
->next
)
2688 if (s1node
->loc
!= s2node
->loc
)
2690 else if (s1node
->loc
== val
)
2693 insert_into_intersection (dest
, s1node
->loc
,
2694 MIN (s1node
->init
, s2node
->init
));
2698 for (; s1node
; s1node
= s1node
->next
)
2700 if (s1node
->loc
== val
)
2703 if ((found
= find_loc_in_1pdv (s1node
->loc
, s2var
,
2704 shared_hash_htab (s2set
->vars
))))
2706 insert_into_intersection (dest
, s1node
->loc
,
2707 MIN (s1node
->init
, found
->init
));
2711 if (GET_CODE (s1node
->loc
) == VALUE
2712 && !VALUE_RECURSED_INTO (s1node
->loc
))
2714 decl_or_value dv
= dv_from_value (s1node
->loc
);
2715 variable svar
= shared_hash_find (s1set
->vars
, dv
);
2718 if (svar
->n_var_parts
== 1)
2720 VALUE_RECURSED_INTO (s1node
->loc
) = true;
2721 intersect_loc_chains (val
, dest
, dsm
,
2722 svar
->var_part
[0].loc_chain
,
2724 VALUE_RECURSED_INTO (s1node
->loc
) = false;
2729 /* ??? if the location is equivalent to any location in src,
2730 searched recursively
2732 add to dst the values needed to represent the equivalence
2734 telling whether locations S is equivalent to another dv's
2737 for each location D in the list
2739 if S and D satisfy rtx_equal_p, then it is present
2741 else if D is a value, recurse without cycles
2743 else if S and D have the same CODE and MODE
2745 for each operand oS and the corresponding oD
2747 if oS and oD are not equivalent, then S an D are not equivalent
2749 else if they are RTX vectors
2751 if any vector oS element is not equivalent to its respective oD,
2752 then S and D are not equivalent
2760 /* Return -1 if X should be before Y in a location list for a 1-part
2761 variable, 1 if Y should be before X, and 0 if they're equivalent
2762 and should not appear in the list. */
2765 loc_cmp (rtx x
, rtx y
)
2768 RTX_CODE code
= GET_CODE (x
);
2778 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
2779 if (REGNO (x
) == REGNO (y
))
2781 else if (REGNO (x
) < REGNO (y
))
2794 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
2795 return loc_cmp (XEXP (x
, 0), XEXP (y
, 0));
2801 if (GET_CODE (x
) == VALUE
)
2803 if (GET_CODE (y
) != VALUE
)
2805 /* Don't assert the modes are the same, that is true only
2806 when not recursing. (subreg:QI (value:SI 1:1) 0)
2807 and (subreg:QI (value:DI 2:2) 0) can be compared,
2808 even when the modes are different. */
2809 if (canon_value_cmp (x
, y
))
2815 if (GET_CODE (y
) == VALUE
)
2818 if (GET_CODE (x
) == GET_CODE (y
))
2819 /* Compare operands below. */;
2820 else if (GET_CODE (x
) < GET_CODE (y
))
2825 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
2827 if (GET_CODE (x
) == DEBUG_EXPR
)
2829 if (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x
))
2830 < DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y
)))
2832 #ifdef ENABLE_CHECKING
2833 gcc_assert (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x
))
2834 > DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y
)));
2839 fmt
= GET_RTX_FORMAT (code
);
2840 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
2844 if (XWINT (x
, i
) == XWINT (y
, i
))
2846 else if (XWINT (x
, i
) < XWINT (y
, i
))
2853 if (XINT (x
, i
) == XINT (y
, i
))
2855 else if (XINT (x
, i
) < XINT (y
, i
))
2862 /* Compare the vector length first. */
2863 if (XVECLEN (x
, i
) == XVECLEN (y
, i
))
2864 /* Compare the vectors elements. */;
2865 else if (XVECLEN (x
, i
) < XVECLEN (y
, i
))
2870 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2871 if ((r
= loc_cmp (XVECEXP (x
, i
, j
),
2872 XVECEXP (y
, i
, j
))))
2877 if ((r
= loc_cmp (XEXP (x
, i
), XEXP (y
, i
))))
2883 if (XSTR (x
, i
) == XSTR (y
, i
))
2889 if ((r
= strcmp (XSTR (x
, i
), XSTR (y
, i
))) == 0)
2897 /* These are just backpointers, so they don't matter. */
2904 /* It is believed that rtx's at this level will never
2905 contain anything but integers and other rtx's,
2906 except for within LABEL_REFs and SYMBOL_REFs. */
2914 /* If decl or value DVP refers to VALUE from *LOC, add backlinks
2915 from VALUE to DVP. */
2918 add_value_chain (rtx
*loc
, void *dvp
)
2920 decl_or_value dv
, ldv
;
2921 value_chain vc
, nvc
;
2924 if (GET_CODE (*loc
) == VALUE
)
2925 ldv
= dv_from_value (*loc
);
2926 else if (GET_CODE (*loc
) == DEBUG_EXPR
)
2927 ldv
= dv_from_decl (DEBUG_EXPR_TREE_DECL (*loc
));
2931 if (dv_as_opaque (ldv
) == dvp
)
2934 dv
= (decl_or_value
) dvp
;
2935 slot
= htab_find_slot_with_hash (value_chains
, ldv
, dv_htab_hash (ldv
),
2939 vc
= (value_chain
) pool_alloc (value_chain_pool
);
2943 *slot
= (void *) vc
;
2947 for (vc
= ((value_chain
) *slot
)->next
; vc
; vc
= vc
->next
)
2948 if (dv_as_opaque (vc
->dv
) == dv_as_opaque (dv
))
2956 vc
= (value_chain
) *slot
;
2957 nvc
= (value_chain
) pool_alloc (value_chain_pool
);
2959 nvc
->next
= vc
->next
;
2965 /* If decl or value DVP refers to VALUEs from within LOC, add backlinks
2966 from those VALUEs to DVP. */
2969 add_value_chains (decl_or_value dv
, rtx loc
)
2971 if (GET_CODE (loc
) == VALUE
|| GET_CODE (loc
) == DEBUG_EXPR
)
2973 add_value_chain (&loc
, dv_as_opaque (dv
));
2979 loc
= XEXP (loc
, 0);
2980 for_each_rtx (&loc
, add_value_chain
, dv_as_opaque (dv
));
2983 /* If CSELIB_VAL_PTR of value DV refer to VALUEs, add backlinks from those
2984 VALUEs to DV. Add the same time get rid of ASM_OPERANDS from locs list,
2985 that is something we never can express in .debug_info and can prevent
2986 reverse ops from being used. */
2989 add_cselib_value_chains (decl_or_value dv
)
2991 struct elt_loc_list
**l
;
2993 for (l
= &CSELIB_VAL_PTR (dv_as_value (dv
))->locs
; *l
;)
2994 if (GET_CODE ((*l
)->loc
) == ASM_OPERANDS
)
2998 for_each_rtx (&(*l
)->loc
, add_value_chain
, dv_as_opaque (dv
));
3003 /* If decl or value DVP refers to VALUE from *LOC, remove backlinks
3004 from VALUE to DVP. */
3007 remove_value_chain (rtx
*loc
, void *dvp
)
3009 decl_or_value dv
, ldv
;
3013 if (GET_CODE (*loc
) == VALUE
)
3014 ldv
= dv_from_value (*loc
);
3015 else if (GET_CODE (*loc
) == DEBUG_EXPR
)
3016 ldv
= dv_from_decl (DEBUG_EXPR_TREE_DECL (*loc
));
3020 if (dv_as_opaque (ldv
) == dvp
)
3023 dv
= (decl_or_value
) dvp
;
3024 slot
= htab_find_slot_with_hash (value_chains
, ldv
, dv_htab_hash (ldv
),
3026 for (vc
= (value_chain
) *slot
; vc
->next
; vc
= vc
->next
)
3027 if (dv_as_opaque (vc
->next
->dv
) == dv_as_opaque (dv
))
3029 value_chain dvc
= vc
->next
;
3030 gcc_assert (dvc
->refcount
> 0);
3031 if (--dvc
->refcount
== 0)
3033 vc
->next
= dvc
->next
;
3034 pool_free (value_chain_pool
, dvc
);
3035 if (vc
->next
== NULL
&& vc
== (value_chain
) *slot
)
3037 pool_free (value_chain_pool
, vc
);
3038 htab_clear_slot (value_chains
, slot
);
3046 /* If decl or value DVP refers to VALUEs from within LOC, remove backlinks
3047 from those VALUEs to DVP. */
3050 remove_value_chains (decl_or_value dv
, rtx loc
)
3052 if (GET_CODE (loc
) == VALUE
|| GET_CODE (loc
) == DEBUG_EXPR
)
3054 remove_value_chain (&loc
, dv_as_opaque (dv
));
3060 loc
= XEXP (loc
, 0);
3061 for_each_rtx (&loc
, remove_value_chain
, dv_as_opaque (dv
));
3065 /* If CSELIB_VAL_PTR of value DV refer to VALUEs, remove backlinks from those
3069 remove_cselib_value_chains (decl_or_value dv
)
3071 struct elt_loc_list
*l
;
3073 for (l
= CSELIB_VAL_PTR (dv_as_value (dv
))->locs
; l
; l
= l
->next
)
3074 for_each_rtx (&l
->loc
, remove_value_chain
, dv_as_opaque (dv
));
3077 /* Check the order of entries in one-part variables. */
3080 canonicalize_loc_order_check (void **slot
, void *data ATTRIBUTE_UNUSED
)
3082 variable var
= (variable
) *slot
;
3083 decl_or_value dv
= var
->dv
;
3084 location_chain node
, next
;
3086 #ifdef ENABLE_RTL_CHECKING
3088 for (i
= 0; i
< var
->n_var_parts
; i
++)
3089 gcc_assert (var
->var_part
[0].cur_loc
== NULL
);
3090 gcc_assert (!var
->cur_loc_changed
&& !var
->in_changed_variables
);
3093 if (!dv_onepart_p (dv
))
3096 gcc_assert (var
->n_var_parts
== 1);
3097 node
= var
->var_part
[0].loc_chain
;
3100 while ((next
= node
->next
))
3102 gcc_assert (loc_cmp (node
->loc
, next
->loc
) < 0);
3110 /* Mark with VALUE_RECURSED_INTO values that have neighbors that are
3111 more likely to be chosen as canonical for an equivalence set.
3112 Ensure less likely values can reach more likely neighbors, making
3113 the connections bidirectional. */
3116 canonicalize_values_mark (void **slot
, void *data
)
3118 dataflow_set
*set
= (dataflow_set
*)data
;
3119 variable var
= (variable
) *slot
;
3120 decl_or_value dv
= var
->dv
;
3122 location_chain node
;
3124 if (!dv_is_value_p (dv
))
3127 gcc_checking_assert (var
->n_var_parts
== 1);
3129 val
= dv_as_value (dv
);
3131 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3132 if (GET_CODE (node
->loc
) == VALUE
)
3134 if (canon_value_cmp (node
->loc
, val
))
3135 VALUE_RECURSED_INTO (val
) = true;
3138 decl_or_value odv
= dv_from_value (node
->loc
);
3139 void **oslot
= shared_hash_find_slot_noinsert (set
->vars
, odv
);
3141 oslot
= set_slot_part (set
, val
, oslot
, odv
, 0,
3142 node
->init
, NULL_RTX
);
3144 VALUE_RECURSED_INTO (node
->loc
) = true;
3151 /* Remove redundant entries from equivalence lists in onepart
3152 variables, canonicalizing equivalence sets into star shapes. */
3155 canonicalize_values_star (void **slot
, void *data
)
3157 dataflow_set
*set
= (dataflow_set
*)data
;
3158 variable var
= (variable
) *slot
;
3159 decl_or_value dv
= var
->dv
;
3160 location_chain node
;
3167 if (!dv_onepart_p (dv
))
3170 gcc_checking_assert (var
->n_var_parts
== 1);
3172 if (dv_is_value_p (dv
))
3174 cval
= dv_as_value (dv
);
3175 if (!VALUE_RECURSED_INTO (cval
))
3177 VALUE_RECURSED_INTO (cval
) = false;
3187 gcc_assert (var
->n_var_parts
== 1);
3189 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3190 if (GET_CODE (node
->loc
) == VALUE
)
3193 if (VALUE_RECURSED_INTO (node
->loc
))
3195 if (canon_value_cmp (node
->loc
, cval
))
3204 if (!has_marks
|| dv_is_decl_p (dv
))
3207 /* Keep it marked so that we revisit it, either after visiting a
3208 child node, or after visiting a new parent that might be
3210 VALUE_RECURSED_INTO (val
) = true;
3212 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3213 if (GET_CODE (node
->loc
) == VALUE
3214 && VALUE_RECURSED_INTO (node
->loc
))
3218 VALUE_RECURSED_INTO (cval
) = false;
3219 dv
= dv_from_value (cval
);
3220 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
3223 gcc_assert (dv_is_decl_p (var
->dv
));
3224 /* The canonical value was reset and dropped.
3226 clobber_variable_part (set
, NULL
, var
->dv
, 0, NULL
);
3229 var
= (variable
)*slot
;
3230 gcc_assert (dv_is_value_p (var
->dv
));
3231 if (var
->n_var_parts
== 0)
3233 gcc_assert (var
->n_var_parts
== 1);
3237 VALUE_RECURSED_INTO (val
) = false;
3242 /* Push values to the canonical one. */
3243 cdv
= dv_from_value (cval
);
3244 cslot
= shared_hash_find_slot_noinsert (set
->vars
, cdv
);
3246 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3247 if (node
->loc
!= cval
)
3249 cslot
= set_slot_part (set
, node
->loc
, cslot
, cdv
, 0,
3250 node
->init
, NULL_RTX
);
3251 if (GET_CODE (node
->loc
) == VALUE
)
3253 decl_or_value ndv
= dv_from_value (node
->loc
);
3255 set_variable_part (set
, cval
, ndv
, 0, node
->init
, NULL_RTX
,
3258 if (canon_value_cmp (node
->loc
, val
))
3260 /* If it could have been a local minimum, it's not any more,
3261 since it's now neighbor to cval, so it may have to push
3262 to it. Conversely, if it wouldn't have prevailed over
3263 val, then whatever mark it has is fine: if it was to
3264 push, it will now push to a more canonical node, but if
3265 it wasn't, then it has already pushed any values it might
3267 VALUE_RECURSED_INTO (node
->loc
) = true;
3268 /* Make sure we visit node->loc by ensuring we cval is
3270 VALUE_RECURSED_INTO (cval
) = true;
3272 else if (!VALUE_RECURSED_INTO (node
->loc
))
3273 /* If we have no need to "recurse" into this node, it's
3274 already "canonicalized", so drop the link to the old
3276 clobber_variable_part (set
, cval
, ndv
, 0, NULL
);
3278 else if (GET_CODE (node
->loc
) == REG
)
3280 attrs list
= set
->regs
[REGNO (node
->loc
)], *listp
;
3282 /* Change an existing attribute referring to dv so that it
3283 refers to cdv, removing any duplicate this might
3284 introduce, and checking that no previous duplicates
3285 existed, all in a single pass. */
3289 if (list
->offset
== 0
3290 && (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
)
3291 || dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
)))
3298 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
))
3301 for (listp
= &list
->next
; (list
= *listp
); listp
= &list
->next
)
3306 if (dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
))
3308 *listp
= list
->next
;
3309 pool_free (attrs_pool
, list
);
3314 gcc_assert (dv_as_opaque (list
->dv
) != dv_as_opaque (dv
));
3317 else if (dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
))
3319 for (listp
= &list
->next
; (list
= *listp
); listp
= &list
->next
)
3324 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
))
3326 *listp
= list
->next
;
3327 pool_free (attrs_pool
, list
);
3332 gcc_assert (dv_as_opaque (list
->dv
) != dv_as_opaque (cdv
));
3341 if (list
->offset
== 0
3342 && (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
)
3343 || dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
)))
3353 cslot
= set_slot_part (set
, val
, cslot
, cdv
, 0,
3354 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
);
3356 slot
= clobber_slot_part (set
, cval
, slot
, 0, NULL
);
3358 /* Variable may have been unshared. */
3359 var
= (variable
)*slot
;
3360 gcc_checking_assert (var
->n_var_parts
&& var
->var_part
[0].loc_chain
->loc
== cval
3361 && var
->var_part
[0].loc_chain
->next
== NULL
);
3363 if (VALUE_RECURSED_INTO (cval
))
3364 goto restart_with_cval
;
3369 /* Bind one-part variables to the canonical value in an equivalence
3370 set. Not doing this causes dataflow convergence failure in rare
3371 circumstances, see PR42873. Unfortunately we can't do this
3372 efficiently as part of canonicalize_values_star, since we may not
3373 have determined or even seen the canonical value of a set when we
3374 get to a variable that references another member of the set. */
3377 canonicalize_vars_star (void **slot
, void *data
)
3379 dataflow_set
*set
= (dataflow_set
*)data
;
3380 variable var
= (variable
) *slot
;
3381 decl_or_value dv
= var
->dv
;
3382 location_chain node
;
3387 location_chain cnode
;
3389 if (!dv_onepart_p (dv
) || dv_is_value_p (dv
))
3392 gcc_assert (var
->n_var_parts
== 1);
3394 node
= var
->var_part
[0].loc_chain
;
3396 if (GET_CODE (node
->loc
) != VALUE
)
3399 gcc_assert (!node
->next
);
3402 /* Push values to the canonical one. */
3403 cdv
= dv_from_value (cval
);
3404 cslot
= shared_hash_find_slot_noinsert (set
->vars
, cdv
);
3407 cvar
= (variable
)*cslot
;
3408 gcc_assert (cvar
->n_var_parts
== 1);
3410 cnode
= cvar
->var_part
[0].loc_chain
;
3412 /* CVAL is canonical if its value list contains non-VALUEs or VALUEs
3413 that are not “more canonical” than it. */
3414 if (GET_CODE (cnode
->loc
) != VALUE
3415 || !canon_value_cmp (cnode
->loc
, cval
))
3418 /* CVAL was found to be non-canonical. Change the variable to point
3419 to the canonical VALUE. */
3420 gcc_assert (!cnode
->next
);
3423 slot
= set_slot_part (set
, cval
, slot
, dv
, 0,
3424 node
->init
, node
->set_src
);
3425 slot
= clobber_slot_part (set
, cval
, slot
, 0, node
->set_src
);
3430 /* Combine variable or value in *S1SLOT (in DSM->cur) with the
3431 corresponding entry in DSM->src. Multi-part variables are combined
3432 with variable_union, whereas onepart dvs are combined with
3436 variable_merge_over_cur (variable s1var
, struct dfset_merge
*dsm
)
3438 dataflow_set
*dst
= dsm
->dst
;
3440 variable s2var
, dvar
= NULL
;
3441 decl_or_value dv
= s1var
->dv
;
3442 bool onepart
= dv_onepart_p (dv
);
3445 location_chain node
, *nodep
;
3447 /* If the incoming onepart variable has an empty location list, then
3448 the intersection will be just as empty. For other variables,
3449 it's always union. */
3450 gcc_checking_assert (s1var
->n_var_parts
3451 && s1var
->var_part
[0].loc_chain
);
3454 return variable_union (s1var
, dst
);
3456 gcc_checking_assert (s1var
->n_var_parts
== 1
3457 && s1var
->var_part
[0].offset
== 0);
3459 dvhash
= dv_htab_hash (dv
);
3460 if (dv_is_value_p (dv
))
3461 val
= dv_as_value (dv
);
3465 s2var
= shared_hash_find_1 (dsm
->src
->vars
, dv
, dvhash
);
3468 dst_can_be_shared
= false;
3472 dsm
->src_onepart_cnt
--;
3473 gcc_assert (s2var
->var_part
[0].loc_chain
3474 && s2var
->n_var_parts
== 1
3475 && s2var
->var_part
[0].offset
== 0);
3477 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
3480 dvar
= (variable
)*dstslot
;
3481 gcc_assert (dvar
->refcount
== 1
3482 && dvar
->n_var_parts
== 1
3483 && dvar
->var_part
[0].offset
== 0);
3484 nodep
= &dvar
->var_part
[0].loc_chain
;
3492 if (!dstslot
&& !onepart_variable_different_p (s1var
, s2var
))
3494 dstslot
= shared_hash_find_slot_unshare_1 (&dst
->vars
, dv
,
3496 *dstslot
= dvar
= s2var
;
3501 dst_can_be_shared
= false;
3503 intersect_loc_chains (val
, nodep
, dsm
,
3504 s1var
->var_part
[0].loc_chain
, s2var
);
3510 dvar
= (variable
) pool_alloc (dv_pool (dv
));
3513 dvar
->n_var_parts
= 1;
3514 dvar
->cur_loc_changed
= false;
3515 dvar
->in_changed_variables
= false;
3516 dvar
->var_part
[0].offset
= 0;
3517 dvar
->var_part
[0].loc_chain
= node
;
3518 dvar
->var_part
[0].cur_loc
= NULL
;
3521 = shared_hash_find_slot_unshare_1 (&dst
->vars
, dv
, dvhash
,
3523 gcc_assert (!*dstslot
);
3531 nodep
= &dvar
->var_part
[0].loc_chain
;
3532 while ((node
= *nodep
))
3534 location_chain
*nextp
= &node
->next
;
3536 if (GET_CODE (node
->loc
) == REG
)
3540 for (list
= dst
->regs
[REGNO (node
->loc
)]; list
; list
= list
->next
)
3541 if (GET_MODE (node
->loc
) == GET_MODE (list
->loc
)
3542 && dv_is_value_p (list
->dv
))
3546 attrs_list_insert (&dst
->regs
[REGNO (node
->loc
)],
3548 /* If this value became canonical for another value that had
3549 this register, we want to leave it alone. */
3550 else if (dv_as_value (list
->dv
) != val
)
3552 dstslot
= set_slot_part (dst
, dv_as_value (list
->dv
),
3554 node
->init
, NULL_RTX
);
3555 dstslot
= delete_slot_part (dst
, node
->loc
, dstslot
, 0);
3557 /* Since nextp points into the removed node, we can't
3558 use it. The pointer to the next node moved to nodep.
3559 However, if the variable we're walking is unshared
3560 during our walk, we'll keep walking the location list
3561 of the previously-shared variable, in which case the
3562 node won't have been removed, and we'll want to skip
3563 it. That's why we test *nodep here. */
3569 /* Canonicalization puts registers first, so we don't have to
3575 if (dvar
!= (variable
)*dstslot
)
3576 dvar
= (variable
)*dstslot
;
3577 nodep
= &dvar
->var_part
[0].loc_chain
;
3581 /* Mark all referenced nodes for canonicalization, and make sure
3582 we have mutual equivalence links. */
3583 VALUE_RECURSED_INTO (val
) = true;
3584 for (node
= *nodep
; node
; node
= node
->next
)
3585 if (GET_CODE (node
->loc
) == VALUE
)
3587 VALUE_RECURSED_INTO (node
->loc
) = true;
3588 set_variable_part (dst
, val
, dv_from_value (node
->loc
), 0,
3589 node
->init
, NULL
, INSERT
);
3592 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
3593 gcc_assert (*dstslot
== dvar
);
3594 canonicalize_values_star (dstslot
, dst
);
3595 #ifdef ENABLE_CHECKING
3597 == shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
));
3599 dvar
= (variable
)*dstslot
;
3603 bool has_value
= false, has_other
= false;
3605 /* If we have one value and anything else, we're going to
3606 canonicalize this, so make sure all values have an entry in
3607 the table and are marked for canonicalization. */
3608 for (node
= *nodep
; node
; node
= node
->next
)
3610 if (GET_CODE (node
->loc
) == VALUE
)
3612 /* If this was marked during register canonicalization,
3613 we know we have to canonicalize values. */
3628 if (has_value
&& has_other
)
3630 for (node
= *nodep
; node
; node
= node
->next
)
3632 if (GET_CODE (node
->loc
) == VALUE
)
3634 decl_or_value dv
= dv_from_value (node
->loc
);
3637 if (shared_hash_shared (dst
->vars
))
3638 slot
= shared_hash_find_slot_noinsert (dst
->vars
, dv
);
3640 slot
= shared_hash_find_slot_unshare (&dst
->vars
, dv
,
3644 variable var
= (variable
) pool_alloc (dv_pool (dv
));
3647 var
->n_var_parts
= 1;
3648 var
->cur_loc_changed
= false;
3649 var
->in_changed_variables
= false;
3650 var
->var_part
[0].offset
= 0;
3651 var
->var_part
[0].loc_chain
= NULL
;
3652 var
->var_part
[0].cur_loc
= NULL
;
3656 VALUE_RECURSED_INTO (node
->loc
) = true;
3660 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
3661 gcc_assert (*dstslot
== dvar
);
3662 canonicalize_values_star (dstslot
, dst
);
3663 #ifdef ENABLE_CHECKING
3665 == shared_hash_find_slot_noinsert_1 (dst
->vars
,
3668 dvar
= (variable
)*dstslot
;
3672 if (!onepart_variable_different_p (dvar
, s2var
))
3674 variable_htab_free (dvar
);
3675 *dstslot
= dvar
= s2var
;
3678 else if (s2var
!= s1var
&& !onepart_variable_different_p (dvar
, s1var
))
3680 variable_htab_free (dvar
);
3681 *dstslot
= dvar
= s1var
;
3683 dst_can_be_shared
= false;
3686 dst_can_be_shared
= false;
3691 /* Copy s2slot (in DSM->src) to DSM->dst if the variable is a
3692 multi-part variable. Unions of multi-part variables and
3693 intersections of one-part ones will be handled in
3694 variable_merge_over_cur(). */
3697 variable_merge_over_src (variable s2var
, struct dfset_merge
*dsm
)
3699 dataflow_set
*dst
= dsm
->dst
;
3700 decl_or_value dv
= s2var
->dv
;
3701 bool onepart
= dv_onepart_p (dv
);
3705 void **dstp
= shared_hash_find_slot (dst
->vars
, dv
);
3711 dsm
->src_onepart_cnt
++;
3715 /* Combine dataflow set information from SRC2 into DST, using PDST
3716 to carry over information across passes. */
3719 dataflow_set_merge (dataflow_set
*dst
, dataflow_set
*src2
)
3721 dataflow_set cur
= *dst
;
3722 dataflow_set
*src1
= &cur
;
3723 struct dfset_merge dsm
;
3725 size_t src1_elems
, src2_elems
;
3729 src1_elems
= htab_elements (shared_hash_htab (src1
->vars
));
3730 src2_elems
= htab_elements (shared_hash_htab (src2
->vars
));
3731 dataflow_set_init (dst
);
3732 dst
->stack_adjust
= cur
.stack_adjust
;
3733 shared_hash_destroy (dst
->vars
);
3734 dst
->vars
= (shared_hash
) pool_alloc (shared_hash_pool
);
3735 dst
->vars
->refcount
= 1;
3737 = htab_create (MAX (src1_elems
, src2_elems
), variable_htab_hash
,
3738 variable_htab_eq
, variable_htab_free
);
3740 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
3741 attrs_list_mpdv_union (&dst
->regs
[i
], src1
->regs
[i
], src2
->regs
[i
]);
3746 dsm
.src_onepart_cnt
= 0;
3748 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm
.src
->vars
), var
, variable
, hi
)
3749 variable_merge_over_src (var
, &dsm
);
3750 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm
.cur
->vars
), var
, variable
, hi
)
3751 variable_merge_over_cur (var
, &dsm
);
3753 if (dsm
.src_onepart_cnt
)
3754 dst_can_be_shared
= false;
3756 dataflow_set_destroy (src1
);
3759 /* Mark register equivalences. */
3762 dataflow_set_equiv_regs (dataflow_set
*set
)
3767 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
3769 rtx canon
[NUM_MACHINE_MODES
];
3771 /* If the list is empty or one entry, no need to canonicalize
3773 if (set
->regs
[i
] == NULL
|| set
->regs
[i
]->next
== NULL
)
3776 memset (canon
, 0, sizeof (canon
));
3778 for (list
= set
->regs
[i
]; list
; list
= list
->next
)
3779 if (list
->offset
== 0 && dv_is_value_p (list
->dv
))
3781 rtx val
= dv_as_value (list
->dv
);
3782 rtx
*cvalp
= &canon
[(int)GET_MODE (val
)];
3785 if (canon_value_cmp (val
, cval
))
3789 for (list
= set
->regs
[i
]; list
; list
= list
->next
)
3790 if (list
->offset
== 0 && dv_onepart_p (list
->dv
))
3792 rtx cval
= canon
[(int)GET_MODE (list
->loc
)];
3797 if (dv_is_value_p (list
->dv
))
3799 rtx val
= dv_as_value (list
->dv
);
3804 VALUE_RECURSED_INTO (val
) = true;
3805 set_variable_part (set
, val
, dv_from_value (cval
), 0,
3806 VAR_INIT_STATUS_INITIALIZED
,
3810 VALUE_RECURSED_INTO (cval
) = true;
3811 set_variable_part (set
, cval
, list
->dv
, 0,
3812 VAR_INIT_STATUS_INITIALIZED
, NULL
, NO_INSERT
);
3815 for (listp
= &set
->regs
[i
]; (list
= *listp
);
3816 listp
= list
? &list
->next
: listp
)
3817 if (list
->offset
== 0 && dv_onepart_p (list
->dv
))
3819 rtx cval
= canon
[(int)GET_MODE (list
->loc
)];
3825 if (dv_is_value_p (list
->dv
))
3827 rtx val
= dv_as_value (list
->dv
);
3828 if (!VALUE_RECURSED_INTO (val
))
3832 slot
= shared_hash_find_slot_noinsert (set
->vars
, list
->dv
);
3833 canonicalize_values_star (slot
, set
);
3840 /* Remove any redundant values in the location list of VAR, which must
3841 be unshared and 1-part. */
3844 remove_duplicate_values (variable var
)
3846 location_chain node
, *nodep
;
3848 gcc_assert (dv_onepart_p (var
->dv
));
3849 gcc_assert (var
->n_var_parts
== 1);
3850 gcc_assert (var
->refcount
== 1);
3852 for (nodep
= &var
->var_part
[0].loc_chain
; (node
= *nodep
); )
3854 if (GET_CODE (node
->loc
) == VALUE
)
3856 if (VALUE_RECURSED_INTO (node
->loc
))
3858 /* Remove duplicate value node. */
3859 *nodep
= node
->next
;
3860 pool_free (loc_chain_pool
, node
);
3864 VALUE_RECURSED_INTO (node
->loc
) = true;
3866 nodep
= &node
->next
;
3869 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3870 if (GET_CODE (node
->loc
) == VALUE
)
3872 gcc_assert (VALUE_RECURSED_INTO (node
->loc
));
3873 VALUE_RECURSED_INTO (node
->loc
) = false;
3878 /* Hash table iteration argument passed to variable_post_merge. */
3879 struct dfset_post_merge
3881 /* The new input set for the current block. */
3883 /* Pointer to the permanent input set for the current block, or
3885 dataflow_set
**permp
;
3888 /* Create values for incoming expressions associated with one-part
3889 variables that don't have value numbers for them. */
3892 variable_post_merge_new_vals (void **slot
, void *info
)
3894 struct dfset_post_merge
*dfpm
= (struct dfset_post_merge
*)info
;
3895 dataflow_set
*set
= dfpm
->set
;
3896 variable var
= (variable
)*slot
;
3897 location_chain node
;
3899 if (!dv_onepart_p (var
->dv
) || !var
->n_var_parts
)
3902 gcc_assert (var
->n_var_parts
== 1);
3904 if (dv_is_decl_p (var
->dv
))
3906 bool check_dupes
= false;
3909 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3911 if (GET_CODE (node
->loc
) == VALUE
)
3912 gcc_assert (!VALUE_RECURSED_INTO (node
->loc
));
3913 else if (GET_CODE (node
->loc
) == REG
)
3915 attrs att
, *attp
, *curp
= NULL
;
3917 if (var
->refcount
!= 1)
3919 slot
= unshare_variable (set
, slot
, var
,
3920 VAR_INIT_STATUS_INITIALIZED
);
3921 var
= (variable
)*slot
;
3925 for (attp
= &set
->regs
[REGNO (node
->loc
)]; (att
= *attp
);
3927 if (att
->offset
== 0
3928 && GET_MODE (att
->loc
) == GET_MODE (node
->loc
))
3930 if (dv_is_value_p (att
->dv
))
3932 rtx cval
= dv_as_value (att
->dv
);
3937 else if (dv_as_opaque (att
->dv
) == dv_as_opaque (var
->dv
))
3945 if ((*curp
)->offset
== 0
3946 && GET_MODE ((*curp
)->loc
) == GET_MODE (node
->loc
)
3947 && dv_as_opaque ((*curp
)->dv
) == dv_as_opaque (var
->dv
))
3950 curp
= &(*curp
)->next
;
3961 *dfpm
->permp
= XNEW (dataflow_set
);
3962 dataflow_set_init (*dfpm
->permp
);
3965 for (att
= (*dfpm
->permp
)->regs
[REGNO (node
->loc
)];
3966 att
; att
= att
->next
)
3967 if (GET_MODE (att
->loc
) == GET_MODE (node
->loc
))
3969 gcc_assert (att
->offset
== 0
3970 && dv_is_value_p (att
->dv
));
3971 val_reset (set
, att
->dv
);
3978 cval
= dv_as_value (cdv
);
3982 /* Create a unique value to hold this register,
3983 that ought to be found and reused in
3984 subsequent rounds. */
3986 gcc_assert (!cselib_lookup (node
->loc
,
3987 GET_MODE (node
->loc
), 0));
3988 v
= cselib_lookup (node
->loc
, GET_MODE (node
->loc
), 1);
3989 cselib_preserve_value (v
);
3990 cselib_invalidate_rtx (node
->loc
);
3992 cdv
= dv_from_value (cval
);
3995 "Created new value %u:%u for reg %i\n",
3996 v
->uid
, v
->hash
, REGNO (node
->loc
));
3999 var_reg_decl_set (*dfpm
->permp
, node
->loc
,
4000 VAR_INIT_STATUS_INITIALIZED
,
4001 cdv
, 0, NULL
, INSERT
);
4007 /* Remove attribute referring to the decl, which now
4008 uses the value for the register, already existing or
4009 to be added when we bring perm in. */
4012 pool_free (attrs_pool
, att
);
4017 remove_duplicate_values (var
);
4023 /* Reset values in the permanent set that are not associated with the
4024 chosen expression. */
4027 variable_post_merge_perm_vals (void **pslot
, void *info
)
4029 struct dfset_post_merge
*dfpm
= (struct dfset_post_merge
*)info
;
4030 dataflow_set
*set
= dfpm
->set
;
4031 variable pvar
= (variable
)*pslot
, var
;
4032 location_chain pnode
;
4036 gcc_assert (dv_is_value_p (pvar
->dv
)
4037 && pvar
->n_var_parts
== 1);
4038 pnode
= pvar
->var_part
[0].loc_chain
;
4041 && REG_P (pnode
->loc
));
4045 var
= shared_hash_find (set
->vars
, dv
);
4048 /* Although variable_post_merge_new_vals may have made decls
4049 non-star-canonical, values that pre-existed in canonical form
4050 remain canonical, and newly-created values reference a single
4051 REG, so they are canonical as well. Since VAR has the
4052 location list for a VALUE, using find_loc_in_1pdv for it is
4053 fine, since VALUEs don't map back to DECLs. */
4054 if (find_loc_in_1pdv (pnode
->loc
, var
, shared_hash_htab (set
->vars
)))
4056 val_reset (set
, dv
);
4059 for (att
= set
->regs
[REGNO (pnode
->loc
)]; att
; att
= att
->next
)
4060 if (att
->offset
== 0
4061 && GET_MODE (att
->loc
) == GET_MODE (pnode
->loc
)
4062 && dv_is_value_p (att
->dv
))
4065 /* If there is a value associated with this register already, create
4067 if (att
&& dv_as_value (att
->dv
) != dv_as_value (dv
))
4069 rtx cval
= dv_as_value (att
->dv
);
4070 set_variable_part (set
, cval
, dv
, 0, pnode
->init
, NULL
, INSERT
);
4071 set_variable_part (set
, dv_as_value (dv
), att
->dv
, 0, pnode
->init
,
4076 attrs_list_insert (&set
->regs
[REGNO (pnode
->loc
)],
4078 variable_union (pvar
, set
);
4084 /* Just checking stuff and registering register attributes for
4088 dataflow_post_merge_adjust (dataflow_set
*set
, dataflow_set
**permp
)
4090 struct dfset_post_merge dfpm
;
4095 htab_traverse (shared_hash_htab (set
->vars
), variable_post_merge_new_vals
,
4098 htab_traverse (shared_hash_htab ((*permp
)->vars
),
4099 variable_post_merge_perm_vals
, &dfpm
);
4100 htab_traverse (shared_hash_htab (set
->vars
), canonicalize_values_star
, set
);
4101 htab_traverse (shared_hash_htab (set
->vars
), canonicalize_vars_star
, set
);
4104 /* Return a node whose loc is a MEM that refers to EXPR in the
4105 location list of a one-part variable or value VAR, or in that of
4106 any values recursively mentioned in the location lists. */
4108 static location_chain
4109 find_mem_expr_in_1pdv (tree expr
, rtx val
, htab_t vars
)
4111 location_chain node
;
4114 location_chain where
= NULL
;
4119 gcc_assert (GET_CODE (val
) == VALUE
4120 && !VALUE_RECURSED_INTO (val
));
4122 dv
= dv_from_value (val
);
4123 var
= (variable
) htab_find_with_hash (vars
, dv
, dv_htab_hash (dv
));
4128 gcc_assert (dv_onepart_p (var
->dv
));
4130 if (!var
->n_var_parts
)
4133 gcc_assert (var
->var_part
[0].offset
== 0);
4135 VALUE_RECURSED_INTO (val
) = true;
4137 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
4138 if (MEM_P (node
->loc
) && MEM_EXPR (node
->loc
) == expr
4139 && MEM_OFFSET (node
->loc
) == 0)
4144 else if (GET_CODE (node
->loc
) == VALUE
4145 && !VALUE_RECURSED_INTO (node
->loc
)
4146 && (where
= find_mem_expr_in_1pdv (expr
, node
->loc
, vars
)))
4149 VALUE_RECURSED_INTO (val
) = false;
4154 /* Return TRUE if the value of MEM may vary across a call. */
4157 mem_dies_at_call (rtx mem
)
4159 tree expr
= MEM_EXPR (mem
);
4165 decl
= get_base_address (expr
);
4173 return (may_be_aliased (decl
)
4174 || (!TREE_READONLY (decl
) && is_global_var (decl
)));
4177 /* Remove all MEMs from the location list of a hash table entry for a
4178 one-part variable, except those whose MEM attributes map back to
4179 the variable itself, directly or within a VALUE. */
4182 dataflow_set_preserve_mem_locs (void **slot
, void *data
)
4184 dataflow_set
*set
= (dataflow_set
*) data
;
4185 variable var
= (variable
) *slot
;
4187 if (dv_is_decl_p (var
->dv
) && dv_onepart_p (var
->dv
))
4189 tree decl
= dv_as_decl (var
->dv
);
4190 location_chain loc
, *locp
;
4191 bool changed
= false;
4193 if (!var
->n_var_parts
)
4196 gcc_assert (var
->n_var_parts
== 1);
4198 if (shared_var_p (var
, set
->vars
))
4200 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
4202 /* We want to remove dying MEMs that doesn't refer to
4204 if (GET_CODE (loc
->loc
) == MEM
4205 && (MEM_EXPR (loc
->loc
) != decl
4206 || MEM_OFFSET (loc
->loc
))
4207 && !mem_dies_at_call (loc
->loc
))
4209 /* We want to move here MEMs that do refer to DECL. */
4210 else if (GET_CODE (loc
->loc
) == VALUE
4211 && find_mem_expr_in_1pdv (decl
, loc
->loc
,
4212 shared_hash_htab (set
->vars
)))
4219 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
4220 var
= (variable
)*slot
;
4221 gcc_assert (var
->n_var_parts
== 1);
4224 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
4227 rtx old_loc
= loc
->loc
;
4228 if (GET_CODE (old_loc
) == VALUE
)
4230 location_chain mem_node
4231 = find_mem_expr_in_1pdv (decl
, loc
->loc
,
4232 shared_hash_htab (set
->vars
));
4234 /* ??? This picks up only one out of multiple MEMs that
4235 refer to the same variable. Do we ever need to be
4236 concerned about dealing with more than one, or, given
4237 that they should all map to the same variable
4238 location, their addresses will have been merged and
4239 they will be regarded as equivalent? */
4242 loc
->loc
= mem_node
->loc
;
4243 loc
->set_src
= mem_node
->set_src
;
4244 loc
->init
= MIN (loc
->init
, mem_node
->init
);
4248 if (GET_CODE (loc
->loc
) != MEM
4249 || (MEM_EXPR (loc
->loc
) == decl
4250 && MEM_OFFSET (loc
->loc
) == 0)
4251 || !mem_dies_at_call (loc
->loc
))
4253 if (old_loc
!= loc
->loc
&& emit_notes
)
4255 if (old_loc
== var
->var_part
[0].cur_loc
)
4258 var
->var_part
[0].cur_loc
= NULL
;
4259 var
->cur_loc_changed
= true;
4261 add_value_chains (var
->dv
, loc
->loc
);
4262 remove_value_chains (var
->dv
, old_loc
);
4270 remove_value_chains (var
->dv
, old_loc
);
4271 if (old_loc
== var
->var_part
[0].cur_loc
)
4274 var
->var_part
[0].cur_loc
= NULL
;
4275 var
->cur_loc_changed
= true;
4279 pool_free (loc_chain_pool
, loc
);
4282 if (!var
->var_part
[0].loc_chain
)
4288 variable_was_changed (var
, set
);
4294 /* Remove all MEMs from the location list of a hash table entry for a
4298 dataflow_set_remove_mem_locs (void **slot
, void *data
)
4300 dataflow_set
*set
= (dataflow_set
*) data
;
4301 variable var
= (variable
) *slot
;
4303 if (dv_is_value_p (var
->dv
))
4305 location_chain loc
, *locp
;
4306 bool changed
= false;
4308 gcc_assert (var
->n_var_parts
== 1);
4310 if (shared_var_p (var
, set
->vars
))
4312 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
4313 if (GET_CODE (loc
->loc
) == MEM
4314 && mem_dies_at_call (loc
->loc
))
4320 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
4321 var
= (variable
)*slot
;
4322 gcc_assert (var
->n_var_parts
== 1);
4325 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
4328 if (GET_CODE (loc
->loc
) != MEM
4329 || !mem_dies_at_call (loc
->loc
))
4336 remove_value_chains (var
->dv
, loc
->loc
);
4338 /* If we have deleted the location which was last emitted
4339 we have to emit new location so add the variable to set
4340 of changed variables. */
4341 if (var
->var_part
[0].cur_loc
== loc
->loc
)
4344 var
->var_part
[0].cur_loc
= NULL
;
4345 var
->cur_loc_changed
= true;
4347 pool_free (loc_chain_pool
, loc
);
4350 if (!var
->var_part
[0].loc_chain
)
4356 variable_was_changed (var
, set
);
4362 /* Remove all variable-location information about call-clobbered
4363 registers, as well as associations between MEMs and VALUEs. */
4366 dataflow_set_clear_at_call (dataflow_set
*set
)
4370 for (r
= 0; r
< FIRST_PSEUDO_REGISTER
; r
++)
4371 if (TEST_HARD_REG_BIT (regs_invalidated_by_call
, r
))
4372 var_regno_delete (set
, r
);
4374 if (MAY_HAVE_DEBUG_INSNS
)
4376 set
->traversed_vars
= set
->vars
;
4377 htab_traverse (shared_hash_htab (set
->vars
),
4378 dataflow_set_preserve_mem_locs
, set
);
4379 set
->traversed_vars
= set
->vars
;
4380 htab_traverse (shared_hash_htab (set
->vars
), dataflow_set_remove_mem_locs
,
4382 set
->traversed_vars
= NULL
;
4387 variable_part_different_p (variable_part
*vp1
, variable_part
*vp2
)
4389 location_chain lc1
, lc2
;
4391 for (lc1
= vp1
->loc_chain
; lc1
; lc1
= lc1
->next
)
4393 for (lc2
= vp2
->loc_chain
; lc2
; lc2
= lc2
->next
)
4395 if (REG_P (lc1
->loc
) && REG_P (lc2
->loc
))
4397 if (REGNO (lc1
->loc
) == REGNO (lc2
->loc
))
4400 if (rtx_equal_p (lc1
->loc
, lc2
->loc
))
4409 /* Return true if one-part variables VAR1 and VAR2 are different.
4410 They must be in canonical order. */
4413 onepart_variable_different_p (variable var1
, variable var2
)
4415 location_chain lc1
, lc2
;
4420 gcc_assert (var1
->n_var_parts
== 1
4421 && var2
->n_var_parts
== 1);
4423 lc1
= var1
->var_part
[0].loc_chain
;
4424 lc2
= var2
->var_part
[0].loc_chain
;
4426 gcc_assert (lc1
&& lc2
);
4430 if (loc_cmp (lc1
->loc
, lc2
->loc
))
4439 /* Return true if variables VAR1 and VAR2 are different. */
4442 variable_different_p (variable var1
, variable var2
)
4449 if (var1
->n_var_parts
!= var2
->n_var_parts
)
4452 for (i
= 0; i
< var1
->n_var_parts
; i
++)
4454 if (var1
->var_part
[i
].offset
!= var2
->var_part
[i
].offset
)
4456 /* One-part values have locations in a canonical order. */
4457 if (i
== 0 && var1
->var_part
[i
].offset
== 0 && dv_onepart_p (var1
->dv
))
4459 gcc_assert (var1
->n_var_parts
== 1
4460 && dv_as_opaque (var1
->dv
) == dv_as_opaque (var2
->dv
));
4461 return onepart_variable_different_p (var1
, var2
);
4463 if (variable_part_different_p (&var1
->var_part
[i
], &var2
->var_part
[i
]))
4465 if (variable_part_different_p (&var2
->var_part
[i
], &var1
->var_part
[i
]))
4471 /* Return true if dataflow sets OLD_SET and NEW_SET differ. */
4474 dataflow_set_different (dataflow_set
*old_set
, dataflow_set
*new_set
)
4479 if (old_set
->vars
== new_set
->vars
)
4482 if (htab_elements (shared_hash_htab (old_set
->vars
))
4483 != htab_elements (shared_hash_htab (new_set
->vars
)))
4486 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (old_set
->vars
), var1
, variable
, hi
)
4488 htab_t htab
= shared_hash_htab (new_set
->vars
);
4489 variable var2
= (variable
) htab_find_with_hash (htab
, var1
->dv
,
4490 dv_htab_hash (var1
->dv
));
4493 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4495 fprintf (dump_file
, "dataflow difference found: removal of:\n");
4501 if (variable_different_p (var1
, var2
))
4503 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4505 fprintf (dump_file
, "dataflow difference found: "
4506 "old and new follow:\n");
4514 /* No need to traverse the second hashtab, if both have the same number
4515 of elements and the second one had all entries found in the first one,
4516 then it can't have any extra entries. */
4520 /* Free the contents of dataflow set SET. */
4523 dataflow_set_destroy (dataflow_set
*set
)
4527 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4528 attrs_list_clear (&set
->regs
[i
]);
4530 shared_hash_destroy (set
->vars
);
4534 /* Return true if RTL X contains a SYMBOL_REF. */
4537 contains_symbol_ref (rtx x
)
4546 code
= GET_CODE (x
);
4547 if (code
== SYMBOL_REF
)
4550 fmt
= GET_RTX_FORMAT (code
);
4551 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
4555 if (contains_symbol_ref (XEXP (x
, i
)))
4558 else if (fmt
[i
] == 'E')
4561 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
4562 if (contains_symbol_ref (XVECEXP (x
, i
, j
)))
4570 /* Shall EXPR be tracked? */
4573 track_expr_p (tree expr
, bool need_rtl
)
4578 if (TREE_CODE (expr
) == DEBUG_EXPR_DECL
)
4579 return DECL_RTL_SET_P (expr
);
4581 /* If EXPR is not a parameter or a variable do not track it. */
4582 if (TREE_CODE (expr
) != VAR_DECL
&& TREE_CODE (expr
) != PARM_DECL
)
4585 /* It also must have a name... */
4586 if (!DECL_NAME (expr
) && need_rtl
)
4589 /* ... and a RTL assigned to it. */
4590 decl_rtl
= DECL_RTL_IF_SET (expr
);
4591 if (!decl_rtl
&& need_rtl
)
4594 /* If this expression is really a debug alias of some other declaration, we
4595 don't need to track this expression if the ultimate declaration is
4598 if (DECL_DEBUG_EXPR_IS_FROM (realdecl
))
4600 realdecl
= DECL_DEBUG_EXPR (realdecl
);
4601 if (realdecl
== NULL_TREE
)
4603 else if (!DECL_P (realdecl
))
4605 if (handled_component_p (realdecl
))
4607 HOST_WIDE_INT bitsize
, bitpos
, maxsize
;
4609 = get_ref_base_and_extent (realdecl
, &bitpos
, &bitsize
,
4611 if (!DECL_P (innerdecl
)
4612 || DECL_IGNORED_P (innerdecl
)
4613 || TREE_STATIC (innerdecl
)
4615 || bitpos
+ bitsize
> 256
4616 || bitsize
!= maxsize
)
4626 /* Do not track EXPR if REALDECL it should be ignored for debugging
4628 if (DECL_IGNORED_P (realdecl
))
4631 /* Do not track global variables until we are able to emit correct location
4633 if (TREE_STATIC (realdecl
))
4636 /* When the EXPR is a DECL for alias of some variable (see example)
4637 the TREE_STATIC flag is not used. Disable tracking all DECLs whose
4638 DECL_RTL contains SYMBOL_REF.
4641 extern char **_dl_argv_internal __attribute__ ((alias ("_dl_argv")));
4644 if (decl_rtl
&& MEM_P (decl_rtl
)
4645 && contains_symbol_ref (XEXP (decl_rtl
, 0)))
4648 /* If RTX is a memory it should not be very large (because it would be
4649 an array or struct). */
4650 if (decl_rtl
&& MEM_P (decl_rtl
))
4652 /* Do not track structures and arrays. */
4653 if (GET_MODE (decl_rtl
) == BLKmode
4654 || AGGREGATE_TYPE_P (TREE_TYPE (realdecl
)))
4656 if (MEM_SIZE (decl_rtl
)
4657 && INTVAL (MEM_SIZE (decl_rtl
)) > MAX_VAR_PARTS
)
4661 DECL_CHANGED (expr
) = 0;
4662 DECL_CHANGED (realdecl
) = 0;
4666 /* Determine whether a given LOC refers to the same variable part as
4670 same_variable_part_p (rtx loc
, tree expr
, HOST_WIDE_INT offset
)
4673 HOST_WIDE_INT offset2
;
4675 if (! DECL_P (expr
))
4680 expr2
= REG_EXPR (loc
);
4681 offset2
= REG_OFFSET (loc
);
4683 else if (MEM_P (loc
))
4685 expr2
= MEM_EXPR (loc
);
4686 offset2
= INT_MEM_OFFSET (loc
);
4691 if (! expr2
|| ! DECL_P (expr2
))
4694 expr
= var_debug_decl (expr
);
4695 expr2
= var_debug_decl (expr2
);
4697 return (expr
== expr2
&& offset
== offset2
);
4700 /* LOC is a REG or MEM that we would like to track if possible.
4701 If EXPR is null, we don't know what expression LOC refers to,
4702 otherwise it refers to EXPR + OFFSET. STORE_REG_P is true if
4703 LOC is an lvalue register.
4705 Return true if EXPR is nonnull and if LOC, or some lowpart of it,
4706 is something we can track. When returning true, store the mode of
4707 the lowpart we can track in *MODE_OUT (if nonnull) and its offset
4708 from EXPR in *OFFSET_OUT (if nonnull). */
4711 track_loc_p (rtx loc
, tree expr
, HOST_WIDE_INT offset
, bool store_reg_p
,
4712 enum machine_mode
*mode_out
, HOST_WIDE_INT
*offset_out
)
4714 enum machine_mode mode
;
4716 if (expr
== NULL
|| !track_expr_p (expr
, true))
4719 /* If REG was a paradoxical subreg, its REG_ATTRS will describe the
4720 whole subreg, but only the old inner part is really relevant. */
4721 mode
= GET_MODE (loc
);
4722 if (REG_P (loc
) && !HARD_REGISTER_NUM_P (ORIGINAL_REGNO (loc
)))
4724 enum machine_mode pseudo_mode
;
4726 pseudo_mode
= PSEUDO_REGNO_MODE (ORIGINAL_REGNO (loc
));
4727 if (GET_MODE_SIZE (mode
) > GET_MODE_SIZE (pseudo_mode
))
4729 offset
+= byte_lowpart_offset (pseudo_mode
, mode
);
4734 /* If LOC is a paradoxical lowpart of EXPR, refer to EXPR itself.
4735 Do the same if we are storing to a register and EXPR occupies
4736 the whole of register LOC; in that case, the whole of EXPR is
4737 being changed. We exclude complex modes from the second case
4738 because the real and imaginary parts are represented as separate
4739 pseudo registers, even if the whole complex value fits into one
4741 if ((GET_MODE_SIZE (mode
) > GET_MODE_SIZE (DECL_MODE (expr
))
4743 && !COMPLEX_MODE_P (DECL_MODE (expr
))
4744 && hard_regno_nregs
[REGNO (loc
)][DECL_MODE (expr
)] == 1))
4745 && offset
+ byte_lowpart_offset (DECL_MODE (expr
), mode
) == 0)
4747 mode
= DECL_MODE (expr
);
4751 if (offset
< 0 || offset
>= MAX_VAR_PARTS
)
4757 *offset_out
= offset
;
4761 /* Return the MODE lowpart of LOC, or null if LOC is not something we
4762 want to track. When returning nonnull, make sure that the attributes
4763 on the returned value are updated. */
4766 var_lowpart (enum machine_mode mode
, rtx loc
)
4768 unsigned int offset
, reg_offset
, regno
;
4770 if (!REG_P (loc
) && !MEM_P (loc
))
4773 if (GET_MODE (loc
) == mode
)
4776 offset
= byte_lowpart_offset (mode
, GET_MODE (loc
));
4779 return adjust_address_nv (loc
, mode
, offset
);
4781 reg_offset
= subreg_lowpart_offset (mode
, GET_MODE (loc
));
4782 regno
= REGNO (loc
) + subreg_regno_offset (REGNO (loc
), GET_MODE (loc
),
4784 return gen_rtx_REG_offset (loc
, mode
, regno
, offset
);
4787 /* arg_pointer_rtx resp. frame_pointer_rtx if stack_pointer_rtx or
4788 hard_frame_pointer_rtx is being mapped to it. */
4789 static rtx cfa_base_rtx
;
4791 /* Carry information about uses and stores while walking rtx. */
4793 struct count_use_info
4795 /* The insn where the RTX is. */
4798 /* The basic block where insn is. */
4801 /* The array of n_sets sets in the insn, as determined by cselib. */
4802 struct cselib_set
*sets
;
4805 /* True if we're counting stores, false otherwise. */
4809 /* Find a VALUE corresponding to X. */
4811 static inline cselib_val
*
4812 find_use_val (rtx x
, enum machine_mode mode
, struct count_use_info
*cui
)
4818 /* This is called after uses are set up and before stores are
4819 processed bycselib, so it's safe to look up srcs, but not
4820 dsts. So we look up expressions that appear in srcs or in
4821 dest expressions, but we search the sets array for dests of
4825 for (i
= 0; i
< cui
->n_sets
; i
++)
4826 if (cui
->sets
[i
].dest
== x
)
4827 return cui
->sets
[i
].src_elt
;
4830 return cselib_lookup (x
, mode
, 0);
4836 /* Helper function to get mode of MEM's address. */
4838 static inline enum machine_mode
4839 get_address_mode (rtx mem
)
4841 enum machine_mode mode
= GET_MODE (XEXP (mem
, 0));
4842 if (mode
!= VOIDmode
)
4844 return targetm
.addr_space
.address_mode (MEM_ADDR_SPACE (mem
));
4847 /* Replace all registers and addresses in an expression with VALUE
4848 expressions that map back to them, unless the expression is a
4849 register. If no mapping is or can be performed, returns NULL. */
4852 replace_expr_with_values (rtx loc
)
4856 else if (MEM_P (loc
))
4858 cselib_val
*addr
= cselib_lookup (XEXP (loc
, 0),
4859 get_address_mode (loc
), 0);
4861 return replace_equiv_address_nv (loc
, addr
->val_rtx
);
4866 return cselib_subst_to_values (loc
);
4869 /* Determine what kind of micro operation to choose for a USE. Return
4870 MO_CLOBBER if no micro operation is to be generated. */
4872 static enum micro_operation_type
4873 use_type (rtx loc
, struct count_use_info
*cui
, enum machine_mode
*modep
)
4877 if (cui
&& cui
->sets
)
4879 if (GET_CODE (loc
) == VAR_LOCATION
)
4881 if (track_expr_p (PAT_VAR_LOCATION_DECL (loc
), false))
4883 rtx ploc
= PAT_VAR_LOCATION_LOC (loc
);
4884 if (! VAR_LOC_UNKNOWN_P (ploc
))
4886 cselib_val
*val
= cselib_lookup (ploc
, GET_MODE (loc
), 1);
4888 /* ??? flag_float_store and volatile mems are never
4889 given values, but we could in theory use them for
4891 gcc_assert (val
|| 1);
4899 if (REG_P (loc
) || MEM_P (loc
))
4902 *modep
= GET_MODE (loc
);
4906 || (find_use_val (loc
, GET_MODE (loc
), cui
)
4907 && cselib_lookup (XEXP (loc
, 0),
4908 get_address_mode (loc
), 0)))
4913 cselib_val
*val
= find_use_val (loc
, GET_MODE (loc
), cui
);
4915 if (val
&& !cselib_preserved_value_p (val
))
4923 gcc_assert (REGNO (loc
) < FIRST_PSEUDO_REGISTER
);
4925 if (loc
== cfa_base_rtx
)
4927 expr
= REG_EXPR (loc
);
4930 return MO_USE_NO_VAR
;
4931 else if (target_for_debug_bind (var_debug_decl (expr
)))
4933 else if (track_loc_p (loc
, expr
, REG_OFFSET (loc
),
4934 false, modep
, NULL
))
4937 return MO_USE_NO_VAR
;
4939 else if (MEM_P (loc
))
4941 expr
= MEM_EXPR (loc
);
4945 else if (target_for_debug_bind (var_debug_decl (expr
)))
4947 else if (track_loc_p (loc
, expr
, INT_MEM_OFFSET (loc
),
4948 false, modep
, NULL
))
4957 /* Log to OUT information about micro-operation MOPT involving X in
4961 log_op_type (rtx x
, basic_block bb
, rtx insn
,
4962 enum micro_operation_type mopt
, FILE *out
)
4964 fprintf (out
, "bb %i op %i insn %i %s ",
4965 bb
->index
, VEC_length (micro_operation
, VTI (bb
)->mos
),
4966 INSN_UID (insn
), micro_operation_type_name
[mopt
]);
4967 print_inline_rtx (out
, x
, 2);
4971 /* Tell whether the CONCAT used to holds a VALUE and its location
4972 needs value resolution, i.e., an attempt of mapping the location
4973 back to other incoming values. */
4974 #define VAL_NEEDS_RESOLUTION(x) \
4975 (RTL_FLAG_CHECK1 ("VAL_NEEDS_RESOLUTION", (x), CONCAT)->volatil)
4976 /* Whether the location in the CONCAT is a tracked expression, that
4977 should also be handled like a MO_USE. */
4978 #define VAL_HOLDS_TRACK_EXPR(x) \
4979 (RTL_FLAG_CHECK1 ("VAL_HOLDS_TRACK_EXPR", (x), CONCAT)->used)
4980 /* Whether the location in the CONCAT should be handled like a MO_COPY
4982 #define VAL_EXPR_IS_COPIED(x) \
4983 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_COPIED", (x), CONCAT)->jump)
4984 /* Whether the location in the CONCAT should be handled like a
4985 MO_CLOBBER as well. */
4986 #define VAL_EXPR_IS_CLOBBERED(x) \
4987 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_CLOBBERED", (x), CONCAT)->unchanging)
4988 /* Whether the location is a CONCAT of the MO_VAL_SET expression and
4989 a reverse operation that should be handled afterwards. */
4990 #define VAL_EXPR_HAS_REVERSE(x) \
4991 (RTL_FLAG_CHECK1 ("VAL_EXPR_HAS_REVERSE", (x), CONCAT)->return_val)
4993 /* All preserved VALUEs. */
4994 static VEC (rtx
, heap
) *preserved_values
;
4996 /* Ensure VAL is preserved and remember it in a vector for vt_emit_notes. */
4999 preserve_value (cselib_val
*val
)
5001 cselib_preserve_value (val
);
5002 VEC_safe_push (rtx
, heap
, preserved_values
, val
->val_rtx
);
5005 /* Helper function for MO_VAL_LOC handling. Return non-zero if
5006 any rtxes not suitable for CONST use not replaced by VALUEs
5010 non_suitable_const (rtx
*x
, void *data ATTRIBUTE_UNUSED
)
5015 switch (GET_CODE (*x
))
5026 return !MEM_READONLY_P (*x
);
5032 /* Add uses (register and memory references) LOC which will be tracked
5033 to VTI (bb)->mos. INSN is instruction which the LOC is part of. */
5036 add_uses (rtx
*ploc
, void *data
)
5039 enum machine_mode mode
= VOIDmode
;
5040 struct count_use_info
*cui
= (struct count_use_info
*)data
;
5041 enum micro_operation_type type
= use_type (loc
, cui
, &mode
);
5043 if (type
!= MO_CLOBBER
)
5045 basic_block bb
= cui
->bb
;
5049 mo
.u
.loc
= type
== MO_USE
? var_lowpart (mode
, loc
) : loc
;
5050 mo
.insn
= cui
->insn
;
5052 if (type
== MO_VAL_LOC
)
5055 rtx vloc
= PAT_VAR_LOCATION_LOC (oloc
);
5058 gcc_assert (cui
->sets
);
5061 && !REG_P (XEXP (vloc
, 0))
5062 && !MEM_P (XEXP (vloc
, 0))
5063 && (GET_CODE (XEXP (vloc
, 0)) != PLUS
5064 || XEXP (XEXP (vloc
, 0), 0) != cfa_base_rtx
5065 || !CONST_INT_P (XEXP (XEXP (vloc
, 0), 1))))
5068 enum machine_mode address_mode
= get_address_mode (mloc
);
5070 = cselib_lookup (XEXP (mloc
, 0), address_mode
, 0);
5072 if (val
&& !cselib_preserved_value_p (val
))
5074 micro_operation moa
;
5075 preserve_value (val
);
5076 mloc
= cselib_subst_to_values (XEXP (mloc
, 0));
5077 moa
.type
= MO_VAL_USE
;
5078 moa
.insn
= cui
->insn
;
5079 moa
.u
.loc
= gen_rtx_CONCAT (address_mode
,
5080 val
->val_rtx
, mloc
);
5081 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5082 log_op_type (moa
.u
.loc
, cui
->bb
, cui
->insn
,
5083 moa
.type
, dump_file
);
5084 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &moa
);
5088 if (CONSTANT_P (vloc
)
5089 && (GET_CODE (vloc
) != CONST
5090 || for_each_rtx (&vloc
, non_suitable_const
, NULL
)))
5091 /* For constants don't look up any value. */;
5092 else if (!VAR_LOC_UNKNOWN_P (vloc
)
5093 && (val
= find_use_val (vloc
, GET_MODE (oloc
), cui
)))
5095 enum machine_mode mode2
;
5096 enum micro_operation_type type2
;
5097 rtx nloc
= replace_expr_with_values (vloc
);
5101 oloc
= shallow_copy_rtx (oloc
);
5102 PAT_VAR_LOCATION_LOC (oloc
) = nloc
;
5105 oloc
= gen_rtx_CONCAT (mode
, val
->val_rtx
, oloc
);
5107 type2
= use_type (vloc
, 0, &mode2
);
5109 gcc_assert (type2
== MO_USE
|| type2
== MO_USE_NO_VAR
5110 || type2
== MO_CLOBBER
);
5112 if (type2
== MO_CLOBBER
5113 && !cselib_preserved_value_p (val
))
5115 VAL_NEEDS_RESOLUTION (oloc
) = 1;
5116 preserve_value (val
);
5119 else if (!VAR_LOC_UNKNOWN_P (vloc
))
5121 oloc
= shallow_copy_rtx (oloc
);
5122 PAT_VAR_LOCATION_LOC (oloc
) = gen_rtx_UNKNOWN_VAR_LOC ();
5127 else if (type
== MO_VAL_USE
)
5129 enum machine_mode mode2
= VOIDmode
;
5130 enum micro_operation_type type2
;
5131 cselib_val
*val
= find_use_val (loc
, GET_MODE (loc
), cui
);
5132 rtx vloc
, oloc
= loc
, nloc
;
5134 gcc_assert (cui
->sets
);
5137 && !REG_P (XEXP (oloc
, 0))
5138 && !MEM_P (XEXP (oloc
, 0))
5139 && (GET_CODE (XEXP (oloc
, 0)) != PLUS
5140 || XEXP (XEXP (oloc
, 0), 0) != cfa_base_rtx
5141 || !CONST_INT_P (XEXP (XEXP (oloc
, 0), 1))))
5144 enum machine_mode address_mode
= get_address_mode (mloc
);
5146 = cselib_lookup (XEXP (mloc
, 0), address_mode
, 0);
5148 if (val
&& !cselib_preserved_value_p (val
))
5150 micro_operation moa
;
5151 preserve_value (val
);
5152 mloc
= cselib_subst_to_values (XEXP (mloc
, 0));
5153 moa
.type
= MO_VAL_USE
;
5154 moa
.insn
= cui
->insn
;
5155 moa
.u
.loc
= gen_rtx_CONCAT (address_mode
,
5156 val
->val_rtx
, mloc
);
5157 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5158 log_op_type (moa
.u
.loc
, cui
->bb
, cui
->insn
,
5159 moa
.type
, dump_file
);
5160 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &moa
);
5164 type2
= use_type (loc
, 0, &mode2
);
5166 gcc_assert (type2
== MO_USE
|| type2
== MO_USE_NO_VAR
5167 || type2
== MO_CLOBBER
);
5169 if (type2
== MO_USE
)
5170 vloc
= var_lowpart (mode2
, loc
);
5174 /* The loc of a MO_VAL_USE may have two forms:
5176 (concat val src): val is at src, a value-based
5179 (concat (concat val use) src): same as above, with use as
5180 the MO_USE tracked value, if it differs from src.
5184 nloc
= replace_expr_with_values (loc
);
5189 oloc
= gen_rtx_CONCAT (mode2
, val
->val_rtx
, vloc
);
5191 oloc
= val
->val_rtx
;
5193 mo
.u
.loc
= gen_rtx_CONCAT (mode
, oloc
, nloc
);
5195 if (type2
== MO_USE
)
5196 VAL_HOLDS_TRACK_EXPR (mo
.u
.loc
) = 1;
5197 if (!cselib_preserved_value_p (val
))
5199 VAL_NEEDS_RESOLUTION (mo
.u
.loc
) = 1;
5200 preserve_value (val
);
5204 gcc_assert (type
== MO_USE
|| type
== MO_USE_NO_VAR
);
5206 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5207 log_op_type (mo
.u
.loc
, cui
->bb
, cui
->insn
, mo
.type
, dump_file
);
5208 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &mo
);
5214 /* Helper function for finding all uses of REG/MEM in X in insn INSN. */
5217 add_uses_1 (rtx
*x
, void *cui
)
5219 for_each_rtx (x
, add_uses
, cui
);
5222 /* Attempt to reverse the EXPR operation in the debug info. Say for
5223 reg1 = reg2 + 6 even when reg2 is no longer live we
5224 can express its value as VAL - 6. */
5227 reverse_op (rtx val
, const_rtx expr
)
5233 if (GET_CODE (expr
) != SET
)
5236 if (!REG_P (SET_DEST (expr
)) || GET_MODE (val
) != GET_MODE (SET_DEST (expr
)))
5239 src
= SET_SRC (expr
);
5240 switch (GET_CODE (src
))
5247 if (!REG_P (XEXP (src
, 0)))
5252 if (!REG_P (XEXP (src
, 0)) && !MEM_P (XEXP (src
, 0)))
5259 if (!SCALAR_INT_MODE_P (GET_MODE (src
)) || XEXP (src
, 0) == cfa_base_rtx
)
5262 v
= cselib_lookup (XEXP (src
, 0), GET_MODE (XEXP (src
, 0)), 0);
5263 if (!v
|| !cselib_preserved_value_p (v
))
5266 switch (GET_CODE (src
))
5270 if (GET_MODE (v
->val_rtx
) != GET_MODE (val
))
5272 ret
= gen_rtx_fmt_e (GET_CODE (src
), GET_MODE (val
), val
);
5276 ret
= gen_lowpart_SUBREG (GET_MODE (v
->val_rtx
), val
);
5288 if (GET_MODE (v
->val_rtx
) != GET_MODE (val
))
5290 arg
= XEXP (src
, 1);
5291 if (!CONST_INT_P (arg
) && GET_CODE (arg
) != SYMBOL_REF
)
5293 arg
= cselib_expand_value_rtx (arg
, scratch_regs
, 5);
5294 if (arg
== NULL_RTX
)
5296 if (!CONST_INT_P (arg
) && GET_CODE (arg
) != SYMBOL_REF
)
5299 ret
= simplify_gen_binary (code
, GET_MODE (val
), val
, arg
);
5301 /* Ensure ret isn't VALUE itself (which can happen e.g. for
5302 (plus (reg1) (reg2)) when reg2 is known to be 0), as that
5303 breaks a lot of routines during var-tracking. */
5304 ret
= gen_rtx_fmt_ee (PLUS
, GET_MODE (val
), val
, const0_rtx
);
5310 return gen_rtx_CONCAT (GET_MODE (v
->val_rtx
), v
->val_rtx
, ret
);
5313 /* Add stores (register and memory references) LOC which will be tracked
5314 to VTI (bb)->mos. EXPR is the RTL expression containing the store.
5315 CUIP->insn is instruction which the LOC is part of. */
5318 add_stores (rtx loc
, const_rtx expr
, void *cuip
)
5320 enum machine_mode mode
= VOIDmode
, mode2
;
5321 struct count_use_info
*cui
= (struct count_use_info
*)cuip
;
5322 basic_block bb
= cui
->bb
;
5324 rtx oloc
= loc
, nloc
, src
= NULL
;
5325 enum micro_operation_type type
= use_type (loc
, cui
, &mode
);
5326 bool track_p
= false;
5328 bool resolve
, preserve
;
5331 if (type
== MO_CLOBBER
)
5338 gcc_assert (loc
!= cfa_base_rtx
);
5339 if ((GET_CODE (expr
) == CLOBBER
&& type
!= MO_VAL_SET
)
5340 || !(track_p
= use_type (loc
, NULL
, &mode2
) == MO_USE
)
5341 || GET_CODE (expr
) == CLOBBER
)
5343 mo
.type
= MO_CLOBBER
;
5348 if (GET_CODE (expr
) == SET
&& SET_DEST (expr
) == loc
)
5349 src
= var_lowpart (mode2
, SET_SRC (expr
));
5350 loc
= var_lowpart (mode2
, loc
);
5359 rtx xexpr
= gen_rtx_SET (VOIDmode
, loc
, src
);
5360 if (same_variable_part_p (src
, REG_EXPR (loc
), REG_OFFSET (loc
)))
5367 mo
.insn
= cui
->insn
;
5369 else if (MEM_P (loc
)
5370 && ((track_p
= use_type (loc
, NULL
, &mode2
) == MO_USE
)
5373 if (MEM_P (loc
) && type
== MO_VAL_SET
5374 && !REG_P (XEXP (loc
, 0))
5375 && !MEM_P (XEXP (loc
, 0))
5376 && (GET_CODE (XEXP (loc
, 0)) != PLUS
5377 || XEXP (XEXP (loc
, 0), 0) != cfa_base_rtx
5378 || !CONST_INT_P (XEXP (XEXP (loc
, 0), 1))))
5381 enum machine_mode address_mode
= get_address_mode (mloc
);
5382 cselib_val
*val
= cselib_lookup (XEXP (mloc
, 0),
5385 if (val
&& !cselib_preserved_value_p (val
))
5387 preserve_value (val
);
5388 mo
.type
= MO_VAL_USE
;
5389 mloc
= cselib_subst_to_values (XEXP (mloc
, 0));
5390 mo
.u
.loc
= gen_rtx_CONCAT (address_mode
, val
->val_rtx
, mloc
);
5391 mo
.insn
= cui
->insn
;
5392 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5393 log_op_type (mo
.u
.loc
, cui
->bb
, cui
->insn
,
5394 mo
.type
, dump_file
);
5395 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &mo
);
5399 if (GET_CODE (expr
) == CLOBBER
|| !track_p
)
5401 mo
.type
= MO_CLOBBER
;
5402 mo
.u
.loc
= track_p
? var_lowpart (mode2
, loc
) : loc
;
5406 if (GET_CODE (expr
) == SET
&& SET_DEST (expr
) == loc
)
5407 src
= var_lowpart (mode2
, SET_SRC (expr
));
5408 loc
= var_lowpart (mode2
, loc
);
5417 rtx xexpr
= gen_rtx_SET (VOIDmode
, loc
, src
);
5418 if (same_variable_part_p (SET_SRC (xexpr
),
5420 INT_MEM_OFFSET (loc
)))
5427 mo
.insn
= cui
->insn
;
5432 if (type
!= MO_VAL_SET
)
5433 goto log_and_return
;
5435 v
= find_use_val (oloc
, mode
, cui
);
5438 goto log_and_return
;
5440 resolve
= preserve
= !cselib_preserved_value_p (v
);
5442 nloc
= replace_expr_with_values (oloc
);
5446 if (GET_CODE (PATTERN (cui
->insn
)) == COND_EXEC
)
5448 cselib_val
*oval
= cselib_lookup (oloc
, GET_MODE (oloc
), 0);
5450 gcc_assert (oval
!= v
);
5451 gcc_assert (REG_P (oloc
) || MEM_P (oloc
));
5453 if (!cselib_preserved_value_p (oval
))
5455 micro_operation moa
;
5457 preserve_value (oval
);
5459 moa
.type
= MO_VAL_USE
;
5460 moa
.u
.loc
= gen_rtx_CONCAT (mode
, oval
->val_rtx
, oloc
);
5461 VAL_NEEDS_RESOLUTION (moa
.u
.loc
) = 1;
5462 moa
.insn
= cui
->insn
;
5464 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5465 log_op_type (moa
.u
.loc
, cui
->bb
, cui
->insn
,
5466 moa
.type
, dump_file
);
5467 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &moa
);
5472 else if (resolve
&& GET_CODE (mo
.u
.loc
) == SET
)
5474 nloc
= replace_expr_with_values (SET_SRC (expr
));
5476 /* Avoid the mode mismatch between oexpr and expr. */
5477 if (!nloc
&& mode
!= mode2
)
5479 nloc
= SET_SRC (expr
);
5480 gcc_assert (oloc
== SET_DEST (expr
));
5484 oloc
= gen_rtx_SET (GET_MODE (mo
.u
.loc
), oloc
, nloc
);
5487 if (oloc
== SET_DEST (mo
.u
.loc
))
5488 /* No point in duplicating. */
5490 if (!REG_P (SET_SRC (mo
.u
.loc
)))
5496 if (GET_CODE (mo
.u
.loc
) == SET
5497 && oloc
== SET_DEST (mo
.u
.loc
))
5498 /* No point in duplicating. */
5504 loc
= gen_rtx_CONCAT (mode
, v
->val_rtx
, oloc
);
5506 if (mo
.u
.loc
!= oloc
)
5507 loc
= gen_rtx_CONCAT (GET_MODE (mo
.u
.loc
), loc
, mo
.u
.loc
);
5509 /* The loc of a MO_VAL_SET may have various forms:
5511 (concat val dst): dst now holds val
5513 (concat val (set dst src)): dst now holds val, copied from src
5515 (concat (concat val dstv) dst): dst now holds val; dstv is dst
5516 after replacing mems and non-top-level regs with values.
5518 (concat (concat val dstv) (set dst src)): dst now holds val,
5519 copied from src. dstv is a value-based representation of dst, if
5520 it differs from dst. If resolution is needed, src is a REG, and
5521 its mode is the same as that of val.
5523 (concat (concat val (set dstv srcv)) (set dst src)): src
5524 copied to dst, holding val. dstv and srcv are value-based
5525 representations of dst and src, respectively.
5529 if (GET_CODE (PATTERN (cui
->insn
)) != COND_EXEC
)
5531 reverse
= reverse_op (v
->val_rtx
, expr
);
5534 loc
= gen_rtx_CONCAT (GET_MODE (mo
.u
.loc
), loc
, reverse
);
5535 VAL_EXPR_HAS_REVERSE (loc
) = 1;
5542 VAL_HOLDS_TRACK_EXPR (loc
) = 1;
5545 VAL_NEEDS_RESOLUTION (loc
) = resolve
;
5548 if (mo
.type
== MO_CLOBBER
)
5549 VAL_EXPR_IS_CLOBBERED (loc
) = 1;
5550 if (mo
.type
== MO_COPY
)
5551 VAL_EXPR_IS_COPIED (loc
) = 1;
5553 mo
.type
= MO_VAL_SET
;
5556 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5557 log_op_type (mo
.u
.loc
, cui
->bb
, cui
->insn
, mo
.type
, dump_file
);
5558 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &mo
);
5561 /* Callback for cselib_record_sets_hook, that records as micro
5562 operations uses and stores in an insn after cselib_record_sets has
5563 analyzed the sets in an insn, but before it modifies the stored
5564 values in the internal tables, unless cselib_record_sets doesn't
5565 call it directly (perhaps because we're not doing cselib in the
5566 first place, in which case sets and n_sets will be 0). */
5569 add_with_sets (rtx insn
, struct cselib_set
*sets
, int n_sets
)
5571 basic_block bb
= BLOCK_FOR_INSN (insn
);
5573 struct count_use_info cui
;
5574 micro_operation
*mos
;
5576 cselib_hook_called
= true;
5581 cui
.n_sets
= n_sets
;
5583 n1
= VEC_length (micro_operation
, VTI (bb
)->mos
);
5584 cui
.store_p
= false;
5585 note_uses (&PATTERN (insn
), add_uses_1
, &cui
);
5586 n2
= VEC_length (micro_operation
, VTI (bb
)->mos
) - 1;
5587 mos
= VEC_address (micro_operation
, VTI (bb
)->mos
);
5589 /* Order the MO_USEs to be before MO_USE_NO_VARs and MO_VAL_USE, and
5593 while (n1
< n2
&& mos
[n1
].type
== MO_USE
)
5595 while (n1
< n2
&& mos
[n2
].type
!= MO_USE
)
5607 n2
= VEC_length (micro_operation
, VTI (bb
)->mos
) - 1;
5610 while (n1
< n2
&& mos
[n1
].type
!= MO_VAL_LOC
)
5612 while (n1
< n2
&& mos
[n2
].type
== MO_VAL_LOC
)
5630 mo
.u
.loc
= NULL_RTX
;
5632 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5633 log_op_type (PATTERN (insn
), bb
, insn
, mo
.type
, dump_file
);
5634 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &mo
);
5637 n1
= VEC_length (micro_operation
, VTI (bb
)->mos
);
5638 /* This will record NEXT_INSN (insn), such that we can
5639 insert notes before it without worrying about any
5640 notes that MO_USEs might emit after the insn. */
5642 note_stores (PATTERN (insn
), add_stores
, &cui
);
5643 n2
= VEC_length (micro_operation
, VTI (bb
)->mos
) - 1;
5644 mos
= VEC_address (micro_operation
, VTI (bb
)->mos
);
5646 /* Order the MO_VAL_USEs first (note_stores does nothing
5647 on DEBUG_INSNs, so there are no MO_VAL_LOCs from this
5648 insn), then MO_CLOBBERs, then MO_SET/MO_COPY/MO_VAL_SET. */
5651 while (n1
< n2
&& mos
[n1
].type
== MO_VAL_USE
)
5653 while (n1
< n2
&& mos
[n2
].type
!= MO_VAL_USE
)
5665 n2
= VEC_length (micro_operation
, VTI (bb
)->mos
) - 1;
5668 while (n1
< n2
&& mos
[n1
].type
== MO_CLOBBER
)
5670 while (n1
< n2
&& mos
[n2
].type
!= MO_CLOBBER
)
5683 static enum var_init_status
5684 find_src_status (dataflow_set
*in
, rtx src
)
5686 tree decl
= NULL_TREE
;
5687 enum var_init_status status
= VAR_INIT_STATUS_UNINITIALIZED
;
5689 if (! flag_var_tracking_uninit
)
5690 status
= VAR_INIT_STATUS_INITIALIZED
;
5692 if (src
&& REG_P (src
))
5693 decl
= var_debug_decl (REG_EXPR (src
));
5694 else if (src
&& MEM_P (src
))
5695 decl
= var_debug_decl (MEM_EXPR (src
));
5698 status
= get_init_value (in
, src
, dv_from_decl (decl
));
5703 /* SRC is the source of an assignment. Use SET to try to find what
5704 was ultimately assigned to SRC. Return that value if known,
5705 otherwise return SRC itself. */
5708 find_src_set_src (dataflow_set
*set
, rtx src
)
5710 tree decl
= NULL_TREE
; /* The variable being copied around. */
5711 rtx set_src
= NULL_RTX
; /* The value for "decl" stored in "src". */
5713 location_chain nextp
;
5717 if (src
&& REG_P (src
))
5718 decl
= var_debug_decl (REG_EXPR (src
));
5719 else if (src
&& MEM_P (src
))
5720 decl
= var_debug_decl (MEM_EXPR (src
));
5724 decl_or_value dv
= dv_from_decl (decl
);
5726 var
= shared_hash_find (set
->vars
, dv
);
5730 for (i
= 0; i
< var
->n_var_parts
&& !found
; i
++)
5731 for (nextp
= var
->var_part
[i
].loc_chain
; nextp
&& !found
;
5732 nextp
= nextp
->next
)
5733 if (rtx_equal_p (nextp
->loc
, src
))
5735 set_src
= nextp
->set_src
;
5745 /* Compute the changes of variable locations in the basic block BB. */
5748 compute_bb_dataflow (basic_block bb
)
5751 micro_operation
*mo
;
5753 dataflow_set old_out
;
5754 dataflow_set
*in
= &VTI (bb
)->in
;
5755 dataflow_set
*out
= &VTI (bb
)->out
;
5757 dataflow_set_init (&old_out
);
5758 dataflow_set_copy (&old_out
, out
);
5759 dataflow_set_copy (out
, in
);
5761 FOR_EACH_VEC_ELT (micro_operation
, VTI (bb
)->mos
, i
, mo
)
5763 rtx insn
= mo
->insn
;
5768 dataflow_set_clear_at_call (out
);
5773 rtx loc
= mo
->u
.loc
;
5776 var_reg_set (out
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
5777 else if (MEM_P (loc
))
5778 var_mem_set (out
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
5784 rtx loc
= mo
->u
.loc
;
5788 if (GET_CODE (loc
) == CONCAT
)
5790 val
= XEXP (loc
, 0);
5791 vloc
= XEXP (loc
, 1);
5799 var
= PAT_VAR_LOCATION_DECL (vloc
);
5801 clobber_variable_part (out
, NULL_RTX
,
5802 dv_from_decl (var
), 0, NULL_RTX
);
5805 if (VAL_NEEDS_RESOLUTION (loc
))
5806 val_resolve (out
, val
, PAT_VAR_LOCATION_LOC (vloc
), insn
);
5807 set_variable_part (out
, val
, dv_from_decl (var
), 0,
5808 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
5811 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc
)))
5812 set_variable_part (out
, PAT_VAR_LOCATION_LOC (vloc
),
5813 dv_from_decl (var
), 0,
5814 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
5821 rtx loc
= mo
->u
.loc
;
5822 rtx val
, vloc
, uloc
;
5824 vloc
= uloc
= XEXP (loc
, 1);
5825 val
= XEXP (loc
, 0);
5827 if (GET_CODE (val
) == CONCAT
)
5829 uloc
= XEXP (val
, 1);
5830 val
= XEXP (val
, 0);
5833 if (VAL_NEEDS_RESOLUTION (loc
))
5834 val_resolve (out
, val
, vloc
, insn
);
5836 val_store (out
, val
, uloc
, insn
, false);
5838 if (VAL_HOLDS_TRACK_EXPR (loc
))
5840 if (GET_CODE (uloc
) == REG
)
5841 var_reg_set (out
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
5843 else if (GET_CODE (uloc
) == MEM
)
5844 var_mem_set (out
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
5852 rtx loc
= mo
->u
.loc
;
5853 rtx val
, vloc
, uloc
, reverse
= NULL_RTX
;
5856 if (VAL_EXPR_HAS_REVERSE (loc
))
5858 reverse
= XEXP (loc
, 1);
5859 vloc
= XEXP (loc
, 0);
5861 uloc
= XEXP (vloc
, 1);
5862 val
= XEXP (vloc
, 0);
5865 if (GET_CODE (val
) == CONCAT
)
5867 vloc
= XEXP (val
, 1);
5868 val
= XEXP (val
, 0);
5871 if (GET_CODE (vloc
) == SET
)
5873 rtx vsrc
= SET_SRC (vloc
);
5875 gcc_assert (val
!= vsrc
);
5876 gcc_assert (vloc
== uloc
|| VAL_NEEDS_RESOLUTION (loc
));
5878 vloc
= SET_DEST (vloc
);
5880 if (VAL_NEEDS_RESOLUTION (loc
))
5881 val_resolve (out
, val
, vsrc
, insn
);
5883 else if (VAL_NEEDS_RESOLUTION (loc
))
5885 gcc_assert (GET_CODE (uloc
) == SET
5886 && GET_CODE (SET_SRC (uloc
)) == REG
);
5887 val_resolve (out
, val
, SET_SRC (uloc
), insn
);
5890 if (VAL_HOLDS_TRACK_EXPR (loc
))
5892 if (VAL_EXPR_IS_CLOBBERED (loc
))
5895 var_reg_delete (out
, uloc
, true);
5896 else if (MEM_P (uloc
))
5897 var_mem_delete (out
, uloc
, true);
5901 bool copied_p
= VAL_EXPR_IS_COPIED (loc
);
5903 enum var_init_status status
= VAR_INIT_STATUS_INITIALIZED
;
5905 if (GET_CODE (uloc
) == SET
)
5907 set_src
= SET_SRC (uloc
);
5908 uloc
= SET_DEST (uloc
);
5913 if (flag_var_tracking_uninit
)
5915 status
= find_src_status (in
, set_src
);
5917 if (status
== VAR_INIT_STATUS_UNKNOWN
)
5918 status
= find_src_status (out
, set_src
);
5921 set_src
= find_src_set_src (in
, set_src
);
5925 var_reg_delete_and_set (out
, uloc
, !copied_p
,
5927 else if (MEM_P (uloc
))
5928 var_mem_delete_and_set (out
, uloc
, !copied_p
,
5932 else if (REG_P (uloc
))
5933 var_regno_delete (out
, REGNO (uloc
));
5935 val_store (out
, val
, vloc
, insn
, true);
5938 val_store (out
, XEXP (reverse
, 0), XEXP (reverse
, 1),
5945 rtx loc
= mo
->u
.loc
;
5948 if (GET_CODE (loc
) == SET
)
5950 set_src
= SET_SRC (loc
);
5951 loc
= SET_DEST (loc
);
5955 var_reg_delete_and_set (out
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
5957 else if (MEM_P (loc
))
5958 var_mem_delete_and_set (out
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
5965 rtx loc
= mo
->u
.loc
;
5966 enum var_init_status src_status
;
5969 if (GET_CODE (loc
) == SET
)
5971 set_src
= SET_SRC (loc
);
5972 loc
= SET_DEST (loc
);
5975 if (! flag_var_tracking_uninit
)
5976 src_status
= VAR_INIT_STATUS_INITIALIZED
;
5979 src_status
= find_src_status (in
, set_src
);
5981 if (src_status
== VAR_INIT_STATUS_UNKNOWN
)
5982 src_status
= find_src_status (out
, set_src
);
5985 set_src
= find_src_set_src (in
, set_src
);
5988 var_reg_delete_and_set (out
, loc
, false, src_status
, set_src
);
5989 else if (MEM_P (loc
))
5990 var_mem_delete_and_set (out
, loc
, false, src_status
, set_src
);
5996 rtx loc
= mo
->u
.loc
;
5999 var_reg_delete (out
, loc
, false);
6000 else if (MEM_P (loc
))
6001 var_mem_delete (out
, loc
, false);
6007 rtx loc
= mo
->u
.loc
;
6010 var_reg_delete (out
, loc
, true);
6011 else if (MEM_P (loc
))
6012 var_mem_delete (out
, loc
, true);
6017 out
->stack_adjust
+= mo
->u
.adjust
;
6022 if (MAY_HAVE_DEBUG_INSNS
)
6024 dataflow_set_equiv_regs (out
);
6025 htab_traverse (shared_hash_htab (out
->vars
), canonicalize_values_mark
,
6027 htab_traverse (shared_hash_htab (out
->vars
), canonicalize_values_star
,
6030 htab_traverse (shared_hash_htab (out
->vars
),
6031 canonicalize_loc_order_check
, out
);
6034 changed
= dataflow_set_different (&old_out
, out
);
6035 dataflow_set_destroy (&old_out
);
6039 /* Find the locations of variables in the whole function. */
6042 vt_find_locations (void)
6044 fibheap_t worklist
, pending
, fibheap_swap
;
6045 sbitmap visited
, in_worklist
, in_pending
, sbitmap_swap
;
6052 int htabmax
= PARAM_VALUE (PARAM_MAX_VARTRACK_SIZE
);
6053 bool success
= true;
6055 timevar_push (TV_VAR_TRACKING_DATAFLOW
);
6056 /* Compute reverse completion order of depth first search of the CFG
6057 so that the data-flow runs faster. */
6058 rc_order
= XNEWVEC (int, n_basic_blocks
- NUM_FIXED_BLOCKS
);
6059 bb_order
= XNEWVEC (int, last_basic_block
);
6060 pre_and_rev_post_order_compute (NULL
, rc_order
, false);
6061 for (i
= 0; i
< n_basic_blocks
- NUM_FIXED_BLOCKS
; i
++)
6062 bb_order
[rc_order
[i
]] = i
;
6065 worklist
= fibheap_new ();
6066 pending
= fibheap_new ();
6067 visited
= sbitmap_alloc (last_basic_block
);
6068 in_worklist
= sbitmap_alloc (last_basic_block
);
6069 in_pending
= sbitmap_alloc (last_basic_block
);
6070 sbitmap_zero (in_worklist
);
6073 fibheap_insert (pending
, bb_order
[bb
->index
], bb
);
6074 sbitmap_ones (in_pending
);
6076 while (success
&& !fibheap_empty (pending
))
6078 fibheap_swap
= pending
;
6080 worklist
= fibheap_swap
;
6081 sbitmap_swap
= in_pending
;
6082 in_pending
= in_worklist
;
6083 in_worklist
= sbitmap_swap
;
6085 sbitmap_zero (visited
);
6087 while (!fibheap_empty (worklist
))
6089 bb
= (basic_block
) fibheap_extract_min (worklist
);
6090 RESET_BIT (in_worklist
, bb
->index
);
6091 gcc_assert (!TEST_BIT (visited
, bb
->index
));
6092 if (!TEST_BIT (visited
, bb
->index
))
6096 int oldinsz
, oldoutsz
;
6098 SET_BIT (visited
, bb
->index
);
6100 if (VTI (bb
)->in
.vars
)
6103 -= (htab_size (shared_hash_htab (VTI (bb
)->in
.vars
))
6104 + htab_size (shared_hash_htab (VTI (bb
)->out
.vars
)));
6106 = htab_elements (shared_hash_htab (VTI (bb
)->in
.vars
));
6108 = htab_elements (shared_hash_htab (VTI (bb
)->out
.vars
));
6111 oldinsz
= oldoutsz
= 0;
6113 if (MAY_HAVE_DEBUG_INSNS
)
6115 dataflow_set
*in
= &VTI (bb
)->in
, *first_out
= NULL
;
6116 bool first
= true, adjust
= false;
6118 /* Calculate the IN set as the intersection of
6119 predecessor OUT sets. */
6121 dataflow_set_clear (in
);
6122 dst_can_be_shared
= true;
6124 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6125 if (!VTI (e
->src
)->flooded
)
6126 gcc_assert (bb_order
[bb
->index
]
6127 <= bb_order
[e
->src
->index
]);
6130 dataflow_set_copy (in
, &VTI (e
->src
)->out
);
6131 first_out
= &VTI (e
->src
)->out
;
6136 dataflow_set_merge (in
, &VTI (e
->src
)->out
);
6142 dataflow_post_merge_adjust (in
, &VTI (bb
)->permp
);
6144 /* Merge and merge_adjust should keep entries in
6146 htab_traverse (shared_hash_htab (in
->vars
),
6147 canonicalize_loc_order_check
,
6150 if (dst_can_be_shared
)
6152 shared_hash_destroy (in
->vars
);
6153 in
->vars
= shared_hash_copy (first_out
->vars
);
6157 VTI (bb
)->flooded
= true;
6161 /* Calculate the IN set as union of predecessor OUT sets. */
6162 dataflow_set_clear (&VTI (bb
)->in
);
6163 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6164 dataflow_set_union (&VTI (bb
)->in
, &VTI (e
->src
)->out
);
6167 changed
= compute_bb_dataflow (bb
);
6168 htabsz
+= (htab_size (shared_hash_htab (VTI (bb
)->in
.vars
))
6169 + htab_size (shared_hash_htab (VTI (bb
)->out
.vars
)));
6171 if (htabmax
&& htabsz
> htabmax
)
6173 if (MAY_HAVE_DEBUG_INSNS
)
6174 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
6175 "variable tracking size limit exceeded with "
6176 "-fvar-tracking-assignments, retrying without");
6178 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
6179 "variable tracking size limit exceeded");
6186 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6188 if (e
->dest
== EXIT_BLOCK_PTR
)
6191 if (TEST_BIT (visited
, e
->dest
->index
))
6193 if (!TEST_BIT (in_pending
, e
->dest
->index
))
6195 /* Send E->DEST to next round. */
6196 SET_BIT (in_pending
, e
->dest
->index
);
6197 fibheap_insert (pending
,
6198 bb_order
[e
->dest
->index
],
6202 else if (!TEST_BIT (in_worklist
, e
->dest
->index
))
6204 /* Add E->DEST to current round. */
6205 SET_BIT (in_worklist
, e
->dest
->index
);
6206 fibheap_insert (worklist
, bb_order
[e
->dest
->index
],
6214 "BB %i: in %i (was %i), out %i (was %i), rem %i + %i, tsz %i\n",
6216 (int)htab_elements (shared_hash_htab (VTI (bb
)->in
.vars
)),
6218 (int)htab_elements (shared_hash_htab (VTI (bb
)->out
.vars
)),
6220 (int)worklist
->nodes
, (int)pending
->nodes
, htabsz
);
6222 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
6224 fprintf (dump_file
, "BB %i IN:\n", bb
->index
);
6225 dump_dataflow_set (&VTI (bb
)->in
);
6226 fprintf (dump_file
, "BB %i OUT:\n", bb
->index
);
6227 dump_dataflow_set (&VTI (bb
)->out
);
6233 if (success
&& MAY_HAVE_DEBUG_INSNS
)
6235 gcc_assert (VTI (bb
)->flooded
);
6238 fibheap_delete (worklist
);
6239 fibheap_delete (pending
);
6240 sbitmap_free (visited
);
6241 sbitmap_free (in_worklist
);
6242 sbitmap_free (in_pending
);
6244 timevar_pop (TV_VAR_TRACKING_DATAFLOW
);
6248 /* Print the content of the LIST to dump file. */
6251 dump_attrs_list (attrs list
)
6253 for (; list
; list
= list
->next
)
6255 if (dv_is_decl_p (list
->dv
))
6256 print_mem_expr (dump_file
, dv_as_decl (list
->dv
));
6258 print_rtl_single (dump_file
, dv_as_value (list
->dv
));
6259 fprintf (dump_file
, "+" HOST_WIDE_INT_PRINT_DEC
, list
->offset
);
6261 fprintf (dump_file
, "\n");
6264 /* Print the information about variable *SLOT to dump file. */
6267 dump_var_slot (void **slot
, void *data ATTRIBUTE_UNUSED
)
6269 variable var
= (variable
) *slot
;
6273 /* Continue traversing the hash table. */
6277 /* Print the information about variable VAR to dump file. */
6280 dump_var (variable var
)
6283 location_chain node
;
6285 if (dv_is_decl_p (var
->dv
))
6287 const_tree decl
= dv_as_decl (var
->dv
);
6289 if (DECL_NAME (decl
))
6291 fprintf (dump_file
, " name: %s",
6292 IDENTIFIER_POINTER (DECL_NAME (decl
)));
6293 if (dump_flags
& TDF_UID
)
6294 fprintf (dump_file
, "D.%u", DECL_UID (decl
));
6296 else if (TREE_CODE (decl
) == DEBUG_EXPR_DECL
)
6297 fprintf (dump_file
, " name: D#%u", DEBUG_TEMP_UID (decl
));
6299 fprintf (dump_file
, " name: D.%u", DECL_UID (decl
));
6300 fprintf (dump_file
, "\n");
6304 fputc (' ', dump_file
);
6305 print_rtl_single (dump_file
, dv_as_value (var
->dv
));
6308 for (i
= 0; i
< var
->n_var_parts
; i
++)
6310 fprintf (dump_file
, " offset %ld\n",
6311 (long) var
->var_part
[i
].offset
);
6312 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
6314 fprintf (dump_file
, " ");
6315 if (node
->init
== VAR_INIT_STATUS_UNINITIALIZED
)
6316 fprintf (dump_file
, "[uninit]");
6317 print_rtl_single (dump_file
, node
->loc
);
6322 /* Print the information about variables from hash table VARS to dump file. */
6325 dump_vars (htab_t vars
)
6327 if (htab_elements (vars
) > 0)
6329 fprintf (dump_file
, "Variables:\n");
6330 htab_traverse (vars
, dump_var_slot
, NULL
);
6334 /* Print the dataflow set SET to dump file. */
6337 dump_dataflow_set (dataflow_set
*set
)
6341 fprintf (dump_file
, "Stack adjustment: " HOST_WIDE_INT_PRINT_DEC
"\n",
6343 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
6347 fprintf (dump_file
, "Reg %d:", i
);
6348 dump_attrs_list (set
->regs
[i
]);
6351 dump_vars (shared_hash_htab (set
->vars
));
6352 fprintf (dump_file
, "\n");
6355 /* Print the IN and OUT sets for each basic block to dump file. */
6358 dump_dataflow_sets (void)
6364 fprintf (dump_file
, "\nBasic block %d:\n", bb
->index
);
6365 fprintf (dump_file
, "IN:\n");
6366 dump_dataflow_set (&VTI (bb
)->in
);
6367 fprintf (dump_file
, "OUT:\n");
6368 dump_dataflow_set (&VTI (bb
)->out
);
6372 /* Add variable VAR to the hash table of changed variables and
6373 if it has no locations delete it from SET's hash table. */
6376 variable_was_changed (variable var
, dataflow_set
*set
)
6378 hashval_t hash
= dv_htab_hash (var
->dv
);
6383 bool old_cur_loc_changed
= false;
6385 /* Remember this decl or VALUE has been added to changed_variables. */
6386 set_dv_changed (var
->dv
, true);
6388 slot
= htab_find_slot_with_hash (changed_variables
,
6394 variable old_var
= (variable
) *slot
;
6395 gcc_assert (old_var
->in_changed_variables
);
6396 old_var
->in_changed_variables
= false;
6397 old_cur_loc_changed
= old_var
->cur_loc_changed
;
6398 variable_htab_free (*slot
);
6400 if (set
&& var
->n_var_parts
== 0)
6404 empty_var
= (variable
) pool_alloc (dv_pool (var
->dv
));
6405 empty_var
->dv
= var
->dv
;
6406 empty_var
->refcount
= 1;
6407 empty_var
->n_var_parts
= 0;
6408 empty_var
->cur_loc_changed
= true;
6409 empty_var
->in_changed_variables
= true;
6416 var
->in_changed_variables
= true;
6417 /* If within processing one uop a variable is deleted
6418 and then readded, we need to assume it has changed. */
6419 if (old_cur_loc_changed
)
6420 var
->cur_loc_changed
= true;
6427 if (var
->n_var_parts
== 0)
6432 slot
= shared_hash_find_slot_noinsert (set
->vars
, var
->dv
);
6435 if (shared_hash_shared (set
->vars
))
6436 slot
= shared_hash_find_slot_unshare (&set
->vars
, var
->dv
,
6438 htab_clear_slot (shared_hash_htab (set
->vars
), slot
);
6444 /* Look for the index in VAR->var_part corresponding to OFFSET.
6445 Return -1 if not found. If INSERTION_POINT is non-NULL, the
6446 referenced int will be set to the index that the part has or should
6447 have, if it should be inserted. */
6450 find_variable_location_part (variable var
, HOST_WIDE_INT offset
,
6451 int *insertion_point
)
6455 /* Find the location part. */
6457 high
= var
->n_var_parts
;
6460 pos
= (low
+ high
) / 2;
6461 if (var
->var_part
[pos
].offset
< offset
)
6468 if (insertion_point
)
6469 *insertion_point
= pos
;
6471 if (pos
< var
->n_var_parts
&& var
->var_part
[pos
].offset
== offset
)
6478 set_slot_part (dataflow_set
*set
, rtx loc
, void **slot
,
6479 decl_or_value dv
, HOST_WIDE_INT offset
,
6480 enum var_init_status initialized
, rtx set_src
)
6483 location_chain node
, next
;
6484 location_chain
*nextp
;
6486 bool onepart
= dv_onepart_p (dv
);
6488 gcc_assert (offset
== 0 || !onepart
);
6489 gcc_assert (loc
!= dv_as_opaque (dv
));
6491 var
= (variable
) *slot
;
6493 if (! flag_var_tracking_uninit
)
6494 initialized
= VAR_INIT_STATUS_INITIALIZED
;
6498 /* Create new variable information. */
6499 var
= (variable
) pool_alloc (dv_pool (dv
));
6502 var
->n_var_parts
= 1;
6503 var
->cur_loc_changed
= false;
6504 var
->in_changed_variables
= false;
6505 var
->var_part
[0].offset
= offset
;
6506 var
->var_part
[0].loc_chain
= NULL
;
6507 var
->var_part
[0].cur_loc
= NULL
;
6510 nextp
= &var
->var_part
[0].loc_chain
;
6516 gcc_assert (dv_as_opaque (var
->dv
) == dv_as_opaque (dv
));
6520 if (GET_CODE (loc
) == VALUE
)
6522 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
6523 nextp
= &node
->next
)
6524 if (GET_CODE (node
->loc
) == VALUE
)
6526 if (node
->loc
== loc
)
6531 if (canon_value_cmp (node
->loc
, loc
))
6539 else if (REG_P (node
->loc
) || MEM_P (node
->loc
))
6547 else if (REG_P (loc
))
6549 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
6550 nextp
= &node
->next
)
6551 if (REG_P (node
->loc
))
6553 if (REGNO (node
->loc
) < REGNO (loc
))
6557 if (REGNO (node
->loc
) == REGNO (loc
))
6570 else if (MEM_P (loc
))
6572 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
6573 nextp
= &node
->next
)
6574 if (REG_P (node
->loc
))
6576 else if (MEM_P (node
->loc
))
6578 if ((r
= loc_cmp (XEXP (node
->loc
, 0), XEXP (loc
, 0))) >= 0)
6590 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
6591 nextp
= &node
->next
)
6592 if ((r
= loc_cmp (node
->loc
, loc
)) >= 0)
6600 if (shared_var_p (var
, set
->vars
))
6602 slot
= unshare_variable (set
, slot
, var
, initialized
);
6603 var
= (variable
)*slot
;
6604 for (nextp
= &var
->var_part
[0].loc_chain
; c
;
6605 nextp
= &(*nextp
)->next
)
6607 gcc_assert ((!node
&& !*nextp
) || node
->loc
== (*nextp
)->loc
);
6614 gcc_assert (dv_as_decl (var
->dv
) == dv_as_decl (dv
));
6616 pos
= find_variable_location_part (var
, offset
, &inspos
);
6620 node
= var
->var_part
[pos
].loc_chain
;
6623 && ((REG_P (node
->loc
) && REG_P (loc
)
6624 && REGNO (node
->loc
) == REGNO (loc
))
6625 || rtx_equal_p (node
->loc
, loc
)))
6627 /* LOC is in the beginning of the chain so we have nothing
6629 if (node
->init
< initialized
)
6630 node
->init
= initialized
;
6631 if (set_src
!= NULL
)
6632 node
->set_src
= set_src
;
6638 /* We have to make a copy of a shared variable. */
6639 if (shared_var_p (var
, set
->vars
))
6641 slot
= unshare_variable (set
, slot
, var
, initialized
);
6642 var
= (variable
)*slot
;
6648 /* We have not found the location part, new one will be created. */
6650 /* We have to make a copy of the shared variable. */
6651 if (shared_var_p (var
, set
->vars
))
6653 slot
= unshare_variable (set
, slot
, var
, initialized
);
6654 var
= (variable
)*slot
;
6657 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
6658 thus there are at most MAX_VAR_PARTS different offsets. */
6659 gcc_assert (var
->n_var_parts
< MAX_VAR_PARTS
6660 && (!var
->n_var_parts
|| !dv_onepart_p (var
->dv
)));
6662 /* We have to move the elements of array starting at index
6663 inspos to the next position. */
6664 for (pos
= var
->n_var_parts
; pos
> inspos
; pos
--)
6665 var
->var_part
[pos
] = var
->var_part
[pos
- 1];
6668 var
->var_part
[pos
].offset
= offset
;
6669 var
->var_part
[pos
].loc_chain
= NULL
;
6670 var
->var_part
[pos
].cur_loc
= NULL
;
6673 /* Delete the location from the list. */
6674 nextp
= &var
->var_part
[pos
].loc_chain
;
6675 for (node
= var
->var_part
[pos
].loc_chain
; node
; node
= next
)
6678 if ((REG_P (node
->loc
) && REG_P (loc
)
6679 && REGNO (node
->loc
) == REGNO (loc
))
6680 || rtx_equal_p (node
->loc
, loc
))
6682 /* Save these values, to assign to the new node, before
6683 deleting this one. */
6684 if (node
->init
> initialized
)
6685 initialized
= node
->init
;
6686 if (node
->set_src
!= NULL
&& set_src
== NULL
)
6687 set_src
= node
->set_src
;
6688 if (var
->var_part
[pos
].cur_loc
== node
->loc
)
6690 var
->var_part
[pos
].cur_loc
= NULL
;
6691 var
->cur_loc_changed
= true;
6693 pool_free (loc_chain_pool
, node
);
6698 nextp
= &node
->next
;
6701 nextp
= &var
->var_part
[pos
].loc_chain
;
6704 /* Add the location to the beginning. */
6705 node
= (location_chain
) pool_alloc (loc_chain_pool
);
6707 node
->init
= initialized
;
6708 node
->set_src
= set_src
;
6709 node
->next
= *nextp
;
6712 if (onepart
&& emit_notes
)
6713 add_value_chains (var
->dv
, loc
);
6715 /* If no location was emitted do so. */
6716 if (var
->var_part
[pos
].cur_loc
== NULL
)
6717 variable_was_changed (var
, set
);
6722 /* Set the part of variable's location in the dataflow set SET. The
6723 variable part is specified by variable's declaration in DV and
6724 offset OFFSET and the part's location by LOC. IOPT should be
6725 NO_INSERT if the variable is known to be in SET already and the
6726 variable hash table must not be resized, and INSERT otherwise. */
6729 set_variable_part (dataflow_set
*set
, rtx loc
,
6730 decl_or_value dv
, HOST_WIDE_INT offset
,
6731 enum var_init_status initialized
, rtx set_src
,
6732 enum insert_option iopt
)
6736 if (iopt
== NO_INSERT
)
6737 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
6740 slot
= shared_hash_find_slot (set
->vars
, dv
);
6742 slot
= shared_hash_find_slot_unshare (&set
->vars
, dv
, iopt
);
6744 slot
= set_slot_part (set
, loc
, slot
, dv
, offset
, initialized
, set_src
);
6747 /* Remove all recorded register locations for the given variable part
6748 from dataflow set SET, except for those that are identical to loc.
6749 The variable part is specified by variable's declaration or value
6750 DV and offset OFFSET. */
6753 clobber_slot_part (dataflow_set
*set
, rtx loc
, void **slot
,
6754 HOST_WIDE_INT offset
, rtx set_src
)
6756 variable var
= (variable
) *slot
;
6757 int pos
= find_variable_location_part (var
, offset
, NULL
);
6761 location_chain node
, next
;
6763 /* Remove the register locations from the dataflow set. */
6764 next
= var
->var_part
[pos
].loc_chain
;
6765 for (node
= next
; node
; node
= next
)
6768 if (node
->loc
!= loc
6769 && (!flag_var_tracking_uninit
6772 || !rtx_equal_p (set_src
, node
->set_src
)))
6774 if (REG_P (node
->loc
))
6779 /* Remove the variable part from the register's
6780 list, but preserve any other variable parts
6781 that might be regarded as live in that same
6783 anextp
= &set
->regs
[REGNO (node
->loc
)];
6784 for (anode
= *anextp
; anode
; anode
= anext
)
6786 anext
= anode
->next
;
6787 if (dv_as_opaque (anode
->dv
) == dv_as_opaque (var
->dv
)
6788 && anode
->offset
== offset
)
6790 pool_free (attrs_pool
, anode
);
6794 anextp
= &anode
->next
;
6798 slot
= delete_slot_part (set
, node
->loc
, slot
, offset
);
6806 /* Remove all recorded register locations for the given variable part
6807 from dataflow set SET, except for those that are identical to loc.
6808 The variable part is specified by variable's declaration or value
6809 DV and offset OFFSET. */
6812 clobber_variable_part (dataflow_set
*set
, rtx loc
, decl_or_value dv
,
6813 HOST_WIDE_INT offset
, rtx set_src
)
6817 if (!dv_as_opaque (dv
)
6818 || (!dv_is_value_p (dv
) && ! DECL_P (dv_as_decl (dv
))))
6821 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
6825 slot
= clobber_slot_part (set
, loc
, slot
, offset
, set_src
);
6828 /* Delete the part of variable's location from dataflow set SET. The
6829 variable part is specified by its SET->vars slot SLOT and offset
6830 OFFSET and the part's location by LOC. */
6833 delete_slot_part (dataflow_set
*set
, rtx loc
, void **slot
,
6834 HOST_WIDE_INT offset
)
6836 variable var
= (variable
) *slot
;
6837 int pos
= find_variable_location_part (var
, offset
, NULL
);
6841 location_chain node
, next
;
6842 location_chain
*nextp
;
6845 if (shared_var_p (var
, set
->vars
))
6847 /* If the variable contains the location part we have to
6848 make a copy of the variable. */
6849 for (node
= var
->var_part
[pos
].loc_chain
; node
;
6852 if ((REG_P (node
->loc
) && REG_P (loc
)
6853 && REGNO (node
->loc
) == REGNO (loc
))
6854 || rtx_equal_p (node
->loc
, loc
))
6856 slot
= unshare_variable (set
, slot
, var
,
6857 VAR_INIT_STATUS_UNKNOWN
);
6858 var
= (variable
)*slot
;
6864 /* Delete the location part. */
6866 nextp
= &var
->var_part
[pos
].loc_chain
;
6867 for (node
= *nextp
; node
; node
= next
)
6870 if ((REG_P (node
->loc
) && REG_P (loc
)
6871 && REGNO (node
->loc
) == REGNO (loc
))
6872 || rtx_equal_p (node
->loc
, loc
))
6874 if (emit_notes
&& pos
== 0 && dv_onepart_p (var
->dv
))
6875 remove_value_chains (var
->dv
, node
->loc
);
6876 /* If we have deleted the location which was last emitted
6877 we have to emit new location so add the variable to set
6878 of changed variables. */
6879 if (var
->var_part
[pos
].cur_loc
== node
->loc
)
6882 var
->var_part
[pos
].cur_loc
= NULL
;
6883 var
->cur_loc_changed
= true;
6885 pool_free (loc_chain_pool
, node
);
6890 nextp
= &node
->next
;
6893 if (var
->var_part
[pos
].loc_chain
== NULL
)
6898 var
->cur_loc_changed
= true;
6899 while (pos
< var
->n_var_parts
)
6901 var
->var_part
[pos
] = var
->var_part
[pos
+ 1];
6906 variable_was_changed (var
, set
);
6912 /* Delete the part of variable's location from dataflow set SET. The
6913 variable part is specified by variable's declaration or value DV
6914 and offset OFFSET and the part's location by LOC. */
6917 delete_variable_part (dataflow_set
*set
, rtx loc
, decl_or_value dv
,
6918 HOST_WIDE_INT offset
)
6920 void **slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
6924 slot
= delete_slot_part (set
, loc
, slot
, offset
);
6927 /* Structure for passing some other parameters to function
6928 vt_expand_loc_callback. */
6929 struct expand_loc_callback_data
6931 /* The variables and values active at this point. */
6934 /* True in vt_expand_loc_dummy calls, no rtl should be allocated.
6935 Non-NULL should be returned if vt_expand_loc would return
6936 non-NULL in that case, NULL otherwise. cur_loc_changed should be
6937 computed and cur_loc recomputed when possible (but just once
6938 per emit_notes_for_changes call). */
6941 /* True if expansion of subexpressions had to recompute some
6942 VALUE/DEBUG_EXPR_DECL's cur_loc or used a VALUE/DEBUG_EXPR_DECL
6943 whose cur_loc has been already recomputed during current
6944 emit_notes_for_changes call. */
6945 bool cur_loc_changed
;
6948 /* Callback for cselib_expand_value, that looks for expressions
6949 holding the value in the var-tracking hash tables. Return X for
6950 standard processing, anything else is to be used as-is. */
6953 vt_expand_loc_callback (rtx x
, bitmap regs
, int max_depth
, void *data
)
6955 struct expand_loc_callback_data
*elcd
6956 = (struct expand_loc_callback_data
*) data
;
6957 bool dummy
= elcd
->dummy
;
6958 bool cur_loc_changed
= elcd
->cur_loc_changed
;
6962 rtx result
, subreg
, xret
;
6964 switch (GET_CODE (x
))
6969 if (cselib_dummy_expand_value_rtx_cb (SUBREG_REG (x
), regs
,
6971 vt_expand_loc_callback
, data
))
6977 subreg
= cselib_expand_value_rtx_cb (SUBREG_REG (x
), regs
,
6979 vt_expand_loc_callback
, data
);
6984 result
= simplify_gen_subreg (GET_MODE (x
), subreg
,
6985 GET_MODE (SUBREG_REG (x
)),
6988 /* Invalid SUBREGs are ok in debug info. ??? We could try
6989 alternate expansions for the VALUE as well. */
6991 result
= gen_rtx_raw_SUBREG (GET_MODE (x
), subreg
, SUBREG_BYTE (x
));
6996 dv
= dv_from_decl (DEBUG_EXPR_TREE_DECL (x
));
7001 dv
= dv_from_value (x
);
7009 if (VALUE_RECURSED_INTO (x
))
7012 var
= (variable
) htab_find_with_hash (elcd
->vars
, dv
, dv_htab_hash (dv
));
7016 if (dummy
&& dv_changed_p (dv
))
7017 elcd
->cur_loc_changed
= true;
7021 if (var
->n_var_parts
== 0)
7024 elcd
->cur_loc_changed
= true;
7028 gcc_assert (var
->n_var_parts
== 1);
7030 VALUE_RECURSED_INTO (x
) = true;
7033 if (var
->var_part
[0].cur_loc
)
7037 if (cselib_dummy_expand_value_rtx_cb (var
->var_part
[0].cur_loc
, regs
,
7039 vt_expand_loc_callback
, data
))
7043 result
= cselib_expand_value_rtx_cb (var
->var_part
[0].cur_loc
, regs
,
7045 vt_expand_loc_callback
, data
);
7047 set_dv_changed (dv
, false);
7049 if (!result
&& dv_changed_p (dv
))
7051 set_dv_changed (dv
, false);
7052 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
7053 if (loc
->loc
== var
->var_part
[0].cur_loc
)
7057 elcd
->cur_loc_changed
= cur_loc_changed
;
7058 if (cselib_dummy_expand_value_rtx_cb (loc
->loc
, regs
, max_depth
,
7059 vt_expand_loc_callback
,
7068 result
= cselib_expand_value_rtx_cb (loc
->loc
, regs
, max_depth
,
7069 vt_expand_loc_callback
, data
);
7073 if (dummy
&& (result
|| var
->var_part
[0].cur_loc
))
7074 var
->cur_loc_changed
= true;
7075 var
->var_part
[0].cur_loc
= loc
? loc
->loc
: NULL_RTX
;
7079 if (var
->cur_loc_changed
)
7080 elcd
->cur_loc_changed
= true;
7081 else if (!result
&& var
->var_part
[0].cur_loc
== NULL_RTX
)
7082 elcd
->cur_loc_changed
= cur_loc_changed
;
7085 VALUE_RECURSED_INTO (x
) = false;
7092 /* Expand VALUEs in LOC, using VARS as well as cselib's equivalence
7096 vt_expand_loc (rtx loc
, htab_t vars
)
7098 struct expand_loc_callback_data data
;
7100 if (!MAY_HAVE_DEBUG_INSNS
)
7105 data
.cur_loc_changed
= false;
7106 loc
= cselib_expand_value_rtx_cb (loc
, scratch_regs
, 8,
7107 vt_expand_loc_callback
, &data
);
7109 if (loc
&& MEM_P (loc
))
7110 loc
= targetm
.delegitimize_address (loc
);
7114 /* Like vt_expand_loc, but only return true/false (whether vt_expand_loc
7115 would succeed or not, without actually allocating new rtxes. */
7118 vt_expand_loc_dummy (rtx loc
, htab_t vars
, bool *pcur_loc_changed
)
7120 struct expand_loc_callback_data data
;
7123 gcc_assert (MAY_HAVE_DEBUG_INSNS
);
7126 data
.cur_loc_changed
= false;
7127 ret
= cselib_dummy_expand_value_rtx_cb (loc
, scratch_regs
, 8,
7128 vt_expand_loc_callback
, &data
);
7129 *pcur_loc_changed
= data
.cur_loc_changed
;
7133 #ifdef ENABLE_RTL_CHECKING
7134 /* Used to verify that cur_loc_changed updating is safe. */
7135 static struct pointer_map_t
*emitted_notes
;
7137 /* Strip REG_POINTER from REGs and MEM_POINTER from MEMs in order to
7138 avoid differences in commutative operand simplification. */
7140 strip_pointer_flags (rtx x
, const_rtx old_rtx ATTRIBUTE_UNUSED
,
7141 void *data ATTRIBUTE_UNUSED
)
7143 if (REG_P (x
) && REG_POINTER (x
))
7144 return gen_rtx_REG (GET_MODE (x
), REGNO (x
));
7145 if (MEM_P (x
) && MEM_POINTER (x
))
7146 return gen_rtx_MEM (GET_MODE (x
), XEXP (x
, 0));
7151 /* Emit the NOTE_INSN_VAR_LOCATION for variable *VARP. DATA contains
7152 additional parameters: WHERE specifies whether the note shall be emitted
7153 before or after instruction INSN. */
7156 emit_note_insn_var_location (void **varp
, void *data
)
7158 variable var
= (variable
) *varp
;
7159 rtx insn
= ((emit_note_data
*)data
)->insn
;
7160 enum emit_note_where where
= ((emit_note_data
*)data
)->where
;
7161 htab_t vars
= ((emit_note_data
*)data
)->vars
;
7163 int i
, j
, n_var_parts
;
7165 enum var_init_status initialized
= VAR_INIT_STATUS_UNINITIALIZED
;
7166 HOST_WIDE_INT last_limit
;
7167 tree type_size_unit
;
7168 HOST_WIDE_INT offsets
[MAX_VAR_PARTS
];
7169 rtx loc
[MAX_VAR_PARTS
];
7173 if (dv_is_value_p (var
->dv
))
7174 goto value_or_debug_decl
;
7176 decl
= dv_as_decl (var
->dv
);
7178 if (TREE_CODE (decl
) == DEBUG_EXPR_DECL
)
7179 goto value_or_debug_decl
;
7184 if (!MAY_HAVE_DEBUG_INSNS
)
7186 for (i
= 0; i
< var
->n_var_parts
; i
++)
7187 if (var
->var_part
[i
].cur_loc
== NULL
&& var
->var_part
[i
].loc_chain
)
7189 var
->var_part
[i
].cur_loc
= var
->var_part
[i
].loc_chain
->loc
;
7190 var
->cur_loc_changed
= true;
7192 if (var
->n_var_parts
== 0)
7193 var
->cur_loc_changed
= true;
7195 #ifndef ENABLE_RTL_CHECKING
7196 if (!var
->cur_loc_changed
)
7199 for (i
= 0; i
< var
->n_var_parts
; i
++)
7201 enum machine_mode mode
, wider_mode
;
7204 if (last_limit
< var
->var_part
[i
].offset
)
7209 else if (last_limit
> var
->var_part
[i
].offset
)
7211 offsets
[n_var_parts
] = var
->var_part
[i
].offset
;
7212 if (!var
->var_part
[i
].cur_loc
)
7217 loc2
= vt_expand_loc (var
->var_part
[i
].cur_loc
, vars
);
7223 loc
[n_var_parts
] = loc2
;
7224 mode
= GET_MODE (var
->var_part
[i
].cur_loc
);
7225 if (mode
== VOIDmode
&& dv_onepart_p (var
->dv
))
7226 mode
= DECL_MODE (decl
);
7227 for (lc
= var
->var_part
[i
].loc_chain
; lc
; lc
= lc
->next
)
7228 if (var
->var_part
[i
].cur_loc
== lc
->loc
)
7230 initialized
= lc
->init
;
7234 last_limit
= offsets
[n_var_parts
] + GET_MODE_SIZE (mode
);
7236 /* Attempt to merge adjacent registers or memory. */
7237 wider_mode
= GET_MODE_WIDER_MODE (mode
);
7238 for (j
= i
+ 1; j
< var
->n_var_parts
; j
++)
7239 if (last_limit
<= var
->var_part
[j
].offset
)
7241 if (j
< var
->n_var_parts
7242 && wider_mode
!= VOIDmode
7243 && var
->var_part
[j
].cur_loc
7244 && mode
== GET_MODE (var
->var_part
[j
].cur_loc
)
7245 && (REG_P (loc
[n_var_parts
]) || MEM_P (loc
[n_var_parts
]))
7246 && last_limit
== var
->var_part
[j
].offset
7247 && (loc2
= vt_expand_loc (var
->var_part
[j
].cur_loc
, vars
))
7248 && GET_CODE (loc
[n_var_parts
]) == GET_CODE (loc2
))
7252 if (REG_P (loc
[n_var_parts
])
7253 && hard_regno_nregs
[REGNO (loc
[n_var_parts
])][mode
] * 2
7254 == hard_regno_nregs
[REGNO (loc
[n_var_parts
])][wider_mode
]
7255 && end_hard_regno (mode
, REGNO (loc
[n_var_parts
]))
7258 if (! WORDS_BIG_ENDIAN
&& ! BYTES_BIG_ENDIAN
)
7259 new_loc
= simplify_subreg (wider_mode
, loc
[n_var_parts
],
7261 else if (WORDS_BIG_ENDIAN
&& BYTES_BIG_ENDIAN
)
7262 new_loc
= simplify_subreg (wider_mode
, loc2
, mode
, 0);
7265 if (!REG_P (new_loc
)
7266 || REGNO (new_loc
) != REGNO (loc
[n_var_parts
]))
7269 REG_ATTRS (new_loc
) = REG_ATTRS (loc
[n_var_parts
]);
7272 else if (MEM_P (loc
[n_var_parts
])
7273 && GET_CODE (XEXP (loc2
, 0)) == PLUS
7274 && REG_P (XEXP (XEXP (loc2
, 0), 0))
7275 && CONST_INT_P (XEXP (XEXP (loc2
, 0), 1)))
7277 if ((REG_P (XEXP (loc
[n_var_parts
], 0))
7278 && rtx_equal_p (XEXP (loc
[n_var_parts
], 0),
7279 XEXP (XEXP (loc2
, 0), 0))
7280 && INTVAL (XEXP (XEXP (loc2
, 0), 1))
7281 == GET_MODE_SIZE (mode
))
7282 || (GET_CODE (XEXP (loc
[n_var_parts
], 0)) == PLUS
7283 && CONST_INT_P (XEXP (XEXP (loc
[n_var_parts
], 0), 1))
7284 && rtx_equal_p (XEXP (XEXP (loc
[n_var_parts
], 0), 0),
7285 XEXP (XEXP (loc2
, 0), 0))
7286 && INTVAL (XEXP (XEXP (loc
[n_var_parts
], 0), 1))
7287 + GET_MODE_SIZE (mode
)
7288 == INTVAL (XEXP (XEXP (loc2
, 0), 1))))
7289 new_loc
= adjust_address_nv (loc
[n_var_parts
],
7295 loc
[n_var_parts
] = new_loc
;
7297 last_limit
= offsets
[n_var_parts
] + GET_MODE_SIZE (mode
);
7303 type_size_unit
= TYPE_SIZE_UNIT (TREE_TYPE (decl
));
7304 if ((unsigned HOST_WIDE_INT
) last_limit
< TREE_INT_CST_LOW (type_size_unit
))
7307 if (! flag_var_tracking_uninit
)
7308 initialized
= VAR_INIT_STATUS_INITIALIZED
;
7312 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
, NULL_RTX
,
7314 else if (n_var_parts
== 1)
7318 if (offsets
[0] || GET_CODE (loc
[0]) == PARALLEL
)
7319 expr_list
= gen_rtx_EXPR_LIST (VOIDmode
, loc
[0], GEN_INT (offsets
[0]));
7323 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
, expr_list
,
7326 else if (n_var_parts
)
7330 for (i
= 0; i
< n_var_parts
; i
++)
7332 = gen_rtx_EXPR_LIST (VOIDmode
, loc
[i
], GEN_INT (offsets
[i
]));
7334 parallel
= gen_rtx_PARALLEL (VOIDmode
,
7335 gen_rtvec_v (n_var_parts
, loc
));
7336 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
,
7337 parallel
, (int) initialized
);
7340 #ifdef ENABLE_RTL_CHECKING
7343 void **note_slot
= pointer_map_insert (emitted_notes
, decl
);
7344 rtx pnote
= (rtx
) *note_slot
;
7345 if (!var
->cur_loc_changed
&& (pnote
|| PAT_VAR_LOCATION_LOC (note_vl
)))
7349 old_vl
= PAT_VAR_LOCATION_LOC (pnote
);
7350 new_vl
= PAT_VAR_LOCATION_LOC (note_vl
);
7351 if (!rtx_equal_p (old_vl
, new_vl
))
7353 /* There might be differences caused by REG_POINTER
7354 differences. REG_POINTER affects
7355 swap_commutative_operands_p. */
7356 old_vl
= simplify_replace_fn_rtx (old_vl
, NULL_RTX
,
7357 strip_pointer_flags
, NULL
);
7358 new_vl
= simplify_replace_fn_rtx (new_vl
, NULL_RTX
,
7359 strip_pointer_flags
, NULL
);
7360 gcc_assert (rtx_equal_p (old_vl
, new_vl
));
7361 PAT_VAR_LOCATION_LOC (note_vl
) = new_vl
;
7364 *note_slot
= (void *) note_vl
;
7366 if (!var
->cur_loc_changed
)
7370 if (where
!= EMIT_NOTE_BEFORE_INSN
)
7372 note
= emit_note_after (NOTE_INSN_VAR_LOCATION
, insn
);
7373 if (where
== EMIT_NOTE_AFTER_CALL_INSN
)
7374 NOTE_DURING_CALL_P (note
) = true;
7377 note
= emit_note_before (NOTE_INSN_VAR_LOCATION
, insn
);
7378 NOTE_VAR_LOCATION (note
) = note_vl
;
7381 set_dv_changed (var
->dv
, false);
7382 var
->cur_loc_changed
= false;
7383 gcc_assert (var
->in_changed_variables
);
7384 var
->in_changed_variables
= false;
7385 htab_clear_slot (changed_variables
, varp
);
7387 /* Continue traversing the hash table. */
7390 value_or_debug_decl
:
7391 if (dv_changed_p (var
->dv
) && var
->n_var_parts
)
7394 bool cur_loc_changed
;
7396 if (var
->var_part
[0].cur_loc
7397 && vt_expand_loc_dummy (var
->var_part
[0].cur_loc
, vars
,
7400 for (lc
= var
->var_part
[0].loc_chain
; lc
; lc
= lc
->next
)
7401 if (lc
->loc
!= var
->var_part
[0].cur_loc
7402 && vt_expand_loc_dummy (lc
->loc
, vars
, &cur_loc_changed
))
7404 var
->var_part
[0].cur_loc
= lc
? lc
->loc
: NULL_RTX
;
7409 DEF_VEC_P (variable
);
7410 DEF_VEC_ALLOC_P (variable
, heap
);
7412 /* Stack of variable_def pointers that need processing with
7413 check_changed_vars_2. */
7415 static VEC (variable
, heap
) *changed_variables_stack
;
7417 /* VALUEs with no variables that need set_dv_changed (val, false)
7418 called before check_changed_vars_3. */
7420 static VEC (rtx
, heap
) *changed_values_stack
;
7422 /* Helper function for check_changed_vars_1 and check_changed_vars_2. */
7425 check_changed_vars_0 (decl_or_value dv
, htab_t htab
)
7428 = (value_chain
) htab_find_with_hash (value_chains
, dv
, dv_htab_hash (dv
));
7432 for (vc
= vc
->next
; vc
; vc
= vc
->next
)
7433 if (!dv_changed_p (vc
->dv
))
7436 = (variable
) htab_find_with_hash (htab
, vc
->dv
,
7437 dv_htab_hash (vc
->dv
));
7440 set_dv_changed (vc
->dv
, true);
7441 VEC_safe_push (variable
, heap
, changed_variables_stack
, vcvar
);
7443 else if (dv_is_value_p (vc
->dv
))
7445 set_dv_changed (vc
->dv
, true);
7446 VEC_safe_push (rtx
, heap
, changed_values_stack
,
7447 dv_as_value (vc
->dv
));
7448 check_changed_vars_0 (vc
->dv
, htab
);
7453 /* Populate changed_variables_stack with variable_def pointers
7454 that need variable_was_changed called on them. */
7457 check_changed_vars_1 (void **slot
, void *data
)
7459 variable var
= (variable
) *slot
;
7460 htab_t htab
= (htab_t
) data
;
7462 if (dv_is_value_p (var
->dv
)
7463 || TREE_CODE (dv_as_decl (var
->dv
)) == DEBUG_EXPR_DECL
)
7464 check_changed_vars_0 (var
->dv
, htab
);
7468 /* Add VAR to changed_variables and also for VALUEs add recursively
7469 all DVs that aren't in changed_variables yet but reference the
7470 VALUE from its loc_chain. */
7473 check_changed_vars_2 (variable var
, htab_t htab
)
7475 variable_was_changed (var
, NULL
);
7476 if (dv_is_value_p (var
->dv
)
7477 || TREE_CODE (dv_as_decl (var
->dv
)) == DEBUG_EXPR_DECL
)
7478 check_changed_vars_0 (var
->dv
, htab
);
7481 /* For each changed decl (except DEBUG_EXPR_DECLs) recompute
7482 cur_loc if needed (and cur_loc of all VALUEs and DEBUG_EXPR_DECLs
7483 it needs and are also in changed variables) and track whether
7484 cur_loc (or anything it uses to compute location) had to change
7485 during the current emit_notes_for_changes call. */
7488 check_changed_vars_3 (void **slot
, void *data
)
7490 variable var
= (variable
) *slot
;
7491 htab_t vars
= (htab_t
) data
;
7494 bool cur_loc_changed
;
7496 if (dv_is_value_p (var
->dv
)
7497 || TREE_CODE (dv_as_decl (var
->dv
)) == DEBUG_EXPR_DECL
)
7500 for (i
= 0; i
< var
->n_var_parts
; i
++)
7502 if (var
->var_part
[i
].cur_loc
7503 && vt_expand_loc_dummy (var
->var_part
[i
].cur_loc
, vars
,
7506 if (cur_loc_changed
)
7507 var
->cur_loc_changed
= true;
7510 for (lc
= var
->var_part
[i
].loc_chain
; lc
; lc
= lc
->next
)
7511 if (lc
->loc
!= var
->var_part
[i
].cur_loc
7512 && vt_expand_loc_dummy (lc
->loc
, vars
, &cur_loc_changed
))
7514 if (lc
|| var
->var_part
[i
].cur_loc
)
7515 var
->cur_loc_changed
= true;
7516 var
->var_part
[i
].cur_loc
= lc
? lc
->loc
: NULL_RTX
;
7518 if (var
->n_var_parts
== 0)
7519 var
->cur_loc_changed
= true;
7523 /* Emit NOTE_INSN_VAR_LOCATION note for each variable from a chain
7524 CHANGED_VARIABLES and delete this chain. WHERE specifies whether the notes
7525 shall be emitted before of after instruction INSN. */
7528 emit_notes_for_changes (rtx insn
, enum emit_note_where where
,
7531 emit_note_data data
;
7532 htab_t htab
= shared_hash_htab (vars
);
7534 if (!htab_elements (changed_variables
))
7537 if (MAY_HAVE_DEBUG_INSNS
)
7539 /* Unfortunately this has to be done in two steps, because
7540 we can't traverse a hashtab into which we are inserting
7541 through variable_was_changed. */
7542 htab_traverse (changed_variables
, check_changed_vars_1
, htab
);
7543 while (VEC_length (variable
, changed_variables_stack
) > 0)
7544 check_changed_vars_2 (VEC_pop (variable
, changed_variables_stack
),
7546 while (VEC_length (rtx
, changed_values_stack
) > 0)
7547 set_dv_changed (dv_from_value (VEC_pop (rtx
, changed_values_stack
)),
7549 htab_traverse (changed_variables
, check_changed_vars_3
, htab
);
7556 htab_traverse (changed_variables
, emit_note_insn_var_location
, &data
);
7559 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it differs from the
7560 same variable in hash table DATA or is not there at all. */
7563 emit_notes_for_differences_1 (void **slot
, void *data
)
7565 htab_t new_vars
= (htab_t
) data
;
7566 variable old_var
, new_var
;
7568 old_var
= (variable
) *slot
;
7569 new_var
= (variable
) htab_find_with_hash (new_vars
, old_var
->dv
,
7570 dv_htab_hash (old_var
->dv
));
7574 /* Variable has disappeared. */
7577 empty_var
= (variable
) pool_alloc (dv_pool (old_var
->dv
));
7578 empty_var
->dv
= old_var
->dv
;
7579 empty_var
->refcount
= 0;
7580 empty_var
->n_var_parts
= 0;
7581 empty_var
->cur_loc_changed
= false;
7582 empty_var
->in_changed_variables
= false;
7583 if (dv_onepart_p (old_var
->dv
))
7587 gcc_assert (old_var
->n_var_parts
== 1);
7588 for (lc
= old_var
->var_part
[0].loc_chain
; lc
; lc
= lc
->next
)
7589 remove_value_chains (old_var
->dv
, lc
->loc
);
7591 variable_was_changed (empty_var
, NULL
);
7592 /* Continue traversing the hash table. */
7595 if (variable_different_p (old_var
, new_var
))
7597 if (dv_onepart_p (old_var
->dv
))
7599 location_chain lc1
, lc2
;
7601 gcc_assert (old_var
->n_var_parts
== 1
7602 && new_var
->n_var_parts
== 1);
7603 lc1
= old_var
->var_part
[0].loc_chain
;
7604 lc2
= new_var
->var_part
[0].loc_chain
;
7607 && ((REG_P (lc1
->loc
) && REG_P (lc2
->loc
))
7608 || rtx_equal_p (lc1
->loc
, lc2
->loc
)))
7613 for (; lc2
; lc2
= lc2
->next
)
7614 add_value_chains (old_var
->dv
, lc2
->loc
);
7615 for (; lc1
; lc1
= lc1
->next
)
7616 remove_value_chains (old_var
->dv
, lc1
->loc
);
7618 variable_was_changed (new_var
, NULL
);
7620 /* Update cur_loc. */
7621 if (old_var
!= new_var
)
7624 for (i
= 0; i
< new_var
->n_var_parts
; i
++)
7626 new_var
->var_part
[i
].cur_loc
= NULL
;
7627 if (old_var
->n_var_parts
!= new_var
->n_var_parts
7628 || old_var
->var_part
[i
].offset
!= new_var
->var_part
[i
].offset
)
7629 new_var
->cur_loc_changed
= true;
7630 else if (old_var
->var_part
[i
].cur_loc
!= NULL
)
7633 rtx cur_loc
= old_var
->var_part
[i
].cur_loc
;
7635 for (lc
= new_var
->var_part
[i
].loc_chain
; lc
; lc
= lc
->next
)
7636 if (lc
->loc
== cur_loc
7637 || rtx_equal_p (cur_loc
, lc
->loc
))
7639 new_var
->var_part
[i
].cur_loc
= lc
->loc
;
7643 new_var
->cur_loc_changed
= true;
7648 /* Continue traversing the hash table. */
7652 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it is not in hash
7656 emit_notes_for_differences_2 (void **slot
, void *data
)
7658 htab_t old_vars
= (htab_t
) data
;
7659 variable old_var
, new_var
;
7661 new_var
= (variable
) *slot
;
7662 old_var
= (variable
) htab_find_with_hash (old_vars
, new_var
->dv
,
7663 dv_htab_hash (new_var
->dv
));
7667 /* Variable has appeared. */
7668 if (dv_onepart_p (new_var
->dv
))
7672 gcc_assert (new_var
->n_var_parts
== 1);
7673 for (lc
= new_var
->var_part
[0].loc_chain
; lc
; lc
= lc
->next
)
7674 add_value_chains (new_var
->dv
, lc
->loc
);
7676 for (i
= 0; i
< new_var
->n_var_parts
; i
++)
7677 new_var
->var_part
[i
].cur_loc
= NULL
;
7678 variable_was_changed (new_var
, NULL
);
7681 /* Continue traversing the hash table. */
7685 /* Emit notes before INSN for differences between dataflow sets OLD_SET and
7689 emit_notes_for_differences (rtx insn
, dataflow_set
*old_set
,
7690 dataflow_set
*new_set
)
7692 htab_traverse (shared_hash_htab (old_set
->vars
),
7693 emit_notes_for_differences_1
,
7694 shared_hash_htab (new_set
->vars
));
7695 htab_traverse (shared_hash_htab (new_set
->vars
),
7696 emit_notes_for_differences_2
,
7697 shared_hash_htab (old_set
->vars
));
7698 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
, new_set
->vars
);
7701 /* Emit the notes for changes of location parts in the basic block BB. */
7704 emit_notes_in_bb (basic_block bb
, dataflow_set
*set
)
7707 micro_operation
*mo
;
7709 dataflow_set_clear (set
);
7710 dataflow_set_copy (set
, &VTI (bb
)->in
);
7712 FOR_EACH_VEC_ELT (micro_operation
, VTI (bb
)->mos
, i
, mo
)
7714 rtx insn
= mo
->insn
;
7719 dataflow_set_clear_at_call (set
);
7720 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_CALL_INSN
, set
->vars
);
7725 rtx loc
= mo
->u
.loc
;
7728 var_reg_set (set
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
7730 var_mem_set (set
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
7732 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
7738 rtx loc
= mo
->u
.loc
;
7742 if (GET_CODE (loc
) == CONCAT
)
7744 val
= XEXP (loc
, 0);
7745 vloc
= XEXP (loc
, 1);
7753 var
= PAT_VAR_LOCATION_DECL (vloc
);
7755 clobber_variable_part (set
, NULL_RTX
,
7756 dv_from_decl (var
), 0, NULL_RTX
);
7759 if (VAL_NEEDS_RESOLUTION (loc
))
7760 val_resolve (set
, val
, PAT_VAR_LOCATION_LOC (vloc
), insn
);
7761 set_variable_part (set
, val
, dv_from_decl (var
), 0,
7762 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
7765 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc
)))
7766 set_variable_part (set
, PAT_VAR_LOCATION_LOC (vloc
),
7767 dv_from_decl (var
), 0,
7768 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
7771 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
7777 rtx loc
= mo
->u
.loc
;
7778 rtx val
, vloc
, uloc
;
7780 vloc
= uloc
= XEXP (loc
, 1);
7781 val
= XEXP (loc
, 0);
7783 if (GET_CODE (val
) == CONCAT
)
7785 uloc
= XEXP (val
, 1);
7786 val
= XEXP (val
, 0);
7789 if (VAL_NEEDS_RESOLUTION (loc
))
7790 val_resolve (set
, val
, vloc
, insn
);
7792 val_store (set
, val
, uloc
, insn
, false);
7794 if (VAL_HOLDS_TRACK_EXPR (loc
))
7796 if (GET_CODE (uloc
) == REG
)
7797 var_reg_set (set
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
7799 else if (GET_CODE (uloc
) == MEM
)
7800 var_mem_set (set
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
7804 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
, set
->vars
);
7810 rtx loc
= mo
->u
.loc
;
7811 rtx val
, vloc
, uloc
, reverse
= NULL_RTX
;
7814 if (VAL_EXPR_HAS_REVERSE (loc
))
7816 reverse
= XEXP (loc
, 1);
7817 vloc
= XEXP (loc
, 0);
7819 uloc
= XEXP (vloc
, 1);
7820 val
= XEXP (vloc
, 0);
7823 if (GET_CODE (val
) == CONCAT
)
7825 vloc
= XEXP (val
, 1);
7826 val
= XEXP (val
, 0);
7829 if (GET_CODE (vloc
) == SET
)
7831 rtx vsrc
= SET_SRC (vloc
);
7833 gcc_assert (val
!= vsrc
);
7834 gcc_assert (vloc
== uloc
|| VAL_NEEDS_RESOLUTION (loc
));
7836 vloc
= SET_DEST (vloc
);
7838 if (VAL_NEEDS_RESOLUTION (loc
))
7839 val_resolve (set
, val
, vsrc
, insn
);
7841 else if (VAL_NEEDS_RESOLUTION (loc
))
7843 gcc_assert (GET_CODE (uloc
) == SET
7844 && GET_CODE (SET_SRC (uloc
)) == REG
);
7845 val_resolve (set
, val
, SET_SRC (uloc
), insn
);
7848 if (VAL_HOLDS_TRACK_EXPR (loc
))
7850 if (VAL_EXPR_IS_CLOBBERED (loc
))
7853 var_reg_delete (set
, uloc
, true);
7854 else if (MEM_P (uloc
))
7855 var_mem_delete (set
, uloc
, true);
7859 bool copied_p
= VAL_EXPR_IS_COPIED (loc
);
7861 enum var_init_status status
= VAR_INIT_STATUS_INITIALIZED
;
7863 if (GET_CODE (uloc
) == SET
)
7865 set_src
= SET_SRC (uloc
);
7866 uloc
= SET_DEST (uloc
);
7871 status
= find_src_status (set
, set_src
);
7873 set_src
= find_src_set_src (set
, set_src
);
7877 var_reg_delete_and_set (set
, uloc
, !copied_p
,
7879 else if (MEM_P (uloc
))
7880 var_mem_delete_and_set (set
, uloc
, !copied_p
,
7884 else if (REG_P (uloc
))
7885 var_regno_delete (set
, REGNO (uloc
));
7887 val_store (set
, val
, vloc
, insn
, true);
7890 val_store (set
, XEXP (reverse
, 0), XEXP (reverse
, 1),
7893 emit_notes_for_changes (NEXT_INSN (insn
), EMIT_NOTE_BEFORE_INSN
,
7900 rtx loc
= mo
->u
.loc
;
7903 if (GET_CODE (loc
) == SET
)
7905 set_src
= SET_SRC (loc
);
7906 loc
= SET_DEST (loc
);
7910 var_reg_delete_and_set (set
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
7913 var_mem_delete_and_set (set
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
7916 emit_notes_for_changes (NEXT_INSN (insn
), EMIT_NOTE_BEFORE_INSN
,
7923 rtx loc
= mo
->u
.loc
;
7924 enum var_init_status src_status
;
7927 if (GET_CODE (loc
) == SET
)
7929 set_src
= SET_SRC (loc
);
7930 loc
= SET_DEST (loc
);
7933 src_status
= find_src_status (set
, set_src
);
7934 set_src
= find_src_set_src (set
, set_src
);
7937 var_reg_delete_and_set (set
, loc
, false, src_status
, set_src
);
7939 var_mem_delete_and_set (set
, loc
, false, src_status
, set_src
);
7941 emit_notes_for_changes (NEXT_INSN (insn
), EMIT_NOTE_BEFORE_INSN
,
7948 rtx loc
= mo
->u
.loc
;
7951 var_reg_delete (set
, loc
, false);
7953 var_mem_delete (set
, loc
, false);
7955 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
7961 rtx loc
= mo
->u
.loc
;
7964 var_reg_delete (set
, loc
, true);
7966 var_mem_delete (set
, loc
, true);
7968 emit_notes_for_changes (NEXT_INSN (insn
), EMIT_NOTE_BEFORE_INSN
,
7974 set
->stack_adjust
+= mo
->u
.adjust
;
7980 /* Emit notes for the whole function. */
7983 vt_emit_notes (void)
7988 #ifdef ENABLE_RTL_CHECKING
7989 emitted_notes
= pointer_map_create ();
7991 gcc_assert (!htab_elements (changed_variables
));
7993 /* Free memory occupied by the out hash tables, as they aren't used
7996 dataflow_set_clear (&VTI (bb
)->out
);
7998 /* Enable emitting notes by functions (mainly by set_variable_part and
7999 delete_variable_part). */
8002 if (MAY_HAVE_DEBUG_INSNS
)
8007 FOR_EACH_VEC_ELT (rtx
, preserved_values
, i
, val
)
8008 add_cselib_value_chains (dv_from_value (val
));
8009 changed_variables_stack
= VEC_alloc (variable
, heap
, 40);
8010 changed_values_stack
= VEC_alloc (rtx
, heap
, 40);
8013 dataflow_set_init (&cur
);
8017 /* Emit the notes for changes of variable locations between two
8018 subsequent basic blocks. */
8019 emit_notes_for_differences (BB_HEAD (bb
), &cur
, &VTI (bb
)->in
);
8021 /* Emit the notes for the changes in the basic block itself. */
8022 emit_notes_in_bb (bb
, &cur
);
8024 /* Free memory occupied by the in hash table, we won't need it
8026 dataflow_set_clear (&VTI (bb
)->in
);
8028 #ifdef ENABLE_CHECKING
8029 htab_traverse (shared_hash_htab (cur
.vars
),
8030 emit_notes_for_differences_1
,
8031 shared_hash_htab (empty_shared_hash
));
8032 if (MAY_HAVE_DEBUG_INSNS
)
8037 FOR_EACH_VEC_ELT (rtx
, preserved_values
, i
, val
)
8038 remove_cselib_value_chains (dv_from_value (val
));
8039 gcc_assert (htab_elements (value_chains
) == 0);
8042 dataflow_set_destroy (&cur
);
8044 if (MAY_HAVE_DEBUG_INSNS
)
8046 VEC_free (variable
, heap
, changed_variables_stack
);
8047 VEC_free (rtx
, heap
, changed_values_stack
);
8050 #ifdef ENABLE_RTL_CHECKING
8051 pointer_map_destroy (emitted_notes
);
8056 /* If there is a declaration and offset associated with register/memory RTL
8057 assign declaration to *DECLP and offset to *OFFSETP, and return true. */
8060 vt_get_decl_and_offset (rtx rtl
, tree
*declp
, HOST_WIDE_INT
*offsetp
)
8064 if (REG_ATTRS (rtl
))
8066 *declp
= REG_EXPR (rtl
);
8067 *offsetp
= REG_OFFSET (rtl
);
8071 else if (MEM_P (rtl
))
8073 if (MEM_ATTRS (rtl
))
8075 *declp
= MEM_EXPR (rtl
);
8076 *offsetp
= INT_MEM_OFFSET (rtl
);
8083 /* Insert function parameters to IN and OUT sets of ENTRY_BLOCK. */
8086 vt_add_function_parameters (void)
8090 for (parm
= DECL_ARGUMENTS (current_function_decl
);
8091 parm
; parm
= DECL_CHAIN (parm
))
8093 rtx decl_rtl
= DECL_RTL_IF_SET (parm
);
8094 rtx incoming
= DECL_INCOMING_RTL (parm
);
8096 enum machine_mode mode
;
8097 HOST_WIDE_INT offset
;
8101 if (TREE_CODE (parm
) != PARM_DECL
)
8104 if (!DECL_NAME (parm
))
8107 if (!decl_rtl
|| !incoming
)
8110 if (GET_MODE (decl_rtl
) == BLKmode
|| GET_MODE (incoming
) == BLKmode
)
8113 if (!vt_get_decl_and_offset (incoming
, &decl
, &offset
))
8115 if (REG_P (incoming
) || MEM_P (incoming
))
8117 /* This means argument is passed by invisible reference. */
8120 incoming
= gen_rtx_MEM (GET_MODE (decl_rtl
), incoming
);
8124 if (!vt_get_decl_and_offset (decl_rtl
, &decl
, &offset
))
8126 offset
+= byte_lowpart_offset (GET_MODE (incoming
),
8127 GET_MODE (decl_rtl
));
8136 /* Assume that DECL_RTL was a pseudo that got spilled to
8137 memory. The spill slot sharing code will force the
8138 memory to reference spill_slot_decl (%sfp), so we don't
8139 match above. That's ok, the pseudo must have referenced
8140 the entire parameter, so just reset OFFSET. */
8141 gcc_assert (decl
== get_spill_slot_decl (false));
8145 if (!track_loc_p (incoming
, parm
, offset
, false, &mode
, &offset
))
8148 out
= &VTI (ENTRY_BLOCK_PTR
)->out
;
8150 dv
= dv_from_decl (parm
);
8152 if (target_for_debug_bind (parm
)
8153 /* We can't deal with these right now, because this kind of
8154 variable is single-part. ??? We could handle parallels
8155 that describe multiple locations for the same single
8156 value, but ATM we don't. */
8157 && GET_CODE (incoming
) != PARALLEL
)
8161 /* ??? We shouldn't ever hit this, but it may happen because
8162 arguments passed by invisible reference aren't dealt with
8163 above: incoming-rtl will have Pmode rather than the
8164 expected mode for the type. */
8168 val
= cselib_lookup (var_lowpart (mode
, incoming
), mode
, true);
8170 /* ??? Float-typed values in memory are not handled by
8174 preserve_value (val
);
8175 set_variable_part (out
, val
->val_rtx
, dv
, offset
,
8176 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
8177 dv
= dv_from_value (val
->val_rtx
);
8181 if (REG_P (incoming
))
8183 incoming
= var_lowpart (mode
, incoming
);
8184 gcc_assert (REGNO (incoming
) < FIRST_PSEUDO_REGISTER
);
8185 attrs_list_insert (&out
->regs
[REGNO (incoming
)], dv
, offset
,
8187 set_variable_part (out
, incoming
, dv
, offset
,
8188 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
8190 else if (MEM_P (incoming
))
8192 incoming
= var_lowpart (mode
, incoming
);
8193 set_variable_part (out
, incoming
, dv
, offset
,
8194 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
8198 if (MAY_HAVE_DEBUG_INSNS
)
8200 cselib_preserve_only_values ();
8201 cselib_reset_table (cselib_get_next_uid ());
8206 /* Return true if INSN in the prologue initializes hard_frame_pointer_rtx. */
8209 fp_setter (rtx insn
)
8211 rtx pat
= PATTERN (insn
);
8212 if (RTX_FRAME_RELATED_P (insn
))
8214 rtx expr
= find_reg_note (insn
, REG_FRAME_RELATED_EXPR
, NULL_RTX
);
8216 pat
= XEXP (expr
, 0);
8218 if (GET_CODE (pat
) == SET
)
8219 return SET_DEST (pat
) == hard_frame_pointer_rtx
;
8220 else if (GET_CODE (pat
) == PARALLEL
)
8223 for (i
= XVECLEN (pat
, 0) - 1; i
>= 0; i
--)
8224 if (GET_CODE (XVECEXP (pat
, 0, i
)) == SET
8225 && SET_DEST (XVECEXP (pat
, 0, i
)) == hard_frame_pointer_rtx
)
8231 /* Initialize cfa_base_rtx, create a preserved VALUE for it and
8232 ensure it isn't flushed during cselib_reset_table.
8233 Can be called only if frame_pointer_rtx resp. arg_pointer_rtx
8234 has been eliminated. */
8237 vt_init_cfa_base (void)
8241 #ifdef FRAME_POINTER_CFA_OFFSET
8242 cfa_base_rtx
= frame_pointer_rtx
;
8244 cfa_base_rtx
= arg_pointer_rtx
;
8246 if (cfa_base_rtx
== hard_frame_pointer_rtx
8247 || !fixed_regs
[REGNO (cfa_base_rtx
)])
8249 cfa_base_rtx
= NULL_RTX
;
8252 if (!MAY_HAVE_DEBUG_INSNS
)
8255 val
= cselib_lookup_from_insn (cfa_base_rtx
, GET_MODE (cfa_base_rtx
), 1,
8257 preserve_value (val
);
8258 cselib_preserve_cfa_base_value (val
, REGNO (cfa_base_rtx
));
8259 var_reg_decl_set (&VTI (ENTRY_BLOCK_PTR
)->out
, cfa_base_rtx
,
8260 VAR_INIT_STATUS_INITIALIZED
, dv_from_value (val
->val_rtx
),
8261 0, NULL_RTX
, INSERT
);
8264 /* Allocate and initialize the data structures for variable tracking
8265 and parse the RTL to get the micro operations. */
8268 vt_initialize (void)
8270 basic_block bb
, prologue_bb
= NULL
;
8271 HOST_WIDE_INT fp_cfa_offset
= -1;
8273 alloc_aux_for_blocks (sizeof (struct variable_tracking_info_def
));
8275 attrs_pool
= create_alloc_pool ("attrs_def pool",
8276 sizeof (struct attrs_def
), 1024);
8277 var_pool
= create_alloc_pool ("variable_def pool",
8278 sizeof (struct variable_def
)
8279 + (MAX_VAR_PARTS
- 1)
8280 * sizeof (((variable
)NULL
)->var_part
[0]), 64);
8281 loc_chain_pool
= create_alloc_pool ("location_chain_def pool",
8282 sizeof (struct location_chain_def
),
8284 shared_hash_pool
= create_alloc_pool ("shared_hash_def pool",
8285 sizeof (struct shared_hash_def
), 256);
8286 empty_shared_hash
= (shared_hash
) pool_alloc (shared_hash_pool
);
8287 empty_shared_hash
->refcount
= 1;
8288 empty_shared_hash
->htab
8289 = htab_create (1, variable_htab_hash
, variable_htab_eq
,
8290 variable_htab_free
);
8291 changed_variables
= htab_create (10, variable_htab_hash
, variable_htab_eq
,
8292 variable_htab_free
);
8293 if (MAY_HAVE_DEBUG_INSNS
)
8295 value_chain_pool
= create_alloc_pool ("value_chain_def pool",
8296 sizeof (struct value_chain_def
),
8298 value_chains
= htab_create (32, value_chain_htab_hash
,
8299 value_chain_htab_eq
, NULL
);
8302 /* Init the IN and OUT sets. */
8305 VTI (bb
)->visited
= false;
8306 VTI (bb
)->flooded
= false;
8307 dataflow_set_init (&VTI (bb
)->in
);
8308 dataflow_set_init (&VTI (bb
)->out
);
8309 VTI (bb
)->permp
= NULL
;
8312 if (MAY_HAVE_DEBUG_INSNS
)
8314 cselib_init (CSELIB_RECORD_MEMORY
| CSELIB_PRESERVE_CONSTANTS
);
8315 scratch_regs
= BITMAP_ALLOC (NULL
);
8316 valvar_pool
= create_alloc_pool ("small variable_def pool",
8317 sizeof (struct variable_def
), 256);
8318 preserved_values
= VEC_alloc (rtx
, heap
, 256);
8322 scratch_regs
= NULL
;
8326 if (!frame_pointer_needed
)
8330 if (!vt_stack_adjustments ())
8333 #ifdef FRAME_POINTER_CFA_OFFSET
8334 reg
= frame_pointer_rtx
;
8336 reg
= arg_pointer_rtx
;
8338 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
8341 if (GET_CODE (elim
) == PLUS
)
8342 elim
= XEXP (elim
, 0);
8343 if (elim
== stack_pointer_rtx
)
8344 vt_init_cfa_base ();
8347 else if (!crtl
->stack_realign_tried
)
8351 #ifdef FRAME_POINTER_CFA_OFFSET
8352 reg
= frame_pointer_rtx
;
8353 fp_cfa_offset
= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
8355 reg
= arg_pointer_rtx
;
8356 fp_cfa_offset
= ARG_POINTER_CFA_OFFSET (current_function_decl
);
8358 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
8361 if (GET_CODE (elim
) == PLUS
)
8363 fp_cfa_offset
-= INTVAL (XEXP (elim
, 1));
8364 elim
= XEXP (elim
, 0);
8366 if (elim
!= hard_frame_pointer_rtx
)
8369 prologue_bb
= single_succ (ENTRY_BLOCK_PTR
);
8373 hard_frame_pointer_adjustment
= -1;
8378 HOST_WIDE_INT pre
, post
= 0;
8379 basic_block first_bb
, last_bb
;
8381 if (MAY_HAVE_DEBUG_INSNS
)
8383 cselib_record_sets_hook
= add_with_sets
;
8384 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
8385 fprintf (dump_file
, "first value: %i\n",
8386 cselib_get_next_uid ());
8393 if (bb
->next_bb
== EXIT_BLOCK_PTR
8394 || ! single_pred_p (bb
->next_bb
))
8396 e
= find_edge (bb
, bb
->next_bb
);
8397 if (! e
|| (e
->flags
& EDGE_FALLTHRU
) == 0)
8403 /* Add the micro-operations to the vector. */
8404 FOR_BB_BETWEEN (bb
, first_bb
, last_bb
->next_bb
, next_bb
)
8406 HOST_WIDE_INT offset
= VTI (bb
)->out
.stack_adjust
;
8407 VTI (bb
)->out
.stack_adjust
= VTI (bb
)->in
.stack_adjust
;
8408 for (insn
= BB_HEAD (bb
); insn
!= NEXT_INSN (BB_END (bb
));
8409 insn
= NEXT_INSN (insn
))
8413 if (!frame_pointer_needed
)
8415 insn_stack_adjust_offset_pre_post (insn
, &pre
, &post
);
8419 mo
.type
= MO_ADJUST
;
8422 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
8423 log_op_type (PATTERN (insn
), bb
, insn
,
8424 MO_ADJUST
, dump_file
);
8425 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
,
8427 VTI (bb
)->out
.stack_adjust
+= pre
;
8431 cselib_hook_called
= false;
8432 adjust_insn (bb
, insn
);
8433 if (MAY_HAVE_DEBUG_INSNS
)
8435 cselib_process_insn (insn
);
8436 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
8438 print_rtl_single (dump_file
, insn
);
8439 dump_cselib_table (dump_file
);
8442 if (!cselib_hook_called
)
8443 add_with_sets (insn
, 0, 0);
8446 if (!frame_pointer_needed
&& post
)
8449 mo
.type
= MO_ADJUST
;
8452 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
8453 log_op_type (PATTERN (insn
), bb
, insn
,
8454 MO_ADJUST
, dump_file
);
8455 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
,
8457 VTI (bb
)->out
.stack_adjust
+= post
;
8460 if (bb
== prologue_bb
8461 && hard_frame_pointer_adjustment
== -1
8462 && RTX_FRAME_RELATED_P (insn
)
8463 && fp_setter (insn
))
8465 vt_init_cfa_base ();
8466 hard_frame_pointer_adjustment
= fp_cfa_offset
;
8470 gcc_assert (offset
== VTI (bb
)->out
.stack_adjust
);
8475 if (MAY_HAVE_DEBUG_INSNS
)
8477 cselib_preserve_only_values ();
8478 cselib_reset_table (cselib_get_next_uid ());
8479 cselib_record_sets_hook
= NULL
;
8483 hard_frame_pointer_adjustment
= -1;
8484 VTI (ENTRY_BLOCK_PTR
)->flooded
= true;
8485 vt_add_function_parameters ();
8486 cfa_base_rtx
= NULL_RTX
;
8490 /* Get rid of all debug insns from the insn stream. */
8493 delete_debug_insns (void)
8498 if (!MAY_HAVE_DEBUG_INSNS
)
8503 FOR_BB_INSNS_SAFE (bb
, insn
, next
)
8504 if (DEBUG_INSN_P (insn
))
8509 /* Run a fast, BB-local only version of var tracking, to take care of
8510 information that we don't do global analysis on, such that not all
8511 information is lost. If SKIPPED holds, we're skipping the global
8512 pass entirely, so we should try to use information it would have
8513 handled as well.. */
8516 vt_debug_insns_local (bool skipped ATTRIBUTE_UNUSED
)
8518 /* ??? Just skip it all for now. */
8519 delete_debug_insns ();
8522 /* Free the data structures needed for variable tracking. */
8531 VEC_free (micro_operation
, heap
, VTI (bb
)->mos
);
8536 dataflow_set_destroy (&VTI (bb
)->in
);
8537 dataflow_set_destroy (&VTI (bb
)->out
);
8538 if (VTI (bb
)->permp
)
8540 dataflow_set_destroy (VTI (bb
)->permp
);
8541 XDELETE (VTI (bb
)->permp
);
8544 free_aux_for_blocks ();
8545 htab_delete (empty_shared_hash
->htab
);
8546 htab_delete (changed_variables
);
8547 free_alloc_pool (attrs_pool
);
8548 free_alloc_pool (var_pool
);
8549 free_alloc_pool (loc_chain_pool
);
8550 free_alloc_pool (shared_hash_pool
);
8552 if (MAY_HAVE_DEBUG_INSNS
)
8554 htab_delete (value_chains
);
8555 free_alloc_pool (value_chain_pool
);
8556 free_alloc_pool (valvar_pool
);
8557 VEC_free (rtx
, heap
, preserved_values
);
8559 BITMAP_FREE (scratch_regs
);
8560 scratch_regs
= NULL
;
8564 XDELETEVEC (vui_vec
);
8569 /* The entry point to variable tracking pass. */
8571 static inline unsigned int
8572 variable_tracking_main_1 (void)
8576 if (flag_var_tracking_assignments
< 0)
8578 delete_debug_insns ();
8582 if (n_basic_blocks
> 500 && n_edges
/ n_basic_blocks
>= 20)
8584 vt_debug_insns_local (true);
8588 mark_dfs_back_edges ();
8589 if (!vt_initialize ())
8592 vt_debug_insns_local (true);
8596 success
= vt_find_locations ();
8598 if (!success
&& flag_var_tracking_assignments
> 0)
8602 delete_debug_insns ();
8604 /* This is later restored by our caller. */
8605 flag_var_tracking_assignments
= 0;
8607 success
= vt_initialize ();
8608 gcc_assert (success
);
8610 success
= vt_find_locations ();
8616 vt_debug_insns_local (false);
8620 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
8622 dump_dataflow_sets ();
8623 dump_flow_info (dump_file
, dump_flags
);
8626 timevar_push (TV_VAR_TRACKING_EMIT
);
8628 timevar_pop (TV_VAR_TRACKING_EMIT
);
8631 vt_debug_insns_local (false);
8636 variable_tracking_main (void)
8639 int save
= flag_var_tracking_assignments
;
8641 ret
= variable_tracking_main_1 ();
8643 flag_var_tracking_assignments
= save
;
8649 gate_handle_var_tracking (void)
8651 return (flag_var_tracking
);
8656 struct rtl_opt_pass pass_variable_tracking
=
8660 "vartrack", /* name */
8661 gate_handle_var_tracking
, /* gate */
8662 variable_tracking_main
, /* execute */
8665 0, /* static_pass_number */
8666 TV_VAR_TRACKING
, /* tv_id */
8667 0, /* properties_required */
8668 0, /* properties_provided */
8669 0, /* properties_destroyed */
8670 0, /* todo_flags_start */
8671 TODO_dump_func
| TODO_verify_rtl_sharing
/* todo_flags_finish */