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"
96 #include "hard-reg-set.h"
97 #include "basic-block.h"
100 #include "insn-config.h"
103 #include "alloc-pool.h"
109 #include "tree-pass.h"
110 #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 hashval_t
variable_htab_hash (const void *);
412 static int variable_htab_eq (const void *, const void *);
413 static void variable_htab_free (void *);
415 static void init_attrs_list_set (attrs
*);
416 static void attrs_list_clear (attrs
*);
417 static attrs
attrs_list_member (attrs
, decl_or_value
, HOST_WIDE_INT
);
418 static void attrs_list_insert (attrs
*, decl_or_value
, HOST_WIDE_INT
, rtx
);
419 static void attrs_list_copy (attrs
*, attrs
);
420 static void attrs_list_union (attrs
*, attrs
);
422 static void **unshare_variable (dataflow_set
*set
, void **slot
, variable var
,
423 enum var_init_status
);
424 static void vars_copy (htab_t
, htab_t
);
425 static tree
var_debug_decl (tree
);
426 static void var_reg_set (dataflow_set
*, rtx
, enum var_init_status
, rtx
);
427 static void var_reg_delete_and_set (dataflow_set
*, rtx
, bool,
428 enum var_init_status
, rtx
);
429 static void var_reg_delete (dataflow_set
*, rtx
, bool);
430 static void var_regno_delete (dataflow_set
*, int);
431 static void var_mem_set (dataflow_set
*, rtx
, enum var_init_status
, rtx
);
432 static void var_mem_delete_and_set (dataflow_set
*, rtx
, bool,
433 enum var_init_status
, rtx
);
434 static void var_mem_delete (dataflow_set
*, rtx
, bool);
436 static void dataflow_set_init (dataflow_set
*);
437 static void dataflow_set_clear (dataflow_set
*);
438 static void dataflow_set_copy (dataflow_set
*, dataflow_set
*);
439 static int variable_union_info_cmp_pos (const void *, const void *);
440 static void dataflow_set_union (dataflow_set
*, dataflow_set
*);
441 static location_chain
find_loc_in_1pdv (rtx
, variable
, htab_t
);
442 static bool canon_value_cmp (rtx
, rtx
);
443 static int loc_cmp (rtx
, rtx
);
444 static bool variable_part_different_p (variable_part
*, variable_part
*);
445 static bool onepart_variable_different_p (variable
, variable
);
446 static bool variable_different_p (variable
, variable
);
447 static bool dataflow_set_different (dataflow_set
*, dataflow_set
*);
448 static void dataflow_set_destroy (dataflow_set
*);
450 static bool contains_symbol_ref (rtx
);
451 static bool track_expr_p (tree
, bool);
452 static bool same_variable_part_p (rtx
, tree
, HOST_WIDE_INT
);
453 static int add_uses (rtx
*, void *);
454 static void add_uses_1 (rtx
*, void *);
455 static void add_stores (rtx
, const_rtx
, void *);
456 static bool compute_bb_dataflow (basic_block
);
457 static bool vt_find_locations (void);
459 static void dump_attrs_list (attrs
);
460 static int dump_var_slot (void **, void *);
461 static void dump_var (variable
);
462 static void dump_vars (htab_t
);
463 static void dump_dataflow_set (dataflow_set
*);
464 static void dump_dataflow_sets (void);
466 static void variable_was_changed (variable
, dataflow_set
*);
467 static void **set_slot_part (dataflow_set
*, rtx
, void **,
468 decl_or_value
, HOST_WIDE_INT
,
469 enum var_init_status
, rtx
);
470 static void set_variable_part (dataflow_set
*, rtx
,
471 decl_or_value
, HOST_WIDE_INT
,
472 enum var_init_status
, rtx
, enum insert_option
);
473 static void **clobber_slot_part (dataflow_set
*, rtx
,
474 void **, HOST_WIDE_INT
, rtx
);
475 static void clobber_variable_part (dataflow_set
*, rtx
,
476 decl_or_value
, HOST_WIDE_INT
, rtx
);
477 static void **delete_slot_part (dataflow_set
*, rtx
, void **, HOST_WIDE_INT
);
478 static void delete_variable_part (dataflow_set
*, rtx
,
479 decl_or_value
, HOST_WIDE_INT
);
480 static int emit_note_insn_var_location (void **, void *);
481 static void emit_notes_for_changes (rtx
, enum emit_note_where
, shared_hash
);
482 static int emit_notes_for_differences_1 (void **, void *);
483 static int emit_notes_for_differences_2 (void **, void *);
484 static void emit_notes_for_differences (rtx
, dataflow_set
*, dataflow_set
*);
485 static void emit_notes_in_bb (basic_block
, dataflow_set
*);
486 static void vt_emit_notes (void);
488 static bool vt_get_decl_and_offset (rtx
, tree
*, HOST_WIDE_INT
*);
489 static void vt_add_function_parameters (void);
490 static bool vt_initialize (void);
491 static void vt_finalize (void);
493 /* Given a SET, calculate the amount of stack adjustment it contains
494 PRE- and POST-modifying stack pointer.
495 This function is similar to stack_adjust_offset. */
498 stack_adjust_offset_pre_post (rtx pattern
, HOST_WIDE_INT
*pre
,
501 rtx src
= SET_SRC (pattern
);
502 rtx dest
= SET_DEST (pattern
);
505 if (dest
== stack_pointer_rtx
)
507 /* (set (reg sp) (plus (reg sp) (const_int))) */
508 code
= GET_CODE (src
);
509 if (! (code
== PLUS
|| code
== MINUS
)
510 || XEXP (src
, 0) != stack_pointer_rtx
511 || !CONST_INT_P (XEXP (src
, 1)))
515 *post
+= INTVAL (XEXP (src
, 1));
517 *post
-= INTVAL (XEXP (src
, 1));
519 else if (MEM_P (dest
))
521 /* (set (mem (pre_dec (reg sp))) (foo)) */
522 src
= XEXP (dest
, 0);
523 code
= GET_CODE (src
);
529 if (XEXP (src
, 0) == stack_pointer_rtx
)
531 rtx val
= XEXP (XEXP (src
, 1), 1);
532 /* We handle only adjustments by constant amount. */
533 gcc_assert (GET_CODE (XEXP (src
, 1)) == PLUS
&&
536 if (code
== PRE_MODIFY
)
537 *pre
-= INTVAL (val
);
539 *post
-= INTVAL (val
);
545 if (XEXP (src
, 0) == stack_pointer_rtx
)
547 *pre
+= GET_MODE_SIZE (GET_MODE (dest
));
553 if (XEXP (src
, 0) == stack_pointer_rtx
)
555 *post
+= GET_MODE_SIZE (GET_MODE (dest
));
561 if (XEXP (src
, 0) == stack_pointer_rtx
)
563 *pre
-= GET_MODE_SIZE (GET_MODE (dest
));
569 if (XEXP (src
, 0) == stack_pointer_rtx
)
571 *post
-= GET_MODE_SIZE (GET_MODE (dest
));
582 /* Given an INSN, calculate the amount of stack adjustment it contains
583 PRE- and POST-modifying stack pointer. */
586 insn_stack_adjust_offset_pre_post (rtx insn
, HOST_WIDE_INT
*pre
,
594 pattern
= PATTERN (insn
);
595 if (RTX_FRAME_RELATED_P (insn
))
597 rtx expr
= find_reg_note (insn
, REG_FRAME_RELATED_EXPR
, NULL_RTX
);
599 pattern
= XEXP (expr
, 0);
602 if (GET_CODE (pattern
) == SET
)
603 stack_adjust_offset_pre_post (pattern
, pre
, post
);
604 else if (GET_CODE (pattern
) == PARALLEL
605 || GET_CODE (pattern
) == SEQUENCE
)
609 /* There may be stack adjustments inside compound insns. Search
611 for ( i
= XVECLEN (pattern
, 0) - 1; i
>= 0; i
--)
612 if (GET_CODE (XVECEXP (pattern
, 0, i
)) == SET
)
613 stack_adjust_offset_pre_post (XVECEXP (pattern
, 0, i
), pre
, post
);
617 /* Compute stack adjustments for all blocks by traversing DFS tree.
618 Return true when the adjustments on all incoming edges are consistent.
619 Heavily borrowed from pre_and_rev_post_order_compute. */
622 vt_stack_adjustments (void)
624 edge_iterator
*stack
;
627 /* Initialize entry block. */
628 VTI (ENTRY_BLOCK_PTR
)->visited
= true;
629 VTI (ENTRY_BLOCK_PTR
)->in
.stack_adjust
= INCOMING_FRAME_SP_OFFSET
;
630 VTI (ENTRY_BLOCK_PTR
)->out
.stack_adjust
= INCOMING_FRAME_SP_OFFSET
;
632 /* Allocate stack for back-tracking up CFG. */
633 stack
= XNEWVEC (edge_iterator
, n_basic_blocks
+ 1);
636 /* Push the first edge on to the stack. */
637 stack
[sp
++] = ei_start (ENTRY_BLOCK_PTR
->succs
);
645 /* Look at the edge on the top of the stack. */
647 src
= ei_edge (ei
)->src
;
648 dest
= ei_edge (ei
)->dest
;
650 /* Check if the edge destination has been visited yet. */
651 if (!VTI (dest
)->visited
)
654 HOST_WIDE_INT pre
, post
, offset
;
655 VTI (dest
)->visited
= true;
656 VTI (dest
)->in
.stack_adjust
= offset
= VTI (src
)->out
.stack_adjust
;
658 if (dest
!= EXIT_BLOCK_PTR
)
659 for (insn
= BB_HEAD (dest
);
660 insn
!= NEXT_INSN (BB_END (dest
));
661 insn
= NEXT_INSN (insn
))
664 insn_stack_adjust_offset_pre_post (insn
, &pre
, &post
);
665 offset
+= pre
+ post
;
668 VTI (dest
)->out
.stack_adjust
= offset
;
670 if (EDGE_COUNT (dest
->succs
) > 0)
671 /* Since the DEST node has been visited for the first
672 time, check its successors. */
673 stack
[sp
++] = ei_start (dest
->succs
);
677 /* Check whether the adjustments on the edges are the same. */
678 if (VTI (dest
)->in
.stack_adjust
!= VTI (src
)->out
.stack_adjust
)
684 if (! ei_one_before_end_p (ei
))
685 /* Go to the next edge. */
686 ei_next (&stack
[sp
- 1]);
688 /* Return to previous level if there are no more edges. */
697 /* arg_pointer_rtx resp. frame_pointer_rtx if stack_pointer_rtx or
698 hard_frame_pointer_rtx is being mapped to it and offset for it. */
699 static rtx cfa_base_rtx
;
700 static HOST_WIDE_INT cfa_base_offset
;
702 /* Compute a CFA-based value for the stack pointer. */
705 compute_cfa_pointer (HOST_WIDE_INT adjustment
)
707 return plus_constant (cfa_base_rtx
, adjustment
+ cfa_base_offset
);
710 /* Adjustment for hard_frame_pointer_rtx to cfa base reg,
711 or -1 if the replacement shouldn't be done. */
712 static HOST_WIDE_INT hard_frame_pointer_adjustment
= -1;
714 /* Data for adjust_mems callback. */
716 struct adjust_mem_data
719 enum machine_mode mem_mode
;
720 HOST_WIDE_INT stack_adjust
;
724 /* Helper for adjust_mems. Return 1 if *loc is unsuitable for
725 transformation of wider mode arithmetics to narrower mode,
726 -1 if it is suitable and subexpressions shouldn't be
727 traversed and 0 if it is suitable and subexpressions should
728 be traversed. Called through for_each_rtx. */
731 use_narrower_mode_test (rtx
*loc
, void *data
)
733 rtx subreg
= (rtx
) data
;
735 if (CONSTANT_P (*loc
))
737 switch (GET_CODE (*loc
))
740 if (cselib_lookup (*loc
, GET_MODE (SUBREG_REG (subreg
)), 0))
748 if (for_each_rtx (&XEXP (*loc
, 0), use_narrower_mode_test
, data
))
757 /* Transform X into narrower mode MODE from wider mode WMODE. */
760 use_narrower_mode (rtx x
, enum machine_mode mode
, enum machine_mode wmode
)
764 return lowpart_subreg (mode
, x
, wmode
);
765 switch (GET_CODE (x
))
768 return lowpart_subreg (mode
, x
, wmode
);
772 op0
= use_narrower_mode (XEXP (x
, 0), mode
, wmode
);
773 op1
= use_narrower_mode (XEXP (x
, 1), mode
, wmode
);
774 return simplify_gen_binary (GET_CODE (x
), mode
, op0
, op1
);
776 op0
= use_narrower_mode (XEXP (x
, 0), mode
, wmode
);
777 return simplify_gen_binary (ASHIFT
, mode
, op0
, XEXP (x
, 1));
783 /* Helper function for adjusting used MEMs. */
786 adjust_mems (rtx loc
, const_rtx old_rtx
, void *data
)
788 struct adjust_mem_data
*amd
= (struct adjust_mem_data
*) data
;
789 rtx mem
, addr
= loc
, tem
;
790 enum machine_mode mem_mode_save
;
792 switch (GET_CODE (loc
))
795 /* Don't do any sp or fp replacements outside of MEM addresses
797 if (amd
->mem_mode
== VOIDmode
&& amd
->store
)
799 if (loc
== stack_pointer_rtx
800 && !frame_pointer_needed
802 return compute_cfa_pointer (amd
->stack_adjust
);
803 else if (loc
== hard_frame_pointer_rtx
804 && frame_pointer_needed
805 && hard_frame_pointer_adjustment
!= -1
807 return compute_cfa_pointer (hard_frame_pointer_adjustment
);
808 gcc_checking_assert (loc
!= virtual_incoming_args_rtx
);
814 mem
= targetm
.delegitimize_address (mem
);
815 if (mem
!= loc
&& !MEM_P (mem
))
816 return simplify_replace_fn_rtx (mem
, old_rtx
, adjust_mems
, data
);
819 addr
= XEXP (mem
, 0);
820 mem_mode_save
= amd
->mem_mode
;
821 amd
->mem_mode
= GET_MODE (mem
);
822 store_save
= amd
->store
;
824 addr
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
825 amd
->store
= store_save
;
826 amd
->mem_mode
= mem_mode_save
;
828 addr
= targetm
.delegitimize_address (addr
);
829 if (addr
!= XEXP (mem
, 0))
830 mem
= replace_equiv_address_nv (mem
, addr
);
832 mem
= avoid_constant_pool_reference (mem
);
836 addr
= gen_rtx_PLUS (GET_MODE (loc
), XEXP (loc
, 0),
837 GEN_INT (GET_CODE (loc
) == PRE_INC
838 ? GET_MODE_SIZE (amd
->mem_mode
)
839 : -GET_MODE_SIZE (amd
->mem_mode
)));
843 addr
= XEXP (loc
, 0);
844 gcc_assert (amd
->mem_mode
!= VOIDmode
&& amd
->mem_mode
!= BLKmode
);
845 addr
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
846 tem
= gen_rtx_PLUS (GET_MODE (loc
), XEXP (loc
, 0),
847 GEN_INT ((GET_CODE (loc
) == PRE_INC
848 || GET_CODE (loc
) == POST_INC
)
849 ? GET_MODE_SIZE (amd
->mem_mode
)
850 : -GET_MODE_SIZE (amd
->mem_mode
)));
851 amd
->side_effects
= alloc_EXPR_LIST (0,
852 gen_rtx_SET (VOIDmode
,
858 addr
= XEXP (loc
, 1);
861 addr
= XEXP (loc
, 0);
862 gcc_assert (amd
->mem_mode
!= VOIDmode
);
863 addr
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
864 amd
->side_effects
= alloc_EXPR_LIST (0,
865 gen_rtx_SET (VOIDmode
,
871 /* First try without delegitimization of whole MEMs and
872 avoid_constant_pool_reference, which is more likely to succeed. */
873 store_save
= amd
->store
;
875 addr
= simplify_replace_fn_rtx (SUBREG_REG (loc
), old_rtx
, adjust_mems
,
877 amd
->store
= store_save
;
878 mem
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
879 if (mem
== SUBREG_REG (loc
))
884 tem
= simplify_gen_subreg (GET_MODE (loc
), mem
,
885 GET_MODE (SUBREG_REG (loc
)),
889 tem
= simplify_gen_subreg (GET_MODE (loc
), addr
,
890 GET_MODE (SUBREG_REG (loc
)),
893 tem
= gen_rtx_raw_SUBREG (GET_MODE (loc
), addr
, SUBREG_BYTE (loc
));
895 if (MAY_HAVE_DEBUG_INSNS
896 && GET_CODE (tem
) == SUBREG
897 && (GET_CODE (SUBREG_REG (tem
)) == PLUS
898 || GET_CODE (SUBREG_REG (tem
)) == MINUS
899 || GET_CODE (SUBREG_REG (tem
)) == MULT
900 || GET_CODE (SUBREG_REG (tem
)) == ASHIFT
)
901 && GET_MODE_CLASS (GET_MODE (tem
)) == MODE_INT
902 && GET_MODE_CLASS (GET_MODE (SUBREG_REG (tem
))) == MODE_INT
903 && GET_MODE_SIZE (GET_MODE (tem
))
904 < GET_MODE_SIZE (GET_MODE (SUBREG_REG (tem
)))
905 && subreg_lowpart_p (tem
)
906 && !for_each_rtx (&SUBREG_REG (tem
), use_narrower_mode_test
, tem
))
907 return use_narrower_mode (SUBREG_REG (tem
), GET_MODE (tem
),
908 GET_MODE (SUBREG_REG (tem
)));
911 /* Don't do any replacements in second and following
912 ASM_OPERANDS of inline-asm with multiple sets.
913 ASM_OPERANDS_INPUT_VEC, ASM_OPERANDS_INPUT_CONSTRAINT_VEC
914 and ASM_OPERANDS_LABEL_VEC need to be equal between
915 all the ASM_OPERANDs in the insn and adjust_insn will
917 if (ASM_OPERANDS_OUTPUT_IDX (loc
) != 0)
926 /* Helper function for replacement of uses. */
929 adjust_mem_uses (rtx
*x
, void *data
)
931 rtx new_x
= simplify_replace_fn_rtx (*x
, NULL_RTX
, adjust_mems
, data
);
933 validate_change (NULL_RTX
, x
, new_x
, true);
936 /* Helper function for replacement of stores. */
939 adjust_mem_stores (rtx loc
, const_rtx expr
, void *data
)
943 rtx new_dest
= simplify_replace_fn_rtx (SET_DEST (expr
), NULL_RTX
,
945 if (new_dest
!= SET_DEST (expr
))
947 rtx xexpr
= CONST_CAST_RTX (expr
);
948 validate_change (NULL_RTX
, &SET_DEST (xexpr
), new_dest
, true);
953 /* Simplify INSN. Remove all {PRE,POST}_{INC,DEC,MODIFY} rtxes,
954 replace them with their value in the insn and add the side-effects
955 as other sets to the insn. */
958 adjust_insn (basic_block bb
, rtx insn
)
960 struct adjust_mem_data amd
;
962 amd
.mem_mode
= VOIDmode
;
963 amd
.stack_adjust
= -VTI (bb
)->out
.stack_adjust
;
964 amd
.side_effects
= NULL_RTX
;
967 note_stores (PATTERN (insn
), adjust_mem_stores
, &amd
);
970 if (GET_CODE (PATTERN (insn
)) == PARALLEL
971 && asm_noperands (PATTERN (insn
)) > 0
972 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == SET
)
977 /* inline-asm with multiple sets is tiny bit more complicated,
978 because the 3 vectors in ASM_OPERANDS need to be shared between
979 all ASM_OPERANDS in the instruction. adjust_mems will
980 not touch ASM_OPERANDS other than the first one, asm_noperands
981 test above needs to be called before that (otherwise it would fail)
982 and afterwards this code fixes it up. */
983 note_uses (&PATTERN (insn
), adjust_mem_uses
, &amd
);
984 body
= PATTERN (insn
);
985 set0
= XVECEXP (body
, 0, 0);
986 gcc_checking_assert (GET_CODE (set0
) == SET
987 && GET_CODE (SET_SRC (set0
)) == ASM_OPERANDS
988 && ASM_OPERANDS_OUTPUT_IDX (SET_SRC (set0
)) == 0);
989 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
990 if (GET_CODE (XVECEXP (body
, 0, i
)) != SET
)
994 set
= XVECEXP (body
, 0, i
);
995 gcc_checking_assert (GET_CODE (SET_SRC (set
)) == ASM_OPERANDS
996 && ASM_OPERANDS_OUTPUT_IDX (SET_SRC (set
))
998 if (ASM_OPERANDS_INPUT_VEC (SET_SRC (set
))
999 != ASM_OPERANDS_INPUT_VEC (SET_SRC (set0
))
1000 || ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set
))
1001 != ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set0
))
1002 || ASM_OPERANDS_LABEL_VEC (SET_SRC (set
))
1003 != ASM_OPERANDS_LABEL_VEC (SET_SRC (set0
)))
1005 rtx newsrc
= shallow_copy_rtx (SET_SRC (set
));
1006 ASM_OPERANDS_INPUT_VEC (newsrc
)
1007 = ASM_OPERANDS_INPUT_VEC (SET_SRC (set0
));
1008 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (newsrc
)
1009 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set0
));
1010 ASM_OPERANDS_LABEL_VEC (newsrc
)
1011 = ASM_OPERANDS_LABEL_VEC (SET_SRC (set0
));
1012 validate_change (NULL_RTX
, &SET_SRC (set
), newsrc
, true);
1017 note_uses (&PATTERN (insn
), adjust_mem_uses
, &amd
);
1019 /* For read-only MEMs containing some constant, prefer those
1021 set
= single_set (insn
);
1022 if (set
&& MEM_P (SET_SRC (set
)) && MEM_READONLY_P (SET_SRC (set
)))
1024 rtx note
= find_reg_equal_equiv_note (insn
);
1026 if (note
&& CONSTANT_P (XEXP (note
, 0)))
1027 validate_change (NULL_RTX
, &SET_SRC (set
), XEXP (note
, 0), true);
1030 if (amd
.side_effects
)
1032 rtx
*pat
, new_pat
, s
;
1035 pat
= &PATTERN (insn
);
1036 if (GET_CODE (*pat
) == COND_EXEC
)
1037 pat
= &COND_EXEC_CODE (*pat
);
1038 if (GET_CODE (*pat
) == PARALLEL
)
1039 oldn
= XVECLEN (*pat
, 0);
1042 for (s
= amd
.side_effects
, newn
= 0; s
; newn
++)
1044 new_pat
= gen_rtx_PARALLEL (VOIDmode
, rtvec_alloc (oldn
+ newn
));
1045 if (GET_CODE (*pat
) == PARALLEL
)
1046 for (i
= 0; i
< oldn
; i
++)
1047 XVECEXP (new_pat
, 0, i
) = XVECEXP (*pat
, 0, i
);
1049 XVECEXP (new_pat
, 0, 0) = *pat
;
1050 for (s
= amd
.side_effects
, i
= oldn
; i
< oldn
+ newn
; i
++, s
= XEXP (s
, 1))
1051 XVECEXP (new_pat
, 0, i
) = XEXP (s
, 0);
1052 free_EXPR_LIST_list (&amd
.side_effects
);
1053 validate_change (NULL_RTX
, pat
, new_pat
, true);
1057 /* Return true if a decl_or_value DV is a DECL or NULL. */
1059 dv_is_decl_p (decl_or_value dv
)
1061 return !dv
|| (int) TREE_CODE ((tree
) dv
) != (int) VALUE
;
1064 /* Return true if a decl_or_value is a VALUE rtl. */
1066 dv_is_value_p (decl_or_value dv
)
1068 return dv
&& !dv_is_decl_p (dv
);
1071 /* Return the decl in the decl_or_value. */
1073 dv_as_decl (decl_or_value dv
)
1075 gcc_checking_assert (dv_is_decl_p (dv
));
1079 /* Return the value in the decl_or_value. */
1081 dv_as_value (decl_or_value dv
)
1083 gcc_checking_assert (dv_is_value_p (dv
));
1087 /* Return the opaque pointer in the decl_or_value. */
1088 static inline void *
1089 dv_as_opaque (decl_or_value dv
)
1094 /* Return true if a decl_or_value must not have more than one variable
1097 dv_onepart_p (decl_or_value dv
)
1101 if (!MAY_HAVE_DEBUG_INSNS
)
1104 if (dv_is_value_p (dv
))
1107 decl
= dv_as_decl (dv
);
1112 if (TREE_CODE (decl
) == DEBUG_EXPR_DECL
)
1115 return (target_for_debug_bind (decl
) != NULL_TREE
);
1118 /* Return the variable pool to be used for dv, depending on whether it
1119 can have multiple parts or not. */
1120 static inline alloc_pool
1121 dv_pool (decl_or_value dv
)
1123 return dv_onepart_p (dv
) ? valvar_pool
: var_pool
;
1126 /* Build a decl_or_value out of a decl. */
1127 static inline decl_or_value
1128 dv_from_decl (tree decl
)
1132 gcc_checking_assert (dv_is_decl_p (dv
));
1136 /* Build a decl_or_value out of a value. */
1137 static inline decl_or_value
1138 dv_from_value (rtx value
)
1142 gcc_checking_assert (dv_is_value_p (dv
));
1146 extern void debug_dv (decl_or_value dv
);
1149 debug_dv (decl_or_value dv
)
1151 if (dv_is_value_p (dv
))
1152 debug_rtx (dv_as_value (dv
));
1154 debug_generic_stmt (dv_as_decl (dv
));
1157 typedef unsigned int dvuid
;
1159 /* Return the uid of DV. */
1162 dv_uid (decl_or_value dv
)
1164 if (dv_is_value_p (dv
))
1165 return CSELIB_VAL_PTR (dv_as_value (dv
))->uid
;
1167 return DECL_UID (dv_as_decl (dv
));
1170 /* Compute the hash from the uid. */
1172 static inline hashval_t
1173 dv_uid2hash (dvuid uid
)
1178 /* The hash function for a mask table in a shared_htab chain. */
1180 static inline hashval_t
1181 dv_htab_hash (decl_or_value dv
)
1183 return dv_uid2hash (dv_uid (dv
));
1186 /* The hash function for variable_htab, computes the hash value
1187 from the declaration of variable X. */
1190 variable_htab_hash (const void *x
)
1192 const_variable
const v
= (const_variable
) x
;
1194 return dv_htab_hash (v
->dv
);
1197 /* Compare the declaration of variable X with declaration Y. */
1200 variable_htab_eq (const void *x
, const void *y
)
1202 const_variable
const v
= (const_variable
) x
;
1203 decl_or_value dv
= CONST_CAST2 (decl_or_value
, const void *, y
);
1205 return (dv_as_opaque (v
->dv
) == dv_as_opaque (dv
));
1208 /* Free the element of VARIABLE_HTAB (its type is struct variable_def). */
1211 variable_htab_free (void *elem
)
1214 variable var
= (variable
) elem
;
1215 location_chain node
, next
;
1217 gcc_checking_assert (var
->refcount
> 0);
1220 if (var
->refcount
> 0)
1223 for (i
= 0; i
< var
->n_var_parts
; i
++)
1225 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= next
)
1228 pool_free (loc_chain_pool
, node
);
1230 var
->var_part
[i
].loc_chain
= NULL
;
1232 pool_free (dv_pool (var
->dv
), var
);
1235 /* The hash function for value_chains htab, computes the hash value
1239 value_chain_htab_hash (const void *x
)
1241 const_value_chain
const v
= (const_value_chain
) x
;
1243 return dv_htab_hash (v
->dv
);
1246 /* Compare the VALUE X with VALUE Y. */
1249 value_chain_htab_eq (const void *x
, const void *y
)
1251 const_value_chain
const v
= (const_value_chain
) x
;
1252 decl_or_value dv
= CONST_CAST2 (decl_or_value
, const void *, y
);
1254 return dv_as_opaque (v
->dv
) == dv_as_opaque (dv
);
1257 /* Initialize the set (array) SET of attrs to empty lists. */
1260 init_attrs_list_set (attrs
*set
)
1264 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1268 /* Make the list *LISTP empty. */
1271 attrs_list_clear (attrs
*listp
)
1275 for (list
= *listp
; list
; list
= next
)
1278 pool_free (attrs_pool
, list
);
1283 /* Return true if the pair of DECL and OFFSET is the member of the LIST. */
1286 attrs_list_member (attrs list
, decl_or_value dv
, HOST_WIDE_INT offset
)
1288 for (; list
; list
= list
->next
)
1289 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
) && list
->offset
== offset
)
1294 /* Insert the triplet DECL, OFFSET, LOC to the list *LISTP. */
1297 attrs_list_insert (attrs
*listp
, decl_or_value dv
,
1298 HOST_WIDE_INT offset
, rtx loc
)
1302 list
= (attrs
) pool_alloc (attrs_pool
);
1305 list
->offset
= offset
;
1306 list
->next
= *listp
;
1310 /* Copy all nodes from SRC and create a list *DSTP of the copies. */
1313 attrs_list_copy (attrs
*dstp
, attrs src
)
1317 attrs_list_clear (dstp
);
1318 for (; src
; src
= src
->next
)
1320 n
= (attrs
) pool_alloc (attrs_pool
);
1323 n
->offset
= src
->offset
;
1329 /* Add all nodes from SRC which are not in *DSTP to *DSTP. */
1332 attrs_list_union (attrs
*dstp
, attrs src
)
1334 for (; src
; src
= src
->next
)
1336 if (!attrs_list_member (*dstp
, src
->dv
, src
->offset
))
1337 attrs_list_insert (dstp
, src
->dv
, src
->offset
, src
->loc
);
1341 /* Combine nodes that are not onepart nodes from SRC and SRC2 into
1345 attrs_list_mpdv_union (attrs
*dstp
, attrs src
, attrs src2
)
1347 gcc_assert (!*dstp
);
1348 for (; src
; src
= src
->next
)
1350 if (!dv_onepart_p (src
->dv
))
1351 attrs_list_insert (dstp
, src
->dv
, src
->offset
, src
->loc
);
1353 for (src
= src2
; src
; src
= src
->next
)
1355 if (!dv_onepart_p (src
->dv
)
1356 && !attrs_list_member (*dstp
, src
->dv
, src
->offset
))
1357 attrs_list_insert (dstp
, src
->dv
, src
->offset
, src
->loc
);
1361 /* Shared hashtable support. */
1363 /* Return true if VARS is shared. */
1366 shared_hash_shared (shared_hash vars
)
1368 return vars
->refcount
> 1;
1371 /* Return the hash table for VARS. */
1373 static inline htab_t
1374 shared_hash_htab (shared_hash vars
)
1379 /* Return true if VAR is shared, or maybe because VARS is shared. */
1382 shared_var_p (variable var
, shared_hash vars
)
1384 /* Don't count an entry in the changed_variables table as a duplicate. */
1385 return ((var
->refcount
> 1 + (int) var
->in_changed_variables
)
1386 || shared_hash_shared (vars
));
1389 /* Copy variables into a new hash table. */
1392 shared_hash_unshare (shared_hash vars
)
1394 shared_hash new_vars
= (shared_hash
) pool_alloc (shared_hash_pool
);
1395 gcc_assert (vars
->refcount
> 1);
1396 new_vars
->refcount
= 1;
1398 = htab_create (htab_elements (vars
->htab
) + 3, variable_htab_hash
,
1399 variable_htab_eq
, variable_htab_free
);
1400 vars_copy (new_vars
->htab
, vars
->htab
);
1405 /* Increment reference counter on VARS and return it. */
1407 static inline shared_hash
1408 shared_hash_copy (shared_hash vars
)
1414 /* Decrement reference counter and destroy hash table if not shared
1418 shared_hash_destroy (shared_hash vars
)
1420 gcc_checking_assert (vars
->refcount
> 0);
1421 if (--vars
->refcount
== 0)
1423 htab_delete (vars
->htab
);
1424 pool_free (shared_hash_pool
, vars
);
1428 /* Unshare *PVARS if shared and return slot for DV. If INS is
1429 INSERT, insert it if not already present. */
1431 static inline void **
1432 shared_hash_find_slot_unshare_1 (shared_hash
*pvars
, decl_or_value dv
,
1433 hashval_t dvhash
, enum insert_option ins
)
1435 if (shared_hash_shared (*pvars
))
1436 *pvars
= shared_hash_unshare (*pvars
);
1437 return htab_find_slot_with_hash (shared_hash_htab (*pvars
), dv
, dvhash
, ins
);
1440 static inline void **
1441 shared_hash_find_slot_unshare (shared_hash
*pvars
, decl_or_value dv
,
1442 enum insert_option ins
)
1444 return shared_hash_find_slot_unshare_1 (pvars
, dv
, dv_htab_hash (dv
), ins
);
1447 /* Return slot for DV, if it is already present in the hash table.
1448 If it is not present, insert it only VARS is not shared, otherwise
1451 static inline void **
1452 shared_hash_find_slot_1 (shared_hash vars
, decl_or_value dv
, hashval_t dvhash
)
1454 return htab_find_slot_with_hash (shared_hash_htab (vars
), dv
, dvhash
,
1455 shared_hash_shared (vars
)
1456 ? NO_INSERT
: INSERT
);
1459 static inline void **
1460 shared_hash_find_slot (shared_hash vars
, decl_or_value dv
)
1462 return shared_hash_find_slot_1 (vars
, dv
, dv_htab_hash (dv
));
1465 /* Return slot for DV only if it is already present in the hash table. */
1467 static inline void **
1468 shared_hash_find_slot_noinsert_1 (shared_hash vars
, decl_or_value dv
,
1471 return htab_find_slot_with_hash (shared_hash_htab (vars
), dv
, dvhash
,
1475 static inline void **
1476 shared_hash_find_slot_noinsert (shared_hash vars
, decl_or_value dv
)
1478 return shared_hash_find_slot_noinsert_1 (vars
, dv
, dv_htab_hash (dv
));
1481 /* Return variable for DV or NULL if not already present in the hash
1484 static inline variable
1485 shared_hash_find_1 (shared_hash vars
, decl_or_value dv
, hashval_t dvhash
)
1487 return (variable
) htab_find_with_hash (shared_hash_htab (vars
), dv
, dvhash
);
1490 static inline variable
1491 shared_hash_find (shared_hash vars
, decl_or_value dv
)
1493 return shared_hash_find_1 (vars
, dv
, dv_htab_hash (dv
));
1496 /* Return true if TVAL is better than CVAL as a canonival value. We
1497 choose lowest-numbered VALUEs, using the RTX address as a
1498 tie-breaker. The idea is to arrange them into a star topology,
1499 such that all of them are at most one step away from the canonical
1500 value, and the canonical value has backlinks to all of them, in
1501 addition to all the actual locations. We don't enforce this
1502 topology throughout the entire dataflow analysis, though.
1506 canon_value_cmp (rtx tval
, rtx cval
)
1509 || CSELIB_VAL_PTR (tval
)->uid
< CSELIB_VAL_PTR (cval
)->uid
;
1512 static bool dst_can_be_shared
;
1514 /* Return a copy of a variable VAR and insert it to dataflow set SET. */
1517 unshare_variable (dataflow_set
*set
, void **slot
, variable var
,
1518 enum var_init_status initialized
)
1523 new_var
= (variable
) pool_alloc (dv_pool (var
->dv
));
1524 new_var
->dv
= var
->dv
;
1525 new_var
->refcount
= 1;
1527 new_var
->n_var_parts
= var
->n_var_parts
;
1528 new_var
->cur_loc_changed
= var
->cur_loc_changed
;
1529 var
->cur_loc_changed
= false;
1530 new_var
->in_changed_variables
= false;
1532 if (! flag_var_tracking_uninit
)
1533 initialized
= VAR_INIT_STATUS_INITIALIZED
;
1535 for (i
= 0; i
< var
->n_var_parts
; i
++)
1537 location_chain node
;
1538 location_chain
*nextp
;
1540 new_var
->var_part
[i
].offset
= var
->var_part
[i
].offset
;
1541 nextp
= &new_var
->var_part
[i
].loc_chain
;
1542 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
1544 location_chain new_lc
;
1546 new_lc
= (location_chain
) pool_alloc (loc_chain_pool
);
1547 new_lc
->next
= NULL
;
1548 if (node
->init
> initialized
)
1549 new_lc
->init
= node
->init
;
1551 new_lc
->init
= initialized
;
1552 if (node
->set_src
&& !(MEM_P (node
->set_src
)))
1553 new_lc
->set_src
= node
->set_src
;
1555 new_lc
->set_src
= NULL
;
1556 new_lc
->loc
= node
->loc
;
1559 nextp
= &new_lc
->next
;
1562 new_var
->var_part
[i
].cur_loc
= var
->var_part
[i
].cur_loc
;
1565 dst_can_be_shared
= false;
1566 if (shared_hash_shared (set
->vars
))
1567 slot
= shared_hash_find_slot_unshare (&set
->vars
, var
->dv
, NO_INSERT
);
1568 else if (set
->traversed_vars
&& set
->vars
!= set
->traversed_vars
)
1569 slot
= shared_hash_find_slot_noinsert (set
->vars
, var
->dv
);
1571 if (var
->in_changed_variables
)
1574 = htab_find_slot_with_hash (changed_variables
, var
->dv
,
1575 dv_htab_hash (var
->dv
), NO_INSERT
);
1576 gcc_assert (*cslot
== (void *) var
);
1577 var
->in_changed_variables
= false;
1578 variable_htab_free (var
);
1580 new_var
->in_changed_variables
= true;
1585 /* Copy all variables from hash table SRC to hash table DST. */
1588 vars_copy (htab_t dst
, htab_t src
)
1593 FOR_EACH_HTAB_ELEMENT (src
, var
, variable
, hi
)
1597 dstp
= htab_find_slot_with_hash (dst
, var
->dv
,
1598 dv_htab_hash (var
->dv
),
1604 /* Map a decl to its main debug decl. */
1607 var_debug_decl (tree decl
)
1609 if (decl
&& DECL_P (decl
)
1610 && DECL_DEBUG_EXPR_IS_FROM (decl
))
1612 tree debugdecl
= DECL_DEBUG_EXPR (decl
);
1613 if (debugdecl
&& DECL_P (debugdecl
))
1620 /* Set the register LOC to contain DV, OFFSET. */
1623 var_reg_decl_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
1624 decl_or_value dv
, HOST_WIDE_INT offset
, rtx set_src
,
1625 enum insert_option iopt
)
1628 bool decl_p
= dv_is_decl_p (dv
);
1631 dv
= dv_from_decl (var_debug_decl (dv_as_decl (dv
)));
1633 for (node
= set
->regs
[REGNO (loc
)]; node
; node
= node
->next
)
1634 if (dv_as_opaque (node
->dv
) == dv_as_opaque (dv
)
1635 && node
->offset
== offset
)
1638 attrs_list_insert (&set
->regs
[REGNO (loc
)], dv
, offset
, loc
);
1639 set_variable_part (set
, loc
, dv
, offset
, initialized
, set_src
, iopt
);
1642 /* Set the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). */
1645 var_reg_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
1648 tree decl
= REG_EXPR (loc
);
1649 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
1651 var_reg_decl_set (set
, loc
, initialized
,
1652 dv_from_decl (decl
), offset
, set_src
, INSERT
);
1655 static enum var_init_status
1656 get_init_value (dataflow_set
*set
, rtx loc
, decl_or_value dv
)
1660 enum var_init_status ret_val
= VAR_INIT_STATUS_UNKNOWN
;
1662 if (! flag_var_tracking_uninit
)
1663 return VAR_INIT_STATUS_INITIALIZED
;
1665 var
= shared_hash_find (set
->vars
, dv
);
1668 for (i
= 0; i
< var
->n_var_parts
&& ret_val
== VAR_INIT_STATUS_UNKNOWN
; i
++)
1670 location_chain nextp
;
1671 for (nextp
= var
->var_part
[i
].loc_chain
; nextp
; nextp
= nextp
->next
)
1672 if (rtx_equal_p (nextp
->loc
, loc
))
1674 ret_val
= nextp
->init
;
1683 /* Delete current content of register LOC in dataflow set SET and set
1684 the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). If
1685 MODIFY is true, any other live copies of the same variable part are
1686 also deleted from the dataflow set, otherwise the variable part is
1687 assumed to be copied from another location holding the same
1691 var_reg_delete_and_set (dataflow_set
*set
, rtx loc
, bool modify
,
1692 enum var_init_status initialized
, rtx set_src
)
1694 tree decl
= REG_EXPR (loc
);
1695 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
1699 decl
= var_debug_decl (decl
);
1701 if (initialized
== VAR_INIT_STATUS_UNKNOWN
)
1702 initialized
= get_init_value (set
, loc
, dv_from_decl (decl
));
1704 nextp
= &set
->regs
[REGNO (loc
)];
1705 for (node
= *nextp
; node
; node
= next
)
1708 if (dv_as_opaque (node
->dv
) != decl
|| node
->offset
!= offset
)
1710 delete_variable_part (set
, node
->loc
, node
->dv
, node
->offset
);
1711 pool_free (attrs_pool
, node
);
1717 nextp
= &node
->next
;
1721 clobber_variable_part (set
, loc
, dv_from_decl (decl
), offset
, set_src
);
1722 var_reg_set (set
, loc
, initialized
, set_src
);
1725 /* Delete the association of register LOC in dataflow set SET with any
1726 variables that aren't onepart. If CLOBBER is true, also delete any
1727 other live copies of the same variable part, and delete the
1728 association with onepart dvs too. */
1731 var_reg_delete (dataflow_set
*set
, rtx loc
, bool clobber
)
1733 attrs
*nextp
= &set
->regs
[REGNO (loc
)];
1738 tree decl
= REG_EXPR (loc
);
1739 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
1741 decl
= var_debug_decl (decl
);
1743 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, NULL
);
1746 for (node
= *nextp
; node
; node
= next
)
1749 if (clobber
|| !dv_onepart_p (node
->dv
))
1751 delete_variable_part (set
, node
->loc
, node
->dv
, node
->offset
);
1752 pool_free (attrs_pool
, node
);
1756 nextp
= &node
->next
;
1760 /* Delete content of register with number REGNO in dataflow set SET. */
1763 var_regno_delete (dataflow_set
*set
, int regno
)
1765 attrs
*reg
= &set
->regs
[regno
];
1768 for (node
= *reg
; node
; node
= next
)
1771 delete_variable_part (set
, node
->loc
, node
->dv
, node
->offset
);
1772 pool_free (attrs_pool
, node
);
1777 /* Set the location of DV, OFFSET as the MEM LOC. */
1780 var_mem_decl_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
1781 decl_or_value dv
, HOST_WIDE_INT offset
, rtx set_src
,
1782 enum insert_option iopt
)
1784 if (dv_is_decl_p (dv
))
1785 dv
= dv_from_decl (var_debug_decl (dv_as_decl (dv
)));
1787 set_variable_part (set
, loc
, dv
, offset
, initialized
, set_src
, iopt
);
1790 /* Set the location part of variable MEM_EXPR (LOC) in dataflow set
1792 Adjust the address first if it is stack pointer based. */
1795 var_mem_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
1798 tree decl
= MEM_EXPR (loc
);
1799 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
1801 var_mem_decl_set (set
, loc
, initialized
,
1802 dv_from_decl (decl
), offset
, set_src
, INSERT
);
1805 /* Delete and set the location part of variable MEM_EXPR (LOC) in
1806 dataflow set SET to LOC. If MODIFY is true, any other live copies
1807 of the same variable part are also deleted from the dataflow set,
1808 otherwise the variable part is assumed to be copied from another
1809 location holding the same part.
1810 Adjust the address first if it is stack pointer based. */
1813 var_mem_delete_and_set (dataflow_set
*set
, rtx loc
, bool modify
,
1814 enum var_init_status initialized
, rtx set_src
)
1816 tree decl
= MEM_EXPR (loc
);
1817 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
1819 decl
= var_debug_decl (decl
);
1821 if (initialized
== VAR_INIT_STATUS_UNKNOWN
)
1822 initialized
= get_init_value (set
, loc
, dv_from_decl (decl
));
1825 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, set_src
);
1826 var_mem_set (set
, loc
, initialized
, set_src
);
1829 /* Delete the location part LOC from dataflow set SET. If CLOBBER is
1830 true, also delete any other live copies of the same variable part.
1831 Adjust the address first if it is stack pointer based. */
1834 var_mem_delete (dataflow_set
*set
, rtx loc
, bool clobber
)
1836 tree decl
= MEM_EXPR (loc
);
1837 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
1839 decl
= var_debug_decl (decl
);
1841 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, NULL
);
1842 delete_variable_part (set
, loc
, dv_from_decl (decl
), offset
);
1845 /* Bind a value to a location it was just stored in. If MODIFIED
1846 holds, assume the location was modified, detaching it from any
1847 values bound to it. */
1850 val_store (dataflow_set
*set
, rtx val
, rtx loc
, rtx insn
, bool modified
)
1852 cselib_val
*v
= CSELIB_VAL_PTR (val
);
1854 gcc_assert (cselib_preserved_value_p (v
));
1858 fprintf (dump_file
, "%i: ", INSN_UID (insn
));
1859 print_inline_rtx (dump_file
, val
, 0);
1860 fprintf (dump_file
, " stored in ");
1861 print_inline_rtx (dump_file
, loc
, 0);
1864 struct elt_loc_list
*l
;
1865 for (l
= v
->locs
; l
; l
= l
->next
)
1867 fprintf (dump_file
, "\n%i: ", INSN_UID (l
->setting_insn
));
1868 print_inline_rtx (dump_file
, l
->loc
, 0);
1871 fprintf (dump_file
, "\n");
1877 var_regno_delete (set
, REGNO (loc
));
1878 var_reg_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
1879 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
1881 else if (MEM_P (loc
))
1882 var_mem_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
1883 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
1885 set_variable_part (set
, loc
, dv_from_value (val
), 0,
1886 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
1889 /* Reset this node, detaching all its equivalences. Return the slot
1890 in the variable hash table that holds dv, if there is one. */
1893 val_reset (dataflow_set
*set
, decl_or_value dv
)
1895 variable var
= shared_hash_find (set
->vars
, dv
) ;
1896 location_chain node
;
1899 if (!var
|| !var
->n_var_parts
)
1902 gcc_assert (var
->n_var_parts
== 1);
1905 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
1906 if (GET_CODE (node
->loc
) == VALUE
1907 && canon_value_cmp (node
->loc
, cval
))
1910 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
1911 if (GET_CODE (node
->loc
) == VALUE
&& cval
!= node
->loc
)
1913 /* Redirect the equivalence link to the new canonical
1914 value, or simply remove it if it would point at
1917 set_variable_part (set
, cval
, dv_from_value (node
->loc
),
1918 0, node
->init
, node
->set_src
, NO_INSERT
);
1919 delete_variable_part (set
, dv_as_value (dv
),
1920 dv_from_value (node
->loc
), 0);
1925 decl_or_value cdv
= dv_from_value (cval
);
1927 /* Keep the remaining values connected, accummulating links
1928 in the canonical value. */
1929 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
1931 if (node
->loc
== cval
)
1933 else if (GET_CODE (node
->loc
) == REG
)
1934 var_reg_decl_set (set
, node
->loc
, node
->init
, cdv
, 0,
1935 node
->set_src
, NO_INSERT
);
1936 else if (GET_CODE (node
->loc
) == MEM
)
1937 var_mem_decl_set (set
, node
->loc
, node
->init
, cdv
, 0,
1938 node
->set_src
, NO_INSERT
);
1940 set_variable_part (set
, node
->loc
, cdv
, 0,
1941 node
->init
, node
->set_src
, NO_INSERT
);
1945 /* We remove this last, to make sure that the canonical value is not
1946 removed to the point of requiring reinsertion. */
1948 delete_variable_part (set
, dv_as_value (dv
), dv_from_value (cval
), 0);
1950 clobber_variable_part (set
, NULL
, dv
, 0, NULL
);
1952 /* ??? Should we make sure there aren't other available values or
1953 variables whose values involve this one other than by
1954 equivalence? E.g., at the very least we should reset MEMs, those
1955 shouldn't be too hard to find cselib-looking up the value as an
1956 address, then locating the resulting value in our own hash
1960 /* Find the values in a given location and map the val to another
1961 value, if it is unique, or add the location as one holding the
1965 val_resolve (dataflow_set
*set
, rtx val
, rtx loc
, rtx insn
)
1967 decl_or_value dv
= dv_from_value (val
);
1969 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1972 fprintf (dump_file
, "%i: ", INSN_UID (insn
));
1974 fprintf (dump_file
, "head: ");
1975 print_inline_rtx (dump_file
, val
, 0);
1976 fputs (" is at ", dump_file
);
1977 print_inline_rtx (dump_file
, loc
, 0);
1978 fputc ('\n', dump_file
);
1981 val_reset (set
, dv
);
1985 attrs node
, found
= NULL
;
1987 for (node
= set
->regs
[REGNO (loc
)]; node
; node
= node
->next
)
1988 if (dv_is_value_p (node
->dv
)
1989 && GET_MODE (dv_as_value (node
->dv
)) == GET_MODE (loc
))
1993 /* Map incoming equivalences. ??? Wouldn't it be nice if
1994 we just started sharing the location lists? Maybe a
1995 circular list ending at the value itself or some
1997 set_variable_part (set
, dv_as_value (node
->dv
),
1998 dv_from_value (val
), node
->offset
,
1999 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2000 set_variable_part (set
, val
, node
->dv
, node
->offset
,
2001 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2004 /* If we didn't find any equivalence, we need to remember that
2005 this value is held in the named register. */
2007 var_reg_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
2008 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
2010 else if (MEM_P (loc
))
2011 /* ??? Merge equivalent MEMs. */
2012 var_mem_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
2013 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
2015 /* ??? Merge equivalent expressions. */
2016 set_variable_part (set
, loc
, dv_from_value (val
), 0,
2017 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2020 /* Initialize dataflow set SET to be empty.
2021 VARS_SIZE is the initial size of hash table VARS. */
2024 dataflow_set_init (dataflow_set
*set
)
2026 init_attrs_list_set (set
->regs
);
2027 set
->vars
= shared_hash_copy (empty_shared_hash
);
2028 set
->stack_adjust
= 0;
2029 set
->traversed_vars
= NULL
;
2032 /* Delete the contents of dataflow set SET. */
2035 dataflow_set_clear (dataflow_set
*set
)
2039 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2040 attrs_list_clear (&set
->regs
[i
]);
2042 shared_hash_destroy (set
->vars
);
2043 set
->vars
= shared_hash_copy (empty_shared_hash
);
2046 /* Copy the contents of dataflow set SRC to DST. */
2049 dataflow_set_copy (dataflow_set
*dst
, dataflow_set
*src
)
2053 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2054 attrs_list_copy (&dst
->regs
[i
], src
->regs
[i
]);
2056 shared_hash_destroy (dst
->vars
);
2057 dst
->vars
= shared_hash_copy (src
->vars
);
2058 dst
->stack_adjust
= src
->stack_adjust
;
2061 /* Information for merging lists of locations for a given offset of variable.
2063 struct variable_union_info
2065 /* Node of the location chain. */
2068 /* The sum of positions in the input chains. */
2071 /* The position in the chain of DST dataflow set. */
2075 /* Buffer for location list sorting and its allocated size. */
2076 static struct variable_union_info
*vui_vec
;
2077 static int vui_allocated
;
2079 /* Compare function for qsort, order the structures by POS element. */
2082 variable_union_info_cmp_pos (const void *n1
, const void *n2
)
2084 const struct variable_union_info
*const i1
=
2085 (const struct variable_union_info
*) n1
;
2086 const struct variable_union_info
*const i2
=
2087 ( const struct variable_union_info
*) n2
;
2089 if (i1
->pos
!= i2
->pos
)
2090 return i1
->pos
- i2
->pos
;
2092 return (i1
->pos_dst
- i2
->pos_dst
);
2095 /* Compute union of location parts of variable *SLOT and the same variable
2096 from hash table DATA. Compute "sorted" union of the location chains
2097 for common offsets, i.e. the locations of a variable part are sorted by
2098 a priority where the priority is the sum of the positions in the 2 chains
2099 (if a location is only in one list the position in the second list is
2100 defined to be larger than the length of the chains).
2101 When we are updating the location parts the newest location is in the
2102 beginning of the chain, so when we do the described "sorted" union
2103 we keep the newest locations in the beginning. */
2106 variable_union (variable src
, dataflow_set
*set
)
2112 dstp
= shared_hash_find_slot (set
->vars
, src
->dv
);
2113 if (!dstp
|| !*dstp
)
2117 dst_can_be_shared
= false;
2119 dstp
= shared_hash_find_slot_unshare (&set
->vars
, src
->dv
, INSERT
);
2123 /* Continue traversing the hash table. */
2127 dst
= (variable
) *dstp
;
2129 gcc_assert (src
->n_var_parts
);
2131 /* We can combine one-part variables very efficiently, because their
2132 entries are in canonical order. */
2133 if (dv_onepart_p (src
->dv
))
2135 location_chain
*nodep
, dnode
, snode
;
2137 gcc_assert (src
->n_var_parts
== 1
2138 && dst
->n_var_parts
== 1);
2140 snode
= src
->var_part
[0].loc_chain
;
2143 restart_onepart_unshared
:
2144 nodep
= &dst
->var_part
[0].loc_chain
;
2150 int r
= dnode
? loc_cmp (dnode
->loc
, snode
->loc
) : 1;
2154 location_chain nnode
;
2156 if (shared_var_p (dst
, set
->vars
))
2158 dstp
= unshare_variable (set
, dstp
, dst
,
2159 VAR_INIT_STATUS_INITIALIZED
);
2160 dst
= (variable
)*dstp
;
2161 goto restart_onepart_unshared
;
2164 *nodep
= nnode
= (location_chain
) pool_alloc (loc_chain_pool
);
2165 nnode
->loc
= snode
->loc
;
2166 nnode
->init
= snode
->init
;
2167 if (!snode
->set_src
|| MEM_P (snode
->set_src
))
2168 nnode
->set_src
= NULL
;
2170 nnode
->set_src
= snode
->set_src
;
2171 nnode
->next
= dnode
;
2175 gcc_checking_assert (rtx_equal_p (dnode
->loc
, snode
->loc
));
2178 snode
= snode
->next
;
2180 nodep
= &dnode
->next
;
2187 /* Count the number of location parts, result is K. */
2188 for (i
= 0, j
= 0, k
= 0;
2189 i
< src
->n_var_parts
&& j
< dst
->n_var_parts
; k
++)
2191 if (src
->var_part
[i
].offset
== dst
->var_part
[j
].offset
)
2196 else if (src
->var_part
[i
].offset
< dst
->var_part
[j
].offset
)
2201 k
+= src
->n_var_parts
- i
;
2202 k
+= dst
->n_var_parts
- j
;
2204 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
2205 thus there are at most MAX_VAR_PARTS different offsets. */
2206 gcc_assert (dv_onepart_p (dst
->dv
) ? k
== 1 : k
<= MAX_VAR_PARTS
);
2208 if (dst
->n_var_parts
!= k
&& shared_var_p (dst
, set
->vars
))
2210 dstp
= unshare_variable (set
, dstp
, dst
, VAR_INIT_STATUS_UNKNOWN
);
2211 dst
= (variable
)*dstp
;
2214 i
= src
->n_var_parts
- 1;
2215 j
= dst
->n_var_parts
- 1;
2216 dst
->n_var_parts
= k
;
2218 for (k
--; k
>= 0; k
--)
2220 location_chain node
, node2
;
2222 if (i
>= 0 && j
>= 0
2223 && src
->var_part
[i
].offset
== dst
->var_part
[j
].offset
)
2225 /* Compute the "sorted" union of the chains, i.e. the locations which
2226 are in both chains go first, they are sorted by the sum of
2227 positions in the chains. */
2230 struct variable_union_info
*vui
;
2232 /* If DST is shared compare the location chains.
2233 If they are different we will modify the chain in DST with
2234 high probability so make a copy of DST. */
2235 if (shared_var_p (dst
, set
->vars
))
2237 for (node
= src
->var_part
[i
].loc_chain
,
2238 node2
= dst
->var_part
[j
].loc_chain
; node
&& node2
;
2239 node
= node
->next
, node2
= node2
->next
)
2241 if (!((REG_P (node2
->loc
)
2242 && REG_P (node
->loc
)
2243 && REGNO (node2
->loc
) == REGNO (node
->loc
))
2244 || rtx_equal_p (node2
->loc
, node
->loc
)))
2246 if (node2
->init
< node
->init
)
2247 node2
->init
= node
->init
;
2253 dstp
= unshare_variable (set
, dstp
, dst
,
2254 VAR_INIT_STATUS_UNKNOWN
);
2255 dst
= (variable
)*dstp
;
2260 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2263 for (node
= dst
->var_part
[j
].loc_chain
; node
; node
= node
->next
)
2268 /* The most common case, much simpler, no qsort is needed. */
2269 location_chain dstnode
= dst
->var_part
[j
].loc_chain
;
2270 dst
->var_part
[k
].loc_chain
= dstnode
;
2271 dst
->var_part
[k
].offset
= dst
->var_part
[j
].offset
;
2273 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2274 if (!((REG_P (dstnode
->loc
)
2275 && REG_P (node
->loc
)
2276 && REGNO (dstnode
->loc
) == REGNO (node
->loc
))
2277 || rtx_equal_p (dstnode
->loc
, node
->loc
)))
2279 location_chain new_node
;
2281 /* Copy the location from SRC. */
2282 new_node
= (location_chain
) pool_alloc (loc_chain_pool
);
2283 new_node
->loc
= node
->loc
;
2284 new_node
->init
= node
->init
;
2285 if (!node
->set_src
|| MEM_P (node
->set_src
))
2286 new_node
->set_src
= NULL
;
2288 new_node
->set_src
= node
->set_src
;
2289 node2
->next
= new_node
;
2296 if (src_l
+ dst_l
> vui_allocated
)
2298 vui_allocated
= MAX (vui_allocated
* 2, src_l
+ dst_l
);
2299 vui_vec
= XRESIZEVEC (struct variable_union_info
, vui_vec
,
2304 /* Fill in the locations from DST. */
2305 for (node
= dst
->var_part
[j
].loc_chain
, jj
= 0; node
;
2306 node
= node
->next
, jj
++)
2309 vui
[jj
].pos_dst
= jj
;
2311 /* Pos plus value larger than a sum of 2 valid positions. */
2312 vui
[jj
].pos
= jj
+ src_l
+ dst_l
;
2315 /* Fill in the locations from SRC. */
2317 for (node
= src
->var_part
[i
].loc_chain
, ii
= 0; node
;
2318 node
= node
->next
, ii
++)
2320 /* Find location from NODE. */
2321 for (jj
= 0; jj
< dst_l
; jj
++)
2323 if ((REG_P (vui
[jj
].lc
->loc
)
2324 && REG_P (node
->loc
)
2325 && REGNO (vui
[jj
].lc
->loc
) == REGNO (node
->loc
))
2326 || rtx_equal_p (vui
[jj
].lc
->loc
, node
->loc
))
2328 vui
[jj
].pos
= jj
+ ii
;
2332 if (jj
>= dst_l
) /* The location has not been found. */
2334 location_chain new_node
;
2336 /* Copy the location from SRC. */
2337 new_node
= (location_chain
) pool_alloc (loc_chain_pool
);
2338 new_node
->loc
= node
->loc
;
2339 new_node
->init
= node
->init
;
2340 if (!node
->set_src
|| MEM_P (node
->set_src
))
2341 new_node
->set_src
= NULL
;
2343 new_node
->set_src
= node
->set_src
;
2344 vui
[n
].lc
= new_node
;
2345 vui
[n
].pos_dst
= src_l
+ dst_l
;
2346 vui
[n
].pos
= ii
+ src_l
+ dst_l
;
2353 /* Special case still very common case. For dst_l == 2
2354 all entries dst_l ... n-1 are sorted, with for i >= dst_l
2355 vui[i].pos == i + src_l + dst_l. */
2356 if (vui
[0].pos
> vui
[1].pos
)
2358 /* Order should be 1, 0, 2... */
2359 dst
->var_part
[k
].loc_chain
= vui
[1].lc
;
2360 vui
[1].lc
->next
= vui
[0].lc
;
2363 vui
[0].lc
->next
= vui
[2].lc
;
2364 vui
[n
- 1].lc
->next
= NULL
;
2367 vui
[0].lc
->next
= NULL
;
2372 dst
->var_part
[k
].loc_chain
= vui
[0].lc
;
2373 if (n
>= 3 && vui
[2].pos
< vui
[1].pos
)
2375 /* Order should be 0, 2, 1, 3... */
2376 vui
[0].lc
->next
= vui
[2].lc
;
2377 vui
[2].lc
->next
= vui
[1].lc
;
2380 vui
[1].lc
->next
= vui
[3].lc
;
2381 vui
[n
- 1].lc
->next
= NULL
;
2384 vui
[1].lc
->next
= NULL
;
2389 /* Order should be 0, 1, 2... */
2391 vui
[n
- 1].lc
->next
= NULL
;
2394 for (; ii
< n
; ii
++)
2395 vui
[ii
- 1].lc
->next
= vui
[ii
].lc
;
2399 qsort (vui
, n
, sizeof (struct variable_union_info
),
2400 variable_union_info_cmp_pos
);
2402 /* Reconnect the nodes in sorted order. */
2403 for (ii
= 1; ii
< n
; ii
++)
2404 vui
[ii
- 1].lc
->next
= vui
[ii
].lc
;
2405 vui
[n
- 1].lc
->next
= NULL
;
2406 dst
->var_part
[k
].loc_chain
= vui
[0].lc
;
2409 dst
->var_part
[k
].offset
= dst
->var_part
[j
].offset
;
2414 else if ((i
>= 0 && j
>= 0
2415 && src
->var_part
[i
].offset
< dst
->var_part
[j
].offset
)
2418 dst
->var_part
[k
] = dst
->var_part
[j
];
2421 else if ((i
>= 0 && j
>= 0
2422 && src
->var_part
[i
].offset
> dst
->var_part
[j
].offset
)
2425 location_chain
*nextp
;
2427 /* Copy the chain from SRC. */
2428 nextp
= &dst
->var_part
[k
].loc_chain
;
2429 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2431 location_chain new_lc
;
2433 new_lc
= (location_chain
) pool_alloc (loc_chain_pool
);
2434 new_lc
->next
= NULL
;
2435 new_lc
->init
= node
->init
;
2436 if (!node
->set_src
|| MEM_P (node
->set_src
))
2437 new_lc
->set_src
= NULL
;
2439 new_lc
->set_src
= node
->set_src
;
2440 new_lc
->loc
= node
->loc
;
2443 nextp
= &new_lc
->next
;
2446 dst
->var_part
[k
].offset
= src
->var_part
[i
].offset
;
2449 dst
->var_part
[k
].cur_loc
= NULL
;
2452 if (flag_var_tracking_uninit
)
2453 for (i
= 0; i
< src
->n_var_parts
&& i
< dst
->n_var_parts
; i
++)
2455 location_chain node
, node2
;
2456 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2457 for (node2
= dst
->var_part
[i
].loc_chain
; node2
; node2
= node2
->next
)
2458 if (rtx_equal_p (node
->loc
, node2
->loc
))
2460 if (node
->init
> node2
->init
)
2461 node2
->init
= node
->init
;
2465 /* Continue traversing the hash table. */
2469 /* Compute union of dataflow sets SRC and DST and store it to DST. */
2472 dataflow_set_union (dataflow_set
*dst
, dataflow_set
*src
)
2476 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2477 attrs_list_union (&dst
->regs
[i
], src
->regs
[i
]);
2479 if (dst
->vars
== empty_shared_hash
)
2481 shared_hash_destroy (dst
->vars
);
2482 dst
->vars
= shared_hash_copy (src
->vars
);
2489 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (src
->vars
), var
, variable
, hi
)
2490 variable_union (var
, dst
);
2494 /* Whether the value is currently being expanded. */
2495 #define VALUE_RECURSED_INTO(x) \
2496 (RTL_FLAG_CHECK2 ("VALUE_RECURSED_INTO", (x), VALUE, DEBUG_EXPR)->used)
2497 /* Whether the value is in changed_variables hash table. */
2498 #define VALUE_CHANGED(x) \
2499 (RTL_FLAG_CHECK1 ("VALUE_CHANGED", (x), VALUE)->frame_related)
2500 /* Whether the decl is in changed_variables hash table. */
2501 #define DECL_CHANGED(x) TREE_VISITED (x)
2503 /* Record that DV has been added into resp. removed from changed_variables
2507 set_dv_changed (decl_or_value dv
, bool newv
)
2509 if (dv_is_value_p (dv
))
2510 VALUE_CHANGED (dv_as_value (dv
)) = newv
;
2512 DECL_CHANGED (dv_as_decl (dv
)) = newv
;
2515 /* Return true if DV is present in changed_variables hash table. */
2518 dv_changed_p (decl_or_value dv
)
2520 return (dv_is_value_p (dv
)
2521 ? VALUE_CHANGED (dv_as_value (dv
))
2522 : DECL_CHANGED (dv_as_decl (dv
)));
2525 /* Return a location list node whose loc is rtx_equal to LOC, in the
2526 location list of a one-part variable or value VAR, or in that of
2527 any values recursively mentioned in the location lists. VARS must
2528 be in star-canonical form. */
2530 static location_chain
2531 find_loc_in_1pdv (rtx loc
, variable var
, htab_t vars
)
2533 location_chain node
;
2534 enum rtx_code loc_code
;
2539 gcc_checking_assert (dv_onepart_p (var
->dv
));
2541 if (!var
->n_var_parts
)
2544 gcc_checking_assert (var
->var_part
[0].offset
== 0);
2545 gcc_checking_assert (loc
!= dv_as_opaque (var
->dv
));
2547 loc_code
= GET_CODE (loc
);
2548 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
2553 if (GET_CODE (node
->loc
) != loc_code
)
2555 if (GET_CODE (node
->loc
) != VALUE
)
2558 else if (loc
== node
->loc
)
2560 else if (loc_code
!= VALUE
)
2562 if (rtx_equal_p (loc
, node
->loc
))
2567 /* Since we're in star-canonical form, we don't need to visit
2568 non-canonical nodes: one-part variables and non-canonical
2569 values would only point back to the canonical node. */
2570 if (dv_is_value_p (var
->dv
)
2571 && !canon_value_cmp (node
->loc
, dv_as_value (var
->dv
)))
2573 /* Skip all subsequent VALUEs. */
2574 while (node
->next
&& GET_CODE (node
->next
->loc
) == VALUE
)
2577 gcc_checking_assert (!canon_value_cmp (node
->loc
,
2578 dv_as_value (var
->dv
)));
2579 if (loc
== node
->loc
)
2585 gcc_checking_assert (node
== var
->var_part
[0].loc_chain
);
2586 gcc_checking_assert (!node
->next
);
2588 dv
= dv_from_value (node
->loc
);
2589 rvar
= (variable
) htab_find_with_hash (vars
, dv
, dv_htab_hash (dv
));
2590 return find_loc_in_1pdv (loc
, rvar
, vars
);
2596 /* Hash table iteration argument passed to variable_merge. */
2599 /* The set in which the merge is to be inserted. */
2601 /* The set that we're iterating in. */
2603 /* The set that may contain the other dv we are to merge with. */
2605 /* Number of onepart dvs in src. */
2606 int src_onepart_cnt
;
2609 /* Insert LOC in *DNODE, if it's not there yet. The list must be in
2610 loc_cmp order, and it is maintained as such. */
2613 insert_into_intersection (location_chain
*nodep
, rtx loc
,
2614 enum var_init_status status
)
2616 location_chain node
;
2619 for (node
= *nodep
; node
; nodep
= &node
->next
, node
= *nodep
)
2620 if ((r
= loc_cmp (node
->loc
, loc
)) == 0)
2622 node
->init
= MIN (node
->init
, status
);
2628 node
= (location_chain
) pool_alloc (loc_chain_pool
);
2631 node
->set_src
= NULL
;
2632 node
->init
= status
;
2633 node
->next
= *nodep
;
2637 /* Insert in DEST the intersection the locations present in both
2638 S1NODE and S2VAR, directly or indirectly. S1NODE is from a
2639 variable in DSM->cur, whereas S2VAR is from DSM->src. dvar is in
2643 intersect_loc_chains (rtx val
, location_chain
*dest
, struct dfset_merge
*dsm
,
2644 location_chain s1node
, variable s2var
)
2646 dataflow_set
*s1set
= dsm
->cur
;
2647 dataflow_set
*s2set
= dsm
->src
;
2648 location_chain found
;
2652 location_chain s2node
;
2654 gcc_checking_assert (dv_onepart_p (s2var
->dv
));
2656 if (s2var
->n_var_parts
)
2658 gcc_checking_assert (s2var
->var_part
[0].offset
== 0);
2659 s2node
= s2var
->var_part
[0].loc_chain
;
2661 for (; s1node
&& s2node
;
2662 s1node
= s1node
->next
, s2node
= s2node
->next
)
2663 if (s1node
->loc
!= s2node
->loc
)
2665 else if (s1node
->loc
== val
)
2668 insert_into_intersection (dest
, s1node
->loc
,
2669 MIN (s1node
->init
, s2node
->init
));
2673 for (; s1node
; s1node
= s1node
->next
)
2675 if (s1node
->loc
== val
)
2678 if ((found
= find_loc_in_1pdv (s1node
->loc
, s2var
,
2679 shared_hash_htab (s2set
->vars
))))
2681 insert_into_intersection (dest
, s1node
->loc
,
2682 MIN (s1node
->init
, found
->init
));
2686 if (GET_CODE (s1node
->loc
) == VALUE
2687 && !VALUE_RECURSED_INTO (s1node
->loc
))
2689 decl_or_value dv
= dv_from_value (s1node
->loc
);
2690 variable svar
= shared_hash_find (s1set
->vars
, dv
);
2693 if (svar
->n_var_parts
== 1)
2695 VALUE_RECURSED_INTO (s1node
->loc
) = true;
2696 intersect_loc_chains (val
, dest
, dsm
,
2697 svar
->var_part
[0].loc_chain
,
2699 VALUE_RECURSED_INTO (s1node
->loc
) = false;
2704 /* ??? if the location is equivalent to any location in src,
2705 searched recursively
2707 add to dst the values needed to represent the equivalence
2709 telling whether locations S is equivalent to another dv's
2712 for each location D in the list
2714 if S and D satisfy rtx_equal_p, then it is present
2716 else if D is a value, recurse without cycles
2718 else if S and D have the same CODE and MODE
2720 for each operand oS and the corresponding oD
2722 if oS and oD are not equivalent, then S an D are not equivalent
2724 else if they are RTX vectors
2726 if any vector oS element is not equivalent to its respective oD,
2727 then S and D are not equivalent
2735 /* Return -1 if X should be before Y in a location list for a 1-part
2736 variable, 1 if Y should be before X, and 0 if they're equivalent
2737 and should not appear in the list. */
2740 loc_cmp (rtx x
, rtx y
)
2743 RTX_CODE code
= GET_CODE (x
);
2753 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
2754 if (REGNO (x
) == REGNO (y
))
2756 else if (REGNO (x
) < REGNO (y
))
2769 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
2770 return loc_cmp (XEXP (x
, 0), XEXP (y
, 0));
2776 if (GET_CODE (x
) == VALUE
)
2778 if (GET_CODE (y
) != VALUE
)
2780 /* Don't assert the modes are the same, that is true only
2781 when not recursing. (subreg:QI (value:SI 1:1) 0)
2782 and (subreg:QI (value:DI 2:2) 0) can be compared,
2783 even when the modes are different. */
2784 if (canon_value_cmp (x
, y
))
2790 if (GET_CODE (y
) == VALUE
)
2793 if (GET_CODE (x
) == GET_CODE (y
))
2794 /* Compare operands below. */;
2795 else if (GET_CODE (x
) < GET_CODE (y
))
2800 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
2802 if (GET_CODE (x
) == DEBUG_EXPR
)
2804 if (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x
))
2805 < DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y
)))
2807 gcc_checking_assert (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x
))
2808 > DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y
)));
2812 fmt
= GET_RTX_FORMAT (code
);
2813 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
2817 if (XWINT (x
, i
) == XWINT (y
, i
))
2819 else if (XWINT (x
, i
) < XWINT (y
, i
))
2826 if (XINT (x
, i
) == XINT (y
, i
))
2828 else if (XINT (x
, i
) < XINT (y
, i
))
2835 /* Compare the vector length first. */
2836 if (XVECLEN (x
, i
) == XVECLEN (y
, i
))
2837 /* Compare the vectors elements. */;
2838 else if (XVECLEN (x
, i
) < XVECLEN (y
, i
))
2843 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
2844 if ((r
= loc_cmp (XVECEXP (x
, i
, j
),
2845 XVECEXP (y
, i
, j
))))
2850 if ((r
= loc_cmp (XEXP (x
, i
), XEXP (y
, i
))))
2856 if (XSTR (x
, i
) == XSTR (y
, i
))
2862 if ((r
= strcmp (XSTR (x
, i
), XSTR (y
, i
))) == 0)
2870 /* These are just backpointers, so they don't matter. */
2877 /* It is believed that rtx's at this level will never
2878 contain anything but integers and other rtx's,
2879 except for within LABEL_REFs and SYMBOL_REFs. */
2887 /* If decl or value DVP refers to VALUE from *LOC, add backlinks
2888 from VALUE to DVP. */
2891 add_value_chain (rtx
*loc
, void *dvp
)
2893 decl_or_value dv
, ldv
;
2894 value_chain vc
, nvc
;
2897 if (GET_CODE (*loc
) == VALUE
)
2898 ldv
= dv_from_value (*loc
);
2899 else if (GET_CODE (*loc
) == DEBUG_EXPR
)
2900 ldv
= dv_from_decl (DEBUG_EXPR_TREE_DECL (*loc
));
2904 if (dv_as_opaque (ldv
) == dvp
)
2907 dv
= (decl_or_value
) dvp
;
2908 slot
= htab_find_slot_with_hash (value_chains
, ldv
, dv_htab_hash (ldv
),
2912 vc
= (value_chain
) pool_alloc (value_chain_pool
);
2916 *slot
= (void *) vc
;
2920 for (vc
= ((value_chain
) *slot
)->next
; vc
; vc
= vc
->next
)
2921 if (dv_as_opaque (vc
->dv
) == dv_as_opaque (dv
))
2929 vc
= (value_chain
) *slot
;
2930 nvc
= (value_chain
) pool_alloc (value_chain_pool
);
2932 nvc
->next
= vc
->next
;
2938 /* If decl or value DVP refers to VALUEs from within LOC, add backlinks
2939 from those VALUEs to DVP. */
2942 add_value_chains (decl_or_value dv
, rtx loc
)
2944 if (GET_CODE (loc
) == VALUE
|| GET_CODE (loc
) == DEBUG_EXPR
)
2946 add_value_chain (&loc
, dv_as_opaque (dv
));
2952 loc
= XEXP (loc
, 0);
2953 for_each_rtx (&loc
, add_value_chain
, dv_as_opaque (dv
));
2956 /* If CSELIB_VAL_PTR of value DV refer to VALUEs, add backlinks from those
2957 VALUEs to DV. Add the same time get rid of ASM_OPERANDS from locs list,
2958 that is something we never can express in .debug_info and can prevent
2959 reverse ops from being used. */
2962 add_cselib_value_chains (decl_or_value dv
)
2964 struct elt_loc_list
**l
;
2966 for (l
= &CSELIB_VAL_PTR (dv_as_value (dv
))->locs
; *l
;)
2967 if (GET_CODE ((*l
)->loc
) == ASM_OPERANDS
)
2971 for_each_rtx (&(*l
)->loc
, add_value_chain
, dv_as_opaque (dv
));
2976 /* If decl or value DVP refers to VALUE from *LOC, remove backlinks
2977 from VALUE to DVP. */
2980 remove_value_chain (rtx
*loc
, void *dvp
)
2982 decl_or_value dv
, ldv
;
2986 if (GET_CODE (*loc
) == VALUE
)
2987 ldv
= dv_from_value (*loc
);
2988 else if (GET_CODE (*loc
) == DEBUG_EXPR
)
2989 ldv
= dv_from_decl (DEBUG_EXPR_TREE_DECL (*loc
));
2993 if (dv_as_opaque (ldv
) == dvp
)
2996 dv
= (decl_or_value
) dvp
;
2997 slot
= htab_find_slot_with_hash (value_chains
, ldv
, dv_htab_hash (ldv
),
2999 for (vc
= (value_chain
) *slot
; vc
->next
; vc
= vc
->next
)
3000 if (dv_as_opaque (vc
->next
->dv
) == dv_as_opaque (dv
))
3002 value_chain dvc
= vc
->next
;
3003 gcc_assert (dvc
->refcount
> 0);
3004 if (--dvc
->refcount
== 0)
3006 vc
->next
= dvc
->next
;
3007 pool_free (value_chain_pool
, dvc
);
3008 if (vc
->next
== NULL
&& vc
== (value_chain
) *slot
)
3010 pool_free (value_chain_pool
, vc
);
3011 htab_clear_slot (value_chains
, slot
);
3019 /* If decl or value DVP refers to VALUEs from within LOC, remove backlinks
3020 from those VALUEs to DVP. */
3023 remove_value_chains (decl_or_value dv
, rtx loc
)
3025 if (GET_CODE (loc
) == VALUE
|| GET_CODE (loc
) == DEBUG_EXPR
)
3027 remove_value_chain (&loc
, dv_as_opaque (dv
));
3033 loc
= XEXP (loc
, 0);
3034 for_each_rtx (&loc
, remove_value_chain
, dv_as_opaque (dv
));
3038 /* If CSELIB_VAL_PTR of value DV refer to VALUEs, remove backlinks from those
3042 remove_cselib_value_chains (decl_or_value dv
)
3044 struct elt_loc_list
*l
;
3046 for (l
= CSELIB_VAL_PTR (dv_as_value (dv
))->locs
; l
; l
= l
->next
)
3047 for_each_rtx (&l
->loc
, remove_value_chain
, dv_as_opaque (dv
));
3050 /* Check the order of entries in one-part variables. */
3053 canonicalize_loc_order_check (void **slot
, void *data ATTRIBUTE_UNUSED
)
3055 variable var
= (variable
) *slot
;
3056 decl_or_value dv
= var
->dv
;
3057 location_chain node
, next
;
3059 #ifdef ENABLE_RTL_CHECKING
3061 for (i
= 0; i
< var
->n_var_parts
; i
++)
3062 gcc_assert (var
->var_part
[0].cur_loc
== NULL
);
3063 gcc_assert (!var
->cur_loc_changed
&& !var
->in_changed_variables
);
3066 if (!dv_onepart_p (dv
))
3069 gcc_assert (var
->n_var_parts
== 1);
3070 node
= var
->var_part
[0].loc_chain
;
3073 while ((next
= node
->next
))
3075 gcc_assert (loc_cmp (node
->loc
, next
->loc
) < 0);
3083 /* Mark with VALUE_RECURSED_INTO values that have neighbors that are
3084 more likely to be chosen as canonical for an equivalence set.
3085 Ensure less likely values can reach more likely neighbors, making
3086 the connections bidirectional. */
3089 canonicalize_values_mark (void **slot
, void *data
)
3091 dataflow_set
*set
= (dataflow_set
*)data
;
3092 variable var
= (variable
) *slot
;
3093 decl_or_value dv
= var
->dv
;
3095 location_chain node
;
3097 if (!dv_is_value_p (dv
))
3100 gcc_checking_assert (var
->n_var_parts
== 1);
3102 val
= dv_as_value (dv
);
3104 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3105 if (GET_CODE (node
->loc
) == VALUE
)
3107 if (canon_value_cmp (node
->loc
, val
))
3108 VALUE_RECURSED_INTO (val
) = true;
3111 decl_or_value odv
= dv_from_value (node
->loc
);
3112 void **oslot
= shared_hash_find_slot_noinsert (set
->vars
, odv
);
3114 oslot
= set_slot_part (set
, val
, oslot
, odv
, 0,
3115 node
->init
, NULL_RTX
);
3117 VALUE_RECURSED_INTO (node
->loc
) = true;
3124 /* Remove redundant entries from equivalence lists in onepart
3125 variables, canonicalizing equivalence sets into star shapes. */
3128 canonicalize_values_star (void **slot
, void *data
)
3130 dataflow_set
*set
= (dataflow_set
*)data
;
3131 variable var
= (variable
) *slot
;
3132 decl_or_value dv
= var
->dv
;
3133 location_chain node
;
3140 if (!dv_onepart_p (dv
))
3143 gcc_checking_assert (var
->n_var_parts
== 1);
3145 if (dv_is_value_p (dv
))
3147 cval
= dv_as_value (dv
);
3148 if (!VALUE_RECURSED_INTO (cval
))
3150 VALUE_RECURSED_INTO (cval
) = false;
3160 gcc_assert (var
->n_var_parts
== 1);
3162 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3163 if (GET_CODE (node
->loc
) == VALUE
)
3166 if (VALUE_RECURSED_INTO (node
->loc
))
3168 if (canon_value_cmp (node
->loc
, cval
))
3177 if (!has_marks
|| dv_is_decl_p (dv
))
3180 /* Keep it marked so that we revisit it, either after visiting a
3181 child node, or after visiting a new parent that might be
3183 VALUE_RECURSED_INTO (val
) = true;
3185 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3186 if (GET_CODE (node
->loc
) == VALUE
3187 && VALUE_RECURSED_INTO (node
->loc
))
3191 VALUE_RECURSED_INTO (cval
) = false;
3192 dv
= dv_from_value (cval
);
3193 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
3196 gcc_assert (dv_is_decl_p (var
->dv
));
3197 /* The canonical value was reset and dropped.
3199 clobber_variable_part (set
, NULL
, var
->dv
, 0, NULL
);
3202 var
= (variable
)*slot
;
3203 gcc_assert (dv_is_value_p (var
->dv
));
3204 if (var
->n_var_parts
== 0)
3206 gcc_assert (var
->n_var_parts
== 1);
3210 VALUE_RECURSED_INTO (val
) = false;
3215 /* Push values to the canonical one. */
3216 cdv
= dv_from_value (cval
);
3217 cslot
= shared_hash_find_slot_noinsert (set
->vars
, cdv
);
3219 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3220 if (node
->loc
!= cval
)
3222 cslot
= set_slot_part (set
, node
->loc
, cslot
, cdv
, 0,
3223 node
->init
, NULL_RTX
);
3224 if (GET_CODE (node
->loc
) == VALUE
)
3226 decl_or_value ndv
= dv_from_value (node
->loc
);
3228 set_variable_part (set
, cval
, ndv
, 0, node
->init
, NULL_RTX
,
3231 if (canon_value_cmp (node
->loc
, val
))
3233 /* If it could have been a local minimum, it's not any more,
3234 since it's now neighbor to cval, so it may have to push
3235 to it. Conversely, if it wouldn't have prevailed over
3236 val, then whatever mark it has is fine: if it was to
3237 push, it will now push to a more canonical node, but if
3238 it wasn't, then it has already pushed any values it might
3240 VALUE_RECURSED_INTO (node
->loc
) = true;
3241 /* Make sure we visit node->loc by ensuring we cval is
3243 VALUE_RECURSED_INTO (cval
) = true;
3245 else if (!VALUE_RECURSED_INTO (node
->loc
))
3246 /* If we have no need to "recurse" into this node, it's
3247 already "canonicalized", so drop the link to the old
3249 clobber_variable_part (set
, cval
, ndv
, 0, NULL
);
3251 else if (GET_CODE (node
->loc
) == REG
)
3253 attrs list
= set
->regs
[REGNO (node
->loc
)], *listp
;
3255 /* Change an existing attribute referring to dv so that it
3256 refers to cdv, removing any duplicate this might
3257 introduce, and checking that no previous duplicates
3258 existed, all in a single pass. */
3262 if (list
->offset
== 0
3263 && (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
)
3264 || dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
)))
3271 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
))
3274 for (listp
= &list
->next
; (list
= *listp
); listp
= &list
->next
)
3279 if (dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
))
3281 *listp
= list
->next
;
3282 pool_free (attrs_pool
, list
);
3287 gcc_assert (dv_as_opaque (list
->dv
) != dv_as_opaque (dv
));
3290 else if (dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
))
3292 for (listp
= &list
->next
; (list
= *listp
); listp
= &list
->next
)
3297 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
))
3299 *listp
= list
->next
;
3300 pool_free (attrs_pool
, list
);
3305 gcc_assert (dv_as_opaque (list
->dv
) != dv_as_opaque (cdv
));
3314 if (list
->offset
== 0
3315 && (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
)
3316 || dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
)))
3326 cslot
= set_slot_part (set
, val
, cslot
, cdv
, 0,
3327 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
);
3329 slot
= clobber_slot_part (set
, cval
, slot
, 0, NULL
);
3331 /* Variable may have been unshared. */
3332 var
= (variable
)*slot
;
3333 gcc_checking_assert (var
->n_var_parts
&& var
->var_part
[0].loc_chain
->loc
== cval
3334 && var
->var_part
[0].loc_chain
->next
== NULL
);
3336 if (VALUE_RECURSED_INTO (cval
))
3337 goto restart_with_cval
;
3342 /* Bind one-part variables to the canonical value in an equivalence
3343 set. Not doing this causes dataflow convergence failure in rare
3344 circumstances, see PR42873. Unfortunately we can't do this
3345 efficiently as part of canonicalize_values_star, since we may not
3346 have determined or even seen the canonical value of a set when we
3347 get to a variable that references another member of the set. */
3350 canonicalize_vars_star (void **slot
, void *data
)
3352 dataflow_set
*set
= (dataflow_set
*)data
;
3353 variable var
= (variable
) *slot
;
3354 decl_or_value dv
= var
->dv
;
3355 location_chain node
;
3360 location_chain cnode
;
3362 if (!dv_onepart_p (dv
) || dv_is_value_p (dv
))
3365 gcc_assert (var
->n_var_parts
== 1);
3367 node
= var
->var_part
[0].loc_chain
;
3369 if (GET_CODE (node
->loc
) != VALUE
)
3372 gcc_assert (!node
->next
);
3375 /* Push values to the canonical one. */
3376 cdv
= dv_from_value (cval
);
3377 cslot
= shared_hash_find_slot_noinsert (set
->vars
, cdv
);
3380 cvar
= (variable
)*cslot
;
3381 gcc_assert (cvar
->n_var_parts
== 1);
3383 cnode
= cvar
->var_part
[0].loc_chain
;
3385 /* CVAL is canonical if its value list contains non-VALUEs or VALUEs
3386 that are not “more canonical” than it. */
3387 if (GET_CODE (cnode
->loc
) != VALUE
3388 || !canon_value_cmp (cnode
->loc
, cval
))
3391 /* CVAL was found to be non-canonical. Change the variable to point
3392 to the canonical VALUE. */
3393 gcc_assert (!cnode
->next
);
3396 slot
= set_slot_part (set
, cval
, slot
, dv
, 0,
3397 node
->init
, node
->set_src
);
3398 slot
= clobber_slot_part (set
, cval
, slot
, 0, node
->set_src
);
3403 /* Combine variable or value in *S1SLOT (in DSM->cur) with the
3404 corresponding entry in DSM->src. Multi-part variables are combined
3405 with variable_union, whereas onepart dvs are combined with
3409 variable_merge_over_cur (variable s1var
, struct dfset_merge
*dsm
)
3411 dataflow_set
*dst
= dsm
->dst
;
3413 variable s2var
, dvar
= NULL
;
3414 decl_or_value dv
= s1var
->dv
;
3415 bool onepart
= dv_onepart_p (dv
);
3418 location_chain node
, *nodep
;
3420 /* If the incoming onepart variable has an empty location list, then
3421 the intersection will be just as empty. For other variables,
3422 it's always union. */
3423 gcc_checking_assert (s1var
->n_var_parts
3424 && s1var
->var_part
[0].loc_chain
);
3427 return variable_union (s1var
, dst
);
3429 gcc_checking_assert (s1var
->n_var_parts
== 1
3430 && s1var
->var_part
[0].offset
== 0);
3432 dvhash
= dv_htab_hash (dv
);
3433 if (dv_is_value_p (dv
))
3434 val
= dv_as_value (dv
);
3438 s2var
= shared_hash_find_1 (dsm
->src
->vars
, dv
, dvhash
);
3441 dst_can_be_shared
= false;
3445 dsm
->src_onepart_cnt
--;
3446 gcc_assert (s2var
->var_part
[0].loc_chain
3447 && s2var
->n_var_parts
== 1
3448 && s2var
->var_part
[0].offset
== 0);
3450 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
3453 dvar
= (variable
)*dstslot
;
3454 gcc_assert (dvar
->refcount
== 1
3455 && dvar
->n_var_parts
== 1
3456 && dvar
->var_part
[0].offset
== 0);
3457 nodep
= &dvar
->var_part
[0].loc_chain
;
3465 if (!dstslot
&& !onepart_variable_different_p (s1var
, s2var
))
3467 dstslot
= shared_hash_find_slot_unshare_1 (&dst
->vars
, dv
,
3469 *dstslot
= dvar
= s2var
;
3474 dst_can_be_shared
= false;
3476 intersect_loc_chains (val
, nodep
, dsm
,
3477 s1var
->var_part
[0].loc_chain
, s2var
);
3483 dvar
= (variable
) pool_alloc (dv_pool (dv
));
3486 dvar
->n_var_parts
= 1;
3487 dvar
->cur_loc_changed
= false;
3488 dvar
->in_changed_variables
= false;
3489 dvar
->var_part
[0].offset
= 0;
3490 dvar
->var_part
[0].loc_chain
= node
;
3491 dvar
->var_part
[0].cur_loc
= NULL
;
3494 = shared_hash_find_slot_unshare_1 (&dst
->vars
, dv
, dvhash
,
3496 gcc_assert (!*dstslot
);
3504 nodep
= &dvar
->var_part
[0].loc_chain
;
3505 while ((node
= *nodep
))
3507 location_chain
*nextp
= &node
->next
;
3509 if (GET_CODE (node
->loc
) == REG
)
3513 for (list
= dst
->regs
[REGNO (node
->loc
)]; list
; list
= list
->next
)
3514 if (GET_MODE (node
->loc
) == GET_MODE (list
->loc
)
3515 && dv_is_value_p (list
->dv
))
3519 attrs_list_insert (&dst
->regs
[REGNO (node
->loc
)],
3521 /* If this value became canonical for another value that had
3522 this register, we want to leave it alone. */
3523 else if (dv_as_value (list
->dv
) != val
)
3525 dstslot
= set_slot_part (dst
, dv_as_value (list
->dv
),
3527 node
->init
, NULL_RTX
);
3528 dstslot
= delete_slot_part (dst
, node
->loc
, dstslot
, 0);
3530 /* Since nextp points into the removed node, we can't
3531 use it. The pointer to the next node moved to nodep.
3532 However, if the variable we're walking is unshared
3533 during our walk, we'll keep walking the location list
3534 of the previously-shared variable, in which case the
3535 node won't have been removed, and we'll want to skip
3536 it. That's why we test *nodep here. */
3542 /* Canonicalization puts registers first, so we don't have to
3548 if (dvar
!= (variable
)*dstslot
)
3549 dvar
= (variable
)*dstslot
;
3550 nodep
= &dvar
->var_part
[0].loc_chain
;
3554 /* Mark all referenced nodes for canonicalization, and make sure
3555 we have mutual equivalence links. */
3556 VALUE_RECURSED_INTO (val
) = true;
3557 for (node
= *nodep
; node
; node
= node
->next
)
3558 if (GET_CODE (node
->loc
) == VALUE
)
3560 VALUE_RECURSED_INTO (node
->loc
) = true;
3561 set_variable_part (dst
, val
, dv_from_value (node
->loc
), 0,
3562 node
->init
, NULL
, INSERT
);
3565 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
3566 gcc_assert (*dstslot
== dvar
);
3567 canonicalize_values_star (dstslot
, dst
);
3568 gcc_checking_assert (dstslot
3569 == shared_hash_find_slot_noinsert_1 (dst
->vars
,
3571 dvar
= (variable
)*dstslot
;
3575 bool has_value
= false, has_other
= false;
3577 /* If we have one value and anything else, we're going to
3578 canonicalize this, so make sure all values have an entry in
3579 the table and are marked for canonicalization. */
3580 for (node
= *nodep
; node
; node
= node
->next
)
3582 if (GET_CODE (node
->loc
) == VALUE
)
3584 /* If this was marked during register canonicalization,
3585 we know we have to canonicalize values. */
3600 if (has_value
&& has_other
)
3602 for (node
= *nodep
; node
; node
= node
->next
)
3604 if (GET_CODE (node
->loc
) == VALUE
)
3606 decl_or_value dv
= dv_from_value (node
->loc
);
3609 if (shared_hash_shared (dst
->vars
))
3610 slot
= shared_hash_find_slot_noinsert (dst
->vars
, dv
);
3612 slot
= shared_hash_find_slot_unshare (&dst
->vars
, dv
,
3616 variable var
= (variable
) pool_alloc (dv_pool (dv
));
3619 var
->n_var_parts
= 1;
3620 var
->cur_loc_changed
= false;
3621 var
->in_changed_variables
= false;
3622 var
->var_part
[0].offset
= 0;
3623 var
->var_part
[0].loc_chain
= NULL
;
3624 var
->var_part
[0].cur_loc
= NULL
;
3628 VALUE_RECURSED_INTO (node
->loc
) = true;
3632 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
3633 gcc_assert (*dstslot
== dvar
);
3634 canonicalize_values_star (dstslot
, dst
);
3635 gcc_checking_assert (dstslot
3636 == shared_hash_find_slot_noinsert_1 (dst
->vars
,
3638 dvar
= (variable
)*dstslot
;
3642 if (!onepart_variable_different_p (dvar
, s2var
))
3644 variable_htab_free (dvar
);
3645 *dstslot
= dvar
= s2var
;
3648 else if (s2var
!= s1var
&& !onepart_variable_different_p (dvar
, s1var
))
3650 variable_htab_free (dvar
);
3651 *dstslot
= dvar
= s1var
;
3653 dst_can_be_shared
= false;
3656 dst_can_be_shared
= false;
3661 /* Copy s2slot (in DSM->src) to DSM->dst if the variable is a
3662 multi-part variable. Unions of multi-part variables and
3663 intersections of one-part ones will be handled in
3664 variable_merge_over_cur(). */
3667 variable_merge_over_src (variable s2var
, struct dfset_merge
*dsm
)
3669 dataflow_set
*dst
= dsm
->dst
;
3670 decl_or_value dv
= s2var
->dv
;
3671 bool onepart
= dv_onepart_p (dv
);
3675 void **dstp
= shared_hash_find_slot (dst
->vars
, dv
);
3681 dsm
->src_onepart_cnt
++;
3685 /* Combine dataflow set information from SRC2 into DST, using PDST
3686 to carry over information across passes. */
3689 dataflow_set_merge (dataflow_set
*dst
, dataflow_set
*src2
)
3691 dataflow_set cur
= *dst
;
3692 dataflow_set
*src1
= &cur
;
3693 struct dfset_merge dsm
;
3695 size_t src1_elems
, src2_elems
;
3699 src1_elems
= htab_elements (shared_hash_htab (src1
->vars
));
3700 src2_elems
= htab_elements (shared_hash_htab (src2
->vars
));
3701 dataflow_set_init (dst
);
3702 dst
->stack_adjust
= cur
.stack_adjust
;
3703 shared_hash_destroy (dst
->vars
);
3704 dst
->vars
= (shared_hash
) pool_alloc (shared_hash_pool
);
3705 dst
->vars
->refcount
= 1;
3707 = htab_create (MAX (src1_elems
, src2_elems
), variable_htab_hash
,
3708 variable_htab_eq
, variable_htab_free
);
3710 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
3711 attrs_list_mpdv_union (&dst
->regs
[i
], src1
->regs
[i
], src2
->regs
[i
]);
3716 dsm
.src_onepart_cnt
= 0;
3718 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm
.src
->vars
), var
, variable
, hi
)
3719 variable_merge_over_src (var
, &dsm
);
3720 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm
.cur
->vars
), var
, variable
, hi
)
3721 variable_merge_over_cur (var
, &dsm
);
3723 if (dsm
.src_onepart_cnt
)
3724 dst_can_be_shared
= false;
3726 dataflow_set_destroy (src1
);
3729 /* Mark register equivalences. */
3732 dataflow_set_equiv_regs (dataflow_set
*set
)
3737 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
3739 rtx canon
[NUM_MACHINE_MODES
];
3741 /* If the list is empty or one entry, no need to canonicalize
3743 if (set
->regs
[i
] == NULL
|| set
->regs
[i
]->next
== NULL
)
3746 memset (canon
, 0, sizeof (canon
));
3748 for (list
= set
->regs
[i
]; list
; list
= list
->next
)
3749 if (list
->offset
== 0 && dv_is_value_p (list
->dv
))
3751 rtx val
= dv_as_value (list
->dv
);
3752 rtx
*cvalp
= &canon
[(int)GET_MODE (val
)];
3755 if (canon_value_cmp (val
, cval
))
3759 for (list
= set
->regs
[i
]; list
; list
= list
->next
)
3760 if (list
->offset
== 0 && dv_onepart_p (list
->dv
))
3762 rtx cval
= canon
[(int)GET_MODE (list
->loc
)];
3767 if (dv_is_value_p (list
->dv
))
3769 rtx val
= dv_as_value (list
->dv
);
3774 VALUE_RECURSED_INTO (val
) = true;
3775 set_variable_part (set
, val
, dv_from_value (cval
), 0,
3776 VAR_INIT_STATUS_INITIALIZED
,
3780 VALUE_RECURSED_INTO (cval
) = true;
3781 set_variable_part (set
, cval
, list
->dv
, 0,
3782 VAR_INIT_STATUS_INITIALIZED
, NULL
, NO_INSERT
);
3785 for (listp
= &set
->regs
[i
]; (list
= *listp
);
3786 listp
= list
? &list
->next
: listp
)
3787 if (list
->offset
== 0 && dv_onepart_p (list
->dv
))
3789 rtx cval
= canon
[(int)GET_MODE (list
->loc
)];
3795 if (dv_is_value_p (list
->dv
))
3797 rtx val
= dv_as_value (list
->dv
);
3798 if (!VALUE_RECURSED_INTO (val
))
3802 slot
= shared_hash_find_slot_noinsert (set
->vars
, list
->dv
);
3803 canonicalize_values_star (slot
, set
);
3810 /* Remove any redundant values in the location list of VAR, which must
3811 be unshared and 1-part. */
3814 remove_duplicate_values (variable var
)
3816 location_chain node
, *nodep
;
3818 gcc_assert (dv_onepart_p (var
->dv
));
3819 gcc_assert (var
->n_var_parts
== 1);
3820 gcc_assert (var
->refcount
== 1);
3822 for (nodep
= &var
->var_part
[0].loc_chain
; (node
= *nodep
); )
3824 if (GET_CODE (node
->loc
) == VALUE
)
3826 if (VALUE_RECURSED_INTO (node
->loc
))
3828 /* Remove duplicate value node. */
3829 *nodep
= node
->next
;
3830 pool_free (loc_chain_pool
, node
);
3834 VALUE_RECURSED_INTO (node
->loc
) = true;
3836 nodep
= &node
->next
;
3839 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3840 if (GET_CODE (node
->loc
) == VALUE
)
3842 gcc_assert (VALUE_RECURSED_INTO (node
->loc
));
3843 VALUE_RECURSED_INTO (node
->loc
) = false;
3848 /* Hash table iteration argument passed to variable_post_merge. */
3849 struct dfset_post_merge
3851 /* The new input set for the current block. */
3853 /* Pointer to the permanent input set for the current block, or
3855 dataflow_set
**permp
;
3858 /* Create values for incoming expressions associated with one-part
3859 variables that don't have value numbers for them. */
3862 variable_post_merge_new_vals (void **slot
, void *info
)
3864 struct dfset_post_merge
*dfpm
= (struct dfset_post_merge
*)info
;
3865 dataflow_set
*set
= dfpm
->set
;
3866 variable var
= (variable
)*slot
;
3867 location_chain node
;
3869 if (!dv_onepart_p (var
->dv
) || !var
->n_var_parts
)
3872 gcc_assert (var
->n_var_parts
== 1);
3874 if (dv_is_decl_p (var
->dv
))
3876 bool check_dupes
= false;
3879 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3881 if (GET_CODE (node
->loc
) == VALUE
)
3882 gcc_assert (!VALUE_RECURSED_INTO (node
->loc
));
3883 else if (GET_CODE (node
->loc
) == REG
)
3885 attrs att
, *attp
, *curp
= NULL
;
3887 if (var
->refcount
!= 1)
3889 slot
= unshare_variable (set
, slot
, var
,
3890 VAR_INIT_STATUS_INITIALIZED
);
3891 var
= (variable
)*slot
;
3895 for (attp
= &set
->regs
[REGNO (node
->loc
)]; (att
= *attp
);
3897 if (att
->offset
== 0
3898 && GET_MODE (att
->loc
) == GET_MODE (node
->loc
))
3900 if (dv_is_value_p (att
->dv
))
3902 rtx cval
= dv_as_value (att
->dv
);
3907 else if (dv_as_opaque (att
->dv
) == dv_as_opaque (var
->dv
))
3915 if ((*curp
)->offset
== 0
3916 && GET_MODE ((*curp
)->loc
) == GET_MODE (node
->loc
)
3917 && dv_as_opaque ((*curp
)->dv
) == dv_as_opaque (var
->dv
))
3920 curp
= &(*curp
)->next
;
3931 *dfpm
->permp
= XNEW (dataflow_set
);
3932 dataflow_set_init (*dfpm
->permp
);
3935 for (att
= (*dfpm
->permp
)->regs
[REGNO (node
->loc
)];
3936 att
; att
= att
->next
)
3937 if (GET_MODE (att
->loc
) == GET_MODE (node
->loc
))
3939 gcc_assert (att
->offset
== 0
3940 && dv_is_value_p (att
->dv
));
3941 val_reset (set
, att
->dv
);
3948 cval
= dv_as_value (cdv
);
3952 /* Create a unique value to hold this register,
3953 that ought to be found and reused in
3954 subsequent rounds. */
3956 gcc_assert (!cselib_lookup (node
->loc
,
3957 GET_MODE (node
->loc
), 0));
3958 v
= cselib_lookup (node
->loc
, GET_MODE (node
->loc
), 1);
3959 cselib_preserve_value (v
);
3960 cselib_invalidate_rtx (node
->loc
);
3962 cdv
= dv_from_value (cval
);
3965 "Created new value %u:%u for reg %i\n",
3966 v
->uid
, v
->hash
, REGNO (node
->loc
));
3969 var_reg_decl_set (*dfpm
->permp
, node
->loc
,
3970 VAR_INIT_STATUS_INITIALIZED
,
3971 cdv
, 0, NULL
, INSERT
);
3977 /* Remove attribute referring to the decl, which now
3978 uses the value for the register, already existing or
3979 to be added when we bring perm in. */
3982 pool_free (attrs_pool
, att
);
3987 remove_duplicate_values (var
);
3993 /* Reset values in the permanent set that are not associated with the
3994 chosen expression. */
3997 variable_post_merge_perm_vals (void **pslot
, void *info
)
3999 struct dfset_post_merge
*dfpm
= (struct dfset_post_merge
*)info
;
4000 dataflow_set
*set
= dfpm
->set
;
4001 variable pvar
= (variable
)*pslot
, var
;
4002 location_chain pnode
;
4006 gcc_assert (dv_is_value_p (pvar
->dv
)
4007 && pvar
->n_var_parts
== 1);
4008 pnode
= pvar
->var_part
[0].loc_chain
;
4011 && REG_P (pnode
->loc
));
4015 var
= shared_hash_find (set
->vars
, dv
);
4018 /* Although variable_post_merge_new_vals may have made decls
4019 non-star-canonical, values that pre-existed in canonical form
4020 remain canonical, and newly-created values reference a single
4021 REG, so they are canonical as well. Since VAR has the
4022 location list for a VALUE, using find_loc_in_1pdv for it is
4023 fine, since VALUEs don't map back to DECLs. */
4024 if (find_loc_in_1pdv (pnode
->loc
, var
, shared_hash_htab (set
->vars
)))
4026 val_reset (set
, dv
);
4029 for (att
= set
->regs
[REGNO (pnode
->loc
)]; att
; att
= att
->next
)
4030 if (att
->offset
== 0
4031 && GET_MODE (att
->loc
) == GET_MODE (pnode
->loc
)
4032 && dv_is_value_p (att
->dv
))
4035 /* If there is a value associated with this register already, create
4037 if (att
&& dv_as_value (att
->dv
) != dv_as_value (dv
))
4039 rtx cval
= dv_as_value (att
->dv
);
4040 set_variable_part (set
, cval
, dv
, 0, pnode
->init
, NULL
, INSERT
);
4041 set_variable_part (set
, dv_as_value (dv
), att
->dv
, 0, pnode
->init
,
4046 attrs_list_insert (&set
->regs
[REGNO (pnode
->loc
)],
4048 variable_union (pvar
, set
);
4054 /* Just checking stuff and registering register attributes for
4058 dataflow_post_merge_adjust (dataflow_set
*set
, dataflow_set
**permp
)
4060 struct dfset_post_merge dfpm
;
4065 htab_traverse (shared_hash_htab (set
->vars
), variable_post_merge_new_vals
,
4068 htab_traverse (shared_hash_htab ((*permp
)->vars
),
4069 variable_post_merge_perm_vals
, &dfpm
);
4070 htab_traverse (shared_hash_htab (set
->vars
), canonicalize_values_star
, set
);
4071 htab_traverse (shared_hash_htab (set
->vars
), canonicalize_vars_star
, set
);
4074 /* Return a node whose loc is a MEM that refers to EXPR in the
4075 location list of a one-part variable or value VAR, or in that of
4076 any values recursively mentioned in the location lists. */
4078 static location_chain
4079 find_mem_expr_in_1pdv (tree expr
, rtx val
, htab_t vars
)
4081 location_chain node
;
4084 location_chain where
= NULL
;
4089 gcc_assert (GET_CODE (val
) == VALUE
4090 && !VALUE_RECURSED_INTO (val
));
4092 dv
= dv_from_value (val
);
4093 var
= (variable
) htab_find_with_hash (vars
, dv
, dv_htab_hash (dv
));
4098 gcc_assert (dv_onepart_p (var
->dv
));
4100 if (!var
->n_var_parts
)
4103 gcc_assert (var
->var_part
[0].offset
== 0);
4105 VALUE_RECURSED_INTO (val
) = true;
4107 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
4108 if (MEM_P (node
->loc
) && MEM_EXPR (node
->loc
) == expr
4109 && MEM_OFFSET (node
->loc
) == 0)
4114 else if (GET_CODE (node
->loc
) == VALUE
4115 && !VALUE_RECURSED_INTO (node
->loc
)
4116 && (where
= find_mem_expr_in_1pdv (expr
, node
->loc
, vars
)))
4119 VALUE_RECURSED_INTO (val
) = false;
4124 /* Return TRUE if the value of MEM may vary across a call. */
4127 mem_dies_at_call (rtx mem
)
4129 tree expr
= MEM_EXPR (mem
);
4135 decl
= get_base_address (expr
);
4143 return (may_be_aliased (decl
)
4144 || (!TREE_READONLY (decl
) && is_global_var (decl
)));
4147 /* Remove all MEMs from the location list of a hash table entry for a
4148 one-part variable, except those whose MEM attributes map back to
4149 the variable itself, directly or within a VALUE. */
4152 dataflow_set_preserve_mem_locs (void **slot
, void *data
)
4154 dataflow_set
*set
= (dataflow_set
*) data
;
4155 variable var
= (variable
) *slot
;
4157 if (dv_is_decl_p (var
->dv
) && dv_onepart_p (var
->dv
))
4159 tree decl
= dv_as_decl (var
->dv
);
4160 location_chain loc
, *locp
;
4161 bool changed
= false;
4163 if (!var
->n_var_parts
)
4166 gcc_assert (var
->n_var_parts
== 1);
4168 if (shared_var_p (var
, set
->vars
))
4170 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
4172 /* We want to remove dying MEMs that doesn't refer to
4174 if (GET_CODE (loc
->loc
) == MEM
4175 && (MEM_EXPR (loc
->loc
) != decl
4176 || MEM_OFFSET (loc
->loc
))
4177 && !mem_dies_at_call (loc
->loc
))
4179 /* We want to move here MEMs that do refer to DECL. */
4180 else if (GET_CODE (loc
->loc
) == VALUE
4181 && find_mem_expr_in_1pdv (decl
, loc
->loc
,
4182 shared_hash_htab (set
->vars
)))
4189 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
4190 var
= (variable
)*slot
;
4191 gcc_assert (var
->n_var_parts
== 1);
4194 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
4197 rtx old_loc
= loc
->loc
;
4198 if (GET_CODE (old_loc
) == VALUE
)
4200 location_chain mem_node
4201 = find_mem_expr_in_1pdv (decl
, loc
->loc
,
4202 shared_hash_htab (set
->vars
));
4204 /* ??? This picks up only one out of multiple MEMs that
4205 refer to the same variable. Do we ever need to be
4206 concerned about dealing with more than one, or, given
4207 that they should all map to the same variable
4208 location, their addresses will have been merged and
4209 they will be regarded as equivalent? */
4212 loc
->loc
= mem_node
->loc
;
4213 loc
->set_src
= mem_node
->set_src
;
4214 loc
->init
= MIN (loc
->init
, mem_node
->init
);
4218 if (GET_CODE (loc
->loc
) != MEM
4219 || (MEM_EXPR (loc
->loc
) == decl
4220 && MEM_OFFSET (loc
->loc
) == 0)
4221 || !mem_dies_at_call (loc
->loc
))
4223 if (old_loc
!= loc
->loc
&& emit_notes
)
4225 if (old_loc
== var
->var_part
[0].cur_loc
)
4228 var
->var_part
[0].cur_loc
= NULL
;
4229 var
->cur_loc_changed
= true;
4231 add_value_chains (var
->dv
, loc
->loc
);
4232 remove_value_chains (var
->dv
, old_loc
);
4240 remove_value_chains (var
->dv
, old_loc
);
4241 if (old_loc
== var
->var_part
[0].cur_loc
)
4244 var
->var_part
[0].cur_loc
= NULL
;
4245 var
->cur_loc_changed
= true;
4249 pool_free (loc_chain_pool
, loc
);
4252 if (!var
->var_part
[0].loc_chain
)
4258 variable_was_changed (var
, set
);
4264 /* Remove all MEMs from the location list of a hash table entry for a
4268 dataflow_set_remove_mem_locs (void **slot
, void *data
)
4270 dataflow_set
*set
= (dataflow_set
*) data
;
4271 variable var
= (variable
) *slot
;
4273 if (dv_is_value_p (var
->dv
))
4275 location_chain loc
, *locp
;
4276 bool changed
= false;
4278 gcc_assert (var
->n_var_parts
== 1);
4280 if (shared_var_p (var
, set
->vars
))
4282 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
4283 if (GET_CODE (loc
->loc
) == MEM
4284 && mem_dies_at_call (loc
->loc
))
4290 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
4291 var
= (variable
)*slot
;
4292 gcc_assert (var
->n_var_parts
== 1);
4295 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
4298 if (GET_CODE (loc
->loc
) != MEM
4299 || !mem_dies_at_call (loc
->loc
))
4306 remove_value_chains (var
->dv
, loc
->loc
);
4308 /* If we have deleted the location which was last emitted
4309 we have to emit new location so add the variable to set
4310 of changed variables. */
4311 if (var
->var_part
[0].cur_loc
== loc
->loc
)
4314 var
->var_part
[0].cur_loc
= NULL
;
4315 var
->cur_loc_changed
= true;
4317 pool_free (loc_chain_pool
, loc
);
4320 if (!var
->var_part
[0].loc_chain
)
4326 variable_was_changed (var
, set
);
4332 /* Remove all variable-location information about call-clobbered
4333 registers, as well as associations between MEMs and VALUEs. */
4336 dataflow_set_clear_at_call (dataflow_set
*set
)
4340 for (r
= 0; r
< FIRST_PSEUDO_REGISTER
; r
++)
4341 if (TEST_HARD_REG_BIT (regs_invalidated_by_call
, r
))
4342 var_regno_delete (set
, r
);
4344 if (MAY_HAVE_DEBUG_INSNS
)
4346 set
->traversed_vars
= set
->vars
;
4347 htab_traverse (shared_hash_htab (set
->vars
),
4348 dataflow_set_preserve_mem_locs
, set
);
4349 set
->traversed_vars
= set
->vars
;
4350 htab_traverse (shared_hash_htab (set
->vars
), dataflow_set_remove_mem_locs
,
4352 set
->traversed_vars
= NULL
;
4357 variable_part_different_p (variable_part
*vp1
, variable_part
*vp2
)
4359 location_chain lc1
, lc2
;
4361 for (lc1
= vp1
->loc_chain
; lc1
; lc1
= lc1
->next
)
4363 for (lc2
= vp2
->loc_chain
; lc2
; lc2
= lc2
->next
)
4365 if (REG_P (lc1
->loc
) && REG_P (lc2
->loc
))
4367 if (REGNO (lc1
->loc
) == REGNO (lc2
->loc
))
4370 if (rtx_equal_p (lc1
->loc
, lc2
->loc
))
4379 /* Return true if one-part variables VAR1 and VAR2 are different.
4380 They must be in canonical order. */
4383 onepart_variable_different_p (variable var1
, variable var2
)
4385 location_chain lc1
, lc2
;
4390 gcc_assert (var1
->n_var_parts
== 1
4391 && var2
->n_var_parts
== 1);
4393 lc1
= var1
->var_part
[0].loc_chain
;
4394 lc2
= var2
->var_part
[0].loc_chain
;
4396 gcc_assert (lc1
&& lc2
);
4400 if (loc_cmp (lc1
->loc
, lc2
->loc
))
4409 /* Return true if variables VAR1 and VAR2 are different. */
4412 variable_different_p (variable var1
, variable var2
)
4419 if (var1
->n_var_parts
!= var2
->n_var_parts
)
4422 for (i
= 0; i
< var1
->n_var_parts
; i
++)
4424 if (var1
->var_part
[i
].offset
!= var2
->var_part
[i
].offset
)
4426 /* One-part values have locations in a canonical order. */
4427 if (i
== 0 && var1
->var_part
[i
].offset
== 0 && dv_onepart_p (var1
->dv
))
4429 gcc_assert (var1
->n_var_parts
== 1
4430 && dv_as_opaque (var1
->dv
) == dv_as_opaque (var2
->dv
));
4431 return onepart_variable_different_p (var1
, var2
);
4433 if (variable_part_different_p (&var1
->var_part
[i
], &var2
->var_part
[i
]))
4435 if (variable_part_different_p (&var2
->var_part
[i
], &var1
->var_part
[i
]))
4441 /* Return true if dataflow sets OLD_SET and NEW_SET differ. */
4444 dataflow_set_different (dataflow_set
*old_set
, dataflow_set
*new_set
)
4449 if (old_set
->vars
== new_set
->vars
)
4452 if (htab_elements (shared_hash_htab (old_set
->vars
))
4453 != htab_elements (shared_hash_htab (new_set
->vars
)))
4456 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (old_set
->vars
), var1
, variable
, hi
)
4458 htab_t htab
= shared_hash_htab (new_set
->vars
);
4459 variable var2
= (variable
) htab_find_with_hash (htab
, var1
->dv
,
4460 dv_htab_hash (var1
->dv
));
4463 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4465 fprintf (dump_file
, "dataflow difference found: removal of:\n");
4471 if (variable_different_p (var1
, var2
))
4473 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4475 fprintf (dump_file
, "dataflow difference found: "
4476 "old and new follow:\n");
4484 /* No need to traverse the second hashtab, if both have the same number
4485 of elements and the second one had all entries found in the first one,
4486 then it can't have any extra entries. */
4490 /* Free the contents of dataflow set SET. */
4493 dataflow_set_destroy (dataflow_set
*set
)
4497 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4498 attrs_list_clear (&set
->regs
[i
]);
4500 shared_hash_destroy (set
->vars
);
4504 /* Return true if RTL X contains a SYMBOL_REF. */
4507 contains_symbol_ref (rtx x
)
4516 code
= GET_CODE (x
);
4517 if (code
== SYMBOL_REF
)
4520 fmt
= GET_RTX_FORMAT (code
);
4521 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
4525 if (contains_symbol_ref (XEXP (x
, i
)))
4528 else if (fmt
[i
] == 'E')
4531 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
4532 if (contains_symbol_ref (XVECEXP (x
, i
, j
)))
4540 /* Shall EXPR be tracked? */
4543 track_expr_p (tree expr
, bool need_rtl
)
4548 if (TREE_CODE (expr
) == DEBUG_EXPR_DECL
)
4549 return DECL_RTL_SET_P (expr
);
4551 /* If EXPR is not a parameter or a variable do not track it. */
4552 if (TREE_CODE (expr
) != VAR_DECL
&& TREE_CODE (expr
) != PARM_DECL
)
4555 /* It also must have a name... */
4556 if (!DECL_NAME (expr
) && need_rtl
)
4559 /* ... and a RTL assigned to it. */
4560 decl_rtl
= DECL_RTL_IF_SET (expr
);
4561 if (!decl_rtl
&& need_rtl
)
4564 /* If this expression is really a debug alias of some other declaration, we
4565 don't need to track this expression if the ultimate declaration is
4568 if (DECL_DEBUG_EXPR_IS_FROM (realdecl
))
4570 realdecl
= DECL_DEBUG_EXPR (realdecl
);
4571 if (realdecl
== NULL_TREE
)
4573 else if (!DECL_P (realdecl
))
4575 if (handled_component_p (realdecl
))
4577 HOST_WIDE_INT bitsize
, bitpos
, maxsize
;
4579 = get_ref_base_and_extent (realdecl
, &bitpos
, &bitsize
,
4581 if (!DECL_P (innerdecl
)
4582 || DECL_IGNORED_P (innerdecl
)
4583 || TREE_STATIC (innerdecl
)
4585 || bitpos
+ bitsize
> 256
4586 || bitsize
!= maxsize
)
4596 /* Do not track EXPR if REALDECL it should be ignored for debugging
4598 if (DECL_IGNORED_P (realdecl
))
4601 /* Do not track global variables until we are able to emit correct location
4603 if (TREE_STATIC (realdecl
))
4606 /* When the EXPR is a DECL for alias of some variable (see example)
4607 the TREE_STATIC flag is not used. Disable tracking all DECLs whose
4608 DECL_RTL contains SYMBOL_REF.
4611 extern char **_dl_argv_internal __attribute__ ((alias ("_dl_argv")));
4614 if (decl_rtl
&& MEM_P (decl_rtl
)
4615 && contains_symbol_ref (XEXP (decl_rtl
, 0)))
4618 /* If RTX is a memory it should not be very large (because it would be
4619 an array or struct). */
4620 if (decl_rtl
&& MEM_P (decl_rtl
))
4622 /* Do not track structures and arrays. */
4623 if (GET_MODE (decl_rtl
) == BLKmode
4624 || AGGREGATE_TYPE_P (TREE_TYPE (realdecl
)))
4626 if (MEM_SIZE (decl_rtl
)
4627 && INTVAL (MEM_SIZE (decl_rtl
)) > MAX_VAR_PARTS
)
4631 DECL_CHANGED (expr
) = 0;
4632 DECL_CHANGED (realdecl
) = 0;
4636 /* Determine whether a given LOC refers to the same variable part as
4640 same_variable_part_p (rtx loc
, tree expr
, HOST_WIDE_INT offset
)
4643 HOST_WIDE_INT offset2
;
4645 if (! DECL_P (expr
))
4650 expr2
= REG_EXPR (loc
);
4651 offset2
= REG_OFFSET (loc
);
4653 else if (MEM_P (loc
))
4655 expr2
= MEM_EXPR (loc
);
4656 offset2
= INT_MEM_OFFSET (loc
);
4661 if (! expr2
|| ! DECL_P (expr2
))
4664 expr
= var_debug_decl (expr
);
4665 expr2
= var_debug_decl (expr2
);
4667 return (expr
== expr2
&& offset
== offset2
);
4670 /* LOC is a REG or MEM that we would like to track if possible.
4671 If EXPR is null, we don't know what expression LOC refers to,
4672 otherwise it refers to EXPR + OFFSET. STORE_REG_P is true if
4673 LOC is an lvalue register.
4675 Return true if EXPR is nonnull and if LOC, or some lowpart of it,
4676 is something we can track. When returning true, store the mode of
4677 the lowpart we can track in *MODE_OUT (if nonnull) and its offset
4678 from EXPR in *OFFSET_OUT (if nonnull). */
4681 track_loc_p (rtx loc
, tree expr
, HOST_WIDE_INT offset
, bool store_reg_p
,
4682 enum machine_mode
*mode_out
, HOST_WIDE_INT
*offset_out
)
4684 enum machine_mode mode
;
4686 if (expr
== NULL
|| !track_expr_p (expr
, true))
4689 /* If REG was a paradoxical subreg, its REG_ATTRS will describe the
4690 whole subreg, but only the old inner part is really relevant. */
4691 mode
= GET_MODE (loc
);
4692 if (REG_P (loc
) && !HARD_REGISTER_NUM_P (ORIGINAL_REGNO (loc
)))
4694 enum machine_mode pseudo_mode
;
4696 pseudo_mode
= PSEUDO_REGNO_MODE (ORIGINAL_REGNO (loc
));
4697 if (GET_MODE_SIZE (mode
) > GET_MODE_SIZE (pseudo_mode
))
4699 offset
+= byte_lowpart_offset (pseudo_mode
, mode
);
4704 /* If LOC is a paradoxical lowpart of EXPR, refer to EXPR itself.
4705 Do the same if we are storing to a register and EXPR occupies
4706 the whole of register LOC; in that case, the whole of EXPR is
4707 being changed. We exclude complex modes from the second case
4708 because the real and imaginary parts are represented as separate
4709 pseudo registers, even if the whole complex value fits into one
4711 if ((GET_MODE_SIZE (mode
) > GET_MODE_SIZE (DECL_MODE (expr
))
4713 && !COMPLEX_MODE_P (DECL_MODE (expr
))
4714 && hard_regno_nregs
[REGNO (loc
)][DECL_MODE (expr
)] == 1))
4715 && offset
+ byte_lowpart_offset (DECL_MODE (expr
), mode
) == 0)
4717 mode
= DECL_MODE (expr
);
4721 if (offset
< 0 || offset
>= MAX_VAR_PARTS
)
4727 *offset_out
= offset
;
4731 /* Return the MODE lowpart of LOC, or null if LOC is not something we
4732 want to track. When returning nonnull, make sure that the attributes
4733 on the returned value are updated. */
4736 var_lowpart (enum machine_mode mode
, rtx loc
)
4738 unsigned int offset
, reg_offset
, regno
;
4740 if (!REG_P (loc
) && !MEM_P (loc
))
4743 if (GET_MODE (loc
) == mode
)
4746 offset
= byte_lowpart_offset (mode
, GET_MODE (loc
));
4749 return adjust_address_nv (loc
, mode
, offset
);
4751 reg_offset
= subreg_lowpart_offset (mode
, GET_MODE (loc
));
4752 regno
= REGNO (loc
) + subreg_regno_offset (REGNO (loc
), GET_MODE (loc
),
4754 return gen_rtx_REG_offset (loc
, mode
, regno
, offset
);
4757 /* Carry information about uses and stores while walking rtx. */
4759 struct count_use_info
4761 /* The insn where the RTX is. */
4764 /* The basic block where insn is. */
4767 /* The array of n_sets sets in the insn, as determined by cselib. */
4768 struct cselib_set
*sets
;
4771 /* True if we're counting stores, false otherwise. */
4775 /* Find a VALUE corresponding to X. */
4777 static inline cselib_val
*
4778 find_use_val (rtx x
, enum machine_mode mode
, struct count_use_info
*cui
)
4784 /* This is called after uses are set up and before stores are
4785 processed bycselib, so it's safe to look up srcs, but not
4786 dsts. So we look up expressions that appear in srcs or in
4787 dest expressions, but we search the sets array for dests of
4791 for (i
= 0; i
< cui
->n_sets
; i
++)
4792 if (cui
->sets
[i
].dest
== x
)
4793 return cui
->sets
[i
].src_elt
;
4796 return cselib_lookup (x
, mode
, 0);
4802 /* Helper function to get mode of MEM's address. */
4804 static inline enum machine_mode
4805 get_address_mode (rtx mem
)
4807 enum machine_mode mode
= GET_MODE (XEXP (mem
, 0));
4808 if (mode
!= VOIDmode
)
4810 return targetm
.addr_space
.address_mode (MEM_ADDR_SPACE (mem
));
4813 /* Replace all registers and addresses in an expression with VALUE
4814 expressions that map back to them, unless the expression is a
4815 register. If no mapping is or can be performed, returns NULL. */
4818 replace_expr_with_values (rtx loc
)
4822 else if (MEM_P (loc
))
4824 cselib_val
*addr
= cselib_lookup (XEXP (loc
, 0),
4825 get_address_mode (loc
), 0);
4827 return replace_equiv_address_nv (loc
, addr
->val_rtx
);
4832 return cselib_subst_to_values (loc
);
4835 /* Determine what kind of micro operation to choose for a USE. Return
4836 MO_CLOBBER if no micro operation is to be generated. */
4838 static enum micro_operation_type
4839 use_type (rtx loc
, struct count_use_info
*cui
, enum machine_mode
*modep
)
4843 if (cui
&& cui
->sets
)
4845 if (GET_CODE (loc
) == VAR_LOCATION
)
4847 if (track_expr_p (PAT_VAR_LOCATION_DECL (loc
), false))
4849 rtx ploc
= PAT_VAR_LOCATION_LOC (loc
);
4850 if (! VAR_LOC_UNKNOWN_P (ploc
))
4852 cselib_val
*val
= cselib_lookup (ploc
, GET_MODE (loc
), 1);
4854 /* ??? flag_float_store and volatile mems are never
4855 given values, but we could in theory use them for
4857 gcc_assert (val
|| 1);
4865 if (REG_P (loc
) || MEM_P (loc
))
4868 *modep
= GET_MODE (loc
);
4872 || (find_use_val (loc
, GET_MODE (loc
), cui
)
4873 && cselib_lookup (XEXP (loc
, 0),
4874 get_address_mode (loc
), 0)))
4879 cselib_val
*val
= find_use_val (loc
, GET_MODE (loc
), cui
);
4881 if (val
&& !cselib_preserved_value_p (val
))
4889 gcc_assert (REGNO (loc
) < FIRST_PSEUDO_REGISTER
);
4891 if (loc
== cfa_base_rtx
)
4893 expr
= REG_EXPR (loc
);
4896 return MO_USE_NO_VAR
;
4897 else if (target_for_debug_bind (var_debug_decl (expr
)))
4899 else if (track_loc_p (loc
, expr
, REG_OFFSET (loc
),
4900 false, modep
, NULL
))
4903 return MO_USE_NO_VAR
;
4905 else if (MEM_P (loc
))
4907 expr
= MEM_EXPR (loc
);
4911 else if (target_for_debug_bind (var_debug_decl (expr
)))
4913 else if (track_loc_p (loc
, expr
, INT_MEM_OFFSET (loc
),
4914 false, modep
, NULL
))
4923 /* Log to OUT information about micro-operation MOPT involving X in
4927 log_op_type (rtx x
, basic_block bb
, rtx insn
,
4928 enum micro_operation_type mopt
, FILE *out
)
4930 fprintf (out
, "bb %i op %i insn %i %s ",
4931 bb
->index
, VEC_length (micro_operation
, VTI (bb
)->mos
),
4932 INSN_UID (insn
), micro_operation_type_name
[mopt
]);
4933 print_inline_rtx (out
, x
, 2);
4937 /* Tell whether the CONCAT used to holds a VALUE and its location
4938 needs value resolution, i.e., an attempt of mapping the location
4939 back to other incoming values. */
4940 #define VAL_NEEDS_RESOLUTION(x) \
4941 (RTL_FLAG_CHECK1 ("VAL_NEEDS_RESOLUTION", (x), CONCAT)->volatil)
4942 /* Whether the location in the CONCAT is a tracked expression, that
4943 should also be handled like a MO_USE. */
4944 #define VAL_HOLDS_TRACK_EXPR(x) \
4945 (RTL_FLAG_CHECK1 ("VAL_HOLDS_TRACK_EXPR", (x), CONCAT)->used)
4946 /* Whether the location in the CONCAT should be handled like a MO_COPY
4948 #define VAL_EXPR_IS_COPIED(x) \
4949 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_COPIED", (x), CONCAT)->jump)
4950 /* Whether the location in the CONCAT should be handled like a
4951 MO_CLOBBER as well. */
4952 #define VAL_EXPR_IS_CLOBBERED(x) \
4953 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_CLOBBERED", (x), CONCAT)->unchanging)
4954 /* Whether the location is a CONCAT of the MO_VAL_SET expression and
4955 a reverse operation that should be handled afterwards. */
4956 #define VAL_EXPR_HAS_REVERSE(x) \
4957 (RTL_FLAG_CHECK1 ("VAL_EXPR_HAS_REVERSE", (x), CONCAT)->return_val)
4959 /* All preserved VALUEs. */
4960 static VEC (rtx
, heap
) *preserved_values
;
4962 /* Ensure VAL is preserved and remember it in a vector for vt_emit_notes. */
4965 preserve_value (cselib_val
*val
)
4967 cselib_preserve_value (val
);
4968 VEC_safe_push (rtx
, heap
, preserved_values
, val
->val_rtx
);
4971 /* Helper function for MO_VAL_LOC handling. Return non-zero if
4972 any rtxes not suitable for CONST use not replaced by VALUEs
4976 non_suitable_const (rtx
*x
, void *data ATTRIBUTE_UNUSED
)
4981 switch (GET_CODE (*x
))
4992 return !MEM_READONLY_P (*x
);
4998 /* Add uses (register and memory references) LOC which will be tracked
4999 to VTI (bb)->mos. INSN is instruction which the LOC is part of. */
5002 add_uses (rtx
*ploc
, void *data
)
5005 enum machine_mode mode
= VOIDmode
;
5006 struct count_use_info
*cui
= (struct count_use_info
*)data
;
5007 enum micro_operation_type type
= use_type (loc
, cui
, &mode
);
5009 if (type
!= MO_CLOBBER
)
5011 basic_block bb
= cui
->bb
;
5015 mo
.u
.loc
= type
== MO_USE
? var_lowpart (mode
, loc
) : loc
;
5016 mo
.insn
= cui
->insn
;
5018 if (type
== MO_VAL_LOC
)
5021 rtx vloc
= PAT_VAR_LOCATION_LOC (oloc
);
5024 gcc_assert (cui
->sets
);
5027 && !REG_P (XEXP (vloc
, 0))
5028 && !MEM_P (XEXP (vloc
, 0))
5029 && (GET_CODE (XEXP (vloc
, 0)) != PLUS
5030 || XEXP (XEXP (vloc
, 0), 0) != cfa_base_rtx
5031 || !CONST_INT_P (XEXP (XEXP (vloc
, 0), 1))))
5034 enum machine_mode address_mode
= get_address_mode (mloc
);
5036 = cselib_lookup (XEXP (mloc
, 0), address_mode
, 0);
5038 if (val
&& !cselib_preserved_value_p (val
))
5040 micro_operation moa
;
5041 preserve_value (val
);
5042 mloc
= cselib_subst_to_values (XEXP (mloc
, 0));
5043 moa
.type
= MO_VAL_USE
;
5044 moa
.insn
= cui
->insn
;
5045 moa
.u
.loc
= gen_rtx_CONCAT (address_mode
,
5046 val
->val_rtx
, mloc
);
5047 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5048 log_op_type (moa
.u
.loc
, cui
->bb
, cui
->insn
,
5049 moa
.type
, dump_file
);
5050 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &moa
);
5054 if (CONSTANT_P (vloc
)
5055 && (GET_CODE (vloc
) != CONST
5056 || for_each_rtx (&vloc
, non_suitable_const
, NULL
)))
5057 /* For constants don't look up any value. */;
5058 else if (!VAR_LOC_UNKNOWN_P (vloc
)
5059 && (val
= find_use_val (vloc
, GET_MODE (oloc
), cui
)))
5061 enum machine_mode mode2
;
5062 enum micro_operation_type type2
;
5063 rtx nloc
= replace_expr_with_values (vloc
);
5067 oloc
= shallow_copy_rtx (oloc
);
5068 PAT_VAR_LOCATION_LOC (oloc
) = nloc
;
5071 oloc
= gen_rtx_CONCAT (mode
, val
->val_rtx
, oloc
);
5073 type2
= use_type (vloc
, 0, &mode2
);
5075 gcc_assert (type2
== MO_USE
|| type2
== MO_USE_NO_VAR
5076 || type2
== MO_CLOBBER
);
5078 if (type2
== MO_CLOBBER
5079 && !cselib_preserved_value_p (val
))
5081 VAL_NEEDS_RESOLUTION (oloc
) = 1;
5082 preserve_value (val
);
5085 else if (!VAR_LOC_UNKNOWN_P (vloc
))
5087 oloc
= shallow_copy_rtx (oloc
);
5088 PAT_VAR_LOCATION_LOC (oloc
) = gen_rtx_UNKNOWN_VAR_LOC ();
5093 else if (type
== MO_VAL_USE
)
5095 enum machine_mode mode2
= VOIDmode
;
5096 enum micro_operation_type type2
;
5097 cselib_val
*val
= find_use_val (loc
, GET_MODE (loc
), cui
);
5098 rtx vloc
, oloc
= loc
, nloc
;
5100 gcc_assert (cui
->sets
);
5103 && !REG_P (XEXP (oloc
, 0))
5104 && !MEM_P (XEXP (oloc
, 0))
5105 && (GET_CODE (XEXP (oloc
, 0)) != PLUS
5106 || XEXP (XEXP (oloc
, 0), 0) != cfa_base_rtx
5107 || !CONST_INT_P (XEXP (XEXP (oloc
, 0), 1))))
5110 enum machine_mode address_mode
= get_address_mode (mloc
);
5112 = cselib_lookup (XEXP (mloc
, 0), address_mode
, 0);
5114 if (val
&& !cselib_preserved_value_p (val
))
5116 micro_operation moa
;
5117 preserve_value (val
);
5118 mloc
= cselib_subst_to_values (XEXP (mloc
, 0));
5119 moa
.type
= MO_VAL_USE
;
5120 moa
.insn
= cui
->insn
;
5121 moa
.u
.loc
= gen_rtx_CONCAT (address_mode
,
5122 val
->val_rtx
, mloc
);
5123 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5124 log_op_type (moa
.u
.loc
, cui
->bb
, cui
->insn
,
5125 moa
.type
, dump_file
);
5126 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &moa
);
5130 type2
= use_type (loc
, 0, &mode2
);
5132 gcc_assert (type2
== MO_USE
|| type2
== MO_USE_NO_VAR
5133 || type2
== MO_CLOBBER
);
5135 if (type2
== MO_USE
)
5136 vloc
= var_lowpart (mode2
, loc
);
5140 /* The loc of a MO_VAL_USE may have two forms:
5142 (concat val src): val is at src, a value-based
5145 (concat (concat val use) src): same as above, with use as
5146 the MO_USE tracked value, if it differs from src.
5150 nloc
= replace_expr_with_values (loc
);
5155 oloc
= gen_rtx_CONCAT (mode2
, val
->val_rtx
, vloc
);
5157 oloc
= val
->val_rtx
;
5159 mo
.u
.loc
= gen_rtx_CONCAT (mode
, oloc
, nloc
);
5161 if (type2
== MO_USE
)
5162 VAL_HOLDS_TRACK_EXPR (mo
.u
.loc
) = 1;
5163 if (!cselib_preserved_value_p (val
))
5165 VAL_NEEDS_RESOLUTION (mo
.u
.loc
) = 1;
5166 preserve_value (val
);
5170 gcc_assert (type
== MO_USE
|| type
== MO_USE_NO_VAR
);
5172 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5173 log_op_type (mo
.u
.loc
, cui
->bb
, cui
->insn
, mo
.type
, dump_file
);
5174 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &mo
);
5180 /* Helper function for finding all uses of REG/MEM in X in insn INSN. */
5183 add_uses_1 (rtx
*x
, void *cui
)
5185 for_each_rtx (x
, add_uses
, cui
);
5188 /* Attempt to reverse the EXPR operation in the debug info. Say for
5189 reg1 = reg2 + 6 even when reg2 is no longer live we
5190 can express its value as VAL - 6. */
5193 reverse_op (rtx val
, const_rtx expr
)
5199 if (GET_CODE (expr
) != SET
)
5202 if (!REG_P (SET_DEST (expr
)) || GET_MODE (val
) != GET_MODE (SET_DEST (expr
)))
5205 src
= SET_SRC (expr
);
5206 switch (GET_CODE (src
))
5213 if (!REG_P (XEXP (src
, 0)))
5218 if (!REG_P (XEXP (src
, 0)) && !MEM_P (XEXP (src
, 0)))
5225 if (!SCALAR_INT_MODE_P (GET_MODE (src
)) || XEXP (src
, 0) == cfa_base_rtx
)
5228 v
= cselib_lookup (XEXP (src
, 0), GET_MODE (XEXP (src
, 0)), 0);
5229 if (!v
|| !cselib_preserved_value_p (v
))
5232 switch (GET_CODE (src
))
5236 if (GET_MODE (v
->val_rtx
) != GET_MODE (val
))
5238 ret
= gen_rtx_fmt_e (GET_CODE (src
), GET_MODE (val
), val
);
5242 ret
= gen_lowpart_SUBREG (GET_MODE (v
->val_rtx
), val
);
5254 if (GET_MODE (v
->val_rtx
) != GET_MODE (val
))
5256 arg
= XEXP (src
, 1);
5257 if (!CONST_INT_P (arg
) && GET_CODE (arg
) != SYMBOL_REF
)
5259 arg
= cselib_expand_value_rtx (arg
, scratch_regs
, 5);
5260 if (arg
== NULL_RTX
)
5262 if (!CONST_INT_P (arg
) && GET_CODE (arg
) != SYMBOL_REF
)
5265 ret
= simplify_gen_binary (code
, GET_MODE (val
), val
, arg
);
5267 /* Ensure ret isn't VALUE itself (which can happen e.g. for
5268 (plus (reg1) (reg2)) when reg2 is known to be 0), as that
5269 breaks a lot of routines during var-tracking. */
5270 ret
= gen_rtx_fmt_ee (PLUS
, GET_MODE (val
), val
, const0_rtx
);
5276 return gen_rtx_CONCAT (GET_MODE (v
->val_rtx
), v
->val_rtx
, ret
);
5279 /* Add stores (register and memory references) LOC which will be tracked
5280 to VTI (bb)->mos. EXPR is the RTL expression containing the store.
5281 CUIP->insn is instruction which the LOC is part of. */
5284 add_stores (rtx loc
, const_rtx expr
, void *cuip
)
5286 enum machine_mode mode
= VOIDmode
, mode2
;
5287 struct count_use_info
*cui
= (struct count_use_info
*)cuip
;
5288 basic_block bb
= cui
->bb
;
5290 rtx oloc
= loc
, nloc
, src
= NULL
;
5291 enum micro_operation_type type
= use_type (loc
, cui
, &mode
);
5292 bool track_p
= false;
5294 bool resolve
, preserve
;
5297 if (type
== MO_CLOBBER
)
5304 gcc_assert (loc
!= cfa_base_rtx
);
5305 if ((GET_CODE (expr
) == CLOBBER
&& type
!= MO_VAL_SET
)
5306 || !(track_p
= use_type (loc
, NULL
, &mode2
) == MO_USE
)
5307 || GET_CODE (expr
) == CLOBBER
)
5309 mo
.type
= MO_CLOBBER
;
5314 if (GET_CODE (expr
) == SET
&& SET_DEST (expr
) == loc
)
5315 src
= var_lowpart (mode2
, SET_SRC (expr
));
5316 loc
= var_lowpart (mode2
, loc
);
5325 rtx xexpr
= gen_rtx_SET (VOIDmode
, loc
, src
);
5326 if (same_variable_part_p (src
, REG_EXPR (loc
), REG_OFFSET (loc
)))
5333 mo
.insn
= cui
->insn
;
5335 else if (MEM_P (loc
)
5336 && ((track_p
= use_type (loc
, NULL
, &mode2
) == MO_USE
)
5339 if (MEM_P (loc
) && type
== MO_VAL_SET
5340 && !REG_P (XEXP (loc
, 0))
5341 && !MEM_P (XEXP (loc
, 0))
5342 && (GET_CODE (XEXP (loc
, 0)) != PLUS
5343 || XEXP (XEXP (loc
, 0), 0) != cfa_base_rtx
5344 || !CONST_INT_P (XEXP (XEXP (loc
, 0), 1))))
5347 enum machine_mode address_mode
= get_address_mode (mloc
);
5348 cselib_val
*val
= cselib_lookup (XEXP (mloc
, 0),
5351 if (val
&& !cselib_preserved_value_p (val
))
5353 preserve_value (val
);
5354 mo
.type
= MO_VAL_USE
;
5355 mloc
= cselib_subst_to_values (XEXP (mloc
, 0));
5356 mo
.u
.loc
= gen_rtx_CONCAT (address_mode
, val
->val_rtx
, mloc
);
5357 mo
.insn
= cui
->insn
;
5358 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5359 log_op_type (mo
.u
.loc
, cui
->bb
, cui
->insn
,
5360 mo
.type
, dump_file
);
5361 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &mo
);
5365 if (GET_CODE (expr
) == CLOBBER
|| !track_p
)
5367 mo
.type
= MO_CLOBBER
;
5368 mo
.u
.loc
= track_p
? var_lowpart (mode2
, loc
) : loc
;
5372 if (GET_CODE (expr
) == SET
&& SET_DEST (expr
) == loc
)
5373 src
= var_lowpart (mode2
, SET_SRC (expr
));
5374 loc
= var_lowpart (mode2
, loc
);
5383 rtx xexpr
= gen_rtx_SET (VOIDmode
, loc
, src
);
5384 if (same_variable_part_p (SET_SRC (xexpr
),
5386 INT_MEM_OFFSET (loc
)))
5393 mo
.insn
= cui
->insn
;
5398 if (type
!= MO_VAL_SET
)
5399 goto log_and_return
;
5401 v
= find_use_val (oloc
, mode
, cui
);
5404 goto log_and_return
;
5406 resolve
= preserve
= !cselib_preserved_value_p (v
);
5408 nloc
= replace_expr_with_values (oloc
);
5412 if (GET_CODE (PATTERN (cui
->insn
)) == COND_EXEC
)
5414 cselib_val
*oval
= cselib_lookup (oloc
, GET_MODE (oloc
), 0);
5416 gcc_assert (oval
!= v
);
5417 gcc_assert (REG_P (oloc
) || MEM_P (oloc
));
5419 if (!cselib_preserved_value_p (oval
))
5421 micro_operation moa
;
5423 preserve_value (oval
);
5425 moa
.type
= MO_VAL_USE
;
5426 moa
.u
.loc
= gen_rtx_CONCAT (mode
, oval
->val_rtx
, oloc
);
5427 VAL_NEEDS_RESOLUTION (moa
.u
.loc
) = 1;
5428 moa
.insn
= cui
->insn
;
5430 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5431 log_op_type (moa
.u
.loc
, cui
->bb
, cui
->insn
,
5432 moa
.type
, dump_file
);
5433 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &moa
);
5438 else if (resolve
&& GET_CODE (mo
.u
.loc
) == SET
)
5440 nloc
= replace_expr_with_values (SET_SRC (expr
));
5442 /* Avoid the mode mismatch between oexpr and expr. */
5443 if (!nloc
&& mode
!= mode2
)
5445 nloc
= SET_SRC (expr
);
5446 gcc_assert (oloc
== SET_DEST (expr
));
5450 oloc
= gen_rtx_SET (GET_MODE (mo
.u
.loc
), oloc
, nloc
);
5453 if (oloc
== SET_DEST (mo
.u
.loc
))
5454 /* No point in duplicating. */
5456 if (!REG_P (SET_SRC (mo
.u
.loc
)))
5462 if (GET_CODE (mo
.u
.loc
) == SET
5463 && oloc
== SET_DEST (mo
.u
.loc
))
5464 /* No point in duplicating. */
5470 loc
= gen_rtx_CONCAT (mode
, v
->val_rtx
, oloc
);
5472 if (mo
.u
.loc
!= oloc
)
5473 loc
= gen_rtx_CONCAT (GET_MODE (mo
.u
.loc
), loc
, mo
.u
.loc
);
5475 /* The loc of a MO_VAL_SET may have various forms:
5477 (concat val dst): dst now holds val
5479 (concat val (set dst src)): dst now holds val, copied from src
5481 (concat (concat val dstv) dst): dst now holds val; dstv is dst
5482 after replacing mems and non-top-level regs with values.
5484 (concat (concat val dstv) (set dst src)): dst now holds val,
5485 copied from src. dstv is a value-based representation of dst, if
5486 it differs from dst. If resolution is needed, src is a REG, and
5487 its mode is the same as that of val.
5489 (concat (concat val (set dstv srcv)) (set dst src)): src
5490 copied to dst, holding val. dstv and srcv are value-based
5491 representations of dst and src, respectively.
5495 if (GET_CODE (PATTERN (cui
->insn
)) != COND_EXEC
)
5497 reverse
= reverse_op (v
->val_rtx
, expr
);
5500 loc
= gen_rtx_CONCAT (GET_MODE (mo
.u
.loc
), loc
, reverse
);
5501 VAL_EXPR_HAS_REVERSE (loc
) = 1;
5508 VAL_HOLDS_TRACK_EXPR (loc
) = 1;
5511 VAL_NEEDS_RESOLUTION (loc
) = resolve
;
5514 if (mo
.type
== MO_CLOBBER
)
5515 VAL_EXPR_IS_CLOBBERED (loc
) = 1;
5516 if (mo
.type
== MO_COPY
)
5517 VAL_EXPR_IS_COPIED (loc
) = 1;
5519 mo
.type
= MO_VAL_SET
;
5522 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5523 log_op_type (mo
.u
.loc
, cui
->bb
, cui
->insn
, mo
.type
, dump_file
);
5524 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &mo
);
5527 /* Callback for cselib_record_sets_hook, that records as micro
5528 operations uses and stores in an insn after cselib_record_sets has
5529 analyzed the sets in an insn, but before it modifies the stored
5530 values in the internal tables, unless cselib_record_sets doesn't
5531 call it directly (perhaps because we're not doing cselib in the
5532 first place, in which case sets and n_sets will be 0). */
5535 add_with_sets (rtx insn
, struct cselib_set
*sets
, int n_sets
)
5537 basic_block bb
= BLOCK_FOR_INSN (insn
);
5539 struct count_use_info cui
;
5540 micro_operation
*mos
;
5542 cselib_hook_called
= true;
5547 cui
.n_sets
= n_sets
;
5549 n1
= VEC_length (micro_operation
, VTI (bb
)->mos
);
5550 cui
.store_p
= false;
5551 note_uses (&PATTERN (insn
), add_uses_1
, &cui
);
5552 n2
= VEC_length (micro_operation
, VTI (bb
)->mos
) - 1;
5553 mos
= VEC_address (micro_operation
, VTI (bb
)->mos
);
5555 /* Order the MO_USEs to be before MO_USE_NO_VARs and MO_VAL_USE, and
5559 while (n1
< n2
&& mos
[n1
].type
== MO_USE
)
5561 while (n1
< n2
&& mos
[n2
].type
!= MO_USE
)
5573 n2
= VEC_length (micro_operation
, VTI (bb
)->mos
) - 1;
5576 while (n1
< n2
&& mos
[n1
].type
!= MO_VAL_LOC
)
5578 while (n1
< n2
&& mos
[n2
].type
== MO_VAL_LOC
)
5596 mo
.u
.loc
= NULL_RTX
;
5598 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5599 log_op_type (PATTERN (insn
), bb
, insn
, mo
.type
, dump_file
);
5600 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
, &mo
);
5603 n1
= VEC_length (micro_operation
, VTI (bb
)->mos
);
5604 /* This will record NEXT_INSN (insn), such that we can
5605 insert notes before it without worrying about any
5606 notes that MO_USEs might emit after the insn. */
5608 note_stores (PATTERN (insn
), add_stores
, &cui
);
5609 n2
= VEC_length (micro_operation
, VTI (bb
)->mos
) - 1;
5610 mos
= VEC_address (micro_operation
, VTI (bb
)->mos
);
5612 /* Order the MO_VAL_USEs first (note_stores does nothing
5613 on DEBUG_INSNs, so there are no MO_VAL_LOCs from this
5614 insn), then MO_CLOBBERs, then MO_SET/MO_COPY/MO_VAL_SET. */
5617 while (n1
< n2
&& mos
[n1
].type
== MO_VAL_USE
)
5619 while (n1
< n2
&& mos
[n2
].type
!= MO_VAL_USE
)
5631 n2
= VEC_length (micro_operation
, VTI (bb
)->mos
) - 1;
5634 while (n1
< n2
&& mos
[n1
].type
== MO_CLOBBER
)
5636 while (n1
< n2
&& mos
[n2
].type
!= MO_CLOBBER
)
5649 static enum var_init_status
5650 find_src_status (dataflow_set
*in
, rtx src
)
5652 tree decl
= NULL_TREE
;
5653 enum var_init_status status
= VAR_INIT_STATUS_UNINITIALIZED
;
5655 if (! flag_var_tracking_uninit
)
5656 status
= VAR_INIT_STATUS_INITIALIZED
;
5658 if (src
&& REG_P (src
))
5659 decl
= var_debug_decl (REG_EXPR (src
));
5660 else if (src
&& MEM_P (src
))
5661 decl
= var_debug_decl (MEM_EXPR (src
));
5664 status
= get_init_value (in
, src
, dv_from_decl (decl
));
5669 /* SRC is the source of an assignment. Use SET to try to find what
5670 was ultimately assigned to SRC. Return that value if known,
5671 otherwise return SRC itself. */
5674 find_src_set_src (dataflow_set
*set
, rtx src
)
5676 tree decl
= NULL_TREE
; /* The variable being copied around. */
5677 rtx set_src
= NULL_RTX
; /* The value for "decl" stored in "src". */
5679 location_chain nextp
;
5683 if (src
&& REG_P (src
))
5684 decl
= var_debug_decl (REG_EXPR (src
));
5685 else if (src
&& MEM_P (src
))
5686 decl
= var_debug_decl (MEM_EXPR (src
));
5690 decl_or_value dv
= dv_from_decl (decl
);
5692 var
= shared_hash_find (set
->vars
, dv
);
5696 for (i
= 0; i
< var
->n_var_parts
&& !found
; i
++)
5697 for (nextp
= var
->var_part
[i
].loc_chain
; nextp
&& !found
;
5698 nextp
= nextp
->next
)
5699 if (rtx_equal_p (nextp
->loc
, src
))
5701 set_src
= nextp
->set_src
;
5711 /* Compute the changes of variable locations in the basic block BB. */
5714 compute_bb_dataflow (basic_block bb
)
5717 micro_operation
*mo
;
5719 dataflow_set old_out
;
5720 dataflow_set
*in
= &VTI (bb
)->in
;
5721 dataflow_set
*out
= &VTI (bb
)->out
;
5723 dataflow_set_init (&old_out
);
5724 dataflow_set_copy (&old_out
, out
);
5725 dataflow_set_copy (out
, in
);
5727 FOR_EACH_VEC_ELT (micro_operation
, VTI (bb
)->mos
, i
, mo
)
5729 rtx insn
= mo
->insn
;
5734 dataflow_set_clear_at_call (out
);
5739 rtx loc
= mo
->u
.loc
;
5742 var_reg_set (out
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
5743 else if (MEM_P (loc
))
5744 var_mem_set (out
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
5750 rtx loc
= mo
->u
.loc
;
5754 if (GET_CODE (loc
) == CONCAT
)
5756 val
= XEXP (loc
, 0);
5757 vloc
= XEXP (loc
, 1);
5765 var
= PAT_VAR_LOCATION_DECL (vloc
);
5767 clobber_variable_part (out
, NULL_RTX
,
5768 dv_from_decl (var
), 0, NULL_RTX
);
5771 if (VAL_NEEDS_RESOLUTION (loc
))
5772 val_resolve (out
, val
, PAT_VAR_LOCATION_LOC (vloc
), insn
);
5773 set_variable_part (out
, val
, dv_from_decl (var
), 0,
5774 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
5777 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc
)))
5778 set_variable_part (out
, PAT_VAR_LOCATION_LOC (vloc
),
5779 dv_from_decl (var
), 0,
5780 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
5787 rtx loc
= mo
->u
.loc
;
5788 rtx val
, vloc
, uloc
;
5790 vloc
= uloc
= XEXP (loc
, 1);
5791 val
= XEXP (loc
, 0);
5793 if (GET_CODE (val
) == CONCAT
)
5795 uloc
= XEXP (val
, 1);
5796 val
= XEXP (val
, 0);
5799 if (VAL_NEEDS_RESOLUTION (loc
))
5800 val_resolve (out
, val
, vloc
, insn
);
5802 val_store (out
, val
, uloc
, insn
, false);
5804 if (VAL_HOLDS_TRACK_EXPR (loc
))
5806 if (GET_CODE (uloc
) == REG
)
5807 var_reg_set (out
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
5809 else if (GET_CODE (uloc
) == MEM
)
5810 var_mem_set (out
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
5818 rtx loc
= mo
->u
.loc
;
5819 rtx val
, vloc
, uloc
, reverse
= NULL_RTX
;
5822 if (VAL_EXPR_HAS_REVERSE (loc
))
5824 reverse
= XEXP (loc
, 1);
5825 vloc
= XEXP (loc
, 0);
5827 uloc
= XEXP (vloc
, 1);
5828 val
= XEXP (vloc
, 0);
5831 if (GET_CODE (val
) == CONCAT
)
5833 vloc
= XEXP (val
, 1);
5834 val
= XEXP (val
, 0);
5837 if (GET_CODE (vloc
) == SET
)
5839 rtx vsrc
= SET_SRC (vloc
);
5841 gcc_assert (val
!= vsrc
);
5842 gcc_assert (vloc
== uloc
|| VAL_NEEDS_RESOLUTION (loc
));
5844 vloc
= SET_DEST (vloc
);
5846 if (VAL_NEEDS_RESOLUTION (loc
))
5847 val_resolve (out
, val
, vsrc
, insn
);
5849 else if (VAL_NEEDS_RESOLUTION (loc
))
5851 gcc_assert (GET_CODE (uloc
) == SET
5852 && GET_CODE (SET_SRC (uloc
)) == REG
);
5853 val_resolve (out
, val
, SET_SRC (uloc
), insn
);
5856 if (VAL_HOLDS_TRACK_EXPR (loc
))
5858 if (VAL_EXPR_IS_CLOBBERED (loc
))
5861 var_reg_delete (out
, uloc
, true);
5862 else if (MEM_P (uloc
))
5863 var_mem_delete (out
, uloc
, true);
5867 bool copied_p
= VAL_EXPR_IS_COPIED (loc
);
5869 enum var_init_status status
= VAR_INIT_STATUS_INITIALIZED
;
5871 if (GET_CODE (uloc
) == SET
)
5873 set_src
= SET_SRC (uloc
);
5874 uloc
= SET_DEST (uloc
);
5879 if (flag_var_tracking_uninit
)
5881 status
= find_src_status (in
, set_src
);
5883 if (status
== VAR_INIT_STATUS_UNKNOWN
)
5884 status
= find_src_status (out
, set_src
);
5887 set_src
= find_src_set_src (in
, set_src
);
5891 var_reg_delete_and_set (out
, uloc
, !copied_p
,
5893 else if (MEM_P (uloc
))
5894 var_mem_delete_and_set (out
, uloc
, !copied_p
,
5898 else if (REG_P (uloc
))
5899 var_regno_delete (out
, REGNO (uloc
));
5901 val_store (out
, val
, vloc
, insn
, true);
5904 val_store (out
, XEXP (reverse
, 0), XEXP (reverse
, 1),
5911 rtx loc
= mo
->u
.loc
;
5914 if (GET_CODE (loc
) == SET
)
5916 set_src
= SET_SRC (loc
);
5917 loc
= SET_DEST (loc
);
5921 var_reg_delete_and_set (out
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
5923 else if (MEM_P (loc
))
5924 var_mem_delete_and_set (out
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
5931 rtx loc
= mo
->u
.loc
;
5932 enum var_init_status src_status
;
5935 if (GET_CODE (loc
) == SET
)
5937 set_src
= SET_SRC (loc
);
5938 loc
= SET_DEST (loc
);
5941 if (! flag_var_tracking_uninit
)
5942 src_status
= VAR_INIT_STATUS_INITIALIZED
;
5945 src_status
= find_src_status (in
, set_src
);
5947 if (src_status
== VAR_INIT_STATUS_UNKNOWN
)
5948 src_status
= find_src_status (out
, set_src
);
5951 set_src
= find_src_set_src (in
, set_src
);
5954 var_reg_delete_and_set (out
, loc
, false, src_status
, set_src
);
5955 else if (MEM_P (loc
))
5956 var_mem_delete_and_set (out
, loc
, false, src_status
, set_src
);
5962 rtx loc
= mo
->u
.loc
;
5965 var_reg_delete (out
, loc
, false);
5966 else if (MEM_P (loc
))
5967 var_mem_delete (out
, loc
, false);
5973 rtx loc
= mo
->u
.loc
;
5976 var_reg_delete (out
, loc
, true);
5977 else if (MEM_P (loc
))
5978 var_mem_delete (out
, loc
, true);
5983 out
->stack_adjust
+= mo
->u
.adjust
;
5988 if (MAY_HAVE_DEBUG_INSNS
)
5990 dataflow_set_equiv_regs (out
);
5991 htab_traverse (shared_hash_htab (out
->vars
), canonicalize_values_mark
,
5993 htab_traverse (shared_hash_htab (out
->vars
), canonicalize_values_star
,
5996 htab_traverse (shared_hash_htab (out
->vars
),
5997 canonicalize_loc_order_check
, out
);
6000 changed
= dataflow_set_different (&old_out
, out
);
6001 dataflow_set_destroy (&old_out
);
6005 /* Find the locations of variables in the whole function. */
6008 vt_find_locations (void)
6010 fibheap_t worklist
, pending
, fibheap_swap
;
6011 sbitmap visited
, in_worklist
, in_pending
, sbitmap_swap
;
6018 int htabmax
= PARAM_VALUE (PARAM_MAX_VARTRACK_SIZE
);
6019 bool success
= true;
6021 timevar_push (TV_VAR_TRACKING_DATAFLOW
);
6022 /* Compute reverse completion order of depth first search of the CFG
6023 so that the data-flow runs faster. */
6024 rc_order
= XNEWVEC (int, n_basic_blocks
- NUM_FIXED_BLOCKS
);
6025 bb_order
= XNEWVEC (int, last_basic_block
);
6026 pre_and_rev_post_order_compute (NULL
, rc_order
, false);
6027 for (i
= 0; i
< n_basic_blocks
- NUM_FIXED_BLOCKS
; i
++)
6028 bb_order
[rc_order
[i
]] = i
;
6031 worklist
= fibheap_new ();
6032 pending
= fibheap_new ();
6033 visited
= sbitmap_alloc (last_basic_block
);
6034 in_worklist
= sbitmap_alloc (last_basic_block
);
6035 in_pending
= sbitmap_alloc (last_basic_block
);
6036 sbitmap_zero (in_worklist
);
6039 fibheap_insert (pending
, bb_order
[bb
->index
], bb
);
6040 sbitmap_ones (in_pending
);
6042 while (success
&& !fibheap_empty (pending
))
6044 fibheap_swap
= pending
;
6046 worklist
= fibheap_swap
;
6047 sbitmap_swap
= in_pending
;
6048 in_pending
= in_worklist
;
6049 in_worklist
= sbitmap_swap
;
6051 sbitmap_zero (visited
);
6053 while (!fibheap_empty (worklist
))
6055 bb
= (basic_block
) fibheap_extract_min (worklist
);
6056 RESET_BIT (in_worklist
, bb
->index
);
6057 gcc_assert (!TEST_BIT (visited
, bb
->index
));
6058 if (!TEST_BIT (visited
, bb
->index
))
6062 int oldinsz
, oldoutsz
;
6064 SET_BIT (visited
, bb
->index
);
6066 if (VTI (bb
)->in
.vars
)
6069 -= (htab_size (shared_hash_htab (VTI (bb
)->in
.vars
))
6070 + htab_size (shared_hash_htab (VTI (bb
)->out
.vars
)));
6072 = htab_elements (shared_hash_htab (VTI (bb
)->in
.vars
));
6074 = htab_elements (shared_hash_htab (VTI (bb
)->out
.vars
));
6077 oldinsz
= oldoutsz
= 0;
6079 if (MAY_HAVE_DEBUG_INSNS
)
6081 dataflow_set
*in
= &VTI (bb
)->in
, *first_out
= NULL
;
6082 bool first
= true, adjust
= false;
6084 /* Calculate the IN set as the intersection of
6085 predecessor OUT sets. */
6087 dataflow_set_clear (in
);
6088 dst_can_be_shared
= true;
6090 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6091 if (!VTI (e
->src
)->flooded
)
6092 gcc_assert (bb_order
[bb
->index
]
6093 <= bb_order
[e
->src
->index
]);
6096 dataflow_set_copy (in
, &VTI (e
->src
)->out
);
6097 first_out
= &VTI (e
->src
)->out
;
6102 dataflow_set_merge (in
, &VTI (e
->src
)->out
);
6108 dataflow_post_merge_adjust (in
, &VTI (bb
)->permp
);
6110 /* Merge and merge_adjust should keep entries in
6112 htab_traverse (shared_hash_htab (in
->vars
),
6113 canonicalize_loc_order_check
,
6116 if (dst_can_be_shared
)
6118 shared_hash_destroy (in
->vars
);
6119 in
->vars
= shared_hash_copy (first_out
->vars
);
6123 VTI (bb
)->flooded
= true;
6127 /* Calculate the IN set as union of predecessor OUT sets. */
6128 dataflow_set_clear (&VTI (bb
)->in
);
6129 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6130 dataflow_set_union (&VTI (bb
)->in
, &VTI (e
->src
)->out
);
6133 changed
= compute_bb_dataflow (bb
);
6134 htabsz
+= (htab_size (shared_hash_htab (VTI (bb
)->in
.vars
))
6135 + htab_size (shared_hash_htab (VTI (bb
)->out
.vars
)));
6137 if (htabmax
&& htabsz
> htabmax
)
6139 if (MAY_HAVE_DEBUG_INSNS
)
6140 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
6141 "variable tracking size limit exceeded with "
6142 "-fvar-tracking-assignments, retrying without");
6144 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
6145 "variable tracking size limit exceeded");
6152 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6154 if (e
->dest
== EXIT_BLOCK_PTR
)
6157 if (TEST_BIT (visited
, e
->dest
->index
))
6159 if (!TEST_BIT (in_pending
, e
->dest
->index
))
6161 /* Send E->DEST to next round. */
6162 SET_BIT (in_pending
, e
->dest
->index
);
6163 fibheap_insert (pending
,
6164 bb_order
[e
->dest
->index
],
6168 else if (!TEST_BIT (in_worklist
, e
->dest
->index
))
6170 /* Add E->DEST to current round. */
6171 SET_BIT (in_worklist
, e
->dest
->index
);
6172 fibheap_insert (worklist
, bb_order
[e
->dest
->index
],
6180 "BB %i: in %i (was %i), out %i (was %i), rem %i + %i, tsz %i\n",
6182 (int)htab_elements (shared_hash_htab (VTI (bb
)->in
.vars
)),
6184 (int)htab_elements (shared_hash_htab (VTI (bb
)->out
.vars
)),
6186 (int)worklist
->nodes
, (int)pending
->nodes
, htabsz
);
6188 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
6190 fprintf (dump_file
, "BB %i IN:\n", bb
->index
);
6191 dump_dataflow_set (&VTI (bb
)->in
);
6192 fprintf (dump_file
, "BB %i OUT:\n", bb
->index
);
6193 dump_dataflow_set (&VTI (bb
)->out
);
6199 if (success
&& MAY_HAVE_DEBUG_INSNS
)
6201 gcc_assert (VTI (bb
)->flooded
);
6204 fibheap_delete (worklist
);
6205 fibheap_delete (pending
);
6206 sbitmap_free (visited
);
6207 sbitmap_free (in_worklist
);
6208 sbitmap_free (in_pending
);
6210 timevar_pop (TV_VAR_TRACKING_DATAFLOW
);
6214 /* Print the content of the LIST to dump file. */
6217 dump_attrs_list (attrs list
)
6219 for (; list
; list
= list
->next
)
6221 if (dv_is_decl_p (list
->dv
))
6222 print_mem_expr (dump_file
, dv_as_decl (list
->dv
));
6224 print_rtl_single (dump_file
, dv_as_value (list
->dv
));
6225 fprintf (dump_file
, "+" HOST_WIDE_INT_PRINT_DEC
, list
->offset
);
6227 fprintf (dump_file
, "\n");
6230 /* Print the information about variable *SLOT to dump file. */
6233 dump_var_slot (void **slot
, void *data ATTRIBUTE_UNUSED
)
6235 variable var
= (variable
) *slot
;
6239 /* Continue traversing the hash table. */
6243 /* Print the information about variable VAR to dump file. */
6246 dump_var (variable var
)
6249 location_chain node
;
6251 if (dv_is_decl_p (var
->dv
))
6253 const_tree decl
= dv_as_decl (var
->dv
);
6255 if (DECL_NAME (decl
))
6257 fprintf (dump_file
, " name: %s",
6258 IDENTIFIER_POINTER (DECL_NAME (decl
)));
6259 if (dump_flags
& TDF_UID
)
6260 fprintf (dump_file
, "D.%u", DECL_UID (decl
));
6262 else if (TREE_CODE (decl
) == DEBUG_EXPR_DECL
)
6263 fprintf (dump_file
, " name: D#%u", DEBUG_TEMP_UID (decl
));
6265 fprintf (dump_file
, " name: D.%u", DECL_UID (decl
));
6266 fprintf (dump_file
, "\n");
6270 fputc (' ', dump_file
);
6271 print_rtl_single (dump_file
, dv_as_value (var
->dv
));
6274 for (i
= 0; i
< var
->n_var_parts
; i
++)
6276 fprintf (dump_file
, " offset %ld\n",
6277 (long) var
->var_part
[i
].offset
);
6278 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
6280 fprintf (dump_file
, " ");
6281 if (node
->init
== VAR_INIT_STATUS_UNINITIALIZED
)
6282 fprintf (dump_file
, "[uninit]");
6283 print_rtl_single (dump_file
, node
->loc
);
6288 /* Print the information about variables from hash table VARS to dump file. */
6291 dump_vars (htab_t vars
)
6293 if (htab_elements (vars
) > 0)
6295 fprintf (dump_file
, "Variables:\n");
6296 htab_traverse (vars
, dump_var_slot
, NULL
);
6300 /* Print the dataflow set SET to dump file. */
6303 dump_dataflow_set (dataflow_set
*set
)
6307 fprintf (dump_file
, "Stack adjustment: " HOST_WIDE_INT_PRINT_DEC
"\n",
6309 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
6313 fprintf (dump_file
, "Reg %d:", i
);
6314 dump_attrs_list (set
->regs
[i
]);
6317 dump_vars (shared_hash_htab (set
->vars
));
6318 fprintf (dump_file
, "\n");
6321 /* Print the IN and OUT sets for each basic block to dump file. */
6324 dump_dataflow_sets (void)
6330 fprintf (dump_file
, "\nBasic block %d:\n", bb
->index
);
6331 fprintf (dump_file
, "IN:\n");
6332 dump_dataflow_set (&VTI (bb
)->in
);
6333 fprintf (dump_file
, "OUT:\n");
6334 dump_dataflow_set (&VTI (bb
)->out
);
6338 /* Add variable VAR to the hash table of changed variables and
6339 if it has no locations delete it from SET's hash table. */
6342 variable_was_changed (variable var
, dataflow_set
*set
)
6344 hashval_t hash
= dv_htab_hash (var
->dv
);
6349 bool old_cur_loc_changed
= false;
6351 /* Remember this decl or VALUE has been added to changed_variables. */
6352 set_dv_changed (var
->dv
, true);
6354 slot
= htab_find_slot_with_hash (changed_variables
,
6360 variable old_var
= (variable
) *slot
;
6361 gcc_assert (old_var
->in_changed_variables
);
6362 old_var
->in_changed_variables
= false;
6363 old_cur_loc_changed
= old_var
->cur_loc_changed
;
6364 variable_htab_free (*slot
);
6366 if (set
&& var
->n_var_parts
== 0)
6370 empty_var
= (variable
) pool_alloc (dv_pool (var
->dv
));
6371 empty_var
->dv
= var
->dv
;
6372 empty_var
->refcount
= 1;
6373 empty_var
->n_var_parts
= 0;
6374 empty_var
->cur_loc_changed
= true;
6375 empty_var
->in_changed_variables
= true;
6382 var
->in_changed_variables
= true;
6383 /* If within processing one uop a variable is deleted
6384 and then readded, we need to assume it has changed. */
6385 if (old_cur_loc_changed
)
6386 var
->cur_loc_changed
= true;
6393 if (var
->n_var_parts
== 0)
6398 slot
= shared_hash_find_slot_noinsert (set
->vars
, var
->dv
);
6401 if (shared_hash_shared (set
->vars
))
6402 slot
= shared_hash_find_slot_unshare (&set
->vars
, var
->dv
,
6404 htab_clear_slot (shared_hash_htab (set
->vars
), slot
);
6410 /* Look for the index in VAR->var_part corresponding to OFFSET.
6411 Return -1 if not found. If INSERTION_POINT is non-NULL, the
6412 referenced int will be set to the index that the part has or should
6413 have, if it should be inserted. */
6416 find_variable_location_part (variable var
, HOST_WIDE_INT offset
,
6417 int *insertion_point
)
6421 /* Find the location part. */
6423 high
= var
->n_var_parts
;
6426 pos
= (low
+ high
) / 2;
6427 if (var
->var_part
[pos
].offset
< offset
)
6434 if (insertion_point
)
6435 *insertion_point
= pos
;
6437 if (pos
< var
->n_var_parts
&& var
->var_part
[pos
].offset
== offset
)
6444 set_slot_part (dataflow_set
*set
, rtx loc
, void **slot
,
6445 decl_or_value dv
, HOST_WIDE_INT offset
,
6446 enum var_init_status initialized
, rtx set_src
)
6449 location_chain node
, next
;
6450 location_chain
*nextp
;
6452 bool onepart
= dv_onepart_p (dv
);
6454 gcc_assert (offset
== 0 || !onepart
);
6455 gcc_assert (loc
!= dv_as_opaque (dv
));
6457 var
= (variable
) *slot
;
6459 if (! flag_var_tracking_uninit
)
6460 initialized
= VAR_INIT_STATUS_INITIALIZED
;
6464 /* Create new variable information. */
6465 var
= (variable
) pool_alloc (dv_pool (dv
));
6468 var
->n_var_parts
= 1;
6469 var
->cur_loc_changed
= false;
6470 var
->in_changed_variables
= false;
6471 var
->var_part
[0].offset
= offset
;
6472 var
->var_part
[0].loc_chain
= NULL
;
6473 var
->var_part
[0].cur_loc
= NULL
;
6476 nextp
= &var
->var_part
[0].loc_chain
;
6482 gcc_assert (dv_as_opaque (var
->dv
) == dv_as_opaque (dv
));
6486 if (GET_CODE (loc
) == VALUE
)
6488 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
6489 nextp
= &node
->next
)
6490 if (GET_CODE (node
->loc
) == VALUE
)
6492 if (node
->loc
== loc
)
6497 if (canon_value_cmp (node
->loc
, loc
))
6505 else if (REG_P (node
->loc
) || MEM_P (node
->loc
))
6513 else if (REG_P (loc
))
6515 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
6516 nextp
= &node
->next
)
6517 if (REG_P (node
->loc
))
6519 if (REGNO (node
->loc
) < REGNO (loc
))
6523 if (REGNO (node
->loc
) == REGNO (loc
))
6536 else if (MEM_P (loc
))
6538 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
6539 nextp
= &node
->next
)
6540 if (REG_P (node
->loc
))
6542 else if (MEM_P (node
->loc
))
6544 if ((r
= loc_cmp (XEXP (node
->loc
, 0), XEXP (loc
, 0))) >= 0)
6556 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
6557 nextp
= &node
->next
)
6558 if ((r
= loc_cmp (node
->loc
, loc
)) >= 0)
6566 if (shared_var_p (var
, set
->vars
))
6568 slot
= unshare_variable (set
, slot
, var
, initialized
);
6569 var
= (variable
)*slot
;
6570 for (nextp
= &var
->var_part
[0].loc_chain
; c
;
6571 nextp
= &(*nextp
)->next
)
6573 gcc_assert ((!node
&& !*nextp
) || node
->loc
== (*nextp
)->loc
);
6580 gcc_assert (dv_as_decl (var
->dv
) == dv_as_decl (dv
));
6582 pos
= find_variable_location_part (var
, offset
, &inspos
);
6586 node
= var
->var_part
[pos
].loc_chain
;
6589 && ((REG_P (node
->loc
) && REG_P (loc
)
6590 && REGNO (node
->loc
) == REGNO (loc
))
6591 || rtx_equal_p (node
->loc
, loc
)))
6593 /* LOC is in the beginning of the chain so we have nothing
6595 if (node
->init
< initialized
)
6596 node
->init
= initialized
;
6597 if (set_src
!= NULL
)
6598 node
->set_src
= set_src
;
6604 /* We have to make a copy of a shared variable. */
6605 if (shared_var_p (var
, set
->vars
))
6607 slot
= unshare_variable (set
, slot
, var
, initialized
);
6608 var
= (variable
)*slot
;
6614 /* We have not found the location part, new one will be created. */
6616 /* We have to make a copy of the shared variable. */
6617 if (shared_var_p (var
, set
->vars
))
6619 slot
= unshare_variable (set
, slot
, var
, initialized
);
6620 var
= (variable
)*slot
;
6623 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
6624 thus there are at most MAX_VAR_PARTS different offsets. */
6625 gcc_assert (var
->n_var_parts
< MAX_VAR_PARTS
6626 && (!var
->n_var_parts
|| !dv_onepart_p (var
->dv
)));
6628 /* We have to move the elements of array starting at index
6629 inspos to the next position. */
6630 for (pos
= var
->n_var_parts
; pos
> inspos
; pos
--)
6631 var
->var_part
[pos
] = var
->var_part
[pos
- 1];
6634 var
->var_part
[pos
].offset
= offset
;
6635 var
->var_part
[pos
].loc_chain
= NULL
;
6636 var
->var_part
[pos
].cur_loc
= NULL
;
6639 /* Delete the location from the list. */
6640 nextp
= &var
->var_part
[pos
].loc_chain
;
6641 for (node
= var
->var_part
[pos
].loc_chain
; node
; node
= next
)
6644 if ((REG_P (node
->loc
) && REG_P (loc
)
6645 && REGNO (node
->loc
) == REGNO (loc
))
6646 || rtx_equal_p (node
->loc
, loc
))
6648 /* Save these values, to assign to the new node, before
6649 deleting this one. */
6650 if (node
->init
> initialized
)
6651 initialized
= node
->init
;
6652 if (node
->set_src
!= NULL
&& set_src
== NULL
)
6653 set_src
= node
->set_src
;
6654 if (var
->var_part
[pos
].cur_loc
== node
->loc
)
6656 var
->var_part
[pos
].cur_loc
= NULL
;
6657 var
->cur_loc_changed
= true;
6659 pool_free (loc_chain_pool
, node
);
6664 nextp
= &node
->next
;
6667 nextp
= &var
->var_part
[pos
].loc_chain
;
6670 /* Add the location to the beginning. */
6671 node
= (location_chain
) pool_alloc (loc_chain_pool
);
6673 node
->init
= initialized
;
6674 node
->set_src
= set_src
;
6675 node
->next
= *nextp
;
6678 if (onepart
&& emit_notes
)
6679 add_value_chains (var
->dv
, loc
);
6681 /* If no location was emitted do so. */
6682 if (var
->var_part
[pos
].cur_loc
== NULL
)
6683 variable_was_changed (var
, set
);
6688 /* Set the part of variable's location in the dataflow set SET. The
6689 variable part is specified by variable's declaration in DV and
6690 offset OFFSET and the part's location by LOC. IOPT should be
6691 NO_INSERT if the variable is known to be in SET already and the
6692 variable hash table must not be resized, and INSERT otherwise. */
6695 set_variable_part (dataflow_set
*set
, rtx loc
,
6696 decl_or_value dv
, HOST_WIDE_INT offset
,
6697 enum var_init_status initialized
, rtx set_src
,
6698 enum insert_option iopt
)
6702 if (iopt
== NO_INSERT
)
6703 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
6706 slot
= shared_hash_find_slot (set
->vars
, dv
);
6708 slot
= shared_hash_find_slot_unshare (&set
->vars
, dv
, iopt
);
6710 slot
= set_slot_part (set
, loc
, slot
, dv
, offset
, initialized
, set_src
);
6713 /* Remove all recorded register locations for the given variable part
6714 from dataflow set SET, except for those that are identical to loc.
6715 The variable part is specified by variable's declaration or value
6716 DV and offset OFFSET. */
6719 clobber_slot_part (dataflow_set
*set
, rtx loc
, void **slot
,
6720 HOST_WIDE_INT offset
, rtx set_src
)
6722 variable var
= (variable
) *slot
;
6723 int pos
= find_variable_location_part (var
, offset
, NULL
);
6727 location_chain node
, next
;
6729 /* Remove the register locations from the dataflow set. */
6730 next
= var
->var_part
[pos
].loc_chain
;
6731 for (node
= next
; node
; node
= next
)
6734 if (node
->loc
!= loc
6735 && (!flag_var_tracking_uninit
6738 || !rtx_equal_p (set_src
, node
->set_src
)))
6740 if (REG_P (node
->loc
))
6745 /* Remove the variable part from the register's
6746 list, but preserve any other variable parts
6747 that might be regarded as live in that same
6749 anextp
= &set
->regs
[REGNO (node
->loc
)];
6750 for (anode
= *anextp
; anode
; anode
= anext
)
6752 anext
= anode
->next
;
6753 if (dv_as_opaque (anode
->dv
) == dv_as_opaque (var
->dv
)
6754 && anode
->offset
== offset
)
6756 pool_free (attrs_pool
, anode
);
6760 anextp
= &anode
->next
;
6764 slot
= delete_slot_part (set
, node
->loc
, slot
, offset
);
6772 /* Remove all recorded register locations for the given variable part
6773 from dataflow set SET, except for those that are identical to loc.
6774 The variable part is specified by variable's declaration or value
6775 DV and offset OFFSET. */
6778 clobber_variable_part (dataflow_set
*set
, rtx loc
, decl_or_value dv
,
6779 HOST_WIDE_INT offset
, rtx set_src
)
6783 if (!dv_as_opaque (dv
)
6784 || (!dv_is_value_p (dv
) && ! DECL_P (dv_as_decl (dv
))))
6787 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
6791 slot
= clobber_slot_part (set
, loc
, slot
, offset
, set_src
);
6794 /* Delete the part of variable's location from dataflow set SET. The
6795 variable part is specified by its SET->vars slot SLOT and offset
6796 OFFSET and the part's location by LOC. */
6799 delete_slot_part (dataflow_set
*set
, rtx loc
, void **slot
,
6800 HOST_WIDE_INT offset
)
6802 variable var
= (variable
) *slot
;
6803 int pos
= find_variable_location_part (var
, offset
, NULL
);
6807 location_chain node
, next
;
6808 location_chain
*nextp
;
6811 if (shared_var_p (var
, set
->vars
))
6813 /* If the variable contains the location part we have to
6814 make a copy of the variable. */
6815 for (node
= var
->var_part
[pos
].loc_chain
; node
;
6818 if ((REG_P (node
->loc
) && REG_P (loc
)
6819 && REGNO (node
->loc
) == REGNO (loc
))
6820 || rtx_equal_p (node
->loc
, loc
))
6822 slot
= unshare_variable (set
, slot
, var
,
6823 VAR_INIT_STATUS_UNKNOWN
);
6824 var
= (variable
)*slot
;
6830 /* Delete the location part. */
6832 nextp
= &var
->var_part
[pos
].loc_chain
;
6833 for (node
= *nextp
; node
; node
= next
)
6836 if ((REG_P (node
->loc
) && REG_P (loc
)
6837 && REGNO (node
->loc
) == REGNO (loc
))
6838 || rtx_equal_p (node
->loc
, loc
))
6840 if (emit_notes
&& pos
== 0 && dv_onepart_p (var
->dv
))
6841 remove_value_chains (var
->dv
, node
->loc
);
6842 /* If we have deleted the location which was last emitted
6843 we have to emit new location so add the variable to set
6844 of changed variables. */
6845 if (var
->var_part
[pos
].cur_loc
== node
->loc
)
6848 var
->var_part
[pos
].cur_loc
= NULL
;
6849 var
->cur_loc_changed
= true;
6851 pool_free (loc_chain_pool
, node
);
6856 nextp
= &node
->next
;
6859 if (var
->var_part
[pos
].loc_chain
== NULL
)
6864 var
->cur_loc_changed
= true;
6865 while (pos
< var
->n_var_parts
)
6867 var
->var_part
[pos
] = var
->var_part
[pos
+ 1];
6872 variable_was_changed (var
, set
);
6878 /* Delete the part of variable's location from dataflow set SET. The
6879 variable part is specified by variable's declaration or value DV
6880 and offset OFFSET and the part's location by LOC. */
6883 delete_variable_part (dataflow_set
*set
, rtx loc
, decl_or_value dv
,
6884 HOST_WIDE_INT offset
)
6886 void **slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
6890 slot
= delete_slot_part (set
, loc
, slot
, offset
);
6893 /* Structure for passing some other parameters to function
6894 vt_expand_loc_callback. */
6895 struct expand_loc_callback_data
6897 /* The variables and values active at this point. */
6900 /* True in vt_expand_loc_dummy calls, no rtl should be allocated.
6901 Non-NULL should be returned if vt_expand_loc would return
6902 non-NULL in that case, NULL otherwise. cur_loc_changed should be
6903 computed and cur_loc recomputed when possible (but just once
6904 per emit_notes_for_changes call). */
6907 /* True if expansion of subexpressions had to recompute some
6908 VALUE/DEBUG_EXPR_DECL's cur_loc or used a VALUE/DEBUG_EXPR_DECL
6909 whose cur_loc has been already recomputed during current
6910 emit_notes_for_changes call. */
6911 bool cur_loc_changed
;
6914 /* Callback for cselib_expand_value, that looks for expressions
6915 holding the value in the var-tracking hash tables. Return X for
6916 standard processing, anything else is to be used as-is. */
6919 vt_expand_loc_callback (rtx x
, bitmap regs
, int max_depth
, void *data
)
6921 struct expand_loc_callback_data
*elcd
6922 = (struct expand_loc_callback_data
*) data
;
6923 bool dummy
= elcd
->dummy
;
6924 bool cur_loc_changed
= elcd
->cur_loc_changed
;
6928 rtx result
, subreg
, xret
;
6930 switch (GET_CODE (x
))
6935 if (cselib_dummy_expand_value_rtx_cb (SUBREG_REG (x
), regs
,
6937 vt_expand_loc_callback
, data
))
6943 subreg
= cselib_expand_value_rtx_cb (SUBREG_REG (x
), regs
,
6945 vt_expand_loc_callback
, data
);
6950 result
= simplify_gen_subreg (GET_MODE (x
), subreg
,
6951 GET_MODE (SUBREG_REG (x
)),
6954 /* Invalid SUBREGs are ok in debug info. ??? We could try
6955 alternate expansions for the VALUE as well. */
6957 result
= gen_rtx_raw_SUBREG (GET_MODE (x
), subreg
, SUBREG_BYTE (x
));
6962 dv
= dv_from_decl (DEBUG_EXPR_TREE_DECL (x
));
6967 dv
= dv_from_value (x
);
6975 if (VALUE_RECURSED_INTO (x
))
6978 var
= (variable
) htab_find_with_hash (elcd
->vars
, dv
, dv_htab_hash (dv
));
6982 if (dummy
&& dv_changed_p (dv
))
6983 elcd
->cur_loc_changed
= true;
6987 if (var
->n_var_parts
== 0)
6990 elcd
->cur_loc_changed
= true;
6994 gcc_assert (var
->n_var_parts
== 1);
6996 VALUE_RECURSED_INTO (x
) = true;
6999 if (var
->var_part
[0].cur_loc
)
7003 if (cselib_dummy_expand_value_rtx_cb (var
->var_part
[0].cur_loc
, regs
,
7005 vt_expand_loc_callback
, data
))
7009 result
= cselib_expand_value_rtx_cb (var
->var_part
[0].cur_loc
, regs
,
7011 vt_expand_loc_callback
, data
);
7013 set_dv_changed (dv
, false);
7015 if (!result
&& dv_changed_p (dv
))
7017 set_dv_changed (dv
, false);
7018 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
7019 if (loc
->loc
== var
->var_part
[0].cur_loc
)
7023 elcd
->cur_loc_changed
= cur_loc_changed
;
7024 if (cselib_dummy_expand_value_rtx_cb (loc
->loc
, regs
, max_depth
,
7025 vt_expand_loc_callback
,
7034 result
= cselib_expand_value_rtx_cb (loc
->loc
, regs
, max_depth
,
7035 vt_expand_loc_callback
, data
);
7039 if (dummy
&& (result
|| var
->var_part
[0].cur_loc
))
7040 var
->cur_loc_changed
= true;
7041 var
->var_part
[0].cur_loc
= loc
? loc
->loc
: NULL_RTX
;
7045 if (var
->cur_loc_changed
)
7046 elcd
->cur_loc_changed
= true;
7047 else if (!result
&& var
->var_part
[0].cur_loc
== NULL_RTX
)
7048 elcd
->cur_loc_changed
= cur_loc_changed
;
7051 VALUE_RECURSED_INTO (x
) = false;
7058 /* Expand VALUEs in LOC, using VARS as well as cselib's equivalence
7062 vt_expand_loc (rtx loc
, htab_t vars
)
7064 struct expand_loc_callback_data data
;
7066 if (!MAY_HAVE_DEBUG_INSNS
)
7071 data
.cur_loc_changed
= false;
7072 loc
= cselib_expand_value_rtx_cb (loc
, scratch_regs
, 8,
7073 vt_expand_loc_callback
, &data
);
7075 if (loc
&& MEM_P (loc
))
7076 loc
= targetm
.delegitimize_address (loc
);
7080 /* Like vt_expand_loc, but only return true/false (whether vt_expand_loc
7081 would succeed or not, without actually allocating new rtxes. */
7084 vt_expand_loc_dummy (rtx loc
, htab_t vars
, bool *pcur_loc_changed
)
7086 struct expand_loc_callback_data data
;
7089 gcc_assert (MAY_HAVE_DEBUG_INSNS
);
7092 data
.cur_loc_changed
= false;
7093 ret
= cselib_dummy_expand_value_rtx_cb (loc
, scratch_regs
, 8,
7094 vt_expand_loc_callback
, &data
);
7095 *pcur_loc_changed
= data
.cur_loc_changed
;
7099 /* Emit the NOTE_INSN_VAR_LOCATION for variable *VARP. DATA contains
7100 additional parameters: WHERE specifies whether the note shall be emitted
7101 before or after instruction INSN. */
7104 emit_note_insn_var_location (void **varp
, void *data
)
7106 variable var
= (variable
) *varp
;
7107 rtx insn
= ((emit_note_data
*)data
)->insn
;
7108 enum emit_note_where where
= ((emit_note_data
*)data
)->where
;
7109 htab_t vars
= ((emit_note_data
*)data
)->vars
;
7111 int i
, j
, n_var_parts
;
7113 enum var_init_status initialized
= VAR_INIT_STATUS_UNINITIALIZED
;
7114 HOST_WIDE_INT last_limit
;
7115 tree type_size_unit
;
7116 HOST_WIDE_INT offsets
[MAX_VAR_PARTS
];
7117 rtx loc
[MAX_VAR_PARTS
];
7121 if (dv_is_value_p (var
->dv
))
7122 goto value_or_debug_decl
;
7124 decl
= dv_as_decl (var
->dv
);
7126 if (TREE_CODE (decl
) == DEBUG_EXPR_DECL
)
7127 goto value_or_debug_decl
;
7132 if (!MAY_HAVE_DEBUG_INSNS
)
7134 for (i
= 0; i
< var
->n_var_parts
; i
++)
7135 if (var
->var_part
[i
].cur_loc
== NULL
&& var
->var_part
[i
].loc_chain
)
7137 var
->var_part
[i
].cur_loc
= var
->var_part
[i
].loc_chain
->loc
;
7138 var
->cur_loc_changed
= true;
7140 if (var
->n_var_parts
== 0)
7141 var
->cur_loc_changed
= true;
7143 if (!var
->cur_loc_changed
)
7145 for (i
= 0; i
< var
->n_var_parts
; i
++)
7147 enum machine_mode mode
, wider_mode
;
7150 if (last_limit
< var
->var_part
[i
].offset
)
7155 else if (last_limit
> var
->var_part
[i
].offset
)
7157 offsets
[n_var_parts
] = var
->var_part
[i
].offset
;
7158 if (!var
->var_part
[i
].cur_loc
)
7163 loc2
= vt_expand_loc (var
->var_part
[i
].cur_loc
, vars
);
7169 loc
[n_var_parts
] = loc2
;
7170 mode
= GET_MODE (var
->var_part
[i
].cur_loc
);
7171 if (mode
== VOIDmode
&& dv_onepart_p (var
->dv
))
7172 mode
= DECL_MODE (decl
);
7173 for (lc
= var
->var_part
[i
].loc_chain
; lc
; lc
= lc
->next
)
7174 if (var
->var_part
[i
].cur_loc
== lc
->loc
)
7176 initialized
= lc
->init
;
7180 last_limit
= offsets
[n_var_parts
] + GET_MODE_SIZE (mode
);
7182 /* Attempt to merge adjacent registers or memory. */
7183 wider_mode
= GET_MODE_WIDER_MODE (mode
);
7184 for (j
= i
+ 1; j
< var
->n_var_parts
; j
++)
7185 if (last_limit
<= var
->var_part
[j
].offset
)
7187 if (j
< var
->n_var_parts
7188 && wider_mode
!= VOIDmode
7189 && var
->var_part
[j
].cur_loc
7190 && mode
== GET_MODE (var
->var_part
[j
].cur_loc
)
7191 && (REG_P (loc
[n_var_parts
]) || MEM_P (loc
[n_var_parts
]))
7192 && last_limit
== var
->var_part
[j
].offset
7193 && (loc2
= vt_expand_loc (var
->var_part
[j
].cur_loc
, vars
))
7194 && GET_CODE (loc
[n_var_parts
]) == GET_CODE (loc2
))
7198 if (REG_P (loc
[n_var_parts
])
7199 && hard_regno_nregs
[REGNO (loc
[n_var_parts
])][mode
] * 2
7200 == hard_regno_nregs
[REGNO (loc
[n_var_parts
])][wider_mode
]
7201 && end_hard_regno (mode
, REGNO (loc
[n_var_parts
]))
7204 if (! WORDS_BIG_ENDIAN
&& ! BYTES_BIG_ENDIAN
)
7205 new_loc
= simplify_subreg (wider_mode
, loc
[n_var_parts
],
7207 else if (WORDS_BIG_ENDIAN
&& BYTES_BIG_ENDIAN
)
7208 new_loc
= simplify_subreg (wider_mode
, loc2
, mode
, 0);
7211 if (!REG_P (new_loc
)
7212 || REGNO (new_loc
) != REGNO (loc
[n_var_parts
]))
7215 REG_ATTRS (new_loc
) = REG_ATTRS (loc
[n_var_parts
]);
7218 else if (MEM_P (loc
[n_var_parts
])
7219 && GET_CODE (XEXP (loc2
, 0)) == PLUS
7220 && REG_P (XEXP (XEXP (loc2
, 0), 0))
7221 && CONST_INT_P (XEXP (XEXP (loc2
, 0), 1)))
7223 if ((REG_P (XEXP (loc
[n_var_parts
], 0))
7224 && rtx_equal_p (XEXP (loc
[n_var_parts
], 0),
7225 XEXP (XEXP (loc2
, 0), 0))
7226 && INTVAL (XEXP (XEXP (loc2
, 0), 1))
7227 == GET_MODE_SIZE (mode
))
7228 || (GET_CODE (XEXP (loc
[n_var_parts
], 0)) == PLUS
7229 && CONST_INT_P (XEXP (XEXP (loc
[n_var_parts
], 0), 1))
7230 && rtx_equal_p (XEXP (XEXP (loc
[n_var_parts
], 0), 0),
7231 XEXP (XEXP (loc2
, 0), 0))
7232 && INTVAL (XEXP (XEXP (loc
[n_var_parts
], 0), 1))
7233 + GET_MODE_SIZE (mode
)
7234 == INTVAL (XEXP (XEXP (loc2
, 0), 1))))
7235 new_loc
= adjust_address_nv (loc
[n_var_parts
],
7241 loc
[n_var_parts
] = new_loc
;
7243 last_limit
= offsets
[n_var_parts
] + GET_MODE_SIZE (mode
);
7249 type_size_unit
= TYPE_SIZE_UNIT (TREE_TYPE (decl
));
7250 if ((unsigned HOST_WIDE_INT
) last_limit
< TREE_INT_CST_LOW (type_size_unit
))
7253 if (! flag_var_tracking_uninit
)
7254 initialized
= VAR_INIT_STATUS_INITIALIZED
;
7258 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
, NULL_RTX
,
7260 else if (n_var_parts
== 1)
7264 if (offsets
[0] || GET_CODE (loc
[0]) == PARALLEL
)
7265 expr_list
= gen_rtx_EXPR_LIST (VOIDmode
, loc
[0], GEN_INT (offsets
[0]));
7269 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
, expr_list
,
7272 else if (n_var_parts
)
7276 for (i
= 0; i
< n_var_parts
; i
++)
7278 = gen_rtx_EXPR_LIST (VOIDmode
, loc
[i
], GEN_INT (offsets
[i
]));
7280 parallel
= gen_rtx_PARALLEL (VOIDmode
,
7281 gen_rtvec_v (n_var_parts
, loc
));
7282 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
,
7283 parallel
, (int) initialized
);
7286 if (where
!= EMIT_NOTE_BEFORE_INSN
)
7288 note
= emit_note_after (NOTE_INSN_VAR_LOCATION
, insn
);
7289 if (where
== EMIT_NOTE_AFTER_CALL_INSN
)
7290 NOTE_DURING_CALL_P (note
) = true;
7294 /* Make sure that the call related notes come first. */
7295 while (NEXT_INSN (insn
)
7297 && NOTE_DURING_CALL_P (insn
))
7298 insn
= NEXT_INSN (insn
);
7299 if (NOTE_P (insn
) && NOTE_DURING_CALL_P (insn
))
7300 note
= emit_note_after (NOTE_INSN_VAR_LOCATION
, insn
);
7302 note
= emit_note_before (NOTE_INSN_VAR_LOCATION
, insn
);
7304 NOTE_VAR_LOCATION (note
) = note_vl
;
7307 set_dv_changed (var
->dv
, false);
7308 var
->cur_loc_changed
= false;
7309 gcc_assert (var
->in_changed_variables
);
7310 var
->in_changed_variables
= false;
7311 htab_clear_slot (changed_variables
, varp
);
7313 /* Continue traversing the hash table. */
7316 value_or_debug_decl
:
7317 if (dv_changed_p (var
->dv
) && var
->n_var_parts
)
7320 bool cur_loc_changed
;
7322 if (var
->var_part
[0].cur_loc
7323 && vt_expand_loc_dummy (var
->var_part
[0].cur_loc
, vars
,
7326 for (lc
= var
->var_part
[0].loc_chain
; lc
; lc
= lc
->next
)
7327 if (lc
->loc
!= var
->var_part
[0].cur_loc
7328 && vt_expand_loc_dummy (lc
->loc
, vars
, &cur_loc_changed
))
7330 var
->var_part
[0].cur_loc
= lc
? lc
->loc
: NULL_RTX
;
7335 DEF_VEC_P (variable
);
7336 DEF_VEC_ALLOC_P (variable
, heap
);
7338 /* Stack of variable_def pointers that need processing with
7339 check_changed_vars_2. */
7341 static VEC (variable
, heap
) *changed_variables_stack
;
7343 /* VALUEs with no variables that need set_dv_changed (val, false)
7344 called before check_changed_vars_3. */
7346 static VEC (rtx
, heap
) *changed_values_stack
;
7348 /* Helper function for check_changed_vars_1 and check_changed_vars_2. */
7351 check_changed_vars_0 (decl_or_value dv
, htab_t htab
)
7354 = (value_chain
) htab_find_with_hash (value_chains
, dv
, dv_htab_hash (dv
));
7358 for (vc
= vc
->next
; vc
; vc
= vc
->next
)
7359 if (!dv_changed_p (vc
->dv
))
7362 = (variable
) htab_find_with_hash (htab
, vc
->dv
,
7363 dv_htab_hash (vc
->dv
));
7366 set_dv_changed (vc
->dv
, true);
7367 VEC_safe_push (variable
, heap
, changed_variables_stack
, vcvar
);
7369 else if (dv_is_value_p (vc
->dv
))
7371 set_dv_changed (vc
->dv
, true);
7372 VEC_safe_push (rtx
, heap
, changed_values_stack
,
7373 dv_as_value (vc
->dv
));
7374 check_changed_vars_0 (vc
->dv
, htab
);
7379 /* Populate changed_variables_stack with variable_def pointers
7380 that need variable_was_changed called on them. */
7383 check_changed_vars_1 (void **slot
, void *data
)
7385 variable var
= (variable
) *slot
;
7386 htab_t htab
= (htab_t
) data
;
7388 if (dv_is_value_p (var
->dv
)
7389 || TREE_CODE (dv_as_decl (var
->dv
)) == DEBUG_EXPR_DECL
)
7390 check_changed_vars_0 (var
->dv
, htab
);
7394 /* Add VAR to changed_variables and also for VALUEs add recursively
7395 all DVs that aren't in changed_variables yet but reference the
7396 VALUE from its loc_chain. */
7399 check_changed_vars_2 (variable var
, htab_t htab
)
7401 variable_was_changed (var
, NULL
);
7402 if (dv_is_value_p (var
->dv
)
7403 || TREE_CODE (dv_as_decl (var
->dv
)) == DEBUG_EXPR_DECL
)
7404 check_changed_vars_0 (var
->dv
, htab
);
7407 /* For each changed decl (except DEBUG_EXPR_DECLs) recompute
7408 cur_loc if needed (and cur_loc of all VALUEs and DEBUG_EXPR_DECLs
7409 it needs and are also in changed variables) and track whether
7410 cur_loc (or anything it uses to compute location) had to change
7411 during the current emit_notes_for_changes call. */
7414 check_changed_vars_3 (void **slot
, void *data
)
7416 variable var
= (variable
) *slot
;
7417 htab_t vars
= (htab_t
) data
;
7420 bool cur_loc_changed
;
7422 if (dv_is_value_p (var
->dv
)
7423 || TREE_CODE (dv_as_decl (var
->dv
)) == DEBUG_EXPR_DECL
)
7426 for (i
= 0; i
< var
->n_var_parts
; i
++)
7428 if (var
->var_part
[i
].cur_loc
7429 && vt_expand_loc_dummy (var
->var_part
[i
].cur_loc
, vars
,
7432 if (cur_loc_changed
)
7433 var
->cur_loc_changed
= true;
7436 for (lc
= var
->var_part
[i
].loc_chain
; lc
; lc
= lc
->next
)
7437 if (lc
->loc
!= var
->var_part
[i
].cur_loc
7438 && vt_expand_loc_dummy (lc
->loc
, vars
, &cur_loc_changed
))
7440 if (lc
|| var
->var_part
[i
].cur_loc
)
7441 var
->cur_loc_changed
= true;
7442 var
->var_part
[i
].cur_loc
= lc
? lc
->loc
: NULL_RTX
;
7444 if (var
->n_var_parts
== 0)
7445 var
->cur_loc_changed
= true;
7449 /* Emit NOTE_INSN_VAR_LOCATION note for each variable from a chain
7450 CHANGED_VARIABLES and delete this chain. WHERE specifies whether the notes
7451 shall be emitted before of after instruction INSN. */
7454 emit_notes_for_changes (rtx insn
, enum emit_note_where where
,
7457 emit_note_data data
;
7458 htab_t htab
= shared_hash_htab (vars
);
7460 if (!htab_elements (changed_variables
))
7463 if (MAY_HAVE_DEBUG_INSNS
)
7465 /* Unfortunately this has to be done in two steps, because
7466 we can't traverse a hashtab into which we are inserting
7467 through variable_was_changed. */
7468 htab_traverse (changed_variables
, check_changed_vars_1
, htab
);
7469 while (VEC_length (variable
, changed_variables_stack
) > 0)
7470 check_changed_vars_2 (VEC_pop (variable
, changed_variables_stack
),
7472 while (VEC_length (rtx
, changed_values_stack
) > 0)
7473 set_dv_changed (dv_from_value (VEC_pop (rtx
, changed_values_stack
)),
7475 htab_traverse (changed_variables
, check_changed_vars_3
, htab
);
7482 htab_traverse (changed_variables
, emit_note_insn_var_location
, &data
);
7485 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it differs from the
7486 same variable in hash table DATA or is not there at all. */
7489 emit_notes_for_differences_1 (void **slot
, void *data
)
7491 htab_t new_vars
= (htab_t
) data
;
7492 variable old_var
, new_var
;
7494 old_var
= (variable
) *slot
;
7495 new_var
= (variable
) htab_find_with_hash (new_vars
, old_var
->dv
,
7496 dv_htab_hash (old_var
->dv
));
7500 /* Variable has disappeared. */
7503 empty_var
= (variable
) pool_alloc (dv_pool (old_var
->dv
));
7504 empty_var
->dv
= old_var
->dv
;
7505 empty_var
->refcount
= 0;
7506 empty_var
->n_var_parts
= 0;
7507 empty_var
->cur_loc_changed
= false;
7508 empty_var
->in_changed_variables
= false;
7509 if (dv_onepart_p (old_var
->dv
))
7513 gcc_assert (old_var
->n_var_parts
== 1);
7514 for (lc
= old_var
->var_part
[0].loc_chain
; lc
; lc
= lc
->next
)
7515 remove_value_chains (old_var
->dv
, lc
->loc
);
7517 variable_was_changed (empty_var
, NULL
);
7518 /* Continue traversing the hash table. */
7521 if (variable_different_p (old_var
, new_var
))
7523 if (dv_onepart_p (old_var
->dv
))
7525 location_chain lc1
, lc2
;
7527 gcc_assert (old_var
->n_var_parts
== 1
7528 && new_var
->n_var_parts
== 1);
7529 lc1
= old_var
->var_part
[0].loc_chain
;
7530 lc2
= new_var
->var_part
[0].loc_chain
;
7533 && ((REG_P (lc1
->loc
) && REG_P (lc2
->loc
))
7534 || rtx_equal_p (lc1
->loc
, lc2
->loc
)))
7539 for (; lc2
; lc2
= lc2
->next
)
7540 add_value_chains (old_var
->dv
, lc2
->loc
);
7541 for (; lc1
; lc1
= lc1
->next
)
7542 remove_value_chains (old_var
->dv
, lc1
->loc
);
7544 variable_was_changed (new_var
, NULL
);
7546 /* Update cur_loc. */
7547 if (old_var
!= new_var
)
7550 for (i
= 0; i
< new_var
->n_var_parts
; i
++)
7552 new_var
->var_part
[i
].cur_loc
= NULL
;
7553 if (old_var
->n_var_parts
!= new_var
->n_var_parts
7554 || old_var
->var_part
[i
].offset
!= new_var
->var_part
[i
].offset
)
7555 new_var
->cur_loc_changed
= true;
7556 else if (old_var
->var_part
[i
].cur_loc
!= NULL
)
7559 rtx cur_loc
= old_var
->var_part
[i
].cur_loc
;
7561 for (lc
= new_var
->var_part
[i
].loc_chain
; lc
; lc
= lc
->next
)
7562 if (lc
->loc
== cur_loc
7563 || rtx_equal_p (cur_loc
, lc
->loc
))
7565 new_var
->var_part
[i
].cur_loc
= lc
->loc
;
7569 new_var
->cur_loc_changed
= true;
7574 /* Continue traversing the hash table. */
7578 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it is not in hash
7582 emit_notes_for_differences_2 (void **slot
, void *data
)
7584 htab_t old_vars
= (htab_t
) data
;
7585 variable old_var
, new_var
;
7587 new_var
= (variable
) *slot
;
7588 old_var
= (variable
) htab_find_with_hash (old_vars
, new_var
->dv
,
7589 dv_htab_hash (new_var
->dv
));
7593 /* Variable has appeared. */
7594 if (dv_onepart_p (new_var
->dv
))
7598 gcc_assert (new_var
->n_var_parts
== 1);
7599 for (lc
= new_var
->var_part
[0].loc_chain
; lc
; lc
= lc
->next
)
7600 add_value_chains (new_var
->dv
, lc
->loc
);
7602 for (i
= 0; i
< new_var
->n_var_parts
; i
++)
7603 new_var
->var_part
[i
].cur_loc
= NULL
;
7604 variable_was_changed (new_var
, NULL
);
7607 /* Continue traversing the hash table. */
7611 /* Emit notes before INSN for differences between dataflow sets OLD_SET and
7615 emit_notes_for_differences (rtx insn
, dataflow_set
*old_set
,
7616 dataflow_set
*new_set
)
7618 htab_traverse (shared_hash_htab (old_set
->vars
),
7619 emit_notes_for_differences_1
,
7620 shared_hash_htab (new_set
->vars
));
7621 htab_traverse (shared_hash_htab (new_set
->vars
),
7622 emit_notes_for_differences_2
,
7623 shared_hash_htab (old_set
->vars
));
7624 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
, new_set
->vars
);
7627 /* Emit the notes for changes of location parts in the basic block BB. */
7630 emit_notes_in_bb (basic_block bb
, dataflow_set
*set
)
7633 micro_operation
*mo
;
7635 dataflow_set_clear (set
);
7636 dataflow_set_copy (set
, &VTI (bb
)->in
);
7638 FOR_EACH_VEC_ELT (micro_operation
, VTI (bb
)->mos
, i
, mo
)
7640 rtx insn
= mo
->insn
;
7645 dataflow_set_clear_at_call (set
);
7646 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_CALL_INSN
, set
->vars
);
7651 rtx loc
= mo
->u
.loc
;
7654 var_reg_set (set
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
7656 var_mem_set (set
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
7658 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
7664 rtx loc
= mo
->u
.loc
;
7668 if (GET_CODE (loc
) == CONCAT
)
7670 val
= XEXP (loc
, 0);
7671 vloc
= XEXP (loc
, 1);
7679 var
= PAT_VAR_LOCATION_DECL (vloc
);
7681 clobber_variable_part (set
, NULL_RTX
,
7682 dv_from_decl (var
), 0, NULL_RTX
);
7685 if (VAL_NEEDS_RESOLUTION (loc
))
7686 val_resolve (set
, val
, PAT_VAR_LOCATION_LOC (vloc
), insn
);
7687 set_variable_part (set
, val
, dv_from_decl (var
), 0,
7688 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
7691 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc
)))
7692 set_variable_part (set
, PAT_VAR_LOCATION_LOC (vloc
),
7693 dv_from_decl (var
), 0,
7694 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
7697 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
7703 rtx loc
= mo
->u
.loc
;
7704 rtx val
, vloc
, uloc
;
7706 vloc
= uloc
= XEXP (loc
, 1);
7707 val
= XEXP (loc
, 0);
7709 if (GET_CODE (val
) == CONCAT
)
7711 uloc
= XEXP (val
, 1);
7712 val
= XEXP (val
, 0);
7715 if (VAL_NEEDS_RESOLUTION (loc
))
7716 val_resolve (set
, val
, vloc
, insn
);
7718 val_store (set
, val
, uloc
, insn
, false);
7720 if (VAL_HOLDS_TRACK_EXPR (loc
))
7722 if (GET_CODE (uloc
) == REG
)
7723 var_reg_set (set
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
7725 else if (GET_CODE (uloc
) == MEM
)
7726 var_mem_set (set
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
7730 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
, set
->vars
);
7736 rtx loc
= mo
->u
.loc
;
7737 rtx val
, vloc
, uloc
, reverse
= NULL_RTX
;
7740 if (VAL_EXPR_HAS_REVERSE (loc
))
7742 reverse
= XEXP (loc
, 1);
7743 vloc
= XEXP (loc
, 0);
7745 uloc
= XEXP (vloc
, 1);
7746 val
= XEXP (vloc
, 0);
7749 if (GET_CODE (val
) == CONCAT
)
7751 vloc
= XEXP (val
, 1);
7752 val
= XEXP (val
, 0);
7755 if (GET_CODE (vloc
) == SET
)
7757 rtx vsrc
= SET_SRC (vloc
);
7759 gcc_assert (val
!= vsrc
);
7760 gcc_assert (vloc
== uloc
|| VAL_NEEDS_RESOLUTION (loc
));
7762 vloc
= SET_DEST (vloc
);
7764 if (VAL_NEEDS_RESOLUTION (loc
))
7765 val_resolve (set
, val
, vsrc
, insn
);
7767 else if (VAL_NEEDS_RESOLUTION (loc
))
7769 gcc_assert (GET_CODE (uloc
) == SET
7770 && GET_CODE (SET_SRC (uloc
)) == REG
);
7771 val_resolve (set
, val
, SET_SRC (uloc
), insn
);
7774 if (VAL_HOLDS_TRACK_EXPR (loc
))
7776 if (VAL_EXPR_IS_CLOBBERED (loc
))
7779 var_reg_delete (set
, uloc
, true);
7780 else if (MEM_P (uloc
))
7781 var_mem_delete (set
, uloc
, true);
7785 bool copied_p
= VAL_EXPR_IS_COPIED (loc
);
7787 enum var_init_status status
= VAR_INIT_STATUS_INITIALIZED
;
7789 if (GET_CODE (uloc
) == SET
)
7791 set_src
= SET_SRC (uloc
);
7792 uloc
= SET_DEST (uloc
);
7797 status
= find_src_status (set
, set_src
);
7799 set_src
= find_src_set_src (set
, set_src
);
7803 var_reg_delete_and_set (set
, uloc
, !copied_p
,
7805 else if (MEM_P (uloc
))
7806 var_mem_delete_and_set (set
, uloc
, !copied_p
,
7810 else if (REG_P (uloc
))
7811 var_regno_delete (set
, REGNO (uloc
));
7813 val_store (set
, val
, vloc
, insn
, true);
7816 val_store (set
, XEXP (reverse
, 0), XEXP (reverse
, 1),
7819 emit_notes_for_changes (NEXT_INSN (insn
), EMIT_NOTE_BEFORE_INSN
,
7826 rtx loc
= mo
->u
.loc
;
7829 if (GET_CODE (loc
) == SET
)
7831 set_src
= SET_SRC (loc
);
7832 loc
= SET_DEST (loc
);
7836 var_reg_delete_and_set (set
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
7839 var_mem_delete_and_set (set
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
7842 emit_notes_for_changes (NEXT_INSN (insn
), EMIT_NOTE_BEFORE_INSN
,
7849 rtx loc
= mo
->u
.loc
;
7850 enum var_init_status src_status
;
7853 if (GET_CODE (loc
) == SET
)
7855 set_src
= SET_SRC (loc
);
7856 loc
= SET_DEST (loc
);
7859 src_status
= find_src_status (set
, set_src
);
7860 set_src
= find_src_set_src (set
, set_src
);
7863 var_reg_delete_and_set (set
, loc
, false, src_status
, set_src
);
7865 var_mem_delete_and_set (set
, loc
, false, src_status
, set_src
);
7867 emit_notes_for_changes (NEXT_INSN (insn
), EMIT_NOTE_BEFORE_INSN
,
7874 rtx loc
= mo
->u
.loc
;
7877 var_reg_delete (set
, loc
, false);
7879 var_mem_delete (set
, loc
, false);
7881 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
7887 rtx loc
= mo
->u
.loc
;
7890 var_reg_delete (set
, loc
, true);
7892 var_mem_delete (set
, loc
, true);
7894 emit_notes_for_changes (NEXT_INSN (insn
), EMIT_NOTE_BEFORE_INSN
,
7900 set
->stack_adjust
+= mo
->u
.adjust
;
7906 /* Emit notes for the whole function. */
7909 vt_emit_notes (void)
7914 gcc_assert (!htab_elements (changed_variables
));
7916 /* Free memory occupied by the out hash tables, as they aren't used
7919 dataflow_set_clear (&VTI (bb
)->out
);
7921 /* Enable emitting notes by functions (mainly by set_variable_part and
7922 delete_variable_part). */
7925 if (MAY_HAVE_DEBUG_INSNS
)
7930 FOR_EACH_VEC_ELT (rtx
, preserved_values
, i
, val
)
7931 add_cselib_value_chains (dv_from_value (val
));
7932 changed_variables_stack
= VEC_alloc (variable
, heap
, 40);
7933 changed_values_stack
= VEC_alloc (rtx
, heap
, 40);
7936 dataflow_set_init (&cur
);
7940 /* Emit the notes for changes of variable locations between two
7941 subsequent basic blocks. */
7942 emit_notes_for_differences (BB_HEAD (bb
), &cur
, &VTI (bb
)->in
);
7944 /* Emit the notes for the changes in the basic block itself. */
7945 emit_notes_in_bb (bb
, &cur
);
7947 /* Free memory occupied by the in hash table, we won't need it
7949 dataflow_set_clear (&VTI (bb
)->in
);
7951 #ifdef ENABLE_CHECKING
7952 htab_traverse (shared_hash_htab (cur
.vars
),
7953 emit_notes_for_differences_1
,
7954 shared_hash_htab (empty_shared_hash
));
7955 if (MAY_HAVE_DEBUG_INSNS
)
7960 FOR_EACH_VEC_ELT (rtx
, preserved_values
, i
, val
)
7961 remove_cselib_value_chains (dv_from_value (val
));
7962 gcc_assert (htab_elements (value_chains
) == 0);
7965 dataflow_set_destroy (&cur
);
7967 if (MAY_HAVE_DEBUG_INSNS
)
7969 VEC_free (variable
, heap
, changed_variables_stack
);
7970 VEC_free (rtx
, heap
, changed_values_stack
);
7976 /* If there is a declaration and offset associated with register/memory RTL
7977 assign declaration to *DECLP and offset to *OFFSETP, and return true. */
7980 vt_get_decl_and_offset (rtx rtl
, tree
*declp
, HOST_WIDE_INT
*offsetp
)
7984 if (REG_ATTRS (rtl
))
7986 *declp
= REG_EXPR (rtl
);
7987 *offsetp
= REG_OFFSET (rtl
);
7991 else if (MEM_P (rtl
))
7993 if (MEM_ATTRS (rtl
))
7995 *declp
= MEM_EXPR (rtl
);
7996 *offsetp
= INT_MEM_OFFSET (rtl
);
8003 /* Insert function parameter PARM in IN and OUT sets of ENTRY_BLOCK. */
8006 vt_add_function_parameter (tree parm
)
8008 rtx decl_rtl
= DECL_RTL_IF_SET (parm
);
8009 rtx incoming
= DECL_INCOMING_RTL (parm
);
8011 enum machine_mode mode
;
8012 HOST_WIDE_INT offset
;
8016 if (TREE_CODE (parm
) != PARM_DECL
)
8019 if (!decl_rtl
|| !incoming
)
8022 if (GET_MODE (decl_rtl
) == BLKmode
|| GET_MODE (incoming
) == BLKmode
)
8025 if (!vt_get_decl_and_offset (incoming
, &decl
, &offset
))
8027 if (REG_P (incoming
) || MEM_P (incoming
))
8029 /* This means argument is passed by invisible reference. */
8032 incoming
= gen_rtx_MEM (GET_MODE (decl_rtl
), incoming
);
8036 if (!vt_get_decl_and_offset (decl_rtl
, &decl
, &offset
))
8038 offset
+= byte_lowpart_offset (GET_MODE (incoming
),
8039 GET_MODE (decl_rtl
));
8048 /* Assume that DECL_RTL was a pseudo that got spilled to
8049 memory. The spill slot sharing code will force the
8050 memory to reference spill_slot_decl (%sfp), so we don't
8051 match above. That's ok, the pseudo must have referenced
8052 the entire parameter, so just reset OFFSET. */
8053 gcc_assert (decl
== get_spill_slot_decl (false));
8057 if (!track_loc_p (incoming
, parm
, offset
, false, &mode
, &offset
))
8060 out
= &VTI (ENTRY_BLOCK_PTR
)->out
;
8062 dv
= dv_from_decl (parm
);
8064 if (target_for_debug_bind (parm
)
8065 /* We can't deal with these right now, because this kind of
8066 variable is single-part. ??? We could handle parallels
8067 that describe multiple locations for the same single
8068 value, but ATM we don't. */
8069 && GET_CODE (incoming
) != PARALLEL
)
8073 /* ??? We shouldn't ever hit this, but it may happen because
8074 arguments passed by invisible reference aren't dealt with
8075 above: incoming-rtl will have Pmode rather than the
8076 expected mode for the type. */
8080 val
= cselib_lookup (var_lowpart (mode
, incoming
), mode
, true);
8082 /* ??? Float-typed values in memory are not handled by
8086 preserve_value (val
);
8087 set_variable_part (out
, val
->val_rtx
, dv
, offset
,
8088 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
8089 dv
= dv_from_value (val
->val_rtx
);
8093 if (REG_P (incoming
))
8095 incoming
= var_lowpart (mode
, incoming
);
8096 gcc_assert (REGNO (incoming
) < FIRST_PSEUDO_REGISTER
);
8097 attrs_list_insert (&out
->regs
[REGNO (incoming
)], dv
, offset
,
8099 set_variable_part (out
, incoming
, dv
, offset
,
8100 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
8102 else if (MEM_P (incoming
))
8104 incoming
= var_lowpart (mode
, incoming
);
8105 set_variable_part (out
, incoming
, dv
, offset
,
8106 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
8110 /* Insert function parameters to IN and OUT sets of ENTRY_BLOCK. */
8113 vt_add_function_parameters (void)
8117 for (parm
= DECL_ARGUMENTS (current_function_decl
);
8118 parm
; parm
= DECL_CHAIN (parm
))
8119 vt_add_function_parameter (parm
);
8121 if (DECL_HAS_VALUE_EXPR_P (DECL_RESULT (current_function_decl
)))
8123 tree vexpr
= DECL_VALUE_EXPR (DECL_RESULT (current_function_decl
));
8125 if (TREE_CODE (vexpr
) == INDIRECT_REF
)
8126 vexpr
= TREE_OPERAND (vexpr
, 0);
8128 if (TREE_CODE (vexpr
) == PARM_DECL
8129 && DECL_ARTIFICIAL (vexpr
)
8130 && !DECL_IGNORED_P (vexpr
)
8131 && DECL_NAMELESS (vexpr
))
8132 vt_add_function_parameter (vexpr
);
8135 if (MAY_HAVE_DEBUG_INSNS
)
8137 cselib_preserve_only_values ();
8138 cselib_reset_table (cselib_get_next_uid ());
8143 /* Return true if INSN in the prologue initializes hard_frame_pointer_rtx. */
8146 fp_setter (rtx insn
)
8148 rtx pat
= PATTERN (insn
);
8149 if (RTX_FRAME_RELATED_P (insn
))
8151 rtx expr
= find_reg_note (insn
, REG_FRAME_RELATED_EXPR
, NULL_RTX
);
8153 pat
= XEXP (expr
, 0);
8155 if (GET_CODE (pat
) == SET
)
8156 return SET_DEST (pat
) == hard_frame_pointer_rtx
;
8157 else if (GET_CODE (pat
) == PARALLEL
)
8160 for (i
= XVECLEN (pat
, 0) - 1; i
>= 0; i
--)
8161 if (GET_CODE (XVECEXP (pat
, 0, i
)) == SET
8162 && SET_DEST (XVECEXP (pat
, 0, i
)) == hard_frame_pointer_rtx
)
8168 /* Initialize cfa_base_rtx, create a preserved VALUE for it and
8169 ensure it isn't flushed during cselib_reset_table.
8170 Can be called only if frame_pointer_rtx resp. arg_pointer_rtx
8171 has been eliminated. */
8174 vt_init_cfa_base (void)
8178 #ifdef FRAME_POINTER_CFA_OFFSET
8179 cfa_base_rtx
= frame_pointer_rtx
;
8180 cfa_base_offset
= -FRAME_POINTER_CFA_OFFSET (current_function_decl
);
8182 cfa_base_rtx
= arg_pointer_rtx
;
8183 cfa_base_offset
= -ARG_POINTER_CFA_OFFSET (current_function_decl
);
8185 if (cfa_base_rtx
== hard_frame_pointer_rtx
8186 || !fixed_regs
[REGNO (cfa_base_rtx
)])
8188 cfa_base_rtx
= NULL_RTX
;
8191 if (!MAY_HAVE_DEBUG_INSNS
)
8194 /* Tell alias analysis that cfa_base_rtx should share
8195 find_base_term value with stack pointer or hard frame pointer. */
8196 vt_equate_reg_base_value (cfa_base_rtx
,
8197 frame_pointer_needed
8198 ? hard_frame_pointer_rtx
: stack_pointer_rtx
);
8199 val
= cselib_lookup_from_insn (cfa_base_rtx
, GET_MODE (cfa_base_rtx
), 1,
8201 preserve_value (val
);
8202 cselib_preserve_cfa_base_value (val
, REGNO (cfa_base_rtx
));
8203 var_reg_decl_set (&VTI (ENTRY_BLOCK_PTR
)->out
, cfa_base_rtx
,
8204 VAR_INIT_STATUS_INITIALIZED
, dv_from_value (val
->val_rtx
),
8205 0, NULL_RTX
, INSERT
);
8208 /* Allocate and initialize the data structures for variable tracking
8209 and parse the RTL to get the micro operations. */
8212 vt_initialize (void)
8214 basic_block bb
, prologue_bb
= NULL
;
8215 HOST_WIDE_INT fp_cfa_offset
= -1;
8217 alloc_aux_for_blocks (sizeof (struct variable_tracking_info_def
));
8219 attrs_pool
= create_alloc_pool ("attrs_def pool",
8220 sizeof (struct attrs_def
), 1024);
8221 var_pool
= create_alloc_pool ("variable_def pool",
8222 sizeof (struct variable_def
)
8223 + (MAX_VAR_PARTS
- 1)
8224 * sizeof (((variable
)NULL
)->var_part
[0]), 64);
8225 loc_chain_pool
= create_alloc_pool ("location_chain_def pool",
8226 sizeof (struct location_chain_def
),
8228 shared_hash_pool
= create_alloc_pool ("shared_hash_def pool",
8229 sizeof (struct shared_hash_def
), 256);
8230 empty_shared_hash
= (shared_hash
) pool_alloc (shared_hash_pool
);
8231 empty_shared_hash
->refcount
= 1;
8232 empty_shared_hash
->htab
8233 = htab_create (1, variable_htab_hash
, variable_htab_eq
,
8234 variable_htab_free
);
8235 changed_variables
= htab_create (10, variable_htab_hash
, variable_htab_eq
,
8236 variable_htab_free
);
8237 if (MAY_HAVE_DEBUG_INSNS
)
8239 value_chain_pool
= create_alloc_pool ("value_chain_def pool",
8240 sizeof (struct value_chain_def
),
8242 value_chains
= htab_create (32, value_chain_htab_hash
,
8243 value_chain_htab_eq
, NULL
);
8246 /* Init the IN and OUT sets. */
8249 VTI (bb
)->visited
= false;
8250 VTI (bb
)->flooded
= false;
8251 dataflow_set_init (&VTI (bb
)->in
);
8252 dataflow_set_init (&VTI (bb
)->out
);
8253 VTI (bb
)->permp
= NULL
;
8256 if (MAY_HAVE_DEBUG_INSNS
)
8258 cselib_init (CSELIB_RECORD_MEMORY
| CSELIB_PRESERVE_CONSTANTS
);
8259 scratch_regs
= BITMAP_ALLOC (NULL
);
8260 valvar_pool
= create_alloc_pool ("small variable_def pool",
8261 sizeof (struct variable_def
), 256);
8262 preserved_values
= VEC_alloc (rtx
, heap
, 256);
8266 scratch_regs
= NULL
;
8270 if (!frame_pointer_needed
)
8274 if (!vt_stack_adjustments ())
8277 #ifdef FRAME_POINTER_CFA_OFFSET
8278 reg
= frame_pointer_rtx
;
8280 reg
= arg_pointer_rtx
;
8282 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
8285 if (GET_CODE (elim
) == PLUS
)
8286 elim
= XEXP (elim
, 0);
8287 if (elim
== stack_pointer_rtx
)
8288 vt_init_cfa_base ();
8291 else if (!crtl
->stack_realign_tried
)
8295 #ifdef FRAME_POINTER_CFA_OFFSET
8296 reg
= frame_pointer_rtx
;
8297 fp_cfa_offset
= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
8299 reg
= arg_pointer_rtx
;
8300 fp_cfa_offset
= ARG_POINTER_CFA_OFFSET (current_function_decl
);
8302 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
8305 if (GET_CODE (elim
) == PLUS
)
8307 fp_cfa_offset
-= INTVAL (XEXP (elim
, 1));
8308 elim
= XEXP (elim
, 0);
8310 if (elim
!= hard_frame_pointer_rtx
)
8313 prologue_bb
= single_succ (ENTRY_BLOCK_PTR
);
8317 hard_frame_pointer_adjustment
= -1;
8322 HOST_WIDE_INT pre
, post
= 0;
8323 basic_block first_bb
, last_bb
;
8325 if (MAY_HAVE_DEBUG_INSNS
)
8327 cselib_record_sets_hook
= add_with_sets
;
8328 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
8329 fprintf (dump_file
, "first value: %i\n",
8330 cselib_get_next_uid ());
8337 if (bb
->next_bb
== EXIT_BLOCK_PTR
8338 || ! single_pred_p (bb
->next_bb
))
8340 e
= find_edge (bb
, bb
->next_bb
);
8341 if (! e
|| (e
->flags
& EDGE_FALLTHRU
) == 0)
8347 /* Add the micro-operations to the vector. */
8348 FOR_BB_BETWEEN (bb
, first_bb
, last_bb
->next_bb
, next_bb
)
8350 HOST_WIDE_INT offset
= VTI (bb
)->out
.stack_adjust
;
8351 VTI (bb
)->out
.stack_adjust
= VTI (bb
)->in
.stack_adjust
;
8352 for (insn
= BB_HEAD (bb
); insn
!= NEXT_INSN (BB_END (bb
));
8353 insn
= NEXT_INSN (insn
))
8357 if (!frame_pointer_needed
)
8359 insn_stack_adjust_offset_pre_post (insn
, &pre
, &post
);
8363 mo
.type
= MO_ADJUST
;
8366 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
8367 log_op_type (PATTERN (insn
), bb
, insn
,
8368 MO_ADJUST
, dump_file
);
8369 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
,
8371 VTI (bb
)->out
.stack_adjust
+= pre
;
8375 cselib_hook_called
= false;
8376 adjust_insn (bb
, insn
);
8377 if (MAY_HAVE_DEBUG_INSNS
)
8379 cselib_process_insn (insn
);
8380 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
8382 print_rtl_single (dump_file
, insn
);
8383 dump_cselib_table (dump_file
);
8386 if (!cselib_hook_called
)
8387 add_with_sets (insn
, 0, 0);
8390 if (!frame_pointer_needed
&& post
)
8393 mo
.type
= MO_ADJUST
;
8396 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
8397 log_op_type (PATTERN (insn
), bb
, insn
,
8398 MO_ADJUST
, dump_file
);
8399 VEC_safe_push (micro_operation
, heap
, VTI (bb
)->mos
,
8401 VTI (bb
)->out
.stack_adjust
+= post
;
8404 if (bb
== prologue_bb
8405 && hard_frame_pointer_adjustment
== -1
8406 && RTX_FRAME_RELATED_P (insn
)
8407 && fp_setter (insn
))
8409 vt_init_cfa_base ();
8410 hard_frame_pointer_adjustment
= fp_cfa_offset
;
8414 gcc_assert (offset
== VTI (bb
)->out
.stack_adjust
);
8419 if (MAY_HAVE_DEBUG_INSNS
)
8421 cselib_preserve_only_values ();
8422 cselib_reset_table (cselib_get_next_uid ());
8423 cselib_record_sets_hook
= NULL
;
8427 hard_frame_pointer_adjustment
= -1;
8428 VTI (ENTRY_BLOCK_PTR
)->flooded
= true;
8429 vt_add_function_parameters ();
8430 cfa_base_rtx
= NULL_RTX
;
8434 /* Get rid of all debug insns from the insn stream. */
8437 delete_debug_insns (void)
8442 if (!MAY_HAVE_DEBUG_INSNS
)
8447 FOR_BB_INSNS_SAFE (bb
, insn
, next
)
8448 if (DEBUG_INSN_P (insn
))
8453 /* Run a fast, BB-local only version of var tracking, to take care of
8454 information that we don't do global analysis on, such that not all
8455 information is lost. If SKIPPED holds, we're skipping the global
8456 pass entirely, so we should try to use information it would have
8457 handled as well.. */
8460 vt_debug_insns_local (bool skipped ATTRIBUTE_UNUSED
)
8462 /* ??? Just skip it all for now. */
8463 delete_debug_insns ();
8466 /* Free the data structures needed for variable tracking. */
8475 VEC_free (micro_operation
, heap
, VTI (bb
)->mos
);
8480 dataflow_set_destroy (&VTI (bb
)->in
);
8481 dataflow_set_destroy (&VTI (bb
)->out
);
8482 if (VTI (bb
)->permp
)
8484 dataflow_set_destroy (VTI (bb
)->permp
);
8485 XDELETE (VTI (bb
)->permp
);
8488 free_aux_for_blocks ();
8489 htab_delete (empty_shared_hash
->htab
);
8490 htab_delete (changed_variables
);
8491 free_alloc_pool (attrs_pool
);
8492 free_alloc_pool (var_pool
);
8493 free_alloc_pool (loc_chain_pool
);
8494 free_alloc_pool (shared_hash_pool
);
8496 if (MAY_HAVE_DEBUG_INSNS
)
8498 htab_delete (value_chains
);
8499 free_alloc_pool (value_chain_pool
);
8500 free_alloc_pool (valvar_pool
);
8501 VEC_free (rtx
, heap
, preserved_values
);
8503 BITMAP_FREE (scratch_regs
);
8504 scratch_regs
= NULL
;
8508 XDELETEVEC (vui_vec
);
8513 /* The entry point to variable tracking pass. */
8515 static inline unsigned int
8516 variable_tracking_main_1 (void)
8520 if (flag_var_tracking_assignments
< 0)
8522 delete_debug_insns ();
8526 if (n_basic_blocks
> 500 && n_edges
/ n_basic_blocks
>= 20)
8528 vt_debug_insns_local (true);
8532 mark_dfs_back_edges ();
8533 if (!vt_initialize ())
8536 vt_debug_insns_local (true);
8540 success
= vt_find_locations ();
8542 if (!success
&& flag_var_tracking_assignments
> 0)
8546 delete_debug_insns ();
8548 /* This is later restored by our caller. */
8549 flag_var_tracking_assignments
= 0;
8551 success
= vt_initialize ();
8552 gcc_assert (success
);
8554 success
= vt_find_locations ();
8560 vt_debug_insns_local (false);
8564 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
8566 dump_dataflow_sets ();
8567 dump_flow_info (dump_file
, dump_flags
);
8570 timevar_push (TV_VAR_TRACKING_EMIT
);
8572 timevar_pop (TV_VAR_TRACKING_EMIT
);
8575 vt_debug_insns_local (false);
8580 variable_tracking_main (void)
8583 int save
= flag_var_tracking_assignments
;
8585 ret
= variable_tracking_main_1 ();
8587 flag_var_tracking_assignments
= save
;
8593 gate_handle_var_tracking (void)
8595 return (flag_var_tracking
);
8600 struct rtl_opt_pass pass_variable_tracking
=
8604 "vartrack", /* name */
8605 gate_handle_var_tracking
, /* gate */
8606 variable_tracking_main
, /* execute */
8609 0, /* static_pass_number */
8610 TV_VAR_TRACKING
, /* tv_id */
8611 0, /* properties_required */
8612 0, /* properties_provided */
8613 0, /* properties_destroyed */
8614 0, /* todo_flags_start */
8615 TODO_dump_func
| TODO_verify_rtl_sharing
/* todo_flags_finish */