Mercurial > hg > CbC > CbC_gcc

annotate gcc/tree-ssa-uninit.c @ 138:fc828634a951

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
merge
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Thu, 08 Nov 2018 14:17:14 +0900
parents 84e7813d76e9
children 1830386684a0
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1 /* Predicate aware uninitialized variable warning.
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2 Copyright (C) 2001-2018 Free Software Foundation, Inc.
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
3 Contributed by Xinliang David Li <davidxl@google.com>
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
4
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
5 This file is part of GCC.
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
6
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
7 GCC is free software; you can redistribute it and/or modify
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
8 it under the terms of the GNU General Public License as published by
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
9 the Free Software Foundation; either version 3, or (at your option)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
10 any later version.
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
11
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
12 GCC is distributed in the hope that it will be useful,
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
15 GNU General Public License for more details.
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
16
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
17 You should have received a copy of the GNU General Public License
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
18 along with GCC; see the file COPYING3. If not see
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
19 <http://www.gnu.org/licenses/>. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
20
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
21 #include "config.h"
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
22 #include "system.h"
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
23 #include "coretypes.h"
111
kono
parents: 67
diff changeset
24 #include "backend.h"
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
25 #include "tree.h"
111
kono
parents: 67
diff changeset
26 #include "gimple.h"
kono
parents: 67
diff changeset
27 #include "tree-pass.h"
kono
parents: 67
diff changeset
28 #include "ssa.h"
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
29 #include "gimple-pretty-print.h"
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
30 #include "diagnostic-core.h"
111
kono
parents: 67
diff changeset
31 #include "fold-const.h"
kono
parents: 67
diff changeset
32 #include "gimple-iterator.h"
kono
parents: 67
diff changeset
33 #include "tree-ssa.h"
kono
parents: 67
diff changeset
34 #include "params.h"
kono
parents: 67
diff changeset
35 #include "tree-cfg.h"
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
36 #include "cfghooks.h"
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
37
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
38 /* This implements the pass that does predicate aware warning on uses of
111
kono
parents: 67
diff changeset
39 possibly uninitialized variables. The pass first collects the set of
kono
parents: 67
diff changeset
40 possibly uninitialized SSA names. For each such name, it walks through
kono
parents: 67
diff changeset
41 all its immediate uses. For each immediate use, it rebuilds the condition
kono
parents: 67
diff changeset
42 expression (the predicate) that guards the use. The predicate is then
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
43 examined to see if the variable is always defined under that same condition.
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
44 This is done either by pruning the unrealizable paths that lead to the
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
45 default definitions or by checking if the predicate set that guards the
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
46 defining paths is a superset of the use predicate. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
47
111
kono
parents: 67
diff changeset
48 /* Max PHI args we can handle in pass. */
kono
parents: 67
diff changeset
49 const unsigned max_phi_args = 32;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
50
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
51 /* Pointer set of potentially undefined ssa names, i.e.,
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
52 ssa names that are defined by phi with operands that
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
53 are not defined or potentially undefined. */
111
kono
parents: 67
diff changeset
54 static hash_set<tree> *possibly_undefined_names = 0;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
55
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
56 /* Bit mask handling macros. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
57 #define MASK_SET_BIT(mask, pos) mask |= (1 << pos)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
58 #define MASK_TEST_BIT(mask, pos) (mask & (1 << pos))
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
59 #define MASK_EMPTY(mask) (mask == 0)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
60
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
61 /* Returns the first bit position (starting from LSB)
111
kono
parents: 67
diff changeset
62 in mask that is non zero. Returns -1 if the mask is empty. */
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
63 static int
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
64 get_mask_first_set_bit (unsigned mask)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
65 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
66 int pos = 0;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
67 if (mask == 0)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
68 return -1;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
69
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
70 while ((mask & (1 << pos)) == 0)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
71 pos++;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
72
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
73 return pos;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
74 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
75 #define MASK_FIRST_SET_BIT(mask) get_mask_first_set_bit (mask)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
76
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
77 /* Return true if T, an SSA_NAME, has an undefined value. */
111
kono
parents: 67
diff changeset
78 static bool
kono
parents: 67
diff changeset
79 has_undefined_value_p (tree t)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
80 {
111
kono
parents: 67
diff changeset
81 return (ssa_undefined_value_p (t)
kono
parents: 67
diff changeset
82 || (possibly_undefined_names
kono
parents: 67
diff changeset
83 && possibly_undefined_names->contains (t)));
kono
parents: 67
diff changeset
84 }
kono
parents: 67
diff changeset
85
kono
parents: 67
diff changeset
86 /* Like has_undefined_value_p, but don't return true if TREE_NO_WARNING
kono
parents: 67
diff changeset
87 is set on SSA_NAME_VAR. */
kono
parents: 67
diff changeset
88
kono
parents: 67
diff changeset
89 static inline bool
kono
parents: 67
diff changeset
90 uninit_undefined_value_p (tree t)
kono
parents: 67
diff changeset
91 {
kono
parents: 67
diff changeset
92 if (!has_undefined_value_p (t))
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
93 return false;
111
kono
parents: 67
diff changeset
94 if (SSA_NAME_VAR (t) && TREE_NO_WARNING (SSA_NAME_VAR (t)))
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
95 return false;
111
kono
parents: 67
diff changeset
96 return true;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
97 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
98
111
kono
parents: 67
diff changeset
99 /* Emit warnings for uninitialized variables. This is done in two passes.
kono
parents: 67
diff changeset
100
kono
parents: 67
diff changeset
101 The first pass notices real uses of SSA names with undefined values.
kono
parents: 67
diff changeset
102 Such uses are unconditionally uninitialized, and we can be certain that
kono
parents: 67
diff changeset
103 such a use is a mistake. This pass is run before most optimizations,
kono
parents: 67
diff changeset
104 so that we catch as many as we can.
kono
parents: 67
diff changeset
105
kono
parents: 67
diff changeset
106 The second pass follows PHI nodes to find uses that are potentially
kono
parents: 67
diff changeset
107 uninitialized. In this case we can't necessarily prove that the use
kono
parents: 67
diff changeset
108 is really uninitialized. This pass is run after most optimizations,
kono
parents: 67
diff changeset
109 so that we thread as many jumps and possible, and delete as much dead
kono
parents: 67
diff changeset
110 code as possible, in order to reduce false positives. We also look
kono
parents: 67
diff changeset
111 again for plain uninitialized variables, since optimization may have
kono
parents: 67
diff changeset
112 changed conditionally uninitialized to unconditionally uninitialized. */
kono
parents: 67
diff changeset
113
kono
parents: 67
diff changeset
114 /* Emit a warning for EXPR based on variable VAR at the point in the
kono
parents: 67
diff changeset
115 program T, an SSA_NAME, is used being uninitialized. The exact
kono
parents: 67
diff changeset
116 warning text is in MSGID and DATA is the gimple stmt with info about
kono
parents: 67
diff changeset
117 the location in source code. When DATA is a GIMPLE_PHI, PHIARG_IDX
kono
parents: 67
diff changeset
118 gives which argument of the phi node to take the location from. WC
kono
parents: 67
diff changeset
119 is the warning code. */
kono
parents: 67
diff changeset
120
kono
parents: 67
diff changeset
121 static void
kono
parents: 67
diff changeset
122 warn_uninit (enum opt_code wc, tree t, tree expr, tree var,
kono
parents: 67
diff changeset
123 const char *gmsgid, void *data, location_t phiarg_loc)
kono
parents: 67
diff changeset
124 {
kono
parents: 67
diff changeset
125 gimple *context = (gimple *) data;
kono
parents: 67
diff changeset
126 location_t location, cfun_loc;
kono
parents: 67
diff changeset
127 expanded_location xloc, floc;
kono
parents: 67
diff changeset
128
kono
parents: 67
diff changeset
129 /* Ignore COMPLEX_EXPR as initializing only a part of a complex
kono
parents: 67
diff changeset
130 turns in a COMPLEX_EXPR with the not initialized part being
kono
parents: 67
diff changeset
131 set to its previous (undefined) value. */
kono
parents: 67
diff changeset
132 if (is_gimple_assign (context)
kono
parents: 67
diff changeset
133 && gimple_assign_rhs_code (context) == COMPLEX_EXPR)
kono
parents: 67
diff changeset
134 return;
kono
parents: 67
diff changeset
135 if (!has_undefined_value_p (t))
kono
parents: 67
diff changeset
136 return;
kono
parents: 67
diff changeset
137
kono
parents: 67
diff changeset
138 /* Anonymous SSA_NAMEs shouldn't be uninitialized, but ssa_undefined_value_p
kono
parents: 67
diff changeset
139 can return true if the def stmt of anonymous SSA_NAME is COMPLEX_EXPR
kono
parents: 67
diff changeset
140 created for conversion from scalar to complex. Use the underlying var of
kono
parents: 67
diff changeset
141 the COMPLEX_EXPRs real part in that case. See PR71581. */
kono
parents: 67
diff changeset
142 if (expr == NULL_TREE
kono
parents: 67
diff changeset
143 && var == NULL_TREE
kono
parents: 67
diff changeset
144 && SSA_NAME_VAR (t) == NULL_TREE
kono
parents: 67
diff changeset
145 && is_gimple_assign (SSA_NAME_DEF_STMT (t))
kono
parents: 67
diff changeset
146 && gimple_assign_rhs_code (SSA_NAME_DEF_STMT (t)) == COMPLEX_EXPR)
kono
parents: 67
diff changeset
147 {
kono
parents: 67
diff changeset
148 tree v = gimple_assign_rhs1 (SSA_NAME_DEF_STMT (t));
kono
parents: 67
diff changeset
149 if (TREE_CODE (v) == SSA_NAME
kono
parents: 67
diff changeset
150 && has_undefined_value_p (v)
kono
parents: 67
diff changeset
151 && zerop (gimple_assign_rhs2 (SSA_NAME_DEF_STMT (t))))
kono
parents: 67
diff changeset
152 {
kono
parents: 67
diff changeset
153 expr = SSA_NAME_VAR (v);
kono
parents: 67
diff changeset
154 var = expr;
kono
parents: 67
diff changeset
155 }
kono
parents: 67
diff changeset
156 }
kono
parents: 67
diff changeset
157
kono
parents: 67
diff changeset
158 if (expr == NULL_TREE)
kono
parents: 67
diff changeset
159 return;
kono
parents: 67
diff changeset
160
kono
parents: 67
diff changeset
161 /* TREE_NO_WARNING either means we already warned, or the front end
kono
parents: 67
diff changeset
162 wishes to suppress the warning. */
kono
parents: 67
diff changeset
163 if ((context
kono
parents: 67
diff changeset
164 && (gimple_no_warning_p (context)
kono
parents: 67
diff changeset
165 || (gimple_assign_single_p (context)
kono
parents: 67
diff changeset
166 && TREE_NO_WARNING (gimple_assign_rhs1 (context)))))
kono
parents: 67
diff changeset
167 || TREE_NO_WARNING (expr))
kono
parents: 67
diff changeset
168 return;
kono
parents: 67
diff changeset
169
kono
parents: 67
diff changeset
170 if (context != NULL && gimple_has_location (context))
kono
parents: 67
diff changeset
171 location = gimple_location (context);
kono
parents: 67
diff changeset
172 else if (phiarg_loc != UNKNOWN_LOCATION)
kono
parents: 67
diff changeset
173 location = phiarg_loc;
kono
parents: 67
diff changeset
174 else
kono
parents: 67
diff changeset
175 location = DECL_SOURCE_LOCATION (var);
kono
parents: 67
diff changeset
176 location = linemap_resolve_location (line_table, location,
kono
parents: 67
diff changeset
177 LRK_SPELLING_LOCATION, NULL);
kono
parents: 67
diff changeset
178 cfun_loc = DECL_SOURCE_LOCATION (cfun->decl);
kono
parents: 67
diff changeset
179 xloc = expand_location (location);
kono
parents: 67
diff changeset
180 floc = expand_location (cfun_loc);
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
181 auto_diagnostic_group d;
111
kono
parents: 67
diff changeset
182 if (warning_at (location, wc, gmsgid, expr))
kono
parents: 67
diff changeset
183 {
kono
parents: 67
diff changeset
184 TREE_NO_WARNING (expr) = 1;
kono
parents: 67
diff changeset
185
kono
parents: 67
diff changeset
186 if (location == DECL_SOURCE_LOCATION (var))
kono
parents: 67
diff changeset
187 return;
kono
parents: 67
diff changeset
188 if (xloc.file != floc.file
kono
parents: 67
diff changeset
189 || linemap_location_before_p (line_table, location, cfun_loc)
kono
parents: 67
diff changeset
190 || linemap_location_before_p (line_table, cfun->function_end_locus,
kono
parents: 67
diff changeset
191 location))
kono
parents: 67
diff changeset
192 inform (DECL_SOURCE_LOCATION (var), "%qD was declared here", var);
kono
parents: 67
diff changeset
193 }
kono
parents: 67
diff changeset
194 }
kono
parents: 67
diff changeset
195
kono
parents: 67
diff changeset
196 struct check_defs_data
kono
parents: 67
diff changeset
197 {
kono
parents: 67
diff changeset
198 /* If we found any may-defs besides must-def clobbers. */
kono
parents: 67
diff changeset
199 bool found_may_defs;
kono
parents: 67
diff changeset
200 };
kono
parents: 67
diff changeset
201
kono
parents: 67
diff changeset
202 /* Callback for walk_aliased_vdefs. */
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
203
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
204 static bool
111
kono
parents: 67
diff changeset
205 check_defs (ao_ref *ref, tree vdef, void *data_)
kono
parents: 67
diff changeset
206 {
kono
parents: 67
diff changeset
207 check_defs_data *data = (check_defs_data *)data_;
kono
parents: 67
diff changeset
208 gimple *def_stmt = SSA_NAME_DEF_STMT (vdef);
kono
parents: 67
diff changeset
209 /* If this is a clobber then if it is not a kill walk past it. */
kono
parents: 67
diff changeset
210 if (gimple_clobber_p (def_stmt))
kono
parents: 67
diff changeset
211 {
kono
parents: 67
diff changeset
212 if (stmt_kills_ref_p (def_stmt, ref))
kono
parents: 67
diff changeset
213 return true;
kono
parents: 67
diff changeset
214 return false;
kono
parents: 67
diff changeset
215 }
kono
parents: 67
diff changeset
216 /* Found a may-def on this path. */
kono
parents: 67
diff changeset
217 data->found_may_defs = true;
kono
parents: 67
diff changeset
218 return true;
kono
parents: 67
diff changeset
219 }
kono
parents: 67
diff changeset
220
kono
parents: 67
diff changeset
221 static unsigned int
kono
parents: 67
diff changeset
222 warn_uninitialized_vars (bool warn_possibly_uninitialized)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
223 {
111
kono
parents: 67
diff changeset
224 gimple_stmt_iterator gsi;
kono
parents: 67
diff changeset
225 basic_block bb;
kono
parents: 67
diff changeset
226 unsigned int vdef_cnt = 0;
kono
parents: 67
diff changeset
227 unsigned int oracle_cnt = 0;
kono
parents: 67
diff changeset
228 unsigned limit = 0;
kono
parents: 67
diff changeset
229
kono
parents: 67
diff changeset
230 FOR_EACH_BB_FN (bb, cfun)
kono
parents: 67
diff changeset
231 {
kono
parents: 67
diff changeset
232 basic_block succ = single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun));
kono
parents: 67
diff changeset
233 bool always_executed = dominated_by_p (CDI_POST_DOMINATORS, succ, bb);
kono
parents: 67
diff changeset
234 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
kono
parents: 67
diff changeset
235 {
kono
parents: 67
diff changeset
236 gimple *stmt = gsi_stmt (gsi);
kono
parents: 67
diff changeset
237 use_operand_p use_p;
kono
parents: 67
diff changeset
238 ssa_op_iter op_iter;
kono
parents: 67
diff changeset
239 tree use;
kono
parents: 67
diff changeset
240
kono
parents: 67
diff changeset
241 if (is_gimple_debug (stmt))
kono
parents: 67
diff changeset
242 continue;
kono
parents: 67
diff changeset
243
kono
parents: 67
diff changeset
244 /* We only do data flow with SSA_NAMEs, so that's all we
kono
parents: 67
diff changeset
245 can warn about. */
kono
parents: 67
diff changeset
246 FOR_EACH_SSA_USE_OPERAND (use_p, stmt, op_iter, SSA_OP_USE)
kono
parents: 67
diff changeset
247 {
kono
parents: 67
diff changeset
248 /* BIT_INSERT_EXPR first operand should not be considered
kono
parents: 67
diff changeset
249 a use for the purpose of uninit warnings. */
kono
parents: 67
diff changeset
250 if (gassign *ass = dyn_cast <gassign *> (stmt))
kono
parents: 67
diff changeset
251 {
kono
parents: 67
diff changeset
252 if (gimple_assign_rhs_code (ass) == BIT_INSERT_EXPR
kono
parents: 67
diff changeset
253 && use_p->use == gimple_assign_rhs1_ptr (ass))
kono
parents: 67
diff changeset
254 continue;
kono
parents: 67
diff changeset
255 }
kono
parents: 67
diff changeset
256 use = USE_FROM_PTR (use_p);
kono
parents: 67
diff changeset
257 if (always_executed)
kono
parents: 67
diff changeset
258 warn_uninit (OPT_Wuninitialized, use, SSA_NAME_VAR (use),
kono
parents: 67
diff changeset
259 SSA_NAME_VAR (use),
kono
parents: 67
diff changeset
260 "%qD is used uninitialized in this function", stmt,
kono
parents: 67
diff changeset
261 UNKNOWN_LOCATION);
kono
parents: 67
diff changeset
262 else if (warn_possibly_uninitialized)
kono
parents: 67
diff changeset
263 warn_uninit (OPT_Wmaybe_uninitialized, use, SSA_NAME_VAR (use),
kono
parents: 67
diff changeset
264 SSA_NAME_VAR (use),
kono
parents: 67
diff changeset
265 "%qD may be used uninitialized in this function",
kono
parents: 67
diff changeset
266 stmt, UNKNOWN_LOCATION);
kono
parents: 67
diff changeset
267 }
kono
parents: 67
diff changeset
268
kono
parents: 67
diff changeset
269 /* For limiting the alias walk below we count all
kono
parents: 67
diff changeset
270 vdefs in the function. */
kono
parents: 67
diff changeset
271 if (gimple_vdef (stmt))
kono
parents: 67
diff changeset
272 vdef_cnt++;
kono
parents: 67
diff changeset
273
kono
parents: 67
diff changeset
274 if (gimple_assign_load_p (stmt)
kono
parents: 67
diff changeset
275 && gimple_has_location (stmt))
kono
parents: 67
diff changeset
276 {
kono
parents: 67
diff changeset
277 tree rhs = gimple_assign_rhs1 (stmt);
kono
parents: 67
diff changeset
278 tree lhs = gimple_assign_lhs (stmt);
kono
parents: 67
diff changeset
279 bool has_bit_insert = false;
kono
parents: 67
diff changeset
280 use_operand_p luse_p;
kono
parents: 67
diff changeset
281 imm_use_iterator liter;
kono
parents: 67
diff changeset
282
kono
parents: 67
diff changeset
283 if (TREE_NO_WARNING (rhs))
kono
parents: 67
diff changeset
284 continue;
kono
parents: 67
diff changeset
285
kono
parents: 67
diff changeset
286 ao_ref ref;
kono
parents: 67
diff changeset
287 ao_ref_init (&ref, rhs);
kono
parents: 67
diff changeset
288
kono
parents: 67
diff changeset
289 /* Do not warn if the base was marked so or this is a
kono
parents: 67
diff changeset
290 hard register var. */
kono
parents: 67
diff changeset
291 tree base = ao_ref_base (&ref);
kono
parents: 67
diff changeset
292 if ((VAR_P (base)
kono
parents: 67
diff changeset
293 && DECL_HARD_REGISTER (base))
kono
parents: 67
diff changeset
294 || TREE_NO_WARNING (base))
kono
parents: 67
diff changeset
295 continue;
kono
parents: 67
diff changeset
296
kono
parents: 67
diff changeset
297 /* Do not warn if the access is fully outside of the
kono
parents: 67
diff changeset
298 variable. */
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
299 poly_int64 decl_size;
111
kono
parents: 67
diff changeset
300 if (DECL_P (base)
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
301 && known_size_p (ref.size)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
302 && ((known_eq (ref.max_size, ref.size)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
303 && known_le (ref.offset + ref.size, 0))
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
304 || (known_ge (ref.offset, 0)
111
kono
parents: 67
diff changeset
305 && DECL_SIZE (base)
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
306 && poly_int_tree_p (DECL_SIZE (base), &decl_size)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
307 && known_le (decl_size, ref.offset))))
111
kono
parents: 67
diff changeset
308 continue;
kono
parents: 67
diff changeset
309
kono
parents: 67
diff changeset
310 /* Do not warn if the access is then used for a BIT_INSERT_EXPR. */
kono
parents: 67
diff changeset
311 if (TREE_CODE (lhs) == SSA_NAME)
kono
parents: 67
diff changeset
312 FOR_EACH_IMM_USE_FAST (luse_p, liter, lhs)
kono
parents: 67
diff changeset
313 {
kono
parents: 67
diff changeset
314 gimple *use_stmt = USE_STMT (luse_p);
kono
parents: 67
diff changeset
315 /* BIT_INSERT_EXPR first operand should not be considered
kono
parents: 67
diff changeset
316 a use for the purpose of uninit warnings. */
kono
parents: 67
diff changeset
317 if (gassign *ass = dyn_cast <gassign *> (use_stmt))
kono
parents: 67
diff changeset
318 {
kono
parents: 67
diff changeset
319 if (gimple_assign_rhs_code (ass) == BIT_INSERT_EXPR
kono
parents: 67
diff changeset
320 && luse_p->use == gimple_assign_rhs1_ptr (ass))
kono
parents: 67
diff changeset
321 {
kono
parents: 67
diff changeset
322 has_bit_insert = true;
kono
parents: 67
diff changeset
323 break;
kono
parents: 67
diff changeset
324 }
kono
parents: 67
diff changeset
325 }
kono
parents: 67
diff changeset
326 }
kono
parents: 67
diff changeset
327 if (has_bit_insert)
kono
parents: 67
diff changeset
328 continue;
kono
parents: 67
diff changeset
329
kono
parents: 67
diff changeset
330 /* Limit the walking to a constant number of stmts after
kono
parents: 67
diff changeset
331 we overcommit quadratic behavior for small functions
kono
parents: 67
diff changeset
332 and O(n) behavior. */
kono
parents: 67
diff changeset
333 if (oracle_cnt > 128 * 128
kono
parents: 67
diff changeset
334 && oracle_cnt > vdef_cnt * 2)
kono
parents: 67
diff changeset
335 limit = 32;
kono
parents: 67
diff changeset
336 check_defs_data data;
kono
parents: 67
diff changeset
337 bool fentry_reached = false;
kono
parents: 67
diff changeset
338 data.found_may_defs = false;
kono
parents: 67
diff changeset
339 use = gimple_vuse (stmt);
kono
parents: 67
diff changeset
340 int res = walk_aliased_vdefs (&ref, use,
kono
parents: 67
diff changeset
341 check_defs, &data, NULL,
kono
parents: 67
diff changeset
342 &fentry_reached, limit);
kono
parents: 67
diff changeset
343 if (res == -1)
kono
parents: 67
diff changeset
344 {
kono
parents: 67
diff changeset
345 oracle_cnt += limit;
kono
parents: 67
diff changeset
346 continue;
kono
parents: 67
diff changeset
347 }
kono
parents: 67
diff changeset
348 oracle_cnt += res;
kono
parents: 67
diff changeset
349 if (data.found_may_defs)
kono
parents: 67
diff changeset
350 continue;
kono
parents: 67
diff changeset
351 /* Do not warn if it can be initialized outside this function.
kono
parents: 67
diff changeset
352 If we did not reach function entry then we found killing
kono
parents: 67
diff changeset
353 clobbers on all paths to entry. */
kono
parents: 67
diff changeset
354 if (fentry_reached
kono
parents: 67
diff changeset
355 /* ??? We'd like to use ref_may_alias_global_p but that
kono
parents: 67
diff changeset
356 excludes global readonly memory and thus we get bougs
kono
parents: 67
diff changeset
357 warnings from p = cond ? "a" : "b" for example. */
kono
parents: 67
diff changeset
358 && (!VAR_P (base)
kono
parents: 67
diff changeset
359 || is_global_var (base)))
kono
parents: 67
diff changeset
360 continue;
kono
parents: 67
diff changeset
361
kono
parents: 67
diff changeset
362 /* We didn't find any may-defs so on all paths either
kono
parents: 67
diff changeset
363 reached function entry or a killing clobber. */
kono
parents: 67
diff changeset
364 location_t location
kono
parents: 67
diff changeset
365 = linemap_resolve_location (line_table, gimple_location (stmt),
kono
parents: 67
diff changeset
366 LRK_SPELLING_LOCATION, NULL);
kono
parents: 67
diff changeset
367 if (always_executed)
kono
parents: 67
diff changeset
368 {
kono
parents: 67
diff changeset
369 if (warning_at (location, OPT_Wuninitialized,
kono
parents: 67
diff changeset
370 "%qE is used uninitialized in this function",
kono
parents: 67
diff changeset
371 rhs))
kono
parents: 67
diff changeset
372 /* ??? This is only effective for decls as in
kono
parents: 67
diff changeset
373 gcc.dg/uninit-B-O0.c. Avoid doing this for
kono
parents: 67
diff changeset
374 maybe-uninit uses as it may hide important
kono
parents: 67
diff changeset
375 locations. */
kono
parents: 67
diff changeset
376 TREE_NO_WARNING (rhs) = 1;
kono
parents: 67
diff changeset
377 }
kono
parents: 67
diff changeset
378 else if (warn_possibly_uninitialized)
kono
parents: 67
diff changeset
379 warning_at (location, OPT_Wmaybe_uninitialized,
kono
parents: 67
diff changeset
380 "%qE may be used uninitialized in this function",
kono
parents: 67
diff changeset
381 rhs);
kono
parents: 67
diff changeset
382 }
kono
parents: 67
diff changeset
383 }
kono
parents: 67
diff changeset
384 }
kono
parents: 67
diff changeset
385
kono
parents: 67
diff changeset
386 return 0;
kono
parents: 67
diff changeset
387 }
kono
parents: 67
diff changeset
388
kono
parents: 67
diff changeset
389 /* Checks if the operand OPND of PHI is defined by
kono
parents: 67
diff changeset
390 another phi with one operand defined by this PHI,
kono
parents: 67
diff changeset
391 but the rest operands are all defined. If yes,
kono
parents: 67
diff changeset
392 returns true to skip this operand as being
kono
parents: 67
diff changeset
393 redundant. Can be enhanced to be more general. */
kono
parents: 67
diff changeset
394
kono
parents: 67
diff changeset
395 static bool
kono
parents: 67
diff changeset
396 can_skip_redundant_opnd (tree opnd, gimple *phi)
kono
parents: 67
diff changeset
397 {
kono
parents: 67
diff changeset
398 gimple *op_def;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
399 tree phi_def;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
400 int i, n;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
401
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
402 phi_def = gimple_phi_result (phi);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
403 op_def = SSA_NAME_DEF_STMT (opnd);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
404 if (gimple_code (op_def) != GIMPLE_PHI)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
405 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
406 n = gimple_phi_num_args (op_def);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
407 for (i = 0; i < n; ++i)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
408 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
409 tree op = gimple_phi_arg_def (op_def, i);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
410 if (TREE_CODE (op) != SSA_NAME)
111
kono
parents: 67
diff changeset
411 continue;
kono
parents: 67
diff changeset
412 if (op != phi_def && uninit_undefined_value_p (op))
kono
parents: 67
diff changeset
413 return false;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
414 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
415
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
416 return true;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
417 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
418
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
419 /* Returns a bit mask holding the positions of arguments in PHI
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
420 that have empty (or possibly empty) definitions. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
421
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
422 static unsigned
111
kono
parents: 67
diff changeset
423 compute_uninit_opnds_pos (gphi *phi)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
424 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
425 size_t i, n;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
426 unsigned uninit_opnds = 0;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
427
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
428 n = gimple_phi_num_args (phi);
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
429 /* Bail out for phi with too many args. */
111
kono
parents: 67
diff changeset
430 if (n > max_phi_args)
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
431 return 0;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
432
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
433 for (i = 0; i < n; ++i)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
434 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
435 tree op = gimple_phi_arg_def (phi, i);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
436 if (TREE_CODE (op) == SSA_NAME
111
kono
parents: 67
diff changeset
437 && uninit_undefined_value_p (op)
kono
parents: 67
diff changeset
438 && !can_skip_redundant_opnd (op, phi))
kono
parents: 67
diff changeset
439 {
kono
parents: 67
diff changeset
440 if (cfun->has_nonlocal_label || cfun->calls_setjmp)
kono
parents: 67
diff changeset
441 {
kono
parents: 67
diff changeset
442 /* Ignore SSA_NAMEs that appear on abnormal edges
kono
parents: 67
diff changeset
443 somewhere. */
kono
parents: 67
diff changeset
444 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (op))
kono
parents: 67
diff changeset
445 continue;
kono
parents: 67
diff changeset
446 }
kono
parents: 67
diff changeset
447 MASK_SET_BIT (uninit_opnds, i);
kono
parents: 67
diff changeset
448 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
449 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
450 return uninit_opnds;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
451 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
452
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
453 /* Find the immediate postdominator PDOM of the specified
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
454 basic block BLOCK. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
455
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
456 static inline basic_block
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
457 find_pdom (basic_block block)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
458 {
111
kono
parents: 67
diff changeset
459 if (block == EXIT_BLOCK_PTR_FOR_FN (cfun))
kono
parents: 67
diff changeset
460 return EXIT_BLOCK_PTR_FOR_FN (cfun);
kono
parents: 67
diff changeset
461 else
kono
parents: 67
diff changeset
462 {
kono
parents: 67
diff changeset
463 basic_block bb = get_immediate_dominator (CDI_POST_DOMINATORS, block);
kono
parents: 67
diff changeset
464 if (!bb)
kono
parents: 67
diff changeset
465 return EXIT_BLOCK_PTR_FOR_FN (cfun);
kono
parents: 67
diff changeset
466 return bb;
kono
parents: 67
diff changeset
467 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
468 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
469
111
kono
parents: 67
diff changeset
470 /* Find the immediate DOM of the specified basic block BLOCK. */
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
471
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
472 static inline basic_block
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
473 find_dom (basic_block block)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
474 {
111
kono
parents: 67
diff changeset
475 if (block == ENTRY_BLOCK_PTR_FOR_FN (cfun))
kono
parents: 67
diff changeset
476 return ENTRY_BLOCK_PTR_FOR_FN (cfun);
kono
parents: 67
diff changeset
477 else
kono
parents: 67
diff changeset
478 {
kono
parents: 67
diff changeset
479 basic_block bb = get_immediate_dominator (CDI_DOMINATORS, block);
kono
parents: 67
diff changeset
480 if (!bb)
kono
parents: 67
diff changeset
481 return ENTRY_BLOCK_PTR_FOR_FN (cfun);
kono
parents: 67
diff changeset
482 return bb;
kono
parents: 67
diff changeset
483 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
484 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
485
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
486 /* Returns true if BB1 is postdominating BB2 and BB1 is
111
kono
parents: 67
diff changeset
487 not a loop exit bb. The loop exit bb check is simple and does
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
488 not cover all cases. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
489
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
490 static bool
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
491 is_non_loop_exit_postdominating (basic_block bb1, basic_block bb2)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
492 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
493 if (!dominated_by_p (CDI_POST_DOMINATORS, bb2, bb1))
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
494 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
495
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
496 if (single_pred_p (bb1) && !single_succ_p (bb2))
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
497 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
498
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
499 return true;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
500 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
501
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
502 /* Find the closest postdominator of a specified BB, which is control
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
503 equivalent to BB. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
504
111
kono
parents: 67
diff changeset
505 static inline basic_block
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
506 find_control_equiv_block (basic_block bb)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
507 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
508 basic_block pdom;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
509
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
510 pdom = find_pdom (bb);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
511
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
512 /* Skip the postdominating bb that is also loop exit. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
513 if (!is_non_loop_exit_postdominating (pdom, bb))
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
514 return NULL;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
515
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
516 if (dominated_by_p (CDI_DOMINATORS, pdom, bb))
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
517 return pdom;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
518
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
519 return NULL;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
520 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
521
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
522 #define MAX_NUM_CHAINS 8
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
523 #define MAX_CHAIN_LEN 5
111
kono
parents: 67
diff changeset
524 #define MAX_POSTDOM_CHECK 8
kono
parents: 67
diff changeset
525 #define MAX_SWITCH_CASES 40
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
526
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
527 /* Computes the control dependence chains (paths of edges)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
528 for DEP_BB up to the dominating basic block BB (the head node of a
111
kono
parents: 67
diff changeset
529 chain should be dominated by it). CD_CHAINS is pointer to an
kono
parents: 67
diff changeset
530 array holding the result chains. CUR_CD_CHAIN is the current
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
531 chain being computed. *NUM_CHAINS is total number of chains. The
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
532 function returns true if the information is successfully computed,
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
533 return false if there is no control dependence or not computed. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
534
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
535 static bool
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
536 compute_control_dep_chain (basic_block bb, basic_block dep_bb,
111
kono
parents: 67
diff changeset
537 vec<edge> *cd_chains,
kono
parents: 67
diff changeset
538 size_t *num_chains,
kono
parents: 67
diff changeset
539 vec<edge> *cur_cd_chain,
kono
parents: 67
diff changeset
540 int *num_calls)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
541 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
542 edge_iterator ei;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
543 edge e;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
544 size_t i;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
545 bool found_cd_chain = false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
546 size_t cur_chain_len = 0;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
547
111
kono
parents: 67
diff changeset
548 if (*num_calls > PARAM_VALUE (PARAM_UNINIT_CONTROL_DEP_ATTEMPTS))
kono
parents: 67
diff changeset
549 return false;
kono
parents: 67
diff changeset
550 ++*num_calls;
kono
parents: 67
diff changeset
551
kono
parents: 67
diff changeset
552 /* Could use a set instead. */
kono
parents: 67
diff changeset
553 cur_chain_len = cur_cd_chain->length ();
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
554 if (cur_chain_len > MAX_CHAIN_LEN)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
555 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
556
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
557 for (i = 0; i < cur_chain_len; i++)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
558 {
111
kono
parents: 67
diff changeset
559 edge e = (*cur_cd_chain)[i];
kono
parents: 67
diff changeset
560 /* Cycle detected. */
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
561 if (e->src == bb)
111
kono
parents: 67
diff changeset
562 return false;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
563 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
564
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
565 FOR_EACH_EDGE (e, ei, bb->succs)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
566 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
567 basic_block cd_bb;
111
kono
parents: 67
diff changeset
568 int post_dom_check = 0;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
569 if (e->flags & (EDGE_FAKE | EDGE_ABNORMAL))
111
kono
parents: 67
diff changeset
570 continue;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
571
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
572 cd_bb = e->dest;
111
kono
parents: 67
diff changeset
573 cur_cd_chain->safe_push (e);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
574 while (!is_non_loop_exit_postdominating (cd_bb, bb))
111
kono
parents: 67
diff changeset
575 {
kono
parents: 67
diff changeset
576 if (cd_bb == dep_bb)
kono
parents: 67
diff changeset
577 {
kono
parents: 67
diff changeset
578 /* Found a direct control dependence. */
kono
parents: 67
diff changeset
579 if (*num_chains < MAX_NUM_CHAINS)
kono
parents: 67
diff changeset
580 {
kono
parents: 67
diff changeset
581 cd_chains[*num_chains] = cur_cd_chain->copy ();
kono
parents: 67
diff changeset
582 (*num_chains)++;
kono
parents: 67
diff changeset
583 }
kono
parents: 67
diff changeset
584 found_cd_chain = true;
kono
parents: 67
diff changeset
585 /* Check path from next edge. */
kono
parents: 67
diff changeset
586 break;
kono
parents: 67
diff changeset
587 }
kono
parents: 67
diff changeset
588
kono
parents: 67
diff changeset
589 /* Now check if DEP_BB is indirectly control dependent on BB. */
kono
parents: 67
diff changeset
590 if (compute_control_dep_chain (cd_bb, dep_bb, cd_chains, num_chains,
kono
parents: 67
diff changeset
591 cur_cd_chain, num_calls))
kono
parents: 67
diff changeset
592 {
kono
parents: 67
diff changeset
593 found_cd_chain = true;
kono
parents: 67
diff changeset
594 break;
kono
parents: 67
diff changeset
595 }
kono
parents: 67
diff changeset
596
kono
parents: 67
diff changeset
597 cd_bb = find_pdom (cd_bb);
kono
parents: 67
diff changeset
598 post_dom_check++;
kono
parents: 67
diff changeset
599 if (cd_bb == EXIT_BLOCK_PTR_FOR_FN (cfun)
kono
parents: 67
diff changeset
600 || post_dom_check > MAX_POSTDOM_CHECK)
kono
parents: 67
diff changeset
601 break;
kono
parents: 67
diff changeset
602 }
kono
parents: 67
diff changeset
603 cur_cd_chain->pop ();
kono
parents: 67
diff changeset
604 gcc_assert (cur_cd_chain->length () == cur_chain_len);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
605 }
111
kono
parents: 67
diff changeset
606 gcc_assert (cur_cd_chain->length () == cur_chain_len);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
607
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
608 return found_cd_chain;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
609 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
610
111
kono
parents: 67
diff changeset
611 /* The type to represent a simple predicate. */
kono
parents: 67
diff changeset
612
kono
parents: 67
diff changeset
613 struct pred_info
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
614 {
111
kono
parents: 67
diff changeset
615 tree pred_lhs;
kono
parents: 67
diff changeset
616 tree pred_rhs;
kono
parents: 67
diff changeset
617 enum tree_code cond_code;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
618 bool invert;
111
kono
parents: 67
diff changeset
619 };
kono
parents: 67
diff changeset
620
kono
parents: 67
diff changeset
621 /* The type to represent a sequence of predicates grouped
kono
parents: 67
diff changeset
622 with .AND. operation. */
kono
parents: 67
diff changeset
623
kono
parents: 67
diff changeset
624 typedef vec<pred_info, va_heap, vl_ptr> pred_chain;
kono
parents: 67
diff changeset
625
kono
parents: 67
diff changeset
626 /* The type to represent a sequence of pred_chains grouped
kono
parents: 67
diff changeset
627 with .OR. operation. */
kono
parents: 67
diff changeset
628
kono
parents: 67
diff changeset
629 typedef vec<pred_chain, va_heap, vl_ptr> pred_chain_union;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
630
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
631 /* Converts the chains of control dependence edges into a set of
111
kono
parents: 67
diff changeset
632 predicates. A control dependence chain is represented by a vector
kono
parents: 67
diff changeset
633 edges. DEP_CHAINS points to an array of dependence chains.
kono
parents: 67
diff changeset
634 NUM_CHAINS is the size of the chain array. One edge in a dependence
kono
parents: 67
diff changeset
635 chain is mapped to predicate expression represented by pred_info
kono
parents: 67
diff changeset
636 type. One dependence chain is converted to a composite predicate that
kono
parents: 67
diff changeset
637 is the result of AND operation of pred_info mapped to each edge.
kono
parents: 67
diff changeset
638 A composite predicate is presented by a vector of pred_info. On
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
639 return, *PREDS points to the resulting array of composite predicates.
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
640 *NUM_PREDS is the number of composite predictes. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
641
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
642 static bool
111
kono
parents: 67
diff changeset
643 convert_control_dep_chain_into_preds (vec<edge> *dep_chains,
kono
parents: 67
diff changeset
644 size_t num_chains,
kono
parents: 67
diff changeset
645 pred_chain_union *preds)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
646 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
647 bool has_valid_pred = false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
648 size_t i, j;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
649 if (num_chains == 0 || num_chains >= MAX_NUM_CHAINS)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
650 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
651
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
652 /* Now convert the control dep chain into a set
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
653 of predicates. */
111
kono
parents: 67
diff changeset
654 preds->reserve (num_chains);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
655
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
656 for (i = 0; i < num_chains; i++)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
657 {
111
kono
parents: 67
diff changeset
658 vec<edge> one_cd_chain = dep_chains[i];
kono
parents: 67
diff changeset
659
kono
parents: 67
diff changeset
660 has_valid_pred = false;
kono
parents: 67
diff changeset
661 pred_chain t_chain = vNULL;
kono
parents: 67
diff changeset
662 for (j = 0; j < one_cd_chain.length (); j++)
kono
parents: 67
diff changeset
663 {
kono
parents: 67
diff changeset
664 gimple *cond_stmt;
kono
parents: 67
diff changeset
665 gimple_stmt_iterator gsi;
kono
parents: 67
diff changeset
666 basic_block guard_bb;
kono
parents: 67
diff changeset
667 pred_info one_pred;
kono
parents: 67
diff changeset
668 edge e;
kono
parents: 67
diff changeset
669
kono
parents: 67
diff changeset
670 e = one_cd_chain[j];
kono
parents: 67
diff changeset
671 guard_bb = e->src;
kono
parents: 67
diff changeset
672 gsi = gsi_last_bb (guard_bb);
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
673 /* Ignore empty forwarder blocks. */
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
674 if (empty_block_p (guard_bb) && single_succ_p (guard_bb))
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
675 continue;
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
676 /* An empty basic block here is likely a PHI, and is not one
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
677 of the cases we handle below. */
111
kono
parents: 67
diff changeset
678 if (gsi_end_p (gsi))
kono
parents: 67
diff changeset
679 {
kono
parents: 67
diff changeset
680 has_valid_pred = false;
kono
parents: 67
diff changeset
681 break;
kono
parents: 67
diff changeset
682 }
kono
parents: 67
diff changeset
683 cond_stmt = gsi_stmt (gsi);
kono
parents: 67
diff changeset
684 if (is_gimple_call (cond_stmt) && EDGE_COUNT (e->src->succs) >= 2)
kono
parents: 67
diff changeset
685 /* Ignore EH edge. Can add assertion on the other edge's flag. */
kono
parents: 67
diff changeset
686 continue;
kono
parents: 67
diff changeset
687 /* Skip if there is essentially one succesor. */
kono
parents: 67
diff changeset
688 if (EDGE_COUNT (e->src->succs) == 2)
kono
parents: 67
diff changeset
689 {
kono
parents: 67
diff changeset
690 edge e1;
kono
parents: 67
diff changeset
691 edge_iterator ei1;
kono
parents: 67
diff changeset
692 bool skip = false;
kono
parents: 67
diff changeset
693
kono
parents: 67
diff changeset
694 FOR_EACH_EDGE (e1, ei1, e->src->succs)
kono
parents: 67
diff changeset
695 {
kono
parents: 67
diff changeset
696 if (EDGE_COUNT (e1->dest->succs) == 0)
kono
parents: 67
diff changeset
697 {
kono
parents: 67
diff changeset
698 skip = true;
kono
parents: 67
diff changeset
699 break;
kono
parents: 67
diff changeset
700 }
kono
parents: 67
diff changeset
701 }
kono
parents: 67
diff changeset
702 if (skip)
kono
parents: 67
diff changeset
703 continue;
kono
parents: 67
diff changeset
704 }
kono
parents: 67
diff changeset
705 if (gimple_code (cond_stmt) == GIMPLE_COND)
kono
parents: 67
diff changeset
706 {
kono
parents: 67
diff changeset
707 one_pred.pred_lhs = gimple_cond_lhs (cond_stmt);
kono
parents: 67
diff changeset
708 one_pred.pred_rhs = gimple_cond_rhs (cond_stmt);
kono
parents: 67
diff changeset
709 one_pred.cond_code = gimple_cond_code (cond_stmt);
kono
parents: 67
diff changeset
710 one_pred.invert = !!(e->flags & EDGE_FALSE_VALUE);
kono
parents: 67
diff changeset
711 t_chain.safe_push (one_pred);
kono
parents: 67
diff changeset
712 has_valid_pred = true;
kono
parents: 67
diff changeset
713 }
kono
parents: 67
diff changeset
714 else if (gswitch *gs = dyn_cast<gswitch *> (cond_stmt))
kono
parents: 67
diff changeset
715 {
kono
parents: 67
diff changeset
716 /* Avoid quadratic behavior. */
kono
parents: 67
diff changeset
717 if (gimple_switch_num_labels (gs) > MAX_SWITCH_CASES)
kono
parents: 67
diff changeset
718 {
kono
parents: 67
diff changeset
719 has_valid_pred = false;
kono
parents: 67
diff changeset
720 break;
kono
parents: 67
diff changeset
721 }
kono
parents: 67
diff changeset
722 /* Find the case label. */
kono
parents: 67
diff changeset
723 tree l = NULL_TREE;
kono
parents: 67
diff changeset
724 unsigned idx;
kono
parents: 67
diff changeset
725 for (idx = 0; idx < gimple_switch_num_labels (gs); ++idx)
kono
parents: 67
diff changeset
726 {
kono
parents: 67
diff changeset
727 tree tl = gimple_switch_label (gs, idx);
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
728 if (e->dest == label_to_block (cfun, CASE_LABEL (tl)))
111
kono
parents: 67
diff changeset
729 {
kono
parents: 67
diff changeset
730 if (!l)
kono
parents: 67
diff changeset
731 l = tl;
kono
parents: 67
diff changeset
732 else
kono
parents: 67
diff changeset
733 {
kono
parents: 67
diff changeset
734 l = NULL_TREE;
kono
parents: 67
diff changeset
735 break;
kono
parents: 67
diff changeset
736 }
kono
parents: 67
diff changeset
737 }
kono
parents: 67
diff changeset
738 }
kono
parents: 67
diff changeset
739 /* If more than one label reaches this block or the case
kono
parents: 67
diff changeset
740 label doesn't have a single value (like the default one)
kono
parents: 67
diff changeset
741 fail. */
kono
parents: 67
diff changeset
742 if (!l
kono
parents: 67
diff changeset
743 || !CASE_LOW (l)
kono
parents: 67
diff changeset
744 || (CASE_HIGH (l)
kono
parents: 67
diff changeset
745 && !operand_equal_p (CASE_LOW (l), CASE_HIGH (l), 0)))
kono
parents: 67
diff changeset
746 {
kono
parents: 67
diff changeset
747 has_valid_pred = false;
kono
parents: 67
diff changeset
748 break;
kono
parents: 67
diff changeset
749 }
kono
parents: 67
diff changeset
750 one_pred.pred_lhs = gimple_switch_index (gs);
kono
parents: 67
diff changeset
751 one_pred.pred_rhs = CASE_LOW (l);
kono
parents: 67
diff changeset
752 one_pred.cond_code = EQ_EXPR;
kono
parents: 67
diff changeset
753 one_pred.invert = false;
kono
parents: 67
diff changeset
754 t_chain.safe_push (one_pred);
kono
parents: 67
diff changeset
755 has_valid_pred = true;
kono
parents: 67
diff changeset
756 }
kono
parents: 67
diff changeset
757 else
kono
parents: 67
diff changeset
758 {
kono
parents: 67
diff changeset
759 has_valid_pred = false;
kono
parents: 67
diff changeset
760 break;
kono
parents: 67
diff changeset
761 }
kono
parents: 67
diff changeset
762 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
763
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
764 if (!has_valid_pred)
111
kono
parents: 67
diff changeset
765 break;
kono
parents: 67
diff changeset
766 else
kono
parents: 67
diff changeset
767 preds->safe_push (t_chain);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
768 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
769 return has_valid_pred;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
770 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
771
111
kono
parents: 67
diff changeset
772 /* Computes all control dependence chains for USE_BB. The control
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
773 dependence chains are then converted to an array of composite
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
774 predicates pointed to by PREDS. PHI_BB is the basic block of
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
775 the phi whose result is used in USE_BB. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
776
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
777 static bool
111
kono
parents: 67
diff changeset
778 find_predicates (pred_chain_union *preds,
kono
parents: 67
diff changeset
779 basic_block phi_bb,
kono
parents: 67
diff changeset
780 basic_block use_bb)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
781 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
782 size_t num_chains = 0, i;
111
kono
parents: 67
diff changeset
783 int num_calls = 0;
kono
parents: 67
diff changeset
784 vec<edge> dep_chains[MAX_NUM_CHAINS];
kono
parents: 67
diff changeset
785 auto_vec<edge, MAX_CHAIN_LEN + 1> cur_chain;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
786 bool has_valid_pred = false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
787 basic_block cd_root = 0;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
788
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
789 /* First find the closest bb that is control equivalent to PHI_BB
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
790 that also dominates USE_BB. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
791 cd_root = phi_bb;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
792 while (dominated_by_p (CDI_DOMINATORS, use_bb, cd_root))
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
793 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
794 basic_block ctrl_eq_bb = find_control_equiv_block (cd_root);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
795 if (ctrl_eq_bb && dominated_by_p (CDI_DOMINATORS, use_bb, ctrl_eq_bb))
111
kono
parents: 67
diff changeset
796 cd_root = ctrl_eq_bb;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
797 else
111
kono
parents: 67
diff changeset
798 break;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
799 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
800
111
kono
parents: 67
diff changeset
801 compute_control_dep_chain (cd_root, use_bb, dep_chains, &num_chains,
kono
parents: 67
diff changeset
802 &cur_chain, &num_calls);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
803
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
804 has_valid_pred
111
kono
parents: 67
diff changeset
805 = convert_control_dep_chain_into_preds (dep_chains, num_chains, preds);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
806 for (i = 0; i < num_chains; i++)
111
kono
parents: 67
diff changeset
807 dep_chains[i].release ();
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
808 return has_valid_pred;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
809 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
810
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
811 /* Computes the set of incoming edges of PHI that have non empty
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
812 definitions of a phi chain. The collection will be done
111
kono
parents: 67
diff changeset
813 recursively on operands that are defined by phis. CD_ROOT
kono
parents: 67
diff changeset
814 is the control dependence root. *EDGES holds the result, and
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
815 VISITED_PHIS is a pointer set for detecting cycles. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
816
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
817 static void
111
kono
parents: 67
diff changeset
818 collect_phi_def_edges (gphi *phi, basic_block cd_root,
kono
parents: 67
diff changeset
819 auto_vec<edge> *edges,
kono
parents: 67
diff changeset
820 hash_set<gimple *> *visited_phis)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
821 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
822 size_t i, n;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
823 edge opnd_edge;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
824 tree opnd;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
825
111
kono
parents: 67
diff changeset
826 if (visited_phis->add (phi))
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
827 return;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
828
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
829 n = gimple_phi_num_args (phi);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
830 for (i = 0; i < n; i++)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
831 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
832 opnd_edge = gimple_phi_arg_edge (phi, i);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
833 opnd = gimple_phi_arg_def (phi, i);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
834
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
835 if (TREE_CODE (opnd) != SSA_NAME)
111
kono
parents: 67
diff changeset
836 {
kono
parents: 67
diff changeset
837 if (dump_file && (dump_flags & TDF_DETAILS))
kono
parents: 67
diff changeset
838 {
kono
parents: 67
diff changeset
839 fprintf (dump_file, "\n[CHECK] Found def edge %d in ", (int) i);
kono
parents: 67
diff changeset
840 print_gimple_stmt (dump_file, phi, 0);
kono
parents: 67
diff changeset
841 }
kono
parents: 67
diff changeset
842 edges->safe_push (opnd_edge);
kono
parents: 67
diff changeset
843 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
844 else
111
kono
parents: 67
diff changeset
845 {
kono
parents: 67
diff changeset
846 gimple *def = SSA_NAME_DEF_STMT (opnd);
kono
parents: 67
diff changeset
847
kono
parents: 67
diff changeset
848 if (gimple_code (def) == GIMPLE_PHI
kono
parents: 67
diff changeset
849 && dominated_by_p (CDI_DOMINATORS, gimple_bb (def), cd_root))
kono
parents: 67
diff changeset
850 collect_phi_def_edges (as_a<gphi *> (def), cd_root, edges,
kono
parents: 67
diff changeset
851 visited_phis);
kono
parents: 67
diff changeset
852 else if (!uninit_undefined_value_p (opnd))
kono
parents: 67
diff changeset
853 {
kono
parents: 67
diff changeset
854 if (dump_file && (dump_flags & TDF_DETAILS))
kono
parents: 67
diff changeset
855 {
kono
parents: 67
diff changeset
856 fprintf (dump_file, "\n[CHECK] Found def edge %d in ",
kono
parents: 67
diff changeset
857 (int) i);
kono
parents: 67
diff changeset
858 print_gimple_stmt (dump_file, phi, 0);
kono
parents: 67
diff changeset
859 }
kono
parents: 67
diff changeset
860 edges->safe_push (opnd_edge);
kono
parents: 67
diff changeset
861 }
kono
parents: 67
diff changeset
862 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
863 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
864 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
865
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
866 /* For each use edge of PHI, computes all control dependence chains.
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
867 The control dependence chains are then converted to an array of
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
868 composite predicates pointed to by PREDS. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
869
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
870 static bool
111
kono
parents: 67
diff changeset
871 find_def_preds (pred_chain_union *preds, gphi *phi)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
872 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
873 size_t num_chains = 0, i, n;
111
kono
parents: 67
diff changeset
874 vec<edge> dep_chains[MAX_NUM_CHAINS];
kono
parents: 67
diff changeset
875 auto_vec<edge, MAX_CHAIN_LEN + 1> cur_chain;
kono
parents: 67
diff changeset
876 auto_vec<edge> def_edges;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
877 bool has_valid_pred = false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
878 basic_block phi_bb, cd_root = 0;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
879
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
880 phi_bb = gimple_bb (phi);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
881 /* First find the closest dominating bb to be
111
kono
parents: 67
diff changeset
882 the control dependence root. */
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
883 cd_root = find_dom (phi_bb);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
884 if (!cd_root)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
885 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
886
111
kono
parents: 67
diff changeset
887 hash_set<gimple *> visited_phis;
kono
parents: 67
diff changeset
888 collect_phi_def_edges (phi, cd_root, &def_edges, &visited_phis);
kono
parents: 67
diff changeset
889
kono
parents: 67
diff changeset
890 n = def_edges.length ();
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
891 if (n == 0)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
892 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
893
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
894 for (i = 0; i < n; i++)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
895 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
896 size_t prev_nc, j;
111
kono
parents: 67
diff changeset
897 int num_calls = 0;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
898 edge opnd_edge;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
899
111
kono
parents: 67
diff changeset
900 opnd_edge = def_edges[i];
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
901 prev_nc = num_chains;
111
kono
parents: 67
diff changeset
902 compute_control_dep_chain (cd_root, opnd_edge->src, dep_chains,
kono
parents: 67
diff changeset
903 &num_chains, &cur_chain, &num_calls);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
904
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
905 /* Now update the newly added chains with
111
kono
parents: 67
diff changeset
906 the phi operand edge: */
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
907 if (EDGE_COUNT (opnd_edge->src->succs) > 1)
111
kono
parents: 67
diff changeset
908 {
kono
parents: 67
diff changeset
909 if (prev_nc == num_chains && num_chains < MAX_NUM_CHAINS)
kono
parents: 67
diff changeset
910 dep_chains[num_chains++] = vNULL;
kono
parents: 67
diff changeset
911 for (j = prev_nc; j < num_chains; j++)
kono
parents: 67
diff changeset
912 dep_chains[j].safe_push (opnd_edge);
kono
parents: 67
diff changeset
913 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
914 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
915
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
916 has_valid_pred
111
kono
parents: 67
diff changeset
917 = convert_control_dep_chain_into_preds (dep_chains, num_chains, preds);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
918 for (i = 0; i < num_chains; i++)
111
kono
parents: 67
diff changeset
919 dep_chains[i].release ();
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
920 return has_valid_pred;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
921 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
922
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
923 /* Dump a pred_info. */
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
924
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
925 static void
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
926 dump_pred_info (pred_info one_pred)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
927 {
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
928 if (one_pred.invert)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
929 fprintf (dump_file, " (.NOT.) ");
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
930 print_generic_expr (dump_file, one_pred.pred_lhs);
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
931 fprintf (dump_file, " %s ", op_symbol_code (one_pred.cond_code));
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
932 print_generic_expr (dump_file, one_pred.pred_rhs);
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
933 }
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
934
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
935 /* Dump a pred_chain. */
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
936
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
937 static void
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
938 dump_pred_chain (pred_chain one_pred_chain)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
939 {
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
940 size_t np = one_pred_chain.length ();
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
941 for (size_t j = 0; j < np; j++)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
942 {
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
943 dump_pred_info (one_pred_chain[j]);
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
944 if (j < np - 1)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
945 fprintf (dump_file, " (.AND.) ");
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
946 else
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
947 fprintf (dump_file, "\n");
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
948 }
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
949 }
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
950
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
951 /* Dumps the predicates (PREDS) for USESTMT. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
952
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
953 static void
111
kono
parents: 67
diff changeset
954 dump_predicates (gimple *usestmt, pred_chain_union preds, const char *msg)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
955 {
111
kono
parents: 67
diff changeset
956 fprintf (dump_file, "%s", msg);
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
957 if (usestmt)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
958 {
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
959 print_gimple_stmt (dump_file, usestmt, 0);
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
960 fprintf (dump_file, "is guarded by :\n\n");
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
961 }
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
962 size_t num_preds = preds.length ();
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
963 for (size_t i = 0; i < num_preds; i++)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
964 {
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
965 dump_pred_chain (preds[i]);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
966 if (i < num_preds - 1)
111
kono
parents: 67
diff changeset
967 fprintf (dump_file, "(.OR.)\n");
kono
parents: 67
diff changeset
968 else
kono
parents: 67
diff changeset
969 fprintf (dump_file, "\n\n");
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
970 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
971 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
972
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
973 /* Destroys the predicate set *PREDS. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
974
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
975 static void
111
kono
parents: 67
diff changeset
976 destroy_predicate_vecs (pred_chain_union *preds)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
977 {
111
kono
parents: 67
diff changeset
978 size_t i;
kono
parents: 67
diff changeset
979
kono
parents: 67
diff changeset
980 size_t n = preds->length ();
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
981 for (i = 0; i < n; i++)
111
kono
parents: 67
diff changeset
982 (*preds)[i].release ();
kono
parents: 67
diff changeset
983 preds->release ();
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
984 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
985
111
kono
parents: 67
diff changeset
986 /* Computes the 'normalized' conditional code with operand
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
987 swapping and condition inversion. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
988
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
989 static enum tree_code
111
kono
parents: 67
diff changeset
990 get_cmp_code (enum tree_code orig_cmp_code, bool swap_cond, bool invert)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
991 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
992 enum tree_code tc = orig_cmp_code;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
993
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
994 if (swap_cond)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
995 tc = swap_tree_comparison (orig_cmp_code);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
996 if (invert)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
997 tc = invert_tree_comparison (tc, false);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
998
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
999 switch (tc)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1000 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1001 case LT_EXPR:
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1002 case LE_EXPR:
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1003 case GT_EXPR:
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1004 case GE_EXPR:
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1005 case EQ_EXPR:
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1006 case NE_EXPR:
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1007 break;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1008 default:
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1009 return ERROR_MARK;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1010 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1011 return tc;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1012 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1013
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1014 /* Returns true if VAL falls in the range defined by BOUNDARY and CMPC, i.e.
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1015 all values in the range satisfies (x CMPC BOUNDARY) == true. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1016
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1017 static bool
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1018 is_value_included_in (tree val, tree boundary, enum tree_code cmpc)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1019 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1020 bool inverted = false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1021 bool is_unsigned;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1022 bool result;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1023
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1024 /* Only handle integer constant here. */
111
kono
parents: 67
diff changeset
1025 if (TREE_CODE (val) != INTEGER_CST || TREE_CODE (boundary) != INTEGER_CST)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1026 return true;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1027
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1028 is_unsigned = TYPE_UNSIGNED (TREE_TYPE (val));
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1029
111
kono
parents: 67
diff changeset
1030 if (cmpc == GE_EXPR || cmpc == GT_EXPR || cmpc == NE_EXPR)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1031 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1032 cmpc = invert_tree_comparison (cmpc, false);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1033 inverted = true;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1034 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1035
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1036 if (is_unsigned)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1037 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1038 if (cmpc == EQ_EXPR)
111
kono
parents: 67
diff changeset
1039 result = tree_int_cst_equal (val, boundary);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1040 else if (cmpc == LT_EXPR)
111
kono
parents: 67
diff changeset
1041 result = tree_int_cst_lt (val, boundary);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1042 else
111
kono
parents: 67
diff changeset
1043 {
kono
parents: 67
diff changeset
1044 gcc_assert (cmpc == LE_EXPR);
kono
parents: 67
diff changeset
1045 result = tree_int_cst_le (val, boundary);
kono
parents: 67
diff changeset
1046 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1047 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1048 else
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1049 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1050 if (cmpc == EQ_EXPR)
111
kono
parents: 67
diff changeset
1051 result = tree_int_cst_equal (val, boundary);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1052 else if (cmpc == LT_EXPR)
111
kono
parents: 67
diff changeset
1053 result = tree_int_cst_lt (val, boundary);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1054 else
111
kono
parents: 67
diff changeset
1055 {
kono
parents: 67
diff changeset
1056 gcc_assert (cmpc == LE_EXPR);
kono
parents: 67
diff changeset
1057 result = (tree_int_cst_equal (val, boundary)
kono
parents: 67
diff changeset
1058 || tree_int_cst_lt (val, boundary));
kono
parents: 67
diff changeset
1059 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1060 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1061
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1062 if (inverted)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1063 result ^= 1;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1064
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1065 return result;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1066 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1067
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1068 /* Returns true if PRED is common among all the predicate
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1069 chains (PREDS) (and therefore can be factored out).
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1070 NUM_PRED_CHAIN is the size of array PREDS. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1071
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1072 static bool
111
kono
parents: 67
diff changeset
1073 find_matching_predicate_in_rest_chains (pred_info pred,
kono
parents: 67
diff changeset
1074 pred_chain_union preds,
kono
parents: 67
diff changeset
1075 size_t num_pred_chains)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1076 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1077 size_t i, j, n;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1078
111
kono
parents: 67
diff changeset
1079 /* Trival case. */
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1080 if (num_pred_chains == 1)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1081 return true;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1082
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1083 for (i = 1; i < num_pred_chains; i++)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1084 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1085 bool found = false;
111
kono
parents: 67
diff changeset
1086 pred_chain one_chain = preds[i];
kono
parents: 67
diff changeset
1087 n = one_chain.length ();
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1088 for (j = 0; j < n; j++)
111
kono
parents: 67
diff changeset
1089 {
kono
parents: 67
diff changeset
1090 pred_info pred2 = one_chain[j];
kono
parents: 67
diff changeset
1091 /* Can relax the condition comparison to not
kono
parents: 67
diff changeset
1092 use address comparison. However, the most common
kono
parents: 67
diff changeset
1093 case is that multiple control dependent paths share
kono
parents: 67
diff changeset
1094 a common path prefix, so address comparison should
kono
parents: 67
diff changeset
1095 be ok. */
kono
parents: 67
diff changeset
1096
kono
parents: 67
diff changeset
1097 if (operand_equal_p (pred2.pred_lhs, pred.pred_lhs, 0)
kono
parents: 67
diff changeset
1098 && operand_equal_p (pred2.pred_rhs, pred.pred_rhs, 0)
kono
parents: 67
diff changeset
1099 && pred2.invert == pred.invert)
kono
parents: 67
diff changeset
1100 {
kono
parents: 67
diff changeset
1101 found = true;
kono
parents: 67
diff changeset
1102 break;
kono
parents: 67
diff changeset
1103 }
kono
parents: 67
diff changeset
1104 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1105 if (!found)
111
kono
parents: 67
diff changeset
1106 return false;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1107 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1108 return true;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1109 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1110
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1111 /* Forward declaration. */
111
kono
parents: 67
diff changeset
1112 static bool is_use_properly_guarded (gimple *use_stmt,
kono
parents: 67
diff changeset
1113 basic_block use_bb,
kono
parents: 67
diff changeset
1114 gphi *phi,
kono
parents: 67
diff changeset
1115 unsigned uninit_opnds,
kono
parents: 67
diff changeset
1116 pred_chain_union *def_preds,
kono
parents: 67
diff changeset
1117 hash_set<gphi *> *visited_phis);
kono
parents: 67
diff changeset
1118
kono
parents: 67
diff changeset
1119 /* Returns true if all uninitialized opnds are pruned. Returns false
kono
parents: 67
diff changeset
1120 otherwise. PHI is the phi node with uninitialized operands,
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1121 UNINIT_OPNDS is the bitmap of the uninitialize operand positions,
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1122 FLAG_DEF is the statement defining the flag guarding the use of the
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1123 PHI output, BOUNDARY_CST is the const value used in the predicate
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1124 associated with the flag, CMP_CODE is the comparison code used in
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1125 the predicate, VISITED_PHIS is the pointer set of phis visited, and
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1126 VISITED_FLAG_PHIS is the pointer to the pointer set of flag definitions
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1127 that are also phis.
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1128
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1129 Example scenario:
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1130
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1131 BB1:
111
kono
parents: 67
diff changeset
1132 flag_1 = phi <0, 1> // (1)
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1133 var_1 = phi <undef, some_val>
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1134
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1135
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1136 BB2:
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1137 flag_2 = phi <0, flag_1, flag_1> // (2)
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1138 var_2 = phi <undef, var_1, var_1>
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1139 if (flag_2 == 1)
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1140 goto BB3;
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1141
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1142 BB3:
111
kono
parents: 67
diff changeset
1143 use of var_2 // (3)
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1144
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1145 Because some flag arg in (1) is not constant, if we do not look into the
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1146 flag phis recursively, it is conservatively treated as unknown and var_1
111
kono
parents: 67
diff changeset
1147 is thought to be flowed into use at (3). Since var_1 is potentially
kono
parents: 67
diff changeset
1148 uninitialized a false warning will be emitted.
kono
parents: 67
diff changeset
1149 Checking recursively into (1), the compiler can find out that only some_val
kono
parents: 67
diff changeset
1150 (which is defined) can flow into (3) which is OK. */
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1151
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1152 static bool
111
kono
parents: 67
diff changeset
1153 prune_uninit_phi_opnds (gphi *phi, unsigned uninit_opnds, gphi *flag_def,
kono
parents: 67
diff changeset
1154 tree boundary_cst, enum tree_code cmp_code,
kono
parents: 67
diff changeset
1155 hash_set<gphi *> *visited_phis,
kono
parents: 67
diff changeset
1156 bitmap *visited_flag_phis)
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1157 {
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1158 unsigned i;
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1159
111
kono
parents: 67
diff changeset
1160 for (i = 0; i < MIN (max_phi_args, gimple_phi_num_args (flag_def)); i++)
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1161 {
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1162 tree flag_arg;
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1163
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1164 if (!MASK_TEST_BIT (uninit_opnds, i))
111
kono
parents: 67
diff changeset
1165 continue;
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1166
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1167 flag_arg = gimple_phi_arg_def (flag_def, i);
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1168 if (!is_gimple_constant (flag_arg))
111
kono
parents: 67
diff changeset
1169 {
kono
parents: 67
diff changeset
1170 gphi *flag_arg_def, *phi_arg_def;
kono
parents: 67
diff changeset
1171 tree phi_arg;
kono
parents: 67
diff changeset
1172 unsigned uninit_opnds_arg_phi;
kono
parents: 67
diff changeset
1173
kono
parents: 67
diff changeset
1174 if (TREE_CODE (flag_arg) != SSA_NAME)
kono
parents: 67
diff changeset
1175 return false;
kono
parents: 67
diff changeset
1176 flag_arg_def = dyn_cast<gphi *> (SSA_NAME_DEF_STMT (flag_arg));
kono
parents: 67
diff changeset
1177 if (!flag_arg_def)
kono
parents: 67
diff changeset
1178 return false;
kono
parents: 67
diff changeset
1179
kono
parents: 67
diff changeset
1180 phi_arg = gimple_phi_arg_def (phi, i);
kono
parents: 67
diff changeset
1181 if (TREE_CODE (phi_arg) != SSA_NAME)
kono
parents: 67
diff changeset
1182 return false;
kono
parents: 67
diff changeset
1183
kono
parents: 67
diff changeset
1184 phi_arg_def = dyn_cast<gphi *> (SSA_NAME_DEF_STMT (phi_arg));
kono
parents: 67
diff changeset
1185 if (!phi_arg_def)
kono
parents: 67
diff changeset
1186 return false;
kono
parents: 67
diff changeset
1187
kono
parents: 67
diff changeset
1188 if (gimple_bb (phi_arg_def) != gimple_bb (flag_arg_def))
kono
parents: 67
diff changeset
1189 return false;
kono
parents: 67
diff changeset
1190
kono
parents: 67
diff changeset
1191 if (!*visited_flag_phis)
kono
parents: 67
diff changeset
1192 *visited_flag_phis = BITMAP_ALLOC (NULL);
kono
parents: 67
diff changeset
1193
kono
parents: 67
diff changeset
1194 tree phi_result = gimple_phi_result (flag_arg_def);
kono
parents: 67
diff changeset
1195 if (bitmap_bit_p (*visited_flag_phis, SSA_NAME_VERSION (phi_result)))
kono
parents: 67
diff changeset
1196 return false;
kono
parents: 67
diff changeset
1197
kono
parents: 67
diff changeset
1198 bitmap_set_bit (*visited_flag_phis,
kono
parents: 67
diff changeset
1199 SSA_NAME_VERSION (gimple_phi_result (flag_arg_def)));
kono
parents: 67
diff changeset
1200
kono
parents: 67
diff changeset
1201 /* Now recursively prune the uninitialized phi args. */
kono
parents: 67
diff changeset
1202 uninit_opnds_arg_phi = compute_uninit_opnds_pos (phi_arg_def);
kono
parents: 67
diff changeset
1203 if (!prune_uninit_phi_opnds
kono
parents: 67
diff changeset
1204 (phi_arg_def, uninit_opnds_arg_phi, flag_arg_def, boundary_cst,
kono
parents: 67
diff changeset
1205 cmp_code, visited_phis, visited_flag_phis))
kono
parents: 67
diff changeset
1206 return false;
kono
parents: 67
diff changeset
1207
kono
parents: 67
diff changeset
1208 phi_result = gimple_phi_result (flag_arg_def);
kono
parents: 67
diff changeset
1209 bitmap_clear_bit (*visited_flag_phis, SSA_NAME_VERSION (phi_result));
kono
parents: 67
diff changeset
1210 continue;
kono
parents: 67
diff changeset
1211 }
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1212
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1213 /* Now check if the constant is in the guarded range. */
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1214 if (is_value_included_in (flag_arg, boundary_cst, cmp_code))
111
kono
parents: 67
diff changeset
1215 {
kono
parents: 67
diff changeset
1216 tree opnd;
kono
parents: 67
diff changeset
1217 gimple *opnd_def;
kono
parents: 67
diff changeset
1218
kono
parents: 67
diff changeset
1219 /* Now that we know that this undefined edge is not
kono
parents: 67
diff changeset
1220 pruned. If the operand is defined by another phi,
kono
parents: 67
diff changeset
1221 we can further prune the incoming edges of that
kono
parents: 67
diff changeset
1222 phi by checking the predicates of this operands. */
kono
parents: 67
diff changeset
1223
kono
parents: 67
diff changeset
1224 opnd = gimple_phi_arg_def (phi, i);
kono
parents: 67
diff changeset
1225 opnd_def = SSA_NAME_DEF_STMT (opnd);
kono
parents: 67
diff changeset
1226 if (gphi *opnd_def_phi = dyn_cast <gphi *> (opnd_def))
kono
parents: 67
diff changeset
1227 {
kono
parents: 67
diff changeset
1228 edge opnd_edge;
kono
parents: 67
diff changeset
1229 unsigned uninit_opnds2 = compute_uninit_opnds_pos (opnd_def_phi);
kono
parents: 67
diff changeset
1230 if (!MASK_EMPTY (uninit_opnds2))
kono
parents: 67
diff changeset
1231 {
kono
parents: 67
diff changeset
1232 pred_chain_union def_preds = vNULL;
kono
parents: 67
diff changeset
1233 bool ok;
kono
parents: 67
diff changeset
1234 opnd_edge = gimple_phi_arg_edge (phi, i);
kono
parents: 67
diff changeset
1235 ok = is_use_properly_guarded (phi,
kono
parents: 67
diff changeset
1236 opnd_edge->src,
kono
parents: 67
diff changeset
1237 opnd_def_phi,
kono
parents: 67
diff changeset
1238 uninit_opnds2,
kono
parents: 67
diff changeset
1239 &def_preds,
kono
parents: 67
diff changeset
1240 visited_phis);
kono
parents: 67
diff changeset
1241 destroy_predicate_vecs (&def_preds);
kono
parents: 67
diff changeset
1242 if (!ok)
kono
parents: 67
diff changeset
1243 return false;
kono
parents: 67
diff changeset
1244 }
kono
parents: 67
diff changeset
1245 }
kono
parents: 67
diff changeset
1246 else
kono
parents: 67
diff changeset
1247 return false;
kono
parents: 67
diff changeset
1248 }
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1249 }
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1250
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1251 return true;
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1252 }
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1253
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1254 /* A helper function that determines if the predicate set
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1255 of the use is not overlapping with that of the uninit paths.
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1256 The most common senario of guarded use is in Example 1:
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1257 Example 1:
111
kono
parents: 67
diff changeset
1258 if (some_cond)
kono
parents: 67
diff changeset
1259 {
kono
parents: 67
diff changeset
1260 x = ...;
kono
parents: 67
diff changeset
1261 flag = true;
kono
parents: 67
diff changeset
1262 }
kono
parents: 67
diff changeset
1263
kono
parents: 67
diff changeset
1264 ... some code ...
kono
parents: 67
diff changeset
1265
kono
parents: 67
diff changeset
1266 if (flag)
kono
parents: 67
diff changeset
1267 use (x);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1268
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1269 The real world examples are usually more complicated, but similar
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1270 and usually result from inlining:
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1271
111
kono
parents: 67
diff changeset
1272 bool init_func (int * x)
kono
parents: 67
diff changeset
1273 {
kono
parents: 67
diff changeset
1274 if (some_cond)
kono
parents: 67
diff changeset
1275 return false;
kono
parents: 67
diff changeset
1276 *x = ..
kono
parents: 67
diff changeset
1277 return true;
kono
parents: 67
diff changeset
1278 }
kono
parents: 67
diff changeset
1279
kono
parents: 67
diff changeset
1280 void foo (..)
kono
parents: 67
diff changeset
1281 {
kono
parents: 67
diff changeset
1282 int x;
kono
parents: 67
diff changeset
1283
kono
parents: 67
diff changeset
1284 if (!init_func (&x))
kono
parents: 67
diff changeset
1285 return;
kono
parents: 67
diff changeset
1286
kono
parents: 67
diff changeset
1287 .. some_code ...
kono
parents: 67
diff changeset
1288 use (x);
kono
parents: 67
diff changeset
1289 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1290
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1291 Another possible use scenario is in the following trivial example:
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1292
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1293 Example 2:
111
kono
parents: 67
diff changeset
1294 if (n > 0)
kono
parents: 67
diff changeset
1295 x = 1;
kono
parents: 67
diff changeset
1296 ...
kono
parents: 67
diff changeset
1297 if (n > 0)
kono
parents: 67
diff changeset
1298 {
kono
parents: 67
diff changeset
1299 if (m < 2)
kono
parents: 67
diff changeset
1300 .. = x;
kono
parents: 67
diff changeset
1301 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1302
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1303 Predicate analysis needs to compute the composite predicate:
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1304
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1305 1) 'x' use predicate: (n > 0) .AND. (m < 2)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1306 2) 'x' default value (non-def) predicate: .NOT. (n > 0)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1307 (the predicate chain for phi operand defs can be computed
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1308 starting from a bb that is control equivalent to the phi's
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1309 bb and is dominating the operand def.)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1310
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1311 and check overlapping:
111
kono
parents: 67
diff changeset
1312 (n > 0) .AND. (m < 2) .AND. (.NOT. (n > 0))
kono
parents: 67
diff changeset
1313 <==> false
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1314
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1315 This implementation provides framework that can handle
111
kono
parents: 67
diff changeset
1316 scenarios. (Note that many simple cases are handled properly
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1317 without the predicate analysis -- this is due to jump threading
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1318 transformation which eliminates the merge point thus makes
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1319 path sensitive analysis unnecessary.)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1320
111
kono
parents: 67
diff changeset
1321 PHI is the phi node whose incoming (undefined) paths need to be
kono
parents: 67
diff changeset
1322 pruned, and UNINIT_OPNDS is the bitmap holding uninit operand
kono
parents: 67
diff changeset
1323 positions. VISITED_PHIS is the pointer set of phi stmts being
kono
parents: 67
diff changeset
1324 checked. */
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1325
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1326 static bool
111
kono
parents: 67
diff changeset
1327 use_pred_not_overlap_with_undef_path_pred (pred_chain_union preds,
kono
parents: 67
diff changeset
1328 gphi *phi, unsigned uninit_opnds,
kono
parents: 67
diff changeset
1329 hash_set<gphi *> *visited_phis)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1330 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1331 unsigned int i, n;
111
kono
parents: 67
diff changeset
1332 gimple *flag_def = 0;
kono
parents: 67
diff changeset
1333 tree boundary_cst = 0;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1334 enum tree_code cmp_code;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1335 bool swap_cond = false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1336 bool invert = false;
111
kono
parents: 67
diff changeset
1337 pred_chain the_pred_chain = vNULL;
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1338 bitmap visited_flag_phis = NULL;
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1339 bool all_pruned = false;
111
kono
parents: 67
diff changeset
1340 size_t num_preds = preds.length ();
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1341
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1342 gcc_assert (num_preds > 0);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1343 /* Find within the common prefix of multiple predicate chains
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1344 a predicate that is a comparison of a flag variable against
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1345 a constant. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1346 the_pred_chain = preds[0];
111
kono
parents: 67
diff changeset
1347 n = the_pred_chain.length ();
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1348 for (i = 0; i < n; i++)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1349 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1350 tree cond_lhs, cond_rhs, flag = 0;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1351
111
kono
parents: 67
diff changeset
1352 pred_info the_pred = the_pred_chain[i];
kono
parents: 67
diff changeset
1353
kono
parents: 67
diff changeset
1354 invert = the_pred.invert;
kono
parents: 67
diff changeset
1355 cond_lhs = the_pred.pred_lhs;
kono
parents: 67
diff changeset
1356 cond_rhs = the_pred.pred_rhs;
kono
parents: 67
diff changeset
1357 cmp_code = the_pred.cond_code;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1358
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1359 if (cond_lhs != NULL_TREE && TREE_CODE (cond_lhs) == SSA_NAME
111
kono
parents: 67
diff changeset
1360 && cond_rhs != NULL_TREE && is_gimple_constant (cond_rhs))
kono
parents: 67
diff changeset
1361 {
kono
parents: 67
diff changeset
1362 boundary_cst = cond_rhs;
kono
parents: 67
diff changeset
1363 flag = cond_lhs;
kono
parents: 67
diff changeset
1364 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1365 else if (cond_rhs != NULL_TREE && TREE_CODE (cond_rhs) == SSA_NAME
111
kono
parents: 67
diff changeset
1366 && cond_lhs != NULL_TREE && is_gimple_constant (cond_lhs))
kono
parents: 67
diff changeset
1367 {
kono
parents: 67
diff changeset
1368 boundary_cst = cond_lhs;
kono
parents: 67
diff changeset
1369 flag = cond_rhs;
kono
parents: 67
diff changeset
1370 swap_cond = true;
kono
parents: 67
diff changeset
1371 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1372
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1373 if (!flag)
111
kono
parents: 67
diff changeset
1374 continue;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1375
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1376 flag_def = SSA_NAME_DEF_STMT (flag);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1377
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1378 if (!flag_def)
111
kono
parents: 67
diff changeset
1379 continue;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1380
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1381 if ((gimple_code (flag_def) == GIMPLE_PHI)
111
kono
parents: 67
diff changeset
1382 && (gimple_bb (flag_def) == gimple_bb (phi))
kono
parents: 67
diff changeset
1383 && find_matching_predicate_in_rest_chains (the_pred, preds,
kono
parents: 67
diff changeset
1384 num_preds))
kono
parents: 67
diff changeset
1385 break;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1386
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1387 flag_def = 0;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1388 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1389
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1390 if (!flag_def)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1391 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1392
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1393 /* Now check all the uninit incoming edge has a constant flag value
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1394 that is in conflict with the use guard/predicate. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1395 cmp_code = get_cmp_code (cmp_code, swap_cond, invert);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1396
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1397 if (cmp_code == ERROR_MARK)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1398 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1399
111
kono
parents: 67
diff changeset
1400 all_pruned = prune_uninit_phi_opnds
kono
parents: 67
diff changeset
1401 (phi, uninit_opnds, as_a<gphi *> (flag_def), boundary_cst, cmp_code,
kono
parents: 67
diff changeset
1402 visited_phis, &visited_flag_phis);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1403
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1404 if (visited_flag_phis)
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1405 BITMAP_FREE (visited_flag_phis);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1406
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
1407 return all_pruned;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1408 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1409
111
kono
parents: 67
diff changeset
1410 /* The helper function returns true if two predicates X1 and X2
kono
parents: 67
diff changeset
1411 are equivalent. It assumes the expressions have already
kono
parents: 67
diff changeset
1412 properly re-associated. */
kono
parents: 67
diff changeset
1413
kono
parents: 67
diff changeset
1414 static inline bool
kono
parents: 67
diff changeset
1415 pred_equal_p (pred_info x1, pred_info x2)
kono
parents: 67
diff changeset
1416 {
kono
parents: 67
diff changeset
1417 enum tree_code c1, c2;
kono
parents: 67
diff changeset
1418 if (!operand_equal_p (x1.pred_lhs, x2.pred_lhs, 0)
kono
parents: 67
diff changeset
1419 || !operand_equal_p (x1.pred_rhs, x2.pred_rhs, 0))
kono
parents: 67
diff changeset
1420 return false;
kono
parents: 67
diff changeset
1421
kono
parents: 67
diff changeset
1422 c1 = x1.cond_code;
kono
parents: 67
diff changeset
1423 if (x1.invert != x2.invert
kono
parents: 67
diff changeset
1424 && TREE_CODE_CLASS (x2.cond_code) == tcc_comparison)
kono
parents: 67
diff changeset
1425 c2 = invert_tree_comparison (x2.cond_code, false);
kono
parents: 67
diff changeset
1426 else
kono
parents: 67
diff changeset
1427 c2 = x2.cond_code;
kono
parents: 67
diff changeset
1428
kono
parents: 67
diff changeset
1429 return c1 == c2;
kono
parents: 67
diff changeset
1430 }
kono
parents: 67
diff changeset
1431
kono
parents: 67
diff changeset
1432 /* Returns true if the predication is testing !=. */
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1433
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1434 static inline bool
111
kono
parents: 67
diff changeset
1435 is_neq_relop_p (pred_info pred)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1436 {
111
kono
parents: 67
diff changeset
1437
kono
parents: 67
diff changeset
1438 return ((pred.cond_code == NE_EXPR && !pred.invert)
kono
parents: 67
diff changeset
1439 || (pred.cond_code == EQ_EXPR && pred.invert));
kono
parents: 67
diff changeset
1440 }
kono
parents: 67
diff changeset
1441
kono
parents: 67
diff changeset
1442 /* Returns true if pred is of the form X != 0. */
kono
parents: 67
diff changeset
1443
kono
parents: 67
diff changeset
1444 static inline bool
kono
parents: 67
diff changeset
1445 is_neq_zero_form_p (pred_info pred)
kono
parents: 67
diff changeset
1446 {
kono
parents: 67
diff changeset
1447 if (!is_neq_relop_p (pred) || !integer_zerop (pred.pred_rhs)
kono
parents: 67
diff changeset
1448 || TREE_CODE (pred.pred_lhs) != SSA_NAME)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1449 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1450 return true;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1451 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1452
111
kono
parents: 67
diff changeset
1453 /* The helper function returns true if two predicates X1
kono
parents: 67
diff changeset
1454 is equivalent to X2 != 0. */
kono
parents: 67
diff changeset
1455
kono
parents: 67
diff changeset
1456 static inline bool
kono
parents: 67
diff changeset
1457 pred_expr_equal_p (pred_info x1, tree x2)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1458 {
111
kono
parents: 67
diff changeset
1459 if (!is_neq_zero_form_p (x1))
kono
parents: 67
diff changeset
1460 return false;
kono
parents: 67
diff changeset
1461
kono
parents: 67
diff changeset
1462 return operand_equal_p (x1.pred_lhs, x2, 0);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1463 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1464
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1465 /* Returns true of the domain of single predicate expression
111
kono
parents: 67
diff changeset
1466 EXPR1 is a subset of that of EXPR2. Returns false if it
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1467 can not be proved. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1468
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1469 static bool
111
kono
parents: 67
diff changeset
1470 is_pred_expr_subset_of (pred_info expr1, pred_info expr2)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1471 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1472 enum tree_code code1, code2;
111
kono
parents: 67
diff changeset
1473
kono
parents: 67
diff changeset
1474 if (pred_equal_p (expr1, expr2))
kono
parents: 67
diff changeset
1475 return true;
kono
parents: 67
diff changeset
1476
kono
parents: 67
diff changeset
1477 if ((TREE_CODE (expr1.pred_rhs) != INTEGER_CST)
kono
parents: 67
diff changeset
1478 || (TREE_CODE (expr2.pred_rhs) != INTEGER_CST))
kono
parents: 67
diff changeset
1479 return false;
kono
parents: 67
diff changeset
1480
kono
parents: 67
diff changeset
1481 if (!operand_equal_p (expr1.pred_lhs, expr2.pred_lhs, 0))
kono
parents: 67
diff changeset
1482 return false;
kono
parents: 67
diff changeset
1483
kono
parents: 67
diff changeset
1484 code1 = expr1.cond_code;
kono
parents: 67
diff changeset
1485 if (expr1.invert)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1486 code1 = invert_tree_comparison (code1, false);
111
kono
parents: 67
diff changeset
1487 code2 = expr2.cond_code;
kono
parents: 67
diff changeset
1488 if (expr2.invert)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1489 code2 = invert_tree_comparison (code2, false);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1490
111
kono
parents: 67
diff changeset
1491 if ((code1 == EQ_EXPR || code1 == BIT_AND_EXPR) && code2 == BIT_AND_EXPR)
kono
parents: 67
diff changeset
1492 return (wi::to_wide (expr1.pred_rhs)
kono
parents: 67
diff changeset
1493 == (wi::to_wide (expr1.pred_rhs) & wi::to_wide (expr2.pred_rhs)));
kono
parents: 67
diff changeset
1494
kono
parents: 67
diff changeset
1495 if (code1 != code2 && code2 != NE_EXPR)
kono
parents: 67
diff changeset
1496 return false;
kono
parents: 67
diff changeset
1497
kono
parents: 67
diff changeset
1498 if (is_value_included_in (expr1.pred_rhs, expr2.pred_rhs, code2))
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1499 return true;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1500
111
kono
parents: 67
diff changeset
1501 return false;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1502 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1503
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1504 /* Returns true if the domain of PRED1 is a subset
111
kono
parents: 67
diff changeset
1505 of that of PRED2. Returns false if it can not be proved so. */
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1506
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1507 static bool
111
kono
parents: 67
diff changeset
1508 is_pred_chain_subset_of (pred_chain pred1, pred_chain pred2)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1509 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1510 size_t np1, np2, i1, i2;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1511
111
kono
parents: 67
diff changeset
1512 np1 = pred1.length ();
kono
parents: 67
diff changeset
1513 np2 = pred2.length ();
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1514
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1515 for (i2 = 0; i2 < np2; i2++)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1516 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1517 bool found = false;
111
kono
parents: 67
diff changeset
1518 pred_info info2 = pred2[i2];
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1519 for (i1 = 0; i1 < np1; i1++)
111
kono
parents: 67
diff changeset
1520 {
kono
parents: 67
diff changeset
1521 pred_info info1 = pred1[i1];
kono
parents: 67
diff changeset
1522 if (is_pred_expr_subset_of (info1, info2))
kono
parents: 67
diff changeset
1523 {
kono
parents: 67
diff changeset
1524 found = true;
kono
parents: 67
diff changeset
1525 break;
kono
parents: 67
diff changeset
1526 }
kono
parents: 67
diff changeset
1527 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1528 if (!found)
111
kono
parents: 67
diff changeset
1529 return false;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1530 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1531 return true;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1532 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1533
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1534 /* Returns true if the domain defined by
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1535 one pred chain ONE_PRED is a subset of the domain
111
kono
parents: 67
diff changeset
1536 of *PREDS. It returns false if ONE_PRED's domain is
kono
parents: 67
diff changeset
1537 not a subset of any of the sub-domains of PREDS
kono
parents: 67
diff changeset
1538 (corresponding to each individual chains in it), even
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1539 though it may be still be a subset of whole domain
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1540 of PREDS which is the union (ORed) of all its subdomains.
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1541 In other words, the result is conservative. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1542
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1543 static bool
111
kono
parents: 67
diff changeset
1544 is_included_in (pred_chain one_pred, pred_chain_union preds)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1545 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1546 size_t i;
111
kono
parents: 67
diff changeset
1547 size_t n = preds.length ();
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1548
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1549 for (i = 0; i < n; i++)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1550 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1551 if (is_pred_chain_subset_of (one_pred, preds[i]))
111
kono
parents: 67
diff changeset
1552 return true;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1553 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1554
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1555 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1556 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1557
111
kono
parents: 67
diff changeset
1558 /* Compares two predicate sets PREDS1 and PREDS2 and returns
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1559 true if the domain defined by PREDS1 is a superset
111
kono
parents: 67
diff changeset
1560 of PREDS2's domain. N1 and N2 are array sizes of PREDS1 and
kono
parents: 67
diff changeset
1561 PREDS2 respectively. The implementation chooses not to build
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1562 generic trees (and relying on the folding capability of the
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1563 compiler), but instead performs brute force comparison of
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1564 individual predicate chains (won't be a compile time problem
111
kono
parents: 67
diff changeset
1565 as the chains are pretty short). When the function returns
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1566 false, it does not necessarily mean *PREDS1 is not a superset
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1567 of *PREDS2, but mean it may not be so since the analysis can
111
kono
parents: 67
diff changeset
1568 not prove it. In such cases, false warnings may still be
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1569 emitted. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1570
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1571 static bool
111
kono
parents: 67
diff changeset
1572 is_superset_of (pred_chain_union preds1, pred_chain_union preds2)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1573 {
111
kono
parents: 67
diff changeset
1574 size_t i, n2;
kono
parents: 67
diff changeset
1575 pred_chain one_pred_chain = vNULL;
kono
parents: 67
diff changeset
1576
kono
parents: 67
diff changeset
1577 n2 = preds2.length ();
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1578
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1579 for (i = 0; i < n2; i++)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1580 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1581 one_pred_chain = preds2[i];
111
kono
parents: 67
diff changeset
1582 if (!is_included_in (one_pred_chain, preds1))
kono
parents: 67
diff changeset
1583 return false;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1584 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1585
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1586 return true;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1587 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
1588
111
kono
parents: 67
diff changeset
1589 /* Returns true if X1 is the negate of X2. */
kono
parents: 67
diff changeset
1590
kono
parents: 67
diff changeset
1591 static inline bool
kono
parents: 67
diff changeset
1592 pred_neg_p (pred_info x1, pred_info x2)
kono
parents: 67
diff changeset
1593 {
kono
parents: 67
diff changeset
1594 enum tree_code c1, c2;
kono
parents: 67
diff changeset
1595 if (!operand_equal_p (x1.pred_lhs, x2.pred_lhs, 0)
kono
parents: 67
diff changeset
1596 || !operand_equal_p (x1.pred_rhs, x2.pred_rhs, 0))
kono
parents: 67
diff changeset
1597 return false;
kono
parents: 67
diff changeset
1598
kono
parents: 67
diff changeset
1599 c1 = x1.cond_code;
kono
parents: 67
diff changeset
1600 if (x1.invert == x2.invert)
kono
parents: 67
diff changeset
1601 c2 = invert_tree_comparison (x2.cond_code, false);
kono
parents: 67
diff changeset
1602 else
kono
parents: 67
diff changeset
1603 c2 = x2.cond_code;
kono
parents: 67
diff changeset
1604
kono
parents: 67
diff changeset
1605 return c1 == c2;
kono
parents: 67
diff changeset
1606 }
kono
parents: 67
diff changeset
1607
kono
parents: 67
diff changeset
1608 /* 1) ((x IOR y) != 0) AND (x != 0) is equivalent to (x != 0);
kono
parents: 67
diff changeset
1609 2) (X AND Y) OR (!X AND Y) is equivalent to Y;
kono
parents: 67
diff changeset
1610 3) X OR (!X AND Y) is equivalent to (X OR Y);
kono
parents: 67
diff changeset
1611 4) ((x IAND y) != 0) || (x != 0 AND y != 0)) is equivalent to
kono
parents: 67
diff changeset
1612 (x != 0 AND y != 0)
kono
parents: 67
diff changeset
1613 5) (X AND Y) OR (!X AND Z) OR (!Y AND Z) is equivalent to
kono
parents: 67
diff changeset
1614 (X AND Y) OR Z
kono
parents: 67
diff changeset
1615
kono
parents: 67
diff changeset
1616 PREDS is the predicate chains, and N is the number of chains. */
kono
parents: 67
diff changeset
1617
kono
parents: 67
diff changeset
1618 /* Helper function to implement rule 1 above. ONE_CHAIN is
kono
parents: 67
diff changeset
1619 the AND predication to be simplified. */
kono
parents: 67
diff changeset
1620
kono
parents: 67
diff changeset
1621 static void
kono
parents: 67
diff changeset
1622 simplify_pred (pred_chain *one_chain)
kono
parents: 67
diff changeset
1623 {
kono
parents: 67
diff changeset
1624 size_t i, j, n;
kono
parents: 67
diff changeset
1625 bool simplified = false;
kono
parents: 67
diff changeset
1626 pred_chain s_chain = vNULL;
kono
parents: 67
diff changeset
1627
kono
parents: 67
diff changeset
1628 n = one_chain->length ();
kono
parents: 67
diff changeset
1629
kono
parents: 67
diff changeset
1630 for (i = 0; i < n; i++)
kono
parents: 67
diff changeset
1631 {
kono
parents: 67
diff changeset
1632 pred_info *a_pred = &(*one_chain)[i];
kono
parents: 67
diff changeset
1633
kono
parents: 67
diff changeset
1634 if (!a_pred->pred_lhs)
kono
parents: 67
diff changeset
1635 continue;
kono
parents: 67
diff changeset
1636 if (!is_neq_zero_form_p (*a_pred))
kono
parents: 67
diff changeset
1637 continue;
kono
parents: 67
diff changeset
1638
kono
parents: 67
diff changeset
1639 gimple *def_stmt = SSA_NAME_DEF_STMT (a_pred->pred_lhs);
kono
parents: 67
diff changeset
1640 if (gimple_code (def_stmt) != GIMPLE_ASSIGN)
kono
parents: 67
diff changeset
1641 continue;
kono
parents: 67
diff changeset
1642 if (gimple_assign_rhs_code (def_stmt) == BIT_IOR_EXPR)
kono
parents: 67
diff changeset
1643 {
kono
parents: 67
diff changeset
1644 for (j = 0; j < n; j++)
kono
parents: 67
diff changeset
1645 {
kono
parents: 67
diff changeset
1646 pred_info *b_pred = &(*one_chain)[j];
kono
parents: 67
diff changeset
1647
kono
parents: 67
diff changeset
1648 if (!b_pred->pred_lhs)
kono
parents: 67
diff changeset
1649 continue;
kono
parents: 67
diff changeset
1650 if (!is_neq_zero_form_p (*b_pred))
kono
parents: 67
diff changeset
1651 continue;
kono
parents: 67
diff changeset
1652
kono
parents: 67
diff changeset
1653 if (pred_expr_equal_p (*b_pred, gimple_assign_rhs1 (def_stmt))
kono
parents: 67
diff changeset
1654 || pred_expr_equal_p (*b_pred, gimple_assign_rhs2 (def_stmt)))
kono
parents: 67
diff changeset
1655 {
kono
parents: 67
diff changeset
1656 /* Mark a_pred for removal. */
kono
parents: 67
diff changeset
1657 a_pred->pred_lhs = NULL;
kono
parents: 67
diff changeset
1658 a_pred->pred_rhs = NULL;
kono
parents: 67
diff changeset
1659 simplified = true;
kono
parents: 67
diff changeset
1660 break;
kono
parents: 67
diff changeset
1661 }
kono
parents: 67
diff changeset
1662 }
kono
parents: 67
diff changeset
1663 }
kono
parents: 67
diff changeset
1664 }
kono
parents: 67
diff changeset
1665
kono
parents: 67
diff changeset
1666 if (!simplified)
kono
parents: 67
diff changeset
1667 return;
kono
parents: 67
diff changeset
1668
kono
parents: 67
diff changeset
1669 for (i = 0; i < n; i++)
kono
parents: 67
diff changeset
1670 {
kono
parents: 67
diff changeset
1671 pred_info *a_pred = &(*one_chain)[i];
kono
parents: 67
diff changeset
1672 if (!a_pred->pred_lhs)
kono
parents: 67
diff changeset
1673 continue;
kono
parents: 67
diff changeset
1674 s_chain.safe_push (*a_pred);
kono
parents: 67
diff changeset
1675 }
kono
parents: 67
diff changeset
1676
kono
parents: 67
diff changeset
1677 one_chain->release ();
kono
parents: 67
diff changeset
1678 *one_chain = s_chain;
kono
parents: 67
diff changeset
1679 }
kono
parents: 67
diff changeset
1680
kono
parents: 67
diff changeset
1681 /* The helper function implements the rule 2 for the
kono
parents: 67
diff changeset
1682 OR predicate PREDS.
kono
parents: 67
diff changeset
1683
kono
parents: 67
diff changeset
1684 2) (X AND Y) OR (!X AND Y) is equivalent to Y. */
kono
parents: 67
diff changeset
1685
kono
parents: 67
diff changeset
1686 static bool
kono
parents: 67
diff changeset
1687 simplify_preds_2 (pred_chain_union *preds)
kono
parents: 67
diff changeset
1688 {
kono
parents: 67
diff changeset
1689 size_t i, j, n;
kono
parents: 67
diff changeset
1690 bool simplified = false;
kono
parents: 67
diff changeset
1691 pred_chain_union s_preds = vNULL;
kono
parents: 67
diff changeset
1692
kono
parents: 67
diff changeset
1693 /* (X AND Y) OR (!X AND Y) is equivalent to Y.
kono
parents: 67
diff changeset
1694 (X AND Y) OR (X AND !Y) is equivalent to X. */
kono
parents: 67
diff changeset
1695
kono
parents: 67
diff changeset
1696 n = preds->length ();
kono
parents: 67
diff changeset
1697 for (i = 0; i < n; i++)
kono
parents: 67
diff changeset
1698 {
kono
parents: 67
diff changeset
1699 pred_info x, y;
kono
parents: 67
diff changeset
1700 pred_chain *a_chain = &(*preds)[i];
kono
parents: 67
diff changeset
1701
kono
parents: 67
diff changeset
1702 if (a_chain->length () != 2)
kono
parents: 67
diff changeset
1703 continue;
kono
parents: 67
diff changeset
1704
kono
parents: 67
diff changeset
1705 x = (*a_chain)[0];
kono
parents: 67
diff changeset
1706 y = (*a_chain)[1];
kono
parents: 67
diff changeset
1707
kono
parents: 67
diff changeset
1708 for (j = 0; j < n; j++)
kono
parents: 67
diff changeset
1709 {
kono
parents: 67
diff changeset
1710 pred_chain *b_chain;
kono
parents: 67
diff changeset
1711 pred_info x2, y2;
kono
parents: 67
diff changeset
1712
kono
parents: 67
diff changeset
1713 if (j == i)
kono
parents: 67
diff changeset
1714 continue;
kono
parents: 67
diff changeset
1715
kono
parents: 67
diff changeset
1716 b_chain = &(*preds)[j];
kono
parents: 67
diff changeset
1717 if (b_chain->length () != 2)
kono
parents: 67
diff changeset
1718 continue;
kono
parents: 67
diff changeset
1719
kono
parents: 67
diff changeset
1720 x2 = (*b_chain)[0];
kono
parents: 67
diff changeset
1721 y2 = (*b_chain)[1];
kono
parents: 67
diff changeset
1722
kono
parents: 67
diff changeset
1723 if (pred_equal_p (x, x2) && pred_neg_p (y, y2))
kono
parents: 67
diff changeset
1724 {
kono
parents: 67
diff changeset
1725 /* Kill a_chain. */
kono
parents: 67
diff changeset
1726 a_chain->release ();
kono
parents: 67
diff changeset
1727 b_chain->release ();
kono
parents: 67
diff changeset
1728 b_chain->safe_push (x);
kono
parents: 67
diff changeset
1729 simplified = true;
kono
parents: 67
diff changeset
1730 break;
kono
parents: 67
diff changeset
1731 }
kono
parents: 67
diff changeset
1732 if (pred_neg_p (x, x2) && pred_equal_p (y, y2))
kono
parents: 67
diff changeset
1733 {
kono
parents: 67
diff changeset
1734 /* Kill a_chain. */
kono
parents: 67
diff changeset
1735 a_chain->release ();
kono
parents: 67
diff changeset
1736 b_chain->release ();
kono
parents: 67
diff changeset
1737 b_chain->safe_push (y);
kono
parents: 67
diff changeset
1738 simplified = true;
kono
parents: 67
diff changeset
1739 break;
kono
parents: 67
diff changeset
1740 }
kono
parents: 67
diff changeset
1741 }
kono
parents: 67
diff changeset
1742 }
kono
parents: 67
diff changeset
1743 /* Now clean up the chain. */
kono
parents: 67
diff changeset
1744 if (simplified)
kono
parents: 67
diff changeset
1745 {
kono
parents: 67
diff changeset
1746 for (i = 0; i < n; i++)
kono
parents: 67
diff changeset
1747 {
kono
parents: 67
diff changeset
1748 if ((*preds)[i].is_empty ())
kono
parents: 67
diff changeset
1749 continue;
kono
parents: 67
diff changeset
1750 s_preds.safe_push ((*preds)[i]);
kono
parents: 67
diff changeset
1751 }
kono
parents: 67
diff changeset
1752 preds->release ();
kono
parents: 67
diff changeset
1753 (*preds) = s_preds;
kono
parents: 67
diff changeset
1754 s_preds = vNULL;
kono
parents: 67
diff changeset
1755 }
kono
parents: 67
diff changeset
1756
kono
parents: 67
diff changeset
1757 return simplified;
kono
parents: 67
diff changeset
1758 }
kono
parents: 67
diff changeset
1759
kono
parents: 67
diff changeset
1760 /* The helper function implements the rule 2 for the
kono
parents: 67
diff changeset
1761 OR predicate PREDS.
kono
parents: 67
diff changeset
1762
kono
parents: 67
diff changeset
1763 3) x OR (!x AND y) is equivalent to x OR y. */
kono
parents: 67
diff changeset
1764
kono
parents: 67
diff changeset
1765 static bool
kono
parents: 67
diff changeset
1766 simplify_preds_3 (pred_chain_union *preds)
kono
parents: 67
diff changeset
1767 {
kono
parents: 67
diff changeset
1768 size_t i, j, n;
kono
parents: 67
diff changeset
1769 bool simplified = false;
kono
parents: 67
diff changeset
1770
kono
parents: 67
diff changeset
1771 /* Now iteratively simplify X OR (!X AND Z ..)
kono
parents: 67
diff changeset
1772 into X OR (Z ...). */
kono
parents: 67
diff changeset
1773
kono
parents: 67
diff changeset
1774 n = preds->length ();
kono
parents: 67
diff changeset
1775 if (n < 2)
kono
parents: 67
diff changeset
1776 return false;
kono
parents: 67
diff changeset
1777
kono
parents: 67
diff changeset
1778 for (i = 0; i < n; i++)
kono
parents: 67
diff changeset
1779 {
kono
parents: 67
diff changeset
1780 pred_info x;
kono
parents: 67
diff changeset
1781 pred_chain *a_chain = &(*preds)[i];
kono
parents: 67
diff changeset
1782
kono
parents: 67
diff changeset
1783 if (a_chain->length () != 1)
kono
parents: 67
diff changeset
1784 continue;
kono
parents: 67
diff changeset
1785
kono
parents: 67
diff changeset
1786 x = (*a_chain)[0];
kono
parents: 67
diff changeset
1787
kono
parents: 67
diff changeset
1788 for (j = 0; j < n; j++)
kono
parents: 67
diff changeset
1789 {
kono
parents: 67
diff changeset
1790 pred_chain *b_chain;
kono
parents: 67
diff changeset
1791 pred_info x2;
kono
parents: 67
diff changeset
1792 size_t k;
kono
parents: 67
diff changeset
1793
kono
parents: 67
diff changeset
1794 if (j == i)
kono
parents: 67
diff changeset
1795 continue;
kono
parents: 67
diff changeset
1796
kono
parents: 67
diff changeset
1797 b_chain = &(*preds)[j];
kono
parents: 67
diff changeset
1798 if (b_chain->length () < 2)
kono
parents: 67
diff changeset
1799 continue;
kono
parents: 67
diff changeset
1800
kono
parents: 67
diff changeset
1801 for (k = 0; k < b_chain->length (); k++)
kono
parents: 67
diff changeset
1802 {
kono
parents: 67
diff changeset
1803 x2 = (*b_chain)[k];
kono
parents: 67
diff changeset
1804 if (pred_neg_p (x, x2))
kono
parents: 67
diff changeset
1805 {
kono
parents: 67
diff changeset
1806 b_chain->unordered_remove (k);
kono
parents: 67
diff changeset
1807 simplified = true;
kono
parents: 67
diff changeset
1808 break;
kono
parents: 67
diff changeset
1809 }
kono
parents: 67
diff changeset
1810 }
kono
parents: 67
diff changeset
1811 }
kono
parents: 67
diff changeset
1812 }
kono
parents: 67
diff changeset
1813 return simplified;
kono
parents: 67
diff changeset
1814 }
kono
parents: 67
diff changeset
1815
kono
parents: 67
diff changeset
1816 /* The helper function implements the rule 4 for the
kono
parents: 67
diff changeset
1817 OR predicate PREDS.
kono
parents: 67
diff changeset
1818
kono
parents: 67
diff changeset
1819 2) ((x AND y) != 0) OR (x != 0 AND y != 0) is equivalent to
kono
parents: 67
diff changeset
1820 (x != 0 ANd y != 0). */
kono
parents: 67
diff changeset
1821
kono
parents: 67
diff changeset
1822 static bool
kono
parents: 67
diff changeset
1823 simplify_preds_4 (pred_chain_union *preds)
kono
parents: 67
diff changeset
1824 {
kono
parents: 67
diff changeset
1825 size_t i, j, n;
kono
parents: 67
diff changeset
1826 bool simplified = false;
kono
parents: 67
diff changeset
1827 pred_chain_union s_preds = vNULL;
kono
parents: 67
diff changeset
1828 gimple *def_stmt;
kono
parents: 67
diff changeset
1829
kono
parents: 67
diff changeset
1830 n = preds->length ();
kono
parents: 67
diff changeset
1831 for (i = 0; i < n; i++)
kono
parents: 67
diff changeset
1832 {
kono
parents: 67
diff changeset
1833 pred_info z;
kono
parents: 67
diff changeset
1834 pred_chain *a_chain = &(*preds)[i];
kono
parents: 67
diff changeset
1835
kono
parents: 67
diff changeset
1836 if (a_chain->length () != 1)
kono
parents: 67
diff changeset
1837 continue;
kono
parents: 67
diff changeset
1838
kono
parents: 67
diff changeset
1839 z = (*a_chain)[0];
kono
parents: 67
diff changeset
1840
kono
parents: 67
diff changeset
1841 if (!is_neq_zero_form_p (z))
kono
parents: 67
diff changeset
1842 continue;
kono
parents: 67
diff changeset
1843
kono
parents: 67
diff changeset
1844 def_stmt = SSA_NAME_DEF_STMT (z.pred_lhs);
kono
parents: 67
diff changeset
1845 if (gimple_code (def_stmt) != GIMPLE_ASSIGN)
kono
parents: 67
diff changeset
1846 continue;
kono
parents: 67
diff changeset
1847
kono
parents: 67
diff changeset
1848 if (gimple_assign_rhs_code (def_stmt) != BIT_AND_EXPR)
kono
parents: 67
diff changeset
1849 continue;
kono
parents: 67
diff changeset
1850
kono
parents: 67
diff changeset
1851 for (j = 0; j < n; j++)
kono
parents: 67
diff changeset
1852 {
kono
parents: 67
diff changeset
1853 pred_chain *b_chain;
kono
parents: 67
diff changeset
1854 pred_info x2, y2;
kono
parents: 67
diff changeset
1855
kono
parents: 67
diff changeset
1856 if (j == i)
kono
parents: 67
diff changeset
1857 continue;
kono
parents: 67
diff changeset
1858
kono
parents: 67
diff changeset
1859 b_chain = &(*preds)[j];
kono
parents: 67
diff changeset
1860 if (b_chain->length () != 2)
kono
parents: 67
diff changeset
1861 continue;
kono
parents: 67
diff changeset
1862
kono
parents: 67
diff changeset
1863 x2 = (*b_chain)[0];
kono
parents: 67
diff changeset
1864 y2 = (*b_chain)[1];
kono
parents: 67
diff changeset
1865 if (!is_neq_zero_form_p (x2) || !is_neq_zero_form_p (y2))
kono
parents: 67
diff changeset
1866 continue;
kono
parents: 67
diff changeset
1867
kono
parents: 67
diff changeset
1868 if ((pred_expr_equal_p (x2, gimple_assign_rhs1 (def_stmt))
kono
parents: 67
diff changeset
1869 && pred_expr_equal_p (y2, gimple_assign_rhs2 (def_stmt)))
kono
parents: 67
diff changeset
1870 || (pred_expr_equal_p (x2, gimple_assign_rhs2 (def_stmt))
kono
parents: 67
diff changeset
1871 && pred_expr_equal_p (y2, gimple_assign_rhs1 (def_stmt))))
kono
parents: 67
diff changeset
1872 {
kono
parents: 67
diff changeset
1873 /* Kill a_chain. */
kono
parents: 67
diff changeset
1874 a_chain->release ();
kono
parents: 67
diff changeset
1875 simplified = true;
kono
parents: 67
diff changeset
1876 break;
kono
parents: 67
diff changeset
1877 }
kono
parents: 67
diff changeset
1878 }
kono
parents: 67
diff changeset
1879 }
kono
parents: 67
diff changeset
1880 /* Now clean up the chain. */
kono
parents: 67
diff changeset
1881 if (simplified)
kono
parents: 67
diff changeset
1882 {
kono
parents: 67
diff changeset
1883 for (i = 0; i < n; i++)
kono
parents: 67
diff changeset
1884 {
kono
parents: 67
diff changeset
1885 if ((*preds)[i].is_empty ())
kono
parents: 67
diff changeset
1886 continue;
kono
parents: 67
diff changeset
1887 s_preds.safe_push ((*preds)[i]);
kono
parents: 67
diff changeset
1888 }
kono
parents: 67
diff changeset
1889
kono
parents: 67
diff changeset
1890 preds->release ();
kono
parents: 67
diff changeset
1891 (*preds) = s_preds;
kono
parents: 67
diff changeset
1892 s_preds = vNULL;
kono
parents: 67
diff changeset
1893 }
kono
parents: 67
diff changeset
1894
kono
parents: 67
diff changeset
1895 return simplified;
kono
parents: 67
diff changeset
1896 }
kono
parents: 67
diff changeset
1897
kono
parents: 67
diff changeset
1898 /* This function simplifies predicates in PREDS. */
kono
parents: 67
diff changeset
1899
kono
parents: 67
diff changeset
1900 static void
kono
parents: 67
diff changeset
1901 simplify_preds (pred_chain_union *preds, gimple *use_or_def, bool is_use)
kono
parents: 67
diff changeset
1902 {
kono
parents: 67
diff changeset
1903 size_t i, n;
kono
parents: 67
diff changeset
1904 bool changed = false;
kono
parents: 67
diff changeset
1905
kono
parents: 67
diff changeset
1906 if (dump_file && dump_flags & TDF_DETAILS)
kono
parents: 67
diff changeset
1907 {
kono
parents: 67
diff changeset
1908 fprintf (dump_file, "[BEFORE SIMPLICATION -- ");
kono
parents: 67
diff changeset
1909 dump_predicates (use_or_def, *preds, is_use ? "[USE]:\n" : "[DEF]:\n");
kono
parents: 67
diff changeset
1910 }
kono
parents: 67
diff changeset
1911
kono
parents: 67
diff changeset
1912 for (i = 0; i < preds->length (); i++)
kono
parents: 67
diff changeset
1913 simplify_pred (&(*preds)[i]);
kono
parents: 67
diff changeset
1914
kono
parents: 67
diff changeset
1915 n = preds->length ();
kono
parents: 67
diff changeset
1916 if (n < 2)
kono
parents: 67
diff changeset
1917 return;
kono
parents: 67
diff changeset
1918
kono
parents: 67
diff changeset
1919 do
kono
parents: 67
diff changeset
1920 {
kono
parents: 67
diff changeset
1921 changed = false;
kono
parents: 67
diff changeset
1922 if (simplify_preds_2 (preds))
kono
parents: 67
diff changeset
1923 changed = true;
kono
parents: 67
diff changeset
1924
kono
parents: 67
diff changeset
1925 /* Now iteratively simplify X OR (!X AND Z ..)
kono
parents: 67
diff changeset
1926 into X OR (Z ...). */
kono
parents: 67
diff changeset
1927 if (simplify_preds_3 (preds))
kono
parents: 67
diff changeset
1928 changed = true;
kono
parents: 67
diff changeset
1929
kono
parents: 67
diff changeset
1930 if (simplify_preds_4 (preds))
kono
parents: 67
diff changeset
1931 changed = true;
kono
parents: 67
diff changeset
1932 }
kono
parents: 67
diff changeset
1933 while (changed);
kono
parents: 67
diff changeset
1934
kono
parents: 67
diff changeset
1935 return;
kono
parents: 67
diff changeset
1936 }
kono
parents: 67
diff changeset
1937
kono
parents: 67
diff changeset
1938 /* This is a helper function which attempts to normalize predicate chains
kono
parents: 67
diff changeset
1939 by following UD chains. It basically builds up a big tree of either IOR
kono
parents: 67
diff changeset
1940 operations or AND operations, and convert the IOR tree into a
kono
parents: 67
diff changeset
1941 pred_chain_union or BIT_AND tree into a pred_chain.
kono
parents: 67
diff changeset
1942 Example:
kono
parents: 67
diff changeset
1943
kono
parents: 67
diff changeset
1944 _3 = _2 RELOP1 _1;
kono
parents: 67
diff changeset
1945 _6 = _5 RELOP2 _4;
kono
parents: 67
diff changeset
1946 _9 = _8 RELOP3 _7;
kono
parents: 67
diff changeset
1947 _10 = _3 | _6;
kono
parents: 67
diff changeset
1948 _12 = _9 | _0;
kono
parents: 67
diff changeset
1949 _t = _10 | _12;
kono
parents: 67
diff changeset
1950
kono
parents: 67
diff changeset
1951 then _t != 0 will be normalized into a pred_chain_union
kono
parents: 67
diff changeset
1952
kono
parents: 67
diff changeset
1953 (_2 RELOP1 _1) OR (_5 RELOP2 _4) OR (_8 RELOP3 _7) OR (_0 != 0)
kono
parents: 67
diff changeset
1954
kono
parents: 67
diff changeset
1955 Similarly given,
kono
parents: 67
diff changeset
1956
kono
parents: 67
diff changeset
1957 _3 = _2 RELOP1 _1;
kono
parents: 67
diff changeset
1958 _6 = _5 RELOP2 _4;
kono
parents: 67
diff changeset
1959 _9 = _8 RELOP3 _7;
kono
parents: 67
diff changeset
1960 _10 = _3 & _6;
kono
parents: 67
diff changeset
1961 _12 = _9 & _0;
kono
parents: 67
diff changeset
1962
kono
parents: 67
diff changeset
1963 then _t != 0 will be normalized into a pred_chain:
kono
parents: 67
diff changeset
1964 (_2 RELOP1 _1) AND (_5 RELOP2 _4) AND (_8 RELOP3 _7) AND (_0 != 0)
kono
parents: 67
diff changeset
1965
kono
parents: 67
diff changeset
1966 */
kono
parents: 67
diff changeset
1967
kono
parents: 67
diff changeset
1968 /* This is a helper function that stores a PRED into NORM_PREDS. */
kono
parents: 67
diff changeset
1969
kono
parents: 67
diff changeset
1970 inline static void
kono
parents: 67
diff changeset
1971 push_pred (pred_chain_union *norm_preds, pred_info pred)
kono
parents: 67
diff changeset
1972 {
kono
parents: 67
diff changeset
1973 pred_chain pred_chain = vNULL;
kono
parents: 67
diff changeset
1974 pred_chain.safe_push (pred);
kono
parents: 67
diff changeset
1975 norm_preds->safe_push (pred_chain);
kono
parents: 67
diff changeset
1976 }
kono
parents: 67
diff changeset
1977
kono
parents: 67
diff changeset
1978 /* A helper function that creates a predicate of the form
kono
parents: 67
diff changeset
1979 OP != 0 and push it WORK_LIST. */
kono
parents: 67
diff changeset
1980
kono
parents: 67
diff changeset
1981 inline static void
kono
parents: 67
diff changeset
1982 push_to_worklist (tree op, vec<pred_info, va_heap, vl_ptr> *work_list,
kono
parents: 67
diff changeset
1983 hash_set<tree> *mark_set)
kono
parents: 67
diff changeset
1984 {
kono
parents: 67
diff changeset
1985 if (mark_set->contains (op))
kono
parents: 67
diff changeset
1986 return;
kono
parents: 67
diff changeset
1987 mark_set->add (op);
kono
parents: 67
diff changeset
1988
kono
parents: 67
diff changeset
1989 pred_info arg_pred;
kono
parents: 67
diff changeset
1990 arg_pred.pred_lhs = op;
kono
parents: 67
diff changeset
1991 arg_pred.pred_rhs = integer_zero_node;
kono
parents: 67
diff changeset
1992 arg_pred.cond_code = NE_EXPR;
kono
parents: 67
diff changeset
1993 arg_pred.invert = false;
kono
parents: 67
diff changeset
1994 work_list->safe_push (arg_pred);
kono
parents: 67
diff changeset
1995 }
kono
parents: 67
diff changeset
1996
kono
parents: 67
diff changeset
1997 /* A helper that generates a pred_info from a gimple assignment
kono
parents: 67
diff changeset
1998 CMP_ASSIGN with comparison rhs. */
kono
parents: 67
diff changeset
1999
kono
parents: 67
diff changeset
2000 static pred_info
kono
parents: 67
diff changeset
2001 get_pred_info_from_cmp (gimple *cmp_assign)
kono
parents: 67
diff changeset
2002 {
kono
parents: 67
diff changeset
2003 pred_info n_pred;
kono
parents: 67
diff changeset
2004 n_pred.pred_lhs = gimple_assign_rhs1 (cmp_assign);
kono
parents: 67
diff changeset
2005 n_pred.pred_rhs = gimple_assign_rhs2 (cmp_assign);
kono
parents: 67
diff changeset
2006 n_pred.cond_code = gimple_assign_rhs_code (cmp_assign);
kono
parents: 67
diff changeset
2007 n_pred.invert = false;
kono
parents: 67
diff changeset
2008 return n_pred;
kono
parents: 67
diff changeset
2009 }
kono
parents: 67
diff changeset
2010
kono
parents: 67
diff changeset
2011 /* Returns true if the PHI is a degenerated phi with
kono
parents: 67
diff changeset
2012 all args with the same value (relop). In that case, *PRED
kono
parents: 67
diff changeset
2013 will be updated to that value. */
kono
parents: 67
diff changeset
2014
kono
parents: 67
diff changeset
2015 static bool
kono
parents: 67
diff changeset
2016 is_degenerated_phi (gimple *phi, pred_info *pred_p)
kono
parents: 67
diff changeset
2017 {
kono
parents: 67
diff changeset
2018 int i, n;
kono
parents: 67
diff changeset
2019 tree op0;
kono
parents: 67
diff changeset
2020 gimple *def0;
kono
parents: 67
diff changeset
2021 pred_info pred0;
kono
parents: 67
diff changeset
2022
kono
parents: 67
diff changeset
2023 n = gimple_phi_num_args (phi);
kono
parents: 67
diff changeset
2024 op0 = gimple_phi_arg_def (phi, 0);
kono
parents: 67
diff changeset
2025
kono
parents: 67
diff changeset
2026 if (TREE_CODE (op0) != SSA_NAME)
kono
parents: 67
diff changeset
2027 return false;
kono
parents: 67
diff changeset
2028
kono
parents: 67
diff changeset
2029 def0 = SSA_NAME_DEF_STMT (op0);
kono
parents: 67
diff changeset
2030 if (gimple_code (def0) != GIMPLE_ASSIGN)
kono
parents: 67
diff changeset
2031 return false;
kono
parents: 67
diff changeset
2032 if (TREE_CODE_CLASS (gimple_assign_rhs_code (def0)) != tcc_comparison)
kono
parents: 67
diff changeset
2033 return false;
kono
parents: 67
diff changeset
2034 pred0 = get_pred_info_from_cmp (def0);
kono
parents: 67
diff changeset
2035
kono
parents: 67
diff changeset
2036 for (i = 1; i < n; ++i)
kono
parents: 67
diff changeset
2037 {
kono
parents: 67
diff changeset
2038 gimple *def;
kono
parents: 67
diff changeset
2039 pred_info pred;
kono
parents: 67
diff changeset
2040 tree op = gimple_phi_arg_def (phi, i);
kono
parents: 67
diff changeset
2041
kono
parents: 67
diff changeset
2042 if (TREE_CODE (op) != SSA_NAME)
kono
parents: 67
diff changeset
2043 return false;
kono
parents: 67
diff changeset
2044
kono
parents: 67
diff changeset
2045 def = SSA_NAME_DEF_STMT (op);
kono
parents: 67
diff changeset
2046 if (gimple_code (def) != GIMPLE_ASSIGN)
kono
parents: 67
diff changeset
2047 return false;
kono
parents: 67
diff changeset
2048 if (TREE_CODE_CLASS (gimple_assign_rhs_code (def)) != tcc_comparison)
kono
parents: 67
diff changeset
2049 return false;
kono
parents: 67
diff changeset
2050 pred = get_pred_info_from_cmp (def);
kono
parents: 67
diff changeset
2051 if (!pred_equal_p (pred, pred0))
kono
parents: 67
diff changeset
2052 return false;
kono
parents: 67
diff changeset
2053 }
kono
parents: 67
diff changeset
2054
kono
parents: 67
diff changeset
2055 *pred_p = pred0;
kono
parents: 67
diff changeset
2056 return true;
kono
parents: 67
diff changeset
2057 }
kono
parents: 67
diff changeset
2058
kono
parents: 67
diff changeset
2059 /* Normalize one predicate PRED
kono
parents: 67
diff changeset
2060 1) if PRED can no longer be normlized, put it into NORM_PREDS.
kono
parents: 67
diff changeset
2061 2) otherwise if PRED is of the form x != 0, follow x's definition
kono
parents: 67
diff changeset
2062 and put normalized predicates into WORK_LIST. */
kono
parents: 67
diff changeset
2063
kono
parents: 67
diff changeset
2064 static void
kono
parents: 67
diff changeset
2065 normalize_one_pred_1 (pred_chain_union *norm_preds,
kono
parents: 67
diff changeset
2066 pred_chain *norm_chain,
kono
parents: 67
diff changeset
2067 pred_info pred,
kono
parents: 67
diff changeset
2068 enum tree_code and_or_code,
kono
parents: 67
diff changeset
2069 vec<pred_info, va_heap, vl_ptr> *work_list,
kono
parents: 67
diff changeset
2070 hash_set<tree> *mark_set)
kono
parents: 67
diff changeset
2071 {
kono
parents: 67
diff changeset
2072 if (!is_neq_zero_form_p (pred))
kono
parents: 67
diff changeset
2073 {
kono
parents: 67
diff changeset
2074 if (and_or_code == BIT_IOR_EXPR)
kono
parents: 67
diff changeset
2075 push_pred (norm_preds, pred);
kono
parents: 67
diff changeset
2076 else
kono
parents: 67
diff changeset
2077 norm_chain->safe_push (pred);
kono
parents: 67
diff changeset
2078 return;
kono
parents: 67
diff changeset
2079 }
kono
parents: 67
diff changeset
2080
kono
parents: 67
diff changeset
2081 gimple *def_stmt = SSA_NAME_DEF_STMT (pred.pred_lhs);
kono
parents: 67
diff changeset
2082
kono
parents: 67
diff changeset
2083 if (gimple_code (def_stmt) == GIMPLE_PHI
kono
parents: 67
diff changeset
2084 && is_degenerated_phi (def_stmt, &pred))
kono
parents: 67
diff changeset
2085 work_list->safe_push (pred);
kono
parents: 67
diff changeset
2086 else if (gimple_code (def_stmt) == GIMPLE_PHI && and_or_code == BIT_IOR_EXPR)
kono
parents: 67
diff changeset
2087 {
kono
parents: 67
diff changeset
2088 int i, n;
kono
parents: 67
diff changeset
2089 n = gimple_phi_num_args (def_stmt);
kono
parents: 67
diff changeset
2090
kono
parents: 67
diff changeset
2091 /* If we see non zero constant, we should punt. The predicate
kono
parents: 67
diff changeset
2092 * should be one guarding the phi edge. */
kono
parents: 67
diff changeset
2093 for (i = 0; i < n; ++i)
kono
parents: 67
diff changeset
2094 {
kono
parents: 67
diff changeset
2095 tree op = gimple_phi_arg_def (def_stmt, i);
kono
parents: 67
diff changeset
2096 if (TREE_CODE (op) == INTEGER_CST && !integer_zerop (op))
kono
parents: 67
diff changeset
2097 {
kono
parents: 67
diff changeset
2098 push_pred (norm_preds, pred);
kono
parents: 67
diff changeset
2099 return;
kono
parents: 67
diff changeset
2100 }
kono
parents: 67
diff changeset
2101 }
kono
parents: 67
diff changeset
2102
kono
parents: 67
diff changeset
2103 for (i = 0; i < n; ++i)
kono
parents: 67
diff changeset
2104 {
kono
parents: 67
diff changeset
2105 tree op = gimple_phi_arg_def (def_stmt, i);
kono
parents: 67
diff changeset
2106 if (integer_zerop (op))
kono
parents: 67
diff changeset
2107 continue;
kono
parents: 67
diff changeset
2108
kono
parents: 67
diff changeset
2109 push_to_worklist (op, work_list, mark_set);
kono
parents: 67
diff changeset
2110 }
kono
parents: 67
diff changeset
2111 }
kono
parents: 67
diff changeset
2112 else if (gimple_code (def_stmt) != GIMPLE_ASSIGN)
kono
parents: 67
diff changeset
2113 {
kono
parents: 67
diff changeset
2114 if (and_or_code == BIT_IOR_EXPR)
kono
parents: 67
diff changeset
2115 push_pred (norm_preds, pred);
kono
parents: 67
diff changeset
2116 else
kono
parents: 67
diff changeset
2117 norm_chain->safe_push (pred);
kono
parents: 67
diff changeset
2118 }
kono
parents: 67
diff changeset
2119 else if (gimple_assign_rhs_code (def_stmt) == and_or_code)
kono
parents: 67
diff changeset
2120 {
kono
parents: 67
diff changeset
2121 /* Avoid splitting up bit manipulations like x & 3 or y | 1. */
kono
parents: 67
diff changeset
2122 if (is_gimple_min_invariant (gimple_assign_rhs2 (def_stmt)))
kono
parents: 67
diff changeset
2123 {
kono
parents: 67
diff changeset
2124 /* But treat x & 3 as condition. */
kono
parents: 67
diff changeset
2125 if (and_or_code == BIT_AND_EXPR)
kono
parents: 67
diff changeset
2126 {
kono
parents: 67
diff changeset
2127 pred_info n_pred;
kono
parents: 67
diff changeset
2128 n_pred.pred_lhs = gimple_assign_rhs1 (def_stmt);
kono
parents: 67
diff changeset
2129 n_pred.pred_rhs = gimple_assign_rhs2 (def_stmt);
kono
parents: 67
diff changeset
2130 n_pred.cond_code = and_or_code;
kono
parents: 67
diff changeset
2131 n_pred.invert = false;
kono
parents: 67
diff changeset
2132 norm_chain->safe_push (n_pred);
kono
parents: 67
diff changeset
2133 }
kono
parents: 67
diff changeset
2134 }
kono
parents: 67
diff changeset
2135 else
kono
parents: 67
diff changeset
2136 {
kono
parents: 67
diff changeset
2137 push_to_worklist (gimple_assign_rhs1 (def_stmt), work_list, mark_set);
kono
parents: 67
diff changeset
2138 push_to_worklist (gimple_assign_rhs2 (def_stmt), work_list, mark_set);
kono
parents: 67
diff changeset
2139 }
kono
parents: 67
diff changeset
2140 }
kono
parents: 67
diff changeset
2141 else if (TREE_CODE_CLASS (gimple_assign_rhs_code (def_stmt))
kono
parents: 67
diff changeset
2142 == tcc_comparison)
kono
parents: 67
diff changeset
2143 {
kono
parents: 67
diff changeset
2144 pred_info n_pred = get_pred_info_from_cmp (def_stmt);
kono
parents: 67
diff changeset
2145 if (and_or_code == BIT_IOR_EXPR)
kono
parents: 67
diff changeset
2146 push_pred (norm_preds, n_pred);
kono
parents: 67
diff changeset
2147 else
kono
parents: 67
diff changeset
2148 norm_chain->safe_push (n_pred);
kono
parents: 67
diff changeset
2149 }
kono
parents: 67
diff changeset
2150 else
kono
parents: 67
diff changeset
2151 {
kono
parents: 67
diff changeset
2152 if (and_or_code == BIT_IOR_EXPR)
kono
parents: 67
diff changeset
2153 push_pred (norm_preds, pred);
kono
parents: 67
diff changeset
2154 else
kono
parents: 67
diff changeset
2155 norm_chain->safe_push (pred);
kono
parents: 67
diff changeset
2156 }
kono
parents: 67
diff changeset
2157 }
kono
parents: 67
diff changeset
2158
kono
parents: 67
diff changeset
2159 /* Normalize PRED and store the normalized predicates into NORM_PREDS. */
kono
parents: 67
diff changeset
2160
kono
parents: 67
diff changeset
2161 static void
kono
parents: 67
diff changeset
2162 normalize_one_pred (pred_chain_union *norm_preds, pred_info pred)
kono
parents: 67
diff changeset
2163 {
kono
parents: 67
diff changeset
2164 vec<pred_info, va_heap, vl_ptr> work_list = vNULL;
kono
parents: 67
diff changeset
2165 enum tree_code and_or_code = ERROR_MARK;
kono
parents: 67
diff changeset
2166 pred_chain norm_chain = vNULL;
kono
parents: 67
diff changeset
2167
kono
parents: 67
diff changeset
2168 if (!is_neq_zero_form_p (pred))
kono
parents: 67
diff changeset
2169 {
kono
parents: 67
diff changeset
2170 push_pred (norm_preds, pred);
kono
parents: 67
diff changeset
2171 return;
kono
parents: 67
diff changeset
2172 }
kono
parents: 67
diff changeset
2173
kono
parents: 67
diff changeset
2174 gimple *def_stmt = SSA_NAME_DEF_STMT (pred.pred_lhs);
kono
parents: 67
diff changeset
2175 if (gimple_code (def_stmt) == GIMPLE_ASSIGN)
kono
parents: 67
diff changeset
2176 and_or_code = gimple_assign_rhs_code (def_stmt);
kono
parents: 67
diff changeset
2177 if (and_or_code != BIT_IOR_EXPR && and_or_code != BIT_AND_EXPR)
kono
parents: 67
diff changeset
2178 {
kono
parents: 67
diff changeset
2179 if (TREE_CODE_CLASS (and_or_code) == tcc_comparison)
kono
parents: 67
diff changeset
2180 {
kono
parents: 67
diff changeset
2181 pred_info n_pred = get_pred_info_from_cmp (def_stmt);
kono
parents: 67
diff changeset
2182 push_pred (norm_preds, n_pred);
kono
parents: 67
diff changeset
2183 }
kono
parents: 67
diff changeset
2184 else
kono
parents: 67
diff changeset
2185 push_pred (norm_preds, pred);
kono
parents: 67
diff changeset
2186 return;
kono
parents: 67
diff changeset
2187 }
kono
parents: 67
diff changeset
2188
kono
parents: 67
diff changeset
2189 work_list.safe_push (pred);
kono
parents: 67
diff changeset
2190 hash_set<tree> mark_set;
kono
parents: 67
diff changeset
2191
kono
parents: 67
diff changeset
2192 while (!work_list.is_empty ())
kono
parents: 67
diff changeset
2193 {
kono
parents: 67
diff changeset
2194 pred_info a_pred = work_list.pop ();
kono
parents: 67
diff changeset
2195 normalize_one_pred_1 (norm_preds, &norm_chain, a_pred, and_or_code,
kono
parents: 67
diff changeset
2196 &work_list, &mark_set);
kono
parents: 67
diff changeset
2197 }
kono
parents: 67
diff changeset
2198 if (and_or_code == BIT_AND_EXPR)
kono
parents: 67
diff changeset
2199 norm_preds->safe_push (norm_chain);
kono
parents: 67
diff changeset
2200
kono
parents: 67
diff changeset
2201 work_list.release ();
kono
parents: 67
diff changeset
2202 }
kono
parents: 67
diff changeset
2203
kono
parents: 67
diff changeset
2204 static void
kono
parents: 67
diff changeset
2205 normalize_one_pred_chain (pred_chain_union *norm_preds, pred_chain one_chain)
kono
parents: 67
diff changeset
2206 {
kono
parents: 67
diff changeset
2207 vec<pred_info, va_heap, vl_ptr> work_list = vNULL;
kono
parents: 67
diff changeset
2208 hash_set<tree> mark_set;
kono
parents: 67
diff changeset
2209 pred_chain norm_chain = vNULL;
kono
parents: 67
diff changeset
2210 size_t i;
kono
parents: 67
diff changeset
2211
kono
parents: 67
diff changeset
2212 for (i = 0; i < one_chain.length (); i++)
kono
parents: 67
diff changeset
2213 {
kono
parents: 67
diff changeset
2214 work_list.safe_push (one_chain[i]);
kono
parents: 67
diff changeset
2215 mark_set.add (one_chain[i].pred_lhs);
kono
parents: 67
diff changeset
2216 }
kono
parents: 67
diff changeset
2217
kono
parents: 67
diff changeset
2218 while (!work_list.is_empty ())
kono
parents: 67
diff changeset
2219 {
kono
parents: 67
diff changeset
2220 pred_info a_pred = work_list.pop ();
kono
parents: 67
diff changeset
2221 normalize_one_pred_1 (0, &norm_chain, a_pred, BIT_AND_EXPR, &work_list,
kono
parents: 67
diff changeset
2222 &mark_set);
kono
parents: 67
diff changeset
2223 }
kono
parents: 67
diff changeset
2224
kono
parents: 67
diff changeset
2225 norm_preds->safe_push (norm_chain);
kono
parents: 67
diff changeset
2226 work_list.release ();
kono
parents: 67
diff changeset
2227 }
kono
parents: 67
diff changeset
2228
kono
parents: 67
diff changeset
2229 /* Normalize predicate chains PREDS and returns the normalized one. */
kono
parents: 67
diff changeset
2230
kono
parents: 67
diff changeset
2231 static pred_chain_union
kono
parents: 67
diff changeset
2232 normalize_preds (pred_chain_union preds, gimple *use_or_def, bool is_use)
kono
parents: 67
diff changeset
2233 {
kono
parents: 67
diff changeset
2234 pred_chain_union norm_preds = vNULL;
kono
parents: 67
diff changeset
2235 size_t n = preds.length ();
kono
parents: 67
diff changeset
2236 size_t i;
kono
parents: 67
diff changeset
2237
kono
parents: 67
diff changeset
2238 if (dump_file && dump_flags & TDF_DETAILS)
kono
parents: 67
diff changeset
2239 {
kono
parents: 67
diff changeset
2240 fprintf (dump_file, "[BEFORE NORMALIZATION --");
kono
parents: 67
diff changeset
2241 dump_predicates (use_or_def, preds, is_use ? "[USE]:\n" : "[DEF]:\n");
kono
parents: 67
diff changeset
2242 }
kono
parents: 67
diff changeset
2243
kono
parents: 67
diff changeset
2244 for (i = 0; i < n; i++)
kono
parents: 67
diff changeset
2245 {
kono
parents: 67
diff changeset
2246 if (preds[i].length () != 1)
kono
parents: 67
diff changeset
2247 normalize_one_pred_chain (&norm_preds, preds[i]);
kono
parents: 67
diff changeset
2248 else
kono
parents: 67
diff changeset
2249 {
kono
parents: 67
diff changeset
2250 normalize_one_pred (&norm_preds, preds[i][0]);
kono
parents: 67
diff changeset
2251 preds[i].release ();
kono
parents: 67
diff changeset
2252 }
kono
parents: 67
diff changeset
2253 }
kono
parents: 67
diff changeset
2254
kono
parents: 67
diff changeset
2255 if (dump_file)
kono
parents: 67
diff changeset
2256 {
kono
parents: 67
diff changeset
2257 fprintf (dump_file, "[AFTER NORMALIZATION -- ");
kono
parents: 67
diff changeset
2258 dump_predicates (use_or_def, norm_preds,
kono
parents: 67
diff changeset
2259 is_use ? "[USE]:\n" : "[DEF]:\n");
kono
parents: 67
diff changeset
2260 }
kono
parents: 67
diff changeset
2261
kono
parents: 67
diff changeset
2262 destroy_predicate_vecs (&preds);
kono
parents: 67
diff changeset
2263 return norm_preds;
kono
parents: 67
diff changeset
2264 }
kono
parents: 67
diff changeset
2265
kono
parents: 67
diff changeset
2266 /* Return TRUE if PREDICATE can be invalidated by any individual
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2267 predicate in USE_GUARD. */
111
kono
parents: 67
diff changeset
2268
kono
parents: 67
diff changeset
2269 static bool
kono
parents: 67
diff changeset
2270 can_one_predicate_be_invalidated_p (pred_info predicate,
kono
parents: 67
diff changeset
2271 pred_chain use_guard)
kono
parents: 67
diff changeset
2272 {
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2273 if (dump_file && dump_flags & TDF_DETAILS)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2274 {
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2275 fprintf (dump_file, "Testing if this predicate: ");
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2276 dump_pred_info (predicate);
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2277 fprintf (dump_file, "\n...can be invalidated by a USE guard of: ");
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2278 dump_pred_chain (use_guard);
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2279 }
111
kono
parents: 67
diff changeset
2280 for (size_t i = 0; i < use_guard.length (); ++i)
kono
parents: 67
diff changeset
2281 {
kono
parents: 67
diff changeset
2282 /* NOTE: This is a very simple check, and only understands an
kono
parents: 67
diff changeset
2283 exact opposite. So, [i == 0] is currently only invalidated
kono
parents: 67
diff changeset
2284 by [.NOT. i == 0] or [i != 0]. Ideally we should also
kono
parents: 67
diff changeset
2285 invalidate with say [i > 5] or [i == 8]. There is certainly
kono
parents: 67
diff changeset
2286 room for improvement here. */
kono
parents: 67
diff changeset
2287 if (pred_neg_p (predicate, use_guard[i]))
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2288 {
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2289 if (dump_file && dump_flags & TDF_DETAILS)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2290 {
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2291 fprintf (dump_file, " Predicate was invalidated by: ");
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2292 dump_pred_info (use_guard[i]);
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2293 fputc ('\n', dump_file);
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2294 }
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2295 return true;
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2296 }
111
kono
parents: 67
diff changeset
2297 }
kono
parents: 67
diff changeset
2298 return false;
kono
parents: 67
diff changeset
2299 }
kono
parents: 67
diff changeset
2300
kono
parents: 67
diff changeset
2301 /* Return TRUE if all predicates in UNINIT_PRED are invalidated by
kono
parents: 67
diff changeset
2302 USE_GUARD being true. */
kono
parents: 67
diff changeset
2303
kono
parents: 67
diff changeset
2304 static bool
kono
parents: 67
diff changeset
2305 can_chain_union_be_invalidated_p (pred_chain_union uninit_pred,
kono
parents: 67
diff changeset
2306 pred_chain use_guard)
kono
parents: 67
diff changeset
2307 {
kono
parents: 67
diff changeset
2308 if (uninit_pred.is_empty ())
kono
parents: 67
diff changeset
2309 return false;
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2310 if (dump_file && dump_flags & TDF_DETAILS)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2311 dump_predicates (NULL, uninit_pred,
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2312 "Testing if anything here can be invalidated: ");
111
kono
parents: 67
diff changeset
2313 for (size_t i = 0; i < uninit_pred.length (); ++i)
kono
parents: 67
diff changeset
2314 {
kono
parents: 67
diff changeset
2315 pred_chain c = uninit_pred[i];
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2316 size_t j;
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2317 for (j = 0; j < c.length (); ++j)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2318 if (can_one_predicate_be_invalidated_p (c[j], use_guard))
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2319 break;
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2320
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2321 /* If we were unable to invalidate any predicate in C, then there
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2322 is a viable path from entry to the PHI where the PHI takes
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2323 an uninitialized value and continues to a use of the PHI. */
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2324 if (j == c.length ())
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2325 return false;
111
kono
parents: 67
diff changeset
2326 }
kono
parents: 67
diff changeset
2327 return true;
kono
parents: 67
diff changeset
2328 }
kono
parents: 67
diff changeset
2329
kono
parents: 67
diff changeset
2330 /* Return TRUE if none of the uninitialized operands in UNINT_OPNDS
kono
parents: 67
diff changeset
2331 can actually happen if we arrived at a use for PHI.
kono
parents: 67
diff changeset
2332
kono
parents: 67
diff changeset
2333 PHI_USE_GUARDS are the guard conditions for the use of the PHI. */
kono
parents: 67
diff changeset
2334
kono
parents: 67
diff changeset
2335 static bool
kono
parents: 67
diff changeset
2336 uninit_uses_cannot_happen (gphi *phi, unsigned uninit_opnds,
kono
parents: 67
diff changeset
2337 pred_chain_union phi_use_guards)
kono
parents: 67
diff changeset
2338 {
kono
parents: 67
diff changeset
2339 unsigned phi_args = gimple_phi_num_args (phi);
kono
parents: 67
diff changeset
2340 if (phi_args > max_phi_args)
kono
parents: 67
diff changeset
2341 return false;
kono
parents: 67
diff changeset
2342
kono
parents: 67
diff changeset
2343 /* PHI_USE_GUARDS are OR'ed together. If we have more than one
kono
parents: 67
diff changeset
2344 possible guard, there's no way of knowing which guard was true.
kono
parents: 67
diff changeset
2345 Since we need to be absolutely sure that the uninitialized
kono
parents: 67
diff changeset
2346 operands will be invalidated, bail. */
kono
parents: 67
diff changeset
2347 if (phi_use_guards.length () != 1)
kono
parents: 67
diff changeset
2348 return false;
kono
parents: 67
diff changeset
2349
kono
parents: 67
diff changeset
2350 /* Look for the control dependencies of all the uninitialized
kono
parents: 67
diff changeset
2351 operands and build guard predicates describing them. */
kono
parents: 67
diff changeset
2352 pred_chain_union uninit_preds;
kono
parents: 67
diff changeset
2353 bool ret = true;
kono
parents: 67
diff changeset
2354 for (unsigned i = 0; i < phi_args; ++i)
kono
parents: 67
diff changeset
2355 {
kono
parents: 67
diff changeset
2356 if (!MASK_TEST_BIT (uninit_opnds, i))
kono
parents: 67
diff changeset
2357 continue;
kono
parents: 67
diff changeset
2358
kono
parents: 67
diff changeset
2359 edge e = gimple_phi_arg_edge (phi, i);
kono
parents: 67
diff changeset
2360 vec<edge> dep_chains[MAX_NUM_CHAINS];
kono
parents: 67
diff changeset
2361 auto_vec<edge, MAX_CHAIN_LEN + 1> cur_chain;
kono
parents: 67
diff changeset
2362 size_t num_chains = 0;
kono
parents: 67
diff changeset
2363 int num_calls = 0;
kono
parents: 67
diff changeset
2364
kono
parents: 67
diff changeset
2365 /* Build the control dependency chain for uninit operand `i'... */
kono
parents: 67
diff changeset
2366 uninit_preds = vNULL;
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2367 if (!compute_control_dep_chain (ENTRY_BLOCK_PTR_FOR_FN (cfun),
111
kono
parents: 67
diff changeset
2368 e->src, dep_chains, &num_chains,
kono
parents: 67
diff changeset
2369 &cur_chain, &num_calls))
kono
parents: 67
diff changeset
2370 {
kono
parents: 67
diff changeset
2371 ret = false;
kono
parents: 67
diff changeset
2372 break;
kono
parents: 67
diff changeset
2373 }
kono
parents: 67
diff changeset
2374 /* ...and convert it into a set of predicates. */
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2375 bool has_valid_preds
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2376 = convert_control_dep_chain_into_preds (dep_chains, num_chains,
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2377 &uninit_preds);
111
kono
parents: 67
diff changeset
2378 for (size_t j = 0; j < num_chains; ++j)
kono
parents: 67
diff changeset
2379 dep_chains[j].release ();
131
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2380 if (!has_valid_preds)
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2381 {
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2382 ret = false;
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2383 break;
84e7813d76e9 gcc-8.2
mir3636
parents: 111
diff changeset
2384 }
111
kono
parents: 67
diff changeset
2385 simplify_preds (&uninit_preds, NULL, false);
kono
parents: 67
diff changeset
2386 uninit_preds = normalize_preds (uninit_preds, NULL, false);
kono
parents: 67
diff changeset
2387
kono
parents: 67
diff changeset
2388 /* Can the guard for this uninitialized operand be invalidated
kono
parents: 67
diff changeset
2389 by the PHI use? */
kono
parents: 67
diff changeset
2390 if (!can_chain_union_be_invalidated_p (uninit_preds, phi_use_guards[0]))
kono
parents: 67
diff changeset
2391 {
kono
parents: 67
diff changeset
2392 ret = false;
kono
parents: 67
diff changeset
2393 break;
kono
parents: 67
diff changeset
2394 }
kono
parents: 67
diff changeset
2395 }
kono
parents: 67
diff changeset
2396 destroy_predicate_vecs (&uninit_preds);
kono
parents: 67
diff changeset
2397 return ret;
kono
parents: 67
diff changeset
2398 }
kono
parents: 67
diff changeset
2399
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2400 /* Computes the predicates that guard the use and checks
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2401 if the incoming paths that have empty (or possibly
111
kono
parents: 67
diff changeset
2402 empty) definition can be pruned/filtered. The function returns
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2403 true if it can be determined that the use of PHI's def in
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2404 USE_STMT is guarded with a predicate set not overlapping with
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2405 predicate sets of all runtime paths that do not have a definition.
111
kono
parents: 67
diff changeset
2406
kono
parents: 67
diff changeset
2407 Returns false if it is not or it can not be determined. USE_BB is
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2408 the bb of the use (for phi operand use, the bb is not the bb of
111
kono
parents: 67
diff changeset
2409 the phi stmt, but the src bb of the operand edge).
kono
parents: 67
diff changeset
2410
kono
parents: 67
diff changeset
2411 UNINIT_OPNDS is a bit vector. If an operand of PHI is uninitialized, the
kono
parents: 67
diff changeset
2412 corresponding bit in the vector is 1. VISITED_PHIS is a pointer
kono
parents: 67
diff changeset
2413 set of phis being visited.
kono
parents: 67
diff changeset
2414
kono
parents: 67
diff changeset
2415 *DEF_PREDS contains the (memoized) defining predicate chains of PHI.
kono
parents: 67
diff changeset
2416 If *DEF_PREDS is the empty vector, the defining predicate chains of
kono
parents: 67
diff changeset
2417 PHI will be computed and stored into *DEF_PREDS as needed.
kono
parents: 67
diff changeset
2418
kono
parents: 67
diff changeset
2419 VISITED_PHIS is a pointer set of phis being visited. */
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2420
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2421 static bool
111
kono
parents: 67
diff changeset
2422 is_use_properly_guarded (gimple *use_stmt,
kono
parents: 67
diff changeset
2423 basic_block use_bb,
kono
parents: 67
diff changeset
2424 gphi *phi,
kono
parents: 67
diff changeset
2425 unsigned uninit_opnds,
kono
parents: 67
diff changeset
2426 pred_chain_union *def_preds,
kono
parents: 67
diff changeset
2427 hash_set<gphi *> *visited_phis)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2428 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2429 basic_block phi_bb;
111
kono
parents: 67
diff changeset
2430 pred_chain_union preds = vNULL;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2431 bool has_valid_preds = false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2432 bool is_properly_guarded = false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2433
111
kono
parents: 67
diff changeset
2434 if (visited_phis->add (phi))
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2435 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2436
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2437 phi_bb = gimple_bb (phi);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2438
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2439 if (is_non_loop_exit_postdominating (use_bb, phi_bb))
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2440 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2441
111
kono
parents: 67
diff changeset
2442 has_valid_preds = find_predicates (&preds, phi_bb, use_bb);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2443
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2444 if (!has_valid_preds)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2445 {
111
kono
parents: 67
diff changeset
2446 destroy_predicate_vecs (&preds);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2447 return false;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2448 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2449
111
kono
parents: 67
diff changeset
2450 /* Try to prune the dead incoming phi edges. */
kono
parents: 67
diff changeset
2451 is_properly_guarded
kono
parents: 67
diff changeset
2452 = use_pred_not_overlap_with_undef_path_pred (preds, phi, uninit_opnds,
kono
parents: 67
diff changeset
2453 visited_phis);
kono
parents: 67
diff changeset
2454
kono
parents: 67
diff changeset
2455 /* We might be able to prove that if the control dependencies
kono
parents: 67
diff changeset
2456 for UNINIT_OPNDS are true, that the control dependencies for
kono
parents: 67
diff changeset
2457 USE_STMT can never be true. */
kono
parents: 67
diff changeset
2458 if (!is_properly_guarded)
kono
parents: 67
diff changeset
2459 is_properly_guarded |= uninit_uses_cannot_happen (phi, uninit_opnds,
kono
parents: 67
diff changeset
2460 preds);
kono
parents: 67
diff changeset
2461
kono
parents: 67
diff changeset
2462 if (is_properly_guarded)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2463 {
111
kono
parents: 67
diff changeset
2464 destroy_predicate_vecs (&preds);
kono
parents: 67
diff changeset
2465 return true;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2466 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2467
111
kono
parents: 67
diff changeset
2468 if (def_preds->is_empty ())
kono
parents: 67
diff changeset
2469 {
kono
parents: 67
diff changeset
2470 has_valid_preds = find_def_preds (def_preds, phi);
kono
parents: 67
diff changeset
2471
kono
parents: 67
diff changeset
2472 if (!has_valid_preds)
kono
parents: 67
diff changeset
2473 {
kono
parents: 67
diff changeset
2474 destroy_predicate_vecs (&preds);
kono
parents: 67
diff changeset
2475 return false;
kono
parents: 67
diff changeset
2476 }
kono
parents: 67
diff changeset
2477
kono
parents: 67
diff changeset
2478 simplify_preds (def_preds, phi, false);
kono
parents: 67
diff changeset
2479 *def_preds = normalize_preds (*def_preds, phi, false);
kono
parents: 67
diff changeset
2480 }
kono
parents: 67
diff changeset
2481
kono
parents: 67
diff changeset
2482 simplify_preds (&preds, use_stmt, true);
kono
parents: 67
diff changeset
2483 preds = normalize_preds (preds, use_stmt, true);
kono
parents: 67
diff changeset
2484
kono
parents: 67
diff changeset
2485 is_properly_guarded = is_superset_of (*def_preds, preds);
kono
parents: 67
diff changeset
2486
kono
parents: 67
diff changeset
2487 destroy_predicate_vecs (&preds);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2488 return is_properly_guarded;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2489 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2490
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2491 /* Searches through all uses of a potentially
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2492 uninitialized variable defined by PHI and returns a use
111
kono
parents: 67
diff changeset
2493 statement if the use is not properly guarded. It returns
kono
parents: 67
diff changeset
2494 NULL if all uses are guarded. UNINIT_OPNDS is a bitvector
kono
parents: 67
diff changeset
2495 holding the position(s) of uninit PHI operands. WORKLIST
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2496 is the vector of candidate phis that may be updated by this
111
kono
parents: 67
diff changeset
2497 function. ADDED_TO_WORKLIST is the pointer set tracking
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2498 if the new phi is already in the worklist. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2499
111
kono
parents: 67
diff changeset
2500 static gimple *
kono
parents: 67
diff changeset
2501 find_uninit_use (gphi *phi, unsigned uninit_opnds,
kono
parents: 67
diff changeset
2502 vec<gphi *> *worklist,
kono
parents: 67
diff changeset
2503 hash_set<gphi *> *added_to_worklist)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2504 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2505 tree phi_result;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2506 use_operand_p use_p;
111
kono
parents: 67
diff changeset
2507 gimple *use_stmt;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2508 imm_use_iterator iter;
111
kono
parents: 67
diff changeset
2509 pred_chain_union def_preds = vNULL;
kono
parents: 67
diff changeset
2510 gimple *ret = NULL;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2511
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2512 phi_result = gimple_phi_result (phi);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2513
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2514 FOR_EACH_IMM_USE_FAST (use_p, iter, phi_result)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2515 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2516 basic_block use_bb;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2517
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2518 use_stmt = USE_STMT (use_p);
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2519 if (is_gimple_debug (use_stmt))
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2520 continue;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2521
111
kono
parents: 67
diff changeset
2522 if (gphi *use_phi = dyn_cast<gphi *> (use_stmt))
kono
parents: 67
diff changeset
2523 use_bb = gimple_phi_arg_edge (use_phi,
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2524 PHI_ARG_INDEX_FROM_USE (use_p))->src;
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2525 else
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2526 use_bb = gimple_bb (use_stmt);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2527
111
kono
parents: 67
diff changeset
2528 hash_set<gphi *> visited_phis;
kono
parents: 67
diff changeset
2529 if (is_use_properly_guarded (use_stmt, use_bb, phi, uninit_opnds,
kono
parents: 67
diff changeset
2530 &def_preds, &visited_phis))
kono
parents: 67
diff changeset
2531 continue;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2532
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2533 if (dump_file && (dump_flags & TDF_DETAILS))
111
kono
parents: 67
diff changeset
2534 {
kono
parents: 67
diff changeset
2535 fprintf (dump_file, "[CHECK]: Found unguarded use: ");
kono
parents: 67
diff changeset
2536 print_gimple_stmt (dump_file, use_stmt, 0);
kono
parents: 67
diff changeset
2537 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2538 /* Found one real use, return. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2539 if (gimple_code (use_stmt) != GIMPLE_PHI)
111
kono
parents: 67
diff changeset
2540 {
kono
parents: 67
diff changeset
2541 ret = use_stmt;
kono
parents: 67
diff changeset
2542 break;
kono
parents: 67
diff changeset
2543 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2544
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2545 /* Found a phi use that is not guarded,
111
kono
parents: 67
diff changeset
2546 add the phi to the worklist. */
kono
parents: 67
diff changeset
2547 if (!added_to_worklist->add (as_a<gphi *> (use_stmt)))
kono
parents: 67
diff changeset
2548 {
kono
parents: 67
diff changeset
2549 if (dump_file && (dump_flags & TDF_DETAILS))
kono
parents: 67
diff changeset
2550 {
kono
parents: 67
diff changeset
2551 fprintf (dump_file, "[WORKLIST]: Update worklist with phi: ");
kono
parents: 67
diff changeset
2552 print_gimple_stmt (dump_file, use_stmt, 0);
kono
parents: 67
diff changeset
2553 }
kono
parents: 67
diff changeset
2554
kono
parents: 67
diff changeset
2555 worklist->safe_push (as_a<gphi *> (use_stmt));
kono
parents: 67
diff changeset
2556 possibly_undefined_names->add (phi_result);
kono
parents: 67
diff changeset
2557 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2558 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2559
111
kono
parents: 67
diff changeset
2560 destroy_predicate_vecs (&def_preds);
kono
parents: 67
diff changeset
2561 return ret;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2562 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2563
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2564 /* Look for inputs to PHI that are SSA_NAMEs that have empty definitions
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2565 and gives warning if there exists a runtime path from the entry to a
111
kono
parents: 67
diff changeset
2566 use of the PHI def that does not contain a definition. In other words,
kono
parents: 67
diff changeset
2567 the warning is on the real use. The more dead paths that can be pruned
kono
parents: 67
diff changeset
2568 by the compiler, the fewer false positives the warning is. WORKLIST
kono
parents: 67
diff changeset
2569 is a vector of candidate phis to be examined. ADDED_TO_WORKLIST is
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2570 a pointer set tracking if the new phi is added to the worklist or not. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2571
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2572 static void
111
kono
parents: 67
diff changeset
2573 warn_uninitialized_phi (gphi *phi, vec<gphi *> *worklist,
kono
parents: 67
diff changeset
2574 hash_set<gphi *> *added_to_worklist)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2575 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2576 unsigned uninit_opnds;
111
kono
parents: 67
diff changeset
2577 gimple *uninit_use_stmt = 0;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2578 tree uninit_op;
111
kono
parents: 67
diff changeset
2579 int phiarg_index;
kono
parents: 67
diff changeset
2580 location_t loc;
kono
parents: 67
diff changeset
2581
kono
parents: 67
diff changeset
2582 /* Don't look at virtual operands. */
kono
parents: 67
diff changeset
2583 if (virtual_operand_p (gimple_phi_result (phi)))
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2584 return;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2585
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2586 uninit_opnds = compute_uninit_opnds_pos (phi);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2587
111
kono
parents: 67
diff changeset
2588 if (MASK_EMPTY (uninit_opnds))
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2589 return;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2590
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2591 if (dump_file && (dump_flags & TDF_DETAILS))
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2592 {
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2593 fprintf (dump_file, "[CHECK]: examining phi: ");
111
kono
parents: 67
diff changeset
2594 print_gimple_stmt (dump_file, phi, 0);
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2595 }
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2596
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2597 /* Now check if we have any use of the value without proper guard. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2598 uninit_use_stmt = find_uninit_use (phi, uninit_opnds,
111
kono
parents: 67
diff changeset
2599 worklist, added_to_worklist);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2600
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2601 /* All uses are properly guarded. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2602 if (!uninit_use_stmt)
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2603 return;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2604
111
kono
parents: 67
diff changeset
2605 phiarg_index = MASK_FIRST_SET_BIT (uninit_opnds);
kono
parents: 67
diff changeset
2606 uninit_op = gimple_phi_arg_def (phi, phiarg_index);
kono
parents: 67
diff changeset
2607 if (SSA_NAME_VAR (uninit_op) == NULL_TREE)
kono
parents: 67
diff changeset
2608 return;
kono
parents: 67
diff changeset
2609 if (gimple_phi_arg_has_location (phi, phiarg_index))
kono
parents: 67
diff changeset
2610 loc = gimple_phi_arg_location (phi, phiarg_index);
kono
parents: 67
diff changeset
2611 else
kono
parents: 67
diff changeset
2612 loc = UNKNOWN_LOCATION;
kono
parents: 67
diff changeset
2613 warn_uninit (OPT_Wmaybe_uninitialized, uninit_op, SSA_NAME_VAR (uninit_op),
kono
parents: 67
diff changeset
2614 SSA_NAME_VAR (uninit_op),
kono
parents: 67
diff changeset
2615 "%qD may be used uninitialized in this function",
kono
parents: 67
diff changeset
2616 uninit_use_stmt, loc);
kono
parents: 67
diff changeset
2617 }
kono
parents: 67
diff changeset
2618
kono
parents: 67
diff changeset
2619 static bool
kono
parents: 67
diff changeset
2620 gate_warn_uninitialized (void)
kono
parents: 67
diff changeset
2621 {
kono
parents: 67
diff changeset
2622 return warn_uninitialized || warn_maybe_uninitialized;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2623 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2624
111
kono
parents: 67
diff changeset
2625 namespace {
kono
parents: 67
diff changeset
2626
kono
parents: 67
diff changeset
2627 const pass_data pass_data_late_warn_uninitialized =
kono
parents: 67
diff changeset
2628 {
kono
parents: 67
diff changeset
2629 GIMPLE_PASS, /* type */
kono
parents: 67
diff changeset
2630 "uninit", /* name */
kono
parents: 67
diff changeset
2631 OPTGROUP_NONE, /* optinfo_flags */
kono
parents: 67
diff changeset
2632 TV_NONE, /* tv_id */
kono
parents: 67
diff changeset
2633 PROP_ssa, /* properties_required */
kono
parents: 67
diff changeset
2634 0, /* properties_provided */
kono
parents: 67
diff changeset
2635 0, /* properties_destroyed */
kono
parents: 67
diff changeset
2636 0, /* todo_flags_start */
kono
parents: 67
diff changeset
2637 0, /* todo_flags_finish */
kono
parents: 67
diff changeset
2638 };
kono
parents: 67
diff changeset
2639
kono
parents: 67
diff changeset
2640 class pass_late_warn_uninitialized : public gimple_opt_pass
kono
parents: 67
diff changeset
2641 {
kono
parents: 67
diff changeset
2642 public:
kono
parents: 67
diff changeset
2643 pass_late_warn_uninitialized (gcc::context *ctxt)
kono
parents: 67
diff changeset
2644 : gimple_opt_pass (pass_data_late_warn_uninitialized, ctxt)
kono
parents: 67
diff changeset
2645 {}
kono
parents: 67
diff changeset
2646
kono
parents: 67
diff changeset
2647 /* opt_pass methods: */
kono
parents: 67
diff changeset
2648 opt_pass *clone () { return new pass_late_warn_uninitialized (m_ctxt); }
kono
parents: 67
diff changeset
2649 virtual bool gate (function *) { return gate_warn_uninitialized (); }
kono
parents: 67
diff changeset
2650 virtual unsigned int execute (function *);
kono
parents: 67
diff changeset
2651
kono
parents: 67
diff changeset
2652 }; // class pass_late_warn_uninitialized
kono
parents: 67
diff changeset
2653
kono
parents: 67
diff changeset
2654 unsigned int
kono
parents: 67
diff changeset
2655 pass_late_warn_uninitialized::execute (function *fun)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2656 {
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2657 basic_block bb;
111
kono
parents: 67
diff changeset
2658 gphi_iterator gsi;
kono
parents: 67
diff changeset
2659 vec<gphi *> worklist = vNULL;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2660
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2661 calculate_dominance_info (CDI_DOMINATORS);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2662 calculate_dominance_info (CDI_POST_DOMINATORS);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2663 /* Re-do the plain uninitialized variable check, as optimization may have
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2664 straightened control flow. Do this first so that we don't accidentally
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2665 get a "may be" warning when we'd have seen an "is" warning later. */
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2666 warn_uninitialized_vars (/*warn_possibly_uninitialized=*/1);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2667
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2668 timevar_push (TV_TREE_UNINIT);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2669
111
kono
parents: 67
diff changeset
2670 possibly_undefined_names = new hash_set<tree>;
kono
parents: 67
diff changeset
2671 hash_set<gphi *> added_to_worklist;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2672
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2673 /* Initialize worklist */
111
kono
parents: 67
diff changeset
2674 FOR_EACH_BB_FN (bb, fun)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2675 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2676 {
111
kono
parents: 67
diff changeset
2677 gphi *phi = gsi.phi ();
kono
parents: 67
diff changeset
2678 size_t n, i;
kono
parents: 67
diff changeset
2679
kono
parents: 67
diff changeset
2680 n = gimple_phi_num_args (phi);
kono
parents: 67
diff changeset
2681
kono
parents: 67
diff changeset
2682 /* Don't look at virtual operands. */
kono
parents: 67
diff changeset
2683 if (virtual_operand_p (gimple_phi_result (phi)))
kono
parents: 67
diff changeset
2684 continue;
kono
parents: 67
diff changeset
2685
kono
parents: 67
diff changeset
2686 for (i = 0; i < n; ++i)
kono
parents: 67
diff changeset
2687 {
kono
parents: 67
diff changeset
2688 tree op = gimple_phi_arg_def (phi, i);
kono
parents: 67
diff changeset
2689 if (TREE_CODE (op) == SSA_NAME && uninit_undefined_value_p (op))
kono
parents: 67
diff changeset
2690 {
kono
parents: 67
diff changeset
2691 worklist.safe_push (phi);
kono
parents: 67
diff changeset
2692 added_to_worklist.add (phi);
kono
parents: 67
diff changeset
2693 if (dump_file && (dump_flags & TDF_DETAILS))
kono
parents: 67
diff changeset
2694 {
kono
parents: 67
diff changeset
2695 fprintf (dump_file, "[WORKLIST]: add to initial list: ");
kono
parents: 67
diff changeset
2696 print_gimple_stmt (dump_file, phi, 0);
kono
parents: 67
diff changeset
2697 }
kono
parents: 67
diff changeset
2698 break;
kono
parents: 67
diff changeset
2699 }
kono
parents: 67
diff changeset
2700 }
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2701 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2702
111
kono
parents: 67
diff changeset
2703 while (worklist.length () != 0)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2704 {
111
kono
parents: 67
diff changeset
2705 gphi *cur_phi = 0;
kono
parents: 67
diff changeset
2706 cur_phi = worklist.pop ();
kono
parents: 67
diff changeset
2707 warn_uninitialized_phi (cur_phi, &worklist, &added_to_worklist);
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2708 }
67
f6334be47118 update gcc from gcc-4.6-20100522 to gcc-4.6-20110318
nobuyasu <dimolto@cr.ie.u-ryukyu.ac.jp>
parents: 63
diff changeset
2709
111
kono
parents: 67
diff changeset
2710 worklist.release ();
kono
parents: 67
diff changeset
2711 delete possibly_undefined_names;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2712 possibly_undefined_names = NULL;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2713 free_dominance_info (CDI_POST_DOMINATORS);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2714 timevar_pop (TV_TREE_UNINIT);
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2715 return 0;
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2716 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2717
111
kono
parents: 67
diff changeset
2718 } // anon namespace
kono
parents: 67
diff changeset
2719
kono
parents: 67
diff changeset
2720 gimple_opt_pass *
kono
parents: 67
diff changeset
2721 make_pass_late_warn_uninitialized (gcc::context *ctxt)
kono
parents: 67
diff changeset
2722 {
kono
parents: 67
diff changeset
2723 return new pass_late_warn_uninitialized (ctxt);
kono
parents: 67
diff changeset
2724 }
kono
parents: 67
diff changeset
2725
kono
parents: 67
diff changeset
2726 static unsigned int
kono
parents: 67
diff changeset
2727 execute_early_warn_uninitialized (void)
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2728 {
111
kono
parents: 67
diff changeset
2729 /* Currently, this pass runs always but
kono
parents: 67
diff changeset
2730 execute_late_warn_uninitialized only runs with optimization. With
kono
parents: 67
diff changeset
2731 optimization we want to warn about possible uninitialized as late
kono
parents: 67
diff changeset
2732 as possible, thus don't do it here. However, without
kono
parents: 67
diff changeset
2733 optimization we need to warn here about "may be uninitialized". */
kono
parents: 67
diff changeset
2734 calculate_dominance_info (CDI_POST_DOMINATORS);
kono
parents: 67
diff changeset
2735
kono
parents: 67
diff changeset
2736 warn_uninitialized_vars (/*warn_possibly_uninitialized=*/!optimize);
kono
parents: 67
diff changeset
2737
kono
parents: 67
diff changeset
2738 /* Post-dominator information can not be reliably updated. Free it
kono
parents: 67
diff changeset
2739 after the use. */
kono
parents: 67
diff changeset
2740
kono
parents: 67
diff changeset
2741 free_dominance_info (CDI_POST_DOMINATORS);
kono
parents: 67
diff changeset
2742 return 0;
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2743 }
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2744
111
kono
parents: 67
diff changeset
2745 namespace {
kono
parents: 67
diff changeset
2746
kono
parents: 67
diff changeset
2747 const pass_data pass_data_early_warn_uninitialized =
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2748 {
111
kono
parents: 67
diff changeset
2749 GIMPLE_PASS, /* type */
kono
parents: 67
diff changeset
2750 "*early_warn_uninitialized", /* name */
kono
parents: 67
diff changeset
2751 OPTGROUP_NONE, /* optinfo_flags */
kono
parents: 67
diff changeset
2752 TV_TREE_UNINIT, /* tv_id */
kono
parents: 67
diff changeset
2753 PROP_ssa, /* properties_required */
kono
parents: 67
diff changeset
2754 0, /* properties_provided */
kono
parents: 67
diff changeset
2755 0, /* properties_destroyed */
kono
parents: 67
diff changeset
2756 0, /* todo_flags_start */
kono
parents: 67
diff changeset
2757 0, /* todo_flags_finish */
63
b7f97abdc517 update gcc from gcc-4.5.0 to gcc-4.6
ryoma <e075725@ie.u-ryukyu.ac.jp>
parents:
diff changeset
2758 };
111
kono
parents: 67
diff changeset
2759
kono
parents: 67
diff changeset
2760 class pass_early_warn_uninitialized : public gimple_opt_pass
kono
parents: 67
diff changeset
2761 {
kono
parents: 67
diff changeset
2762 public:
kono
parents: 67
diff changeset
2763 pass_early_warn_uninitialized (gcc::context *ctxt)
kono
parents: 67
diff changeset
2764 : gimple_opt_pass (pass_data_early_warn_uninitialized, ctxt)
kono
parents: 67
diff changeset
2765 {}
kono
parents: 67
diff changeset
2766
kono
parents: 67
diff changeset
2767 /* opt_pass methods: */
kono
parents: 67
diff changeset
2768 virtual bool gate (function *) { return gate_warn_uninitialized (); }
kono
parents: 67
diff changeset
2769 virtual unsigned int execute (function *)
kono
parents: 67
diff changeset
2770 {
kono
parents: 67
diff changeset
2771 return execute_early_warn_uninitialized ();
kono
parents: 67
diff changeset
2772 }
kono
parents: 67
diff changeset
2773
kono
parents: 67
diff changeset
2774 }; // class pass_early_warn_uninitialized
kono
parents: 67
diff changeset
2775
kono
parents: 67
diff changeset
2776 } // anon namespace
kono
parents: 67
diff changeset
2777
kono
parents: 67
diff changeset
2778 gimple_opt_pass *
kono
parents: 67
diff changeset
2779 make_pass_early_warn_uninitialized (gcc::context *ctxt)
kono
parents: 67
diff changeset
2780 {
kono
parents: 67
diff changeset
2781 return new pass_early_warn_uninitialized (ctxt);
kono
parents: 67
diff changeset
2782 }