1 /* Variable tracking routines for the GNU compiler.
2 Copyright (C) 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010, 2011, 2012
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful, but WITHOUT
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
15 License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* This file contains the variable tracking pass. It computes where
22 variables are located (which registers or where in memory) at each position
23 in instruction stream and emits notes describing the locations.
24 Debug information (DWARF2 location lists) is finally generated from
26 With this debug information, it is possible to show variables
27 even when debugging optimized code.
29 How does the variable tracking pass work?
31 First, it scans RTL code for uses, stores and clobbers (register/memory
32 references in instructions), for call insns and for stack adjustments
33 separately for each basic block and saves them to an array of micro
35 The micro operations of one instruction are ordered so that
36 pre-modifying stack adjustment < use < use with no var < call insn <
37 < clobber < set < post-modifying stack adjustment
39 Then, a forward dataflow analysis is performed to find out how locations
40 of variables change through code and to propagate the variable locations
41 along control flow graph.
42 The IN set for basic block BB is computed as a union of OUT sets of BB's
43 predecessors, the OUT set for BB is copied from the IN set for BB and
44 is changed according to micro operations in BB.
46 The IN and OUT sets for basic blocks consist of a current stack adjustment
47 (used for adjusting offset of variables addressed using stack pointer),
48 the table of structures describing the locations of parts of a variable
49 and for each physical register a linked list for each physical register.
50 The linked list is a list of variable parts stored in the register,
51 i.e. it is a list of triplets (reg, decl, offset) where decl is
52 REG_EXPR (reg) and offset is REG_OFFSET (reg). The linked list is used for
53 effective deleting appropriate variable parts when we set or clobber the
56 There may be more than one variable part in a register. The linked lists
57 should be pretty short so it is a good data structure here.
58 For example in the following code, register allocator may assign same
59 register to variables A and B, and both of them are stored in the same
72 Finally, the NOTE_INSN_VAR_LOCATION notes describing the variable locations
73 are emitted to appropriate positions in RTL code. Each such a note describes
74 the location of one variable at the point in instruction stream where the
75 note is. There is no need to emit a note for each variable before each
76 instruction, we only emit these notes where the location of variable changes
77 (this means that we also emit notes for changes between the OUT set of the
78 previous block and the IN set of the current block).
80 The notes consist of two parts:
81 1. the declaration (from REG_EXPR or MEM_EXPR)
82 2. the location of a variable - it is either a simple register/memory
83 reference (for simple variables, for example int),
84 or a parallel of register/memory references (for a large variables
85 which consist of several parts, for example long long).
91 #include "coretypes.h"
96 #include "hard-reg-set.h"
97 #include "basic-block.h"
100 #include "insn-config.h"
103 #include "alloc-pool.h"
109 #include "tree-pass.h"
110 #include "tree-flow.h"
114 #include "diagnostic.h"
115 #include "tree-pretty-print.h"
116 #include "pointer-set.h"
120 /* var-tracking.c assumes that tree code with the same value as VALUE rtx code
121 has no chance to appear in REG_EXPR/MEM_EXPRs and isn't a decl.
122 Currently the value is the same as IDENTIFIER_NODE, which has such
123 a property. If this compile time assertion ever fails, make sure that
124 the new tree code that equals (int) VALUE has the same property. */
125 extern char check_value_val[(int) VALUE == (int) IDENTIFIER_NODE ? 1 : -1];
127 /* Type of micro operation. */
128 enum micro_operation_type
130 MO_USE, /* Use location (REG or MEM). */
131 MO_USE_NO_VAR,/* Use location which is not associated with a variable
132 or the variable is not trackable. */
133 MO_VAL_USE, /* Use location which is associated with a value. */
134 MO_VAL_LOC, /* Use location which appears in a debug insn. */
135 MO_VAL_SET, /* Set location associated with a value. */
136 MO_SET, /* Set location. */
137 MO_COPY, /* Copy the same portion of a variable from one
138 location to another. */
139 MO_CLOBBER, /* Clobber location. */
140 MO_CALL, /* Call insn. */
141 MO_ADJUST /* Adjust stack pointer. */
145 static const char * const ATTRIBUTE_UNUSED
146 micro_operation_type_name[] = {
159 /* Where shall the note be emitted? BEFORE or AFTER the instruction.
160 Notes emitted as AFTER_CALL are to take effect during the call,
161 rather than after the call. */
164 EMIT_NOTE_BEFORE_INSN,
165 EMIT_NOTE_AFTER_INSN,
166 EMIT_NOTE_AFTER_CALL_INSN
169 /* Structure holding information about micro operation. */
170 typedef struct micro_operation_def
172 /* Type of micro operation. */
173 enum micro_operation_type type;
175 /* The instruction which the micro operation is in, for MO_USE,
176 MO_USE_NO_VAR, MO_CALL and MO_ADJUST, or the subsequent
177 instruction or note in the original flow (before any var-tracking
178 notes are inserted, to simplify emission of notes), for MO_SET
183 /* Location. For MO_SET and MO_COPY, this is the SET that
184 performs the assignment, if known, otherwise it is the target
185 of the assignment. For MO_VAL_USE and MO_VAL_SET, it is a
186 CONCAT of the VALUE and the LOC associated with it. For
187 MO_VAL_LOC, it is a CONCAT of the VALUE and the VAR_LOCATION
188 associated with it. */
191 /* Stack adjustment. */
192 HOST_WIDE_INT adjust;
196 DEF_VEC_O(micro_operation);
197 DEF_VEC_ALLOC_O(micro_operation,heap);
199 /* A declaration of a variable, or an RTL value being handled like a
201 typedef void *decl_or_value;
203 /* Structure for passing some other parameters to function
204 emit_note_insn_var_location. */
205 typedef struct emit_note_data_def
207 /* The instruction which the note will be emitted before/after. */
210 /* Where the note will be emitted (before/after insn)? */
211 enum emit_note_where where;
213 /* The variables and values active at this point. */
217 /* Description of location of a part of a variable. The content of a physical
218 register is described by a chain of these structures.
219 The chains are pretty short (usually 1 or 2 elements) and thus
220 chain is the best data structure. */
221 typedef struct attrs_def
223 /* Pointer to next member of the list. */
224 struct attrs_def *next;
226 /* The rtx of register. */
229 /* The declaration corresponding to LOC. */
232 /* Offset from start of DECL. */
233 HOST_WIDE_INT offset;
236 /* Structure holding a refcounted hash table. If refcount > 1,
237 it must be first unshared before modified. */
238 typedef struct shared_hash_def
240 /* Reference count. */
243 /* Actual hash table. */
247 /* Structure holding the IN or OUT set for a basic block. */
248 typedef struct dataflow_set_def
250 /* Adjustment of stack offset. */
251 HOST_WIDE_INT stack_adjust;
253 /* Attributes for registers (lists of attrs). */
254 attrs regs[FIRST_PSEUDO_REGISTER];
256 /* Variable locations. */
259 /* Vars that is being traversed. */
260 shared_hash traversed_vars;
263 /* The structure (one for each basic block) containing the information
264 needed for variable tracking. */
265 typedef struct variable_tracking_info_def
267 /* The vector of micro operations. */
268 VEC(micro_operation, heap) *mos;
270 /* The IN and OUT set for dataflow analysis. */
274 /* The permanent-in dataflow set for this block. This is used to
275 hold values for which we had to compute entry values. ??? This
276 should probably be dynamically allocated, to avoid using more
277 memory in non-debug builds. */
280 /* Has the block been visited in DFS? */
283 /* Has the block been flooded in VTA? */
286 } *variable_tracking_info;
288 /* Structure for chaining the locations. */
289 typedef struct location_chain_def
291 /* Next element in the chain. */
292 struct location_chain_def *next;
294 /* The location (REG, MEM or VALUE). */
297 /* The "value" stored in this location. */
301 enum var_init_status init;
304 /* A vector of loc_exp_dep holds the active dependencies of a one-part
305 DV on VALUEs, i.e., the VALUEs expanded so as to form the current
306 location of DV. Each entry is also part of VALUE' s linked-list of
307 backlinks back to DV. */
308 typedef struct loc_exp_dep_s
310 /* The dependent DV. */
312 /* The dependency VALUE or DECL_DEBUG. */
314 /* The next entry in VALUE's backlinks list. */
315 struct loc_exp_dep_s *next;
316 /* A pointer to the pointer to this entry (head or prev's next) in
317 the doubly-linked list. */
318 struct loc_exp_dep_s **pprev;
321 DEF_VEC_O (loc_exp_dep);
323 /* This data structure is allocated for one-part variables at the time
324 of emitting notes. */
327 /* Doubly-linked list of dependent DVs. These are DVs whose cur_loc
328 computation used the expansion of this variable, and that ought
329 to be notified should this variable change. If the DV's cur_loc
330 expanded to NULL, all components of the loc list are regarded as
331 active, so that any changes in them give us a chance to get a
332 location. Otherwise, only components of the loc that expanded to
333 non-NULL are regarded as active dependencies. */
334 loc_exp_dep *backlinks;
335 /* This holds the LOC that was expanded into cur_loc. We need only
336 mark a one-part variable as changed if the FROM loc is removed,
337 or if it has no known location and a loc is added, or if it gets
338 a change notification from any of its active dependencies. */
340 /* The depth of the cur_loc expression. */
342 /* Dependencies actively used when expand FROM into cur_loc. */
343 VEC (loc_exp_dep, none) deps;
346 /* Structure describing one part of variable. */
347 typedef struct variable_part_def
349 /* Chain of locations of the part. */
350 location_chain loc_chain;
352 /* Location which was last emitted to location list. */
357 /* The offset in the variable, if !var->onepart. */
358 HOST_WIDE_INT offset;
360 /* Pointer to auxiliary data, if var->onepart and emit_notes. */
361 struct onepart_aux *onepaux;
365 /* Maximum number of location parts. */
366 #define MAX_VAR_PARTS 16
368 /* Enumeration type used to discriminate various types of one-part
370 typedef enum onepart_enum
372 /* Not a one-part variable. */
374 /* A one-part DECL that is not a DEBUG_EXPR_DECL. */
376 /* A DEBUG_EXPR_DECL. */
382 /* Structure describing where the variable is located. */
383 typedef struct variable_def
385 /* The declaration of the variable, or an RTL value being handled
386 like a declaration. */
389 /* Reference count. */
392 /* Number of variable parts. */
395 /* What type of DV this is, according to enum onepart_enum. */
396 ENUM_BITFIELD (onepart_enum) onepart : CHAR_BIT;
398 /* True if this variable_def struct is currently in the
399 changed_variables hash table. */
400 bool in_changed_variables;
402 /* The variable parts. */
403 variable_part var_part[1];
405 typedef const struct variable_def *const_variable;
407 /* Pointer to the BB's information specific to variable tracking pass. */
408 #define VTI(BB) ((variable_tracking_info) (BB)->aux)
410 /* Macro to access MEM_OFFSET as an HOST_WIDE_INT. Evaluates MEM twice. */
411 #define INT_MEM_OFFSET(mem) (MEM_OFFSET_KNOWN_P (mem) ? MEM_OFFSET (mem) : 0)
413 #if ENABLE_CHECKING && (GCC_VERSION >= 2007)
415 /* Access VAR's Ith part's offset, checking that it's not a one-part
417 #define VAR_PART_OFFSET(var, i) __extension__ \
418 (*({ variable const __v = (var); \
419 gcc_checking_assert (!__v->onepart); \
420 &__v->var_part[(i)].aux.offset; }))
422 /* Access VAR's one-part auxiliary data, checking that it is a
423 one-part variable. */
424 #define VAR_LOC_1PAUX(var) __extension__ \
425 (*({ variable const __v = (var); \
426 gcc_checking_assert (__v->onepart); \
427 &__v->var_part[0].aux.onepaux; }))
430 #define VAR_PART_OFFSET(var, i) ((var)->var_part[(i)].aux.offset)
431 #define VAR_LOC_1PAUX(var) ((var)->var_part[0].aux.onepaux)
434 /* These are accessor macros for the one-part auxiliary data. When
435 convenient for users, they're guarded by tests that the data was
437 #define VAR_LOC_DEP_LST(var) (VAR_LOC_1PAUX (var) \
438 ? VAR_LOC_1PAUX (var)->backlinks \
440 #define VAR_LOC_DEP_LSTP(var) (VAR_LOC_1PAUX (var) \
441 ? &VAR_LOC_1PAUX (var)->backlinks \
443 #define VAR_LOC_FROM(var) (VAR_LOC_1PAUX (var)->from)
444 #define VAR_LOC_DEPTH(var) (VAR_LOC_1PAUX (var)->depth)
445 #define VAR_LOC_DEP_VEC(var) (VAR_LOC_1PAUX (var) \
446 ? &VAR_LOC_1PAUX (var)->deps \
449 /* Alloc pool for struct attrs_def. */
450 static alloc_pool attrs_pool;
452 /* Alloc pool for struct variable_def with MAX_VAR_PARTS entries. */
453 static alloc_pool var_pool;
455 /* Alloc pool for struct variable_def with a single var_part entry. */
456 static alloc_pool valvar_pool;
458 /* Alloc pool for struct location_chain_def. */
459 static alloc_pool loc_chain_pool;
461 /* Alloc pool for struct shared_hash_def. */
462 static alloc_pool shared_hash_pool;
464 /* Changed variables, notes will be emitted for them. */
465 static htab_t changed_variables;
467 /* Shall notes be emitted? */
468 static bool emit_notes;
470 /* Values whose dynamic location lists have gone empty, but whose
471 cselib location lists are still usable. Use this to hold the
472 current location, the backlinks, etc, during emit_notes. */
473 static htab_t dropped_values;
475 /* Empty shared hashtable. */
476 static shared_hash empty_shared_hash;
478 /* Scratch register bitmap used by cselib_expand_value_rtx. */
479 static bitmap scratch_regs = NULL;
481 #ifdef HAVE_window_save
482 typedef struct GTY(()) parm_reg {
487 DEF_VEC_O(parm_reg_t);
488 DEF_VEC_ALLOC_O(parm_reg_t, gc);
490 /* Vector of windowed parameter registers, if any. */
491 static VEC(parm_reg_t, gc) *windowed_parm_regs = NULL;
494 /* Variable used to tell whether cselib_process_insn called our hook. */
495 static bool cselib_hook_called;
497 /* Local function prototypes. */
498 static void stack_adjust_offset_pre_post (rtx, HOST_WIDE_INT *,
500 static void insn_stack_adjust_offset_pre_post (rtx, HOST_WIDE_INT *,
502 static bool vt_stack_adjustments (void);
503 static hashval_t variable_htab_hash (const void *);
504 static int variable_htab_eq (const void *, const void *);
505 static void variable_htab_free (void *);
507 static void init_attrs_list_set (attrs *);
508 static void attrs_list_clear (attrs *);
509 static attrs attrs_list_member (attrs, decl_or_value, HOST_WIDE_INT);
510 static void attrs_list_insert (attrs *, decl_or_value, HOST_WIDE_INT, rtx);
511 static void attrs_list_copy (attrs *, attrs);
512 static void attrs_list_union (attrs *, attrs);
514 static void **unshare_variable (dataflow_set *set, void **slot, variable var,
515 enum var_init_status);
516 static void vars_copy (htab_t, htab_t);
517 static tree var_debug_decl (tree);
518 static void var_reg_set (dataflow_set *, rtx, enum var_init_status, rtx);
519 static void var_reg_delete_and_set (dataflow_set *, rtx, bool,
520 enum var_init_status, rtx);
521 static void var_reg_delete (dataflow_set *, rtx, bool);
522 static void var_regno_delete (dataflow_set *, int);
523 static void var_mem_set (dataflow_set *, rtx, enum var_init_status, rtx);
524 static void var_mem_delete_and_set (dataflow_set *, rtx, bool,
525 enum var_init_status, rtx);
526 static void var_mem_delete (dataflow_set *, rtx, bool);
528 static void dataflow_set_init (dataflow_set *);
529 static void dataflow_set_clear (dataflow_set *);
530 static void dataflow_set_copy (dataflow_set *, dataflow_set *);
531 static int variable_union_info_cmp_pos (const void *, const void *);
532 static void dataflow_set_union (dataflow_set *, dataflow_set *);
533 static location_chain find_loc_in_1pdv (rtx, variable, htab_t);
534 static bool canon_value_cmp (rtx, rtx);
535 static int loc_cmp (rtx, rtx);
536 static bool variable_part_different_p (variable_part *, variable_part *);
537 static bool onepart_variable_different_p (variable, variable);
538 static bool variable_different_p (variable, variable);
539 static bool dataflow_set_different (dataflow_set *, dataflow_set *);
540 static void dataflow_set_destroy (dataflow_set *);
542 static bool contains_symbol_ref (rtx);
543 static bool track_expr_p (tree, bool);
544 static bool same_variable_part_p (rtx, tree, HOST_WIDE_INT);
545 static int add_uses (rtx *, void *);
546 static void add_uses_1 (rtx *, void *);
547 static void add_stores (rtx, const_rtx, void *);
548 static bool compute_bb_dataflow (basic_block);
549 static bool vt_find_locations (void);
551 static void dump_attrs_list (attrs);
552 static int dump_var_slot (void **, void *);
553 static void dump_var (variable);
554 static void dump_vars (htab_t);
555 static void dump_dataflow_set (dataflow_set *);
556 static void dump_dataflow_sets (void);
558 static void set_dv_changed (decl_or_value, bool);
559 static void variable_was_changed (variable, dataflow_set *);
560 static void **set_slot_part (dataflow_set *, rtx, void **,
561 decl_or_value, HOST_WIDE_INT,
562 enum var_init_status, rtx);
563 static void set_variable_part (dataflow_set *, rtx,
564 decl_or_value, HOST_WIDE_INT,
565 enum var_init_status, rtx, enum insert_option);
566 static void **clobber_slot_part (dataflow_set *, rtx,
567 void **, HOST_WIDE_INT, rtx);
568 static void clobber_variable_part (dataflow_set *, rtx,
569 decl_or_value, HOST_WIDE_INT, rtx);
570 static void **delete_slot_part (dataflow_set *, rtx, void **, HOST_WIDE_INT);
571 static void delete_variable_part (dataflow_set *, rtx,
572 decl_or_value, HOST_WIDE_INT);
573 static int emit_note_insn_var_location (void **, void *);
574 static void emit_notes_for_changes (rtx, enum emit_note_where, shared_hash);
575 static int emit_notes_for_differences_1 (void **, void *);
576 static int emit_notes_for_differences_2 (void **, void *);
577 static void emit_notes_for_differences (rtx, dataflow_set *, dataflow_set *);
578 static void emit_notes_in_bb (basic_block, dataflow_set *);
579 static void vt_emit_notes (void);
581 static bool vt_get_decl_and_offset (rtx, tree *, HOST_WIDE_INT *);
582 static void vt_add_function_parameters (void);
583 static bool vt_initialize (void);
584 static void vt_finalize (void);
586 /* Given a SET, calculate the amount of stack adjustment it contains
587 PRE- and POST-modifying stack pointer.
588 This function is similar to stack_adjust_offset. */
591 stack_adjust_offset_pre_post (rtx pattern, HOST_WIDE_INT *pre,
594 rtx src = SET_SRC (pattern);
595 rtx dest = SET_DEST (pattern);
598 if (dest == stack_pointer_rtx)
600 /* (set (reg sp) (plus (reg sp) (const_int))) */
601 code = GET_CODE (src);
602 if (! (code == PLUS || code == MINUS)
603 || XEXP (src, 0) != stack_pointer_rtx
604 || !CONST_INT_P (XEXP (src, 1)))
608 *post += INTVAL (XEXP (src, 1));
610 *post -= INTVAL (XEXP (src, 1));
612 else if (MEM_P (dest))
614 /* (set (mem (pre_dec (reg sp))) (foo)) */
615 src = XEXP (dest, 0);
616 code = GET_CODE (src);
622 if (XEXP (src, 0) == stack_pointer_rtx)
624 rtx val = XEXP (XEXP (src, 1), 1);
625 /* We handle only adjustments by constant amount. */
626 gcc_assert (GET_CODE (XEXP (src, 1)) == PLUS &&
629 if (code == PRE_MODIFY)
630 *pre -= INTVAL (val);
632 *post -= INTVAL (val);
638 if (XEXP (src, 0) == stack_pointer_rtx)
640 *pre += GET_MODE_SIZE (GET_MODE (dest));
646 if (XEXP (src, 0) == stack_pointer_rtx)
648 *post += GET_MODE_SIZE (GET_MODE (dest));
654 if (XEXP (src, 0) == stack_pointer_rtx)
656 *pre -= GET_MODE_SIZE (GET_MODE (dest));
662 if (XEXP (src, 0) == stack_pointer_rtx)
664 *post -= GET_MODE_SIZE (GET_MODE (dest));
675 /* Given an INSN, calculate the amount of stack adjustment it contains
676 PRE- and POST-modifying stack pointer. */
679 insn_stack_adjust_offset_pre_post (rtx insn, HOST_WIDE_INT *pre,
687 pattern = PATTERN (insn);
688 if (RTX_FRAME_RELATED_P (insn))
690 rtx expr = find_reg_note (insn, REG_FRAME_RELATED_EXPR, NULL_RTX);
692 pattern = XEXP (expr, 0);
695 if (GET_CODE (pattern) == SET)
696 stack_adjust_offset_pre_post (pattern, pre, post);
697 else if (GET_CODE (pattern) == PARALLEL
698 || GET_CODE (pattern) == SEQUENCE)
702 /* There may be stack adjustments inside compound insns. Search
704 for ( i = XVECLEN (pattern, 0) - 1; i >= 0; i--)
705 if (GET_CODE (XVECEXP (pattern, 0, i)) == SET)
706 stack_adjust_offset_pre_post (XVECEXP (pattern, 0, i), pre, post);
710 /* Compute stack adjustments for all blocks by traversing DFS tree.
711 Return true when the adjustments on all incoming edges are consistent.
712 Heavily borrowed from pre_and_rev_post_order_compute. */
715 vt_stack_adjustments (void)
717 edge_iterator *stack;
720 /* Initialize entry block. */
721 VTI (ENTRY_BLOCK_PTR)->visited = true;
722 VTI (ENTRY_BLOCK_PTR)->in.stack_adjust = INCOMING_FRAME_SP_OFFSET;
723 VTI (ENTRY_BLOCK_PTR)->out.stack_adjust = INCOMING_FRAME_SP_OFFSET;
725 /* Allocate stack for back-tracking up CFG. */
726 stack = XNEWVEC (edge_iterator, n_basic_blocks + 1);
729 /* Push the first edge on to the stack. */
730 stack[sp++] = ei_start (ENTRY_BLOCK_PTR->succs);
738 /* Look at the edge on the top of the stack. */
740 src = ei_edge (ei)->src;
741 dest = ei_edge (ei)->dest;
743 /* Check if the edge destination has been visited yet. */
744 if (!VTI (dest)->visited)
747 HOST_WIDE_INT pre, post, offset;
748 VTI (dest)->visited = true;
749 VTI (dest)->in.stack_adjust = offset = VTI (src)->out.stack_adjust;
751 if (dest != EXIT_BLOCK_PTR)
752 for (insn = BB_HEAD (dest);
753 insn != NEXT_INSN (BB_END (dest));
754 insn = NEXT_INSN (insn))
757 insn_stack_adjust_offset_pre_post (insn, &pre, &post);
758 offset += pre + post;
761 VTI (dest)->out.stack_adjust = offset;
763 if (EDGE_COUNT (dest->succs) > 0)
764 /* Since the DEST node has been visited for the first
765 time, check its successors. */
766 stack[sp++] = ei_start (dest->succs);
770 /* Check whether the adjustments on the edges are the same. */
771 if (VTI (dest)->in.stack_adjust != VTI (src)->out.stack_adjust)
777 if (! ei_one_before_end_p (ei))
778 /* Go to the next edge. */
779 ei_next (&stack[sp - 1]);
781 /* Return to previous level if there are no more edges. */
790 /* arg_pointer_rtx resp. frame_pointer_rtx if stack_pointer_rtx or
791 hard_frame_pointer_rtx is being mapped to it and offset for it. */
792 static rtx cfa_base_rtx;
793 static HOST_WIDE_INT cfa_base_offset;
795 /* Compute a CFA-based value for an ADJUSTMENT made to stack_pointer_rtx
796 or hard_frame_pointer_rtx. */
799 compute_cfa_pointer (HOST_WIDE_INT adjustment)
801 return plus_constant (cfa_base_rtx, adjustment + cfa_base_offset);
804 /* Adjustment for hard_frame_pointer_rtx to cfa base reg,
805 or -1 if the replacement shouldn't be done. */
806 static HOST_WIDE_INT hard_frame_pointer_adjustment = -1;
808 /* Data for adjust_mems callback. */
810 struct adjust_mem_data
813 enum machine_mode mem_mode;
814 HOST_WIDE_INT stack_adjust;
818 /* Helper for adjust_mems. Return 1 if *loc is unsuitable for
819 transformation of wider mode arithmetics to narrower mode,
820 -1 if it is suitable and subexpressions shouldn't be
821 traversed and 0 if it is suitable and subexpressions should
822 be traversed. Called through for_each_rtx. */
825 use_narrower_mode_test (rtx *loc, void *data)
827 rtx subreg = (rtx) data;
829 if (CONSTANT_P (*loc))
831 switch (GET_CODE (*loc))
834 if (cselib_lookup (*loc, GET_MODE (SUBREG_REG (subreg)), 0, VOIDmode))
836 if (!validate_subreg (GET_MODE (subreg), GET_MODE (*loc),
837 *loc, subreg_lowpart_offset (GET_MODE (subreg),
846 if (for_each_rtx (&XEXP (*loc, 0), use_narrower_mode_test, data))
855 /* Transform X into narrower mode MODE from wider mode WMODE. */
858 use_narrower_mode (rtx x, enum machine_mode mode, enum machine_mode wmode)
862 return lowpart_subreg (mode, x, wmode);
863 switch (GET_CODE (x))
866 return lowpart_subreg (mode, x, wmode);
870 op0 = use_narrower_mode (XEXP (x, 0), mode, wmode);
871 op1 = use_narrower_mode (XEXP (x, 1), mode, wmode);
872 return simplify_gen_binary (GET_CODE (x), mode, op0, op1);
874 op0 = use_narrower_mode (XEXP (x, 0), mode, wmode);
875 return simplify_gen_binary (ASHIFT, mode, op0, XEXP (x, 1));
881 /* Helper function for adjusting used MEMs. */
884 adjust_mems (rtx loc, const_rtx old_rtx, void *data)
886 struct adjust_mem_data *amd = (struct adjust_mem_data *) data;
887 rtx mem, addr = loc, tem;
888 enum machine_mode mem_mode_save;
890 switch (GET_CODE (loc))
893 /* Don't do any sp or fp replacements outside of MEM addresses
895 if (amd->mem_mode == VOIDmode && amd->store)
897 if (loc == stack_pointer_rtx
898 && !frame_pointer_needed
900 return compute_cfa_pointer (amd->stack_adjust);
901 else if (loc == hard_frame_pointer_rtx
902 && frame_pointer_needed
903 && hard_frame_pointer_adjustment != -1
905 return compute_cfa_pointer (hard_frame_pointer_adjustment);
906 gcc_checking_assert (loc != virtual_incoming_args_rtx);
912 mem = targetm.delegitimize_address (mem);
913 if (mem != loc && !MEM_P (mem))
914 return simplify_replace_fn_rtx (mem, old_rtx, adjust_mems, data);
917 addr = XEXP (mem, 0);
918 mem_mode_save = amd->mem_mode;
919 amd->mem_mode = GET_MODE (mem);
920 store_save = amd->store;
922 addr = simplify_replace_fn_rtx (addr, old_rtx, adjust_mems, data);
923 amd->store = store_save;
924 amd->mem_mode = mem_mode_save;
926 addr = targetm.delegitimize_address (addr);
927 if (addr != XEXP (mem, 0))
928 mem = replace_equiv_address_nv (mem, addr);
930 mem = avoid_constant_pool_reference (mem);
934 addr = gen_rtx_PLUS (GET_MODE (loc), XEXP (loc, 0),
935 GEN_INT (GET_CODE (loc) == PRE_INC
936 ? GET_MODE_SIZE (amd->mem_mode)
937 : -GET_MODE_SIZE (amd->mem_mode)));
941 addr = XEXP (loc, 0);
942 gcc_assert (amd->mem_mode != VOIDmode && amd->mem_mode != BLKmode);
943 addr = simplify_replace_fn_rtx (addr, old_rtx, adjust_mems, data);
944 tem = gen_rtx_PLUS (GET_MODE (loc), XEXP (loc, 0),
945 GEN_INT ((GET_CODE (loc) == PRE_INC
946 || GET_CODE (loc) == POST_INC)
947 ? GET_MODE_SIZE (amd->mem_mode)
948 : -GET_MODE_SIZE (amd->mem_mode)));
949 amd->side_effects = alloc_EXPR_LIST (0,
950 gen_rtx_SET (VOIDmode,
956 addr = XEXP (loc, 1);
959 addr = XEXP (loc, 0);
960 gcc_assert (amd->mem_mode != VOIDmode);
961 addr = simplify_replace_fn_rtx (addr, old_rtx, adjust_mems, data);
962 amd->side_effects = alloc_EXPR_LIST (0,
963 gen_rtx_SET (VOIDmode,
969 /* First try without delegitimization of whole MEMs and
970 avoid_constant_pool_reference, which is more likely to succeed. */
971 store_save = amd->store;
973 addr = simplify_replace_fn_rtx (SUBREG_REG (loc), old_rtx, adjust_mems,
975 amd->store = store_save;
976 mem = simplify_replace_fn_rtx (addr, old_rtx, adjust_mems, data);
977 if (mem == SUBREG_REG (loc))
982 tem = simplify_gen_subreg (GET_MODE (loc), mem,
983 GET_MODE (SUBREG_REG (loc)),
987 tem = simplify_gen_subreg (GET_MODE (loc), addr,
988 GET_MODE (SUBREG_REG (loc)),
991 tem = gen_rtx_raw_SUBREG (GET_MODE (loc), addr, SUBREG_BYTE (loc));
993 if (MAY_HAVE_DEBUG_INSNS
994 && GET_CODE (tem) == SUBREG
995 && (GET_CODE (SUBREG_REG (tem)) == PLUS
996 || GET_CODE (SUBREG_REG (tem)) == MINUS
997 || GET_CODE (SUBREG_REG (tem)) == MULT
998 || GET_CODE (SUBREG_REG (tem)) == ASHIFT)
999 && GET_MODE_CLASS (GET_MODE (tem)) == MODE_INT
1000 && GET_MODE_CLASS (GET_MODE (SUBREG_REG (tem))) == MODE_INT
1001 && GET_MODE_SIZE (GET_MODE (tem))
1002 < GET_MODE_SIZE (GET_MODE (SUBREG_REG (tem)))
1003 && subreg_lowpart_p (tem)
1004 && !for_each_rtx (&SUBREG_REG (tem), use_narrower_mode_test, tem))
1005 return use_narrower_mode (SUBREG_REG (tem), GET_MODE (tem),
1006 GET_MODE (SUBREG_REG (tem)));
1009 /* Don't do any replacements in second and following
1010 ASM_OPERANDS of inline-asm with multiple sets.
1011 ASM_OPERANDS_INPUT_VEC, ASM_OPERANDS_INPUT_CONSTRAINT_VEC
1012 and ASM_OPERANDS_LABEL_VEC need to be equal between
1013 all the ASM_OPERANDs in the insn and adjust_insn will
1015 if (ASM_OPERANDS_OUTPUT_IDX (loc) != 0)
1024 /* Helper function for replacement of uses. */
1027 adjust_mem_uses (rtx *x, void *data)
1029 rtx new_x = simplify_replace_fn_rtx (*x, NULL_RTX, adjust_mems, data);
1031 validate_change (NULL_RTX, x, new_x, true);
1034 /* Helper function for replacement of stores. */
1037 adjust_mem_stores (rtx loc, const_rtx expr, void *data)
1041 rtx new_dest = simplify_replace_fn_rtx (SET_DEST (expr), NULL_RTX,
1043 if (new_dest != SET_DEST (expr))
1045 rtx xexpr = CONST_CAST_RTX (expr);
1046 validate_change (NULL_RTX, &SET_DEST (xexpr), new_dest, true);
1051 /* Simplify INSN. Remove all {PRE,POST}_{INC,DEC,MODIFY} rtxes,
1052 replace them with their value in the insn and add the side-effects
1053 as other sets to the insn. */
1056 adjust_insn (basic_block bb, rtx insn)
1058 struct adjust_mem_data amd;
1061 #ifdef HAVE_window_save
1062 /* If the target machine has an explicit window save instruction, the
1063 transformation OUTGOING_REGNO -> INCOMING_REGNO is done there. */
1064 if (RTX_FRAME_RELATED_P (insn)
1065 && find_reg_note (insn, REG_CFA_WINDOW_SAVE, NULL_RTX))
1067 unsigned int i, nregs = VEC_length(parm_reg_t, windowed_parm_regs);
1068 rtx rtl = gen_rtx_PARALLEL (VOIDmode, rtvec_alloc (nregs * 2));
1071 FOR_EACH_VEC_ELT (parm_reg_t, windowed_parm_regs, i, p)
1073 XVECEXP (rtl, 0, i * 2)
1074 = gen_rtx_SET (VOIDmode, p->incoming, p->outgoing);
1075 /* Do not clobber the attached DECL, but only the REG. */
1076 XVECEXP (rtl, 0, i * 2 + 1)
1077 = gen_rtx_CLOBBER (GET_MODE (p->outgoing),
1078 gen_raw_REG (GET_MODE (p->outgoing),
1079 REGNO (p->outgoing)));
1082 validate_change (NULL_RTX, &PATTERN (insn), rtl, true);
1087 amd.mem_mode = VOIDmode;
1088 amd.stack_adjust = -VTI (bb)->out.stack_adjust;
1089 amd.side_effects = NULL_RTX;
1092 note_stores (PATTERN (insn), adjust_mem_stores, &amd);
1095 if (GET_CODE (PATTERN (insn)) == PARALLEL
1096 && asm_noperands (PATTERN (insn)) > 0
1097 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET)
1102 /* inline-asm with multiple sets is tiny bit more complicated,
1103 because the 3 vectors in ASM_OPERANDS need to be shared between
1104 all ASM_OPERANDS in the instruction. adjust_mems will
1105 not touch ASM_OPERANDS other than the first one, asm_noperands
1106 test above needs to be called before that (otherwise it would fail)
1107 and afterwards this code fixes it up. */
1108 note_uses (&PATTERN (insn), adjust_mem_uses, &amd);
1109 body = PATTERN (insn);
1110 set0 = XVECEXP (body, 0, 0);
1111 gcc_checking_assert (GET_CODE (set0) == SET
1112 && GET_CODE (SET_SRC (set0)) == ASM_OPERANDS
1113 && ASM_OPERANDS_OUTPUT_IDX (SET_SRC (set0)) == 0);
1114 for (i = 1; i < XVECLEN (body, 0); i++)
1115 if (GET_CODE (XVECEXP (body, 0, i)) != SET)
1119 set = XVECEXP (body, 0, i);
1120 gcc_checking_assert (GET_CODE (SET_SRC (set)) == ASM_OPERANDS
1121 && ASM_OPERANDS_OUTPUT_IDX (SET_SRC (set))
1123 if (ASM_OPERANDS_INPUT_VEC (SET_SRC (set))
1124 != ASM_OPERANDS_INPUT_VEC (SET_SRC (set0))
1125 || ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set))
1126 != ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set0))
1127 || ASM_OPERANDS_LABEL_VEC (SET_SRC (set))
1128 != ASM_OPERANDS_LABEL_VEC (SET_SRC (set0)))
1130 rtx newsrc = shallow_copy_rtx (SET_SRC (set));
1131 ASM_OPERANDS_INPUT_VEC (newsrc)
1132 = ASM_OPERANDS_INPUT_VEC (SET_SRC (set0));
1133 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (newsrc)
1134 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set0));
1135 ASM_OPERANDS_LABEL_VEC (newsrc)
1136 = ASM_OPERANDS_LABEL_VEC (SET_SRC (set0));
1137 validate_change (NULL_RTX, &SET_SRC (set), newsrc, true);
1142 note_uses (&PATTERN (insn), adjust_mem_uses, &amd);
1144 /* For read-only MEMs containing some constant, prefer those
1146 set = single_set (insn);
1147 if (set && MEM_P (SET_SRC (set)) && MEM_READONLY_P (SET_SRC (set)))
1149 rtx note = find_reg_equal_equiv_note (insn);
1151 if (note && CONSTANT_P (XEXP (note, 0)))
1152 validate_change (NULL_RTX, &SET_SRC (set), XEXP (note, 0), true);
1155 if (amd.side_effects)
1157 rtx *pat, new_pat, s;
1160 pat = &PATTERN (insn);
1161 if (GET_CODE (*pat) == COND_EXEC)
1162 pat = &COND_EXEC_CODE (*pat);
1163 if (GET_CODE (*pat) == PARALLEL)
1164 oldn = XVECLEN (*pat, 0);
1167 for (s = amd.side_effects, newn = 0; s; newn++)
1169 new_pat = gen_rtx_PARALLEL (VOIDmode, rtvec_alloc (oldn + newn));
1170 if (GET_CODE (*pat) == PARALLEL)
1171 for (i = 0; i < oldn; i++)
1172 XVECEXP (new_pat, 0, i) = XVECEXP (*pat, 0, i);
1174 XVECEXP (new_pat, 0, 0) = *pat;
1175 for (s = amd.side_effects, i = oldn; i < oldn + newn; i++, s = XEXP (s, 1))
1176 XVECEXP (new_pat, 0, i) = XEXP (s, 0);
1177 free_EXPR_LIST_list (&amd.side_effects);
1178 validate_change (NULL_RTX, pat, new_pat, true);
1182 /* Return true if a decl_or_value DV is a DECL or NULL. */
1184 dv_is_decl_p (decl_or_value dv)
1186 return !dv || (int) TREE_CODE ((tree) dv) != (int) VALUE;
1189 /* Return true if a decl_or_value is a VALUE rtl. */
1191 dv_is_value_p (decl_or_value dv)
1193 return dv && !dv_is_decl_p (dv);
1196 /* Return the decl in the decl_or_value. */
1198 dv_as_decl (decl_or_value dv)
1200 gcc_checking_assert (dv_is_decl_p (dv));
1204 /* Return the value in the decl_or_value. */
1206 dv_as_value (decl_or_value dv)
1208 gcc_checking_assert (dv_is_value_p (dv));
1212 /* Return the DEBUG_EXPR of a DEBUG_EXPR_DECL or the VALUE in DV. */
1214 dv_as_rtx (decl_or_value dv)
1218 if (dv_is_value_p (dv))
1219 return dv_as_value (dv);
1221 decl = dv_as_decl (dv);
1223 gcc_checking_assert (TREE_CODE (decl) == DEBUG_EXPR_DECL);
1224 return DECL_RTL_KNOWN_SET (decl);
1227 /* Return the opaque pointer in the decl_or_value. */
1228 static inline void *
1229 dv_as_opaque (decl_or_value dv)
1234 /* Return nonzero if a decl_or_value must not have more than one
1235 variable part. The returned value discriminates among various
1236 kinds of one-part DVs ccording to enum onepart_enum. */
1237 static inline onepart_enum_t
1238 dv_onepart_p (decl_or_value dv)
1242 if (!MAY_HAVE_DEBUG_INSNS)
1245 if (dv_is_value_p (dv))
1246 return ONEPART_VALUE;
1248 decl = dv_as_decl (dv);
1250 if (TREE_CODE (decl) == DEBUG_EXPR_DECL)
1251 return ONEPART_DEXPR;
1253 if (target_for_debug_bind (decl) != NULL_TREE)
1254 return ONEPART_VDECL;
1259 /* Return the variable pool to be used for a dv of type ONEPART. */
1260 static inline alloc_pool
1261 onepart_pool (onepart_enum_t onepart)
1263 return onepart ? valvar_pool : var_pool;
1266 /* Build a decl_or_value out of a decl. */
1267 static inline decl_or_value
1268 dv_from_decl (tree decl)
1272 gcc_checking_assert (dv_is_decl_p (dv));
1276 /* Build a decl_or_value out of a value. */
1277 static inline decl_or_value
1278 dv_from_value (rtx value)
1282 gcc_checking_assert (dv_is_value_p (dv));
1286 /* Return a value or the decl of a debug_expr as a decl_or_value. */
1287 static inline decl_or_value
1292 switch (GET_CODE (x))
1295 dv = dv_from_decl (DEBUG_EXPR_TREE_DECL (x));
1296 gcc_checking_assert (DECL_RTL_KNOWN_SET (DEBUG_EXPR_TREE_DECL (x)) == x);
1300 dv = dv_from_value (x);
1310 extern void debug_dv (decl_or_value dv);
1313 debug_dv (decl_or_value dv)
1315 if (dv_is_value_p (dv))
1316 debug_rtx (dv_as_value (dv));
1318 debug_generic_stmt (dv_as_decl (dv));
1321 typedef unsigned int dvuid;
1323 /* Return the uid of DV. */
1326 dv_uid (decl_or_value dv)
1328 if (dv_is_value_p (dv))
1329 return CSELIB_VAL_PTR (dv_as_value (dv))->uid;
1331 return DECL_UID (dv_as_decl (dv));
1334 /* Compute the hash from the uid. */
1336 static inline hashval_t
1337 dv_uid2hash (dvuid uid)
1342 /* The hash function for a mask table in a shared_htab chain. */
1344 static inline hashval_t
1345 dv_htab_hash (decl_or_value dv)
1347 return dv_uid2hash (dv_uid (dv));
1350 /* The hash function for variable_htab, computes the hash value
1351 from the declaration of variable X. */
1354 variable_htab_hash (const void *x)
1356 const_variable const v = (const_variable) x;
1358 return dv_htab_hash (v->dv);
1361 /* Compare the declaration of variable X with declaration Y. */
1364 variable_htab_eq (const void *x, const void *y)
1366 const_variable const v = (const_variable) x;
1367 decl_or_value dv = CONST_CAST2 (decl_or_value, const void *, y);
1369 return (dv_as_opaque (v->dv) == dv_as_opaque (dv));
1372 static void loc_exp_dep_clear (variable var);
1374 /* Free the element of VARIABLE_HTAB (its type is struct variable_def). */
1377 variable_htab_free (void *elem)
1380 variable var = (variable) elem;
1381 location_chain node, next;
1383 gcc_checking_assert (var->refcount > 0);
1386 if (var->refcount > 0)
1389 for (i = 0; i < var->n_var_parts; i++)
1391 for (node = var->var_part[i].loc_chain; node; node = next)
1394 pool_free (loc_chain_pool, node);
1396 var->var_part[i].loc_chain = NULL;
1398 if (var->onepart && VAR_LOC_1PAUX (var))
1400 loc_exp_dep_clear (var);
1401 if (VAR_LOC_DEP_LST (var))
1402 VAR_LOC_DEP_LST (var)->pprev = NULL;
1403 XDELETE (VAR_LOC_1PAUX (var));
1404 /* These may be reused across functions, so reset
1406 if (var->onepart == ONEPART_DEXPR)
1407 set_dv_changed (var->dv, true);
1409 pool_free (onepart_pool (var->onepart), var);
1412 /* Initialize the set (array) SET of attrs to empty lists. */
1415 init_attrs_list_set (attrs *set)
1419 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1423 /* Make the list *LISTP empty. */
1426 attrs_list_clear (attrs *listp)
1430 for (list = *listp; list; list = next)
1433 pool_free (attrs_pool, list);
1438 /* Return true if the pair of DECL and OFFSET is the member of the LIST. */
1441 attrs_list_member (attrs list, decl_or_value dv, HOST_WIDE_INT offset)
1443 for (; list; list = list->next)
1444 if (dv_as_opaque (list->dv) == dv_as_opaque (dv) && list->offset == offset)
1449 /* Insert the triplet DECL, OFFSET, LOC to the list *LISTP. */
1452 attrs_list_insert (attrs *listp, decl_or_value dv,
1453 HOST_WIDE_INT offset, rtx loc)
1457 list = (attrs) pool_alloc (attrs_pool);
1460 list->offset = offset;
1461 list->next = *listp;
1465 /* Copy all nodes from SRC and create a list *DSTP of the copies. */
1468 attrs_list_copy (attrs *dstp, attrs src)
1472 attrs_list_clear (dstp);
1473 for (; src; src = src->next)
1475 n = (attrs) pool_alloc (attrs_pool);
1478 n->offset = src->offset;
1484 /* Add all nodes from SRC which are not in *DSTP to *DSTP. */
1487 attrs_list_union (attrs *dstp, attrs src)
1489 for (; src; src = src->next)
1491 if (!attrs_list_member (*dstp, src->dv, src->offset))
1492 attrs_list_insert (dstp, src->dv, src->offset, src->loc);
1496 /* Combine nodes that are not onepart nodes from SRC and SRC2 into
1500 attrs_list_mpdv_union (attrs *dstp, attrs src, attrs src2)
1502 gcc_assert (!*dstp);
1503 for (; src; src = src->next)
1505 if (!dv_onepart_p (src->dv))
1506 attrs_list_insert (dstp, src->dv, src->offset, src->loc);
1508 for (src = src2; src; src = src->next)
1510 if (!dv_onepart_p (src->dv)
1511 && !attrs_list_member (*dstp, src->dv, src->offset))
1512 attrs_list_insert (dstp, src->dv, src->offset, src->loc);
1516 /* Shared hashtable support. */
1518 /* Return true if VARS is shared. */
1521 shared_hash_shared (shared_hash vars)
1523 return vars->refcount > 1;
1526 /* Return the hash table for VARS. */
1528 static inline htab_t
1529 shared_hash_htab (shared_hash vars)
1534 /* Return true if VAR is shared, or maybe because VARS is shared. */
1537 shared_var_p (variable var, shared_hash vars)
1539 /* Don't count an entry in the changed_variables table as a duplicate. */
1540 return ((var->refcount > 1 + (int) var->in_changed_variables)
1541 || shared_hash_shared (vars));
1544 /* Copy variables into a new hash table. */
1547 shared_hash_unshare (shared_hash vars)
1549 shared_hash new_vars = (shared_hash) pool_alloc (shared_hash_pool);
1550 gcc_assert (vars->refcount > 1);
1551 new_vars->refcount = 1;
1553 = htab_create (htab_elements (vars->htab) + 3, variable_htab_hash,
1554 variable_htab_eq, variable_htab_free);
1555 vars_copy (new_vars->htab, vars->htab);
1560 /* Increment reference counter on VARS and return it. */
1562 static inline shared_hash
1563 shared_hash_copy (shared_hash vars)
1569 /* Decrement reference counter and destroy hash table if not shared
1573 shared_hash_destroy (shared_hash vars)
1575 gcc_checking_assert (vars->refcount > 0);
1576 if (--vars->refcount == 0)
1578 htab_delete (vars->htab);
1579 pool_free (shared_hash_pool, vars);
1583 /* Unshare *PVARS if shared and return slot for DV. If INS is
1584 INSERT, insert it if not already present. */
1586 static inline void **
1587 shared_hash_find_slot_unshare_1 (shared_hash *pvars, decl_or_value dv,
1588 hashval_t dvhash, enum insert_option ins)
1590 if (shared_hash_shared (*pvars))
1591 *pvars = shared_hash_unshare (*pvars);
1592 return htab_find_slot_with_hash (shared_hash_htab (*pvars), dv, dvhash, ins);
1595 static inline void **
1596 shared_hash_find_slot_unshare (shared_hash *pvars, decl_or_value dv,
1597 enum insert_option ins)
1599 return shared_hash_find_slot_unshare_1 (pvars, dv, dv_htab_hash (dv), ins);
1602 /* Return slot for DV, if it is already present in the hash table.
1603 If it is not present, insert it only VARS is not shared, otherwise
1606 static inline void **
1607 shared_hash_find_slot_1 (shared_hash vars, decl_or_value dv, hashval_t dvhash)
1609 return htab_find_slot_with_hash (shared_hash_htab (vars), dv, dvhash,
1610 shared_hash_shared (vars)
1611 ? NO_INSERT : INSERT);
1614 static inline void **
1615 shared_hash_find_slot (shared_hash vars, decl_or_value dv)
1617 return shared_hash_find_slot_1 (vars, dv, dv_htab_hash (dv));
1620 /* Return slot for DV only if it is already present in the hash table. */
1622 static inline void **
1623 shared_hash_find_slot_noinsert_1 (shared_hash vars, decl_or_value dv,
1626 return htab_find_slot_with_hash (shared_hash_htab (vars), dv, dvhash,
1630 static inline void **
1631 shared_hash_find_slot_noinsert (shared_hash vars, decl_or_value dv)
1633 return shared_hash_find_slot_noinsert_1 (vars, dv, dv_htab_hash (dv));
1636 /* Return variable for DV or NULL if not already present in the hash
1639 static inline variable
1640 shared_hash_find_1 (shared_hash vars, decl_or_value dv, hashval_t dvhash)
1642 return (variable) htab_find_with_hash (shared_hash_htab (vars), dv, dvhash);
1645 static inline variable
1646 shared_hash_find (shared_hash vars, decl_or_value dv)
1648 return shared_hash_find_1 (vars, dv, dv_htab_hash (dv));
1651 /* Return true if TVAL is better than CVAL as a canonival value. We
1652 choose lowest-numbered VALUEs, using the RTX address as a
1653 tie-breaker. The idea is to arrange them into a star topology,
1654 such that all of them are at most one step away from the canonical
1655 value, and the canonical value has backlinks to all of them, in
1656 addition to all the actual locations. We don't enforce this
1657 topology throughout the entire dataflow analysis, though.
1661 canon_value_cmp (rtx tval, rtx cval)
1664 || CSELIB_VAL_PTR (tval)->uid < CSELIB_VAL_PTR (cval)->uid;
1667 static bool dst_can_be_shared;
1669 /* Return a copy of a variable VAR and insert it to dataflow set SET. */
1672 unshare_variable (dataflow_set *set, void **slot, variable var,
1673 enum var_init_status initialized)
1678 new_var = (variable) pool_alloc (onepart_pool (var->onepart));
1679 new_var->dv = var->dv;
1680 new_var->refcount = 1;
1682 new_var->n_var_parts = var->n_var_parts;
1683 new_var->onepart = var->onepart;
1684 new_var->in_changed_variables = false;
1686 if (! flag_var_tracking_uninit)
1687 initialized = VAR_INIT_STATUS_INITIALIZED;
1689 for (i = 0; i < var->n_var_parts; i++)
1691 location_chain node;
1692 location_chain *nextp;
1694 if (i == 0 && var->onepart)
1696 /* One-part auxiliary data is only used while emitting
1697 notes, so propagate it to the new variable in the active
1698 dataflow set. If we're not emitting notes, this will be
1700 gcc_checking_assert (!VAR_LOC_1PAUX (var) || emit_notes);
1701 VAR_LOC_1PAUX (new_var) = VAR_LOC_1PAUX (var);
1702 VAR_LOC_1PAUX (var) = NULL;
1705 VAR_PART_OFFSET (new_var, i) = VAR_PART_OFFSET (var, i);
1706 nextp = &new_var->var_part[i].loc_chain;
1707 for (node = var->var_part[i].loc_chain; node; node = node->next)
1709 location_chain new_lc;
1711 new_lc = (location_chain) pool_alloc (loc_chain_pool);
1712 new_lc->next = NULL;
1713 if (node->init > initialized)
1714 new_lc->init = node->init;
1716 new_lc->init = initialized;
1717 if (node->set_src && !(MEM_P (node->set_src)))
1718 new_lc->set_src = node->set_src;
1720 new_lc->set_src = NULL;
1721 new_lc->loc = node->loc;
1724 nextp = &new_lc->next;
1727 new_var->var_part[i].cur_loc = var->var_part[i].cur_loc;
1730 dst_can_be_shared = false;
1731 if (shared_hash_shared (set->vars))
1732 slot = shared_hash_find_slot_unshare (&set->vars, var->dv, NO_INSERT);
1733 else if (set->traversed_vars && set->vars != set->traversed_vars)
1734 slot = shared_hash_find_slot_noinsert (set->vars, var->dv);
1736 if (var->in_changed_variables)
1739 = htab_find_slot_with_hash (changed_variables, var->dv,
1740 dv_htab_hash (var->dv), NO_INSERT);
1741 gcc_assert (*cslot == (void *) var);
1742 var->in_changed_variables = false;
1743 variable_htab_free (var);
1745 new_var->in_changed_variables = true;
1750 /* Copy all variables from hash table SRC to hash table DST. */
1753 vars_copy (htab_t dst, htab_t src)
1758 FOR_EACH_HTAB_ELEMENT (src, var, variable, hi)
1762 dstp = htab_find_slot_with_hash (dst, var->dv,
1763 dv_htab_hash (var->dv),
1769 /* Map a decl to its main debug decl. */
1772 var_debug_decl (tree decl)
1774 if (decl && DECL_P (decl)
1775 && DECL_DEBUG_EXPR_IS_FROM (decl))
1777 tree debugdecl = DECL_DEBUG_EXPR (decl);
1778 if (debugdecl && DECL_P (debugdecl))
1785 /* Set the register LOC to contain DV, OFFSET. */
1788 var_reg_decl_set (dataflow_set *set, rtx loc, enum var_init_status initialized,
1789 decl_or_value dv, HOST_WIDE_INT offset, rtx set_src,
1790 enum insert_option iopt)
1793 bool decl_p = dv_is_decl_p (dv);
1796 dv = dv_from_decl (var_debug_decl (dv_as_decl (dv)));
1798 for (node = set->regs[REGNO (loc)]; node; node = node->next)
1799 if (dv_as_opaque (node->dv) == dv_as_opaque (dv)
1800 && node->offset == offset)
1803 attrs_list_insert (&set->regs[REGNO (loc)], dv, offset, loc);
1804 set_variable_part (set, loc, dv, offset, initialized, set_src, iopt);
1807 /* Set the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). */
1810 var_reg_set (dataflow_set *set, rtx loc, enum var_init_status initialized,
1813 tree decl = REG_EXPR (loc);
1814 HOST_WIDE_INT offset = REG_OFFSET (loc);
1816 var_reg_decl_set (set, loc, initialized,
1817 dv_from_decl (decl), offset, set_src, INSERT);
1820 static enum var_init_status
1821 get_init_value (dataflow_set *set, rtx loc, decl_or_value dv)
1825 enum var_init_status ret_val = VAR_INIT_STATUS_UNKNOWN;
1827 if (! flag_var_tracking_uninit)
1828 return VAR_INIT_STATUS_INITIALIZED;
1830 var = shared_hash_find (set->vars, dv);
1833 for (i = 0; i < var->n_var_parts && ret_val == VAR_INIT_STATUS_UNKNOWN; i++)
1835 location_chain nextp;
1836 for (nextp = var->var_part[i].loc_chain; nextp; nextp = nextp->next)
1837 if (rtx_equal_p (nextp->loc, loc))
1839 ret_val = nextp->init;
1848 /* Delete current content of register LOC in dataflow set SET and set
1849 the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). If
1850 MODIFY is true, any other live copies of the same variable part are
1851 also deleted from the dataflow set, otherwise the variable part is
1852 assumed to be copied from another location holding the same
1856 var_reg_delete_and_set (dataflow_set *set, rtx loc, bool modify,
1857 enum var_init_status initialized, rtx set_src)
1859 tree decl = REG_EXPR (loc);
1860 HOST_WIDE_INT offset = REG_OFFSET (loc);
1864 decl = var_debug_decl (decl);
1866 if (initialized == VAR_INIT_STATUS_UNKNOWN)
1867 initialized = get_init_value (set, loc, dv_from_decl (decl));
1869 nextp = &set->regs[REGNO (loc)];
1870 for (node = *nextp; node; node = next)
1873 if (dv_as_opaque (node->dv) != decl || node->offset != offset)
1875 delete_variable_part (set, node->loc, node->dv, node->offset);
1876 pool_free (attrs_pool, node);
1882 nextp = &node->next;
1886 clobber_variable_part (set, loc, dv_from_decl (decl), offset, set_src);
1887 var_reg_set (set, loc, initialized, set_src);
1890 /* Delete the association of register LOC in dataflow set SET with any
1891 variables that aren't onepart. If CLOBBER is true, also delete any
1892 other live copies of the same variable part, and delete the
1893 association with onepart dvs too. */
1896 var_reg_delete (dataflow_set *set, rtx loc, bool clobber)
1898 attrs *nextp = &set->regs[REGNO (loc)];
1903 tree decl = REG_EXPR (loc);
1904 HOST_WIDE_INT offset = REG_OFFSET (loc);
1906 decl = var_debug_decl (decl);
1908 clobber_variable_part (set, NULL, dv_from_decl (decl), offset, NULL);
1911 for (node = *nextp; node; node = next)
1914 if (clobber || !dv_onepart_p (node->dv))
1916 delete_variable_part (set, node->loc, node->dv, node->offset);
1917 pool_free (attrs_pool, node);
1921 nextp = &node->next;
1925 /* Delete content of register with number REGNO in dataflow set SET. */
1928 var_regno_delete (dataflow_set *set, int regno)
1930 attrs *reg = &set->regs[regno];
1933 for (node = *reg; node; node = next)
1936 delete_variable_part (set, node->loc, node->dv, node->offset);
1937 pool_free (attrs_pool, node);
1942 /* Set the location of DV, OFFSET as the MEM LOC. */
1945 var_mem_decl_set (dataflow_set *set, rtx loc, enum var_init_status initialized,
1946 decl_or_value dv, HOST_WIDE_INT offset, rtx set_src,
1947 enum insert_option iopt)
1949 if (dv_is_decl_p (dv))
1950 dv = dv_from_decl (var_debug_decl (dv_as_decl (dv)));
1952 set_variable_part (set, loc, dv, offset, initialized, set_src, iopt);
1955 /* Set the location part of variable MEM_EXPR (LOC) in dataflow set
1957 Adjust the address first if it is stack pointer based. */
1960 var_mem_set (dataflow_set *set, rtx loc, enum var_init_status initialized,
1963 tree decl = MEM_EXPR (loc);
1964 HOST_WIDE_INT offset = INT_MEM_OFFSET (loc);
1966 var_mem_decl_set (set, loc, initialized,
1967 dv_from_decl (decl), offset, set_src, INSERT);
1970 /* Delete and set the location part of variable MEM_EXPR (LOC) in
1971 dataflow set SET to LOC. If MODIFY is true, any other live copies
1972 of the same variable part are also deleted from the dataflow set,
1973 otherwise the variable part is assumed to be copied from another
1974 location holding the same part.
1975 Adjust the address first if it is stack pointer based. */
1978 var_mem_delete_and_set (dataflow_set *set, rtx loc, bool modify,
1979 enum var_init_status initialized, rtx set_src)
1981 tree decl = MEM_EXPR (loc);
1982 HOST_WIDE_INT offset = INT_MEM_OFFSET (loc);
1984 decl = var_debug_decl (decl);
1986 if (initialized == VAR_INIT_STATUS_UNKNOWN)
1987 initialized = get_init_value (set, loc, dv_from_decl (decl));
1990 clobber_variable_part (set, NULL, dv_from_decl (decl), offset, set_src);
1991 var_mem_set (set, loc, initialized, set_src);
1994 /* Delete the location part LOC from dataflow set SET. If CLOBBER is
1995 true, also delete any other live copies of the same variable part.
1996 Adjust the address first if it is stack pointer based. */
1999 var_mem_delete (dataflow_set *set, rtx loc, bool clobber)
2001 tree decl = MEM_EXPR (loc);
2002 HOST_WIDE_INT offset = INT_MEM_OFFSET (loc);
2004 decl = var_debug_decl (decl);
2006 clobber_variable_part (set, NULL, dv_from_decl (decl), offset, NULL);
2007 delete_variable_part (set, loc, dv_from_decl (decl), offset);
2010 /* Return true if LOC should not be expanded for location expressions,
2014 unsuitable_loc (rtx loc)
2016 switch (GET_CODE (loc))
2030 /* Bind VAL to LOC in SET. If MODIFIED, detach LOC from any values
2034 val_bind (dataflow_set *set, rtx val, rtx loc, bool modified)
2039 var_regno_delete (set, REGNO (loc));
2040 var_reg_decl_set (set, loc, VAR_INIT_STATUS_INITIALIZED,
2041 dv_from_value (val), 0, NULL_RTX, INSERT);
2043 else if (MEM_P (loc))
2045 struct elt_loc_list *l = CSELIB_VAL_PTR (val)->locs;
2047 if (l && GET_CODE (l->loc) == VALUE)
2048 l = canonical_cselib_val (CSELIB_VAL_PTR (l->loc))->locs;
2050 /* If this MEM is a global constant, we don't need it in the
2051 dynamic tables. ??? We should test this before emitting the
2052 micro-op in the first place. */
2054 if (GET_CODE (l->loc) == MEM && XEXP (l->loc, 0) == XEXP (loc, 0))
2060 var_mem_decl_set (set, loc, VAR_INIT_STATUS_INITIALIZED,
2061 dv_from_value (val), 0, NULL_RTX, INSERT);
2065 /* Other kinds of equivalences are necessarily static, at least
2066 so long as we do not perform substitutions while merging
2069 set_variable_part (set, loc, dv_from_value (val), 0,
2070 VAR_INIT_STATUS_INITIALIZED, NULL_RTX, INSERT);
2074 /* Bind a value to a location it was just stored in. If MODIFIED
2075 holds, assume the location was modified, detaching it from any
2076 values bound to it. */
2079 val_store (dataflow_set *set, rtx val, rtx loc, rtx insn, bool modified)
2081 cselib_val *v = CSELIB_VAL_PTR (val);
2083 gcc_assert (cselib_preserved_value_p (v));
2087 fprintf (dump_file, "%i: ", insn ? INSN_UID (insn) : 0);
2088 print_inline_rtx (dump_file, loc, 0);
2089 fprintf (dump_file, " evaluates to ");
2090 print_inline_rtx (dump_file, val, 0);
2093 struct elt_loc_list *l;
2094 for (l = v->locs; l; l = l->next)
2096 fprintf (dump_file, "\n%i: ", INSN_UID (l->setting_insn));
2097 print_inline_rtx (dump_file, l->loc, 0);
2100 fprintf (dump_file, "\n");
2103 gcc_checking_assert (!unsuitable_loc (loc));
2105 val_bind (set, val, loc, modified);
2108 /* Reset this node, detaching all its equivalences. Return the slot
2109 in the variable hash table that holds dv, if there is one. */
2112 val_reset (dataflow_set *set, decl_or_value dv)
2114 variable var = shared_hash_find (set->vars, dv) ;
2115 location_chain node;
2118 if (!var || !var->n_var_parts)
2121 gcc_assert (var->n_var_parts == 1);
2124 for (node = var->var_part[0].loc_chain; node; node = node->next)
2125 if (GET_CODE (node->loc) == VALUE
2126 && canon_value_cmp (node->loc, cval))
2129 for (node = var->var_part[0].loc_chain; node; node = node->next)
2130 if (GET_CODE (node->loc) == VALUE && cval != node->loc)
2132 /* Redirect the equivalence link to the new canonical
2133 value, or simply remove it if it would point at
2136 set_variable_part (set, cval, dv_from_value (node->loc),
2137 0, node->init, node->set_src, NO_INSERT);
2138 delete_variable_part (set, dv_as_value (dv),
2139 dv_from_value (node->loc), 0);
2144 decl_or_value cdv = dv_from_value (cval);
2146 /* Keep the remaining values connected, accummulating links
2147 in the canonical value. */
2148 for (node = var->var_part[0].loc_chain; node; node = node->next)
2150 if (node->loc == cval)
2152 else if (GET_CODE (node->loc) == REG)
2153 var_reg_decl_set (set, node->loc, node->init, cdv, 0,
2154 node->set_src, NO_INSERT);
2155 else if (GET_CODE (node->loc) == MEM)
2156 var_mem_decl_set (set, node->loc, node->init, cdv, 0,
2157 node->set_src, NO_INSERT);
2159 set_variable_part (set, node->loc, cdv, 0,
2160 node->init, node->set_src, NO_INSERT);
2164 /* We remove this last, to make sure that the canonical value is not
2165 removed to the point of requiring reinsertion. */
2167 delete_variable_part (set, dv_as_value (dv), dv_from_value (cval), 0);
2169 clobber_variable_part (set, NULL, dv, 0, NULL);
2172 /* Find the values in a given location and map the val to another
2173 value, if it is unique, or add the location as one holding the
2177 val_resolve (dataflow_set *set, rtx val, rtx loc, rtx insn)
2179 decl_or_value dv = dv_from_value (val);
2181 if (dump_file && (dump_flags & TDF_DETAILS))
2184 fprintf (dump_file, "%i: ", INSN_UID (insn));
2186 fprintf (dump_file, "head: ");
2187 print_inline_rtx (dump_file, val, 0);
2188 fputs (" is at ", dump_file);
2189 print_inline_rtx (dump_file, loc, 0);
2190 fputc ('\n', dump_file);
2193 val_reset (set, dv);
2195 gcc_checking_assert (!unsuitable_loc (loc));
2199 attrs node, found = NULL;
2201 for (node = set->regs[REGNO (loc)]; node; node = node->next)
2202 if (dv_is_value_p (node->dv)
2203 && GET_MODE (dv_as_value (node->dv)) == GET_MODE (loc))
2207 /* Map incoming equivalences. ??? Wouldn't it be nice if
2208 we just started sharing the location lists? Maybe a
2209 circular list ending at the value itself or some
2211 set_variable_part (set, dv_as_value (node->dv),
2212 dv_from_value (val), node->offset,
2213 VAR_INIT_STATUS_INITIALIZED, NULL_RTX, INSERT);
2214 set_variable_part (set, val, node->dv, node->offset,
2215 VAR_INIT_STATUS_INITIALIZED, NULL_RTX, INSERT);
2218 /* If we didn't find any equivalence, we need to remember that
2219 this value is held in the named register. */
2223 /* ??? Attempt to find and merge equivalent MEMs or other
2226 val_bind (set, val, loc, false);
2229 /* Initialize dataflow set SET to be empty.
2230 VARS_SIZE is the initial size of hash table VARS. */
2233 dataflow_set_init (dataflow_set *set)
2235 init_attrs_list_set (set->regs);
2236 set->vars = shared_hash_copy (empty_shared_hash);
2237 set->stack_adjust = 0;
2238 set->traversed_vars = NULL;
2241 /* Delete the contents of dataflow set SET. */
2244 dataflow_set_clear (dataflow_set *set)
2248 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
2249 attrs_list_clear (&set->regs[i]);
2251 shared_hash_destroy (set->vars);
2252 set->vars = shared_hash_copy (empty_shared_hash);
2255 /* Copy the contents of dataflow set SRC to DST. */
2258 dataflow_set_copy (dataflow_set *dst, dataflow_set *src)
2262 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
2263 attrs_list_copy (&dst->regs[i], src->regs[i]);
2265 shared_hash_destroy (dst->vars);
2266 dst->vars = shared_hash_copy (src->vars);
2267 dst->stack_adjust = src->stack_adjust;
2270 /* Information for merging lists of locations for a given offset of variable.
2272 struct variable_union_info
2274 /* Node of the location chain. */
2277 /* The sum of positions in the input chains. */
2280 /* The position in the chain of DST dataflow set. */
2284 /* Buffer for location list sorting and its allocated size. */
2285 static struct variable_union_info *vui_vec;
2286 static int vui_allocated;
2288 /* Compare function for qsort, order the structures by POS element. */
2291 variable_union_info_cmp_pos (const void *n1, const void *n2)
2293 const struct variable_union_info *const i1 =
2294 (const struct variable_union_info *) n1;
2295 const struct variable_union_info *const i2 =
2296 ( const struct variable_union_info *) n2;
2298 if (i1->pos != i2->pos)
2299 return i1->pos - i2->pos;
2301 return (i1->pos_dst - i2->pos_dst);
2304 /* Compute union of location parts of variable *SLOT and the same variable
2305 from hash table DATA. Compute "sorted" union of the location chains
2306 for common offsets, i.e. the locations of a variable part are sorted by
2307 a priority where the priority is the sum of the positions in the 2 chains
2308 (if a location is only in one list the position in the second list is
2309 defined to be larger than the length of the chains).
2310 When we are updating the location parts the newest location is in the
2311 beginning of the chain, so when we do the described "sorted" union
2312 we keep the newest locations in the beginning. */
2315 variable_union (variable src, dataflow_set *set)
2321 dstp = shared_hash_find_slot (set->vars, src->dv);
2322 if (!dstp || !*dstp)
2326 dst_can_be_shared = false;
2328 dstp = shared_hash_find_slot_unshare (&set->vars, src->dv, INSERT);
2332 /* Continue traversing the hash table. */
2336 dst = (variable) *dstp;
2338 gcc_assert (src->n_var_parts);
2339 gcc_checking_assert (src->onepart == dst->onepart);
2341 /* We can combine one-part variables very efficiently, because their
2342 entries are in canonical order. */
2345 location_chain *nodep, dnode, snode;
2347 gcc_assert (src->n_var_parts == 1
2348 && dst->n_var_parts == 1);
2350 snode = src->var_part[0].loc_chain;
2353 restart_onepart_unshared:
2354 nodep = &dst->var_part[0].loc_chain;
2360 int r = dnode ? loc_cmp (dnode->loc, snode->loc) : 1;
2364 location_chain nnode;
2366 if (shared_var_p (dst, set->vars))
2368 dstp = unshare_variable (set, dstp, dst,
2369 VAR_INIT_STATUS_INITIALIZED);
2370 dst = (variable)*dstp;
2371 goto restart_onepart_unshared;
2374 *nodep = nnode = (location_chain) pool_alloc (loc_chain_pool);
2375 nnode->loc = snode->loc;
2376 nnode->init = snode->init;
2377 if (!snode->set_src || MEM_P (snode->set_src))
2378 nnode->set_src = NULL;
2380 nnode->set_src = snode->set_src;
2381 nnode->next = dnode;
2385 gcc_checking_assert (rtx_equal_p (dnode->loc, snode->loc));
2388 snode = snode->next;
2390 nodep = &dnode->next;
2397 gcc_checking_assert (!src->onepart);
2399 /* Count the number of location parts, result is K. */
2400 for (i = 0, j = 0, k = 0;
2401 i < src->n_var_parts && j < dst->n_var_parts; k++)
2403 if (VAR_PART_OFFSET (src, i) == VAR_PART_OFFSET (dst, j))
2408 else if (VAR_PART_OFFSET (src, i) < VAR_PART_OFFSET (dst, j))
2413 k += src->n_var_parts - i;
2414 k += dst->n_var_parts - j;
2416 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
2417 thus there are at most MAX_VAR_PARTS different offsets. */
2418 gcc_checking_assert (dst->onepart ? k == 1 : k <= MAX_VAR_PARTS);
2420 if (dst->n_var_parts != k && shared_var_p (dst, set->vars))
2422 dstp = unshare_variable (set, dstp, dst, VAR_INIT_STATUS_UNKNOWN);
2423 dst = (variable)*dstp;
2426 i = src->n_var_parts - 1;
2427 j = dst->n_var_parts - 1;
2428 dst->n_var_parts = k;
2430 for (k--; k >= 0; k--)
2432 location_chain node, node2;
2434 if (i >= 0 && j >= 0
2435 && VAR_PART_OFFSET (src, i) == VAR_PART_OFFSET (dst, j))
2437 /* Compute the "sorted" union of the chains, i.e. the locations which
2438 are in both chains go first, they are sorted by the sum of
2439 positions in the chains. */
2442 struct variable_union_info *vui;
2444 /* If DST is shared compare the location chains.
2445 If they are different we will modify the chain in DST with
2446 high probability so make a copy of DST. */
2447 if (shared_var_p (dst, set->vars))
2449 for (node = src->var_part[i].loc_chain,
2450 node2 = dst->var_part[j].loc_chain; node && node2;
2451 node = node->next, node2 = node2->next)
2453 if (!((REG_P (node2->loc)
2454 && REG_P (node->loc)
2455 && REGNO (node2->loc) == REGNO (node->loc))
2456 || rtx_equal_p (node2->loc, node->loc)))
2458 if (node2->init < node->init)
2459 node2->init = node->init;
2465 dstp = unshare_variable (set, dstp, dst,
2466 VAR_INIT_STATUS_UNKNOWN);
2467 dst = (variable)*dstp;
2472 for (node = src->var_part[i].loc_chain; node; node = node->next)
2475 for (node = dst->var_part[j].loc_chain; node; node = node->next)
2480 /* The most common case, much simpler, no qsort is needed. */
2481 location_chain dstnode = dst->var_part[j].loc_chain;
2482 dst->var_part[k].loc_chain = dstnode;
2483 VAR_PART_OFFSET (dst, k) = VAR_PART_OFFSET(dst, j);
2485 for (node = src->var_part[i].loc_chain; node; node = node->next)
2486 if (!((REG_P (dstnode->loc)
2487 && REG_P (node->loc)
2488 && REGNO (dstnode->loc) == REGNO (node->loc))
2489 || rtx_equal_p (dstnode->loc, node->loc)))
2491 location_chain new_node;
2493 /* Copy the location from SRC. */
2494 new_node = (location_chain) pool_alloc (loc_chain_pool);
2495 new_node->loc = node->loc;
2496 new_node->init = node->init;
2497 if (!node->set_src || MEM_P (node->set_src))
2498 new_node->set_src = NULL;
2500 new_node->set_src = node->set_src;
2501 node2->next = new_node;
2508 if (src_l + dst_l > vui_allocated)
2510 vui_allocated = MAX (vui_allocated * 2, src_l + dst_l);
2511 vui_vec = XRESIZEVEC (struct variable_union_info, vui_vec,
2516 /* Fill in the locations from DST. */
2517 for (node = dst->var_part[j].loc_chain, jj = 0; node;
2518 node = node->next, jj++)
2521 vui[jj].pos_dst = jj;
2523 /* Pos plus value larger than a sum of 2 valid positions. */
2524 vui[jj].pos = jj + src_l + dst_l;
2527 /* Fill in the locations from SRC. */
2529 for (node = src->var_part[i].loc_chain, ii = 0; node;
2530 node = node->next, ii++)
2532 /* Find location from NODE. */
2533 for (jj = 0; jj < dst_l; jj++)
2535 if ((REG_P (vui[jj].lc->loc)
2536 && REG_P (node->loc)
2537 && REGNO (vui[jj].lc->loc) == REGNO (node->loc))
2538 || rtx_equal_p (vui[jj].lc->loc, node->loc))
2540 vui[jj].pos = jj + ii;
2544 if (jj >= dst_l) /* The location has not been found. */
2546 location_chain new_node;
2548 /* Copy the location from SRC. */
2549 new_node = (location_chain) pool_alloc (loc_chain_pool);
2550 new_node->loc = node->loc;
2551 new_node->init = node->init;
2552 if (!node->set_src || MEM_P (node->set_src))
2553 new_node->set_src = NULL;
2555 new_node->set_src = node->set_src;
2556 vui[n].lc = new_node;
2557 vui[n].pos_dst = src_l + dst_l;
2558 vui[n].pos = ii + src_l + dst_l;
2565 /* Special case still very common case. For dst_l == 2
2566 all entries dst_l ... n-1 are sorted, with for i >= dst_l
2567 vui[i].pos == i + src_l + dst_l. */
2568 if (vui[0].pos > vui[1].pos)
2570 /* Order should be 1, 0, 2... */
2571 dst->var_part[k].loc_chain = vui[1].lc;
2572 vui[1].lc->next = vui[0].lc;
2575 vui[0].lc->next = vui[2].lc;
2576 vui[n - 1].lc->next = NULL;
2579 vui[0].lc->next = NULL;
2584 dst->var_part[k].loc_chain = vui[0].lc;
2585 if (n >= 3 && vui[2].pos < vui[1].pos)
2587 /* Order should be 0, 2, 1, 3... */
2588 vui[0].lc->next = vui[2].lc;
2589 vui[2].lc->next = vui[1].lc;
2592 vui[1].lc->next = vui[3].lc;
2593 vui[n - 1].lc->next = NULL;
2596 vui[1].lc->next = NULL;
2601 /* Order should be 0, 1, 2... */
2603 vui[n - 1].lc->next = NULL;
2606 for (; ii < n; ii++)
2607 vui[ii - 1].lc->next = vui[ii].lc;
2611 qsort (vui, n, sizeof (struct variable_union_info),
2612 variable_union_info_cmp_pos);
2614 /* Reconnect the nodes in sorted order. */
2615 for (ii = 1; ii < n; ii++)
2616 vui[ii - 1].lc->next = vui[ii].lc;
2617 vui[n - 1].lc->next = NULL;
2618 dst->var_part[k].loc_chain = vui[0].lc;
2621 VAR_PART_OFFSET (dst, k) = VAR_PART_OFFSET (dst, j);
2626 else if ((i >= 0 && j >= 0
2627 && VAR_PART_OFFSET (src, i) < VAR_PART_OFFSET (dst, j))
2630 dst->var_part[k] = dst->var_part[j];
2633 else if ((i >= 0 && j >= 0
2634 && VAR_PART_OFFSET (src, i) > VAR_PART_OFFSET (dst, j))
2637 location_chain *nextp;
2639 /* Copy the chain from SRC. */
2640 nextp = &dst->var_part[k].loc_chain;
2641 for (node = src->var_part[i].loc_chain; node; node = node->next)
2643 location_chain new_lc;
2645 new_lc = (location_chain) pool_alloc (loc_chain_pool);
2646 new_lc->next = NULL;
2647 new_lc->init = node->init;
2648 if (!node->set_src || MEM_P (node->set_src))
2649 new_lc->set_src = NULL;
2651 new_lc->set_src = node->set_src;
2652 new_lc->loc = node->loc;
2655 nextp = &new_lc->next;
2658 VAR_PART_OFFSET (dst, k) = VAR_PART_OFFSET (src, i);
2661 dst->var_part[k].cur_loc = NULL;
2664 if (flag_var_tracking_uninit)
2665 for (i = 0; i < src->n_var_parts && i < dst->n_var_parts; i++)
2667 location_chain node, node2;
2668 for (node = src->var_part[i].loc_chain; node; node = node->next)
2669 for (node2 = dst->var_part[i].loc_chain; node2; node2 = node2->next)
2670 if (rtx_equal_p (node->loc, node2->loc))
2672 if (node->init > node2->init)
2673 node2->init = node->init;
2677 /* Continue traversing the hash table. */
2681 /* Compute union of dataflow sets SRC and DST and store it to DST. */
2684 dataflow_set_union (dataflow_set *dst, dataflow_set *src)
2688 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
2689 attrs_list_union (&dst->regs[i], src->regs[i]);
2691 if (dst->vars == empty_shared_hash)
2693 shared_hash_destroy (dst->vars);
2694 dst->vars = shared_hash_copy (src->vars);
2701 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (src->vars), var, variable, hi)
2702 variable_union (var, dst);
2706 /* Whether the value is currently being expanded. */
2707 #define VALUE_RECURSED_INTO(x) \
2708 (RTL_FLAG_CHECK2 ("VALUE_RECURSED_INTO", (x), VALUE, DEBUG_EXPR)->used)
2710 /* Whether no expansion was found, saving useless lookups.
2711 It must only be set when VALUE_CHANGED is clear. */
2712 #define NO_LOC_P(x) \
2713 (RTL_FLAG_CHECK2 ("NO_LOC_P", (x), VALUE, DEBUG_EXPR)->return_val)
2715 /* Whether cur_loc in the value needs to be (re)computed. */
2716 #define VALUE_CHANGED(x) \
2717 (RTL_FLAG_CHECK1 ("VALUE_CHANGED", (x), VALUE)->frame_related)
2718 /* Whether cur_loc in the decl needs to be (re)computed. */
2719 #define DECL_CHANGED(x) TREE_VISITED (x)
2721 /* Record (if NEWV) that DV needs to have its cur_loc recomputed. For
2722 user DECLs, this means they're in changed_variables. Values and
2723 debug exprs may be left with this flag set if no user variable
2724 requires them to be evaluated. */
2727 set_dv_changed (decl_or_value dv, bool newv)
2729 switch (dv_onepart_p (dv))
2733 NO_LOC_P (dv_as_value (dv)) = false;
2734 VALUE_CHANGED (dv_as_value (dv)) = newv;
2739 NO_LOC_P (DECL_RTL_KNOWN_SET (dv_as_decl (dv))) = false;
2740 /* Fall through... */
2743 DECL_CHANGED (dv_as_decl (dv)) = newv;
2748 /* Return true if DV needs to have its cur_loc recomputed. */
2751 dv_changed_p (decl_or_value dv)
2753 return (dv_is_value_p (dv)
2754 ? VALUE_CHANGED (dv_as_value (dv))
2755 : DECL_CHANGED (dv_as_decl (dv)));
2758 /* Return a location list node whose loc is rtx_equal to LOC, in the
2759 location list of a one-part variable or value VAR, or in that of
2760 any values recursively mentioned in the location lists. VARS must
2761 be in star-canonical form. */
2763 static location_chain
2764 find_loc_in_1pdv (rtx loc, variable var, htab_t vars)
2766 location_chain node;
2767 enum rtx_code loc_code;
2772 gcc_checking_assert (var->onepart);
2774 if (!var->n_var_parts)
2777 gcc_checking_assert (loc != dv_as_opaque (var->dv));
2779 loc_code = GET_CODE (loc);
2780 for (node = var->var_part[0].loc_chain; node; node = node->next)
2785 if (GET_CODE (node->loc) != loc_code)
2787 if (GET_CODE (node->loc) != VALUE)
2790 else if (loc == node->loc)
2792 else if (loc_code != VALUE)
2794 if (rtx_equal_p (loc, node->loc))
2799 /* Since we're in star-canonical form, we don't need to visit
2800 non-canonical nodes: one-part variables and non-canonical
2801 values would only point back to the canonical node. */
2802 if (dv_is_value_p (var->dv)
2803 && !canon_value_cmp (node->loc, dv_as_value (var->dv)))
2805 /* Skip all subsequent VALUEs. */
2806 while (node->next && GET_CODE (node->next->loc) == VALUE)
2809 gcc_checking_assert (!canon_value_cmp (node->loc,
2810 dv_as_value (var->dv)));
2811 if (loc == node->loc)
2817 gcc_checking_assert (node == var->var_part[0].loc_chain);
2818 gcc_checking_assert (!node->next);
2820 dv = dv_from_value (node->loc);
2821 rvar = (variable) htab_find_with_hash (vars, dv, dv_htab_hash (dv));
2822 return find_loc_in_1pdv (loc, rvar, vars);
2825 /* ??? Gotta look in cselib_val locations too. */
2830 /* Hash table iteration argument passed to variable_merge. */
2833 /* The set in which the merge is to be inserted. */
2835 /* The set that we're iterating in. */
2837 /* The set that may contain the other dv we are to merge with. */
2839 /* Number of onepart dvs in src. */
2840 int src_onepart_cnt;
2843 /* Insert LOC in *DNODE, if it's not there yet. The list must be in
2844 loc_cmp order, and it is maintained as such. */
2847 insert_into_intersection (location_chain *nodep, rtx loc,
2848 enum var_init_status status)
2850 location_chain node;
2853 for (node = *nodep; node; nodep = &node->next, node = *nodep)
2854 if ((r = loc_cmp (node->loc, loc)) == 0)
2856 node->init = MIN (node->init, status);
2862 node = (location_chain) pool_alloc (loc_chain_pool);
2865 node->set_src = NULL;
2866 node->init = status;
2867 node->next = *nodep;
2871 /* Insert in DEST the intersection of the locations present in both
2872 S1NODE and S2VAR, directly or indirectly. S1NODE is from a
2873 variable in DSM->cur, whereas S2VAR is from DSM->src. dvar is in
2877 intersect_loc_chains (rtx val, location_chain *dest, struct dfset_merge *dsm,
2878 location_chain s1node, variable s2var)
2880 dataflow_set *s1set = dsm->cur;
2881 dataflow_set *s2set = dsm->src;
2882 location_chain found;
2886 location_chain s2node;
2888 gcc_checking_assert (s2var->onepart);
2890 if (s2var->n_var_parts)
2892 s2node = s2var->var_part[0].loc_chain;
2894 for (; s1node && s2node;
2895 s1node = s1node->next, s2node = s2node->next)
2896 if (s1node->loc != s2node->loc)
2898 else if (s1node->loc == val)
2901 insert_into_intersection (dest, s1node->loc,
2902 MIN (s1node->init, s2node->init));
2906 for (; s1node; s1node = s1node->next)
2908 if (s1node->loc == val)
2911 if ((found = find_loc_in_1pdv (s1node->loc, s2var,
2912 shared_hash_htab (s2set->vars))))
2914 insert_into_intersection (dest, s1node->loc,
2915 MIN (s1node->init, found->init));
2919 if (GET_CODE (s1node->loc) == VALUE
2920 && !VALUE_RECURSED_INTO (s1node->loc))
2922 decl_or_value dv = dv_from_value (s1node->loc);
2923 variable svar = shared_hash_find (s1set->vars, dv);
2926 if (svar->n_var_parts == 1)
2928 VALUE_RECURSED_INTO (s1node->loc) = true;
2929 intersect_loc_chains (val, dest, dsm,
2930 svar->var_part[0].loc_chain,
2932 VALUE_RECURSED_INTO (s1node->loc) = false;
2937 /* ??? gotta look in cselib_val locations too. */
2939 /* ??? if the location is equivalent to any location in src,
2940 searched recursively
2942 add to dst the values needed to represent the equivalence
2944 telling whether locations S is equivalent to another dv's
2947 for each location D in the list
2949 if S and D satisfy rtx_equal_p, then it is present
2951 else if D is a value, recurse without cycles
2953 else if S and D have the same CODE and MODE
2955 for each operand oS and the corresponding oD
2957 if oS and oD are not equivalent, then S an D are not equivalent
2959 else if they are RTX vectors
2961 if any vector oS element is not equivalent to its respective oD,
2962 then S and D are not equivalent
2970 /* Return -1 if X should be before Y in a location list for a 1-part
2971 variable, 1 if Y should be before X, and 0 if they're equivalent
2972 and should not appear in the list. */
2975 loc_cmp (rtx x, rtx y)
2978 RTX_CODE code = GET_CODE (x);
2988 gcc_assert (GET_MODE (x) == GET_MODE (y));
2989 if (REGNO (x) == REGNO (y))
2991 else if (REGNO (x) < REGNO (y))
3004 gcc_assert (GET_MODE (x) == GET_MODE (y));
3005 return loc_cmp (XEXP (x, 0), XEXP (y, 0));
3011 if (GET_CODE (x) == VALUE)
3013 if (GET_CODE (y) != VALUE)
3015 /* Don't assert the modes are the same, that is true only
3016 when not recursing. (subreg:QI (value:SI 1:1) 0)
3017 and (subreg:QI (value:DI 2:2) 0) can be compared,
3018 even when the modes are different. */
3019 if (canon_value_cmp (x, y))
3025 if (GET_CODE (y) == VALUE)
3028 /* Entry value is the least preferable kind of expression. */
3029 if (GET_CODE (x) == ENTRY_VALUE)
3031 if (GET_CODE (y) != ENTRY_VALUE)
3033 gcc_assert (GET_MODE (x) == GET_MODE (y));
3034 return loc_cmp (ENTRY_VALUE_EXP (x), ENTRY_VALUE_EXP (y));
3037 if (GET_CODE (y) == ENTRY_VALUE)
3040 if (GET_CODE (x) == GET_CODE (y))
3041 /* Compare operands below. */;
3042 else if (GET_CODE (x) < GET_CODE (y))
3047 gcc_assert (GET_MODE (x) == GET_MODE (y));
3049 if (GET_CODE (x) == DEBUG_EXPR)
3051 if (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x))
3052 < DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y)))
3054 gcc_checking_assert (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x))
3055 > DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y)));
3059 fmt = GET_RTX_FORMAT (code);
3060 for (i = 0; i < GET_RTX_LENGTH (code); i++)
3064 if (XWINT (x, i) == XWINT (y, i))
3066 else if (XWINT (x, i) < XWINT (y, i))
3073 if (XINT (x, i) == XINT (y, i))
3075 else if (XINT (x, i) < XINT (y, i))
3082 /* Compare the vector length first. */
3083 if (XVECLEN (x, i) == XVECLEN (y, i))
3084 /* Compare the vectors elements. */;
3085 else if (XVECLEN (x, i) < XVECLEN (y, i))
3090 for (j = 0; j < XVECLEN (x, i); j++)
3091 if ((r = loc_cmp (XVECEXP (x, i, j),
3092 XVECEXP (y, i, j))))
3097 if ((r = loc_cmp (XEXP (x, i), XEXP (y, i))))
3103 if (XSTR (x, i) == XSTR (y, i))
3109 if ((r = strcmp (XSTR (x, i), XSTR (y, i))) == 0)
3117 /* These are just backpointers, so they don't matter. */
3124 /* It is believed that rtx's at this level will never
3125 contain anything but integers and other rtx's,
3126 except for within LABEL_REFs and SYMBOL_REFs. */
3135 /* Check the order of entries in one-part variables. */
3138 canonicalize_loc_order_check (void **slot, void *data ATTRIBUTE_UNUSED)
3140 variable var = (variable) *slot;
3141 location_chain node, next;
3143 #ifdef ENABLE_RTL_CHECKING
3145 for (i = 0; i < var->n_var_parts; i++)
3146 gcc_assert (var->var_part[0].cur_loc == NULL);
3147 gcc_assert (!var->in_changed_variables);
3153 gcc_assert (var->n_var_parts == 1);
3154 node = var->var_part[0].loc_chain;
3157 while ((next = node->next))
3159 gcc_assert (loc_cmp (node->loc, next->loc) < 0);
3167 /* Mark with VALUE_RECURSED_INTO values that have neighbors that are
3168 more likely to be chosen as canonical for an equivalence set.
3169 Ensure less likely values can reach more likely neighbors, making
3170 the connections bidirectional. */
3173 canonicalize_values_mark (void **slot, void *data)
3175 dataflow_set *set = (dataflow_set *)data;
3176 variable var = (variable) *slot;
3177 decl_or_value dv = var->dv;
3179 location_chain node;
3181 if (!dv_is_value_p (dv))
3184 gcc_checking_assert (var->n_var_parts == 1);
3186 val = dv_as_value (dv);
3188 for (node = var->var_part[0].loc_chain; node; node = node->next)
3189 if (GET_CODE (node->loc) == VALUE)
3191 if (canon_value_cmp (node->loc, val))
3192 VALUE_RECURSED_INTO (val) = true;
3195 decl_or_value odv = dv_from_value (node->loc);
3196 void **oslot = shared_hash_find_slot_noinsert (set->vars, odv);
3198 set_slot_part (set, val, oslot, odv, 0,
3199 node->init, NULL_RTX);
3201 VALUE_RECURSED_INTO (node->loc) = true;
3208 /* Remove redundant entries from equivalence lists in onepart
3209 variables, canonicalizing equivalence sets into star shapes. */
3212 canonicalize_values_star (void **slot, void *data)
3214 dataflow_set *set = (dataflow_set *)data;
3215 variable var = (variable) *slot;
3216 decl_or_value dv = var->dv;
3217 location_chain node;
3227 gcc_checking_assert (var->n_var_parts == 1);
3229 if (dv_is_value_p (dv))
3231 cval = dv_as_value (dv);
3232 if (!VALUE_RECURSED_INTO (cval))
3234 VALUE_RECURSED_INTO (cval) = false;
3244 gcc_assert (var->n_var_parts == 1);
3246 for (node = var->var_part[0].loc_chain; node; node = node->next)
3247 if (GET_CODE (node->loc) == VALUE)
3250 if (VALUE_RECURSED_INTO (node->loc))
3252 if (canon_value_cmp (node->loc, cval))
3261 if (!has_marks || dv_is_decl_p (dv))
3264 /* Keep it marked so that we revisit it, either after visiting a
3265 child node, or after visiting a new parent that might be
3267 VALUE_RECURSED_INTO (val) = true;
3269 for (node = var->var_part[0].loc_chain; node; node = node->next)
3270 if (GET_CODE (node->loc) == VALUE
3271 && VALUE_RECURSED_INTO (node->loc))
3275 VALUE_RECURSED_INTO (cval) = false;
3276 dv = dv_from_value (cval);
3277 slot = shared_hash_find_slot_noinsert (set->vars, dv);
3280 gcc_assert (dv_is_decl_p (var->dv));
3281 /* The canonical value was reset and dropped.
3283 clobber_variable_part (set, NULL, var->dv, 0, NULL);
3286 var = (variable)*slot;
3287 gcc_assert (dv_is_value_p (var->dv));
3288 if (var->n_var_parts == 0)
3290 gcc_assert (var->n_var_parts == 1);
3294 VALUE_RECURSED_INTO (val) = false;
3299 /* Push values to the canonical one. */
3300 cdv = dv_from_value (cval);
3301 cslot = shared_hash_find_slot_noinsert (set->vars, cdv);
3303 for (node = var->var_part[0].loc_chain; node; node = node->next)
3304 if (node->loc != cval)
3306 cslot = set_slot_part (set, node->loc, cslot, cdv, 0,
3307 node->init, NULL_RTX);
3308 if (GET_CODE (node->loc) == VALUE)
3310 decl_or_value ndv = dv_from_value (node->loc);
3312 set_variable_part (set, cval, ndv, 0, node->init, NULL_RTX,
3315 if (canon_value_cmp (node->loc, val))
3317 /* If it could have been a local minimum, it's not any more,
3318 since it's now neighbor to cval, so it may have to push
3319 to it. Conversely, if it wouldn't have prevailed over
3320 val, then whatever mark it has is fine: if it was to
3321 push, it will now push to a more canonical node, but if
3322 it wasn't, then it has already pushed any values it might
3324 VALUE_RECURSED_INTO (node->loc) = true;
3325 /* Make sure we visit node->loc by ensuring we cval is
3327 VALUE_RECURSED_INTO (cval) = true;
3329 else if (!VALUE_RECURSED_INTO (node->loc))
3330 /* If we have no need to "recurse" into this node, it's
3331 already "canonicalized", so drop the link to the old
3333 clobber_variable_part (set, cval, ndv, 0, NULL);
3335 else if (GET_CODE (node->loc) == REG)
3337 attrs list = set->regs[REGNO (node->loc)], *listp;
3339 /* Change an existing attribute referring to dv so that it
3340 refers to cdv, removing any duplicate this might
3341 introduce, and checking that no previous duplicates
3342 existed, all in a single pass. */
3346 if (list->offset == 0
3347 && (dv_as_opaque (list->dv) == dv_as_opaque (dv)
3348 || dv_as_opaque (list->dv) == dv_as_opaque (cdv)))
3355 if (dv_as_opaque (list->dv) == dv_as_opaque (dv))
3358 for (listp = &list->next; (list = *listp); listp = &list->next)
3363 if (dv_as_opaque (list->dv) == dv_as_opaque (cdv))
3365 *listp = list->next;
3366 pool_free (attrs_pool, list);
3371 gcc_assert (dv_as_opaque (list->dv) != dv_as_opaque (dv));
3374 else if (dv_as_opaque (list->dv) == dv_as_opaque (cdv))
3376 for (listp = &list->next; (list = *listp); listp = &list->next)
3381 if (dv_as_opaque (list->dv) == dv_as_opaque (dv))
3383 *listp = list->next;
3384 pool_free (attrs_pool, list);
3389 gcc_assert (dv_as_opaque (list->dv) != dv_as_opaque (cdv));
3398 if (list->offset == 0
3399 && (dv_as_opaque (list->dv) == dv_as_opaque (dv)
3400 || dv_as_opaque (list->dv) == dv_as_opaque (cdv)))
3410 set_slot_part (set, val, cslot, cdv, 0,
3411 VAR_INIT_STATUS_INITIALIZED, NULL_RTX);
3413 slot = clobber_slot_part (set, cval, slot, 0, NULL);
3415 /* Variable may have been unshared. */
3416 var = (variable)*slot;
3417 gcc_checking_assert (var->n_var_parts && var->var_part[0].loc_chain->loc == cval
3418 && var->var_part[0].loc_chain->next == NULL);
3420 if (VALUE_RECURSED_INTO (cval))
3421 goto restart_with_cval;
3426 /* Bind one-part variables to the canonical value in an equivalence
3427 set. Not doing this causes dataflow convergence failure in rare
3428 circumstances, see PR42873. Unfortunately we can't do this
3429 efficiently as part of canonicalize_values_star, since we may not
3430 have determined or even seen the canonical value of a set when we
3431 get to a variable that references another member of the set. */
3434 canonicalize_vars_star (void **slot, void *data)
3436 dataflow_set *set = (dataflow_set *)data;
3437 variable var = (variable) *slot;
3438 decl_or_value dv = var->dv;
3439 location_chain node;
3444 location_chain cnode;
3446 if (!var->onepart || var->onepart == ONEPART_VALUE)
3449 gcc_assert (var->n_var_parts == 1);
3451 node = var->var_part[0].loc_chain;
3453 if (GET_CODE (node->loc) != VALUE)
3456 gcc_assert (!node->next);
3459 /* Push values to the canonical one. */
3460 cdv = dv_from_value (cval);
3461 cslot = shared_hash_find_slot_noinsert (set->vars, cdv);
3464 cvar = (variable)*cslot;
3465 gcc_assert (cvar->n_var_parts == 1);
3467 cnode = cvar->var_part[0].loc_chain;
3469 /* CVAL is canonical if its value list contains non-VALUEs or VALUEs
3470 that are not “more canonical” than it. */
3471 if (GET_CODE (cnode->loc) != VALUE
3472 || !canon_value_cmp (cnode->loc, cval))
3475 /* CVAL was found to be non-canonical. Change the variable to point
3476 to the canonical VALUE. */
3477 gcc_assert (!cnode->next);
3480 slot = set_slot_part (set, cval, slot, dv, 0,
3481 node->init, node->set_src);
3482 clobber_slot_part (set, cval, slot, 0, node->set_src);
3487 /* Combine variable or value in *S1SLOT (in DSM->cur) with the
3488 corresponding entry in DSM->src. Multi-part variables are combined
3489 with variable_union, whereas onepart dvs are combined with
3493 variable_merge_over_cur (variable s1var, struct dfset_merge *dsm)
3495 dataflow_set *dst = dsm->dst;
3497 variable s2var, dvar = NULL;
3498 decl_or_value dv = s1var->dv;
3499 onepart_enum_t onepart = s1var->onepart;
3502 location_chain node, *nodep;
3504 /* If the incoming onepart variable has an empty location list, then
3505 the intersection will be just as empty. For other variables,
3506 it's always union. */
3507 gcc_checking_assert (s1var->n_var_parts
3508 && s1var->var_part[0].loc_chain);
3511 return variable_union (s1var, dst);
3513 gcc_checking_assert (s1var->n_var_parts == 1);
3515 dvhash = dv_htab_hash (dv);
3516 if (dv_is_value_p (dv))
3517 val = dv_as_value (dv);
3521 s2var = shared_hash_find_1 (dsm->src->vars, dv, dvhash);
3524 dst_can_be_shared = false;
3528 dsm->src_onepart_cnt--;
3529 gcc_assert (s2var->var_part[0].loc_chain
3530 && s2var->onepart == onepart
3531 && s2var->n_var_parts == 1);
3533 dstslot = shared_hash_find_slot_noinsert_1 (dst->vars, dv, dvhash);
3536 dvar = (variable)*dstslot;
3537 gcc_assert (dvar->refcount == 1
3538 && dvar->onepart == onepart
3539 && dvar->n_var_parts == 1);
3540 nodep = &dvar->var_part[0].loc_chain;
3548 if (!dstslot && !onepart_variable_different_p (s1var, s2var))
3550 dstslot = shared_hash_find_slot_unshare_1 (&dst->vars, dv,
3552 *dstslot = dvar = s2var;
3557 dst_can_be_shared = false;
3559 intersect_loc_chains (val, nodep, dsm,
3560 s1var->var_part[0].loc_chain, s2var);
3566 dvar = (variable) pool_alloc (onepart_pool (onepart));
3569 dvar->n_var_parts = 1;
3570 dvar->onepart = onepart;
3571 dvar->in_changed_variables = false;
3572 dvar->var_part[0].loc_chain = node;
3573 dvar->var_part[0].cur_loc = NULL;
3575 VAR_LOC_1PAUX (dvar) = NULL;
3577 VAR_PART_OFFSET (dvar, 0) = 0;
3580 = shared_hash_find_slot_unshare_1 (&dst->vars, dv, dvhash,
3582 gcc_assert (!*dstslot);
3590 nodep = &dvar->var_part[0].loc_chain;
3591 while ((node = *nodep))
3593 location_chain *nextp = &node->next;
3595 if (GET_CODE (node->loc) == REG)
3599 for (list = dst->regs[REGNO (node->loc)]; list; list = list->next)
3600 if (GET_MODE (node->loc) == GET_MODE (list->loc)
3601 && dv_is_value_p (list->dv))
3605 attrs_list_insert (&dst->regs[REGNO (node->loc)],
3607 /* If this value became canonical for another value that had
3608 this register, we want to leave it alone. */
3609 else if (dv_as_value (list->dv) != val)
3611 dstslot = set_slot_part (dst, dv_as_value (list->dv),
3613 node->init, NULL_RTX);
3614 dstslot = delete_slot_part (dst, node->loc, dstslot, 0);
3616 /* Since nextp points into the removed node, we can't
3617 use it. The pointer to the next node moved to nodep.
3618 However, if the variable we're walking is unshared
3619 during our walk, we'll keep walking the location list
3620 of the previously-shared variable, in which case the
3621 node won't have been removed, and we'll want to skip
3622 it. That's why we test *nodep here. */
3628 /* Canonicalization puts registers first, so we don't have to
3634 if (dvar != (variable)*dstslot)
3635 dvar = (variable)*dstslot;
3636 nodep = &dvar->var_part[0].loc_chain;
3640 /* Mark all referenced nodes for canonicalization, and make sure
3641 we have mutual equivalence links. */
3642 VALUE_RECURSED_INTO (val) = true;
3643 for (node = *nodep; node; node = node->next)
3644 if (GET_CODE (node->loc) == VALUE)
3646 VALUE_RECURSED_INTO (node->loc) = true;
3647 set_variable_part (dst, val, dv_from_value (node->loc), 0,
3648 node->init, NULL, INSERT);
3651 dstslot = shared_hash_find_slot_noinsert_1 (dst->vars, dv, dvhash);
3652 gcc_assert (*dstslot == dvar);
3653 canonicalize_values_star (dstslot, dst);
3654 gcc_checking_assert (dstslot
3655 == shared_hash_find_slot_noinsert_1 (dst->vars,
3657 dvar = (variable)*dstslot;
3661 bool has_value = false, has_other = false;
3663 /* If we have one value and anything else, we're going to
3664 canonicalize this, so make sure all values have an entry in
3665 the table and are marked for canonicalization. */
3666 for (node = *nodep; node; node = node->next)
3668 if (GET_CODE (node->loc) == VALUE)
3670 /* If this was marked during register canonicalization,
3671 we know we have to canonicalize values. */
3686 if (has_value && has_other)
3688 for (node = *nodep; node; node = node->next)
3690 if (GET_CODE (node->loc) == VALUE)
3692 decl_or_value dv = dv_from_value (node->loc);
3695 if (shared_hash_shared (dst->vars))
3696 slot = shared_hash_find_slot_noinsert (dst->vars, dv);
3698 slot = shared_hash_find_slot_unshare (&dst->vars, dv,
3702 variable var = (variable) pool_alloc (onepart_pool
3706 var->n_var_parts = 1;
3707 var->onepart = ONEPART_VALUE;
3708 var->in_changed_variables = false;
3709 var->var_part[0].loc_chain = NULL;
3710 var->var_part[0].cur_loc = NULL;
3711 VAR_LOC_1PAUX (var) = NULL;
3715 VALUE_RECURSED_INTO (node->loc) = true;
3719 dstslot = shared_hash_find_slot_noinsert_1 (dst->vars, dv, dvhash);
3720 gcc_assert (*dstslot == dvar);
3721 canonicalize_values_star (dstslot, dst);
3722 gcc_checking_assert (dstslot
3723 == shared_hash_find_slot_noinsert_1 (dst->vars,
3725 dvar = (variable)*dstslot;
3729 if (!onepart_variable_different_p (dvar, s2var))
3731 variable_htab_free (dvar);
3732 *dstslot = dvar = s2var;
3735 else if (s2var != s1var && !onepart_variable_different_p (dvar, s1var))
3737 variable_htab_free (dvar);
3738 *dstslot = dvar = s1var;
3740 dst_can_be_shared = false;
3743 dst_can_be_shared = false;
3748 /* Copy s2slot (in DSM->src) to DSM->dst if the variable is a
3749 multi-part variable. Unions of multi-part variables and
3750 intersections of one-part ones will be handled in
3751 variable_merge_over_cur(). */
3754 variable_merge_over_src (variable s2var, struct dfset_merge *dsm)
3756 dataflow_set *dst = dsm->dst;
3757 decl_or_value dv = s2var->dv;
3759 if (!s2var->onepart)
3761 void **dstp = shared_hash_find_slot (dst->vars, dv);
3767 dsm->src_onepart_cnt++;
3771 /* Combine dataflow set information from SRC2 into DST, using PDST
3772 to carry over information across passes. */
3775 dataflow_set_merge (dataflow_set *dst, dataflow_set *src2)
3777 dataflow_set cur = *dst;
3778 dataflow_set *src1 = &cur;
3779 struct dfset_merge dsm;
3781 size_t src1_elems, src2_elems;
3785 src1_elems = htab_elements (shared_hash_htab (src1->vars));
3786 src2_elems = htab_elements (shared_hash_htab (src2->vars));
3787 dataflow_set_init (dst);
3788 dst->stack_adjust = cur.stack_adjust;
3789 shared_hash_destroy (dst->vars);
3790 dst->vars = (shared_hash) pool_alloc (shared_hash_pool);
3791 dst->vars->refcount = 1;
3793 = htab_create (MAX (src1_elems, src2_elems), variable_htab_hash,
3794 variable_htab_eq, variable_htab_free);
3796 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3797 attrs_list_mpdv_union (&dst->regs[i], src1->regs[i], src2->regs[i]);
3802 dsm.src_onepart_cnt = 0;
3804 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm.src->vars), var, variable, hi)
3805 variable_merge_over_src (var, &dsm);
3806 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm.cur->vars), var, variable, hi)
3807 variable_merge_over_cur (var, &dsm);
3809 if (dsm.src_onepart_cnt)
3810 dst_can_be_shared = false;
3812 dataflow_set_destroy (src1);
3815 /* Mark register equivalences. */
3818 dataflow_set_equiv_regs (dataflow_set *set)
3823 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3825 rtx canon[NUM_MACHINE_MODES];
3827 /* If the list is empty or one entry, no need to canonicalize
3829 if (set->regs[i] == NULL || set->regs[i]->next == NULL)
3832 memset (canon, 0, sizeof (canon));
3834 for (list = set->regs[i]; list; list = list->next)
3835 if (list->offset == 0 && dv_is_value_p (list->dv))
3837 rtx val = dv_as_value (list->dv);
3838 rtx *cvalp = &canon[(int)GET_MODE (val)];
3841 if (canon_value_cmp (val, cval))
3845 for (list = set->regs[i]; list; list = list->next)
3846 if (list->offset == 0 && dv_onepart_p (list->dv))
3848 rtx cval = canon[(int)GET_MODE (list->loc)];
3853 if (dv_is_value_p (list->dv))
3855 rtx val = dv_as_value (list->dv);
3860 VALUE_RECURSED_INTO (val) = true;
3861 set_variable_part (set, val, dv_from_value (cval), 0,
3862 VAR_INIT_STATUS_INITIALIZED,
3866 VALUE_RECURSED_INTO (cval) = true;
3867 set_variable_part (set, cval, list->dv, 0,
3868 VAR_INIT_STATUS_INITIALIZED, NULL, NO_INSERT);
3871 for (listp = &set->regs[i]; (list = *listp);
3872 listp = list ? &list->next : listp)
3873 if (list->offset == 0 && dv_onepart_p (list->dv))
3875 rtx cval = canon[(int)GET_MODE (list->loc)];
3881 if (dv_is_value_p (list->dv))
3883 rtx val = dv_as_value (list->dv);
3884 if (!VALUE_RECURSED_INTO (val))
3888 slot = shared_hash_find_slot_noinsert (set->vars, list->dv);
3889 canonicalize_values_star (slot, set);
3896 /* Remove any redundant values in the location list of VAR, which must
3897 be unshared and 1-part. */
3900 remove_duplicate_values (variable var)
3902 location_chain node, *nodep;
3904 gcc_assert (var->onepart);
3905 gcc_assert (var->n_var_parts == 1);
3906 gcc_assert (var->refcount == 1);
3908 for (nodep = &var->var_part[0].loc_chain; (node = *nodep); )
3910 if (GET_CODE (node->loc) == VALUE)
3912 if (VALUE_RECURSED_INTO (node->loc))
3914 /* Remove duplicate value node. */
3915 *nodep = node->next;
3916 pool_free (loc_chain_pool, node);
3920 VALUE_RECURSED_INTO (node->loc) = true;
3922 nodep = &node->next;
3925 for (node = var->var_part[0].loc_chain; node; node = node->next)
3926 if (GET_CODE (node->loc) == VALUE)
3928 gcc_assert (VALUE_RECURSED_INTO (node->loc));
3929 VALUE_RECURSED_INTO (node->loc) = false;
3934 /* Hash table iteration argument passed to variable_post_merge. */
3935 struct dfset_post_merge
3937 /* The new input set for the current block. */
3939 /* Pointer to the permanent input set for the current block, or
3941 dataflow_set **permp;
3944 /* Create values for incoming expressions associated with one-part
3945 variables that don't have value numbers for them. */
3948 variable_post_merge_new_vals (void **slot, void *info)
3950 struct dfset_post_merge *dfpm = (struct dfset_post_merge *)info;
3951 dataflow_set *set = dfpm->set;
3952 variable var = (variable)*slot;
3953 location_chain node;
3955 if (!var->onepart || !var->n_var_parts)
3958 gcc_assert (var->n_var_parts == 1);
3960 if (dv_is_decl_p (var->dv))
3962 bool check_dupes = false;
3965 for (node = var->var_part[0].loc_chain; node; node = node->next)
3967 if (GET_CODE (node->loc) == VALUE)
3968 gcc_assert (!VALUE_RECURSED_INTO (node->loc));
3969 else if (GET_CODE (node->loc) == REG)
3971 attrs att, *attp, *curp = NULL;
3973 if (var->refcount != 1)
3975 slot = unshare_variable (set, slot, var,
3976 VAR_INIT_STATUS_INITIALIZED);
3977 var = (variable)*slot;
3981 for (attp = &set->regs[REGNO (node->loc)]; (att = *attp);
3983 if (att->offset == 0
3984 && GET_MODE (att->loc) == GET_MODE (node->loc))
3986 if (dv_is_value_p (att->dv))
3988 rtx cval = dv_as_value (att->dv);
3993 else if (dv_as_opaque (att->dv) == dv_as_opaque (var->dv))
4001 if ((*curp)->offset == 0
4002 && GET_MODE ((*curp)->loc) == GET_MODE (node->loc)
4003 && dv_as_opaque ((*curp)->dv) == dv_as_opaque (var->dv))
4006 curp = &(*curp)->next;
4017 *dfpm->permp = XNEW (dataflow_set);
4018 dataflow_set_init (*dfpm->permp);
4021 for (att = (*dfpm->permp)->regs[REGNO (node->loc)];
4022 att; att = att->next)
4023 if (GET_MODE (att->loc) == GET_MODE (node->loc))
4025 gcc_assert (att->offset == 0
4026 && dv_is_value_p (att->dv));
4027 val_reset (set, att->dv);
4034 cval = dv_as_value (cdv);
4038 /* Create a unique value to hold this register,
4039 that ought to be found and reused in
4040 subsequent rounds. */
4042 gcc_assert (!cselib_lookup (node->loc,
4043 GET_MODE (node->loc), 0,
4045 v = cselib_lookup (node->loc, GET_MODE (node->loc), 1,
4047 cselib_preserve_value (v);
4048 cselib_invalidate_rtx (node->loc);
4050 cdv = dv_from_value (cval);
4053 "Created new value %u:%u for reg %i\n",
4054 v->uid, v->hash, REGNO (node->loc));
4057 var_reg_decl_set (*dfpm->permp, node->loc,
4058 VAR_INIT_STATUS_INITIALIZED,
4059 cdv, 0, NULL, INSERT);
4065 /* Remove attribute referring to the decl, which now
4066 uses the value for the register, already existing or
4067 to be added when we bring perm in. */
4070 pool_free (attrs_pool, att);
4075 remove_duplicate_values (var);
4081 /* Reset values in the permanent set that are not associated with the
4082 chosen expression. */
4085 variable_post_merge_perm_vals (void **pslot, void *info)
4087 struct dfset_post_merge *dfpm = (struct dfset_post_merge *)info;
4088 dataflow_set *set = dfpm->set;
4089 variable pvar = (variable)*pslot, var;
4090 location_chain pnode;
4094 gcc_assert (dv_is_value_p (pvar->dv)
4095 && pvar->n_var_parts == 1);
4096 pnode = pvar->var_part[0].loc_chain;
4099 && REG_P (pnode->loc));
4103 var = shared_hash_find (set->vars, dv);
4106 /* Although variable_post_merge_new_vals may have made decls
4107 non-star-canonical, values that pre-existed in canonical form
4108 remain canonical, and newly-created values reference a single
4109 REG, so they are canonical as well. Since VAR has the
4110 location list for a VALUE, using find_loc_in_1pdv for it is
4111 fine, since VALUEs don't map back to DECLs. */
4112 if (find_loc_in_1pdv (pnode->loc, var, shared_hash_htab (set->vars)))
4114 val_reset (set, dv);
4117 for (att = set->regs[REGNO (pnode->loc)]; att; att = att->next)
4118 if (att->offset == 0
4119 && GET_MODE (att->loc) == GET_MODE (pnode->loc)
4120 && dv_is_value_p (att->dv))
4123 /* If there is a value associated with this register already, create
4125 if (att && dv_as_value (att->dv) != dv_as_value (dv))
4127 rtx cval = dv_as_value (att->dv);
4128 set_variable_part (set, cval, dv, 0, pnode->init, NULL, INSERT);
4129 set_variable_part (set, dv_as_value (dv), att->dv, 0, pnode->init,
4134 attrs_list_insert (&set->regs[REGNO (pnode->loc)],
4136 variable_union (pvar, set);
4142 /* Just checking stuff and registering register attributes for
4146 dataflow_post_merge_adjust (dataflow_set *set, dataflow_set **permp)
4148 struct dfset_post_merge dfpm;
4153 htab_traverse (shared_hash_htab (set->vars), variable_post_merge_new_vals,
4156 htab_traverse (shared_hash_htab ((*permp)->vars),
4157 variable_post_merge_perm_vals, &dfpm);
4158 htab_traverse (shared_hash_htab (set->vars), canonicalize_values_star, set);
4159 htab_traverse (shared_hash_htab (set->vars), canonicalize_vars_star, set);
4162 /* Return a node whose loc is a MEM that refers to EXPR in the
4163 location list of a one-part variable or value VAR, or in that of
4164 any values recursively mentioned in the location lists. */
4166 static location_chain
4167 find_mem_expr_in_1pdv (tree expr, rtx val, htab_t vars)
4169 location_chain node;
4172 location_chain where = NULL;
4177 gcc_assert (GET_CODE (val) == VALUE
4178 && !VALUE_RECURSED_INTO (val));
4180 dv = dv_from_value (val);
4181 var = (variable) htab_find_with_hash (vars, dv, dv_htab_hash (dv));
4186 gcc_assert (var->onepart);
4188 if (!var->n_var_parts)
4191 VALUE_RECURSED_INTO (val) = true;
4193 for (node = var->var_part[0].loc_chain; node; node = node->next)
4194 if (MEM_P (node->loc)
4195 && MEM_EXPR (node->loc) == expr
4196 && INT_MEM_OFFSET (node->loc) == 0)
4201 else if (GET_CODE (node->loc) == VALUE
4202 && !VALUE_RECURSED_INTO (node->loc)
4203 && (where = find_mem_expr_in_1pdv (expr, node->loc, vars)))
4206 VALUE_RECURSED_INTO (val) = false;
4211 /* Return TRUE if the value of MEM may vary across a call. */
4214 mem_dies_at_call (rtx mem)
4216 tree expr = MEM_EXPR (mem);
4222 decl = get_base_address (expr);
4230 return (may_be_aliased (decl)
4231 || (!TREE_READONLY (decl) && is_global_var (decl)));
4234 /* Remove all MEMs from the location list of a hash table entry for a
4235 one-part variable, except those whose MEM attributes map back to
4236 the variable itself, directly or within a VALUE. */
4239 dataflow_set_preserve_mem_locs (void **slot, void *data)
4241 dataflow_set *set = (dataflow_set *) data;
4242 variable var = (variable) *slot;
4244 if (var->onepart == ONEPART_VDECL || var->onepart == ONEPART_DEXPR)
4246 tree decl = dv_as_decl (var->dv);
4247 location_chain loc, *locp;
4248 bool changed = false;
4250 if (!var->n_var_parts)
4253 gcc_assert (var->n_var_parts == 1);
4255 if (shared_var_p (var, set->vars))
4257 for (loc = var->var_part[0].loc_chain; loc; loc = loc->next)
4259 /* We want to remove dying MEMs that doesn't refer to DECL. */
4260 if (GET_CODE (loc->loc) == MEM
4261 && (MEM_EXPR (loc->loc) != decl
4262 || INT_MEM_OFFSET (loc->loc) != 0)
4263 && !mem_dies_at_call (loc->loc))
4265 /* We want to move here MEMs that do refer to DECL. */
4266 else if (GET_CODE (loc->loc) == VALUE
4267 && find_mem_expr_in_1pdv (decl, loc->loc,
4268 shared_hash_htab (set->vars)))
4275 slot = unshare_variable (set, slot, var, VAR_INIT_STATUS_UNKNOWN);
4276 var = (variable)*slot;
4277 gcc_assert (var->n_var_parts == 1);
4280 for (locp = &var->var_part[0].loc_chain, loc = *locp;
4283 rtx old_loc = loc->loc;
4284 if (GET_CODE (old_loc) == VALUE)
4286 location_chain mem_node
4287 = find_mem_expr_in_1pdv (decl, loc->loc,
4288 shared_hash_htab (set->vars));
4290 /* ??? This picks up only one out of multiple MEMs that
4291 refer to the same variable. Do we ever need to be
4292 concerned about dealing with more than one, or, given
4293 that they should all map to the same variable
4294 location, their addresses will have been merged and
4295 they will be regarded as equivalent? */
4298 loc->loc = mem_node->loc;
4299 loc->set_src = mem_node->set_src;
4300 loc->init = MIN (loc->init, mem_node->init);
4304 if (GET_CODE (loc->loc) != MEM
4305 || (MEM_EXPR (loc->loc) == decl
4306 && INT_MEM_OFFSET (loc->loc) == 0)
4307 || !mem_dies_at_call (loc->loc))
4309 if (old_loc != loc->loc && emit_notes)
4311 if (old_loc == var->var_part[0].cur_loc)
4314 var->var_part[0].cur_loc = NULL;
4323 if (old_loc == var->var_part[0].cur_loc)
4326 var->var_part[0].cur_loc = NULL;
4330 pool_free (loc_chain_pool, loc);
4333 if (!var->var_part[0].loc_chain)
4339 variable_was_changed (var, set);
4345 /* Remove all MEMs from the location list of a hash table entry for a
4349 dataflow_set_remove_mem_locs (void **slot, void *data)
4351 dataflow_set *set = (dataflow_set *) data;
4352 variable var = (variable) *slot;
4354 if (var->onepart == ONEPART_VALUE)
4356 location_chain loc, *locp;
4357 bool changed = false;
4360 gcc_assert (var->n_var_parts == 1);
4362 if (shared_var_p (var, set->vars))
4364 for (loc = var->var_part[0].loc_chain; loc; loc = loc->next)
4365 if (GET_CODE (loc->loc) == MEM
4366 && mem_dies_at_call (loc->loc))
4372 slot = unshare_variable (set, slot, var, VAR_INIT_STATUS_UNKNOWN);
4373 var = (variable)*slot;
4374 gcc_assert (var->n_var_parts == 1);
4377 if (VAR_LOC_1PAUX (var))
4378 cur_loc = VAR_LOC_FROM (var);
4380 cur_loc = var->var_part[0].cur_loc;
4382 for (locp = &var->var_part[0].loc_chain, loc = *locp;
4385 if (GET_CODE (loc->loc) != MEM
4386 || !mem_dies_at_call (loc->loc))
4393 /* If we have deleted the location which was last emitted
4394 we have to emit new location so add the variable to set
4395 of changed variables. */
4396 if (cur_loc == loc->loc)
4399 var->var_part[0].cur_loc = NULL;
4400 if (VAR_LOC_1PAUX (var))
4401 VAR_LOC_FROM (var) = NULL;
4403 pool_free (loc_chain_pool, loc);
4406 if (!var->var_part[0].loc_chain)
4412 variable_was_changed (var, set);
4418 /* Remove all variable-location information about call-clobbered
4419 registers, as well as associations between MEMs and VALUEs. */
4422 dataflow_set_clear_at_call (dataflow_set *set)
4426 for (r = 0; r < FIRST_PSEUDO_REGISTER; r++)
4427 if (TEST_HARD_REG_BIT (regs_invalidated_by_call, r))
4428 var_regno_delete (set, r);
4430 if (MAY_HAVE_DEBUG_INSNS)
4432 set->traversed_vars = set->vars;
4433 htab_traverse (shared_hash_htab (set->vars),
4434 dataflow_set_preserve_mem_locs, set);
4435 set->traversed_vars = set->vars;
4436 htab_traverse (shared_hash_htab (set->vars), dataflow_set_remove_mem_locs,
4438 set->traversed_vars = NULL;
4443 variable_part_different_p (variable_part *vp1, variable_part *vp2)
4445 location_chain lc1, lc2;
4447 for (lc1 = vp1->loc_chain; lc1; lc1 = lc1->next)
4449 for (lc2 = vp2->loc_chain; lc2; lc2 = lc2->next)
4451 if (REG_P (lc1->loc) && REG_P (lc2->loc))
4453 if (REGNO (lc1->loc) == REGNO (lc2->loc))
4456 if (rtx_equal_p (lc1->loc, lc2->loc))
4465 /* Return true if one-part variables VAR1 and VAR2 are different.
4466 They must be in canonical order. */
4469 onepart_variable_different_p (variable var1, variable var2)
4471 location_chain lc1, lc2;
4476 gcc_assert (var1->n_var_parts == 1
4477 && var2->n_var_parts == 1);
4479 lc1 = var1->var_part[0].loc_chain;
4480 lc2 = var2->var_part[0].loc_chain;
4482 gcc_assert (lc1 && lc2);
4486 if (loc_cmp (lc1->loc, lc2->loc))
4495 /* Return true if variables VAR1 and VAR2 are different. */
4498 variable_different_p (variable var1, variable var2)
4505 if (var1->onepart != var2->onepart)
4508 if (var1->n_var_parts != var2->n_var_parts)
4511 if (var1->onepart && var1->n_var_parts)
4513 gcc_checking_assert (dv_as_opaque (var1->dv) == dv_as_opaque (var2->dv)
4514 && var1->n_var_parts == 1);
4515 /* One-part values have locations in a canonical order. */
4516 return onepart_variable_different_p (var1, var2);
4519 for (i = 0; i < var1->n_var_parts; i++)
4521 if (VAR_PART_OFFSET (var1, i) != VAR_PART_OFFSET (var2, i))
4523 if (variable_part_different_p (&var1->var_part[i], &var2->var_part[i]))
4525 if (variable_part_different_p (&var2->var_part[i], &var1->var_part[i]))
4531 /* Return true if dataflow sets OLD_SET and NEW_SET differ. */
4534 dataflow_set_different (dataflow_set *old_set, dataflow_set *new_set)
4539 if (old_set->vars == new_set->vars)
4542 if (htab_elements (shared_hash_htab (old_set->vars))
4543 != htab_elements (shared_hash_htab (new_set->vars)))
4546 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (old_set->vars), var1, variable, hi)
4548 htab_t htab = shared_hash_htab (new_set->vars);
4549 variable var2 = (variable) htab_find_with_hash (htab, var1->dv,
4550 dv_htab_hash (var1->dv));
4553 if (dump_file && (dump_flags & TDF_DETAILS))
4555 fprintf (dump_file, "dataflow difference found: removal of:\n");
4561 if (variable_different_p (var1, var2))
4563 if (dump_file && (dump_flags & TDF_DETAILS))
4565 fprintf (dump_file, "dataflow difference found: "
4566 "old and new follow:\n");
4574 /* No need to traverse the second hashtab, if both have the same number
4575 of elements and the second one had all entries found in the first one,
4576 then it can't have any extra entries. */
4580 /* Free the contents of dataflow set SET. */
4583 dataflow_set_destroy (dataflow_set *set)
4587 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4588 attrs_list_clear (&set->regs[i]);
4590 shared_hash_destroy (set->vars);
4594 /* Return true if RTL X contains a SYMBOL_REF. */
4597 contains_symbol_ref (rtx x)
4606 code = GET_CODE (x);
4607 if (code == SYMBOL_REF)
4610 fmt = GET_RTX_FORMAT (code);
4611 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
4615 if (contains_symbol_ref (XEXP (x, i)))
4618 else if (fmt[i] == 'E')
4621 for (j = 0; j < XVECLEN (x, i); j++)
4622 if (contains_symbol_ref (XVECEXP (x, i, j)))
4630 /* Shall EXPR be tracked? */
4633 track_expr_p (tree expr, bool need_rtl)
4638 if (TREE_CODE (expr) == DEBUG_EXPR_DECL)
4639 return DECL_RTL_SET_P (expr);
4641 /* If EXPR is not a parameter or a variable do not track it. */
4642 if (TREE_CODE (expr) != VAR_DECL && TREE_CODE (expr) != PARM_DECL)
4645 /* It also must have a name... */
4646 if (!DECL_NAME (expr) && need_rtl)
4649 /* ... and a RTL assigned to it. */
4650 decl_rtl = DECL_RTL_IF_SET (expr);
4651 if (!decl_rtl && need_rtl)
4654 /* If this expression is really a debug alias of some other declaration, we
4655 don't need to track this expression if the ultimate declaration is
4658 if (DECL_DEBUG_EXPR_IS_FROM (realdecl))
4660 realdecl = DECL_DEBUG_EXPR (realdecl);
4661 if (realdecl == NULL_TREE)
4663 else if (!DECL_P (realdecl))
4665 if (handled_component_p (realdecl))
4667 HOST_WIDE_INT bitsize, bitpos, maxsize;
4669 = get_ref_base_and_extent (realdecl, &bitpos, &bitsize,
4671 if (!DECL_P (innerdecl)
4672 || DECL_IGNORED_P (innerdecl)
4673 || TREE_STATIC (innerdecl)
4675 || bitpos + bitsize > 256
4676 || bitsize != maxsize)
4686 /* Do not track EXPR if REALDECL it should be ignored for debugging
4688 if (DECL_IGNORED_P (realdecl))
4691 /* Do not track global variables until we are able to emit correct location
4693 if (TREE_STATIC (realdecl))
4696 /* When the EXPR is a DECL for alias of some variable (see example)
4697 the TREE_STATIC flag is not used. Disable tracking all DECLs whose
4698 DECL_RTL contains SYMBOL_REF.
4701 extern char **_dl_argv_internal __attribute__ ((alias ("_dl_argv")));
4704 if (decl_rtl && MEM_P (decl_rtl)
4705 && contains_symbol_ref (XEXP (decl_rtl, 0)))
4708 /* If RTX is a memory it should not be very large (because it would be
4709 an array or struct). */
4710 if (decl_rtl && MEM_P (decl_rtl))
4712 /* Do not track structures and arrays. */
4713 if (GET_MODE (decl_rtl) == BLKmode
4714 || AGGREGATE_TYPE_P (TREE_TYPE (realdecl)))
4716 if (MEM_SIZE_KNOWN_P (decl_rtl)
4717 && MEM_SIZE (decl_rtl) > MAX_VAR_PARTS)
4721 DECL_CHANGED (expr) = 0;
4722 DECL_CHANGED (realdecl) = 0;
4726 /* Determine whether a given LOC refers to the same variable part as
4730 same_variable_part_p (rtx loc, tree expr, HOST_WIDE_INT offset)
4733 HOST_WIDE_INT offset2;
4735 if (! DECL_P (expr))
4740 expr2 = REG_EXPR (loc);
4741 offset2 = REG_OFFSET (loc);
4743 else if (MEM_P (loc))
4745 expr2 = MEM_EXPR (loc);
4746 offset2 = INT_MEM_OFFSET (loc);
4751 if (! expr2 || ! DECL_P (expr2))
4754 expr = var_debug_decl (expr);
4755 expr2 = var_debug_decl (expr2);
4757 return (expr == expr2 && offset == offset2);
4760 /* LOC is a REG or MEM that we would like to track if possible.
4761 If EXPR is null, we don't know what expression LOC refers to,
4762 otherwise it refers to EXPR + OFFSET. STORE_REG_P is true if
4763 LOC is an lvalue register.
4765 Return true if EXPR is nonnull and if LOC, or some lowpart of it,
4766 is something we can track. When returning true, store the mode of
4767 the lowpart we can track in *MODE_OUT (if nonnull) and its offset
4768 from EXPR in *OFFSET_OUT (if nonnull). */
4771 track_loc_p (rtx loc, tree expr, HOST_WIDE_INT offset, bool store_reg_p,
4772 enum machine_mode *mode_out, HOST_WIDE_INT *offset_out)
4774 enum machine_mode mode;
4776 if (expr == NULL || !track_expr_p (expr, true))
4779 /* If REG was a paradoxical subreg, its REG_ATTRS will describe the
4780 whole subreg, but only the old inner part is really relevant. */
4781 mode = GET_MODE (loc);
4782 if (REG_P (loc) && !HARD_REGISTER_NUM_P (ORIGINAL_REGNO (loc)))
4784 enum machine_mode pseudo_mode;
4786 pseudo_mode = PSEUDO_REGNO_MODE (ORIGINAL_REGNO (loc));
4787 if (GET_MODE_SIZE (mode) > GET_MODE_SIZE (pseudo_mode))
4789 offset += byte_lowpart_offset (pseudo_mode, mode);
4794 /* If LOC is a paradoxical lowpart of EXPR, refer to EXPR itself.
4795 Do the same if we are storing to a register and EXPR occupies
4796 the whole of register LOC; in that case, the whole of EXPR is
4797 being changed. We exclude complex modes from the second case
4798 because the real and imaginary parts are represented as separate
4799 pseudo registers, even if the whole complex value fits into one
4801 if ((GET_MODE_SIZE (mode) > GET_MODE_SIZE (DECL_MODE (expr))
4803 && !COMPLEX_MODE_P (DECL_MODE (expr))
4804 && hard_regno_nregs[REGNO (loc)][DECL_MODE (expr)] == 1))
4805 && offset + byte_lowpart_offset (DECL_MODE (expr), mode) == 0)
4807 mode = DECL_MODE (expr);
4811 if (offset < 0 || offset >= MAX_VAR_PARTS)
4817 *offset_out = offset;
4821 /* Return the MODE lowpart of LOC, or null if LOC is not something we
4822 want to track. When returning nonnull, make sure that the attributes
4823 on the returned value are updated. */
4826 var_lowpart (enum machine_mode mode, rtx loc)
4828 unsigned int offset, reg_offset, regno;
4830 if (!REG_P (loc) && !MEM_P (loc))
4833 if (GET_MODE (loc) == mode)
4836 offset = byte_lowpart_offset (mode, GET_MODE (loc));
4839 return adjust_address_nv (loc, mode, offset);
4841 reg_offset = subreg_lowpart_offset (mode, GET_MODE (loc));
4842 regno = REGNO (loc) + subreg_regno_offset (REGNO (loc), GET_MODE (loc),
4844 return gen_rtx_REG_offset (loc, mode, regno, offset);
4847 /* Carry information about uses and stores while walking rtx. */
4849 struct count_use_info
4851 /* The insn where the RTX is. */
4854 /* The basic block where insn is. */
4857 /* The array of n_sets sets in the insn, as determined by cselib. */
4858 struct cselib_set *sets;
4861 /* True if we're counting stores, false otherwise. */
4865 /* Find a VALUE corresponding to X. */
4867 static inline cselib_val *
4868 find_use_val (rtx x, enum machine_mode mode, struct count_use_info *cui)
4874 /* This is called after uses are set up and before stores are
4875 processed by cselib, so it's safe to look up srcs, but not
4876 dsts. So we look up expressions that appear in srcs or in
4877 dest expressions, but we search the sets array for dests of
4881 /* Some targets represent memset and memcpy patterns
4882 by (set (mem:BLK ...) (reg:[QHSD]I ...)) or
4883 (set (mem:BLK ...) (const_int ...)) or
4884 (set (mem:BLK ...) (mem:BLK ...)). Don't return anything
4885 in that case, otherwise we end up with mode mismatches. */
4886 if (mode == BLKmode && MEM_P (x))
4888 for (i = 0; i < cui->n_sets; i++)
4889 if (cui->sets[i].dest == x)
4890 return cui->sets[i].src_elt;
4893 return cselib_lookup (x, mode, 0, VOIDmode);
4899 /* Helper function to get mode of MEM's address. */
4901 static inline enum machine_mode
4902 get_address_mode (rtx mem)
4904 enum machine_mode mode = GET_MODE (XEXP (mem, 0));
4905 if (mode != VOIDmode)
4907 return targetm.addr_space.address_mode (MEM_ADDR_SPACE (mem));
4910 /* Replace all registers and addresses in an expression with VALUE
4911 expressions that map back to them, unless the expression is a
4912 register. If no mapping is or can be performed, returns NULL. */
4915 replace_expr_with_values (rtx loc)
4917 if (REG_P (loc) || GET_CODE (loc) == ENTRY_VALUE)
4919 else if (MEM_P (loc))
4921 cselib_val *addr = cselib_lookup (XEXP (loc, 0),
4922 get_address_mode (loc), 0,
4925 return replace_equiv_address_nv (loc, addr->val_rtx);
4930 return cselib_subst_to_values (loc, VOIDmode);
4933 /* Return true if *X is a DEBUG_EXPR. Usable as an argument to
4934 for_each_rtx to tell whether there are any DEBUG_EXPRs within
4938 rtx_debug_expr_p (rtx *x, void *data ATTRIBUTE_UNUSED)
4942 return GET_CODE (loc) == DEBUG_EXPR;
4945 /* Determine what kind of micro operation to choose for a USE. Return
4946 MO_CLOBBER if no micro operation is to be generated. */
4948 static enum micro_operation_type
4949 use_type (rtx loc, struct count_use_info *cui, enum machine_mode *modep)
4953 if (cui && cui->sets)
4955 if (GET_CODE (loc) == VAR_LOCATION)
4957 if (track_expr_p (PAT_VAR_LOCATION_DECL (loc), false))
4959 rtx ploc = PAT_VAR_LOCATION_LOC (loc);
4960 if (! VAR_LOC_UNKNOWN_P (ploc))
4962 cselib_val *val = cselib_lookup (ploc, GET_MODE (loc), 1,
4965 /* ??? flag_float_store and volatile mems are never
4966 given values, but we could in theory use them for
4968 gcc_assert (val || 1);
4976 if (REG_P (loc) || MEM_P (loc))
4979 *modep = GET_MODE (loc);
4983 || (find_use_val (loc, GET_MODE (loc), cui)
4984 && cselib_lookup (XEXP (loc, 0),
4985 get_address_mode (loc), 0,
4991 cselib_val *val = find_use_val (loc, GET_MODE (loc), cui);
4993 if (val && !cselib_preserved_value_p (val))
5001 gcc_assert (REGNO (loc) < FIRST_PSEUDO_REGISTER);
5003 if (loc == cfa_base_rtx)
5005 expr = REG_EXPR (loc);
5008 return MO_USE_NO_VAR;
5009 else if (target_for_debug_bind (var_debug_decl (expr)))
5011 else if (track_loc_p (loc, expr, REG_OFFSET (loc),
5012 false, modep, NULL))
5015 return MO_USE_NO_VAR;
5017 else if (MEM_P (loc))
5019 expr = MEM_EXPR (loc);
5023 else if (target_for_debug_bind (var_debug_decl (expr)))
5025 else if (track_loc_p (loc, expr, INT_MEM_OFFSET (loc),
5027 /* Multi-part variables shouldn't refer to one-part
5028 variable names such as VALUEs (never happens) or
5029 DEBUG_EXPRs (only happens in the presence of debug
5031 && (!MAY_HAVE_DEBUG_INSNS
5032 || !for_each_rtx (&XEXP (loc, 0), rtx_debug_expr_p, NULL)))
5041 /* Log to OUT information about micro-operation MOPT involving X in
5045 log_op_type (rtx x, basic_block bb, rtx insn,
5046 enum micro_operation_type mopt, FILE *out)
5048 fprintf (out, "bb %i op %i insn %i %s ",
5049 bb->index, VEC_length (micro_operation, VTI (bb)->mos),
5050 INSN_UID (insn), micro_operation_type_name[mopt]);
5051 print_inline_rtx (out, x, 2);
5055 /* Tell whether the CONCAT used to holds a VALUE and its location
5056 needs value resolution, i.e., an attempt of mapping the location
5057 back to other incoming values. */
5058 #define VAL_NEEDS_RESOLUTION(x) \
5059 (RTL_FLAG_CHECK1 ("VAL_NEEDS_RESOLUTION", (x), CONCAT)->volatil)
5060 /* Whether the location in the CONCAT is a tracked expression, that
5061 should also be handled like a MO_USE. */
5062 #define VAL_HOLDS_TRACK_EXPR(x) \
5063 (RTL_FLAG_CHECK1 ("VAL_HOLDS_TRACK_EXPR", (x), CONCAT)->used)
5064 /* Whether the location in the CONCAT should be handled like a MO_COPY
5066 #define VAL_EXPR_IS_COPIED(x) \
5067 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_COPIED", (x), CONCAT)->jump)
5068 /* Whether the location in the CONCAT should be handled like a
5069 MO_CLOBBER as well. */
5070 #define VAL_EXPR_IS_CLOBBERED(x) \
5071 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_CLOBBERED", (x), CONCAT)->unchanging)
5073 /* All preserved VALUEs. */
5074 static VEC (rtx, heap) *preserved_values;
5076 /* Ensure VAL is preserved and remember it in a vector for vt_emit_notes. */
5079 preserve_value (cselib_val *val)
5081 cselib_preserve_value (val);
5082 VEC_safe_push (rtx, heap, preserved_values, val->val_rtx);
5085 /* Helper function for MO_VAL_LOC handling. Return non-zero if
5086 any rtxes not suitable for CONST use not replaced by VALUEs
5090 non_suitable_const (rtx *x, void *data ATTRIBUTE_UNUSED)
5095 switch (GET_CODE (*x))
5106 return !MEM_READONLY_P (*x);
5112 /* Add uses (register and memory references) LOC which will be tracked
5113 to VTI (bb)->mos. INSN is instruction which the LOC is part of. */
5116 add_uses (rtx *ploc, void *data)
5119 enum machine_mode mode = VOIDmode;
5120 struct count_use_info *cui = (struct count_use_info *)data;
5121 enum micro_operation_type type = use_type (loc, cui, &mode);
5123 if (type != MO_CLOBBER)
5125 basic_block bb = cui->bb;
5129 mo.u.loc = type == MO_USE ? var_lowpart (mode, loc) : loc;
5130 mo.insn = cui->insn;
5132 if (type == MO_VAL_LOC)
5135 rtx vloc = PAT_VAR_LOCATION_LOC (oloc);
5138 gcc_assert (cui->sets);
5141 && !REG_P (XEXP (vloc, 0))
5142 && !MEM_P (XEXP (vloc, 0)))
5145 enum machine_mode address_mode = get_address_mode (mloc);
5147 = cselib_lookup (XEXP (mloc, 0), address_mode, 0,
5150 if (val && !cselib_preserved_value_p (val))
5151 preserve_value (val);
5154 if (CONSTANT_P (vloc)
5155 && (GET_CODE (vloc) != CONST
5156 || for_each_rtx (&vloc, non_suitable_const, NULL)))
5157 /* For constants don't look up any value. */;
5158 else if (!VAR_LOC_UNKNOWN_P (vloc) && !unsuitable_loc (vloc)
5159 && (val = find_use_val (vloc, GET_MODE (oloc), cui)))
5161 enum machine_mode mode2;
5162 enum micro_operation_type type2;
5164 bool resolvable = REG_P (vloc) || MEM_P (vloc);
5167 nloc = replace_expr_with_values (vloc);
5171 oloc = shallow_copy_rtx (oloc);
5172 PAT_VAR_LOCATION_LOC (oloc) = nloc;
5175 oloc = gen_rtx_CONCAT (mode, val->val_rtx, oloc);
5177 type2 = use_type (vloc, 0, &mode2);
5179 gcc_assert (type2 == MO_USE || type2 == MO_USE_NO_VAR
5180 || type2 == MO_CLOBBER);
5182 if (type2 == MO_CLOBBER
5183 && !cselib_preserved_value_p (val))
5185 VAL_NEEDS_RESOLUTION (oloc) = resolvable;
5186 preserve_value (val);
5189 else if (!VAR_LOC_UNKNOWN_P (vloc))
5191 oloc = shallow_copy_rtx (oloc);
5192 PAT_VAR_LOCATION_LOC (oloc) = gen_rtx_UNKNOWN_VAR_LOC ();
5197 else if (type == MO_VAL_USE)
5199 enum machine_mode mode2 = VOIDmode;
5200 enum micro_operation_type type2;
5201 cselib_val *val = find_use_val (loc, GET_MODE (loc), cui);
5202 rtx vloc, oloc = loc, nloc;
5204 gcc_assert (cui->sets);
5207 && !REG_P (XEXP (oloc, 0))
5208 && !MEM_P (XEXP (oloc, 0)))
5211 enum machine_mode address_mode = get_address_mode (mloc);
5213 = cselib_lookup (XEXP (mloc, 0), address_mode, 0,
5216 if (val && !cselib_preserved_value_p (val))
5217 preserve_value (val);
5220 type2 = use_type (loc, 0, &mode2);
5222 gcc_assert (type2 == MO_USE || type2 == MO_USE_NO_VAR
5223 || type2 == MO_CLOBBER);
5225 if (type2 == MO_USE)
5226 vloc = var_lowpart (mode2, loc);
5230 /* The loc of a MO_VAL_USE may have two forms:
5232 (concat val src): val is at src, a value-based
5235 (concat (concat val use) src): same as above, with use as
5236 the MO_USE tracked value, if it differs from src.
5240 gcc_checking_assert (REG_P (loc) || MEM_P (loc));
5241 nloc = replace_expr_with_values (loc);
5246 oloc = gen_rtx_CONCAT (mode2, val->val_rtx, vloc);
5248 oloc = val->val_rtx;
5250 mo.u.loc = gen_rtx_CONCAT (mode, oloc, nloc);
5252 if (type2 == MO_USE)
5253 VAL_HOLDS_TRACK_EXPR (mo.u.loc) = 1;
5254 if (!cselib_preserved_value_p (val))
5256 VAL_NEEDS_RESOLUTION (mo.u.loc) = 1;
5257 preserve_value (val);
5261 gcc_assert (type == MO_USE || type == MO_USE_NO_VAR);
5263 if (dump_file && (dump_flags & TDF_DETAILS))
5264 log_op_type (mo.u.loc, cui->bb, cui->insn, mo.type, dump_file);
5265 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, &mo);
5271 /* Helper function for finding all uses of REG/MEM in X in insn INSN. */
5274 add_uses_1 (rtx *x, void *cui)
5276 for_each_rtx (x, add_uses, cui);
5279 /* This is the value used during expansion of locations. We want it
5280 to be unbounded, so that variables expanded deep in a recursion
5281 nest are fully evaluated, so that their values are cached
5282 correctly. We avoid recursion cycles through other means, and we
5283 don't unshare RTL, so excess complexity is not a problem. */
5284 #define EXPR_DEPTH (INT_MAX)
5285 /* We use this to keep too-complex expressions from being emitted as
5286 location notes, and then to debug information. Users can trade
5287 compile time for ridiculously complex expressions, although they're
5288 seldom useful, and they may often have to be discarded as not
5289 representable anyway. */
5290 #define EXPR_USE_DEPTH (PARAM_VALUE (PARAM_MAX_VARTRACK_EXPR_DEPTH))
5292 /* Attempt to reverse the EXPR operation in the debug info and record
5293 it in the cselib table. Say for reg1 = reg2 + 6 even when reg2 is
5294 no longer live we can express its value as VAL - 6. */
5297 reverse_op (rtx val, const_rtx expr, rtx insn)
5301 struct elt_loc_list *l;
5304 if (GET_CODE (expr) != SET)
5307 if (!REG_P (SET_DEST (expr)) || GET_MODE (val) != GET_MODE (SET_DEST (expr)))
5310 src = SET_SRC (expr);
5311 switch (GET_CODE (src))
5318 if (!REG_P (XEXP (src, 0)))
5323 if (!REG_P (XEXP (src, 0)) && !MEM_P (XEXP (src, 0)))
5330 if (!SCALAR_INT_MODE_P (GET_MODE (src)) || XEXP (src, 0) == cfa_base_rtx)
5333 v = cselib_lookup (XEXP (src, 0), GET_MODE (XEXP (src, 0)), 0, VOIDmode);
5334 if (!v || !cselib_preserved_value_p (v))
5337 /* Adding a reverse op isn't useful if V already has an always valid
5338 location. Ignore ENTRY_VALUE, while it is always constant, we should
5339 prefer non-ENTRY_VALUE locations whenever possible. */
5340 for (l = v->locs; l; l = l->next)
5341 if (CONSTANT_P (l->loc)
5342 && (GET_CODE (l->loc) != CONST || !references_value_p (l->loc, 0)))
5345 switch (GET_CODE (src))
5349 if (GET_MODE (v->val_rtx) != GET_MODE (val))
5351 ret = gen_rtx_fmt_e (GET_CODE (src), GET_MODE (val), val);
5355 ret = gen_lowpart_SUBREG (GET_MODE (v->val_rtx), val);
5367 if (GET_MODE (v->val_rtx) != GET_MODE (val))
5369 arg = XEXP (src, 1);
5370 if (!CONST_INT_P (arg) && GET_CODE (arg) != SYMBOL_REF)
5372 arg = cselib_expand_value_rtx (arg, scratch_regs, 5);
5373 if (arg == NULL_RTX)
5375 if (!CONST_INT_P (arg) && GET_CODE (arg) != SYMBOL_REF)
5378 ret = simplify_gen_binary (code, GET_MODE (val), val, arg);
5380 /* Ensure ret isn't VALUE itself (which can happen e.g. for
5381 (plus (reg1) (reg2)) when reg2 is known to be 0), as that
5382 breaks a lot of routines during var-tracking. */
5383 ret = gen_rtx_fmt_ee (PLUS, GET_MODE (val), val, const0_rtx);
5389 cselib_add_permanent_equiv (v, ret, insn);
5392 /* Add stores (register and memory references) LOC which will be tracked
5393 to VTI (bb)->mos. EXPR is the RTL expression containing the store.
5394 CUIP->insn is instruction which the LOC is part of. */
5397 add_stores (rtx loc, const_rtx expr, void *cuip)
5399 enum machine_mode mode = VOIDmode, mode2;
5400 struct count_use_info *cui = (struct count_use_info *)cuip;
5401 basic_block bb = cui->bb;
5403 rtx oloc = loc, nloc, src = NULL;
5404 enum micro_operation_type type = use_type (loc, cui, &mode);
5405 bool track_p = false;
5407 bool resolve, preserve;
5409 if (type == MO_CLOBBER)
5416 gcc_assert (loc != cfa_base_rtx);
5417 if ((GET_CODE (expr) == CLOBBER && type != MO_VAL_SET)
5418 || !(track_p = use_type (loc, NULL, &mode2) == MO_USE)
5419 || GET_CODE (expr) == CLOBBER)
5421 mo.type = MO_CLOBBER;
5423 if (GET_CODE (expr) == SET
5424 && SET_DEST (expr) == loc
5425 && !unsuitable_loc (SET_SRC (expr))
5426 && find_use_val (loc, mode, cui))
5428 gcc_checking_assert (type == MO_VAL_SET);
5429 mo.u.loc = gen_rtx_SET (VOIDmode, loc, SET_SRC (expr));
5434 if (GET_CODE (expr) == SET
5435 && SET_DEST (expr) == loc
5436 && GET_CODE (SET_SRC (expr)) != ASM_OPERANDS)
5437 src = var_lowpart (mode2, SET_SRC (expr));
5438 loc = var_lowpart (mode2, loc);
5447 rtx xexpr = gen_rtx_SET (VOIDmode, loc, src);
5448 if (same_variable_part_p (src, REG_EXPR (loc), REG_OFFSET (loc)))
5455 mo.insn = cui->insn;
5457 else if (MEM_P (loc)
5458 && ((track_p = use_type (loc, NULL, &mode2) == MO_USE)
5461 if (MEM_P (loc) && type == MO_VAL_SET
5462 && !REG_P (XEXP (loc, 0))
5463 && !MEM_P (XEXP (loc, 0)))
5466 enum machine_mode address_mode = get_address_mode (mloc);
5467 cselib_val *val = cselib_lookup (XEXP (mloc, 0),
5471 if (val && !cselib_preserved_value_p (val))
5472 preserve_value (val);
5475 if (GET_CODE (expr) == CLOBBER || !track_p)
5477 mo.type = MO_CLOBBER;
5478 mo.u.loc = track_p ? var_lowpart (mode2, loc) : loc;
5482 if (GET_CODE (expr) == SET
5483 && SET_DEST (expr) == loc
5484 && GET_CODE (SET_SRC (expr)) != ASM_OPERANDS)
5485 src = var_lowpart (mode2, SET_SRC (expr));
5486 loc = var_lowpart (mode2, loc);
5495 rtx xexpr = gen_rtx_SET (VOIDmode, loc, src);
5496 if (same_variable_part_p (SET_SRC (xexpr),
5498 INT_MEM_OFFSET (loc)))
5505 mo.insn = cui->insn;
5510 if (type != MO_VAL_SET)
5511 goto log_and_return;
5513 v = find_use_val (oloc, mode, cui);
5516 goto log_and_return;
5518 resolve = preserve = !cselib_preserved_value_p (v);
5520 nloc = replace_expr_with_values (oloc);
5524 if (GET_CODE (PATTERN (cui->insn)) == COND_EXEC)
5526 cselib_val *oval = cselib_lookup (oloc, GET_MODE (oloc), 0, VOIDmode);
5528 gcc_assert (oval != v);
5529 gcc_assert (REG_P (oloc) || MEM_P (oloc));
5531 if (oval && !cselib_preserved_value_p (oval))
5533 micro_operation moa;
5535 preserve_value (oval);
5537 moa.type = MO_VAL_USE;
5538 moa.u.loc = gen_rtx_CONCAT (mode, oval->val_rtx, oloc);
5539 VAL_NEEDS_RESOLUTION (moa.u.loc) = 1;
5540 moa.insn = cui->insn;
5542 if (dump_file && (dump_flags & TDF_DETAILS))
5543 log_op_type (moa.u.loc, cui->bb, cui->insn,
5544 moa.type, dump_file);
5545 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, &moa);
5550 else if (resolve && GET_CODE (mo.u.loc) == SET)
5552 if (REG_P (SET_SRC (expr)) || MEM_P (SET_SRC (expr)))
5553 nloc = replace_expr_with_values (SET_SRC (expr));
5557 /* Avoid the mode mismatch between oexpr and expr. */
5558 if (!nloc && mode != mode2)
5560 nloc = SET_SRC (expr);
5561 gcc_assert (oloc == SET_DEST (expr));
5564 if (nloc && nloc != SET_SRC (mo.u.loc))
5565 oloc = gen_rtx_SET (GET_MODE (mo.u.loc), oloc, nloc);
5568 if (oloc == SET_DEST (mo.u.loc))
5569 /* No point in duplicating. */
5571 if (!REG_P (SET_SRC (mo.u.loc)))
5577 if (GET_CODE (mo.u.loc) == SET
5578 && oloc == SET_DEST (mo.u.loc))
5579 /* No point in duplicating. */
5585 loc = gen_rtx_CONCAT (mode, v->val_rtx, oloc);
5587 if (mo.u.loc != oloc)
5588 loc = gen_rtx_CONCAT (GET_MODE (mo.u.loc), loc, mo.u.loc);
5590 /* The loc of a MO_VAL_SET may have various forms:
5592 (concat val dst): dst now holds val
5594 (concat val (set dst src)): dst now holds val, copied from src
5596 (concat (concat val dstv) dst): dst now holds val; dstv is dst
5597 after replacing mems and non-top-level regs with values.
5599 (concat (concat val dstv) (set dst src)): dst now holds val,
5600 copied from src. dstv is a value-based representation of dst, if
5601 it differs from dst. If resolution is needed, src is a REG, and
5602 its mode is the same as that of val.
5604 (concat (concat val (set dstv srcv)) (set dst src)): src
5605 copied to dst, holding val. dstv and srcv are value-based
5606 representations of dst and src, respectively.
5610 if (GET_CODE (PATTERN (cui->insn)) != COND_EXEC)
5611 reverse_op (v->val_rtx, expr, cui->insn);
5616 VAL_HOLDS_TRACK_EXPR (loc) = 1;
5619 VAL_NEEDS_RESOLUTION (loc) = resolve;
5622 if (mo.type == MO_CLOBBER)
5623 VAL_EXPR_IS_CLOBBERED (loc) = 1;
5624 if (mo.type == MO_COPY)
5625 VAL_EXPR_IS_COPIED (loc) = 1;
5627 mo.type = MO_VAL_SET;
5630 if (dump_file && (dump_flags & TDF_DETAILS))
5631 log_op_type (mo.u.loc, cui->bb, cui->insn, mo.type, dump_file);
5632 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, &mo);
5635 /* Arguments to the call. */
5636 static rtx call_arguments;
5638 /* Compute call_arguments. */
5641 prepare_call_arguments (basic_block bb, rtx insn)
5644 rtx prev, cur, next;
5645 rtx call = PATTERN (insn);
5646 rtx this_arg = NULL_RTX;
5647 tree type = NULL_TREE, t, fndecl = NULL_TREE;
5648 tree obj_type_ref = NULL_TREE;
5649 CUMULATIVE_ARGS args_so_far_v;
5650 cumulative_args_t args_so_far;
5652 memset (&args_so_far_v, 0, sizeof (args_so_far_v));
5653 args_so_far = pack_cumulative_args (&args_so_far_v);
5654 if (GET_CODE (call) == PARALLEL)
5655 call = XVECEXP (call, 0, 0);
5656 if (GET_CODE (call) == SET)
5657 call = SET_SRC (call);
5658 if (GET_CODE (call) == CALL && MEM_P (XEXP (call, 0)))
5660 if (GET_CODE (XEXP (XEXP (call, 0), 0)) == SYMBOL_REF)
5662 rtx symbol = XEXP (XEXP (call, 0), 0);
5663 if (SYMBOL_REF_DECL (symbol))
5664 fndecl = SYMBOL_REF_DECL (symbol);
5666 if (fndecl == NULL_TREE)
5667 fndecl = MEM_EXPR (XEXP (call, 0));
5669 && TREE_CODE (TREE_TYPE (fndecl)) != FUNCTION_TYPE
5670 && TREE_CODE (TREE_TYPE (fndecl)) != METHOD_TYPE)
5672 if (fndecl && TYPE_ARG_TYPES (TREE_TYPE (fndecl)))
5673 type = TREE_TYPE (fndecl);
5674 if (fndecl && TREE_CODE (fndecl) != FUNCTION_DECL)
5676 if (TREE_CODE (fndecl) == INDIRECT_REF
5677 && TREE_CODE (TREE_OPERAND (fndecl, 0)) == OBJ_TYPE_REF)
5678 obj_type_ref = TREE_OPERAND (fndecl, 0);
5683 for (t = TYPE_ARG_TYPES (type); t && t != void_list_node;
5685 if (TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE
5686 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_VALUE (t))))
5688 if ((t == NULL || t == void_list_node) && obj_type_ref == NULL_TREE)
5692 int nargs ATTRIBUTE_UNUSED = list_length (TYPE_ARG_TYPES (type));
5693 link = CALL_INSN_FUNCTION_USAGE (insn);
5694 #ifndef PCC_STATIC_STRUCT_RETURN
5695 if (aggregate_value_p (TREE_TYPE (type), type)
5696 && targetm.calls.struct_value_rtx (type, 0) == 0)
5698 tree struct_addr = build_pointer_type (TREE_TYPE (type));
5699 enum machine_mode mode = TYPE_MODE (struct_addr);
5701 INIT_CUMULATIVE_ARGS (args_so_far_v, type, NULL_RTX, fndecl,
5703 reg = targetm.calls.function_arg (args_so_far, mode,
5705 targetm.calls.function_arg_advance (args_so_far, mode,
5707 if (reg == NULL_RTX)
5709 for (; link; link = XEXP (link, 1))
5710 if (GET_CODE (XEXP (link, 0)) == USE
5711 && MEM_P (XEXP (XEXP (link, 0), 0)))
5713 link = XEXP (link, 1);
5720 INIT_CUMULATIVE_ARGS (args_so_far_v, type, NULL_RTX, fndecl,
5722 if (obj_type_ref && TYPE_ARG_TYPES (type) != void_list_node)
5724 enum machine_mode mode;
5725 t = TYPE_ARG_TYPES (type);
5726 mode = TYPE_MODE (TREE_VALUE (t));
5727 this_arg = targetm.calls.function_arg (args_so_far, mode,
5728 TREE_VALUE (t), true);
5729 if (this_arg && !REG_P (this_arg))
5730 this_arg = NULL_RTX;
5731 else if (this_arg == NULL_RTX)
5733 for (; link; link = XEXP (link, 1))
5734 if (GET_CODE (XEXP (link, 0)) == USE
5735 && MEM_P (XEXP (XEXP (link, 0), 0)))
5737 this_arg = XEXP (XEXP (link, 0), 0);
5745 t = type ? TYPE_ARG_TYPES (type) : NULL_TREE;
5747 for (link = CALL_INSN_FUNCTION_USAGE (insn); link; link = XEXP (link, 1))
5748 if (GET_CODE (XEXP (link, 0)) == USE)
5750 rtx item = NULL_RTX;
5751 x = XEXP (XEXP (link, 0), 0);
5752 if (GET_MODE (link) == VOIDmode
5753 || GET_MODE (link) == BLKmode
5754 || (GET_MODE (link) != GET_MODE (x)
5755 && (GET_MODE_CLASS (GET_MODE (link)) != MODE_INT
5756 || GET_MODE_CLASS (GET_MODE (x)) != MODE_INT)))
5757 /* Can't do anything for these, if the original type mode
5758 isn't known or can't be converted. */;
5761 cselib_val *val = cselib_lookup (x, GET_MODE (x), 0, VOIDmode);
5762 if (val && cselib_preserved_value_p (val))
5763 item = val->val_rtx;
5764 else if (GET_MODE_CLASS (GET_MODE (x)) == MODE_INT)
5766 enum machine_mode mode = GET_MODE (x);
5768 while ((mode = GET_MODE_WIDER_MODE (mode)) != VOIDmode
5769 && GET_MODE_BITSIZE (mode) <= BITS_PER_WORD)
5771 rtx reg = simplify_subreg (mode, x, GET_MODE (x), 0);
5773 if (reg == NULL_RTX || !REG_P (reg))
5775 val = cselib_lookup (reg, mode, 0, VOIDmode);
5776 if (val && cselib_preserved_value_p (val))
5778 item = val->val_rtx;
5789 if (!frame_pointer_needed)
5791 struct adjust_mem_data amd;
5792 amd.mem_mode = VOIDmode;
5793 amd.stack_adjust = -VTI (bb)->out.stack_adjust;
5794 amd.side_effects = NULL_RTX;
5796 mem = simplify_replace_fn_rtx (mem, NULL_RTX, adjust_mems,
5798 gcc_assert (amd.side_effects == NULL_RTX);
5800 val = cselib_lookup (mem, GET_MODE (mem), 0, VOIDmode);
5801 if (val && cselib_preserved_value_p (val))
5802 item = val->val_rtx;
5803 else if (GET_MODE_CLASS (GET_MODE (mem)) != MODE_INT)
5805 /* For non-integer stack argument see also if they weren't
5806 initialized by integers. */
5807 enum machine_mode imode = int_mode_for_mode (GET_MODE (mem));
5808 if (imode != GET_MODE (mem) && imode != BLKmode)
5810 val = cselib_lookup (adjust_address_nv (mem, imode, 0),
5811 imode, 0, VOIDmode);
5812 if (val && cselib_preserved_value_p (val))
5813 item = lowpart_subreg (GET_MODE (x), val->val_rtx,
5821 if (GET_MODE (item) != GET_MODE (link))
5822 item = lowpart_subreg (GET_MODE (link), item, GET_MODE (item));
5823 if (GET_MODE (x2) != GET_MODE (link))
5824 x2 = lowpart_subreg (GET_MODE (link), x2, GET_MODE (x2));
5825 item = gen_rtx_CONCAT (GET_MODE (link), x2, item);
5827 = gen_rtx_EXPR_LIST (VOIDmode, item, call_arguments);
5829 if (t && t != void_list_node)
5831 tree argtype = TREE_VALUE (t);
5832 enum machine_mode mode = TYPE_MODE (argtype);
5834 if (pass_by_reference (&args_so_far_v, mode, argtype, true))
5836 argtype = build_pointer_type (argtype);
5837 mode = TYPE_MODE (argtype);
5839 reg = targetm.calls.function_arg (args_so_far, mode,
5841 if (TREE_CODE (argtype) == REFERENCE_TYPE
5842 && INTEGRAL_TYPE_P (TREE_TYPE (argtype))
5845 && GET_MODE (reg) == mode
5846 && GET_MODE_CLASS (mode) == MODE_INT
5848 && REGNO (x) == REGNO (reg)
5849 && GET_MODE (x) == mode
5852 enum machine_mode indmode
5853 = TYPE_MODE (TREE_TYPE (argtype));
5854 rtx mem = gen_rtx_MEM (indmode, x);
5855 cselib_val *val = cselib_lookup (mem, indmode, 0, VOIDmode);
5856 if (val && cselib_preserved_value_p (val))
5858 item = gen_rtx_CONCAT (indmode, mem, val->val_rtx);
5859 call_arguments = gen_rtx_EXPR_LIST (VOIDmode, item,
5864 struct elt_loc_list *l;
5867 /* Try harder, when passing address of a constant
5868 pool integer it can be easily read back. */
5869 item = XEXP (item, 1);
5870 if (GET_CODE (item) == SUBREG)
5871 item = SUBREG_REG (item);
5872 gcc_assert (GET_CODE (item) == VALUE);
5873 val = CSELIB_VAL_PTR (item);
5874 for (l = val->locs; l; l = l->next)
5875 if (GET_CODE (l->loc) == SYMBOL_REF
5876 && TREE_CONSTANT_POOL_ADDRESS_P (l->loc)
5877 && SYMBOL_REF_DECL (l->loc)
5878 && DECL_INITIAL (SYMBOL_REF_DECL (l->loc)))
5880 initial = DECL_INITIAL (SYMBOL_REF_DECL (l->loc));
5881 if (host_integerp (initial, 0))
5883 item = GEN_INT (tree_low_cst (initial, 0));
5884 item = gen_rtx_CONCAT (indmode, mem, item);
5886 = gen_rtx_EXPR_LIST (VOIDmode, item,
5893 targetm.calls.function_arg_advance (args_so_far, mode,
5899 /* Add debug arguments. */
5901 && TREE_CODE (fndecl) == FUNCTION_DECL
5902 && DECL_HAS_DEBUG_ARGS_P (fndecl))
5904 VEC(tree, gc) **debug_args = decl_debug_args_lookup (fndecl);
5909 for (ix = 0; VEC_iterate (tree, *debug_args, ix, param); ix += 2)
5912 tree dtemp = VEC_index (tree, *debug_args, ix + 1);
5913 enum machine_mode mode = DECL_MODE (dtemp);
5914 item = gen_rtx_DEBUG_PARAMETER_REF (mode, param);
5915 item = gen_rtx_CONCAT (mode, item, DECL_RTL_KNOWN_SET (dtemp));
5916 call_arguments = gen_rtx_EXPR_LIST (VOIDmode, item,
5922 /* Reverse call_arguments chain. */
5924 for (cur = call_arguments; cur; cur = next)
5926 next = XEXP (cur, 1);
5927 XEXP (cur, 1) = prev;
5930 call_arguments = prev;
5933 if (GET_CODE (x) == PARALLEL)
5934 x = XVECEXP (x, 0, 0);
5935 if (GET_CODE (x) == SET)
5937 if (GET_CODE (x) == CALL && MEM_P (XEXP (x, 0)))
5939 x = XEXP (XEXP (x, 0), 0);
5940 if (GET_CODE (x) == SYMBOL_REF)
5941 /* Don't record anything. */;
5942 else if (CONSTANT_P (x))
5944 x = gen_rtx_CONCAT (GET_MODE (x) == VOIDmode ? Pmode : GET_MODE (x),
5947 = gen_rtx_EXPR_LIST (VOIDmode, x, call_arguments);
5951 cselib_val *val = cselib_lookup (x, GET_MODE (x), 0, VOIDmode);
5952 if (val && cselib_preserved_value_p (val))
5954 x = gen_rtx_CONCAT (GET_MODE (x), pc_rtx, val->val_rtx);
5956 = gen_rtx_EXPR_LIST (VOIDmode, x, call_arguments);
5962 enum machine_mode mode
5963 = TYPE_MODE (TREE_TYPE (OBJ_TYPE_REF_EXPR (obj_type_ref)));
5964 rtx clobbered = gen_rtx_MEM (mode, this_arg);
5966 = tree_low_cst (OBJ_TYPE_REF_TOKEN (obj_type_ref), 0);
5968 clobbered = plus_constant (clobbered, token * GET_MODE_SIZE (mode));
5969 clobbered = gen_rtx_MEM (mode, clobbered);
5970 x = gen_rtx_CONCAT (mode, gen_rtx_CLOBBER (VOIDmode, pc_rtx), clobbered);
5972 = gen_rtx_EXPR_LIST (VOIDmode, x, call_arguments);
5976 /* Callback for cselib_record_sets_hook, that records as micro
5977 operations uses and stores in an insn after cselib_record_sets has
5978 analyzed the sets in an insn, but before it modifies the stored
5979 values in the internal tables, unless cselib_record_sets doesn't
5980 call it directly (perhaps because we're not doing cselib in the
5981 first place, in which case sets and n_sets will be 0). */
5984 add_with_sets (rtx insn, struct cselib_set *sets, int n_sets)
5986 basic_block bb = BLOCK_FOR_INSN (insn);
5988 struct count_use_info cui;
5989 micro_operation *mos;
5991 cselib_hook_called = true;
5996 cui.n_sets = n_sets;
5998 n1 = VEC_length (micro_operation, VTI (bb)->mos);
5999 cui.store_p = false;
6000 note_uses (&PATTERN (insn), add_uses_1, &cui);
6001 n2 = VEC_length (micro_operation, VTI (bb)->mos) - 1;
6002 mos = VEC_address (micro_operation, VTI (bb)->mos);
6004 /* Order the MO_USEs to be before MO_USE_NO_VARs and MO_VAL_USE, and
6008 while (n1 < n2 && mos[n1].type == MO_USE)
6010 while (n1 < n2 && mos[n2].type != MO_USE)
6022 n2 = VEC_length (micro_operation, VTI (bb)->mos) - 1;
6025 while (n1 < n2 && mos[n1].type != MO_VAL_LOC)
6027 while (n1 < n2 && mos[n2].type == MO_VAL_LOC)
6045 mo.u.loc = call_arguments;
6046 call_arguments = NULL_RTX;
6048 if (dump_file && (dump_flags & TDF_DETAILS))
6049 log_op_type (PATTERN (insn), bb, insn, mo.type, dump_file);
6050 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, &mo);
6053 n1 = VEC_length (micro_operation, VTI (bb)->mos);
6054 /* This will record NEXT_INSN (insn), such that we can
6055 insert notes before it without worrying about any
6056 notes that MO_USEs might emit after the insn. */
6058 note_stores (PATTERN (insn), add_stores, &cui);
6059 n2 = VEC_length (micro_operation, VTI (bb)->mos) - 1;
6060 mos = VEC_address (micro_operation, VTI (bb)->mos);
6062 /* Order the MO_VAL_USEs first (note_stores does nothing
6063 on DEBUG_INSNs, so there are no MO_VAL_LOCs from this
6064 insn), then MO_CLOBBERs, then MO_SET/MO_COPY/MO_VAL_SET. */
6067 while (n1 < n2 && mos[n1].type == MO_VAL_USE)
6069 while (n1 < n2 && mos[n2].type != MO_VAL_USE)
6081 n2 = VEC_length (micro_operation, VTI (bb)->mos) - 1;
6084 while (n1 < n2 && mos[n1].type == MO_CLOBBER)
6086 while (n1 < n2 && mos[n2].type != MO_CLOBBER)
6099 static enum var_init_status
6100 find_src_status (dataflow_set *in, rtx src)
6102 tree decl = NULL_TREE;
6103 enum var_init_status status = VAR_INIT_STATUS_UNINITIALIZED;
6105 if (! flag_var_tracking_uninit)
6106 status = VAR_INIT_STATUS_INITIALIZED;
6108 if (src && REG_P (src))
6109 decl = var_debug_decl (REG_EXPR (src));
6110 else if (src && MEM_P (src))
6111 decl = var_debug_decl (MEM_EXPR (src));
6114 status = get_init_value (in, src, dv_from_decl (decl));
6119 /* SRC is the source of an assignment. Use SET to try to find what
6120 was ultimately assigned to SRC. Return that value if known,
6121 otherwise return SRC itself. */
6124 find_src_set_src (dataflow_set *set, rtx src)
6126 tree decl = NULL_TREE; /* The variable being copied around. */
6127 rtx set_src = NULL_RTX; /* The value for "decl" stored in "src". */
6129 location_chain nextp;
6133 if (src && REG_P (src))
6134 decl = var_debug_decl (REG_EXPR (src));
6135 else if (src && MEM_P (src))
6136 decl = var_debug_decl (MEM_EXPR (src));
6140 decl_or_value dv = dv_from_decl (decl);
6142 var = shared_hash_find (set->vars, dv);
6146 for (i = 0; i < var->n_var_parts && !found; i++)
6147 for (nextp = var->var_part[i].loc_chain; nextp && !found;
6148 nextp = nextp->next)
6149 if (rtx_equal_p (nextp->loc, src))
6151 set_src = nextp->set_src;
6161 /* Compute the changes of variable locations in the basic block BB. */
6164 compute_bb_dataflow (basic_block bb)
6167 micro_operation *mo;
6169 dataflow_set old_out;
6170 dataflow_set *in = &VTI (bb)->in;
6171 dataflow_set *out = &VTI (bb)->out;
6173 dataflow_set_init (&old_out);
6174 dataflow_set_copy (&old_out, out);
6175 dataflow_set_copy (out, in);
6177 FOR_EACH_VEC_ELT (micro_operation, VTI (bb)->mos, i, mo)
6179 rtx insn = mo->insn;
6184 dataflow_set_clear_at_call (out);
6189 rtx loc = mo->u.loc;
6192 var_reg_set (out, loc, VAR_INIT_STATUS_UNINITIALIZED, NULL);
6193 else if (MEM_P (loc))
6194 var_mem_set (out, loc, VAR_INIT_STATUS_UNINITIALIZED, NULL);
6200 rtx loc = mo->u.loc;
6204 if (GET_CODE (loc) == CONCAT)
6206 val = XEXP (loc, 0);
6207 vloc = XEXP (loc, 1);
6215 var = PAT_VAR_LOCATION_DECL (vloc);
6217 clobber_variable_part (out, NULL_RTX,
6218 dv_from_decl (var), 0, NULL_RTX);
6221 if (VAL_NEEDS_RESOLUTION (loc))
6222 val_resolve (out, val, PAT_VAR_LOCATION_LOC (vloc), insn);
6223 set_variable_part (out, val, dv_from_decl (var), 0,
6224 VAR_INIT_STATUS_INITIALIZED, NULL_RTX,
6227 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc)))
6228 set_variable_part (out, PAT_VAR_LOCATION_LOC (vloc),
6229 dv_from_decl (var), 0,
6230 VAR_INIT_STATUS_INITIALIZED, NULL_RTX,
6237 rtx loc = mo->u.loc;
6238 rtx val, vloc, uloc;
6240 vloc = uloc = XEXP (loc, 1);
6241 val = XEXP (loc, 0);
6243 if (GET_CODE (val) == CONCAT)
6245 uloc = XEXP (val, 1);
6246 val = XEXP (val, 0);
6249 if (VAL_NEEDS_RESOLUTION (loc))
6250 val_resolve (out, val, vloc, insn);
6252 val_store (out, val, uloc, insn, false);
6254 if (VAL_HOLDS_TRACK_EXPR (loc))
6256 if (GET_CODE (uloc) == REG)
6257 var_reg_set (out, uloc, VAR_INIT_STATUS_UNINITIALIZED,
6259 else if (GET_CODE (uloc) == MEM)
6260 var_mem_set (out, uloc, VAR_INIT_STATUS_UNINITIALIZED,
6268 rtx loc = mo->u.loc;
6269 rtx val, vloc, uloc;
6272 uloc = XEXP (vloc, 1);
6273 val = XEXP (vloc, 0);
6276 if (GET_CODE (val) == CONCAT)
6278 vloc = XEXP (val, 1);
6279 val = XEXP (val, 0);
6282 if (GET_CODE (vloc) == SET)
6284 rtx vsrc = SET_SRC (vloc);
6286 gcc_assert (val != vsrc);
6287 gcc_assert (vloc == uloc || VAL_NEEDS_RESOLUTION (loc));
6289 vloc = SET_DEST (vloc);
6291 if (VAL_NEEDS_RESOLUTION (loc))
6292 val_resolve (out, val, vsrc, insn);
6294 else if (VAL_NEEDS_RESOLUTION (loc))
6296 gcc_assert (GET_CODE (uloc) == SET
6297 && GET_CODE (SET_SRC (uloc)) == REG);
6298 val_resolve (out, val, SET_SRC (uloc), insn);
6301 if (VAL_HOLDS_TRACK_EXPR (loc))
6303 if (VAL_EXPR_IS_CLOBBERED (loc))
6306 var_reg_delete (out, uloc, true);
6307 else if (MEM_P (uloc))
6308 var_mem_delete (out, uloc, true);
6312 bool copied_p = VAL_EXPR_IS_COPIED (loc);
6314 enum var_init_status status = VAR_INIT_STATUS_INITIALIZED;
6316 if (GET_CODE (uloc) == SET)
6318 set_src = SET_SRC (uloc);
6319 uloc = SET_DEST (uloc);
6324 if (flag_var_tracking_uninit)
6326 status = find_src_status (in, set_src);
6328 if (status == VAR_INIT_STATUS_UNKNOWN)
6329 status = find_src_status (out, set_src);
6332 set_src = find_src_set_src (in, set_src);
6336 var_reg_delete_and_set (out, uloc, !copied_p,
6338 else if (MEM_P (uloc))
6339 var_mem_delete_and_set (out, uloc, !copied_p,
6343 else if (REG_P (uloc))
6344 var_regno_delete (out, REGNO (uloc));
6346 val_store (out, val, vloc, insn, true);
6352 rtx loc = mo->u.loc;
6355 if (GET_CODE (loc) == SET)
6357 set_src = SET_SRC (loc);
6358 loc = SET_DEST (loc);
6362 var_reg_delete_and_set (out, loc, true, VAR_INIT_STATUS_INITIALIZED,
6364 else if (MEM_P (loc))
6365 var_mem_delete_and_set (out, loc, true, VAR_INIT_STATUS_INITIALIZED,
6372 rtx loc = mo->u.loc;
6373 enum var_init_status src_status;
6376 if (GET_CODE (loc) == SET)
6378 set_src = SET_SRC (loc);
6379 loc = SET_DEST (loc);
6382 if (! flag_var_tracking_uninit)
6383 src_status = VAR_INIT_STATUS_INITIALIZED;
6386 src_status = find_src_status (in, set_src);
6388 if (src_status == VAR_INIT_STATUS_UNKNOWN)
6389 src_status = find_src_status (out, set_src);
6392 set_src = find_src_set_src (in, set_src);
6395 var_reg_delete_and_set (out, loc, false, src_status, set_src);
6396 else if (MEM_P (loc))
6397 var_mem_delete_and_set (out, loc, false, src_status, set_src);
6403 rtx loc = mo->u.loc;
6406 var_reg_delete (out, loc, false);
6407 else if (MEM_P (loc))
6408 var_mem_delete (out, loc, false);
6414 rtx loc = mo->u.loc;
6417 var_reg_delete (out, loc, true);
6418 else if (MEM_P (loc))
6419 var_mem_delete (out, loc, true);
6424 out->stack_adjust += mo->u.adjust;
6429 if (MAY_HAVE_DEBUG_INSNS)
6431 dataflow_set_equiv_regs (out);
6432 htab_traverse (shared_hash_htab (out->vars), canonicalize_values_mark,
6434 htab_traverse (shared_hash_htab (out->vars), canonicalize_values_star,
6437 htab_traverse (shared_hash_htab (out->vars),
6438 canonicalize_loc_order_check, out);
6441 changed = dataflow_set_different (&old_out, out);
6442 dataflow_set_destroy (&old_out);
6446 /* Find the locations of variables in the whole function. */
6449 vt_find_locations (void)
6451 fibheap_t worklist, pending, fibheap_swap;
6452 sbitmap visited, in_worklist, in_pending, sbitmap_swap;
6459 int htabmax = PARAM_VALUE (PARAM_MAX_VARTRACK_SIZE);
6460 bool success = true;
6462 timevar_push (TV_VAR_TRACKING_DATAFLOW);
6463 /* Compute reverse completion order of depth first search of the CFG
6464 so that the data-flow runs faster. */
6465 rc_order = XNEWVEC (int, n_basic_blocks - NUM_FIXED_BLOCKS);
6466 bb_order = XNEWVEC (int, last_basic_block);
6467 pre_and_rev_post_order_compute (NULL, rc_order, false);
6468 for (i = 0; i < n_basic_blocks - NUM_FIXED_BLOCKS; i++)
6469 bb_order[rc_order[i]] = i;
6472 worklist = fibheap_new ();
6473 pending = fibheap_new ();
6474 visited = sbitmap_alloc (last_basic_block);
6475 in_worklist = sbitmap_alloc (last_basic_block);
6476 in_pending = sbitmap_alloc (last_basic_block);
6477 sbitmap_zero (in_worklist);
6480 fibheap_insert (pending, bb_order[bb->index], bb);
6481 sbitmap_ones (in_pending);
6483 while (success && !fibheap_empty (pending))
6485 fibheap_swap = pending;
6487 worklist = fibheap_swap;
6488 sbitmap_swap = in_pending;
6489 in_pending = in_worklist;
6490 in_worklist = sbitmap_swap;
6492 sbitmap_zero (visited);
6494 while (!fibheap_empty (worklist))
6496 bb = (basic_block) fibheap_extract_min (worklist);
6497 RESET_BIT (in_worklist, bb->index);
6498 gcc_assert (!TEST_BIT (visited, bb->index));
6499 if (!TEST_BIT (visited, bb->index))
6503 int oldinsz, oldoutsz;
6505 SET_BIT (visited, bb->index);
6507 if (VTI (bb)->in.vars)
6510 -= (htab_size (shared_hash_htab (VTI (bb)->in.vars))
6511 + htab_size (shared_hash_htab (VTI (bb)->out.vars)));
6513 = htab_elements (shared_hash_htab (VTI (bb)->in.vars));
6515 = htab_elements (shared_hash_htab (VTI (bb)->out.vars));
6518 oldinsz = oldoutsz = 0;
6520 if (MAY_HAVE_DEBUG_INSNS)
6522 dataflow_set *in = &VTI (bb)->in, *first_out = NULL;
6523 bool first = true, adjust = false;
6525 /* Calculate the IN set as the intersection of
6526 predecessor OUT sets. */
6528 dataflow_set_clear (in);
6529 dst_can_be_shared = true;
6531 FOR_EACH_EDGE (e, ei, bb->preds)
6532 if (!VTI (e->src)->flooded)
6533 gcc_assert (bb_order[bb->index]
6534 <= bb_order[e->src->index]);
6537 dataflow_set_copy (in, &VTI (e->src)->out);
6538 first_out = &VTI (e->src)->out;
6543 dataflow_set_merge (in, &VTI (e->src)->out);
6549 dataflow_post_merge_adjust (in, &VTI (bb)->permp);
6551 /* Merge and merge_adjust should keep entries in
6553 htab_traverse (shared_hash_htab (in->vars),
6554 canonicalize_loc_order_check,
6557 if (dst_can_be_shared)
6559 shared_hash_destroy (in->vars);
6560 in->vars = shared_hash_copy (first_out->vars);
6564 VTI (bb)->flooded = true;
6568 /* Calculate the IN set as union of predecessor OUT sets. */
6569 dataflow_set_clear (&VTI (bb)->in);
6570 FOR_EACH_EDGE (e, ei, bb->preds)
6571 dataflow_set_union (&VTI (bb)->in, &VTI (e->src)->out);
6574 changed = compute_bb_dataflow (bb);
6575 htabsz += (htab_size (shared_hash_htab (VTI (bb)->in.vars))
6576 + htab_size (shared_hash_htab (VTI (bb)->out.vars)));
6578 if (htabmax && htabsz > htabmax)
6580 if (MAY_HAVE_DEBUG_INSNS)
6581 inform (DECL_SOURCE_LOCATION (cfun->decl),
6582 "variable tracking size limit exceeded with "
6583 "-fvar-tracking-assignments, retrying without");
6585 inform (DECL_SOURCE_LOCATION (cfun->decl),
6586 "variable tracking size limit exceeded");
6593 FOR_EACH_EDGE (e, ei, bb->succs)
6595 if (e->dest == EXIT_BLOCK_PTR)
6598 if (TEST_BIT (visited, e->dest->index))
6600 if (!TEST_BIT (in_pending, e->dest->index))
6602 /* Send E->DEST to next round. */
6603 SET_BIT (in_pending, e->dest->index);
6604 fibheap_insert (pending,
6605 bb_order[e->dest->index],
6609 else if (!TEST_BIT (in_worklist, e->dest->index))
6611 /* Add E->DEST to current round. */
6612 SET_BIT (in_worklist, e->dest->index);
6613 fibheap_insert (worklist, bb_order[e->dest->index],
6621 "BB %i: in %i (was %i), out %i (was %i), rem %i + %i, tsz %i\n",
6623 (int)htab_elements (shared_hash_htab (VTI (bb)->in.vars)),
6625 (int)htab_elements (shared_hash_htab (VTI (bb)->out.vars)),
6627 (int)worklist->nodes, (int)pending->nodes, htabsz);
6629 if (dump_file && (dump_flags & TDF_DETAILS))
6631 fprintf (dump_file, "BB %i IN:\n", bb->index);
6632 dump_dataflow_set (&VTI (bb)->in);
6633 fprintf (dump_file, "BB %i OUT:\n", bb->index);
6634 dump_dataflow_set (&VTI (bb)->out);
6640 if (success && MAY_HAVE_DEBUG_INSNS)
6642 gcc_assert (VTI (bb)->flooded);
6645 fibheap_delete (worklist);
6646 fibheap_delete (pending);
6647 sbitmap_free (visited);
6648 sbitmap_free (in_worklist);
6649 sbitmap_free (in_pending);
6651 timevar_pop (TV_VAR_TRACKING_DATAFLOW);
6655 /* Print the content of the LIST to dump file. */
6658 dump_attrs_list (attrs list)
6660 for (; list; list = list->next)
6662 if (dv_is_decl_p (list->dv))
6663 print_mem_expr (dump_file, dv_as_decl (list->dv));
6665 print_rtl_single (dump_file, dv_as_value (list->dv));
6666 fprintf (dump_file, "+" HOST_WIDE_INT_PRINT_DEC, list->offset);
6668 fprintf (dump_file, "\n");
6671 /* Print the information about variable *SLOT to dump file. */
6674 dump_var_slot (void **slot, void *data ATTRIBUTE_UNUSED)
6676 variable var = (variable) *slot;
6680 /* Continue traversing the hash table. */
6684 /* Print the information about variable VAR to dump file. */
6687 dump_var (variable var)
6690 location_chain node;
6692 if (dv_is_decl_p (var->dv))
6694 const_tree decl = dv_as_decl (var->dv);
6696 if (DECL_NAME (decl))
6698 fprintf (dump_file, " name: %s",
6699 IDENTIFIER_POINTER (DECL_NAME (decl)));
6700 if (dump_flags & TDF_UID)
6701 fprintf (dump_file, "D.%u", DECL_UID (decl));
6703 else if (TREE_CODE (decl) == DEBUG_EXPR_DECL)
6704 fprintf (dump_file, " name: D#%u", DEBUG_TEMP_UID (decl));
6706 fprintf (dump_file, " name: D.%u", DECL_UID (decl));
6707 fprintf (dump_file, "\n");
6711 fputc (' ', dump_file);
6712 print_rtl_single (dump_file, dv_as_value (var->dv));
6715 for (i = 0; i < var->n_var_parts; i++)
6717 fprintf (dump_file, " offset %ld\n",
6718 (long)(var->onepart ? 0 : VAR_PART_OFFSET (var, i)));
6719 for (node = var->var_part[i].loc_chain; node; node = node->next)
6721 fprintf (dump_file, " ");
6722 if (node->init == VAR_INIT_STATUS_UNINITIALIZED)
6723 fprintf (dump_file, "[uninit]");
6724 print_rtl_single (dump_file, node->loc);
6729 /* Print the information about variables from hash table VARS to dump file. */
6732 dump_vars (htab_t vars)
6734 if (htab_elements (vars) > 0)
6736 fprintf (dump_file, "Variables:\n");
6737 htab_traverse (vars, dump_var_slot, NULL);
6741 /* Print the dataflow set SET to dump file. */
6744 dump_dataflow_set (dataflow_set *set)
6748 fprintf (dump_file, "Stack adjustment: " HOST_WIDE_INT_PRINT_DEC "\n",
6750 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
6754 fprintf (dump_file, "Reg %d:", i);
6755 dump_attrs_list (set->regs[i]);
6758 dump_vars (shared_hash_htab (set->vars));
6759 fprintf (dump_file, "\n");
6762 /* Print the IN and OUT sets for each basic block to dump file. */
6765 dump_dataflow_sets (void)
6771 fprintf (dump_file, "\nBasic block %d:\n", bb->index);
6772 fprintf (dump_file, "IN:\n");
6773 dump_dataflow_set (&VTI (bb)->in);
6774 fprintf (dump_file, "OUT:\n");
6775 dump_dataflow_set (&VTI (bb)->out);
6779 /* Return the variable for DV in dropped_values, inserting one if
6780 requested with INSERT. */
6782 static inline variable
6783 variable_from_dropped (decl_or_value dv, enum insert_option insert)
6787 onepart_enum_t onepart;
6789 slot = htab_find_slot_with_hash (dropped_values, dv, dv_htab_hash (dv),
6796 return (variable) *slot;
6798 gcc_checking_assert (insert == INSERT);
6800 onepart = dv_onepart_p (dv);
6802 gcc_checking_assert (onepart == ONEPART_VALUE || onepart == ONEPART_DEXPR);
6804 empty_var = (variable) pool_alloc (onepart_pool (onepart));
6806 empty_var->refcount = 1;
6807 empty_var->n_var_parts = 0;
6808 empty_var->onepart = onepart;
6809 empty_var->in_changed_variables = false;
6810 empty_var->var_part[0].loc_chain = NULL;
6811 empty_var->var_part[0].cur_loc = NULL;
6812 VAR_LOC_1PAUX (empty_var) = NULL;
6813 set_dv_changed (dv, true);
6820 /* Recover the one-part aux from dropped_values. */
6822 static struct onepart_aux *
6823 recover_dropped_1paux (variable var)
6827 gcc_checking_assert (var->onepart);
6829 if (VAR_LOC_1PAUX (var))
6830 return VAR_LOC_1PAUX (var);
6832 if (var->onepart == ONEPART_VDECL)
6835 dvar = variable_from_dropped (var->dv, NO_INSERT);
6840 VAR_LOC_1PAUX (var) = VAR_LOC_1PAUX (dvar);
6841 VAR_LOC_1PAUX (dvar) = NULL;
6843 return VAR_LOC_1PAUX (var);
6846 /* Add variable VAR to the hash table of changed variables and
6847 if it has no locations delete it from SET's hash table. */
6850 variable_was_changed (variable var, dataflow_set *set)
6852 hashval_t hash = dv_htab_hash (var->dv);
6858 /* Remember this decl or VALUE has been added to changed_variables. */
6859 set_dv_changed (var->dv, true);
6861 slot = htab_find_slot_with_hash (changed_variables,
6867 variable old_var = (variable) *slot;
6868 gcc_assert (old_var->in_changed_variables);
6869 old_var->in_changed_variables = false;
6870 if (var != old_var && var->onepart)
6872 /* Restore the auxiliary info from an empty variable
6873 previously created for changed_variables, so it is
6875 gcc_checking_assert (!VAR_LOC_1PAUX (var));
6876 VAR_LOC_1PAUX (var) = VAR_LOC_1PAUX (old_var);
6877 VAR_LOC_1PAUX (old_var) = NULL;
6879 variable_htab_free (*slot);
6882 if (set && var->n_var_parts == 0)
6884 onepart_enum_t onepart = var->onepart;
6885 variable empty_var = NULL;
6886 void **dslot = NULL;
6888 if (onepart == ONEPART_VALUE || onepart == ONEPART_DEXPR)
6890 dslot = htab_find_slot_with_hash (dropped_values, var->dv,
6891 dv_htab_hash (var->dv),
6893 empty_var = (variable) *dslot;
6897 gcc_checking_assert (!empty_var->in_changed_variables);
6898 if (!VAR_LOC_1PAUX (var))
6900 VAR_LOC_1PAUX (var) = VAR_LOC_1PAUX (empty_var);
6901 VAR_LOC_1PAUX (empty_var) = NULL;
6904 gcc_checking_assert (!VAR_LOC_1PAUX (empty_var));
6910 empty_var = (variable) pool_alloc (onepart_pool (onepart));
6911 empty_var->dv = var->dv;
6912 empty_var->refcount = 1;
6913 empty_var->n_var_parts = 0;
6914 empty_var->onepart = onepart;
6917 empty_var->refcount++;
6922 empty_var->refcount++;
6923 empty_var->in_changed_variables = true;
6927 empty_var->var_part[0].loc_chain = NULL;
6928 empty_var->var_part[0].cur_loc = NULL;
6929 VAR_LOC_1PAUX (empty_var) = VAR_LOC_1PAUX (var);
6930 VAR_LOC_1PAUX (var) = NULL;
6936 if (var->onepart && !VAR_LOC_1PAUX (var))
6937 recover_dropped_1paux (var);
6939 var->in_changed_variables = true;
6946 if (var->n_var_parts == 0)
6951 slot = shared_hash_find_slot_noinsert (set->vars, var->dv);
6954 if (shared_hash_shared (set->vars))
6955 slot = shared_hash_find_slot_unshare (&set->vars, var->dv,
6957 htab_clear_slot (shared_hash_htab (set->vars), slot);
6963 /* Look for the index in VAR->var_part corresponding to OFFSET.
6964 Return -1 if not found. If INSERTION_POINT is non-NULL, the
6965 referenced int will be set to the index that the part has or should
6966 have, if it should be inserted. */
6969 find_variable_location_part (variable var, HOST_WIDE_INT offset,
6970 int *insertion_point)
6979 if (insertion_point)
6980 *insertion_point = 0;
6982 return var->n_var_parts - 1;
6985 /* Find the location part. */
6987 high = var->n_var_parts;
6990 pos = (low + high) / 2;
6991 if (VAR_PART_OFFSET (var, pos) < offset)
6998 if (insertion_point)
6999 *insertion_point = pos;
7001 if (pos < var->n_var_parts && VAR_PART_OFFSET (var, pos) == offset)
7008 set_slot_part (dataflow_set *set, rtx loc, void **slot,
7009 decl_or_value dv, HOST_WIDE_INT offset,
7010 enum var_init_status initialized, rtx set_src)
7013 location_chain node, next;
7014 location_chain *nextp;
7016 onepart_enum_t onepart;
7018 var = (variable) *slot;
7021 onepart = var->onepart;
7023 onepart = dv_onepart_p (dv);
7025 gcc_checking_assert (offset == 0 || !onepart);
7026 gcc_checking_assert (loc != dv_as_opaque (dv));
7028 if (! flag_var_tracking_uninit)
7029 initialized = VAR_INIT_STATUS_INITIALIZED;
7033 /* Create new variable information. */
7034 var = (variable) pool_alloc (onepart_pool (onepart));
7037 var->n_var_parts = 1;
7038 var->onepart = onepart;
7039 var->in_changed_variables = false;
7041 VAR_LOC_1PAUX (var) = NULL;
7043 VAR_PART_OFFSET (var, 0) = offset;
7044 var->var_part[0].loc_chain = NULL;
7045 var->var_part[0].cur_loc = NULL;
7048 nextp = &var->var_part[0].loc_chain;
7054 gcc_assert (dv_as_opaque (var->dv) == dv_as_opaque (dv));
7058 if (GET_CODE (loc) == VALUE)
7060 for (nextp = &var->var_part[0].loc_chain; (node = *nextp);
7061 nextp = &node->next)
7062 if (GET_CODE (node->loc) == VALUE)
7064 if (node->loc == loc)
7069 if (canon_value_cmp (node->loc, loc))
7077 else if (REG_P (node->loc) || MEM_P (node->loc))
7085 else if (REG_P (loc))
7087 for (nextp = &var->var_part[0].loc_chain; (node = *nextp);
7088 nextp = &node->next)
7089 if (REG_P (node->loc))
7091 if (REGNO (node->loc) < REGNO (loc))
7095 if (REGNO (node->loc) == REGNO (loc))
7108 else if (MEM_P (loc))
7110 for (nextp = &var->var_part[0].loc_chain; (node = *nextp);
7111 nextp = &node->next)
7112 if (REG_P (node->loc))
7114 else if (MEM_P (node->loc))
7116 if ((r = loc_cmp (XEXP (node->loc, 0), XEXP (loc, 0))) >= 0)
7128 for (nextp = &var->var_part[0].loc_chain; (node = *nextp);
7129 nextp = &node->next)
7130 if ((r = loc_cmp (node->loc, loc)) >= 0)
7138 if (shared_var_p (var, set->vars))
7140 slot = unshare_variable (set, slot, var, initialized);
7141 var = (variable)*slot;
7142 for (nextp = &var->var_part[0].loc_chain; c;
7143 nextp = &(*nextp)->next)
7145 gcc_assert ((!node && !*nextp) || node->loc == (*nextp)->loc);
7152 gcc_assert (dv_as_decl (var->dv) == dv_as_decl (dv));
7154 pos = find_variable_location_part (var, offset, &inspos);
7158 node = var->var_part[pos].loc_chain;
7161 && ((REG_P (node->loc) && REG_P (loc)
7162 && REGNO (node->loc) == REGNO (loc))
7163 || rtx_equal_p (node->loc, loc)))
7165 /* LOC is in the beginning of the chain so we have nothing
7167 if (node->init < initialized)
7168 node->init = initialized;
7169 if (set_src != NULL)
7170 node->set_src = set_src;
7176 /* We have to make a copy of a shared variable. */
7177 if (shared_var_p (var, set->vars))
7179 slot = unshare_variable (set, slot, var, initialized);
7180 var = (variable)*slot;
7186 /* We have not found the location part, new one will be created. */
7188 /* We have to make a copy of the shared variable. */
7189 if (shared_var_p (var, set->vars))
7191 slot = unshare_variable (set, slot, var, initialized);
7192 var = (variable)*slot;
7195 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
7196 thus there are at most MAX_VAR_PARTS different offsets. */
7197 gcc_assert (var->n_var_parts < MAX_VAR_PARTS
7198 && (!var->n_var_parts || !onepart));
7200 /* We have to move the elements of array starting at index
7201 inspos to the next position. */
7202 for (pos = var->n_var_parts; pos > inspos; pos--)
7203 var->var_part[pos] = var->var_part[pos - 1];
7206 gcc_checking_assert (!onepart);
7207 VAR_PART_OFFSET (var, pos) = offset;
7208 var->var_part[pos].loc_chain = NULL;
7209 var->var_part[pos].cur_loc = NULL;
7212 /* Delete the location from the list. */
7213 nextp = &var->var_part[pos].loc_chain;
7214 for (node = var->var_part[pos].loc_chain; node; node = next)
7217 if ((REG_P (node->loc) && REG_P (loc)
7218 && REGNO (node->loc) == REGNO (loc))
7219 || rtx_equal_p (node->loc, loc))
7221 /* Save these values, to assign to the new node, before
7222 deleting this one. */
7223 if (node->init > initialized)
7224 initialized = node->init;
7225 if (node->set_src != NULL && set_src == NULL)
7226 set_src = node->set_src;
7227 if (var->var_part[pos].cur_loc == node->loc)
7228 var->var_part[pos].cur_loc = NULL;
7229 pool_free (loc_chain_pool, node);
7234 nextp = &node->next;
7237 nextp = &var->var_part[pos].loc_chain;
7240 /* Add the location to the beginning. */
7241 node = (location_chain) pool_alloc (loc_chain_pool);
7243 node->init = initialized;
7244 node->set_src = set_src;
7245 node->next = *nextp;
7248 /* If no location was emitted do so. */
7249 if (var->var_part[pos].cur_loc == NULL)
7250 variable_was_changed (var, set);
7255 /* Set the part of variable's location in the dataflow set SET. The
7256 variable part is specified by variable's declaration in DV and
7257 offset OFFSET and the part's location by LOC. IOPT should be
7258 NO_INSERT if the variable is known to be in SET already and the
7259 variable hash table must not be resized, and INSERT otherwise. */
7262 set_variable_part (dataflow_set *set, rtx loc,
7263 decl_or_value dv, HOST_WIDE_INT offset,
7264 enum var_init_status initialized, rtx set_src,
7265 enum insert_option iopt)
7269 if (iopt == NO_INSERT)
7270 slot = shared_hash_find_slot_noinsert (set->vars, dv);
7273 slot = shared_hash_find_slot (set->vars, dv);
7275 slot = shared_hash_find_slot_unshare (&set->vars, dv, iopt);
7277 set_slot_part (set, loc, slot, dv, offset, initialized, set_src);
7280 /* Remove all recorded register locations for the given variable part
7281 from dataflow set SET, except for those that are identical to loc.
7282 The variable part is specified by variable's declaration or value
7283 DV and offset OFFSET. */
7286 clobber_slot_part (dataflow_set *set, rtx loc, void **slot,
7287 HOST_WIDE_INT offset, rtx set_src)
7289 variable var = (variable) *slot;
7290 int pos = find_variable_location_part (var, offset, NULL);
7294 location_chain node, next;
7296 /* Remove the register locations from the dataflow set. */
7297 next = var->var_part[pos].loc_chain;
7298 for (node = next; node; node = next)
7301 if (node->loc != loc
7302 && (!flag_var_tracking_uninit
7305 || !rtx_equal_p (set_src, node->set_src)))
7307 if (REG_P (node->loc))
7312 /* Remove the variable part from the register's
7313 list, but preserve any other variable parts
7314 that might be regarded as live in that same
7316 anextp = &set->regs[REGNO (node->loc)];
7317 for (anode = *anextp; anode; anode = anext)
7319 anext = anode->next;
7320 if (dv_as_opaque (anode->dv) == dv_as_opaque (var->dv)
7321 && anode->offset == offset)
7323 pool_free (attrs_pool, anode);
7327 anextp = &anode->next;
7331 slot = delete_slot_part (set, node->loc, slot, offset);
7339 /* Remove all recorded register locations for the given variable part
7340 from dataflow set SET, except for those that are identical to loc.
7341 The variable part is specified by variable's declaration or value
7342 DV and offset OFFSET. */
7345 clobber_variable_part (dataflow_set *set, rtx loc, decl_or_value dv,
7346 HOST_WIDE_INT offset, rtx set_src)
7350 if (!dv_as_opaque (dv)
7351 || (!dv_is_value_p (dv) && ! DECL_P (dv_as_decl (dv))))
7354 slot = shared_hash_find_slot_noinsert (set->vars, dv);
7358 clobber_slot_part (set, loc, slot, offset, set_src);
7361 /* Delete the part of variable's location from dataflow set SET. The
7362 variable part is specified by its SET->vars slot SLOT and offset
7363 OFFSET and the part's location by LOC. */
7366 delete_slot_part (dataflow_set *set, rtx loc, void **slot,
7367 HOST_WIDE_INT offset)
7369 variable var = (variable) *slot;
7370 int pos = find_variable_location_part (var, offset, NULL);
7374 location_chain node, next;
7375 location_chain *nextp;
7379 if (shared_var_p (var, set->vars))
7381 /* If the variable contains the location part we have to
7382 make a copy of the variable. */
7383 for (node = var->var_part[pos].loc_chain; node;
7386 if ((REG_P (node->loc) && REG_P (loc)
7387 && REGNO (node->loc) == REGNO (loc))
7388 || rtx_equal_p (node->loc, loc))
7390 slot = unshare_variable (set, slot, var,
7391 VAR_INIT_STATUS_UNKNOWN);
7392 var = (variable)*slot;
7398 if (pos == 0 && var->onepart && VAR_LOC_1PAUX (var))
7399 cur_loc = VAR_LOC_FROM (var);
7401 cur_loc = var->var_part[pos].cur_loc;
7403 /* Delete the location part. */
7405 nextp = &var->var_part[pos].loc_chain;
7406 for (node = *nextp; node; node = next)
7409 if ((REG_P (node->loc) && REG_P (loc)
7410 && REGNO (node->loc) == REGNO (loc))
7411 || rtx_equal_p (node->loc, loc))
7413 /* If we have deleted the location which was last emitted
7414 we have to emit new location so add the variable to set
7415 of changed variables. */
7416 if (cur_loc == node->loc)
7419 var->var_part[pos].cur_loc = NULL;
7420 if (pos == 0 && var->onepart && VAR_LOC_1PAUX (var))
7421 VAR_LOC_FROM (var) = NULL;
7423 pool_free (loc_chain_pool, node);
7428 nextp = &node->next;
7431 if (var->var_part[pos].loc_chain == NULL)
7435 while (pos < var->n_var_parts)
7437 var->var_part[pos] = var->var_part[pos + 1];
7442 variable_was_changed (var, set);
7448 /* Delete the part of variable's location from dataflow set SET. The
7449 variable part is specified by variable's declaration or value DV
7450 and offset OFFSET and the part's location by LOC. */
7453 delete_variable_part (dataflow_set *set, rtx loc, decl_or_value dv,
7454 HOST_WIDE_INT offset)
7456 void **slot = shared_hash_find_slot_noinsert (set->vars, dv);
7460 delete_slot_part (set, loc, slot, offset);
7463 DEF_VEC_P (variable);
7464 DEF_VEC_ALLOC_P (variable, heap);
7466 DEF_VEC_ALLOC_P_STACK (rtx);
7467 #define VEC_rtx_stack_alloc(alloc) VEC_stack_alloc (rtx, alloc)
7469 /* Structure for passing some other parameters to function
7470 vt_expand_loc_callback. */
7471 struct expand_loc_callback_data
7473 /* The variables and values active at this point. */
7476 /* Stack of values and debug_exprs under expansion, and their
7478 VEC (rtx, stack) *expanding;
7480 /* Stack of values and debug_exprs whose expansion hit recursion
7481 cycles. They will have VALUE_RECURSED_INTO marked when added to
7482 this list. This flag will be cleared if any of its dependencies
7483 resolves to a valid location. So, if the flag remains set at the
7484 end of the search, we know no valid location for this one can
7486 VEC (rtx, stack) *pending;
7488 /* The maximum depth among the sub-expressions under expansion.
7489 Zero indicates no expansion so far. */
7493 /* Allocate the one-part auxiliary data structure for VAR, with enough
7494 room for COUNT dependencies. */
7497 loc_exp_dep_alloc (variable var, int count)
7501 gcc_checking_assert (var->onepart);
7503 /* We can be called with COUNT == 0 to allocate the data structure
7504 without any dependencies, e.g. for the backlinks only. However,
7505 if we are specifying a COUNT, then the dependency list must have
7506 been emptied before. It would be possible to adjust pointers or
7507 force it empty here, but this is better done at an earlier point
7508 in the algorithm, so we instead leave an assertion to catch
7510 gcc_checking_assert (!count
7511 || VEC_empty (loc_exp_dep, VAR_LOC_DEP_VEC (var)));
7513 if (VAR_LOC_1PAUX (var)
7514 && VEC_space (loc_exp_dep, VAR_LOC_DEP_VEC (var), count))
7517 allocsize = offsetof (struct onepart_aux, deps)
7518 + VEC_embedded_size (loc_exp_dep, count);
7520 if (VAR_LOC_1PAUX (var))
7522 VAR_LOC_1PAUX (var) = XRESIZEVAR (struct onepart_aux,
7523 VAR_LOC_1PAUX (var), allocsize);
7524 /* If the reallocation moves the onepaux structure, the
7525 back-pointer to BACKLINKS in the first list member will still
7526 point to its old location. Adjust it. */
7527 if (VAR_LOC_DEP_LST (var))
7528 VAR_LOC_DEP_LST (var)->pprev = VAR_LOC_DEP_LSTP (var);
7532 VAR_LOC_1PAUX (var) = XNEWVAR (struct onepart_aux, allocsize);
7533 *VAR_LOC_DEP_LSTP (var) = NULL;
7534 VAR_LOC_FROM (var) = NULL;
7535 VAR_LOC_DEPTH (var) = 0;
7537 VEC_embedded_init (loc_exp_dep, VAR_LOC_DEP_VEC (var), count);
7540 /* Remove all entries from the vector of active dependencies of VAR,
7541 removing them from the back-links lists too. */
7544 loc_exp_dep_clear (variable var)
7546 while (!VEC_empty (loc_exp_dep, VAR_LOC_DEP_VEC (var)))
7548 loc_exp_dep *led = VEC_last (loc_exp_dep, VAR_LOC_DEP_VEC (var));
7550 led->next->pprev = led->pprev;
7552 *led->pprev = led->next;
7553 VEC_pop (loc_exp_dep, VAR_LOC_DEP_VEC (var));
7557 /* Insert an active dependency from VAR on X to the vector of
7558 dependencies, and add the corresponding back-link to X's list of
7559 back-links in VARS. */
7562 loc_exp_insert_dep (variable var, rtx x, htab_t vars)
7568 dv = dv_from_rtx (x);
7570 /* ??? Build a vector of variables parallel to EXPANDING, to avoid
7571 an additional look up? */
7572 xvar = (variable) htab_find_with_hash (vars, dv, dv_htab_hash (dv));
7576 xvar = variable_from_dropped (dv, NO_INSERT);
7577 gcc_checking_assert (xvar);
7580 /* No point in adding the same backlink more than once. This may
7581 arise if say the same value appears in two complex expressions in
7582 the same loc_list, or even more than once in a single
7584 if (VAR_LOC_DEP_LST (xvar) && VAR_LOC_DEP_LST (xvar)->dv == var->dv)
7587 VEC_quick_push (loc_exp_dep, VAR_LOC_DEP_VEC (var), NULL);
7588 led = VEC_last (loc_exp_dep, VAR_LOC_DEP_VEC (var));
7592 loc_exp_dep_alloc (xvar, 0);
7593 led->pprev = VAR_LOC_DEP_LSTP (xvar);
7594 led->next = *led->pprev;
7596 led->next->pprev = &led->next;
7600 /* Create active dependencies of VAR on COUNT values starting at
7601 VALUE, and corresponding back-links to the entries in VARS. Return
7602 true if we found any pending-recursion results. */
7605 loc_exp_dep_set (variable var, rtx result, rtx *value, int count, htab_t vars)
7607 bool pending_recursion = false;
7609 gcc_checking_assert (VEC_empty (loc_exp_dep, VAR_LOC_DEP_VEC (var)));
7611 /* Set up all dependencies from last_child (as set up at the end of
7612 the loop above) to the end. */
7613 loc_exp_dep_alloc (var, count);
7619 if (!pending_recursion)
7620 pending_recursion = !result && VALUE_RECURSED_INTO (x);
7622 loc_exp_insert_dep (var, x, vars);
7625 return pending_recursion;
7628 /* Notify the back-links of IVAR that are pending recursion that we
7629 have found a non-NIL value for it, so they are cleared for another
7630 attempt to compute a current location. */
7633 notify_dependents_of_resolved_value (variable ivar, htab_t vars)
7635 loc_exp_dep *led, *next;
7637 for (led = VAR_LOC_DEP_LST (ivar); led; led = next)
7639 decl_or_value dv = led->dv;
7644 if (dv_is_value_p (dv))
7646 rtx value = dv_as_value (dv);
7648 /* If we have already resolved it, leave it alone. */
7649 if (!VALUE_RECURSED_INTO (value))
7652 /* Check that VALUE_RECURSED_INTO, true from the test above,
7653 implies NO_LOC_P. */
7654 gcc_checking_assert (NO_LOC_P (value));
7656 /* We won't notify variables that are being expanded,
7657 because their dependency list is cleared before
7659 NO_LOC_P (value) = false;
7660 VALUE_RECURSED_INTO (value) = false;
7662 gcc_checking_assert (dv_changed_p (dv));
7664 else if (!dv_changed_p (dv))
7667 var = (variable) htab_find_with_hash (vars, dv, dv_htab_hash (dv));
7670 var = variable_from_dropped (dv, NO_INSERT);
7673 notify_dependents_of_resolved_value (var, vars);
7676 next->pprev = led->pprev;
7684 static rtx vt_expand_loc_callback (rtx x, bitmap regs,
7685 int max_depth, void *data);
7687 /* Return the combined depth, when one sub-expression evaluated to
7688 BEST_DEPTH and the previous known depth was SAVED_DEPTH. */
7691 update_depth (int saved_depth, int best_depth)
7693 /* If we didn't find anything, stick with what we had. */
7697 /* If we found hadn't found anything, use the depth of the current
7698 expression. Do NOT add one extra level, we want to compute the
7699 maximum depth among sub-expressions. We'll increment it later,
7704 if (saved_depth < best_depth)
7710 /* Expand VAR to a location RTX, updating its cur_loc. Use REGS and
7711 DATA for cselib expand callback. If PENDRECP is given, indicate in
7712 it whether any sub-expression couldn't be fully evaluated because
7713 it is pending recursion resolution. */
7716 vt_expand_var_loc_chain (variable var, bitmap regs, void *data, bool *pendrecp)
7718 struct expand_loc_callback_data *elcd
7719 = (struct expand_loc_callback_data *) data;
7720 location_chain loc, next;
7722 int first_child, result_first_child, last_child;
7723 bool pending_recursion;
7724 rtx loc_from = NULL;
7725 struct elt_loc_list *cloc = NULL;
7726 int depth = 0, saved_depth = elcd->depth;
7728 /* Clear all backlinks pointing at this, so that we're not notified
7729 while we're active. */
7730 loc_exp_dep_clear (var);
7732 if (var->onepart == ONEPART_VALUE)
7734 cselib_val *val = CSELIB_VAL_PTR (dv_as_value (var->dv));
7736 gcc_checking_assert (cselib_preserved_value_p (val));
7741 first_child = result_first_child = last_child
7742 = VEC_length (rtx, elcd->expanding);
7744 /* Attempt to expand each available location in turn. */
7745 for (next = loc = var->n_var_parts ? var->var_part[0].loc_chain : NULL;
7746 loc || cloc; loc = next)
7748 result_first_child = last_child;
7750 if (!loc || (GET_CODE (loc->loc) == ENTRY_VALUE && cloc))
7752 loc_from = cloc->loc;
7755 if (unsuitable_loc (loc_from))
7760 loc_from = loc->loc;
7764 gcc_checking_assert (!unsuitable_loc (loc_from));
7767 result = cselib_expand_value_rtx_cb (loc_from, regs, EXPR_DEPTH,
7768 vt_expand_loc_callback, data);
7769 last_child = VEC_length (rtx, elcd->expanding);
7773 depth = elcd->depth;
7775 gcc_checking_assert (depth || result_first_child == last_child);
7777 if (last_child - result_first_child != 1)
7780 if (depth <= EXPR_USE_DEPTH)
7786 /* Set it up in case we leave the loop. */
7789 result_first_child = first_child;
7792 /* Register all encountered dependencies as active. */
7793 pending_recursion = loc_exp_dep_set
7794 (var, result, VEC_address (rtx, elcd->expanding) + result_first_child,
7795 last_child - result_first_child, elcd->vars);
7797 VEC_truncate (rtx, elcd->expanding, first_child);
7799 /* Record where the expansion came from. */
7800 gcc_checking_assert (!result || !pending_recursion);
7801 VAR_LOC_FROM (var) = loc_from;
7802 VAR_LOC_DEPTH (var) = depth;
7804 gcc_checking_assert (!depth == !result);
7806 elcd->depth = update_depth (saved_depth, depth);
7808 /* Indicate whether any of the dependencies are pending recursion
7811 *pendrecp = pending_recursion;
7813 if (!pendrecp || !pending_recursion)
7814 var->var_part[0].cur_loc = result;
7819 /* Callback for cselib_expand_value, that looks for expressions
7820 holding the value in the var-tracking hash tables. Return X for
7821 standard processing, anything else is to be used as-is. */
7824 vt_expand_loc_callback (rtx x, bitmap regs,
7825 int max_depth ATTRIBUTE_UNUSED,
7828 struct expand_loc_callback_data *elcd
7829 = (struct expand_loc_callback_data *) data;
7833 bool pending_recursion = false;
7834 bool from_empty = false;
7836 switch (GET_CODE (x))
7839 subreg = cselib_expand_value_rtx_cb (SUBREG_REG (x), regs,
7841 vt_expand_loc_callback, data);
7846 result = simplify_gen_subreg (GET_MODE (x), subreg,
7847 GET_MODE (SUBREG_REG (x)),
7850 /* Invalid SUBREGs are ok in debug info. ??? We could try
7851 alternate expansions for the VALUE as well. */
7853 result = gen_rtx_raw_SUBREG (GET_MODE (x), subreg, SUBREG_BYTE (x));
7859 dv = dv_from_rtx (x);
7866 VEC_safe_push (rtx, stack, elcd->expanding, x);
7868 /* Check that VALUE_RECURSED_INTO implies NO_LOC_P. */
7869 gcc_checking_assert (!VALUE_RECURSED_INTO (x) || NO_LOC_P (x));
7873 gcc_checking_assert (VALUE_RECURSED_INTO (x) || !dv_changed_p (dv));
7877 var = (variable) htab_find_with_hash (elcd->vars, dv, dv_htab_hash (dv));
7882 var = variable_from_dropped (dv, INSERT);
7885 gcc_checking_assert (var);
7887 if (!dv_changed_p (dv))
7889 gcc_checking_assert (!NO_LOC_P (x));
7890 gcc_checking_assert (var->var_part[0].cur_loc);
7891 gcc_checking_assert (VAR_LOC_1PAUX (var));
7892 gcc_checking_assert (VAR_LOC_1PAUX (var)->depth);
7894 elcd->depth = update_depth (elcd->depth, VAR_LOC_1PAUX (var)->depth);
7896 return var->var_part[0].cur_loc;
7899 VALUE_RECURSED_INTO (x) = true;
7900 /* This is tentative, but it makes some tests simpler. */
7901 NO_LOC_P (x) = true;
7903 gcc_checking_assert (var->n_var_parts == 1 || from_empty);
7905 result = vt_expand_var_loc_chain (var, regs, data, &pending_recursion);
7907 if (pending_recursion)
7909 gcc_checking_assert (!result);
7910 VEC_safe_push (rtx, stack, elcd->pending, x);
7914 NO_LOC_P (x) = !result;
7915 VALUE_RECURSED_INTO (x) = false;
7916 set_dv_changed (dv, false);
7919 notify_dependents_of_resolved_value (var, elcd->vars);
7925 /* While expanding variables, we may encounter recursion cycles
7926 because of mutual (possibly indirect) dependencies between two
7927 particular variables (or values), say A and B. If we're trying to
7928 expand A when we get to B, which in turn attempts to expand A, if
7929 we can't find any other expansion for B, we'll add B to this
7930 pending-recursion stack, and tentatively return NULL for its
7931 location. This tentative value will be used for any other
7932 occurrences of B, unless A gets some other location, in which case
7933 it will notify B that it is worth another try at computing a
7934 location for it, and it will use the location computed for A then.
7935 At the end of the expansion, the tentative NULL locations become
7936 final for all members of PENDING that didn't get a notification.
7937 This function performs this finalization of NULL locations. */
7940 resolve_expansions_pending_recursion (VEC (rtx, stack) *pending)
7942 while (!VEC_empty (rtx, pending))
7944 rtx x = VEC_pop (rtx, pending);
7947 if (!VALUE_RECURSED_INTO (x))
7950 gcc_checking_assert (NO_LOC_P (x));
7951 VALUE_RECURSED_INTO (x) = false;
7952 dv = dv_from_rtx (x);
7953 gcc_checking_assert (dv_changed_p (dv));
7954 set_dv_changed (dv, false);
7958 /* Initialize expand_loc_callback_data D with variable hash table V.
7959 It must be a macro because of alloca (VEC stack). */
7960 #define INIT_ELCD(d, v) \
7964 (d).expanding = VEC_alloc (rtx, stack, 4); \
7965 (d).pending = VEC_alloc (rtx, stack, 4); \
7969 /* Finalize expand_loc_callback_data D, resolved to location L. */
7970 #define FINI_ELCD(d, l) \
7973 resolve_expansions_pending_recursion ((d).pending); \
7974 VEC_free (rtx, stack, (d).pending); \
7975 VEC_free (rtx, stack, (d).expanding); \
7977 if ((l) && MEM_P (l)) \
7978 (l) = targetm.delegitimize_address (l); \
7982 /* Expand VALUEs and DEBUG_EXPRs in LOC to a location, using the
7983 equivalences in VARS, updating their CUR_LOCs in the process. */
7986 vt_expand_loc (rtx loc, htab_t vars)
7988 struct expand_loc_callback_data data;
7991 if (!MAY_HAVE_DEBUG_INSNS)
7994 INIT_ELCD (data, vars);
7996 result = cselib_expand_value_rtx_cb (loc, scratch_regs, EXPR_DEPTH,
7997 vt_expand_loc_callback, &data);
7999 FINI_ELCD (data, result);
8004 /* Expand the one-part VARiable to a location, using the equivalences
8005 in VARS, updating their CUR_LOCs in the process. */
8008 vt_expand_1pvar (variable var, htab_t vars)
8010 struct expand_loc_callback_data data;
8013 gcc_checking_assert (var->onepart && var->n_var_parts == 1);
8015 if (!dv_changed_p (var->dv))
8016 return var->var_part[0].cur_loc;
8018 INIT_ELCD (data, vars);
8020 loc = vt_expand_var_loc_chain (var, scratch_regs, &data, NULL);
8022 gcc_checking_assert (VEC_empty (rtx, data.expanding));
8024 FINI_ELCD (data, loc);
8029 /* Emit the NOTE_INSN_VAR_LOCATION for variable *VARP. DATA contains
8030 additional parameters: WHERE specifies whether the note shall be emitted
8031 before or after instruction INSN. */
8034 emit_note_insn_var_location (void **varp, void *data)
8036 variable var = (variable) *varp;
8037 rtx insn = ((emit_note_data *)data)->insn;
8038 enum emit_note_where where = ((emit_note_data *)data)->where;
8039 htab_t vars = ((emit_note_data *)data)->vars;
8041 int i, j, n_var_parts;
8043 enum var_init_status initialized = VAR_INIT_STATUS_UNINITIALIZED;
8044 HOST_WIDE_INT last_limit;
8045 tree type_size_unit;
8046 HOST_WIDE_INT offsets[MAX_VAR_PARTS];
8047 rtx loc[MAX_VAR_PARTS];
8051 gcc_checking_assert (var->onepart == NOT_ONEPART
8052 || var->onepart == ONEPART_VDECL);
8054 decl = dv_as_decl (var->dv);
8060 for (i = 0; i < var->n_var_parts; i++)
8061 if (var->var_part[i].cur_loc == NULL && var->var_part[i].loc_chain)
8062 var->var_part[i].cur_loc = var->var_part[i].loc_chain->loc;
8063 for (i = 0; i < var->n_var_parts; i++)
8065 enum machine_mode mode, wider_mode;
8067 HOST_WIDE_INT offset;
8069 if (i == 0 && var->onepart)
8071 gcc_checking_assert (var->n_var_parts == 1);
8073 initialized = VAR_INIT_STATUS_INITIALIZED;
8074 loc2 = vt_expand_1pvar (var, vars);
8078 if (last_limit < VAR_PART_OFFSET (var, i))
8083 else if (last_limit > VAR_PART_OFFSET (var, i))
8085 offset = VAR_PART_OFFSET (var, i);
8086 if (!var->var_part[i].cur_loc)
8091 for (lc = var->var_part[i].loc_chain; lc; lc = lc->next)
8092 if (var->var_part[i].cur_loc == lc->loc)
8094 initialized = lc->init;
8098 loc2 = var->var_part[i].cur_loc;
8101 offsets[n_var_parts] = offset;
8107 loc[n_var_parts] = loc2;
8108 mode = GET_MODE (var->var_part[i].cur_loc);
8109 if (mode == VOIDmode && var->onepart)
8110 mode = DECL_MODE (decl);
8111 last_limit = offsets[n_var_parts] + GET_MODE_SIZE (mode);
8113 /* Attempt to merge adjacent registers or memory. */
8114 wider_mode = GET_MODE_WIDER_MODE (mode);
8115 for (j = i + 1; j < var->n_var_parts; j++)
8116 if (last_limit <= VAR_PART_OFFSET (var, j))
8118 if (j < var->n_var_parts
8119 && wider_mode != VOIDmode
8120 && var->var_part[j].cur_loc
8121 && mode == GET_MODE (var->var_part[j].cur_loc)
8122 && (REG_P (loc[n_var_parts]) || MEM_P (loc[n_var_parts]))
8123 && last_limit == (var->onepart ? 0 : VAR_PART_OFFSET (var, j))
8124 && (loc2 = vt_expand_loc (var->var_part[j].cur_loc, vars))
8125 && GET_CODE (loc[n_var_parts]) == GET_CODE (loc2))
8129 if (REG_P (loc[n_var_parts])
8130 && hard_regno_nregs[REGNO (loc[n_var_parts])][mode] * 2
8131 == hard_regno_nregs[REGNO (loc[n_var_parts])][wider_mode]
8132 && end_hard_regno (mode, REGNO (loc[n_var_parts]))
8135 if (! WORDS_BIG_ENDIAN && ! BYTES_BIG_ENDIAN)
8136 new_loc = simplify_subreg (wider_mode, loc[n_var_parts],
8138 else if (WORDS_BIG_ENDIAN && BYTES_BIG_ENDIAN)
8139 new_loc = simplify_subreg (wider_mode, loc2, mode, 0);
8142 if (!REG_P (new_loc)
8143 || REGNO (new_loc) != REGNO (loc[n_var_parts]))
8146 REG_ATTRS (new_loc) = REG_ATTRS (loc[n_var_parts]);
8149 else if (MEM_P (loc[n_var_parts])
8150 && GET_CODE (XEXP (loc2, 0)) == PLUS
8151 && REG_P (XEXP (XEXP (loc2, 0), 0))
8152 && CONST_INT_P (XEXP (XEXP (loc2, 0), 1)))
8154 if ((REG_P (XEXP (loc[n_var_parts], 0))
8155 && rtx_equal_p (XEXP (loc[n_var_parts], 0),
8156 XEXP (XEXP (loc2, 0), 0))
8157 && INTVAL (XEXP (XEXP (loc2, 0), 1))
8158 == GET_MODE_SIZE (mode))
8159 || (GET_CODE (XEXP (loc[n_var_parts], 0)) == PLUS
8160 && CONST_INT_P (XEXP (XEXP (loc[n_var_parts], 0), 1))
8161 && rtx_equal_p (XEXP (XEXP (loc[n_var_parts], 0), 0),
8162 XEXP (XEXP (loc2, 0), 0))
8163 && INTVAL (XEXP (XEXP (loc[n_var_parts], 0), 1))
8164 + GET_MODE_SIZE (mode)
8165 == INTVAL (XEXP (XEXP (loc2, 0), 1))))
8166 new_loc = adjust_address_nv (loc[n_var_parts],
8172 loc[n_var_parts] = new_loc;
8174 last_limit = offsets[n_var_parts] + GET_MODE_SIZE (mode);
8180 type_size_unit = TYPE_SIZE_UNIT (TREE_TYPE (decl));
8181 if ((unsigned HOST_WIDE_INT) last_limit < TREE_INT_CST_LOW (type_size_unit))
8184 if (! flag_var_tracking_uninit)
8185 initialized = VAR_INIT_STATUS_INITIALIZED;
8189 note_vl = gen_rtx_VAR_LOCATION (VOIDmode, decl, NULL_RTX,
8191 else if (n_var_parts == 1)
8195 if (offsets[0] || GET_CODE (loc[0]) == PARALLEL)
8196 expr_list = gen_rtx_EXPR_LIST (VOIDmode, loc[0], GEN_INT (offsets[0]));
8200 note_vl = gen_rtx_VAR_LOCATION (VOIDmode, decl, expr_list,
8203 else if (n_var_parts)
8207 for (i = 0; i < n_var_parts; i++)
8209 = gen_rtx_EXPR_LIST (VOIDmode, loc[i], GEN_INT (offsets[i]));
8211 parallel = gen_rtx_PARALLEL (VOIDmode,
8212 gen_rtvec_v (n_var_parts, loc));
8213 note_vl = gen_rtx_VAR_LOCATION (VOIDmode, decl,
8214 parallel, (int) initialized);
8217 if (where != EMIT_NOTE_BEFORE_INSN)
8219 note = emit_note_after (NOTE_INSN_VAR_LOCATION, insn);
8220 if (where == EMIT_NOTE_AFTER_CALL_INSN)
8221 NOTE_DURING_CALL_P (note) = true;
8225 /* Make sure that the call related notes come first. */
8226 while (NEXT_INSN (insn)
8228 && ((NOTE_KIND (insn) == NOTE_INSN_VAR_LOCATION
8229 && NOTE_DURING_CALL_P (insn))
8230 || NOTE_KIND (insn) == NOTE_INSN_CALL_ARG_LOCATION))
8231 insn = NEXT_INSN (insn);
8233 && ((NOTE_KIND (insn) == NOTE_INSN_VAR_LOCATION
8234 && NOTE_DURING_CALL_P (insn))
8235 || NOTE_KIND (insn) == NOTE_INSN_CALL_ARG_LOCATION))
8236 note = emit_note_after (NOTE_INSN_VAR_LOCATION, insn);
8238 note = emit_note_before (NOTE_INSN_VAR_LOCATION, insn);
8240 NOTE_VAR_LOCATION (note) = note_vl;
8242 set_dv_changed (var->dv, false);
8243 gcc_assert (var->in_changed_variables);
8244 var->in_changed_variables = false;
8245 htab_clear_slot (changed_variables, varp);
8247 /* Continue traversing the hash table. */
8251 /* While traversing changed_variables, push onto DATA (a stack of RTX
8252 values) entries that aren't user variables. */
8255 values_to_stack (void **slot, void *data)
8257 VEC (rtx, stack) **changed_values_stack = (VEC (rtx, stack) **)data;
8258 variable var = (variable) *slot;
8260 if (var->onepart == ONEPART_VALUE)
8261 VEC_safe_push (rtx, stack, *changed_values_stack, dv_as_value (var->dv));
8262 else if (var->onepart == ONEPART_DEXPR)
8263 VEC_safe_push (rtx, stack, *changed_values_stack,
8264 DECL_RTL_KNOWN_SET (dv_as_decl (var->dv)));
8269 /* Remove from changed_variables the entry whose DV corresponds to
8270 value or debug_expr VAL. */
8272 remove_value_from_changed_variables (rtx val)
8274 decl_or_value dv = dv_from_rtx (val);
8278 slot = htab_find_slot_with_hash (changed_variables,
8279 dv, dv_htab_hash (dv), NO_INSERT);
8280 var = (variable) *slot;
8281 var->in_changed_variables = false;
8282 htab_clear_slot (changed_variables, slot);
8285 /* If VAL (a value or debug_expr) has backlinks to variables actively
8286 dependent on it in HTAB or in CHANGED_VARIABLES, mark them as
8287 changed, adding to CHANGED_VALUES_STACK any dependencies that may
8288 have dependencies of their own to notify. */
8291 notify_dependents_of_changed_value (rtx val, htab_t htab,
8292 VEC (rtx, stack) **changed_values_stack)
8297 decl_or_value dv = dv_from_rtx (val);
8299 slot = htab_find_slot_with_hash (changed_variables,
8300 dv, dv_htab_hash (dv), NO_INSERT);
8302 slot = htab_find_slot_with_hash (htab,
8303 dv, dv_htab_hash (dv), NO_INSERT);
8305 slot = htab_find_slot_with_hash (dropped_values,
8306 dv, dv_htab_hash (dv), NO_INSERT);
8307 var = (variable) *slot;
8309 while ((led = VAR_LOC_DEP_LST (var)))
8311 decl_or_value ldv = led->dv;
8315 /* Deactivate and remove the backlink, as it was “used up”. It
8316 makes no sense to attempt to notify the same entity again:
8317 either it will be recomputed and re-register an active
8318 dependency, or it will still have the changed mark. */
8320 led->next->pprev = led->pprev;
8322 *led->pprev = led->next;
8326 if (dv_changed_p (ldv))
8329 switch (dv_onepart_p (ldv))
8333 set_dv_changed (ldv, true);
8334 VEC_safe_push (rtx, stack, *changed_values_stack, dv_as_rtx (ldv));
8338 islot = htab_find_slot_with_hash (htab, ldv, dv_htab_hash (ldv),
8340 ivar = (variable) *islot;
8341 gcc_checking_assert (!VAR_LOC_DEP_LST (ivar));
8342 variable_was_changed (ivar, NULL);
8348 /* Take out of changed_variables any entries that don't refer to use
8349 variables. Back-propagate change notifications from values and
8350 debug_exprs to their active dependencies in HTAB or in
8351 CHANGED_VARIABLES. */
8354 process_changed_values (htab_t htab)
8358 VEC (rtx, stack) *changed_values_stack = VEC_alloc (rtx, stack, 20);
8360 /* Move values from changed_variables to changed_values_stack. */
8361 htab_traverse (changed_variables, values_to_stack, &changed_values_stack);
8363 /* Back-propagate change notifications in values while popping
8364 them from the stack. */
8365 for (n = i = VEC_length (rtx, changed_values_stack);
8366 i > 0; i = VEC_length (rtx, changed_values_stack))
8368 val = VEC_pop (rtx, changed_values_stack);
8369 notify_dependents_of_changed_value (val, htab, &changed_values_stack);
8371 /* This condition will hold when visiting each of the entries
8372 originally in changed_variables. We can't remove them
8373 earlier because this could drop the backlinks before we got a
8374 chance to use them. */
8377 remove_value_from_changed_variables (val);
8382 VEC_free (rtx, stack, changed_values_stack);
8385 /* Emit NOTE_INSN_VAR_LOCATION note for each variable from a chain
8386 CHANGED_VARIABLES and delete this chain. WHERE specifies whether
8387 the notes shall be emitted before of after instruction INSN. */
8390 emit_notes_for_changes (rtx insn, enum emit_note_where where,
8393 emit_note_data data;
8394 htab_t htab = shared_hash_htab (vars);
8396 if (!htab_elements (changed_variables))
8399 if (MAY_HAVE_DEBUG_INSNS)
8400 process_changed_values (htab);
8406 htab_traverse (changed_variables, emit_note_insn_var_location, &data);
8409 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it differs from the
8410 same variable in hash table DATA or is not there at all. */
8413 emit_notes_for_differences_1 (void **slot, void *data)
8415 htab_t new_vars = (htab_t) data;
8416 variable old_var, new_var;
8418 old_var = (variable) *slot;
8419 new_var = (variable) htab_find_with_hash (new_vars, old_var->dv,
8420 dv_htab_hash (old_var->dv));
8424 /* Variable has disappeared. */
8425 variable empty_var = NULL;
8427 if (old_var->onepart == ONEPART_VALUE
8428 || old_var->onepart == ONEPART_DEXPR)
8430 empty_var = variable_from_dropped (old_var->dv, NO_INSERT);
8433 gcc_checking_assert (!empty_var->in_changed_variables);
8434 if (!VAR_LOC_1PAUX (old_var))
8436 VAR_LOC_1PAUX (old_var) = VAR_LOC_1PAUX (empty_var);
8437 VAR_LOC_1PAUX (empty_var) = NULL;
8440 gcc_checking_assert (!VAR_LOC_1PAUX (empty_var));
8446 empty_var = (variable) pool_alloc (onepart_pool (old_var->onepart));
8447 empty_var->dv = old_var->dv;
8448 empty_var->refcount = 0;
8449 empty_var->n_var_parts = 0;
8450 empty_var->onepart = old_var->onepart;
8451 empty_var->in_changed_variables = false;
8454 if (empty_var->onepart)
8456 /* Propagate the auxiliary data to (ultimately)
8457 changed_variables. */
8458 empty_var->var_part[0].loc_chain = NULL;
8459 empty_var->var_part[0].cur_loc = NULL;
8460 VAR_LOC_1PAUX (empty_var) = VAR_LOC_1PAUX (old_var);
8461 VAR_LOC_1PAUX (old_var) = NULL;
8463 variable_was_changed (empty_var, NULL);
8464 /* Continue traversing the hash table. */
8467 /* Update cur_loc and one-part auxiliary data, before new_var goes
8468 through variable_was_changed. */
8469 if (old_var != new_var && new_var->onepart)
8471 gcc_checking_assert (VAR_LOC_1PAUX (new_var) == NULL);
8472 VAR_LOC_1PAUX (new_var) = VAR_LOC_1PAUX (old_var);
8473 VAR_LOC_1PAUX (old_var) = NULL;
8474 new_var->var_part[0].cur_loc = old_var->var_part[0].cur_loc;
8476 if (variable_different_p (old_var, new_var))
8477 variable_was_changed (new_var, NULL);
8479 /* Continue traversing the hash table. */
8483 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it is not in hash
8487 emit_notes_for_differences_2 (void **slot, void *data)
8489 htab_t old_vars = (htab_t) data;
8490 variable old_var, new_var;
8492 new_var = (variable) *slot;
8493 old_var = (variable) htab_find_with_hash (old_vars, new_var->dv,
8494 dv_htab_hash (new_var->dv));
8498 for (i = 0; i < new_var->n_var_parts; i++)
8499 new_var->var_part[i].cur_loc = NULL;
8500 variable_was_changed (new_var, NULL);
8503 /* Continue traversing the hash table. */
8507 /* Emit notes before INSN for differences between dataflow sets OLD_SET and
8511 emit_notes_for_differences (rtx insn, dataflow_set *old_set,
8512 dataflow_set *new_set)
8514 htab_traverse (shared_hash_htab (old_set->vars),
8515 emit_notes_for_differences_1,
8516 shared_hash_htab (new_set->vars));
8517 htab_traverse (shared_hash_htab (new_set->vars),
8518 emit_notes_for_differences_2,
8519 shared_hash_htab (old_set->vars));
8520 emit_notes_for_changes (insn, EMIT_NOTE_BEFORE_INSN, new_set->vars);
8523 /* Return the next insn after INSN that is not a NOTE_INSN_VAR_LOCATION. */
8526 next_non_note_insn_var_location (rtx insn)
8530 insn = NEXT_INSN (insn);
8533 || NOTE_KIND (insn) != NOTE_INSN_VAR_LOCATION)
8540 /* Emit the notes for changes of location parts in the basic block BB. */
8543 emit_notes_in_bb (basic_block bb, dataflow_set *set)
8546 micro_operation *mo;
8548 dataflow_set_clear (set);
8549 dataflow_set_copy (set, &VTI (bb)->in);
8551 FOR_EACH_VEC_ELT (micro_operation, VTI (bb)->mos, i, mo)
8553 rtx insn = mo->insn;
8554 rtx next_insn = next_non_note_insn_var_location (insn);
8559 dataflow_set_clear_at_call (set);
8560 emit_notes_for_changes (insn, EMIT_NOTE_AFTER_CALL_INSN, set->vars);
8562 rtx arguments = mo->u.loc, *p = &arguments, note;
8565 XEXP (XEXP (*p, 0), 1)
8566 = vt_expand_loc (XEXP (XEXP (*p, 0), 1),
8567 shared_hash_htab (set->vars));
8568 /* If expansion is successful, keep it in the list. */
8569 if (XEXP (XEXP (*p, 0), 1))
8571 /* Otherwise, if the following item is data_value for it,
8573 else if (XEXP (*p, 1)
8574 && REG_P (XEXP (XEXP (*p, 0), 0))
8575 && MEM_P (XEXP (XEXP (XEXP (*p, 1), 0), 0))
8576 && REG_P (XEXP (XEXP (XEXP (XEXP (*p, 1), 0), 0),
8578 && REGNO (XEXP (XEXP (*p, 0), 0))
8579 == REGNO (XEXP (XEXP (XEXP (XEXP (*p, 1), 0),
8581 *p = XEXP (XEXP (*p, 1), 1);
8582 /* Just drop this item. */
8586 note = emit_note_after (NOTE_INSN_CALL_ARG_LOCATION, insn);
8587 NOTE_VAR_LOCATION (note) = arguments;
8593 rtx loc = mo->u.loc;
8596 var_reg_set (set, loc, VAR_INIT_STATUS_UNINITIALIZED, NULL);
8598 var_mem_set (set, loc, VAR_INIT_STATUS_UNINITIALIZED, NULL);
8600 emit_notes_for_changes (insn, EMIT_NOTE_AFTER_INSN, set->vars);
8606 rtx loc = mo->u.loc;
8610 if (GET_CODE (loc) == CONCAT)
8612 val = XEXP (loc, 0);
8613 vloc = XEXP (loc, 1);
8621 var = PAT_VAR_LOCATION_DECL (vloc);
8623 clobber_variable_part (set, NULL_RTX,
8624 dv_from_decl (var), 0, NULL_RTX);
8627 if (VAL_NEEDS_RESOLUTION (loc))
8628 val_resolve (set, val, PAT_VAR_LOCATION_LOC (vloc), insn);
8629 set_variable_part (set, val, dv_from_decl (var), 0,
8630 VAR_INIT_STATUS_INITIALIZED, NULL_RTX,
8633 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc)))
8634 set_variable_part (set, PAT_VAR_LOCATION_LOC (vloc),
8635 dv_from_decl (var), 0,
8636 VAR_INIT_STATUS_INITIALIZED, NULL_RTX,
8639 emit_notes_for_changes (insn, EMIT_NOTE_AFTER_INSN, set->vars);
8645 rtx loc = mo->u.loc;
8646 rtx val, vloc, uloc;
8648 vloc = uloc = XEXP (loc, 1);
8649 val = XEXP (loc, 0);
8651 if (GET_CODE (val) == CONCAT)
8653 uloc = XEXP (val, 1);
8654 val = XEXP (val, 0);
8657 if (VAL_NEEDS_RESOLUTION (loc))
8658 val_resolve (set, val, vloc, insn);
8660 val_store (set, val, uloc, insn, false);
8662 if (VAL_HOLDS_TRACK_EXPR (loc))
8664 if (GET_CODE (uloc) == REG)
8665 var_reg_set (set, uloc, VAR_INIT_STATUS_UNINITIALIZED,
8667 else if (GET_CODE (uloc) == MEM)
8668 var_mem_set (set, uloc, VAR_INIT_STATUS_UNINITIALIZED,
8672 emit_notes_for_changes (insn, EMIT_NOTE_BEFORE_INSN, set->vars);
8678 rtx loc = mo->u.loc;
8679 rtx val, vloc, uloc;
8682 uloc = XEXP (vloc, 1);
8683 val = XEXP (vloc, 0);
8686 if (GET_CODE (val) == CONCAT)
8688 vloc = XEXP (val, 1);
8689 val = XEXP (val, 0);
8692 if (GET_CODE (vloc) == SET)
8694 rtx vsrc = SET_SRC (vloc);
8696 gcc_assert (val != vsrc);
8697 gcc_assert (vloc == uloc || VAL_NEEDS_RESOLUTION (loc));
8699 vloc = SET_DEST (vloc);
8701 if (VAL_NEEDS_RESOLUTION (loc))
8702 val_resolve (set, val, vsrc, insn);
8704 else if (VAL_NEEDS_RESOLUTION (loc))
8706 gcc_assert (GET_CODE (uloc) == SET
8707 && GET_CODE (SET_SRC (uloc)) == REG);
8708 val_resolve (set, val, SET_SRC (uloc), insn);
8711 if (VAL_HOLDS_TRACK_EXPR (loc))
8713 if (VAL_EXPR_IS_CLOBBERED (loc))
8716 var_reg_delete (set, uloc, true);
8717 else if (MEM_P (uloc))
8718 var_mem_delete (set, uloc, true);
8722 bool copied_p = VAL_EXPR_IS_COPIED (loc);
8724 enum var_init_status status = VAR_INIT_STATUS_INITIALIZED;
8726 if (GET_CODE (uloc) == SET)
8728 set_src = SET_SRC (uloc);
8729 uloc = SET_DEST (uloc);
8734 status = find_src_status (set, set_src);
8736 set_src = find_src_set_src (set, set_src);
8740 var_reg_delete_and_set (set, uloc, !copied_p,
8742 else if (MEM_P (uloc))
8743 var_mem_delete_and_set (set, uloc, !copied_p,
8747 else if (REG_P (uloc))
8748 var_regno_delete (set, REGNO (uloc));
8750 val_store (set, val, vloc, insn, true);
8752 emit_notes_for_changes (next_insn, EMIT_NOTE_BEFORE_INSN,
8759 rtx loc = mo->u.loc;
8762 if (GET_CODE (loc) == SET)
8764 set_src = SET_SRC (loc);
8765 loc = SET_DEST (loc);
8769 var_reg_delete_and_set (set, loc, true, VAR_INIT_STATUS_INITIALIZED,
8772 var_mem_delete_and_set (set, loc, true, VAR_INIT_STATUS_INITIALIZED,
8775 emit_notes_for_changes (next_insn, EMIT_NOTE_BEFORE_INSN,
8782 rtx loc = mo->u.loc;
8783 enum var_init_status src_status;
8786 if (GET_CODE (loc) == SET)
8788 set_src = SET_SRC (loc);
8789 loc = SET_DEST (loc);
8792 src_status = find_src_status (set, set_src);
8793 set_src = find_src_set_src (set, set_src);
8796 var_reg_delete_and_set (set, loc, false, src_status, set_src);
8798 var_mem_delete_and_set (set, loc, false, src_status, set_src);
8800 emit_notes_for_changes (next_insn, EMIT_NOTE_BEFORE_INSN,
8807 rtx loc = mo->u.loc;
8810 var_reg_delete (set, loc, false);
8812 var_mem_delete (set, loc, false);
8814 emit_notes_for_changes (insn, EMIT_NOTE_AFTER_INSN, set->vars);
8820 rtx loc = mo->u.loc;
8823 var_reg_delete (set, loc, true);
8825 var_mem_delete (set, loc, true);
8827 emit_notes_for_changes (next_insn, EMIT_NOTE_BEFORE_INSN,
8833 set->stack_adjust += mo->u.adjust;
8839 /* Emit notes for the whole function. */
8842 vt_emit_notes (void)
8847 gcc_assert (!htab_elements (changed_variables));
8849 /* Free memory occupied by the out hash tables, as they aren't used
8852 dataflow_set_clear (&VTI (bb)->out);
8854 /* Enable emitting notes by functions (mainly by set_variable_part and
8855 delete_variable_part). */
8858 if (MAY_HAVE_DEBUG_INSNS)
8859 dropped_values = htab_create (cselib_get_next_uid () * 2,
8860 variable_htab_hash, variable_htab_eq,
8861 variable_htab_free);
8863 dataflow_set_init (&cur);
8867 /* Emit the notes for changes of variable locations between two
8868 subsequent basic blocks. */
8869 emit_notes_for_differences (BB_HEAD (bb), &cur, &VTI (bb)->in);
8871 /* Emit the notes for the changes in the basic block itself. */
8872 emit_notes_in_bb (bb, &cur);
8874 /* Free memory occupied by the in hash table, we won't need it
8876 dataflow_set_clear (&VTI (bb)->in);
8878 #ifdef ENABLE_CHECKING
8879 htab_traverse (shared_hash_htab (cur.vars),
8880 emit_notes_for_differences_1,
8881 shared_hash_htab (empty_shared_hash));
8883 dataflow_set_destroy (&cur);
8885 if (MAY_HAVE_DEBUG_INSNS)
8886 htab_delete (dropped_values);
8891 /* If there is a declaration and offset associated with register/memory RTL
8892 assign declaration to *DECLP and offset to *OFFSETP, and return true. */
8895 vt_get_decl_and_offset (rtx rtl, tree *declp, HOST_WIDE_INT *offsetp)
8899 if (REG_ATTRS (rtl))
8901 *declp = REG_EXPR (rtl);
8902 *offsetp = REG_OFFSET (rtl);
8906 else if (MEM_P (rtl))
8908 if (MEM_ATTRS (rtl))
8910 *declp = MEM_EXPR (rtl);
8911 *offsetp = INT_MEM_OFFSET (rtl);
8918 /* Record the value for the ENTRY_VALUE of RTL as a global equivalence
8922 record_entry_value (cselib_val *val, rtx rtl)
8924 rtx ev = gen_rtx_ENTRY_VALUE (GET_MODE (rtl));
8926 ENTRY_VALUE_EXP (ev) = rtl;
8928 cselib_add_permanent_equiv (val, ev, get_insns ());
8931 /* Insert function parameter PARM in IN and OUT sets of ENTRY_BLOCK. */
8934 vt_add_function_parameter (tree parm)
8936 rtx decl_rtl = DECL_RTL_IF_SET (parm);
8937 rtx incoming = DECL_INCOMING_RTL (parm);
8939 enum machine_mode mode;
8940 HOST_WIDE_INT offset;
8944 if (TREE_CODE (parm) != PARM_DECL)
8947 if (!decl_rtl || !incoming)
8950 if (GET_MODE (decl_rtl) == BLKmode || GET_MODE (incoming) == BLKmode)
8953 /* If there is a DRAP register, rewrite the incoming location of parameters
8954 passed on the stack into MEMs based on the argument pointer, as the DRAP
8955 register can be reused for other purposes and we do not track locations
8956 based on generic registers. But the prerequisite is that this argument
8957 pointer be also the virtual CFA pointer, see vt_initialize. */
8958 if (MEM_P (incoming)
8959 && stack_realign_drap
8960 && arg_pointer_rtx == cfa_base_rtx
8961 && (XEXP (incoming, 0) == crtl->args.internal_arg_pointer
8962 || (GET_CODE (XEXP (incoming, 0)) == PLUS
8963 && XEXP (XEXP (incoming, 0), 0)
8964 == crtl->args.internal_arg_pointer
8965 && CONST_INT_P (XEXP (XEXP (incoming, 0), 1)))))
8967 HOST_WIDE_INT off = -FIRST_PARM_OFFSET (current_function_decl);
8968 if (GET_CODE (XEXP (incoming, 0)) == PLUS)
8969 off += INTVAL (XEXP (XEXP (incoming, 0), 1));
8971 = replace_equiv_address_nv (incoming,
8972 plus_constant (arg_pointer_rtx, off));
8975 #ifdef HAVE_window_save
8976 /* DECL_INCOMING_RTL uses the INCOMING_REGNO of parameter registers.
8977 If the target machine has an explicit window save instruction, the
8978 actual entry value is the corresponding OUTGOING_REGNO instead. */
8979 if (REG_P (incoming)
8980 && HARD_REGISTER_P (incoming)
8981 && OUTGOING_REGNO (REGNO (incoming)) != REGNO (incoming))
8984 = VEC_safe_push (parm_reg_t, gc, windowed_parm_regs, NULL);
8985 p->incoming = incoming;
8987 = gen_rtx_REG_offset (incoming, GET_MODE (incoming),
8988 OUTGOING_REGNO (REGNO (incoming)), 0);
8989 p->outgoing = incoming;
8991 else if (MEM_P (incoming)
8992 && REG_P (XEXP (incoming, 0))
8993 && HARD_REGISTER_P (XEXP (incoming, 0)))
8995 rtx reg = XEXP (incoming, 0);
8996 if (OUTGOING_REGNO (REGNO (reg)) != REGNO (reg))
8999 = VEC_safe_push (parm_reg_t, gc, windowed_parm_regs, NULL);
9001 reg = gen_raw_REG (GET_MODE (reg), OUTGOING_REGNO (REGNO (reg)));
9003 incoming = replace_equiv_address_nv (incoming, reg);
9008 if (!vt_get_decl_and_offset (incoming, &decl, &offset))
9010 if (REG_P (incoming) || MEM_P (incoming))
9012 /* This means argument is passed by invisible reference. */
9015 incoming = gen_rtx_MEM (GET_MODE (decl_rtl), incoming);
9019 if (!vt_get_decl_and_offset (decl_rtl, &decl, &offset))
9021 offset += byte_lowpart_offset (GET_MODE (incoming),
9022 GET_MODE (decl_rtl));
9031 /* Assume that DECL_RTL was a pseudo that got spilled to
9032 memory. The spill slot sharing code will force the
9033 memory to reference spill_slot_decl (%sfp), so we don't
9034 match above. That's ok, the pseudo must have referenced
9035 the entire parameter, so just reset OFFSET. */
9036 gcc_assert (decl == get_spill_slot_decl (false));
9040 if (!track_loc_p (incoming, parm, offset, false, &mode, &offset))
9043 out = &VTI (ENTRY_BLOCK_PTR)->out;
9045 dv = dv_from_decl (parm);
9047 if (target_for_debug_bind (parm)
9048 /* We can't deal with these right now, because this kind of
9049 variable is single-part. ??? We could handle parallels
9050 that describe multiple locations for the same single
9051 value, but ATM we don't. */
9052 && GET_CODE (incoming) != PARALLEL)
9056 /* ??? We shouldn't ever hit this, but it may happen because
9057 arguments passed by invisible reference aren't dealt with
9058 above: incoming-rtl will have Pmode rather than the
9059 expected mode for the type. */
9063 val = cselib_lookup_from_insn (var_lowpart (mode, incoming), mode, true,
9064 VOIDmode, get_insns ());
9066 /* ??? Float-typed values in memory are not handled by
9070 preserve_value (val);
9071 set_variable_part (out, val->val_rtx, dv, offset,
9072 VAR_INIT_STATUS_INITIALIZED, NULL, INSERT);
9073 dv = dv_from_value (val->val_rtx);
9077 if (REG_P (incoming))
9079 incoming = var_lowpart (mode, incoming);
9080 gcc_assert (REGNO (incoming) < FIRST_PSEUDO_REGISTER);
9081 attrs_list_insert (&out->regs[REGNO (incoming)], dv, offset,
9083 set_variable_part (out, incoming, dv, offset,
9084 VAR_INIT_STATUS_INITIALIZED, NULL, INSERT);
9085 if (dv_is_value_p (dv))
9087 record_entry_value (CSELIB_VAL_PTR (dv_as_value (dv)), incoming);
9088 if (TREE_CODE (TREE_TYPE (parm)) == REFERENCE_TYPE
9089 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (parm))))
9091 enum machine_mode indmode
9092 = TYPE_MODE (TREE_TYPE (TREE_TYPE (parm)));
9093 rtx mem = gen_rtx_MEM (indmode, incoming);
9094 cselib_val *val = cselib_lookup_from_insn (mem, indmode, true,
9099 preserve_value (val);
9100 record_entry_value (val, mem);
9101 set_variable_part (out, mem, dv_from_value (val->val_rtx), 0,
9102 VAR_INIT_STATUS_INITIALIZED, NULL, INSERT);
9107 else if (MEM_P (incoming))
9109 incoming = var_lowpart (mode, incoming);
9110 set_variable_part (out, incoming, dv, offset,
9111 VAR_INIT_STATUS_INITIALIZED, NULL, INSERT);
9115 /* Insert function parameters to IN and OUT sets of ENTRY_BLOCK. */
9118 vt_add_function_parameters (void)
9122 for (parm = DECL_ARGUMENTS (current_function_decl);
9123 parm; parm = DECL_CHAIN (parm))
9124 vt_add_function_parameter (parm);
9126 if (DECL_HAS_VALUE_EXPR_P (DECL_RESULT (current_function_decl)))
9128 tree vexpr = DECL_VALUE_EXPR (DECL_RESULT (current_function_decl));
9130 if (TREE_CODE (vexpr) == INDIRECT_REF)
9131 vexpr = TREE_OPERAND (vexpr, 0);
9133 if (TREE_CODE (vexpr) == PARM_DECL
9134 && DECL_ARTIFICIAL (vexpr)
9135 && !DECL_IGNORED_P (vexpr)
9136 && DECL_NAMELESS (vexpr))
9137 vt_add_function_parameter (vexpr);
9141 /* Return true if INSN in the prologue initializes hard_frame_pointer_rtx. */
9144 fp_setter (rtx insn)
9146 rtx pat = PATTERN (insn);
9147 if (RTX_FRAME_RELATED_P (insn))
9149 rtx expr = find_reg_note (insn, REG_FRAME_RELATED_EXPR, NULL_RTX);
9151 pat = XEXP (expr, 0);
9153 if (GET_CODE (pat) == SET)
9154 return SET_DEST (pat) == hard_frame_pointer_rtx;
9155 else if (GET_CODE (pat) == PARALLEL)
9158 for (i = XVECLEN (pat, 0) - 1; i >= 0; i--)
9159 if (GET_CODE (XVECEXP (pat, 0, i)) == SET
9160 && SET_DEST (XVECEXP (pat, 0, i)) == hard_frame_pointer_rtx)
9166 /* Initialize cfa_base_rtx, create a preserved VALUE for it and
9167 ensure it isn't flushed during cselib_reset_table.
9168 Can be called only if frame_pointer_rtx resp. arg_pointer_rtx
9169 has been eliminated. */
9172 vt_init_cfa_base (void)
9176 #ifdef FRAME_POINTER_CFA_OFFSET
9177 cfa_base_rtx = frame_pointer_rtx;
9178 cfa_base_offset = -FRAME_POINTER_CFA_OFFSET (current_function_decl);
9180 cfa_base_rtx = arg_pointer_rtx;
9181 cfa_base_offset = -ARG_POINTER_CFA_OFFSET (current_function_decl);
9183 if (cfa_base_rtx == hard_frame_pointer_rtx
9184 || !fixed_regs[REGNO (cfa_base_rtx)])
9186 cfa_base_rtx = NULL_RTX;
9189 if (!MAY_HAVE_DEBUG_INSNS)
9192 /* Tell alias analysis that cfa_base_rtx should share
9193 find_base_term value with stack pointer or hard frame pointer. */
9194 if (!frame_pointer_needed)
9195 vt_equate_reg_base_value (cfa_base_rtx, stack_pointer_rtx);
9196 else if (!crtl->stack_realign_tried)
9197 vt_equate_reg_base_value (cfa_base_rtx, hard_frame_pointer_rtx);
9199 val = cselib_lookup_from_insn (cfa_base_rtx, GET_MODE (cfa_base_rtx), 1,
9200 VOIDmode, get_insns ());
9201 preserve_value (val);
9202 cselib_preserve_cfa_base_value (val, REGNO (cfa_base_rtx));
9203 var_reg_decl_set (&VTI (ENTRY_BLOCK_PTR)->out, cfa_base_rtx,
9204 VAR_INIT_STATUS_INITIALIZED, dv_from_value (val->val_rtx),
9205 0, NULL_RTX, INSERT);
9208 /* Allocate and initialize the data structures for variable tracking
9209 and parse the RTL to get the micro operations. */
9212 vt_initialize (void)
9214 basic_block bb, prologue_bb = single_succ (ENTRY_BLOCK_PTR);
9215 HOST_WIDE_INT fp_cfa_offset = -1;
9217 alloc_aux_for_blocks (sizeof (struct variable_tracking_info_def));
9219 attrs_pool = create_alloc_pool ("attrs_def pool",
9220 sizeof (struct attrs_def), 1024);
9221 var_pool = create_alloc_pool ("variable_def pool",
9222 sizeof (struct variable_def)
9223 + (MAX_VAR_PARTS - 1)
9224 * sizeof (((variable)NULL)->var_part[0]), 64);
9225 loc_chain_pool = create_alloc_pool ("location_chain_def pool",
9226 sizeof (struct location_chain_def),
9228 shared_hash_pool = create_alloc_pool ("shared_hash_def pool",
9229 sizeof (struct shared_hash_def), 256);
9230 empty_shared_hash = (shared_hash) pool_alloc (shared_hash_pool);
9231 empty_shared_hash->refcount = 1;
9232 empty_shared_hash->htab
9233 = htab_create (1, variable_htab_hash, variable_htab_eq,
9234 variable_htab_free);
9235 changed_variables = htab_create (10, variable_htab_hash, variable_htab_eq,
9236 variable_htab_free);
9238 /* Init the IN and OUT sets. */
9241 VTI (bb)->visited = false;
9242 VTI (bb)->flooded = false;
9243 dataflow_set_init (&VTI (bb)->in);
9244 dataflow_set_init (&VTI (bb)->out);
9245 VTI (bb)->permp = NULL;
9248 if (MAY_HAVE_DEBUG_INSNS)
9250 cselib_init (CSELIB_RECORD_MEMORY | CSELIB_PRESERVE_CONSTANTS);
9251 scratch_regs = BITMAP_ALLOC (NULL);
9252 valvar_pool = create_alloc_pool ("small variable_def pool",
9253 sizeof (struct variable_def), 256);
9254 preserved_values = VEC_alloc (rtx, heap, 256);
9258 scratch_regs = NULL;
9262 /* In order to factor out the adjustments made to the stack pointer or to
9263 the hard frame pointer and thus be able to use DW_OP_fbreg operations
9264 instead of individual location lists, we're going to rewrite MEMs based
9265 on them into MEMs based on the CFA by de-eliminating stack_pointer_rtx
9266 or hard_frame_pointer_rtx to the virtual CFA pointer frame_pointer_rtx
9267 resp. arg_pointer_rtx. We can do this either when there is no frame
9268 pointer in the function and stack adjustments are consistent for all
9269 basic blocks or when there is a frame pointer and no stack realignment.
9270 But we first have to check that frame_pointer_rtx resp. arg_pointer_rtx
9271 has been eliminated. */
9272 if (!frame_pointer_needed)
9276 if (!vt_stack_adjustments ())
9279 #ifdef FRAME_POINTER_CFA_OFFSET
9280 reg = frame_pointer_rtx;
9282 reg = arg_pointer_rtx;
9284 elim = eliminate_regs (reg, VOIDmode, NULL_RTX);
9287 if (GET_CODE (elim) == PLUS)
9288 elim = XEXP (elim, 0);
9289 if (elim == stack_pointer_rtx)
9290 vt_init_cfa_base ();
9293 else if (!crtl->stack_realign_tried)
9297 #ifdef FRAME_POINTER_CFA_OFFSET
9298 reg = frame_pointer_rtx;
9299 fp_cfa_offset = FRAME_POINTER_CFA_OFFSET (current_function_decl);
9301 reg = arg_pointer_rtx;
9302 fp_cfa_offset = ARG_POINTER_CFA_OFFSET (current_function_decl);
9304 elim = eliminate_regs (reg, VOIDmode, NULL_RTX);
9307 if (GET_CODE (elim) == PLUS)
9309 fp_cfa_offset -= INTVAL (XEXP (elim, 1));
9310 elim = XEXP (elim, 0);
9312 if (elim != hard_frame_pointer_rtx)
9319 /* If the stack is realigned and a DRAP register is used, we're going to
9320 rewrite MEMs based on it representing incoming locations of parameters
9321 passed on the stack into MEMs based on the argument pointer. Although
9322 we aren't going to rewrite other MEMs, we still need to initialize the
9323 virtual CFA pointer in order to ensure that the argument pointer will
9324 be seen as a constant throughout the function.
9326 ??? This doesn't work if FRAME_POINTER_CFA_OFFSET is defined. */
9327 else if (stack_realign_drap)
9331 #ifdef FRAME_POINTER_CFA_OFFSET
9332 reg = frame_pointer_rtx;
9334 reg = arg_pointer_rtx;
9336 elim = eliminate_regs (reg, VOIDmode, NULL_RTX);
9339 if (GET_CODE (elim) == PLUS)
9340 elim = XEXP (elim, 0);
9341 if (elim == hard_frame_pointer_rtx)
9342 vt_init_cfa_base ();
9346 hard_frame_pointer_adjustment = -1;
9348 vt_add_function_parameters ();
9353 HOST_WIDE_INT pre, post = 0;
9354 basic_block first_bb, last_bb;
9356 if (MAY_HAVE_DEBUG_INSNS)
9358 cselib_record_sets_hook = add_with_sets;
9359 if (dump_file && (dump_flags & TDF_DETAILS))
9360 fprintf (dump_file, "first value: %i\n",
9361 cselib_get_next_uid ());
9368 if (bb->next_bb == EXIT_BLOCK_PTR
9369 || ! single_pred_p (bb->next_bb))
9371 e = find_edge (bb, bb->next_bb);
9372 if (! e || (e->flags & EDGE_FALLTHRU) == 0)
9378 /* Add the micro-operations to the vector. */
9379 FOR_BB_BETWEEN (bb, first_bb, last_bb->next_bb, next_bb)
9381 HOST_WIDE_INT offset = VTI (bb)->out.stack_adjust;
9382 VTI (bb)->out.stack_adjust = VTI (bb)->in.stack_adjust;
9383 for (insn = BB_HEAD (bb); insn != NEXT_INSN (BB_END (bb));
9384 insn = NEXT_INSN (insn))
9388 if (!frame_pointer_needed)
9390 insn_stack_adjust_offset_pre_post (insn, &pre, &post);
9394 mo.type = MO_ADJUST;
9397 if (dump_file && (dump_flags & TDF_DETAILS))
9398 log_op_type (PATTERN (insn), bb, insn,
9399 MO_ADJUST, dump_file);
9400 VEC_safe_push (micro_operation, heap, VTI (bb)->mos,
9402 VTI (bb)->out.stack_adjust += pre;
9406 cselib_hook_called = false;
9407 adjust_insn (bb, insn);
9408 if (MAY_HAVE_DEBUG_INSNS)
9411 prepare_call_arguments (bb, insn);
9412 cselib_process_insn (insn);
9413 if (dump_file && (dump_flags & TDF_DETAILS))
9415 print_rtl_single (dump_file, insn);
9416 dump_cselib_table (dump_file);
9419 if (!cselib_hook_called)
9420 add_with_sets (insn, 0, 0);
9423 if (!frame_pointer_needed && post)
9426 mo.type = MO_ADJUST;
9429 if (dump_file && (dump_flags & TDF_DETAILS))
9430 log_op_type (PATTERN (insn), bb, insn,
9431 MO_ADJUST, dump_file);
9432 VEC_safe_push (micro_operation, heap, VTI (bb)->mos,
9434 VTI (bb)->out.stack_adjust += post;
9437 if (bb == prologue_bb
9438 && fp_cfa_offset != -1
9439 && hard_frame_pointer_adjustment == -1
9440 && RTX_FRAME_RELATED_P (insn)
9441 && fp_setter (insn))
9443 vt_init_cfa_base ();
9444 hard_frame_pointer_adjustment = fp_cfa_offset;
9448 gcc_assert (offset == VTI (bb)->out.stack_adjust);
9453 if (MAY_HAVE_DEBUG_INSNS)
9455 cselib_preserve_only_values ();
9456 cselib_reset_table (cselib_get_next_uid ());
9457 cselib_record_sets_hook = NULL;
9461 hard_frame_pointer_adjustment = -1;
9462 VTI (ENTRY_BLOCK_PTR)->flooded = true;
9463 cfa_base_rtx = NULL_RTX;
9467 /* This is *not* reset after each function. It gives each
9468 NOTE_INSN_DELETED_DEBUG_LABEL in the entire compilation
9469 a unique label number. */
9471 static int debug_label_num = 1;
9473 /* Get rid of all debug insns from the insn stream. */
9476 delete_debug_insns (void)
9481 if (!MAY_HAVE_DEBUG_INSNS)
9486 FOR_BB_INSNS_SAFE (bb, insn, next)
9487 if (DEBUG_INSN_P (insn))
9489 tree decl = INSN_VAR_LOCATION_DECL (insn);
9490 if (TREE_CODE (decl) == LABEL_DECL
9492 && !DECL_RTL_SET_P (decl))
9494 PUT_CODE (insn, NOTE);
9495 NOTE_KIND (insn) = NOTE_INSN_DELETED_DEBUG_LABEL;
9496 NOTE_DELETED_LABEL_NAME (insn)
9497 = IDENTIFIER_POINTER (DECL_NAME (decl));
9498 SET_DECL_RTL (decl, insn);
9499 CODE_LABEL_NUMBER (insn) = debug_label_num++;
9507 /* Run a fast, BB-local only version of var tracking, to take care of
9508 information that we don't do global analysis on, such that not all
9509 information is lost. If SKIPPED holds, we're skipping the global
9510 pass entirely, so we should try to use information it would have
9511 handled as well.. */
9514 vt_debug_insns_local (bool skipped ATTRIBUTE_UNUSED)
9516 /* ??? Just skip it all for now. */
9517 delete_debug_insns ();
9520 /* Free the data structures needed for variable tracking. */
9529 VEC_free (micro_operation, heap, VTI (bb)->mos);
9534 dataflow_set_destroy (&VTI (bb)->in);
9535 dataflow_set_destroy (&VTI (bb)->out);
9536 if (VTI (bb)->permp)
9538 dataflow_set_destroy (VTI (bb)->permp);
9539 XDELETE (VTI (bb)->permp);
9542 free_aux_for_blocks ();
9543 htab_delete (empty_shared_hash->htab);
9544 htab_delete (changed_variables);
9545 free_alloc_pool (attrs_pool);
9546 free_alloc_pool (var_pool);
9547 free_alloc_pool (loc_chain_pool);
9548 free_alloc_pool (shared_hash_pool);
9550 if (MAY_HAVE_DEBUG_INSNS)
9552 free_alloc_pool (valvar_pool);
9553 VEC_free (rtx, heap, preserved_values);
9555 BITMAP_FREE (scratch_regs);
9556 scratch_regs = NULL;
9559 #ifdef HAVE_window_save
9560 VEC_free (parm_reg_t, gc, windowed_parm_regs);
9564 XDELETEVEC (vui_vec);
9569 /* The entry point to variable tracking pass. */
9571 static inline unsigned int
9572 variable_tracking_main_1 (void)
9576 if (flag_var_tracking_assignments < 0)
9578 delete_debug_insns ();
9582 if (n_basic_blocks > 500 && n_edges / n_basic_blocks >= 20)
9584 vt_debug_insns_local (true);
9588 mark_dfs_back_edges ();
9589 if (!vt_initialize ())
9592 vt_debug_insns_local (true);
9596 success = vt_find_locations ();
9598 if (!success && flag_var_tracking_assignments > 0)
9602 delete_debug_insns ();
9604 /* This is later restored by our caller. */
9605 flag_var_tracking_assignments = 0;
9607 success = vt_initialize ();
9608 gcc_assert (success);
9610 success = vt_find_locations ();
9616 vt_debug_insns_local (false);
9620 if (dump_file && (dump_flags & TDF_DETAILS))
9622 dump_dataflow_sets ();
9623 dump_flow_info (dump_file, dump_flags);
9626 timevar_push (TV_VAR_TRACKING_EMIT);
9628 timevar_pop (TV_VAR_TRACKING_EMIT);
9631 vt_debug_insns_local (false);
9636 variable_tracking_main (void)
9639 int save = flag_var_tracking_assignments;
9641 ret = variable_tracking_main_1 ();
9643 flag_var_tracking_assignments = save;
9649 gate_handle_var_tracking (void)
9651 return (flag_var_tracking && !targetm.delay_vartrack);
9656 struct rtl_opt_pass pass_variable_tracking =
9660 "vartrack", /* name */
9661 gate_handle_var_tracking, /* gate */
9662 variable_tracking_main, /* execute */
9665 0, /* static_pass_number */
9666 TV_VAR_TRACKING, /* tv_id */
9667 0, /* properties_required */
9668 0, /* properties_provided */
9669 0, /* properties_destroyed */
9670 0, /* todo_flags_start */
9671 TODO_verify_rtl_sharing /* todo_flags_finish */