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 /* Strip constant offsets and alignments off of LOC. Return the base
1955 vt_get_canonicalize_base (rtx loc
)
1957 while ((GET_CODE (loc
) == PLUS
1958 || GET_CODE (loc
) == AND
)
1959 && GET_CODE (XEXP (loc
, 1)) == CONST_INT
1960 && (GET_CODE (loc
) != AND
1961 || INTVAL (XEXP (loc
, 1)) < 0))
1962 loc
= XEXP (loc
, 0);
1967 /* Canonicalize LOC using equivalences from SET in addition to those
1968 in the cselib static table. */
1971 vt_canonicalize_addr (dataflow_set
*set
, rtx oloc
)
1973 HOST_WIDE_INT ofst
= 0;
1974 enum machine_mode mode
= GET_MODE (oloc
);
1975 rtx loc
= canon_rtx (get_addr (oloc
));
1977 /* Try to substitute a base VALUE for equivalent expressions as much
1978 as possible. The goal here is to expand stack-related addresses
1979 to one of the stack base registers, so that we can compare
1980 addresses for overlaps. */
1981 while (GET_CODE (vt_get_canonicalize_base (loc
)) == VALUE
)
1988 while (GET_CODE (loc
) == PLUS
)
1990 ofst
+= INTVAL (XEXP (loc
, 1));
1991 loc
= XEXP (loc
, 0);
1995 /* Alignment operations can't normally be combined, so just
1996 canonicalize the base and we're done. We'll normally have
1997 only one stack alignment anyway. */
1998 if (GET_CODE (loc
) == AND
)
2000 x
= vt_canonicalize_addr (set
, XEXP (loc
, 0));
2001 if (x
!= XEXP (loc
, 0))
2002 loc
= gen_rtx_AND (mode
, x
, XEXP (loc
, 1));
2003 loc
= canon_rtx (get_addr (loc
));
2007 x
= canon_rtx (get_addr (loc
));
2009 /* We've made progress! Start over. */
2010 if (x
!= loc
|| GET_CODE (x
) != VALUE
)
2016 dv
= dv_from_rtx (x
);
2017 var
= (variable
) htab_find_with_hash (shared_hash_htab (set
->vars
),
2018 dv
, dv_htab_hash (dv
));
2022 /* Look for an improved equivalent expression. */
2023 for (l
= var
->var_part
[0].loc_chain
; l
; l
= l
->next
)
2025 rtx base
= vt_get_canonicalize_base (l
->loc
);
2026 if (GET_CODE (base
) == REG
2027 || (GET_CODE (base
) == VALUE
2028 && canon_value_cmp (base
, loc
)))
2035 /* No luck with the dataflow set, so we're done. */
2040 /* Add OFST back in. */
2043 /* Don't build new RTL if we can help it. */
2044 if (GET_CODE (oloc
) == PLUS
2045 && XEXP (oloc
, 0) == loc
2046 && INTVAL (XEXP (oloc
, 1)) == ofst
)
2049 loc
= plus_constant (mode
, loc
, ofst
);
2055 /* Return true iff ADDR has a stack register as the base address. */
2058 vt_stack_offset_p (rtx addr
)
2060 rtx base
= vt_get_canonicalize_base (addr
);
2062 if (GET_CODE (base
) != REG
)
2065 return REGNO_PTR_FRAME_P (REGNO (base
));
2068 /* Return true iff there's a true dependence between MLOC and LOC.
2069 MADDR must be a canonicalized version of MLOC's address. */
2072 vt_canon_true_dep (dataflow_set
*set
, rtx mloc
, rtx maddr
, rtx loc
)
2074 if (GET_CODE (loc
) != MEM
)
2077 if (!canon_true_dependence (mloc
, GET_MODE (mloc
), maddr
, loc
, NULL
))
2080 if (!MEM_EXPR (loc
) && vt_stack_offset_p (maddr
))
2082 rtx addr
= vt_canonicalize_addr (set
, XEXP (loc
, 0));
2083 return canon_true_dependence (mloc
, GET_MODE (mloc
), maddr
, loc
, addr
);
2089 /* Hold parameters for the hashtab traversal function
2090 drop_overlapping_mem_locs, see below. */
2092 struct overlapping_mems
2098 /* Remove all MEMs that overlap with COMS->LOC from the location list
2099 of a hash table entry for a value. COMS->ADDR must be a
2100 canonicalized form of COMS->LOC's address, and COMS->LOC must be
2101 canonicalized itself. */
2104 drop_overlapping_mem_locs (void **slot
, void *data
)
2106 struct overlapping_mems
*coms
= (struct overlapping_mems
*)data
;
2107 dataflow_set
*set
= coms
->set
;
2108 rtx mloc
= coms
->loc
, addr
= coms
->addr
;
2109 variable var
= (variable
) *slot
;
2111 if (var
->onepart
== ONEPART_VALUE
)
2113 location_chain loc
, *locp
;
2114 bool changed
= false;
2117 gcc_assert (var
->n_var_parts
== 1);
2119 if (shared_var_p (var
, set
->vars
))
2121 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
2122 if (vt_canon_true_dep (set
, mloc
, addr
, loc
->loc
))
2128 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
2129 var
= (variable
)*slot
;
2130 gcc_assert (var
->n_var_parts
== 1);
2133 if (VAR_LOC_1PAUX (var
))
2134 cur_loc
= VAR_LOC_FROM (var
);
2136 cur_loc
= var
->var_part
[0].cur_loc
;
2138 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
2141 if (!vt_canon_true_dep (set
, mloc
, addr
, loc
->loc
))
2148 /* If we have deleted the location which was last emitted
2149 we have to emit new location so add the variable to set
2150 of changed variables. */
2151 if (cur_loc
== loc
->loc
)
2154 var
->var_part
[0].cur_loc
= NULL
;
2155 if (VAR_LOC_1PAUX (var
))
2156 VAR_LOC_FROM (var
) = NULL
;
2158 pool_free (loc_chain_pool
, loc
);
2161 if (!var
->var_part
[0].loc_chain
)
2167 variable_was_changed (var
, set
);
2173 /* Remove from SET all VALUE bindings to MEMs that overlap with LOC. */
2176 clobber_overlapping_mems (dataflow_set
*set
, rtx loc
)
2178 struct overlapping_mems coms
;
2181 coms
.loc
= canon_rtx (loc
);
2182 coms
.addr
= vt_canonicalize_addr (set
, XEXP (loc
, 0));
2184 set
->traversed_vars
= set
->vars
;
2185 htab_traverse (shared_hash_htab (set
->vars
),
2186 drop_overlapping_mem_locs
, &coms
);
2187 set
->traversed_vars
= NULL
;
2190 /* Set the location of DV, OFFSET as the MEM LOC. */
2193 var_mem_decl_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
2194 decl_or_value dv
, HOST_WIDE_INT offset
, rtx set_src
,
2195 enum insert_option iopt
)
2197 if (dv_is_decl_p (dv
))
2198 dv
= dv_from_decl (var_debug_decl (dv_as_decl (dv
)));
2200 set_variable_part (set
, loc
, dv
, offset
, initialized
, set_src
, iopt
);
2203 /* Set the location part of variable MEM_EXPR (LOC) in dataflow set
2205 Adjust the address first if it is stack pointer based. */
2208 var_mem_set (dataflow_set
*set
, rtx loc
, enum var_init_status initialized
,
2211 tree decl
= MEM_EXPR (loc
);
2212 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
2214 var_mem_decl_set (set
, loc
, initialized
,
2215 dv_from_decl (decl
), offset
, set_src
, INSERT
);
2218 /* Delete and set the location part of variable MEM_EXPR (LOC) in
2219 dataflow set SET to LOC. If MODIFY is true, any other live copies
2220 of the same variable part are also deleted from the dataflow set,
2221 otherwise the variable part is assumed to be copied from another
2222 location holding the same part.
2223 Adjust the address first if it is stack pointer based. */
2226 var_mem_delete_and_set (dataflow_set
*set
, rtx loc
, bool modify
,
2227 enum var_init_status initialized
, rtx set_src
)
2229 tree decl
= MEM_EXPR (loc
);
2230 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
2232 clobber_overlapping_mems (set
, loc
);
2233 decl
= var_debug_decl (decl
);
2235 if (initialized
== VAR_INIT_STATUS_UNKNOWN
)
2236 initialized
= get_init_value (set
, loc
, dv_from_decl (decl
));
2239 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, set_src
);
2240 var_mem_set (set
, loc
, initialized
, set_src
);
2243 /* Delete the location part LOC from dataflow set SET. If CLOBBER is
2244 true, also delete any other live copies of the same variable part.
2245 Adjust the address first if it is stack pointer based. */
2248 var_mem_delete (dataflow_set
*set
, rtx loc
, bool clobber
)
2250 tree decl
= MEM_EXPR (loc
);
2251 HOST_WIDE_INT offset
= INT_MEM_OFFSET (loc
);
2253 clobber_overlapping_mems (set
, loc
);
2254 decl
= var_debug_decl (decl
);
2256 clobber_variable_part (set
, NULL
, dv_from_decl (decl
), offset
, NULL
);
2257 delete_variable_part (set
, loc
, dv_from_decl (decl
), offset
);
2260 /* Return true if LOC should not be expanded for location expressions,
2264 unsuitable_loc (rtx loc
)
2266 switch (GET_CODE (loc
))
2280 /* Bind VAL to LOC in SET. If MODIFIED, detach LOC from any values
2284 val_bind (dataflow_set
*set
, rtx val
, rtx loc
, bool modified
)
2289 var_regno_delete (set
, REGNO (loc
));
2290 var_reg_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
2291 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
2293 else if (MEM_P (loc
))
2295 struct elt_loc_list
*l
= CSELIB_VAL_PTR (val
)->locs
;
2298 clobber_overlapping_mems (set
, loc
);
2300 if (l
&& GET_CODE (l
->loc
) == VALUE
)
2301 l
= canonical_cselib_val (CSELIB_VAL_PTR (l
->loc
))->locs
;
2303 /* If this MEM is a global constant, we don't need it in the
2304 dynamic tables. ??? We should test this before emitting the
2305 micro-op in the first place. */
2307 if (GET_CODE (l
->loc
) == MEM
&& XEXP (l
->loc
, 0) == XEXP (loc
, 0))
2313 var_mem_decl_set (set
, loc
, VAR_INIT_STATUS_INITIALIZED
,
2314 dv_from_value (val
), 0, NULL_RTX
, INSERT
);
2318 /* Other kinds of equivalences are necessarily static, at least
2319 so long as we do not perform substitutions while merging
2322 set_variable_part (set
, loc
, dv_from_value (val
), 0,
2323 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2327 /* Bind a value to a location it was just stored in. If MODIFIED
2328 holds, assume the location was modified, detaching it from any
2329 values bound to it. */
2332 val_store (dataflow_set
*set
, rtx val
, rtx loc
, rtx insn
, bool modified
)
2334 cselib_val
*v
= CSELIB_VAL_PTR (val
);
2336 gcc_assert (cselib_preserved_value_p (v
));
2340 fprintf (dump_file
, "%i: ", insn
? INSN_UID (insn
) : 0);
2341 print_inline_rtx (dump_file
, loc
, 0);
2342 fprintf (dump_file
, " evaluates to ");
2343 print_inline_rtx (dump_file
, val
, 0);
2346 struct elt_loc_list
*l
;
2347 for (l
= v
->locs
; l
; l
= l
->next
)
2349 fprintf (dump_file
, "\n%i: ", INSN_UID (l
->setting_insn
));
2350 print_inline_rtx (dump_file
, l
->loc
, 0);
2353 fprintf (dump_file
, "\n");
2356 gcc_checking_assert (!unsuitable_loc (loc
));
2358 val_bind (set
, val
, loc
, modified
);
2361 /* Reset this node, detaching all its equivalences. Return the slot
2362 in the variable hash table that holds dv, if there is one. */
2365 val_reset (dataflow_set
*set
, decl_or_value dv
)
2367 variable var
= shared_hash_find (set
->vars
, dv
) ;
2368 location_chain node
;
2371 if (!var
|| !var
->n_var_parts
)
2374 gcc_assert (var
->n_var_parts
== 1);
2377 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
2378 if (GET_CODE (node
->loc
) == VALUE
2379 && canon_value_cmp (node
->loc
, cval
))
2382 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
2383 if (GET_CODE (node
->loc
) == VALUE
&& cval
!= node
->loc
)
2385 /* Redirect the equivalence link to the new canonical
2386 value, or simply remove it if it would point at
2389 set_variable_part (set
, cval
, dv_from_value (node
->loc
),
2390 0, node
->init
, node
->set_src
, NO_INSERT
);
2391 delete_variable_part (set
, dv_as_value (dv
),
2392 dv_from_value (node
->loc
), 0);
2397 decl_or_value cdv
= dv_from_value (cval
);
2399 /* Keep the remaining values connected, accummulating links
2400 in the canonical value. */
2401 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
2403 if (node
->loc
== cval
)
2405 else if (GET_CODE (node
->loc
) == REG
)
2406 var_reg_decl_set (set
, node
->loc
, node
->init
, cdv
, 0,
2407 node
->set_src
, NO_INSERT
);
2408 else if (GET_CODE (node
->loc
) == MEM
)
2409 var_mem_decl_set (set
, node
->loc
, node
->init
, cdv
, 0,
2410 node
->set_src
, NO_INSERT
);
2412 set_variable_part (set
, node
->loc
, cdv
, 0,
2413 node
->init
, node
->set_src
, NO_INSERT
);
2417 /* We remove this last, to make sure that the canonical value is not
2418 removed to the point of requiring reinsertion. */
2420 delete_variable_part (set
, dv_as_value (dv
), dv_from_value (cval
), 0);
2422 clobber_variable_part (set
, NULL
, dv
, 0, NULL
);
2425 /* Find the values in a given location and map the val to another
2426 value, if it is unique, or add the location as one holding the
2430 val_resolve (dataflow_set
*set
, rtx val
, rtx loc
, rtx insn
)
2432 decl_or_value dv
= dv_from_value (val
);
2434 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
2437 fprintf (dump_file
, "%i: ", INSN_UID (insn
));
2439 fprintf (dump_file
, "head: ");
2440 print_inline_rtx (dump_file
, val
, 0);
2441 fputs (" is at ", dump_file
);
2442 print_inline_rtx (dump_file
, loc
, 0);
2443 fputc ('\n', dump_file
);
2446 val_reset (set
, dv
);
2448 gcc_checking_assert (!unsuitable_loc (loc
));
2452 attrs node
, found
= NULL
;
2454 for (node
= set
->regs
[REGNO (loc
)]; node
; node
= node
->next
)
2455 if (dv_is_value_p (node
->dv
)
2456 && GET_MODE (dv_as_value (node
->dv
)) == GET_MODE (loc
))
2460 /* Map incoming equivalences. ??? Wouldn't it be nice if
2461 we just started sharing the location lists? Maybe a
2462 circular list ending at the value itself or some
2464 set_variable_part (set
, dv_as_value (node
->dv
),
2465 dv_from_value (val
), node
->offset
,
2466 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2467 set_variable_part (set
, val
, node
->dv
, node
->offset
,
2468 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
, INSERT
);
2471 /* If we didn't find any equivalence, we need to remember that
2472 this value is held in the named register. */
2476 /* ??? Attempt to find and merge equivalent MEMs or other
2479 val_bind (set
, val
, loc
, false);
2482 /* Initialize dataflow set SET to be empty.
2483 VARS_SIZE is the initial size of hash table VARS. */
2486 dataflow_set_init (dataflow_set
*set
)
2488 init_attrs_list_set (set
->regs
);
2489 set
->vars
= shared_hash_copy (empty_shared_hash
);
2490 set
->stack_adjust
= 0;
2491 set
->traversed_vars
= NULL
;
2494 /* Delete the contents of dataflow set SET. */
2497 dataflow_set_clear (dataflow_set
*set
)
2501 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2502 attrs_list_clear (&set
->regs
[i
]);
2504 shared_hash_destroy (set
->vars
);
2505 set
->vars
= shared_hash_copy (empty_shared_hash
);
2508 /* Copy the contents of dataflow set SRC to DST. */
2511 dataflow_set_copy (dataflow_set
*dst
, dataflow_set
*src
)
2515 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2516 attrs_list_copy (&dst
->regs
[i
], src
->regs
[i
]);
2518 shared_hash_destroy (dst
->vars
);
2519 dst
->vars
= shared_hash_copy (src
->vars
);
2520 dst
->stack_adjust
= src
->stack_adjust
;
2523 /* Information for merging lists of locations for a given offset of variable.
2525 struct variable_union_info
2527 /* Node of the location chain. */
2530 /* The sum of positions in the input chains. */
2533 /* The position in the chain of DST dataflow set. */
2537 /* Buffer for location list sorting and its allocated size. */
2538 static struct variable_union_info
*vui_vec
;
2539 static int vui_allocated
;
2541 /* Compare function for qsort, order the structures by POS element. */
2544 variable_union_info_cmp_pos (const void *n1
, const void *n2
)
2546 const struct variable_union_info
*const i1
=
2547 (const struct variable_union_info
*) n1
;
2548 const struct variable_union_info
*const i2
=
2549 ( const struct variable_union_info
*) n2
;
2551 if (i1
->pos
!= i2
->pos
)
2552 return i1
->pos
- i2
->pos
;
2554 return (i1
->pos_dst
- i2
->pos_dst
);
2557 /* Compute union of location parts of variable *SLOT and the same variable
2558 from hash table DATA. Compute "sorted" union of the location chains
2559 for common offsets, i.e. the locations of a variable part are sorted by
2560 a priority where the priority is the sum of the positions in the 2 chains
2561 (if a location is only in one list the position in the second list is
2562 defined to be larger than the length of the chains).
2563 When we are updating the location parts the newest location is in the
2564 beginning of the chain, so when we do the described "sorted" union
2565 we keep the newest locations in the beginning. */
2568 variable_union (variable src
, dataflow_set
*set
)
2574 dstp
= shared_hash_find_slot (set
->vars
, src
->dv
);
2575 if (!dstp
|| !*dstp
)
2579 dst_can_be_shared
= false;
2581 dstp
= shared_hash_find_slot_unshare (&set
->vars
, src
->dv
, INSERT
);
2585 /* Continue traversing the hash table. */
2589 dst
= (variable
) *dstp
;
2591 gcc_assert (src
->n_var_parts
);
2592 gcc_checking_assert (src
->onepart
== dst
->onepart
);
2594 /* We can combine one-part variables very efficiently, because their
2595 entries are in canonical order. */
2598 location_chain
*nodep
, dnode
, snode
;
2600 gcc_assert (src
->n_var_parts
== 1
2601 && dst
->n_var_parts
== 1);
2603 snode
= src
->var_part
[0].loc_chain
;
2606 restart_onepart_unshared
:
2607 nodep
= &dst
->var_part
[0].loc_chain
;
2613 int r
= dnode
? loc_cmp (dnode
->loc
, snode
->loc
) : 1;
2617 location_chain nnode
;
2619 if (shared_var_p (dst
, set
->vars
))
2621 dstp
= unshare_variable (set
, dstp
, dst
,
2622 VAR_INIT_STATUS_INITIALIZED
);
2623 dst
= (variable
)*dstp
;
2624 goto restart_onepart_unshared
;
2627 *nodep
= nnode
= (location_chain
) pool_alloc (loc_chain_pool
);
2628 nnode
->loc
= snode
->loc
;
2629 nnode
->init
= snode
->init
;
2630 if (!snode
->set_src
|| MEM_P (snode
->set_src
))
2631 nnode
->set_src
= NULL
;
2633 nnode
->set_src
= snode
->set_src
;
2634 nnode
->next
= dnode
;
2638 gcc_checking_assert (rtx_equal_p (dnode
->loc
, snode
->loc
));
2641 snode
= snode
->next
;
2643 nodep
= &dnode
->next
;
2650 gcc_checking_assert (!src
->onepart
);
2652 /* Count the number of location parts, result is K. */
2653 for (i
= 0, j
= 0, k
= 0;
2654 i
< src
->n_var_parts
&& j
< dst
->n_var_parts
; k
++)
2656 if (VAR_PART_OFFSET (src
, i
) == VAR_PART_OFFSET (dst
, j
))
2661 else if (VAR_PART_OFFSET (src
, i
) < VAR_PART_OFFSET (dst
, j
))
2666 k
+= src
->n_var_parts
- i
;
2667 k
+= dst
->n_var_parts
- j
;
2669 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
2670 thus there are at most MAX_VAR_PARTS different offsets. */
2671 gcc_checking_assert (dst
->onepart
? k
== 1 : k
<= MAX_VAR_PARTS
);
2673 if (dst
->n_var_parts
!= k
&& shared_var_p (dst
, set
->vars
))
2675 dstp
= unshare_variable (set
, dstp
, dst
, VAR_INIT_STATUS_UNKNOWN
);
2676 dst
= (variable
)*dstp
;
2679 i
= src
->n_var_parts
- 1;
2680 j
= dst
->n_var_parts
- 1;
2681 dst
->n_var_parts
= k
;
2683 for (k
--; k
>= 0; k
--)
2685 location_chain node
, node2
;
2687 if (i
>= 0 && j
>= 0
2688 && VAR_PART_OFFSET (src
, i
) == VAR_PART_OFFSET (dst
, j
))
2690 /* Compute the "sorted" union of the chains, i.e. the locations which
2691 are in both chains go first, they are sorted by the sum of
2692 positions in the chains. */
2695 struct variable_union_info
*vui
;
2697 /* If DST is shared compare the location chains.
2698 If they are different we will modify the chain in DST with
2699 high probability so make a copy of DST. */
2700 if (shared_var_p (dst
, set
->vars
))
2702 for (node
= src
->var_part
[i
].loc_chain
,
2703 node2
= dst
->var_part
[j
].loc_chain
; node
&& node2
;
2704 node
= node
->next
, node2
= node2
->next
)
2706 if (!((REG_P (node2
->loc
)
2707 && REG_P (node
->loc
)
2708 && REGNO (node2
->loc
) == REGNO (node
->loc
))
2709 || rtx_equal_p (node2
->loc
, node
->loc
)))
2711 if (node2
->init
< node
->init
)
2712 node2
->init
= node
->init
;
2718 dstp
= unshare_variable (set
, dstp
, dst
,
2719 VAR_INIT_STATUS_UNKNOWN
);
2720 dst
= (variable
)*dstp
;
2725 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2728 for (node
= dst
->var_part
[j
].loc_chain
; node
; node
= node
->next
)
2733 /* The most common case, much simpler, no qsort is needed. */
2734 location_chain dstnode
= dst
->var_part
[j
].loc_chain
;
2735 dst
->var_part
[k
].loc_chain
= dstnode
;
2736 VAR_PART_OFFSET (dst
, k
) = VAR_PART_OFFSET(dst
, j
);
2738 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2739 if (!((REG_P (dstnode
->loc
)
2740 && REG_P (node
->loc
)
2741 && REGNO (dstnode
->loc
) == REGNO (node
->loc
))
2742 || rtx_equal_p (dstnode
->loc
, node
->loc
)))
2744 location_chain new_node
;
2746 /* Copy the location from SRC. */
2747 new_node
= (location_chain
) pool_alloc (loc_chain_pool
);
2748 new_node
->loc
= node
->loc
;
2749 new_node
->init
= node
->init
;
2750 if (!node
->set_src
|| MEM_P (node
->set_src
))
2751 new_node
->set_src
= NULL
;
2753 new_node
->set_src
= node
->set_src
;
2754 node2
->next
= new_node
;
2761 if (src_l
+ dst_l
> vui_allocated
)
2763 vui_allocated
= MAX (vui_allocated
* 2, src_l
+ dst_l
);
2764 vui_vec
= XRESIZEVEC (struct variable_union_info
, vui_vec
,
2769 /* Fill in the locations from DST. */
2770 for (node
= dst
->var_part
[j
].loc_chain
, jj
= 0; node
;
2771 node
= node
->next
, jj
++)
2774 vui
[jj
].pos_dst
= jj
;
2776 /* Pos plus value larger than a sum of 2 valid positions. */
2777 vui
[jj
].pos
= jj
+ src_l
+ dst_l
;
2780 /* Fill in the locations from SRC. */
2782 for (node
= src
->var_part
[i
].loc_chain
, ii
= 0; node
;
2783 node
= node
->next
, ii
++)
2785 /* Find location from NODE. */
2786 for (jj
= 0; jj
< dst_l
; jj
++)
2788 if ((REG_P (vui
[jj
].lc
->loc
)
2789 && REG_P (node
->loc
)
2790 && REGNO (vui
[jj
].lc
->loc
) == REGNO (node
->loc
))
2791 || rtx_equal_p (vui
[jj
].lc
->loc
, node
->loc
))
2793 vui
[jj
].pos
= jj
+ ii
;
2797 if (jj
>= dst_l
) /* The location has not been found. */
2799 location_chain new_node
;
2801 /* Copy the location from SRC. */
2802 new_node
= (location_chain
) pool_alloc (loc_chain_pool
);
2803 new_node
->loc
= node
->loc
;
2804 new_node
->init
= node
->init
;
2805 if (!node
->set_src
|| MEM_P (node
->set_src
))
2806 new_node
->set_src
= NULL
;
2808 new_node
->set_src
= node
->set_src
;
2809 vui
[n
].lc
= new_node
;
2810 vui
[n
].pos_dst
= src_l
+ dst_l
;
2811 vui
[n
].pos
= ii
+ src_l
+ dst_l
;
2818 /* Special case still very common case. For dst_l == 2
2819 all entries dst_l ... n-1 are sorted, with for i >= dst_l
2820 vui[i].pos == i + src_l + dst_l. */
2821 if (vui
[0].pos
> vui
[1].pos
)
2823 /* Order should be 1, 0, 2... */
2824 dst
->var_part
[k
].loc_chain
= vui
[1].lc
;
2825 vui
[1].lc
->next
= vui
[0].lc
;
2828 vui
[0].lc
->next
= vui
[2].lc
;
2829 vui
[n
- 1].lc
->next
= NULL
;
2832 vui
[0].lc
->next
= NULL
;
2837 dst
->var_part
[k
].loc_chain
= vui
[0].lc
;
2838 if (n
>= 3 && vui
[2].pos
< vui
[1].pos
)
2840 /* Order should be 0, 2, 1, 3... */
2841 vui
[0].lc
->next
= vui
[2].lc
;
2842 vui
[2].lc
->next
= vui
[1].lc
;
2845 vui
[1].lc
->next
= vui
[3].lc
;
2846 vui
[n
- 1].lc
->next
= NULL
;
2849 vui
[1].lc
->next
= NULL
;
2854 /* Order should be 0, 1, 2... */
2856 vui
[n
- 1].lc
->next
= NULL
;
2859 for (; ii
< n
; ii
++)
2860 vui
[ii
- 1].lc
->next
= vui
[ii
].lc
;
2864 qsort (vui
, n
, sizeof (struct variable_union_info
),
2865 variable_union_info_cmp_pos
);
2867 /* Reconnect the nodes in sorted order. */
2868 for (ii
= 1; ii
< n
; ii
++)
2869 vui
[ii
- 1].lc
->next
= vui
[ii
].lc
;
2870 vui
[n
- 1].lc
->next
= NULL
;
2871 dst
->var_part
[k
].loc_chain
= vui
[0].lc
;
2874 VAR_PART_OFFSET (dst
, k
) = VAR_PART_OFFSET (dst
, j
);
2879 else if ((i
>= 0 && j
>= 0
2880 && VAR_PART_OFFSET (src
, i
) < VAR_PART_OFFSET (dst
, j
))
2883 dst
->var_part
[k
] = dst
->var_part
[j
];
2886 else if ((i
>= 0 && j
>= 0
2887 && VAR_PART_OFFSET (src
, i
) > VAR_PART_OFFSET (dst
, j
))
2890 location_chain
*nextp
;
2892 /* Copy the chain from SRC. */
2893 nextp
= &dst
->var_part
[k
].loc_chain
;
2894 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2896 location_chain new_lc
;
2898 new_lc
= (location_chain
) pool_alloc (loc_chain_pool
);
2899 new_lc
->next
= NULL
;
2900 new_lc
->init
= node
->init
;
2901 if (!node
->set_src
|| MEM_P (node
->set_src
))
2902 new_lc
->set_src
= NULL
;
2904 new_lc
->set_src
= node
->set_src
;
2905 new_lc
->loc
= node
->loc
;
2908 nextp
= &new_lc
->next
;
2911 VAR_PART_OFFSET (dst
, k
) = VAR_PART_OFFSET (src
, i
);
2914 dst
->var_part
[k
].cur_loc
= NULL
;
2917 if (flag_var_tracking_uninit
)
2918 for (i
= 0; i
< src
->n_var_parts
&& i
< dst
->n_var_parts
; i
++)
2920 location_chain node
, node2
;
2921 for (node
= src
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
2922 for (node2
= dst
->var_part
[i
].loc_chain
; node2
; node2
= node2
->next
)
2923 if (rtx_equal_p (node
->loc
, node2
->loc
))
2925 if (node
->init
> node2
->init
)
2926 node2
->init
= node
->init
;
2930 /* Continue traversing the hash table. */
2934 /* Compute union of dataflow sets SRC and DST and store it to DST. */
2937 dataflow_set_union (dataflow_set
*dst
, dataflow_set
*src
)
2941 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
2942 attrs_list_union (&dst
->regs
[i
], src
->regs
[i
]);
2944 if (dst
->vars
== empty_shared_hash
)
2946 shared_hash_destroy (dst
->vars
);
2947 dst
->vars
= shared_hash_copy (src
->vars
);
2954 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (src
->vars
), var
, variable
, hi
)
2955 variable_union (var
, dst
);
2959 /* Whether the value is currently being expanded. */
2960 #define VALUE_RECURSED_INTO(x) \
2961 (RTL_FLAG_CHECK2 ("VALUE_RECURSED_INTO", (x), VALUE, DEBUG_EXPR)->used)
2963 /* Whether no expansion was found, saving useless lookups.
2964 It must only be set when VALUE_CHANGED is clear. */
2965 #define NO_LOC_P(x) \
2966 (RTL_FLAG_CHECK2 ("NO_LOC_P", (x), VALUE, DEBUG_EXPR)->return_val)
2968 /* Whether cur_loc in the value needs to be (re)computed. */
2969 #define VALUE_CHANGED(x) \
2970 (RTL_FLAG_CHECK1 ("VALUE_CHANGED", (x), VALUE)->frame_related)
2971 /* Whether cur_loc in the decl needs to be (re)computed. */
2972 #define DECL_CHANGED(x) TREE_VISITED (x)
2974 /* Record (if NEWV) that DV needs to have its cur_loc recomputed. For
2975 user DECLs, this means they're in changed_variables. Values and
2976 debug exprs may be left with this flag set if no user variable
2977 requires them to be evaluated. */
2980 set_dv_changed (decl_or_value dv
, bool newv
)
2982 switch (dv_onepart_p (dv
))
2986 NO_LOC_P (dv_as_value (dv
)) = false;
2987 VALUE_CHANGED (dv_as_value (dv
)) = newv
;
2992 NO_LOC_P (DECL_RTL_KNOWN_SET (dv_as_decl (dv
))) = false;
2993 /* Fall through... */
2996 DECL_CHANGED (dv_as_decl (dv
)) = newv
;
3001 /* Return true if DV needs to have its cur_loc recomputed. */
3004 dv_changed_p (decl_or_value dv
)
3006 return (dv_is_value_p (dv
)
3007 ? VALUE_CHANGED (dv_as_value (dv
))
3008 : DECL_CHANGED (dv_as_decl (dv
)));
3011 /* Return a location list node whose loc is rtx_equal to LOC, in the
3012 location list of a one-part variable or value VAR, or in that of
3013 any values recursively mentioned in the location lists. VARS must
3014 be in star-canonical form. */
3016 static location_chain
3017 find_loc_in_1pdv (rtx loc
, variable var
, htab_t vars
)
3019 location_chain node
;
3020 enum rtx_code loc_code
;
3025 gcc_checking_assert (var
->onepart
);
3027 if (!var
->n_var_parts
)
3030 gcc_checking_assert (loc
!= dv_as_opaque (var
->dv
));
3032 loc_code
= GET_CODE (loc
);
3033 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3038 if (GET_CODE (node
->loc
) != loc_code
)
3040 if (GET_CODE (node
->loc
) != VALUE
)
3043 else if (loc
== node
->loc
)
3045 else if (loc_code
!= VALUE
)
3047 if (rtx_equal_p (loc
, node
->loc
))
3052 /* Since we're in star-canonical form, we don't need to visit
3053 non-canonical nodes: one-part variables and non-canonical
3054 values would only point back to the canonical node. */
3055 if (dv_is_value_p (var
->dv
)
3056 && !canon_value_cmp (node
->loc
, dv_as_value (var
->dv
)))
3058 /* Skip all subsequent VALUEs. */
3059 while (node
->next
&& GET_CODE (node
->next
->loc
) == VALUE
)
3062 gcc_checking_assert (!canon_value_cmp (node
->loc
,
3063 dv_as_value (var
->dv
)));
3064 if (loc
== node
->loc
)
3070 gcc_checking_assert (node
== var
->var_part
[0].loc_chain
);
3071 gcc_checking_assert (!node
->next
);
3073 dv
= dv_from_value (node
->loc
);
3074 rvar
= (variable
) htab_find_with_hash (vars
, dv
, dv_htab_hash (dv
));
3075 return find_loc_in_1pdv (loc
, rvar
, vars
);
3078 /* ??? Gotta look in cselib_val locations too. */
3083 /* Hash table iteration argument passed to variable_merge. */
3086 /* The set in which the merge is to be inserted. */
3088 /* The set that we're iterating in. */
3090 /* The set that may contain the other dv we are to merge with. */
3092 /* Number of onepart dvs in src. */
3093 int src_onepart_cnt
;
3096 /* Insert LOC in *DNODE, if it's not there yet. The list must be in
3097 loc_cmp order, and it is maintained as such. */
3100 insert_into_intersection (location_chain
*nodep
, rtx loc
,
3101 enum var_init_status status
)
3103 location_chain node
;
3106 for (node
= *nodep
; node
; nodep
= &node
->next
, node
= *nodep
)
3107 if ((r
= loc_cmp (node
->loc
, loc
)) == 0)
3109 node
->init
= MIN (node
->init
, status
);
3115 node
= (location_chain
) pool_alloc (loc_chain_pool
);
3118 node
->set_src
= NULL
;
3119 node
->init
= status
;
3120 node
->next
= *nodep
;
3124 /* Insert in DEST the intersection of the locations present in both
3125 S1NODE and S2VAR, directly or indirectly. S1NODE is from a
3126 variable in DSM->cur, whereas S2VAR is from DSM->src. dvar is in
3130 intersect_loc_chains (rtx val
, location_chain
*dest
, struct dfset_merge
*dsm
,
3131 location_chain s1node
, variable s2var
)
3133 dataflow_set
*s1set
= dsm
->cur
;
3134 dataflow_set
*s2set
= dsm
->src
;
3135 location_chain found
;
3139 location_chain s2node
;
3141 gcc_checking_assert (s2var
->onepart
);
3143 if (s2var
->n_var_parts
)
3145 s2node
= s2var
->var_part
[0].loc_chain
;
3147 for (; s1node
&& s2node
;
3148 s1node
= s1node
->next
, s2node
= s2node
->next
)
3149 if (s1node
->loc
!= s2node
->loc
)
3151 else if (s1node
->loc
== val
)
3154 insert_into_intersection (dest
, s1node
->loc
,
3155 MIN (s1node
->init
, s2node
->init
));
3159 for (; s1node
; s1node
= s1node
->next
)
3161 if (s1node
->loc
== val
)
3164 if ((found
= find_loc_in_1pdv (s1node
->loc
, s2var
,
3165 shared_hash_htab (s2set
->vars
))))
3167 insert_into_intersection (dest
, s1node
->loc
,
3168 MIN (s1node
->init
, found
->init
));
3172 if (GET_CODE (s1node
->loc
) == VALUE
3173 && !VALUE_RECURSED_INTO (s1node
->loc
))
3175 decl_or_value dv
= dv_from_value (s1node
->loc
);
3176 variable svar
= shared_hash_find (s1set
->vars
, dv
);
3179 if (svar
->n_var_parts
== 1)
3181 VALUE_RECURSED_INTO (s1node
->loc
) = true;
3182 intersect_loc_chains (val
, dest
, dsm
,
3183 svar
->var_part
[0].loc_chain
,
3185 VALUE_RECURSED_INTO (s1node
->loc
) = false;
3190 /* ??? gotta look in cselib_val locations too. */
3192 /* ??? if the location is equivalent to any location in src,
3193 searched recursively
3195 add to dst the values needed to represent the equivalence
3197 telling whether locations S is equivalent to another dv's
3200 for each location D in the list
3202 if S and D satisfy rtx_equal_p, then it is present
3204 else if D is a value, recurse without cycles
3206 else if S and D have the same CODE and MODE
3208 for each operand oS and the corresponding oD
3210 if oS and oD are not equivalent, then S an D are not equivalent
3212 else if they are RTX vectors
3214 if any vector oS element is not equivalent to its respective oD,
3215 then S and D are not equivalent
3223 /* Return -1 if X should be before Y in a location list for a 1-part
3224 variable, 1 if Y should be before X, and 0 if they're equivalent
3225 and should not appear in the list. */
3228 loc_cmp (rtx x
, rtx y
)
3231 RTX_CODE code
= GET_CODE (x
);
3241 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
3242 if (REGNO (x
) == REGNO (y
))
3244 else if (REGNO (x
) < REGNO (y
))
3257 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
3258 return loc_cmp (XEXP (x
, 0), XEXP (y
, 0));
3264 if (GET_CODE (x
) == VALUE
)
3266 if (GET_CODE (y
) != VALUE
)
3268 /* Don't assert the modes are the same, that is true only
3269 when not recursing. (subreg:QI (value:SI 1:1) 0)
3270 and (subreg:QI (value:DI 2:2) 0) can be compared,
3271 even when the modes are different. */
3272 if (canon_value_cmp (x
, y
))
3278 if (GET_CODE (y
) == VALUE
)
3281 /* Entry value is the least preferable kind of expression. */
3282 if (GET_CODE (x
) == ENTRY_VALUE
)
3284 if (GET_CODE (y
) != ENTRY_VALUE
)
3286 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
3287 return loc_cmp (ENTRY_VALUE_EXP (x
), ENTRY_VALUE_EXP (y
));
3290 if (GET_CODE (y
) == ENTRY_VALUE
)
3293 if (GET_CODE (x
) == GET_CODE (y
))
3294 /* Compare operands below. */;
3295 else if (GET_CODE (x
) < GET_CODE (y
))
3300 gcc_assert (GET_MODE (x
) == GET_MODE (y
));
3302 if (GET_CODE (x
) == DEBUG_EXPR
)
3304 if (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x
))
3305 < DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y
)))
3307 gcc_checking_assert (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x
))
3308 > DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y
)));
3312 fmt
= GET_RTX_FORMAT (code
);
3313 for (i
= 0; i
< GET_RTX_LENGTH (code
); i
++)
3317 if (XWINT (x
, i
) == XWINT (y
, i
))
3319 else if (XWINT (x
, i
) < XWINT (y
, i
))
3326 if (XINT (x
, i
) == XINT (y
, i
))
3328 else if (XINT (x
, i
) < XINT (y
, i
))
3335 /* Compare the vector length first. */
3336 if (XVECLEN (x
, i
) == XVECLEN (y
, i
))
3337 /* Compare the vectors elements. */;
3338 else if (XVECLEN (x
, i
) < XVECLEN (y
, i
))
3343 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
3344 if ((r
= loc_cmp (XVECEXP (x
, i
, j
),
3345 XVECEXP (y
, i
, j
))))
3350 if ((r
= loc_cmp (XEXP (x
, i
), XEXP (y
, i
))))
3356 if (XSTR (x
, i
) == XSTR (y
, i
))
3362 if ((r
= strcmp (XSTR (x
, i
), XSTR (y
, i
))) == 0)
3370 /* These are just backpointers, so they don't matter. */
3377 /* It is believed that rtx's at this level will never
3378 contain anything but integers and other rtx's,
3379 except for within LABEL_REFs and SYMBOL_REFs. */
3388 /* Check the order of entries in one-part variables. */
3391 canonicalize_loc_order_check (void **slot
, void *data ATTRIBUTE_UNUSED
)
3393 variable var
= (variable
) *slot
;
3394 location_chain node
, next
;
3396 #ifdef ENABLE_RTL_CHECKING
3398 for (i
= 0; i
< var
->n_var_parts
; i
++)
3399 gcc_assert (var
->var_part
[0].cur_loc
== NULL
);
3400 gcc_assert (!var
->in_changed_variables
);
3406 gcc_assert (var
->n_var_parts
== 1);
3407 node
= var
->var_part
[0].loc_chain
;
3410 while ((next
= node
->next
))
3412 gcc_assert (loc_cmp (node
->loc
, next
->loc
) < 0);
3420 /* Mark with VALUE_RECURSED_INTO values that have neighbors that are
3421 more likely to be chosen as canonical for an equivalence set.
3422 Ensure less likely values can reach more likely neighbors, making
3423 the connections bidirectional. */
3426 canonicalize_values_mark (void **slot
, void *data
)
3428 dataflow_set
*set
= (dataflow_set
*)data
;
3429 variable var
= (variable
) *slot
;
3430 decl_or_value dv
= var
->dv
;
3432 location_chain node
;
3434 if (!dv_is_value_p (dv
))
3437 gcc_checking_assert (var
->n_var_parts
== 1);
3439 val
= dv_as_value (dv
);
3441 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3442 if (GET_CODE (node
->loc
) == VALUE
)
3444 if (canon_value_cmp (node
->loc
, val
))
3445 VALUE_RECURSED_INTO (val
) = true;
3448 decl_or_value odv
= dv_from_value (node
->loc
);
3449 void **oslot
= shared_hash_find_slot_noinsert (set
->vars
, odv
);
3451 set_slot_part (set
, val
, oslot
, odv
, 0,
3452 node
->init
, NULL_RTX
);
3454 VALUE_RECURSED_INTO (node
->loc
) = true;
3461 /* Remove redundant entries from equivalence lists in onepart
3462 variables, canonicalizing equivalence sets into star shapes. */
3465 canonicalize_values_star (void **slot
, void *data
)
3467 dataflow_set
*set
= (dataflow_set
*)data
;
3468 variable var
= (variable
) *slot
;
3469 decl_or_value dv
= var
->dv
;
3470 location_chain node
;
3480 gcc_checking_assert (var
->n_var_parts
== 1);
3482 if (dv_is_value_p (dv
))
3484 cval
= dv_as_value (dv
);
3485 if (!VALUE_RECURSED_INTO (cval
))
3487 VALUE_RECURSED_INTO (cval
) = false;
3497 gcc_assert (var
->n_var_parts
== 1);
3499 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3500 if (GET_CODE (node
->loc
) == VALUE
)
3503 if (VALUE_RECURSED_INTO (node
->loc
))
3505 if (canon_value_cmp (node
->loc
, cval
))
3514 if (!has_marks
|| dv_is_decl_p (dv
))
3517 /* Keep it marked so that we revisit it, either after visiting a
3518 child node, or after visiting a new parent that might be
3520 VALUE_RECURSED_INTO (val
) = true;
3522 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3523 if (GET_CODE (node
->loc
) == VALUE
3524 && VALUE_RECURSED_INTO (node
->loc
))
3528 VALUE_RECURSED_INTO (cval
) = false;
3529 dv
= dv_from_value (cval
);
3530 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
3533 gcc_assert (dv_is_decl_p (var
->dv
));
3534 /* The canonical value was reset and dropped.
3536 clobber_variable_part (set
, NULL
, var
->dv
, 0, NULL
);
3539 var
= (variable
)*slot
;
3540 gcc_assert (dv_is_value_p (var
->dv
));
3541 if (var
->n_var_parts
== 0)
3543 gcc_assert (var
->n_var_parts
== 1);
3547 VALUE_RECURSED_INTO (val
) = false;
3552 /* Push values to the canonical one. */
3553 cdv
= dv_from_value (cval
);
3554 cslot
= shared_hash_find_slot_noinsert (set
->vars
, cdv
);
3556 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
3557 if (node
->loc
!= cval
)
3559 cslot
= set_slot_part (set
, node
->loc
, cslot
, cdv
, 0,
3560 node
->init
, NULL_RTX
);
3561 if (GET_CODE (node
->loc
) == VALUE
)
3563 decl_or_value ndv
= dv_from_value (node
->loc
);
3565 set_variable_part (set
, cval
, ndv
, 0, node
->init
, NULL_RTX
,
3568 if (canon_value_cmp (node
->loc
, val
))
3570 /* If it could have been a local minimum, it's not any more,
3571 since it's now neighbor to cval, so it may have to push
3572 to it. Conversely, if it wouldn't have prevailed over
3573 val, then whatever mark it has is fine: if it was to
3574 push, it will now push to a more canonical node, but if
3575 it wasn't, then it has already pushed any values it might
3577 VALUE_RECURSED_INTO (node
->loc
) = true;
3578 /* Make sure we visit node->loc by ensuring we cval is
3580 VALUE_RECURSED_INTO (cval
) = true;
3582 else if (!VALUE_RECURSED_INTO (node
->loc
))
3583 /* If we have no need to "recurse" into this node, it's
3584 already "canonicalized", so drop the link to the old
3586 clobber_variable_part (set
, cval
, ndv
, 0, NULL
);
3588 else if (GET_CODE (node
->loc
) == REG
)
3590 attrs list
= set
->regs
[REGNO (node
->loc
)], *listp
;
3592 /* Change an existing attribute referring to dv so that it
3593 refers to cdv, removing any duplicate this might
3594 introduce, and checking that no previous duplicates
3595 existed, all in a single pass. */
3599 if (list
->offset
== 0
3600 && (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
)
3601 || dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
)))
3608 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
))
3611 for (listp
= &list
->next
; (list
= *listp
); listp
= &list
->next
)
3616 if (dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
))
3618 *listp
= list
->next
;
3619 pool_free (attrs_pool
, list
);
3624 gcc_assert (dv_as_opaque (list
->dv
) != dv_as_opaque (dv
));
3627 else if (dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
))
3629 for (listp
= &list
->next
; (list
= *listp
); listp
= &list
->next
)
3634 if (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
))
3636 *listp
= list
->next
;
3637 pool_free (attrs_pool
, list
);
3642 gcc_assert (dv_as_opaque (list
->dv
) != dv_as_opaque (cdv
));
3651 if (list
->offset
== 0
3652 && (dv_as_opaque (list
->dv
) == dv_as_opaque (dv
)
3653 || dv_as_opaque (list
->dv
) == dv_as_opaque (cdv
)))
3663 set_slot_part (set
, val
, cslot
, cdv
, 0,
3664 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
);
3666 slot
= clobber_slot_part (set
, cval
, slot
, 0, NULL
);
3668 /* Variable may have been unshared. */
3669 var
= (variable
)*slot
;
3670 gcc_checking_assert (var
->n_var_parts
&& var
->var_part
[0].loc_chain
->loc
== cval
3671 && var
->var_part
[0].loc_chain
->next
== NULL
);
3673 if (VALUE_RECURSED_INTO (cval
))
3674 goto restart_with_cval
;
3679 /* Bind one-part variables to the canonical value in an equivalence
3680 set. Not doing this causes dataflow convergence failure in rare
3681 circumstances, see PR42873. Unfortunately we can't do this
3682 efficiently as part of canonicalize_values_star, since we may not
3683 have determined or even seen the canonical value of a set when we
3684 get to a variable that references another member of the set. */
3687 canonicalize_vars_star (void **slot
, void *data
)
3689 dataflow_set
*set
= (dataflow_set
*)data
;
3690 variable var
= (variable
) *slot
;
3691 decl_or_value dv
= var
->dv
;
3692 location_chain node
;
3697 location_chain cnode
;
3699 if (!var
->onepart
|| var
->onepart
== ONEPART_VALUE
)
3702 gcc_assert (var
->n_var_parts
== 1);
3704 node
= var
->var_part
[0].loc_chain
;
3706 if (GET_CODE (node
->loc
) != VALUE
)
3709 gcc_assert (!node
->next
);
3712 /* Push values to the canonical one. */
3713 cdv
= dv_from_value (cval
);
3714 cslot
= shared_hash_find_slot_noinsert (set
->vars
, cdv
);
3717 cvar
= (variable
)*cslot
;
3718 gcc_assert (cvar
->n_var_parts
== 1);
3720 cnode
= cvar
->var_part
[0].loc_chain
;
3722 /* CVAL is canonical if its value list contains non-VALUEs or VALUEs
3723 that are not “more canonical” than it. */
3724 if (GET_CODE (cnode
->loc
) != VALUE
3725 || !canon_value_cmp (cnode
->loc
, cval
))
3728 /* CVAL was found to be non-canonical. Change the variable to point
3729 to the canonical VALUE. */
3730 gcc_assert (!cnode
->next
);
3733 slot
= set_slot_part (set
, cval
, slot
, dv
, 0,
3734 node
->init
, node
->set_src
);
3735 clobber_slot_part (set
, cval
, slot
, 0, node
->set_src
);
3740 /* Combine variable or value in *S1SLOT (in DSM->cur) with the
3741 corresponding entry in DSM->src. Multi-part variables are combined
3742 with variable_union, whereas onepart dvs are combined with
3746 variable_merge_over_cur (variable s1var
, struct dfset_merge
*dsm
)
3748 dataflow_set
*dst
= dsm
->dst
;
3750 variable s2var
, dvar
= NULL
;
3751 decl_or_value dv
= s1var
->dv
;
3752 onepart_enum_t onepart
= s1var
->onepart
;
3755 location_chain node
, *nodep
;
3757 /* If the incoming onepart variable has an empty location list, then
3758 the intersection will be just as empty. For other variables,
3759 it's always union. */
3760 gcc_checking_assert (s1var
->n_var_parts
3761 && s1var
->var_part
[0].loc_chain
);
3764 return variable_union (s1var
, dst
);
3766 gcc_checking_assert (s1var
->n_var_parts
== 1);
3768 dvhash
= dv_htab_hash (dv
);
3769 if (dv_is_value_p (dv
))
3770 val
= dv_as_value (dv
);
3774 s2var
= shared_hash_find_1 (dsm
->src
->vars
, dv
, dvhash
);
3777 dst_can_be_shared
= false;
3781 dsm
->src_onepart_cnt
--;
3782 gcc_assert (s2var
->var_part
[0].loc_chain
3783 && s2var
->onepart
== onepart
3784 && s2var
->n_var_parts
== 1);
3786 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
3789 dvar
= (variable
)*dstslot
;
3790 gcc_assert (dvar
->refcount
== 1
3791 && dvar
->onepart
== onepart
3792 && dvar
->n_var_parts
== 1);
3793 nodep
= &dvar
->var_part
[0].loc_chain
;
3801 if (!dstslot
&& !onepart_variable_different_p (s1var
, s2var
))
3803 dstslot
= shared_hash_find_slot_unshare_1 (&dst
->vars
, dv
,
3805 *dstslot
= dvar
= s2var
;
3810 dst_can_be_shared
= false;
3812 intersect_loc_chains (val
, nodep
, dsm
,
3813 s1var
->var_part
[0].loc_chain
, s2var
);
3819 dvar
= (variable
) pool_alloc (onepart_pool (onepart
));
3822 dvar
->n_var_parts
= 1;
3823 dvar
->onepart
= onepart
;
3824 dvar
->in_changed_variables
= false;
3825 dvar
->var_part
[0].loc_chain
= node
;
3826 dvar
->var_part
[0].cur_loc
= NULL
;
3828 VAR_LOC_1PAUX (dvar
) = NULL
;
3830 VAR_PART_OFFSET (dvar
, 0) = 0;
3833 = shared_hash_find_slot_unshare_1 (&dst
->vars
, dv
, dvhash
,
3835 gcc_assert (!*dstslot
);
3843 nodep
= &dvar
->var_part
[0].loc_chain
;
3844 while ((node
= *nodep
))
3846 location_chain
*nextp
= &node
->next
;
3848 if (GET_CODE (node
->loc
) == REG
)
3852 for (list
= dst
->regs
[REGNO (node
->loc
)]; list
; list
= list
->next
)
3853 if (GET_MODE (node
->loc
) == GET_MODE (list
->loc
)
3854 && dv_is_value_p (list
->dv
))
3858 attrs_list_insert (&dst
->regs
[REGNO (node
->loc
)],
3860 /* If this value became canonical for another value that had
3861 this register, we want to leave it alone. */
3862 else if (dv_as_value (list
->dv
) != val
)
3864 dstslot
= set_slot_part (dst
, dv_as_value (list
->dv
),
3866 node
->init
, NULL_RTX
);
3867 dstslot
= delete_slot_part (dst
, node
->loc
, dstslot
, 0);
3869 /* Since nextp points into the removed node, we can't
3870 use it. The pointer to the next node moved to nodep.
3871 However, if the variable we're walking is unshared
3872 during our walk, we'll keep walking the location list
3873 of the previously-shared variable, in which case the
3874 node won't have been removed, and we'll want to skip
3875 it. That's why we test *nodep here. */
3881 /* Canonicalization puts registers first, so we don't have to
3887 if (dvar
!= (variable
)*dstslot
)
3888 dvar
= (variable
)*dstslot
;
3889 nodep
= &dvar
->var_part
[0].loc_chain
;
3893 /* Mark all referenced nodes for canonicalization, and make sure
3894 we have mutual equivalence links. */
3895 VALUE_RECURSED_INTO (val
) = true;
3896 for (node
= *nodep
; node
; node
= node
->next
)
3897 if (GET_CODE (node
->loc
) == VALUE
)
3899 VALUE_RECURSED_INTO (node
->loc
) = true;
3900 set_variable_part (dst
, val
, dv_from_value (node
->loc
), 0,
3901 node
->init
, NULL
, INSERT
);
3904 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
3905 gcc_assert (*dstslot
== dvar
);
3906 canonicalize_values_star (dstslot
, dst
);
3907 gcc_checking_assert (dstslot
3908 == shared_hash_find_slot_noinsert_1 (dst
->vars
,
3910 dvar
= (variable
)*dstslot
;
3914 bool has_value
= false, has_other
= false;
3916 /* If we have one value and anything else, we're going to
3917 canonicalize this, so make sure all values have an entry in
3918 the table and are marked for canonicalization. */
3919 for (node
= *nodep
; node
; node
= node
->next
)
3921 if (GET_CODE (node
->loc
) == VALUE
)
3923 /* If this was marked during register canonicalization,
3924 we know we have to canonicalize values. */
3939 if (has_value
&& has_other
)
3941 for (node
= *nodep
; node
; node
= node
->next
)
3943 if (GET_CODE (node
->loc
) == VALUE
)
3945 decl_or_value dv
= dv_from_value (node
->loc
);
3948 if (shared_hash_shared (dst
->vars
))
3949 slot
= shared_hash_find_slot_noinsert (dst
->vars
, dv
);
3951 slot
= shared_hash_find_slot_unshare (&dst
->vars
, dv
,
3955 variable var
= (variable
) pool_alloc (onepart_pool
3959 var
->n_var_parts
= 1;
3960 var
->onepart
= ONEPART_VALUE
;
3961 var
->in_changed_variables
= false;
3962 var
->var_part
[0].loc_chain
= NULL
;
3963 var
->var_part
[0].cur_loc
= NULL
;
3964 VAR_LOC_1PAUX (var
) = NULL
;
3968 VALUE_RECURSED_INTO (node
->loc
) = true;
3972 dstslot
= shared_hash_find_slot_noinsert_1 (dst
->vars
, dv
, dvhash
);
3973 gcc_assert (*dstslot
== dvar
);
3974 canonicalize_values_star (dstslot
, dst
);
3975 gcc_checking_assert (dstslot
3976 == shared_hash_find_slot_noinsert_1 (dst
->vars
,
3978 dvar
= (variable
)*dstslot
;
3982 if (!onepart_variable_different_p (dvar
, s2var
))
3984 variable_htab_free (dvar
);
3985 *dstslot
= dvar
= s2var
;
3988 else if (s2var
!= s1var
&& !onepart_variable_different_p (dvar
, s1var
))
3990 variable_htab_free (dvar
);
3991 *dstslot
= dvar
= s1var
;
3993 dst_can_be_shared
= false;
3996 dst_can_be_shared
= false;
4001 /* Copy s2slot (in DSM->src) to DSM->dst if the variable is a
4002 multi-part variable. Unions of multi-part variables and
4003 intersections of one-part ones will be handled in
4004 variable_merge_over_cur(). */
4007 variable_merge_over_src (variable s2var
, struct dfset_merge
*dsm
)
4009 dataflow_set
*dst
= dsm
->dst
;
4010 decl_or_value dv
= s2var
->dv
;
4012 if (!s2var
->onepart
)
4014 void **dstp
= shared_hash_find_slot (dst
->vars
, dv
);
4020 dsm
->src_onepart_cnt
++;
4024 /* Combine dataflow set information from SRC2 into DST, using PDST
4025 to carry over information across passes. */
4028 dataflow_set_merge (dataflow_set
*dst
, dataflow_set
*src2
)
4030 dataflow_set cur
= *dst
;
4031 dataflow_set
*src1
= &cur
;
4032 struct dfset_merge dsm
;
4034 size_t src1_elems
, src2_elems
;
4038 src1_elems
= htab_elements (shared_hash_htab (src1
->vars
));
4039 src2_elems
= htab_elements (shared_hash_htab (src2
->vars
));
4040 dataflow_set_init (dst
);
4041 dst
->stack_adjust
= cur
.stack_adjust
;
4042 shared_hash_destroy (dst
->vars
);
4043 dst
->vars
= (shared_hash
) pool_alloc (shared_hash_pool
);
4044 dst
->vars
->refcount
= 1;
4046 = htab_create (MAX (src1_elems
, src2_elems
), variable_htab_hash
,
4047 variable_htab_eq
, variable_htab_free
);
4049 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4050 attrs_list_mpdv_union (&dst
->regs
[i
], src1
->regs
[i
], src2
->regs
[i
]);
4055 dsm
.src_onepart_cnt
= 0;
4057 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm
.src
->vars
), var
, variable
, hi
)
4058 variable_merge_over_src (var
, &dsm
);
4059 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm
.cur
->vars
), var
, variable
, hi
)
4060 variable_merge_over_cur (var
, &dsm
);
4062 if (dsm
.src_onepart_cnt
)
4063 dst_can_be_shared
= false;
4065 dataflow_set_destroy (src1
);
4068 /* Mark register equivalences. */
4071 dataflow_set_equiv_regs (dataflow_set
*set
)
4076 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4078 rtx canon
[NUM_MACHINE_MODES
];
4080 /* If the list is empty or one entry, no need to canonicalize
4082 if (set
->regs
[i
] == NULL
|| set
->regs
[i
]->next
== NULL
)
4085 memset (canon
, 0, sizeof (canon
));
4087 for (list
= set
->regs
[i
]; list
; list
= list
->next
)
4088 if (list
->offset
== 0 && dv_is_value_p (list
->dv
))
4090 rtx val
= dv_as_value (list
->dv
);
4091 rtx
*cvalp
= &canon
[(int)GET_MODE (val
)];
4094 if (canon_value_cmp (val
, cval
))
4098 for (list
= set
->regs
[i
]; list
; list
= list
->next
)
4099 if (list
->offset
== 0 && dv_onepart_p (list
->dv
))
4101 rtx cval
= canon
[(int)GET_MODE (list
->loc
)];
4106 if (dv_is_value_p (list
->dv
))
4108 rtx val
= dv_as_value (list
->dv
);
4113 VALUE_RECURSED_INTO (val
) = true;
4114 set_variable_part (set
, val
, dv_from_value (cval
), 0,
4115 VAR_INIT_STATUS_INITIALIZED
,
4119 VALUE_RECURSED_INTO (cval
) = true;
4120 set_variable_part (set
, cval
, list
->dv
, 0,
4121 VAR_INIT_STATUS_INITIALIZED
, NULL
, NO_INSERT
);
4124 for (listp
= &set
->regs
[i
]; (list
= *listp
);
4125 listp
= list
? &list
->next
: listp
)
4126 if (list
->offset
== 0 && dv_onepart_p (list
->dv
))
4128 rtx cval
= canon
[(int)GET_MODE (list
->loc
)];
4134 if (dv_is_value_p (list
->dv
))
4136 rtx val
= dv_as_value (list
->dv
);
4137 if (!VALUE_RECURSED_INTO (val
))
4141 slot
= shared_hash_find_slot_noinsert (set
->vars
, list
->dv
);
4142 canonicalize_values_star (slot
, set
);
4149 /* Remove any redundant values in the location list of VAR, which must
4150 be unshared and 1-part. */
4153 remove_duplicate_values (variable var
)
4155 location_chain node
, *nodep
;
4157 gcc_assert (var
->onepart
);
4158 gcc_assert (var
->n_var_parts
== 1);
4159 gcc_assert (var
->refcount
== 1);
4161 for (nodep
= &var
->var_part
[0].loc_chain
; (node
= *nodep
); )
4163 if (GET_CODE (node
->loc
) == VALUE
)
4165 if (VALUE_RECURSED_INTO (node
->loc
))
4167 /* Remove duplicate value node. */
4168 *nodep
= node
->next
;
4169 pool_free (loc_chain_pool
, node
);
4173 VALUE_RECURSED_INTO (node
->loc
) = true;
4175 nodep
= &node
->next
;
4178 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
4179 if (GET_CODE (node
->loc
) == VALUE
)
4181 gcc_assert (VALUE_RECURSED_INTO (node
->loc
));
4182 VALUE_RECURSED_INTO (node
->loc
) = false;
4187 /* Hash table iteration argument passed to variable_post_merge. */
4188 struct dfset_post_merge
4190 /* The new input set for the current block. */
4192 /* Pointer to the permanent input set for the current block, or
4194 dataflow_set
**permp
;
4197 /* Create values for incoming expressions associated with one-part
4198 variables that don't have value numbers for them. */
4201 variable_post_merge_new_vals (void **slot
, void *info
)
4203 struct dfset_post_merge
*dfpm
= (struct dfset_post_merge
*)info
;
4204 dataflow_set
*set
= dfpm
->set
;
4205 variable var
= (variable
)*slot
;
4206 location_chain node
;
4208 if (!var
->onepart
|| !var
->n_var_parts
)
4211 gcc_assert (var
->n_var_parts
== 1);
4213 if (dv_is_decl_p (var
->dv
))
4215 bool check_dupes
= false;
4218 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
4220 if (GET_CODE (node
->loc
) == VALUE
)
4221 gcc_assert (!VALUE_RECURSED_INTO (node
->loc
));
4222 else if (GET_CODE (node
->loc
) == REG
)
4224 attrs att
, *attp
, *curp
= NULL
;
4226 if (var
->refcount
!= 1)
4228 slot
= unshare_variable (set
, slot
, var
,
4229 VAR_INIT_STATUS_INITIALIZED
);
4230 var
= (variable
)*slot
;
4234 for (attp
= &set
->regs
[REGNO (node
->loc
)]; (att
= *attp
);
4236 if (att
->offset
== 0
4237 && GET_MODE (att
->loc
) == GET_MODE (node
->loc
))
4239 if (dv_is_value_p (att
->dv
))
4241 rtx cval
= dv_as_value (att
->dv
);
4246 else if (dv_as_opaque (att
->dv
) == dv_as_opaque (var
->dv
))
4254 if ((*curp
)->offset
== 0
4255 && GET_MODE ((*curp
)->loc
) == GET_MODE (node
->loc
)
4256 && dv_as_opaque ((*curp
)->dv
) == dv_as_opaque (var
->dv
))
4259 curp
= &(*curp
)->next
;
4270 *dfpm
->permp
= XNEW (dataflow_set
);
4271 dataflow_set_init (*dfpm
->permp
);
4274 for (att
= (*dfpm
->permp
)->regs
[REGNO (node
->loc
)];
4275 att
; att
= att
->next
)
4276 if (GET_MODE (att
->loc
) == GET_MODE (node
->loc
))
4278 gcc_assert (att
->offset
== 0
4279 && dv_is_value_p (att
->dv
));
4280 val_reset (set
, att
->dv
);
4287 cval
= dv_as_value (cdv
);
4291 /* Create a unique value to hold this register,
4292 that ought to be found and reused in
4293 subsequent rounds. */
4295 gcc_assert (!cselib_lookup (node
->loc
,
4296 GET_MODE (node
->loc
), 0,
4298 v
= cselib_lookup (node
->loc
, GET_MODE (node
->loc
), 1,
4300 cselib_preserve_value (v
);
4301 cselib_invalidate_rtx (node
->loc
);
4303 cdv
= dv_from_value (cval
);
4306 "Created new value %u:%u for reg %i\n",
4307 v
->uid
, v
->hash
, REGNO (node
->loc
));
4310 var_reg_decl_set (*dfpm
->permp
, node
->loc
,
4311 VAR_INIT_STATUS_INITIALIZED
,
4312 cdv
, 0, NULL
, INSERT
);
4318 /* Remove attribute referring to the decl, which now
4319 uses the value for the register, already existing or
4320 to be added when we bring perm in. */
4323 pool_free (attrs_pool
, att
);
4328 remove_duplicate_values (var
);
4334 /* Reset values in the permanent set that are not associated with the
4335 chosen expression. */
4338 variable_post_merge_perm_vals (void **pslot
, void *info
)
4340 struct dfset_post_merge
*dfpm
= (struct dfset_post_merge
*)info
;
4341 dataflow_set
*set
= dfpm
->set
;
4342 variable pvar
= (variable
)*pslot
, var
;
4343 location_chain pnode
;
4347 gcc_assert (dv_is_value_p (pvar
->dv
)
4348 && pvar
->n_var_parts
== 1);
4349 pnode
= pvar
->var_part
[0].loc_chain
;
4352 && REG_P (pnode
->loc
));
4356 var
= shared_hash_find (set
->vars
, dv
);
4359 /* Although variable_post_merge_new_vals may have made decls
4360 non-star-canonical, values that pre-existed in canonical form
4361 remain canonical, and newly-created values reference a single
4362 REG, so they are canonical as well. Since VAR has the
4363 location list for a VALUE, using find_loc_in_1pdv for it is
4364 fine, since VALUEs don't map back to DECLs. */
4365 if (find_loc_in_1pdv (pnode
->loc
, var
, shared_hash_htab (set
->vars
)))
4367 val_reset (set
, dv
);
4370 for (att
= set
->regs
[REGNO (pnode
->loc
)]; att
; att
= att
->next
)
4371 if (att
->offset
== 0
4372 && GET_MODE (att
->loc
) == GET_MODE (pnode
->loc
)
4373 && dv_is_value_p (att
->dv
))
4376 /* If there is a value associated with this register already, create
4378 if (att
&& dv_as_value (att
->dv
) != dv_as_value (dv
))
4380 rtx cval
= dv_as_value (att
->dv
);
4381 set_variable_part (set
, cval
, dv
, 0, pnode
->init
, NULL
, INSERT
);
4382 set_variable_part (set
, dv_as_value (dv
), att
->dv
, 0, pnode
->init
,
4387 attrs_list_insert (&set
->regs
[REGNO (pnode
->loc
)],
4389 variable_union (pvar
, set
);
4395 /* Just checking stuff and registering register attributes for
4399 dataflow_post_merge_adjust (dataflow_set
*set
, dataflow_set
**permp
)
4401 struct dfset_post_merge dfpm
;
4406 htab_traverse (shared_hash_htab (set
->vars
), variable_post_merge_new_vals
,
4409 htab_traverse (shared_hash_htab ((*permp
)->vars
),
4410 variable_post_merge_perm_vals
, &dfpm
);
4411 htab_traverse (shared_hash_htab (set
->vars
), canonicalize_values_star
, set
);
4412 htab_traverse (shared_hash_htab (set
->vars
), canonicalize_vars_star
, set
);
4415 /* Return a node whose loc is a MEM that refers to EXPR in the
4416 location list of a one-part variable or value VAR, or in that of
4417 any values recursively mentioned in the location lists. */
4419 static location_chain
4420 find_mem_expr_in_1pdv (tree expr
, rtx val
, htab_t vars
)
4422 location_chain node
;
4425 location_chain where
= NULL
;
4430 gcc_assert (GET_CODE (val
) == VALUE
4431 && !VALUE_RECURSED_INTO (val
));
4433 dv
= dv_from_value (val
);
4434 var
= (variable
) htab_find_with_hash (vars
, dv
, dv_htab_hash (dv
));
4439 gcc_assert (var
->onepart
);
4441 if (!var
->n_var_parts
)
4444 VALUE_RECURSED_INTO (val
) = true;
4446 for (node
= var
->var_part
[0].loc_chain
; node
; node
= node
->next
)
4447 if (MEM_P (node
->loc
)
4448 && MEM_EXPR (node
->loc
) == expr
4449 && INT_MEM_OFFSET (node
->loc
) == 0)
4454 else if (GET_CODE (node
->loc
) == VALUE
4455 && !VALUE_RECURSED_INTO (node
->loc
)
4456 && (where
= find_mem_expr_in_1pdv (expr
, node
->loc
, vars
)))
4459 VALUE_RECURSED_INTO (val
) = false;
4464 /* Return TRUE if the value of MEM may vary across a call. */
4467 mem_dies_at_call (rtx mem
)
4469 tree expr
= MEM_EXPR (mem
);
4475 decl
= get_base_address (expr
);
4483 return (may_be_aliased (decl
)
4484 || (!TREE_READONLY (decl
) && is_global_var (decl
)));
4487 /* Remove all MEMs from the location list of a hash table entry for a
4488 one-part variable, except those whose MEM attributes map back to
4489 the variable itself, directly or within a VALUE. */
4492 dataflow_set_preserve_mem_locs (void **slot
, void *data
)
4494 dataflow_set
*set
= (dataflow_set
*) data
;
4495 variable var
= (variable
) *slot
;
4497 if (var
->onepart
== ONEPART_VDECL
|| var
->onepart
== ONEPART_DEXPR
)
4499 tree decl
= dv_as_decl (var
->dv
);
4500 location_chain loc
, *locp
;
4501 bool changed
= false;
4503 if (!var
->n_var_parts
)
4506 gcc_assert (var
->n_var_parts
== 1);
4508 if (shared_var_p (var
, set
->vars
))
4510 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
4512 /* We want to remove dying MEMs that doesn't refer to DECL. */
4513 if (GET_CODE (loc
->loc
) == MEM
4514 && (MEM_EXPR (loc
->loc
) != decl
4515 || INT_MEM_OFFSET (loc
->loc
) != 0)
4516 && !mem_dies_at_call (loc
->loc
))
4518 /* We want to move here MEMs that do refer to DECL. */
4519 else if (GET_CODE (loc
->loc
) == VALUE
4520 && find_mem_expr_in_1pdv (decl
, loc
->loc
,
4521 shared_hash_htab (set
->vars
)))
4528 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
4529 var
= (variable
)*slot
;
4530 gcc_assert (var
->n_var_parts
== 1);
4533 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
4536 rtx old_loc
= loc
->loc
;
4537 if (GET_CODE (old_loc
) == VALUE
)
4539 location_chain mem_node
4540 = find_mem_expr_in_1pdv (decl
, loc
->loc
,
4541 shared_hash_htab (set
->vars
));
4543 /* ??? This picks up only one out of multiple MEMs that
4544 refer to the same variable. Do we ever need to be
4545 concerned about dealing with more than one, or, given
4546 that they should all map to the same variable
4547 location, their addresses will have been merged and
4548 they will be regarded as equivalent? */
4551 loc
->loc
= mem_node
->loc
;
4552 loc
->set_src
= mem_node
->set_src
;
4553 loc
->init
= MIN (loc
->init
, mem_node
->init
);
4557 if (GET_CODE (loc
->loc
) != MEM
4558 || (MEM_EXPR (loc
->loc
) == decl
4559 && INT_MEM_OFFSET (loc
->loc
) == 0)
4560 || !mem_dies_at_call (loc
->loc
))
4562 if (old_loc
!= loc
->loc
&& emit_notes
)
4564 if (old_loc
== var
->var_part
[0].cur_loc
)
4567 var
->var_part
[0].cur_loc
= NULL
;
4576 if (old_loc
== var
->var_part
[0].cur_loc
)
4579 var
->var_part
[0].cur_loc
= NULL
;
4583 pool_free (loc_chain_pool
, loc
);
4586 if (!var
->var_part
[0].loc_chain
)
4592 variable_was_changed (var
, set
);
4598 /* Remove all MEMs from the location list of a hash table entry for a
4602 dataflow_set_remove_mem_locs (void **slot
, void *data
)
4604 dataflow_set
*set
= (dataflow_set
*) data
;
4605 variable var
= (variable
) *slot
;
4607 if (var
->onepart
== ONEPART_VALUE
)
4609 location_chain loc
, *locp
;
4610 bool changed
= false;
4613 gcc_assert (var
->n_var_parts
== 1);
4615 if (shared_var_p (var
, set
->vars
))
4617 for (loc
= var
->var_part
[0].loc_chain
; loc
; loc
= loc
->next
)
4618 if (GET_CODE (loc
->loc
) == MEM
4619 && mem_dies_at_call (loc
->loc
))
4625 slot
= unshare_variable (set
, slot
, var
, VAR_INIT_STATUS_UNKNOWN
);
4626 var
= (variable
)*slot
;
4627 gcc_assert (var
->n_var_parts
== 1);
4630 if (VAR_LOC_1PAUX (var
))
4631 cur_loc
= VAR_LOC_FROM (var
);
4633 cur_loc
= var
->var_part
[0].cur_loc
;
4635 for (locp
= &var
->var_part
[0].loc_chain
, loc
= *locp
;
4638 if (GET_CODE (loc
->loc
) != MEM
4639 || !mem_dies_at_call (loc
->loc
))
4646 /* If we have deleted the location which was last emitted
4647 we have to emit new location so add the variable to set
4648 of changed variables. */
4649 if (cur_loc
== loc
->loc
)
4652 var
->var_part
[0].cur_loc
= NULL
;
4653 if (VAR_LOC_1PAUX (var
))
4654 VAR_LOC_FROM (var
) = NULL
;
4656 pool_free (loc_chain_pool
, loc
);
4659 if (!var
->var_part
[0].loc_chain
)
4665 variable_was_changed (var
, set
);
4671 /* Remove all variable-location information about call-clobbered
4672 registers, as well as associations between MEMs and VALUEs. */
4675 dataflow_set_clear_at_call (dataflow_set
*set
)
4678 hard_reg_set_iterator hrsi
;
4680 EXECUTE_IF_SET_IN_HARD_REG_SET (regs_invalidated_by_call
, 0, r
, hrsi
)
4681 var_regno_delete (set
, r
);
4683 if (MAY_HAVE_DEBUG_INSNS
)
4685 set
->traversed_vars
= set
->vars
;
4686 htab_traverse (shared_hash_htab (set
->vars
),
4687 dataflow_set_preserve_mem_locs
, set
);
4688 set
->traversed_vars
= set
->vars
;
4689 htab_traverse (shared_hash_htab (set
->vars
), dataflow_set_remove_mem_locs
,
4691 set
->traversed_vars
= NULL
;
4696 variable_part_different_p (variable_part
*vp1
, variable_part
*vp2
)
4698 location_chain lc1
, lc2
;
4700 for (lc1
= vp1
->loc_chain
; lc1
; lc1
= lc1
->next
)
4702 for (lc2
= vp2
->loc_chain
; lc2
; lc2
= lc2
->next
)
4704 if (REG_P (lc1
->loc
) && REG_P (lc2
->loc
))
4706 if (REGNO (lc1
->loc
) == REGNO (lc2
->loc
))
4709 if (rtx_equal_p (lc1
->loc
, lc2
->loc
))
4718 /* Return true if one-part variables VAR1 and VAR2 are different.
4719 They must be in canonical order. */
4722 onepart_variable_different_p (variable var1
, variable var2
)
4724 location_chain lc1
, lc2
;
4729 gcc_assert (var1
->n_var_parts
== 1
4730 && var2
->n_var_parts
== 1);
4732 lc1
= var1
->var_part
[0].loc_chain
;
4733 lc2
= var2
->var_part
[0].loc_chain
;
4735 gcc_assert (lc1
&& lc2
);
4739 if (loc_cmp (lc1
->loc
, lc2
->loc
))
4748 /* Return true if variables VAR1 and VAR2 are different. */
4751 variable_different_p (variable var1
, variable var2
)
4758 if (var1
->onepart
!= var2
->onepart
)
4761 if (var1
->n_var_parts
!= var2
->n_var_parts
)
4764 if (var1
->onepart
&& var1
->n_var_parts
)
4766 gcc_checking_assert (dv_as_opaque (var1
->dv
) == dv_as_opaque (var2
->dv
)
4767 && var1
->n_var_parts
== 1);
4768 /* One-part values have locations in a canonical order. */
4769 return onepart_variable_different_p (var1
, var2
);
4772 for (i
= 0; i
< var1
->n_var_parts
; i
++)
4774 if (VAR_PART_OFFSET (var1
, i
) != VAR_PART_OFFSET (var2
, i
))
4776 if (variable_part_different_p (&var1
->var_part
[i
], &var2
->var_part
[i
]))
4778 if (variable_part_different_p (&var2
->var_part
[i
], &var1
->var_part
[i
]))
4784 /* Return true if dataflow sets OLD_SET and NEW_SET differ. */
4787 dataflow_set_different (dataflow_set
*old_set
, dataflow_set
*new_set
)
4792 if (old_set
->vars
== new_set
->vars
)
4795 if (htab_elements (shared_hash_htab (old_set
->vars
))
4796 != htab_elements (shared_hash_htab (new_set
->vars
)))
4799 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (old_set
->vars
), var1
, variable
, hi
)
4801 htab_t htab
= shared_hash_htab (new_set
->vars
);
4802 variable var2
= (variable
) htab_find_with_hash (htab
, var1
->dv
,
4803 dv_htab_hash (var1
->dv
));
4806 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4808 fprintf (dump_file
, "dataflow difference found: removal of:\n");
4814 if (variable_different_p (var1
, var2
))
4816 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
4818 fprintf (dump_file
, "dataflow difference found: "
4819 "old and new follow:\n");
4827 /* No need to traverse the second hashtab, if both have the same number
4828 of elements and the second one had all entries found in the first one,
4829 then it can't have any extra entries. */
4833 /* Free the contents of dataflow set SET. */
4836 dataflow_set_destroy (dataflow_set
*set
)
4840 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
4841 attrs_list_clear (&set
->regs
[i
]);
4843 shared_hash_destroy (set
->vars
);
4847 /* Return true if RTL X contains a SYMBOL_REF. */
4850 contains_symbol_ref (rtx x
)
4859 code
= GET_CODE (x
);
4860 if (code
== SYMBOL_REF
)
4863 fmt
= GET_RTX_FORMAT (code
);
4864 for (i
= GET_RTX_LENGTH (code
) - 1; i
>= 0; i
--)
4868 if (contains_symbol_ref (XEXP (x
, i
)))
4871 else if (fmt
[i
] == 'E')
4874 for (j
= 0; j
< XVECLEN (x
, i
); j
++)
4875 if (contains_symbol_ref (XVECEXP (x
, i
, j
)))
4883 /* Shall EXPR be tracked? */
4886 track_expr_p (tree expr
, bool need_rtl
)
4891 if (TREE_CODE (expr
) == DEBUG_EXPR_DECL
)
4892 return DECL_RTL_SET_P (expr
);
4894 /* If EXPR is not a parameter or a variable do not track it. */
4895 if (TREE_CODE (expr
) != VAR_DECL
&& TREE_CODE (expr
) != PARM_DECL
)
4898 /* It also must have a name... */
4899 if (!DECL_NAME (expr
) && need_rtl
)
4902 /* ... and a RTL assigned to it. */
4903 decl_rtl
= DECL_RTL_IF_SET (expr
);
4904 if (!decl_rtl
&& need_rtl
)
4907 /* If this expression is really a debug alias of some other declaration, we
4908 don't need to track this expression if the ultimate declaration is
4911 if (DECL_DEBUG_EXPR_IS_FROM (realdecl
))
4913 realdecl
= DECL_DEBUG_EXPR (realdecl
);
4914 if (realdecl
== NULL_TREE
)
4916 else if (!DECL_P (realdecl
))
4918 if (handled_component_p (realdecl
)
4919 || (TREE_CODE (realdecl
) == MEM_REF
4920 && TREE_CODE (TREE_OPERAND (realdecl
, 0)) == ADDR_EXPR
))
4922 HOST_WIDE_INT bitsize
, bitpos
, maxsize
;
4924 = get_ref_base_and_extent (realdecl
, &bitpos
, &bitsize
,
4926 if (!DECL_P (innerdecl
)
4927 || DECL_IGNORED_P (innerdecl
)
4928 || TREE_STATIC (innerdecl
)
4930 || bitpos
+ bitsize
> 256
4931 || bitsize
!= maxsize
)
4941 /* Do not track EXPR if REALDECL it should be ignored for debugging
4943 if (DECL_IGNORED_P (realdecl
))
4946 /* Do not track global variables until we are able to emit correct location
4948 if (TREE_STATIC (realdecl
))
4951 /* When the EXPR is a DECL for alias of some variable (see example)
4952 the TREE_STATIC flag is not used. Disable tracking all DECLs whose
4953 DECL_RTL contains SYMBOL_REF.
4956 extern char **_dl_argv_internal __attribute__ ((alias ("_dl_argv")));
4959 if (decl_rtl
&& MEM_P (decl_rtl
)
4960 && contains_symbol_ref (XEXP (decl_rtl
, 0)))
4963 /* If RTX is a memory it should not be very large (because it would be
4964 an array or struct). */
4965 if (decl_rtl
&& MEM_P (decl_rtl
))
4967 /* Do not track structures and arrays. */
4968 if (GET_MODE (decl_rtl
) == BLKmode
4969 || AGGREGATE_TYPE_P (TREE_TYPE (realdecl
)))
4971 if (MEM_SIZE_KNOWN_P (decl_rtl
)
4972 && MEM_SIZE (decl_rtl
) > MAX_VAR_PARTS
)
4976 DECL_CHANGED (expr
) = 0;
4977 DECL_CHANGED (realdecl
) = 0;
4981 /* Determine whether a given LOC refers to the same variable part as
4985 same_variable_part_p (rtx loc
, tree expr
, HOST_WIDE_INT offset
)
4988 HOST_WIDE_INT offset2
;
4990 if (! DECL_P (expr
))
4995 expr2
= REG_EXPR (loc
);
4996 offset2
= REG_OFFSET (loc
);
4998 else if (MEM_P (loc
))
5000 expr2
= MEM_EXPR (loc
);
5001 offset2
= INT_MEM_OFFSET (loc
);
5006 if (! expr2
|| ! DECL_P (expr2
))
5009 expr
= var_debug_decl (expr
);
5010 expr2
= var_debug_decl (expr2
);
5012 return (expr
== expr2
&& offset
== offset2
);
5015 /* LOC is a REG or MEM that we would like to track if possible.
5016 If EXPR is null, we don't know what expression LOC refers to,
5017 otherwise it refers to EXPR + OFFSET. STORE_REG_P is true if
5018 LOC is an lvalue register.
5020 Return true if EXPR is nonnull and if LOC, or some lowpart of it,
5021 is something we can track. When returning true, store the mode of
5022 the lowpart we can track in *MODE_OUT (if nonnull) and its offset
5023 from EXPR in *OFFSET_OUT (if nonnull). */
5026 track_loc_p (rtx loc
, tree expr
, HOST_WIDE_INT offset
, bool store_reg_p
,
5027 enum machine_mode
*mode_out
, HOST_WIDE_INT
*offset_out
)
5029 enum machine_mode mode
;
5031 if (expr
== NULL
|| !track_expr_p (expr
, true))
5034 /* If REG was a paradoxical subreg, its REG_ATTRS will describe the
5035 whole subreg, but only the old inner part is really relevant. */
5036 mode
= GET_MODE (loc
);
5037 if (REG_P (loc
) && !HARD_REGISTER_NUM_P (ORIGINAL_REGNO (loc
)))
5039 enum machine_mode pseudo_mode
;
5041 pseudo_mode
= PSEUDO_REGNO_MODE (ORIGINAL_REGNO (loc
));
5042 if (GET_MODE_SIZE (mode
) > GET_MODE_SIZE (pseudo_mode
))
5044 offset
+= byte_lowpart_offset (pseudo_mode
, mode
);
5049 /* If LOC is a paradoxical lowpart of EXPR, refer to EXPR itself.
5050 Do the same if we are storing to a register and EXPR occupies
5051 the whole of register LOC; in that case, the whole of EXPR is
5052 being changed. We exclude complex modes from the second case
5053 because the real and imaginary parts are represented as separate
5054 pseudo registers, even if the whole complex value fits into one
5056 if ((GET_MODE_SIZE (mode
) > GET_MODE_SIZE (DECL_MODE (expr
))
5058 && !COMPLEX_MODE_P (DECL_MODE (expr
))
5059 && hard_regno_nregs
[REGNO (loc
)][DECL_MODE (expr
)] == 1))
5060 && offset
+ byte_lowpart_offset (DECL_MODE (expr
), mode
) == 0)
5062 mode
= DECL_MODE (expr
);
5066 if (offset
< 0 || offset
>= MAX_VAR_PARTS
)
5072 *offset_out
= offset
;
5076 /* Return the MODE lowpart of LOC, or null if LOC is not something we
5077 want to track. When returning nonnull, make sure that the attributes
5078 on the returned value are updated. */
5081 var_lowpart (enum machine_mode mode
, rtx loc
)
5083 unsigned int offset
, reg_offset
, regno
;
5085 if (GET_MODE (loc
) == mode
)
5088 if (!REG_P (loc
) && !MEM_P (loc
))
5091 offset
= byte_lowpart_offset (mode
, GET_MODE (loc
));
5094 return adjust_address_nv (loc
, mode
, offset
);
5096 reg_offset
= subreg_lowpart_offset (mode
, GET_MODE (loc
));
5097 regno
= REGNO (loc
) + subreg_regno_offset (REGNO (loc
), GET_MODE (loc
),
5099 return gen_rtx_REG_offset (loc
, mode
, regno
, offset
);
5102 /* Carry information about uses and stores while walking rtx. */
5104 struct count_use_info
5106 /* The insn where the RTX is. */
5109 /* The basic block where insn is. */
5112 /* The array of n_sets sets in the insn, as determined by cselib. */
5113 struct cselib_set
*sets
;
5116 /* True if we're counting stores, false otherwise. */
5120 /* Find a VALUE corresponding to X. */
5122 static inline cselib_val
*
5123 find_use_val (rtx x
, enum machine_mode mode
, struct count_use_info
*cui
)
5129 /* This is called after uses are set up and before stores are
5130 processed by cselib, so it's safe to look up srcs, but not
5131 dsts. So we look up expressions that appear in srcs or in
5132 dest expressions, but we search the sets array for dests of
5136 /* Some targets represent memset and memcpy patterns
5137 by (set (mem:BLK ...) (reg:[QHSD]I ...)) or
5138 (set (mem:BLK ...) (const_int ...)) or
5139 (set (mem:BLK ...) (mem:BLK ...)). Don't return anything
5140 in that case, otherwise we end up with mode mismatches. */
5141 if (mode
== BLKmode
&& MEM_P (x
))
5143 for (i
= 0; i
< cui
->n_sets
; i
++)
5144 if (cui
->sets
[i
].dest
== x
)
5145 return cui
->sets
[i
].src_elt
;
5148 return cselib_lookup (x
, mode
, 0, VOIDmode
);
5154 /* Replace all registers and addresses in an expression with VALUE
5155 expressions that map back to them, unless the expression is a
5156 register. If no mapping is or can be performed, returns NULL. */
5159 replace_expr_with_values (rtx loc
)
5161 if (REG_P (loc
) || GET_CODE (loc
) == ENTRY_VALUE
)
5163 else if (MEM_P (loc
))
5165 cselib_val
*addr
= cselib_lookup (XEXP (loc
, 0),
5166 get_address_mode (loc
), 0,
5169 return replace_equiv_address_nv (loc
, addr
->val_rtx
);
5174 return cselib_subst_to_values (loc
, VOIDmode
);
5177 /* Return true if *X is a DEBUG_EXPR. Usable as an argument to
5178 for_each_rtx to tell whether there are any DEBUG_EXPRs within
5182 rtx_debug_expr_p (rtx
*x
, void *data ATTRIBUTE_UNUSED
)
5186 return GET_CODE (loc
) == DEBUG_EXPR
;
5189 /* Determine what kind of micro operation to choose for a USE. Return
5190 MO_CLOBBER if no micro operation is to be generated. */
5192 static enum micro_operation_type
5193 use_type (rtx loc
, struct count_use_info
*cui
, enum machine_mode
*modep
)
5197 if (cui
&& cui
->sets
)
5199 if (GET_CODE (loc
) == VAR_LOCATION
)
5201 if (track_expr_p (PAT_VAR_LOCATION_DECL (loc
), false))
5203 rtx ploc
= PAT_VAR_LOCATION_LOC (loc
);
5204 if (! VAR_LOC_UNKNOWN_P (ploc
))
5206 cselib_val
*val
= cselib_lookup (ploc
, GET_MODE (loc
), 1,
5209 /* ??? flag_float_store and volatile mems are never
5210 given values, but we could in theory use them for
5212 gcc_assert (val
|| 1);
5220 if (REG_P (loc
) || MEM_P (loc
))
5223 *modep
= GET_MODE (loc
);
5227 || (find_use_val (loc
, GET_MODE (loc
), cui
)
5228 && cselib_lookup (XEXP (loc
, 0),
5229 get_address_mode (loc
), 0,
5235 cselib_val
*val
= find_use_val (loc
, GET_MODE (loc
), cui
);
5237 if (val
&& !cselib_preserved_value_p (val
))
5245 gcc_assert (REGNO (loc
) < FIRST_PSEUDO_REGISTER
);
5247 if (loc
== cfa_base_rtx
)
5249 expr
= REG_EXPR (loc
);
5252 return MO_USE_NO_VAR
;
5253 else if (target_for_debug_bind (var_debug_decl (expr
)))
5255 else if (track_loc_p (loc
, expr
, REG_OFFSET (loc
),
5256 false, modep
, NULL
))
5259 return MO_USE_NO_VAR
;
5261 else if (MEM_P (loc
))
5263 expr
= MEM_EXPR (loc
);
5267 else if (target_for_debug_bind (var_debug_decl (expr
)))
5269 else if (track_loc_p (loc
, expr
, INT_MEM_OFFSET (loc
),
5271 /* Multi-part variables shouldn't refer to one-part
5272 variable names such as VALUEs (never happens) or
5273 DEBUG_EXPRs (only happens in the presence of debug
5275 && (!MAY_HAVE_DEBUG_INSNS
5276 || !for_each_rtx (&XEXP (loc
, 0), rtx_debug_expr_p
, NULL
)))
5285 /* Log to OUT information about micro-operation MOPT involving X in
5289 log_op_type (rtx x
, basic_block bb
, rtx insn
,
5290 enum micro_operation_type mopt
, FILE *out
)
5292 fprintf (out
, "bb %i op %i insn %i %s ",
5293 bb
->index
, VTI (bb
)->mos
.length (),
5294 INSN_UID (insn
), micro_operation_type_name
[mopt
]);
5295 print_inline_rtx (out
, x
, 2);
5299 /* Tell whether the CONCAT used to holds a VALUE and its location
5300 needs value resolution, i.e., an attempt of mapping the location
5301 back to other incoming values. */
5302 #define VAL_NEEDS_RESOLUTION(x) \
5303 (RTL_FLAG_CHECK1 ("VAL_NEEDS_RESOLUTION", (x), CONCAT)->volatil)
5304 /* Whether the location in the CONCAT is a tracked expression, that
5305 should also be handled like a MO_USE. */
5306 #define VAL_HOLDS_TRACK_EXPR(x) \
5307 (RTL_FLAG_CHECK1 ("VAL_HOLDS_TRACK_EXPR", (x), CONCAT)->used)
5308 /* Whether the location in the CONCAT should be handled like a MO_COPY
5310 #define VAL_EXPR_IS_COPIED(x) \
5311 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_COPIED", (x), CONCAT)->jump)
5312 /* Whether the location in the CONCAT should be handled like a
5313 MO_CLOBBER as well. */
5314 #define VAL_EXPR_IS_CLOBBERED(x) \
5315 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_CLOBBERED", (x), CONCAT)->unchanging)
5317 /* All preserved VALUEs. */
5318 static vec
<rtx
> preserved_values
;
5320 /* Ensure VAL is preserved and remember it in a vector for vt_emit_notes. */
5323 preserve_value (cselib_val
*val
)
5325 cselib_preserve_value (val
);
5326 preserved_values
.safe_push (val
->val_rtx
);
5329 /* Helper function for MO_VAL_LOC handling. Return non-zero if
5330 any rtxes not suitable for CONST use not replaced by VALUEs
5334 non_suitable_const (rtx
*x
, void *data ATTRIBUTE_UNUSED
)
5339 switch (GET_CODE (*x
))
5350 return !MEM_READONLY_P (*x
);
5356 /* Add uses (register and memory references) LOC which will be tracked
5357 to VTI (bb)->mos. INSN is instruction which the LOC is part of. */
5360 add_uses (rtx
*ploc
, void *data
)
5363 enum machine_mode mode
= VOIDmode
;
5364 struct count_use_info
*cui
= (struct count_use_info
*)data
;
5365 enum micro_operation_type type
= use_type (loc
, cui
, &mode
);
5367 if (type
!= MO_CLOBBER
)
5369 basic_block bb
= cui
->bb
;
5373 mo
.u
.loc
= type
== MO_USE
? var_lowpart (mode
, loc
) : loc
;
5374 mo
.insn
= cui
->insn
;
5376 if (type
== MO_VAL_LOC
)
5379 rtx vloc
= PAT_VAR_LOCATION_LOC (oloc
);
5382 gcc_assert (cui
->sets
);
5385 && !REG_P (XEXP (vloc
, 0))
5386 && !MEM_P (XEXP (vloc
, 0)))
5389 enum machine_mode address_mode
= get_address_mode (mloc
);
5391 = cselib_lookup (XEXP (mloc
, 0), address_mode
, 0,
5394 if (val
&& !cselib_preserved_value_p (val
))
5395 preserve_value (val
);
5398 if (CONSTANT_P (vloc
)
5399 && (GET_CODE (vloc
) != CONST
5400 || for_each_rtx (&vloc
, non_suitable_const
, NULL
)))
5401 /* For constants don't look up any value. */;
5402 else if (!VAR_LOC_UNKNOWN_P (vloc
) && !unsuitable_loc (vloc
)
5403 && (val
= find_use_val (vloc
, GET_MODE (oloc
), cui
)))
5405 enum machine_mode mode2
;
5406 enum micro_operation_type type2
;
5408 bool resolvable
= REG_P (vloc
) || MEM_P (vloc
);
5411 nloc
= replace_expr_with_values (vloc
);
5415 oloc
= shallow_copy_rtx (oloc
);
5416 PAT_VAR_LOCATION_LOC (oloc
) = nloc
;
5419 oloc
= gen_rtx_CONCAT (mode
, val
->val_rtx
, oloc
);
5421 type2
= use_type (vloc
, 0, &mode2
);
5423 gcc_assert (type2
== MO_USE
|| type2
== MO_USE_NO_VAR
5424 || type2
== MO_CLOBBER
);
5426 if (type2
== MO_CLOBBER
5427 && !cselib_preserved_value_p (val
))
5429 VAL_NEEDS_RESOLUTION (oloc
) = resolvable
;
5430 preserve_value (val
);
5433 else if (!VAR_LOC_UNKNOWN_P (vloc
))
5435 oloc
= shallow_copy_rtx (oloc
);
5436 PAT_VAR_LOCATION_LOC (oloc
) = gen_rtx_UNKNOWN_VAR_LOC ();
5441 else if (type
== MO_VAL_USE
)
5443 enum machine_mode mode2
= VOIDmode
;
5444 enum micro_operation_type type2
;
5445 cselib_val
*val
= find_use_val (loc
, GET_MODE (loc
), cui
);
5446 rtx vloc
, oloc
= loc
, nloc
;
5448 gcc_assert (cui
->sets
);
5451 && !REG_P (XEXP (oloc
, 0))
5452 && !MEM_P (XEXP (oloc
, 0)))
5455 enum machine_mode address_mode
= get_address_mode (mloc
);
5457 = cselib_lookup (XEXP (mloc
, 0), address_mode
, 0,
5460 if (val
&& !cselib_preserved_value_p (val
))
5461 preserve_value (val
);
5464 type2
= use_type (loc
, 0, &mode2
);
5466 gcc_assert (type2
== MO_USE
|| type2
== MO_USE_NO_VAR
5467 || type2
== MO_CLOBBER
);
5469 if (type2
== MO_USE
)
5470 vloc
= var_lowpart (mode2
, loc
);
5474 /* The loc of a MO_VAL_USE may have two forms:
5476 (concat val src): val is at src, a value-based
5479 (concat (concat val use) src): same as above, with use as
5480 the MO_USE tracked value, if it differs from src.
5484 gcc_checking_assert (REG_P (loc
) || MEM_P (loc
));
5485 nloc
= replace_expr_with_values (loc
);
5490 oloc
= gen_rtx_CONCAT (mode2
, val
->val_rtx
, vloc
);
5492 oloc
= val
->val_rtx
;
5494 mo
.u
.loc
= gen_rtx_CONCAT (mode
, oloc
, nloc
);
5496 if (type2
== MO_USE
)
5497 VAL_HOLDS_TRACK_EXPR (mo
.u
.loc
) = 1;
5498 if (!cselib_preserved_value_p (val
))
5500 VAL_NEEDS_RESOLUTION (mo
.u
.loc
) = 1;
5501 preserve_value (val
);
5505 gcc_assert (type
== MO_USE
|| type
== MO_USE_NO_VAR
);
5507 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5508 log_op_type (mo
.u
.loc
, cui
->bb
, cui
->insn
, mo
.type
, dump_file
);
5509 VTI (bb
)->mos
.safe_push (mo
);
5515 /* Helper function for finding all uses of REG/MEM in X in insn INSN. */
5518 add_uses_1 (rtx
*x
, void *cui
)
5520 for_each_rtx (x
, add_uses
, cui
);
5523 /* This is the value used during expansion of locations. We want it
5524 to be unbounded, so that variables expanded deep in a recursion
5525 nest are fully evaluated, so that their values are cached
5526 correctly. We avoid recursion cycles through other means, and we
5527 don't unshare RTL, so excess complexity is not a problem. */
5528 #define EXPR_DEPTH (INT_MAX)
5529 /* We use this to keep too-complex expressions from being emitted as
5530 location notes, and then to debug information. Users can trade
5531 compile time for ridiculously complex expressions, although they're
5532 seldom useful, and they may often have to be discarded as not
5533 representable anyway. */
5534 #define EXPR_USE_DEPTH (PARAM_VALUE (PARAM_MAX_VARTRACK_EXPR_DEPTH))
5536 /* Attempt to reverse the EXPR operation in the debug info and record
5537 it in the cselib table. Say for reg1 = reg2 + 6 even when reg2 is
5538 no longer live we can express its value as VAL - 6. */
5541 reverse_op (rtx val
, const_rtx expr
, rtx insn
)
5545 struct elt_loc_list
*l
;
5549 if (GET_CODE (expr
) != SET
)
5552 if (!REG_P (SET_DEST (expr
)) || GET_MODE (val
) != GET_MODE (SET_DEST (expr
)))
5555 src
= SET_SRC (expr
);
5556 switch (GET_CODE (src
))
5563 if (!REG_P (XEXP (src
, 0)))
5568 if (!REG_P (XEXP (src
, 0)) && !MEM_P (XEXP (src
, 0)))
5575 if (!SCALAR_INT_MODE_P (GET_MODE (src
)) || XEXP (src
, 0) == cfa_base_rtx
)
5578 v
= cselib_lookup (XEXP (src
, 0), GET_MODE (XEXP (src
, 0)), 0, VOIDmode
);
5579 if (!v
|| !cselib_preserved_value_p (v
))
5582 /* Use canonical V to avoid creating multiple redundant expressions
5583 for different VALUES equivalent to V. */
5584 v
= canonical_cselib_val (v
);
5586 /* Adding a reverse op isn't useful if V already has an always valid
5587 location. Ignore ENTRY_VALUE, while it is always constant, we should
5588 prefer non-ENTRY_VALUE locations whenever possible. */
5589 for (l
= v
->locs
, count
= 0; l
; l
= l
->next
, count
++)
5590 if (CONSTANT_P (l
->loc
)
5591 && (GET_CODE (l
->loc
) != CONST
|| !references_value_p (l
->loc
, 0)))
5593 /* Avoid creating too large locs lists. */
5594 else if (count
== PARAM_VALUE (PARAM_MAX_VARTRACK_REVERSE_OP_SIZE
))
5597 switch (GET_CODE (src
))
5601 if (GET_MODE (v
->val_rtx
) != GET_MODE (val
))
5603 ret
= gen_rtx_fmt_e (GET_CODE (src
), GET_MODE (val
), val
);
5607 ret
= gen_lowpart_SUBREG (GET_MODE (v
->val_rtx
), val
);
5619 if (GET_MODE (v
->val_rtx
) != GET_MODE (val
))
5621 arg
= XEXP (src
, 1);
5622 if (!CONST_INT_P (arg
) && GET_CODE (arg
) != SYMBOL_REF
)
5624 arg
= cselib_expand_value_rtx (arg
, scratch_regs
, 5);
5625 if (arg
== NULL_RTX
)
5627 if (!CONST_INT_P (arg
) && GET_CODE (arg
) != SYMBOL_REF
)
5630 ret
= simplify_gen_binary (code
, GET_MODE (val
), val
, arg
);
5632 /* Ensure ret isn't VALUE itself (which can happen e.g. for
5633 (plus (reg1) (reg2)) when reg2 is known to be 0), as that
5634 breaks a lot of routines during var-tracking. */
5635 ret
= gen_rtx_fmt_ee (PLUS
, GET_MODE (val
), val
, const0_rtx
);
5641 cselib_add_permanent_equiv (v
, ret
, insn
);
5644 /* Add stores (register and memory references) LOC which will be tracked
5645 to VTI (bb)->mos. EXPR is the RTL expression containing the store.
5646 CUIP->insn is instruction which the LOC is part of. */
5649 add_stores (rtx loc
, const_rtx expr
, void *cuip
)
5651 enum machine_mode mode
= VOIDmode
, mode2
;
5652 struct count_use_info
*cui
= (struct count_use_info
*)cuip
;
5653 basic_block bb
= cui
->bb
;
5655 rtx oloc
= loc
, nloc
, src
= NULL
;
5656 enum micro_operation_type type
= use_type (loc
, cui
, &mode
);
5657 bool track_p
= false;
5659 bool resolve
, preserve
;
5661 if (type
== MO_CLOBBER
)
5668 gcc_assert (loc
!= cfa_base_rtx
);
5669 if ((GET_CODE (expr
) == CLOBBER
&& type
!= MO_VAL_SET
)
5670 || !(track_p
= use_type (loc
, NULL
, &mode2
) == MO_USE
)
5671 || GET_CODE (expr
) == CLOBBER
)
5673 mo
.type
= MO_CLOBBER
;
5675 if (GET_CODE (expr
) == SET
5676 && SET_DEST (expr
) == loc
5677 && !unsuitable_loc (SET_SRC (expr
))
5678 && find_use_val (loc
, mode
, cui
))
5680 gcc_checking_assert (type
== MO_VAL_SET
);
5681 mo
.u
.loc
= gen_rtx_SET (VOIDmode
, loc
, SET_SRC (expr
));
5686 if (GET_CODE (expr
) == SET
5687 && SET_DEST (expr
) == loc
5688 && GET_CODE (SET_SRC (expr
)) != ASM_OPERANDS
)
5689 src
= var_lowpart (mode2
, SET_SRC (expr
));
5690 loc
= var_lowpart (mode2
, loc
);
5699 rtx xexpr
= gen_rtx_SET (VOIDmode
, loc
, src
);
5700 if (same_variable_part_p (src
, REG_EXPR (loc
), REG_OFFSET (loc
)))
5707 mo
.insn
= cui
->insn
;
5709 else if (MEM_P (loc
)
5710 && ((track_p
= use_type (loc
, NULL
, &mode2
) == MO_USE
)
5713 if (MEM_P (loc
) && type
== MO_VAL_SET
5714 && !REG_P (XEXP (loc
, 0))
5715 && !MEM_P (XEXP (loc
, 0)))
5718 enum machine_mode address_mode
= get_address_mode (mloc
);
5719 cselib_val
*val
= cselib_lookup (XEXP (mloc
, 0),
5723 if (val
&& !cselib_preserved_value_p (val
))
5724 preserve_value (val
);
5727 if (GET_CODE (expr
) == CLOBBER
|| !track_p
)
5729 mo
.type
= MO_CLOBBER
;
5730 mo
.u
.loc
= track_p
? var_lowpart (mode2
, loc
) : loc
;
5734 if (GET_CODE (expr
) == SET
5735 && SET_DEST (expr
) == loc
5736 && GET_CODE (SET_SRC (expr
)) != ASM_OPERANDS
)
5737 src
= var_lowpart (mode2
, SET_SRC (expr
));
5738 loc
= var_lowpart (mode2
, loc
);
5747 rtx xexpr
= gen_rtx_SET (VOIDmode
, loc
, src
);
5748 if (same_variable_part_p (SET_SRC (xexpr
),
5750 INT_MEM_OFFSET (loc
)))
5757 mo
.insn
= cui
->insn
;
5762 if (type
!= MO_VAL_SET
)
5763 goto log_and_return
;
5765 v
= find_use_val (oloc
, mode
, cui
);
5768 goto log_and_return
;
5770 resolve
= preserve
= !cselib_preserved_value_p (v
);
5772 if (loc
== stack_pointer_rtx
5773 && hard_frame_pointer_adjustment
!= -1
5775 cselib_set_value_sp_based (v
);
5777 nloc
= replace_expr_with_values (oloc
);
5781 if (GET_CODE (PATTERN (cui
->insn
)) == COND_EXEC
)
5783 cselib_val
*oval
= cselib_lookup (oloc
, GET_MODE (oloc
), 0, VOIDmode
);
5785 gcc_assert (oval
!= v
);
5786 gcc_assert (REG_P (oloc
) || MEM_P (oloc
));
5788 if (oval
&& !cselib_preserved_value_p (oval
))
5790 micro_operation moa
;
5792 preserve_value (oval
);
5794 moa
.type
= MO_VAL_USE
;
5795 moa
.u
.loc
= gen_rtx_CONCAT (mode
, oval
->val_rtx
, oloc
);
5796 VAL_NEEDS_RESOLUTION (moa
.u
.loc
) = 1;
5797 moa
.insn
= cui
->insn
;
5799 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5800 log_op_type (moa
.u
.loc
, cui
->bb
, cui
->insn
,
5801 moa
.type
, dump_file
);
5802 VTI (bb
)->mos
.safe_push (moa
);
5807 else if (resolve
&& GET_CODE (mo
.u
.loc
) == SET
)
5809 if (REG_P (SET_SRC (expr
)) || MEM_P (SET_SRC (expr
)))
5810 nloc
= replace_expr_with_values (SET_SRC (expr
));
5814 /* Avoid the mode mismatch between oexpr and expr. */
5815 if (!nloc
&& mode
!= mode2
)
5817 nloc
= SET_SRC (expr
);
5818 gcc_assert (oloc
== SET_DEST (expr
));
5821 if (nloc
&& nloc
!= SET_SRC (mo
.u
.loc
))
5822 oloc
= gen_rtx_SET (GET_MODE (mo
.u
.loc
), oloc
, nloc
);
5825 if (oloc
== SET_DEST (mo
.u
.loc
))
5826 /* No point in duplicating. */
5828 if (!REG_P (SET_SRC (mo
.u
.loc
)))
5834 if (GET_CODE (mo
.u
.loc
) == SET
5835 && oloc
== SET_DEST (mo
.u
.loc
))
5836 /* No point in duplicating. */
5842 loc
= gen_rtx_CONCAT (mode
, v
->val_rtx
, oloc
);
5844 if (mo
.u
.loc
!= oloc
)
5845 loc
= gen_rtx_CONCAT (GET_MODE (mo
.u
.loc
), loc
, mo
.u
.loc
);
5847 /* The loc of a MO_VAL_SET may have various forms:
5849 (concat val dst): dst now holds val
5851 (concat val (set dst src)): dst now holds val, copied from src
5853 (concat (concat val dstv) dst): dst now holds val; dstv is dst
5854 after replacing mems and non-top-level regs with values.
5856 (concat (concat val dstv) (set dst src)): dst now holds val,
5857 copied from src. dstv is a value-based representation of dst, if
5858 it differs from dst. If resolution is needed, src is a REG, and
5859 its mode is the same as that of val.
5861 (concat (concat val (set dstv srcv)) (set dst src)): src
5862 copied to dst, holding val. dstv and srcv are value-based
5863 representations of dst and src, respectively.
5867 if (GET_CODE (PATTERN (cui
->insn
)) != COND_EXEC
)
5868 reverse_op (v
->val_rtx
, expr
, cui
->insn
);
5873 VAL_HOLDS_TRACK_EXPR (loc
) = 1;
5876 VAL_NEEDS_RESOLUTION (loc
) = resolve
;
5879 if (mo
.type
== MO_CLOBBER
)
5880 VAL_EXPR_IS_CLOBBERED (loc
) = 1;
5881 if (mo
.type
== MO_COPY
)
5882 VAL_EXPR_IS_COPIED (loc
) = 1;
5884 mo
.type
= MO_VAL_SET
;
5887 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
5888 log_op_type (mo
.u
.loc
, cui
->bb
, cui
->insn
, mo
.type
, dump_file
);
5889 VTI (bb
)->mos
.safe_push (mo
);
5892 /* Arguments to the call. */
5893 static rtx call_arguments
;
5895 /* Compute call_arguments. */
5898 prepare_call_arguments (basic_block bb
, rtx insn
)
5901 rtx prev
, cur
, next
;
5902 rtx this_arg
= NULL_RTX
;
5903 tree type
= NULL_TREE
, t
, fndecl
= NULL_TREE
;
5904 tree obj_type_ref
= NULL_TREE
;
5905 CUMULATIVE_ARGS args_so_far_v
;
5906 cumulative_args_t args_so_far
;
5908 memset (&args_so_far_v
, 0, sizeof (args_so_far_v
));
5909 args_so_far
= pack_cumulative_args (&args_so_far_v
);
5910 call
= get_call_rtx_from (insn
);
5913 if (GET_CODE (XEXP (XEXP (call
, 0), 0)) == SYMBOL_REF
)
5915 rtx symbol
= XEXP (XEXP (call
, 0), 0);
5916 if (SYMBOL_REF_DECL (symbol
))
5917 fndecl
= SYMBOL_REF_DECL (symbol
);
5919 if (fndecl
== NULL_TREE
)
5920 fndecl
= MEM_EXPR (XEXP (call
, 0));
5922 && TREE_CODE (TREE_TYPE (fndecl
)) != FUNCTION_TYPE
5923 && TREE_CODE (TREE_TYPE (fndecl
)) != METHOD_TYPE
)
5925 if (fndecl
&& TYPE_ARG_TYPES (TREE_TYPE (fndecl
)))
5926 type
= TREE_TYPE (fndecl
);
5927 if (fndecl
&& TREE_CODE (fndecl
) != FUNCTION_DECL
)
5929 if (TREE_CODE (fndecl
) == INDIRECT_REF
5930 && TREE_CODE (TREE_OPERAND (fndecl
, 0)) == OBJ_TYPE_REF
)
5931 obj_type_ref
= TREE_OPERAND (fndecl
, 0);
5936 for (t
= TYPE_ARG_TYPES (type
); t
&& t
!= void_list_node
;
5938 if (TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
5939 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_VALUE (t
))))
5941 if ((t
== NULL
|| t
== void_list_node
) && obj_type_ref
== NULL_TREE
)
5945 int nargs ATTRIBUTE_UNUSED
= list_length (TYPE_ARG_TYPES (type
));
5946 link
= CALL_INSN_FUNCTION_USAGE (insn
);
5947 #ifndef PCC_STATIC_STRUCT_RETURN
5948 if (aggregate_value_p (TREE_TYPE (type
), type
)
5949 && targetm
.calls
.struct_value_rtx (type
, 0) == 0)
5951 tree struct_addr
= build_pointer_type (TREE_TYPE (type
));
5952 enum machine_mode mode
= TYPE_MODE (struct_addr
);
5954 INIT_CUMULATIVE_ARGS (args_so_far_v
, type
, NULL_RTX
, fndecl
,
5956 reg
= targetm
.calls
.function_arg (args_so_far
, mode
,
5958 targetm
.calls
.function_arg_advance (args_so_far
, mode
,
5960 if (reg
== NULL_RTX
)
5962 for (; link
; link
= XEXP (link
, 1))
5963 if (GET_CODE (XEXP (link
, 0)) == USE
5964 && MEM_P (XEXP (XEXP (link
, 0), 0)))
5966 link
= XEXP (link
, 1);
5973 INIT_CUMULATIVE_ARGS (args_so_far_v
, type
, NULL_RTX
, fndecl
,
5975 if (obj_type_ref
&& TYPE_ARG_TYPES (type
) != void_list_node
)
5977 enum machine_mode mode
;
5978 t
= TYPE_ARG_TYPES (type
);
5979 mode
= TYPE_MODE (TREE_VALUE (t
));
5980 this_arg
= targetm
.calls
.function_arg (args_so_far
, mode
,
5981 TREE_VALUE (t
), true);
5982 if (this_arg
&& !REG_P (this_arg
))
5983 this_arg
= NULL_RTX
;
5984 else if (this_arg
== NULL_RTX
)
5986 for (; link
; link
= XEXP (link
, 1))
5987 if (GET_CODE (XEXP (link
, 0)) == USE
5988 && MEM_P (XEXP (XEXP (link
, 0), 0)))
5990 this_arg
= XEXP (XEXP (link
, 0), 0);
5998 t
= type
? TYPE_ARG_TYPES (type
) : NULL_TREE
;
6000 for (link
= CALL_INSN_FUNCTION_USAGE (insn
); link
; link
= XEXP (link
, 1))
6001 if (GET_CODE (XEXP (link
, 0)) == USE
)
6003 rtx item
= NULL_RTX
;
6004 x
= XEXP (XEXP (link
, 0), 0);
6005 if (GET_MODE (link
) == VOIDmode
6006 || GET_MODE (link
) == BLKmode
6007 || (GET_MODE (link
) != GET_MODE (x
)
6008 && (GET_MODE_CLASS (GET_MODE (link
)) != MODE_INT
6009 || GET_MODE_CLASS (GET_MODE (x
)) != MODE_INT
)))
6010 /* Can't do anything for these, if the original type mode
6011 isn't known or can't be converted. */;
6014 cselib_val
*val
= cselib_lookup (x
, GET_MODE (x
), 0, VOIDmode
);
6015 if (val
&& cselib_preserved_value_p (val
))
6016 item
= val
->val_rtx
;
6017 else if (GET_MODE_CLASS (GET_MODE (x
)) == MODE_INT
)
6019 enum machine_mode mode
= GET_MODE (x
);
6021 while ((mode
= GET_MODE_WIDER_MODE (mode
)) != VOIDmode
6022 && GET_MODE_BITSIZE (mode
) <= BITS_PER_WORD
)
6024 rtx reg
= simplify_subreg (mode
, x
, GET_MODE (x
), 0);
6026 if (reg
== NULL_RTX
|| !REG_P (reg
))
6028 val
= cselib_lookup (reg
, mode
, 0, VOIDmode
);
6029 if (val
&& cselib_preserved_value_p (val
))
6031 item
= val
->val_rtx
;
6042 if (!frame_pointer_needed
)
6044 struct adjust_mem_data amd
;
6045 amd
.mem_mode
= VOIDmode
;
6046 amd
.stack_adjust
= -VTI (bb
)->out
.stack_adjust
;
6047 amd
.side_effects
= NULL_RTX
;
6049 mem
= simplify_replace_fn_rtx (mem
, NULL_RTX
, adjust_mems
,
6051 gcc_assert (amd
.side_effects
== NULL_RTX
);
6053 val
= cselib_lookup (mem
, GET_MODE (mem
), 0, VOIDmode
);
6054 if (val
&& cselib_preserved_value_p (val
))
6055 item
= val
->val_rtx
;
6056 else if (GET_MODE_CLASS (GET_MODE (mem
)) != MODE_INT
)
6058 /* For non-integer stack argument see also if they weren't
6059 initialized by integers. */
6060 enum machine_mode imode
= int_mode_for_mode (GET_MODE (mem
));
6061 if (imode
!= GET_MODE (mem
) && imode
!= BLKmode
)
6063 val
= cselib_lookup (adjust_address_nv (mem
, imode
, 0),
6064 imode
, 0, VOIDmode
);
6065 if (val
&& cselib_preserved_value_p (val
))
6066 item
= lowpart_subreg (GET_MODE (x
), val
->val_rtx
,
6074 if (GET_MODE (item
) != GET_MODE (link
))
6075 item
= lowpart_subreg (GET_MODE (link
), item
, GET_MODE (item
));
6076 if (GET_MODE (x2
) != GET_MODE (link
))
6077 x2
= lowpart_subreg (GET_MODE (link
), x2
, GET_MODE (x2
));
6078 item
= gen_rtx_CONCAT (GET_MODE (link
), x2
, item
);
6080 = gen_rtx_EXPR_LIST (VOIDmode
, item
, call_arguments
);
6082 if (t
&& t
!= void_list_node
)
6084 tree argtype
= TREE_VALUE (t
);
6085 enum machine_mode mode
= TYPE_MODE (argtype
);
6087 if (pass_by_reference (&args_so_far_v
, mode
, argtype
, true))
6089 argtype
= build_pointer_type (argtype
);
6090 mode
= TYPE_MODE (argtype
);
6092 reg
= targetm
.calls
.function_arg (args_so_far
, mode
,
6094 if (TREE_CODE (argtype
) == REFERENCE_TYPE
6095 && INTEGRAL_TYPE_P (TREE_TYPE (argtype
))
6098 && GET_MODE (reg
) == mode
6099 && GET_MODE_CLASS (mode
) == MODE_INT
6101 && REGNO (x
) == REGNO (reg
)
6102 && GET_MODE (x
) == mode
6105 enum machine_mode indmode
6106 = TYPE_MODE (TREE_TYPE (argtype
));
6107 rtx mem
= gen_rtx_MEM (indmode
, x
);
6108 cselib_val
*val
= cselib_lookup (mem
, indmode
, 0, VOIDmode
);
6109 if (val
&& cselib_preserved_value_p (val
))
6111 item
= gen_rtx_CONCAT (indmode
, mem
, val
->val_rtx
);
6112 call_arguments
= gen_rtx_EXPR_LIST (VOIDmode
, item
,
6117 struct elt_loc_list
*l
;
6120 /* Try harder, when passing address of a constant
6121 pool integer it can be easily read back. */
6122 item
= XEXP (item
, 1);
6123 if (GET_CODE (item
) == SUBREG
)
6124 item
= SUBREG_REG (item
);
6125 gcc_assert (GET_CODE (item
) == VALUE
);
6126 val
= CSELIB_VAL_PTR (item
);
6127 for (l
= val
->locs
; l
; l
= l
->next
)
6128 if (GET_CODE (l
->loc
) == SYMBOL_REF
6129 && TREE_CONSTANT_POOL_ADDRESS_P (l
->loc
)
6130 && SYMBOL_REF_DECL (l
->loc
)
6131 && DECL_INITIAL (SYMBOL_REF_DECL (l
->loc
)))
6133 initial
= DECL_INITIAL (SYMBOL_REF_DECL (l
->loc
));
6134 if (host_integerp (initial
, 0))
6136 item
= GEN_INT (tree_low_cst (initial
, 0));
6137 item
= gen_rtx_CONCAT (indmode
, mem
, item
);
6139 = gen_rtx_EXPR_LIST (VOIDmode
, item
,
6146 targetm
.calls
.function_arg_advance (args_so_far
, mode
,
6152 /* Add debug arguments. */
6154 && TREE_CODE (fndecl
) == FUNCTION_DECL
6155 && DECL_HAS_DEBUG_ARGS_P (fndecl
))
6157 vec
<tree
, va_gc
> **debug_args
= decl_debug_args_lookup (fndecl
);
6162 for (ix
= 0; vec_safe_iterate (*debug_args
, ix
, ¶m
); ix
+= 2)
6165 tree dtemp
= (**debug_args
)[ix
+ 1];
6166 enum machine_mode mode
= DECL_MODE (dtemp
);
6167 item
= gen_rtx_DEBUG_PARAMETER_REF (mode
, param
);
6168 item
= gen_rtx_CONCAT (mode
, item
, DECL_RTL_KNOWN_SET (dtemp
));
6169 call_arguments
= gen_rtx_EXPR_LIST (VOIDmode
, item
,
6175 /* Reverse call_arguments chain. */
6177 for (cur
= call_arguments
; cur
; cur
= next
)
6179 next
= XEXP (cur
, 1);
6180 XEXP (cur
, 1) = prev
;
6183 call_arguments
= prev
;
6185 x
= get_call_rtx_from (insn
);
6188 x
= XEXP (XEXP (x
, 0), 0);
6189 if (GET_CODE (x
) == SYMBOL_REF
)
6190 /* Don't record anything. */;
6191 else if (CONSTANT_P (x
))
6193 x
= gen_rtx_CONCAT (GET_MODE (x
) == VOIDmode
? Pmode
: GET_MODE (x
),
6196 = gen_rtx_EXPR_LIST (VOIDmode
, x
, call_arguments
);
6200 cselib_val
*val
= cselib_lookup (x
, GET_MODE (x
), 0, VOIDmode
);
6201 if (val
&& cselib_preserved_value_p (val
))
6203 x
= gen_rtx_CONCAT (GET_MODE (x
), pc_rtx
, val
->val_rtx
);
6205 = gen_rtx_EXPR_LIST (VOIDmode
, x
, call_arguments
);
6211 enum machine_mode mode
6212 = TYPE_MODE (TREE_TYPE (OBJ_TYPE_REF_EXPR (obj_type_ref
)));
6213 rtx clobbered
= gen_rtx_MEM (mode
, this_arg
);
6215 = tree_low_cst (OBJ_TYPE_REF_TOKEN (obj_type_ref
), 0);
6217 clobbered
= plus_constant (mode
, clobbered
,
6218 token
* GET_MODE_SIZE (mode
));
6219 clobbered
= gen_rtx_MEM (mode
, clobbered
);
6220 x
= gen_rtx_CONCAT (mode
, gen_rtx_CLOBBER (VOIDmode
, pc_rtx
), clobbered
);
6222 = gen_rtx_EXPR_LIST (VOIDmode
, x
, call_arguments
);
6226 /* Callback for cselib_record_sets_hook, that records as micro
6227 operations uses and stores in an insn after cselib_record_sets has
6228 analyzed the sets in an insn, but before it modifies the stored
6229 values in the internal tables, unless cselib_record_sets doesn't
6230 call it directly (perhaps because we're not doing cselib in the
6231 first place, in which case sets and n_sets will be 0). */
6234 add_with_sets (rtx insn
, struct cselib_set
*sets
, int n_sets
)
6236 basic_block bb
= BLOCK_FOR_INSN (insn
);
6238 struct count_use_info cui
;
6239 micro_operation
*mos
;
6241 cselib_hook_called
= true;
6246 cui
.n_sets
= n_sets
;
6248 n1
= VTI (bb
)->mos
.length ();
6249 cui
.store_p
= false;
6250 note_uses (&PATTERN (insn
), add_uses_1
, &cui
);
6251 n2
= VTI (bb
)->mos
.length () - 1;
6252 mos
= VTI (bb
)->mos
.address ();
6254 /* Order the MO_USEs to be before MO_USE_NO_VARs and MO_VAL_USE, and
6258 while (n1
< n2
&& mos
[n1
].type
== MO_USE
)
6260 while (n1
< n2
&& mos
[n2
].type
!= MO_USE
)
6272 n2
= VTI (bb
)->mos
.length () - 1;
6275 while (n1
< n2
&& mos
[n1
].type
!= MO_VAL_LOC
)
6277 while (n1
< n2
&& mos
[n2
].type
== MO_VAL_LOC
)
6295 mo
.u
.loc
= call_arguments
;
6296 call_arguments
= NULL_RTX
;
6298 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
6299 log_op_type (PATTERN (insn
), bb
, insn
, mo
.type
, dump_file
);
6300 VTI (bb
)->mos
.safe_push (mo
);
6303 n1
= VTI (bb
)->mos
.length ();
6304 /* This will record NEXT_INSN (insn), such that we can
6305 insert notes before it without worrying about any
6306 notes that MO_USEs might emit after the insn. */
6308 note_stores (PATTERN (insn
), add_stores
, &cui
);
6309 n2
= VTI (bb
)->mos
.length () - 1;
6310 mos
= VTI (bb
)->mos
.address ();
6312 /* Order the MO_VAL_USEs first (note_stores does nothing
6313 on DEBUG_INSNs, so there are no MO_VAL_LOCs from this
6314 insn), then MO_CLOBBERs, then MO_SET/MO_COPY/MO_VAL_SET. */
6317 while (n1
< n2
&& mos
[n1
].type
== MO_VAL_USE
)
6319 while (n1
< n2
&& mos
[n2
].type
!= MO_VAL_USE
)
6331 n2
= VTI (bb
)->mos
.length () - 1;
6334 while (n1
< n2
&& mos
[n1
].type
== MO_CLOBBER
)
6336 while (n1
< n2
&& mos
[n2
].type
!= MO_CLOBBER
)
6349 static enum var_init_status
6350 find_src_status (dataflow_set
*in
, rtx src
)
6352 tree decl
= NULL_TREE
;
6353 enum var_init_status status
= VAR_INIT_STATUS_UNINITIALIZED
;
6355 if (! flag_var_tracking_uninit
)
6356 status
= VAR_INIT_STATUS_INITIALIZED
;
6358 if (src
&& REG_P (src
))
6359 decl
= var_debug_decl (REG_EXPR (src
));
6360 else if (src
&& MEM_P (src
))
6361 decl
= var_debug_decl (MEM_EXPR (src
));
6364 status
= get_init_value (in
, src
, dv_from_decl (decl
));
6369 /* SRC is the source of an assignment. Use SET to try to find what
6370 was ultimately assigned to SRC. Return that value if known,
6371 otherwise return SRC itself. */
6374 find_src_set_src (dataflow_set
*set
, rtx src
)
6376 tree decl
= NULL_TREE
; /* The variable being copied around. */
6377 rtx set_src
= NULL_RTX
; /* The value for "decl" stored in "src". */
6379 location_chain nextp
;
6383 if (src
&& REG_P (src
))
6384 decl
= var_debug_decl (REG_EXPR (src
));
6385 else if (src
&& MEM_P (src
))
6386 decl
= var_debug_decl (MEM_EXPR (src
));
6390 decl_or_value dv
= dv_from_decl (decl
);
6392 var
= shared_hash_find (set
->vars
, dv
);
6396 for (i
= 0; i
< var
->n_var_parts
&& !found
; i
++)
6397 for (nextp
= var
->var_part
[i
].loc_chain
; nextp
&& !found
;
6398 nextp
= nextp
->next
)
6399 if (rtx_equal_p (nextp
->loc
, src
))
6401 set_src
= nextp
->set_src
;
6411 /* Compute the changes of variable locations in the basic block BB. */
6414 compute_bb_dataflow (basic_block bb
)
6417 micro_operation
*mo
;
6419 dataflow_set old_out
;
6420 dataflow_set
*in
= &VTI (bb
)->in
;
6421 dataflow_set
*out
= &VTI (bb
)->out
;
6423 dataflow_set_init (&old_out
);
6424 dataflow_set_copy (&old_out
, out
);
6425 dataflow_set_copy (out
, in
);
6427 FOR_EACH_VEC_ELT (VTI (bb
)->mos
, i
, mo
)
6429 rtx insn
= mo
->insn
;
6434 dataflow_set_clear_at_call (out
);
6439 rtx loc
= mo
->u
.loc
;
6442 var_reg_set (out
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
6443 else if (MEM_P (loc
))
6444 var_mem_set (out
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
6450 rtx loc
= mo
->u
.loc
;
6454 if (GET_CODE (loc
) == CONCAT
)
6456 val
= XEXP (loc
, 0);
6457 vloc
= XEXP (loc
, 1);
6465 var
= PAT_VAR_LOCATION_DECL (vloc
);
6467 clobber_variable_part (out
, NULL_RTX
,
6468 dv_from_decl (var
), 0, NULL_RTX
);
6471 if (VAL_NEEDS_RESOLUTION (loc
))
6472 val_resolve (out
, val
, PAT_VAR_LOCATION_LOC (vloc
), insn
);
6473 set_variable_part (out
, val
, dv_from_decl (var
), 0,
6474 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
6477 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc
)))
6478 set_variable_part (out
, PAT_VAR_LOCATION_LOC (vloc
),
6479 dv_from_decl (var
), 0,
6480 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
6487 rtx loc
= mo
->u
.loc
;
6488 rtx val
, vloc
, uloc
;
6490 vloc
= uloc
= XEXP (loc
, 1);
6491 val
= XEXP (loc
, 0);
6493 if (GET_CODE (val
) == CONCAT
)
6495 uloc
= XEXP (val
, 1);
6496 val
= XEXP (val
, 0);
6499 if (VAL_NEEDS_RESOLUTION (loc
))
6500 val_resolve (out
, val
, vloc
, insn
);
6502 val_store (out
, val
, uloc
, insn
, false);
6504 if (VAL_HOLDS_TRACK_EXPR (loc
))
6506 if (GET_CODE (uloc
) == REG
)
6507 var_reg_set (out
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
6509 else if (GET_CODE (uloc
) == MEM
)
6510 var_mem_set (out
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
6518 rtx loc
= mo
->u
.loc
;
6519 rtx val
, vloc
, uloc
;
6523 uloc
= XEXP (vloc
, 1);
6524 val
= XEXP (vloc
, 0);
6527 if (GET_CODE (uloc
) == SET
)
6529 dstv
= SET_DEST (uloc
);
6530 srcv
= SET_SRC (uloc
);
6538 if (GET_CODE (val
) == CONCAT
)
6540 dstv
= vloc
= XEXP (val
, 1);
6541 val
= XEXP (val
, 0);
6544 if (GET_CODE (vloc
) == SET
)
6546 srcv
= SET_SRC (vloc
);
6548 gcc_assert (val
!= srcv
);
6549 gcc_assert (vloc
== uloc
|| VAL_NEEDS_RESOLUTION (loc
));
6551 dstv
= vloc
= SET_DEST (vloc
);
6553 if (VAL_NEEDS_RESOLUTION (loc
))
6554 val_resolve (out
, val
, srcv
, insn
);
6556 else if (VAL_NEEDS_RESOLUTION (loc
))
6558 gcc_assert (GET_CODE (uloc
) == SET
6559 && GET_CODE (SET_SRC (uloc
)) == REG
);
6560 val_resolve (out
, val
, SET_SRC (uloc
), insn
);
6563 if (VAL_HOLDS_TRACK_EXPR (loc
))
6565 if (VAL_EXPR_IS_CLOBBERED (loc
))
6568 var_reg_delete (out
, uloc
, true);
6569 else if (MEM_P (uloc
))
6571 gcc_assert (MEM_P (dstv
));
6572 gcc_assert (MEM_ATTRS (dstv
) == MEM_ATTRS (uloc
));
6573 var_mem_delete (out
, dstv
, true);
6578 bool copied_p
= VAL_EXPR_IS_COPIED (loc
);
6579 rtx src
= NULL
, dst
= uloc
;
6580 enum var_init_status status
= VAR_INIT_STATUS_INITIALIZED
;
6582 if (GET_CODE (uloc
) == SET
)
6584 src
= SET_SRC (uloc
);
6585 dst
= SET_DEST (uloc
);
6590 if (flag_var_tracking_uninit
)
6592 status
= find_src_status (in
, src
);
6594 if (status
== VAR_INIT_STATUS_UNKNOWN
)
6595 status
= find_src_status (out
, src
);
6598 src
= find_src_set_src (in
, src
);
6602 var_reg_delete_and_set (out
, dst
, !copied_p
,
6604 else if (MEM_P (dst
))
6606 gcc_assert (MEM_P (dstv
));
6607 gcc_assert (MEM_ATTRS (dstv
) == MEM_ATTRS (dst
));
6608 var_mem_delete_and_set (out
, dstv
, !copied_p
,
6613 else if (REG_P (uloc
))
6614 var_regno_delete (out
, REGNO (uloc
));
6615 else if (MEM_P (uloc
))
6616 clobber_overlapping_mems (out
, uloc
);
6618 val_store (out
, val
, dstv
, insn
, true);
6624 rtx loc
= mo
->u
.loc
;
6627 if (GET_CODE (loc
) == SET
)
6629 set_src
= SET_SRC (loc
);
6630 loc
= SET_DEST (loc
);
6634 var_reg_delete_and_set (out
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
6636 else if (MEM_P (loc
))
6637 var_mem_delete_and_set (out
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
6644 rtx loc
= mo
->u
.loc
;
6645 enum var_init_status src_status
;
6648 if (GET_CODE (loc
) == SET
)
6650 set_src
= SET_SRC (loc
);
6651 loc
= SET_DEST (loc
);
6654 if (! flag_var_tracking_uninit
)
6655 src_status
= VAR_INIT_STATUS_INITIALIZED
;
6658 src_status
= find_src_status (in
, set_src
);
6660 if (src_status
== VAR_INIT_STATUS_UNKNOWN
)
6661 src_status
= find_src_status (out
, set_src
);
6664 set_src
= find_src_set_src (in
, set_src
);
6667 var_reg_delete_and_set (out
, loc
, false, src_status
, set_src
);
6668 else if (MEM_P (loc
))
6669 var_mem_delete_and_set (out
, loc
, false, src_status
, set_src
);
6675 rtx loc
= mo
->u
.loc
;
6678 var_reg_delete (out
, loc
, false);
6679 else if (MEM_P (loc
))
6680 var_mem_delete (out
, loc
, false);
6686 rtx loc
= mo
->u
.loc
;
6689 var_reg_delete (out
, loc
, true);
6690 else if (MEM_P (loc
))
6691 var_mem_delete (out
, loc
, true);
6696 out
->stack_adjust
+= mo
->u
.adjust
;
6701 if (MAY_HAVE_DEBUG_INSNS
)
6703 dataflow_set_equiv_regs (out
);
6704 htab_traverse (shared_hash_htab (out
->vars
), canonicalize_values_mark
,
6706 htab_traverse (shared_hash_htab (out
->vars
), canonicalize_values_star
,
6709 htab_traverse (shared_hash_htab (out
->vars
),
6710 canonicalize_loc_order_check
, out
);
6713 changed
= dataflow_set_different (&old_out
, out
);
6714 dataflow_set_destroy (&old_out
);
6718 /* Find the locations of variables in the whole function. */
6721 vt_find_locations (void)
6723 fibheap_t worklist
, pending
, fibheap_swap
;
6724 sbitmap visited
, in_worklist
, in_pending
, sbitmap_swap
;
6731 int htabmax
= PARAM_VALUE (PARAM_MAX_VARTRACK_SIZE
);
6732 bool success
= true;
6734 timevar_push (TV_VAR_TRACKING_DATAFLOW
);
6735 /* Compute reverse completion order of depth first search of the CFG
6736 so that the data-flow runs faster. */
6737 rc_order
= XNEWVEC (int, n_basic_blocks
- NUM_FIXED_BLOCKS
);
6738 bb_order
= XNEWVEC (int, last_basic_block
);
6739 pre_and_rev_post_order_compute (NULL
, rc_order
, false);
6740 for (i
= 0; i
< n_basic_blocks
- NUM_FIXED_BLOCKS
; i
++)
6741 bb_order
[rc_order
[i
]] = i
;
6744 worklist
= fibheap_new ();
6745 pending
= fibheap_new ();
6746 visited
= sbitmap_alloc (last_basic_block
);
6747 in_worklist
= sbitmap_alloc (last_basic_block
);
6748 in_pending
= sbitmap_alloc (last_basic_block
);
6749 bitmap_clear (in_worklist
);
6752 fibheap_insert (pending
, bb_order
[bb
->index
], bb
);
6753 bitmap_ones (in_pending
);
6755 while (success
&& !fibheap_empty (pending
))
6757 fibheap_swap
= pending
;
6759 worklist
= fibheap_swap
;
6760 sbitmap_swap
= in_pending
;
6761 in_pending
= in_worklist
;
6762 in_worklist
= sbitmap_swap
;
6764 bitmap_clear (visited
);
6766 while (!fibheap_empty (worklist
))
6768 bb
= (basic_block
) fibheap_extract_min (worklist
);
6769 bitmap_clear_bit (in_worklist
, bb
->index
);
6770 gcc_assert (!bitmap_bit_p (visited
, bb
->index
));
6771 if (!bitmap_bit_p (visited
, bb
->index
))
6775 int oldinsz
, oldoutsz
;
6777 bitmap_set_bit (visited
, bb
->index
);
6779 if (VTI (bb
)->in
.vars
)
6782 -= (htab_size (shared_hash_htab (VTI (bb
)->in
.vars
))
6783 + htab_size (shared_hash_htab (VTI (bb
)->out
.vars
)));
6785 = htab_elements (shared_hash_htab (VTI (bb
)->in
.vars
));
6787 = htab_elements (shared_hash_htab (VTI (bb
)->out
.vars
));
6790 oldinsz
= oldoutsz
= 0;
6792 if (MAY_HAVE_DEBUG_INSNS
)
6794 dataflow_set
*in
= &VTI (bb
)->in
, *first_out
= NULL
;
6795 bool first
= true, adjust
= false;
6797 /* Calculate the IN set as the intersection of
6798 predecessor OUT sets. */
6800 dataflow_set_clear (in
);
6801 dst_can_be_shared
= true;
6803 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6804 if (!VTI (e
->src
)->flooded
)
6805 gcc_assert (bb_order
[bb
->index
]
6806 <= bb_order
[e
->src
->index
]);
6809 dataflow_set_copy (in
, &VTI (e
->src
)->out
);
6810 first_out
= &VTI (e
->src
)->out
;
6815 dataflow_set_merge (in
, &VTI (e
->src
)->out
);
6821 dataflow_post_merge_adjust (in
, &VTI (bb
)->permp
);
6823 /* Merge and merge_adjust should keep entries in
6825 htab_traverse (shared_hash_htab (in
->vars
),
6826 canonicalize_loc_order_check
,
6829 if (dst_can_be_shared
)
6831 shared_hash_destroy (in
->vars
);
6832 in
->vars
= shared_hash_copy (first_out
->vars
);
6836 VTI (bb
)->flooded
= true;
6840 /* Calculate the IN set as union of predecessor OUT sets. */
6841 dataflow_set_clear (&VTI (bb
)->in
);
6842 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6843 dataflow_set_union (&VTI (bb
)->in
, &VTI (e
->src
)->out
);
6846 changed
= compute_bb_dataflow (bb
);
6847 htabsz
+= (htab_size (shared_hash_htab (VTI (bb
)->in
.vars
))
6848 + htab_size (shared_hash_htab (VTI (bb
)->out
.vars
)));
6850 if (htabmax
&& htabsz
> htabmax
)
6852 if (MAY_HAVE_DEBUG_INSNS
)
6853 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
6854 "variable tracking size limit exceeded with "
6855 "-fvar-tracking-assignments, retrying without");
6857 inform (DECL_SOURCE_LOCATION (cfun
->decl
),
6858 "variable tracking size limit exceeded");
6865 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6867 if (e
->dest
== EXIT_BLOCK_PTR
)
6870 if (bitmap_bit_p (visited
, e
->dest
->index
))
6872 if (!bitmap_bit_p (in_pending
, e
->dest
->index
))
6874 /* Send E->DEST to next round. */
6875 bitmap_set_bit (in_pending
, e
->dest
->index
);
6876 fibheap_insert (pending
,
6877 bb_order
[e
->dest
->index
],
6881 else if (!bitmap_bit_p (in_worklist
, e
->dest
->index
))
6883 /* Add E->DEST to current round. */
6884 bitmap_set_bit (in_worklist
, e
->dest
->index
);
6885 fibheap_insert (worklist
, bb_order
[e
->dest
->index
],
6893 "BB %i: in %i (was %i), out %i (was %i), rem %i + %i, tsz %i\n",
6895 (int)htab_elements (shared_hash_htab (VTI (bb
)->in
.vars
)),
6897 (int)htab_elements (shared_hash_htab (VTI (bb
)->out
.vars
)),
6899 (int)worklist
->nodes
, (int)pending
->nodes
, htabsz
);
6901 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
6903 fprintf (dump_file
, "BB %i IN:\n", bb
->index
);
6904 dump_dataflow_set (&VTI (bb
)->in
);
6905 fprintf (dump_file
, "BB %i OUT:\n", bb
->index
);
6906 dump_dataflow_set (&VTI (bb
)->out
);
6912 if (success
&& MAY_HAVE_DEBUG_INSNS
)
6914 gcc_assert (VTI (bb
)->flooded
);
6917 fibheap_delete (worklist
);
6918 fibheap_delete (pending
);
6919 sbitmap_free (visited
);
6920 sbitmap_free (in_worklist
);
6921 sbitmap_free (in_pending
);
6923 timevar_pop (TV_VAR_TRACKING_DATAFLOW
);
6927 /* Print the content of the LIST to dump file. */
6930 dump_attrs_list (attrs list
)
6932 for (; list
; list
= list
->next
)
6934 if (dv_is_decl_p (list
->dv
))
6935 print_mem_expr (dump_file
, dv_as_decl (list
->dv
));
6937 print_rtl_single (dump_file
, dv_as_value (list
->dv
));
6938 fprintf (dump_file
, "+" HOST_WIDE_INT_PRINT_DEC
, list
->offset
);
6940 fprintf (dump_file
, "\n");
6943 /* Print the information about variable *SLOT to dump file. */
6946 dump_var_slot (void **slot
, void *data ATTRIBUTE_UNUSED
)
6948 variable var
= (variable
) *slot
;
6952 /* Continue traversing the hash table. */
6956 /* Print the information about variable VAR to dump file. */
6959 dump_var (variable var
)
6962 location_chain node
;
6964 if (dv_is_decl_p (var
->dv
))
6966 const_tree decl
= dv_as_decl (var
->dv
);
6968 if (DECL_NAME (decl
))
6970 fprintf (dump_file
, " name: %s",
6971 IDENTIFIER_POINTER (DECL_NAME (decl
)));
6972 if (dump_flags
& TDF_UID
)
6973 fprintf (dump_file
, "D.%u", DECL_UID (decl
));
6975 else if (TREE_CODE (decl
) == DEBUG_EXPR_DECL
)
6976 fprintf (dump_file
, " name: D#%u", DEBUG_TEMP_UID (decl
));
6978 fprintf (dump_file
, " name: D.%u", DECL_UID (decl
));
6979 fprintf (dump_file
, "\n");
6983 fputc (' ', dump_file
);
6984 print_rtl_single (dump_file
, dv_as_value (var
->dv
));
6987 for (i
= 0; i
< var
->n_var_parts
; i
++)
6989 fprintf (dump_file
, " offset %ld\n",
6990 (long)(var
->onepart
? 0 : VAR_PART_OFFSET (var
, i
)));
6991 for (node
= var
->var_part
[i
].loc_chain
; node
; node
= node
->next
)
6993 fprintf (dump_file
, " ");
6994 if (node
->init
== VAR_INIT_STATUS_UNINITIALIZED
)
6995 fprintf (dump_file
, "[uninit]");
6996 print_rtl_single (dump_file
, node
->loc
);
7001 /* Print the information about variables from hash table VARS to dump file. */
7004 dump_vars (htab_t vars
)
7006 if (htab_elements (vars
) > 0)
7008 fprintf (dump_file
, "Variables:\n");
7009 htab_traverse (vars
, dump_var_slot
, NULL
);
7013 /* Print the dataflow set SET to dump file. */
7016 dump_dataflow_set (dataflow_set
*set
)
7020 fprintf (dump_file
, "Stack adjustment: " HOST_WIDE_INT_PRINT_DEC
"\n",
7022 for (i
= 0; i
< FIRST_PSEUDO_REGISTER
; i
++)
7026 fprintf (dump_file
, "Reg %d:", i
);
7027 dump_attrs_list (set
->regs
[i
]);
7030 dump_vars (shared_hash_htab (set
->vars
));
7031 fprintf (dump_file
, "\n");
7034 /* Print the IN and OUT sets for each basic block to dump file. */
7037 dump_dataflow_sets (void)
7043 fprintf (dump_file
, "\nBasic block %d:\n", bb
->index
);
7044 fprintf (dump_file
, "IN:\n");
7045 dump_dataflow_set (&VTI (bb
)->in
);
7046 fprintf (dump_file
, "OUT:\n");
7047 dump_dataflow_set (&VTI (bb
)->out
);
7051 /* Return the variable for DV in dropped_values, inserting one if
7052 requested with INSERT. */
7054 static inline variable
7055 variable_from_dropped (decl_or_value dv
, enum insert_option insert
)
7059 onepart_enum_t onepart
;
7061 slot
= htab_find_slot_with_hash (dropped_values
, dv
, dv_htab_hash (dv
),
7068 return (variable
) *slot
;
7070 gcc_checking_assert (insert
== INSERT
);
7072 onepart
= dv_onepart_p (dv
);
7074 gcc_checking_assert (onepart
== ONEPART_VALUE
|| onepart
== ONEPART_DEXPR
);
7076 empty_var
= (variable
) pool_alloc (onepart_pool (onepart
));
7078 empty_var
->refcount
= 1;
7079 empty_var
->n_var_parts
= 0;
7080 empty_var
->onepart
= onepart
;
7081 empty_var
->in_changed_variables
= false;
7082 empty_var
->var_part
[0].loc_chain
= NULL
;
7083 empty_var
->var_part
[0].cur_loc
= NULL
;
7084 VAR_LOC_1PAUX (empty_var
) = NULL
;
7085 set_dv_changed (dv
, true);
7092 /* Recover the one-part aux from dropped_values. */
7094 static struct onepart_aux
*
7095 recover_dropped_1paux (variable var
)
7099 gcc_checking_assert (var
->onepart
);
7101 if (VAR_LOC_1PAUX (var
))
7102 return VAR_LOC_1PAUX (var
);
7104 if (var
->onepart
== ONEPART_VDECL
)
7107 dvar
= variable_from_dropped (var
->dv
, NO_INSERT
);
7112 VAR_LOC_1PAUX (var
) = VAR_LOC_1PAUX (dvar
);
7113 VAR_LOC_1PAUX (dvar
) = NULL
;
7115 return VAR_LOC_1PAUX (var
);
7118 /* Add variable VAR to the hash table of changed variables and
7119 if it has no locations delete it from SET's hash table. */
7122 variable_was_changed (variable var
, dataflow_set
*set
)
7124 hashval_t hash
= dv_htab_hash (var
->dv
);
7130 /* Remember this decl or VALUE has been added to changed_variables. */
7131 set_dv_changed (var
->dv
, true);
7133 slot
= htab_find_slot_with_hash (changed_variables
,
7139 variable old_var
= (variable
) *slot
;
7140 gcc_assert (old_var
->in_changed_variables
);
7141 old_var
->in_changed_variables
= false;
7142 if (var
!= old_var
&& var
->onepart
)
7144 /* Restore the auxiliary info from an empty variable
7145 previously created for changed_variables, so it is
7147 gcc_checking_assert (!VAR_LOC_1PAUX (var
));
7148 VAR_LOC_1PAUX (var
) = VAR_LOC_1PAUX (old_var
);
7149 VAR_LOC_1PAUX (old_var
) = NULL
;
7151 variable_htab_free (*slot
);
7154 if (set
&& var
->n_var_parts
== 0)
7156 onepart_enum_t onepart
= var
->onepart
;
7157 variable empty_var
= NULL
;
7158 void **dslot
= NULL
;
7160 if (onepart
== ONEPART_VALUE
|| onepart
== ONEPART_DEXPR
)
7162 dslot
= htab_find_slot_with_hash (dropped_values
, var
->dv
,
7163 dv_htab_hash (var
->dv
),
7165 empty_var
= (variable
) *dslot
;
7169 gcc_checking_assert (!empty_var
->in_changed_variables
);
7170 if (!VAR_LOC_1PAUX (var
))
7172 VAR_LOC_1PAUX (var
) = VAR_LOC_1PAUX (empty_var
);
7173 VAR_LOC_1PAUX (empty_var
) = NULL
;
7176 gcc_checking_assert (!VAR_LOC_1PAUX (empty_var
));
7182 empty_var
= (variable
) pool_alloc (onepart_pool (onepart
));
7183 empty_var
->dv
= var
->dv
;
7184 empty_var
->refcount
= 1;
7185 empty_var
->n_var_parts
= 0;
7186 empty_var
->onepart
= onepart
;
7189 empty_var
->refcount
++;
7194 empty_var
->refcount
++;
7195 empty_var
->in_changed_variables
= true;
7199 empty_var
->var_part
[0].loc_chain
= NULL
;
7200 empty_var
->var_part
[0].cur_loc
= NULL
;
7201 VAR_LOC_1PAUX (empty_var
) = VAR_LOC_1PAUX (var
);
7202 VAR_LOC_1PAUX (var
) = NULL
;
7208 if (var
->onepart
&& !VAR_LOC_1PAUX (var
))
7209 recover_dropped_1paux (var
);
7211 var
->in_changed_variables
= true;
7218 if (var
->n_var_parts
== 0)
7223 slot
= shared_hash_find_slot_noinsert (set
->vars
, var
->dv
);
7226 if (shared_hash_shared (set
->vars
))
7227 slot
= shared_hash_find_slot_unshare (&set
->vars
, var
->dv
,
7229 htab_clear_slot (shared_hash_htab (set
->vars
), slot
);
7235 /* Look for the index in VAR->var_part corresponding to OFFSET.
7236 Return -1 if not found. If INSERTION_POINT is non-NULL, the
7237 referenced int will be set to the index that the part has or should
7238 have, if it should be inserted. */
7241 find_variable_location_part (variable var
, HOST_WIDE_INT offset
,
7242 int *insertion_point
)
7251 if (insertion_point
)
7252 *insertion_point
= 0;
7254 return var
->n_var_parts
- 1;
7257 /* Find the location part. */
7259 high
= var
->n_var_parts
;
7262 pos
= (low
+ high
) / 2;
7263 if (VAR_PART_OFFSET (var
, pos
) < offset
)
7270 if (insertion_point
)
7271 *insertion_point
= pos
;
7273 if (pos
< var
->n_var_parts
&& VAR_PART_OFFSET (var
, pos
) == offset
)
7280 set_slot_part (dataflow_set
*set
, rtx loc
, void **slot
,
7281 decl_or_value dv
, HOST_WIDE_INT offset
,
7282 enum var_init_status initialized
, rtx set_src
)
7285 location_chain node
, next
;
7286 location_chain
*nextp
;
7288 onepart_enum_t onepart
;
7290 var
= (variable
) *slot
;
7293 onepart
= var
->onepart
;
7295 onepart
= dv_onepart_p (dv
);
7297 gcc_checking_assert (offset
== 0 || !onepart
);
7298 gcc_checking_assert (loc
!= dv_as_opaque (dv
));
7300 if (! flag_var_tracking_uninit
)
7301 initialized
= VAR_INIT_STATUS_INITIALIZED
;
7305 /* Create new variable information. */
7306 var
= (variable
) pool_alloc (onepart_pool (onepart
));
7309 var
->n_var_parts
= 1;
7310 var
->onepart
= onepart
;
7311 var
->in_changed_variables
= false;
7313 VAR_LOC_1PAUX (var
) = NULL
;
7315 VAR_PART_OFFSET (var
, 0) = offset
;
7316 var
->var_part
[0].loc_chain
= NULL
;
7317 var
->var_part
[0].cur_loc
= NULL
;
7320 nextp
= &var
->var_part
[0].loc_chain
;
7326 gcc_assert (dv_as_opaque (var
->dv
) == dv_as_opaque (dv
));
7330 if (GET_CODE (loc
) == VALUE
)
7332 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
7333 nextp
= &node
->next
)
7334 if (GET_CODE (node
->loc
) == VALUE
)
7336 if (node
->loc
== loc
)
7341 if (canon_value_cmp (node
->loc
, loc
))
7349 else if (REG_P (node
->loc
) || MEM_P (node
->loc
))
7357 else if (REG_P (loc
))
7359 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
7360 nextp
= &node
->next
)
7361 if (REG_P (node
->loc
))
7363 if (REGNO (node
->loc
) < REGNO (loc
))
7367 if (REGNO (node
->loc
) == REGNO (loc
))
7380 else if (MEM_P (loc
))
7382 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
7383 nextp
= &node
->next
)
7384 if (REG_P (node
->loc
))
7386 else if (MEM_P (node
->loc
))
7388 if ((r
= loc_cmp (XEXP (node
->loc
, 0), XEXP (loc
, 0))) >= 0)
7400 for (nextp
= &var
->var_part
[0].loc_chain
; (node
= *nextp
);
7401 nextp
= &node
->next
)
7402 if ((r
= loc_cmp (node
->loc
, loc
)) >= 0)
7410 if (shared_var_p (var
, set
->vars
))
7412 slot
= unshare_variable (set
, slot
, var
, initialized
);
7413 var
= (variable
)*slot
;
7414 for (nextp
= &var
->var_part
[0].loc_chain
; c
;
7415 nextp
= &(*nextp
)->next
)
7417 gcc_assert ((!node
&& !*nextp
) || node
->loc
== (*nextp
)->loc
);
7424 gcc_assert (dv_as_decl (var
->dv
) == dv_as_decl (dv
));
7426 pos
= find_variable_location_part (var
, offset
, &inspos
);
7430 node
= var
->var_part
[pos
].loc_chain
;
7433 && ((REG_P (node
->loc
) && REG_P (loc
)
7434 && REGNO (node
->loc
) == REGNO (loc
))
7435 || rtx_equal_p (node
->loc
, loc
)))
7437 /* LOC is in the beginning of the chain so we have nothing
7439 if (node
->init
< initialized
)
7440 node
->init
= initialized
;
7441 if (set_src
!= NULL
)
7442 node
->set_src
= set_src
;
7448 /* We have to make a copy of a shared variable. */
7449 if (shared_var_p (var
, set
->vars
))
7451 slot
= unshare_variable (set
, slot
, var
, initialized
);
7452 var
= (variable
)*slot
;
7458 /* We have not found the location part, new one will be created. */
7460 /* We have to make a copy of the shared variable. */
7461 if (shared_var_p (var
, set
->vars
))
7463 slot
= unshare_variable (set
, slot
, var
, initialized
);
7464 var
= (variable
)*slot
;
7467 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
7468 thus there are at most MAX_VAR_PARTS different offsets. */
7469 gcc_assert (var
->n_var_parts
< MAX_VAR_PARTS
7470 && (!var
->n_var_parts
|| !onepart
));
7472 /* We have to move the elements of array starting at index
7473 inspos to the next position. */
7474 for (pos
= var
->n_var_parts
; pos
> inspos
; pos
--)
7475 var
->var_part
[pos
] = var
->var_part
[pos
- 1];
7478 gcc_checking_assert (!onepart
);
7479 VAR_PART_OFFSET (var
, pos
) = offset
;
7480 var
->var_part
[pos
].loc_chain
= NULL
;
7481 var
->var_part
[pos
].cur_loc
= NULL
;
7484 /* Delete the location from the list. */
7485 nextp
= &var
->var_part
[pos
].loc_chain
;
7486 for (node
= var
->var_part
[pos
].loc_chain
; node
; node
= next
)
7489 if ((REG_P (node
->loc
) && REG_P (loc
)
7490 && REGNO (node
->loc
) == REGNO (loc
))
7491 || rtx_equal_p (node
->loc
, loc
))
7493 /* Save these values, to assign to the new node, before
7494 deleting this one. */
7495 if (node
->init
> initialized
)
7496 initialized
= node
->init
;
7497 if (node
->set_src
!= NULL
&& set_src
== NULL
)
7498 set_src
= node
->set_src
;
7499 if (var
->var_part
[pos
].cur_loc
== node
->loc
)
7500 var
->var_part
[pos
].cur_loc
= NULL
;
7501 pool_free (loc_chain_pool
, node
);
7506 nextp
= &node
->next
;
7509 nextp
= &var
->var_part
[pos
].loc_chain
;
7512 /* Add the location to the beginning. */
7513 node
= (location_chain
) pool_alloc (loc_chain_pool
);
7515 node
->init
= initialized
;
7516 node
->set_src
= set_src
;
7517 node
->next
= *nextp
;
7520 /* If no location was emitted do so. */
7521 if (var
->var_part
[pos
].cur_loc
== NULL
)
7522 variable_was_changed (var
, set
);
7527 /* Set the part of variable's location in the dataflow set SET. The
7528 variable part is specified by variable's declaration in DV and
7529 offset OFFSET and the part's location by LOC. IOPT should be
7530 NO_INSERT if the variable is known to be in SET already and the
7531 variable hash table must not be resized, and INSERT otherwise. */
7534 set_variable_part (dataflow_set
*set
, rtx loc
,
7535 decl_or_value dv
, HOST_WIDE_INT offset
,
7536 enum var_init_status initialized
, rtx set_src
,
7537 enum insert_option iopt
)
7541 if (iopt
== NO_INSERT
)
7542 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
7545 slot
= shared_hash_find_slot (set
->vars
, dv
);
7547 slot
= shared_hash_find_slot_unshare (&set
->vars
, dv
, iopt
);
7549 set_slot_part (set
, loc
, slot
, dv
, offset
, initialized
, set_src
);
7552 /* Remove all recorded register locations for the given variable part
7553 from dataflow set SET, except for those that are identical to loc.
7554 The variable part is specified by variable's declaration or value
7555 DV and offset OFFSET. */
7558 clobber_slot_part (dataflow_set
*set
, rtx loc
, void **slot
,
7559 HOST_WIDE_INT offset
, rtx set_src
)
7561 variable var
= (variable
) *slot
;
7562 int pos
= find_variable_location_part (var
, offset
, NULL
);
7566 location_chain node
, next
;
7568 /* Remove the register locations from the dataflow set. */
7569 next
= var
->var_part
[pos
].loc_chain
;
7570 for (node
= next
; node
; node
= next
)
7573 if (node
->loc
!= loc
7574 && (!flag_var_tracking_uninit
7577 || !rtx_equal_p (set_src
, node
->set_src
)))
7579 if (REG_P (node
->loc
))
7584 /* Remove the variable part from the register's
7585 list, but preserve any other variable parts
7586 that might be regarded as live in that same
7588 anextp
= &set
->regs
[REGNO (node
->loc
)];
7589 for (anode
= *anextp
; anode
; anode
= anext
)
7591 anext
= anode
->next
;
7592 if (dv_as_opaque (anode
->dv
) == dv_as_opaque (var
->dv
)
7593 && anode
->offset
== offset
)
7595 pool_free (attrs_pool
, anode
);
7599 anextp
= &anode
->next
;
7603 slot
= delete_slot_part (set
, node
->loc
, slot
, offset
);
7611 /* Remove all recorded register locations for the given variable part
7612 from dataflow set SET, except for those that are identical to loc.
7613 The variable part is specified by variable's declaration or value
7614 DV and offset OFFSET. */
7617 clobber_variable_part (dataflow_set
*set
, rtx loc
, decl_or_value dv
,
7618 HOST_WIDE_INT offset
, rtx set_src
)
7622 if (!dv_as_opaque (dv
)
7623 || (!dv_is_value_p (dv
) && ! DECL_P (dv_as_decl (dv
))))
7626 slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
7630 clobber_slot_part (set
, loc
, slot
, offset
, set_src
);
7633 /* Delete the part of variable's location from dataflow set SET. The
7634 variable part is specified by its SET->vars slot SLOT and offset
7635 OFFSET and the part's location by LOC. */
7638 delete_slot_part (dataflow_set
*set
, rtx loc
, void **slot
,
7639 HOST_WIDE_INT offset
)
7641 variable var
= (variable
) *slot
;
7642 int pos
= find_variable_location_part (var
, offset
, NULL
);
7646 location_chain node
, next
;
7647 location_chain
*nextp
;
7651 if (shared_var_p (var
, set
->vars
))
7653 /* If the variable contains the location part we have to
7654 make a copy of the variable. */
7655 for (node
= var
->var_part
[pos
].loc_chain
; node
;
7658 if ((REG_P (node
->loc
) && REG_P (loc
)
7659 && REGNO (node
->loc
) == REGNO (loc
))
7660 || rtx_equal_p (node
->loc
, loc
))
7662 slot
= unshare_variable (set
, slot
, var
,
7663 VAR_INIT_STATUS_UNKNOWN
);
7664 var
= (variable
)*slot
;
7670 if (pos
== 0 && var
->onepart
&& VAR_LOC_1PAUX (var
))
7671 cur_loc
= VAR_LOC_FROM (var
);
7673 cur_loc
= var
->var_part
[pos
].cur_loc
;
7675 /* Delete the location part. */
7677 nextp
= &var
->var_part
[pos
].loc_chain
;
7678 for (node
= *nextp
; node
; node
= next
)
7681 if ((REG_P (node
->loc
) && REG_P (loc
)
7682 && REGNO (node
->loc
) == REGNO (loc
))
7683 || rtx_equal_p (node
->loc
, loc
))
7685 /* If we have deleted the location which was last emitted
7686 we have to emit new location so add the variable to set
7687 of changed variables. */
7688 if (cur_loc
== node
->loc
)
7691 var
->var_part
[pos
].cur_loc
= NULL
;
7692 if (pos
== 0 && var
->onepart
&& VAR_LOC_1PAUX (var
))
7693 VAR_LOC_FROM (var
) = NULL
;
7695 pool_free (loc_chain_pool
, node
);
7700 nextp
= &node
->next
;
7703 if (var
->var_part
[pos
].loc_chain
== NULL
)
7707 while (pos
< var
->n_var_parts
)
7709 var
->var_part
[pos
] = var
->var_part
[pos
+ 1];
7714 variable_was_changed (var
, set
);
7720 /* Delete the part of variable's location from dataflow set SET. The
7721 variable part is specified by variable's declaration or value DV
7722 and offset OFFSET and the part's location by LOC. */
7725 delete_variable_part (dataflow_set
*set
, rtx loc
, decl_or_value dv
,
7726 HOST_WIDE_INT offset
)
7728 void **slot
= shared_hash_find_slot_noinsert (set
->vars
, dv
);
7732 delete_slot_part (set
, loc
, slot
, offset
);
7736 /* Structure for passing some other parameters to function
7737 vt_expand_loc_callback. */
7738 struct expand_loc_callback_data
7740 /* The variables and values active at this point. */
7743 /* Stack of values and debug_exprs under expansion, and their
7745 vec
<rtx
, va_stack
> expanding
;
7747 /* Stack of values and debug_exprs whose expansion hit recursion
7748 cycles. They will have VALUE_RECURSED_INTO marked when added to
7749 this list. This flag will be cleared if any of its dependencies
7750 resolves to a valid location. So, if the flag remains set at the
7751 end of the search, we know no valid location for this one can
7753 vec
<rtx
, va_stack
> pending
;
7755 /* The maximum depth among the sub-expressions under expansion.
7756 Zero indicates no expansion so far. */
7760 /* Allocate the one-part auxiliary data structure for VAR, with enough
7761 room for COUNT dependencies. */
7764 loc_exp_dep_alloc (variable var
, int count
)
7768 gcc_checking_assert (var
->onepart
);
7770 /* We can be called with COUNT == 0 to allocate the data structure
7771 without any dependencies, e.g. for the backlinks only. However,
7772 if we are specifying a COUNT, then the dependency list must have
7773 been emptied before. It would be possible to adjust pointers or
7774 force it empty here, but this is better done at an earlier point
7775 in the algorithm, so we instead leave an assertion to catch
7777 gcc_checking_assert (!count
7778 || VAR_LOC_DEP_VEC (var
) == NULL
7779 || VAR_LOC_DEP_VEC (var
)->is_empty ());
7781 if (VAR_LOC_1PAUX (var
) && VAR_LOC_DEP_VEC (var
)->space (count
))
7784 allocsize
= offsetof (struct onepart_aux
, deps
)
7785 + vec
<loc_exp_dep
, va_heap
, vl_embed
>::embedded_size (count
);
7787 if (VAR_LOC_1PAUX (var
))
7789 VAR_LOC_1PAUX (var
) = XRESIZEVAR (struct onepart_aux
,
7790 VAR_LOC_1PAUX (var
), allocsize
);
7791 /* If the reallocation moves the onepaux structure, the
7792 back-pointer to BACKLINKS in the first list member will still
7793 point to its old location. Adjust it. */
7794 if (VAR_LOC_DEP_LST (var
))
7795 VAR_LOC_DEP_LST (var
)->pprev
= VAR_LOC_DEP_LSTP (var
);
7799 VAR_LOC_1PAUX (var
) = XNEWVAR (struct onepart_aux
, allocsize
);
7800 *VAR_LOC_DEP_LSTP (var
) = NULL
;
7801 VAR_LOC_FROM (var
) = NULL
;
7802 VAR_LOC_DEPTH (var
).complexity
= 0;
7803 VAR_LOC_DEPTH (var
).entryvals
= 0;
7805 VAR_LOC_DEP_VEC (var
)->embedded_init (count
);
7808 /* Remove all entries from the vector of active dependencies of VAR,
7809 removing them from the back-links lists too. */
7812 loc_exp_dep_clear (variable var
)
7814 while (VAR_LOC_DEP_VEC (var
) && !VAR_LOC_DEP_VEC (var
)->is_empty ())
7816 loc_exp_dep
*led
= &VAR_LOC_DEP_VEC (var
)->last ();
7818 led
->next
->pprev
= led
->pprev
;
7820 *led
->pprev
= led
->next
;
7821 VAR_LOC_DEP_VEC (var
)->pop ();
7825 /* Insert an active dependency from VAR on X to the vector of
7826 dependencies, and add the corresponding back-link to X's list of
7827 back-links in VARS. */
7830 loc_exp_insert_dep (variable var
, rtx x
, htab_t vars
)
7836 dv
= dv_from_rtx (x
);
7838 /* ??? Build a vector of variables parallel to EXPANDING, to avoid
7839 an additional look up? */
7840 xvar
= (variable
) htab_find_with_hash (vars
, dv
, dv_htab_hash (dv
));
7844 xvar
= variable_from_dropped (dv
, NO_INSERT
);
7845 gcc_checking_assert (xvar
);
7848 /* No point in adding the same backlink more than once. This may
7849 arise if say the same value appears in two complex expressions in
7850 the same loc_list, or even more than once in a single
7852 if (VAR_LOC_DEP_LST (xvar
) && VAR_LOC_DEP_LST (xvar
)->dv
== var
->dv
)
7855 if (var
->onepart
== NOT_ONEPART
)
7856 led
= (loc_exp_dep
*) pool_alloc (loc_exp_dep_pool
);
7860 memset (&empty
, 0, sizeof (empty
));
7861 VAR_LOC_DEP_VEC (var
)->quick_push (empty
);
7862 led
= &VAR_LOC_DEP_VEC (var
)->last ();
7867 loc_exp_dep_alloc (xvar
, 0);
7868 led
->pprev
= VAR_LOC_DEP_LSTP (xvar
);
7869 led
->next
= *led
->pprev
;
7871 led
->next
->pprev
= &led
->next
;
7875 /* Create active dependencies of VAR on COUNT values starting at
7876 VALUE, and corresponding back-links to the entries in VARS. Return
7877 true if we found any pending-recursion results. */
7880 loc_exp_dep_set (variable var
, rtx result
, rtx
*value
, int count
, htab_t vars
)
7882 bool pending_recursion
= false;
7884 gcc_checking_assert (VAR_LOC_DEP_VEC (var
) == NULL
7885 || VAR_LOC_DEP_VEC (var
)->is_empty ());
7887 /* Set up all dependencies from last_child (as set up at the end of
7888 the loop above) to the end. */
7889 loc_exp_dep_alloc (var
, count
);
7895 if (!pending_recursion
)
7896 pending_recursion
= !result
&& VALUE_RECURSED_INTO (x
);
7898 loc_exp_insert_dep (var
, x
, vars
);
7901 return pending_recursion
;
7904 /* Notify the back-links of IVAR that are pending recursion that we
7905 have found a non-NIL value for it, so they are cleared for another
7906 attempt to compute a current location. */
7909 notify_dependents_of_resolved_value (variable ivar
, htab_t vars
)
7911 loc_exp_dep
*led
, *next
;
7913 for (led
= VAR_LOC_DEP_LST (ivar
); led
; led
= next
)
7915 decl_or_value dv
= led
->dv
;
7920 if (dv_is_value_p (dv
))
7922 rtx value
= dv_as_value (dv
);
7924 /* If we have already resolved it, leave it alone. */
7925 if (!VALUE_RECURSED_INTO (value
))
7928 /* Check that VALUE_RECURSED_INTO, true from the test above,
7929 implies NO_LOC_P. */
7930 gcc_checking_assert (NO_LOC_P (value
));
7932 /* We won't notify variables that are being expanded,
7933 because their dependency list is cleared before
7935 NO_LOC_P (value
) = false;
7936 VALUE_RECURSED_INTO (value
) = false;
7938 gcc_checking_assert (dv_changed_p (dv
));
7942 gcc_checking_assert (dv_onepart_p (dv
) != NOT_ONEPART
);
7943 if (!dv_changed_p (dv
))
7947 var
= (variable
) htab_find_with_hash (vars
, dv
, dv_htab_hash (dv
));
7950 var
= variable_from_dropped (dv
, NO_INSERT
);
7953 notify_dependents_of_resolved_value (var
, vars
);
7956 next
->pprev
= led
->pprev
;
7964 static rtx
vt_expand_loc_callback (rtx x
, bitmap regs
,
7965 int max_depth
, void *data
);
7967 /* Return the combined depth, when one sub-expression evaluated to
7968 BEST_DEPTH and the previous known depth was SAVED_DEPTH. */
7970 static inline expand_depth
7971 update_depth (expand_depth saved_depth
, expand_depth best_depth
)
7973 /* If we didn't find anything, stick with what we had. */
7974 if (!best_depth
.complexity
)
7977 /* If we found hadn't found anything, use the depth of the current
7978 expression. Do NOT add one extra level, we want to compute the
7979 maximum depth among sub-expressions. We'll increment it later,
7981 if (!saved_depth
.complexity
)
7984 /* Combine the entryval count so that regardless of which one we
7985 return, the entryval count is accurate. */
7986 best_depth
.entryvals
= saved_depth
.entryvals
7987 = best_depth
.entryvals
+ saved_depth
.entryvals
;
7989 if (saved_depth
.complexity
< best_depth
.complexity
)
7995 /* Expand VAR to a location RTX, updating its cur_loc. Use REGS and
7996 DATA for cselib expand callback. If PENDRECP is given, indicate in
7997 it whether any sub-expression couldn't be fully evaluated because
7998 it is pending recursion resolution. */
8001 vt_expand_var_loc_chain (variable var
, bitmap regs
, void *data
, bool *pendrecp
)
8003 struct expand_loc_callback_data
*elcd
8004 = (struct expand_loc_callback_data
*) data
;
8005 location_chain loc
, next
;
8007 int first_child
, result_first_child
, last_child
;
8008 bool pending_recursion
;
8009 rtx loc_from
= NULL
;
8010 struct elt_loc_list
*cloc
= NULL
;
8011 expand_depth depth
= { 0, 0 }, saved_depth
= elcd
->depth
;
8012 int wanted_entryvals
, found_entryvals
= 0;
8014 /* Clear all backlinks pointing at this, so that we're not notified
8015 while we're active. */
8016 loc_exp_dep_clear (var
);
8019 if (var
->onepart
== ONEPART_VALUE
)
8021 cselib_val
*val
= CSELIB_VAL_PTR (dv_as_value (var
->dv
));
8023 gcc_checking_assert (cselib_preserved_value_p (val
));
8028 first_child
= result_first_child
= last_child
8029 = elcd
->expanding
.length ();
8031 wanted_entryvals
= found_entryvals
;
8033 /* Attempt to expand each available location in turn. */
8034 for (next
= loc
= var
->n_var_parts
? var
->var_part
[0].loc_chain
: NULL
;
8035 loc
|| cloc
; loc
= next
)
8037 result_first_child
= last_child
;
8041 loc_from
= cloc
->loc
;
8044 if (unsuitable_loc (loc_from
))
8049 loc_from
= loc
->loc
;
8053 gcc_checking_assert (!unsuitable_loc (loc_from
));
8055 elcd
->depth
.complexity
= elcd
->depth
.entryvals
= 0;
8056 result
= cselib_expand_value_rtx_cb (loc_from
, regs
, EXPR_DEPTH
,
8057 vt_expand_loc_callback
, data
);
8058 last_child
= elcd
->expanding
.length ();
8062 depth
= elcd
->depth
;
8064 gcc_checking_assert (depth
.complexity
8065 || result_first_child
== last_child
);
8067 if (last_child
- result_first_child
!= 1)
8069 if (!depth
.complexity
&& GET_CODE (result
) == ENTRY_VALUE
)
8074 if (depth
.complexity
<= EXPR_USE_DEPTH
)
8076 if (depth
.entryvals
<= wanted_entryvals
)
8078 else if (!found_entryvals
|| depth
.entryvals
< found_entryvals
)
8079 found_entryvals
= depth
.entryvals
;
8085 /* Set it up in case we leave the loop. */
8086 depth
.complexity
= depth
.entryvals
= 0;
8088 result_first_child
= first_child
;
8091 if (!loc_from
&& wanted_entryvals
< found_entryvals
)
8093 /* We found entries with ENTRY_VALUEs and skipped them. Since
8094 we could not find any expansions without ENTRY_VALUEs, but we
8095 found at least one with them, go back and get an entry with
8096 the minimum number ENTRY_VALUE count that we found. We could
8097 avoid looping, but since each sub-loc is already resolved,
8098 the re-expansion should be trivial. ??? Should we record all
8099 attempted locs as dependencies, so that we retry the
8100 expansion should any of them change, in the hope it can give
8101 us a new entry without an ENTRY_VALUE? */
8102 elcd
->expanding
.truncate (first_child
);
8106 /* Register all encountered dependencies as active. */
8107 pending_recursion
= loc_exp_dep_set
8108 (var
, result
, elcd
->expanding
.address () + result_first_child
,
8109 last_child
- result_first_child
, elcd
->vars
);
8111 elcd
->expanding
.truncate (first_child
);
8113 /* Record where the expansion came from. */
8114 gcc_checking_assert (!result
|| !pending_recursion
);
8115 VAR_LOC_FROM (var
) = loc_from
;
8116 VAR_LOC_DEPTH (var
) = depth
;
8118 gcc_checking_assert (!depth
.complexity
== !result
);
8120 elcd
->depth
= update_depth (saved_depth
, depth
);
8122 /* Indicate whether any of the dependencies are pending recursion
8125 *pendrecp
= pending_recursion
;
8127 if (!pendrecp
|| !pending_recursion
)
8128 var
->var_part
[0].cur_loc
= result
;
8133 /* Callback for cselib_expand_value, that looks for expressions
8134 holding the value in the var-tracking hash tables. Return X for
8135 standard processing, anything else is to be used as-is. */
8138 vt_expand_loc_callback (rtx x
, bitmap regs
,
8139 int max_depth ATTRIBUTE_UNUSED
,
8142 struct expand_loc_callback_data
*elcd
8143 = (struct expand_loc_callback_data
*) data
;
8147 bool pending_recursion
= false;
8148 bool from_empty
= false;
8150 switch (GET_CODE (x
))
8153 subreg
= cselib_expand_value_rtx_cb (SUBREG_REG (x
), regs
,
8155 vt_expand_loc_callback
, data
);
8160 result
= simplify_gen_subreg (GET_MODE (x
), subreg
,
8161 GET_MODE (SUBREG_REG (x
)),
8164 /* Invalid SUBREGs are ok in debug info. ??? We could try
8165 alternate expansions for the VALUE as well. */
8167 result
= gen_rtx_raw_SUBREG (GET_MODE (x
), subreg
, SUBREG_BYTE (x
));
8173 dv
= dv_from_rtx (x
);
8180 elcd
->expanding
.safe_push (x
);
8182 /* Check that VALUE_RECURSED_INTO implies NO_LOC_P. */
8183 gcc_checking_assert (!VALUE_RECURSED_INTO (x
) || NO_LOC_P (x
));
8187 gcc_checking_assert (VALUE_RECURSED_INTO (x
) || !dv_changed_p (dv
));
8191 var
= (variable
) htab_find_with_hash (elcd
->vars
, dv
, dv_htab_hash (dv
));
8196 var
= variable_from_dropped (dv
, INSERT
);
8199 gcc_checking_assert (var
);
8201 if (!dv_changed_p (dv
))
8203 gcc_checking_assert (!NO_LOC_P (x
));
8204 gcc_checking_assert (var
->var_part
[0].cur_loc
);
8205 gcc_checking_assert (VAR_LOC_1PAUX (var
));
8206 gcc_checking_assert (VAR_LOC_1PAUX (var
)->depth
.complexity
);
8208 elcd
->depth
= update_depth (elcd
->depth
, VAR_LOC_1PAUX (var
)->depth
);
8210 return var
->var_part
[0].cur_loc
;
8213 VALUE_RECURSED_INTO (x
) = true;
8214 /* This is tentative, but it makes some tests simpler. */
8215 NO_LOC_P (x
) = true;
8217 gcc_checking_assert (var
->n_var_parts
== 1 || from_empty
);
8219 result
= vt_expand_var_loc_chain (var
, regs
, data
, &pending_recursion
);
8221 if (pending_recursion
)
8223 gcc_checking_assert (!result
);
8224 elcd
->pending
.safe_push (x
);
8228 NO_LOC_P (x
) = !result
;
8229 VALUE_RECURSED_INTO (x
) = false;
8230 set_dv_changed (dv
, false);
8233 notify_dependents_of_resolved_value (var
, elcd
->vars
);
8239 /* While expanding variables, we may encounter recursion cycles
8240 because of mutual (possibly indirect) dependencies between two
8241 particular variables (or values), say A and B. If we're trying to
8242 expand A when we get to B, which in turn attempts to expand A, if
8243 we can't find any other expansion for B, we'll add B to this
8244 pending-recursion stack, and tentatively return NULL for its
8245 location. This tentative value will be used for any other
8246 occurrences of B, unless A gets some other location, in which case
8247 it will notify B that it is worth another try at computing a
8248 location for it, and it will use the location computed for A then.
8249 At the end of the expansion, the tentative NULL locations become
8250 final for all members of PENDING that didn't get a notification.
8251 This function performs this finalization of NULL locations. */
8254 resolve_expansions_pending_recursion (vec
<rtx
, va_stack
> pending
)
8256 while (!pending
.is_empty ())
8258 rtx x
= pending
.pop ();
8261 if (!VALUE_RECURSED_INTO (x
))
8264 gcc_checking_assert (NO_LOC_P (x
));
8265 VALUE_RECURSED_INTO (x
) = false;
8266 dv
= dv_from_rtx (x
);
8267 gcc_checking_assert (dv_changed_p (dv
));
8268 set_dv_changed (dv
, false);
8272 /* Initialize expand_loc_callback_data D with variable hash table V.
8273 It must be a macro because of alloca (vec stack). */
8274 #define INIT_ELCD(d, v) \
8278 vec_stack_alloc (rtx, (d).expanding, 4); \
8279 vec_stack_alloc (rtx, (d).pending, 4); \
8280 (d).depth.complexity = (d).depth.entryvals = 0; \
8283 /* Finalize expand_loc_callback_data D, resolved to location L. */
8284 #define FINI_ELCD(d, l) \
8287 resolve_expansions_pending_recursion ((d).pending); \
8288 (d).pending.release (); \
8289 (d).expanding.release (); \
8291 if ((l) && MEM_P (l)) \
8292 (l) = targetm.delegitimize_address (l); \
8296 /* Expand VALUEs and DEBUG_EXPRs in LOC to a location, using the
8297 equivalences in VARS, updating their CUR_LOCs in the process. */
8300 vt_expand_loc (rtx loc
, htab_t vars
)
8302 struct expand_loc_callback_data data
;
8305 if (!MAY_HAVE_DEBUG_INSNS
)
8308 INIT_ELCD (data
, vars
);
8310 result
= cselib_expand_value_rtx_cb (loc
, scratch_regs
, EXPR_DEPTH
,
8311 vt_expand_loc_callback
, &data
);
8313 FINI_ELCD (data
, result
);
8318 /* Expand the one-part VARiable to a location, using the equivalences
8319 in VARS, updating their CUR_LOCs in the process. */
8322 vt_expand_1pvar (variable var
, htab_t vars
)
8324 struct expand_loc_callback_data data
;
8327 gcc_checking_assert (var
->onepart
&& var
->n_var_parts
== 1);
8329 if (!dv_changed_p (var
->dv
))
8330 return var
->var_part
[0].cur_loc
;
8332 INIT_ELCD (data
, vars
);
8334 loc
= vt_expand_var_loc_chain (var
, scratch_regs
, &data
, NULL
);
8336 gcc_checking_assert (data
.expanding
.is_empty ());
8338 FINI_ELCD (data
, loc
);
8343 /* Emit the NOTE_INSN_VAR_LOCATION for variable *VARP. DATA contains
8344 additional parameters: WHERE specifies whether the note shall be emitted
8345 before or after instruction INSN. */
8348 emit_note_insn_var_location (void **varp
, void *data
)
8350 variable var
= (variable
) *varp
;
8351 rtx insn
= ((emit_note_data
*)data
)->insn
;
8352 enum emit_note_where where
= ((emit_note_data
*)data
)->where
;
8353 htab_t vars
= ((emit_note_data
*)data
)->vars
;
8355 int i
, j
, n_var_parts
;
8357 enum var_init_status initialized
= VAR_INIT_STATUS_UNINITIALIZED
;
8358 HOST_WIDE_INT last_limit
;
8359 tree type_size_unit
;
8360 HOST_WIDE_INT offsets
[MAX_VAR_PARTS
];
8361 rtx loc
[MAX_VAR_PARTS
];
8365 gcc_checking_assert (var
->onepart
== NOT_ONEPART
8366 || var
->onepart
== ONEPART_VDECL
);
8368 decl
= dv_as_decl (var
->dv
);
8374 for (i
= 0; i
< var
->n_var_parts
; i
++)
8375 if (var
->var_part
[i
].cur_loc
== NULL
&& var
->var_part
[i
].loc_chain
)
8376 var
->var_part
[i
].cur_loc
= var
->var_part
[i
].loc_chain
->loc
;
8377 for (i
= 0; i
< var
->n_var_parts
; i
++)
8379 enum machine_mode mode
, wider_mode
;
8381 HOST_WIDE_INT offset
;
8383 if (i
== 0 && var
->onepart
)
8385 gcc_checking_assert (var
->n_var_parts
== 1);
8387 initialized
= VAR_INIT_STATUS_INITIALIZED
;
8388 loc2
= vt_expand_1pvar (var
, vars
);
8392 if (last_limit
< VAR_PART_OFFSET (var
, i
))
8397 else if (last_limit
> VAR_PART_OFFSET (var
, i
))
8399 offset
= VAR_PART_OFFSET (var
, i
);
8400 loc2
= var
->var_part
[i
].cur_loc
;
8401 if (loc2
&& GET_CODE (loc2
) == MEM
8402 && GET_CODE (XEXP (loc2
, 0)) == VALUE
)
8404 rtx depval
= XEXP (loc2
, 0);
8406 loc2
= vt_expand_loc (loc2
, vars
);
8409 loc_exp_insert_dep (var
, depval
, vars
);
8416 gcc_checking_assert (GET_CODE (loc2
) != VALUE
);
8417 for (lc
= var
->var_part
[i
].loc_chain
; lc
; lc
= lc
->next
)
8418 if (var
->var_part
[i
].cur_loc
== lc
->loc
)
8420 initialized
= lc
->init
;
8426 offsets
[n_var_parts
] = offset
;
8432 loc
[n_var_parts
] = loc2
;
8433 mode
= GET_MODE (var
->var_part
[i
].cur_loc
);
8434 if (mode
== VOIDmode
&& var
->onepart
)
8435 mode
= DECL_MODE (decl
);
8436 last_limit
= offsets
[n_var_parts
] + GET_MODE_SIZE (mode
);
8438 /* Attempt to merge adjacent registers or memory. */
8439 wider_mode
= GET_MODE_WIDER_MODE (mode
);
8440 for (j
= i
+ 1; j
< var
->n_var_parts
; j
++)
8441 if (last_limit
<= VAR_PART_OFFSET (var
, j
))
8443 if (j
< var
->n_var_parts
8444 && wider_mode
!= VOIDmode
8445 && var
->var_part
[j
].cur_loc
8446 && mode
== GET_MODE (var
->var_part
[j
].cur_loc
)
8447 && (REG_P (loc
[n_var_parts
]) || MEM_P (loc
[n_var_parts
]))
8448 && last_limit
== (var
->onepart
? 0 : VAR_PART_OFFSET (var
, j
))
8449 && (loc2
= vt_expand_loc (var
->var_part
[j
].cur_loc
, vars
))
8450 && GET_CODE (loc
[n_var_parts
]) == GET_CODE (loc2
))
8454 if (REG_P (loc
[n_var_parts
])
8455 && hard_regno_nregs
[REGNO (loc
[n_var_parts
])][mode
] * 2
8456 == hard_regno_nregs
[REGNO (loc
[n_var_parts
])][wider_mode
]
8457 && end_hard_regno (mode
, REGNO (loc
[n_var_parts
]))
8460 if (! WORDS_BIG_ENDIAN
&& ! BYTES_BIG_ENDIAN
)
8461 new_loc
= simplify_subreg (wider_mode
, loc
[n_var_parts
],
8463 else if (WORDS_BIG_ENDIAN
&& BYTES_BIG_ENDIAN
)
8464 new_loc
= simplify_subreg (wider_mode
, loc2
, mode
, 0);
8467 if (!REG_P (new_loc
)
8468 || REGNO (new_loc
) != REGNO (loc
[n_var_parts
]))
8471 REG_ATTRS (new_loc
) = REG_ATTRS (loc
[n_var_parts
]);
8474 else if (MEM_P (loc
[n_var_parts
])
8475 && GET_CODE (XEXP (loc2
, 0)) == PLUS
8476 && REG_P (XEXP (XEXP (loc2
, 0), 0))
8477 && CONST_INT_P (XEXP (XEXP (loc2
, 0), 1)))
8479 if ((REG_P (XEXP (loc
[n_var_parts
], 0))
8480 && rtx_equal_p (XEXP (loc
[n_var_parts
], 0),
8481 XEXP (XEXP (loc2
, 0), 0))
8482 && INTVAL (XEXP (XEXP (loc2
, 0), 1))
8483 == GET_MODE_SIZE (mode
))
8484 || (GET_CODE (XEXP (loc
[n_var_parts
], 0)) == PLUS
8485 && CONST_INT_P (XEXP (XEXP (loc
[n_var_parts
], 0), 1))
8486 && rtx_equal_p (XEXP (XEXP (loc
[n_var_parts
], 0), 0),
8487 XEXP (XEXP (loc2
, 0), 0))
8488 && INTVAL (XEXP (XEXP (loc
[n_var_parts
], 0), 1))
8489 + GET_MODE_SIZE (mode
)
8490 == INTVAL (XEXP (XEXP (loc2
, 0), 1))))
8491 new_loc
= adjust_address_nv (loc
[n_var_parts
],
8497 loc
[n_var_parts
] = new_loc
;
8499 last_limit
= offsets
[n_var_parts
] + GET_MODE_SIZE (mode
);
8505 type_size_unit
= TYPE_SIZE_UNIT (TREE_TYPE (decl
));
8506 if ((unsigned HOST_WIDE_INT
) last_limit
< TREE_INT_CST_LOW (type_size_unit
))
8509 if (! flag_var_tracking_uninit
)
8510 initialized
= VAR_INIT_STATUS_INITIALIZED
;
8514 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
, NULL_RTX
,
8516 else if (n_var_parts
== 1)
8520 if (offsets
[0] || GET_CODE (loc
[0]) == PARALLEL
)
8521 expr_list
= gen_rtx_EXPR_LIST (VOIDmode
, loc
[0], GEN_INT (offsets
[0]));
8525 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
, expr_list
,
8528 else if (n_var_parts
)
8532 for (i
= 0; i
< n_var_parts
; i
++)
8534 = gen_rtx_EXPR_LIST (VOIDmode
, loc
[i
], GEN_INT (offsets
[i
]));
8536 parallel
= gen_rtx_PARALLEL (VOIDmode
,
8537 gen_rtvec_v (n_var_parts
, loc
));
8538 note_vl
= gen_rtx_VAR_LOCATION (VOIDmode
, decl
,
8539 parallel
, (int) initialized
);
8542 if (where
!= EMIT_NOTE_BEFORE_INSN
)
8544 note
= emit_note_after (NOTE_INSN_VAR_LOCATION
, insn
);
8545 if (where
== EMIT_NOTE_AFTER_CALL_INSN
)
8546 NOTE_DURING_CALL_P (note
) = true;
8550 /* Make sure that the call related notes come first. */
8551 while (NEXT_INSN (insn
)
8553 && ((NOTE_KIND (insn
) == NOTE_INSN_VAR_LOCATION
8554 && NOTE_DURING_CALL_P (insn
))
8555 || NOTE_KIND (insn
) == NOTE_INSN_CALL_ARG_LOCATION
))
8556 insn
= NEXT_INSN (insn
);
8558 && ((NOTE_KIND (insn
) == NOTE_INSN_VAR_LOCATION
8559 && NOTE_DURING_CALL_P (insn
))
8560 || NOTE_KIND (insn
) == NOTE_INSN_CALL_ARG_LOCATION
))
8561 note
= emit_note_after (NOTE_INSN_VAR_LOCATION
, insn
);
8563 note
= emit_note_before (NOTE_INSN_VAR_LOCATION
, insn
);
8565 NOTE_VAR_LOCATION (note
) = note_vl
;
8567 set_dv_changed (var
->dv
, false);
8568 gcc_assert (var
->in_changed_variables
);
8569 var
->in_changed_variables
= false;
8570 htab_clear_slot (changed_variables
, varp
);
8572 /* Continue traversing the hash table. */
8576 /* While traversing changed_variables, push onto DATA (a stack of RTX
8577 values) entries that aren't user variables. */
8580 values_to_stack (void **slot
, void *data
)
8582 vec
<rtx
, va_stack
> *changed_values_stack
= (vec
<rtx
, va_stack
> *) data
;
8583 variable var
= (variable
) *slot
;
8585 if (var
->onepart
== ONEPART_VALUE
)
8586 changed_values_stack
->safe_push (dv_as_value (var
->dv
));
8587 else if (var
->onepart
== ONEPART_DEXPR
)
8588 changed_values_stack
->safe_push (DECL_RTL_KNOWN_SET (dv_as_decl (var
->dv
)));
8593 /* Remove from changed_variables the entry whose DV corresponds to
8594 value or debug_expr VAL. */
8596 remove_value_from_changed_variables (rtx val
)
8598 decl_or_value dv
= dv_from_rtx (val
);
8602 slot
= htab_find_slot_with_hash (changed_variables
,
8603 dv
, dv_htab_hash (dv
), NO_INSERT
);
8604 var
= (variable
) *slot
;
8605 var
->in_changed_variables
= false;
8606 htab_clear_slot (changed_variables
, slot
);
8609 /* If VAL (a value or debug_expr) has backlinks to variables actively
8610 dependent on it in HTAB or in CHANGED_VARIABLES, mark them as
8611 changed, adding to CHANGED_VALUES_STACK any dependencies that may
8612 have dependencies of their own to notify. */
8615 notify_dependents_of_changed_value (rtx val
, htab_t htab
,
8616 vec
<rtx
, va_stack
> *changed_values_stack
)
8621 decl_or_value dv
= dv_from_rtx (val
);
8623 slot
= htab_find_slot_with_hash (changed_variables
,
8624 dv
, dv_htab_hash (dv
), NO_INSERT
);
8626 slot
= htab_find_slot_with_hash (htab
,
8627 dv
, dv_htab_hash (dv
), NO_INSERT
);
8629 slot
= htab_find_slot_with_hash (dropped_values
,
8630 dv
, dv_htab_hash (dv
), NO_INSERT
);
8631 var
= (variable
) *slot
;
8633 while ((led
= VAR_LOC_DEP_LST (var
)))
8635 decl_or_value ldv
= led
->dv
;
8638 /* Deactivate and remove the backlink, as it was “used up”. It
8639 makes no sense to attempt to notify the same entity again:
8640 either it will be recomputed and re-register an active
8641 dependency, or it will still have the changed mark. */
8643 led
->next
->pprev
= led
->pprev
;
8645 *led
->pprev
= led
->next
;
8649 if (dv_changed_p (ldv
))
8652 switch (dv_onepart_p (ldv
))
8656 set_dv_changed (ldv
, true);
8657 changed_values_stack
->safe_push (dv_as_rtx (ldv
));
8661 ivar
= (variable
) htab_find_with_hash (htab
, ldv
, dv_htab_hash (ldv
));
8662 gcc_checking_assert (!VAR_LOC_DEP_LST (ivar
));
8663 variable_was_changed (ivar
, NULL
);
8667 pool_free (loc_exp_dep_pool
, led
);
8668 ivar
= (variable
) htab_find_with_hash (htab
, ldv
, dv_htab_hash (ldv
));
8671 int i
= ivar
->n_var_parts
;
8674 rtx loc
= ivar
->var_part
[i
].cur_loc
;
8676 if (loc
&& GET_CODE (loc
) == MEM
8677 && XEXP (loc
, 0) == val
)
8679 variable_was_changed (ivar
, NULL
);
8692 /* Take out of changed_variables any entries that don't refer to use
8693 variables. Back-propagate change notifications from values and
8694 debug_exprs to their active dependencies in HTAB or in
8695 CHANGED_VARIABLES. */
8698 process_changed_values (htab_t htab
)
8702 vec
<rtx
, va_stack
> changed_values_stack
;
8704 vec_stack_alloc (rtx
, changed_values_stack
, 20);
8706 /* Move values from changed_variables to changed_values_stack. */
8707 htab_traverse (changed_variables
, values_to_stack
, &changed_values_stack
);
8709 /* Back-propagate change notifications in values while popping
8710 them from the stack. */
8711 for (n
= i
= changed_values_stack
.length ();
8712 i
> 0; i
= changed_values_stack
.length ())
8714 val
= changed_values_stack
.pop ();
8715 notify_dependents_of_changed_value (val
, htab
, &changed_values_stack
);
8717 /* This condition will hold when visiting each of the entries
8718 originally in changed_variables. We can't remove them
8719 earlier because this could drop the backlinks before we got a
8720 chance to use them. */
8723 remove_value_from_changed_variables (val
);
8728 changed_values_stack
.release ();
8731 /* Emit NOTE_INSN_VAR_LOCATION note for each variable from a chain
8732 CHANGED_VARIABLES and delete this chain. WHERE specifies whether
8733 the notes shall be emitted before of after instruction INSN. */
8736 emit_notes_for_changes (rtx insn
, enum emit_note_where where
,
8739 emit_note_data data
;
8740 htab_t htab
= shared_hash_htab (vars
);
8742 if (!htab_elements (changed_variables
))
8745 if (MAY_HAVE_DEBUG_INSNS
)
8746 process_changed_values (htab
);
8752 htab_traverse (changed_variables
, emit_note_insn_var_location
, &data
);
8755 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it differs from the
8756 same variable in hash table DATA or is not there at all. */
8759 emit_notes_for_differences_1 (void **slot
, void *data
)
8761 htab_t new_vars
= (htab_t
) data
;
8762 variable old_var
, new_var
;
8764 old_var
= (variable
) *slot
;
8765 new_var
= (variable
) htab_find_with_hash (new_vars
, old_var
->dv
,
8766 dv_htab_hash (old_var
->dv
));
8770 /* Variable has disappeared. */
8771 variable empty_var
= NULL
;
8773 if (old_var
->onepart
== ONEPART_VALUE
8774 || old_var
->onepart
== ONEPART_DEXPR
)
8776 empty_var
= variable_from_dropped (old_var
->dv
, NO_INSERT
);
8779 gcc_checking_assert (!empty_var
->in_changed_variables
);
8780 if (!VAR_LOC_1PAUX (old_var
))
8782 VAR_LOC_1PAUX (old_var
) = VAR_LOC_1PAUX (empty_var
);
8783 VAR_LOC_1PAUX (empty_var
) = NULL
;
8786 gcc_checking_assert (!VAR_LOC_1PAUX (empty_var
));
8792 empty_var
= (variable
) pool_alloc (onepart_pool (old_var
->onepart
));
8793 empty_var
->dv
= old_var
->dv
;
8794 empty_var
->refcount
= 0;
8795 empty_var
->n_var_parts
= 0;
8796 empty_var
->onepart
= old_var
->onepart
;
8797 empty_var
->in_changed_variables
= false;
8800 if (empty_var
->onepart
)
8802 /* Propagate the auxiliary data to (ultimately)
8803 changed_variables. */
8804 empty_var
->var_part
[0].loc_chain
= NULL
;
8805 empty_var
->var_part
[0].cur_loc
= NULL
;
8806 VAR_LOC_1PAUX (empty_var
) = VAR_LOC_1PAUX (old_var
);
8807 VAR_LOC_1PAUX (old_var
) = NULL
;
8809 variable_was_changed (empty_var
, NULL
);
8810 /* Continue traversing the hash table. */
8813 /* Update cur_loc and one-part auxiliary data, before new_var goes
8814 through variable_was_changed. */
8815 if (old_var
!= new_var
&& new_var
->onepart
)
8817 gcc_checking_assert (VAR_LOC_1PAUX (new_var
) == NULL
);
8818 VAR_LOC_1PAUX (new_var
) = VAR_LOC_1PAUX (old_var
);
8819 VAR_LOC_1PAUX (old_var
) = NULL
;
8820 new_var
->var_part
[0].cur_loc
= old_var
->var_part
[0].cur_loc
;
8822 if (variable_different_p (old_var
, new_var
))
8823 variable_was_changed (new_var
, NULL
);
8825 /* Continue traversing the hash table. */
8829 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it is not in hash
8833 emit_notes_for_differences_2 (void **slot
, void *data
)
8835 htab_t old_vars
= (htab_t
) data
;
8836 variable old_var
, new_var
;
8838 new_var
= (variable
) *slot
;
8839 old_var
= (variable
) htab_find_with_hash (old_vars
, new_var
->dv
,
8840 dv_htab_hash (new_var
->dv
));
8844 for (i
= 0; i
< new_var
->n_var_parts
; i
++)
8845 new_var
->var_part
[i
].cur_loc
= NULL
;
8846 variable_was_changed (new_var
, NULL
);
8849 /* Continue traversing the hash table. */
8853 /* Emit notes before INSN for differences between dataflow sets OLD_SET and
8857 emit_notes_for_differences (rtx insn
, dataflow_set
*old_set
,
8858 dataflow_set
*new_set
)
8860 htab_traverse (shared_hash_htab (old_set
->vars
),
8861 emit_notes_for_differences_1
,
8862 shared_hash_htab (new_set
->vars
));
8863 htab_traverse (shared_hash_htab (new_set
->vars
),
8864 emit_notes_for_differences_2
,
8865 shared_hash_htab (old_set
->vars
));
8866 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
, new_set
->vars
);
8869 /* Return the next insn after INSN that is not a NOTE_INSN_VAR_LOCATION. */
8872 next_non_note_insn_var_location (rtx insn
)
8876 insn
= NEXT_INSN (insn
);
8879 || NOTE_KIND (insn
) != NOTE_INSN_VAR_LOCATION
)
8886 /* Emit the notes for changes of location parts in the basic block BB. */
8889 emit_notes_in_bb (basic_block bb
, dataflow_set
*set
)
8892 micro_operation
*mo
;
8894 dataflow_set_clear (set
);
8895 dataflow_set_copy (set
, &VTI (bb
)->in
);
8897 FOR_EACH_VEC_ELT (VTI (bb
)->mos
, i
, mo
)
8899 rtx insn
= mo
->insn
;
8900 rtx next_insn
= next_non_note_insn_var_location (insn
);
8905 dataflow_set_clear_at_call (set
);
8906 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_CALL_INSN
, set
->vars
);
8908 rtx arguments
= mo
->u
.loc
, *p
= &arguments
, note
;
8911 XEXP (XEXP (*p
, 0), 1)
8912 = vt_expand_loc (XEXP (XEXP (*p
, 0), 1),
8913 shared_hash_htab (set
->vars
));
8914 /* If expansion is successful, keep it in the list. */
8915 if (XEXP (XEXP (*p
, 0), 1))
8917 /* Otherwise, if the following item is data_value for it,
8919 else if (XEXP (*p
, 1)
8920 && REG_P (XEXP (XEXP (*p
, 0), 0))
8921 && MEM_P (XEXP (XEXP (XEXP (*p
, 1), 0), 0))
8922 && REG_P (XEXP (XEXP (XEXP (XEXP (*p
, 1), 0), 0),
8924 && REGNO (XEXP (XEXP (*p
, 0), 0))
8925 == REGNO (XEXP (XEXP (XEXP (XEXP (*p
, 1), 0),
8927 *p
= XEXP (XEXP (*p
, 1), 1);
8928 /* Just drop this item. */
8932 note
= emit_note_after (NOTE_INSN_CALL_ARG_LOCATION
, insn
);
8933 NOTE_VAR_LOCATION (note
) = arguments
;
8939 rtx loc
= mo
->u
.loc
;
8942 var_reg_set (set
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
8944 var_mem_set (set
, loc
, VAR_INIT_STATUS_UNINITIALIZED
, NULL
);
8946 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
8952 rtx loc
= mo
->u
.loc
;
8956 if (GET_CODE (loc
) == CONCAT
)
8958 val
= XEXP (loc
, 0);
8959 vloc
= XEXP (loc
, 1);
8967 var
= PAT_VAR_LOCATION_DECL (vloc
);
8969 clobber_variable_part (set
, NULL_RTX
,
8970 dv_from_decl (var
), 0, NULL_RTX
);
8973 if (VAL_NEEDS_RESOLUTION (loc
))
8974 val_resolve (set
, val
, PAT_VAR_LOCATION_LOC (vloc
), insn
);
8975 set_variable_part (set
, val
, dv_from_decl (var
), 0,
8976 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
8979 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc
)))
8980 set_variable_part (set
, PAT_VAR_LOCATION_LOC (vloc
),
8981 dv_from_decl (var
), 0,
8982 VAR_INIT_STATUS_INITIALIZED
, NULL_RTX
,
8985 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
8991 rtx loc
= mo
->u
.loc
;
8992 rtx val
, vloc
, uloc
;
8994 vloc
= uloc
= XEXP (loc
, 1);
8995 val
= XEXP (loc
, 0);
8997 if (GET_CODE (val
) == CONCAT
)
8999 uloc
= XEXP (val
, 1);
9000 val
= XEXP (val
, 0);
9003 if (VAL_NEEDS_RESOLUTION (loc
))
9004 val_resolve (set
, val
, vloc
, insn
);
9006 val_store (set
, val
, uloc
, insn
, false);
9008 if (VAL_HOLDS_TRACK_EXPR (loc
))
9010 if (GET_CODE (uloc
) == REG
)
9011 var_reg_set (set
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
9013 else if (GET_CODE (uloc
) == MEM
)
9014 var_mem_set (set
, uloc
, VAR_INIT_STATUS_UNINITIALIZED
,
9018 emit_notes_for_changes (insn
, EMIT_NOTE_BEFORE_INSN
, set
->vars
);
9024 rtx loc
= mo
->u
.loc
;
9025 rtx val
, vloc
, uloc
;
9029 uloc
= XEXP (vloc
, 1);
9030 val
= XEXP (vloc
, 0);
9033 if (GET_CODE (uloc
) == SET
)
9035 dstv
= SET_DEST (uloc
);
9036 srcv
= SET_SRC (uloc
);
9044 if (GET_CODE (val
) == CONCAT
)
9046 dstv
= vloc
= XEXP (val
, 1);
9047 val
= XEXP (val
, 0);
9050 if (GET_CODE (vloc
) == SET
)
9052 srcv
= SET_SRC (vloc
);
9054 gcc_assert (val
!= srcv
);
9055 gcc_assert (vloc
== uloc
|| VAL_NEEDS_RESOLUTION (loc
));
9057 dstv
= vloc
= SET_DEST (vloc
);
9059 if (VAL_NEEDS_RESOLUTION (loc
))
9060 val_resolve (set
, val
, srcv
, insn
);
9062 else if (VAL_NEEDS_RESOLUTION (loc
))
9064 gcc_assert (GET_CODE (uloc
) == SET
9065 && GET_CODE (SET_SRC (uloc
)) == REG
);
9066 val_resolve (set
, val
, SET_SRC (uloc
), insn
);
9069 if (VAL_HOLDS_TRACK_EXPR (loc
))
9071 if (VAL_EXPR_IS_CLOBBERED (loc
))
9074 var_reg_delete (set
, uloc
, true);
9075 else if (MEM_P (uloc
))
9077 gcc_assert (MEM_P (dstv
));
9078 gcc_assert (MEM_ATTRS (dstv
) == MEM_ATTRS (uloc
));
9079 var_mem_delete (set
, dstv
, true);
9084 bool copied_p
= VAL_EXPR_IS_COPIED (loc
);
9085 rtx src
= NULL
, dst
= uloc
;
9086 enum var_init_status status
= VAR_INIT_STATUS_INITIALIZED
;
9088 if (GET_CODE (uloc
) == SET
)
9090 src
= SET_SRC (uloc
);
9091 dst
= SET_DEST (uloc
);
9096 status
= find_src_status (set
, src
);
9098 src
= find_src_set_src (set
, src
);
9102 var_reg_delete_and_set (set
, dst
, !copied_p
,
9104 else if (MEM_P (dst
))
9106 gcc_assert (MEM_P (dstv
));
9107 gcc_assert (MEM_ATTRS (dstv
) == MEM_ATTRS (dst
));
9108 var_mem_delete_and_set (set
, dstv
, !copied_p
,
9113 else if (REG_P (uloc
))
9114 var_regno_delete (set
, REGNO (uloc
));
9115 else if (MEM_P (uloc
))
9116 clobber_overlapping_mems (set
, uloc
);
9118 val_store (set
, val
, dstv
, insn
, true);
9120 emit_notes_for_changes (next_insn
, EMIT_NOTE_BEFORE_INSN
,
9127 rtx loc
= mo
->u
.loc
;
9130 if (GET_CODE (loc
) == SET
)
9132 set_src
= SET_SRC (loc
);
9133 loc
= SET_DEST (loc
);
9137 var_reg_delete_and_set (set
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
9140 var_mem_delete_and_set (set
, loc
, true, VAR_INIT_STATUS_INITIALIZED
,
9143 emit_notes_for_changes (next_insn
, EMIT_NOTE_BEFORE_INSN
,
9150 rtx loc
= mo
->u
.loc
;
9151 enum var_init_status src_status
;
9154 if (GET_CODE (loc
) == SET
)
9156 set_src
= SET_SRC (loc
);
9157 loc
= SET_DEST (loc
);
9160 src_status
= find_src_status (set
, set_src
);
9161 set_src
= find_src_set_src (set
, set_src
);
9164 var_reg_delete_and_set (set
, loc
, false, src_status
, set_src
);
9166 var_mem_delete_and_set (set
, loc
, false, src_status
, set_src
);
9168 emit_notes_for_changes (next_insn
, EMIT_NOTE_BEFORE_INSN
,
9175 rtx loc
= mo
->u
.loc
;
9178 var_reg_delete (set
, loc
, false);
9180 var_mem_delete (set
, loc
, false);
9182 emit_notes_for_changes (insn
, EMIT_NOTE_AFTER_INSN
, set
->vars
);
9188 rtx loc
= mo
->u
.loc
;
9191 var_reg_delete (set
, loc
, true);
9193 var_mem_delete (set
, loc
, true);
9195 emit_notes_for_changes (next_insn
, EMIT_NOTE_BEFORE_INSN
,
9201 set
->stack_adjust
+= mo
->u
.adjust
;
9207 /* Emit notes for the whole function. */
9210 vt_emit_notes (void)
9215 gcc_assert (!htab_elements (changed_variables
));
9217 /* Free memory occupied by the out hash tables, as they aren't used
9220 dataflow_set_clear (&VTI (bb
)->out
);
9222 /* Enable emitting notes by functions (mainly by set_variable_part and
9223 delete_variable_part). */
9226 if (MAY_HAVE_DEBUG_INSNS
)
9228 dropped_values
= htab_create (cselib_get_next_uid () * 2,
9229 variable_htab_hash
, variable_htab_eq
,
9230 variable_htab_free
);
9231 loc_exp_dep_pool
= create_alloc_pool ("loc_exp_dep pool",
9232 sizeof (loc_exp_dep
), 64);
9235 dataflow_set_init (&cur
);
9239 /* Emit the notes for changes of variable locations between two
9240 subsequent basic blocks. */
9241 emit_notes_for_differences (BB_HEAD (bb
), &cur
, &VTI (bb
)->in
);
9243 /* Emit the notes for the changes in the basic block itself. */
9244 emit_notes_in_bb (bb
, &cur
);
9246 /* Free memory occupied by the in hash table, we won't need it
9248 dataflow_set_clear (&VTI (bb
)->in
);
9250 #ifdef ENABLE_CHECKING
9251 htab_traverse (shared_hash_htab (cur
.vars
),
9252 emit_notes_for_differences_1
,
9253 shared_hash_htab (empty_shared_hash
));
9255 dataflow_set_destroy (&cur
);
9257 if (MAY_HAVE_DEBUG_INSNS
)
9258 htab_delete (dropped_values
);
9263 /* If there is a declaration and offset associated with register/memory RTL
9264 assign declaration to *DECLP and offset to *OFFSETP, and return true. */
9267 vt_get_decl_and_offset (rtx rtl
, tree
*declp
, HOST_WIDE_INT
*offsetp
)
9271 if (REG_ATTRS (rtl
))
9273 *declp
= REG_EXPR (rtl
);
9274 *offsetp
= REG_OFFSET (rtl
);
9278 else if (MEM_P (rtl
))
9280 if (MEM_ATTRS (rtl
))
9282 *declp
= MEM_EXPR (rtl
);
9283 *offsetp
= INT_MEM_OFFSET (rtl
);
9290 /* Record the value for the ENTRY_VALUE of RTL as a global equivalence
9294 record_entry_value (cselib_val
*val
, rtx rtl
)
9296 rtx ev
= gen_rtx_ENTRY_VALUE (GET_MODE (rtl
));
9298 ENTRY_VALUE_EXP (ev
) = rtl
;
9300 cselib_add_permanent_equiv (val
, ev
, get_insns ());
9303 /* Insert function parameter PARM in IN and OUT sets of ENTRY_BLOCK. */
9306 vt_add_function_parameter (tree parm
)
9308 rtx decl_rtl
= DECL_RTL_IF_SET (parm
);
9309 rtx incoming
= DECL_INCOMING_RTL (parm
);
9311 enum machine_mode mode
;
9312 HOST_WIDE_INT offset
;
9316 if (TREE_CODE (parm
) != PARM_DECL
)
9319 if (!decl_rtl
|| !incoming
)
9322 if (GET_MODE (decl_rtl
) == BLKmode
|| GET_MODE (incoming
) == BLKmode
)
9325 /* If there is a DRAP register or a pseudo in internal_arg_pointer,
9326 rewrite the incoming location of parameters passed on the stack
9327 into MEMs based on the argument pointer, so that incoming doesn't
9328 depend on a pseudo. */
9329 if (MEM_P (incoming
)
9330 && (XEXP (incoming
, 0) == crtl
->args
.internal_arg_pointer
9331 || (GET_CODE (XEXP (incoming
, 0)) == PLUS
9332 && XEXP (XEXP (incoming
, 0), 0)
9333 == crtl
->args
.internal_arg_pointer
9334 && CONST_INT_P (XEXP (XEXP (incoming
, 0), 1)))))
9336 HOST_WIDE_INT off
= -FIRST_PARM_OFFSET (current_function_decl
);
9337 if (GET_CODE (XEXP (incoming
, 0)) == PLUS
)
9338 off
+= INTVAL (XEXP (XEXP (incoming
, 0), 1));
9340 = replace_equiv_address_nv (incoming
,
9341 plus_constant (Pmode
,
9342 arg_pointer_rtx
, off
));
9345 #ifdef HAVE_window_save
9346 /* DECL_INCOMING_RTL uses the INCOMING_REGNO of parameter registers.
9347 If the target machine has an explicit window save instruction, the
9348 actual entry value is the corresponding OUTGOING_REGNO instead. */
9349 if (REG_P (incoming
)
9350 && HARD_REGISTER_P (incoming
)
9351 && OUTGOING_REGNO (REGNO (incoming
)) != REGNO (incoming
))
9354 p
.incoming
= incoming
;
9356 = gen_rtx_REG_offset (incoming
, GET_MODE (incoming
),
9357 OUTGOING_REGNO (REGNO (incoming
)), 0);
9358 p
.outgoing
= incoming
;
9359 vec_safe_push (windowed_parm_regs
, p
);
9361 else if (MEM_P (incoming
)
9362 && REG_P (XEXP (incoming
, 0))
9363 && HARD_REGISTER_P (XEXP (incoming
, 0)))
9365 rtx reg
= XEXP (incoming
, 0);
9366 if (OUTGOING_REGNO (REGNO (reg
)) != REGNO (reg
))
9370 reg
= gen_raw_REG (GET_MODE (reg
), OUTGOING_REGNO (REGNO (reg
)));
9372 vec_safe_push (windowed_parm_regs
, p
);
9373 incoming
= replace_equiv_address_nv (incoming
, reg
);
9378 if (!vt_get_decl_and_offset (incoming
, &decl
, &offset
))
9380 if (REG_P (incoming
) || MEM_P (incoming
))
9382 /* This means argument is passed by invisible reference. */
9385 incoming
= gen_rtx_MEM (GET_MODE (decl_rtl
), incoming
);
9389 if (!vt_get_decl_and_offset (decl_rtl
, &decl
, &offset
))
9391 offset
+= byte_lowpart_offset (GET_MODE (incoming
),
9392 GET_MODE (decl_rtl
));
9401 /* If that DECL_RTL wasn't a pseudo that got spilled to
9402 memory, bail out. Otherwise, the spill slot sharing code
9403 will force the memory to reference spill_slot_decl (%sfp),
9404 so we don't match above. That's ok, the pseudo must have
9405 referenced the entire parameter, so just reset OFFSET. */
9406 if (decl
!= get_spill_slot_decl (false))
9411 if (!track_loc_p (incoming
, parm
, offset
, false, &mode
, &offset
))
9414 out
= &VTI (ENTRY_BLOCK_PTR
)->out
;
9416 dv
= dv_from_decl (parm
);
9418 if (target_for_debug_bind (parm
)
9419 /* We can't deal with these right now, because this kind of
9420 variable is single-part. ??? We could handle parallels
9421 that describe multiple locations for the same single
9422 value, but ATM we don't. */
9423 && GET_CODE (incoming
) != PARALLEL
)
9428 /* ??? We shouldn't ever hit this, but it may happen because
9429 arguments passed by invisible reference aren't dealt with
9430 above: incoming-rtl will have Pmode rather than the
9431 expected mode for the type. */
9435 lowpart
= var_lowpart (mode
, incoming
);
9439 val
= cselib_lookup_from_insn (lowpart
, mode
, true,
9440 VOIDmode
, get_insns ());
9442 /* ??? Float-typed values in memory are not handled by
9446 preserve_value (val
);
9447 set_variable_part (out
, val
->val_rtx
, dv
, offset
,
9448 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9449 dv
= dv_from_value (val
->val_rtx
);
9452 if (MEM_P (incoming
))
9454 val
= cselib_lookup_from_insn (XEXP (incoming
, 0), mode
, true,
9455 VOIDmode
, get_insns ());
9458 preserve_value (val
);
9459 incoming
= replace_equiv_address_nv (incoming
, val
->val_rtx
);
9464 if (REG_P (incoming
))
9466 incoming
= var_lowpart (mode
, incoming
);
9467 gcc_assert (REGNO (incoming
) < FIRST_PSEUDO_REGISTER
);
9468 attrs_list_insert (&out
->regs
[REGNO (incoming
)], dv
, offset
,
9470 set_variable_part (out
, incoming
, dv
, offset
,
9471 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9472 if (dv_is_value_p (dv
))
9474 record_entry_value (CSELIB_VAL_PTR (dv_as_value (dv
)), incoming
);
9475 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
9476 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (parm
))))
9478 enum machine_mode indmode
9479 = TYPE_MODE (TREE_TYPE (TREE_TYPE (parm
)));
9480 rtx mem
= gen_rtx_MEM (indmode
, incoming
);
9481 cselib_val
*val
= cselib_lookup_from_insn (mem
, indmode
, true,
9486 preserve_value (val
);
9487 record_entry_value (val
, mem
);
9488 set_variable_part (out
, mem
, dv_from_value (val
->val_rtx
), 0,
9489 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9494 else if (MEM_P (incoming
))
9496 incoming
= var_lowpart (mode
, incoming
);
9497 set_variable_part (out
, incoming
, dv
, offset
,
9498 VAR_INIT_STATUS_INITIALIZED
, NULL
, INSERT
);
9502 /* Insert function parameters to IN and OUT sets of ENTRY_BLOCK. */
9505 vt_add_function_parameters (void)
9509 for (parm
= DECL_ARGUMENTS (current_function_decl
);
9510 parm
; parm
= DECL_CHAIN (parm
))
9511 vt_add_function_parameter (parm
);
9513 if (DECL_HAS_VALUE_EXPR_P (DECL_RESULT (current_function_decl
)))
9515 tree vexpr
= DECL_VALUE_EXPR (DECL_RESULT (current_function_decl
));
9517 if (TREE_CODE (vexpr
) == INDIRECT_REF
)
9518 vexpr
= TREE_OPERAND (vexpr
, 0);
9520 if (TREE_CODE (vexpr
) == PARM_DECL
9521 && DECL_ARTIFICIAL (vexpr
)
9522 && !DECL_IGNORED_P (vexpr
)
9523 && DECL_NAMELESS (vexpr
))
9524 vt_add_function_parameter (vexpr
);
9528 /* Initialize cfa_base_rtx, create a preserved VALUE for it and
9529 ensure it isn't flushed during cselib_reset_table.
9530 Can be called only if frame_pointer_rtx resp. arg_pointer_rtx
9531 has been eliminated. */
9534 vt_init_cfa_base (void)
9538 #ifdef FRAME_POINTER_CFA_OFFSET
9539 cfa_base_rtx
= frame_pointer_rtx
;
9540 cfa_base_offset
= -FRAME_POINTER_CFA_OFFSET (current_function_decl
);
9542 cfa_base_rtx
= arg_pointer_rtx
;
9543 cfa_base_offset
= -ARG_POINTER_CFA_OFFSET (current_function_decl
);
9545 if (cfa_base_rtx
== hard_frame_pointer_rtx
9546 || !fixed_regs
[REGNO (cfa_base_rtx
)])
9548 cfa_base_rtx
= NULL_RTX
;
9551 if (!MAY_HAVE_DEBUG_INSNS
)
9554 /* Tell alias analysis that cfa_base_rtx should share
9555 find_base_term value with stack pointer or hard frame pointer. */
9556 if (!frame_pointer_needed
)
9557 vt_equate_reg_base_value (cfa_base_rtx
, stack_pointer_rtx
);
9558 else if (!crtl
->stack_realign_tried
)
9559 vt_equate_reg_base_value (cfa_base_rtx
, hard_frame_pointer_rtx
);
9561 val
= cselib_lookup_from_insn (cfa_base_rtx
, GET_MODE (cfa_base_rtx
), 1,
9562 VOIDmode
, get_insns ());
9563 preserve_value (val
);
9564 cselib_preserve_cfa_base_value (val
, REGNO (cfa_base_rtx
));
9567 /* Allocate and initialize the data structures for variable tracking
9568 and parse the RTL to get the micro operations. */
9571 vt_initialize (void)
9574 HOST_WIDE_INT fp_cfa_offset
= -1;
9576 alloc_aux_for_blocks (sizeof (struct variable_tracking_info_def
));
9578 attrs_pool
= create_alloc_pool ("attrs_def pool",
9579 sizeof (struct attrs_def
), 1024);
9580 var_pool
= create_alloc_pool ("variable_def pool",
9581 sizeof (struct variable_def
)
9582 + (MAX_VAR_PARTS
- 1)
9583 * sizeof (((variable
)NULL
)->var_part
[0]), 64);
9584 loc_chain_pool
= create_alloc_pool ("location_chain_def pool",
9585 sizeof (struct location_chain_def
),
9587 shared_hash_pool
= create_alloc_pool ("shared_hash_def pool",
9588 sizeof (struct shared_hash_def
), 256);
9589 empty_shared_hash
= (shared_hash
) pool_alloc (shared_hash_pool
);
9590 empty_shared_hash
->refcount
= 1;
9591 empty_shared_hash
->htab
9592 = htab_create (1, variable_htab_hash
, variable_htab_eq
,
9593 variable_htab_free
);
9594 changed_variables
= htab_create (10, variable_htab_hash
, variable_htab_eq
,
9595 variable_htab_free
);
9597 /* Init the IN and OUT sets. */
9600 VTI (bb
)->visited
= false;
9601 VTI (bb
)->flooded
= false;
9602 dataflow_set_init (&VTI (bb
)->in
);
9603 dataflow_set_init (&VTI (bb
)->out
);
9604 VTI (bb
)->permp
= NULL
;
9607 if (MAY_HAVE_DEBUG_INSNS
)
9609 cselib_init (CSELIB_RECORD_MEMORY
| CSELIB_PRESERVE_CONSTANTS
);
9610 scratch_regs
= BITMAP_ALLOC (NULL
);
9611 valvar_pool
= create_alloc_pool ("small variable_def pool",
9612 sizeof (struct variable_def
), 256);
9613 preserved_values
.create (256);
9617 scratch_regs
= NULL
;
9621 if (MAY_HAVE_DEBUG_INSNS
)
9627 #ifdef FRAME_POINTER_CFA_OFFSET
9628 reg
= frame_pointer_rtx
;
9629 ofst
= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
9631 reg
= arg_pointer_rtx
;
9632 ofst
= ARG_POINTER_CFA_OFFSET (current_function_decl
);
9635 ofst
-= INCOMING_FRAME_SP_OFFSET
;
9637 val
= cselib_lookup_from_insn (reg
, GET_MODE (reg
), 1,
9638 VOIDmode
, get_insns ());
9639 preserve_value (val
);
9640 cselib_preserve_cfa_base_value (val
, REGNO (reg
));
9641 expr
= plus_constant (GET_MODE (stack_pointer_rtx
),
9642 stack_pointer_rtx
, -ofst
);
9643 cselib_add_permanent_equiv (val
, expr
, get_insns ());
9647 val
= cselib_lookup_from_insn (stack_pointer_rtx
,
9648 GET_MODE (stack_pointer_rtx
), 1,
9649 VOIDmode
, get_insns ());
9650 preserve_value (val
);
9651 expr
= plus_constant (GET_MODE (reg
), reg
, ofst
);
9652 cselib_add_permanent_equiv (val
, expr
, get_insns ());
9656 /* In order to factor out the adjustments made to the stack pointer or to
9657 the hard frame pointer and thus be able to use DW_OP_fbreg operations
9658 instead of individual location lists, we're going to rewrite MEMs based
9659 on them into MEMs based on the CFA by de-eliminating stack_pointer_rtx
9660 or hard_frame_pointer_rtx to the virtual CFA pointer frame_pointer_rtx
9661 resp. arg_pointer_rtx. We can do this either when there is no frame
9662 pointer in the function and stack adjustments are consistent for all
9663 basic blocks or when there is a frame pointer and no stack realignment.
9664 But we first have to check that frame_pointer_rtx resp. arg_pointer_rtx
9665 has been eliminated. */
9666 if (!frame_pointer_needed
)
9670 if (!vt_stack_adjustments ())
9673 #ifdef FRAME_POINTER_CFA_OFFSET
9674 reg
= frame_pointer_rtx
;
9676 reg
= arg_pointer_rtx
;
9678 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
9681 if (GET_CODE (elim
) == PLUS
)
9682 elim
= XEXP (elim
, 0);
9683 if (elim
== stack_pointer_rtx
)
9684 vt_init_cfa_base ();
9687 else if (!crtl
->stack_realign_tried
)
9691 #ifdef FRAME_POINTER_CFA_OFFSET
9692 reg
= frame_pointer_rtx
;
9693 fp_cfa_offset
= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
9695 reg
= arg_pointer_rtx
;
9696 fp_cfa_offset
= ARG_POINTER_CFA_OFFSET (current_function_decl
);
9698 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
9701 if (GET_CODE (elim
) == PLUS
)
9703 fp_cfa_offset
-= INTVAL (XEXP (elim
, 1));
9704 elim
= XEXP (elim
, 0);
9706 if (elim
!= hard_frame_pointer_rtx
)
9713 /* If the stack is realigned and a DRAP register is used, we're going to
9714 rewrite MEMs based on it representing incoming locations of parameters
9715 passed on the stack into MEMs based on the argument pointer. Although
9716 we aren't going to rewrite other MEMs, we still need to initialize the
9717 virtual CFA pointer in order to ensure that the argument pointer will
9718 be seen as a constant throughout the function.
9720 ??? This doesn't work if FRAME_POINTER_CFA_OFFSET is defined. */
9721 else if (stack_realign_drap
)
9725 #ifdef FRAME_POINTER_CFA_OFFSET
9726 reg
= frame_pointer_rtx
;
9728 reg
= arg_pointer_rtx
;
9730 elim
= eliminate_regs (reg
, VOIDmode
, NULL_RTX
);
9733 if (GET_CODE (elim
) == PLUS
)
9734 elim
= XEXP (elim
, 0);
9735 if (elim
== hard_frame_pointer_rtx
)
9736 vt_init_cfa_base ();
9740 hard_frame_pointer_adjustment
= -1;
9742 vt_add_function_parameters ();
9747 HOST_WIDE_INT pre
, post
= 0;
9748 basic_block first_bb
, last_bb
;
9750 if (MAY_HAVE_DEBUG_INSNS
)
9752 cselib_record_sets_hook
= add_with_sets
;
9753 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
9754 fprintf (dump_file
, "first value: %i\n",
9755 cselib_get_next_uid ());
9762 if (bb
->next_bb
== EXIT_BLOCK_PTR
9763 || ! single_pred_p (bb
->next_bb
))
9765 e
= find_edge (bb
, bb
->next_bb
);
9766 if (! e
|| (e
->flags
& EDGE_FALLTHRU
) == 0)
9772 /* Add the micro-operations to the vector. */
9773 FOR_BB_BETWEEN (bb
, first_bb
, last_bb
->next_bb
, next_bb
)
9775 HOST_WIDE_INT offset
= VTI (bb
)->out
.stack_adjust
;
9776 VTI (bb
)->out
.stack_adjust
= VTI (bb
)->in
.stack_adjust
;
9777 for (insn
= BB_HEAD (bb
); insn
!= NEXT_INSN (BB_END (bb
));
9778 insn
= NEXT_INSN (insn
))
9782 if (!frame_pointer_needed
)
9784 insn_stack_adjust_offset_pre_post (insn
, &pre
, &post
);
9788 mo
.type
= MO_ADJUST
;
9791 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
9792 log_op_type (PATTERN (insn
), bb
, insn
,
9793 MO_ADJUST
, dump_file
);
9794 VTI (bb
)->mos
.safe_push (mo
);
9795 VTI (bb
)->out
.stack_adjust
+= pre
;
9799 cselib_hook_called
= false;
9800 adjust_insn (bb
, insn
);
9801 if (MAY_HAVE_DEBUG_INSNS
)
9804 prepare_call_arguments (bb
, insn
);
9805 cselib_process_insn (insn
);
9806 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
9808 print_rtl_single (dump_file
, insn
);
9809 dump_cselib_table (dump_file
);
9812 if (!cselib_hook_called
)
9813 add_with_sets (insn
, 0, 0);
9816 if (!frame_pointer_needed
&& post
)
9819 mo
.type
= MO_ADJUST
;
9822 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
9823 log_op_type (PATTERN (insn
), bb
, insn
,
9824 MO_ADJUST
, dump_file
);
9825 VTI (bb
)->mos
.safe_push (mo
);
9826 VTI (bb
)->out
.stack_adjust
+= post
;
9829 if (fp_cfa_offset
!= -1
9830 && hard_frame_pointer_adjustment
== -1
9831 && fp_setter_insn (insn
))
9833 vt_init_cfa_base ();
9834 hard_frame_pointer_adjustment
= fp_cfa_offset
;
9835 /* Disassociate sp from fp now. */
9836 if (MAY_HAVE_DEBUG_INSNS
)
9839 cselib_invalidate_rtx (stack_pointer_rtx
);
9840 v
= cselib_lookup (stack_pointer_rtx
, Pmode
, 1,
9842 if (v
&& !cselib_preserved_value_p (v
))
9844 cselib_set_value_sp_based (v
);
9851 gcc_assert (offset
== VTI (bb
)->out
.stack_adjust
);
9856 if (MAY_HAVE_DEBUG_INSNS
)
9858 cselib_preserve_only_values ();
9859 cselib_reset_table (cselib_get_next_uid ());
9860 cselib_record_sets_hook
= NULL
;
9864 hard_frame_pointer_adjustment
= -1;
9865 VTI (ENTRY_BLOCK_PTR
)->flooded
= true;
9866 cfa_base_rtx
= NULL_RTX
;
9870 /* This is *not* reset after each function. It gives each
9871 NOTE_INSN_DELETED_DEBUG_LABEL in the entire compilation
9872 a unique label number. */
9874 static int debug_label_num
= 1;
9876 /* Get rid of all debug insns from the insn stream. */
9879 delete_debug_insns (void)
9884 if (!MAY_HAVE_DEBUG_INSNS
)
9889 FOR_BB_INSNS_SAFE (bb
, insn
, next
)
9890 if (DEBUG_INSN_P (insn
))
9892 tree decl
= INSN_VAR_LOCATION_DECL (insn
);
9893 if (TREE_CODE (decl
) == LABEL_DECL
9895 && !DECL_RTL_SET_P (decl
))
9897 PUT_CODE (insn
, NOTE
);
9898 NOTE_KIND (insn
) = NOTE_INSN_DELETED_DEBUG_LABEL
;
9899 NOTE_DELETED_LABEL_NAME (insn
)
9900 = IDENTIFIER_POINTER (DECL_NAME (decl
));
9901 SET_DECL_RTL (decl
, insn
);
9902 CODE_LABEL_NUMBER (insn
) = debug_label_num
++;
9910 /* Run a fast, BB-local only version of var tracking, to take care of
9911 information that we don't do global analysis on, such that not all
9912 information is lost. If SKIPPED holds, we're skipping the global
9913 pass entirely, so we should try to use information it would have
9914 handled as well.. */
9917 vt_debug_insns_local (bool skipped ATTRIBUTE_UNUSED
)
9919 /* ??? Just skip it all for now. */
9920 delete_debug_insns ();
9923 /* Free the data structures needed for variable tracking. */
9932 VTI (bb
)->mos
.release ();
9937 dataflow_set_destroy (&VTI (bb
)->in
);
9938 dataflow_set_destroy (&VTI (bb
)->out
);
9939 if (VTI (bb
)->permp
)
9941 dataflow_set_destroy (VTI (bb
)->permp
);
9942 XDELETE (VTI (bb
)->permp
);
9945 free_aux_for_blocks ();
9946 htab_delete (empty_shared_hash
->htab
);
9947 htab_delete (changed_variables
);
9948 free_alloc_pool (attrs_pool
);
9949 free_alloc_pool (var_pool
);
9950 free_alloc_pool (loc_chain_pool
);
9951 free_alloc_pool (shared_hash_pool
);
9953 if (MAY_HAVE_DEBUG_INSNS
)
9955 if (loc_exp_dep_pool
)
9956 free_alloc_pool (loc_exp_dep_pool
);
9957 loc_exp_dep_pool
= NULL
;
9958 free_alloc_pool (valvar_pool
);
9959 preserved_values
.release ();
9961 BITMAP_FREE (scratch_regs
);
9962 scratch_regs
= NULL
;
9965 #ifdef HAVE_window_save
9966 vec_free (windowed_parm_regs
);
9970 XDELETEVEC (vui_vec
);
9975 /* The entry point to variable tracking pass. */
9977 static inline unsigned int
9978 variable_tracking_main_1 (void)
9982 if (flag_var_tracking_assignments
< 0)
9984 delete_debug_insns ();
9988 if (n_basic_blocks
> 500 && n_edges
/ n_basic_blocks
>= 20)
9990 vt_debug_insns_local (true);
9994 mark_dfs_back_edges ();
9995 if (!vt_initialize ())
9998 vt_debug_insns_local (true);
10002 success
= vt_find_locations ();
10004 if (!success
&& flag_var_tracking_assignments
> 0)
10008 delete_debug_insns ();
10010 /* This is later restored by our caller. */
10011 flag_var_tracking_assignments
= 0;
10013 success
= vt_initialize ();
10014 gcc_assert (success
);
10016 success
= vt_find_locations ();
10022 vt_debug_insns_local (false);
10026 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
10028 dump_dataflow_sets ();
10029 dump_reg_info (dump_file
);
10030 dump_flow_info (dump_file
, dump_flags
);
10033 timevar_push (TV_VAR_TRACKING_EMIT
);
10035 timevar_pop (TV_VAR_TRACKING_EMIT
);
10038 vt_debug_insns_local (false);
10043 variable_tracking_main (void)
10046 int save
= flag_var_tracking_assignments
;
10048 ret
= variable_tracking_main_1 ();
10050 flag_var_tracking_assignments
= save
;
10056 gate_handle_var_tracking (void)
10058 return (flag_var_tracking
&& !targetm
.delay_vartrack
);
10063 struct rtl_opt_pass pass_variable_tracking
=
10067 "vartrack", /* name */
10068 OPTGROUP_NONE
, /* optinfo_flags */
10069 gate_handle_var_tracking
, /* gate */
10070 variable_tracking_main
, /* execute */
10073 0, /* static_pass_number */
10074 TV_VAR_TRACKING
, /* tv_id */
10075 0, /* properties_required */
10076 0, /* properties_provided */
10077 0, /* properties_destroyed */
10078 0, /* todo_flags_start */
10079 TODO_verify_rtl_sharing
/* todo_flags_finish */