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"
99 #include "insn-config.h"
102 #include "alloc-pool.h"
107 #include "tree-pass.h"
108 #include "tree-flow.h"
112 #include "diagnostic.h"
113 #include "tree-pretty-print.h"
114 #include "pointer-set.h"
119 /* var-tracking.c assumes that tree code with the same value as VALUE rtx code
120 has no chance to appear in REG_EXPR/MEM_EXPRs and isn't a decl.
121 Currently the value is the same as IDENTIFIER_NODE, which has such
122 a property. If this compile time assertion ever fails, make sure that
123 the new tree code that equals (int) VALUE has the same property. */
124 extern char check_value_val[(int) VALUE == (int) IDENTIFIER_NODE ? 1 : -1];
126 /* Type of micro operation. */
127 enum micro_operation_type
129 MO_USE, /* Use location (REG or MEM). */
130 MO_USE_NO_VAR,/* Use location which is not associated with a variable
131 or the variable is not trackable. */
132 MO_VAL_USE, /* Use location which is associated with a value. */
133 MO_VAL_LOC, /* Use location which appears in a debug insn. */
134 MO_VAL_SET, /* Set location associated with a value. */
135 MO_SET, /* Set location. */
136 MO_COPY, /* Copy the same portion of a variable from one
137 location to another. */
138 MO_CLOBBER, /* Clobber location. */
139 MO_CALL, /* Call insn. */
140 MO_ADJUST /* Adjust stack pointer. */
144 static const char * const ATTRIBUTE_UNUSED
145 micro_operation_type_name[] = {
158 /* Where shall the note be emitted? BEFORE or AFTER the instruction.
159 Notes emitted as AFTER_CALL are to take effect during the call,
160 rather than after the call. */
163 EMIT_NOTE_BEFORE_INSN,
164 EMIT_NOTE_AFTER_INSN,
165 EMIT_NOTE_AFTER_CALL_INSN
168 /* Structure holding information about micro operation. */
169 typedef struct micro_operation_def
171 /* Type of micro operation. */
172 enum micro_operation_type type;
174 /* The instruction which the micro operation is in, for MO_USE,
175 MO_USE_NO_VAR, MO_CALL and MO_ADJUST, or the subsequent
176 instruction or note in the original flow (before any var-tracking
177 notes are inserted, to simplify emission of notes), for MO_SET
182 /* Location. For MO_SET and MO_COPY, this is the SET that
183 performs the assignment, if known, otherwise it is the target
184 of the assignment. For MO_VAL_USE and MO_VAL_SET, it is a
185 CONCAT of the VALUE and the LOC associated with it. For
186 MO_VAL_LOC, it is a CONCAT of the VALUE and the VAR_LOCATION
187 associated with it. */
190 /* Stack adjustment. */
191 HOST_WIDE_INT adjust;
195 DEF_VEC_O(micro_operation);
196 DEF_VEC_ALLOC_O(micro_operation,heap);
198 /* A declaration of a variable, or an RTL value being handled like a
200 typedef void *decl_or_value;
202 /* Structure for passing some other parameters to function
203 emit_note_insn_var_location. */
204 typedef struct emit_note_data_def
206 /* The instruction which the note will be emitted before/after. */
209 /* Where the note will be emitted (before/after insn)? */
210 enum emit_note_where where;
212 /* The variables and values active at this point. */
216 /* Description of location of a part of a variable. The content of a physical
217 register is described by a chain of these structures.
218 The chains are pretty short (usually 1 or 2 elements) and thus
219 chain is the best data structure. */
220 typedef struct attrs_def
222 /* Pointer to next member of the list. */
223 struct attrs_def *next;
225 /* The rtx of register. */
228 /* The declaration corresponding to LOC. */
231 /* Offset from start of DECL. */
232 HOST_WIDE_INT offset;
235 /* Structure holding a refcounted hash table. If refcount > 1,
236 it must be first unshared before modified. */
237 typedef struct shared_hash_def
239 /* Reference count. */
242 /* Actual hash table. */
246 /* Structure holding the IN or OUT set for a basic block. */
247 typedef struct dataflow_set_def
249 /* Adjustment of stack offset. */
250 HOST_WIDE_INT stack_adjust;
252 /* Attributes for registers (lists of attrs). */
253 attrs regs[FIRST_PSEUDO_REGISTER];
255 /* Variable locations. */
258 /* Vars that is being traversed. */
259 shared_hash traversed_vars;
262 /* The structure (one for each basic block) containing the information
263 needed for variable tracking. */
264 typedef struct variable_tracking_info_def
266 /* The vector of micro operations. */
267 VEC(micro_operation, heap) *mos;
269 /* The IN and OUT set for dataflow analysis. */
273 /* The permanent-in dataflow set for this block. This is used to
274 hold values for which we had to compute entry values. ??? This
275 should probably be dynamically allocated, to avoid using more
276 memory in non-debug builds. */
279 /* Has the block been visited in DFS? */
282 /* Has the block been flooded in VTA? */
285 } *variable_tracking_info;
287 /* Structure for chaining the locations. */
288 typedef struct location_chain_def
290 /* Next element in the chain. */
291 struct location_chain_def *next;
293 /* The location (REG, MEM or VALUE). */
296 /* The "value" stored in this location. */
300 enum var_init_status init;
303 /* A vector of loc_exp_dep holds the active dependencies of a one-part
304 DV on VALUEs, i.e., the VALUEs expanded so as to form the current
305 location of DV. Each entry is also part of VALUE' s linked-list of
306 backlinks back to DV. */
307 typedef struct loc_exp_dep_s
309 /* The dependent DV. */
311 /* The dependency VALUE or DECL_DEBUG. */
313 /* The next entry in VALUE's backlinks list. */
314 struct loc_exp_dep_s *next;
315 /* A pointer to the pointer to this entry (head or prev's next) in
316 the doubly-linked list. */
317 struct loc_exp_dep_s **pprev;
320 DEF_VEC_O (loc_exp_dep);
322 /* This data structure holds information about the depth of a variable
324 typedef struct expand_depth_struct
326 /* This measures the complexity of the expanded expression. It
327 grows by one for each level of expansion that adds more than one
330 /* This counts the number of ENTRY_VALUE expressions in an
331 expansion. We want to minimize their use. */
335 /* This data structure is allocated for one-part variables at the time
336 of emitting notes. */
339 /* Doubly-linked list of dependent DVs. These are DVs whose cur_loc
340 computation used the expansion of this variable, and that ought
341 to be notified should this variable change. If the DV's cur_loc
342 expanded to NULL, all components of the loc list are regarded as
343 active, so that any changes in them give us a chance to get a
344 location. Otherwise, only components of the loc that expanded to
345 non-NULL are regarded as active dependencies. */
346 loc_exp_dep *backlinks;
347 /* This holds the LOC that was expanded into cur_loc. We need only
348 mark a one-part variable as changed if the FROM loc is removed,
349 or if it has no known location and a loc is added, or if it gets
350 a change notification from any of its active dependencies. */
352 /* The depth of the cur_loc expression. */
354 /* Dependencies actively used when expand FROM into cur_loc. */
355 VEC (loc_exp_dep, none) deps;
358 /* Structure describing one part of variable. */
359 typedef struct variable_part_def
361 /* Chain of locations of the part. */
362 location_chain loc_chain;
364 /* Location which was last emitted to location list. */
369 /* The offset in the variable, if !var->onepart. */
370 HOST_WIDE_INT offset;
372 /* Pointer to auxiliary data, if var->onepart and emit_notes. */
373 struct onepart_aux *onepaux;
377 /* Maximum number of location parts. */
378 #define MAX_VAR_PARTS 16
380 /* Enumeration type used to discriminate various types of one-part
382 typedef enum onepart_enum
384 /* Not a one-part variable. */
386 /* A one-part DECL that is not a DEBUG_EXPR_DECL. */
388 /* A DEBUG_EXPR_DECL. */
394 /* Structure describing where the variable is located. */
395 typedef struct variable_def
397 /* The declaration of the variable, or an RTL value being handled
398 like a declaration. */
401 /* Reference count. */
404 /* Number of variable parts. */
407 /* What type of DV this is, according to enum onepart_enum. */
408 ENUM_BITFIELD (onepart_enum) onepart : CHAR_BIT;
410 /* True if this variable_def struct is currently in the
411 changed_variables hash table. */
412 bool in_changed_variables;
414 /* The variable parts. */
415 variable_part var_part[1];
417 typedef const struct variable_def *const_variable;
419 /* Pointer to the BB's information specific to variable tracking pass. */
420 #define VTI(BB) ((variable_tracking_info) (BB)->aux)
422 /* Macro to access MEM_OFFSET as an HOST_WIDE_INT. Evaluates MEM twice. */
423 #define INT_MEM_OFFSET(mem) (MEM_OFFSET_KNOWN_P (mem) ? MEM_OFFSET (mem) : 0)
425 #if ENABLE_CHECKING && (GCC_VERSION >= 2007)
427 /* Access VAR's Ith part's offset, checking that it's not a one-part
429 #define VAR_PART_OFFSET(var, i) __extension__ \
430 (*({ variable const __v = (var); \
431 gcc_checking_assert (!__v->onepart); \
432 &__v->var_part[(i)].aux.offset; }))
434 /* Access VAR's one-part auxiliary data, checking that it is a
435 one-part variable. */
436 #define VAR_LOC_1PAUX(var) __extension__ \
437 (*({ variable const __v = (var); \
438 gcc_checking_assert (__v->onepart); \
439 &__v->var_part[0].aux.onepaux; }))
442 #define VAR_PART_OFFSET(var, i) ((var)->var_part[(i)].aux.offset)
443 #define VAR_LOC_1PAUX(var) ((var)->var_part[0].aux.onepaux)
446 /* These are accessor macros for the one-part auxiliary data. When
447 convenient for users, they're guarded by tests that the data was
449 #define VAR_LOC_DEP_LST(var) (VAR_LOC_1PAUX (var) \
450 ? VAR_LOC_1PAUX (var)->backlinks \
452 #define VAR_LOC_DEP_LSTP(var) (VAR_LOC_1PAUX (var) \
453 ? &VAR_LOC_1PAUX (var)->backlinks \
455 #define VAR_LOC_FROM(var) (VAR_LOC_1PAUX (var)->from)
456 #define VAR_LOC_DEPTH(var) (VAR_LOC_1PAUX (var)->depth)
457 #define VAR_LOC_DEP_VEC(var) (VAR_LOC_1PAUX (var) \
458 ? &VAR_LOC_1PAUX (var)->deps \
461 /* Alloc pool for struct attrs_def. */
462 static alloc_pool attrs_pool;
464 /* Alloc pool for struct variable_def with MAX_VAR_PARTS entries. */
465 static alloc_pool var_pool;
467 /* Alloc pool for struct variable_def with a single var_part entry. */
468 static alloc_pool valvar_pool;
470 /* Alloc pool for struct location_chain_def. */
471 static alloc_pool loc_chain_pool;
473 /* Alloc pool for struct shared_hash_def. */
474 static alloc_pool shared_hash_pool;
476 /* Alloc pool for struct loc_exp_dep_s for NOT_ONEPART variables. */
477 static alloc_pool loc_exp_dep_pool;
479 /* Changed variables, notes will be emitted for them. */
480 static htab_t changed_variables;
482 /* Shall notes be emitted? */
483 static bool emit_notes;
485 /* Values whose dynamic location lists have gone empty, but whose
486 cselib location lists are still usable. Use this to hold the
487 current location, the backlinks, etc, during emit_notes. */
488 static htab_t dropped_values;
490 /* Empty shared hashtable. */
491 static shared_hash empty_shared_hash;
493 /* Scratch register bitmap used by cselib_expand_value_rtx. */
494 static bitmap scratch_regs = NULL;
496 #ifdef HAVE_window_save
497 typedef struct GTY(()) parm_reg {
502 DEF_VEC_O(parm_reg_t);
503 DEF_VEC_ALLOC_O(parm_reg_t, gc);
505 /* Vector of windowed parameter registers, if any. */
506 static VEC(parm_reg_t, gc) *windowed_parm_regs = NULL;
509 /* Variable used to tell whether cselib_process_insn called our hook. */
510 static bool cselib_hook_called;
512 /* Local function prototypes. */
513 static void stack_adjust_offset_pre_post (rtx, HOST_WIDE_INT *,
515 static void insn_stack_adjust_offset_pre_post (rtx, HOST_WIDE_INT *,
517 static bool vt_stack_adjustments (void);
518 static hashval_t variable_htab_hash (const void *);
519 static int variable_htab_eq (const void *, const void *);
520 static void variable_htab_free (void *);
522 static void init_attrs_list_set (attrs *);
523 static void attrs_list_clear (attrs *);
524 static attrs attrs_list_member (attrs, decl_or_value, HOST_WIDE_INT);
525 static void attrs_list_insert (attrs *, decl_or_value, HOST_WIDE_INT, rtx);
526 static void attrs_list_copy (attrs *, attrs);
527 static void attrs_list_union (attrs *, attrs);
529 static void **unshare_variable (dataflow_set *set, void **slot, variable var,
530 enum var_init_status);
531 static void vars_copy (htab_t, htab_t);
532 static tree var_debug_decl (tree);
533 static void var_reg_set (dataflow_set *, rtx, enum var_init_status, rtx);
534 static void var_reg_delete_and_set (dataflow_set *, rtx, bool,
535 enum var_init_status, rtx);
536 static void var_reg_delete (dataflow_set *, rtx, bool);
537 static void var_regno_delete (dataflow_set *, int);
538 static void var_mem_set (dataflow_set *, rtx, enum var_init_status, rtx);
539 static void var_mem_delete_and_set (dataflow_set *, rtx, bool,
540 enum var_init_status, rtx);
541 static void var_mem_delete (dataflow_set *, rtx, bool);
543 static void dataflow_set_init (dataflow_set *);
544 static void dataflow_set_clear (dataflow_set *);
545 static void dataflow_set_copy (dataflow_set *, dataflow_set *);
546 static int variable_union_info_cmp_pos (const void *, const void *);
547 static void dataflow_set_union (dataflow_set *, dataflow_set *);
548 static location_chain find_loc_in_1pdv (rtx, variable, htab_t);
549 static bool canon_value_cmp (rtx, rtx);
550 static int loc_cmp (rtx, rtx);
551 static bool variable_part_different_p (variable_part *, variable_part *);
552 static bool onepart_variable_different_p (variable, variable);
553 static bool variable_different_p (variable, variable);
554 static bool dataflow_set_different (dataflow_set *, dataflow_set *);
555 static void dataflow_set_destroy (dataflow_set *);
557 static bool contains_symbol_ref (rtx);
558 static bool track_expr_p (tree, bool);
559 static bool same_variable_part_p (rtx, tree, HOST_WIDE_INT);
560 static int add_uses (rtx *, void *);
561 static void add_uses_1 (rtx *, void *);
562 static void add_stores (rtx, const_rtx, void *);
563 static bool compute_bb_dataflow (basic_block);
564 static bool vt_find_locations (void);
566 static void dump_attrs_list (attrs);
567 static int dump_var_slot (void **, void *);
568 static void dump_var (variable);
569 static void dump_vars (htab_t);
570 static void dump_dataflow_set (dataflow_set *);
571 static void dump_dataflow_sets (void);
573 static void set_dv_changed (decl_or_value, bool);
574 static void variable_was_changed (variable, dataflow_set *);
575 static void **set_slot_part (dataflow_set *, rtx, void **,
576 decl_or_value, HOST_WIDE_INT,
577 enum var_init_status, rtx);
578 static void set_variable_part (dataflow_set *, rtx,
579 decl_or_value, HOST_WIDE_INT,
580 enum var_init_status, rtx, enum insert_option);
581 static void **clobber_slot_part (dataflow_set *, rtx,
582 void **, HOST_WIDE_INT, rtx);
583 static void clobber_variable_part (dataflow_set *, rtx,
584 decl_or_value, HOST_WIDE_INT, rtx);
585 static void **delete_slot_part (dataflow_set *, rtx, void **, HOST_WIDE_INT);
586 static void delete_variable_part (dataflow_set *, rtx,
587 decl_or_value, HOST_WIDE_INT);
588 static int emit_note_insn_var_location (void **, void *);
589 static void emit_notes_for_changes (rtx, enum emit_note_where, shared_hash);
590 static int emit_notes_for_differences_1 (void **, void *);
591 static int emit_notes_for_differences_2 (void **, void *);
592 static void emit_notes_for_differences (rtx, dataflow_set *, dataflow_set *);
593 static void emit_notes_in_bb (basic_block, dataflow_set *);
594 static void vt_emit_notes (void);
596 static bool vt_get_decl_and_offset (rtx, tree *, HOST_WIDE_INT *);
597 static void vt_add_function_parameters (void);
598 static bool vt_initialize (void);
599 static void vt_finalize (void);
601 /* Given a SET, calculate the amount of stack adjustment it contains
602 PRE- and POST-modifying stack pointer.
603 This function is similar to stack_adjust_offset. */
606 stack_adjust_offset_pre_post (rtx pattern, HOST_WIDE_INT *pre,
609 rtx src = SET_SRC (pattern);
610 rtx dest = SET_DEST (pattern);
613 if (dest == stack_pointer_rtx)
615 /* (set (reg sp) (plus (reg sp) (const_int))) */
616 code = GET_CODE (src);
617 if (! (code == PLUS || code == MINUS)
618 || XEXP (src, 0) != stack_pointer_rtx
619 || !CONST_INT_P (XEXP (src, 1)))
623 *post += INTVAL (XEXP (src, 1));
625 *post -= INTVAL (XEXP (src, 1));
627 else if (MEM_P (dest))
629 /* (set (mem (pre_dec (reg sp))) (foo)) */
630 src = XEXP (dest, 0);
631 code = GET_CODE (src);
637 if (XEXP (src, 0) == stack_pointer_rtx)
639 rtx val = XEXP (XEXP (src, 1), 1);
640 /* We handle only adjustments by constant amount. */
641 gcc_assert (GET_CODE (XEXP (src, 1)) == PLUS &&
644 if (code == PRE_MODIFY)
645 *pre -= INTVAL (val);
647 *post -= INTVAL (val);
653 if (XEXP (src, 0) == stack_pointer_rtx)
655 *pre += GET_MODE_SIZE (GET_MODE (dest));
661 if (XEXP (src, 0) == stack_pointer_rtx)
663 *post += GET_MODE_SIZE (GET_MODE (dest));
669 if (XEXP (src, 0) == stack_pointer_rtx)
671 *pre -= GET_MODE_SIZE (GET_MODE (dest));
677 if (XEXP (src, 0) == stack_pointer_rtx)
679 *post -= GET_MODE_SIZE (GET_MODE (dest));
690 /* Given an INSN, calculate the amount of stack adjustment it contains
691 PRE- and POST-modifying stack pointer. */
694 insn_stack_adjust_offset_pre_post (rtx insn, HOST_WIDE_INT *pre,
702 pattern = PATTERN (insn);
703 if (RTX_FRAME_RELATED_P (insn))
705 rtx expr = find_reg_note (insn, REG_FRAME_RELATED_EXPR, NULL_RTX);
707 pattern = XEXP (expr, 0);
710 if (GET_CODE (pattern) == SET)
711 stack_adjust_offset_pre_post (pattern, pre, post);
712 else if (GET_CODE (pattern) == PARALLEL
713 || GET_CODE (pattern) == SEQUENCE)
717 /* There may be stack adjustments inside compound insns. Search
719 for ( i = XVECLEN (pattern, 0) - 1; i >= 0; i--)
720 if (GET_CODE (XVECEXP (pattern, 0, i)) == SET)
721 stack_adjust_offset_pre_post (XVECEXP (pattern, 0, i), pre, post);
725 /* Compute stack adjustments for all blocks by traversing DFS tree.
726 Return true when the adjustments on all incoming edges are consistent.
727 Heavily borrowed from pre_and_rev_post_order_compute. */
730 vt_stack_adjustments (void)
732 edge_iterator *stack;
735 /* Initialize entry block. */
736 VTI (ENTRY_BLOCK_PTR)->visited = true;
737 VTI (ENTRY_BLOCK_PTR)->in.stack_adjust = INCOMING_FRAME_SP_OFFSET;
738 VTI (ENTRY_BLOCK_PTR)->out.stack_adjust = INCOMING_FRAME_SP_OFFSET;
740 /* Allocate stack for back-tracking up CFG. */
741 stack = XNEWVEC (edge_iterator, n_basic_blocks + 1);
744 /* Push the first edge on to the stack. */
745 stack[sp++] = ei_start (ENTRY_BLOCK_PTR->succs);
753 /* Look at the edge on the top of the stack. */
755 src = ei_edge (ei)->src;
756 dest = ei_edge (ei)->dest;
758 /* Check if the edge destination has been visited yet. */
759 if (!VTI (dest)->visited)
762 HOST_WIDE_INT pre, post, offset;
763 VTI (dest)->visited = true;
764 VTI (dest)->in.stack_adjust = offset = VTI (src)->out.stack_adjust;
766 if (dest != EXIT_BLOCK_PTR)
767 for (insn = BB_HEAD (dest);
768 insn != NEXT_INSN (BB_END (dest));
769 insn = NEXT_INSN (insn))
772 insn_stack_adjust_offset_pre_post (insn, &pre, &post);
773 offset += pre + post;
776 VTI (dest)->out.stack_adjust = offset;
778 if (EDGE_COUNT (dest->succs) > 0)
779 /* Since the DEST node has been visited for the first
780 time, check its successors. */
781 stack[sp++] = ei_start (dest->succs);
785 /* Check whether the adjustments on the edges are the same. */
786 if (VTI (dest)->in.stack_adjust != VTI (src)->out.stack_adjust)
792 if (! ei_one_before_end_p (ei))
793 /* Go to the next edge. */
794 ei_next (&stack[sp - 1]);
796 /* Return to previous level if there are no more edges. */
805 /* arg_pointer_rtx resp. frame_pointer_rtx if stack_pointer_rtx or
806 hard_frame_pointer_rtx is being mapped to it and offset for it. */
807 static rtx cfa_base_rtx;
808 static HOST_WIDE_INT cfa_base_offset;
810 /* Compute a CFA-based value for an ADJUSTMENT made to stack_pointer_rtx
811 or hard_frame_pointer_rtx. */
814 compute_cfa_pointer (HOST_WIDE_INT adjustment)
816 return plus_constant (Pmode, cfa_base_rtx, adjustment + cfa_base_offset);
819 /* Adjustment for hard_frame_pointer_rtx to cfa base reg,
820 or -1 if the replacement shouldn't be done. */
821 static HOST_WIDE_INT hard_frame_pointer_adjustment = -1;
823 /* Data for adjust_mems callback. */
825 struct adjust_mem_data
828 enum machine_mode mem_mode;
829 HOST_WIDE_INT stack_adjust;
833 /* Helper for adjust_mems. Return 1 if *loc is unsuitable for
834 transformation of wider mode arithmetics to narrower mode,
835 -1 if it is suitable and subexpressions shouldn't be
836 traversed and 0 if it is suitable and subexpressions should
837 be traversed. Called through for_each_rtx. */
840 use_narrower_mode_test (rtx *loc, void *data)
842 rtx subreg = (rtx) data;
844 if (CONSTANT_P (*loc))
846 switch (GET_CODE (*loc))
849 if (cselib_lookup (*loc, GET_MODE (SUBREG_REG (subreg)), 0, VOIDmode))
851 if (!validate_subreg (GET_MODE (subreg), GET_MODE (*loc),
852 *loc, subreg_lowpart_offset (GET_MODE (subreg),
861 if (for_each_rtx (&XEXP (*loc, 0), use_narrower_mode_test, data))
870 /* Transform X into narrower mode MODE from wider mode WMODE. */
873 use_narrower_mode (rtx x, enum machine_mode mode, enum machine_mode wmode)
877 return lowpart_subreg (mode, x, wmode);
878 switch (GET_CODE (x))
881 return lowpart_subreg (mode, x, wmode);
885 op0 = use_narrower_mode (XEXP (x, 0), mode, wmode);
886 op1 = use_narrower_mode (XEXP (x, 1), mode, wmode);
887 return simplify_gen_binary (GET_CODE (x), mode, op0, op1);
889 op0 = use_narrower_mode (XEXP (x, 0), mode, wmode);
890 return simplify_gen_binary (ASHIFT, mode, op0, XEXP (x, 1));
896 /* Helper function for adjusting used MEMs. */
899 adjust_mems (rtx loc, const_rtx old_rtx, void *data)
901 struct adjust_mem_data *amd = (struct adjust_mem_data *) data;
902 rtx mem, addr = loc, tem;
903 enum machine_mode mem_mode_save;
905 switch (GET_CODE (loc))
908 /* Don't do any sp or fp replacements outside of MEM addresses
910 if (amd->mem_mode == VOIDmode && amd->store)
912 if (loc == stack_pointer_rtx
913 && !frame_pointer_needed
915 return compute_cfa_pointer (amd->stack_adjust);
916 else if (loc == hard_frame_pointer_rtx
917 && frame_pointer_needed
918 && hard_frame_pointer_adjustment != -1
920 return compute_cfa_pointer (hard_frame_pointer_adjustment);
921 gcc_checking_assert (loc != virtual_incoming_args_rtx);
927 mem = targetm.delegitimize_address (mem);
928 if (mem != loc && !MEM_P (mem))
929 return simplify_replace_fn_rtx (mem, old_rtx, adjust_mems, data);
932 addr = XEXP (mem, 0);
933 mem_mode_save = amd->mem_mode;
934 amd->mem_mode = GET_MODE (mem);
935 store_save = amd->store;
937 addr = simplify_replace_fn_rtx (addr, old_rtx, adjust_mems, data);
938 amd->store = store_save;
939 amd->mem_mode = mem_mode_save;
941 addr = targetm.delegitimize_address (addr);
942 if (addr != XEXP (mem, 0))
943 mem = replace_equiv_address_nv (mem, addr);
945 mem = avoid_constant_pool_reference (mem);
949 addr = gen_rtx_PLUS (GET_MODE (loc), XEXP (loc, 0),
950 GEN_INT (GET_CODE (loc) == PRE_INC
951 ? GET_MODE_SIZE (amd->mem_mode)
952 : -GET_MODE_SIZE (amd->mem_mode)));
956 addr = XEXP (loc, 0);
957 gcc_assert (amd->mem_mode != VOIDmode && amd->mem_mode != BLKmode);
958 addr = simplify_replace_fn_rtx (addr, old_rtx, adjust_mems, data);
959 tem = gen_rtx_PLUS (GET_MODE (loc), XEXP (loc, 0),
960 GEN_INT ((GET_CODE (loc) == PRE_INC
961 || GET_CODE (loc) == POST_INC)
962 ? GET_MODE_SIZE (amd->mem_mode)
963 : -GET_MODE_SIZE (amd->mem_mode)));
964 amd->side_effects = alloc_EXPR_LIST (0,
965 gen_rtx_SET (VOIDmode,
971 addr = XEXP (loc, 1);
974 addr = XEXP (loc, 0);
975 gcc_assert (amd->mem_mode != VOIDmode);
976 addr = simplify_replace_fn_rtx (addr, old_rtx, adjust_mems, data);
977 amd->side_effects = alloc_EXPR_LIST (0,
978 gen_rtx_SET (VOIDmode,
984 /* First try without delegitimization of whole MEMs and
985 avoid_constant_pool_reference, which is more likely to succeed. */
986 store_save = amd->store;
988 addr = simplify_replace_fn_rtx (SUBREG_REG (loc), old_rtx, adjust_mems,
990 amd->store = store_save;
991 mem = simplify_replace_fn_rtx (addr, old_rtx, adjust_mems, data);
992 if (mem == SUBREG_REG (loc))
997 tem = simplify_gen_subreg (GET_MODE (loc), mem,
998 GET_MODE (SUBREG_REG (loc)),
1002 tem = simplify_gen_subreg (GET_MODE (loc), addr,
1003 GET_MODE (SUBREG_REG (loc)),
1005 if (tem == NULL_RTX)
1006 tem = gen_rtx_raw_SUBREG (GET_MODE (loc), addr, SUBREG_BYTE (loc));
1008 if (MAY_HAVE_DEBUG_INSNS
1009 && GET_CODE (tem) == SUBREG
1010 && (GET_CODE (SUBREG_REG (tem)) == PLUS
1011 || GET_CODE (SUBREG_REG (tem)) == MINUS
1012 || GET_CODE (SUBREG_REG (tem)) == MULT
1013 || GET_CODE (SUBREG_REG (tem)) == ASHIFT)
1014 && GET_MODE_CLASS (GET_MODE (tem)) == MODE_INT
1015 && GET_MODE_CLASS (GET_MODE (SUBREG_REG (tem))) == MODE_INT
1016 && GET_MODE_SIZE (GET_MODE (tem))
1017 < GET_MODE_SIZE (GET_MODE (SUBREG_REG (tem)))
1018 && subreg_lowpart_p (tem)
1019 && !for_each_rtx (&SUBREG_REG (tem), use_narrower_mode_test, tem))
1020 return use_narrower_mode (SUBREG_REG (tem), GET_MODE (tem),
1021 GET_MODE (SUBREG_REG (tem)));
1024 /* Don't do any replacements in second and following
1025 ASM_OPERANDS of inline-asm with multiple sets.
1026 ASM_OPERANDS_INPUT_VEC, ASM_OPERANDS_INPUT_CONSTRAINT_VEC
1027 and ASM_OPERANDS_LABEL_VEC need to be equal between
1028 all the ASM_OPERANDs in the insn and adjust_insn will
1030 if (ASM_OPERANDS_OUTPUT_IDX (loc) != 0)
1039 /* Helper function for replacement of uses. */
1042 adjust_mem_uses (rtx *x, void *data)
1044 rtx new_x = simplify_replace_fn_rtx (*x, NULL_RTX, adjust_mems, data);
1046 validate_change (NULL_RTX, x, new_x, true);
1049 /* Helper function for replacement of stores. */
1052 adjust_mem_stores (rtx loc, const_rtx expr, void *data)
1056 rtx new_dest = simplify_replace_fn_rtx (SET_DEST (expr), NULL_RTX,
1058 if (new_dest != SET_DEST (expr))
1060 rtx xexpr = CONST_CAST_RTX (expr);
1061 validate_change (NULL_RTX, &SET_DEST (xexpr), new_dest, true);
1066 /* Simplify INSN. Remove all {PRE,POST}_{INC,DEC,MODIFY} rtxes,
1067 replace them with their value in the insn and add the side-effects
1068 as other sets to the insn. */
1071 adjust_insn (basic_block bb, rtx insn)
1073 struct adjust_mem_data amd;
1076 #ifdef HAVE_window_save
1077 /* If the target machine has an explicit window save instruction, the
1078 transformation OUTGOING_REGNO -> INCOMING_REGNO is done there. */
1079 if (RTX_FRAME_RELATED_P (insn)
1080 && find_reg_note (insn, REG_CFA_WINDOW_SAVE, NULL_RTX))
1082 unsigned int i, nregs = VEC_length(parm_reg_t, windowed_parm_regs);
1083 rtx rtl = gen_rtx_PARALLEL (VOIDmode, rtvec_alloc (nregs * 2));
1086 FOR_EACH_VEC_ELT (parm_reg_t, windowed_parm_regs, i, p)
1088 XVECEXP (rtl, 0, i * 2)
1089 = gen_rtx_SET (VOIDmode, p->incoming, p->outgoing);
1090 /* Do not clobber the attached DECL, but only the REG. */
1091 XVECEXP (rtl, 0, i * 2 + 1)
1092 = gen_rtx_CLOBBER (GET_MODE (p->outgoing),
1093 gen_raw_REG (GET_MODE (p->outgoing),
1094 REGNO (p->outgoing)));
1097 validate_change (NULL_RTX, &PATTERN (insn), rtl, true);
1102 amd.mem_mode = VOIDmode;
1103 amd.stack_adjust = -VTI (bb)->out.stack_adjust;
1104 amd.side_effects = NULL_RTX;
1107 note_stores (PATTERN (insn), adjust_mem_stores, &amd);
1110 if (GET_CODE (PATTERN (insn)) == PARALLEL
1111 && asm_noperands (PATTERN (insn)) > 0
1112 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET)
1117 /* inline-asm with multiple sets is tiny bit more complicated,
1118 because the 3 vectors in ASM_OPERANDS need to be shared between
1119 all ASM_OPERANDS in the instruction. adjust_mems will
1120 not touch ASM_OPERANDS other than the first one, asm_noperands
1121 test above needs to be called before that (otherwise it would fail)
1122 and afterwards this code fixes it up. */
1123 note_uses (&PATTERN (insn), adjust_mem_uses, &amd);
1124 body = PATTERN (insn);
1125 set0 = XVECEXP (body, 0, 0);
1126 gcc_checking_assert (GET_CODE (set0) == SET
1127 && GET_CODE (SET_SRC (set0)) == ASM_OPERANDS
1128 && ASM_OPERANDS_OUTPUT_IDX (SET_SRC (set0)) == 0);
1129 for (i = 1; i < XVECLEN (body, 0); i++)
1130 if (GET_CODE (XVECEXP (body, 0, i)) != SET)
1134 set = XVECEXP (body, 0, i);
1135 gcc_checking_assert (GET_CODE (SET_SRC (set)) == ASM_OPERANDS
1136 && ASM_OPERANDS_OUTPUT_IDX (SET_SRC (set))
1138 if (ASM_OPERANDS_INPUT_VEC (SET_SRC (set))
1139 != ASM_OPERANDS_INPUT_VEC (SET_SRC (set0))
1140 || ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set))
1141 != ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set0))
1142 || ASM_OPERANDS_LABEL_VEC (SET_SRC (set))
1143 != ASM_OPERANDS_LABEL_VEC (SET_SRC (set0)))
1145 rtx newsrc = shallow_copy_rtx (SET_SRC (set));
1146 ASM_OPERANDS_INPUT_VEC (newsrc)
1147 = ASM_OPERANDS_INPUT_VEC (SET_SRC (set0));
1148 ASM_OPERANDS_INPUT_CONSTRAINT_VEC (newsrc)
1149 = ASM_OPERANDS_INPUT_CONSTRAINT_VEC (SET_SRC (set0));
1150 ASM_OPERANDS_LABEL_VEC (newsrc)
1151 = ASM_OPERANDS_LABEL_VEC (SET_SRC (set0));
1152 validate_change (NULL_RTX, &SET_SRC (set), newsrc, true);
1157 note_uses (&PATTERN (insn), adjust_mem_uses, &amd);
1159 /* For read-only MEMs containing some constant, prefer those
1161 set = single_set (insn);
1162 if (set && MEM_P (SET_SRC (set)) && MEM_READONLY_P (SET_SRC (set)))
1164 rtx note = find_reg_equal_equiv_note (insn);
1166 if (note && CONSTANT_P (XEXP (note, 0)))
1167 validate_change (NULL_RTX, &SET_SRC (set), XEXP (note, 0), true);
1170 if (amd.side_effects)
1172 rtx *pat, new_pat, s;
1175 pat = &PATTERN (insn);
1176 if (GET_CODE (*pat) == COND_EXEC)
1177 pat = &COND_EXEC_CODE (*pat);
1178 if (GET_CODE (*pat) == PARALLEL)
1179 oldn = XVECLEN (*pat, 0);
1182 for (s = amd.side_effects, newn = 0; s; newn++)
1184 new_pat = gen_rtx_PARALLEL (VOIDmode, rtvec_alloc (oldn + newn));
1185 if (GET_CODE (*pat) == PARALLEL)
1186 for (i = 0; i < oldn; i++)
1187 XVECEXP (new_pat, 0, i) = XVECEXP (*pat, 0, i);
1189 XVECEXP (new_pat, 0, 0) = *pat;
1190 for (s = amd.side_effects, i = oldn; i < oldn + newn; i++, s = XEXP (s, 1))
1191 XVECEXP (new_pat, 0, i) = XEXP (s, 0);
1192 free_EXPR_LIST_list (&amd.side_effects);
1193 validate_change (NULL_RTX, pat, new_pat, true);
1197 /* Return true if a decl_or_value DV is a DECL or NULL. */
1199 dv_is_decl_p (decl_or_value dv)
1201 return !dv || (int) TREE_CODE ((tree) dv) != (int) VALUE;
1204 /* Return true if a decl_or_value is a VALUE rtl. */
1206 dv_is_value_p (decl_or_value dv)
1208 return dv && !dv_is_decl_p (dv);
1211 /* Return the decl in the decl_or_value. */
1213 dv_as_decl (decl_or_value dv)
1215 gcc_checking_assert (dv_is_decl_p (dv));
1219 /* Return the value in the decl_or_value. */
1221 dv_as_value (decl_or_value dv)
1223 gcc_checking_assert (dv_is_value_p (dv));
1227 /* Return the DEBUG_EXPR of a DEBUG_EXPR_DECL or the VALUE in DV. */
1229 dv_as_rtx (decl_or_value dv)
1233 if (dv_is_value_p (dv))
1234 return dv_as_value (dv);
1236 decl = dv_as_decl (dv);
1238 gcc_checking_assert (TREE_CODE (decl) == DEBUG_EXPR_DECL);
1239 return DECL_RTL_KNOWN_SET (decl);
1242 /* Return the opaque pointer in the decl_or_value. */
1243 static inline void *
1244 dv_as_opaque (decl_or_value dv)
1249 /* Return nonzero if a decl_or_value must not have more than one
1250 variable part. The returned value discriminates among various
1251 kinds of one-part DVs ccording to enum onepart_enum. */
1252 static inline onepart_enum_t
1253 dv_onepart_p (decl_or_value dv)
1257 if (!MAY_HAVE_DEBUG_INSNS)
1260 if (dv_is_value_p (dv))
1261 return ONEPART_VALUE;
1263 decl = dv_as_decl (dv);
1265 if (TREE_CODE (decl) == DEBUG_EXPR_DECL)
1266 return ONEPART_DEXPR;
1268 if (target_for_debug_bind (decl) != NULL_TREE)
1269 return ONEPART_VDECL;
1274 /* Return the variable pool to be used for a dv of type ONEPART. */
1275 static inline alloc_pool
1276 onepart_pool (onepart_enum_t onepart)
1278 return onepart ? valvar_pool : var_pool;
1281 /* Build a decl_or_value out of a decl. */
1282 static inline decl_or_value
1283 dv_from_decl (tree decl)
1287 gcc_checking_assert (dv_is_decl_p (dv));
1291 /* Build a decl_or_value out of a value. */
1292 static inline decl_or_value
1293 dv_from_value (rtx value)
1297 gcc_checking_assert (dv_is_value_p (dv));
1301 /* Return a value or the decl of a debug_expr as a decl_or_value. */
1302 static inline decl_or_value
1307 switch (GET_CODE (x))
1310 dv = dv_from_decl (DEBUG_EXPR_TREE_DECL (x));
1311 gcc_checking_assert (DECL_RTL_KNOWN_SET (DEBUG_EXPR_TREE_DECL (x)) == x);
1315 dv = dv_from_value (x);
1325 extern void debug_dv (decl_or_value dv);
1328 debug_dv (decl_or_value dv)
1330 if (dv_is_value_p (dv))
1331 debug_rtx (dv_as_value (dv));
1333 debug_generic_stmt (dv_as_decl (dv));
1336 typedef unsigned int dvuid;
1338 /* Return the uid of DV. */
1341 dv_uid (decl_or_value dv)
1343 if (dv_is_value_p (dv))
1344 return CSELIB_VAL_PTR (dv_as_value (dv))->uid;
1346 return DECL_UID (dv_as_decl (dv));
1349 /* Compute the hash from the uid. */
1351 static inline hashval_t
1352 dv_uid2hash (dvuid uid)
1357 /* The hash function for a mask table in a shared_htab chain. */
1359 static inline hashval_t
1360 dv_htab_hash (decl_or_value dv)
1362 return dv_uid2hash (dv_uid (dv));
1365 /* The hash function for variable_htab, computes the hash value
1366 from the declaration of variable X. */
1369 variable_htab_hash (const void *x)
1371 const_variable const v = (const_variable) x;
1373 return dv_htab_hash (v->dv);
1376 /* Compare the declaration of variable X with declaration Y. */
1379 variable_htab_eq (const void *x, const void *y)
1381 const_variable const v = (const_variable) x;
1382 decl_or_value dv = CONST_CAST2 (decl_or_value, const void *, y);
1384 return (dv_as_opaque (v->dv) == dv_as_opaque (dv));
1387 static void loc_exp_dep_clear (variable var);
1389 /* Free the element of VARIABLE_HTAB (its type is struct variable_def). */
1392 variable_htab_free (void *elem)
1395 variable var = (variable) elem;
1396 location_chain node, next;
1398 gcc_checking_assert (var->refcount > 0);
1401 if (var->refcount > 0)
1404 for (i = 0; i < var->n_var_parts; i++)
1406 for (node = var->var_part[i].loc_chain; node; node = next)
1409 pool_free (loc_chain_pool, node);
1411 var->var_part[i].loc_chain = NULL;
1413 if (var->onepart && VAR_LOC_1PAUX (var))
1415 loc_exp_dep_clear (var);
1416 if (VAR_LOC_DEP_LST (var))
1417 VAR_LOC_DEP_LST (var)->pprev = NULL;
1418 XDELETE (VAR_LOC_1PAUX (var));
1419 /* These may be reused across functions, so reset
1421 if (var->onepart == ONEPART_DEXPR)
1422 set_dv_changed (var->dv, true);
1424 pool_free (onepart_pool (var->onepart), var);
1427 /* Initialize the set (array) SET of attrs to empty lists. */
1430 init_attrs_list_set (attrs *set)
1434 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1438 /* Make the list *LISTP empty. */
1441 attrs_list_clear (attrs *listp)
1445 for (list = *listp; list; list = next)
1448 pool_free (attrs_pool, list);
1453 /* Return true if the pair of DECL and OFFSET is the member of the LIST. */
1456 attrs_list_member (attrs list, decl_or_value dv, HOST_WIDE_INT offset)
1458 for (; list; list = list->next)
1459 if (dv_as_opaque (list->dv) == dv_as_opaque (dv) && list->offset == offset)
1464 /* Insert the triplet DECL, OFFSET, LOC to the list *LISTP. */
1467 attrs_list_insert (attrs *listp, decl_or_value dv,
1468 HOST_WIDE_INT offset, rtx loc)
1472 list = (attrs) pool_alloc (attrs_pool);
1475 list->offset = offset;
1476 list->next = *listp;
1480 /* Copy all nodes from SRC and create a list *DSTP of the copies. */
1483 attrs_list_copy (attrs *dstp, attrs src)
1487 attrs_list_clear (dstp);
1488 for (; src; src = src->next)
1490 n = (attrs) pool_alloc (attrs_pool);
1493 n->offset = src->offset;
1499 /* Add all nodes from SRC which are not in *DSTP to *DSTP. */
1502 attrs_list_union (attrs *dstp, attrs src)
1504 for (; src; src = src->next)
1506 if (!attrs_list_member (*dstp, src->dv, src->offset))
1507 attrs_list_insert (dstp, src->dv, src->offset, src->loc);
1511 /* Combine nodes that are not onepart nodes from SRC and SRC2 into
1515 attrs_list_mpdv_union (attrs *dstp, attrs src, attrs src2)
1517 gcc_assert (!*dstp);
1518 for (; src; src = src->next)
1520 if (!dv_onepart_p (src->dv))
1521 attrs_list_insert (dstp, src->dv, src->offset, src->loc);
1523 for (src = src2; src; src = src->next)
1525 if (!dv_onepart_p (src->dv)
1526 && !attrs_list_member (*dstp, src->dv, src->offset))
1527 attrs_list_insert (dstp, src->dv, src->offset, src->loc);
1531 /* Shared hashtable support. */
1533 /* Return true if VARS is shared. */
1536 shared_hash_shared (shared_hash vars)
1538 return vars->refcount > 1;
1541 /* Return the hash table for VARS. */
1543 static inline htab_t
1544 shared_hash_htab (shared_hash vars)
1549 /* Return true if VAR is shared, or maybe because VARS is shared. */
1552 shared_var_p (variable var, shared_hash vars)
1554 /* Don't count an entry in the changed_variables table as a duplicate. */
1555 return ((var->refcount > 1 + (int) var->in_changed_variables)
1556 || shared_hash_shared (vars));
1559 /* Copy variables into a new hash table. */
1562 shared_hash_unshare (shared_hash vars)
1564 shared_hash new_vars = (shared_hash) pool_alloc (shared_hash_pool);
1565 gcc_assert (vars->refcount > 1);
1566 new_vars->refcount = 1;
1568 = htab_create (htab_elements (vars->htab) + 3, variable_htab_hash,
1569 variable_htab_eq, variable_htab_free);
1570 vars_copy (new_vars->htab, vars->htab);
1575 /* Increment reference counter on VARS and return it. */
1577 static inline shared_hash
1578 shared_hash_copy (shared_hash vars)
1584 /* Decrement reference counter and destroy hash table if not shared
1588 shared_hash_destroy (shared_hash vars)
1590 gcc_checking_assert (vars->refcount > 0);
1591 if (--vars->refcount == 0)
1593 htab_delete (vars->htab);
1594 pool_free (shared_hash_pool, vars);
1598 /* Unshare *PVARS if shared and return slot for DV. If INS is
1599 INSERT, insert it if not already present. */
1601 static inline void **
1602 shared_hash_find_slot_unshare_1 (shared_hash *pvars, decl_or_value dv,
1603 hashval_t dvhash, enum insert_option ins)
1605 if (shared_hash_shared (*pvars))
1606 *pvars = shared_hash_unshare (*pvars);
1607 return htab_find_slot_with_hash (shared_hash_htab (*pvars), dv, dvhash, ins);
1610 static inline void **
1611 shared_hash_find_slot_unshare (shared_hash *pvars, decl_or_value dv,
1612 enum insert_option ins)
1614 return shared_hash_find_slot_unshare_1 (pvars, dv, dv_htab_hash (dv), ins);
1617 /* Return slot for DV, if it is already present in the hash table.
1618 If it is not present, insert it only VARS is not shared, otherwise
1621 static inline void **
1622 shared_hash_find_slot_1 (shared_hash vars, decl_or_value dv, hashval_t dvhash)
1624 return htab_find_slot_with_hash (shared_hash_htab (vars), dv, dvhash,
1625 shared_hash_shared (vars)
1626 ? NO_INSERT : INSERT);
1629 static inline void **
1630 shared_hash_find_slot (shared_hash vars, decl_or_value dv)
1632 return shared_hash_find_slot_1 (vars, dv, dv_htab_hash (dv));
1635 /* Return slot for DV only if it is already present in the hash table. */
1637 static inline void **
1638 shared_hash_find_slot_noinsert_1 (shared_hash vars, decl_or_value dv,
1641 return htab_find_slot_with_hash (shared_hash_htab (vars), dv, dvhash,
1645 static inline void **
1646 shared_hash_find_slot_noinsert (shared_hash vars, decl_or_value dv)
1648 return shared_hash_find_slot_noinsert_1 (vars, dv, dv_htab_hash (dv));
1651 /* Return variable for DV or NULL if not already present in the hash
1654 static inline variable
1655 shared_hash_find_1 (shared_hash vars, decl_or_value dv, hashval_t dvhash)
1657 return (variable) htab_find_with_hash (shared_hash_htab (vars), dv, dvhash);
1660 static inline variable
1661 shared_hash_find (shared_hash vars, decl_or_value dv)
1663 return shared_hash_find_1 (vars, dv, dv_htab_hash (dv));
1666 /* Return true if TVAL is better than CVAL as a canonival value. We
1667 choose lowest-numbered VALUEs, using the RTX address as a
1668 tie-breaker. The idea is to arrange them into a star topology,
1669 such that all of them are at most one step away from the canonical
1670 value, and the canonical value has backlinks to all of them, in
1671 addition to all the actual locations. We don't enforce this
1672 topology throughout the entire dataflow analysis, though.
1676 canon_value_cmp (rtx tval, rtx cval)
1679 || CSELIB_VAL_PTR (tval)->uid < CSELIB_VAL_PTR (cval)->uid;
1682 static bool dst_can_be_shared;
1684 /* Return a copy of a variable VAR and insert it to dataflow set SET. */
1687 unshare_variable (dataflow_set *set, void **slot, variable var,
1688 enum var_init_status initialized)
1693 new_var = (variable) pool_alloc (onepart_pool (var->onepart));
1694 new_var->dv = var->dv;
1695 new_var->refcount = 1;
1697 new_var->n_var_parts = var->n_var_parts;
1698 new_var->onepart = var->onepart;
1699 new_var->in_changed_variables = false;
1701 if (! flag_var_tracking_uninit)
1702 initialized = VAR_INIT_STATUS_INITIALIZED;
1704 for (i = 0; i < var->n_var_parts; i++)
1706 location_chain node;
1707 location_chain *nextp;
1709 if (i == 0 && var->onepart)
1711 /* One-part auxiliary data is only used while emitting
1712 notes, so propagate it to the new variable in the active
1713 dataflow set. If we're not emitting notes, this will be
1715 gcc_checking_assert (!VAR_LOC_1PAUX (var) || emit_notes);
1716 VAR_LOC_1PAUX (new_var) = VAR_LOC_1PAUX (var);
1717 VAR_LOC_1PAUX (var) = NULL;
1720 VAR_PART_OFFSET (new_var, i) = VAR_PART_OFFSET (var, i);
1721 nextp = &new_var->var_part[i].loc_chain;
1722 for (node = var->var_part[i].loc_chain; node; node = node->next)
1724 location_chain new_lc;
1726 new_lc = (location_chain) pool_alloc (loc_chain_pool);
1727 new_lc->next = NULL;
1728 if (node->init > initialized)
1729 new_lc->init = node->init;
1731 new_lc->init = initialized;
1732 if (node->set_src && !(MEM_P (node->set_src)))
1733 new_lc->set_src = node->set_src;
1735 new_lc->set_src = NULL;
1736 new_lc->loc = node->loc;
1739 nextp = &new_lc->next;
1742 new_var->var_part[i].cur_loc = var->var_part[i].cur_loc;
1745 dst_can_be_shared = false;
1746 if (shared_hash_shared (set->vars))
1747 slot = shared_hash_find_slot_unshare (&set->vars, var->dv, NO_INSERT);
1748 else if (set->traversed_vars && set->vars != set->traversed_vars)
1749 slot = shared_hash_find_slot_noinsert (set->vars, var->dv);
1751 if (var->in_changed_variables)
1754 = htab_find_slot_with_hash (changed_variables, var->dv,
1755 dv_htab_hash (var->dv), NO_INSERT);
1756 gcc_assert (*cslot == (void *) var);
1757 var->in_changed_variables = false;
1758 variable_htab_free (var);
1760 new_var->in_changed_variables = true;
1765 /* Copy all variables from hash table SRC to hash table DST. */
1768 vars_copy (htab_t dst, htab_t src)
1773 FOR_EACH_HTAB_ELEMENT (src, var, variable, hi)
1777 dstp = htab_find_slot_with_hash (dst, var->dv,
1778 dv_htab_hash (var->dv),
1784 /* Map a decl to its main debug decl. */
1787 var_debug_decl (tree decl)
1789 if (decl && DECL_P (decl)
1790 && DECL_DEBUG_EXPR_IS_FROM (decl))
1792 tree debugdecl = DECL_DEBUG_EXPR (decl);
1793 if (debugdecl && DECL_P (debugdecl))
1800 /* Set the register LOC to contain DV, OFFSET. */
1803 var_reg_decl_set (dataflow_set *set, rtx loc, enum var_init_status initialized,
1804 decl_or_value dv, HOST_WIDE_INT offset, rtx set_src,
1805 enum insert_option iopt)
1808 bool decl_p = dv_is_decl_p (dv);
1811 dv = dv_from_decl (var_debug_decl (dv_as_decl (dv)));
1813 for (node = set->regs[REGNO (loc)]; node; node = node->next)
1814 if (dv_as_opaque (node->dv) == dv_as_opaque (dv)
1815 && node->offset == offset)
1818 attrs_list_insert (&set->regs[REGNO (loc)], dv, offset, loc);
1819 set_variable_part (set, loc, dv, offset, initialized, set_src, iopt);
1822 /* Set the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). */
1825 var_reg_set (dataflow_set *set, rtx loc, enum var_init_status initialized,
1828 tree decl = REG_EXPR (loc);
1829 HOST_WIDE_INT offset = REG_OFFSET (loc);
1831 var_reg_decl_set (set, loc, initialized,
1832 dv_from_decl (decl), offset, set_src, INSERT);
1835 static enum var_init_status
1836 get_init_value (dataflow_set *set, rtx loc, decl_or_value dv)
1840 enum var_init_status ret_val = VAR_INIT_STATUS_UNKNOWN;
1842 if (! flag_var_tracking_uninit)
1843 return VAR_INIT_STATUS_INITIALIZED;
1845 var = shared_hash_find (set->vars, dv);
1848 for (i = 0; i < var->n_var_parts && ret_val == VAR_INIT_STATUS_UNKNOWN; i++)
1850 location_chain nextp;
1851 for (nextp = var->var_part[i].loc_chain; nextp; nextp = nextp->next)
1852 if (rtx_equal_p (nextp->loc, loc))
1854 ret_val = nextp->init;
1863 /* Delete current content of register LOC in dataflow set SET and set
1864 the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). If
1865 MODIFY is true, any other live copies of the same variable part are
1866 also deleted from the dataflow set, otherwise the variable part is
1867 assumed to be copied from another location holding the same
1871 var_reg_delete_and_set (dataflow_set *set, rtx loc, bool modify,
1872 enum var_init_status initialized, rtx set_src)
1874 tree decl = REG_EXPR (loc);
1875 HOST_WIDE_INT offset = REG_OFFSET (loc);
1879 decl = var_debug_decl (decl);
1881 if (initialized == VAR_INIT_STATUS_UNKNOWN)
1882 initialized = get_init_value (set, loc, dv_from_decl (decl));
1884 nextp = &set->regs[REGNO (loc)];
1885 for (node = *nextp; node; node = next)
1888 if (dv_as_opaque (node->dv) != decl || node->offset != offset)
1890 delete_variable_part (set, node->loc, node->dv, node->offset);
1891 pool_free (attrs_pool, node);
1897 nextp = &node->next;
1901 clobber_variable_part (set, loc, dv_from_decl (decl), offset, set_src);
1902 var_reg_set (set, loc, initialized, set_src);
1905 /* Delete the association of register LOC in dataflow set SET with any
1906 variables that aren't onepart. If CLOBBER is true, also delete any
1907 other live copies of the same variable part, and delete the
1908 association with onepart dvs too. */
1911 var_reg_delete (dataflow_set *set, rtx loc, bool clobber)
1913 attrs *nextp = &set->regs[REGNO (loc)];
1918 tree decl = REG_EXPR (loc);
1919 HOST_WIDE_INT offset = REG_OFFSET (loc);
1921 decl = var_debug_decl (decl);
1923 clobber_variable_part (set, NULL, dv_from_decl (decl), offset, NULL);
1926 for (node = *nextp; node; node = next)
1929 if (clobber || !dv_onepart_p (node->dv))
1931 delete_variable_part (set, node->loc, node->dv, node->offset);
1932 pool_free (attrs_pool, node);
1936 nextp = &node->next;
1940 /* Delete content of register with number REGNO in dataflow set SET. */
1943 var_regno_delete (dataflow_set *set, int regno)
1945 attrs *reg = &set->regs[regno];
1948 for (node = *reg; node; node = next)
1951 delete_variable_part (set, node->loc, node->dv, node->offset);
1952 pool_free (attrs_pool, node);
1957 /* Strip constant offsets and alignments off of LOC. Return the base
1961 vt_get_canonicalize_base (rtx loc)
1963 while ((GET_CODE (loc) == PLUS
1964 || GET_CODE (loc) == AND)
1965 && GET_CODE (XEXP (loc, 1)) == CONST_INT
1966 && (GET_CODE (loc) != AND
1967 || INTVAL (XEXP (loc, 1)) < 0))
1968 loc = XEXP (loc, 0);
1973 /* Canonicalize LOC using equivalences from SET in addition to those
1974 in the cselib static table. */
1977 vt_canonicalize_addr (dataflow_set *set, rtx oloc)
1979 HOST_WIDE_INT ofst = 0;
1980 enum machine_mode mode = GET_MODE (oloc);
1981 rtx loc = canon_rtx (get_addr (oloc));
1983 /* Try to substitute a base VALUE for equivalent expressions as much
1984 as possible. The goal here is to expand stack-related addresses
1985 to one of the stack base registers, so that we can compare
1986 addresses for overlaps. */
1987 while (GET_CODE (vt_get_canonicalize_base (loc)) == VALUE)
1994 while (GET_CODE (loc) == PLUS)
1996 ofst += INTVAL (XEXP (loc, 1));
1997 loc = XEXP (loc, 0);
2001 /* Alignment operations can't normally be combined, so just
2002 canonicalize the base and we're done. We'll normally have
2003 only one stack alignment anyway. */
2004 if (GET_CODE (loc) == AND)
2006 x = vt_canonicalize_addr (set, XEXP (loc, 0));
2007 if (x != XEXP (loc, 0))
2008 loc = gen_rtx_AND (mode, x, XEXP (loc, 1));
2009 loc = canon_rtx (get_addr (loc));
2013 x = canon_rtx (get_addr (loc));
2015 /* We've made progress! Start over. */
2016 if (x != loc || GET_CODE (x) != VALUE)
2022 dv = dv_from_rtx (x);
2023 var = (variable) htab_find_with_hash (shared_hash_htab (set->vars),
2024 dv, dv_htab_hash (dv));
2028 /* Look for an improved equivalent expression. */
2029 for (l = var->var_part[0].loc_chain; l; l = l->next)
2031 rtx base = vt_get_canonicalize_base (l->loc);
2032 if (GET_CODE (base) == REG
2033 || (GET_CODE (base) == VALUE
2034 && canon_value_cmp (base, loc)))
2041 /* No luck with the dataflow set, so we're done. */
2046 /* Add OFST back in. */
2049 /* Don't build new RTL if we can help it. */
2050 if (GET_CODE (oloc) == PLUS
2051 && XEXP (oloc, 0) == loc
2052 && INTVAL (XEXP (oloc, 1)) == ofst)
2055 loc = plus_constant (mode, loc, ofst);
2061 /* Return true iff ADDR has a stack register as the base address. */
2064 vt_stack_offset_p (rtx addr)
2066 rtx base = vt_get_canonicalize_base (addr);
2068 if (GET_CODE (base) != REG)
2071 return REGNO_PTR_FRAME_P (REGNO (base));
2074 /* Return true iff there's a true dependence between MLOC and LOC.
2075 MADDR must be a canonicalized version of MLOC's address. */
2078 vt_canon_true_dep (dataflow_set *set, rtx mloc, rtx maddr, rtx loc)
2080 if (GET_CODE (loc) != MEM)
2083 if (!canon_true_dependence (mloc, GET_MODE (mloc), maddr, loc, NULL))
2086 if (!MEM_EXPR (loc) && vt_stack_offset_p (maddr))
2088 rtx addr = vt_canonicalize_addr (set, XEXP (loc, 0));
2089 return canon_true_dependence (mloc, GET_MODE (mloc), maddr, loc, addr);
2095 /* Hold parameters for the hashtab traversal function
2096 drop_overlapping_mem_locs, see below. */
2098 struct overlapping_mems
2104 /* Remove all MEMs that overlap with COMS->LOC from the location list
2105 of a hash table entry for a value. COMS->ADDR must be a
2106 canonicalized form of COMS->LOC's address, and COMS->LOC must be
2107 canonicalized itself. */
2110 drop_overlapping_mem_locs (void **slot, void *data)
2112 struct overlapping_mems *coms = (struct overlapping_mems *)data;
2113 dataflow_set *set = coms->set;
2114 rtx mloc = coms->loc, addr = coms->addr;
2115 variable var = (variable) *slot;
2117 if (var->onepart == ONEPART_VALUE)
2119 location_chain loc, *locp;
2120 bool changed = false;
2123 gcc_assert (var->n_var_parts == 1);
2125 if (shared_var_p (var, set->vars))
2127 for (loc = var->var_part[0].loc_chain; loc; loc = loc->next)
2128 if (vt_canon_true_dep (set, mloc, addr, loc->loc))
2134 slot = unshare_variable (set, slot, var, VAR_INIT_STATUS_UNKNOWN);
2135 var = (variable)*slot;
2136 gcc_assert (var->n_var_parts == 1);
2139 if (VAR_LOC_1PAUX (var))
2140 cur_loc = VAR_LOC_FROM (var);
2142 cur_loc = var->var_part[0].cur_loc;
2144 for (locp = &var->var_part[0].loc_chain, loc = *locp;
2147 if (!vt_canon_true_dep (set, mloc, addr, loc->loc))
2154 /* If we have deleted the location which was last emitted
2155 we have to emit new location so add the variable to set
2156 of changed variables. */
2157 if (cur_loc == loc->loc)
2160 var->var_part[0].cur_loc = NULL;
2161 if (VAR_LOC_1PAUX (var))
2162 VAR_LOC_FROM (var) = NULL;
2164 pool_free (loc_chain_pool, loc);
2167 if (!var->var_part[0].loc_chain)
2173 variable_was_changed (var, set);
2179 /* Remove from SET all VALUE bindings to MEMs that overlap with LOC. */
2182 clobber_overlapping_mems (dataflow_set *set, rtx loc)
2184 struct overlapping_mems coms;
2187 coms.loc = canon_rtx (loc);
2188 coms.addr = vt_canonicalize_addr (set, XEXP (loc, 0));
2190 set->traversed_vars = set->vars;
2191 htab_traverse (shared_hash_htab (set->vars),
2192 drop_overlapping_mem_locs, &coms);
2193 set->traversed_vars = NULL;
2196 /* Set the location of DV, OFFSET as the MEM LOC. */
2199 var_mem_decl_set (dataflow_set *set, rtx loc, enum var_init_status initialized,
2200 decl_or_value dv, HOST_WIDE_INT offset, rtx set_src,
2201 enum insert_option iopt)
2203 if (dv_is_decl_p (dv))
2204 dv = dv_from_decl (var_debug_decl (dv_as_decl (dv)));
2206 set_variable_part (set, loc, dv, offset, initialized, set_src, iopt);
2209 /* Set the location part of variable MEM_EXPR (LOC) in dataflow set
2211 Adjust the address first if it is stack pointer based. */
2214 var_mem_set (dataflow_set *set, rtx loc, enum var_init_status initialized,
2217 tree decl = MEM_EXPR (loc);
2218 HOST_WIDE_INT offset = INT_MEM_OFFSET (loc);
2220 var_mem_decl_set (set, loc, initialized,
2221 dv_from_decl (decl), offset, set_src, INSERT);
2224 /* Delete and set the location part of variable MEM_EXPR (LOC) in
2225 dataflow set SET to LOC. If MODIFY is true, any other live copies
2226 of the same variable part are also deleted from the dataflow set,
2227 otherwise the variable part is assumed to be copied from another
2228 location holding the same part.
2229 Adjust the address first if it is stack pointer based. */
2232 var_mem_delete_and_set (dataflow_set *set, rtx loc, bool modify,
2233 enum var_init_status initialized, rtx set_src)
2235 tree decl = MEM_EXPR (loc);
2236 HOST_WIDE_INT offset = INT_MEM_OFFSET (loc);
2238 clobber_overlapping_mems (set, loc);
2239 decl = var_debug_decl (decl);
2241 if (initialized == VAR_INIT_STATUS_UNKNOWN)
2242 initialized = get_init_value (set, loc, dv_from_decl (decl));
2245 clobber_variable_part (set, NULL, dv_from_decl (decl), offset, set_src);
2246 var_mem_set (set, loc, initialized, set_src);
2249 /* Delete the location part LOC from dataflow set SET. If CLOBBER is
2250 true, also delete any other live copies of the same variable part.
2251 Adjust the address first if it is stack pointer based. */
2254 var_mem_delete (dataflow_set *set, rtx loc, bool clobber)
2256 tree decl = MEM_EXPR (loc);
2257 HOST_WIDE_INT offset = INT_MEM_OFFSET (loc);
2259 clobber_overlapping_mems (set, loc);
2260 decl = var_debug_decl (decl);
2262 clobber_variable_part (set, NULL, dv_from_decl (decl), offset, NULL);
2263 delete_variable_part (set, loc, dv_from_decl (decl), offset);
2266 /* Return true if LOC should not be expanded for location expressions,
2270 unsuitable_loc (rtx loc)
2272 switch (GET_CODE (loc))
2286 /* Bind VAL to LOC in SET. If MODIFIED, detach LOC from any values
2290 val_bind (dataflow_set *set, rtx val, rtx loc, bool modified)
2295 var_regno_delete (set, REGNO (loc));
2296 var_reg_decl_set (set, loc, VAR_INIT_STATUS_INITIALIZED,
2297 dv_from_value (val), 0, NULL_RTX, INSERT);
2299 else if (MEM_P (loc))
2301 struct elt_loc_list *l = CSELIB_VAL_PTR (val)->locs;
2304 clobber_overlapping_mems (set, loc);
2306 if (l && GET_CODE (l->loc) == VALUE)
2307 l = canonical_cselib_val (CSELIB_VAL_PTR (l->loc))->locs;
2309 /* If this MEM is a global constant, we don't need it in the
2310 dynamic tables. ??? We should test this before emitting the
2311 micro-op in the first place. */
2313 if (GET_CODE (l->loc) == MEM && XEXP (l->loc, 0) == XEXP (loc, 0))
2319 var_mem_decl_set (set, loc, VAR_INIT_STATUS_INITIALIZED,
2320 dv_from_value (val), 0, NULL_RTX, INSERT);
2324 /* Other kinds of equivalences are necessarily static, at least
2325 so long as we do not perform substitutions while merging
2328 set_variable_part (set, loc, dv_from_value (val), 0,
2329 VAR_INIT_STATUS_INITIALIZED, NULL_RTX, INSERT);
2333 /* Bind a value to a location it was just stored in. If MODIFIED
2334 holds, assume the location was modified, detaching it from any
2335 values bound to it. */
2338 val_store (dataflow_set *set, rtx val, rtx loc, rtx insn, bool modified)
2340 cselib_val *v = CSELIB_VAL_PTR (val);
2342 gcc_assert (cselib_preserved_value_p (v));
2346 fprintf (dump_file, "%i: ", insn ? INSN_UID (insn) : 0);
2347 print_inline_rtx (dump_file, loc, 0);
2348 fprintf (dump_file, " evaluates to ");
2349 print_inline_rtx (dump_file, val, 0);
2352 struct elt_loc_list *l;
2353 for (l = v->locs; l; l = l->next)
2355 fprintf (dump_file, "\n%i: ", INSN_UID (l->setting_insn));
2356 print_inline_rtx (dump_file, l->loc, 0);
2359 fprintf (dump_file, "\n");
2362 gcc_checking_assert (!unsuitable_loc (loc));
2364 val_bind (set, val, loc, modified);
2367 /* Reset this node, detaching all its equivalences. Return the slot
2368 in the variable hash table that holds dv, if there is one. */
2371 val_reset (dataflow_set *set, decl_or_value dv)
2373 variable var = shared_hash_find (set->vars, dv) ;
2374 location_chain node;
2377 if (!var || !var->n_var_parts)
2380 gcc_assert (var->n_var_parts == 1);
2383 for (node = var->var_part[0].loc_chain; node; node = node->next)
2384 if (GET_CODE (node->loc) == VALUE
2385 && canon_value_cmp (node->loc, cval))
2388 for (node = var->var_part[0].loc_chain; node; node = node->next)
2389 if (GET_CODE (node->loc) == VALUE && cval != node->loc)
2391 /* Redirect the equivalence link to the new canonical
2392 value, or simply remove it if it would point at
2395 set_variable_part (set, cval, dv_from_value (node->loc),
2396 0, node->init, node->set_src, NO_INSERT);
2397 delete_variable_part (set, dv_as_value (dv),
2398 dv_from_value (node->loc), 0);
2403 decl_or_value cdv = dv_from_value (cval);
2405 /* Keep the remaining values connected, accummulating links
2406 in the canonical value. */
2407 for (node = var->var_part[0].loc_chain; node; node = node->next)
2409 if (node->loc == cval)
2411 else if (GET_CODE (node->loc) == REG)
2412 var_reg_decl_set (set, node->loc, node->init, cdv, 0,
2413 node->set_src, NO_INSERT);
2414 else if (GET_CODE (node->loc) == MEM)
2415 var_mem_decl_set (set, node->loc, node->init, cdv, 0,
2416 node->set_src, NO_INSERT);
2418 set_variable_part (set, node->loc, cdv, 0,
2419 node->init, node->set_src, NO_INSERT);
2423 /* We remove this last, to make sure that the canonical value is not
2424 removed to the point of requiring reinsertion. */
2426 delete_variable_part (set, dv_as_value (dv), dv_from_value (cval), 0);
2428 clobber_variable_part (set, NULL, dv, 0, NULL);
2431 /* Find the values in a given location and map the val to another
2432 value, if it is unique, or add the location as one holding the
2436 val_resolve (dataflow_set *set, rtx val, rtx loc, rtx insn)
2438 decl_or_value dv = dv_from_value (val);
2440 if (dump_file && (dump_flags & TDF_DETAILS))
2443 fprintf (dump_file, "%i: ", INSN_UID (insn));
2445 fprintf (dump_file, "head: ");
2446 print_inline_rtx (dump_file, val, 0);
2447 fputs (" is at ", dump_file);
2448 print_inline_rtx (dump_file, loc, 0);
2449 fputc ('\n', dump_file);
2452 val_reset (set, dv);
2454 gcc_checking_assert (!unsuitable_loc (loc));
2458 attrs node, found = NULL;
2460 for (node = set->regs[REGNO (loc)]; node; node = node->next)
2461 if (dv_is_value_p (node->dv)
2462 && GET_MODE (dv_as_value (node->dv)) == GET_MODE (loc))
2466 /* Map incoming equivalences. ??? Wouldn't it be nice if
2467 we just started sharing the location lists? Maybe a
2468 circular list ending at the value itself or some
2470 set_variable_part (set, dv_as_value (node->dv),
2471 dv_from_value (val), node->offset,
2472 VAR_INIT_STATUS_INITIALIZED, NULL_RTX, INSERT);
2473 set_variable_part (set, val, node->dv, node->offset,
2474 VAR_INIT_STATUS_INITIALIZED, NULL_RTX, INSERT);
2477 /* If we didn't find any equivalence, we need to remember that
2478 this value is held in the named register. */
2482 /* ??? Attempt to find and merge equivalent MEMs or other
2485 val_bind (set, val, loc, false);
2488 /* Initialize dataflow set SET to be empty.
2489 VARS_SIZE is the initial size of hash table VARS. */
2492 dataflow_set_init (dataflow_set *set)
2494 init_attrs_list_set (set->regs);
2495 set->vars = shared_hash_copy (empty_shared_hash);
2496 set->stack_adjust = 0;
2497 set->traversed_vars = NULL;
2500 /* Delete the contents of dataflow set SET. */
2503 dataflow_set_clear (dataflow_set *set)
2507 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
2508 attrs_list_clear (&set->regs[i]);
2510 shared_hash_destroy (set->vars);
2511 set->vars = shared_hash_copy (empty_shared_hash);
2514 /* Copy the contents of dataflow set SRC to DST. */
2517 dataflow_set_copy (dataflow_set *dst, dataflow_set *src)
2521 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
2522 attrs_list_copy (&dst->regs[i], src->regs[i]);
2524 shared_hash_destroy (dst->vars);
2525 dst->vars = shared_hash_copy (src->vars);
2526 dst->stack_adjust = src->stack_adjust;
2529 /* Information for merging lists of locations for a given offset of variable.
2531 struct variable_union_info
2533 /* Node of the location chain. */
2536 /* The sum of positions in the input chains. */
2539 /* The position in the chain of DST dataflow set. */
2543 /* Buffer for location list sorting and its allocated size. */
2544 static struct variable_union_info *vui_vec;
2545 static int vui_allocated;
2547 /* Compare function for qsort, order the structures by POS element. */
2550 variable_union_info_cmp_pos (const void *n1, const void *n2)
2552 const struct variable_union_info *const i1 =
2553 (const struct variable_union_info *) n1;
2554 const struct variable_union_info *const i2 =
2555 ( const struct variable_union_info *) n2;
2557 if (i1->pos != i2->pos)
2558 return i1->pos - i2->pos;
2560 return (i1->pos_dst - i2->pos_dst);
2563 /* Compute union of location parts of variable *SLOT and the same variable
2564 from hash table DATA. Compute "sorted" union of the location chains
2565 for common offsets, i.e. the locations of a variable part are sorted by
2566 a priority where the priority is the sum of the positions in the 2 chains
2567 (if a location is only in one list the position in the second list is
2568 defined to be larger than the length of the chains).
2569 When we are updating the location parts the newest location is in the
2570 beginning of the chain, so when we do the described "sorted" union
2571 we keep the newest locations in the beginning. */
2574 variable_union (variable src, dataflow_set *set)
2580 dstp = shared_hash_find_slot (set->vars, src->dv);
2581 if (!dstp || !*dstp)
2585 dst_can_be_shared = false;
2587 dstp = shared_hash_find_slot_unshare (&set->vars, src->dv, INSERT);
2591 /* Continue traversing the hash table. */
2595 dst = (variable) *dstp;
2597 gcc_assert (src->n_var_parts);
2598 gcc_checking_assert (src->onepart == dst->onepart);
2600 /* We can combine one-part variables very efficiently, because their
2601 entries are in canonical order. */
2604 location_chain *nodep, dnode, snode;
2606 gcc_assert (src->n_var_parts == 1
2607 && dst->n_var_parts == 1);
2609 snode = src->var_part[0].loc_chain;
2612 restart_onepart_unshared:
2613 nodep = &dst->var_part[0].loc_chain;
2619 int r = dnode ? loc_cmp (dnode->loc, snode->loc) : 1;
2623 location_chain nnode;
2625 if (shared_var_p (dst, set->vars))
2627 dstp = unshare_variable (set, dstp, dst,
2628 VAR_INIT_STATUS_INITIALIZED);
2629 dst = (variable)*dstp;
2630 goto restart_onepart_unshared;
2633 *nodep = nnode = (location_chain) pool_alloc (loc_chain_pool);
2634 nnode->loc = snode->loc;
2635 nnode->init = snode->init;
2636 if (!snode->set_src || MEM_P (snode->set_src))
2637 nnode->set_src = NULL;
2639 nnode->set_src = snode->set_src;
2640 nnode->next = dnode;
2644 gcc_checking_assert (rtx_equal_p (dnode->loc, snode->loc));
2647 snode = snode->next;
2649 nodep = &dnode->next;
2656 gcc_checking_assert (!src->onepart);
2658 /* Count the number of location parts, result is K. */
2659 for (i = 0, j = 0, k = 0;
2660 i < src->n_var_parts && j < dst->n_var_parts; k++)
2662 if (VAR_PART_OFFSET (src, i) == VAR_PART_OFFSET (dst, j))
2667 else if (VAR_PART_OFFSET (src, i) < VAR_PART_OFFSET (dst, j))
2672 k += src->n_var_parts - i;
2673 k += dst->n_var_parts - j;
2675 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
2676 thus there are at most MAX_VAR_PARTS different offsets. */
2677 gcc_checking_assert (dst->onepart ? k == 1 : k <= MAX_VAR_PARTS);
2679 if (dst->n_var_parts != k && shared_var_p (dst, set->vars))
2681 dstp = unshare_variable (set, dstp, dst, VAR_INIT_STATUS_UNKNOWN);
2682 dst = (variable)*dstp;
2685 i = src->n_var_parts - 1;
2686 j = dst->n_var_parts - 1;
2687 dst->n_var_parts = k;
2689 for (k--; k >= 0; k--)
2691 location_chain node, node2;
2693 if (i >= 0 && j >= 0
2694 && VAR_PART_OFFSET (src, i) == VAR_PART_OFFSET (dst, j))
2696 /* Compute the "sorted" union of the chains, i.e. the locations which
2697 are in both chains go first, they are sorted by the sum of
2698 positions in the chains. */
2701 struct variable_union_info *vui;
2703 /* If DST is shared compare the location chains.
2704 If they are different we will modify the chain in DST with
2705 high probability so make a copy of DST. */
2706 if (shared_var_p (dst, set->vars))
2708 for (node = src->var_part[i].loc_chain,
2709 node2 = dst->var_part[j].loc_chain; node && node2;
2710 node = node->next, node2 = node2->next)
2712 if (!((REG_P (node2->loc)
2713 && REG_P (node->loc)
2714 && REGNO (node2->loc) == REGNO (node->loc))
2715 || rtx_equal_p (node2->loc, node->loc)))
2717 if (node2->init < node->init)
2718 node2->init = node->init;
2724 dstp = unshare_variable (set, dstp, dst,
2725 VAR_INIT_STATUS_UNKNOWN);
2726 dst = (variable)*dstp;
2731 for (node = src->var_part[i].loc_chain; node; node = node->next)
2734 for (node = dst->var_part[j].loc_chain; node; node = node->next)
2739 /* The most common case, much simpler, no qsort is needed. */
2740 location_chain dstnode = dst->var_part[j].loc_chain;
2741 dst->var_part[k].loc_chain = dstnode;
2742 VAR_PART_OFFSET (dst, k) = VAR_PART_OFFSET(dst, j);
2744 for (node = src->var_part[i].loc_chain; node; node = node->next)
2745 if (!((REG_P (dstnode->loc)
2746 && REG_P (node->loc)
2747 && REGNO (dstnode->loc) == REGNO (node->loc))
2748 || rtx_equal_p (dstnode->loc, node->loc)))
2750 location_chain new_node;
2752 /* Copy the location from SRC. */
2753 new_node = (location_chain) pool_alloc (loc_chain_pool);
2754 new_node->loc = node->loc;
2755 new_node->init = node->init;
2756 if (!node->set_src || MEM_P (node->set_src))
2757 new_node->set_src = NULL;
2759 new_node->set_src = node->set_src;
2760 node2->next = new_node;
2767 if (src_l + dst_l > vui_allocated)
2769 vui_allocated = MAX (vui_allocated * 2, src_l + dst_l);
2770 vui_vec = XRESIZEVEC (struct variable_union_info, vui_vec,
2775 /* Fill in the locations from DST. */
2776 for (node = dst->var_part[j].loc_chain, jj = 0; node;
2777 node = node->next, jj++)
2780 vui[jj].pos_dst = jj;
2782 /* Pos plus value larger than a sum of 2 valid positions. */
2783 vui[jj].pos = jj + src_l + dst_l;
2786 /* Fill in the locations from SRC. */
2788 for (node = src->var_part[i].loc_chain, ii = 0; node;
2789 node = node->next, ii++)
2791 /* Find location from NODE. */
2792 for (jj = 0; jj < dst_l; jj++)
2794 if ((REG_P (vui[jj].lc->loc)
2795 && REG_P (node->loc)
2796 && REGNO (vui[jj].lc->loc) == REGNO (node->loc))
2797 || rtx_equal_p (vui[jj].lc->loc, node->loc))
2799 vui[jj].pos = jj + ii;
2803 if (jj >= dst_l) /* The location has not been found. */
2805 location_chain new_node;
2807 /* Copy the location from SRC. */
2808 new_node = (location_chain) pool_alloc (loc_chain_pool);
2809 new_node->loc = node->loc;
2810 new_node->init = node->init;
2811 if (!node->set_src || MEM_P (node->set_src))
2812 new_node->set_src = NULL;
2814 new_node->set_src = node->set_src;
2815 vui[n].lc = new_node;
2816 vui[n].pos_dst = src_l + dst_l;
2817 vui[n].pos = ii + src_l + dst_l;
2824 /* Special case still very common case. For dst_l == 2
2825 all entries dst_l ... n-1 are sorted, with for i >= dst_l
2826 vui[i].pos == i + src_l + dst_l. */
2827 if (vui[0].pos > vui[1].pos)
2829 /* Order should be 1, 0, 2... */
2830 dst->var_part[k].loc_chain = vui[1].lc;
2831 vui[1].lc->next = vui[0].lc;
2834 vui[0].lc->next = vui[2].lc;
2835 vui[n - 1].lc->next = NULL;
2838 vui[0].lc->next = NULL;
2843 dst->var_part[k].loc_chain = vui[0].lc;
2844 if (n >= 3 && vui[2].pos < vui[1].pos)
2846 /* Order should be 0, 2, 1, 3... */
2847 vui[0].lc->next = vui[2].lc;
2848 vui[2].lc->next = vui[1].lc;
2851 vui[1].lc->next = vui[3].lc;
2852 vui[n - 1].lc->next = NULL;
2855 vui[1].lc->next = NULL;
2860 /* Order should be 0, 1, 2... */
2862 vui[n - 1].lc->next = NULL;
2865 for (; ii < n; ii++)
2866 vui[ii - 1].lc->next = vui[ii].lc;
2870 qsort (vui, n, sizeof (struct variable_union_info),
2871 variable_union_info_cmp_pos);
2873 /* Reconnect the nodes in sorted order. */
2874 for (ii = 1; ii < n; ii++)
2875 vui[ii - 1].lc->next = vui[ii].lc;
2876 vui[n - 1].lc->next = NULL;
2877 dst->var_part[k].loc_chain = vui[0].lc;
2880 VAR_PART_OFFSET (dst, k) = VAR_PART_OFFSET (dst, j);
2885 else if ((i >= 0 && j >= 0
2886 && VAR_PART_OFFSET (src, i) < VAR_PART_OFFSET (dst, j))
2889 dst->var_part[k] = dst->var_part[j];
2892 else if ((i >= 0 && j >= 0
2893 && VAR_PART_OFFSET (src, i) > VAR_PART_OFFSET (dst, j))
2896 location_chain *nextp;
2898 /* Copy the chain from SRC. */
2899 nextp = &dst->var_part[k].loc_chain;
2900 for (node = src->var_part[i].loc_chain; node; node = node->next)
2902 location_chain new_lc;
2904 new_lc = (location_chain) pool_alloc (loc_chain_pool);
2905 new_lc->next = NULL;
2906 new_lc->init = node->init;
2907 if (!node->set_src || MEM_P (node->set_src))
2908 new_lc->set_src = NULL;
2910 new_lc->set_src = node->set_src;
2911 new_lc->loc = node->loc;
2914 nextp = &new_lc->next;
2917 VAR_PART_OFFSET (dst, k) = VAR_PART_OFFSET (src, i);
2920 dst->var_part[k].cur_loc = NULL;
2923 if (flag_var_tracking_uninit)
2924 for (i = 0; i < src->n_var_parts && i < dst->n_var_parts; i++)
2926 location_chain node, node2;
2927 for (node = src->var_part[i].loc_chain; node; node = node->next)
2928 for (node2 = dst->var_part[i].loc_chain; node2; node2 = node2->next)
2929 if (rtx_equal_p (node->loc, node2->loc))
2931 if (node->init > node2->init)
2932 node2->init = node->init;
2936 /* Continue traversing the hash table. */
2940 /* Compute union of dataflow sets SRC and DST and store it to DST. */
2943 dataflow_set_union (dataflow_set *dst, dataflow_set *src)
2947 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
2948 attrs_list_union (&dst->regs[i], src->regs[i]);
2950 if (dst->vars == empty_shared_hash)
2952 shared_hash_destroy (dst->vars);
2953 dst->vars = shared_hash_copy (src->vars);
2960 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (src->vars), var, variable, hi)
2961 variable_union (var, dst);
2965 /* Whether the value is currently being expanded. */
2966 #define VALUE_RECURSED_INTO(x) \
2967 (RTL_FLAG_CHECK2 ("VALUE_RECURSED_INTO", (x), VALUE, DEBUG_EXPR)->used)
2969 /* Whether no expansion was found, saving useless lookups.
2970 It must only be set when VALUE_CHANGED is clear. */
2971 #define NO_LOC_P(x) \
2972 (RTL_FLAG_CHECK2 ("NO_LOC_P", (x), VALUE, DEBUG_EXPR)->return_val)
2974 /* Whether cur_loc in the value needs to be (re)computed. */
2975 #define VALUE_CHANGED(x) \
2976 (RTL_FLAG_CHECK1 ("VALUE_CHANGED", (x), VALUE)->frame_related)
2977 /* Whether cur_loc in the decl needs to be (re)computed. */
2978 #define DECL_CHANGED(x) TREE_VISITED (x)
2980 /* Record (if NEWV) that DV needs to have its cur_loc recomputed. For
2981 user DECLs, this means they're in changed_variables. Values and
2982 debug exprs may be left with this flag set if no user variable
2983 requires them to be evaluated. */
2986 set_dv_changed (decl_or_value dv, bool newv)
2988 switch (dv_onepart_p (dv))
2992 NO_LOC_P (dv_as_value (dv)) = false;
2993 VALUE_CHANGED (dv_as_value (dv)) = newv;
2998 NO_LOC_P (DECL_RTL_KNOWN_SET (dv_as_decl (dv))) = false;
2999 /* Fall through... */
3002 DECL_CHANGED (dv_as_decl (dv)) = newv;
3007 /* Return true if DV needs to have its cur_loc recomputed. */
3010 dv_changed_p (decl_or_value dv)
3012 return (dv_is_value_p (dv)
3013 ? VALUE_CHANGED (dv_as_value (dv))
3014 : DECL_CHANGED (dv_as_decl (dv)));
3017 /* Return a location list node whose loc is rtx_equal to LOC, in the
3018 location list of a one-part variable or value VAR, or in that of
3019 any values recursively mentioned in the location lists. VARS must
3020 be in star-canonical form. */
3022 static location_chain
3023 find_loc_in_1pdv (rtx loc, variable var, htab_t vars)
3025 location_chain node;
3026 enum rtx_code loc_code;
3031 gcc_checking_assert (var->onepart);
3033 if (!var->n_var_parts)
3036 gcc_checking_assert (loc != dv_as_opaque (var->dv));
3038 loc_code = GET_CODE (loc);
3039 for (node = var->var_part[0].loc_chain; node; node = node->next)
3044 if (GET_CODE (node->loc) != loc_code)
3046 if (GET_CODE (node->loc) != VALUE)
3049 else if (loc == node->loc)
3051 else if (loc_code != VALUE)
3053 if (rtx_equal_p (loc, node->loc))
3058 /* Since we're in star-canonical form, we don't need to visit
3059 non-canonical nodes: one-part variables and non-canonical
3060 values would only point back to the canonical node. */
3061 if (dv_is_value_p (var->dv)
3062 && !canon_value_cmp (node->loc, dv_as_value (var->dv)))
3064 /* Skip all subsequent VALUEs. */
3065 while (node->next && GET_CODE (node->next->loc) == VALUE)
3068 gcc_checking_assert (!canon_value_cmp (node->loc,
3069 dv_as_value (var->dv)));
3070 if (loc == node->loc)
3076 gcc_checking_assert (node == var->var_part[0].loc_chain);
3077 gcc_checking_assert (!node->next);
3079 dv = dv_from_value (node->loc);
3080 rvar = (variable) htab_find_with_hash (vars, dv, dv_htab_hash (dv));
3081 return find_loc_in_1pdv (loc, rvar, vars);
3084 /* ??? Gotta look in cselib_val locations too. */
3089 /* Hash table iteration argument passed to variable_merge. */
3092 /* The set in which the merge is to be inserted. */
3094 /* The set that we're iterating in. */
3096 /* The set that may contain the other dv we are to merge with. */
3098 /* Number of onepart dvs in src. */
3099 int src_onepart_cnt;
3102 /* Insert LOC in *DNODE, if it's not there yet. The list must be in
3103 loc_cmp order, and it is maintained as such. */
3106 insert_into_intersection (location_chain *nodep, rtx loc,
3107 enum var_init_status status)
3109 location_chain node;
3112 for (node = *nodep; node; nodep = &node->next, node = *nodep)
3113 if ((r = loc_cmp (node->loc, loc)) == 0)
3115 node->init = MIN (node->init, status);
3121 node = (location_chain) pool_alloc (loc_chain_pool);
3124 node->set_src = NULL;
3125 node->init = status;
3126 node->next = *nodep;
3130 /* Insert in DEST the intersection of the locations present in both
3131 S1NODE and S2VAR, directly or indirectly. S1NODE is from a
3132 variable in DSM->cur, whereas S2VAR is from DSM->src. dvar is in
3136 intersect_loc_chains (rtx val, location_chain *dest, struct dfset_merge *dsm,
3137 location_chain s1node, variable s2var)
3139 dataflow_set *s1set = dsm->cur;
3140 dataflow_set *s2set = dsm->src;
3141 location_chain found;
3145 location_chain s2node;
3147 gcc_checking_assert (s2var->onepart);
3149 if (s2var->n_var_parts)
3151 s2node = s2var->var_part[0].loc_chain;
3153 for (; s1node && s2node;
3154 s1node = s1node->next, s2node = s2node->next)
3155 if (s1node->loc != s2node->loc)
3157 else if (s1node->loc == val)
3160 insert_into_intersection (dest, s1node->loc,
3161 MIN (s1node->init, s2node->init));
3165 for (; s1node; s1node = s1node->next)
3167 if (s1node->loc == val)
3170 if ((found = find_loc_in_1pdv (s1node->loc, s2var,
3171 shared_hash_htab (s2set->vars))))
3173 insert_into_intersection (dest, s1node->loc,
3174 MIN (s1node->init, found->init));
3178 if (GET_CODE (s1node->loc) == VALUE
3179 && !VALUE_RECURSED_INTO (s1node->loc))
3181 decl_or_value dv = dv_from_value (s1node->loc);
3182 variable svar = shared_hash_find (s1set->vars, dv);
3185 if (svar->n_var_parts == 1)
3187 VALUE_RECURSED_INTO (s1node->loc) = true;
3188 intersect_loc_chains (val, dest, dsm,
3189 svar->var_part[0].loc_chain,
3191 VALUE_RECURSED_INTO (s1node->loc) = false;
3196 /* ??? gotta look in cselib_val locations too. */
3198 /* ??? if the location is equivalent to any location in src,
3199 searched recursively
3201 add to dst the values needed to represent the equivalence
3203 telling whether locations S is equivalent to another dv's
3206 for each location D in the list
3208 if S and D satisfy rtx_equal_p, then it is present
3210 else if D is a value, recurse without cycles
3212 else if S and D have the same CODE and MODE
3214 for each operand oS and the corresponding oD
3216 if oS and oD are not equivalent, then S an D are not equivalent
3218 else if they are RTX vectors
3220 if any vector oS element is not equivalent to its respective oD,
3221 then S and D are not equivalent
3229 /* Return -1 if X should be before Y in a location list for a 1-part
3230 variable, 1 if Y should be before X, and 0 if they're equivalent
3231 and should not appear in the list. */
3234 loc_cmp (rtx x, rtx y)
3237 RTX_CODE code = GET_CODE (x);
3247 gcc_assert (GET_MODE (x) == GET_MODE (y));
3248 if (REGNO (x) == REGNO (y))
3250 else if (REGNO (x) < REGNO (y))
3263 gcc_assert (GET_MODE (x) == GET_MODE (y));
3264 return loc_cmp (XEXP (x, 0), XEXP (y, 0));
3270 if (GET_CODE (x) == VALUE)
3272 if (GET_CODE (y) != VALUE)
3274 /* Don't assert the modes are the same, that is true only
3275 when not recursing. (subreg:QI (value:SI 1:1) 0)
3276 and (subreg:QI (value:DI 2:2) 0) can be compared,
3277 even when the modes are different. */
3278 if (canon_value_cmp (x, y))
3284 if (GET_CODE (y) == VALUE)
3287 /* Entry value is the least preferable kind of expression. */
3288 if (GET_CODE (x) == ENTRY_VALUE)
3290 if (GET_CODE (y) != ENTRY_VALUE)
3292 gcc_assert (GET_MODE (x) == GET_MODE (y));
3293 return loc_cmp (ENTRY_VALUE_EXP (x), ENTRY_VALUE_EXP (y));
3296 if (GET_CODE (y) == ENTRY_VALUE)
3299 if (GET_CODE (x) == GET_CODE (y))
3300 /* Compare operands below. */;
3301 else if (GET_CODE (x) < GET_CODE (y))
3306 gcc_assert (GET_MODE (x) == GET_MODE (y));
3308 if (GET_CODE (x) == DEBUG_EXPR)
3310 if (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x))
3311 < DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y)))
3313 gcc_checking_assert (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x))
3314 > DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y)));
3318 fmt = GET_RTX_FORMAT (code);
3319 for (i = 0; i < GET_RTX_LENGTH (code); i++)
3323 if (XWINT (x, i) == XWINT (y, i))
3325 else if (XWINT (x, i) < XWINT (y, i))
3332 if (XINT (x, i) == XINT (y, i))
3334 else if (XINT (x, i) < XINT (y, i))
3341 /* Compare the vector length first. */
3342 if (XVECLEN (x, i) == XVECLEN (y, i))
3343 /* Compare the vectors elements. */;
3344 else if (XVECLEN (x, i) < XVECLEN (y, i))
3349 for (j = 0; j < XVECLEN (x, i); j++)
3350 if ((r = loc_cmp (XVECEXP (x, i, j),
3351 XVECEXP (y, i, j))))
3356 if ((r = loc_cmp (XEXP (x, i), XEXP (y, i))))
3362 if (XSTR (x, i) == XSTR (y, i))
3368 if ((r = strcmp (XSTR (x, i), XSTR (y, i))) == 0)
3376 /* These are just backpointers, so they don't matter. */
3383 /* It is believed that rtx's at this level will never
3384 contain anything but integers and other rtx's,
3385 except for within LABEL_REFs and SYMBOL_REFs. */
3394 /* Check the order of entries in one-part variables. */
3397 canonicalize_loc_order_check (void **slot, void *data ATTRIBUTE_UNUSED)
3399 variable var = (variable) *slot;
3400 location_chain node, next;
3402 #ifdef ENABLE_RTL_CHECKING
3404 for (i = 0; i < var->n_var_parts; i++)
3405 gcc_assert (var->var_part[0].cur_loc == NULL);
3406 gcc_assert (!var->in_changed_variables);
3412 gcc_assert (var->n_var_parts == 1);
3413 node = var->var_part[0].loc_chain;
3416 while ((next = node->next))
3418 gcc_assert (loc_cmp (node->loc, next->loc) < 0);
3426 /* Mark with VALUE_RECURSED_INTO values that have neighbors that are
3427 more likely to be chosen as canonical for an equivalence set.
3428 Ensure less likely values can reach more likely neighbors, making
3429 the connections bidirectional. */
3432 canonicalize_values_mark (void **slot, void *data)
3434 dataflow_set *set = (dataflow_set *)data;
3435 variable var = (variable) *slot;
3436 decl_or_value dv = var->dv;
3438 location_chain node;
3440 if (!dv_is_value_p (dv))
3443 gcc_checking_assert (var->n_var_parts == 1);
3445 val = dv_as_value (dv);
3447 for (node = var->var_part[0].loc_chain; node; node = node->next)
3448 if (GET_CODE (node->loc) == VALUE)
3450 if (canon_value_cmp (node->loc, val))
3451 VALUE_RECURSED_INTO (val) = true;
3454 decl_or_value odv = dv_from_value (node->loc);
3455 void **oslot = shared_hash_find_slot_noinsert (set->vars, odv);
3457 set_slot_part (set, val, oslot, odv, 0,
3458 node->init, NULL_RTX);
3460 VALUE_RECURSED_INTO (node->loc) = true;
3467 /* Remove redundant entries from equivalence lists in onepart
3468 variables, canonicalizing equivalence sets into star shapes. */
3471 canonicalize_values_star (void **slot, void *data)
3473 dataflow_set *set = (dataflow_set *)data;
3474 variable var = (variable) *slot;
3475 decl_or_value dv = var->dv;
3476 location_chain node;
3486 gcc_checking_assert (var->n_var_parts == 1);
3488 if (dv_is_value_p (dv))
3490 cval = dv_as_value (dv);
3491 if (!VALUE_RECURSED_INTO (cval))
3493 VALUE_RECURSED_INTO (cval) = false;
3503 gcc_assert (var->n_var_parts == 1);
3505 for (node = var->var_part[0].loc_chain; node; node = node->next)
3506 if (GET_CODE (node->loc) == VALUE)
3509 if (VALUE_RECURSED_INTO (node->loc))
3511 if (canon_value_cmp (node->loc, cval))
3520 if (!has_marks || dv_is_decl_p (dv))
3523 /* Keep it marked so that we revisit it, either after visiting a
3524 child node, or after visiting a new parent that might be
3526 VALUE_RECURSED_INTO (val) = true;
3528 for (node = var->var_part[0].loc_chain; node; node = node->next)
3529 if (GET_CODE (node->loc) == VALUE
3530 && VALUE_RECURSED_INTO (node->loc))
3534 VALUE_RECURSED_INTO (cval) = false;
3535 dv = dv_from_value (cval);
3536 slot = shared_hash_find_slot_noinsert (set->vars, dv);
3539 gcc_assert (dv_is_decl_p (var->dv));
3540 /* The canonical value was reset and dropped.
3542 clobber_variable_part (set, NULL, var->dv, 0, NULL);
3545 var = (variable)*slot;
3546 gcc_assert (dv_is_value_p (var->dv));
3547 if (var->n_var_parts == 0)
3549 gcc_assert (var->n_var_parts == 1);
3553 VALUE_RECURSED_INTO (val) = false;
3558 /* Push values to the canonical one. */
3559 cdv = dv_from_value (cval);
3560 cslot = shared_hash_find_slot_noinsert (set->vars, cdv);
3562 for (node = var->var_part[0].loc_chain; node; node = node->next)
3563 if (node->loc != cval)
3565 cslot = set_slot_part (set, node->loc, cslot, cdv, 0,
3566 node->init, NULL_RTX);
3567 if (GET_CODE (node->loc) == VALUE)
3569 decl_or_value ndv = dv_from_value (node->loc);
3571 set_variable_part (set, cval, ndv, 0, node->init, NULL_RTX,
3574 if (canon_value_cmp (node->loc, val))
3576 /* If it could have been a local minimum, it's not any more,
3577 since it's now neighbor to cval, so it may have to push
3578 to it. Conversely, if it wouldn't have prevailed over
3579 val, then whatever mark it has is fine: if it was to
3580 push, it will now push to a more canonical node, but if
3581 it wasn't, then it has already pushed any values it might
3583 VALUE_RECURSED_INTO (node->loc) = true;
3584 /* Make sure we visit node->loc by ensuring we cval is
3586 VALUE_RECURSED_INTO (cval) = true;
3588 else if (!VALUE_RECURSED_INTO (node->loc))
3589 /* If we have no need to "recurse" into this node, it's
3590 already "canonicalized", so drop the link to the old
3592 clobber_variable_part (set, cval, ndv, 0, NULL);
3594 else if (GET_CODE (node->loc) == REG)
3596 attrs list = set->regs[REGNO (node->loc)], *listp;
3598 /* Change an existing attribute referring to dv so that it
3599 refers to cdv, removing any duplicate this might
3600 introduce, and checking that no previous duplicates
3601 existed, all in a single pass. */
3605 if (list->offset == 0
3606 && (dv_as_opaque (list->dv) == dv_as_opaque (dv)
3607 || dv_as_opaque (list->dv) == dv_as_opaque (cdv)))
3614 if (dv_as_opaque (list->dv) == dv_as_opaque (dv))
3617 for (listp = &list->next; (list = *listp); listp = &list->next)
3622 if (dv_as_opaque (list->dv) == dv_as_opaque (cdv))
3624 *listp = list->next;
3625 pool_free (attrs_pool, list);
3630 gcc_assert (dv_as_opaque (list->dv) != dv_as_opaque (dv));
3633 else if (dv_as_opaque (list->dv) == dv_as_opaque (cdv))
3635 for (listp = &list->next; (list = *listp); listp = &list->next)
3640 if (dv_as_opaque (list->dv) == dv_as_opaque (dv))
3642 *listp = list->next;
3643 pool_free (attrs_pool, list);
3648 gcc_assert (dv_as_opaque (list->dv) != dv_as_opaque (cdv));
3657 if (list->offset == 0
3658 && (dv_as_opaque (list->dv) == dv_as_opaque (dv)
3659 || dv_as_opaque (list->dv) == dv_as_opaque (cdv)))
3669 set_slot_part (set, val, cslot, cdv, 0,
3670 VAR_INIT_STATUS_INITIALIZED, NULL_RTX);
3672 slot = clobber_slot_part (set, cval, slot, 0, NULL);
3674 /* Variable may have been unshared. */
3675 var = (variable)*slot;
3676 gcc_checking_assert (var->n_var_parts && var->var_part[0].loc_chain->loc == cval
3677 && var->var_part[0].loc_chain->next == NULL);
3679 if (VALUE_RECURSED_INTO (cval))
3680 goto restart_with_cval;
3685 /* Bind one-part variables to the canonical value in an equivalence
3686 set. Not doing this causes dataflow convergence failure in rare
3687 circumstances, see PR42873. Unfortunately we can't do this
3688 efficiently as part of canonicalize_values_star, since we may not
3689 have determined or even seen the canonical value of a set when we
3690 get to a variable that references another member of the set. */
3693 canonicalize_vars_star (void **slot, void *data)
3695 dataflow_set *set = (dataflow_set *)data;
3696 variable var = (variable) *slot;
3697 decl_or_value dv = var->dv;
3698 location_chain node;
3703 location_chain cnode;
3705 if (!var->onepart || var->onepart == ONEPART_VALUE)
3708 gcc_assert (var->n_var_parts == 1);
3710 node = var->var_part[0].loc_chain;
3712 if (GET_CODE (node->loc) != VALUE)
3715 gcc_assert (!node->next);
3718 /* Push values to the canonical one. */
3719 cdv = dv_from_value (cval);
3720 cslot = shared_hash_find_slot_noinsert (set->vars, cdv);
3723 cvar = (variable)*cslot;
3724 gcc_assert (cvar->n_var_parts == 1);
3726 cnode = cvar->var_part[0].loc_chain;
3728 /* CVAL is canonical if its value list contains non-VALUEs or VALUEs
3729 that are not “more canonical” than it. */
3730 if (GET_CODE (cnode->loc) != VALUE
3731 || !canon_value_cmp (cnode->loc, cval))
3734 /* CVAL was found to be non-canonical. Change the variable to point
3735 to the canonical VALUE. */
3736 gcc_assert (!cnode->next);
3739 slot = set_slot_part (set, cval, slot, dv, 0,
3740 node->init, node->set_src);
3741 clobber_slot_part (set, cval, slot, 0, node->set_src);
3746 /* Combine variable or value in *S1SLOT (in DSM->cur) with the
3747 corresponding entry in DSM->src. Multi-part variables are combined
3748 with variable_union, whereas onepart dvs are combined with
3752 variable_merge_over_cur (variable s1var, struct dfset_merge *dsm)
3754 dataflow_set *dst = dsm->dst;
3756 variable s2var, dvar = NULL;
3757 decl_or_value dv = s1var->dv;
3758 onepart_enum_t onepart = s1var->onepart;
3761 location_chain node, *nodep;
3763 /* If the incoming onepart variable has an empty location list, then
3764 the intersection will be just as empty. For other variables,
3765 it's always union. */
3766 gcc_checking_assert (s1var->n_var_parts
3767 && s1var->var_part[0].loc_chain);
3770 return variable_union (s1var, dst);
3772 gcc_checking_assert (s1var->n_var_parts == 1);
3774 dvhash = dv_htab_hash (dv);
3775 if (dv_is_value_p (dv))
3776 val = dv_as_value (dv);
3780 s2var = shared_hash_find_1 (dsm->src->vars, dv, dvhash);
3783 dst_can_be_shared = false;
3787 dsm->src_onepart_cnt--;
3788 gcc_assert (s2var->var_part[0].loc_chain
3789 && s2var->onepart == onepart
3790 && s2var->n_var_parts == 1);
3792 dstslot = shared_hash_find_slot_noinsert_1 (dst->vars, dv, dvhash);
3795 dvar = (variable)*dstslot;
3796 gcc_assert (dvar->refcount == 1
3797 && dvar->onepart == onepart
3798 && dvar->n_var_parts == 1);
3799 nodep = &dvar->var_part[0].loc_chain;
3807 if (!dstslot && !onepart_variable_different_p (s1var, s2var))
3809 dstslot = shared_hash_find_slot_unshare_1 (&dst->vars, dv,
3811 *dstslot = dvar = s2var;
3816 dst_can_be_shared = false;
3818 intersect_loc_chains (val, nodep, dsm,
3819 s1var->var_part[0].loc_chain, s2var);
3825 dvar = (variable) pool_alloc (onepart_pool (onepart));
3828 dvar->n_var_parts = 1;
3829 dvar->onepart = onepart;
3830 dvar->in_changed_variables = false;
3831 dvar->var_part[0].loc_chain = node;
3832 dvar->var_part[0].cur_loc = NULL;
3834 VAR_LOC_1PAUX (dvar) = NULL;
3836 VAR_PART_OFFSET (dvar, 0) = 0;
3839 = shared_hash_find_slot_unshare_1 (&dst->vars, dv, dvhash,
3841 gcc_assert (!*dstslot);
3849 nodep = &dvar->var_part[0].loc_chain;
3850 while ((node = *nodep))
3852 location_chain *nextp = &node->next;
3854 if (GET_CODE (node->loc) == REG)
3858 for (list = dst->regs[REGNO (node->loc)]; list; list = list->next)
3859 if (GET_MODE (node->loc) == GET_MODE (list->loc)
3860 && dv_is_value_p (list->dv))
3864 attrs_list_insert (&dst->regs[REGNO (node->loc)],
3866 /* If this value became canonical for another value that had
3867 this register, we want to leave it alone. */
3868 else if (dv_as_value (list->dv) != val)
3870 dstslot = set_slot_part (dst, dv_as_value (list->dv),
3872 node->init, NULL_RTX);
3873 dstslot = delete_slot_part (dst, node->loc, dstslot, 0);
3875 /* Since nextp points into the removed node, we can't
3876 use it. The pointer to the next node moved to nodep.
3877 However, if the variable we're walking is unshared
3878 during our walk, we'll keep walking the location list
3879 of the previously-shared variable, in which case the
3880 node won't have been removed, and we'll want to skip
3881 it. That's why we test *nodep here. */
3887 /* Canonicalization puts registers first, so we don't have to
3893 if (dvar != (variable)*dstslot)
3894 dvar = (variable)*dstslot;
3895 nodep = &dvar->var_part[0].loc_chain;
3899 /* Mark all referenced nodes for canonicalization, and make sure
3900 we have mutual equivalence links. */
3901 VALUE_RECURSED_INTO (val) = true;
3902 for (node = *nodep; node; node = node->next)
3903 if (GET_CODE (node->loc) == VALUE)
3905 VALUE_RECURSED_INTO (node->loc) = true;
3906 set_variable_part (dst, val, dv_from_value (node->loc), 0,
3907 node->init, NULL, INSERT);
3910 dstslot = shared_hash_find_slot_noinsert_1 (dst->vars, dv, dvhash);
3911 gcc_assert (*dstslot == dvar);
3912 canonicalize_values_star (dstslot, dst);
3913 gcc_checking_assert (dstslot
3914 == shared_hash_find_slot_noinsert_1 (dst->vars,
3916 dvar = (variable)*dstslot;
3920 bool has_value = false, has_other = false;
3922 /* If we have one value and anything else, we're going to
3923 canonicalize this, so make sure all values have an entry in
3924 the table and are marked for canonicalization. */
3925 for (node = *nodep; node; node = node->next)
3927 if (GET_CODE (node->loc) == VALUE)
3929 /* If this was marked during register canonicalization,
3930 we know we have to canonicalize values. */
3945 if (has_value && has_other)
3947 for (node = *nodep; node; node = node->next)
3949 if (GET_CODE (node->loc) == VALUE)
3951 decl_or_value dv = dv_from_value (node->loc);
3954 if (shared_hash_shared (dst->vars))
3955 slot = shared_hash_find_slot_noinsert (dst->vars, dv);
3957 slot = shared_hash_find_slot_unshare (&dst->vars, dv,
3961 variable var = (variable) pool_alloc (onepart_pool
3965 var->n_var_parts = 1;
3966 var->onepart = ONEPART_VALUE;
3967 var->in_changed_variables = false;
3968 var->var_part[0].loc_chain = NULL;
3969 var->var_part[0].cur_loc = NULL;
3970 VAR_LOC_1PAUX (var) = NULL;
3974 VALUE_RECURSED_INTO (node->loc) = true;
3978 dstslot = shared_hash_find_slot_noinsert_1 (dst->vars, dv, dvhash);
3979 gcc_assert (*dstslot == dvar);
3980 canonicalize_values_star (dstslot, dst);
3981 gcc_checking_assert (dstslot
3982 == shared_hash_find_slot_noinsert_1 (dst->vars,
3984 dvar = (variable)*dstslot;
3988 if (!onepart_variable_different_p (dvar, s2var))
3990 variable_htab_free (dvar);
3991 *dstslot = dvar = s2var;
3994 else if (s2var != s1var && !onepart_variable_different_p (dvar, s1var))
3996 variable_htab_free (dvar);
3997 *dstslot = dvar = s1var;
3999 dst_can_be_shared = false;
4002 dst_can_be_shared = false;
4007 /* Copy s2slot (in DSM->src) to DSM->dst if the variable is a
4008 multi-part variable. Unions of multi-part variables and
4009 intersections of one-part ones will be handled in
4010 variable_merge_over_cur(). */
4013 variable_merge_over_src (variable s2var, struct dfset_merge *dsm)
4015 dataflow_set *dst = dsm->dst;
4016 decl_or_value dv = s2var->dv;
4018 if (!s2var->onepart)
4020 void **dstp = shared_hash_find_slot (dst->vars, dv);
4026 dsm->src_onepart_cnt++;
4030 /* Combine dataflow set information from SRC2 into DST, using PDST
4031 to carry over information across passes. */
4034 dataflow_set_merge (dataflow_set *dst, dataflow_set *src2)
4036 dataflow_set cur = *dst;
4037 dataflow_set *src1 = &cur;
4038 struct dfset_merge dsm;
4040 size_t src1_elems, src2_elems;
4044 src1_elems = htab_elements (shared_hash_htab (src1->vars));
4045 src2_elems = htab_elements (shared_hash_htab (src2->vars));
4046 dataflow_set_init (dst);
4047 dst->stack_adjust = cur.stack_adjust;
4048 shared_hash_destroy (dst->vars);
4049 dst->vars = (shared_hash) pool_alloc (shared_hash_pool);
4050 dst->vars->refcount = 1;
4052 = htab_create (MAX (src1_elems, src2_elems), variable_htab_hash,
4053 variable_htab_eq, variable_htab_free);
4055 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4056 attrs_list_mpdv_union (&dst->regs[i], src1->regs[i], src2->regs[i]);
4061 dsm.src_onepart_cnt = 0;
4063 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm.src->vars), var, variable, hi)
4064 variable_merge_over_src (var, &dsm);
4065 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm.cur->vars), var, variable, hi)
4066 variable_merge_over_cur (var, &dsm);
4068 if (dsm.src_onepart_cnt)
4069 dst_can_be_shared = false;
4071 dataflow_set_destroy (src1);
4074 /* Mark register equivalences. */
4077 dataflow_set_equiv_regs (dataflow_set *set)
4082 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4084 rtx canon[NUM_MACHINE_MODES];
4086 /* If the list is empty or one entry, no need to canonicalize
4088 if (set->regs[i] == NULL || set->regs[i]->next == NULL)
4091 memset (canon, 0, sizeof (canon));
4093 for (list = set->regs[i]; list; list = list->next)
4094 if (list->offset == 0 && dv_is_value_p (list->dv))
4096 rtx val = dv_as_value (list->dv);
4097 rtx *cvalp = &canon[(int)GET_MODE (val)];
4100 if (canon_value_cmp (val, cval))
4104 for (list = set->regs[i]; list; list = list->next)
4105 if (list->offset == 0 && dv_onepart_p (list->dv))
4107 rtx cval = canon[(int)GET_MODE (list->loc)];
4112 if (dv_is_value_p (list->dv))
4114 rtx val = dv_as_value (list->dv);
4119 VALUE_RECURSED_INTO (val) = true;
4120 set_variable_part (set, val, dv_from_value (cval), 0,
4121 VAR_INIT_STATUS_INITIALIZED,
4125 VALUE_RECURSED_INTO (cval) = true;
4126 set_variable_part (set, cval, list->dv, 0,
4127 VAR_INIT_STATUS_INITIALIZED, NULL, NO_INSERT);
4130 for (listp = &set->regs[i]; (list = *listp);
4131 listp = list ? &list->next : listp)
4132 if (list->offset == 0 && dv_onepart_p (list->dv))
4134 rtx cval = canon[(int)GET_MODE (list->loc)];
4140 if (dv_is_value_p (list->dv))
4142 rtx val = dv_as_value (list->dv);
4143 if (!VALUE_RECURSED_INTO (val))
4147 slot = shared_hash_find_slot_noinsert (set->vars, list->dv);
4148 canonicalize_values_star (slot, set);
4155 /* Remove any redundant values in the location list of VAR, which must
4156 be unshared and 1-part. */
4159 remove_duplicate_values (variable var)
4161 location_chain node, *nodep;
4163 gcc_assert (var->onepart);
4164 gcc_assert (var->n_var_parts == 1);
4165 gcc_assert (var->refcount == 1);
4167 for (nodep = &var->var_part[0].loc_chain; (node = *nodep); )
4169 if (GET_CODE (node->loc) == VALUE)
4171 if (VALUE_RECURSED_INTO (node->loc))
4173 /* Remove duplicate value node. */
4174 *nodep = node->next;
4175 pool_free (loc_chain_pool, node);
4179 VALUE_RECURSED_INTO (node->loc) = true;
4181 nodep = &node->next;
4184 for (node = var->var_part[0].loc_chain; node; node = node->next)
4185 if (GET_CODE (node->loc) == VALUE)
4187 gcc_assert (VALUE_RECURSED_INTO (node->loc));
4188 VALUE_RECURSED_INTO (node->loc) = false;
4193 /* Hash table iteration argument passed to variable_post_merge. */
4194 struct dfset_post_merge
4196 /* The new input set for the current block. */
4198 /* Pointer to the permanent input set for the current block, or
4200 dataflow_set **permp;
4203 /* Create values for incoming expressions associated with one-part
4204 variables that don't have value numbers for them. */
4207 variable_post_merge_new_vals (void **slot, void *info)
4209 struct dfset_post_merge *dfpm = (struct dfset_post_merge *)info;
4210 dataflow_set *set = dfpm->set;
4211 variable var = (variable)*slot;
4212 location_chain node;
4214 if (!var->onepart || !var->n_var_parts)
4217 gcc_assert (var->n_var_parts == 1);
4219 if (dv_is_decl_p (var->dv))
4221 bool check_dupes = false;
4224 for (node = var->var_part[0].loc_chain; node; node = node->next)
4226 if (GET_CODE (node->loc) == VALUE)
4227 gcc_assert (!VALUE_RECURSED_INTO (node->loc));
4228 else if (GET_CODE (node->loc) == REG)
4230 attrs att, *attp, *curp = NULL;
4232 if (var->refcount != 1)
4234 slot = unshare_variable (set, slot, var,
4235 VAR_INIT_STATUS_INITIALIZED);
4236 var = (variable)*slot;
4240 for (attp = &set->regs[REGNO (node->loc)]; (att = *attp);
4242 if (att->offset == 0
4243 && GET_MODE (att->loc) == GET_MODE (node->loc))
4245 if (dv_is_value_p (att->dv))
4247 rtx cval = dv_as_value (att->dv);
4252 else if (dv_as_opaque (att->dv) == dv_as_opaque (var->dv))
4260 if ((*curp)->offset == 0
4261 && GET_MODE ((*curp)->loc) == GET_MODE (node->loc)
4262 && dv_as_opaque ((*curp)->dv) == dv_as_opaque (var->dv))
4265 curp = &(*curp)->next;
4276 *dfpm->permp = XNEW (dataflow_set);
4277 dataflow_set_init (*dfpm->permp);
4280 for (att = (*dfpm->permp)->regs[REGNO (node->loc)];
4281 att; att = att->next)
4282 if (GET_MODE (att->loc) == GET_MODE (node->loc))
4284 gcc_assert (att->offset == 0
4285 && dv_is_value_p (att->dv));
4286 val_reset (set, att->dv);
4293 cval = dv_as_value (cdv);
4297 /* Create a unique value to hold this register,
4298 that ought to be found and reused in
4299 subsequent rounds. */
4301 gcc_assert (!cselib_lookup (node->loc,
4302 GET_MODE (node->loc), 0,
4304 v = cselib_lookup (node->loc, GET_MODE (node->loc), 1,
4306 cselib_preserve_value (v);
4307 cselib_invalidate_rtx (node->loc);
4309 cdv = dv_from_value (cval);
4312 "Created new value %u:%u for reg %i\n",
4313 v->uid, v->hash, REGNO (node->loc));
4316 var_reg_decl_set (*dfpm->permp, node->loc,
4317 VAR_INIT_STATUS_INITIALIZED,
4318 cdv, 0, NULL, INSERT);
4324 /* Remove attribute referring to the decl, which now
4325 uses the value for the register, already existing or
4326 to be added when we bring perm in. */
4329 pool_free (attrs_pool, att);
4334 remove_duplicate_values (var);
4340 /* Reset values in the permanent set that are not associated with the
4341 chosen expression. */
4344 variable_post_merge_perm_vals (void **pslot, void *info)
4346 struct dfset_post_merge *dfpm = (struct dfset_post_merge *)info;
4347 dataflow_set *set = dfpm->set;
4348 variable pvar = (variable)*pslot, var;
4349 location_chain pnode;
4353 gcc_assert (dv_is_value_p (pvar->dv)
4354 && pvar->n_var_parts == 1);
4355 pnode = pvar->var_part[0].loc_chain;
4358 && REG_P (pnode->loc));
4362 var = shared_hash_find (set->vars, dv);
4365 /* Although variable_post_merge_new_vals may have made decls
4366 non-star-canonical, values that pre-existed in canonical form
4367 remain canonical, and newly-created values reference a single
4368 REG, so they are canonical as well. Since VAR has the
4369 location list for a VALUE, using find_loc_in_1pdv for it is
4370 fine, since VALUEs don't map back to DECLs. */
4371 if (find_loc_in_1pdv (pnode->loc, var, shared_hash_htab (set->vars)))
4373 val_reset (set, dv);
4376 for (att = set->regs[REGNO (pnode->loc)]; att; att = att->next)
4377 if (att->offset == 0
4378 && GET_MODE (att->loc) == GET_MODE (pnode->loc)
4379 && dv_is_value_p (att->dv))
4382 /* If there is a value associated with this register already, create
4384 if (att && dv_as_value (att->dv) != dv_as_value (dv))
4386 rtx cval = dv_as_value (att->dv);
4387 set_variable_part (set, cval, dv, 0, pnode->init, NULL, INSERT);
4388 set_variable_part (set, dv_as_value (dv), att->dv, 0, pnode->init,
4393 attrs_list_insert (&set->regs[REGNO (pnode->loc)],
4395 variable_union (pvar, set);
4401 /* Just checking stuff and registering register attributes for
4405 dataflow_post_merge_adjust (dataflow_set *set, dataflow_set **permp)
4407 struct dfset_post_merge dfpm;
4412 htab_traverse (shared_hash_htab (set->vars), variable_post_merge_new_vals,
4415 htab_traverse (shared_hash_htab ((*permp)->vars),
4416 variable_post_merge_perm_vals, &dfpm);
4417 htab_traverse (shared_hash_htab (set->vars), canonicalize_values_star, set);
4418 htab_traverse (shared_hash_htab (set->vars), canonicalize_vars_star, set);
4421 /* Return a node whose loc is a MEM that refers to EXPR in the
4422 location list of a one-part variable or value VAR, or in that of
4423 any values recursively mentioned in the location lists. */
4425 static location_chain
4426 find_mem_expr_in_1pdv (tree expr, rtx val, htab_t vars)
4428 location_chain node;
4431 location_chain where = NULL;
4436 gcc_assert (GET_CODE (val) == VALUE
4437 && !VALUE_RECURSED_INTO (val));
4439 dv = dv_from_value (val);
4440 var = (variable) htab_find_with_hash (vars, dv, dv_htab_hash (dv));
4445 gcc_assert (var->onepart);
4447 if (!var->n_var_parts)
4450 VALUE_RECURSED_INTO (val) = true;
4452 for (node = var->var_part[0].loc_chain; node; node = node->next)
4453 if (MEM_P (node->loc)
4454 && MEM_EXPR (node->loc) == expr
4455 && INT_MEM_OFFSET (node->loc) == 0)
4460 else if (GET_CODE (node->loc) == VALUE
4461 && !VALUE_RECURSED_INTO (node->loc)
4462 && (where = find_mem_expr_in_1pdv (expr, node->loc, vars)))
4465 VALUE_RECURSED_INTO (val) = false;
4470 /* Return TRUE if the value of MEM may vary across a call. */
4473 mem_dies_at_call (rtx mem)
4475 tree expr = MEM_EXPR (mem);
4481 decl = get_base_address (expr);
4489 return (may_be_aliased (decl)
4490 || (!TREE_READONLY (decl) && is_global_var (decl)));
4493 /* Remove all MEMs from the location list of a hash table entry for a
4494 one-part variable, except those whose MEM attributes map back to
4495 the variable itself, directly or within a VALUE. */
4498 dataflow_set_preserve_mem_locs (void **slot, void *data)
4500 dataflow_set *set = (dataflow_set *) data;
4501 variable var = (variable) *slot;
4503 if (var->onepart == ONEPART_VDECL || var->onepart == ONEPART_DEXPR)
4505 tree decl = dv_as_decl (var->dv);
4506 location_chain loc, *locp;
4507 bool changed = false;
4509 if (!var->n_var_parts)
4512 gcc_assert (var->n_var_parts == 1);
4514 if (shared_var_p (var, set->vars))
4516 for (loc = var->var_part[0].loc_chain; loc; loc = loc->next)
4518 /* We want to remove dying MEMs that doesn't refer to DECL. */
4519 if (GET_CODE (loc->loc) == MEM
4520 && (MEM_EXPR (loc->loc) != decl
4521 || INT_MEM_OFFSET (loc->loc) != 0)
4522 && !mem_dies_at_call (loc->loc))
4524 /* We want to move here MEMs that do refer to DECL. */
4525 else if (GET_CODE (loc->loc) == VALUE
4526 && find_mem_expr_in_1pdv (decl, loc->loc,
4527 shared_hash_htab (set->vars)))
4534 slot = unshare_variable (set, slot, var, VAR_INIT_STATUS_UNKNOWN);
4535 var = (variable)*slot;
4536 gcc_assert (var->n_var_parts == 1);
4539 for (locp = &var->var_part[0].loc_chain, loc = *locp;
4542 rtx old_loc = loc->loc;
4543 if (GET_CODE (old_loc) == VALUE)
4545 location_chain mem_node
4546 = find_mem_expr_in_1pdv (decl, loc->loc,
4547 shared_hash_htab (set->vars));
4549 /* ??? This picks up only one out of multiple MEMs that
4550 refer to the same variable. Do we ever need to be
4551 concerned about dealing with more than one, or, given
4552 that they should all map to the same variable
4553 location, their addresses will have been merged and
4554 they will be regarded as equivalent? */
4557 loc->loc = mem_node->loc;
4558 loc->set_src = mem_node->set_src;
4559 loc->init = MIN (loc->init, mem_node->init);
4563 if (GET_CODE (loc->loc) != MEM
4564 || (MEM_EXPR (loc->loc) == decl
4565 && INT_MEM_OFFSET (loc->loc) == 0)
4566 || !mem_dies_at_call (loc->loc))
4568 if (old_loc != loc->loc && emit_notes)
4570 if (old_loc == var->var_part[0].cur_loc)
4573 var->var_part[0].cur_loc = NULL;
4582 if (old_loc == var->var_part[0].cur_loc)
4585 var->var_part[0].cur_loc = NULL;
4589 pool_free (loc_chain_pool, loc);
4592 if (!var->var_part[0].loc_chain)
4598 variable_was_changed (var, set);
4604 /* Remove all MEMs from the location list of a hash table entry for a
4608 dataflow_set_remove_mem_locs (void **slot, void *data)
4610 dataflow_set *set = (dataflow_set *) data;
4611 variable var = (variable) *slot;
4613 if (var->onepart == ONEPART_VALUE)
4615 location_chain loc, *locp;
4616 bool changed = false;
4619 gcc_assert (var->n_var_parts == 1);
4621 if (shared_var_p (var, set->vars))
4623 for (loc = var->var_part[0].loc_chain; loc; loc = loc->next)
4624 if (GET_CODE (loc->loc) == MEM
4625 && mem_dies_at_call (loc->loc))
4631 slot = unshare_variable (set, slot, var, VAR_INIT_STATUS_UNKNOWN);
4632 var = (variable)*slot;
4633 gcc_assert (var->n_var_parts == 1);
4636 if (VAR_LOC_1PAUX (var))
4637 cur_loc = VAR_LOC_FROM (var);
4639 cur_loc = var->var_part[0].cur_loc;
4641 for (locp = &var->var_part[0].loc_chain, loc = *locp;
4644 if (GET_CODE (loc->loc) != MEM
4645 || !mem_dies_at_call (loc->loc))
4652 /* If we have deleted the location which was last emitted
4653 we have to emit new location so add the variable to set
4654 of changed variables. */
4655 if (cur_loc == loc->loc)
4658 var->var_part[0].cur_loc = NULL;
4659 if (VAR_LOC_1PAUX (var))
4660 VAR_LOC_FROM (var) = NULL;
4662 pool_free (loc_chain_pool, loc);
4665 if (!var->var_part[0].loc_chain)
4671 variable_was_changed (var, set);
4677 /* Remove all variable-location information about call-clobbered
4678 registers, as well as associations between MEMs and VALUEs. */
4681 dataflow_set_clear_at_call (dataflow_set *set)
4684 hard_reg_set_iterator hrsi;
4686 EXECUTE_IF_SET_IN_HARD_REG_SET (regs_invalidated_by_call, 0, r, hrsi)
4687 var_regno_delete (set, r);
4689 if (MAY_HAVE_DEBUG_INSNS)
4691 set->traversed_vars = set->vars;
4692 htab_traverse (shared_hash_htab (set->vars),
4693 dataflow_set_preserve_mem_locs, set);
4694 set->traversed_vars = set->vars;
4695 htab_traverse (shared_hash_htab (set->vars), dataflow_set_remove_mem_locs,
4697 set->traversed_vars = NULL;
4702 variable_part_different_p (variable_part *vp1, variable_part *vp2)
4704 location_chain lc1, lc2;
4706 for (lc1 = vp1->loc_chain; lc1; lc1 = lc1->next)
4708 for (lc2 = vp2->loc_chain; lc2; lc2 = lc2->next)
4710 if (REG_P (lc1->loc) && REG_P (lc2->loc))
4712 if (REGNO (lc1->loc) == REGNO (lc2->loc))
4715 if (rtx_equal_p (lc1->loc, lc2->loc))
4724 /* Return true if one-part variables VAR1 and VAR2 are different.
4725 They must be in canonical order. */
4728 onepart_variable_different_p (variable var1, variable var2)
4730 location_chain lc1, lc2;
4735 gcc_assert (var1->n_var_parts == 1
4736 && var2->n_var_parts == 1);
4738 lc1 = var1->var_part[0].loc_chain;
4739 lc2 = var2->var_part[0].loc_chain;
4741 gcc_assert (lc1 && lc2);
4745 if (loc_cmp (lc1->loc, lc2->loc))
4754 /* Return true if variables VAR1 and VAR2 are different. */
4757 variable_different_p (variable var1, variable var2)
4764 if (var1->onepart != var2->onepart)
4767 if (var1->n_var_parts != var2->n_var_parts)
4770 if (var1->onepart && var1->n_var_parts)
4772 gcc_checking_assert (dv_as_opaque (var1->dv) == dv_as_opaque (var2->dv)
4773 && var1->n_var_parts == 1);
4774 /* One-part values have locations in a canonical order. */
4775 return onepart_variable_different_p (var1, var2);
4778 for (i = 0; i < var1->n_var_parts; i++)
4780 if (VAR_PART_OFFSET (var1, i) != VAR_PART_OFFSET (var2, i))
4782 if (variable_part_different_p (&var1->var_part[i], &var2->var_part[i]))
4784 if (variable_part_different_p (&var2->var_part[i], &var1->var_part[i]))
4790 /* Return true if dataflow sets OLD_SET and NEW_SET differ. */
4793 dataflow_set_different (dataflow_set *old_set, dataflow_set *new_set)
4798 if (old_set->vars == new_set->vars)
4801 if (htab_elements (shared_hash_htab (old_set->vars))
4802 != htab_elements (shared_hash_htab (new_set->vars)))
4805 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (old_set->vars), var1, variable, hi)
4807 htab_t htab = shared_hash_htab (new_set->vars);
4808 variable var2 = (variable) htab_find_with_hash (htab, var1->dv,
4809 dv_htab_hash (var1->dv));
4812 if (dump_file && (dump_flags & TDF_DETAILS))
4814 fprintf (dump_file, "dataflow difference found: removal of:\n");
4820 if (variable_different_p (var1, var2))
4822 if (dump_file && (dump_flags & TDF_DETAILS))
4824 fprintf (dump_file, "dataflow difference found: "
4825 "old and new follow:\n");
4833 /* No need to traverse the second hashtab, if both have the same number
4834 of elements and the second one had all entries found in the first one,
4835 then it can't have any extra entries. */
4839 /* Free the contents of dataflow set SET. */
4842 dataflow_set_destroy (dataflow_set *set)
4846 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4847 attrs_list_clear (&set->regs[i]);
4849 shared_hash_destroy (set->vars);
4853 /* Return true if RTL X contains a SYMBOL_REF. */
4856 contains_symbol_ref (rtx x)
4865 code = GET_CODE (x);
4866 if (code == SYMBOL_REF)
4869 fmt = GET_RTX_FORMAT (code);
4870 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
4874 if (contains_symbol_ref (XEXP (x, i)))
4877 else if (fmt[i] == 'E')
4880 for (j = 0; j < XVECLEN (x, i); j++)
4881 if (contains_symbol_ref (XVECEXP (x, i, j)))
4889 /* Shall EXPR be tracked? */
4892 track_expr_p (tree expr, bool need_rtl)
4897 if (TREE_CODE (expr) == DEBUG_EXPR_DECL)
4898 return DECL_RTL_SET_P (expr);
4900 /* If EXPR is not a parameter or a variable do not track it. */
4901 if (TREE_CODE (expr) != VAR_DECL && TREE_CODE (expr) != PARM_DECL)
4904 /* It also must have a name... */
4905 if (!DECL_NAME (expr) && need_rtl)
4908 /* ... and a RTL assigned to it. */
4909 decl_rtl = DECL_RTL_IF_SET (expr);
4910 if (!decl_rtl && need_rtl)
4913 /* If this expression is really a debug alias of some other declaration, we
4914 don't need to track this expression if the ultimate declaration is
4917 if (DECL_DEBUG_EXPR_IS_FROM (realdecl))
4919 realdecl = DECL_DEBUG_EXPR (realdecl);
4920 if (realdecl == NULL_TREE)
4922 else if (!DECL_P (realdecl))
4924 if (handled_component_p (realdecl))
4926 HOST_WIDE_INT bitsize, bitpos, maxsize;
4928 = get_ref_base_and_extent (realdecl, &bitpos, &bitsize,
4930 if (!DECL_P (innerdecl)
4931 || DECL_IGNORED_P (innerdecl)
4932 || TREE_STATIC (innerdecl)
4934 || bitpos + bitsize > 256
4935 || bitsize != maxsize)
4945 /* Do not track EXPR if REALDECL it should be ignored for debugging
4947 if (DECL_IGNORED_P (realdecl))
4950 /* Do not track global variables until we are able to emit correct location
4952 if (TREE_STATIC (realdecl))
4955 /* When the EXPR is a DECL for alias of some variable (see example)
4956 the TREE_STATIC flag is not used. Disable tracking all DECLs whose
4957 DECL_RTL contains SYMBOL_REF.
4960 extern char **_dl_argv_internal __attribute__ ((alias ("_dl_argv")));
4963 if (decl_rtl && MEM_P (decl_rtl)
4964 && contains_symbol_ref (XEXP (decl_rtl, 0)))
4967 /* If RTX is a memory it should not be very large (because it would be
4968 an array or struct). */
4969 if (decl_rtl && MEM_P (decl_rtl))
4971 /* Do not track structures and arrays. */
4972 if (GET_MODE (decl_rtl) == BLKmode
4973 || AGGREGATE_TYPE_P (TREE_TYPE (realdecl)))
4975 if (MEM_SIZE_KNOWN_P (decl_rtl)
4976 && MEM_SIZE (decl_rtl) > MAX_VAR_PARTS)
4980 DECL_CHANGED (expr) = 0;
4981 DECL_CHANGED (realdecl) = 0;
4985 /* Determine whether a given LOC refers to the same variable part as
4989 same_variable_part_p (rtx loc, tree expr, HOST_WIDE_INT offset)
4992 HOST_WIDE_INT offset2;
4994 if (! DECL_P (expr))
4999 expr2 = REG_EXPR (loc);
5000 offset2 = REG_OFFSET (loc);
5002 else if (MEM_P (loc))
5004 expr2 = MEM_EXPR (loc);
5005 offset2 = INT_MEM_OFFSET (loc);
5010 if (! expr2 || ! DECL_P (expr2))
5013 expr = var_debug_decl (expr);
5014 expr2 = var_debug_decl (expr2);
5016 return (expr == expr2 && offset == offset2);
5019 /* LOC is a REG or MEM that we would like to track if possible.
5020 If EXPR is null, we don't know what expression LOC refers to,
5021 otherwise it refers to EXPR + OFFSET. STORE_REG_P is true if
5022 LOC is an lvalue register.
5024 Return true if EXPR is nonnull and if LOC, or some lowpart of it,
5025 is something we can track. When returning true, store the mode of
5026 the lowpart we can track in *MODE_OUT (if nonnull) and its offset
5027 from EXPR in *OFFSET_OUT (if nonnull). */
5030 track_loc_p (rtx loc, tree expr, HOST_WIDE_INT offset, bool store_reg_p,
5031 enum machine_mode *mode_out, HOST_WIDE_INT *offset_out)
5033 enum machine_mode mode;
5035 if (expr == NULL || !track_expr_p (expr, true))
5038 /* If REG was a paradoxical subreg, its REG_ATTRS will describe the
5039 whole subreg, but only the old inner part is really relevant. */
5040 mode = GET_MODE (loc);
5041 if (REG_P (loc) && !HARD_REGISTER_NUM_P (ORIGINAL_REGNO (loc)))
5043 enum machine_mode pseudo_mode;
5045 pseudo_mode = PSEUDO_REGNO_MODE (ORIGINAL_REGNO (loc));
5046 if (GET_MODE_SIZE (mode) > GET_MODE_SIZE (pseudo_mode))
5048 offset += byte_lowpart_offset (pseudo_mode, mode);
5053 /* If LOC is a paradoxical lowpart of EXPR, refer to EXPR itself.
5054 Do the same if we are storing to a register and EXPR occupies
5055 the whole of register LOC; in that case, the whole of EXPR is
5056 being changed. We exclude complex modes from the second case
5057 because the real and imaginary parts are represented as separate
5058 pseudo registers, even if the whole complex value fits into one
5060 if ((GET_MODE_SIZE (mode) > GET_MODE_SIZE (DECL_MODE (expr))
5062 && !COMPLEX_MODE_P (DECL_MODE (expr))
5063 && hard_regno_nregs[REGNO (loc)][DECL_MODE (expr)] == 1))
5064 && offset + byte_lowpart_offset (DECL_MODE (expr), mode) == 0)
5066 mode = DECL_MODE (expr);
5070 if (offset < 0 || offset >= MAX_VAR_PARTS)
5076 *offset_out = offset;
5080 /* Return the MODE lowpart of LOC, or null if LOC is not something we
5081 want to track. When returning nonnull, make sure that the attributes
5082 on the returned value are updated. */
5085 var_lowpart (enum machine_mode mode, rtx loc)
5087 unsigned int offset, reg_offset, regno;
5089 if (GET_MODE (loc) == mode)
5092 if (!REG_P (loc) && !MEM_P (loc))
5095 offset = byte_lowpart_offset (mode, GET_MODE (loc));
5098 return adjust_address_nv (loc, mode, offset);
5100 reg_offset = subreg_lowpart_offset (mode, GET_MODE (loc));
5101 regno = REGNO (loc) + subreg_regno_offset (REGNO (loc), GET_MODE (loc),
5103 return gen_rtx_REG_offset (loc, mode, regno, offset);
5106 /* Carry information about uses and stores while walking rtx. */
5108 struct count_use_info
5110 /* The insn where the RTX is. */
5113 /* The basic block where insn is. */
5116 /* The array of n_sets sets in the insn, as determined by cselib. */
5117 struct cselib_set *sets;
5120 /* True if we're counting stores, false otherwise. */
5124 /* Find a VALUE corresponding to X. */
5126 static inline cselib_val *
5127 find_use_val (rtx x, enum machine_mode mode, struct count_use_info *cui)
5133 /* This is called after uses are set up and before stores are
5134 processed by cselib, so it's safe to look up srcs, but not
5135 dsts. So we look up expressions that appear in srcs or in
5136 dest expressions, but we search the sets array for dests of
5140 /* Some targets represent memset and memcpy patterns
5141 by (set (mem:BLK ...) (reg:[QHSD]I ...)) or
5142 (set (mem:BLK ...) (const_int ...)) or
5143 (set (mem:BLK ...) (mem:BLK ...)). Don't return anything
5144 in that case, otherwise we end up with mode mismatches. */
5145 if (mode == BLKmode && MEM_P (x))
5147 for (i = 0; i < cui->n_sets; i++)
5148 if (cui->sets[i].dest == x)
5149 return cui->sets[i].src_elt;
5152 return cselib_lookup (x, mode, 0, VOIDmode);
5158 /* Replace all registers and addresses in an expression with VALUE
5159 expressions that map back to them, unless the expression is a
5160 register. If no mapping is or can be performed, returns NULL. */
5163 replace_expr_with_values (rtx loc)
5165 if (REG_P (loc) || GET_CODE (loc) == ENTRY_VALUE)
5167 else if (MEM_P (loc))
5169 cselib_val *addr = cselib_lookup (XEXP (loc, 0),
5170 get_address_mode (loc), 0,
5173 return replace_equiv_address_nv (loc, addr->val_rtx);
5178 return cselib_subst_to_values (loc, VOIDmode);
5181 /* Return true if *X is a DEBUG_EXPR. Usable as an argument to
5182 for_each_rtx to tell whether there are any DEBUG_EXPRs within
5186 rtx_debug_expr_p (rtx *x, void *data ATTRIBUTE_UNUSED)
5190 return GET_CODE (loc) == DEBUG_EXPR;
5193 /* Determine what kind of micro operation to choose for a USE. Return
5194 MO_CLOBBER if no micro operation is to be generated. */
5196 static enum micro_operation_type
5197 use_type (rtx loc, struct count_use_info *cui, enum machine_mode *modep)
5201 if (cui && cui->sets)
5203 if (GET_CODE (loc) == VAR_LOCATION)
5205 if (track_expr_p (PAT_VAR_LOCATION_DECL (loc), false))
5207 rtx ploc = PAT_VAR_LOCATION_LOC (loc);
5208 if (! VAR_LOC_UNKNOWN_P (ploc))
5210 cselib_val *val = cselib_lookup (ploc, GET_MODE (loc), 1,
5213 /* ??? flag_float_store and volatile mems are never
5214 given values, but we could in theory use them for
5216 gcc_assert (val || 1);
5224 if (REG_P (loc) || MEM_P (loc))
5227 *modep = GET_MODE (loc);
5231 || (find_use_val (loc, GET_MODE (loc), cui)
5232 && cselib_lookup (XEXP (loc, 0),
5233 get_address_mode (loc), 0,
5239 cselib_val *val = find_use_val (loc, GET_MODE (loc), cui);
5241 if (val && !cselib_preserved_value_p (val))
5249 gcc_assert (REGNO (loc) < FIRST_PSEUDO_REGISTER);
5251 if (loc == cfa_base_rtx)
5253 expr = REG_EXPR (loc);
5256 return MO_USE_NO_VAR;
5257 else if (target_for_debug_bind (var_debug_decl (expr)))
5259 else if (track_loc_p (loc, expr, REG_OFFSET (loc),
5260 false, modep, NULL))
5263 return MO_USE_NO_VAR;
5265 else if (MEM_P (loc))
5267 expr = MEM_EXPR (loc);
5271 else if (target_for_debug_bind (var_debug_decl (expr)))
5273 else if (track_loc_p (loc, expr, INT_MEM_OFFSET (loc),
5275 /* Multi-part variables shouldn't refer to one-part
5276 variable names such as VALUEs (never happens) or
5277 DEBUG_EXPRs (only happens in the presence of debug
5279 && (!MAY_HAVE_DEBUG_INSNS
5280 || !for_each_rtx (&XEXP (loc, 0), rtx_debug_expr_p, NULL)))
5289 /* Log to OUT information about micro-operation MOPT involving X in
5293 log_op_type (rtx x, basic_block bb, rtx insn,
5294 enum micro_operation_type mopt, FILE *out)
5296 fprintf (out, "bb %i op %i insn %i %s ",
5297 bb->index, VEC_length (micro_operation, VTI (bb)->mos),
5298 INSN_UID (insn), micro_operation_type_name[mopt]);
5299 print_inline_rtx (out, x, 2);
5303 /* Tell whether the CONCAT used to holds a VALUE and its location
5304 needs value resolution, i.e., an attempt of mapping the location
5305 back to other incoming values. */
5306 #define VAL_NEEDS_RESOLUTION(x) \
5307 (RTL_FLAG_CHECK1 ("VAL_NEEDS_RESOLUTION", (x), CONCAT)->volatil)
5308 /* Whether the location in the CONCAT is a tracked expression, that
5309 should also be handled like a MO_USE. */
5310 #define VAL_HOLDS_TRACK_EXPR(x) \
5311 (RTL_FLAG_CHECK1 ("VAL_HOLDS_TRACK_EXPR", (x), CONCAT)->used)
5312 /* Whether the location in the CONCAT should be handled like a MO_COPY
5314 #define VAL_EXPR_IS_COPIED(x) \
5315 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_COPIED", (x), CONCAT)->jump)
5316 /* Whether the location in the CONCAT should be handled like a
5317 MO_CLOBBER as well. */
5318 #define VAL_EXPR_IS_CLOBBERED(x) \
5319 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_CLOBBERED", (x), CONCAT)->unchanging)
5321 /* All preserved VALUEs. */
5322 static VEC (rtx, heap) *preserved_values;
5324 /* Ensure VAL is preserved and remember it in a vector for vt_emit_notes. */
5327 preserve_value (cselib_val *val)
5329 cselib_preserve_value (val);
5330 VEC_safe_push (rtx, heap, preserved_values, val->val_rtx);
5333 /* Helper function for MO_VAL_LOC handling. Return non-zero if
5334 any rtxes not suitable for CONST use not replaced by VALUEs
5338 non_suitable_const (rtx *x, void *data ATTRIBUTE_UNUSED)
5343 switch (GET_CODE (*x))
5354 return !MEM_READONLY_P (*x);
5360 /* Add uses (register and memory references) LOC which will be tracked
5361 to VTI (bb)->mos. INSN is instruction which the LOC is part of. */
5364 add_uses (rtx *ploc, void *data)
5367 enum machine_mode mode = VOIDmode;
5368 struct count_use_info *cui = (struct count_use_info *)data;
5369 enum micro_operation_type type = use_type (loc, cui, &mode);
5371 if (type != MO_CLOBBER)
5373 basic_block bb = cui->bb;
5377 mo.u.loc = type == MO_USE ? var_lowpart (mode, loc) : loc;
5378 mo.insn = cui->insn;
5380 if (type == MO_VAL_LOC)
5383 rtx vloc = PAT_VAR_LOCATION_LOC (oloc);
5386 gcc_assert (cui->sets);
5389 && !REG_P (XEXP (vloc, 0))
5390 && !MEM_P (XEXP (vloc, 0)))
5393 enum machine_mode address_mode = get_address_mode (mloc);
5395 = cselib_lookup (XEXP (mloc, 0), address_mode, 0,
5398 if (val && !cselib_preserved_value_p (val))
5399 preserve_value (val);
5402 if (CONSTANT_P (vloc)
5403 && (GET_CODE (vloc) != CONST
5404 || for_each_rtx (&vloc, non_suitable_const, NULL)))
5405 /* For constants don't look up any value. */;
5406 else if (!VAR_LOC_UNKNOWN_P (vloc) && !unsuitable_loc (vloc)
5407 && (val = find_use_val (vloc, GET_MODE (oloc), cui)))
5409 enum machine_mode mode2;
5410 enum micro_operation_type type2;
5412 bool resolvable = REG_P (vloc) || MEM_P (vloc);
5415 nloc = replace_expr_with_values (vloc);
5419 oloc = shallow_copy_rtx (oloc);
5420 PAT_VAR_LOCATION_LOC (oloc) = nloc;
5423 oloc = gen_rtx_CONCAT (mode, val->val_rtx, oloc);
5425 type2 = use_type (vloc, 0, &mode2);
5427 gcc_assert (type2 == MO_USE || type2 == MO_USE_NO_VAR
5428 || type2 == MO_CLOBBER);
5430 if (type2 == MO_CLOBBER
5431 && !cselib_preserved_value_p (val))
5433 VAL_NEEDS_RESOLUTION (oloc) = resolvable;
5434 preserve_value (val);
5437 else if (!VAR_LOC_UNKNOWN_P (vloc))
5439 oloc = shallow_copy_rtx (oloc);
5440 PAT_VAR_LOCATION_LOC (oloc) = gen_rtx_UNKNOWN_VAR_LOC ();
5445 else if (type == MO_VAL_USE)
5447 enum machine_mode mode2 = VOIDmode;
5448 enum micro_operation_type type2;
5449 cselib_val *val = find_use_val (loc, GET_MODE (loc), cui);
5450 rtx vloc, oloc = loc, nloc;
5452 gcc_assert (cui->sets);
5455 && !REG_P (XEXP (oloc, 0))
5456 && !MEM_P (XEXP (oloc, 0)))
5459 enum machine_mode address_mode = get_address_mode (mloc);
5461 = cselib_lookup (XEXP (mloc, 0), address_mode, 0,
5464 if (val && !cselib_preserved_value_p (val))
5465 preserve_value (val);
5468 type2 = use_type (loc, 0, &mode2);
5470 gcc_assert (type2 == MO_USE || type2 == MO_USE_NO_VAR
5471 || type2 == MO_CLOBBER);
5473 if (type2 == MO_USE)
5474 vloc = var_lowpart (mode2, loc);
5478 /* The loc of a MO_VAL_USE may have two forms:
5480 (concat val src): val is at src, a value-based
5483 (concat (concat val use) src): same as above, with use as
5484 the MO_USE tracked value, if it differs from src.
5488 gcc_checking_assert (REG_P (loc) || MEM_P (loc));
5489 nloc = replace_expr_with_values (loc);
5494 oloc = gen_rtx_CONCAT (mode2, val->val_rtx, vloc);
5496 oloc = val->val_rtx;
5498 mo.u.loc = gen_rtx_CONCAT (mode, oloc, nloc);
5500 if (type2 == MO_USE)
5501 VAL_HOLDS_TRACK_EXPR (mo.u.loc) = 1;
5502 if (!cselib_preserved_value_p (val))
5504 VAL_NEEDS_RESOLUTION (mo.u.loc) = 1;
5505 preserve_value (val);
5509 gcc_assert (type == MO_USE || type == MO_USE_NO_VAR);
5511 if (dump_file && (dump_flags & TDF_DETAILS))
5512 log_op_type (mo.u.loc, cui->bb, cui->insn, mo.type, dump_file);
5513 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, mo);
5519 /* Helper function for finding all uses of REG/MEM in X in insn INSN. */
5522 add_uses_1 (rtx *x, void *cui)
5524 for_each_rtx (x, add_uses, cui);
5527 /* This is the value used during expansion of locations. We want it
5528 to be unbounded, so that variables expanded deep in a recursion
5529 nest are fully evaluated, so that their values are cached
5530 correctly. We avoid recursion cycles through other means, and we
5531 don't unshare RTL, so excess complexity is not a problem. */
5532 #define EXPR_DEPTH (INT_MAX)
5533 /* We use this to keep too-complex expressions from being emitted as
5534 location notes, and then to debug information. Users can trade
5535 compile time for ridiculously complex expressions, although they're
5536 seldom useful, and they may often have to be discarded as not
5537 representable anyway. */
5538 #define EXPR_USE_DEPTH (PARAM_VALUE (PARAM_MAX_VARTRACK_EXPR_DEPTH))
5540 /* Attempt to reverse the EXPR operation in the debug info and record
5541 it in the cselib table. Say for reg1 = reg2 + 6 even when reg2 is
5542 no longer live we can express its value as VAL - 6. */
5545 reverse_op (rtx val, const_rtx expr, rtx insn)
5549 struct elt_loc_list *l;
5552 if (GET_CODE (expr) != SET)
5555 if (!REG_P (SET_DEST (expr)) || GET_MODE (val) != GET_MODE (SET_DEST (expr)))
5558 src = SET_SRC (expr);
5559 switch (GET_CODE (src))
5566 if (!REG_P (XEXP (src, 0)))
5571 if (!REG_P (XEXP (src, 0)) && !MEM_P (XEXP (src, 0)))
5578 if (!SCALAR_INT_MODE_P (GET_MODE (src)) || XEXP (src, 0) == cfa_base_rtx)
5581 v = cselib_lookup (XEXP (src, 0), GET_MODE (XEXP (src, 0)), 0, VOIDmode);
5582 if (!v || !cselib_preserved_value_p (v))
5585 /* Use canonical V to avoid creating multiple redundant expressions
5586 for different VALUES equivalent to V. */
5587 v = canonical_cselib_val (v);
5589 /* Adding a reverse op isn't useful if V already has an always valid
5590 location. Ignore ENTRY_VALUE, while it is always constant, we should
5591 prefer non-ENTRY_VALUE locations whenever possible. */
5592 for (l = v->locs; l; l = l->next)
5593 if (CONSTANT_P (l->loc)
5594 && (GET_CODE (l->loc) != CONST || !references_value_p (l->loc, 0)))
5597 switch (GET_CODE (src))
5601 if (GET_MODE (v->val_rtx) != GET_MODE (val))
5603 ret = gen_rtx_fmt_e (GET_CODE (src), GET_MODE (val), val);
5607 ret = gen_lowpart_SUBREG (GET_MODE (v->val_rtx), val);
5619 if (GET_MODE (v->val_rtx) != GET_MODE (val))
5621 arg = XEXP (src, 1);
5622 if (!CONST_INT_P (arg) && GET_CODE (arg) != SYMBOL_REF)
5624 arg = cselib_expand_value_rtx (arg, scratch_regs, 5);
5625 if (arg == NULL_RTX)
5627 if (!CONST_INT_P (arg) && GET_CODE (arg) != SYMBOL_REF)
5630 ret = simplify_gen_binary (code, GET_MODE (val), val, arg);
5632 /* Ensure ret isn't VALUE itself (which can happen e.g. for
5633 (plus (reg1) (reg2)) when reg2 is known to be 0), as that
5634 breaks a lot of routines during var-tracking. */
5635 ret = gen_rtx_fmt_ee (PLUS, GET_MODE (val), val, const0_rtx);
5641 cselib_add_permanent_equiv (v, ret, insn);
5644 /* Add stores (register and memory references) LOC which will be tracked
5645 to VTI (bb)->mos. EXPR is the RTL expression containing the store.
5646 CUIP->insn is instruction which the LOC is part of. */
5649 add_stores (rtx loc, const_rtx expr, void *cuip)
5651 enum machine_mode mode = VOIDmode, mode2;
5652 struct count_use_info *cui = (struct count_use_info *)cuip;
5653 basic_block bb = cui->bb;
5655 rtx oloc = loc, nloc, src = NULL;
5656 enum micro_operation_type type = use_type (loc, cui, &mode);
5657 bool track_p = false;
5659 bool resolve, preserve;
5661 if (type == MO_CLOBBER)
5668 gcc_assert (loc != cfa_base_rtx);
5669 if ((GET_CODE (expr) == CLOBBER && type != MO_VAL_SET)
5670 || !(track_p = use_type (loc, NULL, &mode2) == MO_USE)
5671 || GET_CODE (expr) == CLOBBER)
5673 mo.type = MO_CLOBBER;
5675 if (GET_CODE (expr) == SET
5676 && SET_DEST (expr) == loc
5677 && !unsuitable_loc (SET_SRC (expr))
5678 && find_use_val (loc, mode, cui))
5680 gcc_checking_assert (type == MO_VAL_SET);
5681 mo.u.loc = gen_rtx_SET (VOIDmode, loc, SET_SRC (expr));
5686 if (GET_CODE (expr) == SET
5687 && SET_DEST (expr) == loc
5688 && GET_CODE (SET_SRC (expr)) != ASM_OPERANDS)
5689 src = var_lowpart (mode2, SET_SRC (expr));
5690 loc = var_lowpart (mode2, loc);
5699 rtx xexpr = gen_rtx_SET (VOIDmode, loc, src);
5700 if (same_variable_part_p (src, REG_EXPR (loc), REG_OFFSET (loc)))
5707 mo.insn = cui->insn;
5709 else if (MEM_P (loc)
5710 && ((track_p = use_type (loc, NULL, &mode2) == MO_USE)
5713 if (MEM_P (loc) && type == MO_VAL_SET
5714 && !REG_P (XEXP (loc, 0))
5715 && !MEM_P (XEXP (loc, 0)))
5718 enum machine_mode address_mode = get_address_mode (mloc);
5719 cselib_val *val = cselib_lookup (XEXP (mloc, 0),
5723 if (val && !cselib_preserved_value_p (val))
5724 preserve_value (val);
5727 if (GET_CODE (expr) == CLOBBER || !track_p)
5729 mo.type = MO_CLOBBER;
5730 mo.u.loc = track_p ? var_lowpart (mode2, loc) : loc;
5734 if (GET_CODE (expr) == SET
5735 && SET_DEST (expr) == loc
5736 && GET_CODE (SET_SRC (expr)) != ASM_OPERANDS)
5737 src = var_lowpart (mode2, SET_SRC (expr));
5738 loc = var_lowpart (mode2, loc);
5747 rtx xexpr = gen_rtx_SET (VOIDmode, loc, src);
5748 if (same_variable_part_p (SET_SRC (xexpr),
5750 INT_MEM_OFFSET (loc)))
5757 mo.insn = cui->insn;
5762 if (type != MO_VAL_SET)
5763 goto log_and_return;
5765 v = find_use_val (oloc, mode, cui);
5768 goto log_and_return;
5770 resolve = preserve = !cselib_preserved_value_p (v);
5772 if (loc == stack_pointer_rtx
5773 && hard_frame_pointer_adjustment != -1
5775 cselib_set_value_sp_based (v);
5777 nloc = replace_expr_with_values (oloc);
5781 if (GET_CODE (PATTERN (cui->insn)) == COND_EXEC)
5783 cselib_val *oval = cselib_lookup (oloc, GET_MODE (oloc), 0, VOIDmode);
5785 gcc_assert (oval != v);
5786 gcc_assert (REG_P (oloc) || MEM_P (oloc));
5788 if (oval && !cselib_preserved_value_p (oval))
5790 micro_operation moa;
5792 preserve_value (oval);
5794 moa.type = MO_VAL_USE;
5795 moa.u.loc = gen_rtx_CONCAT (mode, oval->val_rtx, oloc);
5796 VAL_NEEDS_RESOLUTION (moa.u.loc) = 1;
5797 moa.insn = cui->insn;
5799 if (dump_file && (dump_flags & TDF_DETAILS))
5800 log_op_type (moa.u.loc, cui->bb, cui->insn,
5801 moa.type, dump_file);
5802 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, moa);
5807 else if (resolve && GET_CODE (mo.u.loc) == SET)
5809 if (REG_P (SET_SRC (expr)) || MEM_P (SET_SRC (expr)))
5810 nloc = replace_expr_with_values (SET_SRC (expr));
5814 /* Avoid the mode mismatch between oexpr and expr. */
5815 if (!nloc && mode != mode2)
5817 nloc = SET_SRC (expr);
5818 gcc_assert (oloc == SET_DEST (expr));
5821 if (nloc && nloc != SET_SRC (mo.u.loc))
5822 oloc = gen_rtx_SET (GET_MODE (mo.u.loc), oloc, nloc);
5825 if (oloc == SET_DEST (mo.u.loc))
5826 /* No point in duplicating. */
5828 if (!REG_P (SET_SRC (mo.u.loc)))
5834 if (GET_CODE (mo.u.loc) == SET
5835 && oloc == SET_DEST (mo.u.loc))
5836 /* No point in duplicating. */
5842 loc = gen_rtx_CONCAT (mode, v->val_rtx, oloc);
5844 if (mo.u.loc != oloc)
5845 loc = gen_rtx_CONCAT (GET_MODE (mo.u.loc), loc, mo.u.loc);
5847 /* The loc of a MO_VAL_SET may have various forms:
5849 (concat val dst): dst now holds val
5851 (concat val (set dst src)): dst now holds val, copied from src
5853 (concat (concat val dstv) dst): dst now holds val; dstv is dst
5854 after replacing mems and non-top-level regs with values.
5856 (concat (concat val dstv) (set dst src)): dst now holds val,
5857 copied from src. dstv is a value-based representation of dst, if
5858 it differs from dst. If resolution is needed, src is a REG, and
5859 its mode is the same as that of val.
5861 (concat (concat val (set dstv srcv)) (set dst src)): src
5862 copied to dst, holding val. dstv and srcv are value-based
5863 representations of dst and src, respectively.
5867 if (GET_CODE (PATTERN (cui->insn)) != COND_EXEC)
5868 reverse_op (v->val_rtx, expr, cui->insn);
5873 VAL_HOLDS_TRACK_EXPR (loc) = 1;
5876 VAL_NEEDS_RESOLUTION (loc) = resolve;
5879 if (mo.type == MO_CLOBBER)
5880 VAL_EXPR_IS_CLOBBERED (loc) = 1;
5881 if (mo.type == MO_COPY)
5882 VAL_EXPR_IS_COPIED (loc) = 1;
5884 mo.type = MO_VAL_SET;
5887 if (dump_file && (dump_flags & TDF_DETAILS))
5888 log_op_type (mo.u.loc, cui->bb, cui->insn, mo.type, dump_file);
5889 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, mo);
5892 /* Arguments to the call. */
5893 static rtx call_arguments;
5895 /* Compute call_arguments. */
5898 prepare_call_arguments (basic_block bb, rtx insn)
5901 rtx prev, cur, next;
5902 rtx this_arg = NULL_RTX;
5903 tree type = NULL_TREE, t, fndecl = NULL_TREE;
5904 tree obj_type_ref = NULL_TREE;
5905 CUMULATIVE_ARGS args_so_far_v;
5906 cumulative_args_t args_so_far;
5908 memset (&args_so_far_v, 0, sizeof (args_so_far_v));
5909 args_so_far = pack_cumulative_args (&args_so_far_v);
5910 call = get_call_rtx_from (insn);
5913 if (GET_CODE (XEXP (XEXP (call, 0), 0)) == SYMBOL_REF)
5915 rtx symbol = XEXP (XEXP (call, 0), 0);
5916 if (SYMBOL_REF_DECL (symbol))
5917 fndecl = SYMBOL_REF_DECL (symbol);
5919 if (fndecl == NULL_TREE)
5920 fndecl = MEM_EXPR (XEXP (call, 0));
5922 && TREE_CODE (TREE_TYPE (fndecl)) != FUNCTION_TYPE
5923 && TREE_CODE (TREE_TYPE (fndecl)) != METHOD_TYPE)
5925 if (fndecl && TYPE_ARG_TYPES (TREE_TYPE (fndecl)))
5926 type = TREE_TYPE (fndecl);
5927 if (fndecl && TREE_CODE (fndecl) != FUNCTION_DECL)
5929 if (TREE_CODE (fndecl) == INDIRECT_REF
5930 && TREE_CODE (TREE_OPERAND (fndecl, 0)) == OBJ_TYPE_REF)
5931 obj_type_ref = TREE_OPERAND (fndecl, 0);
5936 for (t = TYPE_ARG_TYPES (type); t && t != void_list_node;
5938 if (TREE_CODE (TREE_VALUE (t)) == REFERENCE_TYPE
5939 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_VALUE (t))))
5941 if ((t == NULL || t == void_list_node) && obj_type_ref == NULL_TREE)
5945 int nargs ATTRIBUTE_UNUSED = list_length (TYPE_ARG_TYPES (type));
5946 link = CALL_INSN_FUNCTION_USAGE (insn);
5947 #ifndef PCC_STATIC_STRUCT_RETURN
5948 if (aggregate_value_p (TREE_TYPE (type), type)
5949 && targetm.calls.struct_value_rtx (type, 0) == 0)
5951 tree struct_addr = build_pointer_type (TREE_TYPE (type));
5952 enum machine_mode mode = TYPE_MODE (struct_addr);
5954 INIT_CUMULATIVE_ARGS (args_so_far_v, type, NULL_RTX, fndecl,
5956 reg = targetm.calls.function_arg (args_so_far, mode,
5958 targetm.calls.function_arg_advance (args_so_far, mode,
5960 if (reg == NULL_RTX)
5962 for (; link; link = XEXP (link, 1))
5963 if (GET_CODE (XEXP (link, 0)) == USE
5964 && MEM_P (XEXP (XEXP (link, 0), 0)))
5966 link = XEXP (link, 1);
5973 INIT_CUMULATIVE_ARGS (args_so_far_v, type, NULL_RTX, fndecl,
5975 if (obj_type_ref && TYPE_ARG_TYPES (type) != void_list_node)
5977 enum machine_mode mode;
5978 t = TYPE_ARG_TYPES (type);
5979 mode = TYPE_MODE (TREE_VALUE (t));
5980 this_arg = targetm.calls.function_arg (args_so_far, mode,
5981 TREE_VALUE (t), true);
5982 if (this_arg && !REG_P (this_arg))
5983 this_arg = NULL_RTX;
5984 else if (this_arg == NULL_RTX)
5986 for (; link; link = XEXP (link, 1))
5987 if (GET_CODE (XEXP (link, 0)) == USE
5988 && MEM_P (XEXP (XEXP (link, 0), 0)))
5990 this_arg = XEXP (XEXP (link, 0), 0);
5998 t = type ? TYPE_ARG_TYPES (type) : NULL_TREE;
6000 for (link = CALL_INSN_FUNCTION_USAGE (insn); link; link = XEXP (link, 1))
6001 if (GET_CODE (XEXP (link, 0)) == USE)
6003 rtx item = NULL_RTX;
6004 x = XEXP (XEXP (link, 0), 0);
6005 if (GET_MODE (link) == VOIDmode
6006 || GET_MODE (link) == BLKmode
6007 || (GET_MODE (link) != GET_MODE (x)
6008 && (GET_MODE_CLASS (GET_MODE (link)) != MODE_INT
6009 || GET_MODE_CLASS (GET_MODE (x)) != MODE_INT)))
6010 /* Can't do anything for these, if the original type mode
6011 isn't known or can't be converted. */;
6014 cselib_val *val = cselib_lookup (x, GET_MODE (x), 0, VOIDmode);
6015 if (val && cselib_preserved_value_p (val))
6016 item = val->val_rtx;
6017 else if (GET_MODE_CLASS (GET_MODE (x)) == MODE_INT)
6019 enum machine_mode mode = GET_MODE (x);
6021 while ((mode = GET_MODE_WIDER_MODE (mode)) != VOIDmode
6022 && GET_MODE_BITSIZE (mode) <= BITS_PER_WORD)
6024 rtx reg = simplify_subreg (mode, x, GET_MODE (x), 0);
6026 if (reg == NULL_RTX || !REG_P (reg))
6028 val = cselib_lookup (reg, mode, 0, VOIDmode);
6029 if (val && cselib_preserved_value_p (val))
6031 item = val->val_rtx;
6042 if (!frame_pointer_needed)
6044 struct adjust_mem_data amd;
6045 amd.mem_mode = VOIDmode;
6046 amd.stack_adjust = -VTI (bb)->out.stack_adjust;
6047 amd.side_effects = NULL_RTX;
6049 mem = simplify_replace_fn_rtx (mem, NULL_RTX, adjust_mems,
6051 gcc_assert (amd.side_effects == NULL_RTX);
6053 val = cselib_lookup (mem, GET_MODE (mem), 0, VOIDmode);
6054 if (val && cselib_preserved_value_p (val))
6055 item = val->val_rtx;
6056 else if (GET_MODE_CLASS (GET_MODE (mem)) != MODE_INT)
6058 /* For non-integer stack argument see also if they weren't
6059 initialized by integers. */
6060 enum machine_mode imode = int_mode_for_mode (GET_MODE (mem));
6061 if (imode != GET_MODE (mem) && imode != BLKmode)
6063 val = cselib_lookup (adjust_address_nv (mem, imode, 0),
6064 imode, 0, VOIDmode);
6065 if (val && cselib_preserved_value_p (val))
6066 item = lowpart_subreg (GET_MODE (x), val->val_rtx,
6074 if (GET_MODE (item) != GET_MODE (link))
6075 item = lowpart_subreg (GET_MODE (link), item, GET_MODE (item));
6076 if (GET_MODE (x2) != GET_MODE (link))
6077 x2 = lowpart_subreg (GET_MODE (link), x2, GET_MODE (x2));
6078 item = gen_rtx_CONCAT (GET_MODE (link), x2, item);
6080 = gen_rtx_EXPR_LIST (VOIDmode, item, call_arguments);
6082 if (t && t != void_list_node)
6084 tree argtype = TREE_VALUE (t);
6085 enum machine_mode mode = TYPE_MODE (argtype);
6087 if (pass_by_reference (&args_so_far_v, mode, argtype, true))
6089 argtype = build_pointer_type (argtype);
6090 mode = TYPE_MODE (argtype);
6092 reg = targetm.calls.function_arg (args_so_far, mode,
6094 if (TREE_CODE (argtype) == REFERENCE_TYPE
6095 && INTEGRAL_TYPE_P (TREE_TYPE (argtype))
6098 && GET_MODE (reg) == mode
6099 && GET_MODE_CLASS (mode) == MODE_INT
6101 && REGNO (x) == REGNO (reg)
6102 && GET_MODE (x) == mode
6105 enum machine_mode indmode
6106 = TYPE_MODE (TREE_TYPE (argtype));
6107 rtx mem = gen_rtx_MEM (indmode, x);
6108 cselib_val *val = cselib_lookup (mem, indmode, 0, VOIDmode);
6109 if (val && cselib_preserved_value_p (val))
6111 item = gen_rtx_CONCAT (indmode, mem, val->val_rtx);
6112 call_arguments = gen_rtx_EXPR_LIST (VOIDmode, item,
6117 struct elt_loc_list *l;
6120 /* Try harder, when passing address of a constant
6121 pool integer it can be easily read back. */
6122 item = XEXP (item, 1);
6123 if (GET_CODE (item) == SUBREG)
6124 item = SUBREG_REG (item);
6125 gcc_assert (GET_CODE (item) == VALUE);
6126 val = CSELIB_VAL_PTR (item);
6127 for (l = val->locs; l; l = l->next)
6128 if (GET_CODE (l->loc) == SYMBOL_REF
6129 && TREE_CONSTANT_POOL_ADDRESS_P (l->loc)
6130 && SYMBOL_REF_DECL (l->loc)
6131 && DECL_INITIAL (SYMBOL_REF_DECL (l->loc)))
6133 initial = DECL_INITIAL (SYMBOL_REF_DECL (l->loc));
6134 if (host_integerp (initial, 0))
6136 item = GEN_INT (tree_low_cst (initial, 0));
6137 item = gen_rtx_CONCAT (indmode, mem, item);
6139 = gen_rtx_EXPR_LIST (VOIDmode, item,
6146 targetm.calls.function_arg_advance (args_so_far, mode,
6152 /* Add debug arguments. */
6154 && TREE_CODE (fndecl) == FUNCTION_DECL
6155 && DECL_HAS_DEBUG_ARGS_P (fndecl))
6157 VEC(tree, gc) **debug_args = decl_debug_args_lookup (fndecl);
6162 for (ix = 0; VEC_iterate (tree, *debug_args, ix, param); ix += 2)
6165 tree dtemp = VEC_index (tree, *debug_args, ix + 1);
6166 enum machine_mode mode = DECL_MODE (dtemp);
6167 item = gen_rtx_DEBUG_PARAMETER_REF (mode, param);
6168 item = gen_rtx_CONCAT (mode, item, DECL_RTL_KNOWN_SET (dtemp));
6169 call_arguments = gen_rtx_EXPR_LIST (VOIDmode, item,
6175 /* Reverse call_arguments chain. */
6177 for (cur = call_arguments; cur; cur = next)
6179 next = XEXP (cur, 1);
6180 XEXP (cur, 1) = prev;
6183 call_arguments = prev;
6185 x = get_call_rtx_from (insn);
6188 x = XEXP (XEXP (x, 0), 0);
6189 if (GET_CODE (x) == SYMBOL_REF)
6190 /* Don't record anything. */;
6191 else if (CONSTANT_P (x))
6193 x = gen_rtx_CONCAT (GET_MODE (x) == VOIDmode ? Pmode : GET_MODE (x),
6196 = gen_rtx_EXPR_LIST (VOIDmode, x, call_arguments);
6200 cselib_val *val = cselib_lookup (x, GET_MODE (x), 0, VOIDmode);
6201 if (val && cselib_preserved_value_p (val))
6203 x = gen_rtx_CONCAT (GET_MODE (x), pc_rtx, val->val_rtx);
6205 = gen_rtx_EXPR_LIST (VOIDmode, x, call_arguments);
6211 enum machine_mode mode
6212 = TYPE_MODE (TREE_TYPE (OBJ_TYPE_REF_EXPR (obj_type_ref)));
6213 rtx clobbered = gen_rtx_MEM (mode, this_arg);
6215 = tree_low_cst (OBJ_TYPE_REF_TOKEN (obj_type_ref), 0);
6217 clobbered = plus_constant (mode, clobbered,
6218 token * GET_MODE_SIZE (mode));
6219 clobbered = gen_rtx_MEM (mode, clobbered);
6220 x = gen_rtx_CONCAT (mode, gen_rtx_CLOBBER (VOIDmode, pc_rtx), clobbered);
6222 = gen_rtx_EXPR_LIST (VOIDmode, x, call_arguments);
6226 /* Callback for cselib_record_sets_hook, that records as micro
6227 operations uses and stores in an insn after cselib_record_sets has
6228 analyzed the sets in an insn, but before it modifies the stored
6229 values in the internal tables, unless cselib_record_sets doesn't
6230 call it directly (perhaps because we're not doing cselib in the
6231 first place, in which case sets and n_sets will be 0). */
6234 add_with_sets (rtx insn, struct cselib_set *sets, int n_sets)
6236 basic_block bb = BLOCK_FOR_INSN (insn);
6238 struct count_use_info cui;
6239 micro_operation *mos;
6241 cselib_hook_called = true;
6246 cui.n_sets = n_sets;
6248 n1 = VEC_length (micro_operation, VTI (bb)->mos);
6249 cui.store_p = false;
6250 note_uses (&PATTERN (insn), add_uses_1, &cui);
6251 n2 = VEC_length (micro_operation, VTI (bb)->mos) - 1;
6252 mos = VEC_address (micro_operation, VTI (bb)->mos);
6254 /* Order the MO_USEs to be before MO_USE_NO_VARs and MO_VAL_USE, and
6258 while (n1 < n2 && mos[n1].type == MO_USE)
6260 while (n1 < n2 && mos[n2].type != MO_USE)
6272 n2 = VEC_length (micro_operation, VTI (bb)->mos) - 1;
6275 while (n1 < n2 && mos[n1].type != MO_VAL_LOC)
6277 while (n1 < n2 && mos[n2].type == MO_VAL_LOC)
6295 mo.u.loc = call_arguments;
6296 call_arguments = NULL_RTX;
6298 if (dump_file && (dump_flags & TDF_DETAILS))
6299 log_op_type (PATTERN (insn), bb, insn, mo.type, dump_file);
6300 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, mo);
6303 n1 = VEC_length (micro_operation, VTI (bb)->mos);
6304 /* This will record NEXT_INSN (insn), such that we can
6305 insert notes before it without worrying about any
6306 notes that MO_USEs might emit after the insn. */
6308 note_stores (PATTERN (insn), add_stores, &cui);
6309 n2 = VEC_length (micro_operation, VTI (bb)->mos) - 1;
6310 mos = VEC_address (micro_operation, VTI (bb)->mos);
6312 /* Order the MO_VAL_USEs first (note_stores does nothing
6313 on DEBUG_INSNs, so there are no MO_VAL_LOCs from this
6314 insn), then MO_CLOBBERs, then MO_SET/MO_COPY/MO_VAL_SET. */
6317 while (n1 < n2 && mos[n1].type == MO_VAL_USE)
6319 while (n1 < n2 && mos[n2].type != MO_VAL_USE)
6331 n2 = VEC_length (micro_operation, VTI (bb)->mos) - 1;
6334 while (n1 < n2 && mos[n1].type == MO_CLOBBER)
6336 while (n1 < n2 && mos[n2].type != MO_CLOBBER)
6349 static enum var_init_status
6350 find_src_status (dataflow_set *in, rtx src)
6352 tree decl = NULL_TREE;
6353 enum var_init_status status = VAR_INIT_STATUS_UNINITIALIZED;
6355 if (! flag_var_tracking_uninit)
6356 status = VAR_INIT_STATUS_INITIALIZED;
6358 if (src && REG_P (src))
6359 decl = var_debug_decl (REG_EXPR (src));
6360 else if (src && MEM_P (src))
6361 decl = var_debug_decl (MEM_EXPR (src));
6364 status = get_init_value (in, src, dv_from_decl (decl));
6369 /* SRC is the source of an assignment. Use SET to try to find what
6370 was ultimately assigned to SRC. Return that value if known,
6371 otherwise return SRC itself. */
6374 find_src_set_src (dataflow_set *set, rtx src)
6376 tree decl = NULL_TREE; /* The variable being copied around. */
6377 rtx set_src = NULL_RTX; /* The value for "decl" stored in "src". */
6379 location_chain nextp;
6383 if (src && REG_P (src))
6384 decl = var_debug_decl (REG_EXPR (src));
6385 else if (src && MEM_P (src))
6386 decl = var_debug_decl (MEM_EXPR (src));
6390 decl_or_value dv = dv_from_decl (decl);
6392 var = shared_hash_find (set->vars, dv);
6396 for (i = 0; i < var->n_var_parts && !found; i++)
6397 for (nextp = var->var_part[i].loc_chain; nextp && !found;
6398 nextp = nextp->next)
6399 if (rtx_equal_p (nextp->loc, src))
6401 set_src = nextp->set_src;
6411 /* Compute the changes of variable locations in the basic block BB. */
6414 compute_bb_dataflow (basic_block bb)
6417 micro_operation *mo;
6419 dataflow_set old_out;
6420 dataflow_set *in = &VTI (bb)->in;
6421 dataflow_set *out = &VTI (bb)->out;
6423 dataflow_set_init (&old_out);
6424 dataflow_set_copy (&old_out, out);
6425 dataflow_set_copy (out, in);
6427 FOR_EACH_VEC_ELT (micro_operation, VTI (bb)->mos, i, mo)
6429 rtx insn = mo->insn;
6434 dataflow_set_clear_at_call (out);
6439 rtx loc = mo->u.loc;
6442 var_reg_set (out, loc, VAR_INIT_STATUS_UNINITIALIZED, NULL);
6443 else if (MEM_P (loc))
6444 var_mem_set (out, loc, VAR_INIT_STATUS_UNINITIALIZED, NULL);
6450 rtx loc = mo->u.loc;
6454 if (GET_CODE (loc) == CONCAT)
6456 val = XEXP (loc, 0);
6457 vloc = XEXP (loc, 1);
6465 var = PAT_VAR_LOCATION_DECL (vloc);
6467 clobber_variable_part (out, NULL_RTX,
6468 dv_from_decl (var), 0, NULL_RTX);
6471 if (VAL_NEEDS_RESOLUTION (loc))
6472 val_resolve (out, val, PAT_VAR_LOCATION_LOC (vloc), insn);
6473 set_variable_part (out, val, dv_from_decl (var), 0,
6474 VAR_INIT_STATUS_INITIALIZED, NULL_RTX,
6477 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc)))
6478 set_variable_part (out, PAT_VAR_LOCATION_LOC (vloc),
6479 dv_from_decl (var), 0,
6480 VAR_INIT_STATUS_INITIALIZED, NULL_RTX,
6487 rtx loc = mo->u.loc;
6488 rtx val, vloc, uloc;
6490 vloc = uloc = XEXP (loc, 1);
6491 val = XEXP (loc, 0);
6493 if (GET_CODE (val) == CONCAT)
6495 uloc = XEXP (val, 1);
6496 val = XEXP (val, 0);
6499 if (VAL_NEEDS_RESOLUTION (loc))
6500 val_resolve (out, val, vloc, insn);
6502 val_store (out, val, uloc, insn, false);
6504 if (VAL_HOLDS_TRACK_EXPR (loc))
6506 if (GET_CODE (uloc) == REG)
6507 var_reg_set (out, uloc, VAR_INIT_STATUS_UNINITIALIZED,
6509 else if (GET_CODE (uloc) == MEM)
6510 var_mem_set (out, uloc, VAR_INIT_STATUS_UNINITIALIZED,
6518 rtx loc = mo->u.loc;
6519 rtx val, vloc, uloc;
6523 uloc = XEXP (vloc, 1);
6524 val = XEXP (vloc, 0);
6527 if (GET_CODE (uloc) == SET)
6529 dstv = SET_DEST (uloc);
6530 srcv = SET_SRC (uloc);
6538 if (GET_CODE (val) == CONCAT)
6540 dstv = vloc = XEXP (val, 1);
6541 val = XEXP (val, 0);
6544 if (GET_CODE (vloc) == SET)
6546 srcv = SET_SRC (vloc);
6548 gcc_assert (val != srcv);
6549 gcc_assert (vloc == uloc || VAL_NEEDS_RESOLUTION (loc));
6551 dstv = vloc = SET_DEST (vloc);
6553 if (VAL_NEEDS_RESOLUTION (loc))
6554 val_resolve (out, val, srcv, insn);
6556 else if (VAL_NEEDS_RESOLUTION (loc))
6558 gcc_assert (GET_CODE (uloc) == SET
6559 && GET_CODE (SET_SRC (uloc)) == REG);
6560 val_resolve (out, val, SET_SRC (uloc), insn);
6563 if (VAL_HOLDS_TRACK_EXPR (loc))
6565 if (VAL_EXPR_IS_CLOBBERED (loc))
6568 var_reg_delete (out, uloc, true);
6569 else if (MEM_P (uloc))
6571 gcc_assert (MEM_P (dstv));
6572 gcc_assert (MEM_ATTRS (dstv) == MEM_ATTRS (uloc));
6573 var_mem_delete (out, dstv, true);
6578 bool copied_p = VAL_EXPR_IS_COPIED (loc);
6579 rtx src = NULL, dst = uloc;
6580 enum var_init_status status = VAR_INIT_STATUS_INITIALIZED;
6582 if (GET_CODE (uloc) == SET)
6584 src = SET_SRC (uloc);
6585 dst = SET_DEST (uloc);
6590 if (flag_var_tracking_uninit)
6592 status = find_src_status (in, src);
6594 if (status == VAR_INIT_STATUS_UNKNOWN)
6595 status = find_src_status (out, src);
6598 src = find_src_set_src (in, src);
6602 var_reg_delete_and_set (out, dst, !copied_p,
6604 else if (MEM_P (dst))
6606 gcc_assert (MEM_P (dstv));
6607 gcc_assert (MEM_ATTRS (dstv) == MEM_ATTRS (dst));
6608 var_mem_delete_and_set (out, dstv, !copied_p,
6613 else if (REG_P (uloc))
6614 var_regno_delete (out, REGNO (uloc));
6615 else if (MEM_P (uloc))
6616 clobber_overlapping_mems (out, uloc);
6618 val_store (out, val, dstv, insn, true);
6624 rtx loc = mo->u.loc;
6627 if (GET_CODE (loc) == SET)
6629 set_src = SET_SRC (loc);
6630 loc = SET_DEST (loc);
6634 var_reg_delete_and_set (out, loc, true, VAR_INIT_STATUS_INITIALIZED,
6636 else if (MEM_P (loc))
6637 var_mem_delete_and_set (out, loc, true, VAR_INIT_STATUS_INITIALIZED,
6644 rtx loc = mo->u.loc;
6645 enum var_init_status src_status;
6648 if (GET_CODE (loc) == SET)
6650 set_src = SET_SRC (loc);
6651 loc = SET_DEST (loc);
6654 if (! flag_var_tracking_uninit)
6655 src_status = VAR_INIT_STATUS_INITIALIZED;
6658 src_status = find_src_status (in, set_src);
6660 if (src_status == VAR_INIT_STATUS_UNKNOWN)
6661 src_status = find_src_status (out, set_src);
6664 set_src = find_src_set_src (in, set_src);
6667 var_reg_delete_and_set (out, loc, false, src_status, set_src);
6668 else if (MEM_P (loc))
6669 var_mem_delete_and_set (out, loc, false, src_status, set_src);
6675 rtx loc = mo->u.loc;
6678 var_reg_delete (out, loc, false);
6679 else if (MEM_P (loc))
6680 var_mem_delete (out, loc, false);
6686 rtx loc = mo->u.loc;
6689 var_reg_delete (out, loc, true);
6690 else if (MEM_P (loc))
6691 var_mem_delete (out, loc, true);
6696 out->stack_adjust += mo->u.adjust;
6701 if (MAY_HAVE_DEBUG_INSNS)
6703 dataflow_set_equiv_regs (out);
6704 htab_traverse (shared_hash_htab (out->vars), canonicalize_values_mark,
6706 htab_traverse (shared_hash_htab (out->vars), canonicalize_values_star,
6709 htab_traverse (shared_hash_htab (out->vars),
6710 canonicalize_loc_order_check, out);
6713 changed = dataflow_set_different (&old_out, out);
6714 dataflow_set_destroy (&old_out);
6718 /* Find the locations of variables in the whole function. */
6721 vt_find_locations (void)
6723 fibheap_t worklist, pending, fibheap_swap;
6724 sbitmap visited, in_worklist, in_pending, sbitmap_swap;
6731 int htabmax = PARAM_VALUE (PARAM_MAX_VARTRACK_SIZE);
6732 bool success = true;
6734 timevar_push (TV_VAR_TRACKING_DATAFLOW);
6735 /* Compute reverse completion order of depth first search of the CFG
6736 so that the data-flow runs faster. */
6737 rc_order = XNEWVEC (int, n_basic_blocks - NUM_FIXED_BLOCKS);
6738 bb_order = XNEWVEC (int, last_basic_block);
6739 pre_and_rev_post_order_compute (NULL, rc_order, false);
6740 for (i = 0; i < n_basic_blocks - NUM_FIXED_BLOCKS; i++)
6741 bb_order[rc_order[i]] = i;
6744 worklist = fibheap_new ();
6745 pending = fibheap_new ();
6746 visited = sbitmap_alloc (last_basic_block);
6747 in_worklist = sbitmap_alloc (last_basic_block);
6748 in_pending = sbitmap_alloc (last_basic_block);
6749 sbitmap_zero (in_worklist);
6752 fibheap_insert (pending, bb_order[bb->index], bb);
6753 sbitmap_ones (in_pending);
6755 while (success && !fibheap_empty (pending))
6757 fibheap_swap = pending;
6759 worklist = fibheap_swap;
6760 sbitmap_swap = in_pending;
6761 in_pending = in_worklist;
6762 in_worklist = sbitmap_swap;
6764 sbitmap_zero (visited);
6766 while (!fibheap_empty (worklist))
6768 bb = (basic_block) fibheap_extract_min (worklist);
6769 RESET_BIT (in_worklist, bb->index);
6770 gcc_assert (!TEST_BIT (visited, bb->index));
6771 if (!TEST_BIT (visited, bb->index))
6775 int oldinsz, oldoutsz;
6777 SET_BIT (visited, bb->index);
6779 if (VTI (bb)->in.vars)
6782 -= (htab_size (shared_hash_htab (VTI (bb)->in.vars))
6783 + htab_size (shared_hash_htab (VTI (bb)->out.vars)));
6785 = htab_elements (shared_hash_htab (VTI (bb)->in.vars));
6787 = htab_elements (shared_hash_htab (VTI (bb)->out.vars));
6790 oldinsz = oldoutsz = 0;
6792 if (MAY_HAVE_DEBUG_INSNS)
6794 dataflow_set *in = &VTI (bb)->in, *first_out = NULL;
6795 bool first = true, adjust = false;
6797 /* Calculate the IN set as the intersection of
6798 predecessor OUT sets. */
6800 dataflow_set_clear (in);
6801 dst_can_be_shared = true;
6803 FOR_EACH_EDGE (e, ei, bb->preds)
6804 if (!VTI (e->src)->flooded)
6805 gcc_assert (bb_order[bb->index]
6806 <= bb_order[e->src->index]);
6809 dataflow_set_copy (in, &VTI (e->src)->out);
6810 first_out = &VTI (e->src)->out;
6815 dataflow_set_merge (in, &VTI (e->src)->out);
6821 dataflow_post_merge_adjust (in, &VTI (bb)->permp);
6823 /* Merge and merge_adjust should keep entries in
6825 htab_traverse (shared_hash_htab (in->vars),
6826 canonicalize_loc_order_check,
6829 if (dst_can_be_shared)
6831 shared_hash_destroy (in->vars);
6832 in->vars = shared_hash_copy (first_out->vars);
6836 VTI (bb)->flooded = true;
6840 /* Calculate the IN set as union of predecessor OUT sets. */
6841 dataflow_set_clear (&VTI (bb)->in);
6842 FOR_EACH_EDGE (e, ei, bb->preds)
6843 dataflow_set_union (&VTI (bb)->in, &VTI (e->src)->out);
6846 changed = compute_bb_dataflow (bb);
6847 htabsz += (htab_size (shared_hash_htab (VTI (bb)->in.vars))
6848 + htab_size (shared_hash_htab (VTI (bb)->out.vars)));
6850 if (htabmax && htabsz > htabmax)
6852 if (MAY_HAVE_DEBUG_INSNS)
6853 inform (DECL_SOURCE_LOCATION (cfun->decl),
6854 "variable tracking size limit exceeded with "
6855 "-fvar-tracking-assignments, retrying without");
6857 inform (DECL_SOURCE_LOCATION (cfun->decl),
6858 "variable tracking size limit exceeded");
6865 FOR_EACH_EDGE (e, ei, bb->succs)
6867 if (e->dest == EXIT_BLOCK_PTR)
6870 if (TEST_BIT (visited, e->dest->index))
6872 if (!TEST_BIT (in_pending, e->dest->index))
6874 /* Send E->DEST to next round. */
6875 SET_BIT (in_pending, e->dest->index);
6876 fibheap_insert (pending,
6877 bb_order[e->dest->index],
6881 else if (!TEST_BIT (in_worklist, e->dest->index))
6883 /* Add E->DEST to current round. */
6884 SET_BIT (in_worklist, e->dest->index);
6885 fibheap_insert (worklist, bb_order[e->dest->index],
6893 "BB %i: in %i (was %i), out %i (was %i), rem %i + %i, tsz %i\n",
6895 (int)htab_elements (shared_hash_htab (VTI (bb)->in.vars)),
6897 (int)htab_elements (shared_hash_htab (VTI (bb)->out.vars)),
6899 (int)worklist->nodes, (int)pending->nodes, htabsz);
6901 if (dump_file && (dump_flags & TDF_DETAILS))
6903 fprintf (dump_file, "BB %i IN:\n", bb->index);
6904 dump_dataflow_set (&VTI (bb)->in);
6905 fprintf (dump_file, "BB %i OUT:\n", bb->index);
6906 dump_dataflow_set (&VTI (bb)->out);
6912 if (success && MAY_HAVE_DEBUG_INSNS)
6914 gcc_assert (VTI (bb)->flooded);
6917 fibheap_delete (worklist);
6918 fibheap_delete (pending);
6919 sbitmap_free (visited);
6920 sbitmap_free (in_worklist);
6921 sbitmap_free (in_pending);
6923 timevar_pop (TV_VAR_TRACKING_DATAFLOW);
6927 /* Print the content of the LIST to dump file. */
6930 dump_attrs_list (attrs list)
6932 for (; list; list = list->next)
6934 if (dv_is_decl_p (list->dv))
6935 print_mem_expr (dump_file, dv_as_decl (list->dv));
6937 print_rtl_single (dump_file, dv_as_value (list->dv));
6938 fprintf (dump_file, "+" HOST_WIDE_INT_PRINT_DEC, list->offset);
6940 fprintf (dump_file, "\n");
6943 /* Print the information about variable *SLOT to dump file. */
6946 dump_var_slot (void **slot, void *data ATTRIBUTE_UNUSED)
6948 variable var = (variable) *slot;
6952 /* Continue traversing the hash table. */
6956 /* Print the information about variable VAR to dump file. */
6959 dump_var (variable var)
6962 location_chain node;
6964 if (dv_is_decl_p (var->dv))
6966 const_tree decl = dv_as_decl (var->dv);
6968 if (DECL_NAME (decl))
6970 fprintf (dump_file, " name: %s",
6971 IDENTIFIER_POINTER (DECL_NAME (decl)));
6972 if (dump_flags & TDF_UID)
6973 fprintf (dump_file, "D.%u", DECL_UID (decl));
6975 else if (TREE_CODE (decl) == DEBUG_EXPR_DECL)
6976 fprintf (dump_file, " name: D#%u", DEBUG_TEMP_UID (decl));
6978 fprintf (dump_file, " name: D.%u", DECL_UID (decl));
6979 fprintf (dump_file, "\n");
6983 fputc (' ', dump_file);
6984 print_rtl_single (dump_file, dv_as_value (var->dv));
6987 for (i = 0; i < var->n_var_parts; i++)
6989 fprintf (dump_file, " offset %ld\n",
6990 (long)(var->onepart ? 0 : VAR_PART_OFFSET (var, i)));
6991 for (node = var->var_part[i].loc_chain; node; node = node->next)
6993 fprintf (dump_file, " ");
6994 if (node->init == VAR_INIT_STATUS_UNINITIALIZED)
6995 fprintf (dump_file, "[uninit]");
6996 print_rtl_single (dump_file, node->loc);
7001 /* Print the information about variables from hash table VARS to dump file. */
7004 dump_vars (htab_t vars)
7006 if (htab_elements (vars) > 0)
7008 fprintf (dump_file, "Variables:\n");
7009 htab_traverse (vars, dump_var_slot, NULL);
7013 /* Print the dataflow set SET to dump file. */
7016 dump_dataflow_set (dataflow_set *set)
7020 fprintf (dump_file, "Stack adjustment: " HOST_WIDE_INT_PRINT_DEC "\n",
7022 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
7026 fprintf (dump_file, "Reg %d:", i);
7027 dump_attrs_list (set->regs[i]);
7030 dump_vars (shared_hash_htab (set->vars));
7031 fprintf (dump_file, "\n");
7034 /* Print the IN and OUT sets for each basic block to dump file. */
7037 dump_dataflow_sets (void)
7043 fprintf (dump_file, "\nBasic block %d:\n", bb->index);
7044 fprintf (dump_file, "IN:\n");
7045 dump_dataflow_set (&VTI (bb)->in);
7046 fprintf (dump_file, "OUT:\n");
7047 dump_dataflow_set (&VTI (bb)->out);
7051 /* Return the variable for DV in dropped_values, inserting one if
7052 requested with INSERT. */
7054 static inline variable
7055 variable_from_dropped (decl_or_value dv, enum insert_option insert)
7059 onepart_enum_t onepart;
7061 slot = htab_find_slot_with_hash (dropped_values, dv, dv_htab_hash (dv),
7068 return (variable) *slot;
7070 gcc_checking_assert (insert == INSERT);
7072 onepart = dv_onepart_p (dv);
7074 gcc_checking_assert (onepart == ONEPART_VALUE || onepart == ONEPART_DEXPR);
7076 empty_var = (variable) pool_alloc (onepart_pool (onepart));
7078 empty_var->refcount = 1;
7079 empty_var->n_var_parts = 0;
7080 empty_var->onepart = onepart;
7081 empty_var->in_changed_variables = false;
7082 empty_var->var_part[0].loc_chain = NULL;
7083 empty_var->var_part[0].cur_loc = NULL;
7084 VAR_LOC_1PAUX (empty_var) = NULL;
7085 set_dv_changed (dv, true);
7092 /* Recover the one-part aux from dropped_values. */
7094 static struct onepart_aux *
7095 recover_dropped_1paux (variable var)
7099 gcc_checking_assert (var->onepart);
7101 if (VAR_LOC_1PAUX (var))
7102 return VAR_LOC_1PAUX (var);
7104 if (var->onepart == ONEPART_VDECL)
7107 dvar = variable_from_dropped (var->dv, NO_INSERT);
7112 VAR_LOC_1PAUX (var) = VAR_LOC_1PAUX (dvar);
7113 VAR_LOC_1PAUX (dvar) = NULL;
7115 return VAR_LOC_1PAUX (var);
7118 /* Add variable VAR to the hash table of changed variables and
7119 if it has no locations delete it from SET's hash table. */
7122 variable_was_changed (variable var, dataflow_set *set)
7124 hashval_t hash = dv_htab_hash (var->dv);
7130 /* Remember this decl or VALUE has been added to changed_variables. */
7131 set_dv_changed (var->dv, true);
7133 slot = htab_find_slot_with_hash (changed_variables,
7139 variable old_var = (variable) *slot;
7140 gcc_assert (old_var->in_changed_variables);
7141 old_var->in_changed_variables = false;
7142 if (var != old_var && var->onepart)
7144 /* Restore the auxiliary info from an empty variable
7145 previously created for changed_variables, so it is
7147 gcc_checking_assert (!VAR_LOC_1PAUX (var));
7148 VAR_LOC_1PAUX (var) = VAR_LOC_1PAUX (old_var);
7149 VAR_LOC_1PAUX (old_var) = NULL;
7151 variable_htab_free (*slot);
7154 if (set && var->n_var_parts == 0)
7156 onepart_enum_t onepart = var->onepart;
7157 variable empty_var = NULL;
7158 void **dslot = NULL;
7160 if (onepart == ONEPART_VALUE || onepart == ONEPART_DEXPR)
7162 dslot = htab_find_slot_with_hash (dropped_values, var->dv,
7163 dv_htab_hash (var->dv),
7165 empty_var = (variable) *dslot;
7169 gcc_checking_assert (!empty_var->in_changed_variables);
7170 if (!VAR_LOC_1PAUX (var))
7172 VAR_LOC_1PAUX (var) = VAR_LOC_1PAUX (empty_var);
7173 VAR_LOC_1PAUX (empty_var) = NULL;
7176 gcc_checking_assert (!VAR_LOC_1PAUX (empty_var));
7182 empty_var = (variable) pool_alloc (onepart_pool (onepart));
7183 empty_var->dv = var->dv;
7184 empty_var->refcount = 1;
7185 empty_var->n_var_parts = 0;
7186 empty_var->onepart = onepart;
7189 empty_var->refcount++;
7194 empty_var->refcount++;
7195 empty_var->in_changed_variables = true;
7199 empty_var->var_part[0].loc_chain = NULL;
7200 empty_var->var_part[0].cur_loc = NULL;
7201 VAR_LOC_1PAUX (empty_var) = VAR_LOC_1PAUX (var);
7202 VAR_LOC_1PAUX (var) = NULL;
7208 if (var->onepart && !VAR_LOC_1PAUX (var))
7209 recover_dropped_1paux (var);
7211 var->in_changed_variables = true;
7218 if (var->n_var_parts == 0)
7223 slot = shared_hash_find_slot_noinsert (set->vars, var->dv);
7226 if (shared_hash_shared (set->vars))
7227 slot = shared_hash_find_slot_unshare (&set->vars, var->dv,
7229 htab_clear_slot (shared_hash_htab (set->vars), slot);
7235 /* Look for the index in VAR->var_part corresponding to OFFSET.
7236 Return -1 if not found. If INSERTION_POINT is non-NULL, the
7237 referenced int will be set to the index that the part has or should
7238 have, if it should be inserted. */
7241 find_variable_location_part (variable var, HOST_WIDE_INT offset,
7242 int *insertion_point)
7251 if (insertion_point)
7252 *insertion_point = 0;
7254 return var->n_var_parts - 1;
7257 /* Find the location part. */
7259 high = var->n_var_parts;
7262 pos = (low + high) / 2;
7263 if (VAR_PART_OFFSET (var, pos) < offset)
7270 if (insertion_point)
7271 *insertion_point = pos;
7273 if (pos < var->n_var_parts && VAR_PART_OFFSET (var, pos) == offset)
7280 set_slot_part (dataflow_set *set, rtx loc, void **slot,
7281 decl_or_value dv, HOST_WIDE_INT offset,
7282 enum var_init_status initialized, rtx set_src)
7285 location_chain node, next;
7286 location_chain *nextp;
7288 onepart_enum_t onepart;
7290 var = (variable) *slot;
7293 onepart = var->onepart;
7295 onepart = dv_onepart_p (dv);
7297 gcc_checking_assert (offset == 0 || !onepart);
7298 gcc_checking_assert (loc != dv_as_opaque (dv));
7300 if (! flag_var_tracking_uninit)
7301 initialized = VAR_INIT_STATUS_INITIALIZED;
7305 /* Create new variable information. */
7306 var = (variable) pool_alloc (onepart_pool (onepart));
7309 var->n_var_parts = 1;
7310 var->onepart = onepart;
7311 var->in_changed_variables = false;
7313 VAR_LOC_1PAUX (var) = NULL;
7315 VAR_PART_OFFSET (var, 0) = offset;
7316 var->var_part[0].loc_chain = NULL;
7317 var->var_part[0].cur_loc = NULL;
7320 nextp = &var->var_part[0].loc_chain;
7326 gcc_assert (dv_as_opaque (var->dv) == dv_as_opaque (dv));
7330 if (GET_CODE (loc) == VALUE)
7332 for (nextp = &var->var_part[0].loc_chain; (node = *nextp);
7333 nextp = &node->next)
7334 if (GET_CODE (node->loc) == VALUE)
7336 if (node->loc == loc)
7341 if (canon_value_cmp (node->loc, loc))
7349 else if (REG_P (node->loc) || MEM_P (node->loc))
7357 else if (REG_P (loc))
7359 for (nextp = &var->var_part[0].loc_chain; (node = *nextp);
7360 nextp = &node->next)
7361 if (REG_P (node->loc))
7363 if (REGNO (node->loc) < REGNO (loc))
7367 if (REGNO (node->loc) == REGNO (loc))
7380 else if (MEM_P (loc))
7382 for (nextp = &var->var_part[0].loc_chain; (node = *nextp);
7383 nextp = &node->next)
7384 if (REG_P (node->loc))
7386 else if (MEM_P (node->loc))
7388 if ((r = loc_cmp (XEXP (node->loc, 0), XEXP (loc, 0))) >= 0)
7400 for (nextp = &var->var_part[0].loc_chain; (node = *nextp);
7401 nextp = &node->next)
7402 if ((r = loc_cmp (node->loc, loc)) >= 0)
7410 if (shared_var_p (var, set->vars))
7412 slot = unshare_variable (set, slot, var, initialized);
7413 var = (variable)*slot;
7414 for (nextp = &var->var_part[0].loc_chain; c;
7415 nextp = &(*nextp)->next)
7417 gcc_assert ((!node && !*nextp) || node->loc == (*nextp)->loc);
7424 gcc_assert (dv_as_decl (var->dv) == dv_as_decl (dv));
7426 pos = find_variable_location_part (var, offset, &inspos);
7430 node = var->var_part[pos].loc_chain;
7433 && ((REG_P (node->loc) && REG_P (loc)
7434 && REGNO (node->loc) == REGNO (loc))
7435 || rtx_equal_p (node->loc, loc)))
7437 /* LOC is in the beginning of the chain so we have nothing
7439 if (node->init < initialized)
7440 node->init = initialized;
7441 if (set_src != NULL)
7442 node->set_src = set_src;
7448 /* We have to make a copy of a shared variable. */
7449 if (shared_var_p (var, set->vars))
7451 slot = unshare_variable (set, slot, var, initialized);
7452 var = (variable)*slot;
7458 /* We have not found the location part, new one will be created. */
7460 /* We have to make a copy of the shared variable. */
7461 if (shared_var_p (var, set->vars))
7463 slot = unshare_variable (set, slot, var, initialized);
7464 var = (variable)*slot;
7467 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
7468 thus there are at most MAX_VAR_PARTS different offsets. */
7469 gcc_assert (var->n_var_parts < MAX_VAR_PARTS
7470 && (!var->n_var_parts || !onepart));
7472 /* We have to move the elements of array starting at index
7473 inspos to the next position. */
7474 for (pos = var->n_var_parts; pos > inspos; pos--)
7475 var->var_part[pos] = var->var_part[pos - 1];
7478 gcc_checking_assert (!onepart);
7479 VAR_PART_OFFSET (var, pos) = offset;
7480 var->var_part[pos].loc_chain = NULL;
7481 var->var_part[pos].cur_loc = NULL;
7484 /* Delete the location from the list. */
7485 nextp = &var->var_part[pos].loc_chain;
7486 for (node = var->var_part[pos].loc_chain; node; node = next)
7489 if ((REG_P (node->loc) && REG_P (loc)
7490 && REGNO (node->loc) == REGNO (loc))
7491 || rtx_equal_p (node->loc, loc))
7493 /* Save these values, to assign to the new node, before
7494 deleting this one. */
7495 if (node->init > initialized)
7496 initialized = node->init;
7497 if (node->set_src != NULL && set_src == NULL)
7498 set_src = node->set_src;
7499 if (var->var_part[pos].cur_loc == node->loc)
7500 var->var_part[pos].cur_loc = NULL;
7501 pool_free (loc_chain_pool, node);
7506 nextp = &node->next;
7509 nextp = &var->var_part[pos].loc_chain;
7512 /* Add the location to the beginning. */
7513 node = (location_chain) pool_alloc (loc_chain_pool);
7515 node->init = initialized;
7516 node->set_src = set_src;
7517 node->next = *nextp;
7520 /* If no location was emitted do so. */
7521 if (var->var_part[pos].cur_loc == NULL)
7522 variable_was_changed (var, set);
7527 /* Set the part of variable's location in the dataflow set SET. The
7528 variable part is specified by variable's declaration in DV and
7529 offset OFFSET and the part's location by LOC. IOPT should be
7530 NO_INSERT if the variable is known to be in SET already and the
7531 variable hash table must not be resized, and INSERT otherwise. */
7534 set_variable_part (dataflow_set *set, rtx loc,
7535 decl_or_value dv, HOST_WIDE_INT offset,
7536 enum var_init_status initialized, rtx set_src,
7537 enum insert_option iopt)
7541 if (iopt == NO_INSERT)
7542 slot = shared_hash_find_slot_noinsert (set->vars, dv);
7545 slot = shared_hash_find_slot (set->vars, dv);
7547 slot = shared_hash_find_slot_unshare (&set->vars, dv, iopt);
7549 set_slot_part (set, loc, slot, dv, offset, initialized, set_src);
7552 /* Remove all recorded register locations for the given variable part
7553 from dataflow set SET, except for those that are identical to loc.
7554 The variable part is specified by variable's declaration or value
7555 DV and offset OFFSET. */
7558 clobber_slot_part (dataflow_set *set, rtx loc, void **slot,
7559 HOST_WIDE_INT offset, rtx set_src)
7561 variable var = (variable) *slot;
7562 int pos = find_variable_location_part (var, offset, NULL);
7566 location_chain node, next;
7568 /* Remove the register locations from the dataflow set. */
7569 next = var->var_part[pos].loc_chain;
7570 for (node = next; node; node = next)
7573 if (node->loc != loc
7574 && (!flag_var_tracking_uninit
7577 || !rtx_equal_p (set_src, node->set_src)))
7579 if (REG_P (node->loc))
7584 /* Remove the variable part from the register's
7585 list, but preserve any other variable parts
7586 that might be regarded as live in that same
7588 anextp = &set->regs[REGNO (node->loc)];
7589 for (anode = *anextp; anode; anode = anext)
7591 anext = anode->next;
7592 if (dv_as_opaque (anode->dv) == dv_as_opaque (var->dv)
7593 && anode->offset == offset)
7595 pool_free (attrs_pool, anode);
7599 anextp = &anode->next;
7603 slot = delete_slot_part (set, node->loc, slot, offset);
7611 /* Remove all recorded register locations for the given variable part
7612 from dataflow set SET, except for those that are identical to loc.
7613 The variable part is specified by variable's declaration or value
7614 DV and offset OFFSET. */
7617 clobber_variable_part (dataflow_set *set, rtx loc, decl_or_value dv,
7618 HOST_WIDE_INT offset, rtx set_src)
7622 if (!dv_as_opaque (dv)
7623 || (!dv_is_value_p (dv) && ! DECL_P (dv_as_decl (dv))))
7626 slot = shared_hash_find_slot_noinsert (set->vars, dv);
7630 clobber_slot_part (set, loc, slot, offset, set_src);
7633 /* Delete the part of variable's location from dataflow set SET. The
7634 variable part is specified by its SET->vars slot SLOT and offset
7635 OFFSET and the part's location by LOC. */
7638 delete_slot_part (dataflow_set *set, rtx loc, void **slot,
7639 HOST_WIDE_INT offset)
7641 variable var = (variable) *slot;
7642 int pos = find_variable_location_part (var, offset, NULL);
7646 location_chain node, next;
7647 location_chain *nextp;
7651 if (shared_var_p (var, set->vars))
7653 /* If the variable contains the location part we have to
7654 make a copy of the variable. */
7655 for (node = var->var_part[pos].loc_chain; node;
7658 if ((REG_P (node->loc) && REG_P (loc)
7659 && REGNO (node->loc) == REGNO (loc))
7660 || rtx_equal_p (node->loc, loc))
7662 slot = unshare_variable (set, slot, var,
7663 VAR_INIT_STATUS_UNKNOWN);
7664 var = (variable)*slot;
7670 if (pos == 0 && var->onepart && VAR_LOC_1PAUX (var))
7671 cur_loc = VAR_LOC_FROM (var);
7673 cur_loc = var->var_part[pos].cur_loc;
7675 /* Delete the location part. */
7677 nextp = &var->var_part[pos].loc_chain;
7678 for (node = *nextp; node; node = next)
7681 if ((REG_P (node->loc) && REG_P (loc)
7682 && REGNO (node->loc) == REGNO (loc))
7683 || rtx_equal_p (node->loc, loc))
7685 /* If we have deleted the location which was last emitted
7686 we have to emit new location so add the variable to set
7687 of changed variables. */
7688 if (cur_loc == node->loc)
7691 var->var_part[pos].cur_loc = NULL;
7692 if (pos == 0 && var->onepart && VAR_LOC_1PAUX (var))
7693 VAR_LOC_FROM (var) = NULL;
7695 pool_free (loc_chain_pool, node);
7700 nextp = &node->next;
7703 if (var->var_part[pos].loc_chain == NULL)
7707 while (pos < var->n_var_parts)
7709 var->var_part[pos] = var->var_part[pos + 1];
7714 variable_was_changed (var, set);
7720 /* Delete the part of variable's location from dataflow set SET. The
7721 variable part is specified by variable's declaration or value DV
7722 and offset OFFSET and the part's location by LOC. */
7725 delete_variable_part (dataflow_set *set, rtx loc, decl_or_value dv,
7726 HOST_WIDE_INT offset)
7728 void **slot = shared_hash_find_slot_noinsert (set->vars, dv);
7732 delete_slot_part (set, loc, slot, offset);
7735 DEF_VEC_P (variable);
7736 DEF_VEC_ALLOC_P (variable, heap);
7738 DEF_VEC_ALLOC_P_STACK (rtx);
7739 #define VEC_rtx_stack_alloc(alloc) VEC_stack_alloc (rtx, alloc)
7741 /* Structure for passing some other parameters to function
7742 vt_expand_loc_callback. */
7743 struct expand_loc_callback_data
7745 /* The variables and values active at this point. */
7748 /* Stack of values and debug_exprs under expansion, and their
7750 VEC (rtx, stack) *expanding;
7752 /* Stack of values and debug_exprs whose expansion hit recursion
7753 cycles. They will have VALUE_RECURSED_INTO marked when added to
7754 this list. This flag will be cleared if any of its dependencies
7755 resolves to a valid location. So, if the flag remains set at the
7756 end of the search, we know no valid location for this one can
7758 VEC (rtx, stack) *pending;
7760 /* The maximum depth among the sub-expressions under expansion.
7761 Zero indicates no expansion so far. */
7765 /* Allocate the one-part auxiliary data structure for VAR, with enough
7766 room for COUNT dependencies. */
7769 loc_exp_dep_alloc (variable var, int count)
7773 gcc_checking_assert (var->onepart);
7775 /* We can be called with COUNT == 0 to allocate the data structure
7776 without any dependencies, e.g. for the backlinks only. However,
7777 if we are specifying a COUNT, then the dependency list must have
7778 been emptied before. It would be possible to adjust pointers or
7779 force it empty here, but this is better done at an earlier point
7780 in the algorithm, so we instead leave an assertion to catch
7782 gcc_checking_assert (!count
7783 || VEC_empty (loc_exp_dep, VAR_LOC_DEP_VEC (var)));
7785 if (VAR_LOC_1PAUX (var)
7786 && VEC_space (loc_exp_dep, VAR_LOC_DEP_VEC (var), count))
7789 allocsize = offsetof (struct onepart_aux, deps)
7790 + VEC_embedded_size (loc_exp_dep, count);
7792 if (VAR_LOC_1PAUX (var))
7794 VAR_LOC_1PAUX (var) = XRESIZEVAR (struct onepart_aux,
7795 VAR_LOC_1PAUX (var), allocsize);
7796 /* If the reallocation moves the onepaux structure, the
7797 back-pointer to BACKLINKS in the first list member will still
7798 point to its old location. Adjust it. */
7799 if (VAR_LOC_DEP_LST (var))
7800 VAR_LOC_DEP_LST (var)->pprev = VAR_LOC_DEP_LSTP (var);
7804 VAR_LOC_1PAUX (var) = XNEWVAR (struct onepart_aux, allocsize);
7805 *VAR_LOC_DEP_LSTP (var) = NULL;
7806 VAR_LOC_FROM (var) = NULL;
7807 VAR_LOC_DEPTH (var).complexity = 0;
7808 VAR_LOC_DEPTH (var).entryvals = 0;
7810 VEC_embedded_init (loc_exp_dep, VAR_LOC_DEP_VEC (var), count);
7813 /* Remove all entries from the vector of active dependencies of VAR,
7814 removing them from the back-links lists too. */
7817 loc_exp_dep_clear (variable var)
7819 while (!VEC_empty (loc_exp_dep, VAR_LOC_DEP_VEC (var)))
7821 loc_exp_dep *led = &VEC_last (loc_exp_dep, VAR_LOC_DEP_VEC (var));
7823 led->next->pprev = led->pprev;
7825 *led->pprev = led->next;
7826 VEC_pop (loc_exp_dep, VAR_LOC_DEP_VEC (var));
7830 /* Insert an active dependency from VAR on X to the vector of
7831 dependencies, and add the corresponding back-link to X's list of
7832 back-links in VARS. */
7835 loc_exp_insert_dep (variable var, rtx x, htab_t vars)
7841 dv = dv_from_rtx (x);
7843 /* ??? Build a vector of variables parallel to EXPANDING, to avoid
7844 an additional look up? */
7845 xvar = (variable) htab_find_with_hash (vars, dv, dv_htab_hash (dv));
7849 xvar = variable_from_dropped (dv, NO_INSERT);
7850 gcc_checking_assert (xvar);
7853 /* No point in adding the same backlink more than once. This may
7854 arise if say the same value appears in two complex expressions in
7855 the same loc_list, or even more than once in a single
7857 if (VAR_LOC_DEP_LST (xvar) && VAR_LOC_DEP_LST (xvar)->dv == var->dv)
7860 if (var->onepart == NOT_ONEPART)
7861 led = (loc_exp_dep *) pool_alloc (loc_exp_dep_pool);
7865 memset (&empty, 0, sizeof (empty));
7866 VEC_quick_push (loc_exp_dep, VAR_LOC_DEP_VEC (var), empty);
7867 led = &VEC_last (loc_exp_dep, VAR_LOC_DEP_VEC (var));
7872 loc_exp_dep_alloc (xvar, 0);
7873 led->pprev = VAR_LOC_DEP_LSTP (xvar);
7874 led->next = *led->pprev;
7876 led->next->pprev = &led->next;
7880 /* Create active dependencies of VAR on COUNT values starting at
7881 VALUE, and corresponding back-links to the entries in VARS. Return
7882 true if we found any pending-recursion results. */
7885 loc_exp_dep_set (variable var, rtx result, rtx *value, int count, htab_t vars)
7887 bool pending_recursion = false;
7889 gcc_checking_assert (VEC_empty (loc_exp_dep, VAR_LOC_DEP_VEC (var)));
7891 /* Set up all dependencies from last_child (as set up at the end of
7892 the loop above) to the end. */
7893 loc_exp_dep_alloc (var, count);
7899 if (!pending_recursion)
7900 pending_recursion = !result && VALUE_RECURSED_INTO (x);
7902 loc_exp_insert_dep (var, x, vars);
7905 return pending_recursion;
7908 /* Notify the back-links of IVAR that are pending recursion that we
7909 have found a non-NIL value for it, so they are cleared for another
7910 attempt to compute a current location. */
7913 notify_dependents_of_resolved_value (variable ivar, htab_t vars)
7915 loc_exp_dep *led, *next;
7917 for (led = VAR_LOC_DEP_LST (ivar); led; led = next)
7919 decl_or_value dv = led->dv;
7924 if (dv_is_value_p (dv))
7926 rtx value = dv_as_value (dv);
7928 /* If we have already resolved it, leave it alone. */
7929 if (!VALUE_RECURSED_INTO (value))
7932 /* Check that VALUE_RECURSED_INTO, true from the test above,
7933 implies NO_LOC_P. */
7934 gcc_checking_assert (NO_LOC_P (value));
7936 /* We won't notify variables that are being expanded,
7937 because their dependency list is cleared before
7939 NO_LOC_P (value) = false;
7940 VALUE_RECURSED_INTO (value) = false;
7942 gcc_checking_assert (dv_changed_p (dv));
7946 gcc_checking_assert (dv_onepart_p (dv) != NOT_ONEPART);
7947 if (!dv_changed_p (dv))
7951 var = (variable) htab_find_with_hash (vars, dv, dv_htab_hash (dv));
7954 var = variable_from_dropped (dv, NO_INSERT);
7957 notify_dependents_of_resolved_value (var, vars);
7960 next->pprev = led->pprev;
7968 static rtx vt_expand_loc_callback (rtx x, bitmap regs,
7969 int max_depth, void *data);
7971 /* Return the combined depth, when one sub-expression evaluated to
7972 BEST_DEPTH and the previous known depth was SAVED_DEPTH. */
7974 static inline expand_depth
7975 update_depth (expand_depth saved_depth, expand_depth best_depth)
7977 /* If we didn't find anything, stick with what we had. */
7978 if (!best_depth.complexity)
7981 /* If we found hadn't found anything, use the depth of the current
7982 expression. Do NOT add one extra level, we want to compute the
7983 maximum depth among sub-expressions. We'll increment it later,
7985 if (!saved_depth.complexity)
7988 /* Combine the entryval count so that regardless of which one we
7989 return, the entryval count is accurate. */
7990 best_depth.entryvals = saved_depth.entryvals
7991 = best_depth.entryvals + saved_depth.entryvals;
7993 if (saved_depth.complexity < best_depth.complexity)
7999 /* Expand VAR to a location RTX, updating its cur_loc. Use REGS and
8000 DATA for cselib expand callback. If PENDRECP is given, indicate in
8001 it whether any sub-expression couldn't be fully evaluated because
8002 it is pending recursion resolution. */
8005 vt_expand_var_loc_chain (variable var, bitmap regs, void *data, bool *pendrecp)
8007 struct expand_loc_callback_data *elcd
8008 = (struct expand_loc_callback_data *) data;
8009 location_chain loc, next;
8011 int first_child, result_first_child, last_child;
8012 bool pending_recursion;
8013 rtx loc_from = NULL;
8014 struct elt_loc_list *cloc = NULL;
8015 expand_depth depth = { 0, 0 }, saved_depth = elcd->depth;
8016 int wanted_entryvals, found_entryvals = 0;
8018 /* Clear all backlinks pointing at this, so that we're not notified
8019 while we're active. */
8020 loc_exp_dep_clear (var);
8023 if (var->onepart == ONEPART_VALUE)
8025 cselib_val *val = CSELIB_VAL_PTR (dv_as_value (var->dv));
8027 gcc_checking_assert (cselib_preserved_value_p (val));
8032 first_child = result_first_child = last_child
8033 = VEC_length (rtx, elcd->expanding);
8035 wanted_entryvals = found_entryvals;
8037 /* Attempt to expand each available location in turn. */
8038 for (next = loc = var->n_var_parts ? var->var_part[0].loc_chain : NULL;
8039 loc || cloc; loc = next)
8041 result_first_child = last_child;
8045 loc_from = cloc->loc;
8048 if (unsuitable_loc (loc_from))
8053 loc_from = loc->loc;
8057 gcc_checking_assert (!unsuitable_loc (loc_from));
8059 elcd->depth.complexity = elcd->depth.entryvals = 0;
8060 result = cselib_expand_value_rtx_cb (loc_from, regs, EXPR_DEPTH,
8061 vt_expand_loc_callback, data);
8062 last_child = VEC_length (rtx, elcd->expanding);
8066 depth = elcd->depth;
8068 gcc_checking_assert (depth.complexity
8069 || result_first_child == last_child);
8071 if (last_child - result_first_child != 1)
8073 if (!depth.complexity && GET_CODE (result) == ENTRY_VALUE)
8078 if (depth.complexity <= EXPR_USE_DEPTH)
8080 if (depth.entryvals <= wanted_entryvals)
8082 else if (!found_entryvals || depth.entryvals < found_entryvals)
8083 found_entryvals = depth.entryvals;
8089 /* Set it up in case we leave the loop. */
8090 depth.complexity = depth.entryvals = 0;
8092 result_first_child = first_child;
8095 if (!loc_from && wanted_entryvals < found_entryvals)
8097 /* We found entries with ENTRY_VALUEs and skipped them. Since
8098 we could not find any expansions without ENTRY_VALUEs, but we
8099 found at least one with them, go back and get an entry with
8100 the minimum number ENTRY_VALUE count that we found. We could
8101 avoid looping, but since each sub-loc is already resolved,
8102 the re-expansion should be trivial. ??? Should we record all
8103 attempted locs as dependencies, so that we retry the
8104 expansion should any of them change, in the hope it can give
8105 us a new entry without an ENTRY_VALUE? */
8106 VEC_truncate (rtx, elcd->expanding, first_child);
8110 /* Register all encountered dependencies as active. */
8111 pending_recursion = loc_exp_dep_set
8112 (var, result, VEC_address (rtx, elcd->expanding) + result_first_child,
8113 last_child - result_first_child, elcd->vars);
8115 VEC_truncate (rtx, elcd->expanding, first_child);
8117 /* Record where the expansion came from. */
8118 gcc_checking_assert (!result || !pending_recursion);
8119 VAR_LOC_FROM (var) = loc_from;
8120 VAR_LOC_DEPTH (var) = depth;
8122 gcc_checking_assert (!depth.complexity == !result);
8124 elcd->depth = update_depth (saved_depth, depth);
8126 /* Indicate whether any of the dependencies are pending recursion
8129 *pendrecp = pending_recursion;
8131 if (!pendrecp || !pending_recursion)
8132 var->var_part[0].cur_loc = result;
8137 /* Callback for cselib_expand_value, that looks for expressions
8138 holding the value in the var-tracking hash tables. Return X for
8139 standard processing, anything else is to be used as-is. */
8142 vt_expand_loc_callback (rtx x, bitmap regs,
8143 int max_depth ATTRIBUTE_UNUSED,
8146 struct expand_loc_callback_data *elcd
8147 = (struct expand_loc_callback_data *) data;
8151 bool pending_recursion = false;
8152 bool from_empty = false;
8154 switch (GET_CODE (x))
8157 subreg = cselib_expand_value_rtx_cb (SUBREG_REG (x), regs,
8159 vt_expand_loc_callback, data);
8164 result = simplify_gen_subreg (GET_MODE (x), subreg,
8165 GET_MODE (SUBREG_REG (x)),
8168 /* Invalid SUBREGs are ok in debug info. ??? We could try
8169 alternate expansions for the VALUE as well. */
8171 result = gen_rtx_raw_SUBREG (GET_MODE (x), subreg, SUBREG_BYTE (x));
8177 dv = dv_from_rtx (x);
8184 VEC_safe_push (rtx, stack, elcd->expanding, x);
8186 /* Check that VALUE_RECURSED_INTO implies NO_LOC_P. */
8187 gcc_checking_assert (!VALUE_RECURSED_INTO (x) || NO_LOC_P (x));
8191 gcc_checking_assert (VALUE_RECURSED_INTO (x) || !dv_changed_p (dv));
8195 var = (variable) htab_find_with_hash (elcd->vars, dv, dv_htab_hash (dv));
8200 var = variable_from_dropped (dv, INSERT);
8203 gcc_checking_assert (var);
8205 if (!dv_changed_p (dv))
8207 gcc_checking_assert (!NO_LOC_P (x));
8208 gcc_checking_assert (var->var_part[0].cur_loc);
8209 gcc_checking_assert (VAR_LOC_1PAUX (var));
8210 gcc_checking_assert (VAR_LOC_1PAUX (var)->depth.complexity);
8212 elcd->depth = update_depth (elcd->depth, VAR_LOC_1PAUX (var)->depth);
8214 return var->var_part[0].cur_loc;
8217 VALUE_RECURSED_INTO (x) = true;
8218 /* This is tentative, but it makes some tests simpler. */
8219 NO_LOC_P (x) = true;
8221 gcc_checking_assert (var->n_var_parts == 1 || from_empty);
8223 result = vt_expand_var_loc_chain (var, regs, data, &pending_recursion);
8225 if (pending_recursion)
8227 gcc_checking_assert (!result);
8228 VEC_safe_push (rtx, stack, elcd->pending, x);
8232 NO_LOC_P (x) = !result;
8233 VALUE_RECURSED_INTO (x) = false;
8234 set_dv_changed (dv, false);
8237 notify_dependents_of_resolved_value (var, elcd->vars);
8243 /* While expanding variables, we may encounter recursion cycles
8244 because of mutual (possibly indirect) dependencies between two
8245 particular variables (or values), say A and B. If we're trying to
8246 expand A when we get to B, which in turn attempts to expand A, if
8247 we can't find any other expansion for B, we'll add B to this
8248 pending-recursion stack, and tentatively return NULL for its
8249 location. This tentative value will be used for any other
8250 occurrences of B, unless A gets some other location, in which case
8251 it will notify B that it is worth another try at computing a
8252 location for it, and it will use the location computed for A then.
8253 At the end of the expansion, the tentative NULL locations become
8254 final for all members of PENDING that didn't get a notification.
8255 This function performs this finalization of NULL locations. */
8258 resolve_expansions_pending_recursion (VEC (rtx, stack) *pending)
8260 while (!VEC_empty (rtx, pending))
8262 rtx x = VEC_pop (rtx, pending);
8265 if (!VALUE_RECURSED_INTO (x))
8268 gcc_checking_assert (NO_LOC_P (x));
8269 VALUE_RECURSED_INTO (x) = false;
8270 dv = dv_from_rtx (x);
8271 gcc_checking_assert (dv_changed_p (dv));
8272 set_dv_changed (dv, false);
8276 /* Initialize expand_loc_callback_data D with variable hash table V.
8277 It must be a macro because of alloca (VEC stack). */
8278 #define INIT_ELCD(d, v) \
8282 (d).expanding = VEC_alloc (rtx, stack, 4); \
8283 (d).pending = VEC_alloc (rtx, stack, 4); \
8284 (d).depth.complexity = (d).depth.entryvals = 0; \
8287 /* Finalize expand_loc_callback_data D, resolved to location L. */
8288 #define FINI_ELCD(d, l) \
8291 resolve_expansions_pending_recursion ((d).pending); \
8292 VEC_free (rtx, stack, (d).pending); \
8293 VEC_free (rtx, stack, (d).expanding); \
8295 if ((l) && MEM_P (l)) \
8296 (l) = targetm.delegitimize_address (l); \
8300 /* Expand VALUEs and DEBUG_EXPRs in LOC to a location, using the
8301 equivalences in VARS, updating their CUR_LOCs in the process. */
8304 vt_expand_loc (rtx loc, htab_t vars)
8306 struct expand_loc_callback_data data;
8309 if (!MAY_HAVE_DEBUG_INSNS)
8312 INIT_ELCD (data, vars);
8314 result = cselib_expand_value_rtx_cb (loc, scratch_regs, EXPR_DEPTH,
8315 vt_expand_loc_callback, &data);
8317 FINI_ELCD (data, result);
8322 /* Expand the one-part VARiable to a location, using the equivalences
8323 in VARS, updating their CUR_LOCs in the process. */
8326 vt_expand_1pvar (variable var, htab_t vars)
8328 struct expand_loc_callback_data data;
8331 gcc_checking_assert (var->onepart && var->n_var_parts == 1);
8333 if (!dv_changed_p (var->dv))
8334 return var->var_part[0].cur_loc;
8336 INIT_ELCD (data, vars);
8338 loc = vt_expand_var_loc_chain (var, scratch_regs, &data, NULL);
8340 gcc_checking_assert (VEC_empty (rtx, data.expanding));
8342 FINI_ELCD (data, loc);
8347 /* Emit the NOTE_INSN_VAR_LOCATION for variable *VARP. DATA contains
8348 additional parameters: WHERE specifies whether the note shall be emitted
8349 before or after instruction INSN. */
8352 emit_note_insn_var_location (void **varp, void *data)
8354 variable var = (variable) *varp;
8355 rtx insn = ((emit_note_data *)data)->insn;
8356 enum emit_note_where where = ((emit_note_data *)data)->where;
8357 htab_t vars = ((emit_note_data *)data)->vars;
8359 int i, j, n_var_parts;
8361 enum var_init_status initialized = VAR_INIT_STATUS_UNINITIALIZED;
8362 HOST_WIDE_INT last_limit;
8363 tree type_size_unit;
8364 HOST_WIDE_INT offsets[MAX_VAR_PARTS];
8365 rtx loc[MAX_VAR_PARTS];
8369 gcc_checking_assert (var->onepart == NOT_ONEPART
8370 || var->onepart == ONEPART_VDECL);
8372 decl = dv_as_decl (var->dv);
8378 for (i = 0; i < var->n_var_parts; i++)
8379 if (var->var_part[i].cur_loc == NULL && var->var_part[i].loc_chain)
8380 var->var_part[i].cur_loc = var->var_part[i].loc_chain->loc;
8381 for (i = 0; i < var->n_var_parts; i++)
8383 enum machine_mode mode, wider_mode;
8385 HOST_WIDE_INT offset;
8387 if (i == 0 && var->onepart)
8389 gcc_checking_assert (var->n_var_parts == 1);
8391 initialized = VAR_INIT_STATUS_INITIALIZED;
8392 loc2 = vt_expand_1pvar (var, vars);
8396 if (last_limit < VAR_PART_OFFSET (var, i))
8401 else if (last_limit > VAR_PART_OFFSET (var, i))
8403 offset = VAR_PART_OFFSET (var, i);
8404 loc2 = var->var_part[i].cur_loc;
8405 if (loc2 && GET_CODE (loc2) == MEM
8406 && GET_CODE (XEXP (loc2, 0)) == VALUE)
8408 rtx depval = XEXP (loc2, 0);
8410 loc2 = vt_expand_loc (loc2, vars);
8413 loc_exp_insert_dep (var, depval, vars);
8420 gcc_checking_assert (GET_CODE (loc2) != VALUE);
8421 for (lc = var->var_part[i].loc_chain; lc; lc = lc->next)
8422 if (var->var_part[i].cur_loc == lc->loc)
8424 initialized = lc->init;
8430 offsets[n_var_parts] = offset;
8436 loc[n_var_parts] = loc2;
8437 mode = GET_MODE (var->var_part[i].cur_loc);
8438 if (mode == VOIDmode && var->onepart)
8439 mode = DECL_MODE (decl);
8440 last_limit = offsets[n_var_parts] + GET_MODE_SIZE (mode);
8442 /* Attempt to merge adjacent registers or memory. */
8443 wider_mode = GET_MODE_WIDER_MODE (mode);
8444 for (j = i + 1; j < var->n_var_parts; j++)
8445 if (last_limit <= VAR_PART_OFFSET (var, j))
8447 if (j < var->n_var_parts
8448 && wider_mode != VOIDmode
8449 && var->var_part[j].cur_loc
8450 && mode == GET_MODE (var->var_part[j].cur_loc)
8451 && (REG_P (loc[n_var_parts]) || MEM_P (loc[n_var_parts]))
8452 && last_limit == (var->onepart ? 0 : VAR_PART_OFFSET (var, j))
8453 && (loc2 = vt_expand_loc (var->var_part[j].cur_loc, vars))
8454 && GET_CODE (loc[n_var_parts]) == GET_CODE (loc2))
8458 if (REG_P (loc[n_var_parts])
8459 && hard_regno_nregs[REGNO (loc[n_var_parts])][mode] * 2
8460 == hard_regno_nregs[REGNO (loc[n_var_parts])][wider_mode]
8461 && end_hard_regno (mode, REGNO (loc[n_var_parts]))
8464 if (! WORDS_BIG_ENDIAN && ! BYTES_BIG_ENDIAN)
8465 new_loc = simplify_subreg (wider_mode, loc[n_var_parts],
8467 else if (WORDS_BIG_ENDIAN && BYTES_BIG_ENDIAN)
8468 new_loc = simplify_subreg (wider_mode, loc2, mode, 0);
8471 if (!REG_P (new_loc)
8472 || REGNO (new_loc) != REGNO (loc[n_var_parts]))
8475 REG_ATTRS (new_loc) = REG_ATTRS (loc[n_var_parts]);
8478 else if (MEM_P (loc[n_var_parts])
8479 && GET_CODE (XEXP (loc2, 0)) == PLUS
8480 && REG_P (XEXP (XEXP (loc2, 0), 0))
8481 && CONST_INT_P (XEXP (XEXP (loc2, 0), 1)))
8483 if ((REG_P (XEXP (loc[n_var_parts], 0))
8484 && rtx_equal_p (XEXP (loc[n_var_parts], 0),
8485 XEXP (XEXP (loc2, 0), 0))
8486 && INTVAL (XEXP (XEXP (loc2, 0), 1))
8487 == GET_MODE_SIZE (mode))
8488 || (GET_CODE (XEXP (loc[n_var_parts], 0)) == PLUS
8489 && CONST_INT_P (XEXP (XEXP (loc[n_var_parts], 0), 1))
8490 && rtx_equal_p (XEXP (XEXP (loc[n_var_parts], 0), 0),
8491 XEXP (XEXP (loc2, 0), 0))
8492 && INTVAL (XEXP (XEXP (loc[n_var_parts], 0), 1))
8493 + GET_MODE_SIZE (mode)
8494 == INTVAL (XEXP (XEXP (loc2, 0), 1))))
8495 new_loc = adjust_address_nv (loc[n_var_parts],
8501 loc[n_var_parts] = new_loc;
8503 last_limit = offsets[n_var_parts] + GET_MODE_SIZE (mode);
8509 type_size_unit = TYPE_SIZE_UNIT (TREE_TYPE (decl));
8510 if ((unsigned HOST_WIDE_INT) last_limit < TREE_INT_CST_LOW (type_size_unit))
8513 if (! flag_var_tracking_uninit)
8514 initialized = VAR_INIT_STATUS_INITIALIZED;
8518 note_vl = gen_rtx_VAR_LOCATION (VOIDmode, decl, NULL_RTX,
8520 else if (n_var_parts == 1)
8524 if (offsets[0] || GET_CODE (loc[0]) == PARALLEL)
8525 expr_list = gen_rtx_EXPR_LIST (VOIDmode, loc[0], GEN_INT (offsets[0]));
8529 note_vl = gen_rtx_VAR_LOCATION (VOIDmode, decl, expr_list,
8532 else if (n_var_parts)
8536 for (i = 0; i < n_var_parts; i++)
8538 = gen_rtx_EXPR_LIST (VOIDmode, loc[i], GEN_INT (offsets[i]));
8540 parallel = gen_rtx_PARALLEL (VOIDmode,
8541 gen_rtvec_v (n_var_parts, loc));
8542 note_vl = gen_rtx_VAR_LOCATION (VOIDmode, decl,
8543 parallel, (int) initialized);
8546 if (where != EMIT_NOTE_BEFORE_INSN)
8548 note = emit_note_after (NOTE_INSN_VAR_LOCATION, insn);
8549 if (where == EMIT_NOTE_AFTER_CALL_INSN)
8550 NOTE_DURING_CALL_P (note) = true;
8554 /* Make sure that the call related notes come first. */
8555 while (NEXT_INSN (insn)
8557 && ((NOTE_KIND (insn) == NOTE_INSN_VAR_LOCATION
8558 && NOTE_DURING_CALL_P (insn))
8559 || NOTE_KIND (insn) == NOTE_INSN_CALL_ARG_LOCATION))
8560 insn = NEXT_INSN (insn);
8562 && ((NOTE_KIND (insn) == NOTE_INSN_VAR_LOCATION
8563 && NOTE_DURING_CALL_P (insn))
8564 || NOTE_KIND (insn) == NOTE_INSN_CALL_ARG_LOCATION))
8565 note = emit_note_after (NOTE_INSN_VAR_LOCATION, insn);
8567 note = emit_note_before (NOTE_INSN_VAR_LOCATION, insn);
8569 NOTE_VAR_LOCATION (note) = note_vl;
8571 set_dv_changed (var->dv, false);
8572 gcc_assert (var->in_changed_variables);
8573 var->in_changed_variables = false;
8574 htab_clear_slot (changed_variables, varp);
8576 /* Continue traversing the hash table. */
8580 /* While traversing changed_variables, push onto DATA (a stack of RTX
8581 values) entries that aren't user variables. */
8584 values_to_stack (void **slot, void *data)
8586 VEC (rtx, stack) **changed_values_stack = (VEC (rtx, stack) **)data;
8587 variable var = (variable) *slot;
8589 if (var->onepart == ONEPART_VALUE)
8590 VEC_safe_push (rtx, stack, *changed_values_stack, dv_as_value (var->dv));
8591 else if (var->onepart == ONEPART_DEXPR)
8592 VEC_safe_push (rtx, stack, *changed_values_stack,
8593 DECL_RTL_KNOWN_SET (dv_as_decl (var->dv)));
8598 /* Remove from changed_variables the entry whose DV corresponds to
8599 value or debug_expr VAL. */
8601 remove_value_from_changed_variables (rtx val)
8603 decl_or_value dv = dv_from_rtx (val);
8607 slot = htab_find_slot_with_hash (changed_variables,
8608 dv, dv_htab_hash (dv), NO_INSERT);
8609 var = (variable) *slot;
8610 var->in_changed_variables = false;
8611 htab_clear_slot (changed_variables, slot);
8614 /* If VAL (a value or debug_expr) has backlinks to variables actively
8615 dependent on it in HTAB or in CHANGED_VARIABLES, mark them as
8616 changed, adding to CHANGED_VALUES_STACK any dependencies that may
8617 have dependencies of their own to notify. */
8620 notify_dependents_of_changed_value (rtx val, htab_t htab,
8621 VEC (rtx, stack) **changed_values_stack)
8626 decl_or_value dv = dv_from_rtx (val);
8628 slot = htab_find_slot_with_hash (changed_variables,
8629 dv, dv_htab_hash (dv), NO_INSERT);
8631 slot = htab_find_slot_with_hash (htab,
8632 dv, dv_htab_hash (dv), NO_INSERT);
8634 slot = htab_find_slot_with_hash (dropped_values,
8635 dv, dv_htab_hash (dv), NO_INSERT);
8636 var = (variable) *slot;
8638 while ((led = VAR_LOC_DEP_LST (var)))
8640 decl_or_value ldv = led->dv;
8643 /* Deactivate and remove the backlink, as it was “used up”. It
8644 makes no sense to attempt to notify the same entity again:
8645 either it will be recomputed and re-register an active
8646 dependency, or it will still have the changed mark. */
8648 led->next->pprev = led->pprev;
8650 *led->pprev = led->next;
8654 if (dv_changed_p (ldv))
8657 switch (dv_onepart_p (ldv))
8661 set_dv_changed (ldv, true);
8662 VEC_safe_push (rtx, stack, *changed_values_stack, dv_as_rtx (ldv));
8666 ivar = (variable) htab_find_with_hash (htab, ldv, dv_htab_hash (ldv));
8667 gcc_checking_assert (!VAR_LOC_DEP_LST (ivar));
8668 variable_was_changed (ivar, NULL);
8672 pool_free (loc_exp_dep_pool, led);
8673 ivar = (variable) htab_find_with_hash (htab, ldv, dv_htab_hash (ldv));
8676 int i = ivar->n_var_parts;
8679 rtx loc = ivar->var_part[i].cur_loc;
8681 if (loc && GET_CODE (loc) == MEM
8682 && XEXP (loc, 0) == val)
8684 variable_was_changed (ivar, NULL);
8697 /* Take out of changed_variables any entries that don't refer to use
8698 variables. Back-propagate change notifications from values and
8699 debug_exprs to their active dependencies in HTAB or in
8700 CHANGED_VARIABLES. */
8703 process_changed_values (htab_t htab)
8707 VEC (rtx, stack) *changed_values_stack = VEC_alloc (rtx, stack, 20);
8709 /* Move values from changed_variables to changed_values_stack. */
8710 htab_traverse (changed_variables, values_to_stack, &changed_values_stack);
8712 /* Back-propagate change notifications in values while popping
8713 them from the stack. */
8714 for (n = i = VEC_length (rtx, changed_values_stack);
8715 i > 0; i = VEC_length (rtx, changed_values_stack))
8717 val = VEC_pop (rtx, changed_values_stack);
8718 notify_dependents_of_changed_value (val, htab, &changed_values_stack);
8720 /* This condition will hold when visiting each of the entries
8721 originally in changed_variables. We can't remove them
8722 earlier because this could drop the backlinks before we got a
8723 chance to use them. */
8726 remove_value_from_changed_variables (val);
8731 VEC_free (rtx, stack, changed_values_stack);
8734 /* Emit NOTE_INSN_VAR_LOCATION note for each variable from a chain
8735 CHANGED_VARIABLES and delete this chain. WHERE specifies whether
8736 the notes shall be emitted before of after instruction INSN. */
8739 emit_notes_for_changes (rtx insn, enum emit_note_where where,
8742 emit_note_data data;
8743 htab_t htab = shared_hash_htab (vars);
8745 if (!htab_elements (changed_variables))
8748 if (MAY_HAVE_DEBUG_INSNS)
8749 process_changed_values (htab);
8755 htab_traverse (changed_variables, emit_note_insn_var_location, &data);
8758 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it differs from the
8759 same variable in hash table DATA or is not there at all. */
8762 emit_notes_for_differences_1 (void **slot, void *data)
8764 htab_t new_vars = (htab_t) data;
8765 variable old_var, new_var;
8767 old_var = (variable) *slot;
8768 new_var = (variable) htab_find_with_hash (new_vars, old_var->dv,
8769 dv_htab_hash (old_var->dv));
8773 /* Variable has disappeared. */
8774 variable empty_var = NULL;
8776 if (old_var->onepart == ONEPART_VALUE
8777 || old_var->onepart == ONEPART_DEXPR)
8779 empty_var = variable_from_dropped (old_var->dv, NO_INSERT);
8782 gcc_checking_assert (!empty_var->in_changed_variables);
8783 if (!VAR_LOC_1PAUX (old_var))
8785 VAR_LOC_1PAUX (old_var) = VAR_LOC_1PAUX (empty_var);
8786 VAR_LOC_1PAUX (empty_var) = NULL;
8789 gcc_checking_assert (!VAR_LOC_1PAUX (empty_var));
8795 empty_var = (variable) pool_alloc (onepart_pool (old_var->onepart));
8796 empty_var->dv = old_var->dv;
8797 empty_var->refcount = 0;
8798 empty_var->n_var_parts = 0;
8799 empty_var->onepart = old_var->onepart;
8800 empty_var->in_changed_variables = false;
8803 if (empty_var->onepart)
8805 /* Propagate the auxiliary data to (ultimately)
8806 changed_variables. */
8807 empty_var->var_part[0].loc_chain = NULL;
8808 empty_var->var_part[0].cur_loc = NULL;
8809 VAR_LOC_1PAUX (empty_var) = VAR_LOC_1PAUX (old_var);
8810 VAR_LOC_1PAUX (old_var) = NULL;
8812 variable_was_changed (empty_var, NULL);
8813 /* Continue traversing the hash table. */
8816 /* Update cur_loc and one-part auxiliary data, before new_var goes
8817 through variable_was_changed. */
8818 if (old_var != new_var && new_var->onepart)
8820 gcc_checking_assert (VAR_LOC_1PAUX (new_var) == NULL);
8821 VAR_LOC_1PAUX (new_var) = VAR_LOC_1PAUX (old_var);
8822 VAR_LOC_1PAUX (old_var) = NULL;
8823 new_var->var_part[0].cur_loc = old_var->var_part[0].cur_loc;
8825 if (variable_different_p (old_var, new_var))
8826 variable_was_changed (new_var, NULL);
8828 /* Continue traversing the hash table. */
8832 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it is not in hash
8836 emit_notes_for_differences_2 (void **slot, void *data)
8838 htab_t old_vars = (htab_t) data;
8839 variable old_var, new_var;
8841 new_var = (variable) *slot;
8842 old_var = (variable) htab_find_with_hash (old_vars, new_var->dv,
8843 dv_htab_hash (new_var->dv));
8847 for (i = 0; i < new_var->n_var_parts; i++)
8848 new_var->var_part[i].cur_loc = NULL;
8849 variable_was_changed (new_var, NULL);
8852 /* Continue traversing the hash table. */
8856 /* Emit notes before INSN for differences between dataflow sets OLD_SET and
8860 emit_notes_for_differences (rtx insn, dataflow_set *old_set,
8861 dataflow_set *new_set)
8863 htab_traverse (shared_hash_htab (old_set->vars),
8864 emit_notes_for_differences_1,
8865 shared_hash_htab (new_set->vars));
8866 htab_traverse (shared_hash_htab (new_set->vars),
8867 emit_notes_for_differences_2,
8868 shared_hash_htab (old_set->vars));
8869 emit_notes_for_changes (insn, EMIT_NOTE_BEFORE_INSN, new_set->vars);
8872 /* Return the next insn after INSN that is not a NOTE_INSN_VAR_LOCATION. */
8875 next_non_note_insn_var_location (rtx insn)
8879 insn = NEXT_INSN (insn);
8882 || NOTE_KIND (insn) != NOTE_INSN_VAR_LOCATION)
8889 /* Emit the notes for changes of location parts in the basic block BB. */
8892 emit_notes_in_bb (basic_block bb, dataflow_set *set)
8895 micro_operation *mo;
8897 dataflow_set_clear (set);
8898 dataflow_set_copy (set, &VTI (bb)->in);
8900 FOR_EACH_VEC_ELT (micro_operation, VTI (bb)->mos, i, mo)
8902 rtx insn = mo->insn;
8903 rtx next_insn = next_non_note_insn_var_location (insn);
8908 dataflow_set_clear_at_call (set);
8909 emit_notes_for_changes (insn, EMIT_NOTE_AFTER_CALL_INSN, set->vars);
8911 rtx arguments = mo->u.loc, *p = &arguments, note;
8914 XEXP (XEXP (*p, 0), 1)
8915 = vt_expand_loc (XEXP (XEXP (*p, 0), 1),
8916 shared_hash_htab (set->vars));
8917 /* If expansion is successful, keep it in the list. */
8918 if (XEXP (XEXP (*p, 0), 1))
8920 /* Otherwise, if the following item is data_value for it,
8922 else if (XEXP (*p, 1)
8923 && REG_P (XEXP (XEXP (*p, 0), 0))
8924 && MEM_P (XEXP (XEXP (XEXP (*p, 1), 0), 0))
8925 && REG_P (XEXP (XEXP (XEXP (XEXP (*p, 1), 0), 0),
8927 && REGNO (XEXP (XEXP (*p, 0), 0))
8928 == REGNO (XEXP (XEXP (XEXP (XEXP (*p, 1), 0),
8930 *p = XEXP (XEXP (*p, 1), 1);
8931 /* Just drop this item. */
8935 note = emit_note_after (NOTE_INSN_CALL_ARG_LOCATION, insn);
8936 NOTE_VAR_LOCATION (note) = arguments;
8942 rtx loc = mo->u.loc;
8945 var_reg_set (set, loc, VAR_INIT_STATUS_UNINITIALIZED, NULL);
8947 var_mem_set (set, loc, VAR_INIT_STATUS_UNINITIALIZED, NULL);
8949 emit_notes_for_changes (insn, EMIT_NOTE_AFTER_INSN, set->vars);
8955 rtx loc = mo->u.loc;
8959 if (GET_CODE (loc) == CONCAT)
8961 val = XEXP (loc, 0);
8962 vloc = XEXP (loc, 1);
8970 var = PAT_VAR_LOCATION_DECL (vloc);
8972 clobber_variable_part (set, NULL_RTX,
8973 dv_from_decl (var), 0, NULL_RTX);
8976 if (VAL_NEEDS_RESOLUTION (loc))
8977 val_resolve (set, val, PAT_VAR_LOCATION_LOC (vloc), insn);
8978 set_variable_part (set, val, dv_from_decl (var), 0,
8979 VAR_INIT_STATUS_INITIALIZED, NULL_RTX,
8982 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc)))
8983 set_variable_part (set, PAT_VAR_LOCATION_LOC (vloc),
8984 dv_from_decl (var), 0,
8985 VAR_INIT_STATUS_INITIALIZED, NULL_RTX,
8988 emit_notes_for_changes (insn, EMIT_NOTE_AFTER_INSN, set->vars);
8994 rtx loc = mo->u.loc;
8995 rtx val, vloc, uloc;
8997 vloc = uloc = XEXP (loc, 1);
8998 val = XEXP (loc, 0);
9000 if (GET_CODE (val) == CONCAT)
9002 uloc = XEXP (val, 1);
9003 val = XEXP (val, 0);
9006 if (VAL_NEEDS_RESOLUTION (loc))
9007 val_resolve (set, val, vloc, insn);
9009 val_store (set, val, uloc, insn, false);
9011 if (VAL_HOLDS_TRACK_EXPR (loc))
9013 if (GET_CODE (uloc) == REG)
9014 var_reg_set (set, uloc, VAR_INIT_STATUS_UNINITIALIZED,
9016 else if (GET_CODE (uloc) == MEM)
9017 var_mem_set (set, uloc, VAR_INIT_STATUS_UNINITIALIZED,
9021 emit_notes_for_changes (insn, EMIT_NOTE_BEFORE_INSN, set->vars);
9027 rtx loc = mo->u.loc;
9028 rtx val, vloc, uloc;
9032 uloc = XEXP (vloc, 1);
9033 val = XEXP (vloc, 0);
9036 if (GET_CODE (uloc) == SET)
9038 dstv = SET_DEST (uloc);
9039 srcv = SET_SRC (uloc);
9047 if (GET_CODE (val) == CONCAT)
9049 dstv = vloc = XEXP (val, 1);
9050 val = XEXP (val, 0);
9053 if (GET_CODE (vloc) == SET)
9055 srcv = SET_SRC (vloc);
9057 gcc_assert (val != srcv);
9058 gcc_assert (vloc == uloc || VAL_NEEDS_RESOLUTION (loc));
9060 dstv = vloc = SET_DEST (vloc);
9062 if (VAL_NEEDS_RESOLUTION (loc))
9063 val_resolve (set, val, srcv, insn);
9065 else if (VAL_NEEDS_RESOLUTION (loc))
9067 gcc_assert (GET_CODE (uloc) == SET
9068 && GET_CODE (SET_SRC (uloc)) == REG);
9069 val_resolve (set, val, SET_SRC (uloc), insn);
9072 if (VAL_HOLDS_TRACK_EXPR (loc))
9074 if (VAL_EXPR_IS_CLOBBERED (loc))
9077 var_reg_delete (set, uloc, true);
9078 else if (MEM_P (uloc))
9080 gcc_assert (MEM_P (dstv));
9081 gcc_assert (MEM_ATTRS (dstv) == MEM_ATTRS (uloc));
9082 var_mem_delete (set, dstv, true);
9087 bool copied_p = VAL_EXPR_IS_COPIED (loc);
9088 rtx src = NULL, dst = uloc;
9089 enum var_init_status status = VAR_INIT_STATUS_INITIALIZED;
9091 if (GET_CODE (uloc) == SET)
9093 src = SET_SRC (uloc);
9094 dst = SET_DEST (uloc);
9099 status = find_src_status (set, src);
9101 src = find_src_set_src (set, src);
9105 var_reg_delete_and_set (set, dst, !copied_p,
9107 else if (MEM_P (dst))
9109 gcc_assert (MEM_P (dstv));
9110 gcc_assert (MEM_ATTRS (dstv) == MEM_ATTRS (dst));
9111 var_mem_delete_and_set (set, dstv, !copied_p,
9116 else if (REG_P (uloc))
9117 var_regno_delete (set, REGNO (uloc));
9118 else if (MEM_P (uloc))
9119 clobber_overlapping_mems (set, uloc);
9121 val_store (set, val, dstv, insn, true);
9123 emit_notes_for_changes (next_insn, EMIT_NOTE_BEFORE_INSN,
9130 rtx loc = mo->u.loc;
9133 if (GET_CODE (loc) == SET)
9135 set_src = SET_SRC (loc);
9136 loc = SET_DEST (loc);
9140 var_reg_delete_and_set (set, loc, true, VAR_INIT_STATUS_INITIALIZED,
9143 var_mem_delete_and_set (set, loc, true, VAR_INIT_STATUS_INITIALIZED,
9146 emit_notes_for_changes (next_insn, EMIT_NOTE_BEFORE_INSN,
9153 rtx loc = mo->u.loc;
9154 enum var_init_status src_status;
9157 if (GET_CODE (loc) == SET)
9159 set_src = SET_SRC (loc);
9160 loc = SET_DEST (loc);
9163 src_status = find_src_status (set, set_src);
9164 set_src = find_src_set_src (set, set_src);
9167 var_reg_delete_and_set (set, loc, false, src_status, set_src);
9169 var_mem_delete_and_set (set, loc, false, src_status, set_src);
9171 emit_notes_for_changes (next_insn, EMIT_NOTE_BEFORE_INSN,
9178 rtx loc = mo->u.loc;
9181 var_reg_delete (set, loc, false);
9183 var_mem_delete (set, loc, false);
9185 emit_notes_for_changes (insn, EMIT_NOTE_AFTER_INSN, set->vars);
9191 rtx loc = mo->u.loc;
9194 var_reg_delete (set, loc, true);
9196 var_mem_delete (set, loc, true);
9198 emit_notes_for_changes (next_insn, EMIT_NOTE_BEFORE_INSN,
9204 set->stack_adjust += mo->u.adjust;
9210 /* Emit notes for the whole function. */
9213 vt_emit_notes (void)
9218 gcc_assert (!htab_elements (changed_variables));
9220 /* Free memory occupied by the out hash tables, as they aren't used
9223 dataflow_set_clear (&VTI (bb)->out);
9225 /* Enable emitting notes by functions (mainly by set_variable_part and
9226 delete_variable_part). */
9229 if (MAY_HAVE_DEBUG_INSNS)
9231 dropped_values = htab_create (cselib_get_next_uid () * 2,
9232 variable_htab_hash, variable_htab_eq,
9233 variable_htab_free);
9234 loc_exp_dep_pool = create_alloc_pool ("loc_exp_dep pool",
9235 sizeof (loc_exp_dep), 64);
9238 dataflow_set_init (&cur);
9242 /* Emit the notes for changes of variable locations between two
9243 subsequent basic blocks. */
9244 emit_notes_for_differences (BB_HEAD (bb), &cur, &VTI (bb)->in);
9246 /* Emit the notes for the changes in the basic block itself. */
9247 emit_notes_in_bb (bb, &cur);
9249 /* Free memory occupied by the in hash table, we won't need it
9251 dataflow_set_clear (&VTI (bb)->in);
9253 #ifdef ENABLE_CHECKING
9254 htab_traverse (shared_hash_htab (cur.vars),
9255 emit_notes_for_differences_1,
9256 shared_hash_htab (empty_shared_hash));
9258 dataflow_set_destroy (&cur);
9260 if (MAY_HAVE_DEBUG_INSNS)
9261 htab_delete (dropped_values);
9266 /* If there is a declaration and offset associated with register/memory RTL
9267 assign declaration to *DECLP and offset to *OFFSETP, and return true. */
9270 vt_get_decl_and_offset (rtx rtl, tree *declp, HOST_WIDE_INT *offsetp)
9274 if (REG_ATTRS (rtl))
9276 *declp = REG_EXPR (rtl);
9277 *offsetp = REG_OFFSET (rtl);
9281 else if (MEM_P (rtl))
9283 if (MEM_ATTRS (rtl))
9285 *declp = MEM_EXPR (rtl);
9286 *offsetp = INT_MEM_OFFSET (rtl);
9293 /* Record the value for the ENTRY_VALUE of RTL as a global equivalence
9297 record_entry_value (cselib_val *val, rtx rtl)
9299 rtx ev = gen_rtx_ENTRY_VALUE (GET_MODE (rtl));
9301 ENTRY_VALUE_EXP (ev) = rtl;
9303 cselib_add_permanent_equiv (val, ev, get_insns ());
9306 /* Insert function parameter PARM in IN and OUT sets of ENTRY_BLOCK. */
9309 vt_add_function_parameter (tree parm)
9311 rtx decl_rtl = DECL_RTL_IF_SET (parm);
9312 rtx incoming = DECL_INCOMING_RTL (parm);
9314 enum machine_mode mode;
9315 HOST_WIDE_INT offset;
9319 if (TREE_CODE (parm) != PARM_DECL)
9322 if (!decl_rtl || !incoming)
9325 if (GET_MODE (decl_rtl) == BLKmode || GET_MODE (incoming) == BLKmode)
9328 /* If there is a DRAP register or a pseudo in internal_arg_pointer,
9329 rewrite the incoming location of parameters passed on the stack
9330 into MEMs based on the argument pointer, so that incoming doesn't
9331 depend on a pseudo. */
9332 if (MEM_P (incoming)
9333 && (XEXP (incoming, 0) == crtl->args.internal_arg_pointer
9334 || (GET_CODE (XEXP (incoming, 0)) == PLUS
9335 && XEXP (XEXP (incoming, 0), 0)
9336 == crtl->args.internal_arg_pointer
9337 && CONST_INT_P (XEXP (XEXP (incoming, 0), 1)))))
9339 HOST_WIDE_INT off = -FIRST_PARM_OFFSET (current_function_decl);
9340 if (GET_CODE (XEXP (incoming, 0)) == PLUS)
9341 off += INTVAL (XEXP (XEXP (incoming, 0), 1));
9343 = replace_equiv_address_nv (incoming,
9344 plus_constant (Pmode,
9345 arg_pointer_rtx, off));
9348 #ifdef HAVE_window_save
9349 /* DECL_INCOMING_RTL uses the INCOMING_REGNO of parameter registers.
9350 If the target machine has an explicit window save instruction, the
9351 actual entry value is the corresponding OUTGOING_REGNO instead. */
9352 if (REG_P (incoming)
9353 && HARD_REGISTER_P (incoming)
9354 && OUTGOING_REGNO (REGNO (incoming)) != REGNO (incoming))
9357 p.incoming = incoming;
9359 = gen_rtx_REG_offset (incoming, GET_MODE (incoming),
9360 OUTGOING_REGNO (REGNO (incoming)), 0);
9361 p.outgoing = incoming;
9362 VEC_safe_push (parm_reg_t, gc, windowed_parm_regs, p);
9364 else if (MEM_P (incoming)
9365 && REG_P (XEXP (incoming, 0))
9366 && HARD_REGISTER_P (XEXP (incoming, 0)))
9368 rtx reg = XEXP (incoming, 0);
9369 if (OUTGOING_REGNO (REGNO (reg)) != REGNO (reg))
9373 reg = gen_raw_REG (GET_MODE (reg), OUTGOING_REGNO (REGNO (reg)));
9375 VEC_safe_push (parm_reg_t, gc, windowed_parm_regs, p);
9376 incoming = replace_equiv_address_nv (incoming, reg);
9381 if (!vt_get_decl_and_offset (incoming, &decl, &offset))
9383 if (REG_P (incoming) || MEM_P (incoming))
9385 /* This means argument is passed by invisible reference. */
9388 incoming = gen_rtx_MEM (GET_MODE (decl_rtl), incoming);
9392 if (!vt_get_decl_and_offset (decl_rtl, &decl, &offset))
9394 offset += byte_lowpart_offset (GET_MODE (incoming),
9395 GET_MODE (decl_rtl));
9404 /* If that DECL_RTL wasn't a pseudo that got spilled to
9405 memory, bail out. Otherwise, the spill slot sharing code
9406 will force the memory to reference spill_slot_decl (%sfp),
9407 so we don't match above. That's ok, the pseudo must have
9408 referenced the entire parameter, so just reset OFFSET. */
9409 if (decl != get_spill_slot_decl (false))
9414 if (!track_loc_p (incoming, parm, offset, false, &mode, &offset))
9417 out = &VTI (ENTRY_BLOCK_PTR)->out;
9419 dv = dv_from_decl (parm);
9421 if (target_for_debug_bind (parm)
9422 /* We can't deal with these right now, because this kind of
9423 variable is single-part. ??? We could handle parallels
9424 that describe multiple locations for the same single
9425 value, but ATM we don't. */
9426 && GET_CODE (incoming) != PARALLEL)
9431 /* ??? We shouldn't ever hit this, but it may happen because
9432 arguments passed by invisible reference aren't dealt with
9433 above: incoming-rtl will have Pmode rather than the
9434 expected mode for the type. */
9438 lowpart = var_lowpart (mode, incoming);
9442 val = cselib_lookup_from_insn (lowpart, mode, true,
9443 VOIDmode, get_insns ());
9445 /* ??? Float-typed values in memory are not handled by
9449 preserve_value (val);
9450 set_variable_part (out, val->val_rtx, dv, offset,
9451 VAR_INIT_STATUS_INITIALIZED, NULL, INSERT);
9452 dv = dv_from_value (val->val_rtx);
9455 if (MEM_P (incoming))
9457 val = cselib_lookup_from_insn (XEXP (incoming, 0), mode, true,
9458 VOIDmode, get_insns ());
9461 preserve_value (val);
9462 incoming = replace_equiv_address_nv (incoming, val->val_rtx);
9467 if (REG_P (incoming))
9469 incoming = var_lowpart (mode, incoming);
9470 gcc_assert (REGNO (incoming) < FIRST_PSEUDO_REGISTER);
9471 attrs_list_insert (&out->regs[REGNO (incoming)], dv, offset,
9473 set_variable_part (out, incoming, dv, offset,
9474 VAR_INIT_STATUS_INITIALIZED, NULL, INSERT);
9475 if (dv_is_value_p (dv))
9477 record_entry_value (CSELIB_VAL_PTR (dv_as_value (dv)), incoming);
9478 if (TREE_CODE (TREE_TYPE (parm)) == REFERENCE_TYPE
9479 && INTEGRAL_TYPE_P (TREE_TYPE (TREE_TYPE (parm))))
9481 enum machine_mode indmode
9482 = TYPE_MODE (TREE_TYPE (TREE_TYPE (parm)));
9483 rtx mem = gen_rtx_MEM (indmode, incoming);
9484 cselib_val *val = cselib_lookup_from_insn (mem, indmode, true,
9489 preserve_value (val);
9490 record_entry_value (val, mem);
9491 set_variable_part (out, mem, dv_from_value (val->val_rtx), 0,
9492 VAR_INIT_STATUS_INITIALIZED, NULL, INSERT);
9497 else if (MEM_P (incoming))
9499 incoming = var_lowpart (mode, incoming);
9500 set_variable_part (out, incoming, dv, offset,
9501 VAR_INIT_STATUS_INITIALIZED, NULL, INSERT);
9505 /* Insert function parameters to IN and OUT sets of ENTRY_BLOCK. */
9508 vt_add_function_parameters (void)
9512 for (parm = DECL_ARGUMENTS (current_function_decl);
9513 parm; parm = DECL_CHAIN (parm))
9514 vt_add_function_parameter (parm);
9516 if (DECL_HAS_VALUE_EXPR_P (DECL_RESULT (current_function_decl)))
9518 tree vexpr = DECL_VALUE_EXPR (DECL_RESULT (current_function_decl));
9520 if (TREE_CODE (vexpr) == INDIRECT_REF)
9521 vexpr = TREE_OPERAND (vexpr, 0);
9523 if (TREE_CODE (vexpr) == PARM_DECL
9524 && DECL_ARTIFICIAL (vexpr)
9525 && !DECL_IGNORED_P (vexpr)
9526 && DECL_NAMELESS (vexpr))
9527 vt_add_function_parameter (vexpr);
9531 /* Return true if INSN in the prologue initializes hard_frame_pointer_rtx. */
9534 fp_setter (rtx insn)
9536 rtx pat = PATTERN (insn);
9537 if (RTX_FRAME_RELATED_P (insn))
9539 rtx expr = find_reg_note (insn, REG_FRAME_RELATED_EXPR, NULL_RTX);
9541 pat = XEXP (expr, 0);
9543 if (GET_CODE (pat) == SET)
9544 return SET_DEST (pat) == hard_frame_pointer_rtx;
9545 else if (GET_CODE (pat) == PARALLEL)
9548 for (i = XVECLEN (pat, 0) - 1; i >= 0; i--)
9549 if (GET_CODE (XVECEXP (pat, 0, i)) == SET
9550 && SET_DEST (XVECEXP (pat, 0, i)) == hard_frame_pointer_rtx)
9556 /* Initialize cfa_base_rtx, create a preserved VALUE for it and
9557 ensure it isn't flushed during cselib_reset_table.
9558 Can be called only if frame_pointer_rtx resp. arg_pointer_rtx
9559 has been eliminated. */
9562 vt_init_cfa_base (void)
9566 #ifdef FRAME_POINTER_CFA_OFFSET
9567 cfa_base_rtx = frame_pointer_rtx;
9568 cfa_base_offset = -FRAME_POINTER_CFA_OFFSET (current_function_decl);
9570 cfa_base_rtx = arg_pointer_rtx;
9571 cfa_base_offset = -ARG_POINTER_CFA_OFFSET (current_function_decl);
9573 if (cfa_base_rtx == hard_frame_pointer_rtx
9574 || !fixed_regs[REGNO (cfa_base_rtx)])
9576 cfa_base_rtx = NULL_RTX;
9579 if (!MAY_HAVE_DEBUG_INSNS)
9582 /* Tell alias analysis that cfa_base_rtx should share
9583 find_base_term value with stack pointer or hard frame pointer. */
9584 if (!frame_pointer_needed)
9585 vt_equate_reg_base_value (cfa_base_rtx, stack_pointer_rtx);
9586 else if (!crtl->stack_realign_tried)
9587 vt_equate_reg_base_value (cfa_base_rtx, hard_frame_pointer_rtx);
9589 val = cselib_lookup_from_insn (cfa_base_rtx, GET_MODE (cfa_base_rtx), 1,
9590 VOIDmode, get_insns ());
9591 preserve_value (val);
9592 cselib_preserve_cfa_base_value (val, REGNO (cfa_base_rtx));
9595 /* Allocate and initialize the data structures for variable tracking
9596 and parse the RTL to get the micro operations. */
9599 vt_initialize (void)
9601 basic_block bb, prologue_bb = single_succ (ENTRY_BLOCK_PTR);
9602 HOST_WIDE_INT fp_cfa_offset = -1;
9604 alloc_aux_for_blocks (sizeof (struct variable_tracking_info_def));
9606 attrs_pool = create_alloc_pool ("attrs_def pool",
9607 sizeof (struct attrs_def), 1024);
9608 var_pool = create_alloc_pool ("variable_def pool",
9609 sizeof (struct variable_def)
9610 + (MAX_VAR_PARTS - 1)
9611 * sizeof (((variable)NULL)->var_part[0]), 64);
9612 loc_chain_pool = create_alloc_pool ("location_chain_def pool",
9613 sizeof (struct location_chain_def),
9615 shared_hash_pool = create_alloc_pool ("shared_hash_def pool",
9616 sizeof (struct shared_hash_def), 256);
9617 empty_shared_hash = (shared_hash) pool_alloc (shared_hash_pool);
9618 empty_shared_hash->refcount = 1;
9619 empty_shared_hash->htab
9620 = htab_create (1, variable_htab_hash, variable_htab_eq,
9621 variable_htab_free);
9622 changed_variables = htab_create (10, variable_htab_hash, variable_htab_eq,
9623 variable_htab_free);
9625 /* Init the IN and OUT sets. */
9628 VTI (bb)->visited = false;
9629 VTI (bb)->flooded = false;
9630 dataflow_set_init (&VTI (bb)->in);
9631 dataflow_set_init (&VTI (bb)->out);
9632 VTI (bb)->permp = NULL;
9635 if (MAY_HAVE_DEBUG_INSNS)
9637 cselib_init (CSELIB_RECORD_MEMORY | CSELIB_PRESERVE_CONSTANTS);
9638 scratch_regs = BITMAP_ALLOC (NULL);
9639 valvar_pool = create_alloc_pool ("small variable_def pool",
9640 sizeof (struct variable_def), 256);
9641 preserved_values = VEC_alloc (rtx, heap, 256);
9645 scratch_regs = NULL;
9649 if (MAY_HAVE_DEBUG_INSNS)
9655 #ifdef FRAME_POINTER_CFA_OFFSET
9656 reg = frame_pointer_rtx;
9657 ofst = FRAME_POINTER_CFA_OFFSET (current_function_decl);
9659 reg = arg_pointer_rtx;
9660 ofst = ARG_POINTER_CFA_OFFSET (current_function_decl);
9663 ofst -= INCOMING_FRAME_SP_OFFSET;
9665 val = cselib_lookup_from_insn (reg, GET_MODE (reg), 1,
9666 VOIDmode, get_insns ());
9667 preserve_value (val);
9668 cselib_preserve_cfa_base_value (val, REGNO (reg));
9669 expr = plus_constant (GET_MODE (stack_pointer_rtx),
9670 stack_pointer_rtx, -ofst);
9671 cselib_add_permanent_equiv (val, expr, get_insns ());
9675 val = cselib_lookup_from_insn (stack_pointer_rtx,
9676 GET_MODE (stack_pointer_rtx), 1,
9677 VOIDmode, get_insns ());
9678 preserve_value (val);
9679 expr = plus_constant (GET_MODE (reg), reg, ofst);
9680 cselib_add_permanent_equiv (val, expr, get_insns ());
9684 /* In order to factor out the adjustments made to the stack pointer or to
9685 the hard frame pointer and thus be able to use DW_OP_fbreg operations
9686 instead of individual location lists, we're going to rewrite MEMs based
9687 on them into MEMs based on the CFA by de-eliminating stack_pointer_rtx
9688 or hard_frame_pointer_rtx to the virtual CFA pointer frame_pointer_rtx
9689 resp. arg_pointer_rtx. We can do this either when there is no frame
9690 pointer in the function and stack adjustments are consistent for all
9691 basic blocks or when there is a frame pointer and no stack realignment.
9692 But we first have to check that frame_pointer_rtx resp. arg_pointer_rtx
9693 has been eliminated. */
9694 if (!frame_pointer_needed)
9698 if (!vt_stack_adjustments ())
9701 #ifdef FRAME_POINTER_CFA_OFFSET
9702 reg = frame_pointer_rtx;
9704 reg = arg_pointer_rtx;
9706 elim = eliminate_regs (reg, VOIDmode, NULL_RTX);
9709 if (GET_CODE (elim) == PLUS)
9710 elim = XEXP (elim, 0);
9711 if (elim == stack_pointer_rtx)
9712 vt_init_cfa_base ();
9715 else if (!crtl->stack_realign_tried)
9719 #ifdef FRAME_POINTER_CFA_OFFSET
9720 reg = frame_pointer_rtx;
9721 fp_cfa_offset = FRAME_POINTER_CFA_OFFSET (current_function_decl);
9723 reg = arg_pointer_rtx;
9724 fp_cfa_offset = ARG_POINTER_CFA_OFFSET (current_function_decl);
9726 elim = eliminate_regs (reg, VOIDmode, NULL_RTX);
9729 if (GET_CODE (elim) == PLUS)
9731 fp_cfa_offset -= INTVAL (XEXP (elim, 1));
9732 elim = XEXP (elim, 0);
9734 if (elim != hard_frame_pointer_rtx)
9741 /* If the stack is realigned and a DRAP register is used, we're going to
9742 rewrite MEMs based on it representing incoming locations of parameters
9743 passed on the stack into MEMs based on the argument pointer. Although
9744 we aren't going to rewrite other MEMs, we still need to initialize the
9745 virtual CFA pointer in order to ensure that the argument pointer will
9746 be seen as a constant throughout the function.
9748 ??? This doesn't work if FRAME_POINTER_CFA_OFFSET is defined. */
9749 else if (stack_realign_drap)
9753 #ifdef FRAME_POINTER_CFA_OFFSET
9754 reg = frame_pointer_rtx;
9756 reg = arg_pointer_rtx;
9758 elim = eliminate_regs (reg, VOIDmode, NULL_RTX);
9761 if (GET_CODE (elim) == PLUS)
9762 elim = XEXP (elim, 0);
9763 if (elim == hard_frame_pointer_rtx)
9764 vt_init_cfa_base ();
9768 hard_frame_pointer_adjustment = -1;
9770 vt_add_function_parameters ();
9775 HOST_WIDE_INT pre, post = 0;
9776 basic_block first_bb, last_bb;
9778 if (MAY_HAVE_DEBUG_INSNS)
9780 cselib_record_sets_hook = add_with_sets;
9781 if (dump_file && (dump_flags & TDF_DETAILS))
9782 fprintf (dump_file, "first value: %i\n",
9783 cselib_get_next_uid ());
9790 if (bb->next_bb == EXIT_BLOCK_PTR
9791 || ! single_pred_p (bb->next_bb))
9793 e = find_edge (bb, bb->next_bb);
9794 if (! e || (e->flags & EDGE_FALLTHRU) == 0)
9800 /* Add the micro-operations to the vector. */
9801 FOR_BB_BETWEEN (bb, first_bb, last_bb->next_bb, next_bb)
9803 HOST_WIDE_INT offset = VTI (bb)->out.stack_adjust;
9804 VTI (bb)->out.stack_adjust = VTI (bb)->in.stack_adjust;
9805 for (insn = BB_HEAD (bb); insn != NEXT_INSN (BB_END (bb));
9806 insn = NEXT_INSN (insn))
9810 if (!frame_pointer_needed)
9812 insn_stack_adjust_offset_pre_post (insn, &pre, &post);
9816 mo.type = MO_ADJUST;
9819 if (dump_file && (dump_flags & TDF_DETAILS))
9820 log_op_type (PATTERN (insn), bb, insn,
9821 MO_ADJUST, dump_file);
9822 VEC_safe_push (micro_operation, heap, VTI (bb)->mos,
9824 VTI (bb)->out.stack_adjust += pre;
9828 cselib_hook_called = false;
9829 adjust_insn (bb, insn);
9830 if (MAY_HAVE_DEBUG_INSNS)
9833 prepare_call_arguments (bb, insn);
9834 cselib_process_insn (insn);
9835 if (dump_file && (dump_flags & TDF_DETAILS))
9837 print_rtl_single (dump_file, insn);
9838 dump_cselib_table (dump_file);
9841 if (!cselib_hook_called)
9842 add_with_sets (insn, 0, 0);
9845 if (!frame_pointer_needed && post)
9848 mo.type = MO_ADJUST;
9851 if (dump_file && (dump_flags & TDF_DETAILS))
9852 log_op_type (PATTERN (insn), bb, insn,
9853 MO_ADJUST, dump_file);
9854 VEC_safe_push (micro_operation, heap, VTI (bb)->mos,
9856 VTI (bb)->out.stack_adjust += post;
9859 if (bb == prologue_bb
9860 && fp_cfa_offset != -1
9861 && hard_frame_pointer_adjustment == -1
9862 && RTX_FRAME_RELATED_P (insn)
9863 && fp_setter (insn))
9865 vt_init_cfa_base ();
9866 hard_frame_pointer_adjustment = fp_cfa_offset;
9867 /* Disassociate sp from fp now. */
9868 if (MAY_HAVE_DEBUG_INSNS)
9871 cselib_invalidate_rtx (stack_pointer_rtx);
9872 v = cselib_lookup (stack_pointer_rtx, Pmode, 1,
9874 if (v && !cselib_preserved_value_p (v))
9876 cselib_set_value_sp_based (v);
9883 gcc_assert (offset == VTI (bb)->out.stack_adjust);
9888 if (MAY_HAVE_DEBUG_INSNS)
9890 cselib_preserve_only_values ();
9891 cselib_reset_table (cselib_get_next_uid ());
9892 cselib_record_sets_hook = NULL;
9896 hard_frame_pointer_adjustment = -1;
9897 VTI (ENTRY_BLOCK_PTR)->flooded = true;
9898 cfa_base_rtx = NULL_RTX;
9902 /* This is *not* reset after each function. It gives each
9903 NOTE_INSN_DELETED_DEBUG_LABEL in the entire compilation
9904 a unique label number. */
9906 static int debug_label_num = 1;
9908 /* Get rid of all debug insns from the insn stream. */
9911 delete_debug_insns (void)
9916 if (!MAY_HAVE_DEBUG_INSNS)
9921 FOR_BB_INSNS_SAFE (bb, insn, next)
9922 if (DEBUG_INSN_P (insn))
9924 tree decl = INSN_VAR_LOCATION_DECL (insn);
9925 if (TREE_CODE (decl) == LABEL_DECL
9927 && !DECL_RTL_SET_P (decl))
9929 PUT_CODE (insn, NOTE);
9930 NOTE_KIND (insn) = NOTE_INSN_DELETED_DEBUG_LABEL;
9931 NOTE_DELETED_LABEL_NAME (insn)
9932 = IDENTIFIER_POINTER (DECL_NAME (decl));
9933 SET_DECL_RTL (decl, insn);
9934 CODE_LABEL_NUMBER (insn) = debug_label_num++;
9942 /* Run a fast, BB-local only version of var tracking, to take care of
9943 information that we don't do global analysis on, such that not all
9944 information is lost. If SKIPPED holds, we're skipping the global
9945 pass entirely, so we should try to use information it would have
9946 handled as well.. */
9949 vt_debug_insns_local (bool skipped ATTRIBUTE_UNUSED)
9951 /* ??? Just skip it all for now. */
9952 delete_debug_insns ();
9955 /* Free the data structures needed for variable tracking. */
9964 VEC_free (micro_operation, heap, VTI (bb)->mos);
9969 dataflow_set_destroy (&VTI (bb)->in);
9970 dataflow_set_destroy (&VTI (bb)->out);
9971 if (VTI (bb)->permp)
9973 dataflow_set_destroy (VTI (bb)->permp);
9974 XDELETE (VTI (bb)->permp);
9977 free_aux_for_blocks ();
9978 htab_delete (empty_shared_hash->htab);
9979 htab_delete (changed_variables);
9980 free_alloc_pool (attrs_pool);
9981 free_alloc_pool (var_pool);
9982 free_alloc_pool (loc_chain_pool);
9983 free_alloc_pool (shared_hash_pool);
9985 if (MAY_HAVE_DEBUG_INSNS)
9987 if (loc_exp_dep_pool)
9988 free_alloc_pool (loc_exp_dep_pool);
9989 loc_exp_dep_pool = NULL;
9990 free_alloc_pool (valvar_pool);
9991 VEC_free (rtx, heap, preserved_values);
9993 BITMAP_FREE (scratch_regs);
9994 scratch_regs = NULL;
9997 #ifdef HAVE_window_save
9998 VEC_free (parm_reg_t, gc, windowed_parm_regs);
10002 XDELETEVEC (vui_vec);
10007 /* The entry point to variable tracking pass. */
10009 static inline unsigned int
10010 variable_tracking_main_1 (void)
10014 if (flag_var_tracking_assignments < 0)
10016 delete_debug_insns ();
10020 if (n_basic_blocks > 500 && n_edges / n_basic_blocks >= 20)
10022 vt_debug_insns_local (true);
10026 mark_dfs_back_edges ();
10027 if (!vt_initialize ())
10030 vt_debug_insns_local (true);
10034 success = vt_find_locations ();
10036 if (!success && flag_var_tracking_assignments > 0)
10040 delete_debug_insns ();
10042 /* This is later restored by our caller. */
10043 flag_var_tracking_assignments = 0;
10045 success = vt_initialize ();
10046 gcc_assert (success);
10048 success = vt_find_locations ();
10054 vt_debug_insns_local (false);
10058 if (dump_file && (dump_flags & TDF_DETAILS))
10060 dump_dataflow_sets ();
10061 dump_reg_info (dump_file);
10062 dump_flow_info (dump_file, dump_flags);
10065 timevar_push (TV_VAR_TRACKING_EMIT);
10067 timevar_pop (TV_VAR_TRACKING_EMIT);
10070 vt_debug_insns_local (false);
10075 variable_tracking_main (void)
10078 int save = flag_var_tracking_assignments;
10080 ret = variable_tracking_main_1 ();
10082 flag_var_tracking_assignments = save;
10088 gate_handle_var_tracking (void)
10090 return (flag_var_tracking && !targetm.delay_vartrack);
10095 struct rtl_opt_pass pass_variable_tracking =
10099 "vartrack", /* name */
10100 gate_handle_var_tracking, /* gate */
10101 variable_tracking_main, /* execute */
10104 0, /* static_pass_number */
10105 TV_VAR_TRACKING, /* tv_id */
10106 0, /* properties_required */
10107 0, /* properties_provided */
10108 0, /* properties_destroyed */
10109 0, /* todo_flags_start */
10110 TODO_verify_rtl_sharing /* todo_flags_finish */