1 /* Variable tracking routines for the GNU compiler.
2 Copyright (C) 2002-2013 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"
95 #include "hard-reg-set.h"
96 #include "basic-block.h"
98 #include "insn-config.h"
101 #include "alloc-pool.h"
106 #include "tree-pass.h"
107 #include "tree-flow.h"
111 #include "diagnostic.h"
112 #include "tree-pretty-print.h"
113 #include "pointer-set.h"
118 /* var-tracking.c assumes that tree code with the same value as VALUE rtx code
119 has no chance to appear in REG_EXPR/MEM_EXPRs and isn't a decl.
120 Currently the value is the same as IDENTIFIER_NODE, which has such
121 a property. If this compile time assertion ever fails, make sure that
122 the new tree code that equals (int) VALUE has the same property. */
123 extern char check_value_val
[(int) VALUE
== (int) IDENTIFIER_NODE
? 1 : -1];
125 /* Type of micro operation. */
126 enum micro_operation_type
128 MO_USE
, /* Use location (REG or MEM). */
129 MO_USE_NO_VAR
,/* Use location which is not associated with a variable
130 or the variable is not trackable. */
131 MO_VAL_USE
, /* Use location which is associated with a value. */
132 MO_VAL_LOC
, /* Use location which appears in a debug insn. */
133 MO_VAL_SET
, /* Set location associated with a value. */
134 MO_SET
, /* Set location. */
135 MO_COPY
, /* Copy the same portion of a variable from one
136 location to another. */
137 MO_CLOBBER
, /* Clobber location. */
138 MO_CALL
, /* Call insn. */
139 MO_ADJUST
/* Adjust stack pointer. */
143 static const char * const ATTRIBUTE_UNUSED
144 micro_operation_type_name
[] = {
157 /* Where shall the note be emitted? BEFORE or AFTER the instruction.
158 Notes emitted as AFTER_CALL are to take effect during the call,
159 rather than after the call. */
162 EMIT_NOTE_BEFORE_INSN
,
163 EMIT_NOTE_AFTER_INSN
,
164 EMIT_NOTE_AFTER_CALL_INSN
167 /* Structure holding information about micro operation. */
168 typedef struct micro_operation_def
170 /* Type of micro operation. */
171 enum micro_operation_type type
;
173 /* The instruction which the micro operation is in, for MO_USE,
174 MO_USE_NO_VAR, MO_CALL and MO_ADJUST, or the subsequent
175 instruction or note in the original flow (before any var-tracking
176 notes are inserted, to simplify emission of notes), for MO_SET
181 /* Location. For MO_SET and MO_COPY, this is the SET that
182 performs the assignment, if known, otherwise it is the target
183 of the assignment. For MO_VAL_USE and MO_VAL_SET, it is a
184 CONCAT of the VALUE and the LOC associated with it. For
185 MO_VAL_LOC, it is a CONCAT of the VALUE and the VAR_LOCATION
186 associated with it. */
189 /* Stack adjustment. */
190 HOST_WIDE_INT adjust
;
195 /* A declaration of a variable, or an RTL value being handled like a
197 typedef void *decl_or_value
;
199 /* Structure for passing some other parameters to function
200 emit_note_insn_var_location. */
201 typedef struct emit_note_data_def
203 /* The instruction which the note will be emitted before/after. */
206 /* Where the note will be emitted (before/after insn)? */
207 enum emit_note_where where
;
209 /* The variables and values active at this point. */
213 /* Description of location of a part of a variable. The content of a physical
214 register is described by a chain of these structures.
215 The chains are pretty short (usually 1 or 2 elements) and thus
216 chain is the best data structure. */
217 typedef struct attrs_def
219 /* Pointer to next member of the list. */
220 struct attrs_def
*next
;
222 /* The rtx of register. */
225 /* The declaration corresponding to LOC. */
228 /* Offset from start of DECL. */
229 HOST_WIDE_INT offset
;
232 /* Structure holding a refcounted hash table. If refcount > 1,
233 it must be first unshared before modified. */
234 typedef struct shared_hash_def
236 /* Reference count. */
239 /* Actual hash table. */
243 /* Structure holding the IN or OUT set for a basic block. */
244 typedef struct dataflow_set_def
246 /* Adjustment of stack offset. */
247 HOST_WIDE_INT stack_adjust
;
249 /* Attributes for registers (lists of attrs). */
250 attrs regs
[FIRST_PSEUDO_REGISTER
];
252 /* Variable locations. */
255 /* Vars that is being traversed. */
256 shared_hash traversed_vars
;
259 /* The structure (one for each basic block) containing the information
260 needed for variable tracking. */
261 typedef struct variable_tracking_info_def
263 /* The vector of micro operations. */
264 vec
<micro_operation
> mos
;
266 /* The IN and OUT set for dataflow analysis. */
270 /* The permanent-in dataflow set for this block. This is used to
271 hold values for which we had to compute entry values. ??? This
272 should probably be dynamically allocated, to avoid using more
273 memory in non-debug builds. */
276 /* Has the block been visited in DFS? */
279 /* Has the block been flooded in VTA? */
282 } *variable_tracking_info
;
284 /* Structure for chaining the locations. */
285 typedef struct location_chain_def
287 /* Next element in the chain. */
288 struct location_chain_def
*next
;
290 /* The location (REG, MEM or VALUE). */
293 /* The "value" stored in this location. */
297 enum var_init_status init
;
300 /* A vector of loc_exp_dep holds the active dependencies of a one-part
301 DV on VALUEs, i.e., the VALUEs expanded so as to form the current
302 location of DV. Each entry is also part of VALUE' s linked-list of
303 backlinks back to DV. */
304 typedef struct loc_exp_dep_s
306 /* The dependent DV. */
308 /* The dependency VALUE or DECL_DEBUG. */
310 /* The next entry in VALUE's backlinks list. */
311 struct loc_exp_dep_s
*next
;
312 /* A pointer to the pointer to this entry (head or prev's next) in
313 the doubly-linked list. */
314 struct loc_exp_dep_s
**pprev
;
318 /* This data structure holds information about the depth of a variable
320 typedef struct expand_depth_struct
322 /* This measures the complexity of the expanded expression. It
323 grows by one for each level of expansion that adds more than one
326 /* This counts the number of ENTRY_VALUE expressions in an
327 expansion. We want to minimize their use. */
331 /* This data structure is allocated for one-part variables at the time
332 of emitting notes. */
335 /* Doubly-linked list of dependent DVs. These are DVs whose cur_loc
336 computation used the expansion of this variable, and that ought
337 to be notified should this variable change. If the DV's cur_loc
338 expanded to NULL, all components of the loc list are regarded as
339 active, so that any changes in them give us a chance to get a
340 location. Otherwise, only components of the loc that expanded to
341 non-NULL are regarded as active dependencies. */
342 loc_exp_dep
*backlinks
;
343 /* This holds the LOC that was expanded into cur_loc. We need only
344 mark a one-part variable as changed if the FROM loc is removed,
345 or if it has no known location and a loc is added, or if it gets
346 a change notification from any of its active dependencies. */
348 /* The depth of the cur_loc expression. */
350 /* Dependencies actively used when expand FROM into cur_loc. */
351 vec
<loc_exp_dep
, va_heap
, vl_embed
> deps
;
354 /* Structure describing one part of variable. */
355 typedef struct variable_part_def
357 /* Chain of locations of the part. */
358 location_chain loc_chain
;
360 /* Location which was last emitted to location list. */
365 /* The offset in the variable, if !var->onepart. */
366 HOST_WIDE_INT offset
;
368 /* Pointer to auxiliary data, if var->onepart and emit_notes. */
369 struct onepart_aux
*onepaux
;
373 /* Maximum number of location parts. */
374 #define MAX_VAR_PARTS 16
376 /* Enumeration type used to discriminate various types of one-part
378 typedef enum onepart_enum
380 /* Not a one-part variable. */
382 /* A one-part DECL that is not a DEBUG_EXPR_DECL. */
384 /* A DEBUG_EXPR_DECL. */
390 /* Structure describing where the variable is located. */
391 typedef struct variable_def
393 /* The declaration of the variable, or an RTL value being handled
394 like a declaration. */
397 /* Reference count. */
400 /* Number of variable parts. */
403 /* What type of DV this is, according to enum onepart_enum. */
404 ENUM_BITFIELD (onepart_enum
) onepart
: CHAR_BIT
;
406 /* True if this variable_def struct is currently in the
407 changed_variables hash table. */
408 bool in_changed_variables
;
410 /* The variable parts. */
411 variable_part var_part
[1];
413 typedef const struct variable_def
*const_variable
;
415 /* Pointer to the BB's information specific to variable tracking pass. */
416 #define VTI(BB) ((variable_tracking_info) (BB)->aux)
418 /* Macro to access MEM_OFFSET as an HOST_WIDE_INT. Evaluates MEM twice. */
419 #define INT_MEM_OFFSET(mem) (MEM_OFFSET_KNOWN_P (mem) ? MEM_OFFSET (mem) : 0)
421 #if ENABLE_CHECKING && (GCC_VERSION >= 2007)
423 /* Access VAR's Ith part's offset, checking that it's not a one-part
425 #define VAR_PART_OFFSET(var, i) __extension__ \
426 (*({ variable const __v = (var); \
427 gcc_checking_assert (!__v->onepart); \
428 &__v->var_part[(i)].aux.offset; }))
430 /* Access VAR's one-part auxiliary data, checking that it is a
431 one-part variable. */
432 #define VAR_LOC_1PAUX(var) __extension__ \
433 (*({ variable const __v = (var); \
434 gcc_checking_assert (__v->onepart); \
435 &__v->var_part[0].aux.onepaux; }))
438 #define VAR_PART_OFFSET(var, i) ((var)->var_part[(i)].aux.offset)
439 #define VAR_LOC_1PAUX(var) ((var)->var_part[0].aux.onepaux)
442 /* These are accessor macros for the one-part auxiliary data. When
443 convenient for users, they're guarded by tests that the data was
445 #define VAR_LOC_DEP_LST(var) (VAR_LOC_1PAUX (var) \
446 ? VAR_LOC_1PAUX (var)->backlinks \
448 #define VAR_LOC_DEP_LSTP(var) (VAR_LOC_1PAUX (var) \
449 ? &VAR_LOC_1PAUX (var)->backlinks \
451 #define VAR_LOC_FROM(var) (VAR_LOC_1PAUX (var)->from)
452 #define VAR_LOC_DEPTH(var) (VAR_LOC_1PAUX (var)->depth)
453 #define VAR_LOC_DEP_VEC(var) (VAR_LOC_1PAUX (var) \
454 ? &VAR_LOC_1PAUX (var)->deps \
457 /* Alloc pool for struct attrs_def. */
458 static alloc_pool attrs_pool
;
460 /* Alloc pool for struct variable_def with MAX_VAR_PARTS entries. */
461 static alloc_pool var_pool
;
463 /* Alloc pool for struct variable_def with a single var_part entry. */
464 static alloc_pool valvar_pool
;
466 /* Alloc pool for struct location_chain_def. */
467 static alloc_pool loc_chain_pool
;
469 /* Alloc pool for struct shared_hash_def. */
470 static alloc_pool shared_hash_pool
;
472 /* Alloc pool for struct loc_exp_dep_s for NOT_ONEPART variables. */
473 static alloc_pool loc_exp_dep_pool
;
475 /* Changed variables, notes will be emitted for them. */
476 static htab_t changed_variables
;
478 /* Shall notes be emitted? */
479 static bool emit_notes
;
481 /* Values whose dynamic location lists have gone empty, but whose
482 cselib location lists are still usable. Use this to hold the
483 current location, the backlinks, etc, during emit_notes. */
484 static htab_t dropped_values
;
486 /* Empty shared hashtable. */
487 static shared_hash empty_shared_hash
;
489 /* Scratch register bitmap used by cselib_expand_value_rtx. */
490 static bitmap scratch_regs
= NULL
;
492 #ifdef HAVE_window_save
493 typedef struct GTY(()) parm_reg
{
499 /* Vector of windowed parameter registers, if any. */
500 static vec
<parm_reg_t
, va_gc
> *windowed_parm_regs
= NULL
;
503 /* Variable used to tell whether cselib_process_insn called our hook. */
504 static bool cselib_hook_called
;
506 /* Local function prototypes. */
507 static void stack_adjust_offset_pre_post (rtx
, HOST_WIDE_INT
*,
509 static void insn_stack_adjust_offset_pre_post (rtx
, HOST_WIDE_INT
*,
511 static bool vt_stack_adjustments (void);
512 static hashval_t
variable_htab_hash (const void *);
513 static int variable_htab_eq (const void *, const void *);
514 static void variable_htab_free (void *);
516 static void init_attrs_list_set (attrs
*);
517 static void attrs_list_clear (attrs
*);
518 static attrs
attrs_list_member (attrs
, decl_or_value
, HOST_WIDE_INT
);
519 static void attrs_list_insert (attrs
*, decl_or_value
, HOST_WIDE_INT
, rtx
);
520 static void attrs_list_copy (attrs
*, attrs
);
521 static void attrs_list_union (attrs
*, attrs
);
523 static void **unshare_variable (dataflow_set
*set
, void **slot
, variable var
,
524 enum var_init_status
);
525 static void vars_copy (htab_t
, htab_t
);
526 static tree
var_debug_decl (tree
);
527 static void var_reg_set (dataflow_set
*, rtx
, enum var_init_status
, rtx
);
528 static void var_reg_delete_and_set (dataflow_set
*, rtx
, bool,
529 enum var_init_status
, rtx
);
530 static void var_reg_delete (dataflow_set
*, rtx
, bool);
531 static void var_regno_delete (dataflow_set
*, int);
532 static void var_mem_set (dataflow_set
*, rtx
, enum var_init_status
, rtx
);
533 static void var_mem_delete_and_set (dataflow_set
*, rtx
, bool,
534 enum var_init_status
, rtx
);
535 static void var_mem_delete (dataflow_set
*, rtx
, bool);
537 static void dataflow_set_init (dataflow_set
*);
538 static void dataflow_set_clear (dataflow_set
*);
539 static void dataflow_set_copy (dataflow_set
*, dataflow_set
*);
540 static int variable_union_info_cmp_pos (const void *, const void *);
541 static void dataflow_set_union (dataflow_set
*, dataflow_set
*);
542 static location_chain
find_loc_in_1pdv (rtx
, variable
, htab_t
);
543 static bool canon_value_cmp (rtx
, rtx
);
544 static int loc_cmp (rtx
, rtx
);
545 static bool variable_part_different_p (variable_part
*, variable_part
*);
546 static bool onepart_variable_different_p (variable
, variable
);
547 static bool variable_different_p (variable
, variable
);
548 static bool dataflow_set_different (dataflow_set
*, dataflow_set
*);
549 static void dataflow_set_destroy (dataflow_set
*);
551 static bool contains_symbol_ref (rtx
);
552 static bool track_expr_p (tree
, bool);
553 static bool same_variable_part_p (rtx
, tree
, HOST_WIDE_INT
);
554 static int add_uses (rtx
*, void *);
555 static void add_uses_1 (rtx
*, void *);
556 static void add_stores (rtx
, const_rtx
, void *);
557 static bool compute_bb_dataflow (basic_block
);
558 static bool vt_find_locations (void);
560 static void dump_attrs_list (attrs
);
561 static int dump_var_slot (void **, void *);
562 static void dump_var (variable
);
563 static void dump_vars (htab_t
);
564 static void dump_dataflow_set (dataflow_set
*);
565 static void dump_dataflow_sets (void);
567 static void set_dv_changed (decl_or_value
, bool);
568 static void variable_was_changed (variable
, dataflow_set
*);
569 static void **set_slot_part (dataflow_set
*, rtx
, void **,
570 decl_or_value
, HOST_WIDE_INT
,
571 enum var_init_status
, rtx
);
572 static void set_variable_part (dataflow_set
*, rtx
,
573 decl_or_value
, HOST_WIDE_INT
,
574 enum var_init_status
, rtx
, enum insert_option
);
575 static void **clobber_slot_part (dataflow_set
*, rtx
,
576 void **, HOST_WIDE_INT
, rtx
);
577 static void clobber_variable_part (dataflow_set
*, rtx
,
578 decl_or_value
, HOST_WIDE_INT
, rtx
);
579 static void **delete_slot_part (dataflow_set
*, rtx
, void **, HOST_WIDE_INT
);
580 static void delete_variable_part (dataflow_set
*, rtx
,
581 decl_or_value
, HOST_WIDE_INT
);
582 static int emit_note_insn_var_location (void **, void *);
583 static void emit_notes_for_changes (rtx
, enum emit_note_where
, shared_hash
);
584 static int emit_notes_for_differences_1 (void **, void *);
585 static int emit_notes_for_differences_2 (void **, void *);
586 static void emit_notes_for_differences (rtx
, dataflow_set
*, dataflow_set
*);
587 static void emit_notes_in_bb (basic_block
, dataflow_set
*);
588 static void vt_emit_notes (void);
590 static bool vt_get_decl_and_offset (rtx
, tree
*, HOST_WIDE_INT
*);
591 static void vt_add_function_parameters (void);
592 static bool vt_initialize (void);
593 static void vt_finalize (void);
595 /* Given a SET, calculate the amount of stack adjustment it contains
596 PRE- and POST-modifying stack pointer.
597 This function is similar to stack_adjust_offset. */
600 stack_adjust_offset_pre_post (rtx pattern
, HOST_WIDE_INT
*pre
,
603 rtx src
= SET_SRC (pattern
);
604 rtx dest
= SET_DEST (pattern
);
607 if (dest
== stack_pointer_rtx
)
609 /* (set (reg sp) (plus (reg sp) (const_int))) */
610 code
= GET_CODE (src
);
611 if (! (code
== PLUS
|| code
== MINUS
)
612 || XEXP (src
, 0) != stack_pointer_rtx
613 || !CONST_INT_P (XEXP (src
, 1)))
617 *post
+= INTVAL (XEXP (src
, 1));
619 *post
-= INTVAL (XEXP (src
, 1));
621 else if (MEM_P (dest
))
623 /* (set (mem (pre_dec (reg sp))) (foo)) */
624 src
= XEXP (dest
, 0);
625 code
= GET_CODE (src
);
631 if (XEXP (src
, 0) == stack_pointer_rtx
)
633 rtx val
= XEXP (XEXP (src
, 1), 1);
634 /* We handle only adjustments by constant amount. */
635 gcc_assert (GET_CODE (XEXP (src
, 1)) == PLUS
&&
638 if (code
== PRE_MODIFY
)
639 *pre
-= INTVAL (val
);
641 *post
-= INTVAL (val
);
647 if (XEXP (src
, 0) == stack_pointer_rtx
)
649 *pre
+= GET_MODE_SIZE (GET_MODE (dest
));
655 if (XEXP (src
, 0) == stack_pointer_rtx
)
657 *post
+= GET_MODE_SIZE (GET_MODE (dest
));
663 if (XEXP (src
, 0) == stack_pointer_rtx
)
665 *pre
-= GET_MODE_SIZE (GET_MODE (dest
));
671 if (XEXP (src
, 0) == stack_pointer_rtx
)
673 *post
-= GET_MODE_SIZE (GET_MODE (dest
));
684 /* Given an INSN, calculate the amount of stack adjustment it contains
685 PRE- and POST-modifying stack pointer. */
688 insn_stack_adjust_offset_pre_post (rtx insn
, HOST_WIDE_INT
*pre
,
696 pattern
= PATTERN (insn
);
697 if (RTX_FRAME_RELATED_P (insn
))
699 rtx expr
= find_reg_note (insn
, REG_FRAME_RELATED_EXPR
, NULL_RTX
);
701 pattern
= XEXP (expr
, 0);
704 if (GET_CODE (pattern
) == SET
)
705 stack_adjust_offset_pre_post (pattern
, pre
, post
);
706 else if (GET_CODE (pattern
) == PARALLEL
707 || GET_CODE (pattern
) == SEQUENCE
)
711 /* There may be stack adjustments inside compound insns. Search
713 for ( i
= XVECLEN (pattern
, 0) - 1; i
>= 0; i
--)
714 if (GET_CODE (XVECEXP (pattern
, 0, i
)) == SET
)
715 stack_adjust_offset_pre_post (XVECEXP (pattern
, 0, i
), pre
, post
);
719 /* Compute stack adjustments for all blocks by traversing DFS tree.
720 Return true when the adjustments on all incoming edges are consistent.
721 Heavily borrowed from pre_and_rev_post_order_compute. */
724 vt_stack_adjustments (void)
726 edge_iterator
*stack
;
729 /* Initialize entry block. */
730 VTI (ENTRY_BLOCK_PTR
)->visited
= true;
731 VTI (ENTRY_BLOCK_PTR
)->in
.stack_adjust
= INCOMING_FRAME_SP_OFFSET
;
732 VTI (ENTRY_BLOCK_PTR
)->out
.stack_adjust
= INCOMING_FRAME_SP_OFFSET
;
734 /* Allocate stack for back-tracking up CFG. */
735 stack
= XNEWVEC (edge_iterator
, n_basic_blocks
+ 1);
738 /* Push the first edge on to the stack. */
739 stack
[sp
++] = ei_start (ENTRY_BLOCK_PTR
->succs
);
747 /* Look at the edge on the top of the stack. */
749 src
= ei_edge (ei
)->src
;
750 dest
= ei_edge (ei
)->dest
;
752 /* Check if the edge destination has been visited yet. */
753 if (!VTI (dest
)->visited
)
756 HOST_WIDE_INT pre
, post
, offset
;
757 VTI (dest
)->visited
= true;
758 VTI (dest
)->in
.stack_adjust
= offset
= VTI (src
)->out
.stack_adjust
;
760 if (dest
!= EXIT_BLOCK_PTR
)
761 for (insn
= BB_HEAD (dest
);
762 insn
!= NEXT_INSN (BB_END (dest
));
763 insn
= NEXT_INSN (insn
))
766 insn_stack_adjust_offset_pre_post (insn
, &pre
, &post
);
767 offset
+= pre
+ post
;
770 VTI (dest
)->out
.stack_adjust
= offset
;
772 if (EDGE_COUNT (dest
->succs
) > 0)
773 /* Since the DEST node has been visited for the first
774 time, check its successors. */
775 stack
[sp
++] = ei_start (dest
->succs
);
779 /* Check whether the adjustments on the edges are the same. */
780 if (VTI (dest
)->in
.stack_adjust
!= VTI (src
)->out
.stack_adjust
)
786 if (! ei_one_before_end_p (ei
))
787 /* Go to the next edge. */
788 ei_next (&stack
[sp
- 1]);
790 /* Return to previous level if there are no more edges. */
799 /* arg_pointer_rtx resp. frame_pointer_rtx if stack_pointer_rtx or
800 hard_frame_pointer_rtx is being mapped to it and offset for it. */
801 static rtx cfa_base_rtx
;
802 static HOST_WIDE_INT cfa_base_offset
;
804 /* Compute a CFA-based value for an ADJUSTMENT made to stack_pointer_rtx
805 or hard_frame_pointer_rtx. */
808 compute_cfa_pointer (HOST_WIDE_INT adjustment
)
810 return plus_constant (Pmode
, cfa_base_rtx
, adjustment
+ cfa_base_offset
);
813 /* Adjustment for hard_frame_pointer_rtx to cfa base reg,
814 or -1 if the replacement shouldn't be done. */
815 static HOST_WIDE_INT hard_frame_pointer_adjustment
= -1;
817 /* Data for adjust_mems callback. */
819 struct adjust_mem_data
822 enum machine_mode mem_mode
;
823 HOST_WIDE_INT stack_adjust
;
827 /* Helper for adjust_mems. Return 1 if *loc is unsuitable for
828 transformation of wider mode arithmetics to narrower mode,
829 -1 if it is suitable and subexpressions shouldn't be
830 traversed and 0 if it is suitable and subexpressions should
831 be traversed. Called through for_each_rtx. */
834 use_narrower_mode_test (rtx
*loc
, void *data
)
836 rtx subreg
= (rtx
) data
;
838 if (CONSTANT_P (*loc
))
840 switch (GET_CODE (*loc
))
843 if (cselib_lookup (*loc
, GET_MODE (SUBREG_REG (subreg
)), 0, VOIDmode
))
845 if (!validate_subreg (GET_MODE (subreg
), GET_MODE (*loc
),
846 *loc
, subreg_lowpart_offset (GET_MODE (subreg
),
855 if (for_each_rtx (&XEXP (*loc
, 0), use_narrower_mode_test
, data
))
864 /* Transform X into narrower mode MODE from wider mode WMODE. */
867 use_narrower_mode (rtx x
, enum machine_mode mode
, enum machine_mode wmode
)
871 return lowpart_subreg (mode
, x
, wmode
);
872 switch (GET_CODE (x
))
875 return lowpart_subreg (mode
, x
, wmode
);
879 op0
= use_narrower_mode (XEXP (x
, 0), mode
, wmode
);
880 op1
= use_narrower_mode (XEXP (x
, 1), mode
, wmode
);
881 return simplify_gen_binary (GET_CODE (x
), mode
, op0
, op1
);
883 op0
= use_narrower_mode (XEXP (x
, 0), mode
, wmode
);
884 return simplify_gen_binary (ASHIFT
, mode
, op0
, XEXP (x
, 1));
890 /* Helper function for adjusting used MEMs. */
893 adjust_mems (rtx loc
, const_rtx old_rtx
, void *data
)
895 struct adjust_mem_data
*amd
= (struct adjust_mem_data
*) data
;
896 rtx mem
, addr
= loc
, tem
;
897 enum machine_mode mem_mode_save
;
899 switch (GET_CODE (loc
))
902 /* Don't do any sp or fp replacements outside of MEM addresses
904 if (amd
->mem_mode
== VOIDmode
&& amd
->store
)
906 if (loc
== stack_pointer_rtx
907 && !frame_pointer_needed
909 return compute_cfa_pointer (amd
->stack_adjust
);
910 else if (loc
== hard_frame_pointer_rtx
911 && frame_pointer_needed
912 && hard_frame_pointer_adjustment
!= -1
914 return compute_cfa_pointer (hard_frame_pointer_adjustment
);
915 gcc_checking_assert (loc
!= virtual_incoming_args_rtx
);
921 mem
= targetm
.delegitimize_address (mem
);
922 if (mem
!= loc
&& !MEM_P (mem
))
923 return simplify_replace_fn_rtx (mem
, old_rtx
, adjust_mems
, data
);
926 addr
= XEXP (mem
, 0);
927 mem_mode_save
= amd
->mem_mode
;
928 amd
->mem_mode
= GET_MODE (mem
);
929 store_save
= amd
->store
;
931 addr
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
932 amd
->store
= store_save
;
933 amd
->mem_mode
= mem_mode_save
;
935 addr
= targetm
.delegitimize_address (addr
);
936 if (addr
!= XEXP (mem
, 0))
937 mem
= replace_equiv_address_nv (mem
, addr
);
939 mem
= avoid_constant_pool_reference (mem
);
943 addr
= gen_rtx_PLUS (GET_MODE (loc
), XEXP (loc
, 0),
944 GEN_INT (GET_CODE (loc
) == PRE_INC
945 ? GET_MODE_SIZE (amd
->mem_mode
)
946 : -GET_MODE_SIZE (amd
->mem_mode
)));
950 addr
= XEXP (loc
, 0);
951 gcc_assert (amd
->mem_mode
!= VOIDmode
&& amd
->mem_mode
!= BLKmode
);
952 addr
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
953 tem
= gen_rtx_PLUS (GET_MODE (loc
), XEXP (loc
, 0),
954 GEN_INT ((GET_CODE (loc
) == PRE_INC
955 || GET_CODE (loc
) == POST_INC
)
956 ? GET_MODE_SIZE (amd
->mem_mode
)
957 : -GET_MODE_SIZE (amd
->mem_mode
)));
958 amd
->side_effects
= alloc_EXPR_LIST (0,
959 gen_rtx_SET (VOIDmode
,
965 addr
= XEXP (loc
, 1);
968 addr
= XEXP (loc
, 0);
969 gcc_assert (amd
->mem_mode
!= VOIDmode
);
970 addr
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
971 amd
->side_effects
= alloc_EXPR_LIST (0,
972 gen_rtx_SET (VOIDmode
,
978 /* First try without delegitimization of whole MEMs and
979 avoid_constant_pool_reference, which is more likely to succeed. */
980 store_save
= amd
->store
;
982 addr
= simplify_replace_fn_rtx (SUBREG_REG (loc
), old_rtx
, adjust_mems
,
984 amd
->store
= store_save
;
985 mem
= simplify_replace_fn_rtx (addr
, old_rtx
, adjust_mems
, data
);
986 if (mem
== SUBREG_REG (loc
))
991 tem
= simplify_gen_subreg (GET_MODE (loc
), mem
,
992 GET_MODE (SUBREG_REG (loc
)),
996 tem
= simplify_gen_subreg (GET_MODE (loc
), addr
,
997 GET_MODE (SUBREG_REG (loc
)),
1000 tem
= gen_rtx_raw_SUBREG (GET_MODE (loc
), addr
, SUBREG_BYTE (loc
));
1002 if (MAY_HAVE_DEBUG_INSNS
1003 && GET_CODE (tem
) == SUBREG
1004 && (GET_CODE (SUBREG_REG (tem
)) == PLUS
1005 || GET_CODE (SUBREG_REG (tem
)) == MINUS
1006 || GET_CODE (SUBREG_REG (tem
)) == MULT
1007 || GET_CODE (SUBREG_REG (tem
)) == ASHIFT
)
1008 && GET_MODE_CLASS (GET_MODE (tem
)) == MODE_INT
1009 && GET_MODE_CLASS (GET_MODE (SUBREG_REG (tem
))) == MODE_INT
1010 && GET_MODE_SIZE (GET_MODE (tem
))
1011 < GET_MODE_SIZE (GET_MODE (SUBREG_REG (tem
)))
1012 && subreg_lowpart_p (tem
)
1013 && !for_each_rtx (&SUBREG_REG (tem
), use_narrower_mode_test
, tem
))
1014 return use_narrower_mode (SUBREG_REG (tem
), GET_MODE (tem
),
1015 GET_MODE (SUBREG_REG (tem
)));
1018 /* Don't do any replacements in second and following
1019 ASM_OPERANDS of inline-asm with multiple sets.
1020 ASM_OPERANDS_INPUT_VEC, ASM_OPERANDS_INPUT_CONSTRAINT_VEC
1021 and ASM_OPERANDS_LABEL_VEC need to be equal between
1022 all the ASM_OPERANDs in the insn and adjust_insn will
1024 if (ASM_OPERANDS_OUTPUT_IDX (loc
) != 0)
1033 /* Helper function for replacement of uses. */
1036 adjust_mem_uses (rtx
*x
, void *data
)
1038 rtx new_x
= simplify_replace_fn_rtx (*x
, NULL_RTX
, adjust_mems
, data
);
1040 validate_change (NULL_RTX
, x
, new_x
, true);
1043 /* Helper function for replacement of stores. */
1046 adjust_mem_stores (rtx loc
, const_rtx expr
, void *data
)
1050 rtx new_dest
= simplify_replace_fn_rtx (SET_DEST (expr
), NULL_RTX
,
1052 if (new_dest
!= SET_DEST (expr
))
1054 rtx xexpr
= CONST_CAST_RTX (expr
);
1055 validate_change (NULL_RTX
, &SET_DEST (xexpr
), new_dest
, true);
1060 /* Simplify INSN. Remove all {PRE,POST}_{INC,DEC,MODIFY} rtxes,
1061 replace them with their value in the insn and add the side-effects
1062 as other sets to the insn. */
1065 adjust_insn (basic_block bb
, rtx insn
)
1067 struct adjust_mem_data amd
;
1070 #ifdef HAVE_window_save
1071 /* If the target machine has an explicit window save instruction, the
1072 transformation OUTGOING_REGNO -> INCOMING_REGNO is done there. */
1073 if (RTX_FRAME_RELATED_P (insn
)
1074 && find_reg_note (insn
, REG_CFA_WINDOW_SAVE
, NULL_RTX
))
1076 unsigned int i
, nregs
= vec_safe_length (windowed_parm_regs
);
1077 rtx rtl
= gen_rtx_PARALLEL (VOIDmode
, rtvec_alloc (nregs
* 2));
1080 FOR_EACH_VEC_SAFE_ELT (windowed_parm_regs
, i
, p
)
1082 XVECEXP (rtl
, 0, i
* 2)
1083 = gen_rtx_SET (VOIDmode
, p
->incoming
, p
->outgoing
);
1084 /* Do not clobber the attached DECL, but only the REG. */
1085 XVECEXP (rtl
, 0, i
* 2 + 1)
1086 = gen_rtx_CLOBBER (GET_MODE (p
->outgoing
),
1087 gen_raw_REG (GET_MODE (p
->outgoing
),
1088 REGNO (p
->outgoing
)));
1091 validate_change (NULL_RTX
, &PATTERN (insn
), rtl
, true);
1096 amd
.mem_mode
= VOIDmode
;
1097 amd
.stack_adjust
= -VTI (bb
)->out
.stack_adjust
;
1098 amd
.side_effects
= NULL_RTX
;
1101 note_stores (PATTERN (insn
), adjust_mem_stores
, &amd
);
1104 if (GET_CODE (PATTERN (insn
)) == PARALLEL
1105 && asm_noperands (PATTERN (insn
)) > 0
1106 && GET_CODE (XVECEXP (PATTERN (insn
), 0, 0)) == SET
)
1111 /* inline-asm with multiple sets is tiny bit more complicated,
1112 because the 3 vectors in ASM_OPERANDS need to be shared between
1113 all ASM_OPERANDS in the instruction. adjust_mems will
1114 not touch ASM_OPERANDS other than the first one, asm_noperands
1115 test above needs to be called before that (otherwise it would fail)
1116 and afterwards this code fixes it up. */
1117 note_uses (&PATTERN (insn
), adjust_mem_uses
, &amd
);
1118 body
= PATTERN (insn
);
1119 set0
= XVECEXP (body
, 0, 0);
1120 gcc_checking_assert (GET_CODE (set0
) == SET
1121 && GET_CODE (SET_SRC (set0
)) == ASM_OPERANDS
1122 && ASM_OPERANDS_OUTPUT_IDX (SET_SRC (set0
)) == 0);
1123 for (i
= 1; i
< XVECLEN (body
, 0); i
++)
1124 if (GET_CODE (XVECEXP (body
, 0, i
)) != SET
)
1128 set
= XVECEXP (body
, 0, i
);
1129 gcc_checking_assert (GET_CODE (SET_SRC (set
)) == ASM_OPERANDS
1130 && ASM_OPERANDS_OUTPUT_IDX (SET_SRC (set
))
1132 if (ASM_OPERANDS_INPUT_VEC (SET_SRC (set
))
1133 != ASM_OPERANDS_INPUT_VEC (SET_SRC (set0
))
1134 || ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set
))
1135 != ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set0
))
1136 || ASM_OPERANDS_LABEL_VEC (SET_SRC (set
))
1137 != ASM_OPERANDS_LABEL_VEC (SET_SRC (set0
)))
1139 rtx newsrc
= shallow_copy_rtx (SET_SRC (set
));
1140 ASM_OPERANDS_INPUT_VEC (newsrc
)
1141 = ASM_OPERANDS_INPUT_VEC (SET_SRC (set0
));
1142 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (newsrc
)
1143 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set0
));
1144 ASM_OPERANDS_LABEL_VEC (newsrc
)
1145 = ASM_OPERANDS_LABEL_VEC (SET_SRC (set0
));
1146 validate_change (NULL_RTX
, &SET_SRC (set
), newsrc
, true);
1151 note_uses (&PATTERN (insn
), adjust_mem_uses
, &amd
);
1153 /* For read-only MEMs containing some constant, prefer those
1155 set
= single_set (insn
);
1156 if (set
&& MEM_P (SET_SRC (set
)) && MEM_READONLY_P (SET_SRC (set
)))
1158 rtx note
= find_reg_equal_equiv_note (insn
);
1160 if (note
&& CONSTANT_P (XEXP (note
, 0)))
1161 validate_change (NULL_RTX
, &SET_SRC (set
), XEXP (note
, 0), true);
1164 if (amd
.side_effects
)
1166 rtx
*pat
, new_pat
, s
;
1169 pat
= &PATTERN (insn
);
1170 if (GET_CODE (*pat
) == COND_EXEC
)
1171 pat
= &COND_EXEC_CODE (*pat
);
1172 if (GET_CODE (*pat
) == PARALLEL
)
1173 oldn
= XVECLEN (*pat
, 0);
1176 for (s
= amd
.side_effects
, newn
= 0; s
; newn
++)
1178 new_pat
= gen_rtx_PARALLEL (VOIDmode
, rtvec_alloc (oldn
+ newn
));
1179 if (GET_CODE (*pat
) == PARALLEL
)
1180 for (i
= 0; i
< oldn
; i
++)
1181 XVECEXP (new_pat
, 0, i
) = XVECEXP (*pat
, 0, i
);
1183 XVECEXP (new_pat
, 0, 0) = *pat
;
1184 for (s
= amd
.side_effects
, i
= oldn
; i
< oldn
+ newn
; i
++, s
= XEXP (s
, 1))
1185 XVECEXP (new_pat
, 0, i
) = XEXP (s
, 0);
1186 free_EXPR_LIST_list (&amd
.side_effects
);
1187 validate_change (NULL_RTX
, pat
, new_pat
, true);
1191 /* Return true if a decl_or_value DV is a DECL or NULL. */
1193 dv_is_decl_p (decl_or_value dv
)
1195 return !dv
|| (int) TREE_CODE ((tree
) dv
) != (int) VALUE
;
1198 /* Return true if a decl_or_value is a VALUE rtl. */
1200 dv_is_value_p (decl_or_value dv
)
1202 return dv
&& !dv_is_decl_p (dv
);
1205 /* Return the decl in the decl_or_value. */
1207 dv_as_decl (decl_or_value dv
)
1209 gcc_checking_assert (dv_is_decl_p (dv
));
1213 /* Return the value in the decl_or_value. */
1215 dv_as_value (decl_or_value dv
)
1217 gcc_checking_assert (dv_is_value_p (dv
));
1221 /* Return the DEBUG_EXPR of a DEBUG_EXPR_DECL or the VALUE in DV. */
1223 dv_as_rtx (decl_or_value dv
)
1227 if (dv_is_value_p (dv
))
1228 return dv_as_value (dv
);
1230 decl
= dv_as_decl (dv
);
1232 gcc_checking_assert (TREE_CODE (decl
) == DEBUG_EXPR_DECL
);
1233 return DECL_RTL_KNOWN_SET (decl
);
1236 /* Return the opaque pointer in the decl_or_value. */
1237 static inline void *
1238 dv_as_opaque (decl_or_value dv
)
1243 /* Return nonzero if a decl_or_value must not have more than one
1244 variable part. The returned value discriminates among various
1245 kinds of one-part DVs ccording to enum onepart_enum. */
1246 static inline onepart_enum_t
1247 dv_onepart_p (decl_or_value dv
)
1251 if (!MAY_HAVE_DEBUG_INSNS
)
1254 if (dv_is_value_p (dv
))
1255 return ONEPART_VALUE
;
1257 decl
= dv_as_decl (dv
);
1259 if (TREE_CODE (decl
) == DEBUG_EXPR_DECL
)
1260 return ONEPART_DEXPR
;
1262 if (target_for_debug_bind (decl
) != NULL_TREE
)
1263 return ONEPART_VDECL
;
1268 /* Return the variable pool to be used for a dv of type ONEPART. */
1269 static inline alloc_pool
1270 onepart_pool (onepart_enum_t onepart
)
1272 return onepart
? valvar_pool
: var_pool
;
1275 /* Build a decl_or_value out of a decl. */
1276 static inline decl_or_value
1277 dv_from_decl (tree decl
)
1281 gcc_checking_assert (dv_is_decl_p (dv
));
1285 /* Build a decl_or_value out of a value. */
1286 static inline decl_or_value
1287 dv_from_value (rtx value
)
1291 gcc_checking_assert (dv_is_value_p (dv
));
1295 /* Return a value or the decl of a debug_expr as a decl_or_value. */
1296 static inline decl_or_value
1301 switch (GET_CODE (x
))
1304 dv
= dv_from_decl (DEBUG_EXPR_TREE_DECL (x
));
1305 gcc_checking_assert (DECL_RTL_KNOWN_SET (DEBUG_EXPR_TREE_DECL (x
)) == x
);
1309 dv
= dv_from_value (x
);
1319 extern void debug_dv (decl_or_value dv
);
1322 debug_dv (decl_or_value dv
)
1324 if (dv_is_value_p (dv
))
1325 debug_rtx (dv_as_value (dv
));
1327 debug_generic_stmt (dv_as_decl (dv
));
1330 typedef unsigned int dvuid
;
1332 /* Return the uid of DV. */
1335 dv_uid (decl_or_value dv
)
1337 if (dv_is_value_p (dv
))
1338 return CSELIB_VAL_PTR (dv_as_value (dv
))->uid
;
1340 return DECL_UID (dv_as_decl (dv
));
1343 /* Compute the hash from the uid. */
1345 static inline hashval_t
1346 dv_uid2hash (dvuid uid
)
1351 /* The hash function for a mask table in a shared_htab chain. */
1353 static inline hashval_t
1354 dv_htab_hash (decl_or_value dv
)
1356 return dv_uid2hash (dv_uid (dv
));
1359 /* The hash function for variable_htab, computes the hash value
1360 from the declaration of variable X. */
1363 variable_htab_hash (const void *x
)
1365 const_variable
const v
= (const_variable
) x
;
1367 return dv_htab_hash (v
->dv
);
1370 /* Compare the declaration of variable X with declaration Y. */
1373 variable_htab_eq (const void *x
, const void *y
)
1375 const_variable
const v
= (const_variable
) x
;
1376 decl_or_value dv
= CONST_CAST2 (decl_or_value
, const void *, y
);
1378 return (dv_as_opaque (v
->dv
) == dv_as_opaque (dv
));
1381 static void loc_exp_dep_clear (variable var
);
1383 /* Free the element of VARIABLE_HTAB (its type is struct variable_def). */
1386 variable_htab_free (void *elem
)
1389 variable var
= (variable
) elem
;
1390 location_chain node
, next
;
1392 gcc_checking_assert (var
->refcount
> 0);
1395 if (var
->refcount
> 0)
1398 for (i
= 0; i
< var
->n_var_parts
; i
++)
1400 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= next
)
1403 pool_free (loc_chain_pool
, node
);
1405 var
->var_part
[i
].loc_chain
= NULL
;
1407 if (var
->onepart
&& VAR_LOC_1PAUX (var
))
1409 loc_exp_dep_clear (var
);
1410 if (VAR_LOC_DEP_LST (var
))
1411 VAR_LOC_DEP_LST (var
)->pprev
= NULL
;
1412 XDELETE (VAR_LOC_1PAUX (var
));
1413 /* These may be reused across functions, so reset
1415 if (var
->onepart
== ONEPART_DEXPR
)
1416 set_dv_changed (var
->dv
, true);
1418 pool_free (onepart_pool (var
->onepart
), var
);
1421 /* Initialize the set (array) SET of attrs to empty lists. */
1424 init_attrs_list_set (attrs
*set
)
1428 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
1432 /* Make the list *LISTP empty. */
1435 attrs_list_clear (attrs
*listp
)
1439 for (list
= *listp
; list
; list
= next
)
1442 pool_free (attrs_pool
, list
);
1447 /* Return true if the pair of DECL and OFFSET is the member of the LIST. */
1450 attrs_list_member (attrs list
, decl_or_value dv
, HOST_WIDE_INT offset
)
1452 for (; list
; list
= list
->next
)
1453 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
) && list
->offset
== offset
)
1458 /* Insert the triplet DECL, OFFSET, LOC to the list *LISTP. */
1461 attrs_list_insert (attrs
*listp
, decl_or_value dv
,
1462 HOST_WIDE_INT offset
, rtx loc
)
1466 list
= (attrs
) pool_alloc (attrs_pool
);
1469 list
->offset
= offset
;
1470 list
->next
= *listp
;
1474 /* Copy all nodes from SRC and create a list *DSTP of the copies. */
1477 attrs_list_copy (attrs
*dstp
, attrs src
)
1481 attrs_list_clear (dstp
);
1482 for (; src
; src
= src
->next
)
1484 n
= (attrs
) pool_alloc (attrs_pool
);
1487 n
->offset
= src
->offset
;
1493 /* Add all nodes from SRC which are not in *DSTP to *DSTP. */
1496 attrs_list_union (attrs
*dstp
, attrs src
)
1498 for (; src
; src
= src
->next
)
1500 if (!attrs_list_member (*dstp
, src
->dv
, src
->offset
))
1501 attrs_list_insert (dstp
, src
->dv
, src
->offset
, src
->loc
);
1505 /* Combine nodes that are not onepart nodes from SRC and SRC2 into
1509 attrs_list_mpdv_union (attrs
*dstp
, attrs src
, attrs src2
)
1511 gcc_assert (!*dstp
);
1512 for (; src
; src
= src
->next
)
1514 if (!dv_onepart_p (src
->dv
))
1515 attrs_list_insert (dstp
, src
->dv
, src
->offset
, src
->loc
);
1517 for (src
= src2
; src
; src
= src
->next
)
1519 if (!dv_onepart_p (src
->dv
)
1520 && !attrs_list_member (*dstp
, src
->dv
, src
->offset
))
1521 attrs_list_insert (dstp
, src
->dv
, src
->offset
, src
->loc
);
1525 /* Shared hashtable support. */
1527 /* Return true if VARS is shared. */
1530 shared_hash_shared (shared_hash vars
)
1532 return vars
->refcount
> 1;
1535 /* Return the hash table for VARS. */
1537 static inline htab_t
1538 shared_hash_htab (shared_hash vars
)
1543 /* Return true if VAR is shared, or maybe because VARS is shared. */
1546 shared_var_p (variable var
, shared_hash vars
)
1548 /* Don't count an entry in the changed_variables table as a duplicate. */
1549 return ((var
->refcount
> 1 + (int) var
->in_changed_variables
)
1550 || shared_hash_shared (vars
));
1553 /* Copy variables into a new hash table. */
1556 shared_hash_unshare (shared_hash vars
)
1558 shared_hash new_vars
= (shared_hash
) pool_alloc (shared_hash_pool
);
1559 gcc_assert (vars
->refcount
> 1);
1560 new_vars
->refcount
= 1;
1562 = htab_create (htab_elements (vars
->htab
) + 3, variable_htab_hash
,
1563 variable_htab_eq
, variable_htab_free
);
1564 vars_copy (new_vars
->htab
, vars
->htab
);
1569 /* Increment reference counter on VARS and return it. */
1571 static inline shared_hash
1572 shared_hash_copy (shared_hash vars
)
1578 /* Decrement reference counter and destroy hash table if not shared
1582 shared_hash_destroy (shared_hash vars
)
1584 gcc_checking_assert (vars
->refcount
> 0);
1585 if (--vars
->refcount
== 0)
1587 htab_delete (vars
->htab
);
1588 pool_free (shared_hash_pool
, vars
);
1592 /* Unshare *PVARS if shared and return slot for DV. If INS is
1593 INSERT, insert it if not already present. */
1595 static inline void **
1596 shared_hash_find_slot_unshare_1 (shared_hash
*pvars
, decl_or_value dv
,
1597 hashval_t dvhash
, enum insert_option ins
)
1599 if (shared_hash_shared (*pvars
))
1600 *pvars
= shared_hash_unshare (*pvars
);
1601 return htab_find_slot_with_hash (shared_hash_htab (*pvars
), dv
, dvhash
, ins
);
1604 static inline void **
1605 shared_hash_find_slot_unshare (shared_hash
*pvars
, decl_or_value dv
,
1606 enum insert_option ins
)
1608 return shared_hash_find_slot_unshare_1 (pvars
, dv
, dv_htab_hash (dv
), ins
);
1611 /* Return slot for DV, if it is already present in the hash table.
1612 If it is not present, insert it only VARS is not shared, otherwise
1615 static inline void **
1616 shared_hash_find_slot_1 (shared_hash vars
, decl_or_value dv
, hashval_t dvhash
)
1618 return htab_find_slot_with_hash (shared_hash_htab (vars
), dv
, dvhash
,
1619 shared_hash_shared (vars
)
1620 ? NO_INSERT
: INSERT
);
1623 static inline void **
1624 shared_hash_find_slot (shared_hash vars
, decl_or_value dv
)
1626 return shared_hash_find_slot_1 (vars
, dv
, dv_htab_hash (dv
));
1629 /* Return slot for DV only if it is already present in the hash table. */
1631 static inline void **
1632 shared_hash_find_slot_noinsert_1 (shared_hash vars
, decl_or_value dv
,
1635 return htab_find_slot_with_hash (shared_hash_htab (vars
), dv
, dvhash
,
1639 static inline void **
1640 shared_hash_find_slot_noinsert (shared_hash vars
, decl_or_value dv
)
1642 return shared_hash_find_slot_noinsert_1 (vars
, dv
, dv_htab_hash (dv
));
1645 /* Return variable for DV or NULL if not already present in the hash
1648 static inline variable
1649 shared_hash_find_1 (shared_hash vars
, decl_or_value dv
, hashval_t dvhash
)
1651 return (variable
) htab_find_with_hash (shared_hash_htab (vars
), dv
, dvhash
);
1654 static inline variable
1655 shared_hash_find (shared_hash vars
, decl_or_value dv
)
1657 return shared_hash_find_1 (vars
, dv
, dv_htab_hash (dv
));
1660 /* Return true if TVAL is better than CVAL as a canonival value. We
1661 choose lowest-numbered VALUEs, using the RTX address as a
1662 tie-breaker. The idea is to arrange them into a star topology,
1663 such that all of them are at most one step away from the canonical
1664 value, and the canonical value has backlinks to all of them, in
1665 addition to all the actual locations. We don't enforce this
1666 topology throughout the entire dataflow analysis, though.
1670 canon_value_cmp (rtx tval
, rtx cval
)
1673 || CSELIB_VAL_PTR (tval
)->uid
< CSELIB_VAL_PTR (cval
)->uid
;
1676 static bool dst_can_be_shared
;
1678 /* Return a copy of a variable VAR and insert it to dataflow set SET. */
1681 unshare_variable (dataflow_set
*set
, void **slot
, variable var
,
1682 enum var_init_status initialized
)
1687 new_var
= (variable
) pool_alloc (onepart_pool (var
->onepart
));
1688 new_var
->dv
= var
->dv
;
1689 new_var
->refcount
= 1;
1691 new_var
->n_var_parts
= var
->n_var_parts
;
1692 new_var
->onepart
= var
->onepart
;
1693 new_var
->in_changed_variables
= false;
1695 if (! flag_var_tracking_uninit
)
1696 initialized
= VAR_INIT_STATUS_INITIALIZED
;
1698 for (i
= 0; i
< var
->n_var_parts
; i
++)
1700 location_chain node
;
1701 location_chain
*nextp
;
1703 if (i
== 0 && var
->onepart
)
1705 /* One-part auxiliary data is only used while emitting
1706 notes, so propagate it to the new variable in the active
1707 dataflow set. If we're not emitting notes, this will be
1709 gcc_checking_assert (!VAR_LOC_1PAUX (var
) || emit_notes
);
1710 VAR_LOC_1PAUX (new_var
) = VAR_LOC_1PAUX (var
);
1711 VAR_LOC_1PAUX (var
) = NULL
;
1714 VAR_PART_OFFSET (new_var
, i
) = VAR_PART_OFFSET (var
, i
);
1715 nextp
= &new_var
->var_part
[i
].loc_chain
;
1716 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
1718 location_chain new_lc
;
1720 new_lc
= (location_chain
) pool_alloc (loc_chain_pool
);
1721 new_lc
->next
= NULL
;
1722 if (node
->init
> initialized
)
1723 new_lc
->init
= node
->init
;
1725 new_lc
->init
= initialized
;
1726 if (node
->set_src
&& !(MEM_P (node
->set_src
)))
1727 new_lc
->set_src
= node
->set_src
;
1729 new_lc
->set_src
= NULL
;
1730 new_lc
->loc
= node
->loc
;
1733 nextp
= &new_lc
->next
;
1736 new_var
->var_part
[i
].cur_loc
= var
->var_part
[i
].cur_loc
;
1739 dst_can_be_shared
= false;
1740 if (shared_hash_shared (set
->vars
))
1741 slot
= shared_hash_find_slot_unshare (&set
->vars
, var
->dv
, NO_INSERT
);
1742 else if (set
->traversed_vars
&& set
->vars
!= set
->traversed_vars
)
1743 slot
= shared_hash_find_slot_noinsert (set
->vars
, var
->dv
);
1745 if (var
->in_changed_variables
)
1748 = htab_find_slot_with_hash (changed_variables
, var
->dv
,
1749 dv_htab_hash (var
->dv
), NO_INSERT
);
1750 gcc_assert (*cslot
== (void *) var
);
1751 var
->in_changed_variables
= false;
1752 variable_htab_free (var
);
1754 new_var
->in_changed_variables
= true;
1759 /* Copy all variables from hash table SRC to hash table DST. */
1762 vars_copy (htab_t dst
, htab_t src
)
1767 FOR_EACH_HTAB_ELEMENT (src
, var
, variable
, hi
)
1771 dstp
= htab_find_slot_with_hash (dst
, var
->dv
,
1772 dv_htab_hash (var
->dv
),
1778 /* Map a decl to its main debug decl. */
1781 var_debug_decl (tree decl
)
1783 if (decl
&& DECL_P (decl
)
1784 && DECL_DEBUG_EXPR_IS_FROM (decl
))
1786 tree debugdecl
= DECL_DEBUG_EXPR (decl
);
1787 if (debugdecl
&& DECL_P (debugdecl
))
1794 /* Set the register LOC to contain DV, OFFSET. */
1797 var_reg_decl_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
1798 decl_or_value dv
, HOST_WIDE_INT offset
, rtx set_src
,
1799 enum insert_option iopt
)
1802 bool decl_p
= dv_is_decl_p (dv
);
1805 dv
= dv_from_decl (var_debug_decl (dv_as_decl (dv
)));
1807 for (node
= set
->regs
[REGNO (loc
)]; node
; node
= node
->next
)
1808 if (dv_as_opaque (node
->dv
) == dv_as_opaque (dv
)
1809 && node
->offset
== offset
)
1812 attrs_list_insert (&set
->regs
[REGNO (loc
)], dv
, offset
, loc
);
1813 set_variable_part (set
, loc
, dv
, offset
, initialized
, set_src
, iopt
);
1816 /* Set the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). */
1819 var_reg_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
1822 tree decl
= REG_EXPR (loc
);
1823 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
1825 var_reg_decl_set (set
, loc
, initialized
,
1826 dv_from_decl (decl
), offset
, set_src
, INSERT
);
1829 static enum var_init_status
1830 get_init_value (dataflow_set
*set
, rtx loc
, decl_or_value dv
)
1834 enum var_init_status ret_val
= VAR_INIT_STATUS_UNKNOWN
;
1836 if (! flag_var_tracking_uninit
)
1837 return VAR_INIT_STATUS_INITIALIZED
;
1839 var
= shared_hash_find (set
->vars
, dv
);
1842 for (i
= 0; i
< var
->n_var_parts
&& ret_val
== VAR_INIT_STATUS_UNKNOWN
; i
++)
1844 location_chain nextp
;
1845 for (nextp
= var
->var_part
[i
].loc_chain
; nextp
; nextp
= nextp
->next
)
1846 if (rtx_equal_p (nextp
->loc
, loc
))
1848 ret_val
= nextp
->init
;
1857 /* Delete current content of register LOC in dataflow set SET and set
1858 the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). If
1859 MODIFY is true, any other live copies of the same variable part are
1860 also deleted from the dataflow set, otherwise the variable part is
1861 assumed to be copied from another location holding the same
1865 var_reg_delete_and_set (dataflow_set
*set
, rtx loc
, bool modify
,
1866 enum var_init_status initialized
, rtx set_src
)
1868 tree decl
= REG_EXPR (loc
);
1869 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
1873 decl
= var_debug_decl (decl
);
1875 if (initialized
== VAR_INIT_STATUS_UNKNOWN
)
1876 initialized
= get_init_value (set
, loc
, dv_from_decl (decl
));
1878 nextp
= &set
->regs
[REGNO (loc
)];
1879 for (node
= *nextp
; node
; node
= next
)
1882 if (dv_as_opaque (node
->dv
) != decl
|| node
->offset
!= offset
)
1884 delete_variable_part (set
, node
->loc
, node
->dv
, node
->offset
);
1885 pool_free (attrs_pool
, node
);
1891 nextp
= &node
->next
;
1895 clobber_variable_part (set
, loc
, dv_from_decl (decl
), offset
, set_src
);
1896 var_reg_set (set
, loc
, initialized
, set_src
);
1899 /* Delete the association of register LOC in dataflow set SET with any
1900 variables that aren't onepart. If CLOBBER is true, also delete any
1901 other live copies of the same variable part, and delete the
1902 association with onepart dvs too. */
1905 var_reg_delete (dataflow_set
*set
, rtx loc
, bool clobber
)
1907 attrs
*nextp
= &set
->regs
[REGNO (loc
)];
1912 tree decl
= REG_EXPR (loc
);
1913 HOST_WIDE_INT offset
= REG_OFFSET (loc
);
1915 decl
= var_debug_decl (decl
);
1917 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, NULL
);
1920 for (node
= *nextp
; node
; node
= next
)
1923 if (clobber
|| !dv_onepart_p (node
->dv
))
1925 delete_variable_part (set
, node
->loc
, node
->dv
, node
->offset
);
1926 pool_free (attrs_pool
, node
);
1930 nextp
= &node
->next
;
1934 /* Delete content of register with number REGNO in dataflow set SET. */
1937 var_regno_delete (dataflow_set
*set
, int regno
)
1939 attrs
*reg
= &set
->regs
[regno
];
1942 for (node
= *reg
; node
; node
= next
)
1945 delete_variable_part (set
, node
->loc
, node
->dv
, node
->offset
);
1946 pool_free (attrs_pool
, node
);
1951 /* Return true if I is the negated value of a power of two. */
1953 negative_power_of_two_p (HOST_WIDE_INT i
)
1955 unsigned HOST_WIDE_INT x
= -(unsigned HOST_WIDE_INT
)i
;
1956 return x
== (x
& -x
);
1959 /* Strip constant offsets and alignments off of LOC. Return the base
1963 vt_get_canonicalize_base (rtx loc
)
1965 while ((GET_CODE (loc
) == PLUS
1966 || GET_CODE (loc
) == AND
)
1967 && GET_CODE (XEXP (loc
, 1)) == CONST_INT
1968 && (GET_CODE (loc
) != AND
1969 || negative_power_of_two_p (INTVAL (XEXP (loc
, 1)))))
1970 loc
= XEXP (loc
, 0);
1975 /* This caches canonicalized addresses for VALUEs, computed using
1976 information in the global cselib table. */
1977 static struct pointer_map_t
*global_get_addr_cache
;
1979 /* This caches canonicalized addresses for VALUEs, computed using
1980 information from the global cache and information pertaining to a
1981 basic block being analyzed. */
1982 static struct pointer_map_t
*local_get_addr_cache
;
1984 static rtx
vt_canonicalize_addr (dataflow_set
*, rtx
);
1986 /* Return the canonical address for LOC, that must be a VALUE, using a
1987 cached global equivalence or computing it and storing it in the
1991 get_addr_from_global_cache (rtx
const loc
)
1996 gcc_checking_assert (GET_CODE (loc
) == VALUE
);
1998 slot
= pointer_map_insert (global_get_addr_cache
, loc
);
2002 x
= canon_rtx (get_addr (loc
));
2004 /* Tentative, avoiding infinite recursion. */
2009 rtx nx
= vt_canonicalize_addr (NULL
, x
);
2012 /* The table may have moved during recursion, recompute
2014 slot
= pointer_map_contains (global_get_addr_cache
, loc
);
2022 /* Return the canonical address for LOC, that must be a VALUE, using a
2023 cached local equivalence or computing it and storing it in the
2027 get_addr_from_local_cache (dataflow_set
*set
, rtx
const loc
)
2035 gcc_checking_assert (GET_CODE (loc
) == VALUE
);
2037 slot
= pointer_map_insert (local_get_addr_cache
, loc
);
2041 x
= get_addr_from_global_cache (loc
);
2043 /* Tentative, avoiding infinite recursion. */
2046 /* Recurse to cache local expansion of X, or if we need to search
2047 for a VALUE in the expansion. */
2050 rtx nx
= vt_canonicalize_addr (set
, x
);
2053 slot
= pointer_map_contains (local_get_addr_cache
, loc
);
2059 dv
= dv_from_rtx (x
);
2060 var
= (variable
) htab_find_with_hash (shared_hash_htab (set
->vars
),
2061 dv
, dv_htab_hash (dv
));
2065 /* Look for an improved equivalent expression. */
2066 for (l
= var
->var_part
[0].loc_chain
; l
; l
= l
->next
)
2068 rtx base
= vt_get_canonicalize_base (l
->loc
);
2069 if (GET_CODE (base
) == VALUE
2070 && canon_value_cmp (base
, loc
))
2072 rtx nx
= vt_canonicalize_addr (set
, l
->loc
);
2075 slot
= pointer_map_contains (local_get_addr_cache
, loc
);
2085 /* Canonicalize LOC using equivalences from SET in addition to those
2086 in the cselib static table. It expects a VALUE-based expression,
2087 and it will only substitute VALUEs with other VALUEs or
2088 function-global equivalences, so that, if two addresses have base
2089 VALUEs that are locally or globally related in ways that
2090 memrefs_conflict_p cares about, they will both canonicalize to
2091 expressions that have the same base VALUE.
2093 The use of VALUEs as canonical base addresses enables the canonical
2094 RTXs to remain unchanged globally, if they resolve to a constant,
2095 or throughout a basic block otherwise, so that they can be cached
2096 and the cache needs not be invalidated when REGs, MEMs or such
2100 vt_canonicalize_addr (dataflow_set
*set
, rtx oloc
)
2102 HOST_WIDE_INT ofst
= 0;
2103 enum machine_mode mode
= GET_MODE (oloc
);
2110 while (GET_CODE (loc
) == PLUS
2111 && GET_CODE (XEXP (loc
, 1)) == CONST_INT
)
2113 ofst
+= INTVAL (XEXP (loc
, 1));
2114 loc
= XEXP (loc
, 0);
2117 /* Alignment operations can't normally be combined, so just
2118 canonicalize the base and we're done. We'll normally have
2119 only one stack alignment anyway. */
2120 if (GET_CODE (loc
) == AND
2121 && GET_CODE (XEXP (loc
, 1)) == CONST_INT
2122 && negative_power_of_two_p (INTVAL (XEXP (loc
, 1))))
2124 x
= vt_canonicalize_addr (set
, XEXP (loc
, 0));
2125 if (x
!= XEXP (loc
, 0))
2126 loc
= gen_rtx_AND (mode
, x
, XEXP (loc
, 1));
2130 if (GET_CODE (loc
) == VALUE
)
2133 loc
= get_addr_from_local_cache (set
, loc
);
2135 loc
= get_addr_from_global_cache (loc
);
2137 /* Consolidate plus_constants. */
2138 while (ofst
&& GET_CODE (loc
) == PLUS
2139 && GET_CODE (XEXP (loc
, 1)) == CONST_INT
)
2141 ofst
+= INTVAL (XEXP (loc
, 1));
2142 loc
= XEXP (loc
, 0);
2149 x
= canon_rtx (loc
);
2156 /* Add OFST back in. */
2159 /* Don't build new RTL if we can help it. */
2160 if (GET_CODE (oloc
) == PLUS
2161 && XEXP (oloc
, 0) == loc
2162 && INTVAL (XEXP (oloc
, 1)) == ofst
)
2165 loc
= plus_constant (mode
, loc
, ofst
);
2171 /* Return true iff there's a true dependence between MLOC and LOC.
2172 MADDR must be a canonicalized version of MLOC's address. */
2175 vt_canon_true_dep (dataflow_set
*set
, rtx mloc
, rtx maddr
, rtx loc
)
2177 if (GET_CODE (loc
) != MEM
)
2180 rtx addr
= vt_canonicalize_addr (set
, XEXP (loc
, 0));
2181 if (!canon_true_dependence (mloc
, GET_MODE (mloc
), maddr
, loc
, addr
))
2187 /* Hold parameters for the hashtab traversal function
2188 drop_overlapping_mem_locs, see below. */
2190 struct overlapping_mems
2196 /* Remove all MEMs that overlap with COMS->LOC from the location list
2197 of a hash table entry for a value. COMS->ADDR must be a
2198 canonicalized form of COMS->LOC's address, and COMS->LOC must be
2199 canonicalized itself. */
2202 drop_overlapping_mem_locs (void **slot
, void *data
)
2204 struct overlapping_mems
*coms
= (struct overlapping_mems
*)data
;
2205 dataflow_set
*set
= coms
->set
;
2206 rtx mloc
= coms
->loc
, addr
= coms
->addr
;
2207 variable var
= (variable
) *slot
;
2209 if (var
->onepart
== ONEPART_VALUE
)
2211 location_chain loc
, *locp
;
2212 bool changed
= false;
2215 gcc_assert (var
->n_var_parts
== 1);
2217 if (shared_var_p (var
, set
->vars
))
2219 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
2220 if (vt_canon_true_dep (set
, mloc
, addr
, loc
->loc
))
2226 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
2227 var
= (variable
)*slot
;
2228 gcc_assert (var
->n_var_parts
== 1);
2231 if (VAR_LOC_1PAUX (var
))
2232 cur_loc
= VAR_LOC_FROM (var
);
2234 cur_loc
= var
->var_part
[0].cur_loc
;
2236 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
2239 if (!vt_canon_true_dep (set
, mloc
, addr
, loc
->loc
))
2246 /* If we have deleted the location which was last emitted
2247 we have to emit new location so add the variable to set
2248 of changed variables. */
2249 if (cur_loc
== loc
->loc
)
2252 var
->var_part
[0].cur_loc
= NULL
;
2253 if (VAR_LOC_1PAUX (var
))
2254 VAR_LOC_FROM (var
) = NULL
;
2256 pool_free (loc_chain_pool
, loc
);
2259 if (!var
->var_part
[0].loc_chain
)
2265 variable_was_changed (var
, set
);
2271 /* Remove from SET all VALUE bindings to MEMs that overlap with LOC. */
2274 clobber_overlapping_mems (dataflow_set
*set
, rtx loc
)
2276 struct overlapping_mems coms
;
2278 gcc_checking_assert (GET_CODE (loc
) == MEM
);
2281 coms
.loc
= canon_rtx (loc
);
2282 coms
.addr
= vt_canonicalize_addr (set
, XEXP (loc
, 0));
2284 set
->traversed_vars
= set
->vars
;
2285 htab_traverse (shared_hash_htab (set
->vars
),
2286 drop_overlapping_mem_locs
, &coms
);
2287 set
->traversed_vars
= NULL
;
2290 /* Set the location of DV, OFFSET as the MEM LOC. */
2293 var_mem_decl_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
2294 decl_or_value dv
, HOST_WIDE_INT offset
, rtx set_src
,
2295 enum insert_option iopt
)
2297 if (dv_is_decl_p (dv
))
2298 dv
= dv_from_decl (var_debug_decl (dv_as_decl (dv
)));
2300 set_variable_part (set
, loc
, dv
, offset
, initialized
, set_src
, iopt
);
2303 /* Set the location part of variable MEM_EXPR (LOC) in dataflow set
2305 Adjust the address first if it is stack pointer based. */
2308 var_mem_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
2311 tree decl
= MEM_EXPR (loc
);
2312 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
2314 var_mem_decl_set (set
, loc
, initialized
,
2315 dv_from_decl (decl
), offset
, set_src
, INSERT
);
2318 /* Delete and set the location part of variable MEM_EXPR (LOC) in
2319 dataflow set SET to LOC. If MODIFY is true, any other live copies
2320 of the same variable part are also deleted from the dataflow set,
2321 otherwise the variable part is assumed to be copied from another
2322 location holding the same part.
2323 Adjust the address first if it is stack pointer based. */
2326 var_mem_delete_and_set (dataflow_set
*set
, rtx loc
, bool modify
,
2327 enum var_init_status initialized
, rtx set_src
)
2329 tree decl
= MEM_EXPR (loc
);
2330 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
2332 clobber_overlapping_mems (set
, loc
);
2333 decl
= var_debug_decl (decl
);
2335 if (initialized
== VAR_INIT_STATUS_UNKNOWN
)
2336 initialized
= get_init_value (set
, loc
, dv_from_decl (decl
));
2339 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, set_src
);
2340 var_mem_set (set
, loc
, initialized
, set_src
);
2343 /* Delete the location part LOC from dataflow set SET. If CLOBBER is
2344 true, also delete any other live copies of the same variable part.
2345 Adjust the address first if it is stack pointer based. */
2348 var_mem_delete (dataflow_set
*set
, rtx loc
, bool clobber
)
2350 tree decl
= MEM_EXPR (loc
);
2351 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
2353 clobber_overlapping_mems (set
, loc
);
2354 decl
= var_debug_decl (decl
);
2356 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, NULL
);
2357 delete_variable_part (set
, loc
, dv_from_decl (decl
), offset
);
2360 /* Return true if LOC should not be expanded for location expressions,
2364 unsuitable_loc (rtx loc
)
2366 switch (GET_CODE (loc
))
2380 /* Bind VAL to LOC in SET. If MODIFIED, detach LOC from any values
2384 val_bind (dataflow_set
*set
, rtx val
, rtx loc
, bool modified
)
2389 var_regno_delete (set
, REGNO (loc
));
2390 var_reg_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
2391 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
2393 else if (MEM_P (loc
))
2395 struct elt_loc_list
*l
= CSELIB_VAL_PTR (val
)->locs
;
2398 clobber_overlapping_mems (set
, loc
);
2400 if (l
&& GET_CODE (l
->loc
) == VALUE
)
2401 l
= canonical_cselib_val (CSELIB_VAL_PTR (l
->loc
))->locs
;
2403 /* If this MEM is a global constant, we don't need it in the
2404 dynamic tables. ??? We should test this before emitting the
2405 micro-op in the first place. */
2407 if (GET_CODE (l
->loc
) == MEM
&& XEXP (l
->loc
, 0) == XEXP (loc
, 0))
2413 var_mem_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
2414 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
2418 /* Other kinds of equivalences are necessarily static, at least
2419 so long as we do not perform substitutions while merging
2422 set_variable_part (set
, loc
, dv_from_value (val
), 0,
2423 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2427 /* Bind a value to a location it was just stored in. If MODIFIED
2428 holds, assume the location was modified, detaching it from any
2429 values bound to it. */
2432 val_store (dataflow_set
*set
, rtx val
, rtx loc
, rtx insn
, bool modified
)
2434 cselib_val
*v
= CSELIB_VAL_PTR (val
);
2436 gcc_assert (cselib_preserved_value_p (v
));
2440 fprintf (dump_file
, "%i: ", insn
? INSN_UID (insn
) : 0);
2441 print_inline_rtx (dump_file
, loc
, 0);
2442 fprintf (dump_file
, " evaluates to ");
2443 print_inline_rtx (dump_file
, val
, 0);
2446 struct elt_loc_list
*l
;
2447 for (l
= v
->locs
; l
; l
= l
->next
)
2449 fprintf (dump_file
, "\n%i: ", INSN_UID (l
->setting_insn
));
2450 print_inline_rtx (dump_file
, l
->loc
, 0);
2453 fprintf (dump_file
, "\n");
2456 gcc_checking_assert (!unsuitable_loc (loc
));
2458 val_bind (set
, val
, loc
, modified
);
2461 /* Clear (canonical address) slots that reference X. */
2464 local_get_addr_clear_given_value (const void *v ATTRIBUTE_UNUSED
,
2465 void **slot
, void *x
)
2467 if (vt_get_canonicalize_base ((rtx
)*slot
) == x
)
2472 /* Reset this node, detaching all its equivalences. Return the slot
2473 in the variable hash table that holds dv, if there is one. */
2476 val_reset (dataflow_set
*set
, decl_or_value dv
)
2478 variable var
= shared_hash_find (set
->vars
, dv
) ;
2479 location_chain node
;
2482 if (!var
|| !var
->n_var_parts
)
2485 gcc_assert (var
->n_var_parts
== 1);
2487 if (var
->onepart
== ONEPART_VALUE
)
2489 rtx x
= dv_as_value (dv
);
2492 /* Relationships in the global cache don't change, so reset the
2493 local cache entry only. */
2494 slot
= pointer_map_contains (local_get_addr_cache
, x
);
2497 /* If the value resolved back to itself, odds are that other
2498 values may have cached it too. These entries now refer
2499 to the old X, so detach them too. Entries that used the
2500 old X but resolved to something else remain ok as long as
2501 that something else isn't also reset. */
2503 pointer_map_traverse (local_get_addr_cache
,
2504 local_get_addr_clear_given_value
, x
);
2510 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
2511 if (GET_CODE (node
->loc
) == VALUE
2512 && canon_value_cmp (node
->loc
, cval
))
2515 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
2516 if (GET_CODE (node
->loc
) == VALUE
&& cval
!= node
->loc
)
2518 /* Redirect the equivalence link to the new canonical
2519 value, or simply remove it if it would point at
2522 set_variable_part (set
, cval
, dv_from_value (node
->loc
),
2523 0, node
->init
, node
->set_src
, NO_INSERT
);
2524 delete_variable_part (set
, dv_as_value (dv
),
2525 dv_from_value (node
->loc
), 0);
2530 decl_or_value cdv
= dv_from_value (cval
);
2532 /* Keep the remaining values connected, accummulating links
2533 in the canonical value. */
2534 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
2536 if (node
->loc
== cval
)
2538 else if (GET_CODE (node
->loc
) == REG
)
2539 var_reg_decl_set (set
, node
->loc
, node
->init
, cdv
, 0,
2540 node
->set_src
, NO_INSERT
);
2541 else if (GET_CODE (node
->loc
) == MEM
)
2542 var_mem_decl_set (set
, node
->loc
, node
->init
, cdv
, 0,
2543 node
->set_src
, NO_INSERT
);
2545 set_variable_part (set
, node
->loc
, cdv
, 0,
2546 node
->init
, node
->set_src
, NO_INSERT
);
2550 /* We remove this last, to make sure that the canonical value is not
2551 removed to the point of requiring reinsertion. */
2553 delete_variable_part (set
, dv_as_value (dv
), dv_from_value (cval
), 0);
2555 clobber_variable_part (set
, NULL
, dv
, 0, NULL
);
2558 /* Find the values in a given location and map the val to another
2559 value, if it is unique, or add the location as one holding the
2563 val_resolve (dataflow_set
*set
, rtx val
, rtx loc
, rtx insn
)
2565 decl_or_value dv
= dv_from_value (val
);
2567 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2570 fprintf (dump_file
, "%i: ", INSN_UID (insn
));
2572 fprintf (dump_file
, "head: ");
2573 print_inline_rtx (dump_file
, val
, 0);
2574 fputs (" is at ", dump_file
);
2575 print_inline_rtx (dump_file
, loc
, 0);
2576 fputc ('\n', dump_file
);
2579 val_reset (set
, dv
);
2581 gcc_checking_assert (!unsuitable_loc (loc
));
2585 attrs node
, found
= NULL
;
2587 for (node
= set
->regs
[REGNO (loc
)]; node
; node
= node
->next
)
2588 if (dv_is_value_p (node
->dv
)
2589 && GET_MODE (dv_as_value (node
->dv
)) == GET_MODE (loc
))
2593 /* Map incoming equivalences. ??? Wouldn't it be nice if
2594 we just started sharing the location lists? Maybe a
2595 circular list ending at the value itself or some
2597 set_variable_part (set
, dv_as_value (node
->dv
),
2598 dv_from_value (val
), node
->offset
,
2599 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2600 set_variable_part (set
, val
, node
->dv
, node
->offset
,
2601 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2604 /* If we didn't find any equivalence, we need to remember that
2605 this value is held in the named register. */
2609 /* ??? Attempt to find and merge equivalent MEMs or other
2612 val_bind (set
, val
, loc
, false);
2615 /* Initialize dataflow set SET to be empty.
2616 VARS_SIZE is the initial size of hash table VARS. */
2619 dataflow_set_init (dataflow_set
*set
)
2621 init_attrs_list_set (set
->regs
);
2622 set
->vars
= shared_hash_copy (empty_shared_hash
);
2623 set
->stack_adjust
= 0;
2624 set
->traversed_vars
= NULL
;
2627 /* Delete the contents of dataflow set SET. */
2630 dataflow_set_clear (dataflow_set
*set
)
2634 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2635 attrs_list_clear (&set
->regs
[i
]);
2637 shared_hash_destroy (set
->vars
);
2638 set
->vars
= shared_hash_copy (empty_shared_hash
);
2641 /* Copy the contents of dataflow set SRC to DST. */
2644 dataflow_set_copy (dataflow_set
*dst
, dataflow_set
*src
)
2648 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2649 attrs_list_copy (&dst
->regs
[i
], src
->regs
[i
]);
2651 shared_hash_destroy (dst
->vars
);
2652 dst
->vars
= shared_hash_copy (src
->vars
);
2653 dst
->stack_adjust
= src
->stack_adjust
;
2656 /* Information for merging lists of locations for a given offset of variable.
2658 struct variable_union_info
2660 /* Node of the location chain. */
2663 /* The sum of positions in the input chains. */
2666 /* The position in the chain of DST dataflow set. */
2670 /* Buffer for location list sorting and its allocated size. */
2671 static struct variable_union_info
*vui_vec
;
2672 static int vui_allocated
;
2674 /* Compare function for qsort, order the structures by POS element. */
2677 variable_union_info_cmp_pos (const void *n1
, const void *n2
)
2679 const struct variable_union_info
*const i1
=
2680 (const struct variable_union_info
*) n1
;
2681 const struct variable_union_info
*const i2
=
2682 ( const struct variable_union_info
*) n2
;
2684 if (i1
->pos
!= i2
->pos
)
2685 return i1
->pos
- i2
->pos
;
2687 return (i1
->pos_dst
- i2
->pos_dst
);
2690 /* Compute union of location parts of variable *SLOT and the same variable
2691 from hash table DATA. Compute "sorted" union of the location chains
2692 for common offsets, i.e. the locations of a variable part are sorted by
2693 a priority where the priority is the sum of the positions in the 2 chains
2694 (if a location is only in one list the position in the second list is
2695 defined to be larger than the length of the chains).
2696 When we are updating the location parts the newest location is in the
2697 beginning of the chain, so when we do the described "sorted" union
2698 we keep the newest locations in the beginning. */
2701 variable_union (variable src
, dataflow_set
*set
)
2707 dstp
= shared_hash_find_slot (set
->vars
, src
->dv
);
2708 if (!dstp
|| !*dstp
)
2712 dst_can_be_shared
= false;
2714 dstp
= shared_hash_find_slot_unshare (&set
->vars
, src
->dv
, INSERT
);
2718 /* Continue traversing the hash table. */
2722 dst
= (variable
) *dstp
;
2724 gcc_assert (src
->n_var_parts
);
2725 gcc_checking_assert (src
->onepart
== dst
->onepart
);
2727 /* We can combine one-part variables very efficiently, because their
2728 entries are in canonical order. */
2731 location_chain
*nodep
, dnode
, snode
;
2733 gcc_assert (src
->n_var_parts
== 1
2734 && dst
->n_var_parts
== 1);
2736 snode
= src
->var_part
[0].loc_chain
;
2739 restart_onepart_unshared
:
2740 nodep
= &dst
->var_part
[0].loc_chain
;
2746 int r
= dnode
? loc_cmp (dnode
->loc
, snode
->loc
) : 1;
2750 location_chain nnode
;
2752 if (shared_var_p (dst
, set
->vars
))
2754 dstp
= unshare_variable (set
, dstp
, dst
,
2755 VAR_INIT_STATUS_INITIALIZED
);
2756 dst
= (variable
)*dstp
;
2757 goto restart_onepart_unshared
;
2760 *nodep
= nnode
= (location_chain
) pool_alloc (loc_chain_pool
);
2761 nnode
->loc
= snode
->loc
;
2762 nnode
->init
= snode
->init
;
2763 if (!snode
->set_src
|| MEM_P (snode
->set_src
))
2764 nnode
->set_src
= NULL
;
2766 nnode
->set_src
= snode
->set_src
;
2767 nnode
->next
= dnode
;
2771 gcc_checking_assert (rtx_equal_p (dnode
->loc
, snode
->loc
));
2774 snode
= snode
->next
;
2776 nodep
= &dnode
->next
;
2783 gcc_checking_assert (!src
->onepart
);
2785 /* Count the number of location parts, result is K. */
2786 for (i
= 0, j
= 0, k
= 0;
2787 i
< src
->n_var_parts
&& j
< dst
->n_var_parts
; k
++)
2789 if (VAR_PART_OFFSET (src
, i
) == VAR_PART_OFFSET (dst
, j
))
2794 else if (VAR_PART_OFFSET (src
, i
) < VAR_PART_OFFSET (dst
, j
))
2799 k
+= src
->n_var_parts
- i
;
2800 k
+= dst
->n_var_parts
- j
;
2802 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
2803 thus there are at most MAX_VAR_PARTS different offsets. */
2804 gcc_checking_assert (dst
->onepart
? k
== 1 : k
<= MAX_VAR_PARTS
);
2806 if (dst
->n_var_parts
!= k
&& shared_var_p (dst
, set
->vars
))
2808 dstp
= unshare_variable (set
, dstp
, dst
, VAR_INIT_STATUS_UNKNOWN
);
2809 dst
= (variable
)*dstp
;
2812 i
= src
->n_var_parts
- 1;
2813 j
= dst
->n_var_parts
- 1;
2814 dst
->n_var_parts
= k
;
2816 for (k
--; k
>= 0; k
--)
2818 location_chain node
, node2
;
2820 if (i
>= 0 && j
>= 0
2821 && VAR_PART_OFFSET (src
, i
) == VAR_PART_OFFSET (dst
, j
))
2823 /* Compute the "sorted" union of the chains, i.e. the locations which
2824 are in both chains go first, they are sorted by the sum of
2825 positions in the chains. */
2828 struct variable_union_info
*vui
;
2830 /* If DST is shared compare the location chains.
2831 If they are different we will modify the chain in DST with
2832 high probability so make a copy of DST. */
2833 if (shared_var_p (dst
, set
->vars
))
2835 for (node
= src
->var_part
[i
].loc_chain
,
2836 node2
= dst
->var_part
[j
].loc_chain
; node
&& node2
;
2837 node
= node
->next
, node2
= node2
->next
)
2839 if (!((REG_P (node2
->loc
)
2840 && REG_P (node
->loc
)
2841 && REGNO (node2
->loc
) == REGNO (node
->loc
))
2842 || rtx_equal_p (node2
->loc
, node
->loc
)))
2844 if (node2
->init
< node
->init
)
2845 node2
->init
= node
->init
;
2851 dstp
= unshare_variable (set
, dstp
, dst
,
2852 VAR_INIT_STATUS_UNKNOWN
);
2853 dst
= (variable
)*dstp
;
2858 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2861 for (node
= dst
->var_part
[j
].loc_chain
; node
; node
= node
->next
)
2866 /* The most common case, much simpler, no qsort is needed. */
2867 location_chain dstnode
= dst
->var_part
[j
].loc_chain
;
2868 dst
->var_part
[k
].loc_chain
= dstnode
;
2869 VAR_PART_OFFSET (dst
, k
) = VAR_PART_OFFSET(dst
, j
);
2871 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2872 if (!((REG_P (dstnode
->loc
)
2873 && REG_P (node
->loc
)
2874 && REGNO (dstnode
->loc
) == REGNO (node
->loc
))
2875 || rtx_equal_p (dstnode
->loc
, node
->loc
)))
2877 location_chain new_node
;
2879 /* Copy the location from SRC. */
2880 new_node
= (location_chain
) pool_alloc (loc_chain_pool
);
2881 new_node
->loc
= node
->loc
;
2882 new_node
->init
= node
->init
;
2883 if (!node
->set_src
|| MEM_P (node
->set_src
))
2884 new_node
->set_src
= NULL
;
2886 new_node
->set_src
= node
->set_src
;
2887 node2
->next
= new_node
;
2894 if (src_l
+ dst_l
> vui_allocated
)
2896 vui_allocated
= MAX (vui_allocated
* 2, src_l
+ dst_l
);
2897 vui_vec
= XRESIZEVEC (struct variable_union_info
, vui_vec
,
2902 /* Fill in the locations from DST. */
2903 for (node
= dst
->var_part
[j
].loc_chain
, jj
= 0; node
;
2904 node
= node
->next
, jj
++)
2907 vui
[jj
].pos_dst
= jj
;
2909 /* Pos plus value larger than a sum of 2 valid positions. */
2910 vui
[jj
].pos
= jj
+ src_l
+ dst_l
;
2913 /* Fill in the locations from SRC. */
2915 for (node
= src
->var_part
[i
].loc_chain
, ii
= 0; node
;
2916 node
= node
->next
, ii
++)
2918 /* Find location from NODE. */
2919 for (jj
= 0; jj
< dst_l
; jj
++)
2921 if ((REG_P (vui
[jj
].lc
->loc
)
2922 && REG_P (node
->loc
)
2923 && REGNO (vui
[jj
].lc
->loc
) == REGNO (node
->loc
))
2924 || rtx_equal_p (vui
[jj
].lc
->loc
, node
->loc
))
2926 vui
[jj
].pos
= jj
+ ii
;
2930 if (jj
>= dst_l
) /* The location has not been found. */
2932 location_chain new_node
;
2934 /* Copy the location from SRC. */
2935 new_node
= (location_chain
) pool_alloc (loc_chain_pool
);
2936 new_node
->loc
= node
->loc
;
2937 new_node
->init
= node
->init
;
2938 if (!node
->set_src
|| MEM_P (node
->set_src
))
2939 new_node
->set_src
= NULL
;
2941 new_node
->set_src
= node
->set_src
;
2942 vui
[n
].lc
= new_node
;
2943 vui
[n
].pos_dst
= src_l
+ dst_l
;
2944 vui
[n
].pos
= ii
+ src_l
+ dst_l
;
2951 /* Special case still very common case. For dst_l == 2
2952 all entries dst_l ... n-1 are sorted, with for i >= dst_l
2953 vui[i].pos == i + src_l + dst_l. */
2954 if (vui
[0].pos
> vui
[1].pos
)
2956 /* Order should be 1, 0, 2... */
2957 dst
->var_part
[k
].loc_chain
= vui
[1].lc
;
2958 vui
[1].lc
->next
= vui
[0].lc
;
2961 vui
[0].lc
->next
= vui
[2].lc
;
2962 vui
[n
- 1].lc
->next
= NULL
;
2965 vui
[0].lc
->next
= NULL
;
2970 dst
->var_part
[k
].loc_chain
= vui
[0].lc
;
2971 if (n
>= 3 && vui
[2].pos
< vui
[1].pos
)
2973 /* Order should be 0, 2, 1, 3... */
2974 vui
[0].lc
->next
= vui
[2].lc
;
2975 vui
[2].lc
->next
= vui
[1].lc
;
2978 vui
[1].lc
->next
= vui
[3].lc
;
2979 vui
[n
- 1].lc
->next
= NULL
;
2982 vui
[1].lc
->next
= NULL
;
2987 /* Order should be 0, 1, 2... */
2989 vui
[n
- 1].lc
->next
= NULL
;
2992 for (; ii
< n
; ii
++)
2993 vui
[ii
- 1].lc
->next
= vui
[ii
].lc
;
2997 qsort (vui
, n
, sizeof (struct variable_union_info
),
2998 variable_union_info_cmp_pos
);
3000 /* Reconnect the nodes in sorted order. */
3001 for (ii
= 1; ii
< n
; ii
++)
3002 vui
[ii
- 1].lc
->next
= vui
[ii
].lc
;
3003 vui
[n
- 1].lc
->next
= NULL
;
3004 dst
->var_part
[k
].loc_chain
= vui
[0].lc
;
3007 VAR_PART_OFFSET (dst
, k
) = VAR_PART_OFFSET (dst
, j
);
3012 else if ((i
>= 0 && j
>= 0
3013 && VAR_PART_OFFSET (src
, i
) < VAR_PART_OFFSET (dst
, j
))
3016 dst
->var_part
[k
] = dst
->var_part
[j
];
3019 else if ((i
>= 0 && j
>= 0
3020 && VAR_PART_OFFSET (src
, i
) > VAR_PART_OFFSET (dst
, j
))
3023 location_chain
*nextp
;
3025 /* Copy the chain from SRC. */
3026 nextp
= &dst
->var_part
[k
].loc_chain
;
3027 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
3029 location_chain new_lc
;
3031 new_lc
= (location_chain
) pool_alloc (loc_chain_pool
);
3032 new_lc
->next
= NULL
;
3033 new_lc
->init
= node
->init
;
3034 if (!node
->set_src
|| MEM_P (node
->set_src
))
3035 new_lc
->set_src
= NULL
;
3037 new_lc
->set_src
= node
->set_src
;
3038 new_lc
->loc
= node
->loc
;
3041 nextp
= &new_lc
->next
;
3044 VAR_PART_OFFSET (dst
, k
) = VAR_PART_OFFSET (src
, i
);
3047 dst
->var_part
[k
].cur_loc
= NULL
;
3050 if (flag_var_tracking_uninit
)
3051 for (i
= 0; i
< src
->n_var_parts
&& i
< dst
->n_var_parts
; i
++)
3053 location_chain node
, node2
;
3054 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
3055 for (node2
= dst
->var_part
[i
].loc_chain
; node2
; node2
= node2
->next
)
3056 if (rtx_equal_p (node
->loc
, node2
->loc
))
3058 if (node
->init
> node2
->init
)
3059 node2
->init
= node
->init
;
3063 /* Continue traversing the hash table. */
3067 /* Compute union of dataflow sets SRC and DST and store it to DST. */
3070 dataflow_set_union (dataflow_set
*dst
, dataflow_set
*src
)
3074 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
3075 attrs_list_union (&dst
->regs
[i
], src
->regs
[i
]);
3077 if (dst
->vars
== empty_shared_hash
)
3079 shared_hash_destroy (dst
->vars
);
3080 dst
->vars
= shared_hash_copy (src
->vars
);
3087 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (src
->vars
), var
, variable
, hi
)
3088 variable_union (var
, dst
);
3092 /* Whether the value is currently being expanded. */
3093 #define VALUE_RECURSED_INTO(x) \
3094 (RTL_FLAG_CHECK2 ("VALUE_RECURSED_INTO", (x), VALUE, DEBUG_EXPR)->used)
3096 /* Whether no expansion was found, saving useless lookups.
3097 It must only be set when VALUE_CHANGED is clear. */
3098 #define NO_LOC_P(x) \
3099 (RTL_FLAG_CHECK2 ("NO_LOC_P", (x), VALUE, DEBUG_EXPR)->return_val)
3101 /* Whether cur_loc in the value needs to be (re)computed. */
3102 #define VALUE_CHANGED(x) \
3103 (RTL_FLAG_CHECK1 ("VALUE_CHANGED", (x), VALUE)->frame_related)
3104 /* Whether cur_loc in the decl needs to be (re)computed. */
3105 #define DECL_CHANGED(x) TREE_VISITED (x)
3107 /* Record (if NEWV) that DV needs to have its cur_loc recomputed. For
3108 user DECLs, this means they're in changed_variables. Values and
3109 debug exprs may be left with this flag set if no user variable
3110 requires them to be evaluated. */
3113 set_dv_changed (decl_or_value dv
, bool newv
)
3115 switch (dv_onepart_p (dv
))
3119 NO_LOC_P (dv_as_value (dv
)) = false;
3120 VALUE_CHANGED (dv_as_value (dv
)) = newv
;
3125 NO_LOC_P (DECL_RTL_KNOWN_SET (dv_as_decl (dv
))) = false;
3126 /* Fall through... */
3129 DECL_CHANGED (dv_as_decl (dv
)) = newv
;
3134 /* Return true if DV needs to have its cur_loc recomputed. */
3137 dv_changed_p (decl_or_value dv
)
3139 return (dv_is_value_p (dv
)
3140 ? VALUE_CHANGED (dv_as_value (dv
))
3141 : DECL_CHANGED (dv_as_decl (dv
)));
3144 /* Return a location list node whose loc is rtx_equal to LOC, in the
3145 location list of a one-part variable or value VAR, or in that of
3146 any values recursively mentioned in the location lists. VARS must
3147 be in star-canonical form. */
3149 static location_chain
3150 find_loc_in_1pdv (rtx loc
, variable var
, htab_t vars
)
3152 location_chain node
;
3153 enum rtx_code loc_code
;
3158 gcc_checking_assert (var
->onepart
);
3160 if (!var
->n_var_parts
)
3163 gcc_checking_assert (loc
!= dv_as_opaque (var
->dv
));
3165 loc_code
= GET_CODE (loc
);
3166 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3171 if (GET_CODE (node
->loc
) != loc_code
)
3173 if (GET_CODE (node
->loc
) != VALUE
)
3176 else if (loc
== node
->loc
)
3178 else if (loc_code
!= VALUE
)
3180 if (rtx_equal_p (loc
, node
->loc
))
3185 /* Since we're in star-canonical form, we don't need to visit
3186 non-canonical nodes: one-part variables and non-canonical
3187 values would only point back to the canonical node. */
3188 if (dv_is_value_p (var
->dv
)
3189 && !canon_value_cmp (node
->loc
, dv_as_value (var
->dv
)))
3191 /* Skip all subsequent VALUEs. */
3192 while (node
->next
&& GET_CODE (node
->next
->loc
) == VALUE
)
3195 gcc_checking_assert (!canon_value_cmp (node
->loc
,
3196 dv_as_value (var
->dv
)));
3197 if (loc
== node
->loc
)
3203 gcc_checking_assert (node
== var
->var_part
[0].loc_chain
);
3204 gcc_checking_assert (!node
->next
);
3206 dv
= dv_from_value (node
->loc
);
3207 rvar
= (variable
) htab_find_with_hash (vars
, dv
, dv_htab_hash (dv
));
3208 return find_loc_in_1pdv (loc
, rvar
, vars
);
3211 /* ??? Gotta look in cselib_val locations too. */
3216 /* Hash table iteration argument passed to variable_merge. */
3219 /* The set in which the merge is to be inserted. */
3221 /* The set that we're iterating in. */
3223 /* The set that may contain the other dv we are to merge with. */
3225 /* Number of onepart dvs in src. */
3226 int src_onepart_cnt
;
3229 /* Insert LOC in *DNODE, if it's not there yet. The list must be in
3230 loc_cmp order, and it is maintained as such. */
3233 insert_into_intersection (location_chain
*nodep
, rtx loc
,
3234 enum var_init_status status
)
3236 location_chain node
;
3239 for (node
= *nodep
; node
; nodep
= &node
->next
, node
= *nodep
)
3240 if ((r
= loc_cmp (node
->loc
, loc
)) == 0)
3242 node
->init
= MIN (node
->init
, status
);
3248 node
= (location_chain
) pool_alloc (loc_chain_pool
);
3251 node
->set_src
= NULL
;
3252 node
->init
= status
;
3253 node
->next
= *nodep
;
3257 /* Insert in DEST the intersection of the locations present in both
3258 S1NODE and S2VAR, directly or indirectly. S1NODE is from a
3259 variable in DSM->cur, whereas S2VAR is from DSM->src. dvar is in
3263 intersect_loc_chains (rtx val
, location_chain
*dest
, struct dfset_merge
*dsm
,
3264 location_chain s1node
, variable s2var
)
3266 dataflow_set
*s1set
= dsm
->cur
;
3267 dataflow_set
*s2set
= dsm
->src
;
3268 location_chain found
;
3272 location_chain s2node
;
3274 gcc_checking_assert (s2var
->onepart
);
3276 if (s2var
->n_var_parts
)
3278 s2node
= s2var
->var_part
[0].loc_chain
;
3280 for (; s1node
&& s2node
;
3281 s1node
= s1node
->next
, s2node
= s2node
->next
)
3282 if (s1node
->loc
!= s2node
->loc
)
3284 else if (s1node
->loc
== val
)
3287 insert_into_intersection (dest
, s1node
->loc
,
3288 MIN (s1node
->init
, s2node
->init
));
3292 for (; s1node
; s1node
= s1node
->next
)
3294 if (s1node
->loc
== val
)
3297 if ((found
= find_loc_in_1pdv (s1node
->loc
, s2var
,
3298 shared_hash_htab (s2set
->vars
))))
3300 insert_into_intersection (dest
, s1node
->loc
,
3301 MIN (s1node
->init
, found
->init
));
3305 if (GET_CODE (s1node
->loc
) == VALUE
3306 && !VALUE_RECURSED_INTO (s1node
->loc
))
3308 decl_or_value dv
= dv_from_value (s1node
->loc
);
3309 variable svar
= shared_hash_find (s1set
->vars
, dv
);
3312 if (svar
->n_var_parts
== 1)
3314 VALUE_RECURSED_INTO (s1node
->loc
) = true;
3315 intersect_loc_chains (val
, dest
, dsm
,
3316 svar
->var_part
[0].loc_chain
,
3318 VALUE_RECURSED_INTO (s1node
->loc
) = false;
3323 /* ??? gotta look in cselib_val locations too. */
3325 /* ??? if the location is equivalent to any location in src,
3326 searched recursively
3328 add to dst the values needed to represent the equivalence
3330 telling whether locations S is equivalent to another dv's
3333 for each location D in the list
3335 if S and D satisfy rtx_equal_p, then it is present
3337 else if D is a value, recurse without cycles
3339 else if S and D have the same CODE and MODE
3341 for each operand oS and the corresponding oD
3343 if oS and oD are not equivalent, then S an D are not equivalent
3345 else if they are RTX vectors
3347 if any vector oS element is not equivalent to its respective oD,
3348 then S and D are not equivalent
3356 /* Return -1 if X should be before Y in a location list for a 1-part
3357 variable, 1 if Y should be before X, and 0 if they're equivalent
3358 and should not appear in the list. */
3361 loc_cmp (rtx x
, rtx y
)
3364 RTX_CODE code
= GET_CODE (x
);
3374 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
3375 if (REGNO (x
) == REGNO (y
))
3377 else if (REGNO (x
) < REGNO (y
))
3390 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
3391 return loc_cmp (XEXP (x
, 0), XEXP (y
, 0));
3397 if (GET_CODE (x
) == VALUE
)
3399 if (GET_CODE (y
) != VALUE
)
3401 /* Don't assert the modes are the same, that is true only
3402 when not recursing. (subreg:QI (value:SI 1:1) 0)
3403 and (subreg:QI (value:DI 2:2) 0) can be compared,
3404 even when the modes are different. */
3405 if (canon_value_cmp (x
, y
))
3411 if (GET_CODE (y
) == VALUE
)
3414 /* Entry value is the least preferable kind of expression. */
3415 if (GET_CODE (x
) == ENTRY_VALUE
)
3417 if (GET_CODE (y
) != ENTRY_VALUE
)
3419 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
3420 return loc_cmp (ENTRY_VALUE_EXP (x
), ENTRY_VALUE_EXP (y
));
3423 if (GET_CODE (y
) == ENTRY_VALUE
)
3426 if (GET_CODE (x
) == GET_CODE (y
))
3427 /* Compare operands below. */;
3428 else if (GET_CODE (x
) < GET_CODE (y
))
3433 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
3435 if (GET_CODE (x
) == DEBUG_EXPR
)
3437 if (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x
))
3438 < DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y
)))
3440 gcc_checking_assert (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x
))
3441 > DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y
)));
3445 fmt
= GET_RTX_FORMAT (code
);
3446 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
3450 if (XWINT (x
, i
) == XWINT (y
, i
))
3452 else if (XWINT (x
, i
) < XWINT (y
, i
))
3459 if (XINT (x
, i
) == XINT (y
, i
))
3461 else if (XINT (x
, i
) < XINT (y
, i
))
3468 /* Compare the vector length first. */
3469 if (XVECLEN (x
, i
) == XVECLEN (y
, i
))
3470 /* Compare the vectors elements. */;
3471 else if (XVECLEN (x
, i
) < XVECLEN (y
, i
))
3476 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3477 if ((r
= loc_cmp (XVECEXP (x
, i
, j
),
3478 XVECEXP (y
, i
, j
))))
3483 if ((r
= loc_cmp (XEXP (x
, i
), XEXP (y
, i
))))
3489 if (XSTR (x
, i
) == XSTR (y
, i
))
3495 if ((r
= strcmp (XSTR (x
, i
), XSTR (y
, i
))) == 0)
3503 /* These are just backpointers, so they don't matter. */
3510 /* It is believed that rtx's at this level will never
3511 contain anything but integers and other rtx's,
3512 except for within LABEL_REFs and SYMBOL_REFs. */
3521 /* Check the order of entries in one-part variables. */
3524 canonicalize_loc_order_check (void **slot
, void *data ATTRIBUTE_UNUSED
)
3526 variable var
= (variable
) *slot
;
3527 location_chain node
, next
;
3529 #ifdef ENABLE_RTL_CHECKING
3531 for (i
= 0; i
< var
->n_var_parts
; i
++)
3532 gcc_assert (var
->var_part
[0].cur_loc
== NULL
);
3533 gcc_assert (!var
->in_changed_variables
);
3539 gcc_assert (var
->n_var_parts
== 1);
3540 node
= var
->var_part
[0].loc_chain
;
3543 while ((next
= node
->next
))
3545 gcc_assert (loc_cmp (node
->loc
, next
->loc
) < 0);
3553 /* Mark with VALUE_RECURSED_INTO values that have neighbors that are
3554 more likely to be chosen as canonical for an equivalence set.
3555 Ensure less likely values can reach more likely neighbors, making
3556 the connections bidirectional. */
3559 canonicalize_values_mark (void **slot
, void *data
)
3561 dataflow_set
*set
= (dataflow_set
*)data
;
3562 variable var
= (variable
) *slot
;
3563 decl_or_value dv
= var
->dv
;
3565 location_chain node
;
3567 if (!dv_is_value_p (dv
))
3570 gcc_checking_assert (var
->n_var_parts
== 1);
3572 val
= dv_as_value (dv
);
3574 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3575 if (GET_CODE (node
->loc
) == VALUE
)
3577 if (canon_value_cmp (node
->loc
, val
))
3578 VALUE_RECURSED_INTO (val
) = true;
3581 decl_or_value odv
= dv_from_value (node
->loc
);
3582 void **oslot
= shared_hash_find_slot_noinsert (set
->vars
, odv
);
3584 set_slot_part (set
, val
, oslot
, odv
, 0,
3585 node
->init
, NULL_RTX
);
3587 VALUE_RECURSED_INTO (node
->loc
) = true;
3594 /* Remove redundant entries from equivalence lists in onepart
3595 variables, canonicalizing equivalence sets into star shapes. */
3598 canonicalize_values_star (void **slot
, void *data
)
3600 dataflow_set
*set
= (dataflow_set
*)data
;
3601 variable var
= (variable
) *slot
;
3602 decl_or_value dv
= var
->dv
;
3603 location_chain node
;
3613 gcc_checking_assert (var
->n_var_parts
== 1);
3615 if (dv_is_value_p (dv
))
3617 cval
= dv_as_value (dv
);
3618 if (!VALUE_RECURSED_INTO (cval
))
3620 VALUE_RECURSED_INTO (cval
) = false;
3630 gcc_assert (var
->n_var_parts
== 1);
3632 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3633 if (GET_CODE (node
->loc
) == VALUE
)
3636 if (VALUE_RECURSED_INTO (node
->loc
))
3638 if (canon_value_cmp (node
->loc
, cval
))
3647 if (!has_marks
|| dv_is_decl_p (dv
))
3650 /* Keep it marked so that we revisit it, either after visiting a
3651 child node, or after visiting a new parent that might be
3653 VALUE_RECURSED_INTO (val
) = true;
3655 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3656 if (GET_CODE (node
->loc
) == VALUE
3657 && VALUE_RECURSED_INTO (node
->loc
))
3661 VALUE_RECURSED_INTO (cval
) = false;
3662 dv
= dv_from_value (cval
);
3663 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
3666 gcc_assert (dv_is_decl_p (var
->dv
));
3667 /* The canonical value was reset and dropped.
3669 clobber_variable_part (set
, NULL
, var
->dv
, 0, NULL
);
3672 var
= (variable
)*slot
;
3673 gcc_assert (dv_is_value_p (var
->dv
));
3674 if (var
->n_var_parts
== 0)
3676 gcc_assert (var
->n_var_parts
== 1);
3680 VALUE_RECURSED_INTO (val
) = false;
3685 /* Push values to the canonical one. */
3686 cdv
= dv_from_value (cval
);
3687 cslot
= shared_hash_find_slot_noinsert (set
->vars
, cdv
);
3689 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3690 if (node
->loc
!= cval
)
3692 cslot
= set_slot_part (set
, node
->loc
, cslot
, cdv
, 0,
3693 node
->init
, NULL_RTX
);
3694 if (GET_CODE (node
->loc
) == VALUE
)
3696 decl_or_value ndv
= dv_from_value (node
->loc
);
3698 set_variable_part (set
, cval
, ndv
, 0, node
->init
, NULL_RTX
,
3701 if (canon_value_cmp (node
->loc
, val
))
3703 /* If it could have been a local minimum, it's not any more,
3704 since it's now neighbor to cval, so it may have to push
3705 to it. Conversely, if it wouldn't have prevailed over
3706 val, then whatever mark it has is fine: if it was to
3707 push, it will now push to a more canonical node, but if
3708 it wasn't, then it has already pushed any values it might
3710 VALUE_RECURSED_INTO (node
->loc
) = true;
3711 /* Make sure we visit node->loc by ensuring we cval is
3713 VALUE_RECURSED_INTO (cval
) = true;
3715 else if (!VALUE_RECURSED_INTO (node
->loc
))
3716 /* If we have no need to "recurse" into this node, it's
3717 already "canonicalized", so drop the link to the old
3719 clobber_variable_part (set
, cval
, ndv
, 0, NULL
);
3721 else if (GET_CODE (node
->loc
) == REG
)
3723 attrs list
= set
->regs
[REGNO (node
->loc
)], *listp
;
3725 /* Change an existing attribute referring to dv so that it
3726 refers to cdv, removing any duplicate this might
3727 introduce, and checking that no previous duplicates
3728 existed, all in a single pass. */
3732 if (list
->offset
== 0
3733 && (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
)
3734 || dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
)))
3741 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
))
3744 for (listp
= &list
->next
; (list
= *listp
); listp
= &list
->next
)
3749 if (dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
))
3751 *listp
= list
->next
;
3752 pool_free (attrs_pool
, list
);
3757 gcc_assert (dv_as_opaque (list
->dv
) != dv_as_opaque (dv
));
3760 else if (dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
))
3762 for (listp
= &list
->next
; (list
= *listp
); listp
= &list
->next
)
3767 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
))
3769 *listp
= list
->next
;
3770 pool_free (attrs_pool
, list
);
3775 gcc_assert (dv_as_opaque (list
->dv
) != dv_as_opaque (cdv
));
3784 if (list
->offset
== 0
3785 && (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
)
3786 || dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
)))
3796 set_slot_part (set
, val
, cslot
, cdv
, 0,
3797 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
);
3799 slot
= clobber_slot_part (set
, cval
, slot
, 0, NULL
);
3801 /* Variable may have been unshared. */
3802 var
= (variable
)*slot
;
3803 gcc_checking_assert (var
->n_var_parts
&& var
->var_part
[0].loc_chain
->loc
== cval
3804 && var
->var_part
[0].loc_chain
->next
== NULL
);
3806 if (VALUE_RECURSED_INTO (cval
))
3807 goto restart_with_cval
;
3812 /* Bind one-part variables to the canonical value in an equivalence
3813 set. Not doing this causes dataflow convergence failure in rare
3814 circumstances, see PR42873. Unfortunately we can't do this
3815 efficiently as part of canonicalize_values_star, since we may not
3816 have determined or even seen the canonical value of a set when we
3817 get to a variable that references another member of the set. */
3820 canonicalize_vars_star (void **slot
, void *data
)
3822 dataflow_set
*set
= (dataflow_set
*)data
;
3823 variable var
= (variable
) *slot
;
3824 decl_or_value dv
= var
->dv
;
3825 location_chain node
;
3830 location_chain cnode
;
3832 if (!var
->onepart
|| var
->onepart
== ONEPART_VALUE
)
3835 gcc_assert (var
->n_var_parts
== 1);
3837 node
= var
->var_part
[0].loc_chain
;
3839 if (GET_CODE (node
->loc
) != VALUE
)
3842 gcc_assert (!node
->next
);
3845 /* Push values to the canonical one. */
3846 cdv
= dv_from_value (cval
);
3847 cslot
= shared_hash_find_slot_noinsert (set
->vars
, cdv
);
3850 cvar
= (variable
)*cslot
;
3851 gcc_assert (cvar
->n_var_parts
== 1);
3853 cnode
= cvar
->var_part
[0].loc_chain
;
3855 /* CVAL is canonical if its value list contains non-VALUEs or VALUEs
3856 that are not “more canonical” than it. */
3857 if (GET_CODE (cnode
->loc
) != VALUE
3858 || !canon_value_cmp (cnode
->loc
, cval
))
3861 /* CVAL was found to be non-canonical. Change the variable to point
3862 to the canonical VALUE. */
3863 gcc_assert (!cnode
->next
);
3866 slot
= set_slot_part (set
, cval
, slot
, dv
, 0,
3867 node
->init
, node
->set_src
);
3868 clobber_slot_part (set
, cval
, slot
, 0, node
->set_src
);
3873 /* Combine variable or value in *S1SLOT (in DSM->cur) with the
3874 corresponding entry in DSM->src. Multi-part variables are combined
3875 with variable_union, whereas onepart dvs are combined with
3879 variable_merge_over_cur (variable s1var
, struct dfset_merge
*dsm
)
3881 dataflow_set
*dst
= dsm
->dst
;
3883 variable s2var
, dvar
= NULL
;
3884 decl_or_value dv
= s1var
->dv
;
3885 onepart_enum_t onepart
= s1var
->onepart
;
3888 location_chain node
, *nodep
;
3890 /* If the incoming onepart variable has an empty location list, then
3891 the intersection will be just as empty. For other variables,
3892 it's always union. */
3893 gcc_checking_assert (s1var
->n_var_parts
3894 && s1var
->var_part
[0].loc_chain
);
3897 return variable_union (s1var
, dst
);
3899 gcc_checking_assert (s1var
->n_var_parts
== 1);
3901 dvhash
= dv_htab_hash (dv
);
3902 if (dv_is_value_p (dv
))
3903 val
= dv_as_value (dv
);
3907 s2var
= shared_hash_find_1 (dsm
->src
->vars
, dv
, dvhash
);
3910 dst_can_be_shared
= false;
3914 dsm
->src_onepart_cnt
--;
3915 gcc_assert (s2var
->var_part
[0].loc_chain
3916 && s2var
->onepart
== onepart
3917 && s2var
->n_var_parts
== 1);
3919 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
3922 dvar
= (variable
)*dstslot
;
3923 gcc_assert (dvar
->refcount
== 1
3924 && dvar
->onepart
== onepart
3925 && dvar
->n_var_parts
== 1);
3926 nodep
= &dvar
->var_part
[0].loc_chain
;
3934 if (!dstslot
&& !onepart_variable_different_p (s1var
, s2var
))
3936 dstslot
= shared_hash_find_slot_unshare_1 (&dst
->vars
, dv
,
3938 *dstslot
= dvar
= s2var
;
3943 dst_can_be_shared
= false;
3945 intersect_loc_chains (val
, nodep
, dsm
,
3946 s1var
->var_part
[0].loc_chain
, s2var
);
3952 dvar
= (variable
) pool_alloc (onepart_pool (onepart
));
3955 dvar
->n_var_parts
= 1;
3956 dvar
->onepart
= onepart
;
3957 dvar
->in_changed_variables
= false;
3958 dvar
->var_part
[0].loc_chain
= node
;
3959 dvar
->var_part
[0].cur_loc
= NULL
;
3961 VAR_LOC_1PAUX (dvar
) = NULL
;
3963 VAR_PART_OFFSET (dvar
, 0) = 0;
3966 = shared_hash_find_slot_unshare_1 (&dst
->vars
, dv
, dvhash
,
3968 gcc_assert (!*dstslot
);
3976 nodep
= &dvar
->var_part
[0].loc_chain
;
3977 while ((node
= *nodep
))
3979 location_chain
*nextp
= &node
->next
;
3981 if (GET_CODE (node
->loc
) == REG
)
3985 for (list
= dst
->regs
[REGNO (node
->loc
)]; list
; list
= list
->next
)
3986 if (GET_MODE (node
->loc
) == GET_MODE (list
->loc
)
3987 && dv_is_value_p (list
->dv
))
3991 attrs_list_insert (&dst
->regs
[REGNO (node
->loc
)],
3993 /* If this value became canonical for another value that had
3994 this register, we want to leave it alone. */
3995 else if (dv_as_value (list
->dv
) != val
)
3997 dstslot
= set_slot_part (dst
, dv_as_value (list
->dv
),
3999 node
->init
, NULL_RTX
);
4000 dstslot
= delete_slot_part (dst
, node
->loc
, dstslot
, 0);
4002 /* Since nextp points into the removed node, we can't
4003 use it. The pointer to the next node moved to nodep.
4004 However, if the variable we're walking is unshared
4005 during our walk, we'll keep walking the location list
4006 of the previously-shared variable, in which case the
4007 node won't have been removed, and we'll want to skip
4008 it. That's why we test *nodep here. */
4014 /* Canonicalization puts registers first, so we don't have to
4020 if (dvar
!= (variable
)*dstslot
)
4021 dvar
= (variable
)*dstslot
;
4022 nodep
= &dvar
->var_part
[0].loc_chain
;
4026 /* Mark all referenced nodes for canonicalization, and make sure
4027 we have mutual equivalence links. */
4028 VALUE_RECURSED_INTO (val
) = true;
4029 for (node
= *nodep
; node
; node
= node
->next
)
4030 if (GET_CODE (node
->loc
) == VALUE
)
4032 VALUE_RECURSED_INTO (node
->loc
) = true;
4033 set_variable_part (dst
, val
, dv_from_value (node
->loc
), 0,
4034 node
->init
, NULL
, INSERT
);
4037 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
4038 gcc_assert (*dstslot
== dvar
);
4039 canonicalize_values_star (dstslot
, dst
);
4040 gcc_checking_assert (dstslot
4041 == shared_hash_find_slot_noinsert_1 (dst
->vars
,
4043 dvar
= (variable
)*dstslot
;
4047 bool has_value
= false, has_other
= false;
4049 /* If we have one value and anything else, we're going to
4050 canonicalize this, so make sure all values have an entry in
4051 the table and are marked for canonicalization. */
4052 for (node
= *nodep
; node
; node
= node
->next
)
4054 if (GET_CODE (node
->loc
) == VALUE
)
4056 /* If this was marked during register canonicalization,
4057 we know we have to canonicalize values. */
4072 if (has_value
&& has_other
)
4074 for (node
= *nodep
; node
; node
= node
->next
)
4076 if (GET_CODE (node
->loc
) == VALUE
)
4078 decl_or_value dv
= dv_from_value (node
->loc
);
4081 if (shared_hash_shared (dst
->vars
))
4082 slot
= shared_hash_find_slot_noinsert (dst
->vars
, dv
);
4084 slot
= shared_hash_find_slot_unshare (&dst
->vars
, dv
,
4088 variable var
= (variable
) pool_alloc (onepart_pool
4092 var
->n_var_parts
= 1;
4093 var
->onepart
= ONEPART_VALUE
;
4094 var
->in_changed_variables
= false;
4095 var
->var_part
[0].loc_chain
= NULL
;
4096 var
->var_part
[0].cur_loc
= NULL
;
4097 VAR_LOC_1PAUX (var
) = NULL
;
4101 VALUE_RECURSED_INTO (node
->loc
) = true;
4105 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
4106 gcc_assert (*dstslot
== dvar
);
4107 canonicalize_values_star (dstslot
, dst
);
4108 gcc_checking_assert (dstslot
4109 == shared_hash_find_slot_noinsert_1 (dst
->vars
,
4111 dvar
= (variable
)*dstslot
;
4115 if (!onepart_variable_different_p (dvar
, s2var
))
4117 variable_htab_free (dvar
);
4118 *dstslot
= dvar
= s2var
;
4121 else if (s2var
!= s1var
&& !onepart_variable_different_p (dvar
, s1var
))
4123 variable_htab_free (dvar
);
4124 *dstslot
= dvar
= s1var
;
4126 dst_can_be_shared
= false;
4129 dst_can_be_shared
= false;
4134 /* Copy s2slot (in DSM->src) to DSM->dst if the variable is a
4135 multi-part variable. Unions of multi-part variables and
4136 intersections of one-part ones will be handled in
4137 variable_merge_over_cur(). */
4140 variable_merge_over_src (variable s2var
, struct dfset_merge
*dsm
)
4142 dataflow_set
*dst
= dsm
->dst
;
4143 decl_or_value dv
= s2var
->dv
;
4145 if (!s2var
->onepart
)
4147 void **dstp
= shared_hash_find_slot (dst
->vars
, dv
);
4153 dsm
->src_onepart_cnt
++;
4157 /* Combine dataflow set information from SRC2 into DST, using PDST
4158 to carry over information across passes. */
4161 dataflow_set_merge (dataflow_set
*dst
, dataflow_set
*src2
)
4163 dataflow_set cur
= *dst
;
4164 dataflow_set
*src1
= &cur
;
4165 struct dfset_merge dsm
;
4167 size_t src1_elems
, src2_elems
;
4171 src1_elems
= htab_elements (shared_hash_htab (src1
->vars
));
4172 src2_elems
= htab_elements (shared_hash_htab (src2
->vars
));
4173 dataflow_set_init (dst
);
4174 dst
->stack_adjust
= cur
.stack_adjust
;
4175 shared_hash_destroy (dst
->vars
);
4176 dst
->vars
= (shared_hash
) pool_alloc (shared_hash_pool
);
4177 dst
->vars
->refcount
= 1;
4179 = htab_create (MAX (src1_elems
, src2_elems
), variable_htab_hash
,
4180 variable_htab_eq
, variable_htab_free
);
4182 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4183 attrs_list_mpdv_union (&dst
->regs
[i
], src1
->regs
[i
], src2
->regs
[i
]);
4188 dsm
.src_onepart_cnt
= 0;
4190 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm
.src
->vars
), var
, variable
, hi
)
4191 variable_merge_over_src (var
, &dsm
);
4192 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm
.cur
->vars
), var
, variable
, hi
)
4193 variable_merge_over_cur (var
, &dsm
);
4195 if (dsm
.src_onepart_cnt
)
4196 dst_can_be_shared
= false;
4198 dataflow_set_destroy (src1
);
4201 /* Mark register equivalences. */
4204 dataflow_set_equiv_regs (dataflow_set
*set
)
4209 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4211 rtx canon
[NUM_MACHINE_MODES
];
4213 /* If the list is empty or one entry, no need to canonicalize
4215 if (set
->regs
[i
] == NULL
|| set
->regs
[i
]->next
== NULL
)
4218 memset (canon
, 0, sizeof (canon
));
4220 for (list
= set
->regs
[i
]; list
; list
= list
->next
)
4221 if (list
->offset
== 0 && dv_is_value_p (list
->dv
))
4223 rtx val
= dv_as_value (list
->dv
);
4224 rtx
*cvalp
= &canon
[(int)GET_MODE (val
)];
4227 if (canon_value_cmp (val
, cval
))
4231 for (list
= set
->regs
[i
]; list
; list
= list
->next
)
4232 if (list
->offset
== 0 && dv_onepart_p (list
->dv
))
4234 rtx cval
= canon
[(int)GET_MODE (list
->loc
)];
4239 if (dv_is_value_p (list
->dv
))
4241 rtx val
= dv_as_value (list
->dv
);
4246 VALUE_RECURSED_INTO (val
) = true;
4247 set_variable_part (set
, val
, dv_from_value (cval
), 0,
4248 VAR_INIT_STATUS_INITIALIZED
,
4252 VALUE_RECURSED_INTO (cval
) = true;
4253 set_variable_part (set
, cval
, list
->dv
, 0,
4254 VAR_INIT_STATUS_INITIALIZED
, NULL
, NO_INSERT
);
4257 for (listp
= &set
->regs
[i
]; (list
= *listp
);
4258 listp
= list
? &list
->next
: listp
)
4259 if (list
->offset
== 0 && dv_onepart_p (list
->dv
))
4261 rtx cval
= canon
[(int)GET_MODE (list
->loc
)];
4267 if (dv_is_value_p (list
->dv
))
4269 rtx val
= dv_as_value (list
->dv
);
4270 if (!VALUE_RECURSED_INTO (val
))
4274 slot
= shared_hash_find_slot_noinsert (set
->vars
, list
->dv
);
4275 canonicalize_values_star (slot
, set
);
4282 /* Remove any redundant values in the location list of VAR, which must
4283 be unshared and 1-part. */
4286 remove_duplicate_values (variable var
)
4288 location_chain node
, *nodep
;
4290 gcc_assert (var
->onepart
);
4291 gcc_assert (var
->n_var_parts
== 1);
4292 gcc_assert (var
->refcount
== 1);
4294 for (nodep
= &var
->var_part
[0].loc_chain
; (node
= *nodep
); )
4296 if (GET_CODE (node
->loc
) == VALUE
)
4298 if (VALUE_RECURSED_INTO (node
->loc
))
4300 /* Remove duplicate value node. */
4301 *nodep
= node
->next
;
4302 pool_free (loc_chain_pool
, node
);
4306 VALUE_RECURSED_INTO (node
->loc
) = true;
4308 nodep
= &node
->next
;
4311 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
4312 if (GET_CODE (node
->loc
) == VALUE
)
4314 gcc_assert (VALUE_RECURSED_INTO (node
->loc
));
4315 VALUE_RECURSED_INTO (node
->loc
) = false;
4320 /* Hash table iteration argument passed to variable_post_merge. */
4321 struct dfset_post_merge
4323 /* The new input set for the current block. */
4325 /* Pointer to the permanent input set for the current block, or
4327 dataflow_set
**permp
;
4330 /* Create values for incoming expressions associated with one-part
4331 variables that don't have value numbers for them. */
4334 variable_post_merge_new_vals (void **slot
, void *info
)
4336 struct dfset_post_merge
*dfpm
= (struct dfset_post_merge
*)info
;
4337 dataflow_set
*set
= dfpm
->set
;
4338 variable var
= (variable
)*slot
;
4339 location_chain node
;
4341 if (!var
->onepart
|| !var
->n_var_parts
)
4344 gcc_assert (var
->n_var_parts
== 1);
4346 if (dv_is_decl_p (var
->dv
))
4348 bool check_dupes
= false;
4351 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
4353 if (GET_CODE (node
->loc
) == VALUE
)
4354 gcc_assert (!VALUE_RECURSED_INTO (node
->loc
));
4355 else if (GET_CODE (node
->loc
) == REG
)
4357 attrs att
, *attp
, *curp
= NULL
;
4359 if (var
->refcount
!= 1)
4361 slot
= unshare_variable (set
, slot
, var
,
4362 VAR_INIT_STATUS_INITIALIZED
);
4363 var
= (variable
)*slot
;
4367 for (attp
= &set
->regs
[REGNO (node
->loc
)]; (att
= *attp
);
4369 if (att
->offset
== 0
4370 && GET_MODE (att
->loc
) == GET_MODE (node
->loc
))
4372 if (dv_is_value_p (att
->dv
))
4374 rtx cval
= dv_as_value (att
->dv
);
4379 else if (dv_as_opaque (att
->dv
) == dv_as_opaque (var
->dv
))
4387 if ((*curp
)->offset
== 0
4388 && GET_MODE ((*curp
)->loc
) == GET_MODE (node
->loc
)
4389 && dv_as_opaque ((*curp
)->dv
) == dv_as_opaque (var
->dv
))
4392 curp
= &(*curp
)->next
;
4403 *dfpm
->permp
= XNEW (dataflow_set
);
4404 dataflow_set_init (*dfpm
->permp
);
4407 for (att
= (*dfpm
->permp
)->regs
[REGNO (node
->loc
)];
4408 att
; att
= att
->next
)
4409 if (GET_MODE (att
->loc
) == GET_MODE (node
->loc
))
4411 gcc_assert (att
->offset
== 0
4412 && dv_is_value_p (att
->dv
));
4413 val_reset (set
, att
->dv
);
4420 cval
= dv_as_value (cdv
);
4424 /* Create a unique value to hold this register,
4425 that ought to be found and reused in
4426 subsequent rounds. */
4428 gcc_assert (!cselib_lookup (node
->loc
,
4429 GET_MODE (node
->loc
), 0,
4431 v
= cselib_lookup (node
->loc
, GET_MODE (node
->loc
), 1,
4433 cselib_preserve_value (v
);
4434 cselib_invalidate_rtx (node
->loc
);
4436 cdv
= dv_from_value (cval
);
4439 "Created new value %u:%u for reg %i\n",
4440 v
->uid
, v
->hash
, REGNO (node
->loc
));
4443 var_reg_decl_set (*dfpm
->permp
, node
->loc
,
4444 VAR_INIT_STATUS_INITIALIZED
,
4445 cdv
, 0, NULL
, INSERT
);
4451 /* Remove attribute referring to the decl, which now
4452 uses the value for the register, already existing or
4453 to be added when we bring perm in. */
4456 pool_free (attrs_pool
, att
);
4461 remove_duplicate_values (var
);
4467 /* Reset values in the permanent set that are not associated with the
4468 chosen expression. */
4471 variable_post_merge_perm_vals (void **pslot
, void *info
)
4473 struct dfset_post_merge
*dfpm
= (struct dfset_post_merge
*)info
;
4474 dataflow_set
*set
= dfpm
->set
;
4475 variable pvar
= (variable
)*pslot
, var
;
4476 location_chain pnode
;
4480 gcc_assert (dv_is_value_p (pvar
->dv
)
4481 && pvar
->n_var_parts
== 1);
4482 pnode
= pvar
->var_part
[0].loc_chain
;
4485 && REG_P (pnode
->loc
));
4489 var
= shared_hash_find (set
->vars
, dv
);
4492 /* Although variable_post_merge_new_vals may have made decls
4493 non-star-canonical, values that pre-existed in canonical form
4494 remain canonical, and newly-created values reference a single
4495 REG, so they are canonical as well. Since VAR has the
4496 location list for a VALUE, using find_loc_in_1pdv for it is
4497 fine, since VALUEs don't map back to DECLs. */
4498 if (find_loc_in_1pdv (pnode
->loc
, var
, shared_hash_htab (set
->vars
)))
4500 val_reset (set
, dv
);
4503 for (att
= set
->regs
[REGNO (pnode
->loc
)]; att
; att
= att
->next
)
4504 if (att
->offset
== 0
4505 && GET_MODE (att
->loc
) == GET_MODE (pnode
->loc
)
4506 && dv_is_value_p (att
->dv
))
4509 /* If there is a value associated with this register already, create
4511 if (att
&& dv_as_value (att
->dv
) != dv_as_value (dv
))
4513 rtx cval
= dv_as_value (att
->dv
);
4514 set_variable_part (set
, cval
, dv
, 0, pnode
->init
, NULL
, INSERT
);
4515 set_variable_part (set
, dv_as_value (dv
), att
->dv
, 0, pnode
->init
,
4520 attrs_list_insert (&set
->regs
[REGNO (pnode
->loc
)],
4522 variable_union (pvar
, set
);
4528 /* Just checking stuff and registering register attributes for
4532 dataflow_post_merge_adjust (dataflow_set
*set
, dataflow_set
**permp
)
4534 struct dfset_post_merge dfpm
;
4539 htab_traverse (shared_hash_htab (set
->vars
), variable_post_merge_new_vals
,
4542 htab_traverse (shared_hash_htab ((*permp
)->vars
),
4543 variable_post_merge_perm_vals
, &dfpm
);
4544 htab_traverse (shared_hash_htab (set
->vars
), canonicalize_values_star
, set
);
4545 htab_traverse (shared_hash_htab (set
->vars
), canonicalize_vars_star
, set
);
4548 /* Return a node whose loc is a MEM that refers to EXPR in the
4549 location list of a one-part variable or value VAR, or in that of
4550 any values recursively mentioned in the location lists. */
4552 static location_chain
4553 find_mem_expr_in_1pdv (tree expr
, rtx val
, htab_t vars
)
4555 location_chain node
;
4558 location_chain where
= NULL
;
4563 gcc_assert (GET_CODE (val
) == VALUE
4564 && !VALUE_RECURSED_INTO (val
));
4566 dv
= dv_from_value (val
);
4567 var
= (variable
) htab_find_with_hash (vars
, dv
, dv_htab_hash (dv
));
4572 gcc_assert (var
->onepart
);
4574 if (!var
->n_var_parts
)
4577 VALUE_RECURSED_INTO (val
) = true;
4579 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
4580 if (MEM_P (node
->loc
)
4581 && MEM_EXPR (node
->loc
) == expr
4582 && INT_MEM_OFFSET (node
->loc
) == 0)
4587 else if (GET_CODE (node
->loc
) == VALUE
4588 && !VALUE_RECURSED_INTO (node
->loc
)
4589 && (where
= find_mem_expr_in_1pdv (expr
, node
->loc
, vars
)))
4592 VALUE_RECURSED_INTO (val
) = false;
4597 /* Return TRUE if the value of MEM may vary across a call. */
4600 mem_dies_at_call (rtx mem
)
4602 tree expr
= MEM_EXPR (mem
);
4608 decl
= get_base_address (expr
);
4616 return (may_be_aliased (decl
)
4617 || (!TREE_READONLY (decl
) && is_global_var (decl
)));
4620 /* Remove all MEMs from the location list of a hash table entry for a
4621 one-part variable, except those whose MEM attributes map back to
4622 the variable itself, directly or within a VALUE. */
4625 dataflow_set_preserve_mem_locs (void **slot
, void *data
)
4627 dataflow_set
*set
= (dataflow_set
*) data
;
4628 variable var
= (variable
) *slot
;
4630 if (var
->onepart
== ONEPART_VDECL
|| var
->onepart
== ONEPART_DEXPR
)
4632 tree decl
= dv_as_decl (var
->dv
);
4633 location_chain loc
, *locp
;
4634 bool changed
= false;
4636 if (!var
->n_var_parts
)
4639 gcc_assert (var
->n_var_parts
== 1);
4641 if (shared_var_p (var
, set
->vars
))
4643 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
4645 /* We want to remove dying MEMs that doesn't refer to DECL. */
4646 if (GET_CODE (loc
->loc
) == MEM
4647 && (MEM_EXPR (loc
->loc
) != decl
4648 || INT_MEM_OFFSET (loc
->loc
) != 0)
4649 && !mem_dies_at_call (loc
->loc
))
4651 /* We want to move here MEMs that do refer to DECL. */
4652 else if (GET_CODE (loc
->loc
) == VALUE
4653 && find_mem_expr_in_1pdv (decl
, loc
->loc
,
4654 shared_hash_htab (set
->vars
)))
4661 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
4662 var
= (variable
)*slot
;
4663 gcc_assert (var
->n_var_parts
== 1);
4666 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
4669 rtx old_loc
= loc
->loc
;
4670 if (GET_CODE (old_loc
) == VALUE
)
4672 location_chain mem_node
4673 = find_mem_expr_in_1pdv (decl
, loc
->loc
,
4674 shared_hash_htab (set
->vars
));
4676 /* ??? This picks up only one out of multiple MEMs that
4677 refer to the same variable. Do we ever need to be
4678 concerned about dealing with more than one, or, given
4679 that they should all map to the same variable
4680 location, their addresses will have been merged and
4681 they will be regarded as equivalent? */
4684 loc
->loc
= mem_node
->loc
;
4685 loc
->set_src
= mem_node
->set_src
;
4686 loc
->init
= MIN (loc
->init
, mem_node
->init
);
4690 if (GET_CODE (loc
->loc
) != MEM
4691 || (MEM_EXPR (loc
->loc
) == decl
4692 && INT_MEM_OFFSET (loc
->loc
) == 0)
4693 || !mem_dies_at_call (loc
->loc
))
4695 if (old_loc
!= loc
->loc
&& emit_notes
)
4697 if (old_loc
== var
->var_part
[0].cur_loc
)
4700 var
->var_part
[0].cur_loc
= NULL
;
4709 if (old_loc
== var
->var_part
[0].cur_loc
)
4712 var
->var_part
[0].cur_loc
= NULL
;
4716 pool_free (loc_chain_pool
, loc
);
4719 if (!var
->var_part
[0].loc_chain
)
4725 variable_was_changed (var
, set
);
4731 /* Remove all MEMs from the location list of a hash table entry for a
4735 dataflow_set_remove_mem_locs (void **slot
, void *data
)
4737 dataflow_set
*set
= (dataflow_set
*) data
;
4738 variable var
= (variable
) *slot
;
4740 if (var
->onepart
== ONEPART_VALUE
)
4742 location_chain loc
, *locp
;
4743 bool changed
= false;
4746 gcc_assert (var
->n_var_parts
== 1);
4748 if (shared_var_p (var
, set
->vars
))
4750 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
4751 if (GET_CODE (loc
->loc
) == MEM
4752 && mem_dies_at_call (loc
->loc
))
4758 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
4759 var
= (variable
)*slot
;
4760 gcc_assert (var
->n_var_parts
== 1);
4763 if (VAR_LOC_1PAUX (var
))
4764 cur_loc
= VAR_LOC_FROM (var
);
4766 cur_loc
= var
->var_part
[0].cur_loc
;
4768 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
4771 if (GET_CODE (loc
->loc
) != MEM
4772 || !mem_dies_at_call (loc
->loc
))
4779 /* If we have deleted the location which was last emitted
4780 we have to emit new location so add the variable to set
4781 of changed variables. */
4782 if (cur_loc
== loc
->loc
)
4785 var
->var_part
[0].cur_loc
= NULL
;
4786 if (VAR_LOC_1PAUX (var
))
4787 VAR_LOC_FROM (var
) = NULL
;
4789 pool_free (loc_chain_pool
, loc
);
4792 if (!var
->var_part
[0].loc_chain
)
4798 variable_was_changed (var
, set
);
4804 /* Remove all variable-location information about call-clobbered
4805 registers, as well as associations between MEMs and VALUEs. */
4808 dataflow_set_clear_at_call (dataflow_set
*set
)
4811 hard_reg_set_iterator hrsi
;
4813 EXECUTE_IF_SET_IN_HARD_REG_SET (regs_invalidated_by_call
, 0, r
, hrsi
)
4814 var_regno_delete (set
, r
);
4816 if (MAY_HAVE_DEBUG_INSNS
)
4818 set
->traversed_vars
= set
->vars
;
4819 htab_traverse (shared_hash_htab (set
->vars
),
4820 dataflow_set_preserve_mem_locs
, set
);
4821 set
->traversed_vars
= set
->vars
;
4822 htab_traverse (shared_hash_htab (set
->vars
), dataflow_set_remove_mem_locs
,
4824 set
->traversed_vars
= NULL
;
4829 variable_part_different_p (variable_part
*vp1
, variable_part
*vp2
)
4831 location_chain lc1
, lc2
;
4833 for (lc1
= vp1
->loc_chain
; lc1
; lc1
= lc1
->next
)
4835 for (lc2
= vp2
->loc_chain
; lc2
; lc2
= lc2
->next
)
4837 if (REG_P (lc1
->loc
) && REG_P (lc2
->loc
))
4839 if (REGNO (lc1
->loc
) == REGNO (lc2
->loc
))
4842 if (rtx_equal_p (lc1
->loc
, lc2
->loc
))
4851 /* Return true if one-part variables VAR1 and VAR2 are different.
4852 They must be in canonical order. */
4855 onepart_variable_different_p (variable var1
, variable var2
)
4857 location_chain lc1
, lc2
;
4862 gcc_assert (var1
->n_var_parts
== 1
4863 && var2
->n_var_parts
== 1);
4865 lc1
= var1
->var_part
[0].loc_chain
;
4866 lc2
= var2
->var_part
[0].loc_chain
;
4868 gcc_assert (lc1
&& lc2
);
4872 if (loc_cmp (lc1
->loc
, lc2
->loc
))
4881 /* Return true if variables VAR1 and VAR2 are different. */
4884 variable_different_p (variable var1
, variable var2
)
4891 if (var1
->onepart
!= var2
->onepart
)
4894 if (var1
->n_var_parts
!= var2
->n_var_parts
)
4897 if (var1
->onepart
&& var1
->n_var_parts
)
4899 gcc_checking_assert (dv_as_opaque (var1
->dv
) == dv_as_opaque (var2
->dv
)
4900 && var1
->n_var_parts
== 1);
4901 /* One-part values have locations in a canonical order. */
4902 return onepart_variable_different_p (var1
, var2
);
4905 for (i
= 0; i
< var1
->n_var_parts
; i
++)
4907 if (VAR_PART_OFFSET (var1
, i
) != VAR_PART_OFFSET (var2
, i
))
4909 if (variable_part_different_p (&var1
->var_part
[i
], &var2
->var_part
[i
]))
4911 if (variable_part_different_p (&var2
->var_part
[i
], &var1
->var_part
[i
]))
4917 /* Return true if dataflow sets OLD_SET and NEW_SET differ. */
4920 dataflow_set_different (dataflow_set
*old_set
, dataflow_set
*new_set
)
4925 if (old_set
->vars
== new_set
->vars
)
4928 if (htab_elements (shared_hash_htab (old_set
->vars
))
4929 != htab_elements (shared_hash_htab (new_set
->vars
)))
4932 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (old_set
->vars
), var1
, variable
, hi
)
4934 htab_t htab
= shared_hash_htab (new_set
->vars
);
4935 variable var2
= (variable
) htab_find_with_hash (htab
, var1
->dv
,
4936 dv_htab_hash (var1
->dv
));
4939 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4941 fprintf (dump_file
, "dataflow difference found: removal of:\n");
4947 if (variable_different_p (var1
, var2
))
4949 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4951 fprintf (dump_file
, "dataflow difference found: "
4952 "old and new follow:\n");
4960 /* No need to traverse the second hashtab, if both have the same number
4961 of elements and the second one had all entries found in the first one,
4962 then it can't have any extra entries. */
4966 /* Free the contents of dataflow set SET. */
4969 dataflow_set_destroy (dataflow_set
*set
)
4973 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4974 attrs_list_clear (&set
->regs
[i
]);
4976 shared_hash_destroy (set
->vars
);
4980 /* Return true if RTL X contains a SYMBOL_REF. */
4983 contains_symbol_ref (rtx x
)
4992 code
= GET_CODE (x
);
4993 if (code
== SYMBOL_REF
)
4996 fmt
= GET_RTX_FORMAT (code
);
4997 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
5001 if (contains_symbol_ref (XEXP (x
, i
)))
5004 else if (fmt
[i
] == 'E')
5007 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
5008 if (contains_symbol_ref (XVECEXP (x
, i
, j
)))
5016 /* Shall EXPR be tracked? */
5019 track_expr_p (tree expr
, bool need_rtl
)
5024 if (TREE_CODE (expr
) == DEBUG_EXPR_DECL
)
5025 return DECL_RTL_SET_P (expr
);
5027 /* If EXPR is not a parameter or a variable do not track it. */
5028 if (TREE_CODE (expr
) != VAR_DECL
&& TREE_CODE (expr
) != PARM_DECL
)
5031 /* It also must have a name... */
5032 if (!DECL_NAME (expr
) && need_rtl
)
5035 /* ... and a RTL assigned to it. */
5036 decl_rtl
= DECL_RTL_IF_SET (expr
);
5037 if (!decl_rtl
&& need_rtl
)
5040 /* If this expression is really a debug alias of some other declaration, we
5041 don't need to track this expression if the ultimate declaration is
5044 if (DECL_DEBUG_EXPR_IS_FROM (realdecl
))
5046 realdecl
= DECL_DEBUG_EXPR (realdecl
);
5047 if (realdecl
== NULL_TREE
)
5049 else if (!DECL_P (realdecl
))
5051 if (handled_component_p (realdecl
)
5052 || (TREE_CODE (realdecl
) == MEM_REF
5053 && TREE_CODE (TREE_OPERAND (realdecl
, 0)) == ADDR_EXPR
))
5055 HOST_WIDE_INT bitsize
, bitpos
, maxsize
;
5057 = get_ref_base_and_extent (realdecl
, &bitpos
, &bitsize
,
5059 if (!DECL_P (innerdecl
)
5060 || DECL_IGNORED_P (innerdecl
)
5061 || TREE_STATIC (innerdecl
)
5063 || bitpos
+ bitsize
> 256
5064 || bitsize
!= maxsize
)
5074 /* Do not track EXPR if REALDECL it should be ignored for debugging
5076 if (DECL_IGNORED_P (realdecl
))
5079 /* Do not track global variables until we are able to emit correct location
5081 if (TREE_STATIC (realdecl
))
5084 /* When the EXPR is a DECL for alias of some variable (see example)
5085 the TREE_STATIC flag is not used. Disable tracking all DECLs whose
5086 DECL_RTL contains SYMBOL_REF.
5089 extern char **_dl_argv_internal __attribute__ ((alias ("_dl_argv")));
5092 if (decl_rtl
&& MEM_P (decl_rtl
)
5093 && contains_symbol_ref (XEXP (decl_rtl
, 0)))
5096 /* If RTX is a memory it should not be very large (because it would be
5097 an array or struct). */
5098 if (decl_rtl
&& MEM_P (decl_rtl
))
5100 /* Do not track structures and arrays. */
5101 if (GET_MODE (decl_rtl
) == BLKmode
5102 || AGGREGATE_TYPE_P (TREE_TYPE (realdecl
)))
5104 if (MEM_SIZE_KNOWN_P (decl_rtl
)
5105 && MEM_SIZE (decl_rtl
) > MAX_VAR_PARTS
)
5109 DECL_CHANGED (expr
) = 0;
5110 DECL_CHANGED (realdecl
) = 0;
5114 /* Determine whether a given LOC refers to the same variable part as
5118 same_variable_part_p (rtx loc
, tree expr
, HOST_WIDE_INT offset
)
5121 HOST_WIDE_INT offset2
;
5123 if (! DECL_P (expr
))
5128 expr2
= REG_EXPR (loc
);
5129 offset2
= REG_OFFSET (loc
);
5131 else if (MEM_P (loc
))
5133 expr2
= MEM_EXPR (loc
);
5134 offset2
= INT_MEM_OFFSET (loc
);
5139 if (! expr2
|| ! DECL_P (expr2
))
5142 expr
= var_debug_decl (expr
);
5143 expr2
= var_debug_decl (expr2
);
5145 return (expr
== expr2
&& offset
== offset2
);
5148 /* LOC is a REG or MEM that we would like to track if possible.
5149 If EXPR is null, we don't know what expression LOC refers to,
5150 otherwise it refers to EXPR + OFFSET. STORE_REG_P is true if
5151 LOC is an lvalue register.
5153 Return true if EXPR is nonnull and if LOC, or some lowpart of it,
5154 is something we can track. When returning true, store the mode of
5155 the lowpart we can track in *MODE_OUT (if nonnull) and its offset
5156 from EXPR in *OFFSET_OUT (if nonnull). */
5159 track_loc_p (rtx loc
, tree expr
, HOST_WIDE_INT offset
, bool store_reg_p
,
5160 enum machine_mode
*mode_out
, HOST_WIDE_INT
*offset_out
)
5162 enum machine_mode mode
;
5164 if (expr
== NULL
|| !track_expr_p (expr
, true))
5167 /* If REG was a paradoxical subreg, its REG_ATTRS will describe the
5168 whole subreg, but only the old inner part is really relevant. */
5169 mode
= GET_MODE (loc
);
5170 if (REG_P (loc
) && !HARD_REGISTER_NUM_P (ORIGINAL_REGNO (loc
)))
5172 enum machine_mode pseudo_mode
;
5174 pseudo_mode
= PSEUDO_REGNO_MODE (ORIGINAL_REGNO (loc
));
5175 if (GET_MODE_SIZE (mode
) > GET_MODE_SIZE (pseudo_mode
))
5177 offset
+= byte_lowpart_offset (pseudo_mode
, mode
);
5182 /* If LOC is a paradoxical lowpart of EXPR, refer to EXPR itself.
5183 Do the same if we are storing to a register and EXPR occupies
5184 the whole of register LOC; in that case, the whole of EXPR is
5185 being changed. We exclude complex modes from the second case
5186 because the real and imaginary parts are represented as separate
5187 pseudo registers, even if the whole complex value fits into one
5189 if ((GET_MODE_SIZE (mode
) > GET_MODE_SIZE (DECL_MODE (expr
))
5191 && !COMPLEX_MODE_P (DECL_MODE (expr
))
5192 && hard_regno_nregs
[REGNO (loc
)][DECL_MODE (expr
)] == 1))
5193 && offset
+ byte_lowpart_offset (DECL_MODE (expr
), mode
) == 0)
5195 mode
= DECL_MODE (expr
);
5199 if (offset
< 0 || offset
>= MAX_VAR_PARTS
)
5205 *offset_out
= offset
;
5209 /* Return the MODE lowpart of LOC, or null if LOC is not something we
5210 want to track. When returning nonnull, make sure that the attributes
5211 on the returned value are updated. */
5214 var_lowpart (enum machine_mode mode
, rtx loc
)
5216 unsigned int offset
, reg_offset
, regno
;
5218 if (GET_MODE (loc
) == mode
)
5221 if (!REG_P (loc
) && !MEM_P (loc
))
5224 offset
= byte_lowpart_offset (mode
, GET_MODE (loc
));
5227 return adjust_address_nv (loc
, mode
, offset
);
5229 reg_offset
= subreg_lowpart_offset (mode
, GET_MODE (loc
));
5230 regno
= REGNO (loc
) + subreg_regno_offset (REGNO (loc
), GET_MODE (loc
),
5232 return gen_rtx_REG_offset (loc
, mode
, regno
, offset
);
5235 /* Carry information about uses and stores while walking rtx. */
5237 struct count_use_info
5239 /* The insn where the RTX is. */
5242 /* The basic block where insn is. */
5245 /* The array of n_sets sets in the insn, as determined by cselib. */
5246 struct cselib_set
*sets
;
5249 /* True if we're counting stores, false otherwise. */
5253 /* Find a VALUE corresponding to X. */
5255 static inline cselib_val
*
5256 find_use_val (rtx x
, enum machine_mode mode
, struct count_use_info
*cui
)
5262 /* This is called after uses are set up and before stores are
5263 processed by cselib, so it's safe to look up srcs, but not
5264 dsts. So we look up expressions that appear in srcs or in
5265 dest expressions, but we search the sets array for dests of
5269 /* Some targets represent memset and memcpy patterns
5270 by (set (mem:BLK ...) (reg:[QHSD]I ...)) or
5271 (set (mem:BLK ...) (const_int ...)) or
5272 (set (mem:BLK ...) (mem:BLK ...)). Don't return anything
5273 in that case, otherwise we end up with mode mismatches. */
5274 if (mode
== BLKmode
&& MEM_P (x
))
5276 for (i
= 0; i
< cui
->n_sets
; i
++)
5277 if (cui
->sets
[i
].dest
== x
)
5278 return cui
->sets
[i
].src_elt
;
5281 return cselib_lookup (x
, mode
, 0, VOIDmode
);
5287 /* Replace all registers and addresses in an expression with VALUE
5288 expressions that map back to them, unless the expression is a
5289 register. If no mapping is or can be performed, returns NULL. */
5292 replace_expr_with_values (rtx loc
)
5294 if (REG_P (loc
) || GET_CODE (loc
) == ENTRY_VALUE
)
5296 else if (MEM_P (loc
))
5298 cselib_val
*addr
= cselib_lookup (XEXP (loc
, 0),
5299 get_address_mode (loc
), 0,
5302 return replace_equiv_address_nv (loc
, addr
->val_rtx
);
5307 return cselib_subst_to_values (loc
, VOIDmode
);
5310 /* Return true if *X is a DEBUG_EXPR. Usable as an argument to
5311 for_each_rtx to tell whether there are any DEBUG_EXPRs within
5315 rtx_debug_expr_p (rtx
*x
, void *data ATTRIBUTE_UNUSED
)
5319 return GET_CODE (loc
) == DEBUG_EXPR
;
5322 /* Determine what kind of micro operation to choose for a USE. Return
5323 MO_CLOBBER if no micro operation is to be generated. */
5325 static enum micro_operation_type
5326 use_type (rtx loc
, struct count_use_info
*cui
, enum machine_mode
*modep
)
5330 if (cui
&& cui
->sets
)
5332 if (GET_CODE (loc
) == VAR_LOCATION
)
5334 if (track_expr_p (PAT_VAR_LOCATION_DECL (loc
), false))
5336 rtx ploc
= PAT_VAR_LOCATION_LOC (loc
);
5337 if (! VAR_LOC_UNKNOWN_P (ploc
))
5339 cselib_val
*val
= cselib_lookup (ploc
, GET_MODE (loc
), 1,
5342 /* ??? flag_float_store and volatile mems are never
5343 given values, but we could in theory use them for
5345 gcc_assert (val
|| 1);
5353 if (REG_P (loc
) || MEM_P (loc
))
5356 *modep
= GET_MODE (loc
);
5360 || (find_use_val (loc
, GET_MODE (loc
), cui
)
5361 && cselib_lookup (XEXP (loc
, 0),
5362 get_address_mode (loc
), 0,
5368 cselib_val
*val
= find_use_val (loc
, GET_MODE (loc
), cui
);
5370 if (val
&& !cselib_preserved_value_p (val
))
5378 gcc_assert (REGNO (loc
) < FIRST_PSEUDO_REGISTER
);
5380 if (loc
== cfa_base_rtx
)
5382 expr
= REG_EXPR (loc
);
5385 return MO_USE_NO_VAR
;
5386 else if (target_for_debug_bind (var_debug_decl (expr
)))
5388 else if (track_loc_p (loc
, expr
, REG_OFFSET (loc
),
5389 false, modep
, NULL
))
5392 return MO_USE_NO_VAR
;
5394 else if (MEM_P (loc
))
5396 expr
= MEM_EXPR (loc
);
5400 else if (target_for_debug_bind (var_debug_decl (expr
)))
5402 else if (track_loc_p (loc
, expr
, INT_MEM_OFFSET (loc
),
5404 /* Multi-part variables shouldn't refer to one-part
5405 variable names such as VALUEs (never happens) or
5406 DEBUG_EXPRs (only happens in the presence of debug
5408 && (!MAY_HAVE_DEBUG_INSNS
5409 || !for_each_rtx (&XEXP (loc
, 0), rtx_debug_expr_p
, NULL
)))
5418 /* Log to OUT information about micro-operation MOPT involving X in
5422 log_op_type (rtx x
, basic_block bb
, rtx insn
,
5423 enum micro_operation_type mopt
, FILE *out
)
5425 fprintf (out
, "bb %i op %i insn %i %s ",
5426 bb
->index
, VTI (bb
)->mos
.length (),
5427 INSN_UID (insn
), micro_operation_type_name
[mopt
]);
5428 print_inline_rtx (out
, x
, 2);
5432 /* Tell whether the CONCAT used to holds a VALUE and its location
5433 needs value resolution, i.e., an attempt of mapping the location
5434 back to other incoming values. */
5435 #define VAL_NEEDS_RESOLUTION(x) \
5436 (RTL_FLAG_CHECK1 ("VAL_NEEDS_RESOLUTION", (x), CONCAT)->volatil)
5437 /* Whether the location in the CONCAT is a tracked expression, that
5438 should also be handled like a MO_USE. */
5439 #define VAL_HOLDS_TRACK_EXPR(x) \
5440 (RTL_FLAG_CHECK1 ("VAL_HOLDS_TRACK_EXPR", (x), CONCAT)->used)
5441 /* Whether the location in the CONCAT should be handled like a MO_COPY
5443 #define VAL_EXPR_IS_COPIED(x) \
5444 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_COPIED", (x), CONCAT)->jump)
5445 /* Whether the location in the CONCAT should be handled like a
5446 MO_CLOBBER as well. */
5447 #define VAL_EXPR_IS_CLOBBERED(x) \
5448 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_CLOBBERED", (x), CONCAT)->unchanging)
5450 /* All preserved VALUEs. */
5451 static vec
<rtx
> preserved_values
;
5453 /* Ensure VAL is preserved and remember it in a vector for vt_emit_notes. */
5456 preserve_value (cselib_val
*val
)
5458 cselib_preserve_value (val
);
5459 preserved_values
.safe_push (val
->val_rtx
);
5462 /* Helper function for MO_VAL_LOC handling. Return non-zero if
5463 any rtxes not suitable for CONST use not replaced by VALUEs
5467 non_suitable_const (rtx
*x
, void *data ATTRIBUTE_UNUSED
)
5472 switch (GET_CODE (*x
))
5483 return !MEM_READONLY_P (*x
);
5489 /* Add uses (register and memory references) LOC which will be tracked
5490 to VTI (bb)->mos. INSN is instruction which the LOC is part of. */
5493 add_uses (rtx
*ploc
, void *data
)
5496 enum machine_mode mode
= VOIDmode
;
5497 struct count_use_info
*cui
= (struct count_use_info
*)data
;
5498 enum micro_operation_type type
= use_type (loc
, cui
, &mode
);
5500 if (type
!= MO_CLOBBER
)
5502 basic_block bb
= cui
->bb
;
5506 mo
.u
.loc
= type
== MO_USE
? var_lowpart (mode
, loc
) : loc
;
5507 mo
.insn
= cui
->insn
;
5509 if (type
== MO_VAL_LOC
)
5512 rtx vloc
= PAT_VAR_LOCATION_LOC (oloc
);
5515 gcc_assert (cui
->sets
);
5518 && !REG_P (XEXP (vloc
, 0))
5519 && !MEM_P (XEXP (vloc
, 0)))
5522 enum machine_mode address_mode
= get_address_mode (mloc
);
5524 = cselib_lookup (XEXP (mloc
, 0), address_mode
, 0,
5527 if (val
&& !cselib_preserved_value_p (val
))
5528 preserve_value (val
);
5531 if (CONSTANT_P (vloc
)
5532 && (GET_CODE (vloc
) != CONST
5533 || for_each_rtx (&vloc
, non_suitable_const
, NULL
)))
5534 /* For constants don't look up any value. */;
5535 else if (!VAR_LOC_UNKNOWN_P (vloc
) && !unsuitable_loc (vloc
)
5536 && (val
= find_use_val (vloc
, GET_MODE (oloc
), cui
)))
5538 enum machine_mode mode2
;
5539 enum micro_operation_type type2
;
5541 bool resolvable
= REG_P (vloc
) || MEM_P (vloc
);
5544 nloc
= replace_expr_with_values (vloc
);
5548 oloc
= shallow_copy_rtx (oloc
);
5549 PAT_VAR_LOCATION_LOC (oloc
) = nloc
;
5552 oloc
= gen_rtx_CONCAT (mode
, val
->val_rtx
, oloc
);
5554 type2
= use_type (vloc
, 0, &mode2
);
5556 gcc_assert (type2
== MO_USE
|| type2
== MO_USE_NO_VAR
5557 || type2
== MO_CLOBBER
);
5559 if (type2
== MO_CLOBBER
5560 && !cselib_preserved_value_p (val
))
5562 VAL_NEEDS_RESOLUTION (oloc
) = resolvable
;
5563 preserve_value (val
);
5566 else if (!VAR_LOC_UNKNOWN_P (vloc
))
5568 oloc
= shallow_copy_rtx (oloc
);
5569 PAT_VAR_LOCATION_LOC (oloc
) = gen_rtx_UNKNOWN_VAR_LOC ();
5574 else if (type
== MO_VAL_USE
)
5576 enum machine_mode mode2
= VOIDmode
;
5577 enum micro_operation_type type2
;
5578 cselib_val
*val
= find_use_val (loc
, GET_MODE (loc
), cui
);
5579 rtx vloc
, oloc
= loc
, nloc
;
5581 gcc_assert (cui
->sets
);
5584 && !REG_P (XEXP (oloc
, 0))
5585 && !MEM_P (XEXP (oloc
, 0)))
5588 enum machine_mode address_mode
= get_address_mode (mloc
);
5590 = cselib_lookup (XEXP (mloc
, 0), address_mode
, 0,
5593 if (val
&& !cselib_preserved_value_p (val
))
5594 preserve_value (val
);
5597 type2
= use_type (loc
, 0, &mode2
);
5599 gcc_assert (type2
== MO_USE
|| type2
== MO_USE_NO_VAR
5600 || type2
== MO_CLOBBER
);
5602 if (type2
== MO_USE
)
5603 vloc
= var_lowpart (mode2
, loc
);
5607 /* The loc of a MO_VAL_USE may have two forms:
5609 (concat val src): val is at src, a value-based
5612 (concat (concat val use) src): same as above, with use as
5613 the MO_USE tracked value, if it differs from src.
5617 gcc_checking_assert (REG_P (loc
) || MEM_P (loc
));
5618 nloc
= replace_expr_with_values (loc
);
5623 oloc
= gen_rtx_CONCAT (mode2
, val
->val_rtx
, vloc
);
5625 oloc
= val
->val_rtx
;
5627 mo
.u
.loc
= gen_rtx_CONCAT (mode
, oloc
, nloc
);
5629 if (type2
== MO_USE
)
5630 VAL_HOLDS_TRACK_EXPR (mo
.u
.loc
) = 1;
5631 if (!cselib_preserved_value_p (val
))
5633 VAL_NEEDS_RESOLUTION (mo
.u
.loc
) = 1;
5634 preserve_value (val
);
5638 gcc_assert (type
== MO_USE
|| type
== MO_USE_NO_VAR
);
5640 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5641 log_op_type (mo
.u
.loc
, cui
->bb
, cui
->insn
, mo
.type
, dump_file
);
5642 VTI (bb
)->mos
.safe_push (mo
);
5648 /* Helper function for finding all uses of REG/MEM in X in insn INSN. */
5651 add_uses_1 (rtx
*x
, void *cui
)
5653 for_each_rtx (x
, add_uses
, cui
);
5656 /* This is the value used during expansion of locations. We want it
5657 to be unbounded, so that variables expanded deep in a recursion
5658 nest are fully evaluated, so that their values are cached
5659 correctly. We avoid recursion cycles through other means, and we
5660 don't unshare RTL, so excess complexity is not a problem. */
5661 #define EXPR_DEPTH (INT_MAX)
5662 /* We use this to keep too-complex expressions from being emitted as
5663 location notes, and then to debug information. Users can trade
5664 compile time for ridiculously complex expressions, although they're
5665 seldom useful, and they may often have to be discarded as not
5666 representable anyway. */
5667 #define EXPR_USE_DEPTH (PARAM_VALUE (PARAM_MAX_VARTRACK_EXPR_DEPTH))
5669 /* Attempt to reverse the EXPR operation in the debug info and record
5670 it in the cselib table. Say for reg1 = reg2 + 6 even when reg2 is
5671 no longer live we can express its value as VAL - 6. */
5674 reverse_op (rtx val
, const_rtx expr
, rtx insn
)
5678 struct elt_loc_list
*l
;
5682 if (GET_CODE (expr
) != SET
)
5685 if (!REG_P (SET_DEST (expr
)) || GET_MODE (val
) != GET_MODE (SET_DEST (expr
)))
5688 src
= SET_SRC (expr
);
5689 switch (GET_CODE (src
))
5696 if (!REG_P (XEXP (src
, 0)))
5701 if (!REG_P (XEXP (src
, 0)) && !MEM_P (XEXP (src
, 0)))
5708 if (!SCALAR_INT_MODE_P (GET_MODE (src
)) || XEXP (src
, 0) == cfa_base_rtx
)
5711 v
= cselib_lookup (XEXP (src
, 0), GET_MODE (XEXP (src
, 0)), 0, VOIDmode
);
5712 if (!v
|| !cselib_preserved_value_p (v
))
5715 /* Use canonical V to avoid creating multiple redundant expressions
5716 for different VALUES equivalent to V. */
5717 v
= canonical_cselib_val (v
);
5719 /* Adding a reverse op isn't useful if V already has an always valid
5720 location. Ignore ENTRY_VALUE, while it is always constant, we should
5721 prefer non-ENTRY_VALUE locations whenever possible. */
5722 for (l
= v
->locs
, count
= 0; l
; l
= l
->next
, count
++)
5723 if (CONSTANT_P (l
->loc
)
5724 && (GET_CODE (l
->loc
) != CONST
|| !references_value_p (l
->loc
, 0)))
5726 /* Avoid creating too large locs lists. */
5727 else if (count
== PARAM_VALUE (PARAM_MAX_VARTRACK_REVERSE_OP_SIZE
))
5730 switch (GET_CODE (src
))
5734 if (GET_MODE (v
->val_rtx
) != GET_MODE (val
))
5736 ret
= gen_rtx_fmt_e (GET_CODE (src
), GET_MODE (val
), val
);
5740 ret
= gen_lowpart_SUBREG (GET_MODE (v
->val_rtx
), val
);
5752 if (GET_MODE (v
->val_rtx
) != GET_MODE (val
))
5754 arg
= XEXP (src
, 1);
5755 if (!CONST_INT_P (arg
) && GET_CODE (arg
) != SYMBOL_REF
)
5757 arg
= cselib_expand_value_rtx (arg
, scratch_regs
, 5);
5758 if (arg
== NULL_RTX
)
5760 if (!CONST_INT_P (arg
) && GET_CODE (arg
) != SYMBOL_REF
)
5763 ret
= simplify_gen_binary (code
, GET_MODE (val
), val
, arg
);
5765 /* Ensure ret isn't VALUE itself (which can happen e.g. for
5766 (plus (reg1) (reg2)) when reg2 is known to be 0), as that
5767 breaks a lot of routines during var-tracking. */
5768 ret
= gen_rtx_fmt_ee (PLUS
, GET_MODE (val
), val
, const0_rtx
);
5774 cselib_add_permanent_equiv (v
, ret
, insn
);
5777 /* Add stores (register and memory references) LOC which will be tracked
5778 to VTI (bb)->mos. EXPR is the RTL expression containing the store.
5779 CUIP->insn is instruction which the LOC is part of. */
5782 add_stores (rtx loc
, const_rtx expr
, void *cuip
)
5784 enum machine_mode mode
= VOIDmode
, mode2
;
5785 struct count_use_info
*cui
= (struct count_use_info
*)cuip
;
5786 basic_block bb
= cui
->bb
;
5788 rtx oloc
= loc
, nloc
, src
= NULL
;
5789 enum micro_operation_type type
= use_type (loc
, cui
, &mode
);
5790 bool track_p
= false;
5792 bool resolve
, preserve
;
5794 if (type
== MO_CLOBBER
)
5801 gcc_assert (loc
!= cfa_base_rtx
);
5802 if ((GET_CODE (expr
) == CLOBBER
&& type
!= MO_VAL_SET
)
5803 || !(track_p
= use_type (loc
, NULL
, &mode2
) == MO_USE
)
5804 || GET_CODE (expr
) == CLOBBER
)
5806 mo
.type
= MO_CLOBBER
;
5808 if (GET_CODE (expr
) == SET
5809 && SET_DEST (expr
) == loc
5810 && !unsuitable_loc (SET_SRC (expr
))
5811 && find_use_val (loc
, mode
, cui
))
5813 gcc_checking_assert (type
== MO_VAL_SET
);
5814 mo
.u
.loc
= gen_rtx_SET (VOIDmode
, loc
, SET_SRC (expr
));
5819 if (GET_CODE (expr
) == SET
5820 && SET_DEST (expr
) == loc
5821 && GET_CODE (SET_SRC (expr
)) != ASM_OPERANDS
)
5822 src
= var_lowpart (mode2
, SET_SRC (expr
));
5823 loc
= var_lowpart (mode2
, loc
);
5832 rtx xexpr
= gen_rtx_SET (VOIDmode
, loc
, src
);
5833 if (same_variable_part_p (src
, REG_EXPR (loc
), REG_OFFSET (loc
)))
5840 mo
.insn
= cui
->insn
;
5842 else if (MEM_P (loc
)
5843 && ((track_p
= use_type (loc
, NULL
, &mode2
) == MO_USE
)
5846 if (MEM_P (loc
) && type
== MO_VAL_SET
5847 && !REG_P (XEXP (loc
, 0))
5848 && !MEM_P (XEXP (loc
, 0)))
5851 enum machine_mode address_mode
= get_address_mode (mloc
);
5852 cselib_val
*val
= cselib_lookup (XEXP (mloc
, 0),
5856 if (val
&& !cselib_preserved_value_p (val
))
5857 preserve_value (val
);
5860 if (GET_CODE (expr
) == CLOBBER
|| !track_p
)
5862 mo
.type
= MO_CLOBBER
;
5863 mo
.u
.loc
= track_p
? var_lowpart (mode2
, loc
) : loc
;
5867 if (GET_CODE (expr
) == SET
5868 && SET_DEST (expr
) == loc
5869 && GET_CODE (SET_SRC (expr
)) != ASM_OPERANDS
)
5870 src
= var_lowpart (mode2
, SET_SRC (expr
));
5871 loc
= var_lowpart (mode2
, loc
);
5880 rtx xexpr
= gen_rtx_SET (VOIDmode
, loc
, src
);
5881 if (same_variable_part_p (SET_SRC (xexpr
),
5883 INT_MEM_OFFSET (loc
)))
5890 mo
.insn
= cui
->insn
;
5895 if (type
!= MO_VAL_SET
)
5896 goto log_and_return
;
5898 v
= find_use_val (oloc
, mode
, cui
);
5901 goto log_and_return
;
5903 resolve
= preserve
= !cselib_preserved_value_p (v
);
5905 if (loc
== stack_pointer_rtx
5906 && hard_frame_pointer_adjustment
!= -1
5908 cselib_set_value_sp_based (v
);
5910 nloc
= replace_expr_with_values (oloc
);
5914 if (GET_CODE (PATTERN (cui
->insn
)) == COND_EXEC
)
5916 cselib_val
*oval
= cselib_lookup (oloc
, GET_MODE (oloc
), 0, VOIDmode
);
5920 gcc_assert (REG_P (oloc
) || MEM_P (oloc
));
5922 if (oval
&& !cselib_preserved_value_p (oval
))
5924 micro_operation moa
;
5926 preserve_value (oval
);
5928 moa
.type
= MO_VAL_USE
;
5929 moa
.u
.loc
= gen_rtx_CONCAT (mode
, oval
->val_rtx
, oloc
);
5930 VAL_NEEDS_RESOLUTION (moa
.u
.loc
) = 1;
5931 moa
.insn
= cui
->insn
;
5933 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5934 log_op_type (moa
.u
.loc
, cui
->bb
, cui
->insn
,
5935 moa
.type
, dump_file
);
5936 VTI (bb
)->mos
.safe_push (moa
);
5941 else if (resolve
&& GET_CODE (mo
.u
.loc
) == SET
)
5943 if (REG_P (SET_SRC (expr
)) || MEM_P (SET_SRC (expr
)))
5944 nloc
= replace_expr_with_values (SET_SRC (expr
));
5948 /* Avoid the mode mismatch between oexpr and expr. */
5949 if (!nloc
&& mode
!= mode2
)
5951 nloc
= SET_SRC (expr
);
5952 gcc_assert (oloc
== SET_DEST (expr
));
5955 if (nloc
&& nloc
!= SET_SRC (mo
.u
.loc
))
5956 oloc
= gen_rtx_SET (GET_MODE (mo
.u
.loc
), oloc
, nloc
);
5959 if (oloc
== SET_DEST (mo
.u
.loc
))
5960 /* No point in duplicating. */
5962 if (!REG_P (SET_SRC (mo
.u
.loc
)))
5968 if (GET_CODE (mo
.u
.loc
) == SET
5969 && oloc
== SET_DEST (mo
.u
.loc
))
5970 /* No point in duplicating. */
5976 loc
= gen_rtx_CONCAT (mode
, v
->val_rtx
, oloc
);
5978 if (mo
.u
.loc
!= oloc
)
5979 loc
= gen_rtx_CONCAT (GET_MODE (mo
.u
.loc
), loc
, mo
.u
.loc
);
5981 /* The loc of a MO_VAL_SET may have various forms:
5983 (concat val dst): dst now holds val
5985 (concat val (set dst src)): dst now holds val, copied from src
5987 (concat (concat val dstv) dst): dst now holds val; dstv is dst
5988 after replacing mems and non-top-level regs with values.
5990 (concat (concat val dstv) (set dst src)): dst now holds val,
5991 copied from src. dstv is a value-based representation of dst, if
5992 it differs from dst. If resolution is needed, src is a REG, and
5993 its mode is the same as that of val.
5995 (concat (concat val (set dstv srcv)) (set dst src)): src
5996 copied to dst, holding val. dstv and srcv are value-based
5997 representations of dst and src, respectively.
6001 if (GET_CODE (PATTERN (cui
->insn
)) != COND_EXEC
)
6002 reverse_op (v
->val_rtx
, expr
, cui
->insn
);
6007 VAL_HOLDS_TRACK_EXPR (loc
) = 1;
6010 VAL_NEEDS_RESOLUTION (loc
) = resolve
;
6013 if (mo
.type
== MO_CLOBBER
)
6014 VAL_EXPR_IS_CLOBBERED (loc
) = 1;
6015 if (mo
.type
== MO_COPY
)
6016 VAL_EXPR_IS_COPIED (loc
) = 1;
6018 mo
.type
= MO_VAL_SET
;
6021 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
6022 log_op_type (mo
.u
.loc
, cui
->bb
, cui
->insn
, mo
.type
, dump_file
);
6023 VTI (bb
)->mos
.safe_push (mo
);
6026 /* Arguments to the call. */
6027 static rtx call_arguments
;
6029 /* Compute call_arguments. */
6032 prepare_call_arguments (basic_block bb
, rtx insn
)
6035 rtx prev
, cur
, next
;
6036 rtx this_arg
= NULL_RTX
;
6037 tree type
= NULL_TREE
, t
, fndecl
= NULL_TREE
;
6038 tree obj_type_ref
= NULL_TREE
;
6039 CUMULATIVE_ARGS args_so_far_v
;
6040 cumulative_args_t args_so_far
;
6042 memset (&args_so_far_v
, 0, sizeof (args_so_far_v
));
6043 args_so_far
= pack_cumulative_args (&args_so_far_v
);
6044 call
= get_call_rtx_from (insn
);
6047 if (GET_CODE (XEXP (XEXP (call
, 0), 0)) == SYMBOL_REF
)
6049 rtx symbol
= XEXP (XEXP (call
, 0), 0);
6050 if (SYMBOL_REF_DECL (symbol
))
6051 fndecl
= SYMBOL_REF_DECL (symbol
);
6053 if (fndecl
== NULL_TREE
)
6054 fndecl
= MEM_EXPR (XEXP (call
, 0));
6056 && TREE_CODE (TREE_TYPE (fndecl
)) != FUNCTION_TYPE
6057 && TREE_CODE (TREE_TYPE (fndecl
)) != METHOD_TYPE
)
6059 if (fndecl
&& TYPE_ARG_TYPES (TREE_TYPE (fndecl
)))
6060 type
= TREE_TYPE (fndecl
);
6061 if (fndecl
&& TREE_CODE (fndecl
) != FUNCTION_DECL
)
6063 if (TREE_CODE (fndecl
) == INDIRECT_REF
6064 && TREE_CODE (TREE_OPERAND (fndecl
, 0)) == OBJ_TYPE_REF
)
6065 obj_type_ref
= TREE_OPERAND (fndecl
, 0);
6070 for (t
= TYPE_ARG_TYPES (type
); t
&& t
!= void_list_node
;
6072 if (TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
6073 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_VALUE (t
))))
6075 if ((t
== NULL
|| t
== void_list_node
) && obj_type_ref
== NULL_TREE
)
6079 int nargs ATTRIBUTE_UNUSED
= list_length (TYPE_ARG_TYPES (type
));
6080 link
= CALL_INSN_FUNCTION_USAGE (insn
);
6081 #ifndef PCC_STATIC_STRUCT_RETURN
6082 if (aggregate_value_p (TREE_TYPE (type
), type
)
6083 && targetm
.calls
.struct_value_rtx (type
, 0) == 0)
6085 tree struct_addr
= build_pointer_type (TREE_TYPE (type
));
6086 enum machine_mode mode
= TYPE_MODE (struct_addr
);
6088 INIT_CUMULATIVE_ARGS (args_so_far_v
, type
, NULL_RTX
, fndecl
,
6090 reg
= targetm
.calls
.function_arg (args_so_far
, mode
,
6092 targetm
.calls
.function_arg_advance (args_so_far
, mode
,
6094 if (reg
== NULL_RTX
)
6096 for (; link
; link
= XEXP (link
, 1))
6097 if (GET_CODE (XEXP (link
, 0)) == USE
6098 && MEM_P (XEXP (XEXP (link
, 0), 0)))
6100 link
= XEXP (link
, 1);
6107 INIT_CUMULATIVE_ARGS (args_so_far_v
, type
, NULL_RTX
, fndecl
,
6109 if (obj_type_ref
&& TYPE_ARG_TYPES (type
) != void_list_node
)
6111 enum machine_mode mode
;
6112 t
= TYPE_ARG_TYPES (type
);
6113 mode
= TYPE_MODE (TREE_VALUE (t
));
6114 this_arg
= targetm
.calls
.function_arg (args_so_far
, mode
,
6115 TREE_VALUE (t
), true);
6116 if (this_arg
&& !REG_P (this_arg
))
6117 this_arg
= NULL_RTX
;
6118 else if (this_arg
== NULL_RTX
)
6120 for (; link
; link
= XEXP (link
, 1))
6121 if (GET_CODE (XEXP (link
, 0)) == USE
6122 && MEM_P (XEXP (XEXP (link
, 0), 0)))
6124 this_arg
= XEXP (XEXP (link
, 0), 0);
6132 t
= type
? TYPE_ARG_TYPES (type
) : NULL_TREE
;
6134 for (link
= CALL_INSN_FUNCTION_USAGE (insn
); link
; link
= XEXP (link
, 1))
6135 if (GET_CODE (XEXP (link
, 0)) == USE
)
6137 rtx item
= NULL_RTX
;
6138 x
= XEXP (XEXP (link
, 0), 0);
6139 if (GET_MODE (link
) == VOIDmode
6140 || GET_MODE (link
) == BLKmode
6141 || (GET_MODE (link
) != GET_MODE (x
)
6142 && (GET_MODE_CLASS (GET_MODE (link
)) != MODE_INT
6143 || GET_MODE_CLASS (GET_MODE (x
)) != MODE_INT
)))
6144 /* Can't do anything for these, if the original type mode
6145 isn't known or can't be converted. */;
6148 cselib_val
*val
= cselib_lookup (x
, GET_MODE (x
), 0, VOIDmode
);
6149 if (val
&& cselib_preserved_value_p (val
))
6150 item
= val
->val_rtx
;
6151 else if (GET_MODE_CLASS (GET_MODE (x
)) == MODE_INT
)
6153 enum machine_mode mode
= GET_MODE (x
);
6155 while ((mode
= GET_MODE_WIDER_MODE (mode
)) != VOIDmode
6156 && GET_MODE_BITSIZE (mode
) <= BITS_PER_WORD
)
6158 rtx reg
= simplify_subreg (mode
, x
, GET_MODE (x
), 0);
6160 if (reg
== NULL_RTX
|| !REG_P (reg
))
6162 val
= cselib_lookup (reg
, mode
, 0, VOIDmode
);
6163 if (val
&& cselib_preserved_value_p (val
))
6165 item
= val
->val_rtx
;
6176 if (!frame_pointer_needed
)
6178 struct adjust_mem_data amd
;
6179 amd
.mem_mode
= VOIDmode
;
6180 amd
.stack_adjust
= -VTI (bb
)->out
.stack_adjust
;
6181 amd
.side_effects
= NULL_RTX
;
6183 mem
= simplify_replace_fn_rtx (mem
, NULL_RTX
, adjust_mems
,
6185 gcc_assert (amd
.side_effects
== NULL_RTX
);
6187 val
= cselib_lookup (mem
, GET_MODE (mem
), 0, VOIDmode
);
6188 if (val
&& cselib_preserved_value_p (val
))
6189 item
= val
->val_rtx
;
6190 else if (GET_MODE_CLASS (GET_MODE (mem
)) != MODE_INT
)
6192 /* For non-integer stack argument see also if they weren't
6193 initialized by integers. */
6194 enum machine_mode imode
= int_mode_for_mode (GET_MODE (mem
));
6195 if (imode
!= GET_MODE (mem
) && imode
!= BLKmode
)
6197 val
= cselib_lookup (adjust_address_nv (mem
, imode
, 0),
6198 imode
, 0, VOIDmode
);
6199 if (val
&& cselib_preserved_value_p (val
))
6200 item
= lowpart_subreg (GET_MODE (x
), val
->val_rtx
,
6208 if (GET_MODE (item
) != GET_MODE (link
))
6209 item
= lowpart_subreg (GET_MODE (link
), item
, GET_MODE (item
));
6210 if (GET_MODE (x2
) != GET_MODE (link
))
6211 x2
= lowpart_subreg (GET_MODE (link
), x2
, GET_MODE (x2
));
6212 item
= gen_rtx_CONCAT (GET_MODE (link
), x2
, item
);
6214 = gen_rtx_EXPR_LIST (VOIDmode
, item
, call_arguments
);
6216 if (t
&& t
!= void_list_node
)
6218 tree argtype
= TREE_VALUE (t
);
6219 enum machine_mode mode
= TYPE_MODE (argtype
);
6221 if (pass_by_reference (&args_so_far_v
, mode
, argtype
, true))
6223 argtype
= build_pointer_type (argtype
);
6224 mode
= TYPE_MODE (argtype
);
6226 reg
= targetm
.calls
.function_arg (args_so_far
, mode
,
6228 if (TREE_CODE (argtype
) == REFERENCE_TYPE
6229 && INTEGRAL_TYPE_P (TREE_TYPE (argtype
))
6232 && GET_MODE (reg
) == mode
6233 && GET_MODE_CLASS (mode
) == MODE_INT
6235 && REGNO (x
) == REGNO (reg
)
6236 && GET_MODE (x
) == mode
6239 enum machine_mode indmode
6240 = TYPE_MODE (TREE_TYPE (argtype
));
6241 rtx mem
= gen_rtx_MEM (indmode
, x
);
6242 cselib_val
*val
= cselib_lookup (mem
, indmode
, 0, VOIDmode
);
6243 if (val
&& cselib_preserved_value_p (val
))
6245 item
= gen_rtx_CONCAT (indmode
, mem
, val
->val_rtx
);
6246 call_arguments
= gen_rtx_EXPR_LIST (VOIDmode
, item
,
6251 struct elt_loc_list
*l
;
6254 /* Try harder, when passing address of a constant
6255 pool integer it can be easily read back. */
6256 item
= XEXP (item
, 1);
6257 if (GET_CODE (item
) == SUBREG
)
6258 item
= SUBREG_REG (item
);
6259 gcc_assert (GET_CODE (item
) == VALUE
);
6260 val
= CSELIB_VAL_PTR (item
);
6261 for (l
= val
->locs
; l
; l
= l
->next
)
6262 if (GET_CODE (l
->loc
) == SYMBOL_REF
6263 && TREE_CONSTANT_POOL_ADDRESS_P (l
->loc
)
6264 && SYMBOL_REF_DECL (l
->loc
)
6265 && DECL_INITIAL (SYMBOL_REF_DECL (l
->loc
)))
6267 initial
= DECL_INITIAL (SYMBOL_REF_DECL (l
->loc
));
6268 if (host_integerp (initial
, 0))
6270 item
= GEN_INT (tree_low_cst (initial
, 0));
6271 item
= gen_rtx_CONCAT (indmode
, mem
, item
);
6273 = gen_rtx_EXPR_LIST (VOIDmode
, item
,
6280 targetm
.calls
.function_arg_advance (args_so_far
, mode
,
6286 /* Add debug arguments. */
6288 && TREE_CODE (fndecl
) == FUNCTION_DECL
6289 && DECL_HAS_DEBUG_ARGS_P (fndecl
))
6291 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (fndecl
);
6296 for (ix
= 0; vec_safe_iterate (*debug_args
, ix
, ¶m
); ix
+= 2)
6299 tree dtemp
= (**debug_args
)[ix
+ 1];
6300 enum machine_mode mode
= DECL_MODE (dtemp
);
6301 item
= gen_rtx_DEBUG_PARAMETER_REF (mode
, param
);
6302 item
= gen_rtx_CONCAT (mode
, item
, DECL_RTL_KNOWN_SET (dtemp
));
6303 call_arguments
= gen_rtx_EXPR_LIST (VOIDmode
, item
,
6309 /* Reverse call_arguments chain. */
6311 for (cur
= call_arguments
; cur
; cur
= next
)
6313 next
= XEXP (cur
, 1);
6314 XEXP (cur
, 1) = prev
;
6317 call_arguments
= prev
;
6319 x
= get_call_rtx_from (insn
);
6322 x
= XEXP (XEXP (x
, 0), 0);
6323 if (GET_CODE (x
) == SYMBOL_REF
)
6324 /* Don't record anything. */;
6325 else if (CONSTANT_P (x
))
6327 x
= gen_rtx_CONCAT (GET_MODE (x
) == VOIDmode
? Pmode
: GET_MODE (x
),
6330 = gen_rtx_EXPR_LIST (VOIDmode
, x
, call_arguments
);
6334 cselib_val
*val
= cselib_lookup (x
, GET_MODE (x
), 0, VOIDmode
);
6335 if (val
&& cselib_preserved_value_p (val
))
6337 x
= gen_rtx_CONCAT (GET_MODE (x
), pc_rtx
, val
->val_rtx
);
6339 = gen_rtx_EXPR_LIST (VOIDmode
, x
, call_arguments
);
6345 enum machine_mode mode
6346 = TYPE_MODE (TREE_TYPE (OBJ_TYPE_REF_EXPR (obj_type_ref
)));
6347 rtx clobbered
= gen_rtx_MEM (mode
, this_arg
);
6349 = tree_low_cst (OBJ_TYPE_REF_TOKEN (obj_type_ref
), 0);
6351 clobbered
= plus_constant (mode
, clobbered
,
6352 token
* GET_MODE_SIZE (mode
));
6353 clobbered
= gen_rtx_MEM (mode
, clobbered
);
6354 x
= gen_rtx_CONCAT (mode
, gen_rtx_CLOBBER (VOIDmode
, pc_rtx
), clobbered
);
6356 = gen_rtx_EXPR_LIST (VOIDmode
, x
, call_arguments
);
6360 /* Callback for cselib_record_sets_hook, that records as micro
6361 operations uses and stores in an insn after cselib_record_sets has
6362 analyzed the sets in an insn, but before it modifies the stored
6363 values in the internal tables, unless cselib_record_sets doesn't
6364 call it directly (perhaps because we're not doing cselib in the
6365 first place, in which case sets and n_sets will be 0). */
6368 add_with_sets (rtx insn
, struct cselib_set
*sets
, int n_sets
)
6370 basic_block bb
= BLOCK_FOR_INSN (insn
);
6372 struct count_use_info cui
;
6373 micro_operation
*mos
;
6375 cselib_hook_called
= true;
6380 cui
.n_sets
= n_sets
;
6382 n1
= VTI (bb
)->mos
.length ();
6383 cui
.store_p
= false;
6384 note_uses (&PATTERN (insn
), add_uses_1
, &cui
);
6385 n2
= VTI (bb
)->mos
.length () - 1;
6386 mos
= VTI (bb
)->mos
.address ();
6388 /* Order the MO_USEs to be before MO_USE_NO_VARs and MO_VAL_USE, and
6392 while (n1
< n2
&& mos
[n1
].type
== MO_USE
)
6394 while (n1
< n2
&& mos
[n2
].type
!= MO_USE
)
6406 n2
= VTI (bb
)->mos
.length () - 1;
6409 while (n1
< n2
&& mos
[n1
].type
!= MO_VAL_LOC
)
6411 while (n1
< n2
&& mos
[n2
].type
== MO_VAL_LOC
)
6429 mo
.u
.loc
= call_arguments
;
6430 call_arguments
= NULL_RTX
;
6432 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
6433 log_op_type (PATTERN (insn
), bb
, insn
, mo
.type
, dump_file
);
6434 VTI (bb
)->mos
.safe_push (mo
);
6437 n1
= VTI (bb
)->mos
.length ();
6438 /* This will record NEXT_INSN (insn), such that we can
6439 insert notes before it without worrying about any
6440 notes that MO_USEs might emit after the insn. */
6442 note_stores (PATTERN (insn
), add_stores
, &cui
);
6443 n2
= VTI (bb
)->mos
.length () - 1;
6444 mos
= VTI (bb
)->mos
.address ();
6446 /* Order the MO_VAL_USEs first (note_stores does nothing
6447 on DEBUG_INSNs, so there are no MO_VAL_LOCs from this
6448 insn), then MO_CLOBBERs, then MO_SET/MO_COPY/MO_VAL_SET. */
6451 while (n1
< n2
&& mos
[n1
].type
== MO_VAL_USE
)
6453 while (n1
< n2
&& mos
[n2
].type
!= MO_VAL_USE
)
6465 n2
= VTI (bb
)->mos
.length () - 1;
6468 while (n1
< n2
&& mos
[n1
].type
== MO_CLOBBER
)
6470 while (n1
< n2
&& mos
[n2
].type
!= MO_CLOBBER
)
6483 static enum var_init_status
6484 find_src_status (dataflow_set
*in
, rtx src
)
6486 tree decl
= NULL_TREE
;
6487 enum var_init_status status
= VAR_INIT_STATUS_UNINITIALIZED
;
6489 if (! flag_var_tracking_uninit
)
6490 status
= VAR_INIT_STATUS_INITIALIZED
;
6492 if (src
&& REG_P (src
))
6493 decl
= var_debug_decl (REG_EXPR (src
));
6494 else if (src
&& MEM_P (src
))
6495 decl
= var_debug_decl (MEM_EXPR (src
));
6498 status
= get_init_value (in
, src
, dv_from_decl (decl
));
6503 /* SRC is the source of an assignment. Use SET to try to find what
6504 was ultimately assigned to SRC. Return that value if known,
6505 otherwise return SRC itself. */
6508 find_src_set_src (dataflow_set
*set
, rtx src
)
6510 tree decl
= NULL_TREE
; /* The variable being copied around. */
6511 rtx set_src
= NULL_RTX
; /* The value for "decl" stored in "src". */
6513 location_chain nextp
;
6517 if (src
&& REG_P (src
))
6518 decl
= var_debug_decl (REG_EXPR (src
));
6519 else if (src
&& MEM_P (src
))
6520 decl
= var_debug_decl (MEM_EXPR (src
));
6524 decl_or_value dv
= dv_from_decl (decl
);
6526 var
= shared_hash_find (set
->vars
, dv
);
6530 for (i
= 0; i
< var
->n_var_parts
&& !found
; i
++)
6531 for (nextp
= var
->var_part
[i
].loc_chain
; nextp
&& !found
;
6532 nextp
= nextp
->next
)
6533 if (rtx_equal_p (nextp
->loc
, src
))
6535 set_src
= nextp
->set_src
;
6545 /* Compute the changes of variable locations in the basic block BB. */
6548 compute_bb_dataflow (basic_block bb
)
6551 micro_operation
*mo
;
6553 dataflow_set old_out
;
6554 dataflow_set
*in
= &VTI (bb
)->in
;
6555 dataflow_set
*out
= &VTI (bb
)->out
;
6557 dataflow_set_init (&old_out
);
6558 dataflow_set_copy (&old_out
, out
);
6559 dataflow_set_copy (out
, in
);
6561 if (MAY_HAVE_DEBUG_INSNS
)
6562 local_get_addr_cache
= pointer_map_create ();
6564 FOR_EACH_VEC_ELT (VTI (bb
)->mos
, i
, mo
)
6566 rtx insn
= mo
->insn
;
6571 dataflow_set_clear_at_call (out
);
6576 rtx loc
= mo
->u
.loc
;
6579 var_reg_set (out
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
6580 else if (MEM_P (loc
))
6581 var_mem_set (out
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
6587 rtx loc
= mo
->u
.loc
;
6591 if (GET_CODE (loc
) == CONCAT
)
6593 val
= XEXP (loc
, 0);
6594 vloc
= XEXP (loc
, 1);
6602 var
= PAT_VAR_LOCATION_DECL (vloc
);
6604 clobber_variable_part (out
, NULL_RTX
,
6605 dv_from_decl (var
), 0, NULL_RTX
);
6608 if (VAL_NEEDS_RESOLUTION (loc
))
6609 val_resolve (out
, val
, PAT_VAR_LOCATION_LOC (vloc
), insn
);
6610 set_variable_part (out
, val
, dv_from_decl (var
), 0,
6611 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
6614 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc
)))
6615 set_variable_part (out
, PAT_VAR_LOCATION_LOC (vloc
),
6616 dv_from_decl (var
), 0,
6617 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
6624 rtx loc
= mo
->u
.loc
;
6625 rtx val
, vloc
, uloc
;
6627 vloc
= uloc
= XEXP (loc
, 1);
6628 val
= XEXP (loc
, 0);
6630 if (GET_CODE (val
) == CONCAT
)
6632 uloc
= XEXP (val
, 1);
6633 val
= XEXP (val
, 0);
6636 if (VAL_NEEDS_RESOLUTION (loc
))
6637 val_resolve (out
, val
, vloc
, insn
);
6639 val_store (out
, val
, uloc
, insn
, false);
6641 if (VAL_HOLDS_TRACK_EXPR (loc
))
6643 if (GET_CODE (uloc
) == REG
)
6644 var_reg_set (out
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
6646 else if (GET_CODE (uloc
) == MEM
)
6647 var_mem_set (out
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
6655 rtx loc
= mo
->u
.loc
;
6656 rtx val
, vloc
, uloc
;
6660 uloc
= XEXP (vloc
, 1);
6661 val
= XEXP (vloc
, 0);
6664 if (GET_CODE (uloc
) == SET
)
6666 dstv
= SET_DEST (uloc
);
6667 srcv
= SET_SRC (uloc
);
6675 if (GET_CODE (val
) == CONCAT
)
6677 dstv
= vloc
= XEXP (val
, 1);
6678 val
= XEXP (val
, 0);
6681 if (GET_CODE (vloc
) == SET
)
6683 srcv
= SET_SRC (vloc
);
6685 gcc_assert (val
!= srcv
);
6686 gcc_assert (vloc
== uloc
|| VAL_NEEDS_RESOLUTION (loc
));
6688 dstv
= vloc
= SET_DEST (vloc
);
6690 if (VAL_NEEDS_RESOLUTION (loc
))
6691 val_resolve (out
, val
, srcv
, insn
);
6693 else if (VAL_NEEDS_RESOLUTION (loc
))
6695 gcc_assert (GET_CODE (uloc
) == SET
6696 && GET_CODE (SET_SRC (uloc
)) == REG
);
6697 val_resolve (out
, val
, SET_SRC (uloc
), insn
);
6700 if (VAL_HOLDS_TRACK_EXPR (loc
))
6702 if (VAL_EXPR_IS_CLOBBERED (loc
))
6705 var_reg_delete (out
, uloc
, true);
6706 else if (MEM_P (uloc
))
6708 gcc_assert (MEM_P (dstv
));
6709 gcc_assert (MEM_ATTRS (dstv
) == MEM_ATTRS (uloc
));
6710 var_mem_delete (out
, dstv
, true);
6715 bool copied_p
= VAL_EXPR_IS_COPIED (loc
);
6716 rtx src
= NULL
, dst
= uloc
;
6717 enum var_init_status status
= VAR_INIT_STATUS_INITIALIZED
;
6719 if (GET_CODE (uloc
) == SET
)
6721 src
= SET_SRC (uloc
);
6722 dst
= SET_DEST (uloc
);
6727 if (flag_var_tracking_uninit
)
6729 status
= find_src_status (in
, src
);
6731 if (status
== VAR_INIT_STATUS_UNKNOWN
)
6732 status
= find_src_status (out
, src
);
6735 src
= find_src_set_src (in
, src
);
6739 var_reg_delete_and_set (out
, dst
, !copied_p
,
6741 else if (MEM_P (dst
))
6743 gcc_assert (MEM_P (dstv
));
6744 gcc_assert (MEM_ATTRS (dstv
) == MEM_ATTRS (dst
));
6745 var_mem_delete_and_set (out
, dstv
, !copied_p
,
6750 else if (REG_P (uloc
))
6751 var_regno_delete (out
, REGNO (uloc
));
6752 else if (MEM_P (uloc
))
6754 gcc_checking_assert (GET_CODE (vloc
) == MEM
);
6755 gcc_checking_assert (dstv
== vloc
);
6757 clobber_overlapping_mems (out
, vloc
);
6760 val_store (out
, val
, dstv
, insn
, true);
6766 rtx loc
= mo
->u
.loc
;
6769 if (GET_CODE (loc
) == SET
)
6771 set_src
= SET_SRC (loc
);
6772 loc
= SET_DEST (loc
);
6776 var_reg_delete_and_set (out
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
6778 else if (MEM_P (loc
))
6779 var_mem_delete_and_set (out
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
6786 rtx loc
= mo
->u
.loc
;
6787 enum var_init_status src_status
;
6790 if (GET_CODE (loc
) == SET
)
6792 set_src
= SET_SRC (loc
);
6793 loc
= SET_DEST (loc
);
6796 if (! flag_var_tracking_uninit
)
6797 src_status
= VAR_INIT_STATUS_INITIALIZED
;
6800 src_status
= find_src_status (in
, set_src
);
6802 if (src_status
== VAR_INIT_STATUS_UNKNOWN
)
6803 src_status
= find_src_status (out
, set_src
);
6806 set_src
= find_src_set_src (in
, set_src
);
6809 var_reg_delete_and_set (out
, loc
, false, src_status
, set_src
);
6810 else if (MEM_P (loc
))
6811 var_mem_delete_and_set (out
, loc
, false, src_status
, set_src
);
6817 rtx loc
= mo
->u
.loc
;
6820 var_reg_delete (out
, loc
, false);
6821 else if (MEM_P (loc
))
6822 var_mem_delete (out
, loc
, false);
6828 rtx loc
= mo
->u
.loc
;
6831 var_reg_delete (out
, loc
, true);
6832 else if (MEM_P (loc
))
6833 var_mem_delete (out
, loc
, true);
6838 out
->stack_adjust
+= mo
->u
.adjust
;
6843 if (MAY_HAVE_DEBUG_INSNS
)
6845 pointer_map_destroy (local_get_addr_cache
);
6846 local_get_addr_cache
= NULL
;
6848 dataflow_set_equiv_regs (out
);
6849 htab_traverse (shared_hash_htab (out
->vars
), canonicalize_values_mark
,
6851 htab_traverse (shared_hash_htab (out
->vars
), canonicalize_values_star
,
6854 htab_traverse (shared_hash_htab (out
->vars
),
6855 canonicalize_loc_order_check
, out
);
6858 changed
= dataflow_set_different (&old_out
, out
);
6859 dataflow_set_destroy (&old_out
);
6863 /* Find the locations of variables in the whole function. */
6866 vt_find_locations (void)
6868 fibheap_t worklist
, pending
, fibheap_swap
;
6869 sbitmap visited
, in_worklist
, in_pending
, sbitmap_swap
;
6876 int htabmax
= PARAM_VALUE (PARAM_MAX_VARTRACK_SIZE
);
6877 bool success
= true;
6879 timevar_push (TV_VAR_TRACKING_DATAFLOW
);
6880 /* Compute reverse completion order of depth first search of the CFG
6881 so that the data-flow runs faster. */
6882 rc_order
= XNEWVEC (int, n_basic_blocks
- NUM_FIXED_BLOCKS
);
6883 bb_order
= XNEWVEC (int, last_basic_block
);
6884 pre_and_rev_post_order_compute (NULL
, rc_order
, false);
6885 for (i
= 0; i
< n_basic_blocks
- NUM_FIXED_BLOCKS
; i
++)
6886 bb_order
[rc_order
[i
]] = i
;
6889 worklist
= fibheap_new ();
6890 pending
= fibheap_new ();
6891 visited
= sbitmap_alloc (last_basic_block
);
6892 in_worklist
= sbitmap_alloc (last_basic_block
);
6893 in_pending
= sbitmap_alloc (last_basic_block
);
6894 bitmap_clear (in_worklist
);
6897 fibheap_insert (pending
, bb_order
[bb
->index
], bb
);
6898 bitmap_ones (in_pending
);
6900 while (success
&& !fibheap_empty (pending
))
6902 fibheap_swap
= pending
;
6904 worklist
= fibheap_swap
;
6905 sbitmap_swap
= in_pending
;
6906 in_pending
= in_worklist
;
6907 in_worklist
= sbitmap_swap
;
6909 bitmap_clear (visited
);
6911 while (!fibheap_empty (worklist
))
6913 bb
= (basic_block
) fibheap_extract_min (worklist
);
6914 bitmap_clear_bit (in_worklist
, bb
->index
);
6915 gcc_assert (!bitmap_bit_p (visited
, bb
->index
));
6916 if (!bitmap_bit_p (visited
, bb
->index
))
6920 int oldinsz
, oldoutsz
;
6922 bitmap_set_bit (visited
, bb
->index
);
6924 if (VTI (bb
)->in
.vars
)
6927 -= (htab_size (shared_hash_htab (VTI (bb
)->in
.vars
))
6928 + htab_size (shared_hash_htab (VTI (bb
)->out
.vars
)));
6930 = htab_elements (shared_hash_htab (VTI (bb
)->in
.vars
));
6932 = htab_elements (shared_hash_htab (VTI (bb
)->out
.vars
));
6935 oldinsz
= oldoutsz
= 0;
6937 if (MAY_HAVE_DEBUG_INSNS
)
6939 dataflow_set
*in
= &VTI (bb
)->in
, *first_out
= NULL
;
6940 bool first
= true, adjust
= false;
6942 /* Calculate the IN set as the intersection of
6943 predecessor OUT sets. */
6945 dataflow_set_clear (in
);
6946 dst_can_be_shared
= true;
6948 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6949 if (!VTI (e
->src
)->flooded
)
6950 gcc_assert (bb_order
[bb
->index
]
6951 <= bb_order
[e
->src
->index
]);
6954 dataflow_set_copy (in
, &VTI (e
->src
)->out
);
6955 first_out
= &VTI (e
->src
)->out
;
6960 dataflow_set_merge (in
, &VTI (e
->src
)->out
);
6966 dataflow_post_merge_adjust (in
, &VTI (bb
)->permp
);
6968 /* Merge and merge_adjust should keep entries in
6970 htab_traverse (shared_hash_htab (in
->vars
),
6971 canonicalize_loc_order_check
,
6974 if (dst_can_be_shared
)
6976 shared_hash_destroy (in
->vars
);
6977 in
->vars
= shared_hash_copy (first_out
->vars
);
6981 VTI (bb
)->flooded
= true;
6985 /* Calculate the IN set as union of predecessor OUT sets. */
6986 dataflow_set_clear (&VTI (bb
)->in
);
6987 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6988 dataflow_set_union (&VTI (bb
)->in
, &VTI (e
->src
)->out
);
6991 changed
= compute_bb_dataflow (bb
);
6992 htabsz
+= (htab_size (shared_hash_htab (VTI (bb
)->in
.vars
))
6993 + htab_size (shared_hash_htab (VTI (bb
)->out
.vars
)));
6995 if (htabmax
&& htabsz
> htabmax
)
6997 if (MAY_HAVE_DEBUG_INSNS
)
6998 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
6999 "variable tracking size limit exceeded with "
7000 "-fvar-tracking-assignments, retrying without");
7002 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
7003 "variable tracking size limit exceeded");
7010 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7012 if (e
->dest
== EXIT_BLOCK_PTR
)
7015 if (bitmap_bit_p (visited
, e
->dest
->index
))
7017 if (!bitmap_bit_p (in_pending
, e
->dest
->index
))
7019 /* Send E->DEST to next round. */
7020 bitmap_set_bit (in_pending
, e
->dest
->index
);
7021 fibheap_insert (pending
,
7022 bb_order
[e
->dest
->index
],
7026 else if (!bitmap_bit_p (in_worklist
, e
->dest
->index
))
7028 /* Add E->DEST to current round. */
7029 bitmap_set_bit (in_worklist
, e
->dest
->index
);
7030 fibheap_insert (worklist
, bb_order
[e
->dest
->index
],
7038 "BB %i: in %i (was %i), out %i (was %i), rem %i + %i, tsz %i\n",
7040 (int)htab_elements (shared_hash_htab (VTI (bb
)->in
.vars
)),
7042 (int)htab_elements (shared_hash_htab (VTI (bb
)->out
.vars
)),
7044 (int)worklist
->nodes
, (int)pending
->nodes
, htabsz
);
7046 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
7048 fprintf (dump_file
, "BB %i IN:\n", bb
->index
);
7049 dump_dataflow_set (&VTI (bb
)->in
);
7050 fprintf (dump_file
, "BB %i OUT:\n", bb
->index
);
7051 dump_dataflow_set (&VTI (bb
)->out
);
7057 if (success
&& MAY_HAVE_DEBUG_INSNS
)
7059 gcc_assert (VTI (bb
)->flooded
);
7062 fibheap_delete (worklist
);
7063 fibheap_delete (pending
);
7064 sbitmap_free (visited
);
7065 sbitmap_free (in_worklist
);
7066 sbitmap_free (in_pending
);
7068 timevar_pop (TV_VAR_TRACKING_DATAFLOW
);
7072 /* Print the content of the LIST to dump file. */
7075 dump_attrs_list (attrs list
)
7077 for (; list
; list
= list
->next
)
7079 if (dv_is_decl_p (list
->dv
))
7080 print_mem_expr (dump_file
, dv_as_decl (list
->dv
));
7082 print_rtl_single (dump_file
, dv_as_value (list
->dv
));
7083 fprintf (dump_file
, "+" HOST_WIDE_INT_PRINT_DEC
, list
->offset
);
7085 fprintf (dump_file
, "\n");
7088 /* Print the information about variable *SLOT to dump file. */
7091 dump_var_slot (void **slot
, void *data ATTRIBUTE_UNUSED
)
7093 variable var
= (variable
) *slot
;
7097 /* Continue traversing the hash table. */
7101 /* Print the information about variable VAR to dump file. */
7104 dump_var (variable var
)
7107 location_chain node
;
7109 if (dv_is_decl_p (var
->dv
))
7111 const_tree decl
= dv_as_decl (var
->dv
);
7113 if (DECL_NAME (decl
))
7115 fprintf (dump_file
, " name: %s",
7116 IDENTIFIER_POINTER (DECL_NAME (decl
)));
7117 if (dump_flags
& TDF_UID
)
7118 fprintf (dump_file
, "D.%u", DECL_UID (decl
));
7120 else if (TREE_CODE (decl
) == DEBUG_EXPR_DECL
)
7121 fprintf (dump_file
, " name: D#%u", DEBUG_TEMP_UID (decl
));
7123 fprintf (dump_file
, " name: D.%u", DECL_UID (decl
));
7124 fprintf (dump_file
, "\n");
7128 fputc (' ', dump_file
);
7129 print_rtl_single (dump_file
, dv_as_value (var
->dv
));
7132 for (i
= 0; i
< var
->n_var_parts
; i
++)
7134 fprintf (dump_file
, " offset %ld\n",
7135 (long)(var
->onepart
? 0 : VAR_PART_OFFSET (var
, i
)));
7136 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
7138 fprintf (dump_file
, " ");
7139 if (node
->init
== VAR_INIT_STATUS_UNINITIALIZED
)
7140 fprintf (dump_file
, "[uninit]");
7141 print_rtl_single (dump_file
, node
->loc
);
7146 /* Print the information about variables from hash table VARS to dump file. */
7149 dump_vars (htab_t vars
)
7151 if (htab_elements (vars
) > 0)
7153 fprintf (dump_file
, "Variables:\n");
7154 htab_traverse (vars
, dump_var_slot
, NULL
);
7158 /* Print the dataflow set SET to dump file. */
7161 dump_dataflow_set (dataflow_set
*set
)
7165 fprintf (dump_file
, "Stack adjustment: " HOST_WIDE_INT_PRINT_DEC
"\n",
7167 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
7171 fprintf (dump_file
, "Reg %d:", i
);
7172 dump_attrs_list (set
->regs
[i
]);
7175 dump_vars (shared_hash_htab (set
->vars
));
7176 fprintf (dump_file
, "\n");
7179 /* Print the IN and OUT sets for each basic block to dump file. */
7182 dump_dataflow_sets (void)
7188 fprintf (dump_file
, "\nBasic block %d:\n", bb
->index
);
7189 fprintf (dump_file
, "IN:\n");
7190 dump_dataflow_set (&VTI (bb
)->in
);
7191 fprintf (dump_file
, "OUT:\n");
7192 dump_dataflow_set (&VTI (bb
)->out
);
7196 /* Return the variable for DV in dropped_values, inserting one if
7197 requested with INSERT. */
7199 static inline variable
7200 variable_from_dropped (decl_or_value dv
, enum insert_option insert
)
7204 onepart_enum_t onepart
;
7206 slot
= htab_find_slot_with_hash (dropped_values
, dv
, dv_htab_hash (dv
),
7213 return (variable
) *slot
;
7215 gcc_checking_assert (insert
== INSERT
);
7217 onepart
= dv_onepart_p (dv
);
7219 gcc_checking_assert (onepart
== ONEPART_VALUE
|| onepart
== ONEPART_DEXPR
);
7221 empty_var
= (variable
) pool_alloc (onepart_pool (onepart
));
7223 empty_var
->refcount
= 1;
7224 empty_var
->n_var_parts
= 0;
7225 empty_var
->onepart
= onepart
;
7226 empty_var
->in_changed_variables
= false;
7227 empty_var
->var_part
[0].loc_chain
= NULL
;
7228 empty_var
->var_part
[0].cur_loc
= NULL
;
7229 VAR_LOC_1PAUX (empty_var
) = NULL
;
7230 set_dv_changed (dv
, true);
7237 /* Recover the one-part aux from dropped_values. */
7239 static struct onepart_aux
*
7240 recover_dropped_1paux (variable var
)
7244 gcc_checking_assert (var
->onepart
);
7246 if (VAR_LOC_1PAUX (var
))
7247 return VAR_LOC_1PAUX (var
);
7249 if (var
->onepart
== ONEPART_VDECL
)
7252 dvar
= variable_from_dropped (var
->dv
, NO_INSERT
);
7257 VAR_LOC_1PAUX (var
) = VAR_LOC_1PAUX (dvar
);
7258 VAR_LOC_1PAUX (dvar
) = NULL
;
7260 return VAR_LOC_1PAUX (var
);
7263 /* Add variable VAR to the hash table of changed variables and
7264 if it has no locations delete it from SET's hash table. */
7267 variable_was_changed (variable var
, dataflow_set
*set
)
7269 hashval_t hash
= dv_htab_hash (var
->dv
);
7275 /* Remember this decl or VALUE has been added to changed_variables. */
7276 set_dv_changed (var
->dv
, true);
7278 slot
= htab_find_slot_with_hash (changed_variables
,
7284 variable old_var
= (variable
) *slot
;
7285 gcc_assert (old_var
->in_changed_variables
);
7286 old_var
->in_changed_variables
= false;
7287 if (var
!= old_var
&& var
->onepart
)
7289 /* Restore the auxiliary info from an empty variable
7290 previously created for changed_variables, so it is
7292 gcc_checking_assert (!VAR_LOC_1PAUX (var
));
7293 VAR_LOC_1PAUX (var
) = VAR_LOC_1PAUX (old_var
);
7294 VAR_LOC_1PAUX (old_var
) = NULL
;
7296 variable_htab_free (*slot
);
7299 if (set
&& var
->n_var_parts
== 0)
7301 onepart_enum_t onepart
= var
->onepart
;
7302 variable empty_var
= NULL
;
7303 void **dslot
= NULL
;
7305 if (onepart
== ONEPART_VALUE
|| onepart
== ONEPART_DEXPR
)
7307 dslot
= htab_find_slot_with_hash (dropped_values
, var
->dv
,
7308 dv_htab_hash (var
->dv
),
7310 empty_var
= (variable
) *dslot
;
7314 gcc_checking_assert (!empty_var
->in_changed_variables
);
7315 if (!VAR_LOC_1PAUX (var
))
7317 VAR_LOC_1PAUX (var
) = VAR_LOC_1PAUX (empty_var
);
7318 VAR_LOC_1PAUX (empty_var
) = NULL
;
7321 gcc_checking_assert (!VAR_LOC_1PAUX (empty_var
));
7327 empty_var
= (variable
) pool_alloc (onepart_pool (onepart
));
7328 empty_var
->dv
= var
->dv
;
7329 empty_var
->refcount
= 1;
7330 empty_var
->n_var_parts
= 0;
7331 empty_var
->onepart
= onepart
;
7334 empty_var
->refcount
++;
7339 empty_var
->refcount
++;
7340 empty_var
->in_changed_variables
= true;
7344 empty_var
->var_part
[0].loc_chain
= NULL
;
7345 empty_var
->var_part
[0].cur_loc
= NULL
;
7346 VAR_LOC_1PAUX (empty_var
) = VAR_LOC_1PAUX (var
);
7347 VAR_LOC_1PAUX (var
) = NULL
;
7353 if (var
->onepart
&& !VAR_LOC_1PAUX (var
))
7354 recover_dropped_1paux (var
);
7356 var
->in_changed_variables
= true;
7363 if (var
->n_var_parts
== 0)
7368 slot
= shared_hash_find_slot_noinsert (set
->vars
, var
->dv
);
7371 if (shared_hash_shared (set
->vars
))
7372 slot
= shared_hash_find_slot_unshare (&set
->vars
, var
->dv
,
7374 htab_clear_slot (shared_hash_htab (set
->vars
), slot
);
7380 /* Look for the index in VAR->var_part corresponding to OFFSET.
7381 Return -1 if not found. If INSERTION_POINT is non-NULL, the
7382 referenced int will be set to the index that the part has or should
7383 have, if it should be inserted. */
7386 find_variable_location_part (variable var
, HOST_WIDE_INT offset
,
7387 int *insertion_point
)
7396 if (insertion_point
)
7397 *insertion_point
= 0;
7399 return var
->n_var_parts
- 1;
7402 /* Find the location part. */
7404 high
= var
->n_var_parts
;
7407 pos
= (low
+ high
) / 2;
7408 if (VAR_PART_OFFSET (var
, pos
) < offset
)
7415 if (insertion_point
)
7416 *insertion_point
= pos
;
7418 if (pos
< var
->n_var_parts
&& VAR_PART_OFFSET (var
, pos
) == offset
)
7425 set_slot_part (dataflow_set
*set
, rtx loc
, void **slot
,
7426 decl_or_value dv
, HOST_WIDE_INT offset
,
7427 enum var_init_status initialized
, rtx set_src
)
7430 location_chain node
, next
;
7431 location_chain
*nextp
;
7433 onepart_enum_t onepart
;
7435 var
= (variable
) *slot
;
7438 onepart
= var
->onepart
;
7440 onepart
= dv_onepart_p (dv
);
7442 gcc_checking_assert (offset
== 0 || !onepart
);
7443 gcc_checking_assert (loc
!= dv_as_opaque (dv
));
7445 if (! flag_var_tracking_uninit
)
7446 initialized
= VAR_INIT_STATUS_INITIALIZED
;
7450 /* Create new variable information. */
7451 var
= (variable
) pool_alloc (onepart_pool (onepart
));
7454 var
->n_var_parts
= 1;
7455 var
->onepart
= onepart
;
7456 var
->in_changed_variables
= false;
7458 VAR_LOC_1PAUX (var
) = NULL
;
7460 VAR_PART_OFFSET (var
, 0) = offset
;
7461 var
->var_part
[0].loc_chain
= NULL
;
7462 var
->var_part
[0].cur_loc
= NULL
;
7465 nextp
= &var
->var_part
[0].loc_chain
;
7471 gcc_assert (dv_as_opaque (var
->dv
) == dv_as_opaque (dv
));
7475 if (GET_CODE (loc
) == VALUE
)
7477 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
7478 nextp
= &node
->next
)
7479 if (GET_CODE (node
->loc
) == VALUE
)
7481 if (node
->loc
== loc
)
7486 if (canon_value_cmp (node
->loc
, loc
))
7494 else if (REG_P (node
->loc
) || MEM_P (node
->loc
))
7502 else if (REG_P (loc
))
7504 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
7505 nextp
= &node
->next
)
7506 if (REG_P (node
->loc
))
7508 if (REGNO (node
->loc
) < REGNO (loc
))
7512 if (REGNO (node
->loc
) == REGNO (loc
))
7525 else if (MEM_P (loc
))
7527 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
7528 nextp
= &node
->next
)
7529 if (REG_P (node
->loc
))
7531 else if (MEM_P (node
->loc
))
7533 if ((r
= loc_cmp (XEXP (node
->loc
, 0), XEXP (loc
, 0))) >= 0)
7545 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
7546 nextp
= &node
->next
)
7547 if ((r
= loc_cmp (node
->loc
, loc
)) >= 0)
7555 if (shared_var_p (var
, set
->vars
))
7557 slot
= unshare_variable (set
, slot
, var
, initialized
);
7558 var
= (variable
)*slot
;
7559 for (nextp
= &var
->var_part
[0].loc_chain
; c
;
7560 nextp
= &(*nextp
)->next
)
7562 gcc_assert ((!node
&& !*nextp
) || node
->loc
== (*nextp
)->loc
);
7569 gcc_assert (dv_as_decl (var
->dv
) == dv_as_decl (dv
));
7571 pos
= find_variable_location_part (var
, offset
, &inspos
);
7575 node
= var
->var_part
[pos
].loc_chain
;
7578 && ((REG_P (node
->loc
) && REG_P (loc
)
7579 && REGNO (node
->loc
) == REGNO (loc
))
7580 || rtx_equal_p (node
->loc
, loc
)))
7582 /* LOC is in the beginning of the chain so we have nothing
7584 if (node
->init
< initialized
)
7585 node
->init
= initialized
;
7586 if (set_src
!= NULL
)
7587 node
->set_src
= set_src
;
7593 /* We have to make a copy of a shared variable. */
7594 if (shared_var_p (var
, set
->vars
))
7596 slot
= unshare_variable (set
, slot
, var
, initialized
);
7597 var
= (variable
)*slot
;
7603 /* We have not found the location part, new one will be created. */
7605 /* We have to make a copy of the shared variable. */
7606 if (shared_var_p (var
, set
->vars
))
7608 slot
= unshare_variable (set
, slot
, var
, initialized
);
7609 var
= (variable
)*slot
;
7612 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
7613 thus there are at most MAX_VAR_PARTS different offsets. */
7614 gcc_assert (var
->n_var_parts
< MAX_VAR_PARTS
7615 && (!var
->n_var_parts
|| !onepart
));
7617 /* We have to move the elements of array starting at index
7618 inspos to the next position. */
7619 for (pos
= var
->n_var_parts
; pos
> inspos
; pos
--)
7620 var
->var_part
[pos
] = var
->var_part
[pos
- 1];
7623 gcc_checking_assert (!onepart
);
7624 VAR_PART_OFFSET (var
, pos
) = offset
;
7625 var
->var_part
[pos
].loc_chain
= NULL
;
7626 var
->var_part
[pos
].cur_loc
= NULL
;
7629 /* Delete the location from the list. */
7630 nextp
= &var
->var_part
[pos
].loc_chain
;
7631 for (node
= var
->var_part
[pos
].loc_chain
; node
; node
= next
)
7634 if ((REG_P (node
->loc
) && REG_P (loc
)
7635 && REGNO (node
->loc
) == REGNO (loc
))
7636 || rtx_equal_p (node
->loc
, loc
))
7638 /* Save these values, to assign to the new node, before
7639 deleting this one. */
7640 if (node
->init
> initialized
)
7641 initialized
= node
->init
;
7642 if (node
->set_src
!= NULL
&& set_src
== NULL
)
7643 set_src
= node
->set_src
;
7644 if (var
->var_part
[pos
].cur_loc
== node
->loc
)
7645 var
->var_part
[pos
].cur_loc
= NULL
;
7646 pool_free (loc_chain_pool
, node
);
7651 nextp
= &node
->next
;
7654 nextp
= &var
->var_part
[pos
].loc_chain
;
7657 /* Add the location to the beginning. */
7658 node
= (location_chain
) pool_alloc (loc_chain_pool
);
7660 node
->init
= initialized
;
7661 node
->set_src
= set_src
;
7662 node
->next
= *nextp
;
7665 /* If no location was emitted do so. */
7666 if (var
->var_part
[pos
].cur_loc
== NULL
)
7667 variable_was_changed (var
, set
);
7672 /* Set the part of variable's location in the dataflow set SET. The
7673 variable part is specified by variable's declaration in DV and
7674 offset OFFSET and the part's location by LOC. IOPT should be
7675 NO_INSERT if the variable is known to be in SET already and the
7676 variable hash table must not be resized, and INSERT otherwise. */
7679 set_variable_part (dataflow_set
*set
, rtx loc
,
7680 decl_or_value dv
, HOST_WIDE_INT offset
,
7681 enum var_init_status initialized
, rtx set_src
,
7682 enum insert_option iopt
)
7686 if (iopt
== NO_INSERT
)
7687 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
7690 slot
= shared_hash_find_slot (set
->vars
, dv
);
7692 slot
= shared_hash_find_slot_unshare (&set
->vars
, dv
, iopt
);
7694 set_slot_part (set
, loc
, slot
, dv
, offset
, initialized
, set_src
);
7697 /* Remove all recorded register locations for the given variable part
7698 from dataflow set SET, except for those that are identical to loc.
7699 The variable part is specified by variable's declaration or value
7700 DV and offset OFFSET. */
7703 clobber_slot_part (dataflow_set
*set
, rtx loc
, void **slot
,
7704 HOST_WIDE_INT offset
, rtx set_src
)
7706 variable var
= (variable
) *slot
;
7707 int pos
= find_variable_location_part (var
, offset
, NULL
);
7711 location_chain node
, next
;
7713 /* Remove the register locations from the dataflow set. */
7714 next
= var
->var_part
[pos
].loc_chain
;
7715 for (node
= next
; node
; node
= next
)
7718 if (node
->loc
!= loc
7719 && (!flag_var_tracking_uninit
7722 || !rtx_equal_p (set_src
, node
->set_src
)))
7724 if (REG_P (node
->loc
))
7729 /* Remove the variable part from the register's
7730 list, but preserve any other variable parts
7731 that might be regarded as live in that same
7733 anextp
= &set
->regs
[REGNO (node
->loc
)];
7734 for (anode
= *anextp
; anode
; anode
= anext
)
7736 anext
= anode
->next
;
7737 if (dv_as_opaque (anode
->dv
) == dv_as_opaque (var
->dv
)
7738 && anode
->offset
== offset
)
7740 pool_free (attrs_pool
, anode
);
7744 anextp
= &anode
->next
;
7748 slot
= delete_slot_part (set
, node
->loc
, slot
, offset
);
7756 /* Remove all recorded register locations for the given variable part
7757 from dataflow set SET, except for those that are identical to loc.
7758 The variable part is specified by variable's declaration or value
7759 DV and offset OFFSET. */
7762 clobber_variable_part (dataflow_set
*set
, rtx loc
, decl_or_value dv
,
7763 HOST_WIDE_INT offset
, rtx set_src
)
7767 if (!dv_as_opaque (dv
)
7768 || (!dv_is_value_p (dv
) && ! DECL_P (dv_as_decl (dv
))))
7771 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
7775 clobber_slot_part (set
, loc
, slot
, offset
, set_src
);
7778 /* Delete the part of variable's location from dataflow set SET. The
7779 variable part is specified by its SET->vars slot SLOT and offset
7780 OFFSET and the part's location by LOC. */
7783 delete_slot_part (dataflow_set
*set
, rtx loc
, void **slot
,
7784 HOST_WIDE_INT offset
)
7786 variable var
= (variable
) *slot
;
7787 int pos
= find_variable_location_part (var
, offset
, NULL
);
7791 location_chain node
, next
;
7792 location_chain
*nextp
;
7796 if (shared_var_p (var
, set
->vars
))
7798 /* If the variable contains the location part we have to
7799 make a copy of the variable. */
7800 for (node
= var
->var_part
[pos
].loc_chain
; node
;
7803 if ((REG_P (node
->loc
) && REG_P (loc
)
7804 && REGNO (node
->loc
) == REGNO (loc
))
7805 || rtx_equal_p (node
->loc
, loc
))
7807 slot
= unshare_variable (set
, slot
, var
,
7808 VAR_INIT_STATUS_UNKNOWN
);
7809 var
= (variable
)*slot
;
7815 if (pos
== 0 && var
->onepart
&& VAR_LOC_1PAUX (var
))
7816 cur_loc
= VAR_LOC_FROM (var
);
7818 cur_loc
= var
->var_part
[pos
].cur_loc
;
7820 /* Delete the location part. */
7822 nextp
= &var
->var_part
[pos
].loc_chain
;
7823 for (node
= *nextp
; node
; node
= next
)
7826 if ((REG_P (node
->loc
) && REG_P (loc
)
7827 && REGNO (node
->loc
) == REGNO (loc
))
7828 || rtx_equal_p (node
->loc
, loc
))
7830 /* If we have deleted the location which was last emitted
7831 we have to emit new location so add the variable to set
7832 of changed variables. */
7833 if (cur_loc
== node
->loc
)
7836 var
->var_part
[pos
].cur_loc
= NULL
;
7837 if (pos
== 0 && var
->onepart
&& VAR_LOC_1PAUX (var
))
7838 VAR_LOC_FROM (var
) = NULL
;
7840 pool_free (loc_chain_pool
, node
);
7845 nextp
= &node
->next
;
7848 if (var
->var_part
[pos
].loc_chain
== NULL
)
7852 while (pos
< var
->n_var_parts
)
7854 var
->var_part
[pos
] = var
->var_part
[pos
+ 1];
7859 variable_was_changed (var
, set
);
7865 /* Delete the part of variable's location from dataflow set SET. The
7866 variable part is specified by variable's declaration or value DV
7867 and offset OFFSET and the part's location by LOC. */
7870 delete_variable_part (dataflow_set
*set
, rtx loc
, decl_or_value dv
,
7871 HOST_WIDE_INT offset
)
7873 void **slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
7877 delete_slot_part (set
, loc
, slot
, offset
);
7881 /* Structure for passing some other parameters to function
7882 vt_expand_loc_callback. */
7883 struct expand_loc_callback_data
7885 /* The variables and values active at this point. */
7888 /* Stack of values and debug_exprs under expansion, and their
7890 vec
<rtx
, va_stack
> expanding
;
7892 /* Stack of values and debug_exprs whose expansion hit recursion
7893 cycles. They will have VALUE_RECURSED_INTO marked when added to
7894 this list. This flag will be cleared if any of its dependencies
7895 resolves to a valid location. So, if the flag remains set at the
7896 end of the search, we know no valid location for this one can
7898 vec
<rtx
, va_stack
> pending
;
7900 /* The maximum depth among the sub-expressions under expansion.
7901 Zero indicates no expansion so far. */
7905 /* Allocate the one-part auxiliary data structure for VAR, with enough
7906 room for COUNT dependencies. */
7909 loc_exp_dep_alloc (variable var
, int count
)
7913 gcc_checking_assert (var
->onepart
);
7915 /* We can be called with COUNT == 0 to allocate the data structure
7916 without any dependencies, e.g. for the backlinks only. However,
7917 if we are specifying a COUNT, then the dependency list must have
7918 been emptied before. It would be possible to adjust pointers or
7919 force it empty here, but this is better done at an earlier point
7920 in the algorithm, so we instead leave an assertion to catch
7922 gcc_checking_assert (!count
7923 || VAR_LOC_DEP_VEC (var
) == NULL
7924 || VAR_LOC_DEP_VEC (var
)->is_empty ());
7926 if (VAR_LOC_1PAUX (var
) && VAR_LOC_DEP_VEC (var
)->space (count
))
7929 allocsize
= offsetof (struct onepart_aux
, deps
)
7930 + vec
<loc_exp_dep
, va_heap
, vl_embed
>::embedded_size (count
);
7932 if (VAR_LOC_1PAUX (var
))
7934 VAR_LOC_1PAUX (var
) = XRESIZEVAR (struct onepart_aux
,
7935 VAR_LOC_1PAUX (var
), allocsize
);
7936 /* If the reallocation moves the onepaux structure, the
7937 back-pointer to BACKLINKS in the first list member will still
7938 point to its old location. Adjust it. */
7939 if (VAR_LOC_DEP_LST (var
))
7940 VAR_LOC_DEP_LST (var
)->pprev
= VAR_LOC_DEP_LSTP (var
);
7944 VAR_LOC_1PAUX (var
) = XNEWVAR (struct onepart_aux
, allocsize
);
7945 *VAR_LOC_DEP_LSTP (var
) = NULL
;
7946 VAR_LOC_FROM (var
) = NULL
;
7947 VAR_LOC_DEPTH (var
).complexity
= 0;
7948 VAR_LOC_DEPTH (var
).entryvals
= 0;
7950 VAR_LOC_DEP_VEC (var
)->embedded_init (count
);
7953 /* Remove all entries from the vector of active dependencies of VAR,
7954 removing them from the back-links lists too. */
7957 loc_exp_dep_clear (variable var
)
7959 while (VAR_LOC_DEP_VEC (var
) && !VAR_LOC_DEP_VEC (var
)->is_empty ())
7961 loc_exp_dep
*led
= &VAR_LOC_DEP_VEC (var
)->last ();
7963 led
->next
->pprev
= led
->pprev
;
7965 *led
->pprev
= led
->next
;
7966 VAR_LOC_DEP_VEC (var
)->pop ();
7970 /* Insert an active dependency from VAR on X to the vector of
7971 dependencies, and add the corresponding back-link to X's list of
7972 back-links in VARS. */
7975 loc_exp_insert_dep (variable var
, rtx x
, htab_t vars
)
7981 dv
= dv_from_rtx (x
);
7983 /* ??? Build a vector of variables parallel to EXPANDING, to avoid
7984 an additional look up? */
7985 xvar
= (variable
) htab_find_with_hash (vars
, dv
, dv_htab_hash (dv
));
7989 xvar
= variable_from_dropped (dv
, NO_INSERT
);
7990 gcc_checking_assert (xvar
);
7993 /* No point in adding the same backlink more than once. This may
7994 arise if say the same value appears in two complex expressions in
7995 the same loc_list, or even more than once in a single
7997 if (VAR_LOC_DEP_LST (xvar
) && VAR_LOC_DEP_LST (xvar
)->dv
== var
->dv
)
8000 if (var
->onepart
== NOT_ONEPART
)
8001 led
= (loc_exp_dep
*) pool_alloc (loc_exp_dep_pool
);
8005 memset (&empty
, 0, sizeof (empty
));
8006 VAR_LOC_DEP_VEC (var
)->quick_push (empty
);
8007 led
= &VAR_LOC_DEP_VEC (var
)->last ();
8012 loc_exp_dep_alloc (xvar
, 0);
8013 led
->pprev
= VAR_LOC_DEP_LSTP (xvar
);
8014 led
->next
= *led
->pprev
;
8016 led
->next
->pprev
= &led
->next
;
8020 /* Create active dependencies of VAR on COUNT values starting at
8021 VALUE, and corresponding back-links to the entries in VARS. Return
8022 true if we found any pending-recursion results. */
8025 loc_exp_dep_set (variable var
, rtx result
, rtx
*value
, int count
, htab_t vars
)
8027 bool pending_recursion
= false;
8029 gcc_checking_assert (VAR_LOC_DEP_VEC (var
) == NULL
8030 || VAR_LOC_DEP_VEC (var
)->is_empty ());
8032 /* Set up all dependencies from last_child (as set up at the end of
8033 the loop above) to the end. */
8034 loc_exp_dep_alloc (var
, count
);
8040 if (!pending_recursion
)
8041 pending_recursion
= !result
&& VALUE_RECURSED_INTO (x
);
8043 loc_exp_insert_dep (var
, x
, vars
);
8046 return pending_recursion
;
8049 /* Notify the back-links of IVAR that are pending recursion that we
8050 have found a non-NIL value for it, so they are cleared for another
8051 attempt to compute a current location. */
8054 notify_dependents_of_resolved_value (variable ivar
, htab_t vars
)
8056 loc_exp_dep
*led
, *next
;
8058 for (led
= VAR_LOC_DEP_LST (ivar
); led
; led
= next
)
8060 decl_or_value dv
= led
->dv
;
8065 if (dv_is_value_p (dv
))
8067 rtx value
= dv_as_value (dv
);
8069 /* If we have already resolved it, leave it alone. */
8070 if (!VALUE_RECURSED_INTO (value
))
8073 /* Check that VALUE_RECURSED_INTO, true from the test above,
8074 implies NO_LOC_P. */
8075 gcc_checking_assert (NO_LOC_P (value
));
8077 /* We won't notify variables that are being expanded,
8078 because their dependency list is cleared before
8080 NO_LOC_P (value
) = false;
8081 VALUE_RECURSED_INTO (value
) = false;
8083 gcc_checking_assert (dv_changed_p (dv
));
8087 gcc_checking_assert (dv_onepart_p (dv
) != NOT_ONEPART
);
8088 if (!dv_changed_p (dv
))
8092 var
= (variable
) htab_find_with_hash (vars
, dv
, dv_htab_hash (dv
));
8095 var
= variable_from_dropped (dv
, NO_INSERT
);
8098 notify_dependents_of_resolved_value (var
, vars
);
8101 next
->pprev
= led
->pprev
;
8109 static rtx
vt_expand_loc_callback (rtx x
, bitmap regs
,
8110 int max_depth
, void *data
);
8112 /* Return the combined depth, when one sub-expression evaluated to
8113 BEST_DEPTH and the previous known depth was SAVED_DEPTH. */
8115 static inline expand_depth
8116 update_depth (expand_depth saved_depth
, expand_depth best_depth
)
8118 /* If we didn't find anything, stick with what we had. */
8119 if (!best_depth
.complexity
)
8122 /* If we found hadn't found anything, use the depth of the current
8123 expression. Do NOT add one extra level, we want to compute the
8124 maximum depth among sub-expressions. We'll increment it later,
8126 if (!saved_depth
.complexity
)
8129 /* Combine the entryval count so that regardless of which one we
8130 return, the entryval count is accurate. */
8131 best_depth
.entryvals
= saved_depth
.entryvals
8132 = best_depth
.entryvals
+ saved_depth
.entryvals
;
8134 if (saved_depth
.complexity
< best_depth
.complexity
)
8140 /* Expand VAR to a location RTX, updating its cur_loc. Use REGS and
8141 DATA for cselib expand callback. If PENDRECP is given, indicate in
8142 it whether any sub-expression couldn't be fully evaluated because
8143 it is pending recursion resolution. */
8146 vt_expand_var_loc_chain (variable var
, bitmap regs
, void *data
, bool *pendrecp
)
8148 struct expand_loc_callback_data
*elcd
8149 = (struct expand_loc_callback_data
*) data
;
8150 location_chain loc
, next
;
8152 int first_child
, result_first_child
, last_child
;
8153 bool pending_recursion
;
8154 rtx loc_from
= NULL
;
8155 struct elt_loc_list
*cloc
= NULL
;
8156 expand_depth depth
= { 0, 0 }, saved_depth
= elcd
->depth
;
8157 int wanted_entryvals
, found_entryvals
= 0;
8159 /* Clear all backlinks pointing at this, so that we're not notified
8160 while we're active. */
8161 loc_exp_dep_clear (var
);
8164 if (var
->onepart
== ONEPART_VALUE
)
8166 cselib_val
*val
= CSELIB_VAL_PTR (dv_as_value (var
->dv
));
8168 gcc_checking_assert (cselib_preserved_value_p (val
));
8173 first_child
= result_first_child
= last_child
8174 = elcd
->expanding
.length ();
8176 wanted_entryvals
= found_entryvals
;
8178 /* Attempt to expand each available location in turn. */
8179 for (next
= loc
= var
->n_var_parts
? var
->var_part
[0].loc_chain
: NULL
;
8180 loc
|| cloc
; loc
= next
)
8182 result_first_child
= last_child
;
8186 loc_from
= cloc
->loc
;
8189 if (unsuitable_loc (loc_from
))
8194 loc_from
= loc
->loc
;
8198 gcc_checking_assert (!unsuitable_loc (loc_from
));
8200 elcd
->depth
.complexity
= elcd
->depth
.entryvals
= 0;
8201 result
= cselib_expand_value_rtx_cb (loc_from
, regs
, EXPR_DEPTH
,
8202 vt_expand_loc_callback
, data
);
8203 last_child
= elcd
->expanding
.length ();
8207 depth
= elcd
->depth
;
8209 gcc_checking_assert (depth
.complexity
8210 || result_first_child
== last_child
);
8212 if (last_child
- result_first_child
!= 1)
8214 if (!depth
.complexity
&& GET_CODE (result
) == ENTRY_VALUE
)
8219 if (depth
.complexity
<= EXPR_USE_DEPTH
)
8221 if (depth
.entryvals
<= wanted_entryvals
)
8223 else if (!found_entryvals
|| depth
.entryvals
< found_entryvals
)
8224 found_entryvals
= depth
.entryvals
;
8230 /* Set it up in case we leave the loop. */
8231 depth
.complexity
= depth
.entryvals
= 0;
8233 result_first_child
= first_child
;
8236 if (!loc_from
&& wanted_entryvals
< found_entryvals
)
8238 /* We found entries with ENTRY_VALUEs and skipped them. Since
8239 we could not find any expansions without ENTRY_VALUEs, but we
8240 found at least one with them, go back and get an entry with
8241 the minimum number ENTRY_VALUE count that we found. We could
8242 avoid looping, but since each sub-loc is already resolved,
8243 the re-expansion should be trivial. ??? Should we record all
8244 attempted locs as dependencies, so that we retry the
8245 expansion should any of them change, in the hope it can give
8246 us a new entry without an ENTRY_VALUE? */
8247 elcd
->expanding
.truncate (first_child
);
8251 /* Register all encountered dependencies as active. */
8252 pending_recursion
= loc_exp_dep_set
8253 (var
, result
, elcd
->expanding
.address () + result_first_child
,
8254 last_child
- result_first_child
, elcd
->vars
);
8256 elcd
->expanding
.truncate (first_child
);
8258 /* Record where the expansion came from. */
8259 gcc_checking_assert (!result
|| !pending_recursion
);
8260 VAR_LOC_FROM (var
) = loc_from
;
8261 VAR_LOC_DEPTH (var
) = depth
;
8263 gcc_checking_assert (!depth
.complexity
== !result
);
8265 elcd
->depth
= update_depth (saved_depth
, depth
);
8267 /* Indicate whether any of the dependencies are pending recursion
8270 *pendrecp
= pending_recursion
;
8272 if (!pendrecp
|| !pending_recursion
)
8273 var
->var_part
[0].cur_loc
= result
;
8278 /* Callback for cselib_expand_value, that looks for expressions
8279 holding the value in the var-tracking hash tables. Return X for
8280 standard processing, anything else is to be used as-is. */
8283 vt_expand_loc_callback (rtx x
, bitmap regs
,
8284 int max_depth ATTRIBUTE_UNUSED
,
8287 struct expand_loc_callback_data
*elcd
8288 = (struct expand_loc_callback_data
*) data
;
8292 bool pending_recursion
= false;
8293 bool from_empty
= false;
8295 switch (GET_CODE (x
))
8298 subreg
= cselib_expand_value_rtx_cb (SUBREG_REG (x
), regs
,
8300 vt_expand_loc_callback
, data
);
8305 result
= simplify_gen_subreg (GET_MODE (x
), subreg
,
8306 GET_MODE (SUBREG_REG (x
)),
8309 /* Invalid SUBREGs are ok in debug info. ??? We could try
8310 alternate expansions for the VALUE as well. */
8312 result
= gen_rtx_raw_SUBREG (GET_MODE (x
), subreg
, SUBREG_BYTE (x
));
8318 dv
= dv_from_rtx (x
);
8325 elcd
->expanding
.safe_push (x
);
8327 /* Check that VALUE_RECURSED_INTO implies NO_LOC_P. */
8328 gcc_checking_assert (!VALUE_RECURSED_INTO (x
) || NO_LOC_P (x
));
8332 gcc_checking_assert (VALUE_RECURSED_INTO (x
) || !dv_changed_p (dv
));
8336 var
= (variable
) htab_find_with_hash (elcd
->vars
, dv
, dv_htab_hash (dv
));
8341 var
= variable_from_dropped (dv
, INSERT
);
8344 gcc_checking_assert (var
);
8346 if (!dv_changed_p (dv
))
8348 gcc_checking_assert (!NO_LOC_P (x
));
8349 gcc_checking_assert (var
->var_part
[0].cur_loc
);
8350 gcc_checking_assert (VAR_LOC_1PAUX (var
));
8351 gcc_checking_assert (VAR_LOC_1PAUX (var
)->depth
.complexity
);
8353 elcd
->depth
= update_depth (elcd
->depth
, VAR_LOC_1PAUX (var
)->depth
);
8355 return var
->var_part
[0].cur_loc
;
8358 VALUE_RECURSED_INTO (x
) = true;
8359 /* This is tentative, but it makes some tests simpler. */
8360 NO_LOC_P (x
) = true;
8362 gcc_checking_assert (var
->n_var_parts
== 1 || from_empty
);
8364 result
= vt_expand_var_loc_chain (var
, regs
, data
, &pending_recursion
);
8366 if (pending_recursion
)
8368 gcc_checking_assert (!result
);
8369 elcd
->pending
.safe_push (x
);
8373 NO_LOC_P (x
) = !result
;
8374 VALUE_RECURSED_INTO (x
) = false;
8375 set_dv_changed (dv
, false);
8378 notify_dependents_of_resolved_value (var
, elcd
->vars
);
8384 /* While expanding variables, we may encounter recursion cycles
8385 because of mutual (possibly indirect) dependencies between two
8386 particular variables (or values), say A and B. If we're trying to
8387 expand A when we get to B, which in turn attempts to expand A, if
8388 we can't find any other expansion for B, we'll add B to this
8389 pending-recursion stack, and tentatively return NULL for its
8390 location. This tentative value will be used for any other
8391 occurrences of B, unless A gets some other location, in which case
8392 it will notify B that it is worth another try at computing a
8393 location for it, and it will use the location computed for A then.
8394 At the end of the expansion, the tentative NULL locations become
8395 final for all members of PENDING that didn't get a notification.
8396 This function performs this finalization of NULL locations. */
8399 resolve_expansions_pending_recursion (vec
<rtx
, va_stack
> pending
)
8401 while (!pending
.is_empty ())
8403 rtx x
= pending
.pop ();
8406 if (!VALUE_RECURSED_INTO (x
))
8409 gcc_checking_assert (NO_LOC_P (x
));
8410 VALUE_RECURSED_INTO (x
) = false;
8411 dv
= dv_from_rtx (x
);
8412 gcc_checking_assert (dv_changed_p (dv
));
8413 set_dv_changed (dv
, false);
8417 /* Initialize expand_loc_callback_data D with variable hash table V.
8418 It must be a macro because of alloca (vec stack). */
8419 #define INIT_ELCD(d, v) \
8423 vec_stack_alloc (rtx, (d).expanding, 4); \
8424 vec_stack_alloc (rtx, (d).pending, 4); \
8425 (d).depth.complexity = (d).depth.entryvals = 0; \
8428 /* Finalize expand_loc_callback_data D, resolved to location L. */
8429 #define FINI_ELCD(d, l) \
8432 resolve_expansions_pending_recursion ((d).pending); \
8433 (d).pending.release (); \
8434 (d).expanding.release (); \
8436 if ((l) && MEM_P (l)) \
8437 (l) = targetm.delegitimize_address (l); \
8441 /* Expand VALUEs and DEBUG_EXPRs in LOC to a location, using the
8442 equivalences in VARS, updating their CUR_LOCs in the process. */
8445 vt_expand_loc (rtx loc
, htab_t vars
)
8447 struct expand_loc_callback_data data
;
8450 if (!MAY_HAVE_DEBUG_INSNS
)
8453 INIT_ELCD (data
, vars
);
8455 result
= cselib_expand_value_rtx_cb (loc
, scratch_regs
, EXPR_DEPTH
,
8456 vt_expand_loc_callback
, &data
);
8458 FINI_ELCD (data
, result
);
8463 /* Expand the one-part VARiable to a location, using the equivalences
8464 in VARS, updating their CUR_LOCs in the process. */
8467 vt_expand_1pvar (variable var
, htab_t vars
)
8469 struct expand_loc_callback_data data
;
8472 gcc_checking_assert (var
->onepart
&& var
->n_var_parts
== 1);
8474 if (!dv_changed_p (var
->dv
))
8475 return var
->var_part
[0].cur_loc
;
8477 INIT_ELCD (data
, vars
);
8479 loc
= vt_expand_var_loc_chain (var
, scratch_regs
, &data
, NULL
);
8481 gcc_checking_assert (data
.expanding
.is_empty ());
8483 FINI_ELCD (data
, loc
);
8488 /* Emit the NOTE_INSN_VAR_LOCATION for variable *VARP. DATA contains
8489 additional parameters: WHERE specifies whether the note shall be emitted
8490 before or after instruction INSN. */
8493 emit_note_insn_var_location (void **varp
, void *data
)
8495 variable var
= (variable
) *varp
;
8496 rtx insn
= ((emit_note_data
*)data
)->insn
;
8497 enum emit_note_where where
= ((emit_note_data
*)data
)->where
;
8498 htab_t vars
= ((emit_note_data
*)data
)->vars
;
8500 int i
, j
, n_var_parts
;
8502 enum var_init_status initialized
= VAR_INIT_STATUS_UNINITIALIZED
;
8503 HOST_WIDE_INT last_limit
;
8504 tree type_size_unit
;
8505 HOST_WIDE_INT offsets
[MAX_VAR_PARTS
];
8506 rtx loc
[MAX_VAR_PARTS
];
8510 gcc_checking_assert (var
->onepart
== NOT_ONEPART
8511 || var
->onepart
== ONEPART_VDECL
);
8513 decl
= dv_as_decl (var
->dv
);
8519 for (i
= 0; i
< var
->n_var_parts
; i
++)
8520 if (var
->var_part
[i
].cur_loc
== NULL
&& var
->var_part
[i
].loc_chain
)
8521 var
->var_part
[i
].cur_loc
= var
->var_part
[i
].loc_chain
->loc
;
8522 for (i
= 0; i
< var
->n_var_parts
; i
++)
8524 enum machine_mode mode
, wider_mode
;
8526 HOST_WIDE_INT offset
;
8528 if (i
== 0 && var
->onepart
)
8530 gcc_checking_assert (var
->n_var_parts
== 1);
8532 initialized
= VAR_INIT_STATUS_INITIALIZED
;
8533 loc2
= vt_expand_1pvar (var
, vars
);
8537 if (last_limit
< VAR_PART_OFFSET (var
, i
))
8542 else if (last_limit
> VAR_PART_OFFSET (var
, i
))
8544 offset
= VAR_PART_OFFSET (var
, i
);
8545 loc2
= var
->var_part
[i
].cur_loc
;
8546 if (loc2
&& GET_CODE (loc2
) == MEM
8547 && GET_CODE (XEXP (loc2
, 0)) == VALUE
)
8549 rtx depval
= XEXP (loc2
, 0);
8551 loc2
= vt_expand_loc (loc2
, vars
);
8554 loc_exp_insert_dep (var
, depval
, vars
);
8561 gcc_checking_assert (GET_CODE (loc2
) != VALUE
);
8562 for (lc
= var
->var_part
[i
].loc_chain
; lc
; lc
= lc
->next
)
8563 if (var
->var_part
[i
].cur_loc
== lc
->loc
)
8565 initialized
= lc
->init
;
8571 offsets
[n_var_parts
] = offset
;
8577 loc
[n_var_parts
] = loc2
;
8578 mode
= GET_MODE (var
->var_part
[i
].cur_loc
);
8579 if (mode
== VOIDmode
&& var
->onepart
)
8580 mode
= DECL_MODE (decl
);
8581 last_limit
= offsets
[n_var_parts
] + GET_MODE_SIZE (mode
);
8583 /* Attempt to merge adjacent registers or memory. */
8584 wider_mode
= GET_MODE_WIDER_MODE (mode
);
8585 for (j
= i
+ 1; j
< var
->n_var_parts
; j
++)
8586 if (last_limit
<= VAR_PART_OFFSET (var
, j
))
8588 if (j
< var
->n_var_parts
8589 && wider_mode
!= VOIDmode
8590 && var
->var_part
[j
].cur_loc
8591 && mode
== GET_MODE (var
->var_part
[j
].cur_loc
)
8592 && (REG_P (loc
[n_var_parts
]) || MEM_P (loc
[n_var_parts
]))
8593 && last_limit
== (var
->onepart
? 0 : VAR_PART_OFFSET (var
, j
))
8594 && (loc2
= vt_expand_loc (var
->var_part
[j
].cur_loc
, vars
))
8595 && GET_CODE (loc
[n_var_parts
]) == GET_CODE (loc2
))
8599 if (REG_P (loc
[n_var_parts
])
8600 && hard_regno_nregs
[REGNO (loc
[n_var_parts
])][mode
] * 2
8601 == hard_regno_nregs
[REGNO (loc
[n_var_parts
])][wider_mode
]
8602 && end_hard_regno (mode
, REGNO (loc
[n_var_parts
]))
8605 if (! WORDS_BIG_ENDIAN
&& ! BYTES_BIG_ENDIAN
)
8606 new_loc
= simplify_subreg (wider_mode
, loc
[n_var_parts
],
8608 else if (WORDS_BIG_ENDIAN
&& BYTES_BIG_ENDIAN
)
8609 new_loc
= simplify_subreg (wider_mode
, loc2
, mode
, 0);
8612 if (!REG_P (new_loc
)
8613 || REGNO (new_loc
) != REGNO (loc
[n_var_parts
]))
8616 REG_ATTRS (new_loc
) = REG_ATTRS (loc
[n_var_parts
]);
8619 else if (MEM_P (loc
[n_var_parts
])
8620 && GET_CODE (XEXP (loc2
, 0)) == PLUS
8621 && REG_P (XEXP (XEXP (loc2
, 0), 0))
8622 && CONST_INT_P (XEXP (XEXP (loc2
, 0), 1)))
8624 if ((REG_P (XEXP (loc
[n_var_parts
], 0))
8625 && rtx_equal_p (XEXP (loc
[n_var_parts
], 0),
8626 XEXP (XEXP (loc2
, 0), 0))
8627 && INTVAL (XEXP (XEXP (loc2
, 0), 1))
8628 == GET_MODE_SIZE (mode
))
8629 || (GET_CODE (XEXP (loc
[n_var_parts
], 0)) == PLUS
8630 && CONST_INT_P (XEXP (XEXP (loc
[n_var_parts
], 0), 1))
8631 && rtx_equal_p (XEXP (XEXP (loc
[n_var_parts
], 0), 0),
8632 XEXP (XEXP (loc2
, 0), 0))
8633 && INTVAL (XEXP (XEXP (loc
[n_var_parts
], 0), 1))
8634 + GET_MODE_SIZE (mode
)
8635 == INTVAL (XEXP (XEXP (loc2
, 0), 1))))
8636 new_loc
= adjust_address_nv (loc
[n_var_parts
],
8642 loc
[n_var_parts
] = new_loc
;
8644 last_limit
= offsets
[n_var_parts
] + GET_MODE_SIZE (mode
);
8650 type_size_unit
= TYPE_SIZE_UNIT (TREE_TYPE (decl
));
8651 if ((unsigned HOST_WIDE_INT
) last_limit
< TREE_INT_CST_LOW (type_size_unit
))
8654 if (! flag_var_tracking_uninit
)
8655 initialized
= VAR_INIT_STATUS_INITIALIZED
;
8659 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
, NULL_RTX
,
8661 else if (n_var_parts
== 1)
8665 if (offsets
[0] || GET_CODE (loc
[0]) == PARALLEL
)
8666 expr_list
= gen_rtx_EXPR_LIST (VOIDmode
, loc
[0], GEN_INT (offsets
[0]));
8670 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
, expr_list
,
8673 else if (n_var_parts
)
8677 for (i
= 0; i
< n_var_parts
; i
++)
8679 = gen_rtx_EXPR_LIST (VOIDmode
, loc
[i
], GEN_INT (offsets
[i
]));
8681 parallel
= gen_rtx_PARALLEL (VOIDmode
,
8682 gen_rtvec_v (n_var_parts
, loc
));
8683 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
,
8684 parallel
, (int) initialized
);
8687 if (where
!= EMIT_NOTE_BEFORE_INSN
)
8689 note
= emit_note_after (NOTE_INSN_VAR_LOCATION
, insn
);
8690 if (where
== EMIT_NOTE_AFTER_CALL_INSN
)
8691 NOTE_DURING_CALL_P (note
) = true;
8695 /* Make sure that the call related notes come first. */
8696 while (NEXT_INSN (insn
)
8698 && ((NOTE_KIND (insn
) == NOTE_INSN_VAR_LOCATION
8699 && NOTE_DURING_CALL_P (insn
))
8700 || NOTE_KIND (insn
) == NOTE_INSN_CALL_ARG_LOCATION
))
8701 insn
= NEXT_INSN (insn
);
8703 && ((NOTE_KIND (insn
) == NOTE_INSN_VAR_LOCATION
8704 && NOTE_DURING_CALL_P (insn
))
8705 || NOTE_KIND (insn
) == NOTE_INSN_CALL_ARG_LOCATION
))
8706 note
= emit_note_after (NOTE_INSN_VAR_LOCATION
, insn
);
8708 note
= emit_note_before (NOTE_INSN_VAR_LOCATION
, insn
);
8710 NOTE_VAR_LOCATION (note
) = note_vl
;
8712 set_dv_changed (var
->dv
, false);
8713 gcc_assert (var
->in_changed_variables
);
8714 var
->in_changed_variables
= false;
8715 htab_clear_slot (changed_variables
, varp
);
8717 /* Continue traversing the hash table. */
8721 /* While traversing changed_variables, push onto DATA (a stack of RTX
8722 values) entries that aren't user variables. */
8725 values_to_stack (void **slot
, void *data
)
8727 vec
<rtx
, va_stack
> *changed_values_stack
= (vec
<rtx
, va_stack
> *) data
;
8728 variable var
= (variable
) *slot
;
8730 if (var
->onepart
== ONEPART_VALUE
)
8731 changed_values_stack
->safe_push (dv_as_value (var
->dv
));
8732 else if (var
->onepart
== ONEPART_DEXPR
)
8733 changed_values_stack
->safe_push (DECL_RTL_KNOWN_SET (dv_as_decl (var
->dv
)));
8738 /* Remove from changed_variables the entry whose DV corresponds to
8739 value or debug_expr VAL. */
8741 remove_value_from_changed_variables (rtx val
)
8743 decl_or_value dv
= dv_from_rtx (val
);
8747 slot
= htab_find_slot_with_hash (changed_variables
,
8748 dv
, dv_htab_hash (dv
), NO_INSERT
);
8749 var
= (variable
) *slot
;
8750 var
->in_changed_variables
= false;
8751 htab_clear_slot (changed_variables
, slot
);
8754 /* If VAL (a value or debug_expr) has backlinks to variables actively
8755 dependent on it in HTAB or in CHANGED_VARIABLES, mark them as
8756 changed, adding to CHANGED_VALUES_STACK any dependencies that may
8757 have dependencies of their own to notify. */
8760 notify_dependents_of_changed_value (rtx val
, htab_t htab
,
8761 vec
<rtx
, va_stack
> *changed_values_stack
)
8766 decl_or_value dv
= dv_from_rtx (val
);
8768 slot
= htab_find_slot_with_hash (changed_variables
,
8769 dv
, dv_htab_hash (dv
), NO_INSERT
);
8771 slot
= htab_find_slot_with_hash (htab
,
8772 dv
, dv_htab_hash (dv
), NO_INSERT
);
8774 slot
= htab_find_slot_with_hash (dropped_values
,
8775 dv
, dv_htab_hash (dv
), NO_INSERT
);
8776 var
= (variable
) *slot
;
8778 while ((led
= VAR_LOC_DEP_LST (var
)))
8780 decl_or_value ldv
= led
->dv
;
8783 /* Deactivate and remove the backlink, as it was “used up”. It
8784 makes no sense to attempt to notify the same entity again:
8785 either it will be recomputed and re-register an active
8786 dependency, or it will still have the changed mark. */
8788 led
->next
->pprev
= led
->pprev
;
8790 *led
->pprev
= led
->next
;
8794 if (dv_changed_p (ldv
))
8797 switch (dv_onepart_p (ldv
))
8801 set_dv_changed (ldv
, true);
8802 changed_values_stack
->safe_push (dv_as_rtx (ldv
));
8806 ivar
= (variable
) htab_find_with_hash (htab
, ldv
, dv_htab_hash (ldv
));
8807 gcc_checking_assert (!VAR_LOC_DEP_LST (ivar
));
8808 variable_was_changed (ivar
, NULL
);
8812 pool_free (loc_exp_dep_pool
, led
);
8813 ivar
= (variable
) htab_find_with_hash (htab
, ldv
, dv_htab_hash (ldv
));
8816 int i
= ivar
->n_var_parts
;
8819 rtx loc
= ivar
->var_part
[i
].cur_loc
;
8821 if (loc
&& GET_CODE (loc
) == MEM
8822 && XEXP (loc
, 0) == val
)
8824 variable_was_changed (ivar
, NULL
);
8837 /* Take out of changed_variables any entries that don't refer to use
8838 variables. Back-propagate change notifications from values and
8839 debug_exprs to their active dependencies in HTAB or in
8840 CHANGED_VARIABLES. */
8843 process_changed_values (htab_t htab
)
8847 vec
<rtx
, va_stack
> changed_values_stack
;
8849 vec_stack_alloc (rtx
, changed_values_stack
, 20);
8851 /* Move values from changed_variables to changed_values_stack. */
8852 htab_traverse (changed_variables
, values_to_stack
, &changed_values_stack
);
8854 /* Back-propagate change notifications in values while popping
8855 them from the stack. */
8856 for (n
= i
= changed_values_stack
.length ();
8857 i
> 0; i
= changed_values_stack
.length ())
8859 val
= changed_values_stack
.pop ();
8860 notify_dependents_of_changed_value (val
, htab
, &changed_values_stack
);
8862 /* This condition will hold when visiting each of the entries
8863 originally in changed_variables. We can't remove them
8864 earlier because this could drop the backlinks before we got a
8865 chance to use them. */
8868 remove_value_from_changed_variables (val
);
8873 changed_values_stack
.release ();
8876 /* Emit NOTE_INSN_VAR_LOCATION note for each variable from a chain
8877 CHANGED_VARIABLES and delete this chain. WHERE specifies whether
8878 the notes shall be emitted before of after instruction INSN. */
8881 emit_notes_for_changes (rtx insn
, enum emit_note_where where
,
8884 emit_note_data data
;
8885 htab_t htab
= shared_hash_htab (vars
);
8887 if (!htab_elements (changed_variables
))
8890 if (MAY_HAVE_DEBUG_INSNS
)
8891 process_changed_values (htab
);
8897 htab_traverse (changed_variables
, emit_note_insn_var_location
, &data
);
8900 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it differs from the
8901 same variable in hash table DATA or is not there at all. */
8904 emit_notes_for_differences_1 (void **slot
, void *data
)
8906 htab_t new_vars
= (htab_t
) data
;
8907 variable old_var
, new_var
;
8909 old_var
= (variable
) *slot
;
8910 new_var
= (variable
) htab_find_with_hash (new_vars
, old_var
->dv
,
8911 dv_htab_hash (old_var
->dv
));
8915 /* Variable has disappeared. */
8916 variable empty_var
= NULL
;
8918 if (old_var
->onepart
== ONEPART_VALUE
8919 || old_var
->onepart
== ONEPART_DEXPR
)
8921 empty_var
= variable_from_dropped (old_var
->dv
, NO_INSERT
);
8924 gcc_checking_assert (!empty_var
->in_changed_variables
);
8925 if (!VAR_LOC_1PAUX (old_var
))
8927 VAR_LOC_1PAUX (old_var
) = VAR_LOC_1PAUX (empty_var
);
8928 VAR_LOC_1PAUX (empty_var
) = NULL
;
8931 gcc_checking_assert (!VAR_LOC_1PAUX (empty_var
));
8937 empty_var
= (variable
) pool_alloc (onepart_pool (old_var
->onepart
));
8938 empty_var
->dv
= old_var
->dv
;
8939 empty_var
->refcount
= 0;
8940 empty_var
->n_var_parts
= 0;
8941 empty_var
->onepart
= old_var
->onepart
;
8942 empty_var
->in_changed_variables
= false;
8945 if (empty_var
->onepart
)
8947 /* Propagate the auxiliary data to (ultimately)
8948 changed_variables. */
8949 empty_var
->var_part
[0].loc_chain
= NULL
;
8950 empty_var
->var_part
[0].cur_loc
= NULL
;
8951 VAR_LOC_1PAUX (empty_var
) = VAR_LOC_1PAUX (old_var
);
8952 VAR_LOC_1PAUX (old_var
) = NULL
;
8954 variable_was_changed (empty_var
, NULL
);
8955 /* Continue traversing the hash table. */
8958 /* Update cur_loc and one-part auxiliary data, before new_var goes
8959 through variable_was_changed. */
8960 if (old_var
!= new_var
&& new_var
->onepart
)
8962 gcc_checking_assert (VAR_LOC_1PAUX (new_var
) == NULL
);
8963 VAR_LOC_1PAUX (new_var
) = VAR_LOC_1PAUX (old_var
);
8964 VAR_LOC_1PAUX (old_var
) = NULL
;
8965 new_var
->var_part
[0].cur_loc
= old_var
->var_part
[0].cur_loc
;
8967 if (variable_different_p (old_var
, new_var
))
8968 variable_was_changed (new_var
, NULL
);
8970 /* Continue traversing the hash table. */
8974 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it is not in hash
8978 emit_notes_for_differences_2 (void **slot
, void *data
)
8980 htab_t old_vars
= (htab_t
) data
;
8981 variable old_var
, new_var
;
8983 new_var
= (variable
) *slot
;
8984 old_var
= (variable
) htab_find_with_hash (old_vars
, new_var
->dv
,
8985 dv_htab_hash (new_var
->dv
));
8989 for (i
= 0; i
< new_var
->n_var_parts
; i
++)
8990 new_var
->var_part
[i
].cur_loc
= NULL
;
8991 variable_was_changed (new_var
, NULL
);
8994 /* Continue traversing the hash table. */
8998 /* Emit notes before INSN for differences between dataflow sets OLD_SET and
9002 emit_notes_for_differences (rtx insn
, dataflow_set
*old_set
,
9003 dataflow_set
*new_set
)
9005 htab_traverse (shared_hash_htab (old_set
->vars
),
9006 emit_notes_for_differences_1
,
9007 shared_hash_htab (new_set
->vars
));
9008 htab_traverse (shared_hash_htab (new_set
->vars
),
9009 emit_notes_for_differences_2
,
9010 shared_hash_htab (old_set
->vars
));
9011 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
, new_set
->vars
);
9014 /* Return the next insn after INSN that is not a NOTE_INSN_VAR_LOCATION. */
9017 next_non_note_insn_var_location (rtx insn
)
9021 insn
= NEXT_INSN (insn
);
9024 || NOTE_KIND (insn
) != NOTE_INSN_VAR_LOCATION
)
9031 /* Emit the notes for changes of location parts in the basic block BB. */
9034 emit_notes_in_bb (basic_block bb
, dataflow_set
*set
)
9037 micro_operation
*mo
;
9039 dataflow_set_clear (set
);
9040 dataflow_set_copy (set
, &VTI (bb
)->in
);
9042 FOR_EACH_VEC_ELT (VTI (bb
)->mos
, i
, mo
)
9044 rtx insn
= mo
->insn
;
9045 rtx next_insn
= next_non_note_insn_var_location (insn
);
9050 dataflow_set_clear_at_call (set
);
9051 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_CALL_INSN
, set
->vars
);
9053 rtx arguments
= mo
->u
.loc
, *p
= &arguments
, note
;
9056 XEXP (XEXP (*p
, 0), 1)
9057 = vt_expand_loc (XEXP (XEXP (*p
, 0), 1),
9058 shared_hash_htab (set
->vars
));
9059 /* If expansion is successful, keep it in the list. */
9060 if (XEXP (XEXP (*p
, 0), 1))
9062 /* Otherwise, if the following item is data_value for it,
9064 else if (XEXP (*p
, 1)
9065 && REG_P (XEXP (XEXP (*p
, 0), 0))
9066 && MEM_P (XEXP (XEXP (XEXP (*p
, 1), 0), 0))
9067 && REG_P (XEXP (XEXP (XEXP (XEXP (*p
, 1), 0), 0),
9069 && REGNO (XEXP (XEXP (*p
, 0), 0))
9070 == REGNO (XEXP (XEXP (XEXP (XEXP (*p
, 1), 0),
9072 *p
= XEXP (XEXP (*p
, 1), 1);
9073 /* Just drop this item. */
9077 note
= emit_note_after (NOTE_INSN_CALL_ARG_LOCATION
, insn
);
9078 NOTE_VAR_LOCATION (note
) = arguments
;
9084 rtx loc
= mo
->u
.loc
;
9087 var_reg_set (set
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
9089 var_mem_set (set
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
9091 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
9097 rtx loc
= mo
->u
.loc
;
9101 if (GET_CODE (loc
) == CONCAT
)
9103 val
= XEXP (loc
, 0);
9104 vloc
= XEXP (loc
, 1);
9112 var
= PAT_VAR_LOCATION_DECL (vloc
);
9114 clobber_variable_part (set
, NULL_RTX
,
9115 dv_from_decl (var
), 0, NULL_RTX
);
9118 if (VAL_NEEDS_RESOLUTION (loc
))
9119 val_resolve (set
, val
, PAT_VAR_LOCATION_LOC (vloc
), insn
);
9120 set_variable_part (set
, val
, dv_from_decl (var
), 0,
9121 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
9124 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc
)))
9125 set_variable_part (set
, PAT_VAR_LOCATION_LOC (vloc
),
9126 dv_from_decl (var
), 0,
9127 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
9130 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
9136 rtx loc
= mo
->u
.loc
;
9137 rtx val
, vloc
, uloc
;
9139 vloc
= uloc
= XEXP (loc
, 1);
9140 val
= XEXP (loc
, 0);
9142 if (GET_CODE (val
) == CONCAT
)
9144 uloc
= XEXP (val
, 1);
9145 val
= XEXP (val
, 0);
9148 if (VAL_NEEDS_RESOLUTION (loc
))
9149 val_resolve (set
, val
, vloc
, insn
);
9151 val_store (set
, val
, uloc
, insn
, false);
9153 if (VAL_HOLDS_TRACK_EXPR (loc
))
9155 if (GET_CODE (uloc
) == REG
)
9156 var_reg_set (set
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
9158 else if (GET_CODE (uloc
) == MEM
)
9159 var_mem_set (set
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
9163 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
, set
->vars
);
9169 rtx loc
= mo
->u
.loc
;
9170 rtx val
, vloc
, uloc
;
9174 uloc
= XEXP (vloc
, 1);
9175 val
= XEXP (vloc
, 0);
9178 if (GET_CODE (uloc
) == SET
)
9180 dstv
= SET_DEST (uloc
);
9181 srcv
= SET_SRC (uloc
);
9189 if (GET_CODE (val
) == CONCAT
)
9191 dstv
= vloc
= XEXP (val
, 1);
9192 val
= XEXP (val
, 0);
9195 if (GET_CODE (vloc
) == SET
)
9197 srcv
= SET_SRC (vloc
);
9199 gcc_assert (val
!= srcv
);
9200 gcc_assert (vloc
== uloc
|| VAL_NEEDS_RESOLUTION (loc
));
9202 dstv
= vloc
= SET_DEST (vloc
);
9204 if (VAL_NEEDS_RESOLUTION (loc
))
9205 val_resolve (set
, val
, srcv
, insn
);
9207 else if (VAL_NEEDS_RESOLUTION (loc
))
9209 gcc_assert (GET_CODE (uloc
) == SET
9210 && GET_CODE (SET_SRC (uloc
)) == REG
);
9211 val_resolve (set
, val
, SET_SRC (uloc
), insn
);
9214 if (VAL_HOLDS_TRACK_EXPR (loc
))
9216 if (VAL_EXPR_IS_CLOBBERED (loc
))
9219 var_reg_delete (set
, uloc
, true);
9220 else if (MEM_P (uloc
))
9222 gcc_assert (MEM_P (dstv
));
9223 gcc_assert (MEM_ATTRS (dstv
) == MEM_ATTRS (uloc
));
9224 var_mem_delete (set
, dstv
, true);
9229 bool copied_p
= VAL_EXPR_IS_COPIED (loc
);
9230 rtx src
= NULL
, dst
= uloc
;
9231 enum var_init_status status
= VAR_INIT_STATUS_INITIALIZED
;
9233 if (GET_CODE (uloc
) == SET
)
9235 src
= SET_SRC (uloc
);
9236 dst
= SET_DEST (uloc
);
9241 status
= find_src_status (set
, src
);
9243 src
= find_src_set_src (set
, src
);
9247 var_reg_delete_and_set (set
, dst
, !copied_p
,
9249 else if (MEM_P (dst
))
9251 gcc_assert (MEM_P (dstv
));
9252 gcc_assert (MEM_ATTRS (dstv
) == MEM_ATTRS (dst
));
9253 var_mem_delete_and_set (set
, dstv
, !copied_p
,
9258 else if (REG_P (uloc
))
9259 var_regno_delete (set
, REGNO (uloc
));
9260 else if (MEM_P (uloc
))
9262 gcc_checking_assert (GET_CODE (vloc
) == MEM
);
9263 gcc_checking_assert (vloc
== dstv
);
9265 clobber_overlapping_mems (set
, vloc
);
9268 val_store (set
, val
, dstv
, insn
, true);
9270 emit_notes_for_changes (next_insn
, EMIT_NOTE_BEFORE_INSN
,
9277 rtx loc
= mo
->u
.loc
;
9280 if (GET_CODE (loc
) == SET
)
9282 set_src
= SET_SRC (loc
);
9283 loc
= SET_DEST (loc
);
9287 var_reg_delete_and_set (set
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
9290 var_mem_delete_and_set (set
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
9293 emit_notes_for_changes (next_insn
, EMIT_NOTE_BEFORE_INSN
,
9300 rtx loc
= mo
->u
.loc
;
9301 enum var_init_status src_status
;
9304 if (GET_CODE (loc
) == SET
)
9306 set_src
= SET_SRC (loc
);
9307 loc
= SET_DEST (loc
);
9310 src_status
= find_src_status (set
, set_src
);
9311 set_src
= find_src_set_src (set
, set_src
);
9314 var_reg_delete_and_set (set
, loc
, false, src_status
, set_src
);
9316 var_mem_delete_and_set (set
, loc
, false, src_status
, set_src
);
9318 emit_notes_for_changes (next_insn
, EMIT_NOTE_BEFORE_INSN
,
9325 rtx loc
= mo
->u
.loc
;
9328 var_reg_delete (set
, loc
, false);
9330 var_mem_delete (set
, loc
, false);
9332 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
9338 rtx loc
= mo
->u
.loc
;
9341 var_reg_delete (set
, loc
, true);
9343 var_mem_delete (set
, loc
, true);
9345 emit_notes_for_changes (next_insn
, EMIT_NOTE_BEFORE_INSN
,
9351 set
->stack_adjust
+= mo
->u
.adjust
;
9357 /* Emit notes for the whole function. */
9360 vt_emit_notes (void)
9365 gcc_assert (!htab_elements (changed_variables
));
9367 /* Free memory occupied by the out hash tables, as they aren't used
9370 dataflow_set_clear (&VTI (bb
)->out
);
9372 /* Enable emitting notes by functions (mainly by set_variable_part and
9373 delete_variable_part). */
9376 if (MAY_HAVE_DEBUG_INSNS
)
9378 dropped_values
= htab_create (cselib_get_next_uid () * 2,
9379 variable_htab_hash
, variable_htab_eq
,
9380 variable_htab_free
);
9381 loc_exp_dep_pool
= create_alloc_pool ("loc_exp_dep pool",
9382 sizeof (loc_exp_dep
), 64);
9385 dataflow_set_init (&cur
);
9389 /* Emit the notes for changes of variable locations between two
9390 subsequent basic blocks. */
9391 emit_notes_for_differences (BB_HEAD (bb
), &cur
, &VTI (bb
)->in
);
9393 if (MAY_HAVE_DEBUG_INSNS
)
9394 local_get_addr_cache
= pointer_map_create ();
9396 /* Emit the notes for the changes in the basic block itself. */
9397 emit_notes_in_bb (bb
, &cur
);
9399 if (MAY_HAVE_DEBUG_INSNS
)
9400 pointer_map_destroy (local_get_addr_cache
);
9401 local_get_addr_cache
= NULL
;
9403 /* Free memory occupied by the in hash table, we won't need it
9405 dataflow_set_clear (&VTI (bb
)->in
);
9407 #ifdef ENABLE_CHECKING
9408 htab_traverse (shared_hash_htab (cur
.vars
),
9409 emit_notes_for_differences_1
,
9410 shared_hash_htab (empty_shared_hash
));
9412 dataflow_set_destroy (&cur
);
9414 if (MAY_HAVE_DEBUG_INSNS
)
9415 htab_delete (dropped_values
);
9420 /* If there is a declaration and offset associated with register/memory RTL
9421 assign declaration to *DECLP and offset to *OFFSETP, and return true. */
9424 vt_get_decl_and_offset (rtx rtl
, tree
*declp
, HOST_WIDE_INT
*offsetp
)
9428 if (REG_ATTRS (rtl
))
9430 *declp
= REG_EXPR (rtl
);
9431 *offsetp
= REG_OFFSET (rtl
);
9435 else if (MEM_P (rtl
))
9437 if (MEM_ATTRS (rtl
))
9439 *declp
= MEM_EXPR (rtl
);
9440 *offsetp
= INT_MEM_OFFSET (rtl
);
9447 /* Record the value for the ENTRY_VALUE of RTL as a global equivalence
9451 record_entry_value (cselib_val
*val
, rtx rtl
)
9453 rtx ev
= gen_rtx_ENTRY_VALUE (GET_MODE (rtl
));
9455 ENTRY_VALUE_EXP (ev
) = rtl
;
9457 cselib_add_permanent_equiv (val
, ev
, get_insns ());
9460 /* Insert function parameter PARM in IN and OUT sets of ENTRY_BLOCK. */
9463 vt_add_function_parameter (tree parm
)
9465 rtx decl_rtl
= DECL_RTL_IF_SET (parm
);
9466 rtx incoming
= DECL_INCOMING_RTL (parm
);
9468 enum machine_mode mode
;
9469 HOST_WIDE_INT offset
;
9473 if (TREE_CODE (parm
) != PARM_DECL
)
9476 if (!decl_rtl
|| !incoming
)
9479 if (GET_MODE (decl_rtl
) == BLKmode
|| GET_MODE (incoming
) == BLKmode
)
9482 /* If there is a DRAP register or a pseudo in internal_arg_pointer,
9483 rewrite the incoming location of parameters passed on the stack
9484 into MEMs based on the argument pointer, so that incoming doesn't
9485 depend on a pseudo. */
9486 if (MEM_P (incoming
)
9487 && (XEXP (incoming
, 0) == crtl
->args
.internal_arg_pointer
9488 || (GET_CODE (XEXP (incoming
, 0)) == PLUS
9489 && XEXP (XEXP (incoming
, 0), 0)
9490 == crtl
->args
.internal_arg_pointer
9491 && CONST_INT_P (XEXP (XEXP (incoming
, 0), 1)))))
9493 HOST_WIDE_INT off
= -FIRST_PARM_OFFSET (current_function_decl
);
9494 if (GET_CODE (XEXP (incoming
, 0)) == PLUS
)
9495 off
+= INTVAL (XEXP (XEXP (incoming
, 0), 1));
9497 = replace_equiv_address_nv (incoming
,
9498 plus_constant (Pmode
,
9499 arg_pointer_rtx
, off
));
9502 #ifdef HAVE_window_save
9503 /* DECL_INCOMING_RTL uses the INCOMING_REGNO of parameter registers.
9504 If the target machine has an explicit window save instruction, the
9505 actual entry value is the corresponding OUTGOING_REGNO instead. */
9506 if (HAVE_window_save
&& !crtl
->uses_only_leaf_regs
)
9508 if (REG_P (incoming
)
9509 && HARD_REGISTER_P (incoming
)
9510 && OUTGOING_REGNO (REGNO (incoming
)) != REGNO (incoming
))
9513 p
.incoming
= incoming
;
9515 = gen_rtx_REG_offset (incoming
, GET_MODE (incoming
),
9516 OUTGOING_REGNO (REGNO (incoming
)), 0);
9517 p
.outgoing
= incoming
;
9518 vec_safe_push (windowed_parm_regs
, p
);
9520 else if (MEM_P (incoming
)
9521 && REG_P (XEXP (incoming
, 0))
9522 && HARD_REGISTER_P (XEXP (incoming
, 0)))
9524 rtx reg
= XEXP (incoming
, 0);
9525 if (OUTGOING_REGNO (REGNO (reg
)) != REGNO (reg
))
9529 reg
= gen_raw_REG (GET_MODE (reg
), OUTGOING_REGNO (REGNO (reg
)));
9531 vec_safe_push (windowed_parm_regs
, p
);
9532 incoming
= replace_equiv_address_nv (incoming
, reg
);
9538 if (!vt_get_decl_and_offset (incoming
, &decl
, &offset
))
9540 if (REG_P (incoming
) || MEM_P (incoming
))
9542 /* This means argument is passed by invisible reference. */
9545 incoming
= gen_rtx_MEM (GET_MODE (decl_rtl
), incoming
);
9549 if (!vt_get_decl_and_offset (decl_rtl
, &decl
, &offset
))
9551 offset
+= byte_lowpart_offset (GET_MODE (incoming
),
9552 GET_MODE (decl_rtl
));
9561 /* If that DECL_RTL wasn't a pseudo that got spilled to
9562 memory, bail out. Otherwise, the spill slot sharing code
9563 will force the memory to reference spill_slot_decl (%sfp),
9564 so we don't match above. That's ok, the pseudo must have
9565 referenced the entire parameter, so just reset OFFSET. */
9566 if (decl
!= get_spill_slot_decl (false))
9571 if (!track_loc_p (incoming
, parm
, offset
, false, &mode
, &offset
))
9574 out
= &VTI (ENTRY_BLOCK_PTR
)->out
;
9576 dv
= dv_from_decl (parm
);
9578 if (target_for_debug_bind (parm
)
9579 /* We can't deal with these right now, because this kind of
9580 variable is single-part. ??? We could handle parallels
9581 that describe multiple locations for the same single
9582 value, but ATM we don't. */
9583 && GET_CODE (incoming
) != PARALLEL
)
9588 /* ??? We shouldn't ever hit this, but it may happen because
9589 arguments passed by invisible reference aren't dealt with
9590 above: incoming-rtl will have Pmode rather than the
9591 expected mode for the type. */
9595 lowpart
= var_lowpart (mode
, incoming
);
9599 val
= cselib_lookup_from_insn (lowpart
, mode
, true,
9600 VOIDmode
, get_insns ());
9602 /* ??? Float-typed values in memory are not handled by
9606 preserve_value (val
);
9607 set_variable_part (out
, val
->val_rtx
, dv
, offset
,
9608 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9609 dv
= dv_from_value (val
->val_rtx
);
9612 if (MEM_P (incoming
))
9614 val
= cselib_lookup_from_insn (XEXP (incoming
, 0), mode
, true,
9615 VOIDmode
, get_insns ());
9618 preserve_value (val
);
9619 incoming
= replace_equiv_address_nv (incoming
, val
->val_rtx
);
9624 if (REG_P (incoming
))
9626 incoming
= var_lowpart (mode
, incoming
);
9627 gcc_assert (REGNO (incoming
) < FIRST_PSEUDO_REGISTER
);
9628 attrs_list_insert (&out
->regs
[REGNO (incoming
)], dv
, offset
,
9630 set_variable_part (out
, incoming
, dv
, offset
,
9631 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9632 if (dv_is_value_p (dv
))
9634 record_entry_value (CSELIB_VAL_PTR (dv_as_value (dv
)), incoming
);
9635 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
9636 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (parm
))))
9638 enum machine_mode indmode
9639 = TYPE_MODE (TREE_TYPE (TREE_TYPE (parm
)));
9640 rtx mem
= gen_rtx_MEM (indmode
, incoming
);
9641 cselib_val
*val
= cselib_lookup_from_insn (mem
, indmode
, true,
9646 preserve_value (val
);
9647 record_entry_value (val
, mem
);
9648 set_variable_part (out
, mem
, dv_from_value (val
->val_rtx
), 0,
9649 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9654 else if (MEM_P (incoming
))
9656 incoming
= var_lowpart (mode
, incoming
);
9657 set_variable_part (out
, incoming
, dv
, offset
,
9658 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9662 /* Insert function parameters to IN and OUT sets of ENTRY_BLOCK. */
9665 vt_add_function_parameters (void)
9669 for (parm
= DECL_ARGUMENTS (current_function_decl
);
9670 parm
; parm
= DECL_CHAIN (parm
))
9671 vt_add_function_parameter (parm
);
9673 if (DECL_HAS_VALUE_EXPR_P (DECL_RESULT (current_function_decl
)))
9675 tree vexpr
= DECL_VALUE_EXPR (DECL_RESULT (current_function_decl
));
9677 if (TREE_CODE (vexpr
) == INDIRECT_REF
)
9678 vexpr
= TREE_OPERAND (vexpr
, 0);
9680 if (TREE_CODE (vexpr
) == PARM_DECL
9681 && DECL_ARTIFICIAL (vexpr
)
9682 && !DECL_IGNORED_P (vexpr
)
9683 && DECL_NAMELESS (vexpr
))
9684 vt_add_function_parameter (vexpr
);
9688 /* Initialize cfa_base_rtx, create a preserved VALUE for it and
9689 ensure it isn't flushed during cselib_reset_table.
9690 Can be called only if frame_pointer_rtx resp. arg_pointer_rtx
9691 has been eliminated. */
9694 vt_init_cfa_base (void)
9698 #ifdef FRAME_POINTER_CFA_OFFSET
9699 cfa_base_rtx
= frame_pointer_rtx
;
9700 cfa_base_offset
= -FRAME_POINTER_CFA_OFFSET (current_function_decl
);
9702 cfa_base_rtx
= arg_pointer_rtx
;
9703 cfa_base_offset
= -ARG_POINTER_CFA_OFFSET (current_function_decl
);
9705 if (cfa_base_rtx
== hard_frame_pointer_rtx
9706 || !fixed_regs
[REGNO (cfa_base_rtx
)])
9708 cfa_base_rtx
= NULL_RTX
;
9711 if (!MAY_HAVE_DEBUG_INSNS
)
9714 /* Tell alias analysis that cfa_base_rtx should share
9715 find_base_term value with stack pointer or hard frame pointer. */
9716 if (!frame_pointer_needed
)
9717 vt_equate_reg_base_value (cfa_base_rtx
, stack_pointer_rtx
);
9718 else if (!crtl
->stack_realign_tried
)
9719 vt_equate_reg_base_value (cfa_base_rtx
, hard_frame_pointer_rtx
);
9721 val
= cselib_lookup_from_insn (cfa_base_rtx
, GET_MODE (cfa_base_rtx
), 1,
9722 VOIDmode
, get_insns ());
9723 preserve_value (val
);
9724 cselib_preserve_cfa_base_value (val
, REGNO (cfa_base_rtx
));
9727 /* Allocate and initialize the data structures for variable tracking
9728 and parse the RTL to get the micro operations. */
9731 vt_initialize (void)
9734 HOST_WIDE_INT fp_cfa_offset
= -1;
9736 alloc_aux_for_blocks (sizeof (struct variable_tracking_info_def
));
9738 attrs_pool
= create_alloc_pool ("attrs_def pool",
9739 sizeof (struct attrs_def
), 1024);
9740 var_pool
= create_alloc_pool ("variable_def pool",
9741 sizeof (struct variable_def
)
9742 + (MAX_VAR_PARTS
- 1)
9743 * sizeof (((variable
)NULL
)->var_part
[0]), 64);
9744 loc_chain_pool
= create_alloc_pool ("location_chain_def pool",
9745 sizeof (struct location_chain_def
),
9747 shared_hash_pool
= create_alloc_pool ("shared_hash_def pool",
9748 sizeof (struct shared_hash_def
), 256);
9749 empty_shared_hash
= (shared_hash
) pool_alloc (shared_hash_pool
);
9750 empty_shared_hash
->refcount
= 1;
9751 empty_shared_hash
->htab
9752 = htab_create (1, variable_htab_hash
, variable_htab_eq
,
9753 variable_htab_free
);
9754 changed_variables
= htab_create (10, variable_htab_hash
, variable_htab_eq
,
9755 variable_htab_free
);
9757 /* Init the IN and OUT sets. */
9760 VTI (bb
)->visited
= false;
9761 VTI (bb
)->flooded
= false;
9762 dataflow_set_init (&VTI (bb
)->in
);
9763 dataflow_set_init (&VTI (bb
)->out
);
9764 VTI (bb
)->permp
= NULL
;
9767 if (MAY_HAVE_DEBUG_INSNS
)
9769 cselib_init (CSELIB_RECORD_MEMORY
| CSELIB_PRESERVE_CONSTANTS
);
9770 scratch_regs
= BITMAP_ALLOC (NULL
);
9771 valvar_pool
= create_alloc_pool ("small variable_def pool",
9772 sizeof (struct variable_def
), 256);
9773 preserved_values
.create (256);
9774 global_get_addr_cache
= pointer_map_create ();
9778 scratch_regs
= NULL
;
9780 global_get_addr_cache
= NULL
;
9783 if (MAY_HAVE_DEBUG_INSNS
)
9789 #ifdef FRAME_POINTER_CFA_OFFSET
9790 reg
= frame_pointer_rtx
;
9791 ofst
= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
9793 reg
= arg_pointer_rtx
;
9794 ofst
= ARG_POINTER_CFA_OFFSET (current_function_decl
);
9797 ofst
-= INCOMING_FRAME_SP_OFFSET
;
9799 val
= cselib_lookup_from_insn (reg
, GET_MODE (reg
), 1,
9800 VOIDmode
, get_insns ());
9801 preserve_value (val
);
9802 cselib_preserve_cfa_base_value (val
, REGNO (reg
));
9803 expr
= plus_constant (GET_MODE (stack_pointer_rtx
),
9804 stack_pointer_rtx
, -ofst
);
9805 cselib_add_permanent_equiv (val
, expr
, get_insns ());
9809 val
= cselib_lookup_from_insn (stack_pointer_rtx
,
9810 GET_MODE (stack_pointer_rtx
), 1,
9811 VOIDmode
, get_insns ());
9812 preserve_value (val
);
9813 expr
= plus_constant (GET_MODE (reg
), reg
, ofst
);
9814 cselib_add_permanent_equiv (val
, expr
, get_insns ());
9818 /* In order to factor out the adjustments made to the stack pointer or to
9819 the hard frame pointer and thus be able to use DW_OP_fbreg operations
9820 instead of individual location lists, we're going to rewrite MEMs based
9821 on them into MEMs based on the CFA by de-eliminating stack_pointer_rtx
9822 or hard_frame_pointer_rtx to the virtual CFA pointer frame_pointer_rtx
9823 resp. arg_pointer_rtx. We can do this either when there is no frame
9824 pointer in the function and stack adjustments are consistent for all
9825 basic blocks or when there is a frame pointer and no stack realignment.
9826 But we first have to check that frame_pointer_rtx resp. arg_pointer_rtx
9827 has been eliminated. */
9828 if (!frame_pointer_needed
)
9832 if (!vt_stack_adjustments ())
9835 #ifdef FRAME_POINTER_CFA_OFFSET
9836 reg
= frame_pointer_rtx
;
9838 reg
= arg_pointer_rtx
;
9840 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
9843 if (GET_CODE (elim
) == PLUS
)
9844 elim
= XEXP (elim
, 0);
9845 if (elim
== stack_pointer_rtx
)
9846 vt_init_cfa_base ();
9849 else if (!crtl
->stack_realign_tried
)
9853 #ifdef FRAME_POINTER_CFA_OFFSET
9854 reg
= frame_pointer_rtx
;
9855 fp_cfa_offset
= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
9857 reg
= arg_pointer_rtx
;
9858 fp_cfa_offset
= ARG_POINTER_CFA_OFFSET (current_function_decl
);
9860 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
9863 if (GET_CODE (elim
) == PLUS
)
9865 fp_cfa_offset
-= INTVAL (XEXP (elim
, 1));
9866 elim
= XEXP (elim
, 0);
9868 if (elim
!= hard_frame_pointer_rtx
)
9875 /* If the stack is realigned and a DRAP register is used, we're going to
9876 rewrite MEMs based on it representing incoming locations of parameters
9877 passed on the stack into MEMs based on the argument pointer. Although
9878 we aren't going to rewrite other MEMs, we still need to initialize the
9879 virtual CFA pointer in order to ensure that the argument pointer will
9880 be seen as a constant throughout the function.
9882 ??? This doesn't work if FRAME_POINTER_CFA_OFFSET is defined. */
9883 else if (stack_realign_drap
)
9887 #ifdef FRAME_POINTER_CFA_OFFSET
9888 reg
= frame_pointer_rtx
;
9890 reg
= arg_pointer_rtx
;
9892 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
9895 if (GET_CODE (elim
) == PLUS
)
9896 elim
= XEXP (elim
, 0);
9897 if (elim
== hard_frame_pointer_rtx
)
9898 vt_init_cfa_base ();
9902 hard_frame_pointer_adjustment
= -1;
9904 vt_add_function_parameters ();
9909 HOST_WIDE_INT pre
, post
= 0;
9910 basic_block first_bb
, last_bb
;
9912 if (MAY_HAVE_DEBUG_INSNS
)
9914 cselib_record_sets_hook
= add_with_sets
;
9915 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
9916 fprintf (dump_file
, "first value: %i\n",
9917 cselib_get_next_uid ());
9924 if (bb
->next_bb
== EXIT_BLOCK_PTR
9925 || ! single_pred_p (bb
->next_bb
))
9927 e
= find_edge (bb
, bb
->next_bb
);
9928 if (! e
|| (e
->flags
& EDGE_FALLTHRU
) == 0)
9934 /* Add the micro-operations to the vector. */
9935 FOR_BB_BETWEEN (bb
, first_bb
, last_bb
->next_bb
, next_bb
)
9937 HOST_WIDE_INT offset
= VTI (bb
)->out
.stack_adjust
;
9938 VTI (bb
)->out
.stack_adjust
= VTI (bb
)->in
.stack_adjust
;
9939 for (insn
= BB_HEAD (bb
); insn
!= NEXT_INSN (BB_END (bb
));
9940 insn
= NEXT_INSN (insn
))
9944 if (!frame_pointer_needed
)
9946 insn_stack_adjust_offset_pre_post (insn
, &pre
, &post
);
9950 mo
.type
= MO_ADJUST
;
9953 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
9954 log_op_type (PATTERN (insn
), bb
, insn
,
9955 MO_ADJUST
, dump_file
);
9956 VTI (bb
)->mos
.safe_push (mo
);
9957 VTI (bb
)->out
.stack_adjust
+= pre
;
9961 cselib_hook_called
= false;
9962 adjust_insn (bb
, insn
);
9963 if (MAY_HAVE_DEBUG_INSNS
)
9966 prepare_call_arguments (bb
, insn
);
9967 cselib_process_insn (insn
);
9968 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
9970 print_rtl_single (dump_file
, insn
);
9971 dump_cselib_table (dump_file
);
9974 if (!cselib_hook_called
)
9975 add_with_sets (insn
, 0, 0);
9978 if (!frame_pointer_needed
&& post
)
9981 mo
.type
= MO_ADJUST
;
9984 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
9985 log_op_type (PATTERN (insn
), bb
, insn
,
9986 MO_ADJUST
, dump_file
);
9987 VTI (bb
)->mos
.safe_push (mo
);
9988 VTI (bb
)->out
.stack_adjust
+= post
;
9991 if (fp_cfa_offset
!= -1
9992 && hard_frame_pointer_adjustment
== -1
9993 && fp_setter_insn (insn
))
9995 vt_init_cfa_base ();
9996 hard_frame_pointer_adjustment
= fp_cfa_offset
;
9997 /* Disassociate sp from fp now. */
9998 if (MAY_HAVE_DEBUG_INSNS
)
10001 cselib_invalidate_rtx (stack_pointer_rtx
);
10002 v
= cselib_lookup (stack_pointer_rtx
, Pmode
, 1,
10004 if (v
&& !cselib_preserved_value_p (v
))
10006 cselib_set_value_sp_based (v
);
10007 preserve_value (v
);
10013 gcc_assert (offset
== VTI (bb
)->out
.stack_adjust
);
10018 if (MAY_HAVE_DEBUG_INSNS
)
10020 cselib_preserve_only_values ();
10021 cselib_reset_table (cselib_get_next_uid ());
10022 cselib_record_sets_hook
= NULL
;
10026 hard_frame_pointer_adjustment
= -1;
10027 VTI (ENTRY_BLOCK_PTR
)->flooded
= true;
10028 cfa_base_rtx
= NULL_RTX
;
10032 /* This is *not* reset after each function. It gives each
10033 NOTE_INSN_DELETED_DEBUG_LABEL in the entire compilation
10034 a unique label number. */
10036 static int debug_label_num
= 1;
10038 /* Get rid of all debug insns from the insn stream. */
10041 delete_debug_insns (void)
10046 if (!MAY_HAVE_DEBUG_INSNS
)
10051 FOR_BB_INSNS_SAFE (bb
, insn
, next
)
10052 if (DEBUG_INSN_P (insn
))
10054 tree decl
= INSN_VAR_LOCATION_DECL (insn
);
10055 if (TREE_CODE (decl
) == LABEL_DECL
10056 && DECL_NAME (decl
)
10057 && !DECL_RTL_SET_P (decl
))
10059 PUT_CODE (insn
, NOTE
);
10060 NOTE_KIND (insn
) = NOTE_INSN_DELETED_DEBUG_LABEL
;
10061 NOTE_DELETED_LABEL_NAME (insn
)
10062 = IDENTIFIER_POINTER (DECL_NAME (decl
));
10063 SET_DECL_RTL (decl
, insn
);
10064 CODE_LABEL_NUMBER (insn
) = debug_label_num
++;
10067 delete_insn (insn
);
10072 /* Run a fast, BB-local only version of var tracking, to take care of
10073 information that we don't do global analysis on, such that not all
10074 information is lost. If SKIPPED holds, we're skipping the global
10075 pass entirely, so we should try to use information it would have
10076 handled as well.. */
10079 vt_debug_insns_local (bool skipped ATTRIBUTE_UNUSED
)
10081 /* ??? Just skip it all for now. */
10082 delete_debug_insns ();
10085 /* Free the data structures needed for variable tracking. */
10094 VTI (bb
)->mos
.release ();
10099 dataflow_set_destroy (&VTI (bb
)->in
);
10100 dataflow_set_destroy (&VTI (bb
)->out
);
10101 if (VTI (bb
)->permp
)
10103 dataflow_set_destroy (VTI (bb
)->permp
);
10104 XDELETE (VTI (bb
)->permp
);
10107 free_aux_for_blocks ();
10108 htab_delete (empty_shared_hash
->htab
);
10109 htab_delete (changed_variables
);
10110 free_alloc_pool (attrs_pool
);
10111 free_alloc_pool (var_pool
);
10112 free_alloc_pool (loc_chain_pool
);
10113 free_alloc_pool (shared_hash_pool
);
10115 if (MAY_HAVE_DEBUG_INSNS
)
10117 if (global_get_addr_cache
)
10118 pointer_map_destroy (global_get_addr_cache
);
10119 global_get_addr_cache
= NULL
;
10120 if (loc_exp_dep_pool
)
10121 free_alloc_pool (loc_exp_dep_pool
);
10122 loc_exp_dep_pool
= NULL
;
10123 free_alloc_pool (valvar_pool
);
10124 preserved_values
.release ();
10126 BITMAP_FREE (scratch_regs
);
10127 scratch_regs
= NULL
;
10130 #ifdef HAVE_window_save
10131 vec_free (windowed_parm_regs
);
10135 XDELETEVEC (vui_vec
);
10140 /* The entry point to variable tracking pass. */
10142 static inline unsigned int
10143 variable_tracking_main_1 (void)
10147 if (flag_var_tracking_assignments
< 0)
10149 delete_debug_insns ();
10153 if (n_basic_blocks
> 500 && n_edges
/ n_basic_blocks
>= 20)
10155 vt_debug_insns_local (true);
10159 mark_dfs_back_edges ();
10160 if (!vt_initialize ())
10163 vt_debug_insns_local (true);
10167 success
= vt_find_locations ();
10169 if (!success
&& flag_var_tracking_assignments
> 0)
10173 delete_debug_insns ();
10175 /* This is later restored by our caller. */
10176 flag_var_tracking_assignments
= 0;
10178 success
= vt_initialize ();
10179 gcc_assert (success
);
10181 success
= vt_find_locations ();
10187 vt_debug_insns_local (false);
10191 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
10193 dump_dataflow_sets ();
10194 dump_reg_info (dump_file
);
10195 dump_flow_info (dump_file
, dump_flags
);
10198 timevar_push (TV_VAR_TRACKING_EMIT
);
10200 timevar_pop (TV_VAR_TRACKING_EMIT
);
10203 vt_debug_insns_local (false);
10208 variable_tracking_main (void)
10211 int save
= flag_var_tracking_assignments
;
10213 ret
= variable_tracking_main_1 ();
10215 flag_var_tracking_assignments
= save
;
10221 gate_handle_var_tracking (void)
10223 return (flag_var_tracking
&& !targetm
.delay_vartrack
);
10228 struct rtl_opt_pass pass_variable_tracking
=
10232 "vartrack", /* name */
10233 OPTGROUP_NONE
, /* optinfo_flags */
10234 gate_handle_var_tracking
, /* gate */
10235 variable_tracking_main
, /* execute */
10238 0, /* static_pass_number */
10239 TV_VAR_TRACKING
, /* tv_id */
10240 0, /* properties_required */
10241 0, /* properties_provided */
10242 0, /* properties_destroyed */
10243 0, /* todo_flags_start */
10244 TODO_verify_rtl_sharing
/* todo_flags_finish */