1 /* Variable tracking routines for the GNU compiler.
2 Copyright (C) 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010
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 < set < clobber < 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"
95 #include "hard-reg-set.h"
96 #include "basic-block.h"
99 #include "insn-config.h"
102 #include "alloc-pool.h"
108 #include "tree-pass.h"
109 #include "tree-flow.h"
114 #include "diagnostic.h"
115 #include "pointer-set.h"
118 /* var-tracking.c assumes that tree code with the same value as VALUE rtx code
119 has no chance to appear in REG_EXPR/MEM_EXPRs and isn't a decl.
120 Currently the value is the same as IDENTIFIER_NODE, which has such
121 a property. If this compile time assertion ever fails, make sure that
122 the new tree code that equals (int) VALUE has the same property. */
123 extern char check_value_val[(int) VALUE == (int) IDENTIFIER_NODE ? 1 : -1];
125 /* Type of micro operation. */
126 enum micro_operation_type
128 MO_USE, /* Use location (REG or MEM). */
129 MO_USE_NO_VAR,/* Use location which is not associated with a variable
130 or the variable is not trackable. */
131 MO_VAL_USE, /* Use location which is associated with a value. */
132 MO_VAL_LOC, /* Use location which appears in a debug insn. */
133 MO_VAL_SET, /* Set location associated with a value. */
134 MO_SET, /* Set location. */
135 MO_COPY, /* Copy the same portion of a variable from one
136 location to another. */
137 MO_CLOBBER, /* Clobber location. */
138 MO_CALL, /* Call insn. */
139 MO_ADJUST /* Adjust stack pointer. */
143 static const char * const ATTRIBUTE_UNUSED
144 micro_operation_type_name[] = {
157 /* Where shall the note be emitted? BEFORE or AFTER the instruction.
158 Notes emitted as AFTER_CALL are to take effect during the call,
159 rather than after the call. */
162 EMIT_NOTE_BEFORE_INSN,
163 EMIT_NOTE_AFTER_INSN,
164 EMIT_NOTE_AFTER_CALL_INSN
167 /* Structure holding information about micro operation. */
168 typedef struct micro_operation_def
170 /* Type of micro operation. */
171 enum micro_operation_type type;
173 /* The instruction which the micro operation is in, for MO_USE,
174 MO_USE_NO_VAR, MO_CALL and MO_ADJUST, or the subsequent
175 instruction or note in the original flow (before any var-tracking
176 notes are inserted, to simplify emission of notes), for MO_SET
181 /* Location. For MO_SET and MO_COPY, this is the SET that
182 performs the assignment, if known, otherwise it is the target
183 of the assignment. For MO_VAL_USE and MO_VAL_SET, it is a
184 CONCAT of the VALUE and the LOC associated with it. For
185 MO_VAL_LOC, it is a CONCAT of the VALUE and the VAR_LOCATION
186 associated with it. */
189 /* Stack adjustment. */
190 HOST_WIDE_INT adjust;
194 DEF_VEC_O(micro_operation);
195 DEF_VEC_ALLOC_O(micro_operation,heap);
197 /* A declaration of a variable, or an RTL value being handled like a
199 typedef void *decl_or_value;
201 /* Structure for passing some other parameters to function
202 emit_note_insn_var_location. */
203 typedef struct emit_note_data_def
205 /* The instruction which the note will be emitted before/after. */
208 /* Where the note will be emitted (before/after insn)? */
209 enum emit_note_where where;
211 /* The variables and values active at this point. */
215 /* Description of location of a part of a variable. The content of a physical
216 register is described by a chain of these structures.
217 The chains are pretty short (usually 1 or 2 elements) and thus
218 chain is the best data structure. */
219 typedef struct attrs_def
221 /* Pointer to next member of the list. */
222 struct attrs_def *next;
224 /* The rtx of register. */
227 /* The declaration corresponding to LOC. */
230 /* Offset from start of DECL. */
231 HOST_WIDE_INT offset;
234 /* Structure holding a refcounted hash table. If refcount > 1,
235 it must be first unshared before modified. */
236 typedef struct shared_hash_def
238 /* Reference count. */
241 /* Actual hash table. */
245 /* Structure holding the IN or OUT set for a basic block. */
246 typedef struct dataflow_set_def
248 /* Adjustment of stack offset. */
249 HOST_WIDE_INT stack_adjust;
251 /* Attributes for registers (lists of attrs). */
252 attrs regs[FIRST_PSEUDO_REGISTER];
254 /* Variable locations. */
257 /* Vars that is being traversed. */
258 shared_hash traversed_vars;
261 /* The structure (one for each basic block) containing the information
262 needed for variable tracking. */
263 typedef struct variable_tracking_info_def
265 /* The vector of micro operations. */
266 VEC(micro_operation, heap) *mos;
268 /* The IN and OUT set for dataflow analysis. */
272 /* The permanent-in dataflow set for this block. This is used to
273 hold values for which we had to compute entry values. ??? This
274 should probably be dynamically allocated, to avoid using more
275 memory in non-debug builds. */
278 /* Has the block been visited in DFS? */
281 /* Has the block been flooded in VTA? */
284 } *variable_tracking_info;
286 /* Structure for chaining the locations. */
287 typedef struct location_chain_def
289 /* Next element in the chain. */
290 struct location_chain_def *next;
292 /* The location (REG, MEM or VALUE). */
295 /* The "value" stored in this location. */
299 enum var_init_status init;
302 /* Structure describing one part of variable. */
303 typedef struct variable_part_def
305 /* Chain of locations of the part. */
306 location_chain loc_chain;
308 /* Location which was last emitted to location list. */
311 /* The offset in the variable. */
312 HOST_WIDE_INT offset;
315 /* Maximum number of location parts. */
316 #define MAX_VAR_PARTS 16
318 /* Structure describing where the variable is located. */
319 typedef struct variable_def
321 /* The declaration of the variable, or an RTL value being handled
322 like a declaration. */
325 /* Reference count. */
328 /* Number of variable parts. */
331 /* True if this variable changed (any of its) cur_loc fields
332 during the current emit_notes_for_changes resp.
333 emit_notes_for_differences call. */
334 bool cur_loc_changed;
336 /* True if this variable_def struct is currently in the
337 changed_variables hash table. */
338 bool in_changed_variables;
340 /* The variable parts. */
341 variable_part var_part[1];
343 typedef const struct variable_def *const_variable;
345 /* Structure for chaining backlinks from referenced VALUEs to
346 DVs that are referencing them. */
347 typedef struct value_chain_def
349 /* Next value_chain entry. */
350 struct value_chain_def *next;
352 /* The declaration of the variable, or an RTL value
353 being handled like a declaration, whose var_parts[0].loc_chain
354 references the VALUE owning this value_chain. */
357 /* Reference count. */
360 typedef const struct value_chain_def *const_value_chain;
362 /* Pointer to the BB's information specific to variable tracking pass. */
363 #define VTI(BB) ((variable_tracking_info) (BB)->aux)
365 /* Macro to access MEM_OFFSET as an HOST_WIDE_INT. Evaluates MEM twice. */
366 #define INT_MEM_OFFSET(mem) (MEM_OFFSET (mem) ? INTVAL (MEM_OFFSET (mem)) : 0)
368 /* Alloc pool for struct attrs_def. */
369 static alloc_pool attrs_pool;
371 /* Alloc pool for struct variable_def with MAX_VAR_PARTS entries. */
372 static alloc_pool var_pool;
374 /* Alloc pool for struct variable_def with a single var_part entry. */
375 static alloc_pool valvar_pool;
377 /* Alloc pool for struct location_chain_def. */
378 static alloc_pool loc_chain_pool;
380 /* Alloc pool for struct shared_hash_def. */
381 static alloc_pool shared_hash_pool;
383 /* Alloc pool for struct value_chain_def. */
384 static alloc_pool value_chain_pool;
386 /* Changed variables, notes will be emitted for them. */
387 static htab_t changed_variables;
389 /* Links from VALUEs to DVs referencing them in their current loc_chains. */
390 static htab_t value_chains;
392 /* Shall notes be emitted? */
393 static bool emit_notes;
395 /* Empty shared hashtable. */
396 static shared_hash empty_shared_hash;
398 /* Scratch register bitmap used by cselib_expand_value_rtx. */
399 static bitmap scratch_regs = NULL;
401 /* Variable used to tell whether cselib_process_insn called our hook. */
402 static bool cselib_hook_called;
404 /* Local function prototypes. */
405 static void stack_adjust_offset_pre_post (rtx, HOST_WIDE_INT *,
407 static void insn_stack_adjust_offset_pre_post (rtx, HOST_WIDE_INT *,
409 static bool vt_stack_adjustments (void);
410 static rtx compute_cfa_pointer (HOST_WIDE_INT);
411 static hashval_t variable_htab_hash (const void *);
412 static int variable_htab_eq (const void *, const void *);
413 static void variable_htab_free (void *);
415 static void init_attrs_list_set (attrs *);
416 static void attrs_list_clear (attrs *);
417 static attrs attrs_list_member (attrs, decl_or_value, HOST_WIDE_INT);
418 static void attrs_list_insert (attrs *, decl_or_value, HOST_WIDE_INT, rtx);
419 static void attrs_list_copy (attrs *, attrs);
420 static void attrs_list_union (attrs *, attrs);
422 static void **unshare_variable (dataflow_set *set, void **slot, variable var,
423 enum var_init_status);
424 static void vars_copy (htab_t, htab_t);
425 static tree var_debug_decl (tree);
426 static void var_reg_set (dataflow_set *, rtx, enum var_init_status, rtx);
427 static void var_reg_delete_and_set (dataflow_set *, rtx, bool,
428 enum var_init_status, rtx);
429 static void var_reg_delete (dataflow_set *, rtx, bool);
430 static void var_regno_delete (dataflow_set *, int);
431 static void var_mem_set (dataflow_set *, rtx, enum var_init_status, rtx);
432 static void var_mem_delete_and_set (dataflow_set *, rtx, bool,
433 enum var_init_status, rtx);
434 static void var_mem_delete (dataflow_set *, rtx, bool);
436 static void dataflow_set_init (dataflow_set *);
437 static void dataflow_set_clear (dataflow_set *);
438 static void dataflow_set_copy (dataflow_set *, dataflow_set *);
439 static int variable_union_info_cmp_pos (const void *, const void *);
440 static void dataflow_set_union (dataflow_set *, dataflow_set *);
441 static location_chain find_loc_in_1pdv (rtx, variable, htab_t);
442 static bool canon_value_cmp (rtx, rtx);
443 static int loc_cmp (rtx, rtx);
444 static bool variable_part_different_p (variable_part *, variable_part *);
445 static bool onepart_variable_different_p (variable, variable);
446 static bool variable_different_p (variable, variable);
447 static bool dataflow_set_different (dataflow_set *, dataflow_set *);
448 static void dataflow_set_destroy (dataflow_set *);
450 static bool contains_symbol_ref (rtx);
451 static bool track_expr_p (tree, bool);
452 static bool same_variable_part_p (rtx, tree, HOST_WIDE_INT);
453 static int add_uses (rtx *, void *);
454 static void add_uses_1 (rtx *, void *);
455 static void add_stores (rtx, const_rtx, void *);
456 static bool compute_bb_dataflow (basic_block);
457 static bool vt_find_locations (void);
459 static void dump_attrs_list (attrs);
460 static int dump_var_slot (void **, void *);
461 static void dump_var (variable);
462 static void dump_vars (htab_t);
463 static void dump_dataflow_set (dataflow_set *);
464 static void dump_dataflow_sets (void);
466 static void variable_was_changed (variable, dataflow_set *);
467 static void **set_slot_part (dataflow_set *, rtx, void **,
468 decl_or_value, HOST_WIDE_INT,
469 enum var_init_status, rtx);
470 static void set_variable_part (dataflow_set *, rtx,
471 decl_or_value, HOST_WIDE_INT,
472 enum var_init_status, rtx, enum insert_option);
473 static void **clobber_slot_part (dataflow_set *, rtx,
474 void **, HOST_WIDE_INT, rtx);
475 static void clobber_variable_part (dataflow_set *, rtx,
476 decl_or_value, HOST_WIDE_INT, rtx);
477 static void **delete_slot_part (dataflow_set *, rtx, void **, HOST_WIDE_INT);
478 static void delete_variable_part (dataflow_set *, rtx,
479 decl_or_value, HOST_WIDE_INT);
480 static int emit_note_insn_var_location (void **, void *);
481 static void emit_notes_for_changes (rtx, enum emit_note_where, shared_hash);
482 static int emit_notes_for_differences_1 (void **, void *);
483 static int emit_notes_for_differences_2 (void **, void *);
484 static void emit_notes_for_differences (rtx, dataflow_set *, dataflow_set *);
485 static void emit_notes_in_bb (basic_block, dataflow_set *);
486 static void vt_emit_notes (void);
488 static bool vt_get_decl_and_offset (rtx, tree *, HOST_WIDE_INT *);
489 static void vt_add_function_parameters (void);
490 static bool vt_initialize (void);
491 static void vt_finalize (void);
493 /* Given a SET, calculate the amount of stack adjustment it contains
494 PRE- and POST-modifying stack pointer.
495 This function is similar to stack_adjust_offset. */
498 stack_adjust_offset_pre_post (rtx pattern, HOST_WIDE_INT *pre,
501 rtx src = SET_SRC (pattern);
502 rtx dest = SET_DEST (pattern);
505 if (dest == stack_pointer_rtx)
507 /* (set (reg sp) (plus (reg sp) (const_int))) */
508 code = GET_CODE (src);
509 if (! (code == PLUS || code == MINUS)
510 || XEXP (src, 0) != stack_pointer_rtx
511 || !CONST_INT_P (XEXP (src, 1)))
515 *post += INTVAL (XEXP (src, 1));
517 *post -= INTVAL (XEXP (src, 1));
519 else if (MEM_P (dest))
521 /* (set (mem (pre_dec (reg sp))) (foo)) */
522 src = XEXP (dest, 0);
523 code = GET_CODE (src);
529 if (XEXP (src, 0) == stack_pointer_rtx)
531 rtx val = XEXP (XEXP (src, 1), 1);
532 /* We handle only adjustments by constant amount. */
533 gcc_assert (GET_CODE (XEXP (src, 1)) == PLUS &&
536 if (code == PRE_MODIFY)
537 *pre -= INTVAL (val);
539 *post -= INTVAL (val);
545 if (XEXP (src, 0) == stack_pointer_rtx)
547 *pre += GET_MODE_SIZE (GET_MODE (dest));
553 if (XEXP (src, 0) == stack_pointer_rtx)
555 *post += GET_MODE_SIZE (GET_MODE (dest));
561 if (XEXP (src, 0) == stack_pointer_rtx)
563 *pre -= GET_MODE_SIZE (GET_MODE (dest));
569 if (XEXP (src, 0) == stack_pointer_rtx)
571 *post -= GET_MODE_SIZE (GET_MODE (dest));
582 /* Given an INSN, calculate the amount of stack adjustment it contains
583 PRE- and POST-modifying stack pointer. */
586 insn_stack_adjust_offset_pre_post (rtx insn, HOST_WIDE_INT *pre,
594 pattern = PATTERN (insn);
595 if (RTX_FRAME_RELATED_P (insn))
597 rtx expr = find_reg_note (insn, REG_FRAME_RELATED_EXPR, NULL_RTX);
599 pattern = XEXP (expr, 0);
602 if (GET_CODE (pattern) == SET)
603 stack_adjust_offset_pre_post (pattern, pre, post);
604 else if (GET_CODE (pattern) == PARALLEL
605 || GET_CODE (pattern) == SEQUENCE)
609 /* There may be stack adjustments inside compound insns. Search
611 for ( i = XVECLEN (pattern, 0) - 1; i >= 0; i--)
612 if (GET_CODE (XVECEXP (pattern, 0, i)) == SET)
613 stack_adjust_offset_pre_post (XVECEXP (pattern, 0, i), pre, post);
617 /* Compute stack adjustments for all blocks by traversing DFS tree.
618 Return true when the adjustments on all incoming edges are consistent.
619 Heavily borrowed from pre_and_rev_post_order_compute. */
622 vt_stack_adjustments (void)
624 edge_iterator *stack;
627 /* Initialize entry block. */
628 VTI (ENTRY_BLOCK_PTR)->visited = true;
629 VTI (ENTRY_BLOCK_PTR)->in.stack_adjust = INCOMING_FRAME_SP_OFFSET;
630 VTI (ENTRY_BLOCK_PTR)->out.stack_adjust = INCOMING_FRAME_SP_OFFSET;
632 /* Allocate stack for back-tracking up CFG. */
633 stack = XNEWVEC (edge_iterator, n_basic_blocks + 1);
636 /* Push the first edge on to the stack. */
637 stack[sp++] = ei_start (ENTRY_BLOCK_PTR->succs);
645 /* Look at the edge on the top of the stack. */
647 src = ei_edge (ei)->src;
648 dest = ei_edge (ei)->dest;
650 /* Check if the edge destination has been visited yet. */
651 if (!VTI (dest)->visited)
654 HOST_WIDE_INT pre, post, offset;
655 VTI (dest)->visited = true;
656 VTI (dest)->in.stack_adjust = offset = VTI (src)->out.stack_adjust;
658 if (dest != EXIT_BLOCK_PTR)
659 for (insn = BB_HEAD (dest);
660 insn != NEXT_INSN (BB_END (dest));
661 insn = NEXT_INSN (insn))
664 insn_stack_adjust_offset_pre_post (insn, &pre, &post);
665 offset += pre + post;
668 VTI (dest)->out.stack_adjust = offset;
670 if (EDGE_COUNT (dest->succs) > 0)
671 /* Since the DEST node has been visited for the first
672 time, check its successors. */
673 stack[sp++] = ei_start (dest->succs);
677 /* Check whether the adjustments on the edges are the same. */
678 if (VTI (dest)->in.stack_adjust != VTI (src)->out.stack_adjust)
684 if (! ei_one_before_end_p (ei))
685 /* Go to the next edge. */
686 ei_next (&stack[sp - 1]);
688 /* Return to previous level if there are no more edges. */
697 /* Compute a CFA-based value for the stack pointer. */
700 compute_cfa_pointer (HOST_WIDE_INT adjustment)
704 #ifdef FRAME_POINTER_CFA_OFFSET
705 adjustment -= FRAME_POINTER_CFA_OFFSET (current_function_decl);
706 cfa = plus_constant (frame_pointer_rtx, adjustment);
708 adjustment -= ARG_POINTER_CFA_OFFSET (current_function_decl);
709 cfa = plus_constant (arg_pointer_rtx, adjustment);
715 /* Adjustment for hard_frame_pointer_rtx to cfa base reg,
716 or -1 if the replacement shouldn't be done. */
717 static HOST_WIDE_INT hard_frame_pointer_adjustment = -1;
719 /* Data for adjust_mems callback. */
721 struct adjust_mem_data
724 enum machine_mode mem_mode;
725 HOST_WIDE_INT stack_adjust;
729 /* Helper for adjust_mems. Return 1 if *loc is unsuitable for
730 transformation of wider mode arithmetics to narrower mode,
731 -1 if it is suitable and subexpressions shouldn't be
732 traversed and 0 if it is suitable and subexpressions should
733 be traversed. Called through for_each_rtx. */
736 use_narrower_mode_test (rtx *loc, void *data)
738 rtx subreg = (rtx) data;
740 if (CONSTANT_P (*loc))
742 switch (GET_CODE (*loc))
745 if (cselib_lookup (*loc, GET_MODE (SUBREG_REG (subreg)), 0))
753 if (for_each_rtx (&XEXP (*loc, 0), use_narrower_mode_test, data))
762 /* Transform X into narrower mode MODE from wider mode WMODE. */
765 use_narrower_mode (rtx x, enum machine_mode mode, enum machine_mode wmode)
769 return lowpart_subreg (mode, x, wmode);
770 switch (GET_CODE (x))
773 return lowpart_subreg (mode, x, wmode);
777 op0 = use_narrower_mode (XEXP (x, 0), mode, wmode);
778 op1 = use_narrower_mode (XEXP (x, 1), mode, wmode);
779 return simplify_gen_binary (GET_CODE (x), mode, op0, op1);
781 op0 = use_narrower_mode (XEXP (x, 0), mode, wmode);
782 return simplify_gen_binary (ASHIFT, mode, op0, XEXP (x, 1));
788 /* Helper function for adjusting used MEMs. */
791 adjust_mems (rtx loc, const_rtx old_rtx, void *data)
793 struct adjust_mem_data *amd = (struct adjust_mem_data *) data;
794 rtx mem, addr = loc, tem;
795 enum machine_mode mem_mode_save;
797 switch (GET_CODE (loc))
800 /* Don't do any sp or fp replacements outside of MEM addresses. */
801 if (amd->mem_mode == VOIDmode)
803 if (loc == stack_pointer_rtx
804 && !frame_pointer_needed)
805 return compute_cfa_pointer (amd->stack_adjust);
806 else if (loc == hard_frame_pointer_rtx
807 && frame_pointer_needed
808 && hard_frame_pointer_adjustment != -1)
809 return compute_cfa_pointer (hard_frame_pointer_adjustment);
815 mem = targetm.delegitimize_address (mem);
816 if (mem != loc && !MEM_P (mem))
817 return simplify_replace_fn_rtx (mem, old_rtx, adjust_mems, data);
820 addr = XEXP (mem, 0);
821 mem_mode_save = amd->mem_mode;
822 amd->mem_mode = GET_MODE (mem);
823 store_save = amd->store;
825 addr = simplify_replace_fn_rtx (addr, old_rtx, adjust_mems, data);
826 amd->store = store_save;
827 amd->mem_mode = mem_mode_save;
829 addr = targetm.delegitimize_address (addr);
830 if (addr != XEXP (mem, 0))
831 mem = replace_equiv_address_nv (mem, addr);
833 mem = avoid_constant_pool_reference (mem);
837 addr = gen_rtx_PLUS (GET_MODE (loc), XEXP (loc, 0),
838 GEN_INT (GET_CODE (loc) == PRE_INC
839 ? GET_MODE_SIZE (amd->mem_mode)
840 : -GET_MODE_SIZE (amd->mem_mode)));
844 addr = XEXP (loc, 0);
845 gcc_assert (amd->mem_mode != VOIDmode && amd->mem_mode != BLKmode);
846 addr = simplify_replace_fn_rtx (addr, old_rtx, adjust_mems, data);
847 tem = gen_rtx_PLUS (GET_MODE (loc), XEXP (loc, 0),
848 GEN_INT ((GET_CODE (loc) == PRE_INC
849 || GET_CODE (loc) == POST_INC)
850 ? GET_MODE_SIZE (amd->mem_mode)
851 : -GET_MODE_SIZE (amd->mem_mode)));
852 amd->side_effects = alloc_EXPR_LIST (0,
853 gen_rtx_SET (VOIDmode,
859 addr = XEXP (loc, 1);
862 addr = XEXP (loc, 0);
863 gcc_assert (amd->mem_mode != VOIDmode);
864 addr = simplify_replace_fn_rtx (addr, old_rtx, adjust_mems, data);
865 amd->side_effects = alloc_EXPR_LIST (0,
866 gen_rtx_SET (VOIDmode,
872 /* First try without delegitimization of whole MEMs and
873 avoid_constant_pool_reference, which is more likely to succeed. */
874 store_save = amd->store;
876 addr = simplify_replace_fn_rtx (SUBREG_REG (loc), old_rtx, adjust_mems,
878 amd->store = store_save;
879 mem = simplify_replace_fn_rtx (addr, old_rtx, adjust_mems, data);
880 if (mem == SUBREG_REG (loc))
885 tem = simplify_gen_subreg (GET_MODE (loc), mem,
886 GET_MODE (SUBREG_REG (loc)),
890 tem = simplify_gen_subreg (GET_MODE (loc), addr,
891 GET_MODE (SUBREG_REG (loc)),
894 tem = gen_rtx_raw_SUBREG (GET_MODE (loc), addr, SUBREG_BYTE (loc));
896 if (MAY_HAVE_DEBUG_INSNS
897 && GET_CODE (tem) == SUBREG
898 && (GET_CODE (SUBREG_REG (tem)) == PLUS
899 || GET_CODE (SUBREG_REG (tem)) == MINUS
900 || GET_CODE (SUBREG_REG (tem)) == MULT
901 || GET_CODE (SUBREG_REG (tem)) == ASHIFT)
902 && GET_MODE_CLASS (GET_MODE (tem)) == MODE_INT
903 && GET_MODE_CLASS (GET_MODE (SUBREG_REG (tem))) == MODE_INT
904 && GET_MODE_SIZE (GET_MODE (tem))
905 < GET_MODE_SIZE (GET_MODE (SUBREG_REG (tem)))
906 && subreg_lowpart_p (tem)
907 && !for_each_rtx (&SUBREG_REG (tem), use_narrower_mode_test, tem))
908 return use_narrower_mode (SUBREG_REG (tem), GET_MODE (tem),
909 GET_MODE (SUBREG_REG (tem)));
917 /* Helper function for replacement of uses. */
920 adjust_mem_uses (rtx *x, void *data)
922 rtx new_x = simplify_replace_fn_rtx (*x, NULL_RTX, adjust_mems, data);
924 validate_change (NULL_RTX, x, new_x, true);
927 /* Helper function for replacement of stores. */
930 adjust_mem_stores (rtx loc, const_rtx expr, void *data)
934 rtx new_dest = simplify_replace_fn_rtx (SET_DEST (expr), NULL_RTX,
936 if (new_dest != SET_DEST (expr))
938 rtx xexpr = CONST_CAST_RTX (expr);
939 validate_change (NULL_RTX, &SET_DEST (xexpr), new_dest, true);
944 /* Simplify INSN. Remove all {PRE,POST}_{INC,DEC,MODIFY} rtxes,
945 replace them with their value in the insn and add the side-effects
946 as other sets to the insn. */
949 adjust_insn (basic_block bb, rtx insn)
951 struct adjust_mem_data amd;
953 amd.mem_mode = VOIDmode;
954 amd.stack_adjust = -VTI (bb)->out.stack_adjust;
955 amd.side_effects = NULL_RTX;
958 note_stores (PATTERN (insn), adjust_mem_stores, &amd);
961 note_uses (&PATTERN (insn), adjust_mem_uses, &amd);
963 /* For read-only MEMs containing some constant, prefer those
965 set = single_set (insn);
966 if (set && MEM_P (SET_SRC (set)) && MEM_READONLY_P (SET_SRC (set)))
968 rtx note = find_reg_equal_equiv_note (insn);
970 if (note && CONSTANT_P (XEXP (note, 0)))
971 validate_change (NULL_RTX, &SET_SRC (set), XEXP (note, 0), true);
974 if (amd.side_effects)
976 rtx *pat, new_pat, s;
979 pat = &PATTERN (insn);
980 if (GET_CODE (*pat) == COND_EXEC)
981 pat = &COND_EXEC_CODE (*pat);
982 if (GET_CODE (*pat) == PARALLEL)
983 oldn = XVECLEN (*pat, 0);
986 for (s = amd.side_effects, newn = 0; s; newn++)
988 new_pat = gen_rtx_PARALLEL (VOIDmode, rtvec_alloc (oldn + newn));
989 if (GET_CODE (*pat) == PARALLEL)
990 for (i = 0; i < oldn; i++)
991 XVECEXP (new_pat, 0, i) = XVECEXP (*pat, 0, i);
993 XVECEXP (new_pat, 0, 0) = *pat;
994 for (s = amd.side_effects, i = oldn; i < oldn + newn; i++, s = XEXP (s, 1))
995 XVECEXP (new_pat, 0, i) = XEXP (s, 0);
996 free_EXPR_LIST_list (&amd.side_effects);
997 validate_change (NULL_RTX, pat, new_pat, true);
1001 /* Return true if a decl_or_value DV is a DECL or NULL. */
1003 dv_is_decl_p (decl_or_value dv)
1005 return !dv || (int) TREE_CODE ((tree) dv) != (int) VALUE;
1008 /* Return true if a decl_or_value is a VALUE rtl. */
1010 dv_is_value_p (decl_or_value dv)
1012 return dv && !dv_is_decl_p (dv);
1015 /* Return the decl in the decl_or_value. */
1017 dv_as_decl (decl_or_value dv)
1019 #ifdef ENABLE_CHECKING
1020 gcc_assert (dv_is_decl_p (dv));
1025 /* Return the value in the decl_or_value. */
1027 dv_as_value (decl_or_value dv)
1029 #ifdef ENABLE_CHECKING
1030 gcc_assert (dv_is_value_p (dv));
1035 /* Return the opaque pointer in the decl_or_value. */
1036 static inline void *
1037 dv_as_opaque (decl_or_value dv)
1042 /* Return true if a decl_or_value must not have more than one variable
1045 dv_onepart_p (decl_or_value dv)
1049 if (!MAY_HAVE_DEBUG_INSNS)
1052 if (dv_is_value_p (dv))
1055 decl = dv_as_decl (dv);
1060 if (TREE_CODE (decl) == DEBUG_EXPR_DECL)
1063 return (target_for_debug_bind (decl) != NULL_TREE);
1066 /* Return the variable pool to be used for dv, depending on whether it
1067 can have multiple parts or not. */
1068 static inline alloc_pool
1069 dv_pool (decl_or_value dv)
1071 return dv_onepart_p (dv) ? valvar_pool : var_pool;
1074 /* Build a decl_or_value out of a decl. */
1075 static inline decl_or_value
1076 dv_from_decl (tree decl)
1080 #ifdef ENABLE_CHECKING
1081 gcc_assert (dv_is_decl_p (dv));
1086 /* Build a decl_or_value out of a value. */
1087 static inline decl_or_value
1088 dv_from_value (rtx value)
1092 #ifdef ENABLE_CHECKING
1093 gcc_assert (dv_is_value_p (dv));
1098 extern void debug_dv (decl_or_value dv);
1101 debug_dv (decl_or_value dv)
1103 if (dv_is_value_p (dv))
1104 debug_rtx (dv_as_value (dv));
1106 debug_generic_stmt (dv_as_decl (dv));
1109 typedef unsigned int dvuid;
1111 /* Return the uid of DV. */
1114 dv_uid (decl_or_value dv)
1116 if (dv_is_value_p (dv))
1117 return CSELIB_VAL_PTR (dv_as_value (dv))->uid;
1119 return DECL_UID (dv_as_decl (dv));
1122 /* Compute the hash from the uid. */
1124 static inline hashval_t
1125 dv_uid2hash (dvuid uid)
1130 /* The hash function for a mask table in a shared_htab chain. */
1132 static inline hashval_t
1133 dv_htab_hash (decl_or_value dv)
1135 return dv_uid2hash (dv_uid (dv));
1138 /* The hash function for variable_htab, computes the hash value
1139 from the declaration of variable X. */
1142 variable_htab_hash (const void *x)
1144 const_variable const v = (const_variable) x;
1146 return dv_htab_hash (v->dv);
1149 /* Compare the declaration of variable X with declaration Y. */
1152 variable_htab_eq (const void *x, const void *y)
1154 const_variable const v = (const_variable) x;
1155 decl_or_value dv = CONST_CAST2 (decl_or_value, const void *, y);
1157 return (dv_as_opaque (v->dv) == dv_as_opaque (dv));
1160 /* Free the element of VARIABLE_HTAB (its type is struct variable_def). */
1163 variable_htab_free (void *elem)
1166 variable var = (variable) elem;
1167 location_chain node, next;
1169 gcc_assert (var->refcount > 0);
1172 if (var->refcount > 0)
1175 for (i = 0; i < var->n_var_parts; i++)
1177 for (node = var->var_part[i].loc_chain; node; node = next)
1180 pool_free (loc_chain_pool, node);
1182 var->var_part[i].loc_chain = NULL;
1184 pool_free (dv_pool (var->dv), var);
1187 /* The hash function for value_chains htab, computes the hash value
1191 value_chain_htab_hash (const void *x)
1193 const_value_chain const v = (const_value_chain) x;
1195 return dv_htab_hash (v->dv);
1198 /* Compare the VALUE X with VALUE Y. */
1201 value_chain_htab_eq (const void *x, const void *y)
1203 const_value_chain const v = (const_value_chain) x;
1204 decl_or_value dv = CONST_CAST2 (decl_or_value, const void *, y);
1206 return dv_as_opaque (v->dv) == dv_as_opaque (dv);
1209 /* Initialize the set (array) SET of attrs to empty lists. */
1212 init_attrs_list_set (attrs *set)
1216 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1220 /* Make the list *LISTP empty. */
1223 attrs_list_clear (attrs *listp)
1227 for (list = *listp; list; list = next)
1230 pool_free (attrs_pool, list);
1235 /* Return true if the pair of DECL and OFFSET is the member of the LIST. */
1238 attrs_list_member (attrs list, decl_or_value dv, HOST_WIDE_INT offset)
1240 for (; list; list = list->next)
1241 if (dv_as_opaque (list->dv) == dv_as_opaque (dv) && list->offset == offset)
1246 /* Insert the triplet DECL, OFFSET, LOC to the list *LISTP. */
1249 attrs_list_insert (attrs *listp, decl_or_value dv,
1250 HOST_WIDE_INT offset, rtx loc)
1254 list = (attrs) pool_alloc (attrs_pool);
1257 list->offset = offset;
1258 list->next = *listp;
1262 /* Copy all nodes from SRC and create a list *DSTP of the copies. */
1265 attrs_list_copy (attrs *dstp, attrs src)
1269 attrs_list_clear (dstp);
1270 for (; src; src = src->next)
1272 n = (attrs) pool_alloc (attrs_pool);
1275 n->offset = src->offset;
1281 /* Add all nodes from SRC which are not in *DSTP to *DSTP. */
1284 attrs_list_union (attrs *dstp, attrs src)
1286 for (; src; src = src->next)
1288 if (!attrs_list_member (*dstp, src->dv, src->offset))
1289 attrs_list_insert (dstp, src->dv, src->offset, src->loc);
1293 /* Combine nodes that are not onepart nodes from SRC and SRC2 into
1297 attrs_list_mpdv_union (attrs *dstp, attrs src, attrs src2)
1299 gcc_assert (!*dstp);
1300 for (; src; src = src->next)
1302 if (!dv_onepart_p (src->dv))
1303 attrs_list_insert (dstp, src->dv, src->offset, src->loc);
1305 for (src = src2; src; src = src->next)
1307 if (!dv_onepart_p (src->dv)
1308 && !attrs_list_member (*dstp, src->dv, src->offset))
1309 attrs_list_insert (dstp, src->dv, src->offset, src->loc);
1313 /* Shared hashtable support. */
1315 /* Return true if VARS is shared. */
1318 shared_hash_shared (shared_hash vars)
1320 return vars->refcount > 1;
1323 /* Return the hash table for VARS. */
1325 static inline htab_t
1326 shared_hash_htab (shared_hash vars)
1331 /* Return true if VAR is shared, or maybe because VARS is shared. */
1334 shared_var_p (variable var, shared_hash vars)
1336 /* Don't count an entry in the changed_variables table as a duplicate. */
1337 return ((var->refcount > 1 + (int) var->in_changed_variables)
1338 || shared_hash_shared (vars));
1341 /* Copy variables into a new hash table. */
1344 shared_hash_unshare (shared_hash vars)
1346 shared_hash new_vars = (shared_hash) pool_alloc (shared_hash_pool);
1347 gcc_assert (vars->refcount > 1);
1348 new_vars->refcount = 1;
1350 = htab_create (htab_elements (vars->htab) + 3, variable_htab_hash,
1351 variable_htab_eq, variable_htab_free);
1352 vars_copy (new_vars->htab, vars->htab);
1357 /* Increment reference counter on VARS and return it. */
1359 static inline shared_hash
1360 shared_hash_copy (shared_hash vars)
1366 /* Decrement reference counter and destroy hash table if not shared
1370 shared_hash_destroy (shared_hash vars)
1372 gcc_assert (vars->refcount > 0);
1373 if (--vars->refcount == 0)
1375 htab_delete (vars->htab);
1376 pool_free (shared_hash_pool, vars);
1380 /* Unshare *PVARS if shared and return slot for DV. If INS is
1381 INSERT, insert it if not already present. */
1383 static inline void **
1384 shared_hash_find_slot_unshare_1 (shared_hash *pvars, decl_or_value dv,
1385 hashval_t dvhash, enum insert_option ins)
1387 if (shared_hash_shared (*pvars))
1388 *pvars = shared_hash_unshare (*pvars);
1389 return htab_find_slot_with_hash (shared_hash_htab (*pvars), dv, dvhash, ins);
1392 static inline void **
1393 shared_hash_find_slot_unshare (shared_hash *pvars, decl_or_value dv,
1394 enum insert_option ins)
1396 return shared_hash_find_slot_unshare_1 (pvars, dv, dv_htab_hash (dv), ins);
1399 /* Return slot for DV, if it is already present in the hash table.
1400 If it is not present, insert it only VARS is not shared, otherwise
1403 static inline void **
1404 shared_hash_find_slot_1 (shared_hash vars, decl_or_value dv, hashval_t dvhash)
1406 return htab_find_slot_with_hash (shared_hash_htab (vars), dv, dvhash,
1407 shared_hash_shared (vars)
1408 ? NO_INSERT : INSERT);
1411 static inline void **
1412 shared_hash_find_slot (shared_hash vars, decl_or_value dv)
1414 return shared_hash_find_slot_1 (vars, dv, dv_htab_hash (dv));
1417 /* Return slot for DV only if it is already present in the hash table. */
1419 static inline void **
1420 shared_hash_find_slot_noinsert_1 (shared_hash vars, decl_or_value dv,
1423 return htab_find_slot_with_hash (shared_hash_htab (vars), dv, dvhash,
1427 static inline void **
1428 shared_hash_find_slot_noinsert (shared_hash vars, decl_or_value dv)
1430 return shared_hash_find_slot_noinsert_1 (vars, dv, dv_htab_hash (dv));
1433 /* Return variable for DV or NULL if not already present in the hash
1436 static inline variable
1437 shared_hash_find_1 (shared_hash vars, decl_or_value dv, hashval_t dvhash)
1439 return (variable) htab_find_with_hash (shared_hash_htab (vars), dv, dvhash);
1442 static inline variable
1443 shared_hash_find (shared_hash vars, decl_or_value dv)
1445 return shared_hash_find_1 (vars, dv, dv_htab_hash (dv));
1448 /* Return true if TVAL is better than CVAL as a canonival value. We
1449 choose lowest-numbered VALUEs, using the RTX address as a
1450 tie-breaker. The idea is to arrange them into a star topology,
1451 such that all of them are at most one step away from the canonical
1452 value, and the canonical value has backlinks to all of them, in
1453 addition to all the actual locations. We don't enforce this
1454 topology throughout the entire dataflow analysis, though.
1458 canon_value_cmp (rtx tval, rtx cval)
1461 || CSELIB_VAL_PTR (tval)->uid < CSELIB_VAL_PTR (cval)->uid;
1464 static bool dst_can_be_shared;
1466 /* Return a copy of a variable VAR and insert it to dataflow set SET. */
1469 unshare_variable (dataflow_set *set, void **slot, variable var,
1470 enum var_init_status initialized)
1475 new_var = (variable) pool_alloc (dv_pool (var->dv));
1476 new_var->dv = var->dv;
1477 new_var->refcount = 1;
1479 new_var->n_var_parts = var->n_var_parts;
1480 new_var->cur_loc_changed = var->cur_loc_changed;
1481 var->cur_loc_changed = false;
1482 new_var->in_changed_variables = false;
1484 if (! flag_var_tracking_uninit)
1485 initialized = VAR_INIT_STATUS_INITIALIZED;
1487 for (i = 0; i < var->n_var_parts; i++)
1489 location_chain node;
1490 location_chain *nextp;
1492 new_var->var_part[i].offset = var->var_part[i].offset;
1493 nextp = &new_var->var_part[i].loc_chain;
1494 for (node = var->var_part[i].loc_chain; node; node = node->next)
1496 location_chain new_lc;
1498 new_lc = (location_chain) pool_alloc (loc_chain_pool);
1499 new_lc->next = NULL;
1500 if (node->init > initialized)
1501 new_lc->init = node->init;
1503 new_lc->init = initialized;
1504 if (node->set_src && !(MEM_P (node->set_src)))
1505 new_lc->set_src = node->set_src;
1507 new_lc->set_src = NULL;
1508 new_lc->loc = node->loc;
1511 nextp = &new_lc->next;
1514 new_var->var_part[i].cur_loc = var->var_part[i].cur_loc;
1517 dst_can_be_shared = false;
1518 if (shared_hash_shared (set->vars))
1519 slot = shared_hash_find_slot_unshare (&set->vars, var->dv, NO_INSERT);
1520 else if (set->traversed_vars && set->vars != set->traversed_vars)
1521 slot = shared_hash_find_slot_noinsert (set->vars, var->dv);
1523 if (var->in_changed_variables)
1526 = htab_find_slot_with_hash (changed_variables, var->dv,
1527 dv_htab_hash (var->dv), NO_INSERT);
1528 gcc_assert (*cslot == (void *) var);
1529 var->in_changed_variables = false;
1530 variable_htab_free (var);
1532 new_var->in_changed_variables = true;
1537 /* Copy all variables from hash table SRC to hash table DST. */
1540 vars_copy (htab_t dst, htab_t src)
1545 FOR_EACH_HTAB_ELEMENT (src, var, variable, hi)
1549 dstp = htab_find_slot_with_hash (dst, var->dv,
1550 dv_htab_hash (var->dv),
1556 /* Map a decl to its main debug decl. */
1559 var_debug_decl (tree decl)
1561 if (decl && DECL_P (decl)
1562 && DECL_DEBUG_EXPR_IS_FROM (decl))
1564 tree debugdecl = DECL_DEBUG_EXPR (decl);
1565 if (debugdecl && DECL_P (debugdecl))
1572 /* Set the register LOC to contain DV, OFFSET. */
1575 var_reg_decl_set (dataflow_set *set, rtx loc, enum var_init_status initialized,
1576 decl_or_value dv, HOST_WIDE_INT offset, rtx set_src,
1577 enum insert_option iopt)
1580 bool decl_p = dv_is_decl_p (dv);
1583 dv = dv_from_decl (var_debug_decl (dv_as_decl (dv)));
1585 for (node = set->regs[REGNO (loc)]; node; node = node->next)
1586 if (dv_as_opaque (node->dv) == dv_as_opaque (dv)
1587 && node->offset == offset)
1590 attrs_list_insert (&set->regs[REGNO (loc)], dv, offset, loc);
1591 set_variable_part (set, loc, dv, offset, initialized, set_src, iopt);
1594 /* Set the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). */
1597 var_reg_set (dataflow_set *set, rtx loc, enum var_init_status initialized,
1600 tree decl = REG_EXPR (loc);
1601 HOST_WIDE_INT offset = REG_OFFSET (loc);
1603 var_reg_decl_set (set, loc, initialized,
1604 dv_from_decl (decl), offset, set_src, INSERT);
1607 static enum var_init_status
1608 get_init_value (dataflow_set *set, rtx loc, decl_or_value dv)
1612 enum var_init_status ret_val = VAR_INIT_STATUS_UNKNOWN;
1614 if (! flag_var_tracking_uninit)
1615 return VAR_INIT_STATUS_INITIALIZED;
1617 var = shared_hash_find (set->vars, dv);
1620 for (i = 0; i < var->n_var_parts && ret_val == VAR_INIT_STATUS_UNKNOWN; i++)
1622 location_chain nextp;
1623 for (nextp = var->var_part[i].loc_chain; nextp; nextp = nextp->next)
1624 if (rtx_equal_p (nextp->loc, loc))
1626 ret_val = nextp->init;
1635 /* Delete current content of register LOC in dataflow set SET and set
1636 the register to contain REG_EXPR (LOC), REG_OFFSET (LOC). If
1637 MODIFY is true, any other live copies of the same variable part are
1638 also deleted from the dataflow set, otherwise the variable part is
1639 assumed to be copied from another location holding the same
1643 var_reg_delete_and_set (dataflow_set *set, rtx loc, bool modify,
1644 enum var_init_status initialized, rtx set_src)
1646 tree decl = REG_EXPR (loc);
1647 HOST_WIDE_INT offset = REG_OFFSET (loc);
1651 decl = var_debug_decl (decl);
1653 if (initialized == VAR_INIT_STATUS_UNKNOWN)
1654 initialized = get_init_value (set, loc, dv_from_decl (decl));
1656 nextp = &set->regs[REGNO (loc)];
1657 for (node = *nextp; node; node = next)
1660 if (dv_as_opaque (node->dv) != decl || node->offset != offset)
1662 delete_variable_part (set, node->loc, node->dv, node->offset);
1663 pool_free (attrs_pool, node);
1669 nextp = &node->next;
1673 clobber_variable_part (set, loc, dv_from_decl (decl), offset, set_src);
1674 var_reg_set (set, loc, initialized, set_src);
1677 /* Delete the association of register LOC in dataflow set SET with any
1678 variables that aren't onepart. If CLOBBER is true, also delete any
1679 other live copies of the same variable part, and delete the
1680 association with onepart dvs too. */
1683 var_reg_delete (dataflow_set *set, rtx loc, bool clobber)
1685 attrs *nextp = &set->regs[REGNO (loc)];
1690 tree decl = REG_EXPR (loc);
1691 HOST_WIDE_INT offset = REG_OFFSET (loc);
1693 decl = var_debug_decl (decl);
1695 clobber_variable_part (set, NULL, dv_from_decl (decl), offset, NULL);
1698 for (node = *nextp; node; node = next)
1701 if (clobber || !dv_onepart_p (node->dv))
1703 delete_variable_part (set, node->loc, node->dv, node->offset);
1704 pool_free (attrs_pool, node);
1708 nextp = &node->next;
1712 /* Delete content of register with number REGNO in dataflow set SET. */
1715 var_regno_delete (dataflow_set *set, int regno)
1717 attrs *reg = &set->regs[regno];
1720 for (node = *reg; node; node = next)
1723 delete_variable_part (set, node->loc, node->dv, node->offset);
1724 pool_free (attrs_pool, node);
1729 /* Set the location of DV, OFFSET as the MEM LOC. */
1732 var_mem_decl_set (dataflow_set *set, rtx loc, enum var_init_status initialized,
1733 decl_or_value dv, HOST_WIDE_INT offset, rtx set_src,
1734 enum insert_option iopt)
1736 if (dv_is_decl_p (dv))
1737 dv = dv_from_decl (var_debug_decl (dv_as_decl (dv)));
1739 set_variable_part (set, loc, dv, offset, initialized, set_src, iopt);
1742 /* Set the location part of variable MEM_EXPR (LOC) in dataflow set
1744 Adjust the address first if it is stack pointer based. */
1747 var_mem_set (dataflow_set *set, rtx loc, enum var_init_status initialized,
1750 tree decl = MEM_EXPR (loc);
1751 HOST_WIDE_INT offset = INT_MEM_OFFSET (loc);
1753 var_mem_decl_set (set, loc, initialized,
1754 dv_from_decl (decl), offset, set_src, INSERT);
1757 /* Delete and set the location part of variable MEM_EXPR (LOC) in
1758 dataflow set SET to LOC. If MODIFY is true, any other live copies
1759 of the same variable part are also deleted from the dataflow set,
1760 otherwise the variable part is assumed to be copied from another
1761 location holding the same part.
1762 Adjust the address first if it is stack pointer based. */
1765 var_mem_delete_and_set (dataflow_set *set, rtx loc, bool modify,
1766 enum var_init_status initialized, rtx set_src)
1768 tree decl = MEM_EXPR (loc);
1769 HOST_WIDE_INT offset = INT_MEM_OFFSET (loc);
1771 decl = var_debug_decl (decl);
1773 if (initialized == VAR_INIT_STATUS_UNKNOWN)
1774 initialized = get_init_value (set, loc, dv_from_decl (decl));
1777 clobber_variable_part (set, NULL, dv_from_decl (decl), offset, set_src);
1778 var_mem_set (set, loc, initialized, set_src);
1781 /* Delete the location part LOC from dataflow set SET. If CLOBBER is
1782 true, also delete any other live copies of the same variable part.
1783 Adjust the address first if it is stack pointer based. */
1786 var_mem_delete (dataflow_set *set, rtx loc, bool clobber)
1788 tree decl = MEM_EXPR (loc);
1789 HOST_WIDE_INT offset = INT_MEM_OFFSET (loc);
1791 decl = var_debug_decl (decl);
1793 clobber_variable_part (set, NULL, dv_from_decl (decl), offset, NULL);
1794 delete_variable_part (set, loc, dv_from_decl (decl), offset);
1797 /* Bind a value to a location it was just stored in. If MODIFIED
1798 holds, assume the location was modified, detaching it from any
1799 values bound to it. */
1802 val_store (dataflow_set *set, rtx val, rtx loc, rtx insn, bool modified)
1804 cselib_val *v = CSELIB_VAL_PTR (val);
1806 gcc_assert (cselib_preserved_value_p (v));
1810 fprintf (dump_file, "%i: ", INSN_UID (insn));
1811 print_inline_rtx (dump_file, val, 0);
1812 fprintf (dump_file, " stored in ");
1813 print_inline_rtx (dump_file, loc, 0);
1816 struct elt_loc_list *l;
1817 for (l = v->locs; l; l = l->next)
1819 fprintf (dump_file, "\n%i: ", INSN_UID (l->setting_insn));
1820 print_inline_rtx (dump_file, l->loc, 0);
1823 fprintf (dump_file, "\n");
1829 var_regno_delete (set, REGNO (loc));
1830 var_reg_decl_set (set, loc, VAR_INIT_STATUS_INITIALIZED,
1831 dv_from_value (val), 0, NULL_RTX, INSERT);
1833 else if (MEM_P (loc))
1834 var_mem_decl_set (set, loc, VAR_INIT_STATUS_INITIALIZED,
1835 dv_from_value (val), 0, NULL_RTX, INSERT);
1837 set_variable_part (set, loc, dv_from_value (val), 0,
1838 VAR_INIT_STATUS_INITIALIZED, NULL_RTX, INSERT);
1841 /* Reset this node, detaching all its equivalences. Return the slot
1842 in the variable hash table that holds dv, if there is one. */
1845 val_reset (dataflow_set *set, decl_or_value dv)
1847 variable var = shared_hash_find (set->vars, dv) ;
1848 location_chain node;
1851 if (!var || !var->n_var_parts)
1854 gcc_assert (var->n_var_parts == 1);
1857 for (node = var->var_part[0].loc_chain; node; node = node->next)
1858 if (GET_CODE (node->loc) == VALUE
1859 && canon_value_cmp (node->loc, cval))
1862 for (node = var->var_part[0].loc_chain; node; node = node->next)
1863 if (GET_CODE (node->loc) == VALUE && cval != node->loc)
1865 /* Redirect the equivalence link to the new canonical
1866 value, or simply remove it if it would point at
1869 set_variable_part (set, cval, dv_from_value (node->loc),
1870 0, node->init, node->set_src, NO_INSERT);
1871 delete_variable_part (set, dv_as_value (dv),
1872 dv_from_value (node->loc), 0);
1877 decl_or_value cdv = dv_from_value (cval);
1879 /* Keep the remaining values connected, accummulating links
1880 in the canonical value. */
1881 for (node = var->var_part[0].loc_chain; node; node = node->next)
1883 if (node->loc == cval)
1885 else if (GET_CODE (node->loc) == REG)
1886 var_reg_decl_set (set, node->loc, node->init, cdv, 0,
1887 node->set_src, NO_INSERT);
1888 else if (GET_CODE (node->loc) == MEM)
1889 var_mem_decl_set (set, node->loc, node->init, cdv, 0,
1890 node->set_src, NO_INSERT);
1892 set_variable_part (set, node->loc, cdv, 0,
1893 node->init, node->set_src, NO_INSERT);
1897 /* We remove this last, to make sure that the canonical value is not
1898 removed to the point of requiring reinsertion. */
1900 delete_variable_part (set, dv_as_value (dv), dv_from_value (cval), 0);
1902 clobber_variable_part (set, NULL, dv, 0, NULL);
1904 /* ??? Should we make sure there aren't other available values or
1905 variables whose values involve this one other than by
1906 equivalence? E.g., at the very least we should reset MEMs, those
1907 shouldn't be too hard to find cselib-looking up the value as an
1908 address, then locating the resulting value in our own hash
1912 /* Find the values in a given location and map the val to another
1913 value, if it is unique, or add the location as one holding the
1917 val_resolve (dataflow_set *set, rtx val, rtx loc, rtx insn)
1919 decl_or_value dv = dv_from_value (val);
1921 if (dump_file && (dump_flags & TDF_DETAILS))
1924 fprintf (dump_file, "%i: ", INSN_UID (insn));
1926 fprintf (dump_file, "head: ");
1927 print_inline_rtx (dump_file, val, 0);
1928 fputs (" is at ", dump_file);
1929 print_inline_rtx (dump_file, loc, 0);
1930 fputc ('\n', dump_file);
1933 val_reset (set, dv);
1937 attrs node, found = NULL;
1939 for (node = set->regs[REGNO (loc)]; node; node = node->next)
1940 if (dv_is_value_p (node->dv)
1941 && GET_MODE (dv_as_value (node->dv)) == GET_MODE (loc))
1945 /* Map incoming equivalences. ??? Wouldn't it be nice if
1946 we just started sharing the location lists? Maybe a
1947 circular list ending at the value itself or some
1949 set_variable_part (set, dv_as_value (node->dv),
1950 dv_from_value (val), node->offset,
1951 VAR_INIT_STATUS_INITIALIZED, NULL_RTX, INSERT);
1952 set_variable_part (set, val, node->dv, node->offset,
1953 VAR_INIT_STATUS_INITIALIZED, NULL_RTX, INSERT);
1956 /* If we didn't find any equivalence, we need to remember that
1957 this value is held in the named register. */
1959 var_reg_decl_set (set, loc, VAR_INIT_STATUS_INITIALIZED,
1960 dv_from_value (val), 0, NULL_RTX, INSERT);
1962 else if (MEM_P (loc))
1963 /* ??? Merge equivalent MEMs. */
1964 var_mem_decl_set (set, loc, VAR_INIT_STATUS_INITIALIZED,
1965 dv_from_value (val), 0, NULL_RTX, INSERT);
1967 /* ??? Merge equivalent expressions. */
1968 set_variable_part (set, loc, dv_from_value (val), 0,
1969 VAR_INIT_STATUS_INITIALIZED, NULL_RTX, INSERT);
1972 /* Initialize dataflow set SET to be empty.
1973 VARS_SIZE is the initial size of hash table VARS. */
1976 dataflow_set_init (dataflow_set *set)
1978 init_attrs_list_set (set->regs);
1979 set->vars = shared_hash_copy (empty_shared_hash);
1980 set->stack_adjust = 0;
1981 set->traversed_vars = NULL;
1984 /* Delete the contents of dataflow set SET. */
1987 dataflow_set_clear (dataflow_set *set)
1991 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
1992 attrs_list_clear (&set->regs[i]);
1994 shared_hash_destroy (set->vars);
1995 set->vars = shared_hash_copy (empty_shared_hash);
1998 /* Copy the contents of dataflow set SRC to DST. */
2001 dataflow_set_copy (dataflow_set *dst, dataflow_set *src)
2005 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
2006 attrs_list_copy (&dst->regs[i], src->regs[i]);
2008 shared_hash_destroy (dst->vars);
2009 dst->vars = shared_hash_copy (src->vars);
2010 dst->stack_adjust = src->stack_adjust;
2013 /* Information for merging lists of locations for a given offset of variable.
2015 struct variable_union_info
2017 /* Node of the location chain. */
2020 /* The sum of positions in the input chains. */
2023 /* The position in the chain of DST dataflow set. */
2027 /* Buffer for location list sorting and its allocated size. */
2028 static struct variable_union_info *vui_vec;
2029 static int vui_allocated;
2031 /* Compare function for qsort, order the structures by POS element. */
2034 variable_union_info_cmp_pos (const void *n1, const void *n2)
2036 const struct variable_union_info *const i1 =
2037 (const struct variable_union_info *) n1;
2038 const struct variable_union_info *const i2 =
2039 ( const struct variable_union_info *) n2;
2041 if (i1->pos != i2->pos)
2042 return i1->pos - i2->pos;
2044 return (i1->pos_dst - i2->pos_dst);
2047 /* Compute union of location parts of variable *SLOT and the same variable
2048 from hash table DATA. Compute "sorted" union of the location chains
2049 for common offsets, i.e. the locations of a variable part are sorted by
2050 a priority where the priority is the sum of the positions in the 2 chains
2051 (if a location is only in one list the position in the second list is
2052 defined to be larger than the length of the chains).
2053 When we are updating the location parts the newest location is in the
2054 beginning of the chain, so when we do the described "sorted" union
2055 we keep the newest locations in the beginning. */
2058 variable_union (variable src, dataflow_set *set)
2064 dstp = shared_hash_find_slot (set->vars, src->dv);
2065 if (!dstp || !*dstp)
2069 dst_can_be_shared = false;
2071 dstp = shared_hash_find_slot_unshare (&set->vars, src->dv, INSERT);
2075 /* Continue traversing the hash table. */
2079 dst = (variable) *dstp;
2081 gcc_assert (src->n_var_parts);
2083 /* We can combine one-part variables very efficiently, because their
2084 entries are in canonical order. */
2085 if (dv_onepart_p (src->dv))
2087 location_chain *nodep, dnode, snode;
2089 gcc_assert (src->n_var_parts == 1
2090 && dst->n_var_parts == 1);
2092 snode = src->var_part[0].loc_chain;
2095 restart_onepart_unshared:
2096 nodep = &dst->var_part[0].loc_chain;
2102 int r = dnode ? loc_cmp (dnode->loc, snode->loc) : 1;
2106 location_chain nnode;
2108 if (shared_var_p (dst, set->vars))
2110 dstp = unshare_variable (set, dstp, dst,
2111 VAR_INIT_STATUS_INITIALIZED);
2112 dst = (variable)*dstp;
2113 goto restart_onepart_unshared;
2116 *nodep = nnode = (location_chain) pool_alloc (loc_chain_pool);
2117 nnode->loc = snode->loc;
2118 nnode->init = snode->init;
2119 if (!snode->set_src || MEM_P (snode->set_src))
2120 nnode->set_src = NULL;
2122 nnode->set_src = snode->set_src;
2123 nnode->next = dnode;
2126 #ifdef ENABLE_CHECKING
2128 gcc_assert (rtx_equal_p (dnode->loc, snode->loc));
2132 snode = snode->next;
2134 nodep = &dnode->next;
2141 /* Count the number of location parts, result is K. */
2142 for (i = 0, j = 0, k = 0;
2143 i < src->n_var_parts && j < dst->n_var_parts; k++)
2145 if (src->var_part[i].offset == dst->var_part[j].offset)
2150 else if (src->var_part[i].offset < dst->var_part[j].offset)
2155 k += src->n_var_parts - i;
2156 k += dst->n_var_parts - j;
2158 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
2159 thus there are at most MAX_VAR_PARTS different offsets. */
2160 gcc_assert (dv_onepart_p (dst->dv) ? k == 1 : k <= MAX_VAR_PARTS);
2162 if (dst->n_var_parts != k && shared_var_p (dst, set->vars))
2164 dstp = unshare_variable (set, dstp, dst, VAR_INIT_STATUS_UNKNOWN);
2165 dst = (variable)*dstp;
2168 i = src->n_var_parts - 1;
2169 j = dst->n_var_parts - 1;
2170 dst->n_var_parts = k;
2172 for (k--; k >= 0; k--)
2174 location_chain node, node2;
2176 if (i >= 0 && j >= 0
2177 && src->var_part[i].offset == dst->var_part[j].offset)
2179 /* Compute the "sorted" union of the chains, i.e. the locations which
2180 are in both chains go first, they are sorted by the sum of
2181 positions in the chains. */
2184 struct variable_union_info *vui;
2186 /* If DST is shared compare the location chains.
2187 If they are different we will modify the chain in DST with
2188 high probability so make a copy of DST. */
2189 if (shared_var_p (dst, set->vars))
2191 for (node = src->var_part[i].loc_chain,
2192 node2 = dst->var_part[j].loc_chain; node && node2;
2193 node = node->next, node2 = node2->next)
2195 if (!((REG_P (node2->loc)
2196 && REG_P (node->loc)
2197 && REGNO (node2->loc) == REGNO (node->loc))
2198 || rtx_equal_p (node2->loc, node->loc)))
2200 if (node2->init < node->init)
2201 node2->init = node->init;
2207 dstp = unshare_variable (set, dstp, dst,
2208 VAR_INIT_STATUS_UNKNOWN);
2209 dst = (variable)*dstp;
2214 for (node = src->var_part[i].loc_chain; node; node = node->next)
2217 for (node = dst->var_part[j].loc_chain; node; node = node->next)
2222 /* The most common case, much simpler, no qsort is needed. */
2223 location_chain dstnode = dst->var_part[j].loc_chain;
2224 dst->var_part[k].loc_chain = dstnode;
2225 dst->var_part[k].offset = dst->var_part[j].offset;
2227 for (node = src->var_part[i].loc_chain; node; node = node->next)
2228 if (!((REG_P (dstnode->loc)
2229 && REG_P (node->loc)
2230 && REGNO (dstnode->loc) == REGNO (node->loc))
2231 || rtx_equal_p (dstnode->loc, node->loc)))
2233 location_chain new_node;
2235 /* Copy the location from SRC. */
2236 new_node = (location_chain) pool_alloc (loc_chain_pool);
2237 new_node->loc = node->loc;
2238 new_node->init = node->init;
2239 if (!node->set_src || MEM_P (node->set_src))
2240 new_node->set_src = NULL;
2242 new_node->set_src = node->set_src;
2243 node2->next = new_node;
2250 if (src_l + dst_l > vui_allocated)
2252 vui_allocated = MAX (vui_allocated * 2, src_l + dst_l);
2253 vui_vec = XRESIZEVEC (struct variable_union_info, vui_vec,
2258 /* Fill in the locations from DST. */
2259 for (node = dst->var_part[j].loc_chain, jj = 0; node;
2260 node = node->next, jj++)
2263 vui[jj].pos_dst = jj;
2265 /* Pos plus value larger than a sum of 2 valid positions. */
2266 vui[jj].pos = jj + src_l + dst_l;
2269 /* Fill in the locations from SRC. */
2271 for (node = src->var_part[i].loc_chain, ii = 0; node;
2272 node = node->next, ii++)
2274 /* Find location from NODE. */
2275 for (jj = 0; jj < dst_l; jj++)
2277 if ((REG_P (vui[jj].lc->loc)
2278 && REG_P (node->loc)
2279 && REGNO (vui[jj].lc->loc) == REGNO (node->loc))
2280 || rtx_equal_p (vui[jj].lc->loc, node->loc))
2282 vui[jj].pos = jj + ii;
2286 if (jj >= dst_l) /* The location has not been found. */
2288 location_chain new_node;
2290 /* Copy the location from SRC. */
2291 new_node = (location_chain) pool_alloc (loc_chain_pool);
2292 new_node->loc = node->loc;
2293 new_node->init = node->init;
2294 if (!node->set_src || MEM_P (node->set_src))
2295 new_node->set_src = NULL;
2297 new_node->set_src = node->set_src;
2298 vui[n].lc = new_node;
2299 vui[n].pos_dst = src_l + dst_l;
2300 vui[n].pos = ii + src_l + dst_l;
2307 /* Special case still very common case. For dst_l == 2
2308 all entries dst_l ... n-1 are sorted, with for i >= dst_l
2309 vui[i].pos == i + src_l + dst_l. */
2310 if (vui[0].pos > vui[1].pos)
2312 /* Order should be 1, 0, 2... */
2313 dst->var_part[k].loc_chain = vui[1].lc;
2314 vui[1].lc->next = vui[0].lc;
2317 vui[0].lc->next = vui[2].lc;
2318 vui[n - 1].lc->next = NULL;
2321 vui[0].lc->next = NULL;
2326 dst->var_part[k].loc_chain = vui[0].lc;
2327 if (n >= 3 && vui[2].pos < vui[1].pos)
2329 /* Order should be 0, 2, 1, 3... */
2330 vui[0].lc->next = vui[2].lc;
2331 vui[2].lc->next = vui[1].lc;
2334 vui[1].lc->next = vui[3].lc;
2335 vui[n - 1].lc->next = NULL;
2338 vui[1].lc->next = NULL;
2343 /* Order should be 0, 1, 2... */
2345 vui[n - 1].lc->next = NULL;
2348 for (; ii < n; ii++)
2349 vui[ii - 1].lc->next = vui[ii].lc;
2353 qsort (vui, n, sizeof (struct variable_union_info),
2354 variable_union_info_cmp_pos);
2356 /* Reconnect the nodes in sorted order. */
2357 for (ii = 1; ii < n; ii++)
2358 vui[ii - 1].lc->next = vui[ii].lc;
2359 vui[n - 1].lc->next = NULL;
2360 dst->var_part[k].loc_chain = vui[0].lc;
2363 dst->var_part[k].offset = dst->var_part[j].offset;
2368 else if ((i >= 0 && j >= 0
2369 && src->var_part[i].offset < dst->var_part[j].offset)
2372 dst->var_part[k] = dst->var_part[j];
2375 else if ((i >= 0 && j >= 0
2376 && src->var_part[i].offset > dst->var_part[j].offset)
2379 location_chain *nextp;
2381 /* Copy the chain from SRC. */
2382 nextp = &dst->var_part[k].loc_chain;
2383 for (node = src->var_part[i].loc_chain; node; node = node->next)
2385 location_chain new_lc;
2387 new_lc = (location_chain) pool_alloc (loc_chain_pool);
2388 new_lc->next = NULL;
2389 new_lc->init = node->init;
2390 if (!node->set_src || MEM_P (node->set_src))
2391 new_lc->set_src = NULL;
2393 new_lc->set_src = node->set_src;
2394 new_lc->loc = node->loc;
2397 nextp = &new_lc->next;
2400 dst->var_part[k].offset = src->var_part[i].offset;
2403 dst->var_part[k].cur_loc = NULL;
2406 if (flag_var_tracking_uninit)
2407 for (i = 0; i < src->n_var_parts && i < dst->n_var_parts; i++)
2409 location_chain node, node2;
2410 for (node = src->var_part[i].loc_chain; node; node = node->next)
2411 for (node2 = dst->var_part[i].loc_chain; node2; node2 = node2->next)
2412 if (rtx_equal_p (node->loc, node2->loc))
2414 if (node->init > node2->init)
2415 node2->init = node->init;
2419 /* Continue traversing the hash table. */
2423 /* Compute union of dataflow sets SRC and DST and store it to DST. */
2426 dataflow_set_union (dataflow_set *dst, dataflow_set *src)
2430 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
2431 attrs_list_union (&dst->regs[i], src->regs[i]);
2433 if (dst->vars == empty_shared_hash)
2435 shared_hash_destroy (dst->vars);
2436 dst->vars = shared_hash_copy (src->vars);
2443 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (src->vars), var, variable, hi)
2444 variable_union (var, dst);
2448 /* Whether the value is currently being expanded. */
2449 #define VALUE_RECURSED_INTO(x) \
2450 (RTL_FLAG_CHECK2 ("VALUE_RECURSED_INTO", (x), VALUE, DEBUG_EXPR)->used)
2451 /* Whether the value is in changed_variables hash table. */
2452 #define VALUE_CHANGED(x) \
2453 (RTL_FLAG_CHECK1 ("VALUE_CHANGED", (x), VALUE)->frame_related)
2454 /* Whether the decl is in changed_variables hash table. */
2455 #define DECL_CHANGED(x) TREE_VISITED (x)
2457 /* Record that DV has been added into resp. removed from changed_variables
2461 set_dv_changed (decl_or_value dv, bool newv)
2463 if (dv_is_value_p (dv))
2464 VALUE_CHANGED (dv_as_value (dv)) = newv;
2466 DECL_CHANGED (dv_as_decl (dv)) = newv;
2469 /* Return true if DV is present in changed_variables hash table. */
2472 dv_changed_p (decl_or_value dv)
2474 return (dv_is_value_p (dv)
2475 ? VALUE_CHANGED (dv_as_value (dv))
2476 : DECL_CHANGED (dv_as_decl (dv)));
2479 /* Return a location list node whose loc is rtx_equal to LOC, in the
2480 location list of a one-part variable or value VAR, or in that of
2481 any values recursively mentioned in the location lists. */
2483 static location_chain
2484 find_loc_in_1pdv (rtx loc, variable var, htab_t vars)
2486 location_chain node;
2491 gcc_assert (dv_onepart_p (var->dv));
2493 if (!var->n_var_parts)
2496 gcc_assert (var->var_part[0].offset == 0);
2498 for (node = var->var_part[0].loc_chain; node; node = node->next)
2499 if (rtx_equal_p (loc, node->loc))
2501 else if (GET_CODE (node->loc) == VALUE
2502 && !VALUE_RECURSED_INTO (node->loc))
2504 decl_or_value dv = dv_from_value (node->loc);
2505 variable var = (variable)
2506 htab_find_with_hash (vars, dv, dv_htab_hash (dv));
2510 location_chain where;
2511 VALUE_RECURSED_INTO (node->loc) = true;
2512 if ((where = find_loc_in_1pdv (loc, var, vars)))
2514 VALUE_RECURSED_INTO (node->loc) = false;
2517 VALUE_RECURSED_INTO (node->loc) = false;
2524 /* Hash table iteration argument passed to variable_merge. */
2527 /* The set in which the merge is to be inserted. */
2529 /* The set that we're iterating in. */
2531 /* The set that may contain the other dv we are to merge with. */
2533 /* Number of onepart dvs in src. */
2534 int src_onepart_cnt;
2537 /* Insert LOC in *DNODE, if it's not there yet. The list must be in
2538 loc_cmp order, and it is maintained as such. */
2541 insert_into_intersection (location_chain *nodep, rtx loc,
2542 enum var_init_status status)
2544 location_chain node;
2547 for (node = *nodep; node; nodep = &node->next, node = *nodep)
2548 if ((r = loc_cmp (node->loc, loc)) == 0)
2550 node->init = MIN (node->init, status);
2556 node = (location_chain) pool_alloc (loc_chain_pool);
2559 node->set_src = NULL;
2560 node->init = status;
2561 node->next = *nodep;
2565 /* Insert in DEST the intersection the locations present in both
2566 S1NODE and S2VAR, directly or indirectly. S1NODE is from a
2567 variable in DSM->cur, whereas S2VAR is from DSM->src. dvar is in
2571 intersect_loc_chains (rtx val, location_chain *dest, struct dfset_merge *dsm,
2572 location_chain s1node, variable s2var)
2574 dataflow_set *s1set = dsm->cur;
2575 dataflow_set *s2set = dsm->src;
2576 location_chain found;
2578 for (; s1node; s1node = s1node->next)
2580 if (s1node->loc == val)
2583 if ((found = find_loc_in_1pdv (s1node->loc, s2var,
2584 shared_hash_htab (s2set->vars))))
2586 insert_into_intersection (dest, s1node->loc,
2587 MIN (s1node->init, found->init));
2591 if (GET_CODE (s1node->loc) == VALUE
2592 && !VALUE_RECURSED_INTO (s1node->loc))
2594 decl_or_value dv = dv_from_value (s1node->loc);
2595 variable svar = shared_hash_find (s1set->vars, dv);
2598 if (svar->n_var_parts == 1)
2600 VALUE_RECURSED_INTO (s1node->loc) = true;
2601 intersect_loc_chains (val, dest, dsm,
2602 svar->var_part[0].loc_chain,
2604 VALUE_RECURSED_INTO (s1node->loc) = false;
2609 /* ??? if the location is equivalent to any location in src,
2610 searched recursively
2612 add to dst the values needed to represent the equivalence
2614 telling whether locations S is equivalent to another dv's
2617 for each location D in the list
2619 if S and D satisfy rtx_equal_p, then it is present
2621 else if D is a value, recurse without cycles
2623 else if S and D have the same CODE and MODE
2625 for each operand oS and the corresponding oD
2627 if oS and oD are not equivalent, then S an D are not equivalent
2629 else if they are RTX vectors
2631 if any vector oS element is not equivalent to its respective oD,
2632 then S and D are not equivalent
2640 /* Return -1 if X should be before Y in a location list for a 1-part
2641 variable, 1 if Y should be before X, and 0 if they're equivalent
2642 and should not appear in the list. */
2645 loc_cmp (rtx x, rtx y)
2648 RTX_CODE code = GET_CODE (x);
2658 gcc_assert (GET_MODE (x) == GET_MODE (y));
2659 if (REGNO (x) == REGNO (y))
2661 else if (REGNO (x) < REGNO (y))
2674 gcc_assert (GET_MODE (x) == GET_MODE (y));
2675 return loc_cmp (XEXP (x, 0), XEXP (y, 0));
2681 if (GET_CODE (x) == VALUE)
2683 if (GET_CODE (y) != VALUE)
2685 /* Don't assert the modes are the same, that is true only
2686 when not recursing. (subreg:QI (value:SI 1:1) 0)
2687 and (subreg:QI (value:DI 2:2) 0) can be compared,
2688 even when the modes are different. */
2689 if (canon_value_cmp (x, y))
2695 if (GET_CODE (y) == VALUE)
2698 if (GET_CODE (x) == GET_CODE (y))
2699 /* Compare operands below. */;
2700 else if (GET_CODE (x) < GET_CODE (y))
2705 gcc_assert (GET_MODE (x) == GET_MODE (y));
2707 if (GET_CODE (x) == DEBUG_EXPR)
2709 if (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x))
2710 < DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y)))
2712 #ifdef ENABLE_CHECKING
2713 gcc_assert (DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (x))
2714 > DEBUG_TEMP_UID (DEBUG_EXPR_TREE_DECL (y)));
2719 fmt = GET_RTX_FORMAT (code);
2720 for (i = 0; i < GET_RTX_LENGTH (code); i++)
2724 if (XWINT (x, i) == XWINT (y, i))
2726 else if (XWINT (x, i) < XWINT (y, i))
2733 if (XINT (x, i) == XINT (y, i))
2735 else if (XINT (x, i) < XINT (y, i))
2742 /* Compare the vector length first. */
2743 if (XVECLEN (x, i) == XVECLEN (y, i))
2744 /* Compare the vectors elements. */;
2745 else if (XVECLEN (x, i) < XVECLEN (y, i))
2750 for (j = 0; j < XVECLEN (x, i); j++)
2751 if ((r = loc_cmp (XVECEXP (x, i, j),
2752 XVECEXP (y, i, j))))
2757 if ((r = loc_cmp (XEXP (x, i), XEXP (y, i))))
2763 if (XSTR (x, i) == XSTR (y, i))
2769 if ((r = strcmp (XSTR (x, i), XSTR (y, i))) == 0)
2777 /* These are just backpointers, so they don't matter. */
2784 /* It is believed that rtx's at this level will never
2785 contain anything but integers and other rtx's,
2786 except for within LABEL_REFs and SYMBOL_REFs. */
2794 /* If decl or value DVP refers to VALUE from *LOC, add backlinks
2795 from VALUE to DVP. */
2798 add_value_chain (rtx *loc, void *dvp)
2800 decl_or_value dv, ldv;
2801 value_chain vc, nvc;
2804 if (GET_CODE (*loc) == VALUE)
2805 ldv = dv_from_value (*loc);
2806 else if (GET_CODE (*loc) == DEBUG_EXPR)
2807 ldv = dv_from_decl (DEBUG_EXPR_TREE_DECL (*loc));
2811 if (dv_as_opaque (ldv) == dvp)
2814 dv = (decl_or_value) dvp;
2815 slot = htab_find_slot_with_hash (value_chains, ldv, dv_htab_hash (ldv),
2819 vc = (value_chain) pool_alloc (value_chain_pool);
2823 *slot = (void *) vc;
2827 for (vc = ((value_chain) *slot)->next; vc; vc = vc->next)
2828 if (dv_as_opaque (vc->dv) == dv_as_opaque (dv))
2836 vc = (value_chain) *slot;
2837 nvc = (value_chain) pool_alloc (value_chain_pool);
2839 nvc->next = vc->next;
2845 /* If decl or value DVP refers to VALUEs from within LOC, add backlinks
2846 from those VALUEs to DVP. */
2849 add_value_chains (decl_or_value dv, rtx loc)
2851 if (GET_CODE (loc) == VALUE || GET_CODE (loc) == DEBUG_EXPR)
2853 add_value_chain (&loc, dv_as_opaque (dv));
2859 loc = XEXP (loc, 0);
2860 for_each_rtx (&loc, add_value_chain, dv_as_opaque (dv));
2863 /* If CSELIB_VAL_PTR of value DV refer to VALUEs, add backlinks from those
2864 VALUEs to DV. Add the same time get rid of ASM_OPERANDS from locs list,
2865 that is something we never can express in .debug_info and can prevent
2866 reverse ops from being used. */
2869 add_cselib_value_chains (decl_or_value dv)
2871 struct elt_loc_list **l;
2873 for (l = &CSELIB_VAL_PTR (dv_as_value (dv))->locs; *l;)
2874 if (GET_CODE ((*l)->loc) == ASM_OPERANDS)
2878 for_each_rtx (&(*l)->loc, add_value_chain, dv_as_opaque (dv));
2883 /* If decl or value DVP refers to VALUE from *LOC, remove backlinks
2884 from VALUE to DVP. */
2887 remove_value_chain (rtx *loc, void *dvp)
2889 decl_or_value dv, ldv;
2893 if (GET_CODE (*loc) == VALUE)
2894 ldv = dv_from_value (*loc);
2895 else if (GET_CODE (*loc) == DEBUG_EXPR)
2896 ldv = dv_from_decl (DEBUG_EXPR_TREE_DECL (*loc));
2900 if (dv_as_opaque (ldv) == dvp)
2903 dv = (decl_or_value) dvp;
2904 slot = htab_find_slot_with_hash (value_chains, ldv, dv_htab_hash (ldv),
2906 for (vc = (value_chain) *slot; vc->next; vc = vc->next)
2907 if (dv_as_opaque (vc->next->dv) == dv_as_opaque (dv))
2909 value_chain dvc = vc->next;
2910 gcc_assert (dvc->refcount > 0);
2911 if (--dvc->refcount == 0)
2913 vc->next = dvc->next;
2914 pool_free (value_chain_pool, dvc);
2915 if (vc->next == NULL && vc == (value_chain) *slot)
2917 pool_free (value_chain_pool, vc);
2918 htab_clear_slot (value_chains, slot);
2926 /* If decl or value DVP refers to VALUEs from within LOC, remove backlinks
2927 from those VALUEs to DVP. */
2930 remove_value_chains (decl_or_value dv, rtx loc)
2932 if (GET_CODE (loc) == VALUE || GET_CODE (loc) == DEBUG_EXPR)
2934 remove_value_chain (&loc, dv_as_opaque (dv));
2940 loc = XEXP (loc, 0);
2941 for_each_rtx (&loc, remove_value_chain, dv_as_opaque (dv));
2945 /* If CSELIB_VAL_PTR of value DV refer to VALUEs, remove backlinks from those
2949 remove_cselib_value_chains (decl_or_value dv)
2951 struct elt_loc_list *l;
2953 for (l = CSELIB_VAL_PTR (dv_as_value (dv))->locs; l; l = l->next)
2954 for_each_rtx (&l->loc, remove_value_chain, dv_as_opaque (dv));
2957 /* Check the order of entries in one-part variables. */
2960 canonicalize_loc_order_check (void **slot, void *data ATTRIBUTE_UNUSED)
2962 variable var = (variable) *slot;
2963 decl_or_value dv = var->dv;
2964 location_chain node, next;
2966 #ifdef ENABLE_RTL_CHECKING
2968 for (i = 0; i < var->n_var_parts; i++)
2969 gcc_assert (var->var_part[0].cur_loc == NULL);
2970 gcc_assert (!var->cur_loc_changed && !var->in_changed_variables);
2973 if (!dv_onepart_p (dv))
2976 gcc_assert (var->n_var_parts == 1);
2977 node = var->var_part[0].loc_chain;
2980 while ((next = node->next))
2982 gcc_assert (loc_cmp (node->loc, next->loc) < 0);
2990 /* Mark with VALUE_RECURSED_INTO values that have neighbors that are
2991 more likely to be chosen as canonical for an equivalence set.
2992 Ensure less likely values can reach more likely neighbors, making
2993 the connections bidirectional. */
2996 canonicalize_values_mark (void **slot, void *data)
2998 dataflow_set *set = (dataflow_set *)data;
2999 variable var = (variable) *slot;
3000 decl_or_value dv = var->dv;
3002 location_chain node;
3004 if (!dv_is_value_p (dv))
3007 gcc_assert (var->n_var_parts == 1);
3009 val = dv_as_value (dv);
3011 for (node = var->var_part[0].loc_chain; node; node = node->next)
3012 if (GET_CODE (node->loc) == VALUE)
3014 if (canon_value_cmp (node->loc, val))
3015 VALUE_RECURSED_INTO (val) = true;
3018 decl_or_value odv = dv_from_value (node->loc);
3019 void **oslot = shared_hash_find_slot_noinsert (set->vars, odv);
3021 oslot = set_slot_part (set, val, oslot, odv, 0,
3022 node->init, NULL_RTX);
3024 VALUE_RECURSED_INTO (node->loc) = true;
3031 /* Remove redundant entries from equivalence lists in onepart
3032 variables, canonicalizing equivalence sets into star shapes. */
3035 canonicalize_values_star (void **slot, void *data)
3037 dataflow_set *set = (dataflow_set *)data;
3038 variable var = (variable) *slot;
3039 decl_or_value dv = var->dv;
3040 location_chain node;
3047 if (!dv_onepart_p (dv))
3050 gcc_assert (var->n_var_parts == 1);
3052 if (dv_is_value_p (dv))
3054 cval = dv_as_value (dv);
3055 if (!VALUE_RECURSED_INTO (cval))
3057 VALUE_RECURSED_INTO (cval) = false;
3067 gcc_assert (var->n_var_parts == 1);
3069 for (node = var->var_part[0].loc_chain; node; node = node->next)
3070 if (GET_CODE (node->loc) == VALUE)
3073 if (VALUE_RECURSED_INTO (node->loc))
3075 if (canon_value_cmp (node->loc, cval))
3084 if (!has_marks || dv_is_decl_p (dv))
3087 /* Keep it marked so that we revisit it, either after visiting a
3088 child node, or after visiting a new parent that might be
3090 VALUE_RECURSED_INTO (val) = true;
3092 for (node = var->var_part[0].loc_chain; node; node = node->next)
3093 if (GET_CODE (node->loc) == VALUE
3094 && VALUE_RECURSED_INTO (node->loc))
3098 VALUE_RECURSED_INTO (cval) = false;
3099 dv = dv_from_value (cval);
3100 slot = shared_hash_find_slot_noinsert (set->vars, dv);
3103 gcc_assert (dv_is_decl_p (var->dv));
3104 /* The canonical value was reset and dropped.
3106 clobber_variable_part (set, NULL, var->dv, 0, NULL);
3109 var = (variable)*slot;
3110 gcc_assert (dv_is_value_p (var->dv));
3111 if (var->n_var_parts == 0)
3113 gcc_assert (var->n_var_parts == 1);
3117 VALUE_RECURSED_INTO (val) = false;
3122 /* Push values to the canonical one. */
3123 cdv = dv_from_value (cval);
3124 cslot = shared_hash_find_slot_noinsert (set->vars, cdv);
3126 for (node = var->var_part[0].loc_chain; node; node = node->next)
3127 if (node->loc != cval)
3129 cslot = set_slot_part (set, node->loc, cslot, cdv, 0,
3130 node->init, NULL_RTX);
3131 if (GET_CODE (node->loc) == VALUE)
3133 decl_or_value ndv = dv_from_value (node->loc);
3135 set_variable_part (set, cval, ndv, 0, node->init, NULL_RTX,
3138 if (canon_value_cmp (node->loc, val))
3140 /* If it could have been a local minimum, it's not any more,
3141 since it's now neighbor to cval, so it may have to push
3142 to it. Conversely, if it wouldn't have prevailed over
3143 val, then whatever mark it has is fine: if it was to
3144 push, it will now push to a more canonical node, but if
3145 it wasn't, then it has already pushed any values it might
3147 VALUE_RECURSED_INTO (node->loc) = true;
3148 /* Make sure we visit node->loc by ensuring we cval is
3150 VALUE_RECURSED_INTO (cval) = true;
3152 else if (!VALUE_RECURSED_INTO (node->loc))
3153 /* If we have no need to "recurse" into this node, it's
3154 already "canonicalized", so drop the link to the old
3156 clobber_variable_part (set, cval, ndv, 0, NULL);
3158 else if (GET_CODE (node->loc) == REG)
3160 attrs list = set->regs[REGNO (node->loc)], *listp;
3162 /* Change an existing attribute referring to dv so that it
3163 refers to cdv, removing any duplicate this might
3164 introduce, and checking that no previous duplicates
3165 existed, all in a single pass. */
3169 if (list->offset == 0
3170 && (dv_as_opaque (list->dv) == dv_as_opaque (dv)
3171 || dv_as_opaque (list->dv) == dv_as_opaque (cdv)))
3178 if (dv_as_opaque (list->dv) == dv_as_opaque (dv))
3181 for (listp = &list->next; (list = *listp); listp = &list->next)
3186 if (dv_as_opaque (list->dv) == dv_as_opaque (cdv))
3188 *listp = list->next;
3189 pool_free (attrs_pool, list);
3194 gcc_assert (dv_as_opaque (list->dv) != dv_as_opaque (dv));
3197 else if (dv_as_opaque (list->dv) == dv_as_opaque (cdv))
3199 for (listp = &list->next; (list = *listp); listp = &list->next)
3204 if (dv_as_opaque (list->dv) == dv_as_opaque (dv))
3206 *listp = list->next;
3207 pool_free (attrs_pool, list);
3212 gcc_assert (dv_as_opaque (list->dv) != dv_as_opaque (cdv));
3221 if (list->offset == 0
3222 && (dv_as_opaque (list->dv) == dv_as_opaque (dv)
3223 || dv_as_opaque (list->dv) == dv_as_opaque (cdv)))
3233 cslot = set_slot_part (set, val, cslot, cdv, 0,
3234 VAR_INIT_STATUS_INITIALIZED, NULL_RTX);
3236 slot = clobber_slot_part (set, cval, slot, 0, NULL);
3238 /* Variable may have been unshared. */
3239 var = (variable)*slot;
3240 gcc_assert (var->n_var_parts && var->var_part[0].loc_chain->loc == cval
3241 && var->var_part[0].loc_chain->next == NULL);
3243 if (VALUE_RECURSED_INTO (cval))
3244 goto restart_with_cval;
3249 /* Bind one-part variables to the canonical value in an equivalence
3250 set. Not doing this causes dataflow convergence failure in rare
3251 circumstances, see PR42873. Unfortunately we can't do this
3252 efficiently as part of canonicalize_values_star, since we may not
3253 have determined or even seen the canonical value of a set when we
3254 get to a variable that references another member of the set. */
3257 canonicalize_vars_star (void **slot, void *data)
3259 dataflow_set *set = (dataflow_set *)data;
3260 variable var = (variable) *slot;
3261 decl_or_value dv = var->dv;
3262 location_chain node;
3267 location_chain cnode;
3269 if (!dv_onepart_p (dv) || dv_is_value_p (dv))
3272 gcc_assert (var->n_var_parts == 1);
3274 node = var->var_part[0].loc_chain;
3276 if (GET_CODE (node->loc) != VALUE)
3279 gcc_assert (!node->next);
3282 /* Push values to the canonical one. */
3283 cdv = dv_from_value (cval);
3284 cslot = shared_hash_find_slot_noinsert (set->vars, cdv);
3287 cvar = (variable)*cslot;
3288 gcc_assert (cvar->n_var_parts == 1);
3290 cnode = cvar->var_part[0].loc_chain;
3292 /* CVAL is canonical if its value list contains non-VALUEs or VALUEs
3293 that are not “more canonical” than it. */
3294 if (GET_CODE (cnode->loc) != VALUE
3295 || !canon_value_cmp (cnode->loc, cval))
3298 /* CVAL was found to be non-canonical. Change the variable to point
3299 to the canonical VALUE. */
3300 gcc_assert (!cnode->next);
3303 slot = set_slot_part (set, cval, slot, dv, 0,
3304 node->init, node->set_src);
3305 slot = clobber_slot_part (set, cval, slot, 0, node->set_src);
3310 /* Combine variable or value in *S1SLOT (in DSM->cur) with the
3311 corresponding entry in DSM->src. Multi-part variables are combined
3312 with variable_union, whereas onepart dvs are combined with
3316 variable_merge_over_cur (variable s1var, struct dfset_merge *dsm)
3318 dataflow_set *dst = dsm->dst;
3320 variable s2var, dvar = NULL;
3321 decl_or_value dv = s1var->dv;
3322 bool onepart = dv_onepart_p (dv);
3325 location_chain node, *nodep;
3327 /* If the incoming onepart variable has an empty location list, then
3328 the intersection will be just as empty. For other variables,
3329 it's always union. */
3330 gcc_assert (s1var->n_var_parts
3331 && s1var->var_part[0].loc_chain);
3334 return variable_union (s1var, dst);
3336 gcc_assert (s1var->n_var_parts == 1
3337 && s1var->var_part[0].offset == 0);
3339 dvhash = dv_htab_hash (dv);
3340 if (dv_is_value_p (dv))
3341 val = dv_as_value (dv);
3345 s2var = shared_hash_find_1 (dsm->src->vars, dv, dvhash);
3348 dst_can_be_shared = false;
3352 dsm->src_onepart_cnt--;
3353 gcc_assert (s2var->var_part[0].loc_chain
3354 && s2var->n_var_parts == 1
3355 && s2var->var_part[0].offset == 0);
3357 dstslot = shared_hash_find_slot_noinsert_1 (dst->vars, dv, dvhash);
3360 dvar = (variable)*dstslot;
3361 gcc_assert (dvar->refcount == 1
3362 && dvar->n_var_parts == 1
3363 && dvar->var_part[0].offset == 0);
3364 nodep = &dvar->var_part[0].loc_chain;
3372 if (!dstslot && !onepart_variable_different_p (s1var, s2var))
3374 dstslot = shared_hash_find_slot_unshare_1 (&dst->vars, dv,
3376 *dstslot = dvar = s2var;
3381 dst_can_be_shared = false;
3383 intersect_loc_chains (val, nodep, dsm,
3384 s1var->var_part[0].loc_chain, s2var);
3390 dvar = (variable) pool_alloc (dv_pool (dv));
3393 dvar->n_var_parts = 1;
3394 dvar->cur_loc_changed = false;
3395 dvar->in_changed_variables = false;
3396 dvar->var_part[0].offset = 0;
3397 dvar->var_part[0].loc_chain = node;
3398 dvar->var_part[0].cur_loc = NULL;
3401 = shared_hash_find_slot_unshare_1 (&dst->vars, dv, dvhash,
3403 gcc_assert (!*dstslot);
3411 nodep = &dvar->var_part[0].loc_chain;
3412 while ((node = *nodep))
3414 location_chain *nextp = &node->next;
3416 if (GET_CODE (node->loc) == REG)
3420 for (list = dst->regs[REGNO (node->loc)]; list; list = list->next)
3421 if (GET_MODE (node->loc) == GET_MODE (list->loc)
3422 && dv_is_value_p (list->dv))
3426 attrs_list_insert (&dst->regs[REGNO (node->loc)],
3428 /* If this value became canonical for another value that had
3429 this register, we want to leave it alone. */
3430 else if (dv_as_value (list->dv) != val)
3432 dstslot = set_slot_part (dst, dv_as_value (list->dv),
3434 node->init, NULL_RTX);
3435 dstslot = delete_slot_part (dst, node->loc, dstslot, 0);
3437 /* Since nextp points into the removed node, we can't
3438 use it. The pointer to the next node moved to nodep.
3439 However, if the variable we're walking is unshared
3440 during our walk, we'll keep walking the location list
3441 of the previously-shared variable, in which case the
3442 node won't have been removed, and we'll want to skip
3443 it. That's why we test *nodep here. */
3449 /* Canonicalization puts registers first, so we don't have to
3455 if (dvar != (variable)*dstslot)
3456 dvar = (variable)*dstslot;
3457 nodep = &dvar->var_part[0].loc_chain;
3461 /* Mark all referenced nodes for canonicalization, and make sure
3462 we have mutual equivalence links. */
3463 VALUE_RECURSED_INTO (val) = true;
3464 for (node = *nodep; node; node = node->next)
3465 if (GET_CODE (node->loc) == VALUE)
3467 VALUE_RECURSED_INTO (node->loc) = true;
3468 set_variable_part (dst, val, dv_from_value (node->loc), 0,
3469 node->init, NULL, INSERT);
3472 dstslot = shared_hash_find_slot_noinsert_1 (dst->vars, dv, dvhash);
3473 gcc_assert (*dstslot == dvar);
3474 canonicalize_values_star (dstslot, dst);
3475 #ifdef ENABLE_CHECKING
3477 == shared_hash_find_slot_noinsert_1 (dst->vars, dv, dvhash));
3479 dvar = (variable)*dstslot;
3483 bool has_value = false, has_other = false;
3485 /* If we have one value and anything else, we're going to
3486 canonicalize this, so make sure all values have an entry in
3487 the table and are marked for canonicalization. */
3488 for (node = *nodep; node; node = node->next)
3490 if (GET_CODE (node->loc) == VALUE)
3492 /* If this was marked during register canonicalization,
3493 we know we have to canonicalize values. */
3508 if (has_value && has_other)
3510 for (node = *nodep; node; node = node->next)
3512 if (GET_CODE (node->loc) == VALUE)
3514 decl_or_value dv = dv_from_value (node->loc);
3517 if (shared_hash_shared (dst->vars))
3518 slot = shared_hash_find_slot_noinsert (dst->vars, dv);
3520 slot = shared_hash_find_slot_unshare (&dst->vars, dv,
3524 variable var = (variable) pool_alloc (dv_pool (dv));
3527 var->n_var_parts = 1;
3528 var->cur_loc_changed = false;
3529 var->in_changed_variables = false;
3530 var->var_part[0].offset = 0;
3531 var->var_part[0].loc_chain = NULL;
3532 var->var_part[0].cur_loc = NULL;
3536 VALUE_RECURSED_INTO (node->loc) = true;
3540 dstslot = shared_hash_find_slot_noinsert_1 (dst->vars, dv, dvhash);
3541 gcc_assert (*dstslot == dvar);
3542 canonicalize_values_star (dstslot, dst);
3543 #ifdef ENABLE_CHECKING
3545 == shared_hash_find_slot_noinsert_1 (dst->vars,
3548 dvar = (variable)*dstslot;
3552 if (!onepart_variable_different_p (dvar, s2var))
3554 variable_htab_free (dvar);
3555 *dstslot = dvar = s2var;
3558 else if (s2var != s1var && !onepart_variable_different_p (dvar, s1var))
3560 variable_htab_free (dvar);
3561 *dstslot = dvar = s1var;
3563 dst_can_be_shared = false;
3566 dst_can_be_shared = false;
3571 /* Copy s2slot (in DSM->src) to DSM->dst if the variable is a
3572 multi-part variable. Unions of multi-part variables and
3573 intersections of one-part ones will be handled in
3574 variable_merge_over_cur(). */
3577 variable_merge_over_src (variable s2var, struct dfset_merge *dsm)
3579 dataflow_set *dst = dsm->dst;
3580 decl_or_value dv = s2var->dv;
3581 bool onepart = dv_onepart_p (dv);
3585 void **dstp = shared_hash_find_slot (dst->vars, dv);
3591 dsm->src_onepart_cnt++;
3595 /* Combine dataflow set information from SRC2 into DST, using PDST
3596 to carry over information across passes. */
3599 dataflow_set_merge (dataflow_set *dst, dataflow_set *src2)
3601 dataflow_set cur = *dst;
3602 dataflow_set *src1 = &cur;
3603 struct dfset_merge dsm;
3605 size_t src1_elems, src2_elems;
3609 src1_elems = htab_elements (shared_hash_htab (src1->vars));
3610 src2_elems = htab_elements (shared_hash_htab (src2->vars));
3611 dataflow_set_init (dst);
3612 dst->stack_adjust = cur.stack_adjust;
3613 shared_hash_destroy (dst->vars);
3614 dst->vars = (shared_hash) pool_alloc (shared_hash_pool);
3615 dst->vars->refcount = 1;
3617 = htab_create (MAX (src1_elems, src2_elems), variable_htab_hash,
3618 variable_htab_eq, variable_htab_free);
3620 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3621 attrs_list_mpdv_union (&dst->regs[i], src1->regs[i], src2->regs[i]);
3626 dsm.src_onepart_cnt = 0;
3628 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm.src->vars), var, variable, hi)
3629 variable_merge_over_src (var, &dsm);
3630 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (dsm.cur->vars), var, variable, hi)
3631 variable_merge_over_cur (var, &dsm);
3633 if (dsm.src_onepart_cnt)
3634 dst_can_be_shared = false;
3636 dataflow_set_destroy (src1);
3639 /* Mark register equivalences. */
3642 dataflow_set_equiv_regs (dataflow_set *set)
3647 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
3649 rtx canon[NUM_MACHINE_MODES];
3651 memset (canon, 0, sizeof (canon));
3653 for (list = set->regs[i]; list; list = list->next)
3654 if (list->offset == 0 && dv_is_value_p (list->dv))
3656 rtx val = dv_as_value (list->dv);
3657 rtx *cvalp = &canon[(int)GET_MODE (val)];
3660 if (canon_value_cmp (val, cval))
3664 for (list = set->regs[i]; list; list = list->next)
3665 if (list->offset == 0 && dv_onepart_p (list->dv))
3667 rtx cval = canon[(int)GET_MODE (list->loc)];
3672 if (dv_is_value_p (list->dv))
3674 rtx val = dv_as_value (list->dv);
3679 VALUE_RECURSED_INTO (val) = true;
3680 set_variable_part (set, val, dv_from_value (cval), 0,
3681 VAR_INIT_STATUS_INITIALIZED,
3685 VALUE_RECURSED_INTO (cval) = true;
3686 set_variable_part (set, cval, list->dv, 0,
3687 VAR_INIT_STATUS_INITIALIZED, NULL, NO_INSERT);
3690 for (listp = &set->regs[i]; (list = *listp);
3691 listp = list ? &list->next : listp)
3692 if (list->offset == 0 && dv_onepart_p (list->dv))
3694 rtx cval = canon[(int)GET_MODE (list->loc)];
3700 if (dv_is_value_p (list->dv))
3702 rtx val = dv_as_value (list->dv);
3703 if (!VALUE_RECURSED_INTO (val))
3707 slot = shared_hash_find_slot_noinsert (set->vars, list->dv);
3708 canonicalize_values_star (slot, set);
3715 /* Remove any redundant values in the location list of VAR, which must
3716 be unshared and 1-part. */
3719 remove_duplicate_values (variable var)
3721 location_chain node, *nodep;
3723 gcc_assert (dv_onepart_p (var->dv));
3724 gcc_assert (var->n_var_parts == 1);
3725 gcc_assert (var->refcount == 1);
3727 for (nodep = &var->var_part[0].loc_chain; (node = *nodep); )
3729 if (GET_CODE (node->loc) == VALUE)
3731 if (VALUE_RECURSED_INTO (node->loc))
3733 /* Remove duplicate value node. */
3734 *nodep = node->next;
3735 pool_free (loc_chain_pool, node);
3739 VALUE_RECURSED_INTO (node->loc) = true;
3741 nodep = &node->next;
3744 for (node = var->var_part[0].loc_chain; node; node = node->next)
3745 if (GET_CODE (node->loc) == VALUE)
3747 gcc_assert (VALUE_RECURSED_INTO (node->loc));
3748 VALUE_RECURSED_INTO (node->loc) = false;
3753 /* Hash table iteration argument passed to variable_post_merge. */
3754 struct dfset_post_merge
3756 /* The new input set for the current block. */
3758 /* Pointer to the permanent input set for the current block, or
3760 dataflow_set **permp;
3763 /* Create values for incoming expressions associated with one-part
3764 variables that don't have value numbers for them. */
3767 variable_post_merge_new_vals (void **slot, void *info)
3769 struct dfset_post_merge *dfpm = (struct dfset_post_merge *)info;
3770 dataflow_set *set = dfpm->set;
3771 variable var = (variable)*slot;
3772 location_chain node;
3774 if (!dv_onepart_p (var->dv) || !var->n_var_parts)
3777 gcc_assert (var->n_var_parts == 1);
3779 if (dv_is_decl_p (var->dv))
3781 bool check_dupes = false;
3784 for (node = var->var_part[0].loc_chain; node; node = node->next)
3786 if (GET_CODE (node->loc) == VALUE)
3787 gcc_assert (!VALUE_RECURSED_INTO (node->loc));
3788 else if (GET_CODE (node->loc) == REG)
3790 attrs att, *attp, *curp = NULL;
3792 if (var->refcount != 1)
3794 slot = unshare_variable (set, slot, var,
3795 VAR_INIT_STATUS_INITIALIZED);
3796 var = (variable)*slot;
3800 for (attp = &set->regs[REGNO (node->loc)]; (att = *attp);
3802 if (att->offset == 0
3803 && GET_MODE (att->loc) == GET_MODE (node->loc))
3805 if (dv_is_value_p (att->dv))
3807 rtx cval = dv_as_value (att->dv);
3812 else if (dv_as_opaque (att->dv) == dv_as_opaque (var->dv))
3820 if ((*curp)->offset == 0
3821 && GET_MODE ((*curp)->loc) == GET_MODE (node->loc)
3822 && dv_as_opaque ((*curp)->dv) == dv_as_opaque (var->dv))
3825 curp = &(*curp)->next;
3836 *dfpm->permp = XNEW (dataflow_set);
3837 dataflow_set_init (*dfpm->permp);
3840 for (att = (*dfpm->permp)->regs[REGNO (node->loc)];
3841 att; att = att->next)
3842 if (GET_MODE (att->loc) == GET_MODE (node->loc))
3844 gcc_assert (att->offset == 0
3845 && dv_is_value_p (att->dv));
3846 val_reset (set, att->dv);
3853 cval = dv_as_value (cdv);
3857 /* Create a unique value to hold this register,
3858 that ought to be found and reused in
3859 subsequent rounds. */
3861 gcc_assert (!cselib_lookup (node->loc,
3862 GET_MODE (node->loc), 0));
3863 v = cselib_lookup (node->loc, GET_MODE (node->loc), 1);
3864 cselib_preserve_value (v);
3865 cselib_invalidate_rtx (node->loc);
3867 cdv = dv_from_value (cval);
3870 "Created new value %u:%u for reg %i\n",
3871 v->uid, v->hash, REGNO (node->loc));
3874 var_reg_decl_set (*dfpm->permp, node->loc,
3875 VAR_INIT_STATUS_INITIALIZED,
3876 cdv, 0, NULL, INSERT);
3882 /* Remove attribute referring to the decl, which now
3883 uses the value for the register, already existing or
3884 to be added when we bring perm in. */
3887 pool_free (attrs_pool, att);
3892 remove_duplicate_values (var);
3898 /* Reset values in the permanent set that are not associated with the
3899 chosen expression. */
3902 variable_post_merge_perm_vals (void **pslot, void *info)
3904 struct dfset_post_merge *dfpm = (struct dfset_post_merge *)info;
3905 dataflow_set *set = dfpm->set;
3906 variable pvar = (variable)*pslot, var;
3907 location_chain pnode;
3911 gcc_assert (dv_is_value_p (pvar->dv)
3912 && pvar->n_var_parts == 1);
3913 pnode = pvar->var_part[0].loc_chain;
3916 && REG_P (pnode->loc));
3920 var = shared_hash_find (set->vars, dv);
3923 if (find_loc_in_1pdv (pnode->loc, var, shared_hash_htab (set->vars)))
3925 val_reset (set, dv);
3928 for (att = set->regs[REGNO (pnode->loc)]; att; att = att->next)
3929 if (att->offset == 0
3930 && GET_MODE (att->loc) == GET_MODE (pnode->loc)
3931 && dv_is_value_p (att->dv))
3934 /* If there is a value associated with this register already, create
3936 if (att && dv_as_value (att->dv) != dv_as_value (dv))
3938 rtx cval = dv_as_value (att->dv);
3939 set_variable_part (set, cval, dv, 0, pnode->init, NULL, INSERT);
3940 set_variable_part (set, dv_as_value (dv), att->dv, 0, pnode->init,
3945 attrs_list_insert (&set->regs[REGNO (pnode->loc)],
3947 variable_union (pvar, set);
3953 /* Just checking stuff and registering register attributes for
3957 dataflow_post_merge_adjust (dataflow_set *set, dataflow_set **permp)
3959 struct dfset_post_merge dfpm;
3964 htab_traverse (shared_hash_htab (set->vars), variable_post_merge_new_vals,
3967 htab_traverse (shared_hash_htab ((*permp)->vars),
3968 variable_post_merge_perm_vals, &dfpm);
3969 htab_traverse (shared_hash_htab (set->vars), canonicalize_values_star, set);
3970 htab_traverse (shared_hash_htab (set->vars), canonicalize_vars_star, set);
3973 /* Return a node whose loc is a MEM that refers to EXPR in the
3974 location list of a one-part variable or value VAR, or in that of
3975 any values recursively mentioned in the location lists. */
3977 static location_chain
3978 find_mem_expr_in_1pdv (tree expr, rtx val, htab_t vars)
3980 location_chain node;
3983 location_chain where = NULL;
3988 gcc_assert (GET_CODE (val) == VALUE
3989 && !VALUE_RECURSED_INTO (val));
3991 dv = dv_from_value (val);
3992 var = (variable) htab_find_with_hash (vars, dv, dv_htab_hash (dv));
3997 gcc_assert (dv_onepart_p (var->dv));
3999 if (!var->n_var_parts)
4002 gcc_assert (var->var_part[0].offset == 0);
4004 VALUE_RECURSED_INTO (val) = true;
4006 for (node = var->var_part[0].loc_chain; node; node = node->next)
4007 if (MEM_P (node->loc) && MEM_EXPR (node->loc) == expr
4008 && MEM_OFFSET (node->loc) == 0)
4013 else if (GET_CODE (node->loc) == VALUE
4014 && !VALUE_RECURSED_INTO (node->loc)
4015 && (where = find_mem_expr_in_1pdv (expr, node->loc, vars)))
4018 VALUE_RECURSED_INTO (val) = false;
4023 /* Return TRUE if the value of MEM may vary across a call. */
4026 mem_dies_at_call (rtx mem)
4028 tree expr = MEM_EXPR (mem);
4034 decl = get_base_address (expr);
4042 return (may_be_aliased (decl)
4043 || (!TREE_READONLY (decl) && is_global_var (decl)));
4046 /* Remove all MEMs from the location list of a hash table entry for a
4047 one-part variable, except those whose MEM attributes map back to
4048 the variable itself, directly or within a VALUE. */
4051 dataflow_set_preserve_mem_locs (void **slot, void *data)
4053 dataflow_set *set = (dataflow_set *) data;
4054 variable var = (variable) *slot;
4056 if (dv_is_decl_p (var->dv) && dv_onepart_p (var->dv))
4058 tree decl = dv_as_decl (var->dv);
4059 location_chain loc, *locp;
4060 bool changed = false;
4062 if (!var->n_var_parts)
4065 gcc_assert (var->n_var_parts == 1);
4067 if (shared_var_p (var, set->vars))
4069 for (loc = var->var_part[0].loc_chain; loc; loc = loc->next)
4071 /* We want to remove dying MEMs that doesn't refer to
4073 if (GET_CODE (loc->loc) == MEM
4074 && (MEM_EXPR (loc->loc) != decl
4075 || MEM_OFFSET (loc->loc))
4076 && !mem_dies_at_call (loc->loc))
4078 /* We want to move here MEMs that do refer to DECL. */
4079 else if (GET_CODE (loc->loc) == VALUE
4080 && find_mem_expr_in_1pdv (decl, loc->loc,
4081 shared_hash_htab (set->vars)))
4088 slot = unshare_variable (set, slot, var, VAR_INIT_STATUS_UNKNOWN);
4089 var = (variable)*slot;
4090 gcc_assert (var->n_var_parts == 1);
4093 for (locp = &var->var_part[0].loc_chain, loc = *locp;
4096 rtx old_loc = loc->loc;
4097 if (GET_CODE (old_loc) == VALUE)
4099 location_chain mem_node
4100 = find_mem_expr_in_1pdv (decl, loc->loc,
4101 shared_hash_htab (set->vars));
4103 /* ??? This picks up only one out of multiple MEMs that
4104 refer to the same variable. Do we ever need to be
4105 concerned about dealing with more than one, or, given
4106 that they should all map to the same variable
4107 location, their addresses will have been merged and
4108 they will be regarded as equivalent? */
4111 loc->loc = mem_node->loc;
4112 loc->set_src = mem_node->set_src;
4113 loc->init = MIN (loc->init, mem_node->init);
4117 if (GET_CODE (loc->loc) != MEM
4118 || (MEM_EXPR (loc->loc) == decl
4119 && MEM_OFFSET (loc->loc) == 0)
4120 || !mem_dies_at_call (loc->loc))
4122 if (old_loc != loc->loc && emit_notes)
4124 if (old_loc == var->var_part[0].cur_loc)
4127 var->var_part[0].cur_loc = NULL;
4128 var->cur_loc_changed = true;
4130 add_value_chains (var->dv, loc->loc);
4131 remove_value_chains (var->dv, old_loc);
4139 remove_value_chains (var->dv, old_loc);
4140 if (old_loc == var->var_part[0].cur_loc)
4143 var->var_part[0].cur_loc = NULL;
4144 var->cur_loc_changed = true;
4148 pool_free (loc_chain_pool, loc);
4151 if (!var->var_part[0].loc_chain)
4157 variable_was_changed (var, set);
4163 /* Remove all MEMs from the location list of a hash table entry for a
4167 dataflow_set_remove_mem_locs (void **slot, void *data)
4169 dataflow_set *set = (dataflow_set *) data;
4170 variable var = (variable) *slot;
4172 if (dv_is_value_p (var->dv))
4174 location_chain loc, *locp;
4175 bool changed = false;
4177 gcc_assert (var->n_var_parts == 1);
4179 if (shared_var_p (var, set->vars))
4181 for (loc = var->var_part[0].loc_chain; loc; loc = loc->next)
4182 if (GET_CODE (loc->loc) == MEM
4183 && mem_dies_at_call (loc->loc))
4189 slot = unshare_variable (set, slot, var, VAR_INIT_STATUS_UNKNOWN);
4190 var = (variable)*slot;
4191 gcc_assert (var->n_var_parts == 1);
4194 for (locp = &var->var_part[0].loc_chain, loc = *locp;
4197 if (GET_CODE (loc->loc) != MEM
4198 || !mem_dies_at_call (loc->loc))
4205 remove_value_chains (var->dv, loc->loc);
4207 /* If we have deleted the location which was last emitted
4208 we have to emit new location so add the variable to set
4209 of changed variables. */
4210 if (var->var_part[0].cur_loc == loc->loc)
4213 var->var_part[0].cur_loc = NULL;
4214 var->cur_loc_changed = true;
4216 pool_free (loc_chain_pool, loc);
4219 if (!var->var_part[0].loc_chain)
4225 variable_was_changed (var, set);
4231 /* Remove all variable-location information about call-clobbered
4232 registers, as well as associations between MEMs and VALUEs. */
4235 dataflow_set_clear_at_call (dataflow_set *set)
4239 for (r = 0; r < FIRST_PSEUDO_REGISTER; r++)
4240 if (TEST_HARD_REG_BIT (regs_invalidated_by_call, r))
4241 var_regno_delete (set, r);
4243 if (MAY_HAVE_DEBUG_INSNS)
4245 set->traversed_vars = set->vars;
4246 htab_traverse (shared_hash_htab (set->vars),
4247 dataflow_set_preserve_mem_locs, set);
4248 set->traversed_vars = set->vars;
4249 htab_traverse (shared_hash_htab (set->vars), dataflow_set_remove_mem_locs,
4251 set->traversed_vars = NULL;
4256 variable_part_different_p (variable_part *vp1, variable_part *vp2)
4258 location_chain lc1, lc2;
4260 for (lc1 = vp1->loc_chain; lc1; lc1 = lc1->next)
4262 for (lc2 = vp2->loc_chain; lc2; lc2 = lc2->next)
4264 if (REG_P (lc1->loc) && REG_P (lc2->loc))
4266 if (REGNO (lc1->loc) == REGNO (lc2->loc))
4269 if (rtx_equal_p (lc1->loc, lc2->loc))
4278 /* Return true if one-part variables VAR1 and VAR2 are different.
4279 They must be in canonical order. */
4282 onepart_variable_different_p (variable var1, variable var2)
4284 location_chain lc1, lc2;
4289 gcc_assert (var1->n_var_parts == 1
4290 && var2->n_var_parts == 1);
4292 lc1 = var1->var_part[0].loc_chain;
4293 lc2 = var2->var_part[0].loc_chain;
4295 gcc_assert (lc1 && lc2);
4299 if (loc_cmp (lc1->loc, lc2->loc))
4308 /* Return true if variables VAR1 and VAR2 are different. */
4311 variable_different_p (variable var1, variable var2)
4318 if (var1->n_var_parts != var2->n_var_parts)
4321 for (i = 0; i < var1->n_var_parts; i++)
4323 if (var1->var_part[i].offset != var2->var_part[i].offset)
4325 /* One-part values have locations in a canonical order. */
4326 if (i == 0 && var1->var_part[i].offset == 0 && dv_onepart_p (var1->dv))
4328 gcc_assert (var1->n_var_parts == 1
4329 && dv_as_opaque (var1->dv) == dv_as_opaque (var2->dv));
4330 return onepart_variable_different_p (var1, var2);
4332 if (variable_part_different_p (&var1->var_part[i], &var2->var_part[i]))
4334 if (variable_part_different_p (&var2->var_part[i], &var1->var_part[i]))
4340 /* Return true if dataflow sets OLD_SET and NEW_SET differ. */
4343 dataflow_set_different (dataflow_set *old_set, dataflow_set *new_set)
4348 if (old_set->vars == new_set->vars)
4351 if (htab_elements (shared_hash_htab (old_set->vars))
4352 != htab_elements (shared_hash_htab (new_set->vars)))
4355 FOR_EACH_HTAB_ELEMENT (shared_hash_htab (old_set->vars), var1, variable, hi)
4357 htab_t htab = shared_hash_htab (new_set->vars);
4358 variable var2 = (variable) htab_find_with_hash (htab, var1->dv,
4359 dv_htab_hash (var1->dv));
4362 if (dump_file && (dump_flags & TDF_DETAILS))
4364 fprintf (dump_file, "dataflow difference found: removal of:\n");
4370 if (variable_different_p (var1, var2))
4372 if (dump_file && (dump_flags & TDF_DETAILS))
4374 fprintf (dump_file, "dataflow difference found: "
4375 "old and new follow:\n");
4383 /* No need to traverse the second hashtab, if both have the same number
4384 of elements and the second one had all entries found in the first one,
4385 then it can't have any extra entries. */
4389 /* Free the contents of dataflow set SET. */
4392 dataflow_set_destroy (dataflow_set *set)
4396 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
4397 attrs_list_clear (&set->regs[i]);
4399 shared_hash_destroy (set->vars);
4403 /* Return true if RTL X contains a SYMBOL_REF. */
4406 contains_symbol_ref (rtx x)
4415 code = GET_CODE (x);
4416 if (code == SYMBOL_REF)
4419 fmt = GET_RTX_FORMAT (code);
4420 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
4424 if (contains_symbol_ref (XEXP (x, i)))
4427 else if (fmt[i] == 'E')
4430 for (j = 0; j < XVECLEN (x, i); j++)
4431 if (contains_symbol_ref (XVECEXP (x, i, j)))
4439 /* Shall EXPR be tracked? */
4442 track_expr_p (tree expr, bool need_rtl)
4447 if (TREE_CODE (expr) == DEBUG_EXPR_DECL)
4448 return DECL_RTL_SET_P (expr);
4450 /* If EXPR is not a parameter or a variable do not track it. */
4451 if (TREE_CODE (expr) != VAR_DECL && TREE_CODE (expr) != PARM_DECL)
4454 /* It also must have a name... */
4455 if (!DECL_NAME (expr) && need_rtl)
4458 /* ... and a RTL assigned to it. */
4459 decl_rtl = DECL_RTL_IF_SET (expr);
4460 if (!decl_rtl && need_rtl)
4463 /* If this expression is really a debug alias of some other declaration, we
4464 don't need to track this expression if the ultimate declaration is
4467 if (DECL_DEBUG_EXPR_IS_FROM (realdecl))
4469 realdecl = DECL_DEBUG_EXPR (realdecl);
4470 if (realdecl == NULL_TREE)
4472 else if (!DECL_P (realdecl))
4474 if (handled_component_p (realdecl))
4476 HOST_WIDE_INT bitsize, bitpos, maxsize;
4478 = get_ref_base_and_extent (realdecl, &bitpos, &bitsize,
4480 if (!DECL_P (innerdecl)
4481 || DECL_IGNORED_P (innerdecl)
4482 || TREE_STATIC (innerdecl)
4484 || bitpos + bitsize > 256
4485 || bitsize != maxsize)
4495 /* Do not track EXPR if REALDECL it should be ignored for debugging
4497 if (DECL_IGNORED_P (realdecl))
4500 /* Do not track global variables until we are able to emit correct location
4502 if (TREE_STATIC (realdecl))
4505 /* When the EXPR is a DECL for alias of some variable (see example)
4506 the TREE_STATIC flag is not used. Disable tracking all DECLs whose
4507 DECL_RTL contains SYMBOL_REF.
4510 extern char **_dl_argv_internal __attribute__ ((alias ("_dl_argv")));
4513 if (decl_rtl && MEM_P (decl_rtl)
4514 && contains_symbol_ref (XEXP (decl_rtl, 0)))
4517 /* If RTX is a memory it should not be very large (because it would be
4518 an array or struct). */
4519 if (decl_rtl && MEM_P (decl_rtl))
4521 /* Do not track structures and arrays. */
4522 if (GET_MODE (decl_rtl) == BLKmode
4523 || AGGREGATE_TYPE_P (TREE_TYPE (realdecl)))
4525 if (MEM_SIZE (decl_rtl)
4526 && INTVAL (MEM_SIZE (decl_rtl)) > MAX_VAR_PARTS)
4530 DECL_CHANGED (expr) = 0;
4531 DECL_CHANGED (realdecl) = 0;
4535 /* Determine whether a given LOC refers to the same variable part as
4539 same_variable_part_p (rtx loc, tree expr, HOST_WIDE_INT offset)
4542 HOST_WIDE_INT offset2;
4544 if (! DECL_P (expr))
4549 expr2 = REG_EXPR (loc);
4550 offset2 = REG_OFFSET (loc);
4552 else if (MEM_P (loc))
4554 expr2 = MEM_EXPR (loc);
4555 offset2 = INT_MEM_OFFSET (loc);
4560 if (! expr2 || ! DECL_P (expr2))
4563 expr = var_debug_decl (expr);
4564 expr2 = var_debug_decl (expr2);
4566 return (expr == expr2 && offset == offset2);
4569 /* LOC is a REG or MEM that we would like to track if possible.
4570 If EXPR is null, we don't know what expression LOC refers to,
4571 otherwise it refers to EXPR + OFFSET. STORE_REG_P is true if
4572 LOC is an lvalue register.
4574 Return true if EXPR is nonnull and if LOC, or some lowpart of it,
4575 is something we can track. When returning true, store the mode of
4576 the lowpart we can track in *MODE_OUT (if nonnull) and its offset
4577 from EXPR in *OFFSET_OUT (if nonnull). */
4580 track_loc_p (rtx loc, tree expr, HOST_WIDE_INT offset, bool store_reg_p,
4581 enum machine_mode *mode_out, HOST_WIDE_INT *offset_out)
4583 enum machine_mode mode;
4585 if (expr == NULL || !track_expr_p (expr, true))
4588 /* If REG was a paradoxical subreg, its REG_ATTRS will describe the
4589 whole subreg, but only the old inner part is really relevant. */
4590 mode = GET_MODE (loc);
4591 if (REG_P (loc) && !HARD_REGISTER_NUM_P (ORIGINAL_REGNO (loc)))
4593 enum machine_mode pseudo_mode;
4595 pseudo_mode = PSEUDO_REGNO_MODE (ORIGINAL_REGNO (loc));
4596 if (GET_MODE_SIZE (mode) > GET_MODE_SIZE (pseudo_mode))
4598 offset += byte_lowpart_offset (pseudo_mode, mode);
4603 /* If LOC is a paradoxical lowpart of EXPR, refer to EXPR itself.
4604 Do the same if we are storing to a register and EXPR occupies
4605 the whole of register LOC; in that case, the whole of EXPR is
4606 being changed. We exclude complex modes from the second case
4607 because the real and imaginary parts are represented as separate
4608 pseudo registers, even if the whole complex value fits into one
4610 if ((GET_MODE_SIZE (mode) > GET_MODE_SIZE (DECL_MODE (expr))
4612 && !COMPLEX_MODE_P (DECL_MODE (expr))
4613 && hard_regno_nregs[REGNO (loc)][DECL_MODE (expr)] == 1))
4614 && offset + byte_lowpart_offset (DECL_MODE (expr), mode) == 0)
4616 mode = DECL_MODE (expr);
4620 if (offset < 0 || offset >= MAX_VAR_PARTS)
4626 *offset_out = offset;
4630 /* Return the MODE lowpart of LOC, or null if LOC is not something we
4631 want to track. When returning nonnull, make sure that the attributes
4632 on the returned value are updated. */
4635 var_lowpart (enum machine_mode mode, rtx loc)
4637 unsigned int offset, reg_offset, regno;
4639 if (!REG_P (loc) && !MEM_P (loc))
4642 if (GET_MODE (loc) == mode)
4645 offset = byte_lowpart_offset (mode, GET_MODE (loc));
4648 return adjust_address_nv (loc, mode, offset);
4650 reg_offset = subreg_lowpart_offset (mode, GET_MODE (loc));
4651 regno = REGNO (loc) + subreg_regno_offset (REGNO (loc), GET_MODE (loc),
4653 return gen_rtx_REG_offset (loc, mode, regno, offset);
4656 /* arg_pointer_rtx resp. frame_pointer_rtx if stack_pointer_rtx or
4657 hard_frame_pointer_rtx is being mapped to it. */
4658 static rtx cfa_base_rtx;
4660 /* Carry information about uses and stores while walking rtx. */
4662 struct count_use_info
4664 /* The insn where the RTX is. */
4667 /* The basic block where insn is. */
4670 /* The array of n_sets sets in the insn, as determined by cselib. */
4671 struct cselib_set *sets;
4674 /* True if we're counting stores, false otherwise. */
4678 /* Find a VALUE corresponding to X. */
4680 static inline cselib_val *
4681 find_use_val (rtx x, enum machine_mode mode, struct count_use_info *cui)
4687 /* This is called after uses are set up and before stores are
4688 processed bycselib, so it's safe to look up srcs, but not
4689 dsts. So we look up expressions that appear in srcs or in
4690 dest expressions, but we search the sets array for dests of
4694 for (i = 0; i < cui->n_sets; i++)
4695 if (cui->sets[i].dest == x)
4696 return cui->sets[i].src_elt;
4699 return cselib_lookup (x, mode, 0);
4705 /* Helper function to get mode of MEM's address. */
4707 static inline enum machine_mode
4708 get_address_mode (rtx mem)
4710 enum machine_mode mode = GET_MODE (XEXP (mem, 0));
4711 if (mode != VOIDmode)
4713 return targetm.addr_space.address_mode (MEM_ADDR_SPACE (mem));
4716 /* Replace all registers and addresses in an expression with VALUE
4717 expressions that map back to them, unless the expression is a
4718 register. If no mapping is or can be performed, returns NULL. */
4721 replace_expr_with_values (rtx loc)
4725 else if (MEM_P (loc))
4727 cselib_val *addr = cselib_lookup (XEXP (loc, 0),
4728 get_address_mode (loc), 0);
4730 return replace_equiv_address_nv (loc, addr->val_rtx);
4735 return cselib_subst_to_values (loc);
4738 /* Determine what kind of micro operation to choose for a USE. Return
4739 MO_CLOBBER if no micro operation is to be generated. */
4741 static enum micro_operation_type
4742 use_type (rtx loc, struct count_use_info *cui, enum machine_mode *modep)
4746 if (cui && cui->sets)
4748 if (GET_CODE (loc) == VAR_LOCATION)
4750 if (track_expr_p (PAT_VAR_LOCATION_DECL (loc), false))
4752 rtx ploc = PAT_VAR_LOCATION_LOC (loc);
4753 if (! VAR_LOC_UNKNOWN_P (ploc))
4755 cselib_val *val = cselib_lookup (ploc, GET_MODE (loc), 1);
4757 /* ??? flag_float_store and volatile mems are never
4758 given values, but we could in theory use them for
4760 gcc_assert (val || 1);
4768 if (REG_P (loc) || MEM_P (loc))
4771 *modep = GET_MODE (loc);
4775 || (find_use_val (loc, GET_MODE (loc), cui)
4776 && cselib_lookup (XEXP (loc, 0),
4777 get_address_mode (loc), 0)))
4782 cselib_val *val = find_use_val (loc, GET_MODE (loc), cui);
4784 if (val && !cselib_preserved_value_p (val))
4792 gcc_assert (REGNO (loc) < FIRST_PSEUDO_REGISTER);
4794 if (loc == cfa_base_rtx)
4796 expr = REG_EXPR (loc);
4799 return MO_USE_NO_VAR;
4800 else if (target_for_debug_bind (var_debug_decl (expr)))
4802 else if (track_loc_p (loc, expr, REG_OFFSET (loc),
4803 false, modep, NULL))
4806 return MO_USE_NO_VAR;
4808 else if (MEM_P (loc))
4810 expr = MEM_EXPR (loc);
4814 else if (target_for_debug_bind (var_debug_decl (expr)))
4816 else if (track_loc_p (loc, expr, INT_MEM_OFFSET (loc),
4817 false, modep, NULL))
4826 /* Log to OUT information about micro-operation MOPT involving X in
4830 log_op_type (rtx x, basic_block bb, rtx insn,
4831 enum micro_operation_type mopt, FILE *out)
4833 fprintf (out, "bb %i op %i insn %i %s ",
4834 bb->index, VEC_length (micro_operation, VTI (bb)->mos),
4835 INSN_UID (insn), micro_operation_type_name[mopt]);
4836 print_inline_rtx (out, x, 2);
4840 /* Tell whether the CONCAT used to holds a VALUE and its location
4841 needs value resolution, i.e., an attempt of mapping the location
4842 back to other incoming values. */
4843 #define VAL_NEEDS_RESOLUTION(x) \
4844 (RTL_FLAG_CHECK1 ("VAL_NEEDS_RESOLUTION", (x), CONCAT)->volatil)
4845 /* Whether the location in the CONCAT is a tracked expression, that
4846 should also be handled like a MO_USE. */
4847 #define VAL_HOLDS_TRACK_EXPR(x) \
4848 (RTL_FLAG_CHECK1 ("VAL_HOLDS_TRACK_EXPR", (x), CONCAT)->used)
4849 /* Whether the location in the CONCAT should be handled like a MO_COPY
4851 #define VAL_EXPR_IS_COPIED(x) \
4852 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_COPIED", (x), CONCAT)->jump)
4853 /* Whether the location in the CONCAT should be handled like a
4854 MO_CLOBBER as well. */
4855 #define VAL_EXPR_IS_CLOBBERED(x) \
4856 (RTL_FLAG_CHECK1 ("VAL_EXPR_IS_CLOBBERED", (x), CONCAT)->unchanging)
4857 /* Whether the location is a CONCAT of the MO_VAL_SET expression and
4858 a reverse operation that should be handled afterwards. */
4859 #define VAL_EXPR_HAS_REVERSE(x) \
4860 (RTL_FLAG_CHECK1 ("VAL_EXPR_HAS_REVERSE", (x), CONCAT)->return_val)
4862 /* All preserved VALUEs. */
4863 static VEC (rtx, heap) *preserved_values;
4865 /* Ensure VAL is preserved and remember it in a vector for vt_emit_notes. */
4868 preserve_value (cselib_val *val)
4870 cselib_preserve_value (val);
4871 VEC_safe_push (rtx, heap, preserved_values, val->val_rtx);
4874 /* Helper function for MO_VAL_LOC handling. Return non-zero if
4875 any rtxes not suitable for CONST use not replaced by VALUEs
4879 non_suitable_const (rtx *x, void *data ATTRIBUTE_UNUSED)
4884 switch (GET_CODE (*x))
4895 return !MEM_READONLY_P (*x);
4901 /* Add uses (register and memory references) LOC which will be tracked
4902 to VTI (bb)->mos. INSN is instruction which the LOC is part of. */
4905 add_uses (rtx *ploc, void *data)
4908 enum machine_mode mode = VOIDmode;
4909 struct count_use_info *cui = (struct count_use_info *)data;
4910 enum micro_operation_type type = use_type (loc, cui, &mode);
4912 if (type != MO_CLOBBER)
4914 basic_block bb = cui->bb;
4918 mo.u.loc = type == MO_USE ? var_lowpart (mode, loc) : loc;
4919 mo.insn = cui->insn;
4921 if (type == MO_VAL_LOC)
4924 rtx vloc = PAT_VAR_LOCATION_LOC (oloc);
4927 gcc_assert (cui->sets);
4930 && !REG_P (XEXP (vloc, 0))
4931 && !MEM_P (XEXP (vloc, 0))
4932 && (GET_CODE (XEXP (vloc, 0)) != PLUS
4933 || XEXP (XEXP (vloc, 0), 0) != cfa_base_rtx
4934 || !CONST_INT_P (XEXP (XEXP (vloc, 0), 1))))
4937 enum machine_mode address_mode = get_address_mode (mloc);
4939 = cselib_lookup (XEXP (mloc, 0), address_mode, 0);
4941 if (val && !cselib_preserved_value_p (val))
4943 micro_operation moa;
4944 preserve_value (val);
4945 mloc = cselib_subst_to_values (XEXP (mloc, 0));
4946 moa.type = MO_VAL_USE;
4947 moa.insn = cui->insn;
4948 moa.u.loc = gen_rtx_CONCAT (address_mode,
4949 val->val_rtx, mloc);
4950 if (dump_file && (dump_flags & TDF_DETAILS))
4951 log_op_type (moa.u.loc, cui->bb, cui->insn,
4952 moa.type, dump_file);
4953 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, &moa);
4957 if (CONSTANT_P (vloc)
4958 && (GET_CODE (vloc) != CONST
4959 || for_each_rtx (&vloc, non_suitable_const, NULL)))
4960 /* For constants don't look up any value. */;
4961 else if (!VAR_LOC_UNKNOWN_P (vloc)
4962 && (val = find_use_val (vloc, GET_MODE (oloc), cui)))
4964 enum machine_mode mode2;
4965 enum micro_operation_type type2;
4966 rtx nloc = replace_expr_with_values (vloc);
4970 oloc = shallow_copy_rtx (oloc);
4971 PAT_VAR_LOCATION_LOC (oloc) = nloc;
4974 oloc = gen_rtx_CONCAT (mode, val->val_rtx, oloc);
4976 type2 = use_type (vloc, 0, &mode2);
4978 gcc_assert (type2 == MO_USE || type2 == MO_USE_NO_VAR
4979 || type2 == MO_CLOBBER);
4981 if (type2 == MO_CLOBBER
4982 && !cselib_preserved_value_p (val))
4984 VAL_NEEDS_RESOLUTION (oloc) = 1;
4985 preserve_value (val);
4988 else if (!VAR_LOC_UNKNOWN_P (vloc))
4990 oloc = shallow_copy_rtx (oloc);
4991 PAT_VAR_LOCATION_LOC (oloc) = gen_rtx_UNKNOWN_VAR_LOC ();
4996 else if (type == MO_VAL_USE)
4998 enum machine_mode mode2 = VOIDmode;
4999 enum micro_operation_type type2;
5000 cselib_val *val = find_use_val (loc, GET_MODE (loc), cui);
5001 rtx vloc, oloc = loc, nloc;
5003 gcc_assert (cui->sets);
5006 && !REG_P (XEXP (oloc, 0))
5007 && !MEM_P (XEXP (oloc, 0))
5008 && (GET_CODE (XEXP (oloc, 0)) != PLUS
5009 || XEXP (XEXP (oloc, 0), 0) != cfa_base_rtx
5010 || !CONST_INT_P (XEXP (XEXP (oloc, 0), 1))))
5013 enum machine_mode address_mode = get_address_mode (mloc);
5015 = cselib_lookup (XEXP (mloc, 0), address_mode, 0);
5017 if (val && !cselib_preserved_value_p (val))
5019 micro_operation moa;
5020 preserve_value (val);
5021 mloc = cselib_subst_to_values (XEXP (mloc, 0));
5022 moa.type = MO_VAL_USE;
5023 moa.insn = cui->insn;
5024 moa.u.loc = gen_rtx_CONCAT (address_mode,
5025 val->val_rtx, mloc);
5026 if (dump_file && (dump_flags & TDF_DETAILS))
5027 log_op_type (moa.u.loc, cui->bb, cui->insn,
5028 moa.type, dump_file);
5029 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, &moa);
5033 type2 = use_type (loc, 0, &mode2);
5035 gcc_assert (type2 == MO_USE || type2 == MO_USE_NO_VAR
5036 || type2 == MO_CLOBBER);
5038 if (type2 == MO_USE)
5039 vloc = var_lowpart (mode2, loc);
5043 /* The loc of a MO_VAL_USE may have two forms:
5045 (concat val src): val is at src, a value-based
5048 (concat (concat val use) src): same as above, with use as
5049 the MO_USE tracked value, if it differs from src.
5053 nloc = replace_expr_with_values (loc);
5058 oloc = gen_rtx_CONCAT (mode2, val->val_rtx, vloc);
5060 oloc = val->val_rtx;
5062 mo.u.loc = gen_rtx_CONCAT (mode, oloc, nloc);
5064 if (type2 == MO_USE)
5065 VAL_HOLDS_TRACK_EXPR (mo.u.loc) = 1;
5066 if (!cselib_preserved_value_p (val))
5068 VAL_NEEDS_RESOLUTION (mo.u.loc) = 1;
5069 preserve_value (val);
5073 gcc_assert (type == MO_USE || type == MO_USE_NO_VAR);
5075 if (dump_file && (dump_flags & TDF_DETAILS))
5076 log_op_type (mo.u.loc, cui->bb, cui->insn, mo.type, dump_file);
5077 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, &mo);
5083 /* Helper function for finding all uses of REG/MEM in X in insn INSN. */
5086 add_uses_1 (rtx *x, void *cui)
5088 for_each_rtx (x, add_uses, cui);
5091 /* Attempt to reverse the EXPR operation in the debug info. Say for
5092 reg1 = reg2 + 6 even when reg2 is no longer live we
5093 can express its value as VAL - 6. */
5096 reverse_op (rtx val, const_rtx expr)
5102 if (GET_CODE (expr) != SET)
5105 if (!REG_P (SET_DEST (expr)) || GET_MODE (val) != GET_MODE (SET_DEST (expr)))
5108 src = SET_SRC (expr);
5109 switch (GET_CODE (src))
5123 if (!REG_P (XEXP (src, 0)) || !SCALAR_INT_MODE_P (GET_MODE (src)))
5126 v = cselib_lookup (XEXP (src, 0), GET_MODE (XEXP (src, 0)), 0);
5127 if (!v || !cselib_preserved_value_p (v))
5130 switch (GET_CODE (src))
5134 if (GET_MODE (v->val_rtx) != GET_MODE (val))
5136 ret = gen_rtx_fmt_e (GET_CODE (src), GET_MODE (val), val);
5140 ret = gen_lowpart_SUBREG (GET_MODE (v->val_rtx), val);
5152 if (GET_MODE (v->val_rtx) != GET_MODE (val))
5154 arg = XEXP (src, 1);
5155 if (!CONST_INT_P (arg) && GET_CODE (arg) != SYMBOL_REF)
5157 arg = cselib_expand_value_rtx (arg, scratch_regs, 5);
5158 if (arg == NULL_RTX)
5160 if (!CONST_INT_P (arg) && GET_CODE (arg) != SYMBOL_REF)
5163 ret = simplify_gen_binary (code, GET_MODE (val), val, arg);
5165 /* Ensure ret isn't VALUE itself (which can happen e.g. for
5166 (plus (reg1) (reg2)) when reg2 is known to be 0), as that
5167 breaks a lot of routines during var-tracking. */
5168 ret = gen_rtx_fmt_ee (PLUS, GET_MODE (val), val, const0_rtx);
5174 return gen_rtx_CONCAT (GET_MODE (v->val_rtx), v->val_rtx, ret);
5177 /* Add stores (register and memory references) LOC which will be tracked
5178 to VTI (bb)->mos. EXPR is the RTL expression containing the store.
5179 CUIP->insn is instruction which the LOC is part of. */
5182 add_stores (rtx loc, const_rtx expr, void *cuip)
5184 enum machine_mode mode = VOIDmode, mode2;
5185 struct count_use_info *cui = (struct count_use_info *)cuip;
5186 basic_block bb = cui->bb;
5188 rtx oloc = loc, nloc, src = NULL;
5189 enum micro_operation_type type = use_type (loc, cui, &mode);
5190 bool track_p = false;
5192 bool resolve, preserve;
5195 if (type == MO_CLOBBER)
5202 gcc_assert (loc != cfa_base_rtx);
5203 if ((GET_CODE (expr) == CLOBBER && type != MO_VAL_SET)
5204 || !(track_p = use_type (loc, NULL, &mode2) == MO_USE)
5205 || GET_CODE (expr) == CLOBBER)
5207 mo.type = MO_CLOBBER;
5212 if (GET_CODE (expr) == SET && SET_DEST (expr) == loc)
5213 src = var_lowpart (mode2, SET_SRC (expr));
5214 loc = var_lowpart (mode2, loc);
5223 rtx xexpr = gen_rtx_SET (VOIDmode, loc, src);
5224 if (same_variable_part_p (src, REG_EXPR (loc), REG_OFFSET (loc)))
5231 mo.insn = cui->insn;
5233 else if (MEM_P (loc)
5234 && ((track_p = use_type (loc, NULL, &mode2) == MO_USE)
5237 if (MEM_P (loc) && type == MO_VAL_SET
5238 && !REG_P (XEXP (loc, 0))
5239 && !MEM_P (XEXP (loc, 0))
5240 && (GET_CODE (XEXP (loc, 0)) != PLUS
5241 || XEXP (XEXP (loc, 0), 0) != cfa_base_rtx
5242 || !CONST_INT_P (XEXP (XEXP (loc, 0), 1))))
5245 enum machine_mode address_mode = get_address_mode (mloc);
5246 cselib_val *val = cselib_lookup (XEXP (mloc, 0),
5249 if (val && !cselib_preserved_value_p (val))
5251 preserve_value (val);
5252 mo.type = MO_VAL_USE;
5253 mloc = cselib_subst_to_values (XEXP (mloc, 0));
5254 mo.u.loc = gen_rtx_CONCAT (address_mode, val->val_rtx, mloc);
5255 mo.insn = cui->insn;
5256 if (dump_file && (dump_flags & TDF_DETAILS))
5257 log_op_type (mo.u.loc, cui->bb, cui->insn,
5258 mo.type, dump_file);
5259 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, &mo);
5263 if (GET_CODE (expr) == CLOBBER || !track_p)
5265 mo.type = MO_CLOBBER;
5266 mo.u.loc = track_p ? var_lowpart (mode2, loc) : loc;
5270 if (GET_CODE (expr) == SET && SET_DEST (expr) == loc)
5271 src = var_lowpart (mode2, SET_SRC (expr));
5272 loc = var_lowpart (mode2, loc);
5281 rtx xexpr = gen_rtx_SET (VOIDmode, loc, src);
5282 if (same_variable_part_p (SET_SRC (xexpr),
5284 INT_MEM_OFFSET (loc)))
5291 mo.insn = cui->insn;
5296 if (type != MO_VAL_SET)
5297 goto log_and_return;
5299 v = find_use_val (oloc, mode, cui);
5302 goto log_and_return;
5304 resolve = preserve = !cselib_preserved_value_p (v);
5306 nloc = replace_expr_with_values (oloc);
5310 if (GET_CODE (PATTERN (cui->insn)) == COND_EXEC)
5312 cselib_val *oval = cselib_lookup (oloc, GET_MODE (oloc), 0);
5314 gcc_assert (oval != v);
5315 gcc_assert (REG_P (oloc) || MEM_P (oloc));
5317 if (!cselib_preserved_value_p (oval))
5319 micro_operation moa;
5321 preserve_value (oval);
5323 moa.type = MO_VAL_USE;
5324 moa.u.loc = gen_rtx_CONCAT (mode, oval->val_rtx, oloc);
5325 VAL_NEEDS_RESOLUTION (moa.u.loc) = 1;
5326 moa.insn = cui->insn;
5328 if (dump_file && (dump_flags & TDF_DETAILS))
5329 log_op_type (moa.u.loc, cui->bb, cui->insn,
5330 moa.type, dump_file);
5331 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, &moa);
5336 else if (resolve && GET_CODE (mo.u.loc) == SET)
5338 nloc = replace_expr_with_values (SET_SRC (expr));
5340 /* Avoid the mode mismatch between oexpr and expr. */
5341 if (!nloc && mode != mode2)
5343 nloc = SET_SRC (expr);
5344 gcc_assert (oloc == SET_DEST (expr));
5348 oloc = gen_rtx_SET (GET_MODE (mo.u.loc), oloc, nloc);
5351 if (oloc == SET_DEST (mo.u.loc))
5352 /* No point in duplicating. */
5354 if (!REG_P (SET_SRC (mo.u.loc)))
5360 if (GET_CODE (mo.u.loc) == SET
5361 && oloc == SET_DEST (mo.u.loc))
5362 /* No point in duplicating. */
5368 loc = gen_rtx_CONCAT (mode, v->val_rtx, oloc);
5370 if (mo.u.loc != oloc)
5371 loc = gen_rtx_CONCAT (GET_MODE (mo.u.loc), loc, mo.u.loc);
5373 /* The loc of a MO_VAL_SET may have various forms:
5375 (concat val dst): dst now holds val
5377 (concat val (set dst src)): dst now holds val, copied from src
5379 (concat (concat val dstv) dst): dst now holds val; dstv is dst
5380 after replacing mems and non-top-level regs with values.
5382 (concat (concat val dstv) (set dst src)): dst now holds val,
5383 copied from src. dstv is a value-based representation of dst, if
5384 it differs from dst. If resolution is needed, src is a REG, and
5385 its mode is the same as that of val.
5387 (concat (concat val (set dstv srcv)) (set dst src)): src
5388 copied to dst, holding val. dstv and srcv are value-based
5389 representations of dst and src, respectively.
5393 if (GET_CODE (PATTERN (cui->insn)) != COND_EXEC)
5395 reverse = reverse_op (v->val_rtx, expr);
5398 loc = gen_rtx_CONCAT (GET_MODE (mo.u.loc), loc, reverse);
5399 VAL_EXPR_HAS_REVERSE (loc) = 1;
5406 VAL_HOLDS_TRACK_EXPR (loc) = 1;
5409 VAL_NEEDS_RESOLUTION (loc) = resolve;
5412 if (mo.type == MO_CLOBBER)
5413 VAL_EXPR_IS_CLOBBERED (loc) = 1;
5414 if (mo.type == MO_COPY)
5415 VAL_EXPR_IS_COPIED (loc) = 1;
5417 mo.type = MO_VAL_SET;
5420 if (dump_file && (dump_flags & TDF_DETAILS))
5421 log_op_type (mo.u.loc, cui->bb, cui->insn, mo.type, dump_file);
5422 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, &mo);
5425 /* Callback for cselib_record_sets_hook, that records as micro
5426 operations uses and stores in an insn after cselib_record_sets has
5427 analyzed the sets in an insn, but before it modifies the stored
5428 values in the internal tables, unless cselib_record_sets doesn't
5429 call it directly (perhaps because we're not doing cselib in the
5430 first place, in which case sets and n_sets will be 0). */
5433 add_with_sets (rtx insn, struct cselib_set *sets, int n_sets)
5435 basic_block bb = BLOCK_FOR_INSN (insn);
5437 struct count_use_info cui;
5438 micro_operation *mos;
5440 cselib_hook_called = true;
5445 cui.n_sets = n_sets;
5447 n1 = VEC_length (micro_operation, VTI (bb)->mos);
5448 cui.store_p = false;
5449 note_uses (&PATTERN (insn), add_uses_1, &cui);
5450 n2 = VEC_length (micro_operation, VTI (bb)->mos) - 1;
5451 mos = VEC_address (micro_operation, VTI (bb)->mos);
5453 /* Order the MO_USEs to be before MO_USE_NO_VARs and MO_VAL_USE, and
5457 while (n1 < n2 && mos[n1].type == MO_USE)
5459 while (n1 < n2 && mos[n2].type != MO_USE)
5471 n2 = VEC_length (micro_operation, VTI (bb)->mos) - 1;
5474 while (n1 < n2 && mos[n1].type != MO_VAL_LOC)
5476 while (n1 < n2 && mos[n2].type == MO_VAL_LOC)
5494 mo.u.loc = NULL_RTX;
5496 if (dump_file && (dump_flags & TDF_DETAILS))
5497 log_op_type (PATTERN (insn), bb, insn, mo.type, dump_file);
5498 VEC_safe_push (micro_operation, heap, VTI (bb)->mos, &mo);
5501 n1 = VEC_length (micro_operation, VTI (bb)->mos);
5502 /* This will record NEXT_INSN (insn), such that we can
5503 insert notes before it without worrying about any
5504 notes that MO_USEs might emit after the insn. */
5506 note_stores (PATTERN (insn), add_stores, &cui);
5507 n2 = VEC_length (micro_operation, VTI (bb)->mos) - 1;
5508 mos = VEC_address (micro_operation, VTI (bb)->mos);
5510 /* Order the MO_VAL_USEs first (note_stores does nothing
5511 on DEBUG_INSNs, so there are no MO_VAL_LOCs from this
5512 insn), then MO_CLOBBERs, then MO_SET/MO_COPY/MO_VAL_SET. */
5515 while (n1 < n2 && mos[n1].type == MO_VAL_USE)
5517 while (n1 < n2 && mos[n2].type != MO_VAL_USE)
5529 n2 = VEC_length (micro_operation, VTI (bb)->mos) - 1;
5532 while (n1 < n2 && mos[n1].type == MO_CLOBBER)
5534 while (n1 < n2 && mos[n2].type != MO_CLOBBER)
5547 static enum var_init_status
5548 find_src_status (dataflow_set *in, rtx src)
5550 tree decl = NULL_TREE;
5551 enum var_init_status status = VAR_INIT_STATUS_UNINITIALIZED;
5553 if (! flag_var_tracking_uninit)
5554 status = VAR_INIT_STATUS_INITIALIZED;
5556 if (src && REG_P (src))
5557 decl = var_debug_decl (REG_EXPR (src));
5558 else if (src && MEM_P (src))
5559 decl = var_debug_decl (MEM_EXPR (src));
5562 status = get_init_value (in, src, dv_from_decl (decl));
5567 /* SRC is the source of an assignment. Use SET to try to find what
5568 was ultimately assigned to SRC. Return that value if known,
5569 otherwise return SRC itself. */
5572 find_src_set_src (dataflow_set *set, rtx src)
5574 tree decl = NULL_TREE; /* The variable being copied around. */
5575 rtx set_src = NULL_RTX; /* The value for "decl" stored in "src". */
5577 location_chain nextp;
5581 if (src && REG_P (src))
5582 decl = var_debug_decl (REG_EXPR (src));
5583 else if (src && MEM_P (src))
5584 decl = var_debug_decl (MEM_EXPR (src));
5588 decl_or_value dv = dv_from_decl (decl);
5590 var = shared_hash_find (set->vars, dv);
5594 for (i = 0; i < var->n_var_parts && !found; i++)
5595 for (nextp = var->var_part[i].loc_chain; nextp && !found;
5596 nextp = nextp->next)
5597 if (rtx_equal_p (nextp->loc, src))
5599 set_src = nextp->set_src;
5609 /* Compute the changes of variable locations in the basic block BB. */
5612 compute_bb_dataflow (basic_block bb)
5615 micro_operation *mo;
5617 dataflow_set old_out;
5618 dataflow_set *in = &VTI (bb)->in;
5619 dataflow_set *out = &VTI (bb)->out;
5621 dataflow_set_init (&old_out);
5622 dataflow_set_copy (&old_out, out);
5623 dataflow_set_copy (out, in);
5625 for (i = 0; VEC_iterate (micro_operation, VTI (bb)->mos, i, mo); i++)
5627 rtx insn = mo->insn;
5632 dataflow_set_clear_at_call (out);
5637 rtx loc = mo->u.loc;
5640 var_reg_set (out, loc, VAR_INIT_STATUS_UNINITIALIZED, NULL);
5641 else if (MEM_P (loc))
5642 var_mem_set (out, loc, VAR_INIT_STATUS_UNINITIALIZED, NULL);
5648 rtx loc = mo->u.loc;
5652 if (GET_CODE (loc) == CONCAT)
5654 val = XEXP (loc, 0);
5655 vloc = XEXP (loc, 1);
5663 var = PAT_VAR_LOCATION_DECL (vloc);
5665 clobber_variable_part (out, NULL_RTX,
5666 dv_from_decl (var), 0, NULL_RTX);
5669 if (VAL_NEEDS_RESOLUTION (loc))
5670 val_resolve (out, val, PAT_VAR_LOCATION_LOC (vloc), insn);
5671 set_variable_part (out, val, dv_from_decl (var), 0,
5672 VAR_INIT_STATUS_INITIALIZED, NULL_RTX,
5675 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc)))
5676 set_variable_part (out, PAT_VAR_LOCATION_LOC (vloc),
5677 dv_from_decl (var), 0,
5678 VAR_INIT_STATUS_INITIALIZED, NULL_RTX,
5685 rtx loc = mo->u.loc;
5686 rtx val, vloc, uloc;
5688 vloc = uloc = XEXP (loc, 1);
5689 val = XEXP (loc, 0);
5691 if (GET_CODE (val) == CONCAT)
5693 uloc = XEXP (val, 1);
5694 val = XEXP (val, 0);
5697 if (VAL_NEEDS_RESOLUTION (loc))
5698 val_resolve (out, val, vloc, insn);
5700 val_store (out, val, uloc, insn, false);
5702 if (VAL_HOLDS_TRACK_EXPR (loc))
5704 if (GET_CODE (uloc) == REG)
5705 var_reg_set (out, uloc, VAR_INIT_STATUS_UNINITIALIZED,
5707 else if (GET_CODE (uloc) == MEM)
5708 var_mem_set (out, uloc, VAR_INIT_STATUS_UNINITIALIZED,
5716 rtx loc = mo->u.loc;
5717 rtx val, vloc, uloc, reverse = NULL_RTX;
5720 if (VAL_EXPR_HAS_REVERSE (loc))
5722 reverse = XEXP (loc, 1);
5723 vloc = XEXP (loc, 0);
5725 uloc = XEXP (vloc, 1);
5726 val = XEXP (vloc, 0);
5729 if (GET_CODE (val) == CONCAT)
5731 vloc = XEXP (val, 1);
5732 val = XEXP (val, 0);
5735 if (GET_CODE (vloc) == SET)
5737 rtx vsrc = SET_SRC (vloc);
5739 gcc_assert (val != vsrc);
5740 gcc_assert (vloc == uloc || VAL_NEEDS_RESOLUTION (loc));
5742 vloc = SET_DEST (vloc);
5744 if (VAL_NEEDS_RESOLUTION (loc))
5745 val_resolve (out, val, vsrc, insn);
5747 else if (VAL_NEEDS_RESOLUTION (loc))
5749 gcc_assert (GET_CODE (uloc) == SET
5750 && GET_CODE (SET_SRC (uloc)) == REG);
5751 val_resolve (out, val, SET_SRC (uloc), insn);
5754 if (VAL_HOLDS_TRACK_EXPR (loc))
5756 if (VAL_EXPR_IS_CLOBBERED (loc))
5759 var_reg_delete (out, uloc, true);
5760 else if (MEM_P (uloc))
5761 var_mem_delete (out, uloc, true);
5765 bool copied_p = VAL_EXPR_IS_COPIED (loc);
5767 enum var_init_status status = VAR_INIT_STATUS_INITIALIZED;
5769 if (GET_CODE (uloc) == SET)
5771 set_src = SET_SRC (uloc);
5772 uloc = SET_DEST (uloc);
5777 if (flag_var_tracking_uninit)
5779 status = find_src_status (in, set_src);
5781 if (status == VAR_INIT_STATUS_UNKNOWN)
5782 status = find_src_status (out, set_src);
5785 set_src = find_src_set_src (in, set_src);
5789 var_reg_delete_and_set (out, uloc, !copied_p,
5791 else if (MEM_P (uloc))
5792 var_mem_delete_and_set (out, uloc, !copied_p,
5796 else if (REG_P (uloc))
5797 var_regno_delete (out, REGNO (uloc));
5799 val_store (out, val, vloc, insn, true);
5802 val_store (out, XEXP (reverse, 0), XEXP (reverse, 1),
5809 rtx loc = mo->u.loc;
5812 if (GET_CODE (loc) == SET)
5814 set_src = SET_SRC (loc);
5815 loc = SET_DEST (loc);
5819 var_reg_delete_and_set (out, loc, true, VAR_INIT_STATUS_INITIALIZED,
5821 else if (MEM_P (loc))
5822 var_mem_delete_and_set (out, loc, true, VAR_INIT_STATUS_INITIALIZED,
5829 rtx loc = mo->u.loc;
5830 enum var_init_status src_status;
5833 if (GET_CODE (loc) == SET)
5835 set_src = SET_SRC (loc);
5836 loc = SET_DEST (loc);
5839 if (! flag_var_tracking_uninit)
5840 src_status = VAR_INIT_STATUS_INITIALIZED;
5843 src_status = find_src_status (in, set_src);
5845 if (src_status == VAR_INIT_STATUS_UNKNOWN)
5846 src_status = find_src_status (out, set_src);
5849 set_src = find_src_set_src (in, set_src);
5852 var_reg_delete_and_set (out, loc, false, src_status, set_src);
5853 else if (MEM_P (loc))
5854 var_mem_delete_and_set (out, loc, false, src_status, set_src);
5860 rtx loc = mo->u.loc;
5863 var_reg_delete (out, loc, false);
5864 else if (MEM_P (loc))
5865 var_mem_delete (out, loc, false);
5871 rtx loc = mo->u.loc;
5874 var_reg_delete (out, loc, true);
5875 else if (MEM_P (loc))
5876 var_mem_delete (out, loc, true);
5881 out->stack_adjust += mo->u.adjust;
5886 if (MAY_HAVE_DEBUG_INSNS)
5888 dataflow_set_equiv_regs (out);
5889 htab_traverse (shared_hash_htab (out->vars), canonicalize_values_mark,
5891 htab_traverse (shared_hash_htab (out->vars), canonicalize_values_star,
5894 htab_traverse (shared_hash_htab (out->vars),
5895 canonicalize_loc_order_check, out);
5898 changed = dataflow_set_different (&old_out, out);
5899 dataflow_set_destroy (&old_out);
5903 /* Find the locations of variables in the whole function. */
5906 vt_find_locations (void)
5908 fibheap_t worklist, pending, fibheap_swap;
5909 sbitmap visited, in_worklist, in_pending, sbitmap_swap;
5916 int htabmax = PARAM_VALUE (PARAM_MAX_VARTRACK_SIZE);
5917 bool success = true;
5919 /* Compute reverse completion order of depth first search of the CFG
5920 so that the data-flow runs faster. */
5921 rc_order = XNEWVEC (int, n_basic_blocks - NUM_FIXED_BLOCKS);
5922 bb_order = XNEWVEC (int, last_basic_block);
5923 pre_and_rev_post_order_compute (NULL, rc_order, false);
5924 for (i = 0; i < n_basic_blocks - NUM_FIXED_BLOCKS; i++)
5925 bb_order[rc_order[i]] = i;
5928 worklist = fibheap_new ();
5929 pending = fibheap_new ();
5930 visited = sbitmap_alloc (last_basic_block);
5931 in_worklist = sbitmap_alloc (last_basic_block);
5932 in_pending = sbitmap_alloc (last_basic_block);
5933 sbitmap_zero (in_worklist);
5936 fibheap_insert (pending, bb_order[bb->index], bb);
5937 sbitmap_ones (in_pending);
5939 while (success && !fibheap_empty (pending))
5941 fibheap_swap = pending;
5943 worklist = fibheap_swap;
5944 sbitmap_swap = in_pending;
5945 in_pending = in_worklist;
5946 in_worklist = sbitmap_swap;
5948 sbitmap_zero (visited);
5950 while (!fibheap_empty (worklist))
5952 bb = (basic_block) fibheap_extract_min (worklist);
5953 RESET_BIT (in_worklist, bb->index);
5954 if (!TEST_BIT (visited, bb->index))
5958 int oldinsz, oldoutsz;
5960 SET_BIT (visited, bb->index);
5962 if (VTI (bb)->in.vars)
5965 -= (htab_size (shared_hash_htab (VTI (bb)->in.vars))
5966 + htab_size (shared_hash_htab (VTI (bb)->out.vars)));
5968 = htab_elements (shared_hash_htab (VTI (bb)->in.vars));
5970 = htab_elements (shared_hash_htab (VTI (bb)->out.vars));
5973 oldinsz = oldoutsz = 0;
5975 if (MAY_HAVE_DEBUG_INSNS)
5977 dataflow_set *in = &VTI (bb)->in, *first_out = NULL;
5978 bool first = true, adjust = false;
5980 /* Calculate the IN set as the intersection of
5981 predecessor OUT sets. */
5983 dataflow_set_clear (in);
5984 dst_can_be_shared = true;
5986 FOR_EACH_EDGE (e, ei, bb->preds)
5987 if (!VTI (e->src)->flooded)
5988 gcc_assert (bb_order[bb->index]
5989 <= bb_order[e->src->index]);
5992 dataflow_set_copy (in, &VTI (e->src)->out);
5993 first_out = &VTI (e->src)->out;
5998 dataflow_set_merge (in, &VTI (e->src)->out);
6004 dataflow_post_merge_adjust (in, &VTI (bb)->permp);
6006 /* Merge and merge_adjust should keep entries in
6008 htab_traverse (shared_hash_htab (in->vars),
6009 canonicalize_loc_order_check,
6012 if (dst_can_be_shared)
6014 shared_hash_destroy (in->vars);
6015 in->vars = shared_hash_copy (first_out->vars);
6019 VTI (bb)->flooded = true;
6023 /* Calculate the IN set as union of predecessor OUT sets. */
6024 dataflow_set_clear (&VTI (bb)->in);
6025 FOR_EACH_EDGE (e, ei, bb->preds)
6026 dataflow_set_union (&VTI (bb)->in, &VTI (e->src)->out);
6029 changed = compute_bb_dataflow (bb);
6030 htabsz += (htab_size (shared_hash_htab (VTI (bb)->in.vars))
6031 + htab_size (shared_hash_htab (VTI (bb)->out.vars)));
6033 if (htabmax && htabsz > htabmax)
6035 if (MAY_HAVE_DEBUG_INSNS)
6036 inform (DECL_SOURCE_LOCATION (cfun->decl),
6037 "variable tracking size limit exceeded with "
6038 "-fvar-tracking-assignments, retrying without");
6040 inform (DECL_SOURCE_LOCATION (cfun->decl),
6041 "variable tracking size limit exceeded");
6048 FOR_EACH_EDGE (e, ei, bb->succs)
6050 if (e->dest == EXIT_BLOCK_PTR)
6053 if (TEST_BIT (visited, e->dest->index))
6055 if (!TEST_BIT (in_pending, e->dest->index))
6057 /* Send E->DEST to next round. */
6058 SET_BIT (in_pending, e->dest->index);
6059 fibheap_insert (pending,
6060 bb_order[e->dest->index],
6064 else if (!TEST_BIT (in_worklist, e->dest->index))
6066 /* Add E->DEST to current round. */
6067 SET_BIT (in_worklist, e->dest->index);
6068 fibheap_insert (worklist, bb_order[e->dest->index],
6076 "BB %i: in %i (was %i), out %i (was %i), rem %i + %i, tsz %i\n",
6078 (int)htab_elements (shared_hash_htab (VTI (bb)->in.vars)),
6080 (int)htab_elements (shared_hash_htab (VTI (bb)->out.vars)),
6082 (int)worklist->nodes, (int)pending->nodes, htabsz);
6084 if (dump_file && (dump_flags & TDF_DETAILS))
6086 fprintf (dump_file, "BB %i IN:\n", bb->index);
6087 dump_dataflow_set (&VTI (bb)->in);
6088 fprintf (dump_file, "BB %i OUT:\n", bb->index);
6089 dump_dataflow_set (&VTI (bb)->out);
6095 if (success && MAY_HAVE_DEBUG_INSNS)
6097 gcc_assert (VTI (bb)->flooded);
6100 fibheap_delete (worklist);
6101 fibheap_delete (pending);
6102 sbitmap_free (visited);
6103 sbitmap_free (in_worklist);
6104 sbitmap_free (in_pending);
6109 /* Print the content of the LIST to dump file. */
6112 dump_attrs_list (attrs list)
6114 for (; list; list = list->next)
6116 if (dv_is_decl_p (list->dv))
6117 print_mem_expr (dump_file, dv_as_decl (list->dv));
6119 print_rtl_single (dump_file, dv_as_value (list->dv));
6120 fprintf (dump_file, "+" HOST_WIDE_INT_PRINT_DEC, list->offset);
6122 fprintf (dump_file, "\n");
6125 /* Print the information about variable *SLOT to dump file. */
6128 dump_var_slot (void **slot, void *data ATTRIBUTE_UNUSED)
6130 variable var = (variable) *slot;
6134 /* Continue traversing the hash table. */
6138 /* Print the information about variable VAR to dump file. */
6141 dump_var (variable var)
6144 location_chain node;
6146 if (dv_is_decl_p (var->dv))
6148 const_tree decl = dv_as_decl (var->dv);
6150 if (DECL_NAME (decl))
6152 fprintf (dump_file, " name: %s",
6153 IDENTIFIER_POINTER (DECL_NAME (decl)));
6154 if (dump_flags & TDF_UID)
6155 fprintf (dump_file, "D.%u", DECL_UID (decl));
6157 else if (TREE_CODE (decl) == DEBUG_EXPR_DECL)
6158 fprintf (dump_file, " name: D#%u", DEBUG_TEMP_UID (decl));
6160 fprintf (dump_file, " name: D.%u", DECL_UID (decl));
6161 fprintf (dump_file, "\n");
6165 fputc (' ', dump_file);
6166 print_rtl_single (dump_file, dv_as_value (var->dv));
6169 for (i = 0; i < var->n_var_parts; i++)
6171 fprintf (dump_file, " offset %ld\n",
6172 (long) var->var_part[i].offset);
6173 for (node = var->var_part[i].loc_chain; node; node = node->next)
6175 fprintf (dump_file, " ");
6176 if (node->init == VAR_INIT_STATUS_UNINITIALIZED)
6177 fprintf (dump_file, "[uninit]");
6178 print_rtl_single (dump_file, node->loc);
6183 /* Print the information about variables from hash table VARS to dump file. */
6186 dump_vars (htab_t vars)
6188 if (htab_elements (vars) > 0)
6190 fprintf (dump_file, "Variables:\n");
6191 htab_traverse (vars, dump_var_slot, NULL);
6195 /* Print the dataflow set SET to dump file. */
6198 dump_dataflow_set (dataflow_set *set)
6202 fprintf (dump_file, "Stack adjustment: " HOST_WIDE_INT_PRINT_DEC "\n",
6204 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
6208 fprintf (dump_file, "Reg %d:", i);
6209 dump_attrs_list (set->regs[i]);
6212 dump_vars (shared_hash_htab (set->vars));
6213 fprintf (dump_file, "\n");
6216 /* Print the IN and OUT sets for each basic block to dump file. */
6219 dump_dataflow_sets (void)
6225 fprintf (dump_file, "\nBasic block %d:\n", bb->index);
6226 fprintf (dump_file, "IN:\n");
6227 dump_dataflow_set (&VTI (bb)->in);
6228 fprintf (dump_file, "OUT:\n");
6229 dump_dataflow_set (&VTI (bb)->out);
6233 /* Add variable VAR to the hash table of changed variables and
6234 if it has no locations delete it from SET's hash table. */
6237 variable_was_changed (variable var, dataflow_set *set)
6239 hashval_t hash = dv_htab_hash (var->dv);
6244 bool old_cur_loc_changed = false;
6246 /* Remember this decl or VALUE has been added to changed_variables. */
6247 set_dv_changed (var->dv, true);
6249 slot = htab_find_slot_with_hash (changed_variables,
6255 variable old_var = (variable) *slot;
6256 gcc_assert (old_var->in_changed_variables);
6257 old_var->in_changed_variables = false;
6258 old_cur_loc_changed = old_var->cur_loc_changed;
6259 variable_htab_free (*slot);
6261 if (set && var->n_var_parts == 0)
6265 empty_var = (variable) pool_alloc (dv_pool (var->dv));
6266 empty_var->dv = var->dv;
6267 empty_var->refcount = 1;
6268 empty_var->n_var_parts = 0;
6269 empty_var->cur_loc_changed = true;
6270 empty_var->in_changed_variables = true;
6277 var->in_changed_variables = true;
6278 /* If within processing one uop a variable is deleted
6279 and then readded, we need to assume it has changed. */
6280 if (old_cur_loc_changed)
6281 var->cur_loc_changed = true;
6288 if (var->n_var_parts == 0)
6293 slot = shared_hash_find_slot_noinsert (set->vars, var->dv);
6296 if (shared_hash_shared (set->vars))
6297 slot = shared_hash_find_slot_unshare (&set->vars, var->dv,
6299 htab_clear_slot (shared_hash_htab (set->vars), slot);
6305 /* Look for the index in VAR->var_part corresponding to OFFSET.
6306 Return -1 if not found. If INSERTION_POINT is non-NULL, the
6307 referenced int will be set to the index that the part has or should
6308 have, if it should be inserted. */
6311 find_variable_location_part (variable var, HOST_WIDE_INT offset,
6312 int *insertion_point)
6316 /* Find the location part. */
6318 high = var->n_var_parts;
6321 pos = (low + high) / 2;
6322 if (var->var_part[pos].offset < offset)
6329 if (insertion_point)
6330 *insertion_point = pos;
6332 if (pos < var->n_var_parts && var->var_part[pos].offset == offset)
6339 set_slot_part (dataflow_set *set, rtx loc, void **slot,
6340 decl_or_value dv, HOST_WIDE_INT offset,
6341 enum var_init_status initialized, rtx set_src)
6344 location_chain node, next;
6345 location_chain *nextp;
6347 bool onepart = dv_onepart_p (dv);
6349 gcc_assert (offset == 0 || !onepart);
6350 gcc_assert (loc != dv_as_opaque (dv));
6352 var = (variable) *slot;
6354 if (! flag_var_tracking_uninit)
6355 initialized = VAR_INIT_STATUS_INITIALIZED;
6359 /* Create new variable information. */
6360 var = (variable) pool_alloc (dv_pool (dv));
6363 var->n_var_parts = 1;
6364 var->cur_loc_changed = false;
6365 var->in_changed_variables = false;
6366 var->var_part[0].offset = offset;
6367 var->var_part[0].loc_chain = NULL;
6368 var->var_part[0].cur_loc = NULL;
6371 nextp = &var->var_part[0].loc_chain;
6377 gcc_assert (dv_as_opaque (var->dv) == dv_as_opaque (dv));
6381 if (GET_CODE (loc) == VALUE)
6383 for (nextp = &var->var_part[0].loc_chain; (node = *nextp);
6384 nextp = &node->next)
6385 if (GET_CODE (node->loc) == VALUE)
6387 if (node->loc == loc)
6392 if (canon_value_cmp (node->loc, loc))
6400 else if (REG_P (node->loc) || MEM_P (node->loc))
6408 else if (REG_P (loc))
6410 for (nextp = &var->var_part[0].loc_chain; (node = *nextp);
6411 nextp = &node->next)
6412 if (REG_P (node->loc))
6414 if (REGNO (node->loc) < REGNO (loc))
6418 if (REGNO (node->loc) == REGNO (loc))
6431 else if (MEM_P (loc))
6433 for (nextp = &var->var_part[0].loc_chain; (node = *nextp);
6434 nextp = &node->next)
6435 if (REG_P (node->loc))
6437 else if (MEM_P (node->loc))
6439 if ((r = loc_cmp (XEXP (node->loc, 0), XEXP (loc, 0))) >= 0)
6451 for (nextp = &var->var_part[0].loc_chain; (node = *nextp);
6452 nextp = &node->next)
6453 if ((r = loc_cmp (node->loc, loc)) >= 0)
6461 if (shared_var_p (var, set->vars))
6463 slot = unshare_variable (set, slot, var, initialized);
6464 var = (variable)*slot;
6465 for (nextp = &var->var_part[0].loc_chain; c;
6466 nextp = &(*nextp)->next)
6468 gcc_assert ((!node && !*nextp) || node->loc == (*nextp)->loc);
6475 gcc_assert (dv_as_decl (var->dv) == dv_as_decl (dv));
6477 pos = find_variable_location_part (var, offset, &inspos);
6481 node = var->var_part[pos].loc_chain;
6484 && ((REG_P (node->loc) && REG_P (loc)
6485 && REGNO (node->loc) == REGNO (loc))
6486 || rtx_equal_p (node->loc, loc)))
6488 /* LOC is in the beginning of the chain so we have nothing
6490 if (node->init < initialized)
6491 node->init = initialized;
6492 if (set_src != NULL)
6493 node->set_src = set_src;
6499 /* We have to make a copy of a shared variable. */
6500 if (shared_var_p (var, set->vars))
6502 slot = unshare_variable (set, slot, var, initialized);
6503 var = (variable)*slot;
6509 /* We have not found the location part, new one will be created. */
6511 /* We have to make a copy of the shared variable. */
6512 if (shared_var_p (var, set->vars))
6514 slot = unshare_variable (set, slot, var, initialized);
6515 var = (variable)*slot;
6518 /* We track only variables whose size is <= MAX_VAR_PARTS bytes
6519 thus there are at most MAX_VAR_PARTS different offsets. */
6520 gcc_assert (var->n_var_parts < MAX_VAR_PARTS
6521 && (!var->n_var_parts || !dv_onepart_p (var->dv)));
6523 /* We have to move the elements of array starting at index
6524 inspos to the next position. */
6525 for (pos = var->n_var_parts; pos > inspos; pos--)
6526 var->var_part[pos] = var->var_part[pos - 1];
6529 var->var_part[pos].offset = offset;
6530 var->var_part[pos].loc_chain = NULL;
6531 var->var_part[pos].cur_loc = NULL;
6534 /* Delete the location from the list. */
6535 nextp = &var->var_part[pos].loc_chain;
6536 for (node = var->var_part[pos].loc_chain; node; node = next)
6539 if ((REG_P (node->loc) && REG_P (loc)
6540 && REGNO (node->loc) == REGNO (loc))
6541 || rtx_equal_p (node->loc, loc))
6543 /* Save these values, to assign to the new node, before
6544 deleting this one. */
6545 if (node->init > initialized)
6546 initialized = node->init;
6547 if (node->set_src != NULL && set_src == NULL)
6548 set_src = node->set_src;
6549 if (var->var_part[pos].cur_loc == node->loc)
6551 var->var_part[pos].cur_loc = NULL;
6552 var->cur_loc_changed = true;
6554 pool_free (loc_chain_pool, node);
6559 nextp = &node->next;
6562 nextp = &var->var_part[pos].loc_chain;
6565 /* Add the location to the beginning. */
6566 node = (location_chain) pool_alloc (loc_chain_pool);
6568 node->init = initialized;
6569 node->set_src = set_src;
6570 node->next = *nextp;
6573 if (onepart && emit_notes)
6574 add_value_chains (var->dv, loc);
6576 /* If no location was emitted do so. */
6577 if (var->var_part[pos].cur_loc == NULL)
6578 variable_was_changed (var, set);
6583 /* Set the part of variable's location in the dataflow set SET. The
6584 variable part is specified by variable's declaration in DV and
6585 offset OFFSET and the part's location by LOC. IOPT should be
6586 NO_INSERT if the variable is known to be in SET already and the
6587 variable hash table must not be resized, and INSERT otherwise. */
6590 set_variable_part (dataflow_set *set, rtx loc,
6591 decl_or_value dv, HOST_WIDE_INT offset,
6592 enum var_init_status initialized, rtx set_src,
6593 enum insert_option iopt)
6597 if (iopt == NO_INSERT)
6598 slot = shared_hash_find_slot_noinsert (set->vars, dv);
6601 slot = shared_hash_find_slot (set->vars, dv);
6603 slot = shared_hash_find_slot_unshare (&set->vars, dv, iopt);
6605 slot = set_slot_part (set, loc, slot, dv, offset, initialized, set_src);
6608 /* Remove all recorded register locations for the given variable part
6609 from dataflow set SET, except for those that are identical to loc.
6610 The variable part is specified by variable's declaration or value
6611 DV and offset OFFSET. */
6614 clobber_slot_part (dataflow_set *set, rtx loc, void **slot,
6615 HOST_WIDE_INT offset, rtx set_src)
6617 variable var = (variable) *slot;
6618 int pos = find_variable_location_part (var, offset, NULL);
6622 location_chain node, next;
6624 /* Remove the register locations from the dataflow set. */
6625 next = var->var_part[pos].loc_chain;
6626 for (node = next; node; node = next)
6629 if (node->loc != loc
6630 && (!flag_var_tracking_uninit
6633 || !rtx_equal_p (set_src, node->set_src)))
6635 if (REG_P (node->loc))
6640 /* Remove the variable part from the register's
6641 list, but preserve any other variable parts
6642 that might be regarded as live in that same
6644 anextp = &set->regs[REGNO (node->loc)];
6645 for (anode = *anextp; anode; anode = anext)
6647 anext = anode->next;
6648 if (dv_as_opaque (anode->dv) == dv_as_opaque (var->dv)
6649 && anode->offset == offset)
6651 pool_free (attrs_pool, anode);
6655 anextp = &anode->next;
6659 slot = delete_slot_part (set, node->loc, slot, offset);
6667 /* Remove all recorded register locations for the given variable part
6668 from dataflow set SET, except for those that are identical to loc.
6669 The variable part is specified by variable's declaration or value
6670 DV and offset OFFSET. */
6673 clobber_variable_part (dataflow_set *set, rtx loc, decl_or_value dv,
6674 HOST_WIDE_INT offset, rtx set_src)
6678 if (!dv_as_opaque (dv)
6679 || (!dv_is_value_p (dv) && ! DECL_P (dv_as_decl (dv))))
6682 slot = shared_hash_find_slot_noinsert (set->vars, dv);
6686 slot = clobber_slot_part (set, loc, slot, offset, set_src);
6689 /* Delete the part of variable's location from dataflow set SET. The
6690 variable part is specified by its SET->vars slot SLOT and offset
6691 OFFSET and the part's location by LOC. */
6694 delete_slot_part (dataflow_set *set, rtx loc, void **slot,
6695 HOST_WIDE_INT offset)
6697 variable var = (variable) *slot;
6698 int pos = find_variable_location_part (var, offset, NULL);
6702 location_chain node, next;
6703 location_chain *nextp;
6706 if (shared_var_p (var, set->vars))
6708 /* If the variable contains the location part we have to
6709 make a copy of the variable. */
6710 for (node = var->var_part[pos].loc_chain; node;
6713 if ((REG_P (node->loc) && REG_P (loc)
6714 && REGNO (node->loc) == REGNO (loc))
6715 || rtx_equal_p (node->loc, loc))
6717 slot = unshare_variable (set, slot, var,
6718 VAR_INIT_STATUS_UNKNOWN);
6719 var = (variable)*slot;
6725 /* Delete the location part. */
6727 nextp = &var->var_part[pos].loc_chain;
6728 for (node = *nextp; node; node = next)
6731 if ((REG_P (node->loc) && REG_P (loc)
6732 && REGNO (node->loc) == REGNO (loc))
6733 || rtx_equal_p (node->loc, loc))
6735 if (emit_notes && pos == 0 && dv_onepart_p (var->dv))
6736 remove_value_chains (var->dv, node->loc);
6737 /* If we have deleted the location which was last emitted
6738 we have to emit new location so add the variable to set
6739 of changed variables. */
6740 if (var->var_part[pos].cur_loc == node->loc)
6743 var->var_part[pos].cur_loc = NULL;
6744 var->cur_loc_changed = true;
6746 pool_free (loc_chain_pool, node);
6751 nextp = &node->next;
6754 if (var->var_part[pos].loc_chain == NULL)
6759 var->cur_loc_changed = true;
6760 while (pos < var->n_var_parts)
6762 var->var_part[pos] = var->var_part[pos + 1];
6767 variable_was_changed (var, set);
6773 /* Delete the part of variable's location from dataflow set SET. The
6774 variable part is specified by variable's declaration or value DV
6775 and offset OFFSET and the part's location by LOC. */
6778 delete_variable_part (dataflow_set *set, rtx loc, decl_or_value dv,
6779 HOST_WIDE_INT offset)
6781 void **slot = shared_hash_find_slot_noinsert (set->vars, dv);
6785 slot = delete_slot_part (set, loc, slot, offset);
6788 /* Structure for passing some other parameters to function
6789 vt_expand_loc_callback. */
6790 struct expand_loc_callback_data
6792 /* The variables and values active at this point. */
6795 /* True in vt_expand_loc_dummy calls, no rtl should be allocated.
6796 Non-NULL should be returned if vt_expand_loc would return
6797 non-NULL in that case, NULL otherwise. cur_loc_changed should be
6798 computed and cur_loc recomputed when possible (but just once
6799 per emit_notes_for_changes call). */
6802 /* True if expansion of subexpressions had to recompute some
6803 VALUE/DEBUG_EXPR_DECL's cur_loc or used a VALUE/DEBUG_EXPR_DECL
6804 whose cur_loc has been already recomputed during current
6805 emit_notes_for_changes call. */
6806 bool cur_loc_changed;
6809 /* Callback for cselib_expand_value, that looks for expressions
6810 holding the value in the var-tracking hash tables. Return X for
6811 standard processing, anything else is to be used as-is. */
6814 vt_expand_loc_callback (rtx x, bitmap regs, int max_depth, void *data)
6816 struct expand_loc_callback_data *elcd
6817 = (struct expand_loc_callback_data *) data;
6818 bool dummy = elcd->dummy;
6819 bool cur_loc_changed = elcd->cur_loc_changed;
6823 rtx result, subreg, xret;
6825 switch (GET_CODE (x))
6830 if (cselib_dummy_expand_value_rtx_cb (SUBREG_REG (x), regs,
6832 vt_expand_loc_callback, data))
6838 subreg = cselib_expand_value_rtx_cb (SUBREG_REG (x), regs,
6840 vt_expand_loc_callback, data);
6845 result = simplify_gen_subreg (GET_MODE (x), subreg,
6846 GET_MODE (SUBREG_REG (x)),
6849 /* Invalid SUBREGs are ok in debug info. ??? We could try
6850 alternate expansions for the VALUE as well. */
6852 result = gen_rtx_raw_SUBREG (GET_MODE (x), subreg, SUBREG_BYTE (x));
6857 dv = dv_from_decl (DEBUG_EXPR_TREE_DECL (x));
6862 dv = dv_from_value (x);
6870 if (VALUE_RECURSED_INTO (x))
6873 var = (variable) htab_find_with_hash (elcd->vars, dv, dv_htab_hash (dv));
6877 if (dummy && dv_changed_p (dv))
6878 elcd->cur_loc_changed = true;
6882 if (var->n_var_parts == 0)
6885 elcd->cur_loc_changed = true;
6889 gcc_assert (var->n_var_parts == 1);
6891 VALUE_RECURSED_INTO (x) = true;
6894 if (var->var_part[0].cur_loc)
6898 if (cselib_dummy_expand_value_rtx_cb (var->var_part[0].cur_loc, regs,
6900 vt_expand_loc_callback, data))
6904 result = cselib_expand_value_rtx_cb (var->var_part[0].cur_loc, regs,
6906 vt_expand_loc_callback, data);
6908 set_dv_changed (dv, false);
6910 if (!result && dv_changed_p (dv))
6912 set_dv_changed (dv, false);
6913 for (loc = var->var_part[0].loc_chain; loc; loc = loc->next)
6914 if (loc->loc == var->var_part[0].cur_loc)
6918 elcd->cur_loc_changed = cur_loc_changed;
6919 if (cselib_dummy_expand_value_rtx_cb (loc->loc, regs, max_depth,
6920 vt_expand_loc_callback,
6929 result = cselib_expand_value_rtx_cb (loc->loc, regs, max_depth,
6930 vt_expand_loc_callback, data);
6934 if (dummy && (result || var->var_part[0].cur_loc))
6935 var->cur_loc_changed = true;
6936 var->var_part[0].cur_loc = loc ? loc->loc : NULL_RTX;
6940 if (var->cur_loc_changed)
6941 elcd->cur_loc_changed = true;
6942 else if (!result && var->var_part[0].cur_loc == NULL_RTX)
6943 elcd->cur_loc_changed = cur_loc_changed;
6946 VALUE_RECURSED_INTO (x) = false;
6953 /* Expand VALUEs in LOC, using VARS as well as cselib's equivalence
6957 vt_expand_loc (rtx loc, htab_t vars)
6959 struct expand_loc_callback_data data;
6961 if (!MAY_HAVE_DEBUG_INSNS)
6966 data.cur_loc_changed = false;
6967 loc = cselib_expand_value_rtx_cb (loc, scratch_regs, 5,
6968 vt_expand_loc_callback, &data);
6970 if (loc && MEM_P (loc))
6971 loc = targetm.delegitimize_address (loc);
6975 /* Like vt_expand_loc, but only return true/false (whether vt_expand_loc
6976 would succeed or not, without actually allocating new rtxes. */
6979 vt_expand_loc_dummy (rtx loc, htab_t vars, bool *pcur_loc_changed)
6981 struct expand_loc_callback_data data;
6984 gcc_assert (MAY_HAVE_DEBUG_INSNS);
6987 data.cur_loc_changed = false;
6988 ret = cselib_dummy_expand_value_rtx_cb (loc, scratch_regs, 5,
6989 vt_expand_loc_callback, &data);
6990 *pcur_loc_changed = data.cur_loc_changed;
6994 #ifdef ENABLE_RTL_CHECKING
6995 /* Used to verify that cur_loc_changed updating is safe. */
6996 static struct pointer_map_t *emitted_notes;
6999 /* Emit the NOTE_INSN_VAR_LOCATION for variable *VARP. DATA contains
7000 additional parameters: WHERE specifies whether the note shall be emitted
7001 before or after instruction INSN. */
7004 emit_note_insn_var_location (void **varp, void *data)
7006 variable var = (variable) *varp;
7007 rtx insn = ((emit_note_data *)data)->insn;
7008 enum emit_note_where where = ((emit_note_data *)data)->where;
7009 htab_t vars = ((emit_note_data *)data)->vars;
7011 int i, j, n_var_parts;
7013 enum var_init_status initialized = VAR_INIT_STATUS_UNINITIALIZED;
7014 HOST_WIDE_INT last_limit;
7015 tree type_size_unit;
7016 HOST_WIDE_INT offsets[MAX_VAR_PARTS];
7017 rtx loc[MAX_VAR_PARTS];
7021 if (dv_is_value_p (var->dv))
7022 goto value_or_debug_decl;
7024 decl = dv_as_decl (var->dv);
7026 if (TREE_CODE (decl) == DEBUG_EXPR_DECL)
7027 goto value_or_debug_decl;
7032 if (!MAY_HAVE_DEBUG_INSNS)
7034 for (i = 0; i < var->n_var_parts; i++)
7035 if (var->var_part[i].cur_loc == NULL && var->var_part[i].loc_chain)
7037 var->var_part[i].cur_loc = var->var_part[i].loc_chain->loc;
7038 var->cur_loc_changed = true;
7040 if (var->n_var_parts == 0)
7041 var->cur_loc_changed = true;
7043 #ifndef ENABLE_RTL_CHECKING
7044 if (!var->cur_loc_changed)
7047 for (i = 0; i < var->n_var_parts; i++)
7049 enum machine_mode mode, wider_mode;
7052 if (last_limit < var->var_part[i].offset)
7057 else if (last_limit > var->var_part[i].offset)
7059 offsets[n_var_parts] = var->var_part[i].offset;
7060 if (!var->var_part[i].cur_loc)
7065 loc2 = vt_expand_loc (var->var_part[i].cur_loc, vars);
7071 loc[n_var_parts] = loc2;
7072 mode = GET_MODE (var->var_part[i].cur_loc);
7073 if (mode == VOIDmode && dv_onepart_p (var->dv))
7074 mode = DECL_MODE (decl);
7075 for (lc = var->var_part[i].loc_chain; lc; lc = lc->next)
7076 if (var->var_part[i].cur_loc == lc->loc)
7078 initialized = lc->init;
7082 last_limit = offsets[n_var_parts] + GET_MODE_SIZE (mode);
7084 /* Attempt to merge adjacent registers or memory. */
7085 wider_mode = GET_MODE_WIDER_MODE (mode);
7086 for (j = i + 1; j < var->n_var_parts; j++)
7087 if (last_limit <= var->var_part[j].offset)
7089 if (j < var->n_var_parts
7090 && wider_mode != VOIDmode
7091 && var->var_part[j].cur_loc
7092 && mode == GET_MODE (var->var_part[j].cur_loc)
7093 && (REG_P (loc[n_var_parts]) || MEM_P (loc[n_var_parts]))
7094 && last_limit == var->var_part[j].offset
7095 && (loc2 = vt_expand_loc (var->var_part[j].cur_loc, vars))
7096 && GET_CODE (loc[n_var_parts]) == GET_CODE (loc2))
7100 if (REG_P (loc[n_var_parts])
7101 && hard_regno_nregs[REGNO (loc[n_var_parts])][mode] * 2
7102 == hard_regno_nregs[REGNO (loc[n_var_parts])][wider_mode]
7103 && end_hard_regno (mode, REGNO (loc[n_var_parts]))
7106 if (! WORDS_BIG_ENDIAN && ! BYTES_BIG_ENDIAN)
7107 new_loc = simplify_subreg (wider_mode, loc[n_var_parts],
7109 else if (WORDS_BIG_ENDIAN && BYTES_BIG_ENDIAN)
7110 new_loc = simplify_subreg (wider_mode, loc2, mode, 0);
7113 if (!REG_P (new_loc)
7114 || REGNO (new_loc) != REGNO (loc[n_var_parts]))
7117 REG_ATTRS (new_loc) = REG_ATTRS (loc[n_var_parts]);
7120 else if (MEM_P (loc[n_var_parts])
7121 && GET_CODE (XEXP (loc2, 0)) == PLUS
7122 && REG_P (XEXP (XEXP (loc2, 0), 0))
7123 && CONST_INT_P (XEXP (XEXP (loc2, 0), 1)))
7125 if ((REG_P (XEXP (loc[n_var_parts], 0))
7126 && rtx_equal_p (XEXP (loc[n_var_parts], 0),
7127 XEXP (XEXP (loc2, 0), 0))
7128 && INTVAL (XEXP (XEXP (loc2, 0), 1))
7129 == GET_MODE_SIZE (mode))
7130 || (GET_CODE (XEXP (loc[n_var_parts], 0)) == PLUS
7131 && CONST_INT_P (XEXP (XEXP (loc[n_var_parts], 0), 1))
7132 && rtx_equal_p (XEXP (XEXP (loc[n_var_parts], 0), 0),
7133 XEXP (XEXP (loc2, 0), 0))
7134 && INTVAL (XEXP (XEXP (loc[n_var_parts], 0), 1))
7135 + GET_MODE_SIZE (mode)
7136 == INTVAL (XEXP (XEXP (loc2, 0), 1))))
7137 new_loc = adjust_address_nv (loc[n_var_parts],
7143 loc[n_var_parts] = new_loc;
7145 last_limit = offsets[n_var_parts] + GET_MODE_SIZE (mode);
7151 type_size_unit = TYPE_SIZE_UNIT (TREE_TYPE (decl));
7152 if ((unsigned HOST_WIDE_INT) last_limit < TREE_INT_CST_LOW (type_size_unit))
7155 if (! flag_var_tracking_uninit)
7156 initialized = VAR_INIT_STATUS_INITIALIZED;
7160 note_vl = gen_rtx_VAR_LOCATION (VOIDmode, decl, NULL_RTX,
7162 else if (n_var_parts == 1)
7166 if (offsets[0] || GET_CODE (loc[0]) == PARALLEL)
7167 expr_list = gen_rtx_EXPR_LIST (VOIDmode, loc[0], GEN_INT (offsets[0]));
7171 note_vl = gen_rtx_VAR_LOCATION (VOIDmode, decl, expr_list,
7174 else if (n_var_parts)
7178 for (i = 0; i < n_var_parts; i++)
7180 = gen_rtx_EXPR_LIST (VOIDmode, loc[i], GEN_INT (offsets[i]));
7182 parallel = gen_rtx_PARALLEL (VOIDmode,
7183 gen_rtvec_v (n_var_parts, loc));
7184 note_vl = gen_rtx_VAR_LOCATION (VOIDmode, decl,
7185 parallel, (int) initialized);
7188 #ifdef ENABLE_RTL_CHECKING
7191 void **note_slot = pointer_map_insert (emitted_notes, decl);
7192 rtx pnote = (rtx) *note_slot;
7193 if (!var->cur_loc_changed && (pnote || PAT_VAR_LOCATION_LOC (note_vl)))
7196 gcc_assert (rtx_equal_p (PAT_VAR_LOCATION_LOC (pnote),
7197 PAT_VAR_LOCATION_LOC (note_vl)));
7199 *note_slot = (void *) note_vl;
7201 if (!var->cur_loc_changed)
7205 if (where != EMIT_NOTE_BEFORE_INSN)
7207 note = emit_note_after (NOTE_INSN_VAR_LOCATION, insn);
7208 if (where == EMIT_NOTE_AFTER_CALL_INSN)
7209 NOTE_DURING_CALL_P (note) = true;
7212 note = emit_note_before (NOTE_INSN_VAR_LOCATION, insn);
7213 NOTE_VAR_LOCATION (note) = note_vl;
7216 set_dv_changed (var->dv, false);
7217 var->cur_loc_changed = false;
7218 gcc_assert (var->in_changed_variables);
7219 var->in_changed_variables = false;
7220 htab_clear_slot (changed_variables, varp);
7222 /* Continue traversing the hash table. */
7225 value_or_debug_decl:
7226 if (dv_changed_p (var->dv) && var->n_var_parts)
7229 bool cur_loc_changed;
7231 if (var->var_part[0].cur_loc
7232 && vt_expand_loc_dummy (var->var_part[0].cur_loc, vars,
7235 for (lc = var->var_part[0].loc_chain; lc; lc = lc->next)
7236 if (lc->loc != var->var_part[0].cur_loc
7237 && vt_expand_loc_dummy (lc->loc, vars, &cur_loc_changed))
7239 var->var_part[0].cur_loc = lc ? lc->loc : NULL_RTX;
7244 DEF_VEC_P (variable);
7245 DEF_VEC_ALLOC_P (variable, heap);
7247 /* Stack of variable_def pointers that need processing with
7248 check_changed_vars_2. */
7250 static VEC (variable, heap) *changed_variables_stack;
7252 /* VALUEs with no variables that need set_dv_changed (val, false)
7253 called before check_changed_vars_3. */
7255 static VEC (rtx, heap) *changed_values_stack;
7257 /* Helper function for check_changed_vars_1 and check_changed_vars_2. */
7260 check_changed_vars_0 (decl_or_value dv, htab_t htab)
7263 = (value_chain) htab_find_with_hash (value_chains, dv, dv_htab_hash (dv));
7267 for (vc = vc->next; vc; vc = vc->next)
7268 if (!dv_changed_p (vc->dv))
7271 = (variable) htab_find_with_hash (htab, vc->dv,
7272 dv_htab_hash (vc->dv));
7275 set_dv_changed (vc->dv, true);
7276 VEC_safe_push (variable, heap, changed_variables_stack, vcvar);
7278 else if (dv_is_value_p (vc->dv))
7280 set_dv_changed (vc->dv, true);
7281 VEC_safe_push (rtx, heap, changed_values_stack,
7282 dv_as_value (vc->dv));
7283 check_changed_vars_0 (vc->dv, htab);
7288 /* Populate changed_variables_stack with variable_def pointers
7289 that need variable_was_changed called on them. */
7292 check_changed_vars_1 (void **slot, void *data)
7294 variable var = (variable) *slot;
7295 htab_t htab = (htab_t) data;
7297 if (dv_is_value_p (var->dv)
7298 || TREE_CODE (dv_as_decl (var->dv)) == DEBUG_EXPR_DECL)
7299 check_changed_vars_0 (var->dv, htab);
7303 /* Add VAR to changed_variables and also for VALUEs add recursively
7304 all DVs that aren't in changed_variables yet but reference the
7305 VALUE from its loc_chain. */
7308 check_changed_vars_2 (variable var, htab_t htab)
7310 variable_was_changed (var, NULL);
7311 if (dv_is_value_p (var->dv)
7312 || TREE_CODE (dv_as_decl (var->dv)) == DEBUG_EXPR_DECL)
7313 check_changed_vars_0 (var->dv, htab);
7316 /* For each changed decl (except DEBUG_EXPR_DECLs) recompute
7317 cur_loc if needed (and cur_loc of all VALUEs and DEBUG_EXPR_DECLs
7318 it needs and are also in changed variables) and track whether
7319 cur_loc (or anything it uses to compute location) had to change
7320 during the current emit_notes_for_changes call. */
7323 check_changed_vars_3 (void **slot, void *data)
7325 variable var = (variable) *slot;
7326 htab_t vars = (htab_t) data;
7329 bool cur_loc_changed;
7331 if (dv_is_value_p (var->dv)
7332 || TREE_CODE (dv_as_decl (var->dv)) == DEBUG_EXPR_DECL)
7335 for (i = 0; i < var->n_var_parts; i++)
7337 if (var->var_part[i].cur_loc
7338 && vt_expand_loc_dummy (var->var_part[i].cur_loc, vars,
7341 if (cur_loc_changed)
7342 var->cur_loc_changed = true;
7345 for (lc = var->var_part[i].loc_chain; lc; lc = lc->next)
7346 if (lc->loc != var->var_part[i].cur_loc
7347 && vt_expand_loc_dummy (lc->loc, vars, &cur_loc_changed))
7349 if (lc || var->var_part[i].cur_loc)
7350 var->cur_loc_changed = true;
7351 var->var_part[i].cur_loc = lc ? lc->loc : NULL_RTX;
7353 if (var->n_var_parts == 0)
7354 var->cur_loc_changed = true;
7358 /* Emit NOTE_INSN_VAR_LOCATION note for each variable from a chain
7359 CHANGED_VARIABLES and delete this chain. WHERE specifies whether the notes
7360 shall be emitted before of after instruction INSN. */
7363 emit_notes_for_changes (rtx insn, enum emit_note_where where,
7366 emit_note_data data;
7367 htab_t htab = shared_hash_htab (vars);
7369 if (!htab_elements (changed_variables))
7372 if (MAY_HAVE_DEBUG_INSNS)
7374 /* Unfortunately this has to be done in two steps, because
7375 we can't traverse a hashtab into which we are inserting
7376 through variable_was_changed. */
7377 htab_traverse (changed_variables, check_changed_vars_1, htab);
7378 while (VEC_length (variable, changed_variables_stack) > 0)
7379 check_changed_vars_2 (VEC_pop (variable, changed_variables_stack),
7381 while (VEC_length (rtx, changed_values_stack) > 0)
7382 set_dv_changed (dv_from_value (VEC_pop (rtx, changed_values_stack)),
7384 htab_traverse (changed_variables, check_changed_vars_3, htab);
7391 htab_traverse (changed_variables, emit_note_insn_var_location, &data);
7394 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it differs from the
7395 same variable in hash table DATA or is not there at all. */
7398 emit_notes_for_differences_1 (void **slot, void *data)
7400 htab_t new_vars = (htab_t) data;
7401 variable old_var, new_var;
7403 old_var = (variable) *slot;
7404 new_var = (variable) htab_find_with_hash (new_vars, old_var->dv,
7405 dv_htab_hash (old_var->dv));
7409 /* Variable has disappeared. */
7412 empty_var = (variable) pool_alloc (dv_pool (old_var->dv));
7413 empty_var->dv = old_var->dv;
7414 empty_var->refcount = 0;
7415 empty_var->n_var_parts = 0;
7416 empty_var->cur_loc_changed = false;
7417 empty_var->in_changed_variables = false;
7418 if (dv_onepart_p (old_var->dv))
7422 gcc_assert (old_var->n_var_parts == 1);
7423 for (lc = old_var->var_part[0].loc_chain; lc; lc = lc->next)
7424 remove_value_chains (old_var->dv, lc->loc);
7426 variable_was_changed (empty_var, NULL);
7427 /* Continue traversing the hash table. */
7430 if (variable_different_p (old_var, new_var))
7432 if (dv_onepart_p (old_var->dv))
7434 location_chain lc1, lc2;
7436 gcc_assert (old_var->n_var_parts == 1
7437 && new_var->n_var_parts == 1);
7438 lc1 = old_var->var_part[0].loc_chain;
7439 lc2 = new_var->var_part[0].loc_chain;
7442 && ((REG_P (lc1->loc) && REG_P (lc2->loc))
7443 || rtx_equal_p (lc1->loc, lc2->loc)))
7448 for (; lc2; lc2 = lc2->next)
7449 add_value_chains (old_var->dv, lc2->loc);
7450 for (; lc1; lc1 = lc1->next)
7451 remove_value_chains (old_var->dv, lc1->loc);
7453 variable_was_changed (new_var, NULL);
7455 /* Update cur_loc. */
7456 if (old_var != new_var)
7459 for (i = 0; i < new_var->n_var_parts; i++)
7461 new_var->var_part[i].cur_loc = NULL;
7462 if (old_var->n_var_parts != new_var->n_var_parts
7463 || old_var->var_part[i].offset != new_var->var_part[i].offset)
7464 new_var->cur_loc_changed = true;
7465 else if (old_var->var_part[i].cur_loc != NULL)
7468 rtx cur_loc = old_var->var_part[i].cur_loc;
7470 for (lc = new_var->var_part[i].loc_chain; lc; lc = lc->next)
7471 if (lc->loc == cur_loc
7472 || rtx_equal_p (cur_loc, lc->loc))
7474 new_var->var_part[i].cur_loc = lc->loc;
7478 new_var->cur_loc_changed = true;
7483 /* Continue traversing the hash table. */
7487 /* Add variable *SLOT to the chain CHANGED_VARIABLES if it is not in hash
7491 emit_notes_for_differences_2 (void **slot, void *data)
7493 htab_t old_vars = (htab_t) data;
7494 variable old_var, new_var;
7496 new_var = (variable) *slot;
7497 old_var = (variable) htab_find_with_hash (old_vars, new_var->dv,
7498 dv_htab_hash (new_var->dv));
7502 /* Variable has appeared. */
7503 if (dv_onepart_p (new_var->dv))
7507 gcc_assert (new_var->n_var_parts == 1);
7508 for (lc = new_var->var_part[0].loc_chain; lc; lc = lc->next)
7509 add_value_chains (new_var->dv, lc->loc);
7511 for (i = 0; i < new_var->n_var_parts; i++)
7512 new_var->var_part[i].cur_loc = NULL;
7513 variable_was_changed (new_var, NULL);
7516 /* Continue traversing the hash table. */
7520 /* Emit notes before INSN for differences between dataflow sets OLD_SET and
7524 emit_notes_for_differences (rtx insn, dataflow_set *old_set,
7525 dataflow_set *new_set)
7527 htab_traverse (shared_hash_htab (old_set->vars),
7528 emit_notes_for_differences_1,
7529 shared_hash_htab (new_set->vars));
7530 htab_traverse (shared_hash_htab (new_set->vars),
7531 emit_notes_for_differences_2,
7532 shared_hash_htab (old_set->vars));
7533 emit_notes_for_changes (insn, EMIT_NOTE_BEFORE_INSN, new_set->vars);
7536 /* Emit the notes for changes of location parts in the basic block BB. */
7539 emit_notes_in_bb (basic_block bb, dataflow_set *set)
7542 micro_operation *mo;
7544 dataflow_set_clear (set);
7545 dataflow_set_copy (set, &VTI (bb)->in);
7547 for (i = 0; VEC_iterate (micro_operation, VTI (bb)->mos, i, mo); i++)
7549 rtx insn = mo->insn;
7554 dataflow_set_clear_at_call (set);
7555 emit_notes_for_changes (insn, EMIT_NOTE_AFTER_CALL_INSN, set->vars);
7560 rtx loc = mo->u.loc;
7563 var_reg_set (set, loc, VAR_INIT_STATUS_UNINITIALIZED, NULL);
7565 var_mem_set (set, loc, VAR_INIT_STATUS_UNINITIALIZED, NULL);
7567 emit_notes_for_changes (insn, EMIT_NOTE_AFTER_INSN, set->vars);
7573 rtx loc = mo->u.loc;
7577 if (GET_CODE (loc) == CONCAT)
7579 val = XEXP (loc, 0);
7580 vloc = XEXP (loc, 1);
7588 var = PAT_VAR_LOCATION_DECL (vloc);
7590 clobber_variable_part (set, NULL_RTX,
7591 dv_from_decl (var), 0, NULL_RTX);
7594 if (VAL_NEEDS_RESOLUTION (loc))
7595 val_resolve (set, val, PAT_VAR_LOCATION_LOC (vloc), insn);
7596 set_variable_part (set, val, dv_from_decl (var), 0,
7597 VAR_INIT_STATUS_INITIALIZED, NULL_RTX,
7600 else if (!VAR_LOC_UNKNOWN_P (PAT_VAR_LOCATION_LOC (vloc)))
7601 set_variable_part (set, PAT_VAR_LOCATION_LOC (vloc),
7602 dv_from_decl (var), 0,
7603 VAR_INIT_STATUS_INITIALIZED, NULL_RTX,
7606 emit_notes_for_changes (insn, EMIT_NOTE_AFTER_INSN, set->vars);
7612 rtx loc = mo->u.loc;
7613 rtx val, vloc, uloc;
7615 vloc = uloc = XEXP (loc, 1);
7616 val = XEXP (loc, 0);
7618 if (GET_CODE (val) == CONCAT)
7620 uloc = XEXP (val, 1);
7621 val = XEXP (val, 0);
7624 if (VAL_NEEDS_RESOLUTION (loc))
7625 val_resolve (set, val, vloc, insn);
7627 val_store (set, val, uloc, insn, false);
7629 if (VAL_HOLDS_TRACK_EXPR (loc))
7631 if (GET_CODE (uloc) == REG)
7632 var_reg_set (set, uloc, VAR_INIT_STATUS_UNINITIALIZED,
7634 else if (GET_CODE (uloc) == MEM)
7635 var_mem_set (set, uloc, VAR_INIT_STATUS_UNINITIALIZED,
7639 emit_notes_for_changes (insn, EMIT_NOTE_BEFORE_INSN, set->vars);
7645 rtx loc = mo->u.loc;
7646 rtx val, vloc, uloc, reverse = NULL_RTX;
7649 if (VAL_EXPR_HAS_REVERSE (loc))
7651 reverse = XEXP (loc, 1);
7652 vloc = XEXP (loc, 0);
7654 uloc = XEXP (vloc, 1);
7655 val = XEXP (vloc, 0);
7658 if (GET_CODE (val) == CONCAT)
7660 vloc = XEXP (val, 1);
7661 val = XEXP (val, 0);
7664 if (GET_CODE (vloc) == SET)
7666 rtx vsrc = SET_SRC (vloc);
7668 gcc_assert (val != vsrc);
7669 gcc_assert (vloc == uloc || VAL_NEEDS_RESOLUTION (loc));
7671 vloc = SET_DEST (vloc);
7673 if (VAL_NEEDS_RESOLUTION (loc))
7674 val_resolve (set, val, vsrc, insn);
7676 else if (VAL_NEEDS_RESOLUTION (loc))
7678 gcc_assert (GET_CODE (uloc) == SET
7679 && GET_CODE (SET_SRC (uloc)) == REG);
7680 val_resolve (set, val, SET_SRC (uloc), insn);
7683 if (VAL_HOLDS_TRACK_EXPR (loc))
7685 if (VAL_EXPR_IS_CLOBBERED (loc))
7688 var_reg_delete (set, uloc, true);
7689 else if (MEM_P (uloc))
7690 var_mem_delete (set, uloc, true);
7694 bool copied_p = VAL_EXPR_IS_COPIED (loc);
7696 enum var_init_status status = VAR_INIT_STATUS_INITIALIZED;
7698 if (GET_CODE (uloc) == SET)
7700 set_src = SET_SRC (uloc);
7701 uloc = SET_DEST (uloc);
7706 status = find_src_status (set, set_src);
7708 set_src = find_src_set_src (set, set_src);
7712 var_reg_delete_and_set (set, uloc, !copied_p,
7714 else if (MEM_P (uloc))
7715 var_mem_delete_and_set (set, uloc, !copied_p,
7719 else if (REG_P (uloc))
7720 var_regno_delete (set, REGNO (uloc));
7722 val_store (set, val, vloc, insn, true);
7725 val_store (set, XEXP (reverse, 0), XEXP (reverse, 1),
7728 emit_notes_for_changes (NEXT_INSN (insn), EMIT_NOTE_BEFORE_INSN,
7735 rtx loc = mo->u.loc;
7738 if (GET_CODE (loc) == SET)
7740 set_src = SET_SRC (loc);
7741 loc = SET_DEST (loc);
7745 var_reg_delete_and_set (set, loc, true, VAR_INIT_STATUS_INITIALIZED,
7748 var_mem_delete_and_set (set, loc, true, VAR_INIT_STATUS_INITIALIZED,
7751 emit_notes_for_changes (NEXT_INSN (insn), EMIT_NOTE_BEFORE_INSN,
7758 rtx loc = mo->u.loc;
7759 enum var_init_status src_status;
7762 if (GET_CODE (loc) == SET)
7764 set_src = SET_SRC (loc);
7765 loc = SET_DEST (loc);
7768 src_status = find_src_status (set, set_src);
7769 set_src = find_src_set_src (set, set_src);
7772 var_reg_delete_and_set (set, loc, false, src_status, set_src);
7774 var_mem_delete_and_set (set, loc, false, src_status, set_src);
7776 emit_notes_for_changes (NEXT_INSN (insn), EMIT_NOTE_BEFORE_INSN,
7783 rtx loc = mo->u.loc;
7786 var_reg_delete (set, loc, false);
7788 var_mem_delete (set, loc, false);
7790 emit_notes_for_changes (insn, EMIT_NOTE_AFTER_INSN, set->vars);
7796 rtx loc = mo->u.loc;
7799 var_reg_delete (set, loc, true);
7801 var_mem_delete (set, loc, true);
7803 emit_notes_for_changes (NEXT_INSN (insn), EMIT_NOTE_BEFORE_INSN,
7809 set->stack_adjust += mo->u.adjust;
7815 /* Emit notes for the whole function. */
7818 vt_emit_notes (void)
7823 #ifdef ENABLE_RTL_CHECKING
7824 emitted_notes = pointer_map_create ();
7826 gcc_assert (!htab_elements (changed_variables));
7828 /* Free memory occupied by the out hash tables, as they aren't used
7831 dataflow_set_clear (&VTI (bb)->out);
7833 /* Enable emitting notes by functions (mainly by set_variable_part and
7834 delete_variable_part). */
7837 if (MAY_HAVE_DEBUG_INSNS)
7842 for (i = 0; VEC_iterate (rtx, preserved_values, i, val); i++)
7843 add_cselib_value_chains (dv_from_value (val));
7844 changed_variables_stack = VEC_alloc (variable, heap, 40);
7845 changed_values_stack = VEC_alloc (rtx, heap, 40);
7848 dataflow_set_init (&cur);
7852 /* Emit the notes for changes of variable locations between two
7853 subsequent basic blocks. */
7854 emit_notes_for_differences (BB_HEAD (bb), &cur, &VTI (bb)->in);
7856 /* Emit the notes for the changes in the basic block itself. */
7857 emit_notes_in_bb (bb, &cur);
7859 /* Free memory occupied by the in hash table, we won't need it
7861 dataflow_set_clear (&VTI (bb)->in);
7863 #ifdef ENABLE_CHECKING
7864 htab_traverse (shared_hash_htab (cur.vars),
7865 emit_notes_for_differences_1,
7866 shared_hash_htab (empty_shared_hash));
7867 if (MAY_HAVE_DEBUG_INSNS)
7872 for (i = 0; VEC_iterate (rtx, preserved_values, i, val); i++)
7873 remove_cselib_value_chains (dv_from_value (val));
7874 gcc_assert (htab_elements (value_chains) == 0);
7877 dataflow_set_destroy (&cur);
7879 if (MAY_HAVE_DEBUG_INSNS)
7881 VEC_free (variable, heap, changed_variables_stack);
7882 VEC_free (rtx, heap, changed_values_stack);
7885 #ifdef ENABLE_RTL_CHECKING
7886 pointer_map_destroy (emitted_notes);
7891 /* If there is a declaration and offset associated with register/memory RTL
7892 assign declaration to *DECLP and offset to *OFFSETP, and return true. */
7895 vt_get_decl_and_offset (rtx rtl, tree *declp, HOST_WIDE_INT *offsetp)
7899 if (REG_ATTRS (rtl))
7901 *declp = REG_EXPR (rtl);
7902 *offsetp = REG_OFFSET (rtl);
7906 else if (MEM_P (rtl))
7908 if (MEM_ATTRS (rtl))
7910 *declp = MEM_EXPR (rtl);
7911 *offsetp = INT_MEM_OFFSET (rtl);
7918 /* Insert function parameters to IN and OUT sets of ENTRY_BLOCK. */
7921 vt_add_function_parameters (void)
7925 for (parm = DECL_ARGUMENTS (current_function_decl);
7926 parm; parm = TREE_CHAIN (parm))
7928 rtx decl_rtl = DECL_RTL_IF_SET (parm);
7929 rtx incoming = DECL_INCOMING_RTL (parm);
7931 enum machine_mode mode;
7932 HOST_WIDE_INT offset;
7936 if (TREE_CODE (parm) != PARM_DECL)
7939 if (!DECL_NAME (parm))
7942 if (!decl_rtl || !incoming)
7945 if (GET_MODE (decl_rtl) == BLKmode || GET_MODE (incoming) == BLKmode)
7948 if (!vt_get_decl_and_offset (incoming, &decl, &offset))
7950 if (REG_P (incoming) || MEM_P (incoming))
7952 /* This means argument is passed by invisible reference. */
7955 incoming = gen_rtx_MEM (GET_MODE (decl_rtl), incoming);
7959 if (!vt_get_decl_and_offset (decl_rtl, &decl, &offset))
7961 offset += byte_lowpart_offset (GET_MODE (incoming),
7962 GET_MODE (decl_rtl));
7971 /* Assume that DECL_RTL was a pseudo that got spilled to
7972 memory. The spill slot sharing code will force the
7973 memory to reference spill_slot_decl (%sfp), so we don't
7974 match above. That's ok, the pseudo must have referenced
7975 the entire parameter, so just reset OFFSET. */
7976 gcc_assert (decl == get_spill_slot_decl (false));
7980 if (!track_loc_p (incoming, parm, offset, false, &mode, &offset))
7983 out = &VTI (ENTRY_BLOCK_PTR)->out;
7985 dv = dv_from_decl (parm);
7987 if (target_for_debug_bind (parm)
7988 /* We can't deal with these right now, because this kind of
7989 variable is single-part. ??? We could handle parallels
7990 that describe multiple locations for the same single
7991 value, but ATM we don't. */
7992 && GET_CODE (incoming) != PARALLEL)
7996 /* ??? We shouldn't ever hit this, but it may happen because
7997 arguments passed by invisible reference aren't dealt with
7998 above: incoming-rtl will have Pmode rather than the
7999 expected mode for the type. */
8003 val = cselib_lookup (var_lowpart (mode, incoming), mode, true);
8005 /* ??? Float-typed values in memory are not handled by
8009 preserve_value (val);
8010 set_variable_part (out, val->val_rtx, dv, offset,
8011 VAR_INIT_STATUS_INITIALIZED, NULL, INSERT);
8012 dv = dv_from_value (val->val_rtx);
8016 if (REG_P (incoming))
8018 incoming = var_lowpart (mode, incoming);
8019 gcc_assert (REGNO (incoming) < FIRST_PSEUDO_REGISTER);
8020 attrs_list_insert (&out->regs[REGNO (incoming)], dv, offset,
8022 set_variable_part (out, incoming, dv, offset,
8023 VAR_INIT_STATUS_INITIALIZED, NULL, INSERT);
8025 else if (MEM_P (incoming))
8027 incoming = var_lowpart (mode, incoming);
8028 set_variable_part (out, incoming, dv, offset,
8029 VAR_INIT_STATUS_INITIALIZED, NULL, INSERT);
8033 if (MAY_HAVE_DEBUG_INSNS)
8035 cselib_preserve_only_values ();
8036 cselib_reset_table (cselib_get_next_uid ());
8041 /* Return true if INSN in the prologue initializes hard_frame_pointer_rtx. */
8044 fp_setter (rtx insn)
8046 rtx pat = PATTERN (insn);
8047 if (RTX_FRAME_RELATED_P (insn))
8049 rtx expr = find_reg_note (insn, REG_FRAME_RELATED_EXPR, NULL_RTX);
8051 pat = XEXP (expr, 0);
8053 if (GET_CODE (pat) == SET)
8054 return SET_DEST (pat) == hard_frame_pointer_rtx;
8055 else if (GET_CODE (pat) == PARALLEL)
8058 for (i = XVECLEN (pat, 0) - 1; i >= 0; i--)
8059 if (GET_CODE (XVECEXP (pat, 0, i)) == SET
8060 && SET_DEST (XVECEXP (pat, 0, i)) == hard_frame_pointer_rtx)
8066 /* Initialize cfa_base_rtx, create a preserved VALUE for it and
8067 ensure it isn't flushed during cselib_reset_table.
8068 Can be called only if frame_pointer_rtx resp. arg_pointer_rtx
8069 has been eliminated. */
8072 vt_init_cfa_base (void)
8076 #ifdef FRAME_POINTER_CFA_OFFSET
8077 cfa_base_rtx = frame_pointer_rtx;
8079 cfa_base_rtx = arg_pointer_rtx;
8081 if (cfa_base_rtx == hard_frame_pointer_rtx
8082 || !fixed_regs[REGNO (cfa_base_rtx)])
8084 cfa_base_rtx = NULL_RTX;
8087 if (!MAY_HAVE_DEBUG_INSNS)
8090 val = cselib_lookup_from_insn (cfa_base_rtx, GET_MODE (cfa_base_rtx), 1,
8092 preserve_value (val);
8093 cselib_preserve_cfa_base_value (val);
8094 var_reg_decl_set (&VTI (ENTRY_BLOCK_PTR)->out, cfa_base_rtx,
8095 VAR_INIT_STATUS_INITIALIZED, dv_from_value (val->val_rtx),
8096 0, NULL_RTX, INSERT);
8099 /* Allocate and initialize the data structures for variable tracking
8100 and parse the RTL to get the micro operations. */
8103 vt_initialize (void)
8105 basic_block bb, prologue_bb = NULL;
8106 HOST_WIDE_INT fp_cfa_offset = -1;
8108 alloc_aux_for_blocks (sizeof (struct variable_tracking_info_def));
8110 attrs_pool = create_alloc_pool ("attrs_def pool",
8111 sizeof (struct attrs_def), 1024);
8112 var_pool = create_alloc_pool ("variable_def pool",
8113 sizeof (struct variable_def)
8114 + (MAX_VAR_PARTS - 1)
8115 * sizeof (((variable)NULL)->var_part[0]), 64);
8116 loc_chain_pool = create_alloc_pool ("location_chain_def pool",
8117 sizeof (struct location_chain_def),
8119 shared_hash_pool = create_alloc_pool ("shared_hash_def pool",
8120 sizeof (struct shared_hash_def), 256);
8121 empty_shared_hash = (shared_hash) pool_alloc (shared_hash_pool);
8122 empty_shared_hash->refcount = 1;
8123 empty_shared_hash->htab
8124 = htab_create (1, variable_htab_hash, variable_htab_eq,
8125 variable_htab_free);
8126 changed_variables = htab_create (10, variable_htab_hash, variable_htab_eq,
8127 variable_htab_free);
8128 if (MAY_HAVE_DEBUG_INSNS)
8130 value_chain_pool = create_alloc_pool ("value_chain_def pool",
8131 sizeof (struct value_chain_def),
8133 value_chains = htab_create (32, value_chain_htab_hash,
8134 value_chain_htab_eq, NULL);
8137 /* Init the IN and OUT sets. */
8140 VTI (bb)->visited = false;
8141 VTI (bb)->flooded = false;
8142 dataflow_set_init (&VTI (bb)->in);
8143 dataflow_set_init (&VTI (bb)->out);
8144 VTI (bb)->permp = NULL;
8147 if (MAY_HAVE_DEBUG_INSNS)
8149 cselib_init (CSELIB_RECORD_MEMORY | CSELIB_PRESERVE_CONSTANTS);
8150 scratch_regs = BITMAP_ALLOC (NULL);
8151 valvar_pool = create_alloc_pool ("small variable_def pool",
8152 sizeof (struct variable_def), 256);
8153 preserved_values = VEC_alloc (rtx, heap, 256);
8157 scratch_regs = NULL;
8161 if (!frame_pointer_needed)
8165 if (!vt_stack_adjustments ())
8168 #ifdef FRAME_POINTER_CFA_OFFSET
8169 reg = frame_pointer_rtx;
8171 reg = arg_pointer_rtx;
8173 elim = eliminate_regs (reg, VOIDmode, NULL_RTX);
8176 if (GET_CODE (elim) == PLUS)
8177 elim = XEXP (elim, 0);
8178 if (elim == stack_pointer_rtx)
8179 vt_init_cfa_base ();
8182 else if (!crtl->stack_realign_tried)
8186 #ifdef FRAME_POINTER_CFA_OFFSET
8187 reg = frame_pointer_rtx;
8188 fp_cfa_offset = FRAME_POINTER_CFA_OFFSET (current_function_decl);
8190 reg = arg_pointer_rtx;
8191 fp_cfa_offset = ARG_POINTER_CFA_OFFSET (current_function_decl);
8193 elim = eliminate_regs (reg, VOIDmode, NULL_RTX);
8196 if (GET_CODE (elim) == PLUS)
8198 fp_cfa_offset -= INTVAL (XEXP (elim, 1));
8199 elim = XEXP (elim, 0);
8201 if (elim != hard_frame_pointer_rtx)
8204 prologue_bb = single_succ (ENTRY_BLOCK_PTR);
8208 hard_frame_pointer_adjustment = -1;
8213 HOST_WIDE_INT pre, post = 0;
8214 basic_block first_bb, last_bb;
8216 if (MAY_HAVE_DEBUG_INSNS)
8218 cselib_record_sets_hook = add_with_sets;
8219 if (dump_file && (dump_flags & TDF_DETAILS))
8220 fprintf (dump_file, "first value: %i\n",
8221 cselib_get_next_uid ());
8228 if (bb->next_bb == EXIT_BLOCK_PTR
8229 || ! single_pred_p (bb->next_bb))
8231 e = find_edge (bb, bb->next_bb);
8232 if (! e || (e->flags & EDGE_FALLTHRU) == 0)
8238 /* Add the micro-operations to the vector. */
8239 FOR_BB_BETWEEN (bb, first_bb, last_bb->next_bb, next_bb)
8241 HOST_WIDE_INT offset = VTI (bb)->out.stack_adjust;
8242 VTI (bb)->out.stack_adjust = VTI (bb)->in.stack_adjust;
8243 for (insn = BB_HEAD (bb); insn != NEXT_INSN (BB_END (bb));
8244 insn = NEXT_INSN (insn))
8248 if (!frame_pointer_needed)
8250 insn_stack_adjust_offset_pre_post (insn, &pre, &post);
8254 mo.type = MO_ADJUST;
8257 if (dump_file && (dump_flags & TDF_DETAILS))
8258 log_op_type (PATTERN (insn), bb, insn,
8259 MO_ADJUST, dump_file);
8260 VEC_safe_push (micro_operation, heap, VTI (bb)->mos,
8262 VTI (bb)->out.stack_adjust += pre;
8266 cselib_hook_called = false;
8267 adjust_insn (bb, insn);
8268 if (MAY_HAVE_DEBUG_INSNS)
8270 cselib_process_insn (insn);
8271 if (dump_file && (dump_flags & TDF_DETAILS))
8273 print_rtl_single (dump_file, insn);
8274 dump_cselib_table (dump_file);
8277 if (!cselib_hook_called)
8278 add_with_sets (insn, 0, 0);
8281 if (!frame_pointer_needed && post)
8284 mo.type = MO_ADJUST;
8287 if (dump_file && (dump_flags & TDF_DETAILS))
8288 log_op_type (PATTERN (insn), bb, insn,
8289 MO_ADJUST, dump_file);
8290 VEC_safe_push (micro_operation, heap, VTI (bb)->mos,
8292 VTI (bb)->out.stack_adjust += post;
8295 if (bb == prologue_bb
8296 && hard_frame_pointer_adjustment == -1
8297 && RTX_FRAME_RELATED_P (insn)
8298 && fp_setter (insn))
8300 vt_init_cfa_base ();
8301 hard_frame_pointer_adjustment = fp_cfa_offset;
8305 gcc_assert (offset == VTI (bb)->out.stack_adjust);
8310 if (MAY_HAVE_DEBUG_INSNS)
8312 cselib_preserve_only_values ();
8313 cselib_reset_table (cselib_get_next_uid ());
8314 cselib_record_sets_hook = NULL;
8318 hard_frame_pointer_adjustment = -1;
8319 VTI (ENTRY_BLOCK_PTR)->flooded = true;
8320 vt_add_function_parameters ();
8321 cfa_base_rtx = NULL_RTX;
8325 /* Get rid of all debug insns from the insn stream. */
8328 delete_debug_insns (void)
8333 if (!MAY_HAVE_DEBUG_INSNS)
8338 FOR_BB_INSNS_SAFE (bb, insn, next)
8339 if (DEBUG_INSN_P (insn))
8344 /* Run a fast, BB-local only version of var tracking, to take care of
8345 information that we don't do global analysis on, such that not all
8346 information is lost. If SKIPPED holds, we're skipping the global
8347 pass entirely, so we should try to use information it would have
8348 handled as well.. */
8351 vt_debug_insns_local (bool skipped ATTRIBUTE_UNUSED)
8353 /* ??? Just skip it all for now. */
8354 delete_debug_insns ();
8357 /* Free the data structures needed for variable tracking. */
8366 VEC_free (micro_operation, heap, VTI (bb)->mos);
8371 dataflow_set_destroy (&VTI (bb)->in);
8372 dataflow_set_destroy (&VTI (bb)->out);
8373 if (VTI (bb)->permp)
8375 dataflow_set_destroy (VTI (bb)->permp);
8376 XDELETE (VTI (bb)->permp);
8379 free_aux_for_blocks ();
8380 htab_delete (empty_shared_hash->htab);
8381 htab_delete (changed_variables);
8382 free_alloc_pool (attrs_pool);
8383 free_alloc_pool (var_pool);
8384 free_alloc_pool (loc_chain_pool);
8385 free_alloc_pool (shared_hash_pool);
8387 if (MAY_HAVE_DEBUG_INSNS)
8389 htab_delete (value_chains);
8390 free_alloc_pool (value_chain_pool);
8391 free_alloc_pool (valvar_pool);
8392 VEC_free (rtx, heap, preserved_values);
8394 BITMAP_FREE (scratch_regs);
8395 scratch_regs = NULL;
8399 XDELETEVEC (vui_vec);
8404 /* The entry point to variable tracking pass. */
8406 static inline unsigned int
8407 variable_tracking_main_1 (void)
8411 if (flag_var_tracking_assignments < 0)
8413 delete_debug_insns ();
8417 if (n_basic_blocks > 500 && n_edges / n_basic_blocks >= 20)
8419 vt_debug_insns_local (true);
8423 mark_dfs_back_edges ();
8424 if (!vt_initialize ())
8427 vt_debug_insns_local (true);
8431 success = vt_find_locations ();
8433 if (!success && flag_var_tracking_assignments > 0)
8437 delete_debug_insns ();
8439 /* This is later restored by our caller. */
8440 flag_var_tracking_assignments = 0;
8442 success = vt_initialize ();
8443 gcc_assert (success);
8445 success = vt_find_locations ();
8451 vt_debug_insns_local (false);
8455 if (dump_file && (dump_flags & TDF_DETAILS))
8457 dump_dataflow_sets ();
8458 dump_flow_info (dump_file, dump_flags);
8464 vt_debug_insns_local (false);
8469 variable_tracking_main (void)
8472 int save = flag_var_tracking_assignments;
8474 ret = variable_tracking_main_1 ();
8476 flag_var_tracking_assignments = save;
8482 gate_handle_var_tracking (void)
8484 return (flag_var_tracking);
8489 struct rtl_opt_pass pass_variable_tracking =
8493 "vartrack", /* name */
8494 gate_handle_var_tracking, /* gate */
8495 variable_tracking_main, /* execute */
8498 0, /* static_pass_number */
8499 TV_VAR_TRACKING, /* tv_id */
8500 0, /* properties_required */
8501 0, /* properties_provided */
8502 0, /* properties_destroyed */
8503 0, /* todo_flags_start */
8504 TODO_dump_func | TODO_verify_rtl_sharing/* todo_flags_finish */