1 /* Variable tracking routines for the GNU compiler.
2 Copyright (C) 2002-2015 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it
7 under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3, or (at your option)
11 GCC is distributed in the hope that it will be useful, but WITHOUT
12 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
13 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
14 License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This file contains the variable tracking pass. It computes where
21 variables are located (which registers or where in memory) at each position
22 in instruction stream and emits notes describing the locations.
23 Debug information (DWARF2 location lists) is finally generated from
25 With this debug information, it is possible to show variables
26 even when debugging optimized code.
28 How does the variable tracking pass work?
30 First, it scans RTL code for uses, stores and clobbers (register/memory
31 references in instructions), for call insns and for stack adjustments
32 separately for each basic block and saves them to an array of micro
34 The micro operations of one instruction are ordered so that
35 pre-modifying stack adjustment < use < use with no var < call insn <
36 < clobber < set < post-modifying stack adjustment
38 Then, a forward dataflow analysis is performed to find out how locations
39 of variables change through code and to propagate the variable locations
40 along control flow graph.
41 The IN set for basic block BB is computed as a union of OUT sets of BB's
42 predecessors, the OUT set for BB is copied from the IN set for BB and
43 is changed according to micro operations in BB.
45 The IN and OUT sets for basic blocks consist of a current stack adjustment
46 (used for adjusting offset of variables addressed using stack pointer),
47 the table of structures describing the locations of parts of a variable
48 and for each physical register a linked list for each physical register.
49 The linked list is a list of variable parts stored in the register,
50 i.e. it is a list of triplets (reg, decl, offset) where decl is
51 REG_EXPR (reg) and offset is REG_OFFSET (reg). The linked list is used for
52 effective deleting appropriate variable parts when we set or clobber the
55 There may be more than one variable part in a register. The linked lists
56 should be pretty short so it is a good data structure here.
57 For example in the following code, register allocator may assign same
58 register to variables A and B, and both of them are stored in the same
71 Finally, the NOTE_INSN_VAR_LOCATION notes describing the variable locations
72 are emitted to appropriate positions in RTL code. Each such a note describes
73 the location of one variable at the point in instruction stream where the
74 note is. There is no need to emit a note for each variable before each
75 instruction, we only emit these notes where the location of variable changes
76 (this means that we also emit notes for changes between the OUT set of the
77 previous block and the IN set of the current block).
79 The notes consist of two parts:
80 1. the declaration (from REG_EXPR or MEM_EXPR)
81 2. the location of a variable - it is either a simple register/memory
82 reference (for simple variables, for example int),
83 or a parallel of register/memory references (for a large variables
84 which consist of several parts, for example long long).
90 #include "coretypes.h"
96 #include "alloc-pool.h"
97 #include "tree-pass.h"
99 #include "insn-config.h"
101 #include "emit-rtl.h"
103 #include "diagnostic.h"
105 #include "stor-layout.h"
110 #include "tree-dfa.h"
111 #include "tree-ssa.h"
114 #include "tree-pretty-print.h"
115 #include "rtl-iter.h"
116 #include "fibonacci_heap.h"
118 typedef fibonacci_heap
<long, basic_block_def
> bb_heap_t
;
119 typedef fibonacci_node
<long, basic_block_def
> bb_heap_node_t
;
121 /* var-tracking.c assumes that tree code with the same value as VALUE rtx code
122 has no chance to appear in REG_EXPR/MEM_EXPRs and isn't a decl.
123 Currently the value is the same as IDENTIFIER_NODE, which has such
124 a property. If this compile time assertion ever fails, make sure that
125 the new tree code that equals (int) VALUE has the same property. */
126 extern char check_value_val
[(int) VALUE
== (int) IDENTIFIER_NODE
? 1 : -1];
128 /* Type of micro operation. */
129 enum micro_operation_type
131 MO_USE
, /* Use location (REG or MEM). */
132 MO_USE_NO_VAR
,/* Use location which is not associated with a variable
133 or the variable is not trackable. */
134 MO_VAL_USE
, /* Use location which is associated with a value. */
135 MO_VAL_LOC
, /* Use location which appears in a debug insn. */
136 MO_VAL_SET
, /* Set location associated with a value. */
137 MO_SET
, /* Set location. */
138 MO_COPY
, /* Copy the same portion of a variable from one
139 location to another. */
140 MO_CLOBBER
, /* Clobber location. */
141 MO_CALL
, /* Call insn. */
142 MO_ADJUST
/* Adjust stack pointer. */
146 static const char * const ATTRIBUTE_UNUSED
147 micro_operation_type_name
[] = {
160 /* Where shall the note be emitted? BEFORE or AFTER the instruction.
161 Notes emitted as AFTER_CALL are to take effect during the call,
162 rather than after the call. */
165 EMIT_NOTE_BEFORE_INSN
,
166 EMIT_NOTE_AFTER_INSN
,
167 EMIT_NOTE_AFTER_CALL_INSN
170 /* Structure holding information about micro operation. */
171 struct micro_operation
173 /* Type of micro operation. */
174 enum micro_operation_type type
;
176 /* The instruction which the micro operation is in, for MO_USE,
177 MO_USE_NO_VAR, MO_CALL and MO_ADJUST, or the subsequent
178 instruction or note in the original flow (before any var-tracking
179 notes are inserted, to simplify emission of notes), for MO_SET
184 /* Location. For MO_SET and MO_COPY, this is the SET that
185 performs the assignment, if known, otherwise it is the target
186 of the assignment. For MO_VAL_USE and MO_VAL_SET, it is a
187 CONCAT of the VALUE and the LOC associated with it. For
188 MO_VAL_LOC, it is a CONCAT of the VALUE and the VAR_LOCATION
189 associated with it. */
192 /* Stack adjustment. */
193 HOST_WIDE_INT adjust
;
198 /* A declaration of a variable, or an RTL value being handled like a
200 typedef void *decl_or_value
;
202 /* Return true if a decl_or_value DV is a DECL or NULL. */
204 dv_is_decl_p (decl_or_value dv
)
206 return !dv
|| (int) TREE_CODE ((tree
) dv
) != (int) VALUE
;
209 /* Return true if a decl_or_value is a VALUE rtl. */
211 dv_is_value_p (decl_or_value dv
)
213 return dv
&& !dv_is_decl_p (dv
);
216 /* Return the decl in the decl_or_value. */
218 dv_as_decl (decl_or_value dv
)
220 gcc_checking_assert (dv_is_decl_p (dv
));
224 /* Return the value in the decl_or_value. */
226 dv_as_value (decl_or_value dv
)
228 gcc_checking_assert (dv_is_value_p (dv
));
232 /* Return the opaque pointer in the decl_or_value. */
234 dv_as_opaque (decl_or_value dv
)
240 /* Description of location of a part of a variable. The content of a physical
241 register is described by a chain of these structures.
242 The chains are pretty short (usually 1 or 2 elements) and thus
243 chain is the best data structure. */
246 /* Pointer to next member of the list. */
249 /* The rtx of register. */
252 /* The declaration corresponding to LOC. */
255 /* Offset from start of DECL. */
256 HOST_WIDE_INT offset
;
259 /* Structure for chaining the locations. */
260 struct location_chain
262 /* Next element in the chain. */
263 location_chain
*next
;
265 /* The location (REG, MEM or VALUE). */
268 /* The "value" stored in this location. */
272 enum var_init_status init
;
275 /* A vector of loc_exp_dep holds the active dependencies of a one-part
276 DV on VALUEs, i.e., the VALUEs expanded so as to form the current
277 location of DV. Each entry is also part of VALUE' s linked-list of
278 backlinks back to DV. */
281 /* The dependent DV. */
283 /* The dependency VALUE or DECL_DEBUG. */
285 /* The next entry in VALUE's backlinks list. */
286 struct loc_exp_dep
*next
;
287 /* A pointer to the pointer to this entry (head or prev's next) in
288 the doubly-linked list. */
289 struct loc_exp_dep
**pprev
;
293 /* This data structure holds information about the depth of a variable
297 /* This measures the complexity of the expanded expression. It
298 grows by one for each level of expansion that adds more than one
301 /* This counts the number of ENTRY_VALUE expressions in an
302 expansion. We want to minimize their use. */
306 /* This data structure is allocated for one-part variables at the time
307 of emitting notes. */
310 /* Doubly-linked list of dependent DVs. These are DVs whose cur_loc
311 computation used the expansion of this variable, and that ought
312 to be notified should this variable change. If the DV's cur_loc
313 expanded to NULL, all components of the loc list are regarded as
314 active, so that any changes in them give us a chance to get a
315 location. Otherwise, only components of the loc that expanded to
316 non-NULL are regarded as active dependencies. */
317 loc_exp_dep
*backlinks
;
318 /* This holds the LOC that was expanded into cur_loc. We need only
319 mark a one-part variable as changed if the FROM loc is removed,
320 or if it has no known location and a loc is added, or if it gets
321 a change notification from any of its active dependencies. */
323 /* The depth of the cur_loc expression. */
325 /* Dependencies actively used when expand FROM into cur_loc. */
326 vec
<loc_exp_dep
, va_heap
, vl_embed
> deps
;
329 /* Structure describing one part of variable. */
332 /* Chain of locations of the part. */
333 location_chain
*loc_chain
;
335 /* Location which was last emitted to location list. */
340 /* The offset in the variable, if !var->onepart. */
341 HOST_WIDE_INT offset
;
343 /* Pointer to auxiliary data, if var->onepart and emit_notes. */
344 struct onepart_aux
*onepaux
;
348 /* Maximum number of location parts. */
349 #define MAX_VAR_PARTS 16
351 /* Enumeration type used to discriminate various types of one-part
355 /* Not a one-part variable. */
357 /* A one-part DECL that is not a DEBUG_EXPR_DECL. */
359 /* A DEBUG_EXPR_DECL. */
365 /* Structure describing where the variable is located. */
368 /* The declaration of the variable, or an RTL value being handled
369 like a declaration. */
372 /* Reference count. */
375 /* Number of variable parts. */
378 /* What type of DV this is, according to enum onepart_enum. */
379 ENUM_BITFIELD (onepart_enum
) onepart
: CHAR_BIT
;
381 /* True if this variable_def struct is currently in the
382 changed_variables hash table. */
383 bool in_changed_variables
;
385 /* The variable parts. */
386 variable_part var_part
[1];
389 /* Pointer to the BB's information specific to variable tracking pass. */
390 #define VTI(BB) ((variable_tracking_info *) (BB)->aux)
392 /* Macro to access MEM_OFFSET as an HOST_WIDE_INT. Evaluates MEM twice. */
393 #define INT_MEM_OFFSET(mem) (MEM_OFFSET_KNOWN_P (mem) ? MEM_OFFSET (mem) : 0)
395 #if CHECKING_P && (GCC_VERSION >= 2007)
397 /* Access VAR's Ith part's offset, checking that it's not a one-part
399 #define VAR_PART_OFFSET(var, i) __extension__ \
400 (*({ variable *const __v = (var); \
401 gcc_checking_assert (!__v->onepart); \
402 &__v->var_part[(i)].aux.offset; }))
404 /* Access VAR's one-part auxiliary data, checking that it is a
405 one-part variable. */
406 #define VAR_LOC_1PAUX(var) __extension__ \
407 (*({ variable *const __v = (var); \
408 gcc_checking_assert (__v->onepart); \
409 &__v->var_part[0].aux.onepaux; }))
412 #define VAR_PART_OFFSET(var, i) ((var)->var_part[(i)].aux.offset)
413 #define VAR_LOC_1PAUX(var) ((var)->var_part[0].aux.onepaux)
416 /* These are accessor macros for the one-part auxiliary data. When
417 convenient for users, they're guarded by tests that the data was
419 #define VAR_LOC_DEP_LST(var) (VAR_LOC_1PAUX (var) \
420 ? VAR_LOC_1PAUX (var)->backlinks \
422 #define VAR_LOC_DEP_LSTP(var) (VAR_LOC_1PAUX (var) \
423 ? &VAR_LOC_1PAUX (var)->backlinks \
425 #define VAR_LOC_FROM(var) (VAR_LOC_1PAUX (var)->from)
426 #define VAR_LOC_DEPTH(var) (VAR_LOC_1PAUX (var)->depth)
427 #define VAR_LOC_DEP_VEC(var) (VAR_LOC_1PAUX (var) \
428 ? &VAR_LOC_1PAUX (var)->deps \
433 typedef unsigned int dvuid
;
435 /* Return the uid of DV. */
438 dv_uid (decl_or_value dv
)
440 if (dv_is_value_p (dv
))
441 return CSELIB_VAL_PTR (dv_as_value (dv
))->uid
;
443 return DECL_UID (dv_as_decl (dv
));
446 /* Compute the hash from the uid. */
448 static inline hashval_t
449 dv_uid2hash (dvuid uid
)
454 /* The hash function for a mask table in a shared_htab chain. */
456 static inline hashval_t
457 dv_htab_hash (decl_or_value dv
)
459 return dv_uid2hash (dv_uid (dv
));
462 static void variable_htab_free (void *);
464 /* Variable hashtable helpers. */
466 struct variable_hasher
: pointer_hash
<variable
>
468 typedef void *compare_type
;
469 static inline hashval_t
hash (const variable
*);
470 static inline bool equal (const variable
*, const void *);
471 static inline void remove (variable
*);
474 /* The hash function for variable_htab, computes the hash value
475 from the declaration of variable X. */
478 variable_hasher::hash (const variable
*v
)
480 return dv_htab_hash (v
->dv
);
483 /* Compare the declaration of variable X with declaration Y. */
486 variable_hasher::equal (const variable
*v
, const void *y
)
488 decl_or_value dv
= CONST_CAST2 (decl_or_value
, const void *, y
);
490 return (dv_as_opaque (v
->dv
) == dv_as_opaque (dv
));
493 /* Free the element of VARIABLE_HTAB (its type is struct variable_def). */
496 variable_hasher::remove (variable
*var
)
498 variable_htab_free (var
);
501 typedef hash_table
<variable_hasher
> variable_table_type
;
502 typedef variable_table_type::iterator variable_iterator_type
;
504 /* Structure for passing some other parameters to function
505 emit_note_insn_var_location. */
506 struct emit_note_data
508 /* The instruction which the note will be emitted before/after. */
511 /* Where the note will be emitted (before/after insn)? */
512 enum emit_note_where where
;
514 /* The variables and values active at this point. */
515 variable_table_type
*vars
;
518 /* Structure holding a refcounted hash table. If refcount > 1,
519 it must be first unshared before modified. */
522 /* Reference count. */
525 /* Actual hash table. */
526 variable_table_type
*htab
;
529 /* Structure holding the IN or OUT set for a basic block. */
532 /* Adjustment of stack offset. */
533 HOST_WIDE_INT stack_adjust
;
535 /* Attributes for registers (lists of attrs). */
536 attrs
*regs
[FIRST_PSEUDO_REGISTER
];
538 /* Variable locations. */
541 /* Vars that is being traversed. */
542 shared_hash
*traversed_vars
;
545 /* The structure (one for each basic block) containing the information
546 needed for variable tracking. */
547 struct variable_tracking_info
549 /* The vector of micro operations. */
550 vec
<micro_operation
> mos
;
552 /* The IN and OUT set for dataflow analysis. */
556 /* The permanent-in dataflow set for this block. This is used to
557 hold values for which we had to compute entry values. ??? This
558 should probably be dynamically allocated, to avoid using more
559 memory in non-debug builds. */
562 /* Has the block been visited in DFS? */
565 /* Has the block been flooded in VTA? */
570 /* Alloc pool for struct attrs_def. */
571 object_allocator
<attrs
> attrs_pool ("attrs pool");
573 /* Alloc pool for struct variable_def with MAX_VAR_PARTS entries. */
575 static pool_allocator var_pool
576 ("variable_def pool", sizeof (variable
) +
577 (MAX_VAR_PARTS
- 1) * sizeof (((variable
*)NULL
)->var_part
[0]));
579 /* Alloc pool for struct variable_def with a single var_part entry. */
580 static pool_allocator valvar_pool
581 ("small variable_def pool", sizeof (variable
));
583 /* Alloc pool for struct location_chain. */
584 static object_allocator
<location_chain
> location_chain_pool
585 ("location_chain pool");
587 /* Alloc pool for struct shared_hash. */
588 static object_allocator
<shared_hash
> shared_hash_pool ("shared_hash pool");
590 /* Alloc pool for struct loc_exp_dep_s for NOT_ONEPART variables. */
591 object_allocator
<loc_exp_dep
> loc_exp_dep_pool ("loc_exp_dep pool");
593 /* Changed variables, notes will be emitted for them. */
594 static variable_table_type
*changed_variables
;
596 /* Shall notes be emitted? */
597 static bool emit_notes
;
599 /* Values whose dynamic location lists have gone empty, but whose
600 cselib location lists are still usable. Use this to hold the
601 current location, the backlinks, etc, during emit_notes. */
602 static variable_table_type
*dropped_values
;
604 /* Empty shared hashtable. */
605 static shared_hash
*empty_shared_hash
;
607 /* Scratch register bitmap used by cselib_expand_value_rtx. */
608 static bitmap scratch_regs
= NULL
;
610 #ifdef HAVE_window_save
611 struct GTY(()) parm_reg
{
617 /* Vector of windowed parameter registers, if any. */
618 static vec
<parm_reg
, va_gc
> *windowed_parm_regs
= NULL
;
621 /* Variable used to tell whether cselib_process_insn called our hook. */
622 static bool cselib_hook_called
;
624 /* Local function prototypes. */
625 static void stack_adjust_offset_pre_post (rtx
, HOST_WIDE_INT
*,
627 static void insn_stack_adjust_offset_pre_post (rtx_insn
*, HOST_WIDE_INT
*,
629 static bool vt_stack_adjustments (void);
631 static void init_attrs_list_set (attrs
**);
632 static void attrs_list_clear (attrs
**);
633 static attrs
*attrs_list_member (attrs
*, decl_or_value
, HOST_WIDE_INT
);
634 static void attrs_list_insert (attrs
**, decl_or_value
, HOST_WIDE_INT
, rtx
);
635 static void attrs_list_copy (attrs
**, attrs
*);
636 static void attrs_list_union (attrs
**, attrs
*);
638 static variable
**unshare_variable (dataflow_set
*set
, variable
**slot
,
639 variable
*var
, enum var_init_status
);
640 static void vars_copy (variable_table_type
*, variable_table_type
*);
641 static tree
var_debug_decl (tree
);
642 static void var_reg_set (dataflow_set
*, rtx
, enum var_init_status
, rtx
);
643 static void var_reg_delete_and_set (dataflow_set
*, rtx
, bool,
644 enum var_init_status
, rtx
);
645 static void var_reg_delete (dataflow_set
*, rtx
, bool);
646 static void var_regno_delete (dataflow_set
*, int);
647 static void var_mem_set (dataflow_set
*, rtx
, enum var_init_status
, rtx
);
648 static void var_mem_delete_and_set (dataflow_set
*, rtx
, bool,
649 enum var_init_status
, rtx
);
650 static void var_mem_delete (dataflow_set
*, rtx
, bool);
652 static void dataflow_set_init (dataflow_set
*);
653 static void dataflow_set_clear (dataflow_set
*);
654 static void dataflow_set_copy (dataflow_set
*, dataflow_set
*);
655 static int variable_union_info_cmp_pos (const void *, const void *);
656 static void dataflow_set_union (dataflow_set
*, dataflow_set
*);
657 static location_chain
*find_loc_in_1pdv (rtx
, variable
*,
658 variable_table_type
*);
659 static bool canon_value_cmp (rtx
, rtx
);
660 static int loc_cmp (rtx
, rtx
);
661 static bool variable_part_different_p (variable_part
*, variable_part
*);
662 static bool onepart_variable_different_p (variable
*, variable
*);
663 static bool variable_different_p (variable
*, variable
*);
664 static bool dataflow_set_different (dataflow_set
*, dataflow_set
*);
665 static void dataflow_set_destroy (dataflow_set
*);
667 static bool track_expr_p (tree
, bool);
668 static bool same_variable_part_p (rtx
, tree
, HOST_WIDE_INT
);
669 static void add_uses_1 (rtx
*, void *);
670 static void add_stores (rtx
, const_rtx
, void *);
671 static bool compute_bb_dataflow (basic_block
);
672 static bool vt_find_locations (void);
674 static void dump_attrs_list (attrs
*);
675 static void dump_var (variable
*);
676 static void dump_vars (variable_table_type
*);
677 static void dump_dataflow_set (dataflow_set
*);
678 static void dump_dataflow_sets (void);
680 static void set_dv_changed (decl_or_value
, bool);
681 static void variable_was_changed (variable
*, dataflow_set
*);
682 static variable
**set_slot_part (dataflow_set
*, rtx
, variable
**,
683 decl_or_value
, HOST_WIDE_INT
,
684 enum var_init_status
, rtx
);
685 static void set_variable_part (dataflow_set
*, rtx
,
686 decl_or_value
, HOST_WIDE_INT
,
687 enum var_init_status
, rtx
, enum insert_option
);
688 static variable
**clobber_slot_part (dataflow_set
*, rtx
,
689 variable
**, HOST_WIDE_INT
, rtx
);
690 static void clobber_variable_part (dataflow_set
*, rtx
,
691 decl_or_value
, HOST_WIDE_INT
, rtx
);
692 static variable
**delete_slot_part (dataflow_set
*, rtx
, variable
**,
694 static void delete_variable_part (dataflow_set
*, rtx
,
695 decl_or_value
, HOST_WIDE_INT
);
696 static void emit_notes_in_bb (basic_block
, dataflow_set
*);
697 static void vt_emit_notes (void);
699 static bool vt_get_decl_and_offset (rtx
, tree
*, HOST_WIDE_INT
*);
700 static void vt_add_function_parameters (void);
701 static bool vt_initialize (void);
702 static void vt_finalize (void);
704 /* Callback for stack_adjust_offset_pre_post, called via for_each_inc_dec. */
707 stack_adjust_offset_pre_post_cb (rtx
, rtx op
, rtx dest
, rtx src
, rtx srcoff
,
710 if (dest
!= stack_pointer_rtx
)
713 switch (GET_CODE (op
))
717 ((HOST_WIDE_INT
*)arg
)[0] -= INTVAL (srcoff
);
721 ((HOST_WIDE_INT
*)arg
)[1] -= INTVAL (srcoff
);
725 /* We handle only adjustments by constant amount. */
726 gcc_assert (GET_CODE (src
) == PLUS
727 && CONST_INT_P (XEXP (src
, 1))
728 && XEXP (src
, 0) == stack_pointer_rtx
);
729 ((HOST_WIDE_INT
*)arg
)[GET_CODE (op
) == POST_MODIFY
]
730 -= INTVAL (XEXP (src
, 1));
737 /* Given a SET, calculate the amount of stack adjustment it contains
738 PRE- and POST-modifying stack pointer.
739 This function is similar to stack_adjust_offset. */
742 stack_adjust_offset_pre_post (rtx pattern
, HOST_WIDE_INT
*pre
,
745 rtx src
= SET_SRC (pattern
);
746 rtx dest
= SET_DEST (pattern
);
749 if (dest
== stack_pointer_rtx
)
751 /* (set (reg sp) (plus (reg sp) (const_int))) */
752 code
= GET_CODE (src
);
753 if (! (code
== PLUS
|| code
== MINUS
)
754 || XEXP (src
, 0) != stack_pointer_rtx
755 || !CONST_INT_P (XEXP (src
, 1)))
759 *post
+= INTVAL (XEXP (src
, 1));
761 *post
-= INTVAL (XEXP (src
, 1));
764 HOST_WIDE_INT res
[2] = { 0, 0 };
765 for_each_inc_dec (pattern
, stack_adjust_offset_pre_post_cb
, res
);
770 /* Given an INSN, calculate the amount of stack adjustment it contains
771 PRE- and POST-modifying stack pointer. */
774 insn_stack_adjust_offset_pre_post (rtx_insn
*insn
, HOST_WIDE_INT
*pre
,
782 pattern
= PATTERN (insn
);
783 if (RTX_FRAME_RELATED_P (insn
))
785 rtx expr
= find_reg_note (insn
, REG_FRAME_RELATED_EXPR
, NULL_RTX
);
787 pattern
= XEXP (expr
, 0);
790 if (GET_CODE (pattern
) == SET
)
791 stack_adjust_offset_pre_post (pattern
, pre
, post
);
792 else if (GET_CODE (pattern
) == PARALLEL
793 || GET_CODE (pattern
) == SEQUENCE
)
797 /* There may be stack adjustments inside compound insns. Search
799 for ( i
= XVECLEN (pattern
, 0) - 1; i
>= 0; i
--)
800 if (GET_CODE (XVECEXP (pattern
, 0, i
)) == SET
)
801 stack_adjust_offset_pre_post (XVECEXP (pattern
, 0, i
), pre
, post
);
805 /* Compute stack adjustments for all blocks by traversing DFS tree.
806 Return true when the adjustments on all incoming edges are consistent.
807 Heavily borrowed from pre_and_rev_post_order_compute. */
810 vt_stack_adjustments (void)
812 edge_iterator
*stack
;
815 /* Initialize entry block. */
816 VTI (ENTRY_BLOCK_PTR_FOR_FN (cfun
))->visited
= true;
817 VTI (ENTRY_BLOCK_PTR_FOR_FN (cfun
))->in
.stack_adjust
818 = INCOMING_FRAME_SP_OFFSET
;
819 VTI (ENTRY_BLOCK_PTR_FOR_FN (cfun
))->out
.stack_adjust
820 = INCOMING_FRAME_SP_OFFSET
;
822 /* Allocate stack for back-tracking up CFG. */
823 stack
= XNEWVEC (edge_iterator
, n_basic_blocks_for_fn (cfun
) + 1);
826 /* Push the first edge on to the stack. */
827 stack
[sp
++] = ei_start (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->succs
);
835 /* Look at the edge on the top of the stack. */
837 src
= ei_edge (ei
)->src
;
838 dest
= ei_edge (ei
)->dest
;
840 /* Check if the edge destination has been visited yet. */
841 if (!VTI (dest
)->visited
)
844 HOST_WIDE_INT pre
, post
, offset
;
845 VTI (dest
)->visited
= true;
846 VTI (dest
)->in
.stack_adjust
= offset
= VTI (src
)->out
.stack_adjust
;
848 if (dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
849 for (insn
= BB_HEAD (dest
);
850 insn
!= NEXT_INSN (BB_END (dest
));
851 insn
= NEXT_INSN (insn
))
854 insn_stack_adjust_offset_pre_post (insn
, &pre
, &post
);
855 offset
+= pre
+ post
;
858 VTI (dest
)->out
.stack_adjust
= offset
;
860 if (EDGE_COUNT (dest
->succs
) > 0)
861 /* Since the DEST node has been visited for the first
862 time, check its successors. */
863 stack
[sp
++] = ei_start (dest
->succs
);
867 /* We can end up with different stack adjustments for the exit block
868 of a shrink-wrapped function if stack_adjust_offset_pre_post
869 doesn't understand the rtx pattern used to restore the stack
870 pointer in the epilogue. For example, on s390(x), the stack
871 pointer is often restored via a load-multiple instruction
872 and so no stack_adjust offset is recorded for it. This means
873 that the stack offset at the end of the epilogue block is the
874 the same as the offset before the epilogue, whereas other paths
875 to the exit block will have the correct stack_adjust.
877 It is safe to ignore these differences because (a) we never
878 use the stack_adjust for the exit block in this pass and
879 (b) dwarf2cfi checks whether the CFA notes in a shrink-wrapped
880 function are correct.
882 We must check whether the adjustments on other edges are
884 if (dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
)
885 && VTI (dest
)->in
.stack_adjust
!= VTI (src
)->out
.stack_adjust
)
891 if (! ei_one_before_end_p (ei
))
892 /* Go to the next edge. */
893 ei_next (&stack
[sp
- 1]);
895 /* Return to previous level if there are no more edges. */
904 /* arg_pointer_rtx resp. frame_pointer_rtx if stack_pointer_rtx or
905 hard_frame_pointer_rtx is being mapped to it and offset for it. */
906 static rtx cfa_base_rtx
;
907 static HOST_WIDE_INT cfa_base_offset
;
909 /* Compute a CFA-based value for an ADJUSTMENT made to stack_pointer_rtx
910 or hard_frame_pointer_rtx. */
913 compute_cfa_pointer (HOST_WIDE_INT adjustment
)
915 return plus_constant (Pmode
, cfa_base_rtx
, adjustment
+ cfa_base_offset
);
918 /* Adjustment for hard_frame_pointer_rtx to cfa base reg,
919 or -1 if the replacement shouldn't be done. */
920 static HOST_WIDE_INT hard_frame_pointer_adjustment
= -1;
922 /* Data for adjust_mems callback. */
924 struct adjust_mem_data
927 machine_mode mem_mode
;
928 HOST_WIDE_INT stack_adjust
;
929 rtx_expr_list
*side_effects
;
932 /* Helper for adjust_mems. Return true if X is suitable for
933 transformation of wider mode arithmetics to narrower mode. */
936 use_narrower_mode_test (rtx x
, const_rtx subreg
)
938 subrtx_var_iterator::array_type array
;
939 FOR_EACH_SUBRTX_VAR (iter
, array
, x
, NONCONST
)
943 iter
.skip_subrtxes ();
945 switch (GET_CODE (x
))
948 if (cselib_lookup (x
, GET_MODE (SUBREG_REG (subreg
)), 0, VOIDmode
))
950 if (!validate_subreg (GET_MODE (subreg
), GET_MODE (x
), x
,
951 subreg_lowpart_offset (GET_MODE (subreg
),
960 iter
.substitute (XEXP (x
, 0));
969 /* Transform X into narrower mode MODE from wider mode WMODE. */
972 use_narrower_mode (rtx x
, machine_mode mode
, machine_mode wmode
)
976 return lowpart_subreg (mode
, x
, wmode
);
977 switch (GET_CODE (x
))
980 return lowpart_subreg (mode
, x
, wmode
);
984 op0
= use_narrower_mode (XEXP (x
, 0), mode
, wmode
);
985 op1
= use_narrower_mode (XEXP (x
, 1), mode
, wmode
);
986 return simplify_gen_binary (GET_CODE (x
), mode
, op0
, op1
);
988 op0
= use_narrower_mode (XEXP (x
, 0), mode
, wmode
);
990 /* Ensure shift amount is not wider than mode. */
991 if (GET_MODE (op1
) == VOIDmode
)
992 op1
= lowpart_subreg (mode
, op1
, wmode
);
993 else if (GET_MODE_PRECISION (mode
) < GET_MODE_PRECISION (GET_MODE (op1
)))
994 op1
= lowpart_subreg (mode
, op1
, GET_MODE (op1
));
995 return simplify_gen_binary (ASHIFT
, mode
, op0
, op1
);
1001 /* Helper function for adjusting used MEMs. */
1004 adjust_mems (rtx loc
, const_rtx old_rtx
, void *data
)
1006 struct adjust_mem_data
*amd
= (struct adjust_mem_data
*) data
;
1007 rtx mem
, addr
= loc
, tem
;
1008 machine_mode mem_mode_save
;
1010 switch (GET_CODE (loc
))
1013 /* Don't do any sp or fp replacements outside of MEM addresses
1015 if (amd
->mem_mode
== VOIDmode
&& amd
->store
)
1017 if (loc
== stack_pointer_rtx
1018 && !frame_pointer_needed
1020 return compute_cfa_pointer (amd
->stack_adjust
);
1021 else if (loc
== hard_frame_pointer_rtx
1022 && frame_pointer_needed
1023 && hard_frame_pointer_adjustment
!= -1
1025 return compute_cfa_pointer (hard_frame_pointer_adjustment
);
1026 gcc_checking_assert (loc
!= virtual_incoming_args_rtx
);
1032 mem
= targetm
.delegitimize_address (mem
);
1033 if (mem
!= loc
&& !MEM_P (mem
))
1034 return simplify_replace_fn_rtx (mem
, old_rtx
, adjust_mems
, data
);
1037 addr
= XEXP (mem
, 0);
1038 mem_mode_save
= amd
->mem_mode
;
1039 amd
->mem_mode
= GET_MODE (mem
);
1040 store_save
= amd
->store
;
1042 addr
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
1043 amd
->store
= store_save
;
1044 amd
->mem_mode
= mem_mode_save
;
1046 addr
= targetm
.delegitimize_address (addr
);
1047 if (addr
!= XEXP (mem
, 0))
1048 mem
= replace_equiv_address_nv (mem
, addr
);
1050 mem
= avoid_constant_pool_reference (mem
);
1054 addr
= gen_rtx_PLUS (GET_MODE (loc
), XEXP (loc
, 0),
1055 gen_int_mode (GET_CODE (loc
) == PRE_INC
1056 ? GET_MODE_SIZE (amd
->mem_mode
)
1057 : -GET_MODE_SIZE (amd
->mem_mode
),
1062 addr
= XEXP (loc
, 0);
1063 gcc_assert (amd
->mem_mode
!= VOIDmode
&& amd
->mem_mode
!= BLKmode
);
1064 addr
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
1065 tem
= gen_rtx_PLUS (GET_MODE (loc
), XEXP (loc
, 0),
1066 gen_int_mode ((GET_CODE (loc
) == PRE_INC
1067 || GET_CODE (loc
) == POST_INC
)
1068 ? GET_MODE_SIZE (amd
->mem_mode
)
1069 : -GET_MODE_SIZE (amd
->mem_mode
),
1071 store_save
= amd
->store
;
1073 tem
= simplify_replace_fn_rtx (tem
, old_rtx
, adjust_mems
, data
);
1074 amd
->store
= store_save
;
1075 amd
->side_effects
= alloc_EXPR_LIST (0,
1076 gen_rtx_SET (XEXP (loc
, 0), tem
),
1080 addr
= XEXP (loc
, 1);
1083 addr
= XEXP (loc
, 0);
1084 gcc_assert (amd
->mem_mode
!= VOIDmode
);
1085 addr
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
1086 store_save
= amd
->store
;
1088 tem
= simplify_replace_fn_rtx (XEXP (loc
, 1), old_rtx
,
1090 amd
->store
= store_save
;
1091 amd
->side_effects
= alloc_EXPR_LIST (0,
1092 gen_rtx_SET (XEXP (loc
, 0), tem
),
1096 /* First try without delegitimization of whole MEMs and
1097 avoid_constant_pool_reference, which is more likely to succeed. */
1098 store_save
= amd
->store
;
1100 addr
= simplify_replace_fn_rtx (SUBREG_REG (loc
), old_rtx
, adjust_mems
,
1102 amd
->store
= store_save
;
1103 mem
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
1104 if (mem
== SUBREG_REG (loc
))
1109 tem
= simplify_gen_subreg (GET_MODE (loc
), mem
,
1110 GET_MODE (SUBREG_REG (loc
)),
1114 tem
= simplify_gen_subreg (GET_MODE (loc
), addr
,
1115 GET_MODE (SUBREG_REG (loc
)),
1117 if (tem
== NULL_RTX
)
1118 tem
= gen_rtx_raw_SUBREG (GET_MODE (loc
), addr
, SUBREG_BYTE (loc
));
1120 if (MAY_HAVE_DEBUG_INSNS
1121 && GET_CODE (tem
) == SUBREG
1122 && (GET_CODE (SUBREG_REG (tem
)) == PLUS
1123 || GET_CODE (SUBREG_REG (tem
)) == MINUS
1124 || GET_CODE (SUBREG_REG (tem
)) == MULT
1125 || GET_CODE (SUBREG_REG (tem
)) == ASHIFT
)
1126 && (GET_MODE_CLASS (GET_MODE (tem
)) == MODE_INT
1127 || GET_MODE_CLASS (GET_MODE (tem
)) == MODE_PARTIAL_INT
)
1128 && (GET_MODE_CLASS (GET_MODE (SUBREG_REG (tem
))) == MODE_INT
1129 || GET_MODE_CLASS (GET_MODE (SUBREG_REG (tem
))) == MODE_PARTIAL_INT
)
1130 && GET_MODE_PRECISION (GET_MODE (tem
))
1131 < GET_MODE_PRECISION (GET_MODE (SUBREG_REG (tem
)))
1132 && subreg_lowpart_p (tem
)
1133 && use_narrower_mode_test (SUBREG_REG (tem
), tem
))
1134 return use_narrower_mode (SUBREG_REG (tem
), GET_MODE (tem
),
1135 GET_MODE (SUBREG_REG (tem
)));
1138 /* Don't do any replacements in second and following
1139 ASM_OPERANDS of inline-asm with multiple sets.
1140 ASM_OPERANDS_INPUT_VEC, ASM_OPERANDS_INPUT_CONSTRAINT_VEC
1141 and ASM_OPERANDS_LABEL_VEC need to be equal between
1142 all the ASM_OPERANDs in the insn and adjust_insn will
1144 if (ASM_OPERANDS_OUTPUT_IDX (loc
) != 0)
1153 /* Helper function for replacement of uses. */
1156 adjust_mem_uses (rtx
*x
, void *data
)
1158 rtx new_x
= simplify_replace_fn_rtx (*x
, NULL_RTX
, adjust_mems
, data
);
1160 validate_change (NULL_RTX
, x
, new_x
, true);
1163 /* Helper function for replacement of stores. */
1166 adjust_mem_stores (rtx loc
, const_rtx expr
, void *data
)
1170 rtx new_dest
= simplify_replace_fn_rtx (SET_DEST (expr
), NULL_RTX
,
1172 if (new_dest
!= SET_DEST (expr
))
1174 rtx xexpr
= CONST_CAST_RTX (expr
);
1175 validate_change (NULL_RTX
, &SET_DEST (xexpr
), new_dest
, true);
1180 /* Simplify INSN. Remove all {PRE,POST}_{INC,DEC,MODIFY} rtxes,
1181 replace them with their value in the insn and add the side-effects
1182 as other sets to the insn. */
1185 adjust_insn (basic_block bb
, rtx_insn
*insn
)
1187 struct adjust_mem_data amd
;
1190 #ifdef HAVE_window_save
1191 /* If the target machine has an explicit window save instruction, the
1192 transformation OUTGOING_REGNO -> INCOMING_REGNO is done there. */
1193 if (RTX_FRAME_RELATED_P (insn
)
1194 && find_reg_note (insn
, REG_CFA_WINDOW_SAVE
, NULL_RTX
))
1196 unsigned int i
, nregs
= vec_safe_length (windowed_parm_regs
);
1197 rtx rtl
= gen_rtx_PARALLEL (VOIDmode
, rtvec_alloc (nregs
* 2));
1200 FOR_EACH_VEC_SAFE_ELT (windowed_parm_regs
, i
, p
)
1202 XVECEXP (rtl
, 0, i
* 2)
1203 = gen_rtx_SET (p
->incoming
, p
->outgoing
);
1204 /* Do not clobber the attached DECL, but only the REG. */
1205 XVECEXP (rtl
, 0, i
* 2 + 1)
1206 = gen_rtx_CLOBBER (GET_MODE (p
->outgoing
),
1207 gen_raw_REG (GET_MODE (p
->outgoing
),
1208 REGNO (p
->outgoing
)));
1211 validate_change (NULL_RTX
, &PATTERN (insn
), rtl
, true);
1216 amd
.mem_mode
= VOIDmode
;
1217 amd
.stack_adjust
= -VTI (bb
)->out
.stack_adjust
;
1218 amd
.side_effects
= NULL
;
1221 note_stores (PATTERN (insn
), adjust_mem_stores
, &amd
);
1224 if (GET_CODE (PATTERN (insn
)) == PARALLEL
1225 && asm_noperands (PATTERN (insn
)) > 0
1226 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == SET
)
1231 /* inline-asm with multiple sets is tiny bit more complicated,
1232 because the 3 vectors in ASM_OPERANDS need to be shared between
1233 all ASM_OPERANDS in the instruction. adjust_mems will
1234 not touch ASM_OPERANDS other than the first one, asm_noperands
1235 test above needs to be called before that (otherwise it would fail)
1236 and afterwards this code fixes it up. */
1237 note_uses (&PATTERN (insn
), adjust_mem_uses
, &amd
);
1238 body
= PATTERN (insn
);
1239 set0
= XVECEXP (body
, 0, 0);
1240 gcc_checking_assert (GET_CODE (set0
) == SET
1241 && GET_CODE (SET_SRC (set0
)) == ASM_OPERANDS
1242 && ASM_OPERANDS_OUTPUT_IDX (SET_SRC (set0
)) == 0);
1243 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
1244 if (GET_CODE (XVECEXP (body
, 0, i
)) != SET
)
1248 set
= XVECEXP (body
, 0, i
);
1249 gcc_checking_assert (GET_CODE (SET_SRC (set
)) == ASM_OPERANDS
1250 && ASM_OPERANDS_OUTPUT_IDX (SET_SRC (set
))
1252 if (ASM_OPERANDS_INPUT_VEC (SET_SRC (set
))
1253 != ASM_OPERANDS_INPUT_VEC (SET_SRC (set0
))
1254 || ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set
))
1255 != ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set0
))
1256 || ASM_OPERANDS_LABEL_VEC (SET_SRC (set
))
1257 != ASM_OPERANDS_LABEL_VEC (SET_SRC (set0
)))
1259 rtx newsrc
= shallow_copy_rtx (SET_SRC (set
));
1260 ASM_OPERANDS_INPUT_VEC (newsrc
)
1261 = ASM_OPERANDS_INPUT_VEC (SET_SRC (set0
));
1262 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (newsrc
)
1263 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set0
));
1264 ASM_OPERANDS_LABEL_VEC (newsrc
)
1265 = ASM_OPERANDS_LABEL_VEC (SET_SRC (set0
));
1266 validate_change (NULL_RTX
, &SET_SRC (set
), newsrc
, true);
1271 note_uses (&PATTERN (insn
), adjust_mem_uses
, &amd
);
1273 /* For read-only MEMs containing some constant, prefer those
1275 set
= single_set (insn
);
1276 if (set
&& MEM_P (SET_SRC (set
)) && MEM_READONLY_P (SET_SRC (set
)))
1278 rtx note
= find_reg_equal_equiv_note (insn
);
1280 if (note
&& CONSTANT_P (XEXP (note
, 0)))
1281 validate_change (NULL_RTX
, &SET_SRC (set
), XEXP (note
, 0), true);
1284 if (amd
.side_effects
)
1286 rtx
*pat
, new_pat
, s
;
1289 pat
= &PATTERN (insn
);
1290 if (GET_CODE (*pat
) == COND_EXEC
)
1291 pat
= &COND_EXEC_CODE (*pat
);
1292 if (GET_CODE (*pat
) == PARALLEL
)
1293 oldn
= XVECLEN (*pat
, 0);
1296 for (s
= amd
.side_effects
, newn
= 0; s
; newn
++)
1298 new_pat
= gen_rtx_PARALLEL (VOIDmode
, rtvec_alloc (oldn
+ newn
));
1299 if (GET_CODE (*pat
) == PARALLEL
)
1300 for (i
= 0; i
< oldn
; i
++)
1301 XVECEXP (new_pat
, 0, i
) = XVECEXP (*pat
, 0, i
);
1303 XVECEXP (new_pat
, 0, 0) = *pat
;
1304 for (s
= amd
.side_effects
, i
= oldn
; i
< oldn
+ newn
; i
++, s
= XEXP (s
, 1))
1305 XVECEXP (new_pat
, 0, i
) = XEXP (s
, 0);
1306 free_EXPR_LIST_list (&amd
.side_effects
);
1307 validate_change (NULL_RTX
, pat
, new_pat
, true);
1311 /* Return the DEBUG_EXPR of a DEBUG_EXPR_DECL or the VALUE in DV. */
1313 dv_as_rtx (decl_or_value dv
)
1317 if (dv_is_value_p (dv
))
1318 return dv_as_value (dv
);
1320 decl
= dv_as_decl (dv
);
1322 gcc_checking_assert (TREE_CODE (decl
) == DEBUG_EXPR_DECL
);
1323 return DECL_RTL_KNOWN_SET (decl
);
1326 /* Return nonzero if a decl_or_value must not have more than one
1327 variable part. The returned value discriminates among various
1328 kinds of one-part DVs ccording to enum onepart_enum. */
1329 static inline onepart_enum
1330 dv_onepart_p (decl_or_value dv
)
1334 if (!MAY_HAVE_DEBUG_INSNS
)
1337 if (dv_is_value_p (dv
))
1338 return ONEPART_VALUE
;
1340 decl
= dv_as_decl (dv
);
1342 if (TREE_CODE (decl
) == DEBUG_EXPR_DECL
)
1343 return ONEPART_DEXPR
;
1345 if (target_for_debug_bind (decl
) != NULL_TREE
)
1346 return ONEPART_VDECL
;
1351 /* Return the variable pool to be used for a dv of type ONEPART. */
1352 static inline pool_allocator
&
1353 onepart_pool (onepart_enum onepart
)
1355 return onepart
? valvar_pool
: var_pool
;
1358 /* Allocate a variable_def from the corresponding variable pool. */
1359 static inline variable
*
1360 onepart_pool_allocate (onepart_enum onepart
)
1362 return (variable
*) onepart_pool (onepart
).allocate ();
1365 /* Build a decl_or_value out of a decl. */
1366 static inline decl_or_value
1367 dv_from_decl (tree decl
)
1371 gcc_checking_assert (dv_is_decl_p (dv
));
1375 /* Build a decl_or_value out of a value. */
1376 static inline decl_or_value
1377 dv_from_value (rtx value
)
1381 gcc_checking_assert (dv_is_value_p (dv
));
1385 /* Return a value or the decl of a debug_expr as a decl_or_value. */
1386 static inline decl_or_value
1391 switch (GET_CODE (x
))
1394 dv
= dv_from_decl (DEBUG_EXPR_TREE_DECL (x
));
1395 gcc_checking_assert (DECL_RTL_KNOWN_SET (DEBUG_EXPR_TREE_DECL (x
)) == x
);
1399 dv
= dv_from_value (x
);
1409 extern void debug_dv (decl_or_value dv
);
1412 debug_dv (decl_or_value dv
)
1414 if (dv_is_value_p (dv
))
1415 debug_rtx (dv_as_value (dv
));
1417 debug_generic_stmt (dv_as_decl (dv
));
1420 static void loc_exp_dep_clear (variable
*var
);
1422 /* Free the element of VARIABLE_HTAB (its type is struct variable_def). */
1425 variable_htab_free (void *elem
)
1428 variable
*var
= (variable
*) elem
;
1429 location_chain
*node
, *next
;
1431 gcc_checking_assert (var
->refcount
> 0);
1434 if (var
->refcount
> 0)
1437 for (i
= 0; i
< var
->n_var_parts
; i
++)
1439 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= next
)
1444 var
->var_part
[i
].loc_chain
= NULL
;
1446 if (var
->onepart
&& VAR_LOC_1PAUX (var
))
1448 loc_exp_dep_clear (var
);
1449 if (VAR_LOC_DEP_LST (var
))
1450 VAR_LOC_DEP_LST (var
)->pprev
= NULL
;
1451 XDELETE (VAR_LOC_1PAUX (var
));
1452 /* These may be reused across functions, so reset
1454 if (var
->onepart
== ONEPART_DEXPR
)
1455 set_dv_changed (var
->dv
, true);
1457 onepart_pool (var
->onepart
).remove (var
);
1460 /* Initialize the set (array) SET of attrs to empty lists. */
1463 init_attrs_list_set (attrs
**set
)
1467 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1471 /* Make the list *LISTP empty. */
1474 attrs_list_clear (attrs
**listp
)
1478 for (list
= *listp
; list
; list
= next
)
1486 /* Return true if the pair of DECL and OFFSET is the member of the LIST. */
1489 attrs_list_member (attrs
*list
, decl_or_value dv
, HOST_WIDE_INT offset
)
1491 for (; list
; list
= list
->next
)
1492 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
) && list
->offset
== offset
)
1497 /* Insert the triplet DECL, OFFSET, LOC to the list *LISTP. */
1500 attrs_list_insert (attrs
**listp
, decl_or_value dv
,
1501 HOST_WIDE_INT offset
, rtx loc
)
1503 attrs
*list
= new attrs
;
1506 list
->offset
= offset
;
1507 list
->next
= *listp
;
1511 /* Copy all nodes from SRC and create a list *DSTP of the copies. */
1514 attrs_list_copy (attrs
**dstp
, attrs
*src
)
1516 attrs_list_clear (dstp
);
1517 for (; src
; src
= src
->next
)
1519 attrs
*n
= new attrs
;
1522 n
->offset
= src
->offset
;
1528 /* Add all nodes from SRC which are not in *DSTP to *DSTP. */
1531 attrs_list_union (attrs
**dstp
, attrs
*src
)
1533 for (; src
; src
= src
->next
)
1535 if (!attrs_list_member (*dstp
, src
->dv
, src
->offset
))
1536 attrs_list_insert (dstp
, src
->dv
, src
->offset
, src
->loc
);
1540 /* Combine nodes that are not onepart nodes from SRC and SRC2 into
1544 attrs_list_mpdv_union (attrs
**dstp
, attrs
*src
, attrs
*src2
)
1546 gcc_assert (!*dstp
);
1547 for (; src
; src
= src
->next
)
1549 if (!dv_onepart_p (src
->dv
))
1550 attrs_list_insert (dstp
, src
->dv
, src
->offset
, src
->loc
);
1552 for (src
= src2
; src
; src
= src
->next
)
1554 if (!dv_onepart_p (src
->dv
)
1555 && !attrs_list_member (*dstp
, src
->dv
, src
->offset
))
1556 attrs_list_insert (dstp
, src
->dv
, src
->offset
, src
->loc
);
1560 /* Shared hashtable support. */
1562 /* Return true if VARS is shared. */
1565 shared_hash_shared (shared_hash
*vars
)
1567 return vars
->refcount
> 1;
1570 /* Return the hash table for VARS. */
1572 static inline variable_table_type
*
1573 shared_hash_htab (shared_hash
*vars
)
1578 /* Return true if VAR is shared, or maybe because VARS is shared. */
1581 shared_var_p (variable
*var
, shared_hash
*vars
)
1583 /* Don't count an entry in the changed_variables table as a duplicate. */
1584 return ((var
->refcount
> 1 + (int) var
->in_changed_variables
)
1585 || shared_hash_shared (vars
));
1588 /* Copy variables into a new hash table. */
1590 static shared_hash
*
1591 shared_hash_unshare (shared_hash
*vars
)
1593 shared_hash
*new_vars
= new shared_hash
;
1594 gcc_assert (vars
->refcount
> 1);
1595 new_vars
->refcount
= 1;
1596 new_vars
->htab
= new variable_table_type (vars
->htab
->elements () + 3);
1597 vars_copy (new_vars
->htab
, vars
->htab
);
1602 /* Increment reference counter on VARS and return it. */
1604 static inline shared_hash
*
1605 shared_hash_copy (shared_hash
*vars
)
1611 /* Decrement reference counter and destroy hash table if not shared
1615 shared_hash_destroy (shared_hash
*vars
)
1617 gcc_checking_assert (vars
->refcount
> 0);
1618 if (--vars
->refcount
== 0)
1625 /* Unshare *PVARS if shared and return slot for DV. If INS is
1626 INSERT, insert it if not already present. */
1628 static inline variable
**
1629 shared_hash_find_slot_unshare_1 (shared_hash
**pvars
, decl_or_value dv
,
1630 hashval_t dvhash
, enum insert_option ins
)
1632 if (shared_hash_shared (*pvars
))
1633 *pvars
= shared_hash_unshare (*pvars
);
1634 return shared_hash_htab (*pvars
)->find_slot_with_hash (dv
, dvhash
, ins
);
1637 static inline variable
**
1638 shared_hash_find_slot_unshare (shared_hash
**pvars
, decl_or_value dv
,
1639 enum insert_option ins
)
1641 return shared_hash_find_slot_unshare_1 (pvars
, dv
, dv_htab_hash (dv
), ins
);
1644 /* Return slot for DV, if it is already present in the hash table.
1645 If it is not present, insert it only VARS is not shared, otherwise
1648 static inline variable
**
1649 shared_hash_find_slot_1 (shared_hash
*vars
, decl_or_value dv
, hashval_t dvhash
)
1651 return shared_hash_htab (vars
)->find_slot_with_hash (dv
, dvhash
,
1652 shared_hash_shared (vars
)
1653 ? NO_INSERT
: INSERT
);
1656 static inline variable
**
1657 shared_hash_find_slot (shared_hash
*vars
, decl_or_value dv
)
1659 return shared_hash_find_slot_1 (vars
, dv
, dv_htab_hash (dv
));
1662 /* Return slot for DV only if it is already present in the hash table. */
1664 static inline variable
**
1665 shared_hash_find_slot_noinsert_1 (shared_hash
*vars
, decl_or_value dv
,
1668 return shared_hash_htab (vars
)->find_slot_with_hash (dv
, dvhash
, NO_INSERT
);
1671 static inline variable
**
1672 shared_hash_find_slot_noinsert (shared_hash
*vars
, decl_or_value dv
)
1674 return shared_hash_find_slot_noinsert_1 (vars
, dv
, dv_htab_hash (dv
));
1677 /* Return variable for DV or NULL if not already present in the hash
1680 static inline variable
*
1681 shared_hash_find_1 (shared_hash
*vars
, decl_or_value dv
, hashval_t dvhash
)
1683 return shared_hash_htab (vars
)->find_with_hash (dv
, dvhash
);
1686 static inline variable
*
1687 shared_hash_find (shared_hash
*vars
, decl_or_value dv
)
1689 return shared_hash_find_1 (vars
, dv
, dv_htab_hash (dv
));
1692 /* Return true if TVAL is better than CVAL as a canonival value. We
1693 choose lowest-numbered VALUEs, using the RTX address as a
1694 tie-breaker. The idea is to arrange them into a star topology,
1695 such that all of them are at most one step away from the canonical
1696 value, and the canonical value has backlinks to all of them, in
1697 addition to all the actual locations. We don't enforce this
1698 topology throughout the entire dataflow analysis, though.
1702 canon_value_cmp (rtx tval
, rtx cval
)
1705 || CSELIB_VAL_PTR (tval
)->uid
< CSELIB_VAL_PTR (cval
)->uid
;
1708 static bool dst_can_be_shared
;
1710 /* Return a copy of a variable VAR and insert it to dataflow set SET. */
1713 unshare_variable (dataflow_set
*set
, variable
**slot
, variable
*var
,
1714 enum var_init_status initialized
)
1719 new_var
= onepart_pool_allocate (var
->onepart
);
1720 new_var
->dv
= var
->dv
;
1721 new_var
->refcount
= 1;
1723 new_var
->n_var_parts
= var
->n_var_parts
;
1724 new_var
->onepart
= var
->onepart
;
1725 new_var
->in_changed_variables
= false;
1727 if (! flag_var_tracking_uninit
)
1728 initialized
= VAR_INIT_STATUS_INITIALIZED
;
1730 for (i
= 0; i
< var
->n_var_parts
; i
++)
1732 location_chain
*node
;
1733 location_chain
**nextp
;
1735 if (i
== 0 && var
->onepart
)
1737 /* One-part auxiliary data is only used while emitting
1738 notes, so propagate it to the new variable in the active
1739 dataflow set. If we're not emitting notes, this will be
1741 gcc_checking_assert (!VAR_LOC_1PAUX (var
) || emit_notes
);
1742 VAR_LOC_1PAUX (new_var
) = VAR_LOC_1PAUX (var
);
1743 VAR_LOC_1PAUX (var
) = NULL
;
1746 VAR_PART_OFFSET (new_var
, i
) = VAR_PART_OFFSET (var
, i
);
1747 nextp
= &new_var
->var_part
[i
].loc_chain
;
1748 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
1750 location_chain
*new_lc
;
1752 new_lc
= new location_chain
;
1753 new_lc
->next
= NULL
;
1754 if (node
->init
> initialized
)
1755 new_lc
->init
= node
->init
;
1757 new_lc
->init
= initialized
;
1758 if (node
->set_src
&& !(MEM_P (node
->set_src
)))
1759 new_lc
->set_src
= node
->set_src
;
1761 new_lc
->set_src
= NULL
;
1762 new_lc
->loc
= node
->loc
;
1765 nextp
= &new_lc
->next
;
1768 new_var
->var_part
[i
].cur_loc
= var
->var_part
[i
].cur_loc
;
1771 dst_can_be_shared
= false;
1772 if (shared_hash_shared (set
->vars
))
1773 slot
= shared_hash_find_slot_unshare (&set
->vars
, var
->dv
, NO_INSERT
);
1774 else if (set
->traversed_vars
&& set
->vars
!= set
->traversed_vars
)
1775 slot
= shared_hash_find_slot_noinsert (set
->vars
, var
->dv
);
1777 if (var
->in_changed_variables
)
1780 = changed_variables
->find_slot_with_hash (var
->dv
,
1781 dv_htab_hash (var
->dv
),
1783 gcc_assert (*cslot
== (void *) var
);
1784 var
->in_changed_variables
= false;
1785 variable_htab_free (var
);
1787 new_var
->in_changed_variables
= true;
1792 /* Copy all variables from hash table SRC to hash table DST. */
1795 vars_copy (variable_table_type
*dst
, variable_table_type
*src
)
1797 variable_iterator_type hi
;
1800 FOR_EACH_HASH_TABLE_ELEMENT (*src
, var
, variable
, hi
)
1804 dstp
= dst
->find_slot_with_hash (var
->dv
, dv_htab_hash (var
->dv
),
1810 /* Map a decl to its main debug decl. */
1813 var_debug_decl (tree decl
)
1815 if (decl
&& TREE_CODE (decl
) == VAR_DECL
1816 && DECL_HAS_DEBUG_EXPR_P (decl
))
1818 tree debugdecl
= DECL_DEBUG_EXPR (decl
);
1819 if (DECL_P (debugdecl
))
1826 /* Set the register LOC to contain DV, OFFSET. */
1829 var_reg_decl_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
1830 decl_or_value dv
, HOST_WIDE_INT offset
, rtx set_src
,
1831 enum insert_option iopt
)
1834 bool decl_p
= dv_is_decl_p (dv
);
1837 dv
= dv_from_decl (var_debug_decl (dv_as_decl (dv
)));
1839 for (node
= set
->regs
[REGNO (loc
)]; node
; node
= node
->next
)
1840 if (dv_as_opaque (node
->dv
) == dv_as_opaque (dv
)
1841 && node
->offset
== offset
)
1844 attrs_list_insert (&set
->regs
[REGNO (loc
)], dv
, offset
, loc
);
1845 set_variable_part (set
, loc
, dv
, offset
, initialized
, set_src
, iopt
);
1848 /* Set the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). */
1851 var_reg_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
1854 tree decl
= REG_EXPR (loc
);
1855 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
1857 var_reg_decl_set (set
, loc
, initialized
,
1858 dv_from_decl (decl
), offset
, set_src
, INSERT
);
1861 static enum var_init_status
1862 get_init_value (dataflow_set
*set
, rtx loc
, decl_or_value dv
)
1866 enum var_init_status ret_val
= VAR_INIT_STATUS_UNKNOWN
;
1868 if (! flag_var_tracking_uninit
)
1869 return VAR_INIT_STATUS_INITIALIZED
;
1871 var
= shared_hash_find (set
->vars
, dv
);
1874 for (i
= 0; i
< var
->n_var_parts
&& ret_val
== VAR_INIT_STATUS_UNKNOWN
; i
++)
1876 location_chain
*nextp
;
1877 for (nextp
= var
->var_part
[i
].loc_chain
; nextp
; nextp
= nextp
->next
)
1878 if (rtx_equal_p (nextp
->loc
, loc
))
1880 ret_val
= nextp
->init
;
1889 /* Delete current content of register LOC in dataflow set SET and set
1890 the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). If
1891 MODIFY is true, any other live copies of the same variable part are
1892 also deleted from the dataflow set, otherwise the variable part is
1893 assumed to be copied from another location holding the same
1897 var_reg_delete_and_set (dataflow_set
*set
, rtx loc
, bool modify
,
1898 enum var_init_status initialized
, rtx set_src
)
1900 tree decl
= REG_EXPR (loc
);
1901 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
1905 decl
= var_debug_decl (decl
);
1907 if (initialized
== VAR_INIT_STATUS_UNKNOWN
)
1908 initialized
= get_init_value (set
, loc
, dv_from_decl (decl
));
1910 nextp
= &set
->regs
[REGNO (loc
)];
1911 for (node
= *nextp
; node
; node
= next
)
1914 if (dv_as_opaque (node
->dv
) != decl
|| node
->offset
!= offset
)
1916 delete_variable_part (set
, node
->loc
, node
->dv
, node
->offset
);
1923 nextp
= &node
->next
;
1927 clobber_variable_part (set
, loc
, dv_from_decl (decl
), offset
, set_src
);
1928 var_reg_set (set
, loc
, initialized
, set_src
);
1931 /* Delete the association of register LOC in dataflow set SET with any
1932 variables that aren't onepart. If CLOBBER is true, also delete any
1933 other live copies of the same variable part, and delete the
1934 association with onepart dvs too. */
1937 var_reg_delete (dataflow_set
*set
, rtx loc
, bool clobber
)
1939 attrs
**nextp
= &set
->regs
[REGNO (loc
)];
1944 tree decl
= REG_EXPR (loc
);
1945 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
1947 decl
= var_debug_decl (decl
);
1949 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, NULL
);
1952 for (node
= *nextp
; node
; node
= next
)
1955 if (clobber
|| !dv_onepart_p (node
->dv
))
1957 delete_variable_part (set
, node
->loc
, node
->dv
, node
->offset
);
1962 nextp
= &node
->next
;
1966 /* Delete content of register with number REGNO in dataflow set SET. */
1969 var_regno_delete (dataflow_set
*set
, int regno
)
1971 attrs
**reg
= &set
->regs
[regno
];
1974 for (node
= *reg
; node
; node
= next
)
1977 delete_variable_part (set
, node
->loc
, node
->dv
, node
->offset
);
1983 /* Return true if I is the negated value of a power of two. */
1985 negative_power_of_two_p (HOST_WIDE_INT i
)
1987 unsigned HOST_WIDE_INT x
= -(unsigned HOST_WIDE_INT
)i
;
1988 return x
== (x
& -x
);
1991 /* Strip constant offsets and alignments off of LOC. Return the base
1995 vt_get_canonicalize_base (rtx loc
)
1997 while ((GET_CODE (loc
) == PLUS
1998 || GET_CODE (loc
) == AND
)
1999 && GET_CODE (XEXP (loc
, 1)) == CONST_INT
2000 && (GET_CODE (loc
) != AND
2001 || negative_power_of_two_p (INTVAL (XEXP (loc
, 1)))))
2002 loc
= XEXP (loc
, 0);
2007 /* This caches canonicalized addresses for VALUEs, computed using
2008 information in the global cselib table. */
2009 static hash_map
<rtx
, rtx
> *global_get_addr_cache
;
2011 /* This caches canonicalized addresses for VALUEs, computed using
2012 information from the global cache and information pertaining to a
2013 basic block being analyzed. */
2014 static hash_map
<rtx
, rtx
> *local_get_addr_cache
;
2016 static rtx
vt_canonicalize_addr (dataflow_set
*, rtx
);
2018 /* Return the canonical address for LOC, that must be a VALUE, using a
2019 cached global equivalence or computing it and storing it in the
2023 get_addr_from_global_cache (rtx
const loc
)
2027 gcc_checking_assert (GET_CODE (loc
) == VALUE
);
2030 rtx
*slot
= &global_get_addr_cache
->get_or_insert (loc
, &existed
);
2034 x
= canon_rtx (get_addr (loc
));
2036 /* Tentative, avoiding infinite recursion. */
2041 rtx nx
= vt_canonicalize_addr (NULL
, x
);
2044 /* The table may have moved during recursion, recompute
2046 *global_get_addr_cache
->get (loc
) = x
= nx
;
2053 /* Return the canonical address for LOC, that must be a VALUE, using a
2054 cached local equivalence or computing it and storing it in the
2058 get_addr_from_local_cache (dataflow_set
*set
, rtx
const loc
)
2065 gcc_checking_assert (GET_CODE (loc
) == VALUE
);
2068 rtx
*slot
= &local_get_addr_cache
->get_or_insert (loc
, &existed
);
2072 x
= get_addr_from_global_cache (loc
);
2074 /* Tentative, avoiding infinite recursion. */
2077 /* Recurse to cache local expansion of X, or if we need to search
2078 for a VALUE in the expansion. */
2081 rtx nx
= vt_canonicalize_addr (set
, x
);
2084 slot
= local_get_addr_cache
->get (loc
);
2090 dv
= dv_from_rtx (x
);
2091 var
= shared_hash_find (set
->vars
, dv
);
2095 /* Look for an improved equivalent expression. */
2096 for (l
= var
->var_part
[0].loc_chain
; l
; l
= l
->next
)
2098 rtx base
= vt_get_canonicalize_base (l
->loc
);
2099 if (GET_CODE (base
) == VALUE
2100 && canon_value_cmp (base
, loc
))
2102 rtx nx
= vt_canonicalize_addr (set
, l
->loc
);
2105 slot
= local_get_addr_cache
->get (loc
);
2115 /* Canonicalize LOC using equivalences from SET in addition to those
2116 in the cselib static table. It expects a VALUE-based expression,
2117 and it will only substitute VALUEs with other VALUEs or
2118 function-global equivalences, so that, if two addresses have base
2119 VALUEs that are locally or globally related in ways that
2120 memrefs_conflict_p cares about, they will both canonicalize to
2121 expressions that have the same base VALUE.
2123 The use of VALUEs as canonical base addresses enables the canonical
2124 RTXs to remain unchanged globally, if they resolve to a constant,
2125 or throughout a basic block otherwise, so that they can be cached
2126 and the cache needs not be invalidated when REGs, MEMs or such
2130 vt_canonicalize_addr (dataflow_set
*set
, rtx oloc
)
2132 HOST_WIDE_INT ofst
= 0;
2133 machine_mode mode
= GET_MODE (oloc
);
2140 while (GET_CODE (loc
) == PLUS
2141 && GET_CODE (XEXP (loc
, 1)) == CONST_INT
)
2143 ofst
+= INTVAL (XEXP (loc
, 1));
2144 loc
= XEXP (loc
, 0);
2147 /* Alignment operations can't normally be combined, so just
2148 canonicalize the base and we're done. We'll normally have
2149 only one stack alignment anyway. */
2150 if (GET_CODE (loc
) == AND
2151 && GET_CODE (XEXP (loc
, 1)) == CONST_INT
2152 && negative_power_of_two_p (INTVAL (XEXP (loc
, 1))))
2154 x
= vt_canonicalize_addr (set
, XEXP (loc
, 0));
2155 if (x
!= XEXP (loc
, 0))
2156 loc
= gen_rtx_AND (mode
, x
, XEXP (loc
, 1));
2160 if (GET_CODE (loc
) == VALUE
)
2163 loc
= get_addr_from_local_cache (set
, loc
);
2165 loc
= get_addr_from_global_cache (loc
);
2167 /* Consolidate plus_constants. */
2168 while (ofst
&& GET_CODE (loc
) == PLUS
2169 && GET_CODE (XEXP (loc
, 1)) == CONST_INT
)
2171 ofst
+= INTVAL (XEXP (loc
, 1));
2172 loc
= XEXP (loc
, 0);
2179 x
= canon_rtx (loc
);
2186 /* Add OFST back in. */
2189 /* Don't build new RTL if we can help it. */
2190 if (GET_CODE (oloc
) == PLUS
2191 && XEXP (oloc
, 0) == loc
2192 && INTVAL (XEXP (oloc
, 1)) == ofst
)
2195 loc
= plus_constant (mode
, loc
, ofst
);
2201 /* Return true iff there's a true dependence between MLOC and LOC.
2202 MADDR must be a canonicalized version of MLOC's address. */
2205 vt_canon_true_dep (dataflow_set
*set
, rtx mloc
, rtx maddr
, rtx loc
)
2207 if (GET_CODE (loc
) != MEM
)
2210 rtx addr
= vt_canonicalize_addr (set
, XEXP (loc
, 0));
2211 if (!canon_true_dependence (mloc
, GET_MODE (mloc
), maddr
, loc
, addr
))
2217 /* Hold parameters for the hashtab traversal function
2218 drop_overlapping_mem_locs, see below. */
2220 struct overlapping_mems
2226 /* Remove all MEMs that overlap with COMS->LOC from the location list
2227 of a hash table entry for a value. COMS->ADDR must be a
2228 canonicalized form of COMS->LOC's address, and COMS->LOC must be
2229 canonicalized itself. */
2232 drop_overlapping_mem_locs (variable
**slot
, overlapping_mems
*coms
)
2234 dataflow_set
*set
= coms
->set
;
2235 rtx mloc
= coms
->loc
, addr
= coms
->addr
;
2236 variable
*var
= *slot
;
2238 if (var
->onepart
== ONEPART_VALUE
)
2240 location_chain
*loc
, **locp
;
2241 bool changed
= false;
2244 gcc_assert (var
->n_var_parts
== 1);
2246 if (shared_var_p (var
, set
->vars
))
2248 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
2249 if (vt_canon_true_dep (set
, mloc
, addr
, loc
->loc
))
2255 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
2257 gcc_assert (var
->n_var_parts
== 1);
2260 if (VAR_LOC_1PAUX (var
))
2261 cur_loc
= VAR_LOC_FROM (var
);
2263 cur_loc
= var
->var_part
[0].cur_loc
;
2265 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
2268 if (!vt_canon_true_dep (set
, mloc
, addr
, loc
->loc
))
2275 /* If we have deleted the location which was last emitted
2276 we have to emit new location so add the variable to set
2277 of changed variables. */
2278 if (cur_loc
== loc
->loc
)
2281 var
->var_part
[0].cur_loc
= NULL
;
2282 if (VAR_LOC_1PAUX (var
))
2283 VAR_LOC_FROM (var
) = NULL
;
2288 if (!var
->var_part
[0].loc_chain
)
2294 variable_was_changed (var
, set
);
2300 /* Remove from SET all VALUE bindings to MEMs that overlap with LOC. */
2303 clobber_overlapping_mems (dataflow_set
*set
, rtx loc
)
2305 struct overlapping_mems coms
;
2307 gcc_checking_assert (GET_CODE (loc
) == MEM
);
2310 coms
.loc
= canon_rtx (loc
);
2311 coms
.addr
= vt_canonicalize_addr (set
, XEXP (loc
, 0));
2313 set
->traversed_vars
= set
->vars
;
2314 shared_hash_htab (set
->vars
)
2315 ->traverse
<overlapping_mems
*, drop_overlapping_mem_locs
> (&coms
);
2316 set
->traversed_vars
= NULL
;
2319 /* Set the location of DV, OFFSET as the MEM LOC. */
2322 var_mem_decl_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
2323 decl_or_value dv
, HOST_WIDE_INT offset
, rtx set_src
,
2324 enum insert_option iopt
)
2326 if (dv_is_decl_p (dv
))
2327 dv
= dv_from_decl (var_debug_decl (dv_as_decl (dv
)));
2329 set_variable_part (set
, loc
, dv
, offset
, initialized
, set_src
, iopt
);
2332 /* Set the location part of variable MEM_EXPR (LOC) in dataflow set
2334 Adjust the address first if it is stack pointer based. */
2337 var_mem_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
2340 tree decl
= MEM_EXPR (loc
);
2341 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
2343 var_mem_decl_set (set
, loc
, initialized
,
2344 dv_from_decl (decl
), offset
, set_src
, INSERT
);
2347 /* Delete and set the location part of variable MEM_EXPR (LOC) in
2348 dataflow set SET to LOC. If MODIFY is true, any other live copies
2349 of the same variable part are also deleted from the dataflow set,
2350 otherwise the variable part is assumed to be copied from another
2351 location holding the same part.
2352 Adjust the address first if it is stack pointer based. */
2355 var_mem_delete_and_set (dataflow_set
*set
, rtx loc
, bool modify
,
2356 enum var_init_status initialized
, rtx set_src
)
2358 tree decl
= MEM_EXPR (loc
);
2359 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
2361 clobber_overlapping_mems (set
, loc
);
2362 decl
= var_debug_decl (decl
);
2364 if (initialized
== VAR_INIT_STATUS_UNKNOWN
)
2365 initialized
= get_init_value (set
, loc
, dv_from_decl (decl
));
2368 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, set_src
);
2369 var_mem_set (set
, loc
, initialized
, set_src
);
2372 /* Delete the location part LOC from dataflow set SET. If CLOBBER is
2373 true, also delete any other live copies of the same variable part.
2374 Adjust the address first if it is stack pointer based. */
2377 var_mem_delete (dataflow_set
*set
, rtx loc
, bool clobber
)
2379 tree decl
= MEM_EXPR (loc
);
2380 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
2382 clobber_overlapping_mems (set
, loc
);
2383 decl
= var_debug_decl (decl
);
2385 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, NULL
);
2386 delete_variable_part (set
, loc
, dv_from_decl (decl
), offset
);
2389 /* Return true if LOC should not be expanded for location expressions,
2393 unsuitable_loc (rtx loc
)
2395 switch (GET_CODE (loc
))
2409 /* Bind VAL to LOC in SET. If MODIFIED, detach LOC from any values
2413 val_bind (dataflow_set
*set
, rtx val
, rtx loc
, bool modified
)
2418 var_regno_delete (set
, REGNO (loc
));
2419 var_reg_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
2420 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
2422 else if (MEM_P (loc
))
2424 struct elt_loc_list
*l
= CSELIB_VAL_PTR (val
)->locs
;
2427 clobber_overlapping_mems (set
, loc
);
2429 if (l
&& GET_CODE (l
->loc
) == VALUE
)
2430 l
= canonical_cselib_val (CSELIB_VAL_PTR (l
->loc
))->locs
;
2432 /* If this MEM is a global constant, we don't need it in the
2433 dynamic tables. ??? We should test this before emitting the
2434 micro-op in the first place. */
2436 if (GET_CODE (l
->loc
) == MEM
&& XEXP (l
->loc
, 0) == XEXP (loc
, 0))
2442 var_mem_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
2443 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
2447 /* Other kinds of equivalences are necessarily static, at least
2448 so long as we do not perform substitutions while merging
2451 set_variable_part (set
, loc
, dv_from_value (val
), 0,
2452 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2456 /* Bind a value to a location it was just stored in. If MODIFIED
2457 holds, assume the location was modified, detaching it from any
2458 values bound to it. */
2461 val_store (dataflow_set
*set
, rtx val
, rtx loc
, rtx_insn
*insn
,
2464 cselib_val
*v
= CSELIB_VAL_PTR (val
);
2466 gcc_assert (cselib_preserved_value_p (v
));
2470 fprintf (dump_file
, "%i: ", insn
? INSN_UID (insn
) : 0);
2471 print_inline_rtx (dump_file
, loc
, 0);
2472 fprintf (dump_file
, " evaluates to ");
2473 print_inline_rtx (dump_file
, val
, 0);
2476 struct elt_loc_list
*l
;
2477 for (l
= v
->locs
; l
; l
= l
->next
)
2479 fprintf (dump_file
, "\n%i: ", INSN_UID (l
->setting_insn
));
2480 print_inline_rtx (dump_file
, l
->loc
, 0);
2483 fprintf (dump_file
, "\n");
2486 gcc_checking_assert (!unsuitable_loc (loc
));
2488 val_bind (set
, val
, loc
, modified
);
2491 /* Clear (canonical address) slots that reference X. */
2494 local_get_addr_clear_given_value (rtx
const &, rtx
*slot
, rtx x
)
2496 if (vt_get_canonicalize_base (*slot
) == x
)
2501 /* Reset this node, detaching all its equivalences. Return the slot
2502 in the variable hash table that holds dv, if there is one. */
2505 val_reset (dataflow_set
*set
, decl_or_value dv
)
2507 variable
*var
= shared_hash_find (set
->vars
, dv
) ;
2508 location_chain
*node
;
2511 if (!var
|| !var
->n_var_parts
)
2514 gcc_assert (var
->n_var_parts
== 1);
2516 if (var
->onepart
== ONEPART_VALUE
)
2518 rtx x
= dv_as_value (dv
);
2520 /* Relationships in the global cache don't change, so reset the
2521 local cache entry only. */
2522 rtx
*slot
= local_get_addr_cache
->get (x
);
2525 /* If the value resolved back to itself, odds are that other
2526 values may have cached it too. These entries now refer
2527 to the old X, so detach them too. Entries that used the
2528 old X but resolved to something else remain ok as long as
2529 that something else isn't also reset. */
2531 local_get_addr_cache
2532 ->traverse
<rtx
, local_get_addr_clear_given_value
> (x
);
2538 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
2539 if (GET_CODE (node
->loc
) == VALUE
2540 && canon_value_cmp (node
->loc
, cval
))
2543 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
2544 if (GET_CODE (node
->loc
) == VALUE
&& cval
!= node
->loc
)
2546 /* Redirect the equivalence link to the new canonical
2547 value, or simply remove it if it would point at
2550 set_variable_part (set
, cval
, dv_from_value (node
->loc
),
2551 0, node
->init
, node
->set_src
, NO_INSERT
);
2552 delete_variable_part (set
, dv_as_value (dv
),
2553 dv_from_value (node
->loc
), 0);
2558 decl_or_value cdv
= dv_from_value (cval
);
2560 /* Keep the remaining values connected, accummulating links
2561 in the canonical value. */
2562 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
2564 if (node
->loc
== cval
)
2566 else if (GET_CODE (node
->loc
) == REG
)
2567 var_reg_decl_set (set
, node
->loc
, node
->init
, cdv
, 0,
2568 node
->set_src
, NO_INSERT
);
2569 else if (GET_CODE (node
->loc
) == MEM
)
2570 var_mem_decl_set (set
, node
->loc
, node
->init
, cdv
, 0,
2571 node
->set_src
, NO_INSERT
);
2573 set_variable_part (set
, node
->loc
, cdv
, 0,
2574 node
->init
, node
->set_src
, NO_INSERT
);
2578 /* We remove this last, to make sure that the canonical value is not
2579 removed to the point of requiring reinsertion. */
2581 delete_variable_part (set
, dv_as_value (dv
), dv_from_value (cval
), 0);
2583 clobber_variable_part (set
, NULL
, dv
, 0, NULL
);
2586 /* Find the values in a given location and map the val to another
2587 value, if it is unique, or add the location as one holding the
2591 val_resolve (dataflow_set
*set
, rtx val
, rtx loc
, rtx_insn
*insn
)
2593 decl_or_value dv
= dv_from_value (val
);
2595 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2598 fprintf (dump_file
, "%i: ", INSN_UID (insn
));
2600 fprintf (dump_file
, "head: ");
2601 print_inline_rtx (dump_file
, val
, 0);
2602 fputs (" is at ", dump_file
);
2603 print_inline_rtx (dump_file
, loc
, 0);
2604 fputc ('\n', dump_file
);
2607 val_reset (set
, dv
);
2609 gcc_checking_assert (!unsuitable_loc (loc
));
2613 attrs
*node
, *found
= NULL
;
2615 for (node
= set
->regs
[REGNO (loc
)]; node
; node
= node
->next
)
2616 if (dv_is_value_p (node
->dv
)
2617 && GET_MODE (dv_as_value (node
->dv
)) == GET_MODE (loc
))
2621 /* Map incoming equivalences. ??? Wouldn't it be nice if
2622 we just started sharing the location lists? Maybe a
2623 circular list ending at the value itself or some
2625 set_variable_part (set
, dv_as_value (node
->dv
),
2626 dv_from_value (val
), node
->offset
,
2627 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2628 set_variable_part (set
, val
, node
->dv
, node
->offset
,
2629 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2632 /* If we didn't find any equivalence, we need to remember that
2633 this value is held in the named register. */
2637 /* ??? Attempt to find and merge equivalent MEMs or other
2640 val_bind (set
, val
, loc
, false);
2643 /* Initialize dataflow set SET to be empty.
2644 VARS_SIZE is the initial size of hash table VARS. */
2647 dataflow_set_init (dataflow_set
*set
)
2649 init_attrs_list_set (set
->regs
);
2650 set
->vars
= shared_hash_copy (empty_shared_hash
);
2651 set
->stack_adjust
= 0;
2652 set
->traversed_vars
= NULL
;
2655 /* Delete the contents of dataflow set SET. */
2658 dataflow_set_clear (dataflow_set
*set
)
2662 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2663 attrs_list_clear (&set
->regs
[i
]);
2665 shared_hash_destroy (set
->vars
);
2666 set
->vars
= shared_hash_copy (empty_shared_hash
);
2669 /* Copy the contents of dataflow set SRC to DST. */
2672 dataflow_set_copy (dataflow_set
*dst
, dataflow_set
*src
)
2676 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2677 attrs_list_copy (&dst
->regs
[i
], src
->regs
[i
]);
2679 shared_hash_destroy (dst
->vars
);
2680 dst
->vars
= shared_hash_copy (src
->vars
);
2681 dst
->stack_adjust
= src
->stack_adjust
;
2684 /* Information for merging lists of locations for a given offset of variable.
2686 struct variable_union_info
2688 /* Node of the location chain. */
2691 /* The sum of positions in the input chains. */
2694 /* The position in the chain of DST dataflow set. */
2698 /* Buffer for location list sorting and its allocated size. */
2699 static struct variable_union_info
*vui_vec
;
2700 static int vui_allocated
;
2702 /* Compare function for qsort, order the structures by POS element. */
2705 variable_union_info_cmp_pos (const void *n1
, const void *n2
)
2707 const struct variable_union_info
*const i1
=
2708 (const struct variable_union_info
*) n1
;
2709 const struct variable_union_info
*const i2
=
2710 ( const struct variable_union_info
*) n2
;
2712 if (i1
->pos
!= i2
->pos
)
2713 return i1
->pos
- i2
->pos
;
2715 return (i1
->pos_dst
- i2
->pos_dst
);
2718 /* Compute union of location parts of variable *SLOT and the same variable
2719 from hash table DATA. Compute "sorted" union of the location chains
2720 for common offsets, i.e. the locations of a variable part are sorted by
2721 a priority where the priority is the sum of the positions in the 2 chains
2722 (if a location is only in one list the position in the second list is
2723 defined to be larger than the length of the chains).
2724 When we are updating the location parts the newest location is in the
2725 beginning of the chain, so when we do the described "sorted" union
2726 we keep the newest locations in the beginning. */
2729 variable_union (variable
*src
, dataflow_set
*set
)
2735 dstp
= shared_hash_find_slot (set
->vars
, src
->dv
);
2736 if (!dstp
|| !*dstp
)
2740 dst_can_be_shared
= false;
2742 dstp
= shared_hash_find_slot_unshare (&set
->vars
, src
->dv
, INSERT
);
2746 /* Continue traversing the hash table. */
2752 gcc_assert (src
->n_var_parts
);
2753 gcc_checking_assert (src
->onepart
== dst
->onepart
);
2755 /* We can combine one-part variables very efficiently, because their
2756 entries are in canonical order. */
2759 location_chain
**nodep
, *dnode
, *snode
;
2761 gcc_assert (src
->n_var_parts
== 1
2762 && dst
->n_var_parts
== 1);
2764 snode
= src
->var_part
[0].loc_chain
;
2767 restart_onepart_unshared
:
2768 nodep
= &dst
->var_part
[0].loc_chain
;
2774 int r
= dnode
? loc_cmp (dnode
->loc
, snode
->loc
) : 1;
2778 location_chain
*nnode
;
2780 if (shared_var_p (dst
, set
->vars
))
2782 dstp
= unshare_variable (set
, dstp
, dst
,
2783 VAR_INIT_STATUS_INITIALIZED
);
2785 goto restart_onepart_unshared
;
2788 *nodep
= nnode
= new location_chain
;
2789 nnode
->loc
= snode
->loc
;
2790 nnode
->init
= snode
->init
;
2791 if (!snode
->set_src
|| MEM_P (snode
->set_src
))
2792 nnode
->set_src
= NULL
;
2794 nnode
->set_src
= snode
->set_src
;
2795 nnode
->next
= dnode
;
2799 gcc_checking_assert (rtx_equal_p (dnode
->loc
, snode
->loc
));
2802 snode
= snode
->next
;
2804 nodep
= &dnode
->next
;
2811 gcc_checking_assert (!src
->onepart
);
2813 /* Count the number of location parts, result is K. */
2814 for (i
= 0, j
= 0, k
= 0;
2815 i
< src
->n_var_parts
&& j
< dst
->n_var_parts
; k
++)
2817 if (VAR_PART_OFFSET (src
, i
) == VAR_PART_OFFSET (dst
, j
))
2822 else if (VAR_PART_OFFSET (src
, i
) < VAR_PART_OFFSET (dst
, j
))
2827 k
+= src
->n_var_parts
- i
;
2828 k
+= dst
->n_var_parts
- j
;
2830 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
2831 thus there are at most MAX_VAR_PARTS different offsets. */
2832 gcc_checking_assert (dst
->onepart
? k
== 1 : k
<= MAX_VAR_PARTS
);
2834 if (dst
->n_var_parts
!= k
&& shared_var_p (dst
, set
->vars
))
2836 dstp
= unshare_variable (set
, dstp
, dst
, VAR_INIT_STATUS_UNKNOWN
);
2840 i
= src
->n_var_parts
- 1;
2841 j
= dst
->n_var_parts
- 1;
2842 dst
->n_var_parts
= k
;
2844 for (k
--; k
>= 0; k
--)
2846 location_chain
*node
, *node2
;
2848 if (i
>= 0 && j
>= 0
2849 && VAR_PART_OFFSET (src
, i
) == VAR_PART_OFFSET (dst
, j
))
2851 /* Compute the "sorted" union of the chains, i.e. the locations which
2852 are in both chains go first, they are sorted by the sum of
2853 positions in the chains. */
2856 struct variable_union_info
*vui
;
2858 /* If DST is shared compare the location chains.
2859 If they are different we will modify the chain in DST with
2860 high probability so make a copy of DST. */
2861 if (shared_var_p (dst
, set
->vars
))
2863 for (node
= src
->var_part
[i
].loc_chain
,
2864 node2
= dst
->var_part
[j
].loc_chain
; node
&& node2
;
2865 node
= node
->next
, node2
= node2
->next
)
2867 if (!((REG_P (node2
->loc
)
2868 && REG_P (node
->loc
)
2869 && REGNO (node2
->loc
) == REGNO (node
->loc
))
2870 || rtx_equal_p (node2
->loc
, node
->loc
)))
2872 if (node2
->init
< node
->init
)
2873 node2
->init
= node
->init
;
2879 dstp
= unshare_variable (set
, dstp
, dst
,
2880 VAR_INIT_STATUS_UNKNOWN
);
2881 dst
= (variable
*)*dstp
;
2886 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2889 for (node
= dst
->var_part
[j
].loc_chain
; node
; node
= node
->next
)
2894 /* The most common case, much simpler, no qsort is needed. */
2895 location_chain
*dstnode
= dst
->var_part
[j
].loc_chain
;
2896 dst
->var_part
[k
].loc_chain
= dstnode
;
2897 VAR_PART_OFFSET (dst
, k
) = VAR_PART_OFFSET (dst
, j
);
2899 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2900 if (!((REG_P (dstnode
->loc
)
2901 && REG_P (node
->loc
)
2902 && REGNO (dstnode
->loc
) == REGNO (node
->loc
))
2903 || rtx_equal_p (dstnode
->loc
, node
->loc
)))
2905 location_chain
*new_node
;
2907 /* Copy the location from SRC. */
2908 new_node
= new location_chain
;
2909 new_node
->loc
= node
->loc
;
2910 new_node
->init
= node
->init
;
2911 if (!node
->set_src
|| MEM_P (node
->set_src
))
2912 new_node
->set_src
= NULL
;
2914 new_node
->set_src
= node
->set_src
;
2915 node2
->next
= new_node
;
2922 if (src_l
+ dst_l
> vui_allocated
)
2924 vui_allocated
= MAX (vui_allocated
* 2, src_l
+ dst_l
);
2925 vui_vec
= XRESIZEVEC (struct variable_union_info
, vui_vec
,
2930 /* Fill in the locations from DST. */
2931 for (node
= dst
->var_part
[j
].loc_chain
, jj
= 0; node
;
2932 node
= node
->next
, jj
++)
2935 vui
[jj
].pos_dst
= jj
;
2937 /* Pos plus value larger than a sum of 2 valid positions. */
2938 vui
[jj
].pos
= jj
+ src_l
+ dst_l
;
2941 /* Fill in the locations from SRC. */
2943 for (node
= src
->var_part
[i
].loc_chain
, ii
= 0; node
;
2944 node
= node
->next
, ii
++)
2946 /* Find location from NODE. */
2947 for (jj
= 0; jj
< dst_l
; jj
++)
2949 if ((REG_P (vui
[jj
].lc
->loc
)
2950 && REG_P (node
->loc
)
2951 && REGNO (vui
[jj
].lc
->loc
) == REGNO (node
->loc
))
2952 || rtx_equal_p (vui
[jj
].lc
->loc
, node
->loc
))
2954 vui
[jj
].pos
= jj
+ ii
;
2958 if (jj
>= dst_l
) /* The location has not been found. */
2960 location_chain
*new_node
;
2962 /* Copy the location from SRC. */
2963 new_node
= new location_chain
;
2964 new_node
->loc
= node
->loc
;
2965 new_node
->init
= node
->init
;
2966 if (!node
->set_src
|| MEM_P (node
->set_src
))
2967 new_node
->set_src
= NULL
;
2969 new_node
->set_src
= node
->set_src
;
2970 vui
[n
].lc
= new_node
;
2971 vui
[n
].pos_dst
= src_l
+ dst_l
;
2972 vui
[n
].pos
= ii
+ src_l
+ dst_l
;
2979 /* Special case still very common case. For dst_l == 2
2980 all entries dst_l ... n-1 are sorted, with for i >= dst_l
2981 vui[i].pos == i + src_l + dst_l. */
2982 if (vui
[0].pos
> vui
[1].pos
)
2984 /* Order should be 1, 0, 2... */
2985 dst
->var_part
[k
].loc_chain
= vui
[1].lc
;
2986 vui
[1].lc
->next
= vui
[0].lc
;
2989 vui
[0].lc
->next
= vui
[2].lc
;
2990 vui
[n
- 1].lc
->next
= NULL
;
2993 vui
[0].lc
->next
= NULL
;
2998 dst
->var_part
[k
].loc_chain
= vui
[0].lc
;
2999 if (n
>= 3 && vui
[2].pos
< vui
[1].pos
)
3001 /* Order should be 0, 2, 1, 3... */
3002 vui
[0].lc
->next
= vui
[2].lc
;
3003 vui
[2].lc
->next
= vui
[1].lc
;
3006 vui
[1].lc
->next
= vui
[3].lc
;
3007 vui
[n
- 1].lc
->next
= NULL
;
3010 vui
[1].lc
->next
= NULL
;
3015 /* Order should be 0, 1, 2... */
3017 vui
[n
- 1].lc
->next
= NULL
;
3020 for (; ii
< n
; ii
++)
3021 vui
[ii
- 1].lc
->next
= vui
[ii
].lc
;
3025 qsort (vui
, n
, sizeof (struct variable_union_info
),
3026 variable_union_info_cmp_pos
);
3028 /* Reconnect the nodes in sorted order. */
3029 for (ii
= 1; ii
< n
; ii
++)
3030 vui
[ii
- 1].lc
->next
= vui
[ii
].lc
;
3031 vui
[n
- 1].lc
->next
= NULL
;
3032 dst
->var_part
[k
].loc_chain
= vui
[0].lc
;
3035 VAR_PART_OFFSET (dst
, k
) = VAR_PART_OFFSET (dst
, j
);
3040 else if ((i
>= 0 && j
>= 0
3041 && VAR_PART_OFFSET (src
, i
) < VAR_PART_OFFSET (dst
, j
))
3044 dst
->var_part
[k
] = dst
->var_part
[j
];
3047 else if ((i
>= 0 && j
>= 0
3048 && VAR_PART_OFFSET (src
, i
) > VAR_PART_OFFSET (dst
, j
))
3051 location_chain
**nextp
;
3053 /* Copy the chain from SRC. */
3054 nextp
= &dst
->var_part
[k
].loc_chain
;
3055 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
3057 location_chain
*new_lc
;
3059 new_lc
= new location_chain
;
3060 new_lc
->next
= NULL
;
3061 new_lc
->init
= node
->init
;
3062 if (!node
->set_src
|| MEM_P (node
->set_src
))
3063 new_lc
->set_src
= NULL
;
3065 new_lc
->set_src
= node
->set_src
;
3066 new_lc
->loc
= node
->loc
;
3069 nextp
= &new_lc
->next
;
3072 VAR_PART_OFFSET (dst
, k
) = VAR_PART_OFFSET (src
, i
);
3075 dst
->var_part
[k
].cur_loc
= NULL
;
3078 if (flag_var_tracking_uninit
)
3079 for (i
= 0; i
< src
->n_var_parts
&& i
< dst
->n_var_parts
; i
++)
3081 location_chain
*node
, *node2
;
3082 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
3083 for (node2
= dst
->var_part
[i
].loc_chain
; node2
; node2
= node2
->next
)
3084 if (rtx_equal_p (node
->loc
, node2
->loc
))
3086 if (node
->init
> node2
->init
)
3087 node2
->init
= node
->init
;
3091 /* Continue traversing the hash table. */
3095 /* Compute union of dataflow sets SRC and DST and store it to DST. */
3098 dataflow_set_union (dataflow_set
*dst
, dataflow_set
*src
)
3102 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
3103 attrs_list_union (&dst
->regs
[i
], src
->regs
[i
]);
3105 if (dst
->vars
== empty_shared_hash
)
3107 shared_hash_destroy (dst
->vars
);
3108 dst
->vars
= shared_hash_copy (src
->vars
);
3112 variable_iterator_type hi
;
3115 FOR_EACH_HASH_TABLE_ELEMENT (*shared_hash_htab (src
->vars
),
3117 variable_union (var
, dst
);
3121 /* Whether the value is currently being expanded. */
3122 #define VALUE_RECURSED_INTO(x) \
3123 (RTL_FLAG_CHECK2 ("VALUE_RECURSED_INTO", (x), VALUE, DEBUG_EXPR)->used)
3125 /* Whether no expansion was found, saving useless lookups.
3126 It must only be set when VALUE_CHANGED is clear. */
3127 #define NO_LOC_P(x) \
3128 (RTL_FLAG_CHECK2 ("NO_LOC_P", (x), VALUE, DEBUG_EXPR)->return_val)
3130 /* Whether cur_loc in the value needs to be (re)computed. */
3131 #define VALUE_CHANGED(x) \
3132 (RTL_FLAG_CHECK1 ("VALUE_CHANGED", (x), VALUE)->frame_related)
3133 /* Whether cur_loc in the decl needs to be (re)computed. */
3134 #define DECL_CHANGED(x) TREE_VISITED (x)
3136 /* Record (if NEWV) that DV needs to have its cur_loc recomputed. For
3137 user DECLs, this means they're in changed_variables. Values and
3138 debug exprs may be left with this flag set if no user variable
3139 requires them to be evaluated. */
3142 set_dv_changed (decl_or_value dv
, bool newv
)
3144 switch (dv_onepart_p (dv
))
3148 NO_LOC_P (dv_as_value (dv
)) = false;
3149 VALUE_CHANGED (dv_as_value (dv
)) = newv
;
3154 NO_LOC_P (DECL_RTL_KNOWN_SET (dv_as_decl (dv
))) = false;
3155 /* Fall through... */
3158 DECL_CHANGED (dv_as_decl (dv
)) = newv
;
3163 /* Return true if DV needs to have its cur_loc recomputed. */
3166 dv_changed_p (decl_or_value dv
)
3168 return (dv_is_value_p (dv
)
3169 ? VALUE_CHANGED (dv_as_value (dv
))
3170 : DECL_CHANGED (dv_as_decl (dv
)));
3173 /* Return a location list node whose loc is rtx_equal to LOC, in the
3174 location list of a one-part variable or value VAR, or in that of
3175 any values recursively mentioned in the location lists. VARS must
3176 be in star-canonical form. */
3178 static location_chain
*
3179 find_loc_in_1pdv (rtx loc
, variable
*var
, variable_table_type
*vars
)
3181 location_chain
*node
;
3182 enum rtx_code loc_code
;
3187 gcc_checking_assert (var
->onepart
);
3189 if (!var
->n_var_parts
)
3192 gcc_checking_assert (loc
!= dv_as_opaque (var
->dv
));
3194 loc_code
= GET_CODE (loc
);
3195 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3200 if (GET_CODE (node
->loc
) != loc_code
)
3202 if (GET_CODE (node
->loc
) != VALUE
)
3205 else if (loc
== node
->loc
)
3207 else if (loc_code
!= VALUE
)
3209 if (rtx_equal_p (loc
, node
->loc
))
3214 /* Since we're in star-canonical form, we don't need to visit
3215 non-canonical nodes: one-part variables and non-canonical
3216 values would only point back to the canonical node. */
3217 if (dv_is_value_p (var
->dv
)
3218 && !canon_value_cmp (node
->loc
, dv_as_value (var
->dv
)))
3220 /* Skip all subsequent VALUEs. */
3221 while (node
->next
&& GET_CODE (node
->next
->loc
) == VALUE
)
3224 gcc_checking_assert (!canon_value_cmp (node
->loc
,
3225 dv_as_value (var
->dv
)));
3226 if (loc
== node
->loc
)
3232 gcc_checking_assert (node
== var
->var_part
[0].loc_chain
);
3233 gcc_checking_assert (!node
->next
);
3235 dv
= dv_from_value (node
->loc
);
3236 rvar
= vars
->find_with_hash (dv
, dv_htab_hash (dv
));
3237 return find_loc_in_1pdv (loc
, rvar
, vars
);
3240 /* ??? Gotta look in cselib_val locations too. */
3245 /* Hash table iteration argument passed to variable_merge. */
3248 /* The set in which the merge is to be inserted. */
3250 /* The set that we're iterating in. */
3252 /* The set that may contain the other dv we are to merge with. */
3254 /* Number of onepart dvs in src. */
3255 int src_onepart_cnt
;
3258 /* Insert LOC in *DNODE, if it's not there yet. The list must be in
3259 loc_cmp order, and it is maintained as such. */
3262 insert_into_intersection (location_chain
**nodep
, rtx loc
,
3263 enum var_init_status status
)
3265 location_chain
*node
;
3268 for (node
= *nodep
; node
; nodep
= &node
->next
, node
= *nodep
)
3269 if ((r
= loc_cmp (node
->loc
, loc
)) == 0)
3271 node
->init
= MIN (node
->init
, status
);
3277 node
= new location_chain
;
3280 node
->set_src
= NULL
;
3281 node
->init
= status
;
3282 node
->next
= *nodep
;
3286 /* Insert in DEST the intersection of the locations present in both
3287 S1NODE and S2VAR, directly or indirectly. S1NODE is from a
3288 variable in DSM->cur, whereas S2VAR is from DSM->src. dvar is in
3292 intersect_loc_chains (rtx val
, location_chain
**dest
, struct dfset_merge
*dsm
,
3293 location_chain
*s1node
, variable
*s2var
)
3295 dataflow_set
*s1set
= dsm
->cur
;
3296 dataflow_set
*s2set
= dsm
->src
;
3297 location_chain
*found
;
3301 location_chain
*s2node
;
3303 gcc_checking_assert (s2var
->onepart
);
3305 if (s2var
->n_var_parts
)
3307 s2node
= s2var
->var_part
[0].loc_chain
;
3309 for (; s1node
&& s2node
;
3310 s1node
= s1node
->next
, s2node
= s2node
->next
)
3311 if (s1node
->loc
!= s2node
->loc
)
3313 else if (s1node
->loc
== val
)
3316 insert_into_intersection (dest
, s1node
->loc
,
3317 MIN (s1node
->init
, s2node
->init
));
3321 for (; s1node
; s1node
= s1node
->next
)
3323 if (s1node
->loc
== val
)
3326 if ((found
= find_loc_in_1pdv (s1node
->loc
, s2var
,
3327 shared_hash_htab (s2set
->vars
))))
3329 insert_into_intersection (dest
, s1node
->loc
,
3330 MIN (s1node
->init
, found
->init
));
3334 if (GET_CODE (s1node
->loc
) == VALUE
3335 && !VALUE_RECURSED_INTO (s1node
->loc
))
3337 decl_or_value dv
= dv_from_value (s1node
->loc
);
3338 variable
*svar
= shared_hash_find (s1set
->vars
, dv
);
3341 if (svar
->n_var_parts
== 1)
3343 VALUE_RECURSED_INTO (s1node
->loc
) = true;
3344 intersect_loc_chains (val
, dest
, dsm
,
3345 svar
->var_part
[0].loc_chain
,
3347 VALUE_RECURSED_INTO (s1node
->loc
) = false;
3352 /* ??? gotta look in cselib_val locations too. */
3354 /* ??? if the location is equivalent to any location in src,
3355 searched recursively
3357 add to dst the values needed to represent the equivalence
3359 telling whether locations S is equivalent to another dv's
3362 for each location D in the list
3364 if S and D satisfy rtx_equal_p, then it is present
3366 else if D is a value, recurse without cycles
3368 else if S and D have the same CODE and MODE
3370 for each operand oS and the corresponding oD
3372 if oS and oD are not equivalent, then S an D are not equivalent
3374 else if they are RTX vectors
3376 if any vector oS element is not equivalent to its respective oD,
3377 then S and D are not equivalent
3385 /* Return -1 if X should be before Y in a location list for a 1-part
3386 variable, 1 if Y should be before X, and 0 if they're equivalent
3387 and should not appear in the list. */
3390 loc_cmp (rtx x
, rtx y
)
3393 RTX_CODE code
= GET_CODE (x
);
3403 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
3404 if (REGNO (x
) == REGNO (y
))
3406 else if (REGNO (x
) < REGNO (y
))
3419 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
3420 return loc_cmp (XEXP (x
, 0), XEXP (y
, 0));
3426 if (GET_CODE (x
) == VALUE
)
3428 if (GET_CODE (y
) != VALUE
)
3430 /* Don't assert the modes are the same, that is true only
3431 when not recursing. (subreg:QI (value:SI 1:1) 0)
3432 and (subreg:QI (value:DI 2:2) 0) can be compared,
3433 even when the modes are different. */
3434 if (canon_value_cmp (x
, y
))
3440 if (GET_CODE (y
) == VALUE
)
3443 /* Entry value is the least preferable kind of expression. */
3444 if (GET_CODE (x
) == ENTRY_VALUE
)
3446 if (GET_CODE (y
) != ENTRY_VALUE
)
3448 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
3449 return loc_cmp (ENTRY_VALUE_EXP (x
), ENTRY_VALUE_EXP (y
));
3452 if (GET_CODE (y
) == ENTRY_VALUE
)
3455 if (GET_CODE (x
) == GET_CODE (y
))
3456 /* Compare operands below. */;
3457 else if (GET_CODE (x
) < GET_CODE (y
))
3462 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
3464 if (GET_CODE (x
) == DEBUG_EXPR
)
3466 if (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x
))
3467 < DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y
)))
3469 gcc_checking_assert (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x
))
3470 > DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y
)));
3474 fmt
= GET_RTX_FORMAT (code
);
3475 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
3479 if (XWINT (x
, i
) == XWINT (y
, i
))
3481 else if (XWINT (x
, i
) < XWINT (y
, i
))
3488 if (XINT (x
, i
) == XINT (y
, i
))
3490 else if (XINT (x
, i
) < XINT (y
, i
))
3497 /* Compare the vector length first. */
3498 if (XVECLEN (x
, i
) == XVECLEN (y
, i
))
3499 /* Compare the vectors elements. */;
3500 else if (XVECLEN (x
, i
) < XVECLEN (y
, i
))
3505 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3506 if ((r
= loc_cmp (XVECEXP (x
, i
, j
),
3507 XVECEXP (y
, i
, j
))))
3512 if ((r
= loc_cmp (XEXP (x
, i
), XEXP (y
, i
))))
3518 if (XSTR (x
, i
) == XSTR (y
, i
))
3524 if ((r
= strcmp (XSTR (x
, i
), XSTR (y
, i
))) == 0)
3532 /* These are just backpointers, so they don't matter. */
3539 /* It is believed that rtx's at this level will never
3540 contain anything but integers and other rtx's,
3541 except for within LABEL_REFs and SYMBOL_REFs. */
3545 if (CONST_WIDE_INT_P (x
))
3547 /* Compare the vector length first. */
3548 if (CONST_WIDE_INT_NUNITS (x
) >= CONST_WIDE_INT_NUNITS (y
))
3550 else if (CONST_WIDE_INT_NUNITS (x
) < CONST_WIDE_INT_NUNITS (y
))
3553 /* Compare the vectors elements. */;
3554 for (j
= CONST_WIDE_INT_NUNITS (x
) - 1; j
>= 0 ; j
--)
3556 if (CONST_WIDE_INT_ELT (x
, j
) < CONST_WIDE_INT_ELT (y
, j
))
3558 if (CONST_WIDE_INT_ELT (x
, j
) > CONST_WIDE_INT_ELT (y
, j
))
3566 /* Check the order of entries in one-part variables. */
3569 canonicalize_loc_order_check (variable
**slot
,
3570 dataflow_set
*data ATTRIBUTE_UNUSED
)
3572 variable
*var
= *slot
;
3573 location_chain
*node
, *next
;
3575 #ifdef ENABLE_RTL_CHECKING
3577 for (i
= 0; i
< var
->n_var_parts
; i
++)
3578 gcc_assert (var
->var_part
[0].cur_loc
== NULL
);
3579 gcc_assert (!var
->in_changed_variables
);
3585 gcc_assert (var
->n_var_parts
== 1);
3586 node
= var
->var_part
[0].loc_chain
;
3589 while ((next
= node
->next
))
3591 gcc_assert (loc_cmp (node
->loc
, next
->loc
) < 0);
3598 /* Mark with VALUE_RECURSED_INTO values that have neighbors that are
3599 more likely to be chosen as canonical for an equivalence set.
3600 Ensure less likely values can reach more likely neighbors, making
3601 the connections bidirectional. */
3604 canonicalize_values_mark (variable
**slot
, dataflow_set
*set
)
3606 variable
*var
= *slot
;
3607 decl_or_value dv
= var
->dv
;
3609 location_chain
*node
;
3611 if (!dv_is_value_p (dv
))
3614 gcc_checking_assert (var
->n_var_parts
== 1);
3616 val
= dv_as_value (dv
);
3618 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3619 if (GET_CODE (node
->loc
) == VALUE
)
3621 if (canon_value_cmp (node
->loc
, val
))
3622 VALUE_RECURSED_INTO (val
) = true;
3625 decl_or_value odv
= dv_from_value (node
->loc
);
3627 oslot
= shared_hash_find_slot_noinsert (set
->vars
, odv
);
3629 set_slot_part (set
, val
, oslot
, odv
, 0,
3630 node
->init
, NULL_RTX
);
3632 VALUE_RECURSED_INTO (node
->loc
) = true;
3639 /* Remove redundant entries from equivalence lists in onepart
3640 variables, canonicalizing equivalence sets into star shapes. */
3643 canonicalize_values_star (variable
**slot
, dataflow_set
*set
)
3645 variable
*var
= *slot
;
3646 decl_or_value dv
= var
->dv
;
3647 location_chain
*node
;
3657 gcc_checking_assert (var
->n_var_parts
== 1);
3659 if (dv_is_value_p (dv
))
3661 cval
= dv_as_value (dv
);
3662 if (!VALUE_RECURSED_INTO (cval
))
3664 VALUE_RECURSED_INTO (cval
) = false;
3674 gcc_assert (var
->n_var_parts
== 1);
3676 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3677 if (GET_CODE (node
->loc
) == VALUE
)
3680 if (VALUE_RECURSED_INTO (node
->loc
))
3682 if (canon_value_cmp (node
->loc
, cval
))
3691 if (!has_marks
|| dv_is_decl_p (dv
))
3694 /* Keep it marked so that we revisit it, either after visiting a
3695 child node, or after visiting a new parent that might be
3697 VALUE_RECURSED_INTO (val
) = true;
3699 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3700 if (GET_CODE (node
->loc
) == VALUE
3701 && VALUE_RECURSED_INTO (node
->loc
))
3705 VALUE_RECURSED_INTO (cval
) = false;
3706 dv
= dv_from_value (cval
);
3707 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
3710 gcc_assert (dv_is_decl_p (var
->dv
));
3711 /* The canonical value was reset and dropped.
3713 clobber_variable_part (set
, NULL
, var
->dv
, 0, NULL
);
3717 gcc_assert (dv_is_value_p (var
->dv
));
3718 if (var
->n_var_parts
== 0)
3720 gcc_assert (var
->n_var_parts
== 1);
3724 VALUE_RECURSED_INTO (val
) = false;
3729 /* Push values to the canonical one. */
3730 cdv
= dv_from_value (cval
);
3731 cslot
= shared_hash_find_slot_noinsert (set
->vars
, cdv
);
3733 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3734 if (node
->loc
!= cval
)
3736 cslot
= set_slot_part (set
, node
->loc
, cslot
, cdv
, 0,
3737 node
->init
, NULL_RTX
);
3738 if (GET_CODE (node
->loc
) == VALUE
)
3740 decl_or_value ndv
= dv_from_value (node
->loc
);
3742 set_variable_part (set
, cval
, ndv
, 0, node
->init
, NULL_RTX
,
3745 if (canon_value_cmp (node
->loc
, val
))
3747 /* If it could have been a local minimum, it's not any more,
3748 since it's now neighbor to cval, so it may have to push
3749 to it. Conversely, if it wouldn't have prevailed over
3750 val, then whatever mark it has is fine: if it was to
3751 push, it will now push to a more canonical node, but if
3752 it wasn't, then it has already pushed any values it might
3754 VALUE_RECURSED_INTO (node
->loc
) = true;
3755 /* Make sure we visit node->loc by ensuring we cval is
3757 VALUE_RECURSED_INTO (cval
) = true;
3759 else if (!VALUE_RECURSED_INTO (node
->loc
))
3760 /* If we have no need to "recurse" into this node, it's
3761 already "canonicalized", so drop the link to the old
3763 clobber_variable_part (set
, cval
, ndv
, 0, NULL
);
3765 else if (GET_CODE (node
->loc
) == REG
)
3767 attrs
*list
= set
->regs
[REGNO (node
->loc
)], **listp
;
3769 /* Change an existing attribute referring to dv so that it
3770 refers to cdv, removing any duplicate this might
3771 introduce, and checking that no previous duplicates
3772 existed, all in a single pass. */
3776 if (list
->offset
== 0
3777 && (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
)
3778 || dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
)))
3785 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
))
3788 for (listp
= &list
->next
; (list
= *listp
); listp
= &list
->next
)
3793 if (dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
))
3795 *listp
= list
->next
;
3801 gcc_assert (dv_as_opaque (list
->dv
) != dv_as_opaque (dv
));
3804 else if (dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
))
3806 for (listp
= &list
->next
; (list
= *listp
); listp
= &list
->next
)
3811 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
))
3813 *listp
= list
->next
;
3819 gcc_assert (dv_as_opaque (list
->dv
) != dv_as_opaque (cdv
));
3828 if (list
->offset
== 0
3829 && (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
)
3830 || dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
)))
3839 set_slot_part (set
, val
, cslot
, cdv
, 0,
3840 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
);
3842 slot
= clobber_slot_part (set
, cval
, slot
, 0, NULL
);
3844 /* Variable may have been unshared. */
3846 gcc_checking_assert (var
->n_var_parts
&& var
->var_part
[0].loc_chain
->loc
== cval
3847 && var
->var_part
[0].loc_chain
->next
== NULL
);
3849 if (VALUE_RECURSED_INTO (cval
))
3850 goto restart_with_cval
;
3855 /* Bind one-part variables to the canonical value in an equivalence
3856 set. Not doing this causes dataflow convergence failure in rare
3857 circumstances, see PR42873. Unfortunately we can't do this
3858 efficiently as part of canonicalize_values_star, since we may not
3859 have determined or even seen the canonical value of a set when we
3860 get to a variable that references another member of the set. */
3863 canonicalize_vars_star (variable
**slot
, dataflow_set
*set
)
3865 variable
*var
= *slot
;
3866 decl_or_value dv
= var
->dv
;
3867 location_chain
*node
;
3872 location_chain
*cnode
;
3874 if (!var
->onepart
|| var
->onepart
== ONEPART_VALUE
)
3877 gcc_assert (var
->n_var_parts
== 1);
3879 node
= var
->var_part
[0].loc_chain
;
3881 if (GET_CODE (node
->loc
) != VALUE
)
3884 gcc_assert (!node
->next
);
3887 /* Push values to the canonical one. */
3888 cdv
= dv_from_value (cval
);
3889 cslot
= shared_hash_find_slot_noinsert (set
->vars
, cdv
);
3893 gcc_assert (cvar
->n_var_parts
== 1);
3895 cnode
= cvar
->var_part
[0].loc_chain
;
3897 /* CVAL is canonical if its value list contains non-VALUEs or VALUEs
3898 that are not “more canonical” than it. */
3899 if (GET_CODE (cnode
->loc
) != VALUE
3900 || !canon_value_cmp (cnode
->loc
, cval
))
3903 /* CVAL was found to be non-canonical. Change the variable to point
3904 to the canonical VALUE. */
3905 gcc_assert (!cnode
->next
);
3908 slot
= set_slot_part (set
, cval
, slot
, dv
, 0,
3909 node
->init
, node
->set_src
);
3910 clobber_slot_part (set
, cval
, slot
, 0, node
->set_src
);
3915 /* Combine variable or value in *S1SLOT (in DSM->cur) with the
3916 corresponding entry in DSM->src. Multi-part variables are combined
3917 with variable_union, whereas onepart dvs are combined with
3921 variable_merge_over_cur (variable
*s1var
, struct dfset_merge
*dsm
)
3923 dataflow_set
*dst
= dsm
->dst
;
3925 variable
*s2var
, *dvar
= NULL
;
3926 decl_or_value dv
= s1var
->dv
;
3927 onepart_enum onepart
= s1var
->onepart
;
3930 location_chain
*node
, **nodep
;
3932 /* If the incoming onepart variable has an empty location list, then
3933 the intersection will be just as empty. For other variables,
3934 it's always union. */
3935 gcc_checking_assert (s1var
->n_var_parts
3936 && s1var
->var_part
[0].loc_chain
);
3939 return variable_union (s1var
, dst
);
3941 gcc_checking_assert (s1var
->n_var_parts
== 1);
3943 dvhash
= dv_htab_hash (dv
);
3944 if (dv_is_value_p (dv
))
3945 val
= dv_as_value (dv
);
3949 s2var
= shared_hash_find_1 (dsm
->src
->vars
, dv
, dvhash
);
3952 dst_can_be_shared
= false;
3956 dsm
->src_onepart_cnt
--;
3957 gcc_assert (s2var
->var_part
[0].loc_chain
3958 && s2var
->onepart
== onepart
3959 && s2var
->n_var_parts
== 1);
3961 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
3965 gcc_assert (dvar
->refcount
== 1
3966 && dvar
->onepart
== onepart
3967 && dvar
->n_var_parts
== 1);
3968 nodep
= &dvar
->var_part
[0].loc_chain
;
3976 if (!dstslot
&& !onepart_variable_different_p (s1var
, s2var
))
3978 dstslot
= shared_hash_find_slot_unshare_1 (&dst
->vars
, dv
,
3980 *dstslot
= dvar
= s2var
;
3985 dst_can_be_shared
= false;
3987 intersect_loc_chains (val
, nodep
, dsm
,
3988 s1var
->var_part
[0].loc_chain
, s2var
);
3994 dvar
= onepart_pool_allocate (onepart
);
3997 dvar
->n_var_parts
= 1;
3998 dvar
->onepart
= onepart
;
3999 dvar
->in_changed_variables
= false;
4000 dvar
->var_part
[0].loc_chain
= node
;
4001 dvar
->var_part
[0].cur_loc
= NULL
;
4003 VAR_LOC_1PAUX (dvar
) = NULL
;
4005 VAR_PART_OFFSET (dvar
, 0) = 0;
4008 = shared_hash_find_slot_unshare_1 (&dst
->vars
, dv
, dvhash
,
4010 gcc_assert (!*dstslot
);
4018 nodep
= &dvar
->var_part
[0].loc_chain
;
4019 while ((node
= *nodep
))
4021 location_chain
**nextp
= &node
->next
;
4023 if (GET_CODE (node
->loc
) == REG
)
4027 for (list
= dst
->regs
[REGNO (node
->loc
)]; list
; list
= list
->next
)
4028 if (GET_MODE (node
->loc
) == GET_MODE (list
->loc
)
4029 && dv_is_value_p (list
->dv
))
4033 attrs_list_insert (&dst
->regs
[REGNO (node
->loc
)],
4035 /* If this value became canonical for another value that had
4036 this register, we want to leave it alone. */
4037 else if (dv_as_value (list
->dv
) != val
)
4039 dstslot
= set_slot_part (dst
, dv_as_value (list
->dv
),
4041 node
->init
, NULL_RTX
);
4042 dstslot
= delete_slot_part (dst
, node
->loc
, dstslot
, 0);
4044 /* Since nextp points into the removed node, we can't
4045 use it. The pointer to the next node moved to nodep.
4046 However, if the variable we're walking is unshared
4047 during our walk, we'll keep walking the location list
4048 of the previously-shared variable, in which case the
4049 node won't have been removed, and we'll want to skip
4050 it. That's why we test *nodep here. */
4056 /* Canonicalization puts registers first, so we don't have to
4062 if (dvar
!= *dstslot
)
4064 nodep
= &dvar
->var_part
[0].loc_chain
;
4068 /* Mark all referenced nodes for canonicalization, and make sure
4069 we have mutual equivalence links. */
4070 VALUE_RECURSED_INTO (val
) = true;
4071 for (node
= *nodep
; node
; node
= node
->next
)
4072 if (GET_CODE (node
->loc
) == VALUE
)
4074 VALUE_RECURSED_INTO (node
->loc
) = true;
4075 set_variable_part (dst
, val
, dv_from_value (node
->loc
), 0,
4076 node
->init
, NULL
, INSERT
);
4079 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
4080 gcc_assert (*dstslot
== dvar
);
4081 canonicalize_values_star (dstslot
, dst
);
4082 gcc_checking_assert (dstslot
4083 == shared_hash_find_slot_noinsert_1 (dst
->vars
,
4089 bool has_value
= false, has_other
= false;
4091 /* If we have one value and anything else, we're going to
4092 canonicalize this, so make sure all values have an entry in
4093 the table and are marked for canonicalization. */
4094 for (node
= *nodep
; node
; node
= node
->next
)
4096 if (GET_CODE (node
->loc
) == VALUE
)
4098 /* If this was marked during register canonicalization,
4099 we know we have to canonicalize values. */
4114 if (has_value
&& has_other
)
4116 for (node
= *nodep
; node
; node
= node
->next
)
4118 if (GET_CODE (node
->loc
) == VALUE
)
4120 decl_or_value dv
= dv_from_value (node
->loc
);
4121 variable
**slot
= NULL
;
4123 if (shared_hash_shared (dst
->vars
))
4124 slot
= shared_hash_find_slot_noinsert (dst
->vars
, dv
);
4126 slot
= shared_hash_find_slot_unshare (&dst
->vars
, dv
,
4130 variable
*var
= onepart_pool_allocate (ONEPART_VALUE
);
4133 var
->n_var_parts
= 1;
4134 var
->onepart
= ONEPART_VALUE
;
4135 var
->in_changed_variables
= false;
4136 var
->var_part
[0].loc_chain
= NULL
;
4137 var
->var_part
[0].cur_loc
= NULL
;
4138 VAR_LOC_1PAUX (var
) = NULL
;
4142 VALUE_RECURSED_INTO (node
->loc
) = true;
4146 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
4147 gcc_assert (*dstslot
== dvar
);
4148 canonicalize_values_star (dstslot
, dst
);
4149 gcc_checking_assert (dstslot
4150 == shared_hash_find_slot_noinsert_1 (dst
->vars
,
4156 if (!onepart_variable_different_p (dvar
, s2var
))
4158 variable_htab_free (dvar
);
4159 *dstslot
= dvar
= s2var
;
4162 else if (s2var
!= s1var
&& !onepart_variable_different_p (dvar
, s1var
))
4164 variable_htab_free (dvar
);
4165 *dstslot
= dvar
= s1var
;
4167 dst_can_be_shared
= false;
4170 dst_can_be_shared
= false;
4175 /* Copy s2slot (in DSM->src) to DSM->dst if the variable is a
4176 multi-part variable. Unions of multi-part variables and
4177 intersections of one-part ones will be handled in
4178 variable_merge_over_cur(). */
4181 variable_merge_over_src (variable
*s2var
, struct dfset_merge
*dsm
)
4183 dataflow_set
*dst
= dsm
->dst
;
4184 decl_or_value dv
= s2var
->dv
;
4186 if (!s2var
->onepart
)
4188 variable
**dstp
= shared_hash_find_slot (dst
->vars
, dv
);
4194 dsm
->src_onepart_cnt
++;
4198 /* Combine dataflow set information from SRC2 into DST, using PDST
4199 to carry over information across passes. */
4202 dataflow_set_merge (dataflow_set
*dst
, dataflow_set
*src2
)
4204 dataflow_set cur
= *dst
;
4205 dataflow_set
*src1
= &cur
;
4206 struct dfset_merge dsm
;
4208 size_t src1_elems
, src2_elems
;
4209 variable_iterator_type hi
;
4212 src1_elems
= shared_hash_htab (src1
->vars
)->elements ();
4213 src2_elems
= shared_hash_htab (src2
->vars
)->elements ();
4214 dataflow_set_init (dst
);
4215 dst
->stack_adjust
= cur
.stack_adjust
;
4216 shared_hash_destroy (dst
->vars
);
4217 dst
->vars
= new shared_hash
;
4218 dst
->vars
->refcount
= 1;
4219 dst
->vars
->htab
= new variable_table_type (MAX (src1_elems
, src2_elems
));
4221 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4222 attrs_list_mpdv_union (&dst
->regs
[i
], src1
->regs
[i
], src2
->regs
[i
]);
4227 dsm
.src_onepart_cnt
= 0;
4229 FOR_EACH_HASH_TABLE_ELEMENT (*shared_hash_htab (dsm
.src
->vars
),
4231 variable_merge_over_src (var
, &dsm
);
4232 FOR_EACH_HASH_TABLE_ELEMENT (*shared_hash_htab (dsm
.cur
->vars
),
4234 variable_merge_over_cur (var
, &dsm
);
4236 if (dsm
.src_onepart_cnt
)
4237 dst_can_be_shared
= false;
4239 dataflow_set_destroy (src1
);
4242 /* Mark register equivalences. */
4245 dataflow_set_equiv_regs (dataflow_set
*set
)
4248 attrs
*list
, **listp
;
4250 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4252 rtx canon
[NUM_MACHINE_MODES
];
4254 /* If the list is empty or one entry, no need to canonicalize
4256 if (set
->regs
[i
] == NULL
|| set
->regs
[i
]->next
== NULL
)
4259 memset (canon
, 0, sizeof (canon
));
4261 for (list
= set
->regs
[i
]; list
; list
= list
->next
)
4262 if (list
->offset
== 0 && dv_is_value_p (list
->dv
))
4264 rtx val
= dv_as_value (list
->dv
);
4265 rtx
*cvalp
= &canon
[(int)GET_MODE (val
)];
4268 if (canon_value_cmp (val
, cval
))
4272 for (list
= set
->regs
[i
]; list
; list
= list
->next
)
4273 if (list
->offset
== 0 && dv_onepart_p (list
->dv
))
4275 rtx cval
= canon
[(int)GET_MODE (list
->loc
)];
4280 if (dv_is_value_p (list
->dv
))
4282 rtx val
= dv_as_value (list
->dv
);
4287 VALUE_RECURSED_INTO (val
) = true;
4288 set_variable_part (set
, val
, dv_from_value (cval
), 0,
4289 VAR_INIT_STATUS_INITIALIZED
,
4293 VALUE_RECURSED_INTO (cval
) = true;
4294 set_variable_part (set
, cval
, list
->dv
, 0,
4295 VAR_INIT_STATUS_INITIALIZED
, NULL
, NO_INSERT
);
4298 for (listp
= &set
->regs
[i
]; (list
= *listp
);
4299 listp
= list
? &list
->next
: listp
)
4300 if (list
->offset
== 0 && dv_onepart_p (list
->dv
))
4302 rtx cval
= canon
[(int)GET_MODE (list
->loc
)];
4308 if (dv_is_value_p (list
->dv
))
4310 rtx val
= dv_as_value (list
->dv
);
4311 if (!VALUE_RECURSED_INTO (val
))
4315 slot
= shared_hash_find_slot_noinsert (set
->vars
, list
->dv
);
4316 canonicalize_values_star (slot
, set
);
4323 /* Remove any redundant values in the location list of VAR, which must
4324 be unshared and 1-part. */
4327 remove_duplicate_values (variable
*var
)
4329 location_chain
*node
, **nodep
;
4331 gcc_assert (var
->onepart
);
4332 gcc_assert (var
->n_var_parts
== 1);
4333 gcc_assert (var
->refcount
== 1);
4335 for (nodep
= &var
->var_part
[0].loc_chain
; (node
= *nodep
); )
4337 if (GET_CODE (node
->loc
) == VALUE
)
4339 if (VALUE_RECURSED_INTO (node
->loc
))
4341 /* Remove duplicate value node. */
4342 *nodep
= node
->next
;
4347 VALUE_RECURSED_INTO (node
->loc
) = true;
4349 nodep
= &node
->next
;
4352 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
4353 if (GET_CODE (node
->loc
) == VALUE
)
4355 gcc_assert (VALUE_RECURSED_INTO (node
->loc
));
4356 VALUE_RECURSED_INTO (node
->loc
) = false;
4361 /* Hash table iteration argument passed to variable_post_merge. */
4362 struct dfset_post_merge
4364 /* The new input set for the current block. */
4366 /* Pointer to the permanent input set for the current block, or
4368 dataflow_set
**permp
;
4371 /* Create values for incoming expressions associated with one-part
4372 variables that don't have value numbers for them. */
4375 variable_post_merge_new_vals (variable
**slot
, dfset_post_merge
*dfpm
)
4377 dataflow_set
*set
= dfpm
->set
;
4378 variable
*var
= *slot
;
4379 location_chain
*node
;
4381 if (!var
->onepart
|| !var
->n_var_parts
)
4384 gcc_assert (var
->n_var_parts
== 1);
4386 if (dv_is_decl_p (var
->dv
))
4388 bool check_dupes
= false;
4391 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
4393 if (GET_CODE (node
->loc
) == VALUE
)
4394 gcc_assert (!VALUE_RECURSED_INTO (node
->loc
));
4395 else if (GET_CODE (node
->loc
) == REG
)
4397 attrs
*att
, **attp
, **curp
= NULL
;
4399 if (var
->refcount
!= 1)
4401 slot
= unshare_variable (set
, slot
, var
,
4402 VAR_INIT_STATUS_INITIALIZED
);
4407 for (attp
= &set
->regs
[REGNO (node
->loc
)]; (att
= *attp
);
4409 if (att
->offset
== 0
4410 && GET_MODE (att
->loc
) == GET_MODE (node
->loc
))
4412 if (dv_is_value_p (att
->dv
))
4414 rtx cval
= dv_as_value (att
->dv
);
4419 else if (dv_as_opaque (att
->dv
) == dv_as_opaque (var
->dv
))
4427 if ((*curp
)->offset
== 0
4428 && GET_MODE ((*curp
)->loc
) == GET_MODE (node
->loc
)
4429 && dv_as_opaque ((*curp
)->dv
) == dv_as_opaque (var
->dv
))
4432 curp
= &(*curp
)->next
;
4443 *dfpm
->permp
= XNEW (dataflow_set
);
4444 dataflow_set_init (*dfpm
->permp
);
4447 for (att
= (*dfpm
->permp
)->regs
[REGNO (node
->loc
)];
4448 att
; att
= att
->next
)
4449 if (GET_MODE (att
->loc
) == GET_MODE (node
->loc
))
4451 gcc_assert (att
->offset
== 0
4452 && dv_is_value_p (att
->dv
));
4453 val_reset (set
, att
->dv
);
4460 cval
= dv_as_value (cdv
);
4464 /* Create a unique value to hold this register,
4465 that ought to be found and reused in
4466 subsequent rounds. */
4468 gcc_assert (!cselib_lookup (node
->loc
,
4469 GET_MODE (node
->loc
), 0,
4471 v
= cselib_lookup (node
->loc
, GET_MODE (node
->loc
), 1,
4473 cselib_preserve_value (v
);
4474 cselib_invalidate_rtx (node
->loc
);
4476 cdv
= dv_from_value (cval
);
4479 "Created new value %u:%u for reg %i\n",
4480 v
->uid
, v
->hash
, REGNO (node
->loc
));
4483 var_reg_decl_set (*dfpm
->permp
, node
->loc
,
4484 VAR_INIT_STATUS_INITIALIZED
,
4485 cdv
, 0, NULL
, INSERT
);
4491 /* Remove attribute referring to the decl, which now
4492 uses the value for the register, already existing or
4493 to be added when we bring perm in. */
4501 remove_duplicate_values (var
);
4507 /* Reset values in the permanent set that are not associated with the
4508 chosen expression. */
4511 variable_post_merge_perm_vals (variable
**pslot
, dfset_post_merge
*dfpm
)
4513 dataflow_set
*set
= dfpm
->set
;
4514 variable
*pvar
= *pslot
, *var
;
4515 location_chain
*pnode
;
4519 gcc_assert (dv_is_value_p (pvar
->dv
)
4520 && pvar
->n_var_parts
== 1);
4521 pnode
= pvar
->var_part
[0].loc_chain
;
4524 && REG_P (pnode
->loc
));
4528 var
= shared_hash_find (set
->vars
, dv
);
4531 /* Although variable_post_merge_new_vals may have made decls
4532 non-star-canonical, values that pre-existed in canonical form
4533 remain canonical, and newly-created values reference a single
4534 REG, so they are canonical as well. Since VAR has the
4535 location list for a VALUE, using find_loc_in_1pdv for it is
4536 fine, since VALUEs don't map back to DECLs. */
4537 if (find_loc_in_1pdv (pnode
->loc
, var
, shared_hash_htab (set
->vars
)))
4539 val_reset (set
, dv
);
4542 for (att
= set
->regs
[REGNO (pnode
->loc
)]; att
; att
= att
->next
)
4543 if (att
->offset
== 0
4544 && GET_MODE (att
->loc
) == GET_MODE (pnode
->loc
)
4545 && dv_is_value_p (att
->dv
))
4548 /* If there is a value associated with this register already, create
4550 if (att
&& dv_as_value (att
->dv
) != dv_as_value (dv
))
4552 rtx cval
= dv_as_value (att
->dv
);
4553 set_variable_part (set
, cval
, dv
, 0, pnode
->init
, NULL
, INSERT
);
4554 set_variable_part (set
, dv_as_value (dv
), att
->dv
, 0, pnode
->init
,
4559 attrs_list_insert (&set
->regs
[REGNO (pnode
->loc
)],
4561 variable_union (pvar
, set
);
4567 /* Just checking stuff and registering register attributes for
4571 dataflow_post_merge_adjust (dataflow_set
*set
, dataflow_set
**permp
)
4573 struct dfset_post_merge dfpm
;
4578 shared_hash_htab (set
->vars
)
4579 ->traverse
<dfset_post_merge
*, variable_post_merge_new_vals
> (&dfpm
);
4581 shared_hash_htab ((*permp
)->vars
)
4582 ->traverse
<dfset_post_merge
*, variable_post_merge_perm_vals
> (&dfpm
);
4583 shared_hash_htab (set
->vars
)
4584 ->traverse
<dataflow_set
*, canonicalize_values_star
> (set
);
4585 shared_hash_htab (set
->vars
)
4586 ->traverse
<dataflow_set
*, canonicalize_vars_star
> (set
);
4589 /* Return a node whose loc is a MEM that refers to EXPR in the
4590 location list of a one-part variable or value VAR, or in that of
4591 any values recursively mentioned in the location lists. */
4593 static location_chain
*
4594 find_mem_expr_in_1pdv (tree expr
, rtx val
, variable_table_type
*vars
)
4596 location_chain
*node
;
4599 location_chain
*where
= NULL
;
4604 gcc_assert (GET_CODE (val
) == VALUE
4605 && !VALUE_RECURSED_INTO (val
));
4607 dv
= dv_from_value (val
);
4608 var
= vars
->find_with_hash (dv
, dv_htab_hash (dv
));
4613 gcc_assert (var
->onepart
);
4615 if (!var
->n_var_parts
)
4618 VALUE_RECURSED_INTO (val
) = true;
4620 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
4621 if (MEM_P (node
->loc
)
4622 && MEM_EXPR (node
->loc
) == expr
4623 && INT_MEM_OFFSET (node
->loc
) == 0)
4628 else if (GET_CODE (node
->loc
) == VALUE
4629 && !VALUE_RECURSED_INTO (node
->loc
)
4630 && (where
= find_mem_expr_in_1pdv (expr
, node
->loc
, vars
)))
4633 VALUE_RECURSED_INTO (val
) = false;
4638 /* Return TRUE if the value of MEM may vary across a call. */
4641 mem_dies_at_call (rtx mem
)
4643 tree expr
= MEM_EXPR (mem
);
4649 decl
= get_base_address (expr
);
4657 return (may_be_aliased (decl
)
4658 || (!TREE_READONLY (decl
) && is_global_var (decl
)));
4661 /* Remove all MEMs from the location list of a hash table entry for a
4662 one-part variable, except those whose MEM attributes map back to
4663 the variable itself, directly or within a VALUE. */
4666 dataflow_set_preserve_mem_locs (variable
**slot
, dataflow_set
*set
)
4668 variable
*var
= *slot
;
4670 if (var
->onepart
== ONEPART_VDECL
|| var
->onepart
== ONEPART_DEXPR
)
4672 tree decl
= dv_as_decl (var
->dv
);
4673 location_chain
*loc
, **locp
;
4674 bool changed
= false;
4676 if (!var
->n_var_parts
)
4679 gcc_assert (var
->n_var_parts
== 1);
4681 if (shared_var_p (var
, set
->vars
))
4683 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
4685 /* We want to remove dying MEMs that doesn't refer to DECL. */
4686 if (GET_CODE (loc
->loc
) == MEM
4687 && (MEM_EXPR (loc
->loc
) != decl
4688 || INT_MEM_OFFSET (loc
->loc
) != 0)
4689 && !mem_dies_at_call (loc
->loc
))
4691 /* We want to move here MEMs that do refer to DECL. */
4692 else if (GET_CODE (loc
->loc
) == VALUE
4693 && find_mem_expr_in_1pdv (decl
, loc
->loc
,
4694 shared_hash_htab (set
->vars
)))
4701 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
4703 gcc_assert (var
->n_var_parts
== 1);
4706 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
4709 rtx old_loc
= loc
->loc
;
4710 if (GET_CODE (old_loc
) == VALUE
)
4712 location_chain
*mem_node
4713 = find_mem_expr_in_1pdv (decl
, loc
->loc
,
4714 shared_hash_htab (set
->vars
));
4716 /* ??? This picks up only one out of multiple MEMs that
4717 refer to the same variable. Do we ever need to be
4718 concerned about dealing with more than one, or, given
4719 that they should all map to the same variable
4720 location, their addresses will have been merged and
4721 they will be regarded as equivalent? */
4724 loc
->loc
= mem_node
->loc
;
4725 loc
->set_src
= mem_node
->set_src
;
4726 loc
->init
= MIN (loc
->init
, mem_node
->init
);
4730 if (GET_CODE (loc
->loc
) != MEM
4731 || (MEM_EXPR (loc
->loc
) == decl
4732 && INT_MEM_OFFSET (loc
->loc
) == 0)
4733 || !mem_dies_at_call (loc
->loc
))
4735 if (old_loc
!= loc
->loc
&& emit_notes
)
4737 if (old_loc
== var
->var_part
[0].cur_loc
)
4740 var
->var_part
[0].cur_loc
= NULL
;
4749 if (old_loc
== var
->var_part
[0].cur_loc
)
4752 var
->var_part
[0].cur_loc
= NULL
;
4759 if (!var
->var_part
[0].loc_chain
)
4765 variable_was_changed (var
, set
);
4771 /* Remove all MEMs from the location list of a hash table entry for a
4775 dataflow_set_remove_mem_locs (variable
**slot
, dataflow_set
*set
)
4777 variable
*var
= *slot
;
4779 if (var
->onepart
== ONEPART_VALUE
)
4781 location_chain
*loc
, **locp
;
4782 bool changed
= false;
4785 gcc_assert (var
->n_var_parts
== 1);
4787 if (shared_var_p (var
, set
->vars
))
4789 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
4790 if (GET_CODE (loc
->loc
) == MEM
4791 && mem_dies_at_call (loc
->loc
))
4797 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
4799 gcc_assert (var
->n_var_parts
== 1);
4802 if (VAR_LOC_1PAUX (var
))
4803 cur_loc
= VAR_LOC_FROM (var
);
4805 cur_loc
= var
->var_part
[0].cur_loc
;
4807 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
4810 if (GET_CODE (loc
->loc
) != MEM
4811 || !mem_dies_at_call (loc
->loc
))
4818 /* If we have deleted the location which was last emitted
4819 we have to emit new location so add the variable to set
4820 of changed variables. */
4821 if (cur_loc
== loc
->loc
)
4824 var
->var_part
[0].cur_loc
= NULL
;
4825 if (VAR_LOC_1PAUX (var
))
4826 VAR_LOC_FROM (var
) = NULL
;
4831 if (!var
->var_part
[0].loc_chain
)
4837 variable_was_changed (var
, set
);
4843 /* Remove all variable-location information about call-clobbered
4844 registers, as well as associations between MEMs and VALUEs. */
4847 dataflow_set_clear_at_call (dataflow_set
*set
, rtx_insn
*call_insn
)
4850 hard_reg_set_iterator hrsi
;
4851 HARD_REG_SET invalidated_regs
;
4853 get_call_reg_set_usage (call_insn
, &invalidated_regs
,
4854 regs_invalidated_by_call
);
4856 EXECUTE_IF_SET_IN_HARD_REG_SET (invalidated_regs
, 0, r
, hrsi
)
4857 var_regno_delete (set
, r
);
4859 if (MAY_HAVE_DEBUG_INSNS
)
4861 set
->traversed_vars
= set
->vars
;
4862 shared_hash_htab (set
->vars
)
4863 ->traverse
<dataflow_set
*, dataflow_set_preserve_mem_locs
> (set
);
4864 set
->traversed_vars
= set
->vars
;
4865 shared_hash_htab (set
->vars
)
4866 ->traverse
<dataflow_set
*, dataflow_set_remove_mem_locs
> (set
);
4867 set
->traversed_vars
= NULL
;
4872 variable_part_different_p (variable_part
*vp1
, variable_part
*vp2
)
4874 location_chain
*lc1
, *lc2
;
4876 for (lc1
= vp1
->loc_chain
; lc1
; lc1
= lc1
->next
)
4878 for (lc2
= vp2
->loc_chain
; lc2
; lc2
= lc2
->next
)
4880 if (REG_P (lc1
->loc
) && REG_P (lc2
->loc
))
4882 if (REGNO (lc1
->loc
) == REGNO (lc2
->loc
))
4885 if (rtx_equal_p (lc1
->loc
, lc2
->loc
))
4894 /* Return true if one-part variables VAR1 and VAR2 are different.
4895 They must be in canonical order. */
4898 onepart_variable_different_p (variable
*var1
, variable
*var2
)
4900 location_chain
*lc1
, *lc2
;
4905 gcc_assert (var1
->n_var_parts
== 1
4906 && var2
->n_var_parts
== 1);
4908 lc1
= var1
->var_part
[0].loc_chain
;
4909 lc2
= var2
->var_part
[0].loc_chain
;
4911 gcc_assert (lc1
&& lc2
);
4915 if (loc_cmp (lc1
->loc
, lc2
->loc
))
4924 /* Return true if variables VAR1 and VAR2 are different. */
4927 variable_different_p (variable
*var1
, variable
*var2
)
4934 if (var1
->onepart
!= var2
->onepart
)
4937 if (var1
->n_var_parts
!= var2
->n_var_parts
)
4940 if (var1
->onepart
&& var1
->n_var_parts
)
4942 gcc_checking_assert (dv_as_opaque (var1
->dv
) == dv_as_opaque (var2
->dv
)
4943 && var1
->n_var_parts
== 1);
4944 /* One-part values have locations in a canonical order. */
4945 return onepart_variable_different_p (var1
, var2
);
4948 for (i
= 0; i
< var1
->n_var_parts
; i
++)
4950 if (VAR_PART_OFFSET (var1
, i
) != VAR_PART_OFFSET (var2
, i
))
4952 if (variable_part_different_p (&var1
->var_part
[i
], &var2
->var_part
[i
]))
4954 if (variable_part_different_p (&var2
->var_part
[i
], &var1
->var_part
[i
]))
4960 /* Return true if dataflow sets OLD_SET and NEW_SET differ. */
4963 dataflow_set_different (dataflow_set
*old_set
, dataflow_set
*new_set
)
4965 variable_iterator_type hi
;
4968 if (old_set
->vars
== new_set
->vars
)
4971 if (shared_hash_htab (old_set
->vars
)->elements ()
4972 != shared_hash_htab (new_set
->vars
)->elements ())
4975 FOR_EACH_HASH_TABLE_ELEMENT (*shared_hash_htab (old_set
->vars
),
4978 variable_table_type
*htab
= shared_hash_htab (new_set
->vars
);
4979 variable
*var2
= htab
->find_with_hash (var1
->dv
, dv_htab_hash (var1
->dv
));
4982 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4984 fprintf (dump_file
, "dataflow difference found: removal of:\n");
4990 if (variable_different_p (var1
, var2
))
4992 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4994 fprintf (dump_file
, "dataflow difference found: "
4995 "old and new follow:\n");
5003 /* No need to traverse the second hashtab, if both have the same number
5004 of elements and the second one had all entries found in the first one,
5005 then it can't have any extra entries. */
5009 /* Free the contents of dataflow set SET. */
5012 dataflow_set_destroy (dataflow_set
*set
)
5016 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
5017 attrs_list_clear (&set
->regs
[i
]);
5019 shared_hash_destroy (set
->vars
);
5023 /* Shall EXPR be tracked? */
5026 track_expr_p (tree expr
, bool need_rtl
)
5031 if (TREE_CODE (expr
) == DEBUG_EXPR_DECL
)
5032 return DECL_RTL_SET_P (expr
);
5034 /* If EXPR is not a parameter or a variable do not track it. */
5035 if (TREE_CODE (expr
) != VAR_DECL
&& TREE_CODE (expr
) != PARM_DECL
)
5038 /* It also must have a name... */
5039 if (!DECL_NAME (expr
) && need_rtl
)
5042 /* ... and a RTL assigned to it. */
5043 decl_rtl
= DECL_RTL_IF_SET (expr
);
5044 if (!decl_rtl
&& need_rtl
)
5047 /* If this expression is really a debug alias of some other declaration, we
5048 don't need to track this expression if the ultimate declaration is
5051 if (TREE_CODE (realdecl
) == VAR_DECL
&& DECL_HAS_DEBUG_EXPR_P (realdecl
))
5053 realdecl
= DECL_DEBUG_EXPR (realdecl
);
5054 if (!DECL_P (realdecl
))
5056 if (handled_component_p (realdecl
)
5057 || (TREE_CODE (realdecl
) == MEM_REF
5058 && TREE_CODE (TREE_OPERAND (realdecl
, 0)) == ADDR_EXPR
))
5060 HOST_WIDE_INT bitsize
, bitpos
, maxsize
;
5063 = get_ref_base_and_extent (realdecl
, &bitpos
, &bitsize
,
5064 &maxsize
, &reverse
);
5065 if (!DECL_P (innerdecl
)
5066 || DECL_IGNORED_P (innerdecl
)
5067 /* Do not track declarations for parts of tracked parameters
5068 since we want to track them as a whole instead. */
5069 || (TREE_CODE (innerdecl
) == PARM_DECL
5070 && DECL_MODE (innerdecl
) != BLKmode
5071 && TREE_CODE (TREE_TYPE (innerdecl
)) != UNION_TYPE
)
5072 || TREE_STATIC (innerdecl
)
5074 || bitpos
+ bitsize
> 256
5075 || bitsize
!= maxsize
)
5085 /* Do not track EXPR if REALDECL it should be ignored for debugging
5087 if (DECL_IGNORED_P (realdecl
))
5090 /* Do not track global variables until we are able to emit correct location
5092 if (TREE_STATIC (realdecl
))
5095 /* When the EXPR is a DECL for alias of some variable (see example)
5096 the TREE_STATIC flag is not used. Disable tracking all DECLs whose
5097 DECL_RTL contains SYMBOL_REF.
5100 extern char **_dl_argv_internal __attribute__ ((alias ("_dl_argv")));
5103 if (decl_rtl
&& MEM_P (decl_rtl
)
5104 && contains_symbol_ref_p (XEXP (decl_rtl
, 0)))
5107 /* If RTX is a memory it should not be very large (because it would be
5108 an array or struct). */
5109 if (decl_rtl
&& MEM_P (decl_rtl
))
5111 /* Do not track structures and arrays. */
5112 if (GET_MODE (decl_rtl
) == BLKmode
5113 || AGGREGATE_TYPE_P (TREE_TYPE (realdecl
)))
5115 if (MEM_SIZE_KNOWN_P (decl_rtl
)
5116 && MEM_SIZE (decl_rtl
) > MAX_VAR_PARTS
)
5120 DECL_CHANGED (expr
) = 0;
5121 DECL_CHANGED (realdecl
) = 0;
5125 /* Determine whether a given LOC refers to the same variable part as
5129 same_variable_part_p (rtx loc
, tree expr
, HOST_WIDE_INT offset
)
5132 HOST_WIDE_INT offset2
;
5134 if (! DECL_P (expr
))
5139 expr2
= REG_EXPR (loc
);
5140 offset2
= REG_OFFSET (loc
);
5142 else if (MEM_P (loc
))
5144 expr2
= MEM_EXPR (loc
);
5145 offset2
= INT_MEM_OFFSET (loc
);
5150 if (! expr2
|| ! DECL_P (expr2
))
5153 expr
= var_debug_decl (expr
);
5154 expr2
= var_debug_decl (expr2
);
5156 return (expr
== expr2
&& offset
== offset2
);
5159 /* LOC is a REG or MEM that we would like to track if possible.
5160 If EXPR is null, we don't know what expression LOC refers to,
5161 otherwise it refers to EXPR + OFFSET. STORE_REG_P is true if
5162 LOC is an lvalue register.
5164 Return true if EXPR is nonnull and if LOC, or some lowpart of it,
5165 is something we can track. When returning true, store the mode of
5166 the lowpart we can track in *MODE_OUT (if nonnull) and its offset
5167 from EXPR in *OFFSET_OUT (if nonnull). */
5170 track_loc_p (rtx loc
, tree expr
, HOST_WIDE_INT offset
, bool store_reg_p
,
5171 machine_mode
*mode_out
, HOST_WIDE_INT
*offset_out
)
5175 if (expr
== NULL
|| !track_expr_p (expr
, true))
5178 /* If REG was a paradoxical subreg, its REG_ATTRS will describe the
5179 whole subreg, but only the old inner part is really relevant. */
5180 mode
= GET_MODE (loc
);
5181 if (REG_P (loc
) && !HARD_REGISTER_NUM_P (ORIGINAL_REGNO (loc
)))
5183 machine_mode pseudo_mode
;
5185 pseudo_mode
= PSEUDO_REGNO_MODE (ORIGINAL_REGNO (loc
));
5186 if (GET_MODE_SIZE (mode
) > GET_MODE_SIZE (pseudo_mode
))
5188 offset
+= byte_lowpart_offset (pseudo_mode
, mode
);
5193 /* If LOC is a paradoxical lowpart of EXPR, refer to EXPR itself.
5194 Do the same if we are storing to a register and EXPR occupies
5195 the whole of register LOC; in that case, the whole of EXPR is
5196 being changed. We exclude complex modes from the second case
5197 because the real and imaginary parts are represented as separate
5198 pseudo registers, even if the whole complex value fits into one
5200 if ((GET_MODE_SIZE (mode
) > GET_MODE_SIZE (DECL_MODE (expr
))
5202 && !COMPLEX_MODE_P (DECL_MODE (expr
))
5203 && hard_regno_nregs
[REGNO (loc
)][DECL_MODE (expr
)] == 1))
5204 && offset
+ byte_lowpart_offset (DECL_MODE (expr
), mode
) == 0)
5206 mode
= DECL_MODE (expr
);
5210 if (offset
< 0 || offset
>= MAX_VAR_PARTS
)
5216 *offset_out
= offset
;
5220 /* Return the MODE lowpart of LOC, or null if LOC is not something we
5221 want to track. When returning nonnull, make sure that the attributes
5222 on the returned value are updated. */
5225 var_lowpart (machine_mode mode
, rtx loc
)
5227 unsigned int offset
, reg_offset
, regno
;
5229 if (GET_MODE (loc
) == mode
)
5232 if (!REG_P (loc
) && !MEM_P (loc
))
5235 offset
= byte_lowpart_offset (mode
, GET_MODE (loc
));
5238 return adjust_address_nv (loc
, mode
, offset
);
5240 reg_offset
= subreg_lowpart_offset (mode
, GET_MODE (loc
));
5241 regno
= REGNO (loc
) + subreg_regno_offset (REGNO (loc
), GET_MODE (loc
),
5243 return gen_rtx_REG_offset (loc
, mode
, regno
, offset
);
5246 /* Carry information about uses and stores while walking rtx. */
5248 struct count_use_info
5250 /* The insn where the RTX is. */
5253 /* The basic block where insn is. */
5256 /* The array of n_sets sets in the insn, as determined by cselib. */
5257 struct cselib_set
*sets
;
5260 /* True if we're counting stores, false otherwise. */
5264 /* Find a VALUE corresponding to X. */
5266 static inline cselib_val
*
5267 find_use_val (rtx x
, machine_mode mode
, struct count_use_info
*cui
)
5273 /* This is called after uses are set up and before stores are
5274 processed by cselib, so it's safe to look up srcs, but not
5275 dsts. So we look up expressions that appear in srcs or in
5276 dest expressions, but we search the sets array for dests of
5280 /* Some targets represent memset and memcpy patterns
5281 by (set (mem:BLK ...) (reg:[QHSD]I ...)) or
5282 (set (mem:BLK ...) (const_int ...)) or
5283 (set (mem:BLK ...) (mem:BLK ...)). Don't return anything
5284 in that case, otherwise we end up with mode mismatches. */
5285 if (mode
== BLKmode
&& MEM_P (x
))
5287 for (i
= 0; i
< cui
->n_sets
; i
++)
5288 if (cui
->sets
[i
].dest
== x
)
5289 return cui
->sets
[i
].src_elt
;
5292 return cselib_lookup (x
, mode
, 0, VOIDmode
);
5298 /* Replace all registers and addresses in an expression with VALUE
5299 expressions that map back to them, unless the expression is a
5300 register. If no mapping is or can be performed, returns NULL. */
5303 replace_expr_with_values (rtx loc
)
5305 if (REG_P (loc
) || GET_CODE (loc
) == ENTRY_VALUE
)
5307 else if (MEM_P (loc
))
5309 cselib_val
*addr
= cselib_lookup (XEXP (loc
, 0),
5310 get_address_mode (loc
), 0,
5313 return replace_equiv_address_nv (loc
, addr
->val_rtx
);
5318 return cselib_subst_to_values (loc
, VOIDmode
);
5321 /* Return true if X contains a DEBUG_EXPR. */
5324 rtx_debug_expr_p (const_rtx x
)
5326 subrtx_iterator::array_type array
;
5327 FOR_EACH_SUBRTX (iter
, array
, x
, ALL
)
5328 if (GET_CODE (*iter
) == DEBUG_EXPR
)
5333 /* Determine what kind of micro operation to choose for a USE. Return
5334 MO_CLOBBER if no micro operation is to be generated. */
5336 static enum micro_operation_type
5337 use_type (rtx loc
, struct count_use_info
*cui
, machine_mode
*modep
)
5341 if (cui
&& cui
->sets
)
5343 if (GET_CODE (loc
) == VAR_LOCATION
)
5345 if (track_expr_p (PAT_VAR_LOCATION_DECL (loc
), false))
5347 rtx ploc
= PAT_VAR_LOCATION_LOC (loc
);
5348 if (! VAR_LOC_UNKNOWN_P (ploc
))
5350 cselib_val
*val
= cselib_lookup (ploc
, GET_MODE (loc
), 1,
5353 /* ??? flag_float_store and volatile mems are never
5354 given values, but we could in theory use them for
5356 gcc_assert (val
|| 1);
5364 if (REG_P (loc
) || MEM_P (loc
))
5367 *modep
= GET_MODE (loc
);
5371 || (find_use_val (loc
, GET_MODE (loc
), cui
)
5372 && cselib_lookup (XEXP (loc
, 0),
5373 get_address_mode (loc
), 0,
5379 cselib_val
*val
= find_use_val (loc
, GET_MODE (loc
), cui
);
5381 if (val
&& !cselib_preserved_value_p (val
))
5389 gcc_assert (REGNO (loc
) < FIRST_PSEUDO_REGISTER
);
5391 if (loc
== cfa_base_rtx
)
5393 expr
= REG_EXPR (loc
);
5396 return MO_USE_NO_VAR
;
5397 else if (target_for_debug_bind (var_debug_decl (expr
)))
5399 else if (track_loc_p (loc
, expr
, REG_OFFSET (loc
),
5400 false, modep
, NULL
))
5403 return MO_USE_NO_VAR
;
5405 else if (MEM_P (loc
))
5407 expr
= MEM_EXPR (loc
);
5411 else if (target_for_debug_bind (var_debug_decl (expr
)))
5413 else if (track_loc_p (loc
, expr
, INT_MEM_OFFSET (loc
),
5415 /* Multi-part variables shouldn't refer to one-part
5416 variable names such as VALUEs (never happens) or
5417 DEBUG_EXPRs (only happens in the presence of debug
5419 && (!MAY_HAVE_DEBUG_INSNS
5420 || !rtx_debug_expr_p (XEXP (loc
, 0))))
5429 /* Log to OUT information about micro-operation MOPT involving X in
5433 log_op_type (rtx x
, basic_block bb
, rtx_insn
*insn
,
5434 enum micro_operation_type mopt
, FILE *out
)
5436 fprintf (out
, "bb %i op %i insn %i %s ",
5437 bb
->index
, VTI (bb
)->mos
.length (),
5438 INSN_UID (insn
), micro_operation_type_name
[mopt
]);
5439 print_inline_rtx (out
, x
, 2);
5443 /* Tell whether the CONCAT used to holds a VALUE and its location
5444 needs value resolution, i.e., an attempt of mapping the location
5445 back to other incoming values. */
5446 #define VAL_NEEDS_RESOLUTION(x) \
5447 (RTL_FLAG_CHECK1 ("VAL_NEEDS_RESOLUTION", (x), CONCAT)->volatil)
5448 /* Whether the location in the CONCAT is a tracked expression, that
5449 should also be handled like a MO_USE. */
5450 #define VAL_HOLDS_TRACK_EXPR(x) \
5451 (RTL_FLAG_CHECK1 ("VAL_HOLDS_TRACK_EXPR", (x), CONCAT)->used)
5452 /* Whether the location in the CONCAT should be handled like a MO_COPY
5454 #define VAL_EXPR_IS_COPIED(x) \
5455 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_COPIED", (x), CONCAT)->jump)
5456 /* Whether the location in the CONCAT should be handled like a
5457 MO_CLOBBER as well. */
5458 #define VAL_EXPR_IS_CLOBBERED(x) \
5459 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_CLOBBERED", (x), CONCAT)->unchanging)
5461 /* All preserved VALUEs. */
5462 static vec
<rtx
> preserved_values
;
5464 /* Ensure VAL is preserved and remember it in a vector for vt_emit_notes. */
5467 preserve_value (cselib_val
*val
)
5469 cselib_preserve_value (val
);
5470 preserved_values
.safe_push (val
->val_rtx
);
5473 /* Helper function for MO_VAL_LOC handling. Return non-zero if
5474 any rtxes not suitable for CONST use not replaced by VALUEs
5478 non_suitable_const (const_rtx x
)
5480 subrtx_iterator::array_type array
;
5481 FOR_EACH_SUBRTX (iter
, array
, x
, ALL
)
5483 const_rtx x
= *iter
;
5484 switch (GET_CODE (x
))
5495 if (!MEM_READONLY_P (x
))
5505 /* Add uses (register and memory references) LOC which will be tracked
5506 to VTI (bb)->mos. */
5509 add_uses (rtx loc
, struct count_use_info
*cui
)
5511 machine_mode mode
= VOIDmode
;
5512 enum micro_operation_type type
= use_type (loc
, cui
, &mode
);
5514 if (type
!= MO_CLOBBER
)
5516 basic_block bb
= cui
->bb
;
5520 mo
.u
.loc
= type
== MO_USE
? var_lowpart (mode
, loc
) : loc
;
5521 mo
.insn
= cui
->insn
;
5523 if (type
== MO_VAL_LOC
)
5526 rtx vloc
= PAT_VAR_LOCATION_LOC (oloc
);
5529 gcc_assert (cui
->sets
);
5532 && !REG_P (XEXP (vloc
, 0))
5533 && !MEM_P (XEXP (vloc
, 0)))
5536 machine_mode address_mode
= get_address_mode (mloc
);
5538 = cselib_lookup (XEXP (mloc
, 0), address_mode
, 0,
5541 if (val
&& !cselib_preserved_value_p (val
))
5542 preserve_value (val
);
5545 if (CONSTANT_P (vloc
)
5546 && (GET_CODE (vloc
) != CONST
|| non_suitable_const (vloc
)))
5547 /* For constants don't look up any value. */;
5548 else if (!VAR_LOC_UNKNOWN_P (vloc
) && !unsuitable_loc (vloc
)
5549 && (val
= find_use_val (vloc
, GET_MODE (oloc
), cui
)))
5552 enum micro_operation_type type2
;
5554 bool resolvable
= REG_P (vloc
) || MEM_P (vloc
);
5557 nloc
= replace_expr_with_values (vloc
);
5561 oloc
= shallow_copy_rtx (oloc
);
5562 PAT_VAR_LOCATION_LOC (oloc
) = nloc
;
5565 oloc
= gen_rtx_CONCAT (mode
, val
->val_rtx
, oloc
);
5567 type2
= use_type (vloc
, 0, &mode2
);
5569 gcc_assert (type2
== MO_USE
|| type2
== MO_USE_NO_VAR
5570 || type2
== MO_CLOBBER
);
5572 if (type2
== MO_CLOBBER
5573 && !cselib_preserved_value_p (val
))
5575 VAL_NEEDS_RESOLUTION (oloc
) = resolvable
;
5576 preserve_value (val
);
5579 else if (!VAR_LOC_UNKNOWN_P (vloc
))
5581 oloc
= shallow_copy_rtx (oloc
);
5582 PAT_VAR_LOCATION_LOC (oloc
) = gen_rtx_UNKNOWN_VAR_LOC ();
5587 else if (type
== MO_VAL_USE
)
5589 machine_mode mode2
= VOIDmode
;
5590 enum micro_operation_type type2
;
5591 cselib_val
*val
= find_use_val (loc
, GET_MODE (loc
), cui
);
5592 rtx vloc
, oloc
= loc
, nloc
;
5594 gcc_assert (cui
->sets
);
5597 && !REG_P (XEXP (oloc
, 0))
5598 && !MEM_P (XEXP (oloc
, 0)))
5601 machine_mode address_mode
= get_address_mode (mloc
);
5603 = cselib_lookup (XEXP (mloc
, 0), address_mode
, 0,
5606 if (val
&& !cselib_preserved_value_p (val
))
5607 preserve_value (val
);
5610 type2
= use_type (loc
, 0, &mode2
);
5612 gcc_assert (type2
== MO_USE
|| type2
== MO_USE_NO_VAR
5613 || type2
== MO_CLOBBER
);
5615 if (type2
== MO_USE
)
5616 vloc
= var_lowpart (mode2
, loc
);
5620 /* The loc of a MO_VAL_USE may have two forms:
5622 (concat val src): val is at src, a value-based
5625 (concat (concat val use) src): same as above, with use as
5626 the MO_USE tracked value, if it differs from src.
5630 gcc_checking_assert (REG_P (loc
) || MEM_P (loc
));
5631 nloc
= replace_expr_with_values (loc
);
5636 oloc
= gen_rtx_CONCAT (mode2
, val
->val_rtx
, vloc
);
5638 oloc
= val
->val_rtx
;
5640 mo
.u
.loc
= gen_rtx_CONCAT (mode
, oloc
, nloc
);
5642 if (type2
== MO_USE
)
5643 VAL_HOLDS_TRACK_EXPR (mo
.u
.loc
) = 1;
5644 if (!cselib_preserved_value_p (val
))
5646 VAL_NEEDS_RESOLUTION (mo
.u
.loc
) = 1;
5647 preserve_value (val
);
5651 gcc_assert (type
== MO_USE
|| type
== MO_USE_NO_VAR
);
5653 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5654 log_op_type (mo
.u
.loc
, cui
->bb
, cui
->insn
, mo
.type
, dump_file
);
5655 VTI (bb
)->mos
.safe_push (mo
);
5659 /* Helper function for finding all uses of REG/MEM in X in insn INSN. */
5662 add_uses_1 (rtx
*x
, void *cui
)
5664 subrtx_var_iterator::array_type array
;
5665 FOR_EACH_SUBRTX_VAR (iter
, array
, *x
, NONCONST
)
5666 add_uses (*iter
, (struct count_use_info
*) cui
);
5669 /* This is the value used during expansion of locations. We want it
5670 to be unbounded, so that variables expanded deep in a recursion
5671 nest are fully evaluated, so that their values are cached
5672 correctly. We avoid recursion cycles through other means, and we
5673 don't unshare RTL, so excess complexity is not a problem. */
5674 #define EXPR_DEPTH (INT_MAX)
5675 /* We use this to keep too-complex expressions from being emitted as
5676 location notes, and then to debug information. Users can trade
5677 compile time for ridiculously complex expressions, although they're
5678 seldom useful, and they may often have to be discarded as not
5679 representable anyway. */
5680 #define EXPR_USE_DEPTH (PARAM_VALUE (PARAM_MAX_VARTRACK_EXPR_DEPTH))
5682 /* Attempt to reverse the EXPR operation in the debug info and record
5683 it in the cselib table. Say for reg1 = reg2 + 6 even when reg2 is
5684 no longer live we can express its value as VAL - 6. */
5687 reverse_op (rtx val
, const_rtx expr
, rtx_insn
*insn
)
5691 struct elt_loc_list
*l
;
5695 if (GET_CODE (expr
) != SET
)
5698 if (!REG_P (SET_DEST (expr
)) || GET_MODE (val
) != GET_MODE (SET_DEST (expr
)))
5701 src
= SET_SRC (expr
);
5702 switch (GET_CODE (src
))
5709 if (!REG_P (XEXP (src
, 0)))
5714 if (!REG_P (XEXP (src
, 0)) && !MEM_P (XEXP (src
, 0)))
5721 if (!SCALAR_INT_MODE_P (GET_MODE (src
)) || XEXP (src
, 0) == cfa_base_rtx
)
5724 v
= cselib_lookup (XEXP (src
, 0), GET_MODE (XEXP (src
, 0)), 0, VOIDmode
);
5725 if (!v
|| !cselib_preserved_value_p (v
))
5728 /* Use canonical V to avoid creating multiple redundant expressions
5729 for different VALUES equivalent to V. */
5730 v
= canonical_cselib_val (v
);
5732 /* Adding a reverse op isn't useful if V already has an always valid
5733 location. Ignore ENTRY_VALUE, while it is always constant, we should
5734 prefer non-ENTRY_VALUE locations whenever possible. */
5735 for (l
= v
->locs
, count
= 0; l
; l
= l
->next
, count
++)
5736 if (CONSTANT_P (l
->loc
)
5737 && (GET_CODE (l
->loc
) != CONST
|| !references_value_p (l
->loc
, 0)))
5739 /* Avoid creating too large locs lists. */
5740 else if (count
== PARAM_VALUE (PARAM_MAX_VARTRACK_REVERSE_OP_SIZE
))
5743 switch (GET_CODE (src
))
5747 if (GET_MODE (v
->val_rtx
) != GET_MODE (val
))
5749 ret
= gen_rtx_fmt_e (GET_CODE (src
), GET_MODE (val
), val
);
5753 ret
= gen_lowpart_SUBREG (GET_MODE (v
->val_rtx
), val
);
5765 if (GET_MODE (v
->val_rtx
) != GET_MODE (val
))
5767 arg
= XEXP (src
, 1);
5768 if (!CONST_INT_P (arg
) && GET_CODE (arg
) != SYMBOL_REF
)
5770 arg
= cselib_expand_value_rtx (arg
, scratch_regs
, 5);
5771 if (arg
== NULL_RTX
)
5773 if (!CONST_INT_P (arg
) && GET_CODE (arg
) != SYMBOL_REF
)
5776 ret
= simplify_gen_binary (code
, GET_MODE (val
), val
, arg
);
5782 cselib_add_permanent_equiv (v
, ret
, insn
);
5785 /* Add stores (register and memory references) LOC which will be tracked
5786 to VTI (bb)->mos. EXPR is the RTL expression containing the store.
5787 CUIP->insn is instruction which the LOC is part of. */
5790 add_stores (rtx loc
, const_rtx expr
, void *cuip
)
5792 machine_mode mode
= VOIDmode
, mode2
;
5793 struct count_use_info
*cui
= (struct count_use_info
*)cuip
;
5794 basic_block bb
= cui
->bb
;
5796 rtx oloc
= loc
, nloc
, src
= NULL
;
5797 enum micro_operation_type type
= use_type (loc
, cui
, &mode
);
5798 bool track_p
= false;
5800 bool resolve
, preserve
;
5802 if (type
== MO_CLOBBER
)
5809 gcc_assert (loc
!= cfa_base_rtx
);
5810 if ((GET_CODE (expr
) == CLOBBER
&& type
!= MO_VAL_SET
)
5811 || !(track_p
= use_type (loc
, NULL
, &mode2
) == MO_USE
)
5812 || GET_CODE (expr
) == CLOBBER
)
5814 mo
.type
= MO_CLOBBER
;
5816 if (GET_CODE (expr
) == SET
5817 && SET_DEST (expr
) == loc
5818 && !unsuitable_loc (SET_SRC (expr
))
5819 && find_use_val (loc
, mode
, cui
))
5821 gcc_checking_assert (type
== MO_VAL_SET
);
5822 mo
.u
.loc
= gen_rtx_SET (loc
, SET_SRC (expr
));
5827 if (GET_CODE (expr
) == SET
5828 && SET_DEST (expr
) == loc
5829 && GET_CODE (SET_SRC (expr
)) != ASM_OPERANDS
)
5830 src
= var_lowpart (mode2
, SET_SRC (expr
));
5831 loc
= var_lowpart (mode2
, loc
);
5840 rtx xexpr
= gen_rtx_SET (loc
, src
);
5841 if (same_variable_part_p (src
, REG_EXPR (loc
), REG_OFFSET (loc
)))
5843 /* If this is an instruction copying (part of) a parameter
5844 passed by invisible reference to its register location,
5845 pretend it's a SET so that the initial memory location
5846 is discarded, as the parameter register can be reused
5847 for other purposes and we do not track locations based
5848 on generic registers. */
5851 && TREE_CODE (REG_EXPR (loc
)) == PARM_DECL
5852 && DECL_MODE (REG_EXPR (loc
)) != BLKmode
5853 && MEM_P (DECL_INCOMING_RTL (REG_EXPR (loc
)))
5854 && XEXP (DECL_INCOMING_RTL (REG_EXPR (loc
)), 0)
5865 mo
.insn
= cui
->insn
;
5867 else if (MEM_P (loc
)
5868 && ((track_p
= use_type (loc
, NULL
, &mode2
) == MO_USE
)
5871 if (MEM_P (loc
) && type
== MO_VAL_SET
5872 && !REG_P (XEXP (loc
, 0))
5873 && !MEM_P (XEXP (loc
, 0)))
5876 machine_mode address_mode
= get_address_mode (mloc
);
5877 cselib_val
*val
= cselib_lookup (XEXP (mloc
, 0),
5881 if (val
&& !cselib_preserved_value_p (val
))
5882 preserve_value (val
);
5885 if (GET_CODE (expr
) == CLOBBER
|| !track_p
)
5887 mo
.type
= MO_CLOBBER
;
5888 mo
.u
.loc
= track_p
? var_lowpart (mode2
, loc
) : loc
;
5892 if (GET_CODE (expr
) == SET
5893 && SET_DEST (expr
) == loc
5894 && GET_CODE (SET_SRC (expr
)) != ASM_OPERANDS
)
5895 src
= var_lowpart (mode2
, SET_SRC (expr
));
5896 loc
= var_lowpart (mode2
, loc
);
5905 rtx xexpr
= gen_rtx_SET (loc
, src
);
5906 if (same_variable_part_p (SET_SRC (xexpr
),
5908 INT_MEM_OFFSET (loc
)))
5915 mo
.insn
= cui
->insn
;
5920 if (type
!= MO_VAL_SET
)
5921 goto log_and_return
;
5923 v
= find_use_val (oloc
, mode
, cui
);
5926 goto log_and_return
;
5928 resolve
= preserve
= !cselib_preserved_value_p (v
);
5930 /* We cannot track values for multiple-part variables, so we track only
5931 locations for tracked parameters passed either by invisible reference
5932 or directly in multiple locations. */
5936 && TREE_CODE (REG_EXPR (loc
)) == PARM_DECL
5937 && DECL_MODE (REG_EXPR (loc
)) != BLKmode
5938 && TREE_CODE (TREE_TYPE (REG_EXPR (loc
))) != UNION_TYPE
5939 && ((MEM_P (DECL_INCOMING_RTL (REG_EXPR (loc
)))
5940 && XEXP (DECL_INCOMING_RTL (REG_EXPR (loc
)), 0) != arg_pointer_rtx
)
5941 || (GET_CODE (DECL_INCOMING_RTL (REG_EXPR (loc
))) == PARALLEL
5942 && XVECLEN (DECL_INCOMING_RTL (REG_EXPR (loc
)), 0) > 1)))
5944 /* Although we don't use the value here, it could be used later by the
5945 mere virtue of its existence as the operand of the reverse operation
5946 that gave rise to it (typically extension/truncation). Make sure it
5947 is preserved as required by vt_expand_var_loc_chain. */
5950 goto log_and_return
;
5953 if (loc
== stack_pointer_rtx
5954 && hard_frame_pointer_adjustment
!= -1
5956 cselib_set_value_sp_based (v
);
5958 nloc
= replace_expr_with_values (oloc
);
5962 if (GET_CODE (PATTERN (cui
->insn
)) == COND_EXEC
)
5964 cselib_val
*oval
= cselib_lookup (oloc
, GET_MODE (oloc
), 0, VOIDmode
);
5968 gcc_assert (REG_P (oloc
) || MEM_P (oloc
));
5970 if (oval
&& !cselib_preserved_value_p (oval
))
5972 micro_operation moa
;
5974 preserve_value (oval
);
5976 moa
.type
= MO_VAL_USE
;
5977 moa
.u
.loc
= gen_rtx_CONCAT (mode
, oval
->val_rtx
, oloc
);
5978 VAL_NEEDS_RESOLUTION (moa
.u
.loc
) = 1;
5979 moa
.insn
= cui
->insn
;
5981 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5982 log_op_type (moa
.u
.loc
, cui
->bb
, cui
->insn
,
5983 moa
.type
, dump_file
);
5984 VTI (bb
)->mos
.safe_push (moa
);
5989 else if (resolve
&& GET_CODE (mo
.u
.loc
) == SET
)
5991 if (REG_P (SET_SRC (expr
)) || MEM_P (SET_SRC (expr
)))
5992 nloc
= replace_expr_with_values (SET_SRC (expr
));
5996 /* Avoid the mode mismatch between oexpr and expr. */
5997 if (!nloc
&& mode
!= mode2
)
5999 nloc
= SET_SRC (expr
);
6000 gcc_assert (oloc
== SET_DEST (expr
));
6003 if (nloc
&& nloc
!= SET_SRC (mo
.u
.loc
))
6004 oloc
= gen_rtx_SET (oloc
, nloc
);
6007 if (oloc
== SET_DEST (mo
.u
.loc
))
6008 /* No point in duplicating. */
6010 if (!REG_P (SET_SRC (mo
.u
.loc
)))
6016 if (GET_CODE (mo
.u
.loc
) == SET
6017 && oloc
== SET_DEST (mo
.u
.loc
))
6018 /* No point in duplicating. */
6024 loc
= gen_rtx_CONCAT (mode
, v
->val_rtx
, oloc
);
6026 if (mo
.u
.loc
!= oloc
)
6027 loc
= gen_rtx_CONCAT (GET_MODE (mo
.u
.loc
), loc
, mo
.u
.loc
);
6029 /* The loc of a MO_VAL_SET may have various forms:
6031 (concat val dst): dst now holds val
6033 (concat val (set dst src)): dst now holds val, copied from src
6035 (concat (concat val dstv) dst): dst now holds val; dstv is dst
6036 after replacing mems and non-top-level regs with values.
6038 (concat (concat val dstv) (set dst src)): dst now holds val,
6039 copied from src. dstv is a value-based representation of dst, if
6040 it differs from dst. If resolution is needed, src is a REG, and
6041 its mode is the same as that of val.
6043 (concat (concat val (set dstv srcv)) (set dst src)): src
6044 copied to dst, holding val. dstv and srcv are value-based
6045 representations of dst and src, respectively.
6049 if (GET_CODE (PATTERN (cui
->insn
)) != COND_EXEC
)
6050 reverse_op (v
->val_rtx
, expr
, cui
->insn
);
6055 VAL_HOLDS_TRACK_EXPR (loc
) = 1;
6058 VAL_NEEDS_RESOLUTION (loc
) = resolve
;
6061 if (mo
.type
== MO_CLOBBER
)
6062 VAL_EXPR_IS_CLOBBERED (loc
) = 1;
6063 if (mo
.type
== MO_COPY
)
6064 VAL_EXPR_IS_COPIED (loc
) = 1;
6066 mo
.type
= MO_VAL_SET
;
6069 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
6070 log_op_type (mo
.u
.loc
, cui
->bb
, cui
->insn
, mo
.type
, dump_file
);
6071 VTI (bb
)->mos
.safe_push (mo
);
6074 /* Arguments to the call. */
6075 static rtx call_arguments
;
6077 /* Compute call_arguments. */
6080 prepare_call_arguments (basic_block bb
, rtx_insn
*insn
)
6083 rtx prev
, cur
, next
;
6084 rtx this_arg
= NULL_RTX
;
6085 tree type
= NULL_TREE
, t
, fndecl
= NULL_TREE
;
6086 tree obj_type_ref
= NULL_TREE
;
6087 CUMULATIVE_ARGS args_so_far_v
;
6088 cumulative_args_t args_so_far
;
6090 memset (&args_so_far_v
, 0, sizeof (args_so_far_v
));
6091 args_so_far
= pack_cumulative_args (&args_so_far_v
);
6092 call
= get_call_rtx_from (insn
);
6095 if (GET_CODE (XEXP (XEXP (call
, 0), 0)) == SYMBOL_REF
)
6097 rtx symbol
= XEXP (XEXP (call
, 0), 0);
6098 if (SYMBOL_REF_DECL (symbol
))
6099 fndecl
= SYMBOL_REF_DECL (symbol
);
6101 if (fndecl
== NULL_TREE
)
6102 fndecl
= MEM_EXPR (XEXP (call
, 0));
6104 && TREE_CODE (TREE_TYPE (fndecl
)) != FUNCTION_TYPE
6105 && TREE_CODE (TREE_TYPE (fndecl
)) != METHOD_TYPE
)
6107 if (fndecl
&& TYPE_ARG_TYPES (TREE_TYPE (fndecl
)))
6108 type
= TREE_TYPE (fndecl
);
6109 if (fndecl
&& TREE_CODE (fndecl
) != FUNCTION_DECL
)
6111 if (TREE_CODE (fndecl
) == INDIRECT_REF
6112 && TREE_CODE (TREE_OPERAND (fndecl
, 0)) == OBJ_TYPE_REF
)
6113 obj_type_ref
= TREE_OPERAND (fndecl
, 0);
6118 for (t
= TYPE_ARG_TYPES (type
); t
&& t
!= void_list_node
;
6120 if (TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
6121 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_VALUE (t
))))
6123 if ((t
== NULL
|| t
== void_list_node
) && obj_type_ref
== NULL_TREE
)
6127 int nargs ATTRIBUTE_UNUSED
= list_length (TYPE_ARG_TYPES (type
));
6128 link
= CALL_INSN_FUNCTION_USAGE (insn
);
6129 #ifndef PCC_STATIC_STRUCT_RETURN
6130 if (aggregate_value_p (TREE_TYPE (type
), type
)
6131 && targetm
.calls
.struct_value_rtx (type
, 0) == 0)
6133 tree struct_addr
= build_pointer_type (TREE_TYPE (type
));
6134 machine_mode mode
= TYPE_MODE (struct_addr
);
6136 INIT_CUMULATIVE_ARGS (args_so_far_v
, type
, NULL_RTX
, fndecl
,
6138 reg
= targetm
.calls
.function_arg (args_so_far
, mode
,
6140 targetm
.calls
.function_arg_advance (args_so_far
, mode
,
6142 if (reg
== NULL_RTX
)
6144 for (; link
; link
= XEXP (link
, 1))
6145 if (GET_CODE (XEXP (link
, 0)) == USE
6146 && MEM_P (XEXP (XEXP (link
, 0), 0)))
6148 link
= XEXP (link
, 1);
6155 INIT_CUMULATIVE_ARGS (args_so_far_v
, type
, NULL_RTX
, fndecl
,
6157 if (obj_type_ref
&& TYPE_ARG_TYPES (type
) != void_list_node
)
6160 t
= TYPE_ARG_TYPES (type
);
6161 mode
= TYPE_MODE (TREE_VALUE (t
));
6162 this_arg
= targetm
.calls
.function_arg (args_so_far
, mode
,
6163 TREE_VALUE (t
), true);
6164 if (this_arg
&& !REG_P (this_arg
))
6165 this_arg
= NULL_RTX
;
6166 else if (this_arg
== NULL_RTX
)
6168 for (; link
; link
= XEXP (link
, 1))
6169 if (GET_CODE (XEXP (link
, 0)) == USE
6170 && MEM_P (XEXP (XEXP (link
, 0), 0)))
6172 this_arg
= XEXP (XEXP (link
, 0), 0);
6180 t
= type
? TYPE_ARG_TYPES (type
) : NULL_TREE
;
6182 for (link
= CALL_INSN_FUNCTION_USAGE (insn
); link
; link
= XEXP (link
, 1))
6183 if (GET_CODE (XEXP (link
, 0)) == USE
)
6185 rtx item
= NULL_RTX
;
6186 x
= XEXP (XEXP (link
, 0), 0);
6187 if (GET_MODE (link
) == VOIDmode
6188 || GET_MODE (link
) == BLKmode
6189 || (GET_MODE (link
) != GET_MODE (x
)
6190 && ((GET_MODE_CLASS (GET_MODE (link
)) != MODE_INT
6191 && GET_MODE_CLASS (GET_MODE (link
)) != MODE_PARTIAL_INT
)
6192 || (GET_MODE_CLASS (GET_MODE (x
)) != MODE_INT
6193 && GET_MODE_CLASS (GET_MODE (x
)) != MODE_PARTIAL_INT
))))
6194 /* Can't do anything for these, if the original type mode
6195 isn't known or can't be converted. */;
6198 cselib_val
*val
= cselib_lookup (x
, GET_MODE (x
), 0, VOIDmode
);
6199 if (val
&& cselib_preserved_value_p (val
))
6200 item
= val
->val_rtx
;
6201 else if (GET_MODE_CLASS (GET_MODE (x
)) == MODE_INT
6202 || GET_MODE_CLASS (GET_MODE (x
)) == MODE_PARTIAL_INT
)
6204 machine_mode mode
= GET_MODE (x
);
6206 while ((mode
= GET_MODE_WIDER_MODE (mode
)) != VOIDmode
6207 && GET_MODE_BITSIZE (mode
) <= BITS_PER_WORD
)
6209 rtx reg
= simplify_subreg (mode
, x
, GET_MODE (x
), 0);
6211 if (reg
== NULL_RTX
|| !REG_P (reg
))
6213 val
= cselib_lookup (reg
, mode
, 0, VOIDmode
);
6214 if (val
&& cselib_preserved_value_p (val
))
6216 item
= val
->val_rtx
;
6227 if (!frame_pointer_needed
)
6229 struct adjust_mem_data amd
;
6230 amd
.mem_mode
= VOIDmode
;
6231 amd
.stack_adjust
= -VTI (bb
)->out
.stack_adjust
;
6232 amd
.side_effects
= NULL
;
6234 mem
= simplify_replace_fn_rtx (mem
, NULL_RTX
, adjust_mems
,
6236 gcc_assert (amd
.side_effects
== NULL_RTX
);
6238 val
= cselib_lookup (mem
, GET_MODE (mem
), 0, VOIDmode
);
6239 if (val
&& cselib_preserved_value_p (val
))
6240 item
= val
->val_rtx
;
6241 else if (GET_MODE_CLASS (GET_MODE (mem
)) != MODE_INT
6242 && GET_MODE_CLASS (GET_MODE (mem
)) != MODE_PARTIAL_INT
)
6244 /* For non-integer stack argument see also if they weren't
6245 initialized by integers. */
6246 machine_mode imode
= int_mode_for_mode (GET_MODE (mem
));
6247 if (imode
!= GET_MODE (mem
) && imode
!= BLKmode
)
6249 val
= cselib_lookup (adjust_address_nv (mem
, imode
, 0),
6250 imode
, 0, VOIDmode
);
6251 if (val
&& cselib_preserved_value_p (val
))
6252 item
= lowpart_subreg (GET_MODE (x
), val
->val_rtx
,
6260 if (GET_MODE (item
) != GET_MODE (link
))
6261 item
= lowpart_subreg (GET_MODE (link
), item
, GET_MODE (item
));
6262 if (GET_MODE (x2
) != GET_MODE (link
))
6263 x2
= lowpart_subreg (GET_MODE (link
), x2
, GET_MODE (x2
));
6264 item
= gen_rtx_CONCAT (GET_MODE (link
), x2
, item
);
6266 = gen_rtx_EXPR_LIST (VOIDmode
, item
, call_arguments
);
6268 if (t
&& t
!= void_list_node
)
6270 tree argtype
= TREE_VALUE (t
);
6271 machine_mode mode
= TYPE_MODE (argtype
);
6273 if (pass_by_reference (&args_so_far_v
, mode
, argtype
, true))
6275 argtype
= build_pointer_type (argtype
);
6276 mode
= TYPE_MODE (argtype
);
6278 reg
= targetm
.calls
.function_arg (args_so_far
, mode
,
6280 if (TREE_CODE (argtype
) == REFERENCE_TYPE
6281 && INTEGRAL_TYPE_P (TREE_TYPE (argtype
))
6284 && GET_MODE (reg
) == mode
6285 && (GET_MODE_CLASS (mode
) == MODE_INT
6286 || GET_MODE_CLASS (mode
) == MODE_PARTIAL_INT
)
6288 && REGNO (x
) == REGNO (reg
)
6289 && GET_MODE (x
) == mode
6292 machine_mode indmode
6293 = TYPE_MODE (TREE_TYPE (argtype
));
6294 rtx mem
= gen_rtx_MEM (indmode
, x
);
6295 cselib_val
*val
= cselib_lookup (mem
, indmode
, 0, VOIDmode
);
6296 if (val
&& cselib_preserved_value_p (val
))
6298 item
= gen_rtx_CONCAT (indmode
, mem
, val
->val_rtx
);
6299 call_arguments
= gen_rtx_EXPR_LIST (VOIDmode
, item
,
6304 struct elt_loc_list
*l
;
6307 /* Try harder, when passing address of a constant
6308 pool integer it can be easily read back. */
6309 item
= XEXP (item
, 1);
6310 if (GET_CODE (item
) == SUBREG
)
6311 item
= SUBREG_REG (item
);
6312 gcc_assert (GET_CODE (item
) == VALUE
);
6313 val
= CSELIB_VAL_PTR (item
);
6314 for (l
= val
->locs
; l
; l
= l
->next
)
6315 if (GET_CODE (l
->loc
) == SYMBOL_REF
6316 && TREE_CONSTANT_POOL_ADDRESS_P (l
->loc
)
6317 && SYMBOL_REF_DECL (l
->loc
)
6318 && DECL_INITIAL (SYMBOL_REF_DECL (l
->loc
)))
6320 initial
= DECL_INITIAL (SYMBOL_REF_DECL (l
->loc
));
6321 if (tree_fits_shwi_p (initial
))
6323 item
= GEN_INT (tree_to_shwi (initial
));
6324 item
= gen_rtx_CONCAT (indmode
, mem
, item
);
6326 = gen_rtx_EXPR_LIST (VOIDmode
, item
,
6333 targetm
.calls
.function_arg_advance (args_so_far
, mode
,
6339 /* Add debug arguments. */
6341 && TREE_CODE (fndecl
) == FUNCTION_DECL
6342 && DECL_HAS_DEBUG_ARGS_P (fndecl
))
6344 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (fndecl
);
6349 for (ix
= 0; vec_safe_iterate (*debug_args
, ix
, ¶m
); ix
+= 2)
6352 tree dtemp
= (**debug_args
)[ix
+ 1];
6353 machine_mode mode
= DECL_MODE (dtemp
);
6354 item
= gen_rtx_DEBUG_PARAMETER_REF (mode
, param
);
6355 item
= gen_rtx_CONCAT (mode
, item
, DECL_RTL_KNOWN_SET (dtemp
));
6356 call_arguments
= gen_rtx_EXPR_LIST (VOIDmode
, item
,
6362 /* Reverse call_arguments chain. */
6364 for (cur
= call_arguments
; cur
; cur
= next
)
6366 next
= XEXP (cur
, 1);
6367 XEXP (cur
, 1) = prev
;
6370 call_arguments
= prev
;
6372 x
= get_call_rtx_from (insn
);
6375 x
= XEXP (XEXP (x
, 0), 0);
6376 if (GET_CODE (x
) == SYMBOL_REF
)
6377 /* Don't record anything. */;
6378 else if (CONSTANT_P (x
))
6380 x
= gen_rtx_CONCAT (GET_MODE (x
) == VOIDmode
? Pmode
: GET_MODE (x
),
6383 = gen_rtx_EXPR_LIST (VOIDmode
, x
, call_arguments
);
6387 cselib_val
*val
= cselib_lookup (x
, GET_MODE (x
), 0, VOIDmode
);
6388 if (val
&& cselib_preserved_value_p (val
))
6390 x
= gen_rtx_CONCAT (GET_MODE (x
), pc_rtx
, val
->val_rtx
);
6392 = gen_rtx_EXPR_LIST (VOIDmode
, x
, call_arguments
);
6399 = TYPE_MODE (TREE_TYPE (OBJ_TYPE_REF_EXPR (obj_type_ref
)));
6400 rtx clobbered
= gen_rtx_MEM (mode
, this_arg
);
6402 = tree_to_shwi (OBJ_TYPE_REF_TOKEN (obj_type_ref
));
6404 clobbered
= plus_constant (mode
, clobbered
,
6405 token
* GET_MODE_SIZE (mode
));
6406 clobbered
= gen_rtx_MEM (mode
, clobbered
);
6407 x
= gen_rtx_CONCAT (mode
, gen_rtx_CLOBBER (VOIDmode
, pc_rtx
), clobbered
);
6409 = gen_rtx_EXPR_LIST (VOIDmode
, x
, call_arguments
);
6413 /* Callback for cselib_record_sets_hook, that records as micro
6414 operations uses and stores in an insn after cselib_record_sets has
6415 analyzed the sets in an insn, but before it modifies the stored
6416 values in the internal tables, unless cselib_record_sets doesn't
6417 call it directly (perhaps because we're not doing cselib in the
6418 first place, in which case sets and n_sets will be 0). */
6421 add_with_sets (rtx_insn
*insn
, struct cselib_set
*sets
, int n_sets
)
6423 basic_block bb
= BLOCK_FOR_INSN (insn
);
6425 struct count_use_info cui
;
6426 micro_operation
*mos
;
6428 cselib_hook_called
= true;
6433 cui
.n_sets
= n_sets
;
6435 n1
= VTI (bb
)->mos
.length ();
6436 cui
.store_p
= false;
6437 note_uses (&PATTERN (insn
), add_uses_1
, &cui
);
6438 n2
= VTI (bb
)->mos
.length () - 1;
6439 mos
= VTI (bb
)->mos
.address ();
6441 /* Order the MO_USEs to be before MO_USE_NO_VARs and MO_VAL_USE, and
6445 while (n1
< n2
&& mos
[n1
].type
== MO_USE
)
6447 while (n1
< n2
&& mos
[n2
].type
!= MO_USE
)
6450 std::swap (mos
[n1
], mos
[n2
]);
6453 n2
= VTI (bb
)->mos
.length () - 1;
6456 while (n1
< n2
&& mos
[n1
].type
!= MO_VAL_LOC
)
6458 while (n1
< n2
&& mos
[n2
].type
== MO_VAL_LOC
)
6461 std::swap (mos
[n1
], mos
[n2
]);
6470 mo
.u
.loc
= call_arguments
;
6471 call_arguments
= NULL_RTX
;
6473 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
6474 log_op_type (PATTERN (insn
), bb
, insn
, mo
.type
, dump_file
);
6475 VTI (bb
)->mos
.safe_push (mo
);
6478 n1
= VTI (bb
)->mos
.length ();
6479 /* This will record NEXT_INSN (insn), such that we can
6480 insert notes before it without worrying about any
6481 notes that MO_USEs might emit after the insn. */
6483 note_stores (PATTERN (insn
), add_stores
, &cui
);
6484 n2
= VTI (bb
)->mos
.length () - 1;
6485 mos
= VTI (bb
)->mos
.address ();
6487 /* Order the MO_VAL_USEs first (note_stores does nothing
6488 on DEBUG_INSNs, so there are no MO_VAL_LOCs from this
6489 insn), then MO_CLOBBERs, then MO_SET/MO_COPY/MO_VAL_SET. */
6492 while (n1
< n2
&& mos
[n1
].type
== MO_VAL_USE
)
6494 while (n1
< n2
&& mos
[n2
].type
!= MO_VAL_USE
)
6497 std::swap (mos
[n1
], mos
[n2
]);
6500 n2
= VTI (bb
)->mos
.length () - 1;
6503 while (n1
< n2
&& mos
[n1
].type
== MO_CLOBBER
)
6505 while (n1
< n2
&& mos
[n2
].type
!= MO_CLOBBER
)
6508 std::swap (mos
[n1
], mos
[n2
]);
6512 static enum var_init_status
6513 find_src_status (dataflow_set
*in
, rtx src
)
6515 tree decl
= NULL_TREE
;
6516 enum var_init_status status
= VAR_INIT_STATUS_UNINITIALIZED
;
6518 if (! flag_var_tracking_uninit
)
6519 status
= VAR_INIT_STATUS_INITIALIZED
;
6521 if (src
&& REG_P (src
))
6522 decl
= var_debug_decl (REG_EXPR (src
));
6523 else if (src
&& MEM_P (src
))
6524 decl
= var_debug_decl (MEM_EXPR (src
));
6527 status
= get_init_value (in
, src
, dv_from_decl (decl
));
6532 /* SRC is the source of an assignment. Use SET to try to find what
6533 was ultimately assigned to SRC. Return that value if known,
6534 otherwise return SRC itself. */
6537 find_src_set_src (dataflow_set
*set
, rtx src
)
6539 tree decl
= NULL_TREE
; /* The variable being copied around. */
6540 rtx set_src
= NULL_RTX
; /* The value for "decl" stored in "src". */
6542 location_chain
*nextp
;
6546 if (src
&& REG_P (src
))
6547 decl
= var_debug_decl (REG_EXPR (src
));
6548 else if (src
&& MEM_P (src
))
6549 decl
= var_debug_decl (MEM_EXPR (src
));
6553 decl_or_value dv
= dv_from_decl (decl
);
6555 var
= shared_hash_find (set
->vars
, dv
);
6559 for (i
= 0; i
< var
->n_var_parts
&& !found
; i
++)
6560 for (nextp
= var
->var_part
[i
].loc_chain
; nextp
&& !found
;
6561 nextp
= nextp
->next
)
6562 if (rtx_equal_p (nextp
->loc
, src
))
6564 set_src
= nextp
->set_src
;
6574 /* Compute the changes of variable locations in the basic block BB. */
6577 compute_bb_dataflow (basic_block bb
)
6580 micro_operation
*mo
;
6582 dataflow_set old_out
;
6583 dataflow_set
*in
= &VTI (bb
)->in
;
6584 dataflow_set
*out
= &VTI (bb
)->out
;
6586 dataflow_set_init (&old_out
);
6587 dataflow_set_copy (&old_out
, out
);
6588 dataflow_set_copy (out
, in
);
6590 if (MAY_HAVE_DEBUG_INSNS
)
6591 local_get_addr_cache
= new hash_map
<rtx
, rtx
>;
6593 FOR_EACH_VEC_ELT (VTI (bb
)->mos
, i
, mo
)
6595 rtx_insn
*insn
= mo
->insn
;
6600 dataflow_set_clear_at_call (out
, insn
);
6605 rtx loc
= mo
->u
.loc
;
6608 var_reg_set (out
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
6609 else if (MEM_P (loc
))
6610 var_mem_set (out
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
6616 rtx loc
= mo
->u
.loc
;
6620 if (GET_CODE (loc
) == CONCAT
)
6622 val
= XEXP (loc
, 0);
6623 vloc
= XEXP (loc
, 1);
6631 var
= PAT_VAR_LOCATION_DECL (vloc
);
6633 clobber_variable_part (out
, NULL_RTX
,
6634 dv_from_decl (var
), 0, NULL_RTX
);
6637 if (VAL_NEEDS_RESOLUTION (loc
))
6638 val_resolve (out
, val
, PAT_VAR_LOCATION_LOC (vloc
), insn
);
6639 set_variable_part (out
, val
, dv_from_decl (var
), 0,
6640 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
6643 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc
)))
6644 set_variable_part (out
, PAT_VAR_LOCATION_LOC (vloc
),
6645 dv_from_decl (var
), 0,
6646 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
6653 rtx loc
= mo
->u
.loc
;
6654 rtx val
, vloc
, uloc
;
6656 vloc
= uloc
= XEXP (loc
, 1);
6657 val
= XEXP (loc
, 0);
6659 if (GET_CODE (val
) == CONCAT
)
6661 uloc
= XEXP (val
, 1);
6662 val
= XEXP (val
, 0);
6665 if (VAL_NEEDS_RESOLUTION (loc
))
6666 val_resolve (out
, val
, vloc
, insn
);
6668 val_store (out
, val
, uloc
, insn
, false);
6670 if (VAL_HOLDS_TRACK_EXPR (loc
))
6672 if (GET_CODE (uloc
) == REG
)
6673 var_reg_set (out
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
6675 else if (GET_CODE (uloc
) == MEM
)
6676 var_mem_set (out
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
6684 rtx loc
= mo
->u
.loc
;
6685 rtx val
, vloc
, uloc
;
6689 uloc
= XEXP (vloc
, 1);
6690 val
= XEXP (vloc
, 0);
6693 if (GET_CODE (uloc
) == SET
)
6695 dstv
= SET_DEST (uloc
);
6696 srcv
= SET_SRC (uloc
);
6704 if (GET_CODE (val
) == CONCAT
)
6706 dstv
= vloc
= XEXP (val
, 1);
6707 val
= XEXP (val
, 0);
6710 if (GET_CODE (vloc
) == SET
)
6712 srcv
= SET_SRC (vloc
);
6714 gcc_assert (val
!= srcv
);
6715 gcc_assert (vloc
== uloc
|| VAL_NEEDS_RESOLUTION (loc
));
6717 dstv
= vloc
= SET_DEST (vloc
);
6719 if (VAL_NEEDS_RESOLUTION (loc
))
6720 val_resolve (out
, val
, srcv
, insn
);
6722 else if (VAL_NEEDS_RESOLUTION (loc
))
6724 gcc_assert (GET_CODE (uloc
) == SET
6725 && GET_CODE (SET_SRC (uloc
)) == REG
);
6726 val_resolve (out
, val
, SET_SRC (uloc
), insn
);
6729 if (VAL_HOLDS_TRACK_EXPR (loc
))
6731 if (VAL_EXPR_IS_CLOBBERED (loc
))
6734 var_reg_delete (out
, uloc
, true);
6735 else if (MEM_P (uloc
))
6737 gcc_assert (MEM_P (dstv
));
6738 gcc_assert (MEM_ATTRS (dstv
) == MEM_ATTRS (uloc
));
6739 var_mem_delete (out
, dstv
, true);
6744 bool copied_p
= VAL_EXPR_IS_COPIED (loc
);
6745 rtx src
= NULL
, dst
= uloc
;
6746 enum var_init_status status
= VAR_INIT_STATUS_INITIALIZED
;
6748 if (GET_CODE (uloc
) == SET
)
6750 src
= SET_SRC (uloc
);
6751 dst
= SET_DEST (uloc
);
6756 if (flag_var_tracking_uninit
)
6758 status
= find_src_status (in
, src
);
6760 if (status
== VAR_INIT_STATUS_UNKNOWN
)
6761 status
= find_src_status (out
, src
);
6764 src
= find_src_set_src (in
, src
);
6768 var_reg_delete_and_set (out
, dst
, !copied_p
,
6770 else if (MEM_P (dst
))
6772 gcc_assert (MEM_P (dstv
));
6773 gcc_assert (MEM_ATTRS (dstv
) == MEM_ATTRS (dst
));
6774 var_mem_delete_and_set (out
, dstv
, !copied_p
,
6779 else if (REG_P (uloc
))
6780 var_regno_delete (out
, REGNO (uloc
));
6781 else if (MEM_P (uloc
))
6783 gcc_checking_assert (GET_CODE (vloc
) == MEM
);
6784 gcc_checking_assert (dstv
== vloc
);
6786 clobber_overlapping_mems (out
, vloc
);
6789 val_store (out
, val
, dstv
, insn
, true);
6795 rtx loc
= mo
->u
.loc
;
6798 if (GET_CODE (loc
) == SET
)
6800 set_src
= SET_SRC (loc
);
6801 loc
= SET_DEST (loc
);
6805 var_reg_delete_and_set (out
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
6807 else if (MEM_P (loc
))
6808 var_mem_delete_and_set (out
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
6815 rtx loc
= mo
->u
.loc
;
6816 enum var_init_status src_status
;
6819 if (GET_CODE (loc
) == SET
)
6821 set_src
= SET_SRC (loc
);
6822 loc
= SET_DEST (loc
);
6825 if (! flag_var_tracking_uninit
)
6826 src_status
= VAR_INIT_STATUS_INITIALIZED
;
6829 src_status
= find_src_status (in
, set_src
);
6831 if (src_status
== VAR_INIT_STATUS_UNKNOWN
)
6832 src_status
= find_src_status (out
, set_src
);
6835 set_src
= find_src_set_src (in
, set_src
);
6838 var_reg_delete_and_set (out
, loc
, false, src_status
, set_src
);
6839 else if (MEM_P (loc
))
6840 var_mem_delete_and_set (out
, loc
, false, src_status
, set_src
);
6846 rtx loc
= mo
->u
.loc
;
6849 var_reg_delete (out
, loc
, false);
6850 else if (MEM_P (loc
))
6851 var_mem_delete (out
, loc
, false);
6857 rtx loc
= mo
->u
.loc
;
6860 var_reg_delete (out
, loc
, true);
6861 else if (MEM_P (loc
))
6862 var_mem_delete (out
, loc
, true);
6867 out
->stack_adjust
+= mo
->u
.adjust
;
6872 if (MAY_HAVE_DEBUG_INSNS
)
6874 delete local_get_addr_cache
;
6875 local_get_addr_cache
= NULL
;
6877 dataflow_set_equiv_regs (out
);
6878 shared_hash_htab (out
->vars
)
6879 ->traverse
<dataflow_set
*, canonicalize_values_mark
> (out
);
6880 shared_hash_htab (out
->vars
)
6881 ->traverse
<dataflow_set
*, canonicalize_values_star
> (out
);
6883 shared_hash_htab (out
->vars
)
6884 ->traverse
<dataflow_set
*, canonicalize_loc_order_check
> (out
);
6886 changed
= dataflow_set_different (&old_out
, out
);
6887 dataflow_set_destroy (&old_out
);
6891 /* Find the locations of variables in the whole function. */
6894 vt_find_locations (void)
6896 bb_heap_t
*worklist
= new bb_heap_t (LONG_MIN
);
6897 bb_heap_t
*pending
= new bb_heap_t (LONG_MIN
);
6898 sbitmap visited
, in_worklist
, in_pending
;
6905 int htabmax
= PARAM_VALUE (PARAM_MAX_VARTRACK_SIZE
);
6906 bool success
= true;
6908 timevar_push (TV_VAR_TRACKING_DATAFLOW
);
6909 /* Compute reverse completion order of depth first search of the CFG
6910 so that the data-flow runs faster. */
6911 rc_order
= XNEWVEC (int, n_basic_blocks_for_fn (cfun
) - NUM_FIXED_BLOCKS
);
6912 bb_order
= XNEWVEC (int, last_basic_block_for_fn (cfun
));
6913 pre_and_rev_post_order_compute (NULL
, rc_order
, false);
6914 for (i
= 0; i
< n_basic_blocks_for_fn (cfun
) - NUM_FIXED_BLOCKS
; i
++)
6915 bb_order
[rc_order
[i
]] = i
;
6918 visited
= sbitmap_alloc (last_basic_block_for_fn (cfun
));
6919 in_worklist
= sbitmap_alloc (last_basic_block_for_fn (cfun
));
6920 in_pending
= sbitmap_alloc (last_basic_block_for_fn (cfun
));
6921 bitmap_clear (in_worklist
);
6923 FOR_EACH_BB_FN (bb
, cfun
)
6924 pending
->insert (bb_order
[bb
->index
], bb
);
6925 bitmap_ones (in_pending
);
6927 while (success
&& !pending
->empty ())
6929 std::swap (worklist
, pending
);
6930 std::swap (in_worklist
, in_pending
);
6932 bitmap_clear (visited
);
6934 while (!worklist
->empty ())
6936 bb
= worklist
->extract_min ();
6937 bitmap_clear_bit (in_worklist
, bb
->index
);
6938 gcc_assert (!bitmap_bit_p (visited
, bb
->index
));
6939 if (!bitmap_bit_p (visited
, bb
->index
))
6943 int oldinsz
, oldoutsz
;
6945 bitmap_set_bit (visited
, bb
->index
);
6947 if (VTI (bb
)->in
.vars
)
6950 -= shared_hash_htab (VTI (bb
)->in
.vars
)->size ()
6951 + shared_hash_htab (VTI (bb
)->out
.vars
)->size ();
6952 oldinsz
= shared_hash_htab (VTI (bb
)->in
.vars
)->elements ();
6954 = shared_hash_htab (VTI (bb
)->out
.vars
)->elements ();
6957 oldinsz
= oldoutsz
= 0;
6959 if (MAY_HAVE_DEBUG_INSNS
)
6961 dataflow_set
*in
= &VTI (bb
)->in
, *first_out
= NULL
;
6962 bool first
= true, adjust
= false;
6964 /* Calculate the IN set as the intersection of
6965 predecessor OUT sets. */
6967 dataflow_set_clear (in
);
6968 dst_can_be_shared
= true;
6970 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6971 if (!VTI (e
->src
)->flooded
)
6972 gcc_assert (bb_order
[bb
->index
]
6973 <= bb_order
[e
->src
->index
]);
6976 dataflow_set_copy (in
, &VTI (e
->src
)->out
);
6977 first_out
= &VTI (e
->src
)->out
;
6982 dataflow_set_merge (in
, &VTI (e
->src
)->out
);
6988 dataflow_post_merge_adjust (in
, &VTI (bb
)->permp
);
6991 /* Merge and merge_adjust should keep entries in
6993 shared_hash_htab (in
->vars
)
6994 ->traverse
<dataflow_set
*,
6995 canonicalize_loc_order_check
> (in
);
6997 if (dst_can_be_shared
)
6999 shared_hash_destroy (in
->vars
);
7000 in
->vars
= shared_hash_copy (first_out
->vars
);
7004 VTI (bb
)->flooded
= true;
7008 /* Calculate the IN set as union of predecessor OUT sets. */
7009 dataflow_set_clear (&VTI (bb
)->in
);
7010 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
7011 dataflow_set_union (&VTI (bb
)->in
, &VTI (e
->src
)->out
);
7014 changed
= compute_bb_dataflow (bb
);
7015 htabsz
+= shared_hash_htab (VTI (bb
)->in
.vars
)->size ()
7016 + shared_hash_htab (VTI (bb
)->out
.vars
)->size ();
7018 if (htabmax
&& htabsz
> htabmax
)
7020 if (MAY_HAVE_DEBUG_INSNS
)
7021 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
7022 "variable tracking size limit exceeded with "
7023 "-fvar-tracking-assignments, retrying without");
7025 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
7026 "variable tracking size limit exceeded");
7033 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7035 if (e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
7038 if (bitmap_bit_p (visited
, e
->dest
->index
))
7040 if (!bitmap_bit_p (in_pending
, e
->dest
->index
))
7042 /* Send E->DEST to next round. */
7043 bitmap_set_bit (in_pending
, e
->dest
->index
);
7044 pending
->insert (bb_order
[e
->dest
->index
],
7048 else if (!bitmap_bit_p (in_worklist
, e
->dest
->index
))
7050 /* Add E->DEST to current round. */
7051 bitmap_set_bit (in_worklist
, e
->dest
->index
);
7052 worklist
->insert (bb_order
[e
->dest
->index
],
7060 "BB %i: in %i (was %i), out %i (was %i), rem %i + %i, tsz %i\n",
7062 (int)shared_hash_htab (VTI (bb
)->in
.vars
)->size (),
7064 (int)shared_hash_htab (VTI (bb
)->out
.vars
)->size (),
7066 (int)worklist
->nodes (), (int)pending
->nodes (),
7069 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
7071 fprintf (dump_file
, "BB %i IN:\n", bb
->index
);
7072 dump_dataflow_set (&VTI (bb
)->in
);
7073 fprintf (dump_file
, "BB %i OUT:\n", bb
->index
);
7074 dump_dataflow_set (&VTI (bb
)->out
);
7080 if (success
&& MAY_HAVE_DEBUG_INSNS
)
7081 FOR_EACH_BB_FN (bb
, cfun
)
7082 gcc_assert (VTI (bb
)->flooded
);
7087 sbitmap_free (visited
);
7088 sbitmap_free (in_worklist
);
7089 sbitmap_free (in_pending
);
7091 timevar_pop (TV_VAR_TRACKING_DATAFLOW
);
7095 /* Print the content of the LIST to dump file. */
7098 dump_attrs_list (attrs
*list
)
7100 for (; list
; list
= list
->next
)
7102 if (dv_is_decl_p (list
->dv
))
7103 print_mem_expr (dump_file
, dv_as_decl (list
->dv
));
7105 print_rtl_single (dump_file
, dv_as_value (list
->dv
));
7106 fprintf (dump_file
, "+" HOST_WIDE_INT_PRINT_DEC
, list
->offset
);
7108 fprintf (dump_file
, "\n");
7111 /* Print the information about variable *SLOT to dump file. */
7114 dump_var_tracking_slot (variable
**slot
, void *data ATTRIBUTE_UNUSED
)
7116 variable
*var
= *slot
;
7120 /* Continue traversing the hash table. */
7124 /* Print the information about variable VAR to dump file. */
7127 dump_var (variable
*var
)
7130 location_chain
*node
;
7132 if (dv_is_decl_p (var
->dv
))
7134 const_tree decl
= dv_as_decl (var
->dv
);
7136 if (DECL_NAME (decl
))
7138 fprintf (dump_file
, " name: %s",
7139 IDENTIFIER_POINTER (DECL_NAME (decl
)));
7140 if (dump_flags
& TDF_UID
)
7141 fprintf (dump_file
, "D.%u", DECL_UID (decl
));
7143 else if (TREE_CODE (decl
) == DEBUG_EXPR_DECL
)
7144 fprintf (dump_file
, " name: D#%u", DEBUG_TEMP_UID (decl
));
7146 fprintf (dump_file
, " name: D.%u", DECL_UID (decl
));
7147 fprintf (dump_file
, "\n");
7151 fputc (' ', dump_file
);
7152 print_rtl_single (dump_file
, dv_as_value (var
->dv
));
7155 for (i
= 0; i
< var
->n_var_parts
; i
++)
7157 fprintf (dump_file
, " offset %ld\n",
7158 (long)(var
->onepart
? 0 : VAR_PART_OFFSET (var
, i
)));
7159 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
7161 fprintf (dump_file
, " ");
7162 if (node
->init
== VAR_INIT_STATUS_UNINITIALIZED
)
7163 fprintf (dump_file
, "[uninit]");
7164 print_rtl_single (dump_file
, node
->loc
);
7169 /* Print the information about variables from hash table VARS to dump file. */
7172 dump_vars (variable_table_type
*vars
)
7174 if (vars
->elements () > 0)
7176 fprintf (dump_file
, "Variables:\n");
7177 vars
->traverse
<void *, dump_var_tracking_slot
> (NULL
);
7181 /* Print the dataflow set SET to dump file. */
7184 dump_dataflow_set (dataflow_set
*set
)
7188 fprintf (dump_file
, "Stack adjustment: " HOST_WIDE_INT_PRINT_DEC
"\n",
7190 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
7194 fprintf (dump_file
, "Reg %d:", i
);
7195 dump_attrs_list (set
->regs
[i
]);
7198 dump_vars (shared_hash_htab (set
->vars
));
7199 fprintf (dump_file
, "\n");
7202 /* Print the IN and OUT sets for each basic block to dump file. */
7205 dump_dataflow_sets (void)
7209 FOR_EACH_BB_FN (bb
, cfun
)
7211 fprintf (dump_file
, "\nBasic block %d:\n", bb
->index
);
7212 fprintf (dump_file
, "IN:\n");
7213 dump_dataflow_set (&VTI (bb
)->in
);
7214 fprintf (dump_file
, "OUT:\n");
7215 dump_dataflow_set (&VTI (bb
)->out
);
7219 /* Return the variable for DV in dropped_values, inserting one if
7220 requested with INSERT. */
7222 static inline variable
*
7223 variable_from_dropped (decl_or_value dv
, enum insert_option insert
)
7226 variable
*empty_var
;
7227 onepart_enum onepart
;
7229 slot
= dropped_values
->find_slot_with_hash (dv
, dv_htab_hash (dv
), insert
);
7237 gcc_checking_assert (insert
== INSERT
);
7239 onepart
= dv_onepart_p (dv
);
7241 gcc_checking_assert (onepart
== ONEPART_VALUE
|| onepart
== ONEPART_DEXPR
);
7243 empty_var
= onepart_pool_allocate (onepart
);
7245 empty_var
->refcount
= 1;
7246 empty_var
->n_var_parts
= 0;
7247 empty_var
->onepart
= onepart
;
7248 empty_var
->in_changed_variables
= false;
7249 empty_var
->var_part
[0].loc_chain
= NULL
;
7250 empty_var
->var_part
[0].cur_loc
= NULL
;
7251 VAR_LOC_1PAUX (empty_var
) = NULL
;
7252 set_dv_changed (dv
, true);
7259 /* Recover the one-part aux from dropped_values. */
7261 static struct onepart_aux
*
7262 recover_dropped_1paux (variable
*var
)
7266 gcc_checking_assert (var
->onepart
);
7268 if (VAR_LOC_1PAUX (var
))
7269 return VAR_LOC_1PAUX (var
);
7271 if (var
->onepart
== ONEPART_VDECL
)
7274 dvar
= variable_from_dropped (var
->dv
, NO_INSERT
);
7279 VAR_LOC_1PAUX (var
) = VAR_LOC_1PAUX (dvar
);
7280 VAR_LOC_1PAUX (dvar
) = NULL
;
7282 return VAR_LOC_1PAUX (var
);
7285 /* Add variable VAR to the hash table of changed variables and
7286 if it has no locations delete it from SET's hash table. */
7289 variable_was_changed (variable
*var
, dataflow_set
*set
)
7291 hashval_t hash
= dv_htab_hash (var
->dv
);
7297 /* Remember this decl or VALUE has been added to changed_variables. */
7298 set_dv_changed (var
->dv
, true);
7300 slot
= changed_variables
->find_slot_with_hash (var
->dv
, hash
, INSERT
);
7304 variable
*old_var
= *slot
;
7305 gcc_assert (old_var
->in_changed_variables
);
7306 old_var
->in_changed_variables
= false;
7307 if (var
!= old_var
&& var
->onepart
)
7309 /* Restore the auxiliary info from an empty variable
7310 previously created for changed_variables, so it is
7312 gcc_checking_assert (!VAR_LOC_1PAUX (var
));
7313 VAR_LOC_1PAUX (var
) = VAR_LOC_1PAUX (old_var
);
7314 VAR_LOC_1PAUX (old_var
) = NULL
;
7316 variable_htab_free (*slot
);
7319 if (set
&& var
->n_var_parts
== 0)
7321 onepart_enum onepart
= var
->onepart
;
7322 variable
*empty_var
= NULL
;
7323 variable
**dslot
= NULL
;
7325 if (onepart
== ONEPART_VALUE
|| onepart
== ONEPART_DEXPR
)
7327 dslot
= dropped_values
->find_slot_with_hash (var
->dv
,
7328 dv_htab_hash (var
->dv
),
7334 gcc_checking_assert (!empty_var
->in_changed_variables
);
7335 if (!VAR_LOC_1PAUX (var
))
7337 VAR_LOC_1PAUX (var
) = VAR_LOC_1PAUX (empty_var
);
7338 VAR_LOC_1PAUX (empty_var
) = NULL
;
7341 gcc_checking_assert (!VAR_LOC_1PAUX (empty_var
));
7347 empty_var
= onepart_pool_allocate (onepart
);
7348 empty_var
->dv
= var
->dv
;
7349 empty_var
->refcount
= 1;
7350 empty_var
->n_var_parts
= 0;
7351 empty_var
->onepart
= onepart
;
7354 empty_var
->refcount
++;
7359 empty_var
->refcount
++;
7360 empty_var
->in_changed_variables
= true;
7364 empty_var
->var_part
[0].loc_chain
= NULL
;
7365 empty_var
->var_part
[0].cur_loc
= NULL
;
7366 VAR_LOC_1PAUX (empty_var
) = VAR_LOC_1PAUX (var
);
7367 VAR_LOC_1PAUX (var
) = NULL
;
7373 if (var
->onepart
&& !VAR_LOC_1PAUX (var
))
7374 recover_dropped_1paux (var
);
7376 var
->in_changed_variables
= true;
7383 if (var
->n_var_parts
== 0)
7388 slot
= shared_hash_find_slot_noinsert (set
->vars
, var
->dv
);
7391 if (shared_hash_shared (set
->vars
))
7392 slot
= shared_hash_find_slot_unshare (&set
->vars
, var
->dv
,
7394 shared_hash_htab (set
->vars
)->clear_slot (slot
);
7400 /* Look for the index in VAR->var_part corresponding to OFFSET.
7401 Return -1 if not found. If INSERTION_POINT is non-NULL, the
7402 referenced int will be set to the index that the part has or should
7403 have, if it should be inserted. */
7406 find_variable_location_part (variable
*var
, HOST_WIDE_INT offset
,
7407 int *insertion_point
)
7416 if (insertion_point
)
7417 *insertion_point
= 0;
7419 return var
->n_var_parts
- 1;
7422 /* Find the location part. */
7424 high
= var
->n_var_parts
;
7427 pos
= (low
+ high
) / 2;
7428 if (VAR_PART_OFFSET (var
, pos
) < offset
)
7435 if (insertion_point
)
7436 *insertion_point
= pos
;
7438 if (pos
< var
->n_var_parts
&& VAR_PART_OFFSET (var
, pos
) == offset
)
7445 set_slot_part (dataflow_set
*set
, rtx loc
, variable
**slot
,
7446 decl_or_value dv
, HOST_WIDE_INT offset
,
7447 enum var_init_status initialized
, rtx set_src
)
7450 location_chain
*node
, *next
;
7451 location_chain
**nextp
;
7453 onepart_enum onepart
;
7458 onepart
= var
->onepart
;
7460 onepart
= dv_onepart_p (dv
);
7462 gcc_checking_assert (offset
== 0 || !onepart
);
7463 gcc_checking_assert (loc
!= dv_as_opaque (dv
));
7465 if (! flag_var_tracking_uninit
)
7466 initialized
= VAR_INIT_STATUS_INITIALIZED
;
7470 /* Create new variable information. */
7471 var
= onepart_pool_allocate (onepart
);
7474 var
->n_var_parts
= 1;
7475 var
->onepart
= onepart
;
7476 var
->in_changed_variables
= false;
7478 VAR_LOC_1PAUX (var
) = NULL
;
7480 VAR_PART_OFFSET (var
, 0) = offset
;
7481 var
->var_part
[0].loc_chain
= NULL
;
7482 var
->var_part
[0].cur_loc
= NULL
;
7485 nextp
= &var
->var_part
[0].loc_chain
;
7491 gcc_assert (dv_as_opaque (var
->dv
) == dv_as_opaque (dv
));
7495 if (GET_CODE (loc
) == VALUE
)
7497 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
7498 nextp
= &node
->next
)
7499 if (GET_CODE (node
->loc
) == VALUE
)
7501 if (node
->loc
== loc
)
7506 if (canon_value_cmp (node
->loc
, loc
))
7514 else if (REG_P (node
->loc
) || MEM_P (node
->loc
))
7522 else if (REG_P (loc
))
7524 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
7525 nextp
= &node
->next
)
7526 if (REG_P (node
->loc
))
7528 if (REGNO (node
->loc
) < REGNO (loc
))
7532 if (REGNO (node
->loc
) == REGNO (loc
))
7545 else if (MEM_P (loc
))
7547 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
7548 nextp
= &node
->next
)
7549 if (REG_P (node
->loc
))
7551 else if (MEM_P (node
->loc
))
7553 if ((r
= loc_cmp (XEXP (node
->loc
, 0), XEXP (loc
, 0))) >= 0)
7565 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
7566 nextp
= &node
->next
)
7567 if ((r
= loc_cmp (node
->loc
, loc
)) >= 0)
7575 if (shared_var_p (var
, set
->vars
))
7577 slot
= unshare_variable (set
, slot
, var
, initialized
);
7579 for (nextp
= &var
->var_part
[0].loc_chain
; c
;
7580 nextp
= &(*nextp
)->next
)
7582 gcc_assert ((!node
&& !*nextp
) || node
->loc
== (*nextp
)->loc
);
7589 gcc_assert (dv_as_decl (var
->dv
) == dv_as_decl (dv
));
7591 pos
= find_variable_location_part (var
, offset
, &inspos
);
7595 node
= var
->var_part
[pos
].loc_chain
;
7598 && ((REG_P (node
->loc
) && REG_P (loc
)
7599 && REGNO (node
->loc
) == REGNO (loc
))
7600 || rtx_equal_p (node
->loc
, loc
)))
7602 /* LOC is in the beginning of the chain so we have nothing
7604 if (node
->init
< initialized
)
7605 node
->init
= initialized
;
7606 if (set_src
!= NULL
)
7607 node
->set_src
= set_src
;
7613 /* We have to make a copy of a shared variable. */
7614 if (shared_var_p (var
, set
->vars
))
7616 slot
= unshare_variable (set
, slot
, var
, initialized
);
7623 /* We have not found the location part, new one will be created. */
7625 /* We have to make a copy of the shared variable. */
7626 if (shared_var_p (var
, set
->vars
))
7628 slot
= unshare_variable (set
, slot
, var
, initialized
);
7632 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
7633 thus there are at most MAX_VAR_PARTS different offsets. */
7634 gcc_assert (var
->n_var_parts
< MAX_VAR_PARTS
7635 && (!var
->n_var_parts
|| !onepart
));
7637 /* We have to move the elements of array starting at index
7638 inspos to the next position. */
7639 for (pos
= var
->n_var_parts
; pos
> inspos
; pos
--)
7640 var
->var_part
[pos
] = var
->var_part
[pos
- 1];
7643 gcc_checking_assert (!onepart
);
7644 VAR_PART_OFFSET (var
, pos
) = offset
;
7645 var
->var_part
[pos
].loc_chain
= NULL
;
7646 var
->var_part
[pos
].cur_loc
= NULL
;
7649 /* Delete the location from the list. */
7650 nextp
= &var
->var_part
[pos
].loc_chain
;
7651 for (node
= var
->var_part
[pos
].loc_chain
; node
; node
= next
)
7654 if ((REG_P (node
->loc
) && REG_P (loc
)
7655 && REGNO (node
->loc
) == REGNO (loc
))
7656 || rtx_equal_p (node
->loc
, loc
))
7658 /* Save these values, to assign to the new node, before
7659 deleting this one. */
7660 if (node
->init
> initialized
)
7661 initialized
= node
->init
;
7662 if (node
->set_src
!= NULL
&& set_src
== NULL
)
7663 set_src
= node
->set_src
;
7664 if (var
->var_part
[pos
].cur_loc
== node
->loc
)
7665 var
->var_part
[pos
].cur_loc
= NULL
;
7671 nextp
= &node
->next
;
7674 nextp
= &var
->var_part
[pos
].loc_chain
;
7677 /* Add the location to the beginning. */
7678 node
= new location_chain
;
7680 node
->init
= initialized
;
7681 node
->set_src
= set_src
;
7682 node
->next
= *nextp
;
7685 /* If no location was emitted do so. */
7686 if (var
->var_part
[pos
].cur_loc
== NULL
)
7687 variable_was_changed (var
, set
);
7692 /* Set the part of variable's location in the dataflow set SET. The
7693 variable part is specified by variable's declaration in DV and
7694 offset OFFSET and the part's location by LOC. IOPT should be
7695 NO_INSERT if the variable is known to be in SET already and the
7696 variable hash table must not be resized, and INSERT otherwise. */
7699 set_variable_part (dataflow_set
*set
, rtx loc
,
7700 decl_or_value dv
, HOST_WIDE_INT offset
,
7701 enum var_init_status initialized
, rtx set_src
,
7702 enum insert_option iopt
)
7706 if (iopt
== NO_INSERT
)
7707 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
7710 slot
= shared_hash_find_slot (set
->vars
, dv
);
7712 slot
= shared_hash_find_slot_unshare (&set
->vars
, dv
, iopt
);
7714 set_slot_part (set
, loc
, slot
, dv
, offset
, initialized
, set_src
);
7717 /* Remove all recorded register locations for the given variable part
7718 from dataflow set SET, except for those that are identical to loc.
7719 The variable part is specified by variable's declaration or value
7720 DV and offset OFFSET. */
7723 clobber_slot_part (dataflow_set
*set
, rtx loc
, variable
**slot
,
7724 HOST_WIDE_INT offset
, rtx set_src
)
7726 variable
*var
= *slot
;
7727 int pos
= find_variable_location_part (var
, offset
, NULL
);
7731 location_chain
*node
, *next
;
7733 /* Remove the register locations from the dataflow set. */
7734 next
= var
->var_part
[pos
].loc_chain
;
7735 for (node
= next
; node
; node
= next
)
7738 if (node
->loc
!= loc
7739 && (!flag_var_tracking_uninit
7742 || !rtx_equal_p (set_src
, node
->set_src
)))
7744 if (REG_P (node
->loc
))
7746 attrs
*anode
, *anext
;
7749 /* Remove the variable part from the register's
7750 list, but preserve any other variable parts
7751 that might be regarded as live in that same
7753 anextp
= &set
->regs
[REGNO (node
->loc
)];
7754 for (anode
= *anextp
; anode
; anode
= anext
)
7756 anext
= anode
->next
;
7757 if (dv_as_opaque (anode
->dv
) == dv_as_opaque (var
->dv
)
7758 && anode
->offset
== offset
)
7764 anextp
= &anode
->next
;
7768 slot
= delete_slot_part (set
, node
->loc
, slot
, offset
);
7776 /* Remove all recorded register locations for the given variable part
7777 from dataflow set SET, except for those that are identical to loc.
7778 The variable part is specified by variable's declaration or value
7779 DV and offset OFFSET. */
7782 clobber_variable_part (dataflow_set
*set
, rtx loc
, decl_or_value dv
,
7783 HOST_WIDE_INT offset
, rtx set_src
)
7787 if (!dv_as_opaque (dv
)
7788 || (!dv_is_value_p (dv
) && ! DECL_P (dv_as_decl (dv
))))
7791 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
7795 clobber_slot_part (set
, loc
, slot
, offset
, set_src
);
7798 /* Delete the part of variable's location from dataflow set SET. The
7799 variable part is specified by its SET->vars slot SLOT and offset
7800 OFFSET and the part's location by LOC. */
7803 delete_slot_part (dataflow_set
*set
, rtx loc
, variable
**slot
,
7804 HOST_WIDE_INT offset
)
7806 variable
*var
= *slot
;
7807 int pos
= find_variable_location_part (var
, offset
, NULL
);
7811 location_chain
*node
, *next
;
7812 location_chain
**nextp
;
7816 if (shared_var_p (var
, set
->vars
))
7818 /* If the variable contains the location part we have to
7819 make a copy of the variable. */
7820 for (node
= var
->var_part
[pos
].loc_chain
; node
;
7823 if ((REG_P (node
->loc
) && REG_P (loc
)
7824 && REGNO (node
->loc
) == REGNO (loc
))
7825 || rtx_equal_p (node
->loc
, loc
))
7827 slot
= unshare_variable (set
, slot
, var
,
7828 VAR_INIT_STATUS_UNKNOWN
);
7835 if (pos
== 0 && var
->onepart
&& VAR_LOC_1PAUX (var
))
7836 cur_loc
= VAR_LOC_FROM (var
);
7838 cur_loc
= var
->var_part
[pos
].cur_loc
;
7840 /* Delete the location part. */
7842 nextp
= &var
->var_part
[pos
].loc_chain
;
7843 for (node
= *nextp
; node
; node
= next
)
7846 if ((REG_P (node
->loc
) && REG_P (loc
)
7847 && REGNO (node
->loc
) == REGNO (loc
))
7848 || rtx_equal_p (node
->loc
, loc
))
7850 /* If we have deleted the location which was last emitted
7851 we have to emit new location so add the variable to set
7852 of changed variables. */
7853 if (cur_loc
== node
->loc
)
7856 var
->var_part
[pos
].cur_loc
= NULL
;
7857 if (pos
== 0 && var
->onepart
&& VAR_LOC_1PAUX (var
))
7858 VAR_LOC_FROM (var
) = NULL
;
7865 nextp
= &node
->next
;
7868 if (var
->var_part
[pos
].loc_chain
== NULL
)
7872 while (pos
< var
->n_var_parts
)
7874 var
->var_part
[pos
] = var
->var_part
[pos
+ 1];
7879 variable_was_changed (var
, set
);
7885 /* Delete the part of variable's location from dataflow set SET. The
7886 variable part is specified by variable's declaration or value DV
7887 and offset OFFSET and the part's location by LOC. */
7890 delete_variable_part (dataflow_set
*set
, rtx loc
, decl_or_value dv
,
7891 HOST_WIDE_INT offset
)
7893 variable
**slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
7897 delete_slot_part (set
, loc
, slot
, offset
);
7901 /* Structure for passing some other parameters to function
7902 vt_expand_loc_callback. */
7903 struct expand_loc_callback_data
7905 /* The variables and values active at this point. */
7906 variable_table_type
*vars
;
7908 /* Stack of values and debug_exprs under expansion, and their
7910 auto_vec
<rtx
, 4> expanding
;
7912 /* Stack of values and debug_exprs whose expansion hit recursion
7913 cycles. They will have VALUE_RECURSED_INTO marked when added to
7914 this list. This flag will be cleared if any of its dependencies
7915 resolves to a valid location. So, if the flag remains set at the
7916 end of the search, we know no valid location for this one can
7918 auto_vec
<rtx
, 4> pending
;
7920 /* The maximum depth among the sub-expressions under expansion.
7921 Zero indicates no expansion so far. */
7925 /* Allocate the one-part auxiliary data structure for VAR, with enough
7926 room for COUNT dependencies. */
7929 loc_exp_dep_alloc (variable
*var
, int count
)
7933 gcc_checking_assert (var
->onepart
);
7935 /* We can be called with COUNT == 0 to allocate the data structure
7936 without any dependencies, e.g. for the backlinks only. However,
7937 if we are specifying a COUNT, then the dependency list must have
7938 been emptied before. It would be possible to adjust pointers or
7939 force it empty here, but this is better done at an earlier point
7940 in the algorithm, so we instead leave an assertion to catch
7942 gcc_checking_assert (!count
7943 || VAR_LOC_DEP_VEC (var
) == NULL
7944 || VAR_LOC_DEP_VEC (var
)->is_empty ());
7946 if (VAR_LOC_1PAUX (var
) && VAR_LOC_DEP_VEC (var
)->space (count
))
7949 allocsize
= offsetof (struct onepart_aux
, deps
)
7950 + vec
<loc_exp_dep
, va_heap
, vl_embed
>::embedded_size (count
);
7952 if (VAR_LOC_1PAUX (var
))
7954 VAR_LOC_1PAUX (var
) = XRESIZEVAR (struct onepart_aux
,
7955 VAR_LOC_1PAUX (var
), allocsize
);
7956 /* If the reallocation moves the onepaux structure, the
7957 back-pointer to BACKLINKS in the first list member will still
7958 point to its old location. Adjust it. */
7959 if (VAR_LOC_DEP_LST (var
))
7960 VAR_LOC_DEP_LST (var
)->pprev
= VAR_LOC_DEP_LSTP (var
);
7964 VAR_LOC_1PAUX (var
) = XNEWVAR (struct onepart_aux
, allocsize
);
7965 *VAR_LOC_DEP_LSTP (var
) = NULL
;
7966 VAR_LOC_FROM (var
) = NULL
;
7967 VAR_LOC_DEPTH (var
).complexity
= 0;
7968 VAR_LOC_DEPTH (var
).entryvals
= 0;
7970 VAR_LOC_DEP_VEC (var
)->embedded_init (count
);
7973 /* Remove all entries from the vector of active dependencies of VAR,
7974 removing them from the back-links lists too. */
7977 loc_exp_dep_clear (variable
*var
)
7979 while (VAR_LOC_DEP_VEC (var
) && !VAR_LOC_DEP_VEC (var
)->is_empty ())
7981 loc_exp_dep
*led
= &VAR_LOC_DEP_VEC (var
)->last ();
7983 led
->next
->pprev
= led
->pprev
;
7985 *led
->pprev
= led
->next
;
7986 VAR_LOC_DEP_VEC (var
)->pop ();
7990 /* Insert an active dependency from VAR on X to the vector of
7991 dependencies, and add the corresponding back-link to X's list of
7992 back-links in VARS. */
7995 loc_exp_insert_dep (variable
*var
, rtx x
, variable_table_type
*vars
)
8001 dv
= dv_from_rtx (x
);
8003 /* ??? Build a vector of variables parallel to EXPANDING, to avoid
8004 an additional look up? */
8005 xvar
= vars
->find_with_hash (dv
, dv_htab_hash (dv
));
8009 xvar
= variable_from_dropped (dv
, NO_INSERT
);
8010 gcc_checking_assert (xvar
);
8013 /* No point in adding the same backlink more than once. This may
8014 arise if say the same value appears in two complex expressions in
8015 the same loc_list, or even more than once in a single
8017 if (VAR_LOC_DEP_LST (xvar
) && VAR_LOC_DEP_LST (xvar
)->dv
== var
->dv
)
8020 if (var
->onepart
== NOT_ONEPART
)
8021 led
= new loc_exp_dep
;
8025 memset (&empty
, 0, sizeof (empty
));
8026 VAR_LOC_DEP_VEC (var
)->quick_push (empty
);
8027 led
= &VAR_LOC_DEP_VEC (var
)->last ();
8032 loc_exp_dep_alloc (xvar
, 0);
8033 led
->pprev
= VAR_LOC_DEP_LSTP (xvar
);
8034 led
->next
= *led
->pprev
;
8036 led
->next
->pprev
= &led
->next
;
8040 /* Create active dependencies of VAR on COUNT values starting at
8041 VALUE, and corresponding back-links to the entries in VARS. Return
8042 true if we found any pending-recursion results. */
8045 loc_exp_dep_set (variable
*var
, rtx result
, rtx
*value
, int count
,
8046 variable_table_type
*vars
)
8048 bool pending_recursion
= false;
8050 gcc_checking_assert (VAR_LOC_DEP_VEC (var
) == NULL
8051 || VAR_LOC_DEP_VEC (var
)->is_empty ());
8053 /* Set up all dependencies from last_child (as set up at the end of
8054 the loop above) to the end. */
8055 loc_exp_dep_alloc (var
, count
);
8061 if (!pending_recursion
)
8062 pending_recursion
= !result
&& VALUE_RECURSED_INTO (x
);
8064 loc_exp_insert_dep (var
, x
, vars
);
8067 return pending_recursion
;
8070 /* Notify the back-links of IVAR that are pending recursion that we
8071 have found a non-NIL value for it, so they are cleared for another
8072 attempt to compute a current location. */
8075 notify_dependents_of_resolved_value (variable
*ivar
, variable_table_type
*vars
)
8077 loc_exp_dep
*led
, *next
;
8079 for (led
= VAR_LOC_DEP_LST (ivar
); led
; led
= next
)
8081 decl_or_value dv
= led
->dv
;
8086 if (dv_is_value_p (dv
))
8088 rtx value
= dv_as_value (dv
);
8090 /* If we have already resolved it, leave it alone. */
8091 if (!VALUE_RECURSED_INTO (value
))
8094 /* Check that VALUE_RECURSED_INTO, true from the test above,
8095 implies NO_LOC_P. */
8096 gcc_checking_assert (NO_LOC_P (value
));
8098 /* We won't notify variables that are being expanded,
8099 because their dependency list is cleared before
8101 NO_LOC_P (value
) = false;
8102 VALUE_RECURSED_INTO (value
) = false;
8104 gcc_checking_assert (dv_changed_p (dv
));
8108 gcc_checking_assert (dv_onepart_p (dv
) != NOT_ONEPART
);
8109 if (!dv_changed_p (dv
))
8113 var
= vars
->find_with_hash (dv
, dv_htab_hash (dv
));
8116 var
= variable_from_dropped (dv
, NO_INSERT
);
8119 notify_dependents_of_resolved_value (var
, vars
);
8122 next
->pprev
= led
->pprev
;
8130 static rtx
vt_expand_loc_callback (rtx x
, bitmap regs
,
8131 int max_depth
, void *data
);
8133 /* Return the combined depth, when one sub-expression evaluated to
8134 BEST_DEPTH and the previous known depth was SAVED_DEPTH. */
8136 static inline expand_depth
8137 update_depth (expand_depth saved_depth
, expand_depth best_depth
)
8139 /* If we didn't find anything, stick with what we had. */
8140 if (!best_depth
.complexity
)
8143 /* If we found hadn't found anything, use the depth of the current
8144 expression. Do NOT add one extra level, we want to compute the
8145 maximum depth among sub-expressions. We'll increment it later,
8147 if (!saved_depth
.complexity
)
8150 /* Combine the entryval count so that regardless of which one we
8151 return, the entryval count is accurate. */
8152 best_depth
.entryvals
= saved_depth
.entryvals
8153 = best_depth
.entryvals
+ saved_depth
.entryvals
;
8155 if (saved_depth
.complexity
< best_depth
.complexity
)
8161 /* Expand VAR to a location RTX, updating its cur_loc. Use REGS and
8162 DATA for cselib expand callback. If PENDRECP is given, indicate in
8163 it whether any sub-expression couldn't be fully evaluated because
8164 it is pending recursion resolution. */
8167 vt_expand_var_loc_chain (variable
*var
, bitmap regs
, void *data
,
8170 struct expand_loc_callback_data
*elcd
8171 = (struct expand_loc_callback_data
*) data
;
8172 location_chain
*loc
, *next
;
8174 int first_child
, result_first_child
, last_child
;
8175 bool pending_recursion
;
8176 rtx loc_from
= NULL
;
8177 struct elt_loc_list
*cloc
= NULL
;
8178 expand_depth depth
= { 0, 0 }, saved_depth
= elcd
->depth
;
8179 int wanted_entryvals
, found_entryvals
= 0;
8181 /* Clear all backlinks pointing at this, so that we're not notified
8182 while we're active. */
8183 loc_exp_dep_clear (var
);
8186 if (var
->onepart
== ONEPART_VALUE
)
8188 cselib_val
*val
= CSELIB_VAL_PTR (dv_as_value (var
->dv
));
8190 gcc_checking_assert (cselib_preserved_value_p (val
));
8195 first_child
= result_first_child
= last_child
8196 = elcd
->expanding
.length ();
8198 wanted_entryvals
= found_entryvals
;
8200 /* Attempt to expand each available location in turn. */
8201 for (next
= loc
= var
->n_var_parts
? var
->var_part
[0].loc_chain
: NULL
;
8202 loc
|| cloc
; loc
= next
)
8204 result_first_child
= last_child
;
8208 loc_from
= cloc
->loc
;
8211 if (unsuitable_loc (loc_from
))
8216 loc_from
= loc
->loc
;
8220 gcc_checking_assert (!unsuitable_loc (loc_from
));
8222 elcd
->depth
.complexity
= elcd
->depth
.entryvals
= 0;
8223 result
= cselib_expand_value_rtx_cb (loc_from
, regs
, EXPR_DEPTH
,
8224 vt_expand_loc_callback
, data
);
8225 last_child
= elcd
->expanding
.length ();
8229 depth
= elcd
->depth
;
8231 gcc_checking_assert (depth
.complexity
8232 || result_first_child
== last_child
);
8234 if (last_child
- result_first_child
!= 1)
8236 if (!depth
.complexity
&& GET_CODE (result
) == ENTRY_VALUE
)
8241 if (depth
.complexity
<= EXPR_USE_DEPTH
)
8243 if (depth
.entryvals
<= wanted_entryvals
)
8245 else if (!found_entryvals
|| depth
.entryvals
< found_entryvals
)
8246 found_entryvals
= depth
.entryvals
;
8252 /* Set it up in case we leave the loop. */
8253 depth
.complexity
= depth
.entryvals
= 0;
8255 result_first_child
= first_child
;
8258 if (!loc_from
&& wanted_entryvals
< found_entryvals
)
8260 /* We found entries with ENTRY_VALUEs and skipped them. Since
8261 we could not find any expansions without ENTRY_VALUEs, but we
8262 found at least one with them, go back and get an entry with
8263 the minimum number ENTRY_VALUE count that we found. We could
8264 avoid looping, but since each sub-loc is already resolved,
8265 the re-expansion should be trivial. ??? Should we record all
8266 attempted locs as dependencies, so that we retry the
8267 expansion should any of them change, in the hope it can give
8268 us a new entry without an ENTRY_VALUE? */
8269 elcd
->expanding
.truncate (first_child
);
8273 /* Register all encountered dependencies as active. */
8274 pending_recursion
= loc_exp_dep_set
8275 (var
, result
, elcd
->expanding
.address () + result_first_child
,
8276 last_child
- result_first_child
, elcd
->vars
);
8278 elcd
->expanding
.truncate (first_child
);
8280 /* Record where the expansion came from. */
8281 gcc_checking_assert (!result
|| !pending_recursion
);
8282 VAR_LOC_FROM (var
) = loc_from
;
8283 VAR_LOC_DEPTH (var
) = depth
;
8285 gcc_checking_assert (!depth
.complexity
== !result
);
8287 elcd
->depth
= update_depth (saved_depth
, depth
);
8289 /* Indicate whether any of the dependencies are pending recursion
8292 *pendrecp
= pending_recursion
;
8294 if (!pendrecp
|| !pending_recursion
)
8295 var
->var_part
[0].cur_loc
= result
;
8300 /* Callback for cselib_expand_value, that looks for expressions
8301 holding the value in the var-tracking hash tables. Return X for
8302 standard processing, anything else is to be used as-is. */
8305 vt_expand_loc_callback (rtx x
, bitmap regs
,
8306 int max_depth ATTRIBUTE_UNUSED
,
8309 struct expand_loc_callback_data
*elcd
8310 = (struct expand_loc_callback_data
*) data
;
8314 bool pending_recursion
= false;
8315 bool from_empty
= false;
8317 switch (GET_CODE (x
))
8320 subreg
= cselib_expand_value_rtx_cb (SUBREG_REG (x
), regs
,
8322 vt_expand_loc_callback
, data
);
8327 result
= simplify_gen_subreg (GET_MODE (x
), subreg
,
8328 GET_MODE (SUBREG_REG (x
)),
8331 /* Invalid SUBREGs are ok in debug info. ??? We could try
8332 alternate expansions for the VALUE as well. */
8334 result
= gen_rtx_raw_SUBREG (GET_MODE (x
), subreg
, SUBREG_BYTE (x
));
8340 dv
= dv_from_rtx (x
);
8347 elcd
->expanding
.safe_push (x
);
8349 /* Check that VALUE_RECURSED_INTO implies NO_LOC_P. */
8350 gcc_checking_assert (!VALUE_RECURSED_INTO (x
) || NO_LOC_P (x
));
8354 gcc_checking_assert (VALUE_RECURSED_INTO (x
) || !dv_changed_p (dv
));
8358 var
= elcd
->vars
->find_with_hash (dv
, dv_htab_hash (dv
));
8363 var
= variable_from_dropped (dv
, INSERT
);
8366 gcc_checking_assert (var
);
8368 if (!dv_changed_p (dv
))
8370 gcc_checking_assert (!NO_LOC_P (x
));
8371 gcc_checking_assert (var
->var_part
[0].cur_loc
);
8372 gcc_checking_assert (VAR_LOC_1PAUX (var
));
8373 gcc_checking_assert (VAR_LOC_1PAUX (var
)->depth
.complexity
);
8375 elcd
->depth
= update_depth (elcd
->depth
, VAR_LOC_1PAUX (var
)->depth
);
8377 return var
->var_part
[0].cur_loc
;
8380 VALUE_RECURSED_INTO (x
) = true;
8381 /* This is tentative, but it makes some tests simpler. */
8382 NO_LOC_P (x
) = true;
8384 gcc_checking_assert (var
->n_var_parts
== 1 || from_empty
);
8386 result
= vt_expand_var_loc_chain (var
, regs
, data
, &pending_recursion
);
8388 if (pending_recursion
)
8390 gcc_checking_assert (!result
);
8391 elcd
->pending
.safe_push (x
);
8395 NO_LOC_P (x
) = !result
;
8396 VALUE_RECURSED_INTO (x
) = false;
8397 set_dv_changed (dv
, false);
8400 notify_dependents_of_resolved_value (var
, elcd
->vars
);
8406 /* While expanding variables, we may encounter recursion cycles
8407 because of mutual (possibly indirect) dependencies between two
8408 particular variables (or values), say A and B. If we're trying to
8409 expand A when we get to B, which in turn attempts to expand A, if
8410 we can't find any other expansion for B, we'll add B to this
8411 pending-recursion stack, and tentatively return NULL for its
8412 location. This tentative value will be used for any other
8413 occurrences of B, unless A gets some other location, in which case
8414 it will notify B that it is worth another try at computing a
8415 location for it, and it will use the location computed for A then.
8416 At the end of the expansion, the tentative NULL locations become
8417 final for all members of PENDING that didn't get a notification.
8418 This function performs this finalization of NULL locations. */
8421 resolve_expansions_pending_recursion (vec
<rtx
, va_heap
> *pending
)
8423 while (!pending
->is_empty ())
8425 rtx x
= pending
->pop ();
8428 if (!VALUE_RECURSED_INTO (x
))
8431 gcc_checking_assert (NO_LOC_P (x
));
8432 VALUE_RECURSED_INTO (x
) = false;
8433 dv
= dv_from_rtx (x
);
8434 gcc_checking_assert (dv_changed_p (dv
));
8435 set_dv_changed (dv
, false);
8439 /* Initialize expand_loc_callback_data D with variable hash table V.
8440 It must be a macro because of alloca (vec stack). */
8441 #define INIT_ELCD(d, v) \
8445 (d).depth.complexity = (d).depth.entryvals = 0; \
8448 /* Finalize expand_loc_callback_data D, resolved to location L. */
8449 #define FINI_ELCD(d, l) \
8452 resolve_expansions_pending_recursion (&(d).pending); \
8453 (d).pending.release (); \
8454 (d).expanding.release (); \
8456 if ((l) && MEM_P (l)) \
8457 (l) = targetm.delegitimize_address (l); \
8461 /* Expand VALUEs and DEBUG_EXPRs in LOC to a location, using the
8462 equivalences in VARS, updating their CUR_LOCs in the process. */
8465 vt_expand_loc (rtx loc
, variable_table_type
*vars
)
8467 struct expand_loc_callback_data data
;
8470 if (!MAY_HAVE_DEBUG_INSNS
)
8473 INIT_ELCD (data
, vars
);
8475 result
= cselib_expand_value_rtx_cb (loc
, scratch_regs
, EXPR_DEPTH
,
8476 vt_expand_loc_callback
, &data
);
8478 FINI_ELCD (data
, result
);
8483 /* Expand the one-part VARiable to a location, using the equivalences
8484 in VARS, updating their CUR_LOCs in the process. */
8487 vt_expand_1pvar (variable
*var
, variable_table_type
*vars
)
8489 struct expand_loc_callback_data data
;
8492 gcc_checking_assert (var
->onepart
&& var
->n_var_parts
== 1);
8494 if (!dv_changed_p (var
->dv
))
8495 return var
->var_part
[0].cur_loc
;
8497 INIT_ELCD (data
, vars
);
8499 loc
= vt_expand_var_loc_chain (var
, scratch_regs
, &data
, NULL
);
8501 gcc_checking_assert (data
.expanding
.is_empty ());
8503 FINI_ELCD (data
, loc
);
8508 /* Emit the NOTE_INSN_VAR_LOCATION for variable *VARP. DATA contains
8509 additional parameters: WHERE specifies whether the note shall be emitted
8510 before or after instruction INSN. */
8513 emit_note_insn_var_location (variable
**varp
, emit_note_data
*data
)
8515 variable
*var
= *varp
;
8516 rtx_insn
*insn
= data
->insn
;
8517 enum emit_note_where where
= data
->where
;
8518 variable_table_type
*vars
= data
->vars
;
8521 int i
, j
, n_var_parts
;
8523 enum var_init_status initialized
= VAR_INIT_STATUS_UNINITIALIZED
;
8524 HOST_WIDE_INT last_limit
;
8525 tree type_size_unit
;
8526 HOST_WIDE_INT offsets
[MAX_VAR_PARTS
];
8527 rtx loc
[MAX_VAR_PARTS
];
8531 gcc_checking_assert (var
->onepart
== NOT_ONEPART
8532 || var
->onepart
== ONEPART_VDECL
);
8534 decl
= dv_as_decl (var
->dv
);
8540 for (i
= 0; i
< var
->n_var_parts
; i
++)
8541 if (var
->var_part
[i
].cur_loc
== NULL
&& var
->var_part
[i
].loc_chain
)
8542 var
->var_part
[i
].cur_loc
= var
->var_part
[i
].loc_chain
->loc
;
8543 for (i
= 0; i
< var
->n_var_parts
; i
++)
8545 machine_mode mode
, wider_mode
;
8547 HOST_WIDE_INT offset
;
8549 if (i
== 0 && var
->onepart
)
8551 gcc_checking_assert (var
->n_var_parts
== 1);
8553 initialized
= VAR_INIT_STATUS_INITIALIZED
;
8554 loc2
= vt_expand_1pvar (var
, vars
);
8558 if (last_limit
< VAR_PART_OFFSET (var
, i
))
8563 else if (last_limit
> VAR_PART_OFFSET (var
, i
))
8565 offset
= VAR_PART_OFFSET (var
, i
);
8566 loc2
= var
->var_part
[i
].cur_loc
;
8567 if (loc2
&& GET_CODE (loc2
) == MEM
8568 && GET_CODE (XEXP (loc2
, 0)) == VALUE
)
8570 rtx depval
= XEXP (loc2
, 0);
8572 loc2
= vt_expand_loc (loc2
, vars
);
8575 loc_exp_insert_dep (var
, depval
, vars
);
8582 gcc_checking_assert (GET_CODE (loc2
) != VALUE
);
8583 for (lc
= var
->var_part
[i
].loc_chain
; lc
; lc
= lc
->next
)
8584 if (var
->var_part
[i
].cur_loc
== lc
->loc
)
8586 initialized
= lc
->init
;
8592 offsets
[n_var_parts
] = offset
;
8598 loc
[n_var_parts
] = loc2
;
8599 mode
= GET_MODE (var
->var_part
[i
].cur_loc
);
8600 if (mode
== VOIDmode
&& var
->onepart
)
8601 mode
= DECL_MODE (decl
);
8602 last_limit
= offsets
[n_var_parts
] + GET_MODE_SIZE (mode
);
8604 /* Attempt to merge adjacent registers or memory. */
8605 wider_mode
= GET_MODE_WIDER_MODE (mode
);
8606 for (j
= i
+ 1; j
< var
->n_var_parts
; j
++)
8607 if (last_limit
<= VAR_PART_OFFSET (var
, j
))
8609 if (j
< var
->n_var_parts
8610 && wider_mode
!= VOIDmode
8611 && var
->var_part
[j
].cur_loc
8612 && mode
== GET_MODE (var
->var_part
[j
].cur_loc
)
8613 && (REG_P (loc
[n_var_parts
]) || MEM_P (loc
[n_var_parts
]))
8614 && last_limit
== (var
->onepart
? 0 : VAR_PART_OFFSET (var
, j
))
8615 && (loc2
= vt_expand_loc (var
->var_part
[j
].cur_loc
, vars
))
8616 && GET_CODE (loc
[n_var_parts
]) == GET_CODE (loc2
))
8620 if (REG_P (loc
[n_var_parts
])
8621 && hard_regno_nregs
[REGNO (loc
[n_var_parts
])][mode
] * 2
8622 == hard_regno_nregs
[REGNO (loc
[n_var_parts
])][wider_mode
]
8623 && end_hard_regno (mode
, REGNO (loc
[n_var_parts
]))
8626 if (! WORDS_BIG_ENDIAN
&& ! BYTES_BIG_ENDIAN
)
8627 new_loc
= simplify_subreg (wider_mode
, loc
[n_var_parts
],
8629 else if (WORDS_BIG_ENDIAN
&& BYTES_BIG_ENDIAN
)
8630 new_loc
= simplify_subreg (wider_mode
, loc2
, mode
, 0);
8633 if (!REG_P (new_loc
)
8634 || REGNO (new_loc
) != REGNO (loc
[n_var_parts
]))
8637 REG_ATTRS (new_loc
) = REG_ATTRS (loc
[n_var_parts
]);
8640 else if (MEM_P (loc
[n_var_parts
])
8641 && GET_CODE (XEXP (loc2
, 0)) == PLUS
8642 && REG_P (XEXP (XEXP (loc2
, 0), 0))
8643 && CONST_INT_P (XEXP (XEXP (loc2
, 0), 1)))
8645 if ((REG_P (XEXP (loc
[n_var_parts
], 0))
8646 && rtx_equal_p (XEXP (loc
[n_var_parts
], 0),
8647 XEXP (XEXP (loc2
, 0), 0))
8648 && INTVAL (XEXP (XEXP (loc2
, 0), 1))
8649 == GET_MODE_SIZE (mode
))
8650 || (GET_CODE (XEXP (loc
[n_var_parts
], 0)) == PLUS
8651 && CONST_INT_P (XEXP (XEXP (loc
[n_var_parts
], 0), 1))
8652 && rtx_equal_p (XEXP (XEXP (loc
[n_var_parts
], 0), 0),
8653 XEXP (XEXP (loc2
, 0), 0))
8654 && INTVAL (XEXP (XEXP (loc
[n_var_parts
], 0), 1))
8655 + GET_MODE_SIZE (mode
)
8656 == INTVAL (XEXP (XEXP (loc2
, 0), 1))))
8657 new_loc
= adjust_address_nv (loc
[n_var_parts
],
8663 loc
[n_var_parts
] = new_loc
;
8665 last_limit
= offsets
[n_var_parts
] + GET_MODE_SIZE (mode
);
8671 type_size_unit
= TYPE_SIZE_UNIT (TREE_TYPE (decl
));
8672 if ((unsigned HOST_WIDE_INT
) last_limit
< TREE_INT_CST_LOW (type_size_unit
))
8675 if (! flag_var_tracking_uninit
)
8676 initialized
= VAR_INIT_STATUS_INITIALIZED
;
8680 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
, NULL_RTX
, initialized
);
8681 else if (n_var_parts
== 1)
8685 if (offsets
[0] || GET_CODE (loc
[0]) == PARALLEL
)
8686 expr_list
= gen_rtx_EXPR_LIST (VOIDmode
, loc
[0], GEN_INT (offsets
[0]));
8690 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
, expr_list
, initialized
);
8692 else if (n_var_parts
)
8696 for (i
= 0; i
< n_var_parts
; i
++)
8698 = gen_rtx_EXPR_LIST (VOIDmode
, loc
[i
], GEN_INT (offsets
[i
]));
8700 parallel
= gen_rtx_PARALLEL (VOIDmode
,
8701 gen_rtvec_v (n_var_parts
, loc
));
8702 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
,
8703 parallel
, initialized
);
8706 if (where
!= EMIT_NOTE_BEFORE_INSN
)
8708 note
= emit_note_after (NOTE_INSN_VAR_LOCATION
, insn
);
8709 if (where
== EMIT_NOTE_AFTER_CALL_INSN
)
8710 NOTE_DURING_CALL_P (note
) = true;
8714 /* Make sure that the call related notes come first. */
8715 while (NEXT_INSN (insn
)
8717 && ((NOTE_KIND (insn
) == NOTE_INSN_VAR_LOCATION
8718 && NOTE_DURING_CALL_P (insn
))
8719 || NOTE_KIND (insn
) == NOTE_INSN_CALL_ARG_LOCATION
))
8720 insn
= NEXT_INSN (insn
);
8722 && ((NOTE_KIND (insn
) == NOTE_INSN_VAR_LOCATION
8723 && NOTE_DURING_CALL_P (insn
))
8724 || NOTE_KIND (insn
) == NOTE_INSN_CALL_ARG_LOCATION
))
8725 note
= emit_note_after (NOTE_INSN_VAR_LOCATION
, insn
);
8727 note
= emit_note_before (NOTE_INSN_VAR_LOCATION
, insn
);
8729 NOTE_VAR_LOCATION (note
) = note_vl
;
8731 set_dv_changed (var
->dv
, false);
8732 gcc_assert (var
->in_changed_variables
);
8733 var
->in_changed_variables
= false;
8734 changed_variables
->clear_slot (varp
);
8736 /* Continue traversing the hash table. */
8740 /* While traversing changed_variables, push onto DATA (a stack of RTX
8741 values) entries that aren't user variables. */
8744 var_track_values_to_stack (variable
**slot
,
8745 vec
<rtx
, va_heap
> *changed_values_stack
)
8747 variable
*var
= *slot
;
8749 if (var
->onepart
== ONEPART_VALUE
)
8750 changed_values_stack
->safe_push (dv_as_value (var
->dv
));
8751 else if (var
->onepart
== ONEPART_DEXPR
)
8752 changed_values_stack
->safe_push (DECL_RTL_KNOWN_SET (dv_as_decl (var
->dv
)));
8757 /* Remove from changed_variables the entry whose DV corresponds to
8758 value or debug_expr VAL. */
8760 remove_value_from_changed_variables (rtx val
)
8762 decl_or_value dv
= dv_from_rtx (val
);
8766 slot
= changed_variables
->find_slot_with_hash (dv
, dv_htab_hash (dv
),
8769 var
->in_changed_variables
= false;
8770 changed_variables
->clear_slot (slot
);
8773 /* If VAL (a value or debug_expr) has backlinks to variables actively
8774 dependent on it in HTAB or in CHANGED_VARIABLES, mark them as
8775 changed, adding to CHANGED_VALUES_STACK any dependencies that may
8776 have dependencies of their own to notify. */
8779 notify_dependents_of_changed_value (rtx val
, variable_table_type
*htab
,
8780 vec
<rtx
, va_heap
> *changed_values_stack
)
8785 decl_or_value dv
= dv_from_rtx (val
);
8787 slot
= changed_variables
->find_slot_with_hash (dv
, dv_htab_hash (dv
),
8790 slot
= htab
->find_slot_with_hash (dv
, dv_htab_hash (dv
), NO_INSERT
);
8792 slot
= dropped_values
->find_slot_with_hash (dv
, dv_htab_hash (dv
),
8796 while ((led
= VAR_LOC_DEP_LST (var
)))
8798 decl_or_value ldv
= led
->dv
;
8801 /* Deactivate and remove the backlink, as it was “used up”. It
8802 makes no sense to attempt to notify the same entity again:
8803 either it will be recomputed and re-register an active
8804 dependency, or it will still have the changed mark. */
8806 led
->next
->pprev
= led
->pprev
;
8808 *led
->pprev
= led
->next
;
8812 if (dv_changed_p (ldv
))
8815 switch (dv_onepart_p (ldv
))
8819 set_dv_changed (ldv
, true);
8820 changed_values_stack
->safe_push (dv_as_rtx (ldv
));
8824 ivar
= htab
->find_with_hash (ldv
, dv_htab_hash (ldv
));
8825 gcc_checking_assert (!VAR_LOC_DEP_LST (ivar
));
8826 variable_was_changed (ivar
, NULL
);
8831 ivar
= htab
->find_with_hash (ldv
, dv_htab_hash (ldv
));
8834 int i
= ivar
->n_var_parts
;
8837 rtx loc
= ivar
->var_part
[i
].cur_loc
;
8839 if (loc
&& GET_CODE (loc
) == MEM
8840 && XEXP (loc
, 0) == val
)
8842 variable_was_changed (ivar
, NULL
);
8855 /* Take out of changed_variables any entries that don't refer to use
8856 variables. Back-propagate change notifications from values and
8857 debug_exprs to their active dependencies in HTAB or in
8858 CHANGED_VARIABLES. */
8861 process_changed_values (variable_table_type
*htab
)
8865 auto_vec
<rtx
, 20> changed_values_stack
;
8867 /* Move values from changed_variables to changed_values_stack. */
8869 ->traverse
<vec
<rtx
, va_heap
>*, var_track_values_to_stack
>
8870 (&changed_values_stack
);
8872 /* Back-propagate change notifications in values while popping
8873 them from the stack. */
8874 for (n
= i
= changed_values_stack
.length ();
8875 i
> 0; i
= changed_values_stack
.length ())
8877 val
= changed_values_stack
.pop ();
8878 notify_dependents_of_changed_value (val
, htab
, &changed_values_stack
);
8880 /* This condition will hold when visiting each of the entries
8881 originally in changed_variables. We can't remove them
8882 earlier because this could drop the backlinks before we got a
8883 chance to use them. */
8886 remove_value_from_changed_variables (val
);
8892 /* Emit NOTE_INSN_VAR_LOCATION note for each variable from a chain
8893 CHANGED_VARIABLES and delete this chain. WHERE specifies whether
8894 the notes shall be emitted before of after instruction INSN. */
8897 emit_notes_for_changes (rtx_insn
*insn
, enum emit_note_where where
,
8900 emit_note_data data
;
8901 variable_table_type
*htab
= shared_hash_htab (vars
);
8903 if (!changed_variables
->elements ())
8906 if (MAY_HAVE_DEBUG_INSNS
)
8907 process_changed_values (htab
);
8914 ->traverse
<emit_note_data
*, emit_note_insn_var_location
> (&data
);
8917 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it differs from the
8918 same variable in hash table DATA or is not there at all. */
8921 emit_notes_for_differences_1 (variable
**slot
, variable_table_type
*new_vars
)
8923 variable
*old_var
, *new_var
;
8926 new_var
= new_vars
->find_with_hash (old_var
->dv
, dv_htab_hash (old_var
->dv
));
8930 /* Variable has disappeared. */
8931 variable
*empty_var
= NULL
;
8933 if (old_var
->onepart
== ONEPART_VALUE
8934 || old_var
->onepart
== ONEPART_DEXPR
)
8936 empty_var
= variable_from_dropped (old_var
->dv
, NO_INSERT
);
8939 gcc_checking_assert (!empty_var
->in_changed_variables
);
8940 if (!VAR_LOC_1PAUX (old_var
))
8942 VAR_LOC_1PAUX (old_var
) = VAR_LOC_1PAUX (empty_var
);
8943 VAR_LOC_1PAUX (empty_var
) = NULL
;
8946 gcc_checking_assert (!VAR_LOC_1PAUX (empty_var
));
8952 empty_var
= onepart_pool_allocate (old_var
->onepart
);
8953 empty_var
->dv
= old_var
->dv
;
8954 empty_var
->refcount
= 0;
8955 empty_var
->n_var_parts
= 0;
8956 empty_var
->onepart
= old_var
->onepart
;
8957 empty_var
->in_changed_variables
= false;
8960 if (empty_var
->onepart
)
8962 /* Propagate the auxiliary data to (ultimately)
8963 changed_variables. */
8964 empty_var
->var_part
[0].loc_chain
= NULL
;
8965 empty_var
->var_part
[0].cur_loc
= NULL
;
8966 VAR_LOC_1PAUX (empty_var
) = VAR_LOC_1PAUX (old_var
);
8967 VAR_LOC_1PAUX (old_var
) = NULL
;
8969 variable_was_changed (empty_var
, NULL
);
8970 /* Continue traversing the hash table. */
8973 /* Update cur_loc and one-part auxiliary data, before new_var goes
8974 through variable_was_changed. */
8975 if (old_var
!= new_var
&& new_var
->onepart
)
8977 gcc_checking_assert (VAR_LOC_1PAUX (new_var
) == NULL
);
8978 VAR_LOC_1PAUX (new_var
) = VAR_LOC_1PAUX (old_var
);
8979 VAR_LOC_1PAUX (old_var
) = NULL
;
8980 new_var
->var_part
[0].cur_loc
= old_var
->var_part
[0].cur_loc
;
8982 if (variable_different_p (old_var
, new_var
))
8983 variable_was_changed (new_var
, NULL
);
8985 /* Continue traversing the hash table. */
8989 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it is not in hash
8993 emit_notes_for_differences_2 (variable
**slot
, variable_table_type
*old_vars
)
8995 variable
*old_var
, *new_var
;
8998 old_var
= old_vars
->find_with_hash (new_var
->dv
, dv_htab_hash (new_var
->dv
));
9002 for (i
= 0; i
< new_var
->n_var_parts
; i
++)
9003 new_var
->var_part
[i
].cur_loc
= NULL
;
9004 variable_was_changed (new_var
, NULL
);
9007 /* Continue traversing the hash table. */
9011 /* Emit notes before INSN for differences between dataflow sets OLD_SET and
9015 emit_notes_for_differences (rtx_insn
*insn
, dataflow_set
*old_set
,
9016 dataflow_set
*new_set
)
9018 shared_hash_htab (old_set
->vars
)
9019 ->traverse
<variable_table_type
*, emit_notes_for_differences_1
>
9020 (shared_hash_htab (new_set
->vars
));
9021 shared_hash_htab (new_set
->vars
)
9022 ->traverse
<variable_table_type
*, emit_notes_for_differences_2
>
9023 (shared_hash_htab (old_set
->vars
));
9024 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
, new_set
->vars
);
9027 /* Return the next insn after INSN that is not a NOTE_INSN_VAR_LOCATION. */
9030 next_non_note_insn_var_location (rtx_insn
*insn
)
9034 insn
= NEXT_INSN (insn
);
9037 || NOTE_KIND (insn
) != NOTE_INSN_VAR_LOCATION
)
9044 /* Emit the notes for changes of location parts in the basic block BB. */
9047 emit_notes_in_bb (basic_block bb
, dataflow_set
*set
)
9050 micro_operation
*mo
;
9052 dataflow_set_clear (set
);
9053 dataflow_set_copy (set
, &VTI (bb
)->in
);
9055 FOR_EACH_VEC_ELT (VTI (bb
)->mos
, i
, mo
)
9057 rtx_insn
*insn
= mo
->insn
;
9058 rtx_insn
*next_insn
= next_non_note_insn_var_location (insn
);
9063 dataflow_set_clear_at_call (set
, insn
);
9064 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_CALL_INSN
, set
->vars
);
9066 rtx arguments
= mo
->u
.loc
, *p
= &arguments
;
9070 XEXP (XEXP (*p
, 0), 1)
9071 = vt_expand_loc (XEXP (XEXP (*p
, 0), 1),
9072 shared_hash_htab (set
->vars
));
9073 /* If expansion is successful, keep it in the list. */
9074 if (XEXP (XEXP (*p
, 0), 1))
9076 /* Otherwise, if the following item is data_value for it,
9078 else if (XEXP (*p
, 1)
9079 && REG_P (XEXP (XEXP (*p
, 0), 0))
9080 && MEM_P (XEXP (XEXP (XEXP (*p
, 1), 0), 0))
9081 && REG_P (XEXP (XEXP (XEXP (XEXP (*p
, 1), 0), 0),
9083 && REGNO (XEXP (XEXP (*p
, 0), 0))
9084 == REGNO (XEXP (XEXP (XEXP (XEXP (*p
, 1), 0),
9086 *p
= XEXP (XEXP (*p
, 1), 1);
9087 /* Just drop this item. */
9091 note
= emit_note_after (NOTE_INSN_CALL_ARG_LOCATION
, insn
);
9092 NOTE_VAR_LOCATION (note
) = arguments
;
9098 rtx loc
= mo
->u
.loc
;
9101 var_reg_set (set
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
9103 var_mem_set (set
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
9105 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
, set
->vars
);
9111 rtx loc
= mo
->u
.loc
;
9115 if (GET_CODE (loc
) == CONCAT
)
9117 val
= XEXP (loc
, 0);
9118 vloc
= XEXP (loc
, 1);
9126 var
= PAT_VAR_LOCATION_DECL (vloc
);
9128 clobber_variable_part (set
, NULL_RTX
,
9129 dv_from_decl (var
), 0, NULL_RTX
);
9132 if (VAL_NEEDS_RESOLUTION (loc
))
9133 val_resolve (set
, val
, PAT_VAR_LOCATION_LOC (vloc
), insn
);
9134 set_variable_part (set
, val
, dv_from_decl (var
), 0,
9135 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
9138 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc
)))
9139 set_variable_part (set
, PAT_VAR_LOCATION_LOC (vloc
),
9140 dv_from_decl (var
), 0,
9141 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
9144 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
9150 rtx loc
= mo
->u
.loc
;
9151 rtx val
, vloc
, uloc
;
9153 vloc
= uloc
= XEXP (loc
, 1);
9154 val
= XEXP (loc
, 0);
9156 if (GET_CODE (val
) == CONCAT
)
9158 uloc
= XEXP (val
, 1);
9159 val
= XEXP (val
, 0);
9162 if (VAL_NEEDS_RESOLUTION (loc
))
9163 val_resolve (set
, val
, vloc
, insn
);
9165 val_store (set
, val
, uloc
, insn
, false);
9167 if (VAL_HOLDS_TRACK_EXPR (loc
))
9169 if (GET_CODE (uloc
) == REG
)
9170 var_reg_set (set
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
9172 else if (GET_CODE (uloc
) == MEM
)
9173 var_mem_set (set
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
9177 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
, set
->vars
);
9183 rtx loc
= mo
->u
.loc
;
9184 rtx val
, vloc
, uloc
;
9188 uloc
= XEXP (vloc
, 1);
9189 val
= XEXP (vloc
, 0);
9192 if (GET_CODE (uloc
) == SET
)
9194 dstv
= SET_DEST (uloc
);
9195 srcv
= SET_SRC (uloc
);
9203 if (GET_CODE (val
) == CONCAT
)
9205 dstv
= vloc
= XEXP (val
, 1);
9206 val
= XEXP (val
, 0);
9209 if (GET_CODE (vloc
) == SET
)
9211 srcv
= SET_SRC (vloc
);
9213 gcc_assert (val
!= srcv
);
9214 gcc_assert (vloc
== uloc
|| VAL_NEEDS_RESOLUTION (loc
));
9216 dstv
= vloc
= SET_DEST (vloc
);
9218 if (VAL_NEEDS_RESOLUTION (loc
))
9219 val_resolve (set
, val
, srcv
, insn
);
9221 else if (VAL_NEEDS_RESOLUTION (loc
))
9223 gcc_assert (GET_CODE (uloc
) == SET
9224 && GET_CODE (SET_SRC (uloc
)) == REG
);
9225 val_resolve (set
, val
, SET_SRC (uloc
), insn
);
9228 if (VAL_HOLDS_TRACK_EXPR (loc
))
9230 if (VAL_EXPR_IS_CLOBBERED (loc
))
9233 var_reg_delete (set
, uloc
, true);
9234 else if (MEM_P (uloc
))
9236 gcc_assert (MEM_P (dstv
));
9237 gcc_assert (MEM_ATTRS (dstv
) == MEM_ATTRS (uloc
));
9238 var_mem_delete (set
, dstv
, true);
9243 bool copied_p
= VAL_EXPR_IS_COPIED (loc
);
9244 rtx src
= NULL
, dst
= uloc
;
9245 enum var_init_status status
= VAR_INIT_STATUS_INITIALIZED
;
9247 if (GET_CODE (uloc
) == SET
)
9249 src
= SET_SRC (uloc
);
9250 dst
= SET_DEST (uloc
);
9255 status
= find_src_status (set
, src
);
9257 src
= find_src_set_src (set
, src
);
9261 var_reg_delete_and_set (set
, dst
, !copied_p
,
9263 else if (MEM_P (dst
))
9265 gcc_assert (MEM_P (dstv
));
9266 gcc_assert (MEM_ATTRS (dstv
) == MEM_ATTRS (dst
));
9267 var_mem_delete_and_set (set
, dstv
, !copied_p
,
9272 else if (REG_P (uloc
))
9273 var_regno_delete (set
, REGNO (uloc
));
9274 else if (MEM_P (uloc
))
9276 gcc_checking_assert (GET_CODE (vloc
) == MEM
);
9277 gcc_checking_assert (vloc
== dstv
);
9279 clobber_overlapping_mems (set
, vloc
);
9282 val_store (set
, val
, dstv
, insn
, true);
9284 emit_notes_for_changes (next_insn
, EMIT_NOTE_BEFORE_INSN
,
9291 rtx loc
= mo
->u
.loc
;
9294 if (GET_CODE (loc
) == SET
)
9296 set_src
= SET_SRC (loc
);
9297 loc
= SET_DEST (loc
);
9301 var_reg_delete_and_set (set
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
9304 var_mem_delete_and_set (set
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
9307 emit_notes_for_changes (next_insn
, EMIT_NOTE_BEFORE_INSN
,
9314 rtx loc
= mo
->u
.loc
;
9315 enum var_init_status src_status
;
9318 if (GET_CODE (loc
) == SET
)
9320 set_src
= SET_SRC (loc
);
9321 loc
= SET_DEST (loc
);
9324 src_status
= find_src_status (set
, set_src
);
9325 set_src
= find_src_set_src (set
, set_src
);
9328 var_reg_delete_and_set (set
, loc
, false, src_status
, set_src
);
9330 var_mem_delete_and_set (set
, loc
, false, src_status
, set_src
);
9332 emit_notes_for_changes (next_insn
, EMIT_NOTE_BEFORE_INSN
,
9339 rtx loc
= mo
->u
.loc
;
9342 var_reg_delete (set
, loc
, false);
9344 var_mem_delete (set
, loc
, false);
9346 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
9352 rtx loc
= mo
->u
.loc
;
9355 var_reg_delete (set
, loc
, true);
9357 var_mem_delete (set
, loc
, true);
9359 emit_notes_for_changes (next_insn
, EMIT_NOTE_BEFORE_INSN
,
9365 set
->stack_adjust
+= mo
->u
.adjust
;
9371 /* Emit notes for the whole function. */
9374 vt_emit_notes (void)
9379 gcc_assert (!changed_variables
->elements ());
9381 /* Free memory occupied by the out hash tables, as they aren't used
9383 FOR_EACH_BB_FN (bb
, cfun
)
9384 dataflow_set_clear (&VTI (bb
)->out
);
9386 /* Enable emitting notes by functions (mainly by set_variable_part and
9387 delete_variable_part). */
9390 if (MAY_HAVE_DEBUG_INSNS
)
9392 dropped_values
= new variable_table_type (cselib_get_next_uid () * 2);
9395 dataflow_set_init (&cur
);
9397 FOR_EACH_BB_FN (bb
, cfun
)
9399 /* Emit the notes for changes of variable locations between two
9400 subsequent basic blocks. */
9401 emit_notes_for_differences (BB_HEAD (bb
), &cur
, &VTI (bb
)->in
);
9403 if (MAY_HAVE_DEBUG_INSNS
)
9404 local_get_addr_cache
= new hash_map
<rtx
, rtx
>;
9406 /* Emit the notes for the changes in the basic block itself. */
9407 emit_notes_in_bb (bb
, &cur
);
9409 if (MAY_HAVE_DEBUG_INSNS
)
9410 delete local_get_addr_cache
;
9411 local_get_addr_cache
= NULL
;
9413 /* Free memory occupied by the in hash table, we won't need it
9415 dataflow_set_clear (&VTI (bb
)->in
);
9419 shared_hash_htab (cur
.vars
)
9420 ->traverse
<variable_table_type
*, emit_notes_for_differences_1
>
9421 (shared_hash_htab (empty_shared_hash
));
9423 dataflow_set_destroy (&cur
);
9425 if (MAY_HAVE_DEBUG_INSNS
)
9426 delete dropped_values
;
9427 dropped_values
= NULL
;
9432 /* If there is a declaration and offset associated with register/memory RTL
9433 assign declaration to *DECLP and offset to *OFFSETP, and return true. */
9436 vt_get_decl_and_offset (rtx rtl
, tree
*declp
, HOST_WIDE_INT
*offsetp
)
9440 if (REG_ATTRS (rtl
))
9442 *declp
= REG_EXPR (rtl
);
9443 *offsetp
= REG_OFFSET (rtl
);
9447 else if (GET_CODE (rtl
) == PARALLEL
)
9449 tree decl
= NULL_TREE
;
9450 HOST_WIDE_INT offset
= MAX_VAR_PARTS
;
9451 int len
= XVECLEN (rtl
, 0), i
;
9453 for (i
= 0; i
< len
; i
++)
9455 rtx reg
= XEXP (XVECEXP (rtl
, 0, i
), 0);
9456 if (!REG_P (reg
) || !REG_ATTRS (reg
))
9459 decl
= REG_EXPR (reg
);
9460 if (REG_EXPR (reg
) != decl
)
9462 if (REG_OFFSET (reg
) < offset
)
9463 offset
= REG_OFFSET (reg
);
9473 else if (MEM_P (rtl
))
9475 if (MEM_ATTRS (rtl
))
9477 *declp
= MEM_EXPR (rtl
);
9478 *offsetp
= INT_MEM_OFFSET (rtl
);
9485 /* Record the value for the ENTRY_VALUE of RTL as a global equivalence
9489 record_entry_value (cselib_val
*val
, rtx rtl
)
9491 rtx ev
= gen_rtx_ENTRY_VALUE (GET_MODE (rtl
));
9493 ENTRY_VALUE_EXP (ev
) = rtl
;
9495 cselib_add_permanent_equiv (val
, ev
, get_insns ());
9498 /* Insert function parameter PARM in IN and OUT sets of ENTRY_BLOCK. */
9501 vt_add_function_parameter (tree parm
)
9503 rtx decl_rtl
= DECL_RTL_IF_SET (parm
);
9504 rtx incoming
= DECL_INCOMING_RTL (parm
);
9507 HOST_WIDE_INT offset
;
9511 if (TREE_CODE (parm
) != PARM_DECL
)
9514 if (!decl_rtl
|| !incoming
)
9517 if (GET_MODE (decl_rtl
) == BLKmode
|| GET_MODE (incoming
) == BLKmode
)
9520 /* If there is a DRAP register or a pseudo in internal_arg_pointer,
9521 rewrite the incoming location of parameters passed on the stack
9522 into MEMs based on the argument pointer, so that incoming doesn't
9523 depend on a pseudo. */
9524 if (MEM_P (incoming
)
9525 && (XEXP (incoming
, 0) == crtl
->args
.internal_arg_pointer
9526 || (GET_CODE (XEXP (incoming
, 0)) == PLUS
9527 && XEXP (XEXP (incoming
, 0), 0)
9528 == crtl
->args
.internal_arg_pointer
9529 && CONST_INT_P (XEXP (XEXP (incoming
, 0), 1)))))
9531 HOST_WIDE_INT off
= -FIRST_PARM_OFFSET (current_function_decl
);
9532 if (GET_CODE (XEXP (incoming
, 0)) == PLUS
)
9533 off
+= INTVAL (XEXP (XEXP (incoming
, 0), 1));
9535 = replace_equiv_address_nv (incoming
,
9536 plus_constant (Pmode
,
9537 arg_pointer_rtx
, off
));
9540 #ifdef HAVE_window_save
9541 /* DECL_INCOMING_RTL uses the INCOMING_REGNO of parameter registers.
9542 If the target machine has an explicit window save instruction, the
9543 actual entry value is the corresponding OUTGOING_REGNO instead. */
9544 if (HAVE_window_save
&& !crtl
->uses_only_leaf_regs
)
9546 if (REG_P (incoming
)
9547 && HARD_REGISTER_P (incoming
)
9548 && OUTGOING_REGNO (REGNO (incoming
)) != REGNO (incoming
))
9551 p
.incoming
= incoming
;
9553 = gen_rtx_REG_offset (incoming
, GET_MODE (incoming
),
9554 OUTGOING_REGNO (REGNO (incoming
)), 0);
9555 p
.outgoing
= incoming
;
9556 vec_safe_push (windowed_parm_regs
, p
);
9558 else if (GET_CODE (incoming
) == PARALLEL
)
9561 = gen_rtx_PARALLEL (VOIDmode
, rtvec_alloc (XVECLEN (incoming
, 0)));
9564 for (i
= 0; i
< XVECLEN (incoming
, 0); i
++)
9566 rtx reg
= XEXP (XVECEXP (incoming
, 0, i
), 0);
9569 reg
= gen_rtx_REG_offset (reg
, GET_MODE (reg
),
9570 OUTGOING_REGNO (REGNO (reg
)), 0);
9572 XVECEXP (outgoing
, 0, i
)
9573 = gen_rtx_EXPR_LIST (VOIDmode
, reg
,
9574 XEXP (XVECEXP (incoming
, 0, i
), 1));
9575 vec_safe_push (windowed_parm_regs
, p
);
9578 incoming
= outgoing
;
9580 else if (MEM_P (incoming
)
9581 && REG_P (XEXP (incoming
, 0))
9582 && HARD_REGISTER_P (XEXP (incoming
, 0)))
9584 rtx reg
= XEXP (incoming
, 0);
9585 if (OUTGOING_REGNO (REGNO (reg
)) != REGNO (reg
))
9589 reg
= gen_raw_REG (GET_MODE (reg
), OUTGOING_REGNO (REGNO (reg
)));
9591 vec_safe_push (windowed_parm_regs
, p
);
9592 incoming
= replace_equiv_address_nv (incoming
, reg
);
9598 if (!vt_get_decl_and_offset (incoming
, &decl
, &offset
))
9600 if (MEM_P (incoming
))
9602 /* This means argument is passed by invisible reference. */
9608 if (!vt_get_decl_and_offset (decl_rtl
, &decl
, &offset
))
9610 offset
+= byte_lowpart_offset (GET_MODE (incoming
),
9611 GET_MODE (decl_rtl
));
9620 /* If that DECL_RTL wasn't a pseudo that got spilled to
9621 memory, bail out. Otherwise, the spill slot sharing code
9622 will force the memory to reference spill_slot_decl (%sfp),
9623 so we don't match above. That's ok, the pseudo must have
9624 referenced the entire parameter, so just reset OFFSET. */
9625 if (decl
!= get_spill_slot_decl (false))
9630 if (!track_loc_p (incoming
, parm
, offset
, false, &mode
, &offset
))
9633 out
= &VTI (ENTRY_BLOCK_PTR_FOR_FN (cfun
))->out
;
9635 dv
= dv_from_decl (parm
);
9637 if (target_for_debug_bind (parm
)
9638 /* We can't deal with these right now, because this kind of
9639 variable is single-part. ??? We could handle parallels
9640 that describe multiple locations for the same single
9641 value, but ATM we don't. */
9642 && GET_CODE (incoming
) != PARALLEL
)
9647 /* ??? We shouldn't ever hit this, but it may happen because
9648 arguments passed by invisible reference aren't dealt with
9649 above: incoming-rtl will have Pmode rather than the
9650 expected mode for the type. */
9654 lowpart
= var_lowpart (mode
, incoming
);
9658 val
= cselib_lookup_from_insn (lowpart
, mode
, true,
9659 VOIDmode
, get_insns ());
9661 /* ??? Float-typed values in memory are not handled by
9665 preserve_value (val
);
9666 set_variable_part (out
, val
->val_rtx
, dv
, offset
,
9667 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9668 dv
= dv_from_value (val
->val_rtx
);
9671 if (MEM_P (incoming
))
9673 val
= cselib_lookup_from_insn (XEXP (incoming
, 0), mode
, true,
9674 VOIDmode
, get_insns ());
9677 preserve_value (val
);
9678 incoming
= replace_equiv_address_nv (incoming
, val
->val_rtx
);
9683 if (REG_P (incoming
))
9685 incoming
= var_lowpart (mode
, incoming
);
9686 gcc_assert (REGNO (incoming
) < FIRST_PSEUDO_REGISTER
);
9687 attrs_list_insert (&out
->regs
[REGNO (incoming
)], dv
, offset
,
9689 set_variable_part (out
, incoming
, dv
, offset
,
9690 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9691 if (dv_is_value_p (dv
))
9693 record_entry_value (CSELIB_VAL_PTR (dv_as_value (dv
)), incoming
);
9694 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
9695 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (parm
))))
9697 machine_mode indmode
9698 = TYPE_MODE (TREE_TYPE (TREE_TYPE (parm
)));
9699 rtx mem
= gen_rtx_MEM (indmode
, incoming
);
9700 cselib_val
*val
= cselib_lookup_from_insn (mem
, indmode
, true,
9705 preserve_value (val
);
9706 record_entry_value (val
, mem
);
9707 set_variable_part (out
, mem
, dv_from_value (val
->val_rtx
), 0,
9708 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9713 else if (GET_CODE (incoming
) == PARALLEL
&& !dv_onepart_p (dv
))
9717 for (i
= 0; i
< XVECLEN (incoming
, 0); i
++)
9719 rtx reg
= XEXP (XVECEXP (incoming
, 0, i
), 0);
9720 offset
= REG_OFFSET (reg
);
9721 gcc_assert (REGNO (reg
) < FIRST_PSEUDO_REGISTER
);
9722 attrs_list_insert (&out
->regs
[REGNO (reg
)], dv
, offset
, reg
);
9723 set_variable_part (out
, reg
, dv
, offset
,
9724 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9727 else if (MEM_P (incoming
))
9729 incoming
= var_lowpart (mode
, incoming
);
9730 set_variable_part (out
, incoming
, dv
, offset
,
9731 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9735 /* Insert function parameters to IN and OUT sets of ENTRY_BLOCK. */
9738 vt_add_function_parameters (void)
9742 for (parm
= DECL_ARGUMENTS (current_function_decl
);
9743 parm
; parm
= DECL_CHAIN (parm
))
9744 if (!POINTER_BOUNDS_P (parm
))
9745 vt_add_function_parameter (parm
);
9747 if (DECL_HAS_VALUE_EXPR_P (DECL_RESULT (current_function_decl
)))
9749 tree vexpr
= DECL_VALUE_EXPR (DECL_RESULT (current_function_decl
));
9751 if (TREE_CODE (vexpr
) == INDIRECT_REF
)
9752 vexpr
= TREE_OPERAND (vexpr
, 0);
9754 if (TREE_CODE (vexpr
) == PARM_DECL
9755 && DECL_ARTIFICIAL (vexpr
)
9756 && !DECL_IGNORED_P (vexpr
)
9757 && DECL_NAMELESS (vexpr
))
9758 vt_add_function_parameter (vexpr
);
9762 /* Initialize cfa_base_rtx, create a preserved VALUE for it and
9763 ensure it isn't flushed during cselib_reset_table.
9764 Can be called only if frame_pointer_rtx resp. arg_pointer_rtx
9765 has been eliminated. */
9768 vt_init_cfa_base (void)
9772 #ifdef FRAME_POINTER_CFA_OFFSET
9773 cfa_base_rtx
= frame_pointer_rtx
;
9774 cfa_base_offset
= -FRAME_POINTER_CFA_OFFSET (current_function_decl
);
9776 cfa_base_rtx
= arg_pointer_rtx
;
9777 cfa_base_offset
= -ARG_POINTER_CFA_OFFSET (current_function_decl
);
9779 if (cfa_base_rtx
== hard_frame_pointer_rtx
9780 || !fixed_regs
[REGNO (cfa_base_rtx
)])
9782 cfa_base_rtx
= NULL_RTX
;
9785 if (!MAY_HAVE_DEBUG_INSNS
)
9788 /* Tell alias analysis that cfa_base_rtx should share
9789 find_base_term value with stack pointer or hard frame pointer. */
9790 if (!frame_pointer_needed
)
9791 vt_equate_reg_base_value (cfa_base_rtx
, stack_pointer_rtx
);
9792 else if (!crtl
->stack_realign_tried
)
9793 vt_equate_reg_base_value (cfa_base_rtx
, hard_frame_pointer_rtx
);
9795 val
= cselib_lookup_from_insn (cfa_base_rtx
, GET_MODE (cfa_base_rtx
), 1,
9796 VOIDmode
, get_insns ());
9797 preserve_value (val
);
9798 cselib_preserve_cfa_base_value (val
, REGNO (cfa_base_rtx
));
9801 /* Allocate and initialize the data structures for variable tracking
9802 and parse the RTL to get the micro operations. */
9805 vt_initialize (void)
9808 HOST_WIDE_INT fp_cfa_offset
= -1;
9810 alloc_aux_for_blocks (sizeof (variable_tracking_info
));
9812 empty_shared_hash
= shared_hash_pool
.allocate ();
9813 empty_shared_hash
->refcount
= 1;
9814 empty_shared_hash
->htab
= new variable_table_type (1);
9815 changed_variables
= new variable_table_type (10);
9817 /* Init the IN and OUT sets. */
9818 FOR_ALL_BB_FN (bb
, cfun
)
9820 VTI (bb
)->visited
= false;
9821 VTI (bb
)->flooded
= false;
9822 dataflow_set_init (&VTI (bb
)->in
);
9823 dataflow_set_init (&VTI (bb
)->out
);
9824 VTI (bb
)->permp
= NULL
;
9827 if (MAY_HAVE_DEBUG_INSNS
)
9829 cselib_init (CSELIB_RECORD_MEMORY
| CSELIB_PRESERVE_CONSTANTS
);
9830 scratch_regs
= BITMAP_ALLOC (NULL
);
9831 preserved_values
.create (256);
9832 global_get_addr_cache
= new hash_map
<rtx
, rtx
>;
9836 scratch_regs
= NULL
;
9837 global_get_addr_cache
= NULL
;
9840 if (MAY_HAVE_DEBUG_INSNS
)
9846 #ifdef FRAME_POINTER_CFA_OFFSET
9847 reg
= frame_pointer_rtx
;
9848 ofst
= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
9850 reg
= arg_pointer_rtx
;
9851 ofst
= ARG_POINTER_CFA_OFFSET (current_function_decl
);
9854 ofst
-= INCOMING_FRAME_SP_OFFSET
;
9856 val
= cselib_lookup_from_insn (reg
, GET_MODE (reg
), 1,
9857 VOIDmode
, get_insns ());
9858 preserve_value (val
);
9859 if (reg
!= hard_frame_pointer_rtx
&& fixed_regs
[REGNO (reg
)])
9860 cselib_preserve_cfa_base_value (val
, REGNO (reg
));
9861 expr
= plus_constant (GET_MODE (stack_pointer_rtx
),
9862 stack_pointer_rtx
, -ofst
);
9863 cselib_add_permanent_equiv (val
, expr
, get_insns ());
9867 val
= cselib_lookup_from_insn (stack_pointer_rtx
,
9868 GET_MODE (stack_pointer_rtx
), 1,
9869 VOIDmode
, get_insns ());
9870 preserve_value (val
);
9871 expr
= plus_constant (GET_MODE (reg
), reg
, ofst
);
9872 cselib_add_permanent_equiv (val
, expr
, get_insns ());
9876 /* In order to factor out the adjustments made to the stack pointer or to
9877 the hard frame pointer and thus be able to use DW_OP_fbreg operations
9878 instead of individual location lists, we're going to rewrite MEMs based
9879 on them into MEMs based on the CFA by de-eliminating stack_pointer_rtx
9880 or hard_frame_pointer_rtx to the virtual CFA pointer frame_pointer_rtx
9881 resp. arg_pointer_rtx. We can do this either when there is no frame
9882 pointer in the function and stack adjustments are consistent for all
9883 basic blocks or when there is a frame pointer and no stack realignment.
9884 But we first have to check that frame_pointer_rtx resp. arg_pointer_rtx
9885 has been eliminated. */
9886 if (!frame_pointer_needed
)
9890 if (!vt_stack_adjustments ())
9893 #ifdef FRAME_POINTER_CFA_OFFSET
9894 reg
= frame_pointer_rtx
;
9896 reg
= arg_pointer_rtx
;
9898 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
9901 if (GET_CODE (elim
) == PLUS
)
9902 elim
= XEXP (elim
, 0);
9903 if (elim
== stack_pointer_rtx
)
9904 vt_init_cfa_base ();
9907 else if (!crtl
->stack_realign_tried
)
9911 #ifdef FRAME_POINTER_CFA_OFFSET
9912 reg
= frame_pointer_rtx
;
9913 fp_cfa_offset
= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
9915 reg
= arg_pointer_rtx
;
9916 fp_cfa_offset
= ARG_POINTER_CFA_OFFSET (current_function_decl
);
9918 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
9921 if (GET_CODE (elim
) == PLUS
)
9923 fp_cfa_offset
-= INTVAL (XEXP (elim
, 1));
9924 elim
= XEXP (elim
, 0);
9926 if (elim
!= hard_frame_pointer_rtx
)
9933 /* If the stack is realigned and a DRAP register is used, we're going to
9934 rewrite MEMs based on it representing incoming locations of parameters
9935 passed on the stack into MEMs based on the argument pointer. Although
9936 we aren't going to rewrite other MEMs, we still need to initialize the
9937 virtual CFA pointer in order to ensure that the argument pointer will
9938 be seen as a constant throughout the function.
9940 ??? This doesn't work if FRAME_POINTER_CFA_OFFSET is defined. */
9941 else if (stack_realign_drap
)
9945 #ifdef FRAME_POINTER_CFA_OFFSET
9946 reg
= frame_pointer_rtx
;
9948 reg
= arg_pointer_rtx
;
9950 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
9953 if (GET_CODE (elim
) == PLUS
)
9954 elim
= XEXP (elim
, 0);
9955 if (elim
== hard_frame_pointer_rtx
)
9956 vt_init_cfa_base ();
9960 hard_frame_pointer_adjustment
= -1;
9962 vt_add_function_parameters ();
9964 FOR_EACH_BB_FN (bb
, cfun
)
9967 HOST_WIDE_INT pre
, post
= 0;
9968 basic_block first_bb
, last_bb
;
9970 if (MAY_HAVE_DEBUG_INSNS
)
9972 cselib_record_sets_hook
= add_with_sets
;
9973 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
9974 fprintf (dump_file
, "first value: %i\n",
9975 cselib_get_next_uid ());
9982 if (bb
->next_bb
== EXIT_BLOCK_PTR_FOR_FN (cfun
)
9983 || ! single_pred_p (bb
->next_bb
))
9985 e
= find_edge (bb
, bb
->next_bb
);
9986 if (! e
|| (e
->flags
& EDGE_FALLTHRU
) == 0)
9992 /* Add the micro-operations to the vector. */
9993 FOR_BB_BETWEEN (bb
, first_bb
, last_bb
->next_bb
, next_bb
)
9995 HOST_WIDE_INT offset
= VTI (bb
)->out
.stack_adjust
;
9996 VTI (bb
)->out
.stack_adjust
= VTI (bb
)->in
.stack_adjust
;
9997 for (insn
= BB_HEAD (bb
); insn
!= NEXT_INSN (BB_END (bb
));
9998 insn
= NEXT_INSN (insn
))
10002 if (!frame_pointer_needed
)
10004 insn_stack_adjust_offset_pre_post (insn
, &pre
, &post
);
10007 micro_operation mo
;
10008 mo
.type
= MO_ADJUST
;
10011 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
10012 log_op_type (PATTERN (insn
), bb
, insn
,
10013 MO_ADJUST
, dump_file
);
10014 VTI (bb
)->mos
.safe_push (mo
);
10015 VTI (bb
)->out
.stack_adjust
+= pre
;
10019 cselib_hook_called
= false;
10020 adjust_insn (bb
, insn
);
10021 if (MAY_HAVE_DEBUG_INSNS
)
10024 prepare_call_arguments (bb
, insn
);
10025 cselib_process_insn (insn
);
10026 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
10028 print_rtl_single (dump_file
, insn
);
10029 dump_cselib_table (dump_file
);
10032 if (!cselib_hook_called
)
10033 add_with_sets (insn
, 0, 0);
10034 cancel_changes (0);
10036 if (!frame_pointer_needed
&& post
)
10038 micro_operation mo
;
10039 mo
.type
= MO_ADJUST
;
10040 mo
.u
.adjust
= post
;
10042 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
10043 log_op_type (PATTERN (insn
), bb
, insn
,
10044 MO_ADJUST
, dump_file
);
10045 VTI (bb
)->mos
.safe_push (mo
);
10046 VTI (bb
)->out
.stack_adjust
+= post
;
10049 if (fp_cfa_offset
!= -1
10050 && hard_frame_pointer_adjustment
== -1
10051 && fp_setter_insn (insn
))
10053 vt_init_cfa_base ();
10054 hard_frame_pointer_adjustment
= fp_cfa_offset
;
10055 /* Disassociate sp from fp now. */
10056 if (MAY_HAVE_DEBUG_INSNS
)
10059 cselib_invalidate_rtx (stack_pointer_rtx
);
10060 v
= cselib_lookup (stack_pointer_rtx
, Pmode
, 1,
10062 if (v
&& !cselib_preserved_value_p (v
))
10064 cselib_set_value_sp_based (v
);
10065 preserve_value (v
);
10071 gcc_assert (offset
== VTI (bb
)->out
.stack_adjust
);
10076 if (MAY_HAVE_DEBUG_INSNS
)
10078 cselib_preserve_only_values ();
10079 cselib_reset_table (cselib_get_next_uid ());
10080 cselib_record_sets_hook
= NULL
;
10084 hard_frame_pointer_adjustment
= -1;
10085 VTI (ENTRY_BLOCK_PTR_FOR_FN (cfun
))->flooded
= true;
10086 cfa_base_rtx
= NULL_RTX
;
10090 /* This is *not* reset after each function. It gives each
10091 NOTE_INSN_DELETED_DEBUG_LABEL in the entire compilation
10092 a unique label number. */
10094 static int debug_label_num
= 1;
10096 /* Get rid of all debug insns from the insn stream. */
10099 delete_debug_insns (void)
10102 rtx_insn
*insn
, *next
;
10104 if (!MAY_HAVE_DEBUG_INSNS
)
10107 FOR_EACH_BB_FN (bb
, cfun
)
10109 FOR_BB_INSNS_SAFE (bb
, insn
, next
)
10110 if (DEBUG_INSN_P (insn
))
10112 tree decl
= INSN_VAR_LOCATION_DECL (insn
);
10113 if (TREE_CODE (decl
) == LABEL_DECL
10114 && DECL_NAME (decl
)
10115 && !DECL_RTL_SET_P (decl
))
10117 PUT_CODE (insn
, NOTE
);
10118 NOTE_KIND (insn
) = NOTE_INSN_DELETED_DEBUG_LABEL
;
10119 NOTE_DELETED_LABEL_NAME (insn
)
10120 = IDENTIFIER_POINTER (DECL_NAME (decl
));
10121 SET_DECL_RTL (decl
, insn
);
10122 CODE_LABEL_NUMBER (insn
) = debug_label_num
++;
10125 delete_insn (insn
);
10130 /* Run a fast, BB-local only version of var tracking, to take care of
10131 information that we don't do global analysis on, such that not all
10132 information is lost. If SKIPPED holds, we're skipping the global
10133 pass entirely, so we should try to use information it would have
10134 handled as well.. */
10137 vt_debug_insns_local (bool skipped ATTRIBUTE_UNUSED
)
10139 /* ??? Just skip it all for now. */
10140 delete_debug_insns ();
10143 /* Free the data structures needed for variable tracking. */
10150 FOR_EACH_BB_FN (bb
, cfun
)
10152 VTI (bb
)->mos
.release ();
10155 FOR_ALL_BB_FN (bb
, cfun
)
10157 dataflow_set_destroy (&VTI (bb
)->in
);
10158 dataflow_set_destroy (&VTI (bb
)->out
);
10159 if (VTI (bb
)->permp
)
10161 dataflow_set_destroy (VTI (bb
)->permp
);
10162 XDELETE (VTI (bb
)->permp
);
10165 free_aux_for_blocks ();
10166 delete empty_shared_hash
->htab
;
10167 empty_shared_hash
->htab
= NULL
;
10168 delete changed_variables
;
10169 changed_variables
= NULL
;
10170 attrs_pool
.release ();
10171 var_pool
.release ();
10172 location_chain_pool
.release ();
10173 shared_hash_pool
.release ();
10175 if (MAY_HAVE_DEBUG_INSNS
)
10177 if (global_get_addr_cache
)
10178 delete global_get_addr_cache
;
10179 global_get_addr_cache
= NULL
;
10180 loc_exp_dep_pool
.release ();
10181 valvar_pool
.release ();
10182 preserved_values
.release ();
10184 BITMAP_FREE (scratch_regs
);
10185 scratch_regs
= NULL
;
10188 #ifdef HAVE_window_save
10189 vec_free (windowed_parm_regs
);
10193 XDELETEVEC (vui_vec
);
10198 /* The entry point to variable tracking pass. */
10200 static inline unsigned int
10201 variable_tracking_main_1 (void)
10205 if (flag_var_tracking_assignments
< 0
10206 /* Var-tracking right now assumes the IR doesn't contain
10207 any pseudos at this point. */
10208 || targetm
.no_register_allocation
)
10210 delete_debug_insns ();
10214 if (n_basic_blocks_for_fn (cfun
) > 500 &&
10215 n_edges_for_fn (cfun
) / n_basic_blocks_for_fn (cfun
) >= 20)
10217 vt_debug_insns_local (true);
10221 mark_dfs_back_edges ();
10222 if (!vt_initialize ())
10225 vt_debug_insns_local (true);
10229 success
= vt_find_locations ();
10231 if (!success
&& flag_var_tracking_assignments
> 0)
10235 delete_debug_insns ();
10237 /* This is later restored by our caller. */
10238 flag_var_tracking_assignments
= 0;
10240 success
= vt_initialize ();
10241 gcc_assert (success
);
10243 success
= vt_find_locations ();
10249 vt_debug_insns_local (false);
10253 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
10255 dump_dataflow_sets ();
10256 dump_reg_info (dump_file
);
10257 dump_flow_info (dump_file
, dump_flags
);
10260 timevar_push (TV_VAR_TRACKING_EMIT
);
10262 timevar_pop (TV_VAR_TRACKING_EMIT
);
10265 vt_debug_insns_local (false);
10270 variable_tracking_main (void)
10273 int save
= flag_var_tracking_assignments
;
10275 ret
= variable_tracking_main_1 ();
10277 flag_var_tracking_assignments
= save
;
10284 const pass_data pass_data_variable_tracking
=
10286 RTL_PASS
, /* type */
10287 "vartrack", /* name */
10288 OPTGROUP_NONE
, /* optinfo_flags */
10289 TV_VAR_TRACKING
, /* tv_id */
10290 0, /* properties_required */
10291 0, /* properties_provided */
10292 0, /* properties_destroyed */
10293 0, /* todo_flags_start */
10294 0, /* todo_flags_finish */
10297 class pass_variable_tracking
: public rtl_opt_pass
10300 pass_variable_tracking (gcc::context
*ctxt
)
10301 : rtl_opt_pass (pass_data_variable_tracking
, ctxt
)
10304 /* opt_pass methods: */
10305 virtual bool gate (function
*)
10307 return (flag_var_tracking
&& !targetm
.delay_vartrack
);
10310 virtual unsigned int execute (function
*)
10312 return variable_tracking_main ();
10315 }; // class pass_variable_tracking
10317 } // anon namespace
10320 make_pass_variable_tracking (gcc::context
*ctxt
)
10322 return new pass_variable_tracking (ctxt
);