]>
Commit | Line | Data |
---|---|---|
4c0315d0 | 1 | /* Passes for transactional memory support. |
aad93da1 | 2 | Copyright (C) 2008-2017 Free Software Foundation, Inc. |
99e3199b | 3 | Contributed by Richard Henderson <rth@redhat.com> |
4 | and Aldy Hernandez <aldyh@redhat.com>. | |
4c0315d0 | 5 | |
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify it under | |
9 | the terms of the GNU General Public License as published by the Free | |
10 | Software Foundation; either version 3, or (at your option) any later | |
11 | version. | |
12 | ||
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
19 | along with GCC; see the file COPYING3. If not see | |
20 | <http://www.gnu.org/licenses/>. */ | |
21 | ||
22 | #include "config.h" | |
23 | #include "system.h" | |
24 | #include "coretypes.h" | |
9ef16211 | 25 | #include "backend.h" |
7c29e30e | 26 | #include "target.h" |
27 | #include "rtl.h" | |
b20a8bb4 | 28 | #include "tree.h" |
9ef16211 | 29 | #include "gimple.h" |
7c29e30e | 30 | #include "cfghooks.h" |
31 | #include "tree-pass.h" | |
9ef16211 | 32 | #include "ssa.h" |
7c29e30e | 33 | #include "cgraph.h" |
34 | #include "gimple-pretty-print.h" | |
35 | #include "diagnostic-core.h" | |
b20a8bb4 | 36 | #include "fold-const.h" |
bc61cadb | 37 | #include "tree-eh.h" |
9ed99284 | 38 | #include "calls.h" |
a8783bee | 39 | #include "gimplify.h" |
dcf1a1ec | 40 | #include "gimple-iterator.h" |
e795d6e1 | 41 | #include "gimplify-me.h" |
dcf1a1ec | 42 | #include "gimple-walk.h" |
073c1fd5 | 43 | #include "tree-cfg.h" |
073c1fd5 | 44 | #include "tree-into-ssa.h" |
4c0315d0 | 45 | #include "tree-inline.h" |
4c0315d0 | 46 | #include "demangle.h" |
47 | #include "output.h" | |
48 | #include "trans-mem.h" | |
49 | #include "params.h" | |
4c0315d0 | 50 | #include "langhooks.h" |
79f958cb | 51 | #include "cfgloop.h" |
424a4a92 | 52 | #include "tree-ssa-address.h" |
30a86690 | 53 | #include "stringpool.h" |
54 | #include "attribs.h" | |
4c0315d0 | 55 | |
4c0315d0 | 56 | #define A_RUNINSTRUMENTEDCODE 0x0001 |
57 | #define A_RUNUNINSTRUMENTEDCODE 0x0002 | |
58 | #define A_SAVELIVEVARIABLES 0x0004 | |
59 | #define A_RESTORELIVEVARIABLES 0x0008 | |
60 | #define A_ABORTTRANSACTION 0x0010 | |
61 | ||
62 | #define AR_USERABORT 0x0001 | |
63 | #define AR_USERRETRY 0x0002 | |
64 | #define AR_TMCONFLICT 0x0004 | |
65 | #define AR_EXCEPTIONBLOCKABORT 0x0008 | |
66 | #define AR_OUTERABORT 0x0010 | |
67 | ||
68 | #define MODE_SERIALIRREVOCABLE 0x0000 | |
69 | ||
70 | ||
71 | /* The representation of a transaction changes several times during the | |
72 | lowering process. In the beginning, in the front-end we have the | |
73 | GENERIC tree TRANSACTION_EXPR. For example, | |
74 | ||
75 | __transaction { | |
76 | local++; | |
77 | if (++global == 10) | |
78 | __tm_abort; | |
79 | } | |
80 | ||
81 | During initial gimplification (gimplify.c) the TRANSACTION_EXPR node is | |
82 | trivially replaced with a GIMPLE_TRANSACTION node. | |
83 | ||
84 | During pass_lower_tm, we examine the body of transactions looking | |
85 | for aborts. Transactions that do not contain an abort may be | |
86 | merged into an outer transaction. We also add a TRY-FINALLY node | |
87 | to arrange for the transaction to be committed on any exit. | |
88 | ||
89 | [??? Think about how this arrangement affects throw-with-commit | |
90 | and throw-with-abort operations. In this case we want the TRY to | |
91 | handle gotos, but not to catch any exceptions because the transaction | |
92 | will already be closed.] | |
93 | ||
94 | GIMPLE_TRANSACTION [label=NULL] { | |
95 | try { | |
96 | local = local + 1; | |
97 | t0 = global; | |
98 | t1 = t0 + 1; | |
99 | global = t1; | |
100 | if (t1 == 10) | |
101 | __builtin___tm_abort (); | |
102 | } finally { | |
103 | __builtin___tm_commit (); | |
104 | } | |
105 | } | |
106 | ||
107 | During pass_lower_eh, we create EH regions for the transactions, | |
108 | intermixed with the regular EH stuff. This gives us a nice persistent | |
109 | mapping (all the way through rtl) from transactional memory operation | |
110 | back to the transaction, which allows us to get the abnormal edges | |
111 | correct to model transaction aborts and restarts: | |
112 | ||
113 | GIMPLE_TRANSACTION [label=over] | |
114 | local = local + 1; | |
115 | t0 = global; | |
116 | t1 = t0 + 1; | |
117 | global = t1; | |
118 | if (t1 == 10) | |
119 | __builtin___tm_abort (); | |
120 | __builtin___tm_commit (); | |
121 | over: | |
122 | ||
123 | This is the end of all_lowering_passes, and so is what is present | |
124 | during the IPA passes, and through all of the optimization passes. | |
125 | ||
126 | During pass_ipa_tm, we examine all GIMPLE_TRANSACTION blocks in all | |
127 | functions and mark functions for cloning. | |
128 | ||
129 | At the end of gimple optimization, before exiting SSA form, | |
130 | pass_tm_edges replaces statements that perform transactional | |
131 | memory operations with the appropriate TM builtins, and swap | |
132 | out function calls with their transactional clones. At this | |
133 | point we introduce the abnormal transaction restart edges and | |
134 | complete lowering of the GIMPLE_TRANSACTION node. | |
135 | ||
136 | x = __builtin___tm_start (MAY_ABORT); | |
137 | eh_label: | |
138 | if (x & abort_transaction) | |
139 | goto over; | |
140 | local = local + 1; | |
141 | t0 = __builtin___tm_load (global); | |
142 | t1 = t0 + 1; | |
143 | __builtin___tm_store (&global, t1); | |
144 | if (t1 == 10) | |
145 | __builtin___tm_abort (); | |
146 | __builtin___tm_commit (); | |
147 | over: | |
148 | */ | |
149 | ||
0cd02a19 | 150 | static void *expand_regions (struct tm_region *, |
151 | void *(*callback)(struct tm_region *, void *), | |
00d83cc8 | 152 | void *, bool); |
0cd02a19 | 153 | |
4c0315d0 | 154 | \f |
155 | /* Return the attributes we want to examine for X, or NULL if it's not | |
156 | something we examine. We look at function types, but allow pointers | |
157 | to function types and function decls and peek through. */ | |
158 | ||
159 | static tree | |
160 | get_attrs_for (const_tree x) | |
161 | { | |
547355ae | 162 | if (x == NULL_TREE) |
163 | return NULL_TREE; | |
164 | ||
4c0315d0 | 165 | switch (TREE_CODE (x)) |
166 | { | |
167 | case FUNCTION_DECL: | |
168 | return TYPE_ATTRIBUTES (TREE_TYPE (x)); | |
4c0315d0 | 169 | |
170 | default: | |
171 | if (TYPE_P (x)) | |
547355ae | 172 | return NULL_TREE; |
4c0315d0 | 173 | x = TREE_TYPE (x); |
174 | if (TREE_CODE (x) != POINTER_TYPE) | |
547355ae | 175 | return NULL_TREE; |
4c0315d0 | 176 | /* FALLTHRU */ |
177 | ||
178 | case POINTER_TYPE: | |
179 | x = TREE_TYPE (x); | |
180 | if (TREE_CODE (x) != FUNCTION_TYPE && TREE_CODE (x) != METHOD_TYPE) | |
547355ae | 181 | return NULL_TREE; |
4c0315d0 | 182 | /* FALLTHRU */ |
183 | ||
184 | case FUNCTION_TYPE: | |
185 | case METHOD_TYPE: | |
186 | return TYPE_ATTRIBUTES (x); | |
187 | } | |
188 | } | |
189 | ||
190 | /* Return true if X has been marked TM_PURE. */ | |
191 | ||
192 | bool | |
193 | is_tm_pure (const_tree x) | |
194 | { | |
195 | unsigned flags; | |
196 | ||
197 | switch (TREE_CODE (x)) | |
198 | { | |
199 | case FUNCTION_DECL: | |
200 | case FUNCTION_TYPE: | |
201 | case METHOD_TYPE: | |
202 | break; | |
203 | ||
204 | default: | |
205 | if (TYPE_P (x)) | |
206 | return false; | |
207 | x = TREE_TYPE (x); | |
208 | if (TREE_CODE (x) != POINTER_TYPE) | |
209 | return false; | |
210 | /* FALLTHRU */ | |
211 | ||
212 | case POINTER_TYPE: | |
213 | x = TREE_TYPE (x); | |
214 | if (TREE_CODE (x) != FUNCTION_TYPE && TREE_CODE (x) != METHOD_TYPE) | |
215 | return false; | |
216 | break; | |
217 | } | |
218 | ||
219 | flags = flags_from_decl_or_type (x); | |
220 | return (flags & ECF_TM_PURE) != 0; | |
221 | } | |
222 | ||
223 | /* Return true if X has been marked TM_IRREVOCABLE. */ | |
224 | ||
225 | static bool | |
226 | is_tm_irrevocable (tree x) | |
227 | { | |
228 | tree attrs = get_attrs_for (x); | |
229 | ||
230 | if (attrs && lookup_attribute ("transaction_unsafe", attrs)) | |
231 | return true; | |
232 | ||
233 | /* A call to the irrevocable builtin is by definition, | |
234 | irrevocable. */ | |
235 | if (TREE_CODE (x) == ADDR_EXPR) | |
236 | x = TREE_OPERAND (x, 0); | |
237 | if (TREE_CODE (x) == FUNCTION_DECL | |
238 | && DECL_BUILT_IN_CLASS (x) == BUILT_IN_NORMAL | |
239 | && DECL_FUNCTION_CODE (x) == BUILT_IN_TM_IRREVOCABLE) | |
240 | return true; | |
241 | ||
242 | return false; | |
243 | } | |
244 | ||
245 | /* Return true if X has been marked TM_SAFE. */ | |
246 | ||
247 | bool | |
248 | is_tm_safe (const_tree x) | |
249 | { | |
250 | if (flag_tm) | |
251 | { | |
252 | tree attrs = get_attrs_for (x); | |
253 | if (attrs) | |
254 | { | |
255 | if (lookup_attribute ("transaction_safe", attrs)) | |
256 | return true; | |
257 | if (lookup_attribute ("transaction_may_cancel_outer", attrs)) | |
258 | return true; | |
259 | } | |
260 | } | |
261 | return false; | |
262 | } | |
263 | ||
264 | /* Return true if CALL is const, or tm_pure. */ | |
265 | ||
266 | static bool | |
42acab1c | 267 | is_tm_pure_call (gimple *call) |
4c0315d0 | 268 | { |
ffda2f15 | 269 | if (gimple_call_internal_p (call)) |
270 | return (gimple_call_flags (call) & (ECF_CONST | ECF_TM_PURE)) != 0; | |
271 | ||
4c0315d0 | 272 | tree fn = gimple_call_fn (call); |
273 | ||
274 | if (TREE_CODE (fn) == ADDR_EXPR) | |
275 | { | |
276 | fn = TREE_OPERAND (fn, 0); | |
277 | gcc_assert (TREE_CODE (fn) == FUNCTION_DECL); | |
278 | } | |
279 | else | |
280 | fn = TREE_TYPE (fn); | |
281 | ||
282 | return is_tm_pure (fn); | |
283 | } | |
284 | ||
285 | /* Return true if X has been marked TM_CALLABLE. */ | |
286 | ||
287 | static bool | |
288 | is_tm_callable (tree x) | |
289 | { | |
290 | tree attrs = get_attrs_for (x); | |
291 | if (attrs) | |
292 | { | |
293 | if (lookup_attribute ("transaction_callable", attrs)) | |
294 | return true; | |
295 | if (lookup_attribute ("transaction_safe", attrs)) | |
296 | return true; | |
297 | if (lookup_attribute ("transaction_may_cancel_outer", attrs)) | |
298 | return true; | |
299 | } | |
300 | return false; | |
301 | } | |
302 | ||
303 | /* Return true if X has been marked TRANSACTION_MAY_CANCEL_OUTER. */ | |
304 | ||
305 | bool | |
306 | is_tm_may_cancel_outer (tree x) | |
307 | { | |
308 | tree attrs = get_attrs_for (x); | |
309 | if (attrs) | |
310 | return lookup_attribute ("transaction_may_cancel_outer", attrs) != NULL; | |
311 | return false; | |
312 | } | |
313 | ||
314 | /* Return true for built in functions that "end" a transaction. */ | |
315 | ||
316 | bool | |
317 | is_tm_ending_fndecl (tree fndecl) | |
318 | { | |
319 | if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL) | |
320 | switch (DECL_FUNCTION_CODE (fndecl)) | |
321 | { | |
322 | case BUILT_IN_TM_COMMIT: | |
323 | case BUILT_IN_TM_COMMIT_EH: | |
324 | case BUILT_IN_TM_ABORT: | |
325 | case BUILT_IN_TM_IRREVOCABLE: | |
326 | return true; | |
327 | default: | |
328 | break; | |
329 | } | |
330 | ||
331 | return false; | |
332 | } | |
333 | ||
50a50143 | 334 | /* Return true if STMT is a built in function call that "ends" a |
335 | transaction. */ | |
336 | ||
337 | bool | |
42acab1c | 338 | is_tm_ending (gimple *stmt) |
50a50143 | 339 | { |
340 | tree fndecl; | |
341 | ||
342 | if (gimple_code (stmt) != GIMPLE_CALL) | |
343 | return false; | |
344 | ||
345 | fndecl = gimple_call_fndecl (stmt); | |
346 | return (fndecl != NULL_TREE | |
347 | && is_tm_ending_fndecl (fndecl)); | |
348 | } | |
349 | ||
4c0315d0 | 350 | /* Return true if STMT is a TM load. */ |
351 | ||
352 | static bool | |
42acab1c | 353 | is_tm_load (gimple *stmt) |
4c0315d0 | 354 | { |
355 | tree fndecl; | |
356 | ||
357 | if (gimple_code (stmt) != GIMPLE_CALL) | |
358 | return false; | |
359 | ||
360 | fndecl = gimple_call_fndecl (stmt); | |
361 | return (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL | |
362 | && BUILTIN_TM_LOAD_P (DECL_FUNCTION_CODE (fndecl))); | |
363 | } | |
364 | ||
365 | /* Same as above, but for simple TM loads, that is, not the | |
366 | after-write, after-read, etc optimized variants. */ | |
367 | ||
368 | static bool | |
42acab1c | 369 | is_tm_simple_load (gimple *stmt) |
4c0315d0 | 370 | { |
371 | tree fndecl; | |
372 | ||
373 | if (gimple_code (stmt) != GIMPLE_CALL) | |
374 | return false; | |
375 | ||
376 | fndecl = gimple_call_fndecl (stmt); | |
377 | if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL) | |
378 | { | |
379 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
380 | return (fcode == BUILT_IN_TM_LOAD_1 | |
381 | || fcode == BUILT_IN_TM_LOAD_2 | |
382 | || fcode == BUILT_IN_TM_LOAD_4 | |
383 | || fcode == BUILT_IN_TM_LOAD_8 | |
384 | || fcode == BUILT_IN_TM_LOAD_FLOAT | |
385 | || fcode == BUILT_IN_TM_LOAD_DOUBLE | |
386 | || fcode == BUILT_IN_TM_LOAD_LDOUBLE | |
387 | || fcode == BUILT_IN_TM_LOAD_M64 | |
388 | || fcode == BUILT_IN_TM_LOAD_M128 | |
389 | || fcode == BUILT_IN_TM_LOAD_M256); | |
390 | } | |
391 | return false; | |
392 | } | |
393 | ||
394 | /* Return true if STMT is a TM store. */ | |
395 | ||
396 | static bool | |
42acab1c | 397 | is_tm_store (gimple *stmt) |
4c0315d0 | 398 | { |
399 | tree fndecl; | |
400 | ||
401 | if (gimple_code (stmt) != GIMPLE_CALL) | |
402 | return false; | |
403 | ||
404 | fndecl = gimple_call_fndecl (stmt); | |
405 | return (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL | |
406 | && BUILTIN_TM_STORE_P (DECL_FUNCTION_CODE (fndecl))); | |
407 | } | |
408 | ||
409 | /* Same as above, but for simple TM stores, that is, not the | |
410 | after-write, after-read, etc optimized variants. */ | |
411 | ||
412 | static bool | |
42acab1c | 413 | is_tm_simple_store (gimple *stmt) |
4c0315d0 | 414 | { |
415 | tree fndecl; | |
416 | ||
417 | if (gimple_code (stmt) != GIMPLE_CALL) | |
418 | return false; | |
419 | ||
420 | fndecl = gimple_call_fndecl (stmt); | |
421 | if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL) | |
422 | { | |
423 | enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl); | |
424 | return (fcode == BUILT_IN_TM_STORE_1 | |
425 | || fcode == BUILT_IN_TM_STORE_2 | |
426 | || fcode == BUILT_IN_TM_STORE_4 | |
427 | || fcode == BUILT_IN_TM_STORE_8 | |
428 | || fcode == BUILT_IN_TM_STORE_FLOAT | |
429 | || fcode == BUILT_IN_TM_STORE_DOUBLE | |
430 | || fcode == BUILT_IN_TM_STORE_LDOUBLE | |
431 | || fcode == BUILT_IN_TM_STORE_M64 | |
432 | || fcode == BUILT_IN_TM_STORE_M128 | |
433 | || fcode == BUILT_IN_TM_STORE_M256); | |
434 | } | |
435 | return false; | |
436 | } | |
437 | ||
438 | /* Return true if FNDECL is BUILT_IN_TM_ABORT. */ | |
439 | ||
440 | static bool | |
441 | is_tm_abort (tree fndecl) | |
442 | { | |
443 | return (fndecl | |
444 | && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL | |
445 | && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_TM_ABORT); | |
446 | } | |
447 | ||
448 | /* Build a GENERIC tree for a user abort. This is called by front ends | |
449 | while transforming the __tm_abort statement. */ | |
450 | ||
451 | tree | |
452 | build_tm_abort_call (location_t loc, bool is_outer) | |
453 | { | |
454 | return build_call_expr_loc (loc, builtin_decl_explicit (BUILT_IN_TM_ABORT), 1, | |
455 | build_int_cst (integer_type_node, | |
456 | AR_USERABORT | |
457 | | (is_outer ? AR_OUTERABORT : 0))); | |
458 | } | |
4c0315d0 | 459 | \f |
2fbe7a32 | 460 | /* Map for arbitrary function replacement under TM, as created |
4c0315d0 | 461 | by the tm_wrap attribute. */ |
462 | ||
eae1ecb4 | 463 | struct tm_wrapper_hasher : ggc_cache_ptr_hash<tree_map> |
d1023d12 | 464 | { |
465 | static inline hashval_t hash (tree_map *m) { return m->hash; } | |
466 | static inline bool | |
467 | equal (tree_map *a, tree_map *b) | |
468 | { | |
469 | return a->base.from == b->base.from; | |
470 | } | |
471 | ||
99378011 | 472 | static int |
473 | keep_cache_entry (tree_map *&m) | |
474 | { | |
475 | return ggc_marked_p (m->base.from); | |
476 | } | |
d1023d12 | 477 | }; |
478 | ||
479 | static GTY((cache)) hash_table<tm_wrapper_hasher> *tm_wrap_map; | |
4c0315d0 | 480 | |
481 | void | |
482 | record_tm_replacement (tree from, tree to) | |
483 | { | |
484 | struct tree_map **slot, *h; | |
485 | ||
486 | /* Do not inline wrapper functions that will get replaced in the TM | |
487 | pass. | |
488 | ||
489 | Suppose you have foo() that will get replaced into tmfoo(). Make | |
490 | sure the inliner doesn't try to outsmart us and inline foo() | |
491 | before we get a chance to do the TM replacement. */ | |
492 | DECL_UNINLINABLE (from) = 1; | |
493 | ||
494 | if (tm_wrap_map == NULL) | |
d1023d12 | 495 | tm_wrap_map = hash_table<tm_wrapper_hasher>::create_ggc (32); |
4c0315d0 | 496 | |
25a27413 | 497 | h = ggc_alloc<tree_map> (); |
4c0315d0 | 498 | h->hash = htab_hash_pointer (from); |
499 | h->base.from = from; | |
500 | h->to = to; | |
501 | ||
d1023d12 | 502 | slot = tm_wrap_map->find_slot_with_hash (h, h->hash, INSERT); |
4c0315d0 | 503 | *slot = h; |
504 | } | |
505 | ||
506 | /* Return a TM-aware replacement function for DECL. */ | |
507 | ||
508 | static tree | |
509 | find_tm_replacement_function (tree fndecl) | |
510 | { | |
511 | if (tm_wrap_map) | |
512 | { | |
513 | struct tree_map *h, in; | |
514 | ||
515 | in.base.from = fndecl; | |
516 | in.hash = htab_hash_pointer (fndecl); | |
d1023d12 | 517 | h = tm_wrap_map->find_with_hash (&in, in.hash); |
4c0315d0 | 518 | if (h) |
519 | return h->to; | |
520 | } | |
521 | ||
522 | /* ??? We may well want TM versions of most of the common <string.h> | |
523 | functions. For now, we've already these two defined. */ | |
524 | /* Adjust expand_call_tm() attributes as necessary for the cases | |
525 | handled here: */ | |
526 | if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL) | |
527 | switch (DECL_FUNCTION_CODE (fndecl)) | |
528 | { | |
529 | case BUILT_IN_MEMCPY: | |
530 | return builtin_decl_explicit (BUILT_IN_TM_MEMCPY); | |
531 | case BUILT_IN_MEMMOVE: | |
532 | return builtin_decl_explicit (BUILT_IN_TM_MEMMOVE); | |
533 | case BUILT_IN_MEMSET: | |
534 | return builtin_decl_explicit (BUILT_IN_TM_MEMSET); | |
535 | default: | |
536 | return NULL; | |
537 | } | |
538 | ||
539 | return NULL; | |
540 | } | |
541 | ||
542 | /* When appropriate, record TM replacement for memory allocation functions. | |
543 | ||
544 | FROM is the FNDECL to wrap. */ | |
545 | void | |
546 | tm_malloc_replacement (tree from) | |
547 | { | |
548 | const char *str; | |
549 | tree to; | |
550 | ||
551 | if (TREE_CODE (from) != FUNCTION_DECL) | |
552 | return; | |
553 | ||
554 | /* If we have a previous replacement, the user must be explicitly | |
555 | wrapping malloc/calloc/free. They better know what they're | |
556 | doing... */ | |
557 | if (find_tm_replacement_function (from)) | |
558 | return; | |
559 | ||
560 | str = IDENTIFIER_POINTER (DECL_NAME (from)); | |
561 | ||
562 | if (!strcmp (str, "malloc")) | |
563 | to = builtin_decl_explicit (BUILT_IN_TM_MALLOC); | |
564 | else if (!strcmp (str, "calloc")) | |
565 | to = builtin_decl_explicit (BUILT_IN_TM_CALLOC); | |
566 | else if (!strcmp (str, "free")) | |
567 | to = builtin_decl_explicit (BUILT_IN_TM_FREE); | |
568 | else | |
569 | return; | |
570 | ||
571 | TREE_NOTHROW (to) = 0; | |
572 | ||
573 | record_tm_replacement (from, to); | |
574 | } | |
575 | \f | |
576 | /* Diagnostics for tm_safe functions/regions. Called by the front end | |
577 | once we've lowered the function to high-gimple. */ | |
578 | ||
579 | /* Subroutine of diagnose_tm_safe_errors, called through walk_gimple_seq. | |
580 | Process exactly one statement. WI->INFO is set to non-null when in | |
581 | the context of a tm_safe function, and null for a __transaction block. */ | |
582 | ||
583 | #define DIAG_TM_OUTER 1 | |
584 | #define DIAG_TM_SAFE 2 | |
585 | #define DIAG_TM_RELAXED 4 | |
586 | ||
587 | struct diagnose_tm | |
588 | { | |
589 | unsigned int summary_flags : 8; | |
590 | unsigned int block_flags : 8; | |
591 | unsigned int func_flags : 8; | |
4c0315d0 | 592 | unsigned int saw_volatile : 1; |
42acab1c | 593 | gimple *stmt; |
4c0315d0 | 594 | }; |
595 | ||
639b72bd | 596 | /* Return true if T is a volatile lvalue of some kind. */ |
e153bd50 | 597 | |
598 | static bool | |
639b72bd | 599 | volatile_lvalue_p (tree t) |
e153bd50 | 600 | { |
639b72bd | 601 | return ((SSA_VAR_P (t) || REFERENCE_CLASS_P (t)) |
e153bd50 | 602 | && TREE_THIS_VOLATILE (TREE_TYPE (t))); |
603 | } | |
604 | ||
4c0315d0 | 605 | /* Tree callback function for diagnose_tm pass. */ |
606 | ||
607 | static tree | |
639b72bd | 608 | diagnose_tm_1_op (tree *tp, int *walk_subtrees, void *data) |
4c0315d0 | 609 | { |
610 | struct walk_stmt_info *wi = (struct walk_stmt_info *) data; | |
611 | struct diagnose_tm *d = (struct diagnose_tm *) wi->info; | |
4c0315d0 | 612 | |
639b72bd | 613 | if (TYPE_P (*tp)) |
614 | *walk_subtrees = false; | |
615 | else if (volatile_lvalue_p (*tp) | |
616 | && !d->saw_volatile) | |
4c0315d0 | 617 | { |
618 | d->saw_volatile = 1; | |
639b72bd | 619 | if (d->block_flags & DIAG_TM_SAFE) |
620 | error_at (gimple_location (d->stmt), | |
621 | "invalid use of volatile lvalue inside transaction"); | |
622 | else if (d->func_flags & DIAG_TM_SAFE) | |
623 | error_at (gimple_location (d->stmt), | |
19efce70 | 624 | "invalid use of volatile lvalue inside %<transaction_safe%> " |
639b72bd | 625 | "function"); |
4c0315d0 | 626 | } |
627 | ||
628 | return NULL_TREE; | |
629 | } | |
630 | ||
0e80b01d | 631 | static inline bool |
632 | is_tm_safe_or_pure (const_tree x) | |
633 | { | |
634 | return is_tm_safe (x) || is_tm_pure (x); | |
635 | } | |
636 | ||
4c0315d0 | 637 | static tree |
638 | diagnose_tm_1 (gimple_stmt_iterator *gsi, bool *handled_ops_p, | |
639 | struct walk_stmt_info *wi) | |
640 | { | |
42acab1c | 641 | gimple *stmt = gsi_stmt (*gsi); |
4c0315d0 | 642 | struct diagnose_tm *d = (struct diagnose_tm *) wi->info; |
643 | ||
644 | /* Save stmt for use in leaf analysis. */ | |
645 | d->stmt = stmt; | |
646 | ||
647 | switch (gimple_code (stmt)) | |
648 | { | |
649 | case GIMPLE_CALL: | |
650 | { | |
651 | tree fn = gimple_call_fn (stmt); | |
652 | ||
653 | if ((d->summary_flags & DIAG_TM_OUTER) == 0 | |
654 | && is_tm_may_cancel_outer (fn)) | |
655 | error_at (gimple_location (stmt), | |
656 | "%<transaction_may_cancel_outer%> function call not within" | |
657 | " outer transaction or %<transaction_may_cancel_outer%>"); | |
658 | ||
659 | if (d->summary_flags & DIAG_TM_SAFE) | |
660 | { | |
661 | bool is_safe, direct_call_p; | |
662 | tree replacement; | |
663 | ||
664 | if (TREE_CODE (fn) == ADDR_EXPR | |
665 | && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL) | |
666 | { | |
667 | direct_call_p = true; | |
668 | replacement = TREE_OPERAND (fn, 0); | |
669 | replacement = find_tm_replacement_function (replacement); | |
670 | if (replacement) | |
671 | fn = replacement; | |
672 | } | |
673 | else | |
674 | { | |
675 | direct_call_p = false; | |
676 | replacement = NULL_TREE; | |
677 | } | |
678 | ||
679 | if (is_tm_safe_or_pure (fn)) | |
680 | is_safe = true; | |
681 | else if (is_tm_callable (fn) || is_tm_irrevocable (fn)) | |
682 | { | |
683 | /* A function explicitly marked transaction_callable as | |
684 | opposed to transaction_safe is being defined to be | |
685 | unsafe as part of its ABI, regardless of its contents. */ | |
686 | is_safe = false; | |
687 | } | |
688 | else if (direct_call_p) | |
689 | { | |
c579aed5 | 690 | if (IS_TYPE_OR_DECL_P (fn) |
691 | && flags_from_decl_or_type (fn) & ECF_TM_BUILTIN) | |
4c0315d0 | 692 | is_safe = true; |
693 | else if (replacement) | |
694 | { | |
695 | /* ??? At present we've been considering replacements | |
696 | merely transaction_callable, and therefore might | |
697 | enter irrevocable. The tm_wrap attribute has not | |
698 | yet made it into the new language spec. */ | |
699 | is_safe = false; | |
700 | } | |
701 | else | |
702 | { | |
703 | /* ??? Diagnostics for unmarked direct calls moved into | |
704 | the IPA pass. Section 3.2 of the spec details how | |
705 | functions not marked should be considered "implicitly | |
706 | safe" based on having examined the function body. */ | |
707 | is_safe = true; | |
708 | } | |
709 | } | |
710 | else | |
711 | { | |
712 | /* An unmarked indirect call. Consider it unsafe even | |
713 | though optimization may yet figure out how to inline. */ | |
714 | is_safe = false; | |
715 | } | |
716 | ||
717 | if (!is_safe) | |
718 | { | |
719 | if (TREE_CODE (fn) == ADDR_EXPR) | |
720 | fn = TREE_OPERAND (fn, 0); | |
721 | if (d->block_flags & DIAG_TM_SAFE) | |
2d3bf658 | 722 | { |
723 | if (direct_call_p) | |
724 | error_at (gimple_location (stmt), | |
725 | "unsafe function call %qD within " | |
726 | "atomic transaction", fn); | |
727 | else | |
300eddba | 728 | { |
9ae1b28a | 729 | if ((!DECL_P (fn) || DECL_NAME (fn)) |
730 | && TREE_CODE (fn) != SSA_NAME) | |
300eddba | 731 | error_at (gimple_location (stmt), |
732 | "unsafe function call %qE within " | |
733 | "atomic transaction", fn); | |
734 | else | |
735 | error_at (gimple_location (stmt), | |
736 | "unsafe indirect function call within " | |
737 | "atomic transaction"); | |
738 | } | |
2d3bf658 | 739 | } |
4c0315d0 | 740 | else |
2d3bf658 | 741 | { |
742 | if (direct_call_p) | |
743 | error_at (gimple_location (stmt), | |
744 | "unsafe function call %qD within " | |
745 | "%<transaction_safe%> function", fn); | |
746 | else | |
300eddba | 747 | { |
9ae1b28a | 748 | if ((!DECL_P (fn) || DECL_NAME (fn)) |
749 | && TREE_CODE (fn) != SSA_NAME) | |
300eddba | 750 | error_at (gimple_location (stmt), |
751 | "unsafe function call %qE within " | |
752 | "%<transaction_safe%> function", fn); | |
753 | else | |
754 | error_at (gimple_location (stmt), | |
755 | "unsafe indirect function call within " | |
756 | "%<transaction_safe%> function"); | |
757 | } | |
2d3bf658 | 758 | } |
4c0315d0 | 759 | } |
760 | } | |
761 | } | |
762 | break; | |
763 | ||
764 | case GIMPLE_ASM: | |
765 | /* ??? We ought to come up with a way to add attributes to | |
766 | asm statements, and then add "transaction_safe" to it. | |
767 | Either that or get the language spec to resurrect __tm_waiver. */ | |
768 | if (d->block_flags & DIAG_TM_SAFE) | |
769 | error_at (gimple_location (stmt), | |
770 | "asm not allowed in atomic transaction"); | |
771 | else if (d->func_flags & DIAG_TM_SAFE) | |
772 | error_at (gimple_location (stmt), | |
773 | "asm not allowed in %<transaction_safe%> function"); | |
4c0315d0 | 774 | break; |
775 | ||
776 | case GIMPLE_TRANSACTION: | |
777 | { | |
1a91d914 | 778 | gtransaction *trans_stmt = as_a <gtransaction *> (stmt); |
4c0315d0 | 779 | unsigned char inner_flags = DIAG_TM_SAFE; |
780 | ||
1a91d914 | 781 | if (gimple_transaction_subcode (trans_stmt) & GTMA_IS_RELAXED) |
4c0315d0 | 782 | { |
783 | if (d->block_flags & DIAG_TM_SAFE) | |
784 | error_at (gimple_location (stmt), | |
785 | "relaxed transaction in atomic transaction"); | |
786 | else if (d->func_flags & DIAG_TM_SAFE) | |
787 | error_at (gimple_location (stmt), | |
788 | "relaxed transaction in %<transaction_safe%> function"); | |
4c0315d0 | 789 | inner_flags = DIAG_TM_RELAXED; |
790 | } | |
1a91d914 | 791 | else if (gimple_transaction_subcode (trans_stmt) & GTMA_IS_OUTER) |
4c0315d0 | 792 | { |
793 | if (d->block_flags) | |
794 | error_at (gimple_location (stmt), | |
795 | "outer transaction in transaction"); | |
796 | else if (d->func_flags & DIAG_TM_OUTER) | |
797 | error_at (gimple_location (stmt), | |
798 | "outer transaction in " | |
799 | "%<transaction_may_cancel_outer%> function"); | |
800 | else if (d->func_flags & DIAG_TM_SAFE) | |
801 | error_at (gimple_location (stmt), | |
802 | "outer transaction in %<transaction_safe%> function"); | |
4c0315d0 | 803 | inner_flags |= DIAG_TM_OUTER; |
804 | } | |
805 | ||
806 | *handled_ops_p = true; | |
1a91d914 | 807 | if (gimple_transaction_body (trans_stmt)) |
4c0315d0 | 808 | { |
809 | struct walk_stmt_info wi_inner; | |
810 | struct diagnose_tm d_inner; | |
811 | ||
812 | memset (&d_inner, 0, sizeof (d_inner)); | |
813 | d_inner.func_flags = d->func_flags; | |
814 | d_inner.block_flags = d->block_flags | inner_flags; | |
815 | d_inner.summary_flags = d_inner.func_flags | d_inner.block_flags; | |
816 | ||
817 | memset (&wi_inner, 0, sizeof (wi_inner)); | |
818 | wi_inner.info = &d_inner; | |
819 | ||
1a91d914 | 820 | walk_gimple_seq (gimple_transaction_body (trans_stmt), |
4c0315d0 | 821 | diagnose_tm_1, diagnose_tm_1_op, &wi_inner); |
4c0315d0 | 822 | } |
823 | } | |
824 | break; | |
825 | ||
826 | default: | |
827 | break; | |
828 | } | |
829 | ||
830 | return NULL_TREE; | |
831 | } | |
832 | ||
833 | static unsigned int | |
834 | diagnose_tm_blocks (void) | |
835 | { | |
836 | struct walk_stmt_info wi; | |
837 | struct diagnose_tm d; | |
838 | ||
839 | memset (&d, 0, sizeof (d)); | |
840 | if (is_tm_may_cancel_outer (current_function_decl)) | |
841 | d.func_flags = DIAG_TM_OUTER | DIAG_TM_SAFE; | |
842 | else if (is_tm_safe (current_function_decl)) | |
843 | d.func_flags = DIAG_TM_SAFE; | |
844 | d.summary_flags = d.func_flags; | |
845 | ||
846 | memset (&wi, 0, sizeof (wi)); | |
847 | wi.info = &d; | |
848 | ||
849 | walk_gimple_seq (gimple_body (current_function_decl), | |
850 | diagnose_tm_1, diagnose_tm_1_op, &wi); | |
851 | ||
4c0315d0 | 852 | return 0; |
853 | } | |
854 | ||
7620bc82 | 855 | namespace { |
856 | ||
857 | const pass_data pass_data_diagnose_tm_blocks = | |
cbe8bda8 | 858 | { |
859 | GIMPLE_PASS, /* type */ | |
860 | "*diagnose_tm_blocks", /* name */ | |
861 | OPTGROUP_NONE, /* optinfo_flags */ | |
cbe8bda8 | 862 | TV_TRANS_MEM, /* tv_id */ |
863 | PROP_gimple_any, /* properties_required */ | |
864 | 0, /* properties_provided */ | |
865 | 0, /* properties_destroyed */ | |
866 | 0, /* todo_flags_start */ | |
867 | 0, /* todo_flags_finish */ | |
4c0315d0 | 868 | }; |
cbe8bda8 | 869 | |
7620bc82 | 870 | class pass_diagnose_tm_blocks : public gimple_opt_pass |
cbe8bda8 | 871 | { |
872 | public: | |
9af5ce0c | 873 | pass_diagnose_tm_blocks (gcc::context *ctxt) |
874 | : gimple_opt_pass (pass_data_diagnose_tm_blocks, ctxt) | |
cbe8bda8 | 875 | {} |
876 | ||
877 | /* opt_pass methods: */ | |
31315c24 | 878 | virtual bool gate (function *) { return flag_tm; } |
65b0537f | 879 | virtual unsigned int execute (function *) { return diagnose_tm_blocks (); } |
cbe8bda8 | 880 | |
881 | }; // class pass_diagnose_tm_blocks | |
882 | ||
7620bc82 | 883 | } // anon namespace |
884 | ||
cbe8bda8 | 885 | gimple_opt_pass * |
886 | make_pass_diagnose_tm_blocks (gcc::context *ctxt) | |
887 | { | |
888 | return new pass_diagnose_tm_blocks (ctxt); | |
889 | } | |
4c0315d0 | 890 | \f |
891 | /* Instead of instrumenting thread private memory, we save the | |
892 | addresses in a log which we later use to save/restore the addresses | |
893 | upon transaction start/restart. | |
894 | ||
895 | The log is keyed by address, where each element contains individual | |
896 | statements among different code paths that perform the store. | |
897 | ||
898 | This log is later used to generate either plain save/restore of the | |
899 | addresses upon transaction start/restart, or calls to the ITM_L* | |
900 | logging functions. | |
901 | ||
902 | So for something like: | |
903 | ||
904 | struct large { int x[1000]; }; | |
905 | struct large lala = { 0 }; | |
906 | __transaction { | |
907 | lala.x[i] = 123; | |
908 | ... | |
909 | } | |
910 | ||
911 | We can either save/restore: | |
912 | ||
913 | lala = { 0 }; | |
914 | trxn = _ITM_startTransaction (); | |
915 | if (trxn & a_saveLiveVariables) | |
916 | tmp_lala1 = lala.x[i]; | |
917 | else if (a & a_restoreLiveVariables) | |
918 | lala.x[i] = tmp_lala1; | |
919 | ||
920 | or use the logging functions: | |
921 | ||
922 | lala = { 0 }; | |
923 | trxn = _ITM_startTransaction (); | |
924 | _ITM_LU4 (&lala.x[i]); | |
925 | ||
926 | Obviously, if we use _ITM_L* to log, we prefer to call _ITM_L* as | |
927 | far up the dominator tree to shadow all of the writes to a given | |
928 | location (thus reducing the total number of logging calls), but not | |
929 | so high as to be called on a path that does not perform a | |
930 | write. */ | |
931 | ||
932 | /* One individual log entry. We may have multiple statements for the | |
933 | same location if neither dominate each other (on different | |
934 | execution paths). */ | |
04009ada | 935 | struct tm_log_entry |
4c0315d0 | 936 | { |
937 | /* Address to save. */ | |
938 | tree addr; | |
939 | /* Entry block for the transaction this address occurs in. */ | |
940 | basic_block entry_block; | |
941 | /* Dominating statements the store occurs in. */ | |
42acab1c | 942 | vec<gimple *> stmts; |
4c0315d0 | 943 | /* Initially, while we are building the log, we place a nonzero |
944 | value here to mean that this address *will* be saved with a | |
945 | save/restore sequence. Later, when generating the save sequence | |
946 | we place the SSA temp generated here. */ | |
947 | tree save_var; | |
04009ada | 948 | }; |
4c0315d0 | 949 | |
4c0315d0 | 950 | |
d9dd21a8 | 951 | /* Log entry hashtable helpers. */ |
4c0315d0 | 952 | |
576d4555 | 953 | struct log_entry_hasher : pointer_hash <tm_log_entry> |
4c0315d0 | 954 | { |
9969c043 | 955 | static inline hashval_t hash (const tm_log_entry *); |
956 | static inline bool equal (const tm_log_entry *, const tm_log_entry *); | |
957 | static inline void remove (tm_log_entry *); | |
d9dd21a8 | 958 | }; |
4c0315d0 | 959 | |
960 | /* Htab support. Return hash value for a `tm_log_entry'. */ | |
d9dd21a8 | 961 | inline hashval_t |
9969c043 | 962 | log_entry_hasher::hash (const tm_log_entry *log) |
4c0315d0 | 963 | { |
4c0315d0 | 964 | return iterative_hash_expr (log->addr, 0); |
965 | } | |
966 | ||
967 | /* Htab support. Return true if two log entries are the same. */ | |
d9dd21a8 | 968 | inline bool |
9969c043 | 969 | log_entry_hasher::equal (const tm_log_entry *log1, const tm_log_entry *log2) |
4c0315d0 | 970 | { |
4c0315d0 | 971 | /* FIXME: |
972 | ||
973 | rth: I suggest that we get rid of the component refs etc. | |
974 | I.e. resolve the reference to base + offset. | |
975 | ||
976 | We may need to actually finish a merge with mainline for this, | |
977 | since we'd like to be presented with Richi's MEM_REF_EXPRs more | |
978 | often than not. But in the meantime your tm_log_entry could save | |
979 | the results of get_inner_reference. | |
980 | ||
981 | See: g++.dg/tm/pr46653.C | |
982 | */ | |
983 | ||
984 | /* Special case plain equality because operand_equal_p() below will | |
985 | return FALSE if the addresses are equal but they have | |
986 | side-effects (e.g. a volatile address). */ | |
987 | if (log1->addr == log2->addr) | |
988 | return true; | |
989 | ||
990 | return operand_equal_p (log1->addr, log2->addr, 0); | |
991 | } | |
992 | ||
993 | /* Htab support. Free one tm_log_entry. */ | |
d9dd21a8 | 994 | inline void |
9969c043 | 995 | log_entry_hasher::remove (tm_log_entry *lp) |
4c0315d0 | 996 | { |
f1f41a6c | 997 | lp->stmts.release (); |
4c0315d0 | 998 | free (lp); |
999 | } | |
1000 | ||
d9dd21a8 | 1001 | |
1002 | /* The actual log. */ | |
c1f445d2 | 1003 | static hash_table<log_entry_hasher> *tm_log; |
d9dd21a8 | 1004 | |
1005 | /* Addresses to log with a save/restore sequence. These should be in | |
1006 | dominator order. */ | |
1007 | static vec<tree> tm_log_save_addresses; | |
1008 | ||
1009 | enum thread_memory_type | |
1010 | { | |
1011 | mem_non_local = 0, | |
1012 | mem_thread_local, | |
1013 | mem_transaction_local, | |
1014 | mem_max | |
1015 | }; | |
1016 | ||
04009ada | 1017 | struct tm_new_mem_map |
d9dd21a8 | 1018 | { |
1019 | /* SSA_NAME being dereferenced. */ | |
1020 | tree val; | |
1021 | enum thread_memory_type local_new_memory; | |
04009ada | 1022 | }; |
d9dd21a8 | 1023 | |
1024 | /* Hashtable helpers. */ | |
1025 | ||
04009ada | 1026 | struct tm_mem_map_hasher : free_ptr_hash <tm_new_mem_map> |
d9dd21a8 | 1027 | { |
04009ada | 1028 | static inline hashval_t hash (const tm_new_mem_map *); |
1029 | static inline bool equal (const tm_new_mem_map *, const tm_new_mem_map *); | |
d9dd21a8 | 1030 | }; |
1031 | ||
1032 | inline hashval_t | |
04009ada | 1033 | tm_mem_map_hasher::hash (const tm_new_mem_map *v) |
d9dd21a8 | 1034 | { |
1035 | return (intptr_t)v->val >> 4; | |
1036 | } | |
1037 | ||
1038 | inline bool | |
04009ada | 1039 | tm_mem_map_hasher::equal (const tm_new_mem_map *v, const tm_new_mem_map *c) |
d9dd21a8 | 1040 | { |
1041 | return v->val == c->val; | |
1042 | } | |
1043 | ||
1044 | /* Map for an SSA_NAME originally pointing to a non aliased new piece | |
1045 | of memory (malloc, alloc, etc). */ | |
c1f445d2 | 1046 | static hash_table<tm_mem_map_hasher> *tm_new_mem_hash; |
d9dd21a8 | 1047 | |
4c0315d0 | 1048 | /* Initialize logging data structures. */ |
1049 | static void | |
1050 | tm_log_init (void) | |
1051 | { | |
c1f445d2 | 1052 | tm_log = new hash_table<log_entry_hasher> (10); |
1053 | tm_new_mem_hash = new hash_table<tm_mem_map_hasher> (5); | |
f1f41a6c | 1054 | tm_log_save_addresses.create (5); |
4c0315d0 | 1055 | } |
1056 | ||
1057 | /* Free logging data structures. */ | |
1058 | static void | |
1059 | tm_log_delete (void) | |
1060 | { | |
c1f445d2 | 1061 | delete tm_log; |
1062 | tm_log = NULL; | |
1063 | delete tm_new_mem_hash; | |
1064 | tm_new_mem_hash = NULL; | |
f1f41a6c | 1065 | tm_log_save_addresses.release (); |
4c0315d0 | 1066 | } |
1067 | ||
1068 | /* Return true if MEM is a transaction invariant memory for the TM | |
1069 | region starting at REGION_ENTRY_BLOCK. */ | |
1070 | static bool | |
1071 | transaction_invariant_address_p (const_tree mem, basic_block region_entry_block) | |
1072 | { | |
1073 | if ((TREE_CODE (mem) == INDIRECT_REF || TREE_CODE (mem) == MEM_REF) | |
1074 | && TREE_CODE (TREE_OPERAND (mem, 0)) == SSA_NAME) | |
1075 | { | |
1076 | basic_block def_bb; | |
1077 | ||
1078 | def_bb = gimple_bb (SSA_NAME_DEF_STMT (TREE_OPERAND (mem, 0))); | |
1079 | return def_bb != region_entry_block | |
1080 | && dominated_by_p (CDI_DOMINATORS, region_entry_block, def_bb); | |
1081 | } | |
1082 | ||
1083 | mem = strip_invariant_refs (mem); | |
1084 | return mem && (CONSTANT_CLASS_P (mem) || decl_address_invariant_p (mem)); | |
1085 | } | |
1086 | ||
1087 | /* Given an address ADDR in STMT, find it in the memory log or add it, | |
1088 | making sure to keep only the addresses highest in the dominator | |
1089 | tree. | |
1090 | ||
1091 | ENTRY_BLOCK is the entry_block for the transaction. | |
1092 | ||
1093 | If we find the address in the log, make sure it's either the same | |
1094 | address, or an equivalent one that dominates ADDR. | |
1095 | ||
1096 | If we find the address, but neither ADDR dominates the found | |
1097 | address, nor the found one dominates ADDR, we're on different | |
1098 | execution paths. Add it. | |
1099 | ||
1100 | If known, ENTRY_BLOCK is the entry block for the region, otherwise | |
1101 | NULL. */ | |
1102 | static void | |
42acab1c | 1103 | tm_log_add (basic_block entry_block, tree addr, gimple *stmt) |
4c0315d0 | 1104 | { |
d9dd21a8 | 1105 | tm_log_entry **slot; |
4c0315d0 | 1106 | struct tm_log_entry l, *lp; |
1107 | ||
1108 | l.addr = addr; | |
c1f445d2 | 1109 | slot = tm_log->find_slot (&l, INSERT); |
4c0315d0 | 1110 | if (!*slot) |
1111 | { | |
1112 | tree type = TREE_TYPE (addr); | |
1113 | ||
1114 | lp = XNEW (struct tm_log_entry); | |
1115 | lp->addr = addr; | |
1116 | *slot = lp; | |
1117 | ||
1118 | /* Small invariant addresses can be handled as save/restores. */ | |
1119 | if (entry_block | |
1120 | && transaction_invariant_address_p (lp->addr, entry_block) | |
1121 | && TYPE_SIZE_UNIT (type) != NULL | |
cd4547bf | 1122 | && tree_fits_uhwi_p (TYPE_SIZE_UNIT (type)) |
aa59f000 | 1123 | && ((HOST_WIDE_INT) tree_to_uhwi (TYPE_SIZE_UNIT (type)) |
4c0315d0 | 1124 | < PARAM_VALUE (PARAM_TM_MAX_AGGREGATE_SIZE)) |
1125 | /* We must be able to copy this type normally. I.e., no | |
1126 | special constructors and the like. */ | |
1127 | && !TREE_ADDRESSABLE (type)) | |
1128 | { | |
54a0a932 | 1129 | lp->save_var = create_tmp_reg (TREE_TYPE (lp->addr), "tm_save"); |
f1f41a6c | 1130 | lp->stmts.create (0); |
4c0315d0 | 1131 | lp->entry_block = entry_block; |
1132 | /* Save addresses separately in dominator order so we don't | |
1133 | get confused by overlapping addresses in the save/restore | |
1134 | sequence. */ | |
f1f41a6c | 1135 | tm_log_save_addresses.safe_push (lp->addr); |
4c0315d0 | 1136 | } |
1137 | else | |
1138 | { | |
1139 | /* Use the logging functions. */ | |
f1f41a6c | 1140 | lp->stmts.create (5); |
1141 | lp->stmts.quick_push (stmt); | |
4c0315d0 | 1142 | lp->save_var = NULL; |
1143 | } | |
1144 | } | |
1145 | else | |
1146 | { | |
1147 | size_t i; | |
42acab1c | 1148 | gimple *oldstmt; |
4c0315d0 | 1149 | |
d9dd21a8 | 1150 | lp = *slot; |
4c0315d0 | 1151 | |
1152 | /* If we're generating a save/restore sequence, we don't care | |
1153 | about statements. */ | |
1154 | if (lp->save_var) | |
1155 | return; | |
1156 | ||
f1f41a6c | 1157 | for (i = 0; lp->stmts.iterate (i, &oldstmt); ++i) |
4c0315d0 | 1158 | { |
1159 | if (stmt == oldstmt) | |
1160 | return; | |
1161 | /* We already have a store to the same address, higher up the | |
1162 | dominator tree. Nothing to do. */ | |
1163 | if (dominated_by_p (CDI_DOMINATORS, | |
1164 | gimple_bb (stmt), gimple_bb (oldstmt))) | |
1165 | return; | |
1166 | /* We should be processing blocks in dominator tree order. */ | |
1167 | gcc_assert (!dominated_by_p (CDI_DOMINATORS, | |
1168 | gimple_bb (oldstmt), gimple_bb (stmt))); | |
1169 | } | |
1170 | /* Store is on a different code path. */ | |
f1f41a6c | 1171 | lp->stmts.safe_push (stmt); |
4c0315d0 | 1172 | } |
1173 | } | |
1174 | ||
1175 | /* Gimplify the address of a TARGET_MEM_REF. Return the SSA_NAME | |
1176 | result, insert the new statements before GSI. */ | |
1177 | ||
1178 | static tree | |
1179 | gimplify_addr (gimple_stmt_iterator *gsi, tree x) | |
1180 | { | |
1181 | if (TREE_CODE (x) == TARGET_MEM_REF) | |
1182 | x = tree_mem_ref_addr (build_pointer_type (TREE_TYPE (x)), x); | |
1183 | else | |
1184 | x = build_fold_addr_expr (x); | |
1185 | return force_gimple_operand_gsi (gsi, x, true, NULL, true, GSI_SAME_STMT); | |
1186 | } | |
1187 | ||
1188 | /* Instrument one address with the logging functions. | |
1189 | ADDR is the address to save. | |
1190 | STMT is the statement before which to place it. */ | |
1191 | static void | |
42acab1c | 1192 | tm_log_emit_stmt (tree addr, gimple *stmt) |
4c0315d0 | 1193 | { |
1194 | tree type = TREE_TYPE (addr); | |
4c0315d0 | 1195 | gimple_stmt_iterator gsi = gsi_for_stmt (stmt); |
42acab1c | 1196 | gimple *log; |
4c0315d0 | 1197 | enum built_in_function code = BUILT_IN_TM_LOG; |
1198 | ||
1199 | if (type == float_type_node) | |
1200 | code = BUILT_IN_TM_LOG_FLOAT; | |
1201 | else if (type == double_type_node) | |
1202 | code = BUILT_IN_TM_LOG_DOUBLE; | |
1203 | else if (type == long_double_type_node) | |
1204 | code = BUILT_IN_TM_LOG_LDOUBLE; | |
e5fee0fe | 1205 | else if (TYPE_SIZE (type) != NULL |
1206 | && tree_fits_uhwi_p (TYPE_SIZE (type))) | |
4c0315d0 | 1207 | { |
e5fee0fe | 1208 | unsigned HOST_WIDE_INT type_size = tree_to_uhwi (TYPE_SIZE (type)); |
1209 | ||
1210 | if (TREE_CODE (type) == VECTOR_TYPE) | |
4c0315d0 | 1211 | { |
e5fee0fe | 1212 | switch (type_size) |
4c0315d0 | 1213 | { |
e5fee0fe | 1214 | case 64: |
1215 | code = BUILT_IN_TM_LOG_M64; | |
1216 | break; | |
1217 | case 128: | |
1218 | code = BUILT_IN_TM_LOG_M128; | |
1219 | break; | |
1220 | case 256: | |
1221 | code = BUILT_IN_TM_LOG_M256; | |
1222 | break; | |
1223 | default: | |
1224 | goto unhandled_vec; | |
1225 | } | |
1226 | if (!builtin_decl_explicit_p (code)) | |
1227 | goto unhandled_vec; | |
1228 | } | |
1229 | else | |
1230 | { | |
1231 | unhandled_vec: | |
1232 | switch (type_size) | |
1233 | { | |
c847d969 | 1234 | case 8: |
e5fee0fe | 1235 | code = BUILT_IN_TM_LOG_1; |
1236 | break; | |
c847d969 | 1237 | case 16: |
e5fee0fe | 1238 | code = BUILT_IN_TM_LOG_2; |
1239 | break; | |
c847d969 | 1240 | case 32: |
e5fee0fe | 1241 | code = BUILT_IN_TM_LOG_4; |
1242 | break; | |
c847d969 | 1243 | case 64: |
e5fee0fe | 1244 | code = BUILT_IN_TM_LOG_8; |
1245 | break; | |
4c0315d0 | 1246 | } |
4c0315d0 | 1247 | } |
1248 | } | |
1249 | ||
e5fee0fe | 1250 | if (code != BUILT_IN_TM_LOG && !builtin_decl_explicit_p (code)) |
1251 | code = BUILT_IN_TM_LOG; | |
1252 | tree decl = builtin_decl_explicit (code); | |
1253 | ||
4c0315d0 | 1254 | addr = gimplify_addr (&gsi, addr); |
1255 | if (code == BUILT_IN_TM_LOG) | |
e5fee0fe | 1256 | log = gimple_build_call (decl, 2, addr, TYPE_SIZE_UNIT (type)); |
4c0315d0 | 1257 | else |
e5fee0fe | 1258 | log = gimple_build_call (decl, 1, addr); |
4c0315d0 | 1259 | gsi_insert_before (&gsi, log, GSI_SAME_STMT); |
1260 | } | |
1261 | ||
1262 | /* Go through the log and instrument address that must be instrumented | |
1263 | with the logging functions. Leave the save/restore addresses for | |
1264 | later. */ | |
1265 | static void | |
1266 | tm_log_emit (void) | |
1267 | { | |
c1f445d2 | 1268 | hash_table<log_entry_hasher>::iterator hi; |
4c0315d0 | 1269 | struct tm_log_entry *lp; |
1270 | ||
c1f445d2 | 1271 | FOR_EACH_HASH_TABLE_ELEMENT (*tm_log, lp, tm_log_entry_t, hi) |
4c0315d0 | 1272 | { |
1273 | size_t i; | |
42acab1c | 1274 | gimple *stmt; |
4c0315d0 | 1275 | |
1276 | if (dump_file) | |
1277 | { | |
1278 | fprintf (dump_file, "TM thread private mem logging: "); | |
1ffa4346 | 1279 | print_generic_expr (dump_file, lp->addr); |
4c0315d0 | 1280 | fprintf (dump_file, "\n"); |
1281 | } | |
1282 | ||
1283 | if (lp->save_var) | |
1284 | { | |
1285 | if (dump_file) | |
1286 | fprintf (dump_file, "DUMPING to variable\n"); | |
1287 | continue; | |
1288 | } | |
1289 | else | |
1290 | { | |
1291 | if (dump_file) | |
1292 | fprintf (dump_file, "DUMPING with logging functions\n"); | |
f1f41a6c | 1293 | for (i = 0; lp->stmts.iterate (i, &stmt); ++i) |
4c0315d0 | 1294 | tm_log_emit_stmt (lp->addr, stmt); |
1295 | } | |
1296 | } | |
1297 | } | |
1298 | ||
1299 | /* Emit the save sequence for the corresponding addresses in the log. | |
1300 | ENTRY_BLOCK is the entry block for the transaction. | |
1301 | BB is the basic block to insert the code in. */ | |
1302 | static void | |
1303 | tm_log_emit_saves (basic_block entry_block, basic_block bb) | |
1304 | { | |
1305 | size_t i; | |
1306 | gimple_stmt_iterator gsi = gsi_last_bb (bb); | |
42acab1c | 1307 | gimple *stmt; |
4c0315d0 | 1308 | struct tm_log_entry l, *lp; |
1309 | ||
f1f41a6c | 1310 | for (i = 0; i < tm_log_save_addresses.length (); ++i) |
4c0315d0 | 1311 | { |
f1f41a6c | 1312 | l.addr = tm_log_save_addresses[i]; |
c1f445d2 | 1313 | lp = *(tm_log->find_slot (&l, NO_INSERT)); |
4c0315d0 | 1314 | gcc_assert (lp->save_var != NULL); |
1315 | ||
1316 | /* We only care about variables in the current transaction. */ | |
1317 | if (lp->entry_block != entry_block) | |
1318 | continue; | |
1319 | ||
1320 | stmt = gimple_build_assign (lp->save_var, unshare_expr (lp->addr)); | |
1321 | ||
1322 | /* Make sure we can create an SSA_NAME for this type. For | |
1323 | instance, aggregates aren't allowed, in which case the system | |
1324 | will create a VOP for us and everything will just work. */ | |
1325 | if (is_gimple_reg_type (TREE_TYPE (lp->save_var))) | |
1326 | { | |
1327 | lp->save_var = make_ssa_name (lp->save_var, stmt); | |
1328 | gimple_assign_set_lhs (stmt, lp->save_var); | |
1329 | } | |
1330 | ||
1331 | gsi_insert_before (&gsi, stmt, GSI_SAME_STMT); | |
1332 | } | |
1333 | } | |
1334 | ||
1335 | /* Emit the restore sequence for the corresponding addresses in the log. | |
1336 | ENTRY_BLOCK is the entry block for the transaction. | |
1337 | BB is the basic block to insert the code in. */ | |
1338 | static void | |
1339 | tm_log_emit_restores (basic_block entry_block, basic_block bb) | |
1340 | { | |
1341 | int i; | |
1342 | struct tm_log_entry l, *lp; | |
1343 | gimple_stmt_iterator gsi; | |
42acab1c | 1344 | gimple *stmt; |
4c0315d0 | 1345 | |
f1f41a6c | 1346 | for (i = tm_log_save_addresses.length () - 1; i >= 0; i--) |
4c0315d0 | 1347 | { |
f1f41a6c | 1348 | l.addr = tm_log_save_addresses[i]; |
c1f445d2 | 1349 | lp = *(tm_log->find_slot (&l, NO_INSERT)); |
4c0315d0 | 1350 | gcc_assert (lp->save_var != NULL); |
1351 | ||
1352 | /* We only care about variables in the current transaction. */ | |
1353 | if (lp->entry_block != entry_block) | |
1354 | continue; | |
1355 | ||
1356 | /* Restores are in LIFO order from the saves in case we have | |
1357 | overlaps. */ | |
1358 | gsi = gsi_start_bb (bb); | |
1359 | ||
1360 | stmt = gimple_build_assign (unshare_expr (lp->addr), lp->save_var); | |
1361 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
1362 | } | |
1363 | } | |
1364 | ||
4c0315d0 | 1365 | \f |
1366 | static tree lower_sequence_tm (gimple_stmt_iterator *, bool *, | |
1367 | struct walk_stmt_info *); | |
1368 | static tree lower_sequence_no_tm (gimple_stmt_iterator *, bool *, | |
1369 | struct walk_stmt_info *); | |
1370 | ||
1371 | /* Evaluate an address X being dereferenced and determine if it | |
1372 | originally points to a non aliased new chunk of memory (malloc, | |
1373 | alloca, etc). | |
1374 | ||
1375 | Return MEM_THREAD_LOCAL if it points to a thread-local address. | |
1376 | Return MEM_TRANSACTION_LOCAL if it points to a transaction-local address. | |
1377 | Return MEM_NON_LOCAL otherwise. | |
1378 | ||
1379 | ENTRY_BLOCK is the entry block to the transaction containing the | |
1380 | dereference of X. */ | |
1381 | static enum thread_memory_type | |
1382 | thread_private_new_memory (basic_block entry_block, tree x) | |
1383 | { | |
42acab1c | 1384 | gimple *stmt = NULL; |
4c0315d0 | 1385 | enum tree_code code; |
04009ada | 1386 | tm_new_mem_map **slot; |
1387 | tm_new_mem_map elt, *elt_p; | |
4c0315d0 | 1388 | tree val = x; |
1389 | enum thread_memory_type retval = mem_transaction_local; | |
1390 | ||
1391 | if (!entry_block | |
1392 | || TREE_CODE (x) != SSA_NAME | |
1393 | /* Possible uninitialized use, or a function argument. In | |
1394 | either case, we don't care. */ | |
1395 | || SSA_NAME_IS_DEFAULT_DEF (x)) | |
1396 | return mem_non_local; | |
1397 | ||
1398 | /* Look in cache first. */ | |
1399 | elt.val = x; | |
c1f445d2 | 1400 | slot = tm_new_mem_hash->find_slot (&elt, INSERT); |
d9dd21a8 | 1401 | elt_p = *slot; |
4c0315d0 | 1402 | if (elt_p) |
1403 | return elt_p->local_new_memory; | |
1404 | ||
1405 | /* Optimistically assume the memory is transaction local during | |
1406 | processing. This catches recursion into this variable. */ | |
04009ada | 1407 | *slot = elt_p = XNEW (tm_new_mem_map); |
4c0315d0 | 1408 | elt_p->val = val; |
1409 | elt_p->local_new_memory = mem_transaction_local; | |
1410 | ||
1411 | /* Search DEF chain to find the original definition of this address. */ | |
1412 | do | |
1413 | { | |
1414 | if (ptr_deref_may_alias_global_p (x)) | |
1415 | { | |
1416 | /* Address escapes. This is not thread-private. */ | |
1417 | retval = mem_non_local; | |
1418 | goto new_memory_ret; | |
1419 | } | |
1420 | ||
1421 | stmt = SSA_NAME_DEF_STMT (x); | |
1422 | ||
1423 | /* If the malloc call is outside the transaction, this is | |
1424 | thread-local. */ | |
1425 | if (retval != mem_thread_local | |
1426 | && !dominated_by_p (CDI_DOMINATORS, gimple_bb (stmt), entry_block)) | |
1427 | retval = mem_thread_local; | |
1428 | ||
1429 | if (is_gimple_assign (stmt)) | |
1430 | { | |
1431 | code = gimple_assign_rhs_code (stmt); | |
1432 | /* x = foo ==> foo */ | |
1433 | if (code == SSA_NAME) | |
1434 | x = gimple_assign_rhs1 (stmt); | |
1435 | /* x = foo + n ==> foo */ | |
1436 | else if (code == POINTER_PLUS_EXPR) | |
1437 | x = gimple_assign_rhs1 (stmt); | |
1438 | /* x = (cast*) foo ==> foo */ | |
d09ef31a | 1439 | else if (code == VIEW_CONVERT_EXPR || CONVERT_EXPR_CODE_P (code)) |
4c0315d0 | 1440 | x = gimple_assign_rhs1 (stmt); |
43ee99ea | 1441 | /* x = c ? op1 : op2 == > op1 or op2 just like a PHI */ |
1442 | else if (code == COND_EXPR) | |
1443 | { | |
1444 | tree op1 = gimple_assign_rhs2 (stmt); | |
1445 | tree op2 = gimple_assign_rhs3 (stmt); | |
1446 | enum thread_memory_type mem; | |
1447 | retval = thread_private_new_memory (entry_block, op1); | |
1448 | if (retval == mem_non_local) | |
1449 | goto new_memory_ret; | |
1450 | mem = thread_private_new_memory (entry_block, op2); | |
1451 | retval = MIN (retval, mem); | |
1452 | goto new_memory_ret; | |
1453 | } | |
4c0315d0 | 1454 | else |
1455 | { | |
1456 | retval = mem_non_local; | |
1457 | goto new_memory_ret; | |
1458 | } | |
1459 | } | |
1460 | else | |
1461 | { | |
1462 | if (gimple_code (stmt) == GIMPLE_PHI) | |
1463 | { | |
1464 | unsigned int i; | |
1465 | enum thread_memory_type mem; | |
1466 | tree phi_result = gimple_phi_result (stmt); | |
1467 | ||
1468 | /* If any of the ancestors are non-local, we are sure to | |
1469 | be non-local. Otherwise we can avoid doing anything | |
1470 | and inherit what has already been generated. */ | |
1471 | retval = mem_max; | |
1472 | for (i = 0; i < gimple_phi_num_args (stmt); ++i) | |
1473 | { | |
1474 | tree op = PHI_ARG_DEF (stmt, i); | |
1475 | ||
1476 | /* Exclude self-assignment. */ | |
1477 | if (phi_result == op) | |
1478 | continue; | |
1479 | ||
1480 | mem = thread_private_new_memory (entry_block, op); | |
1481 | if (mem == mem_non_local) | |
1482 | { | |
1483 | retval = mem; | |
1484 | goto new_memory_ret; | |
1485 | } | |
1486 | retval = MIN (retval, mem); | |
1487 | } | |
1488 | goto new_memory_ret; | |
1489 | } | |
1490 | break; | |
1491 | } | |
1492 | } | |
1493 | while (TREE_CODE (x) == SSA_NAME); | |
1494 | ||
1495 | if (stmt && is_gimple_call (stmt) && gimple_call_flags (stmt) & ECF_MALLOC) | |
1496 | /* Thread-local or transaction-local. */ | |
1497 | ; | |
1498 | else | |
1499 | retval = mem_non_local; | |
1500 | ||
1501 | new_memory_ret: | |
1502 | elt_p->local_new_memory = retval; | |
1503 | return retval; | |
1504 | } | |
1505 | ||
1506 | /* Determine whether X has to be instrumented using a read | |
1507 | or write barrier. | |
1508 | ||
1509 | ENTRY_BLOCK is the entry block for the region where stmt resides | |
1510 | in. NULL if unknown. | |
1511 | ||
1512 | STMT is the statement in which X occurs in. It is used for thread | |
1513 | private memory instrumentation. If no TPM instrumentation is | |
1514 | desired, STMT should be null. */ | |
1515 | static bool | |
42acab1c | 1516 | requires_barrier (basic_block entry_block, tree x, gimple *stmt) |
4c0315d0 | 1517 | { |
1518 | tree orig = x; | |
1519 | while (handled_component_p (x)) | |
1520 | x = TREE_OPERAND (x, 0); | |
1521 | ||
1522 | switch (TREE_CODE (x)) | |
1523 | { | |
1524 | case INDIRECT_REF: | |
1525 | case MEM_REF: | |
1526 | { | |
1527 | enum thread_memory_type ret; | |
1528 | ||
1529 | ret = thread_private_new_memory (entry_block, TREE_OPERAND (x, 0)); | |
1530 | if (ret == mem_non_local) | |
1531 | return true; | |
1532 | if (stmt && ret == mem_thread_local) | |
1533 | /* ?? Should we pass `orig', or the INDIRECT_REF X. ?? */ | |
1534 | tm_log_add (entry_block, orig, stmt); | |
1535 | ||
1536 | /* Transaction-locals require nothing at all. For malloc, a | |
1537 | transaction restart frees the memory and we reallocate. | |
1538 | For alloca, the stack pointer gets reset by the retry and | |
1539 | we reallocate. */ | |
1540 | return false; | |
1541 | } | |
1542 | ||
1543 | case TARGET_MEM_REF: | |
1544 | if (TREE_CODE (TMR_BASE (x)) != ADDR_EXPR) | |
1545 | return true; | |
1546 | x = TREE_OPERAND (TMR_BASE (x), 0); | |
1547 | if (TREE_CODE (x) == PARM_DECL) | |
1548 | return false; | |
53e9c5c4 | 1549 | gcc_assert (VAR_P (x)); |
4c0315d0 | 1550 | /* FALLTHRU */ |
1551 | ||
1552 | case PARM_DECL: | |
1553 | case RESULT_DECL: | |
1554 | case VAR_DECL: | |
1555 | if (DECL_BY_REFERENCE (x)) | |
1556 | { | |
1557 | /* ??? This value is a pointer, but aggregate_value_p has been | |
1558 | jigged to return true which confuses needs_to_live_in_memory. | |
1559 | This ought to be cleaned up generically. | |
1560 | ||
1561 | FIXME: Verify this still happens after the next mainline | |
1562 | merge. Testcase ie g++.dg/tm/pr47554.C. | |
1563 | */ | |
1564 | return false; | |
1565 | } | |
1566 | ||
1567 | if (is_global_var (x)) | |
e0f3ea3e | 1568 | return !TREE_READONLY (x); |
4c0315d0 | 1569 | if (/* FIXME: This condition should actually go below in the |
1570 | tm_log_add() call, however is_call_clobbered() depends on | |
1571 | aliasing info which is not available during | |
1572 | gimplification. Since requires_barrier() gets called | |
1573 | during lower_sequence_tm/gimplification, leave the call | |
1574 | to needs_to_live_in_memory until we eliminate | |
1575 | lower_sequence_tm altogether. */ | |
3c8b8a41 | 1576 | needs_to_live_in_memory (x)) |
4c0315d0 | 1577 | return true; |
e0f3ea3e | 1578 | else |
1579 | { | |
1580 | /* For local memory that doesn't escape (aka thread private | |
1581 | memory), we can either save the value at the beginning of | |
1582 | the transaction and restore on restart, or call a tm | |
1583 | function to dynamically save and restore on restart | |
1584 | (ITM_L*). */ | |
1585 | if (stmt) | |
1586 | tm_log_add (entry_block, orig, stmt); | |
1587 | return false; | |
1588 | } | |
4c0315d0 | 1589 | |
1590 | default: | |
1591 | return false; | |
1592 | } | |
1593 | } | |
1594 | ||
1595 | /* Mark the GIMPLE_ASSIGN statement as appropriate for being inside | |
1596 | a transaction region. */ | |
1597 | ||
1598 | static void | |
1599 | examine_assign_tm (unsigned *state, gimple_stmt_iterator *gsi) | |
1600 | { | |
42acab1c | 1601 | gimple *stmt = gsi_stmt (*gsi); |
4c0315d0 | 1602 | |
1603 | if (requires_barrier (/*entry_block=*/NULL, gimple_assign_rhs1 (stmt), NULL)) | |
1604 | *state |= GTMA_HAVE_LOAD; | |
1605 | if (requires_barrier (/*entry_block=*/NULL, gimple_assign_lhs (stmt), NULL)) | |
1606 | *state |= GTMA_HAVE_STORE; | |
1607 | } | |
1608 | ||
1609 | /* Mark a GIMPLE_CALL as appropriate for being inside a transaction. */ | |
1610 | ||
1611 | static void | |
1612 | examine_call_tm (unsigned *state, gimple_stmt_iterator *gsi) | |
1613 | { | |
42acab1c | 1614 | gimple *stmt = gsi_stmt (*gsi); |
4c0315d0 | 1615 | tree fn; |
1616 | ||
1617 | if (is_tm_pure_call (stmt)) | |
1618 | return; | |
1619 | ||
1620 | /* Check if this call is a transaction abort. */ | |
1621 | fn = gimple_call_fndecl (stmt); | |
1622 | if (is_tm_abort (fn)) | |
1623 | *state |= GTMA_HAVE_ABORT; | |
1624 | ||
1625 | /* Note that something may happen. */ | |
1626 | *state |= GTMA_HAVE_LOAD | GTMA_HAVE_STORE; | |
1627 | } | |
1628 | ||
a08574d7 | 1629 | /* Iterate through the statements in the sequence, moving labels |
1630 | (and thus edges) of transactions from "label_norm" to "label_uninst". */ | |
1631 | ||
1632 | static tree | |
1633 | make_tm_uninst (gimple_stmt_iterator *gsi, bool *handled_ops_p, | |
1634 | struct walk_stmt_info *) | |
1635 | { | |
1636 | gimple *stmt = gsi_stmt (*gsi); | |
1637 | ||
1638 | if (gtransaction *txn = dyn_cast <gtransaction *> (stmt)) | |
1639 | { | |
1640 | *handled_ops_p = true; | |
1641 | txn->label_uninst = txn->label_norm; | |
1642 | txn->label_norm = NULL; | |
1643 | } | |
1644 | else | |
1645 | *handled_ops_p = !gimple_has_substatements (stmt); | |
1646 | ||
1647 | return NULL_TREE; | |
1648 | } | |
1649 | ||
4c0315d0 | 1650 | /* Lower a GIMPLE_TRANSACTION statement. */ |
1651 | ||
1652 | static void | |
1653 | lower_transaction (gimple_stmt_iterator *gsi, struct walk_stmt_info *wi) | |
1654 | { | |
42acab1c | 1655 | gimple *g; |
1a91d914 | 1656 | gtransaction *stmt = as_a <gtransaction *> (gsi_stmt (*gsi)); |
4c0315d0 | 1657 | unsigned int *outer_state = (unsigned int *) wi->info; |
1658 | unsigned int this_state = 0; | |
1659 | struct walk_stmt_info this_wi; | |
1660 | ||
1661 | /* First, lower the body. The scanning that we do inside gives | |
1662 | us some idea of what we're dealing with. */ | |
1663 | memset (&this_wi, 0, sizeof (this_wi)); | |
1664 | this_wi.info = (void *) &this_state; | |
e3a19533 | 1665 | walk_gimple_seq_mod (gimple_transaction_body_ptr (stmt), |
1666 | lower_sequence_tm, NULL, &this_wi); | |
4c0315d0 | 1667 | |
1668 | /* If there was absolutely nothing transaction related inside the | |
1669 | transaction, we may elide it. Likewise if this is a nested | |
1670 | transaction and does not contain an abort. */ | |
1671 | if (this_state == 0 | |
1672 | || (!(this_state & GTMA_HAVE_ABORT) && outer_state != NULL)) | |
1673 | { | |
1674 | if (outer_state) | |
1675 | *outer_state |= this_state; | |
1676 | ||
1677 | gsi_insert_seq_before (gsi, gimple_transaction_body (stmt), | |
1678 | GSI_SAME_STMT); | |
1679 | gimple_transaction_set_body (stmt, NULL); | |
1680 | ||
1681 | gsi_remove (gsi, true); | |
1682 | wi->removed_stmt = true; | |
1683 | return; | |
1684 | } | |
1685 | ||
1686 | /* Wrap the body of the transaction in a try-finally node so that | |
1687 | the commit call is always properly called. */ | |
1688 | g = gimple_build_call (builtin_decl_explicit (BUILT_IN_TM_COMMIT), 0); | |
1689 | if (flag_exceptions) | |
1690 | { | |
1691 | tree ptr; | |
1692 | gimple_seq n_seq, e_seq; | |
1693 | ||
1694 | n_seq = gimple_seq_alloc_with_stmt (g); | |
e3a19533 | 1695 | e_seq = NULL; |
4c0315d0 | 1696 | |
1697 | g = gimple_build_call (builtin_decl_explicit (BUILT_IN_EH_POINTER), | |
1698 | 1, integer_zero_node); | |
f9e245b2 | 1699 | ptr = create_tmp_var (ptr_type_node); |
4c0315d0 | 1700 | gimple_call_set_lhs (g, ptr); |
1701 | gimple_seq_add_stmt (&e_seq, g); | |
1702 | ||
1703 | g = gimple_build_call (builtin_decl_explicit (BUILT_IN_TM_COMMIT_EH), | |
1704 | 1, ptr); | |
1705 | gimple_seq_add_stmt (&e_seq, g); | |
1706 | ||
1707 | g = gimple_build_eh_else (n_seq, e_seq); | |
1708 | } | |
1709 | ||
1710 | g = gimple_build_try (gimple_transaction_body (stmt), | |
1711 | gimple_seq_alloc_with_stmt (g), GIMPLE_TRY_FINALLY); | |
4c0315d0 | 1712 | |
a08574d7 | 1713 | /* For a (potentially) outer transaction, create two paths. */ |
1714 | gimple_seq uninst = NULL; | |
1715 | if (outer_state == NULL) | |
1716 | { | |
1717 | uninst = copy_gimple_seq_and_replace_locals (g); | |
1718 | /* In the uninstrumented copy, reset inner transactions to have only | |
1719 | an uninstrumented code path. */ | |
1720 | memset (&this_wi, 0, sizeof (this_wi)); | |
1721 | walk_gimple_seq (uninst, make_tm_uninst, NULL, &this_wi); | |
1722 | } | |
1723 | ||
1724 | tree label1 = create_artificial_label (UNKNOWN_LOCATION); | |
1725 | gsi_insert_after (gsi, gimple_build_label (label1), GSI_CONTINUE_LINKING); | |
1726 | gsi_insert_after (gsi, g, GSI_CONTINUE_LINKING); | |
1727 | gimple_transaction_set_label_norm (stmt, label1); | |
4c0315d0 | 1728 | |
1729 | /* If the transaction calls abort or if this is an outer transaction, | |
1730 | add an "over" label afterwards. */ | |
a08574d7 | 1731 | tree label3 = NULL; |
1732 | if ((this_state & GTMA_HAVE_ABORT) | |
1733 | || outer_state == NULL | |
9af5ce0c | 1734 | || (gimple_transaction_subcode (stmt) & GTMA_IS_OUTER)) |
4c0315d0 | 1735 | { |
a08574d7 | 1736 | label3 = create_artificial_label (UNKNOWN_LOCATION); |
1737 | gimple_transaction_set_label_over (stmt, label3); | |
4c0315d0 | 1738 | } |
1739 | ||
a08574d7 | 1740 | if (uninst != NULL) |
1741 | { | |
1742 | gsi_insert_after (gsi, gimple_build_goto (label3), GSI_CONTINUE_LINKING); | |
1743 | ||
1744 | tree label2 = create_artificial_label (UNKNOWN_LOCATION); | |
1745 | gsi_insert_after (gsi, gimple_build_label (label2), GSI_CONTINUE_LINKING); | |
1746 | gsi_insert_seq_after (gsi, uninst, GSI_CONTINUE_LINKING); | |
1747 | gimple_transaction_set_label_uninst (stmt, label2); | |
1748 | } | |
1749 | ||
1750 | if (label3 != NULL) | |
1751 | gsi_insert_after (gsi, gimple_build_label (label3), GSI_CONTINUE_LINKING); | |
1752 | ||
1753 | gimple_transaction_set_body (stmt, NULL); | |
1754 | ||
4c0315d0 | 1755 | /* Record the set of operations found for use later. */ |
1756 | this_state |= gimple_transaction_subcode (stmt) & GTMA_DECLARATION_MASK; | |
1757 | gimple_transaction_set_subcode (stmt, this_state); | |
1758 | } | |
1759 | ||
1760 | /* Iterate through the statements in the sequence, lowering them all | |
1761 | as appropriate for being in a transaction. */ | |
1762 | ||
1763 | static tree | |
1764 | lower_sequence_tm (gimple_stmt_iterator *gsi, bool *handled_ops_p, | |
1765 | struct walk_stmt_info *wi) | |
1766 | { | |
1767 | unsigned int *state = (unsigned int *) wi->info; | |
42acab1c | 1768 | gimple *stmt = gsi_stmt (*gsi); |
4c0315d0 | 1769 | |
1770 | *handled_ops_p = true; | |
1771 | switch (gimple_code (stmt)) | |
1772 | { | |
1773 | case GIMPLE_ASSIGN: | |
1774 | /* Only memory reads/writes need to be instrumented. */ | |
1775 | if (gimple_assign_single_p (stmt)) | |
1776 | examine_assign_tm (state, gsi); | |
1777 | break; | |
1778 | ||
1779 | case GIMPLE_CALL: | |
1780 | examine_call_tm (state, gsi); | |
1781 | break; | |
1782 | ||
1783 | case GIMPLE_ASM: | |
1784 | *state |= GTMA_MAY_ENTER_IRREVOCABLE; | |
1785 | break; | |
1786 | ||
1787 | case GIMPLE_TRANSACTION: | |
1788 | lower_transaction (gsi, wi); | |
1789 | break; | |
1790 | ||
1791 | default: | |
1792 | *handled_ops_p = !gimple_has_substatements (stmt); | |
1793 | break; | |
1794 | } | |
1795 | ||
1796 | return NULL_TREE; | |
1797 | } | |
1798 | ||
1799 | /* Iterate through the statements in the sequence, lowering them all | |
1800 | as appropriate for being outside of a transaction. */ | |
1801 | ||
1802 | static tree | |
1803 | lower_sequence_no_tm (gimple_stmt_iterator *gsi, bool *handled_ops_p, | |
1804 | struct walk_stmt_info * wi) | |
1805 | { | |
42acab1c | 1806 | gimple *stmt = gsi_stmt (*gsi); |
4c0315d0 | 1807 | |
1808 | if (gimple_code (stmt) == GIMPLE_TRANSACTION) | |
1809 | { | |
1810 | *handled_ops_p = true; | |
1811 | lower_transaction (gsi, wi); | |
1812 | } | |
1813 | else | |
1814 | *handled_ops_p = !gimple_has_substatements (stmt); | |
1815 | ||
1816 | return NULL_TREE; | |
1817 | } | |
1818 | ||
1819 | /* Main entry point for flattening GIMPLE_TRANSACTION constructs. After | |
1820 | this, GIMPLE_TRANSACTION nodes still exist, but the nested body has | |
1821 | been moved out, and all the data required for constructing a proper | |
1822 | CFG has been recorded. */ | |
1823 | ||
1824 | static unsigned int | |
1825 | execute_lower_tm (void) | |
1826 | { | |
1827 | struct walk_stmt_info wi; | |
e3a19533 | 1828 | gimple_seq body; |
4c0315d0 | 1829 | |
1830 | /* Transactional clones aren't created until a later pass. */ | |
1831 | gcc_assert (!decl_is_tm_clone (current_function_decl)); | |
1832 | ||
e3a19533 | 1833 | body = gimple_body (current_function_decl); |
4c0315d0 | 1834 | memset (&wi, 0, sizeof (wi)); |
e3a19533 | 1835 | walk_gimple_seq_mod (&body, lower_sequence_no_tm, NULL, &wi); |
1836 | gimple_set_body (current_function_decl, body); | |
4c0315d0 | 1837 | |
1838 | return 0; | |
1839 | } | |
1840 | ||
7620bc82 | 1841 | namespace { |
1842 | ||
1843 | const pass_data pass_data_lower_tm = | |
cbe8bda8 | 1844 | { |
1845 | GIMPLE_PASS, /* type */ | |
1846 | "tmlower", /* name */ | |
1847 | OPTGROUP_NONE, /* optinfo_flags */ | |
cbe8bda8 | 1848 | TV_TRANS_MEM, /* tv_id */ |
1849 | PROP_gimple_lcf, /* properties_required */ | |
1850 | 0, /* properties_provided */ | |
1851 | 0, /* properties_destroyed */ | |
1852 | 0, /* todo_flags_start */ | |
1853 | 0, /* todo_flags_finish */ | |
4c0315d0 | 1854 | }; |
cbe8bda8 | 1855 | |
7620bc82 | 1856 | class pass_lower_tm : public gimple_opt_pass |
cbe8bda8 | 1857 | { |
1858 | public: | |
9af5ce0c | 1859 | pass_lower_tm (gcc::context *ctxt) |
1860 | : gimple_opt_pass (pass_data_lower_tm, ctxt) | |
cbe8bda8 | 1861 | {} |
1862 | ||
1863 | /* opt_pass methods: */ | |
31315c24 | 1864 | virtual bool gate (function *) { return flag_tm; } |
65b0537f | 1865 | virtual unsigned int execute (function *) { return execute_lower_tm (); } |
cbe8bda8 | 1866 | |
1867 | }; // class pass_lower_tm | |
1868 | ||
7620bc82 | 1869 | } // anon namespace |
1870 | ||
cbe8bda8 | 1871 | gimple_opt_pass * |
1872 | make_pass_lower_tm (gcc::context *ctxt) | |
1873 | { | |
1874 | return new pass_lower_tm (ctxt); | |
1875 | } | |
4c0315d0 | 1876 | \f |
1877 | /* Collect region information for each transaction. */ | |
1878 | ||
1879 | struct tm_region | |
1880 | { | |
1a91d914 | 1881 | public: |
1882 | ||
1883 | /* The field "transaction_stmt" is initially a gtransaction *, | |
1884 | but eventually gets lowered to a gcall *(to BUILT_IN_TM_START). | |
1885 | ||
1886 | Helper method to get it as a gtransaction *, with code-checking | |
1887 | in a checked-build. */ | |
1888 | ||
1889 | gtransaction * | |
1890 | get_transaction_stmt () const | |
1891 | { | |
1892 | return as_a <gtransaction *> (transaction_stmt); | |
1893 | } | |
1894 | ||
1895 | public: | |
1896 | ||
4c0315d0 | 1897 | /* Link to the next unnested transaction. */ |
1898 | struct tm_region *next; | |
1899 | ||
1900 | /* Link to the next inner transaction. */ | |
1901 | struct tm_region *inner; | |
1902 | ||
1903 | /* Link to the next outer transaction. */ | |
1904 | struct tm_region *outer; | |
1905 | ||
0cd02a19 | 1906 | /* The GIMPLE_TRANSACTION statement beginning this transaction. |
1907 | After TM_MARK, this gets replaced by a call to | |
1a91d914 | 1908 | BUILT_IN_TM_START. |
1909 | Hence this will be either a gtransaction *or a gcall *. */ | |
42acab1c | 1910 | gimple *transaction_stmt; |
4c0315d0 | 1911 | |
0cd02a19 | 1912 | /* After TM_MARK expands the GIMPLE_TRANSACTION into a call to |
1913 | BUILT_IN_TM_START, this field is true if the transaction is an | |
1914 | outer transaction. */ | |
1915 | bool original_transaction_was_outer; | |
1916 | ||
1917 | /* Return value from BUILT_IN_TM_START. */ | |
1918 | tree tm_state; | |
1919 | ||
1920 | /* The entry block to this region. This will always be the first | |
1921 | block of the body of the transaction. */ | |
4c0315d0 | 1922 | basic_block entry_block; |
1923 | ||
0cd02a19 | 1924 | /* The first block after an expanded call to _ITM_beginTransaction. */ |
1925 | basic_block restart_block; | |
1926 | ||
4c0315d0 | 1927 | /* The set of all blocks that end the region; NULL if only EXIT_BLOCK. |
1928 | These blocks are still a part of the region (i.e., the border is | |
1929 | inclusive). Note that this set is only complete for paths in the CFG | |
1930 | starting at ENTRY_BLOCK, and that there is no exit block recorded for | |
1931 | the edge to the "over" label. */ | |
1932 | bitmap exit_blocks; | |
1933 | ||
1934 | /* The set of all blocks that have an TM_IRREVOCABLE call. */ | |
1935 | bitmap irr_blocks; | |
1936 | }; | |
1937 | ||
1938 | /* True if there are pending edge statements to be committed for the | |
1939 | current function being scanned in the tmmark pass. */ | |
1940 | bool pending_edge_inserts_p; | |
1941 | ||
1942 | static struct tm_region *all_tm_regions; | |
1943 | static bitmap_obstack tm_obstack; | |
1944 | ||
1945 | ||
9d75589a | 1946 | /* A subroutine of tm_region_init. Record the existence of the |
4c0315d0 | 1947 | GIMPLE_TRANSACTION statement in a tree of tm_region elements. */ |
1948 | ||
1949 | static struct tm_region * | |
1a91d914 | 1950 | tm_region_init_0 (struct tm_region *outer, basic_block bb, |
1951 | gtransaction *stmt) | |
4c0315d0 | 1952 | { |
1953 | struct tm_region *region; | |
1954 | ||
1955 | region = (struct tm_region *) | |
1956 | obstack_alloc (&tm_obstack.obstack, sizeof (struct tm_region)); | |
1957 | ||
1958 | if (outer) | |
1959 | { | |
1960 | region->next = outer->inner; | |
1961 | outer->inner = region; | |
1962 | } | |
1963 | else | |
1964 | { | |
1965 | region->next = all_tm_regions; | |
1966 | all_tm_regions = region; | |
1967 | } | |
1968 | region->inner = NULL; | |
1969 | region->outer = outer; | |
1970 | ||
1971 | region->transaction_stmt = stmt; | |
0cd02a19 | 1972 | region->original_transaction_was_outer = false; |
1973 | region->tm_state = NULL; | |
4c0315d0 | 1974 | |
1975 | /* There are either one or two edges out of the block containing | |
1976 | the GIMPLE_TRANSACTION, one to the actual region and one to the | |
1977 | "over" label if the region contains an abort. The former will | |
1978 | always be the one marked FALLTHRU. */ | |
1979 | region->entry_block = FALLTHRU_EDGE (bb)->dest; | |
1980 | ||
1981 | region->exit_blocks = BITMAP_ALLOC (&tm_obstack); | |
1982 | region->irr_blocks = BITMAP_ALLOC (&tm_obstack); | |
1983 | ||
1984 | return region; | |
1985 | } | |
1986 | ||
1987 | /* A subroutine of tm_region_init. Record all the exit and | |
1988 | irrevocable blocks in BB into the region's exit_blocks and | |
1989 | irr_blocks bitmaps. Returns the new region being scanned. */ | |
1990 | ||
1991 | static struct tm_region * | |
1992 | tm_region_init_1 (struct tm_region *region, basic_block bb) | |
1993 | { | |
1994 | gimple_stmt_iterator gsi; | |
42acab1c | 1995 | gimple *g; |
4c0315d0 | 1996 | |
1997 | if (!region | |
1998 | || (!region->irr_blocks && !region->exit_blocks)) | |
1999 | return region; | |
2000 | ||
2001 | /* Check to see if this is the end of a region by seeing if it | |
2002 | contains a call to __builtin_tm_commit{,_eh}. Note that the | |
2003 | outermost region for DECL_IS_TM_CLONE need not collect this. */ | |
2004 | for (gsi = gsi_last_bb (bb); !gsi_end_p (gsi); gsi_prev (&gsi)) | |
2005 | { | |
2006 | g = gsi_stmt (gsi); | |
2007 | if (gimple_code (g) == GIMPLE_CALL) | |
2008 | { | |
2009 | tree fn = gimple_call_fndecl (g); | |
2010 | if (fn && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL) | |
2011 | { | |
2012 | if ((DECL_FUNCTION_CODE (fn) == BUILT_IN_TM_COMMIT | |
2013 | || DECL_FUNCTION_CODE (fn) == BUILT_IN_TM_COMMIT_EH) | |
2014 | && region->exit_blocks) | |
2015 | { | |
2016 | bitmap_set_bit (region->exit_blocks, bb->index); | |
2017 | region = region->outer; | |
2018 | break; | |
2019 | } | |
2020 | if (DECL_FUNCTION_CODE (fn) == BUILT_IN_TM_IRREVOCABLE) | |
2021 | bitmap_set_bit (region->irr_blocks, bb->index); | |
2022 | } | |
2023 | } | |
2024 | } | |
2025 | return region; | |
2026 | } | |
2027 | ||
2028 | /* Collect all of the transaction regions within the current function | |
2029 | and record them in ALL_TM_REGIONS. The REGION parameter may specify | |
2030 | an "outermost" region for use by tm clones. */ | |
2031 | ||
2032 | static void | |
2033 | tm_region_init (struct tm_region *region) | |
2034 | { | |
42acab1c | 2035 | gimple *g; |
4c0315d0 | 2036 | edge_iterator ei; |
2037 | edge e; | |
2038 | basic_block bb; | |
c2078b80 | 2039 | auto_vec<basic_block> queue; |
4c0315d0 | 2040 | bitmap visited_blocks = BITMAP_ALLOC (NULL); |
2041 | struct tm_region *old_region; | |
04009ada | 2042 | auto_vec<tm_region *> bb_regions; |
4c0315d0 | 2043 | |
de60f90c | 2044 | /* We could store this information in bb->aux, but we may get called |
2045 | through get_all_tm_blocks() from another pass that may be already | |
2046 | using bb->aux. */ | |
fe672ac0 | 2047 | bb_regions.safe_grow_cleared (last_basic_block_for_fn (cfun)); |
de60f90c | 2048 | |
c3f86f60 | 2049 | all_tm_regions = region; |
2050 | bb = single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun)); | |
f1f41a6c | 2051 | queue.safe_push (bb); |
c3f86f60 | 2052 | bitmap_set_bit (visited_blocks, bb->index); |
f1f41a6c | 2053 | bb_regions[bb->index] = region; |
c3f86f60 | 2054 | |
4c0315d0 | 2055 | do |
2056 | { | |
f1f41a6c | 2057 | bb = queue.pop (); |
2058 | region = bb_regions[bb->index]; | |
2059 | bb_regions[bb->index] = NULL; | |
4c0315d0 | 2060 | |
2061 | /* Record exit and irrevocable blocks. */ | |
2062 | region = tm_region_init_1 (region, bb); | |
2063 | ||
2064 | /* Check for the last statement in the block beginning a new region. */ | |
2065 | g = last_stmt (bb); | |
2066 | old_region = region; | |
1a91d914 | 2067 | if (g) |
2068 | if (gtransaction *trans_stmt = dyn_cast <gtransaction *> (g)) | |
2069 | region = tm_region_init_0 (region, bb, trans_stmt); | |
4c0315d0 | 2070 | |
2071 | /* Process subsequent blocks. */ | |
2072 | FOR_EACH_EDGE (e, ei, bb->succs) | |
2073 | if (!bitmap_bit_p (visited_blocks, e->dest->index)) | |
2074 | { | |
2075 | bitmap_set_bit (visited_blocks, e->dest->index); | |
f1f41a6c | 2076 | queue.safe_push (e->dest); |
4c0315d0 | 2077 | |
2078 | /* If the current block started a new region, make sure that only | |
2079 | the entry block of the new region is associated with this region. | |
2080 | Other successors are still part of the old region. */ | |
2081 | if (old_region != region && e->dest != region->entry_block) | |
f1f41a6c | 2082 | bb_regions[e->dest->index] = old_region; |
4c0315d0 | 2083 | else |
f1f41a6c | 2084 | bb_regions[e->dest->index] = region; |
4c0315d0 | 2085 | } |
2086 | } | |
f1f41a6c | 2087 | while (!queue.is_empty ()); |
4c0315d0 | 2088 | BITMAP_FREE (visited_blocks); |
2089 | } | |
2090 | ||
2091 | /* The "gate" function for all transactional memory expansion and optimization | |
2092 | passes. We collect region information for each top-level transaction, and | |
2093 | if we don't find any, we skip all of the TM passes. Each region will have | |
2094 | all of the exit blocks recorded, and the originating statement. */ | |
2095 | ||
2096 | static bool | |
2097 | gate_tm_init (void) | |
2098 | { | |
2099 | if (!flag_tm) | |
2100 | return false; | |
2101 | ||
2102 | calculate_dominance_info (CDI_DOMINATORS); | |
2103 | bitmap_obstack_initialize (&tm_obstack); | |
2104 | ||
2105 | /* If the function is a TM_CLONE, then the entire function is the region. */ | |
2106 | if (decl_is_tm_clone (current_function_decl)) | |
2107 | { | |
2108 | struct tm_region *region = (struct tm_region *) | |
2109 | obstack_alloc (&tm_obstack.obstack, sizeof (struct tm_region)); | |
2110 | memset (region, 0, sizeof (*region)); | |
34154e27 | 2111 | region->entry_block = single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun)); |
4c0315d0 | 2112 | /* For a clone, the entire function is the region. But even if |
2113 | we don't need to record any exit blocks, we may need to | |
2114 | record irrevocable blocks. */ | |
2115 | region->irr_blocks = BITMAP_ALLOC (&tm_obstack); | |
2116 | ||
2117 | tm_region_init (region); | |
2118 | } | |
2119 | else | |
2120 | { | |
2121 | tm_region_init (NULL); | |
2122 | ||
2123 | /* If we didn't find any regions, cleanup and skip the whole tree | |
2124 | of tm-related optimizations. */ | |
2125 | if (all_tm_regions == NULL) | |
2126 | { | |
2127 | bitmap_obstack_release (&tm_obstack); | |
2128 | return false; | |
2129 | } | |
2130 | } | |
2131 | ||
2132 | return true; | |
2133 | } | |
2134 | ||
7620bc82 | 2135 | namespace { |
2136 | ||
2137 | const pass_data pass_data_tm_init = | |
cbe8bda8 | 2138 | { |
2139 | GIMPLE_PASS, /* type */ | |
2140 | "*tminit", /* name */ | |
2141 | OPTGROUP_NONE, /* optinfo_flags */ | |
cbe8bda8 | 2142 | TV_TRANS_MEM, /* tv_id */ |
2143 | ( PROP_ssa | PROP_cfg ), /* properties_required */ | |
2144 | 0, /* properties_provided */ | |
2145 | 0, /* properties_destroyed */ | |
2146 | 0, /* todo_flags_start */ | |
2147 | 0, /* todo_flags_finish */ | |
4c0315d0 | 2148 | }; |
cbe8bda8 | 2149 | |
7620bc82 | 2150 | class pass_tm_init : public gimple_opt_pass |
cbe8bda8 | 2151 | { |
2152 | public: | |
9af5ce0c | 2153 | pass_tm_init (gcc::context *ctxt) |
2154 | : gimple_opt_pass (pass_data_tm_init, ctxt) | |
cbe8bda8 | 2155 | {} |
2156 | ||
2157 | /* opt_pass methods: */ | |
31315c24 | 2158 | virtual bool gate (function *) { return gate_tm_init (); } |
cbe8bda8 | 2159 | |
2160 | }; // class pass_tm_init | |
2161 | ||
7620bc82 | 2162 | } // anon namespace |
2163 | ||
cbe8bda8 | 2164 | gimple_opt_pass * |
2165 | make_pass_tm_init (gcc::context *ctxt) | |
2166 | { | |
2167 | return new pass_tm_init (ctxt); | |
2168 | } | |
4c0315d0 | 2169 | \f |
2170 | /* Add FLAGS to the GIMPLE_TRANSACTION subcode for the transaction region | |
2171 | represented by STATE. */ | |
2172 | ||
2173 | static inline void | |
2174 | transaction_subcode_ior (struct tm_region *region, unsigned flags) | |
2175 | { | |
2176 | if (region && region->transaction_stmt) | |
2177 | { | |
1a91d914 | 2178 | gtransaction *transaction_stmt = region->get_transaction_stmt (); |
2179 | flags |= gimple_transaction_subcode (transaction_stmt); | |
2180 | gimple_transaction_set_subcode (transaction_stmt, flags); | |
4c0315d0 | 2181 | } |
2182 | } | |
2183 | ||
2184 | /* Construct a memory load in a transactional context. Return the | |
2185 | gimple statement performing the load, or NULL if there is no | |
2186 | TM_LOAD builtin of the appropriate size to do the load. | |
2187 | ||
2188 | LOC is the location to use for the new statement(s). */ | |
2189 | ||
1a91d914 | 2190 | static gcall * |
4c0315d0 | 2191 | build_tm_load (location_t loc, tree lhs, tree rhs, gimple_stmt_iterator *gsi) |
2192 | { | |
e5fee0fe | 2193 | tree t, type = TREE_TYPE (rhs); |
1a91d914 | 2194 | gcall *gcall; |
4c0315d0 | 2195 | |
e5fee0fe | 2196 | built_in_function code; |
4c0315d0 | 2197 | if (type == float_type_node) |
2198 | code = BUILT_IN_TM_LOAD_FLOAT; | |
2199 | else if (type == double_type_node) | |
2200 | code = BUILT_IN_TM_LOAD_DOUBLE; | |
2201 | else if (type == long_double_type_node) | |
2202 | code = BUILT_IN_TM_LOAD_LDOUBLE; | |
e5fee0fe | 2203 | else |
4c0315d0 | 2204 | { |
e5fee0fe | 2205 | if (TYPE_SIZE (type) == NULL || !tree_fits_uhwi_p (TYPE_SIZE (type))) |
2206 | return NULL; | |
2207 | unsigned HOST_WIDE_INT type_size = tree_to_uhwi (TYPE_SIZE (type)); | |
2208 | ||
2209 | if (TREE_CODE (type) == VECTOR_TYPE) | |
4c0315d0 | 2210 | { |
e5fee0fe | 2211 | switch (type_size) |
2212 | { | |
2213 | case 64: | |
2214 | code = BUILT_IN_TM_LOAD_M64; | |
2215 | break; | |
2216 | case 128: | |
2217 | code = BUILT_IN_TM_LOAD_M128; | |
2218 | break; | |
2219 | case 256: | |
2220 | code = BUILT_IN_TM_LOAD_M256; | |
2221 | break; | |
2222 | default: | |
2223 | goto unhandled_vec; | |
2224 | } | |
2225 | if (!builtin_decl_explicit_p (code)) | |
2226 | goto unhandled_vec; | |
2227 | } | |
2228 | else | |
2229 | { | |
2230 | unhandled_vec: | |
2231 | switch (type_size) | |
2232 | { | |
2233 | case 8: | |
2234 | code = BUILT_IN_TM_LOAD_1; | |
2235 | break; | |
2236 | case 16: | |
2237 | code = BUILT_IN_TM_LOAD_2; | |
2238 | break; | |
2239 | case 32: | |
2240 | code = BUILT_IN_TM_LOAD_4; | |
2241 | break; | |
2242 | case 64: | |
2243 | code = BUILT_IN_TM_LOAD_8; | |
2244 | break; | |
2245 | default: | |
2246 | return NULL; | |
2247 | } | |
4c0315d0 | 2248 | } |
2249 | } | |
2250 | ||
e5fee0fe | 2251 | tree decl = builtin_decl_explicit (code); |
2252 | gcc_assert (decl); | |
4c0315d0 | 2253 | |
2254 | t = gimplify_addr (gsi, rhs); | |
2255 | gcall = gimple_build_call (decl, 1, t); | |
2256 | gimple_set_location (gcall, loc); | |
2257 | ||
2258 | t = TREE_TYPE (TREE_TYPE (decl)); | |
2259 | if (useless_type_conversion_p (type, t)) | |
2260 | { | |
2261 | gimple_call_set_lhs (gcall, lhs); | |
2262 | gsi_insert_before (gsi, gcall, GSI_SAME_STMT); | |
2263 | } | |
2264 | else | |
2265 | { | |
42acab1c | 2266 | gimple *g; |
4c0315d0 | 2267 | tree temp; |
2268 | ||
f9e245b2 | 2269 | temp = create_tmp_reg (t); |
4c0315d0 | 2270 | gimple_call_set_lhs (gcall, temp); |
2271 | gsi_insert_before (gsi, gcall, GSI_SAME_STMT); | |
2272 | ||
2273 | t = fold_build1 (VIEW_CONVERT_EXPR, type, temp); | |
2274 | g = gimple_build_assign (lhs, t); | |
2275 | gsi_insert_before (gsi, g, GSI_SAME_STMT); | |
2276 | } | |
2277 | ||
2278 | return gcall; | |
2279 | } | |
2280 | ||
2281 | ||
2282 | /* Similarly for storing TYPE in a transactional context. */ | |
2283 | ||
1a91d914 | 2284 | static gcall * |
4c0315d0 | 2285 | build_tm_store (location_t loc, tree lhs, tree rhs, gimple_stmt_iterator *gsi) |
2286 | { | |
4c0315d0 | 2287 | tree t, fn, type = TREE_TYPE (rhs), simple_type; |
1a91d914 | 2288 | gcall *gcall; |
4c0315d0 | 2289 | |
e5fee0fe | 2290 | built_in_function code; |
4c0315d0 | 2291 | if (type == float_type_node) |
2292 | code = BUILT_IN_TM_STORE_FLOAT; | |
2293 | else if (type == double_type_node) | |
2294 | code = BUILT_IN_TM_STORE_DOUBLE; | |
2295 | else if (type == long_double_type_node) | |
2296 | code = BUILT_IN_TM_STORE_LDOUBLE; | |
e5fee0fe | 2297 | else |
4c0315d0 | 2298 | { |
e5fee0fe | 2299 | if (TYPE_SIZE (type) == NULL || !tree_fits_uhwi_p (TYPE_SIZE (type))) |
2300 | return NULL; | |
2301 | unsigned HOST_WIDE_INT type_size = tree_to_uhwi (TYPE_SIZE (type)); | |
2302 | ||
2303 | if (TREE_CODE (type) == VECTOR_TYPE) | |
4c0315d0 | 2304 | { |
e5fee0fe | 2305 | switch (type_size) |
2306 | { | |
2307 | case 64: | |
2308 | code = BUILT_IN_TM_STORE_M64; | |
2309 | break; | |
2310 | case 128: | |
2311 | code = BUILT_IN_TM_STORE_M128; | |
2312 | break; | |
2313 | case 256: | |
2314 | code = BUILT_IN_TM_STORE_M256; | |
2315 | break; | |
2316 | default: | |
2317 | goto unhandled_vec; | |
2318 | } | |
2319 | if (!builtin_decl_explicit_p (code)) | |
2320 | goto unhandled_vec; | |
2321 | } | |
2322 | else | |
2323 | { | |
2324 | unhandled_vec: | |
2325 | switch (type_size) | |
2326 | { | |
2327 | case 8: | |
2328 | code = BUILT_IN_TM_STORE_1; | |
2329 | break; | |
2330 | case 16: | |
2331 | code = BUILT_IN_TM_STORE_2; | |
2332 | break; | |
2333 | case 32: | |
2334 | code = BUILT_IN_TM_STORE_4; | |
2335 | break; | |
2336 | case 64: | |
2337 | code = BUILT_IN_TM_STORE_8; | |
2338 | break; | |
2339 | default: | |
2340 | return NULL; | |
2341 | } | |
4c0315d0 | 2342 | } |
2343 | } | |
2344 | ||
e5fee0fe | 2345 | fn = builtin_decl_explicit (code); |
2346 | gcc_assert (fn); | |
4c0315d0 | 2347 | |
2348 | simple_type = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn)))); | |
2349 | ||
2350 | if (TREE_CODE (rhs) == CONSTRUCTOR) | |
2351 | { | |
2352 | /* Handle the easy initialization to zero. */ | |
f1f41a6c | 2353 | if (!CONSTRUCTOR_ELTS (rhs)) |
4c0315d0 | 2354 | rhs = build_int_cst (simple_type, 0); |
2355 | else | |
2356 | { | |
2357 | /* ...otherwise punt to the caller and probably use | |
2358 | BUILT_IN_TM_MEMMOVE, because we can't wrap a | |
2359 | VIEW_CONVERT_EXPR around a CONSTRUCTOR (below) and produce | |
2360 | valid gimple. */ | |
2361 | return NULL; | |
2362 | } | |
2363 | } | |
2364 | else if (!useless_type_conversion_p (simple_type, type)) | |
2365 | { | |
42acab1c | 2366 | gimple *g; |
4c0315d0 | 2367 | tree temp; |
2368 | ||
f9e245b2 | 2369 | temp = create_tmp_reg (simple_type); |
4c0315d0 | 2370 | t = fold_build1 (VIEW_CONVERT_EXPR, simple_type, rhs); |
2371 | g = gimple_build_assign (temp, t); | |
2372 | gimple_set_location (g, loc); | |
2373 | gsi_insert_before (gsi, g, GSI_SAME_STMT); | |
2374 | ||
2375 | rhs = temp; | |
2376 | } | |
2377 | ||
2378 | t = gimplify_addr (gsi, lhs); | |
2379 | gcall = gimple_build_call (fn, 2, t, rhs); | |
2380 | gimple_set_location (gcall, loc); | |
2381 | gsi_insert_before (gsi, gcall, GSI_SAME_STMT); | |
2382 | ||
2383 | return gcall; | |
2384 | } | |
2385 | ||
2386 | ||
2387 | /* Expand an assignment statement into transactional builtins. */ | |
2388 | ||
2389 | static void | |
2390 | expand_assign_tm (struct tm_region *region, gimple_stmt_iterator *gsi) | |
2391 | { | |
42acab1c | 2392 | gimple *stmt = gsi_stmt (*gsi); |
4c0315d0 | 2393 | location_t loc = gimple_location (stmt); |
2394 | tree lhs = gimple_assign_lhs (stmt); | |
2395 | tree rhs = gimple_assign_rhs1 (stmt); | |
2396 | bool store_p = requires_barrier (region->entry_block, lhs, NULL); | |
2397 | bool load_p = requires_barrier (region->entry_block, rhs, NULL); | |
42acab1c | 2398 | gimple *gcall = NULL; |
4c0315d0 | 2399 | |
2400 | if (!load_p && !store_p) | |
2401 | { | |
2402 | /* Add thread private addresses to log if applicable. */ | |
2403 | requires_barrier (region->entry_block, lhs, stmt); | |
2404 | gsi_next (gsi); | |
2405 | return; | |
2406 | } | |
2407 | ||
e5fee0fe | 2408 | if (load_p) |
2409 | transaction_subcode_ior (region, GTMA_HAVE_LOAD); | |
2410 | if (store_p) | |
2411 | transaction_subcode_ior (region, GTMA_HAVE_STORE); | |
2412 | ||
0cd02a19 | 2413 | // Remove original load/store statement. |
4c0315d0 | 2414 | gsi_remove (gsi, true); |
2415 | ||
e5fee0fe | 2416 | // Attempt to use a simple load/store helper function. |
4c0315d0 | 2417 | if (load_p && !store_p) |
e5fee0fe | 2418 | gcall = build_tm_load (loc, lhs, rhs, gsi); |
4c0315d0 | 2419 | else if (store_p && !load_p) |
e5fee0fe | 2420 | gcall = build_tm_store (loc, lhs, rhs, gsi); |
2421 | ||
2422 | // If gcall has not been set, then we do not have a simple helper | |
2423 | // function available for the type. This may be true of larger | |
2424 | // structures, vectors, and non-standard float types. | |
4c0315d0 | 2425 | if (!gcall) |
2426 | { | |
e5fee0fe | 2427 | tree lhs_addr, rhs_addr, ltmp = NULL, copy_fn; |
4c0315d0 | 2428 | |
e5fee0fe | 2429 | // If this is a type that we couldn't handle above, but it's |
2430 | // in a register, we must spill it to memory for the copy. | |
2431 | if (is_gimple_reg (lhs)) | |
2432 | { | |
2433 | ltmp = create_tmp_var (TREE_TYPE (lhs)); | |
2434 | lhs_addr = build_fold_addr_expr (ltmp); | |
2435 | } | |
2436 | else | |
2437 | lhs_addr = gimplify_addr (gsi, lhs); | |
2438 | if (is_gimple_reg (rhs)) | |
2439 | { | |
2440 | tree rtmp = create_tmp_var (TREE_TYPE (rhs)); | |
2441 | rhs_addr = build_fold_addr_expr (rtmp); | |
2442 | gcall = gimple_build_assign (rtmp, rhs); | |
2443 | gsi_insert_before (gsi, gcall, GSI_SAME_STMT); | |
2444 | } | |
2445 | else | |
2446 | rhs_addr = gimplify_addr (gsi, rhs); | |
ea580cf7 | 2447 | |
e5fee0fe | 2448 | // Choose the appropriate memory transfer function. |
2449 | if (load_p && store_p) | |
ea580cf7 | 2450 | { |
e5fee0fe | 2451 | // ??? Figure out if there's any possible overlap between |
2452 | // the LHS and the RHS and if not, use MEMCPY. | |
2453 | copy_fn = builtin_decl_explicit (BUILT_IN_TM_MEMMOVE); | |
2454 | } | |
2455 | else if (load_p) | |
2456 | { | |
2457 | // Note that the store is non-transactional and cannot overlap. | |
2458 | copy_fn = builtin_decl_explicit (BUILT_IN_TM_MEMCPY_RTWN); | |
ea580cf7 | 2459 | } |
2460 | else | |
2461 | { | |
e5fee0fe | 2462 | // Note that the load is non-transactional and cannot overlap. |
2463 | copy_fn = builtin_decl_explicit (BUILT_IN_TM_MEMCPY_RNWT); | |
ea580cf7 | 2464 | } |
e5fee0fe | 2465 | |
2466 | gcall = gimple_build_call (copy_fn, 3, lhs_addr, rhs_addr, | |
4c0315d0 | 2467 | TYPE_SIZE_UNIT (TREE_TYPE (lhs))); |
2468 | gimple_set_location (gcall, loc); | |
2469 | gsi_insert_before (gsi, gcall, GSI_SAME_STMT); | |
ea580cf7 | 2470 | |
e5fee0fe | 2471 | if (ltmp) |
ea580cf7 | 2472 | { |
e5fee0fe | 2473 | gcall = gimple_build_assign (lhs, ltmp); |
ea580cf7 | 2474 | gsi_insert_before (gsi, gcall, GSI_SAME_STMT); |
2475 | } | |
4c0315d0 | 2476 | } |
2477 | ||
e5fee0fe | 2478 | // Now that we have the load/store in its instrumented form, add |
2479 | // thread private addresses to the log if applicable. | |
4c0315d0 | 2480 | if (!store_p) |
2481 | requires_barrier (region->entry_block, lhs, gcall); | |
4c0315d0 | 2482 | } |
2483 | ||
2484 | ||
2485 | /* Expand a call statement as appropriate for a transaction. That is, | |
2486 | either verify that the call does not affect the transaction, or | |
2487 | redirect the call to a clone that handles transactions, or change | |
2488 | the transaction state to IRREVOCABLE. Return true if the call is | |
2489 | one of the builtins that end a transaction. */ | |
2490 | ||
2491 | static bool | |
2492 | expand_call_tm (struct tm_region *region, | |
2493 | gimple_stmt_iterator *gsi) | |
2494 | { | |
1a91d914 | 2495 | gcall *stmt = as_a <gcall *> (gsi_stmt (*gsi)); |
4c0315d0 | 2496 | tree lhs = gimple_call_lhs (stmt); |
2497 | tree fn_decl; | |
2498 | struct cgraph_node *node; | |
2499 | bool retval = false; | |
2500 | ||
2501 | fn_decl = gimple_call_fndecl (stmt); | |
2502 | ||
2503 | if (fn_decl == builtin_decl_explicit (BUILT_IN_TM_MEMCPY) | |
2504 | || fn_decl == builtin_decl_explicit (BUILT_IN_TM_MEMMOVE)) | |
2505 | transaction_subcode_ior (region, GTMA_HAVE_STORE | GTMA_HAVE_LOAD); | |
2506 | if (fn_decl == builtin_decl_explicit (BUILT_IN_TM_MEMSET)) | |
2507 | transaction_subcode_ior (region, GTMA_HAVE_STORE); | |
2508 | ||
2509 | if (is_tm_pure_call (stmt)) | |
2510 | return false; | |
2511 | ||
2512 | if (fn_decl) | |
2513 | retval = is_tm_ending_fndecl (fn_decl); | |
2514 | if (!retval) | |
2515 | { | |
2516 | /* Assume all non-const/pure calls write to memory, except | |
2517 | transaction ending builtins. */ | |
2518 | transaction_subcode_ior (region, GTMA_HAVE_STORE); | |
2519 | } | |
2520 | ||
2521 | /* For indirect calls, we already generated a call into the runtime. */ | |
2522 | if (!fn_decl) | |
2523 | { | |
2524 | tree fn = gimple_call_fn (stmt); | |
2525 | ||
2526 | /* We are guaranteed never to go irrevocable on a safe or pure | |
2527 | call, and the pure call was handled above. */ | |
2528 | if (is_tm_safe (fn)) | |
2529 | return false; | |
2530 | else | |
2531 | transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE); | |
2532 | ||
2533 | return false; | |
2534 | } | |
2535 | ||
415d1b9a | 2536 | node = cgraph_node::get (fn_decl); |
fce5ce8e | 2537 | /* All calls should have cgraph here. */ |
2538 | if (!node) | |
2539 | { | |
2540 | /* We can have a nodeless call here if some pass after IPA-tm | |
2541 | added uninstrumented calls. For example, loop distribution | |
2542 | can transform certain loop constructs into __builtin_mem* | |
2543 | calls. In this case, see if we have a suitable TM | |
2544 | replacement and fill in the gaps. */ | |
2545 | gcc_assert (DECL_BUILT_IN_CLASS (fn_decl) == BUILT_IN_NORMAL); | |
2546 | enum built_in_function code = DECL_FUNCTION_CODE (fn_decl); | |
2547 | gcc_assert (code == BUILT_IN_MEMCPY | |
2548 | || code == BUILT_IN_MEMMOVE | |
2549 | || code == BUILT_IN_MEMSET); | |
2550 | ||
2551 | tree repl = find_tm_replacement_function (fn_decl); | |
2552 | if (repl) | |
2553 | { | |
2554 | gimple_call_set_fndecl (stmt, repl); | |
2555 | update_stmt (stmt); | |
415d1b9a | 2556 | node = cgraph_node::create (repl); |
fce5ce8e | 2557 | node->local.tm_may_enter_irr = false; |
2558 | return expand_call_tm (region, gsi); | |
2559 | } | |
2560 | gcc_unreachable (); | |
2561 | } | |
4c0315d0 | 2562 | if (node->local.tm_may_enter_irr) |
2563 | transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE); | |
2564 | ||
2565 | if (is_tm_abort (fn_decl)) | |
2566 | { | |
2567 | transaction_subcode_ior (region, GTMA_HAVE_ABORT); | |
2568 | return true; | |
2569 | } | |
2570 | ||
2571 | /* Instrument the store if needed. | |
2572 | ||
2573 | If the assignment happens inside the function call (return slot | |
2574 | optimization), there is no instrumentation to be done, since | |
2575 | the callee should have done the right thing. */ | |
2576 | if (lhs && requires_barrier (region->entry_block, lhs, stmt) | |
2577 | && !gimple_call_return_slot_opt_p (stmt)) | |
2578 | { | |
f9e245b2 | 2579 | tree tmp = create_tmp_reg (TREE_TYPE (lhs)); |
4c0315d0 | 2580 | location_t loc = gimple_location (stmt); |
2581 | edge fallthru_edge = NULL; | |
1a91d914 | 2582 | gassign *assign_stmt; |
4c0315d0 | 2583 | |
2584 | /* Remember if the call was going to throw. */ | |
2585 | if (stmt_can_throw_internal (stmt)) | |
2586 | { | |
2587 | edge_iterator ei; | |
2588 | edge e; | |
2589 | basic_block bb = gimple_bb (stmt); | |
2590 | ||
2591 | FOR_EACH_EDGE (e, ei, bb->succs) | |
2592 | if (e->flags & EDGE_FALLTHRU) | |
2593 | { | |
2594 | fallthru_edge = e; | |
2595 | break; | |
2596 | } | |
2597 | } | |
2598 | ||
2599 | gimple_call_set_lhs (stmt, tmp); | |
2600 | update_stmt (stmt); | |
1a91d914 | 2601 | assign_stmt = gimple_build_assign (lhs, tmp); |
2602 | gimple_set_location (assign_stmt, loc); | |
4c0315d0 | 2603 | |
2604 | /* We cannot throw in the middle of a BB. If the call was going | |
2605 | to throw, place the instrumentation on the fallthru edge, so | |
2606 | the call remains the last statement in the block. */ | |
2607 | if (fallthru_edge) | |
2608 | { | |
1a91d914 | 2609 | gimple_seq fallthru_seq = gimple_seq_alloc_with_stmt (assign_stmt); |
4c0315d0 | 2610 | gimple_stmt_iterator fallthru_gsi = gsi_start (fallthru_seq); |
2611 | expand_assign_tm (region, &fallthru_gsi); | |
2612 | gsi_insert_seq_on_edge (fallthru_edge, fallthru_seq); | |
2613 | pending_edge_inserts_p = true; | |
2614 | } | |
2615 | else | |
2616 | { | |
1a91d914 | 2617 | gsi_insert_after (gsi, assign_stmt, GSI_CONTINUE_LINKING); |
4c0315d0 | 2618 | expand_assign_tm (region, gsi); |
2619 | } | |
2620 | ||
2621 | transaction_subcode_ior (region, GTMA_HAVE_STORE); | |
2622 | } | |
2623 | ||
2624 | return retval; | |
2625 | } | |
2626 | ||
2627 | ||
2628 | /* Expand all statements in BB as appropriate for being inside | |
2629 | a transaction. */ | |
2630 | ||
2631 | static void | |
2632 | expand_block_tm (struct tm_region *region, basic_block bb) | |
2633 | { | |
2634 | gimple_stmt_iterator gsi; | |
2635 | ||
2636 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); ) | |
2637 | { | |
42acab1c | 2638 | gimple *stmt = gsi_stmt (gsi); |
4c0315d0 | 2639 | switch (gimple_code (stmt)) |
2640 | { | |
2641 | case GIMPLE_ASSIGN: | |
2642 | /* Only memory reads/writes need to be instrumented. */ | |
73fd1e9a | 2643 | if (gimple_assign_single_p (stmt) |
2644 | && !gimple_clobber_p (stmt)) | |
4c0315d0 | 2645 | { |
2646 | expand_assign_tm (region, &gsi); | |
2647 | continue; | |
2648 | } | |
2649 | break; | |
2650 | ||
2651 | case GIMPLE_CALL: | |
2652 | if (expand_call_tm (region, &gsi)) | |
2653 | return; | |
2654 | break; | |
2655 | ||
2656 | case GIMPLE_ASM: | |
2657 | gcc_unreachable (); | |
2658 | ||
2659 | default: | |
2660 | break; | |
2661 | } | |
2662 | if (!gsi_end_p (gsi)) | |
2663 | gsi_next (&gsi); | |
2664 | } | |
2665 | } | |
2666 | ||
2667 | /* Return the list of basic-blocks in REGION. | |
2668 | ||
2669 | STOP_AT_IRREVOCABLE_P is true if caller is uninterested in blocks | |
79f4a793 | 2670 | following a TM_IRREVOCABLE call. |
2671 | ||
2672 | INCLUDE_UNINSTRUMENTED_P is TRUE if we should include the | |
2673 | uninstrumented code path blocks in the list of basic blocks | |
2674 | returned, false otherwise. */ | |
4c0315d0 | 2675 | |
f1f41a6c | 2676 | static vec<basic_block> |
4c0315d0 | 2677 | get_tm_region_blocks (basic_block entry_block, |
2678 | bitmap exit_blocks, | |
2679 | bitmap irr_blocks, | |
2680 | bitmap all_region_blocks, | |
79f4a793 | 2681 | bool stop_at_irrevocable_p, |
2682 | bool include_uninstrumented_p = true) | |
4c0315d0 | 2683 | { |
1e094109 | 2684 | vec<basic_block> bbs = vNULL; |
4c0315d0 | 2685 | unsigned i; |
2686 | edge e; | |
2687 | edge_iterator ei; | |
2688 | bitmap visited_blocks = BITMAP_ALLOC (NULL); | |
2689 | ||
2690 | i = 0; | |
f1f41a6c | 2691 | bbs.safe_push (entry_block); |
4c0315d0 | 2692 | bitmap_set_bit (visited_blocks, entry_block->index); |
2693 | ||
2694 | do | |
2695 | { | |
f1f41a6c | 2696 | basic_block bb = bbs[i++]; |
4c0315d0 | 2697 | |
2698 | if (exit_blocks && | |
2699 | bitmap_bit_p (exit_blocks, bb->index)) | |
2700 | continue; | |
2701 | ||
2702 | if (stop_at_irrevocable_p | |
2703 | && irr_blocks | |
2704 | && bitmap_bit_p (irr_blocks, bb->index)) | |
2705 | continue; | |
2706 | ||
2707 | FOR_EACH_EDGE (e, ei, bb->succs) | |
79f4a793 | 2708 | if ((include_uninstrumented_p |
2709 | || !(e->flags & EDGE_TM_UNINSTRUMENTED)) | |
2710 | && !bitmap_bit_p (visited_blocks, e->dest->index)) | |
4c0315d0 | 2711 | { |
2712 | bitmap_set_bit (visited_blocks, e->dest->index); | |
f1f41a6c | 2713 | bbs.safe_push (e->dest); |
4c0315d0 | 2714 | } |
2715 | } | |
f1f41a6c | 2716 | while (i < bbs.length ()); |
4c0315d0 | 2717 | |
2718 | if (all_region_blocks) | |
2719 | bitmap_ior_into (all_region_blocks, visited_blocks); | |
2720 | ||
2721 | BITMAP_FREE (visited_blocks); | |
2722 | return bbs; | |
2723 | } | |
2724 | ||
79f4a793 | 2725 | // Callback data for collect_bb2reg. |
2726 | struct bb2reg_stuff | |
2727 | { | |
04009ada | 2728 | vec<tm_region *> *bb2reg; |
79f4a793 | 2729 | bool include_uninstrumented_p; |
2730 | }; | |
2731 | ||
0cd02a19 | 2732 | // Callback for expand_regions, collect innermost region data for each bb. |
2733 | static void * | |
2734 | collect_bb2reg (struct tm_region *region, void *data) | |
2735 | { | |
79f4a793 | 2736 | struct bb2reg_stuff *stuff = (struct bb2reg_stuff *)data; |
04009ada | 2737 | vec<tm_region *> *bb2reg = stuff->bb2reg; |
f1f41a6c | 2738 | vec<basic_block> queue; |
0cd02a19 | 2739 | unsigned int i; |
2740 | basic_block bb; | |
2741 | ||
2742 | queue = get_tm_region_blocks (region->entry_block, | |
2743 | region->exit_blocks, | |
2744 | region->irr_blocks, | |
2745 | NULL, | |
79f4a793 | 2746 | /*stop_at_irr_p=*/true, |
2747 | stuff->include_uninstrumented_p); | |
0cd02a19 | 2748 | |
2749 | // We expect expand_region to perform a post-order traversal of the region | |
2750 | // tree. Therefore the last region seen for any bb is the innermost. | |
f1f41a6c | 2751 | FOR_EACH_VEC_ELT (queue, i, bb) |
2752 | (*bb2reg)[bb->index] = region; | |
0cd02a19 | 2753 | |
f1f41a6c | 2754 | queue.release (); |
0cd02a19 | 2755 | return NULL; |
2756 | } | |
2757 | ||
2758 | // Returns a vector, indexed by BB->INDEX, of the innermost tm_region to | |
2759 | // which a basic block belongs. Note that we only consider the instrumented | |
79f4a793 | 2760 | // code paths for the region; the uninstrumented code paths are ignored if |
2761 | // INCLUDE_UNINSTRUMENTED_P is false. | |
0cd02a19 | 2762 | // |
2763 | // ??? This data is very similar to the bb_regions array that is collected | |
2764 | // during tm_region_init. Or, rather, this data is similar to what could | |
2765 | // be used within tm_region_init. The actual computation in tm_region_init | |
2766 | // begins and ends with bb_regions entirely full of NULL pointers, due to | |
2767 | // the way in which pointers are swapped in and out of the array. | |
2768 | // | |
2769 | // ??? Our callers expect that blocks are not shared between transactions. | |
2770 | // When the optimizers get too smart, and blocks are shared, then during | |
2771 | // the tm_mark phase we'll add log entries to only one of the two transactions, | |
2772 | // and in the tm_edge phase we'll add edges to the CFG that create invalid | |
2773 | // cycles. The symptom being SSA defs that do not dominate their uses. | |
2774 | // Note that the optimizers were locally correct with their transformation, | |
2775 | // as we have no info within the program that suggests that the blocks cannot | |
2776 | // be shared. | |
2777 | // | |
2778 | // ??? There is currently a hack inside tree-ssa-pre.c to work around the | |
2779 | // only known instance of this block sharing. | |
2780 | ||
04009ada | 2781 | static vec<tm_region *> |
79f4a793 | 2782 | get_bb_regions_instrumented (bool traverse_clones, |
2783 | bool include_uninstrumented_p) | |
0cd02a19 | 2784 | { |
fe672ac0 | 2785 | unsigned n = last_basic_block_for_fn (cfun); |
79f4a793 | 2786 | struct bb2reg_stuff stuff; |
04009ada | 2787 | vec<tm_region *> ret; |
0cd02a19 | 2788 | |
f1f41a6c | 2789 | ret.create (n); |
2790 | ret.safe_grow_cleared (n); | |
79f4a793 | 2791 | stuff.bb2reg = &ret; |
2792 | stuff.include_uninstrumented_p = include_uninstrumented_p; | |
2793 | expand_regions (all_tm_regions, collect_bb2reg, &stuff, traverse_clones); | |
0cd02a19 | 2794 | |
2795 | return ret; | |
2796 | } | |
2797 | ||
de60f90c | 2798 | /* Set the IN_TRANSACTION for all gimple statements that appear in a |
2799 | transaction. */ | |
2800 | ||
2801 | void | |
2802 | compute_transaction_bits (void) | |
2803 | { | |
2804 | struct tm_region *region; | |
f1f41a6c | 2805 | vec<basic_block> queue; |
de60f90c | 2806 | unsigned int i; |
de60f90c | 2807 | basic_block bb; |
2808 | ||
2809 | /* ?? Perhaps we need to abstract gate_tm_init further, because we | |
2810 | certainly don't need it to calculate CDI_DOMINATOR info. */ | |
2811 | gate_tm_init (); | |
2812 | ||
fc00614f | 2813 | FOR_EACH_BB_FN (bb, cfun) |
6ad451f8 | 2814 | bb->flags &= ~BB_IN_TRANSACTION; |
2815 | ||
de60f90c | 2816 | for (region = all_tm_regions; region; region = region->next) |
2817 | { | |
2818 | queue = get_tm_region_blocks (region->entry_block, | |
2819 | region->exit_blocks, | |
2820 | region->irr_blocks, | |
2821 | NULL, | |
2822 | /*stop_at_irr_p=*/true); | |
f1f41a6c | 2823 | for (i = 0; queue.iterate (i, &bb); ++i) |
6ad451f8 | 2824 | bb->flags |= BB_IN_TRANSACTION; |
f1f41a6c | 2825 | queue.release (); |
de60f90c | 2826 | } |
2827 | ||
2828 | if (all_tm_regions) | |
2829 | bitmap_obstack_release (&tm_obstack); | |
2830 | } | |
2831 | ||
0cd02a19 | 2832 | /* Replace the GIMPLE_TRANSACTION in this region with the corresponding |
2833 | call to BUILT_IN_TM_START. */ | |
2834 | ||
2835 | static void * | |
2836 | expand_transaction (struct tm_region *region, void *data ATTRIBUTE_UNUSED) | |
2837 | { | |
2838 | tree tm_start = builtin_decl_explicit (BUILT_IN_TM_START); | |
2839 | basic_block transaction_bb = gimple_bb (region->transaction_stmt); | |
2840 | tree tm_state = region->tm_state; | |
2841 | tree tm_state_type = TREE_TYPE (tm_state); | |
2842 | edge abort_edge = NULL; | |
2843 | edge inst_edge = NULL; | |
2844 | edge uninst_edge = NULL; | |
2845 | edge fallthru_edge = NULL; | |
2846 | ||
2847 | // Identify the various successors of the transaction start. | |
2848 | { | |
2849 | edge_iterator i; | |
2850 | edge e; | |
2851 | FOR_EACH_EDGE (e, i, transaction_bb->succs) | |
2852 | { | |
2853 | if (e->flags & EDGE_TM_ABORT) | |
2854 | abort_edge = e; | |
2855 | else if (e->flags & EDGE_TM_UNINSTRUMENTED) | |
2856 | uninst_edge = e; | |
2857 | else | |
2858 | inst_edge = e; | |
2859 | if (e->flags & EDGE_FALLTHRU) | |
2860 | fallthru_edge = e; | |
2861 | } | |
2862 | } | |
2863 | ||
2864 | /* ??? There are plenty of bits here we're not computing. */ | |
2865 | { | |
1a91d914 | 2866 | int subcode = gimple_transaction_subcode (region->get_transaction_stmt ()); |
0cd02a19 | 2867 | int flags = 0; |
2868 | if (subcode & GTMA_DOES_GO_IRREVOCABLE) | |
2869 | flags |= PR_DOESGOIRREVOCABLE; | |
2870 | if ((subcode & GTMA_MAY_ENTER_IRREVOCABLE) == 0) | |
2871 | flags |= PR_HASNOIRREVOCABLE; | |
2872 | /* If the transaction does not have an abort in lexical scope and is not | |
2873 | marked as an outer transaction, then it will never abort. */ | |
2874 | if ((subcode & GTMA_HAVE_ABORT) == 0 && (subcode & GTMA_IS_OUTER) == 0) | |
2875 | flags |= PR_HASNOABORT; | |
2876 | if ((subcode & GTMA_HAVE_STORE) == 0) | |
2877 | flags |= PR_READONLY; | |
1910089e | 2878 | if (inst_edge && !(subcode & GTMA_HAS_NO_INSTRUMENTATION)) |
0cd02a19 | 2879 | flags |= PR_INSTRUMENTEDCODE; |
2880 | if (uninst_edge) | |
2881 | flags |= PR_UNINSTRUMENTEDCODE; | |
2882 | if (subcode & GTMA_IS_OUTER) | |
2883 | region->original_transaction_was_outer = true; | |
2884 | tree t = build_int_cst (tm_state_type, flags); | |
1a91d914 | 2885 | gcall *call = gimple_build_call (tm_start, 1, t); |
0cd02a19 | 2886 | gimple_call_set_lhs (call, tm_state); |
2887 | gimple_set_location (call, gimple_location (region->transaction_stmt)); | |
2888 | ||
2889 | // Replace the GIMPLE_TRANSACTION with the call to BUILT_IN_TM_START. | |
2890 | gimple_stmt_iterator gsi = gsi_last_bb (transaction_bb); | |
2891 | gcc_assert (gsi_stmt (gsi) == region->transaction_stmt); | |
2892 | gsi_insert_before (&gsi, call, GSI_SAME_STMT); | |
2893 | gsi_remove (&gsi, true); | |
2894 | region->transaction_stmt = call; | |
2895 | } | |
2896 | ||
2897 | // Generate log saves. | |
f1f41a6c | 2898 | if (!tm_log_save_addresses.is_empty ()) |
0cd02a19 | 2899 | tm_log_emit_saves (region->entry_block, transaction_bb); |
2900 | ||
2901 | // In the beginning, we've no tests to perform on transaction restart. | |
2902 | // Note that after this point, transaction_bb becomes the "most recent | |
2903 | // block containing tests for the transaction". | |
2904 | region->restart_block = region->entry_block; | |
2905 | ||
2906 | // Generate log restores. | |
f1f41a6c | 2907 | if (!tm_log_save_addresses.is_empty ()) |
0cd02a19 | 2908 | { |
2909 | basic_block test_bb = create_empty_bb (transaction_bb); | |
2910 | basic_block code_bb = create_empty_bb (test_bb); | |
2911 | basic_block join_bb = create_empty_bb (code_bb); | |
b3083327 | 2912 | add_bb_to_loop (test_bb, transaction_bb->loop_father); |
2913 | add_bb_to_loop (code_bb, transaction_bb->loop_father); | |
2914 | add_bb_to_loop (join_bb, transaction_bb->loop_father); | |
0cd02a19 | 2915 | if (region->restart_block == region->entry_block) |
2916 | region->restart_block = test_bb; | |
2917 | ||
f9e245b2 | 2918 | tree t1 = create_tmp_reg (tm_state_type); |
0cd02a19 | 2919 | tree t2 = build_int_cst (tm_state_type, A_RESTORELIVEVARIABLES); |
42acab1c | 2920 | gimple *stmt = gimple_build_assign (t1, BIT_AND_EXPR, tm_state, t2); |
0cd02a19 | 2921 | gimple_stmt_iterator gsi = gsi_last_bb (test_bb); |
2922 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
2923 | ||
2924 | t2 = build_int_cst (tm_state_type, 0); | |
2925 | stmt = gimple_build_cond (NE_EXPR, t1, t2, NULL, NULL); | |
2926 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
2927 | ||
2928 | tm_log_emit_restores (region->entry_block, code_bb); | |
2929 | ||
2930 | edge ei = make_edge (transaction_bb, test_bb, EDGE_FALLTHRU); | |
2931 | edge et = make_edge (test_bb, code_bb, EDGE_TRUE_VALUE); | |
2932 | edge ef = make_edge (test_bb, join_bb, EDGE_FALSE_VALUE); | |
2933 | redirect_edge_pred (fallthru_edge, join_bb); | |
2934 | ||
2935 | join_bb->frequency = test_bb->frequency = transaction_bb->frequency; | |
2936 | join_bb->count = test_bb->count = transaction_bb->count; | |
2937 | ||
720cfc43 | 2938 | ei->probability = profile_probability::always (); |
2939 | et->probability = profile_probability::likely (); | |
2940 | ef->probability = profile_probability::unlikely (); | |
0cd02a19 | 2941 | |
ea5d3981 | 2942 | code_bb->count = et->count (); |
0cd02a19 | 2943 | code_bb->frequency = EDGE_FREQUENCY (et); |
2944 | ||
2945 | transaction_bb = join_bb; | |
2946 | } | |
2947 | ||
2948 | // If we have an ABORT edge, create a test to perform the abort. | |
2949 | if (abort_edge) | |
2950 | { | |
2951 | basic_block test_bb = create_empty_bb (transaction_bb); | |
b3083327 | 2952 | add_bb_to_loop (test_bb, transaction_bb->loop_father); |
0cd02a19 | 2953 | if (region->restart_block == region->entry_block) |
2954 | region->restart_block = test_bb; | |
2955 | ||
f9e245b2 | 2956 | tree t1 = create_tmp_reg (tm_state_type); |
0cd02a19 | 2957 | tree t2 = build_int_cst (tm_state_type, A_ABORTTRANSACTION); |
42acab1c | 2958 | gimple *stmt = gimple_build_assign (t1, BIT_AND_EXPR, tm_state, t2); |
0cd02a19 | 2959 | gimple_stmt_iterator gsi = gsi_last_bb (test_bb); |
2960 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
2961 | ||
2962 | t2 = build_int_cst (tm_state_type, 0); | |
2963 | stmt = gimple_build_cond (NE_EXPR, t1, t2, NULL, NULL); | |
2964 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
2965 | ||
2966 | edge ei = make_edge (transaction_bb, test_bb, EDGE_FALLTHRU); | |
2967 | test_bb->frequency = transaction_bb->frequency; | |
2968 | test_bb->count = transaction_bb->count; | |
720cfc43 | 2969 | ei->probability = profile_probability::always (); |
0cd02a19 | 2970 | |
2971 | // Not abort edge. If both are live, chose one at random as we'll | |
2972 | // we'll be fixing that up below. | |
2973 | redirect_edge_pred (fallthru_edge, test_bb); | |
2974 | fallthru_edge->flags = EDGE_FALSE_VALUE; | |
720cfc43 | 2975 | fallthru_edge->probability = profile_probability::very_likely (); |
0cd02a19 | 2976 | |
2977 | // Abort/over edge. | |
2978 | redirect_edge_pred (abort_edge, test_bb); | |
2979 | abort_edge->flags = EDGE_TRUE_VALUE; | |
720cfc43 | 2980 | abort_edge->probability = profile_probability::unlikely (); |
0cd02a19 | 2981 | |
2982 | transaction_bb = test_bb; | |
2983 | } | |
2984 | ||
2985 | // If we have both instrumented and uninstrumented code paths, select one. | |
2986 | if (inst_edge && uninst_edge) | |
2987 | { | |
2988 | basic_block test_bb = create_empty_bb (transaction_bb); | |
b3083327 | 2989 | add_bb_to_loop (test_bb, transaction_bb->loop_father); |
0cd02a19 | 2990 | if (region->restart_block == region->entry_block) |
2991 | region->restart_block = test_bb; | |
2992 | ||
f9e245b2 | 2993 | tree t1 = create_tmp_reg (tm_state_type); |
0cd02a19 | 2994 | tree t2 = build_int_cst (tm_state_type, A_RUNUNINSTRUMENTEDCODE); |
2995 | ||
42acab1c | 2996 | gimple *stmt = gimple_build_assign (t1, BIT_AND_EXPR, tm_state, t2); |
0cd02a19 | 2997 | gimple_stmt_iterator gsi = gsi_last_bb (test_bb); |
2998 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
2999 | ||
3000 | t2 = build_int_cst (tm_state_type, 0); | |
3001 | stmt = gimple_build_cond (NE_EXPR, t1, t2, NULL, NULL); | |
3002 | gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING); | |
3003 | ||
3004 | // Create the edge into test_bb first, as we want to copy values | |
3005 | // out of the fallthru edge. | |
3006 | edge e = make_edge (transaction_bb, test_bb, fallthru_edge->flags); | |
3007 | e->probability = fallthru_edge->probability; | |
ea5d3981 | 3008 | test_bb->count = fallthru_edge->count (); |
0cd02a19 | 3009 | test_bb->frequency = EDGE_FREQUENCY (e); |
3010 | ||
3011 | // Now update the edges to the inst/uninist implementations. | |
3012 | // For now assume that the paths are equally likely. When using HTM, | |
3013 | // we'll try the uninst path first and fallback to inst path if htm | |
3014 | // buffers are exceeded. Without HTM we start with the inst path and | |
3015 | // use the uninst path when falling back to serial mode. | |
3016 | redirect_edge_pred (inst_edge, test_bb); | |
3017 | inst_edge->flags = EDGE_FALSE_VALUE; | |
720cfc43 | 3018 | inst_edge->probability = profile_probability::even (); |
0cd02a19 | 3019 | |
3020 | redirect_edge_pred (uninst_edge, test_bb); | |
3021 | uninst_edge->flags = EDGE_TRUE_VALUE; | |
720cfc43 | 3022 | uninst_edge->probability = profile_probability::even (); |
0cd02a19 | 3023 | } |
3024 | ||
3025 | // If we have no previous special cases, and we have PHIs at the beginning | |
3026 | // of the atomic region, this means we have a loop at the beginning of the | |
3027 | // atomic region that shares the first block. This can cause problems with | |
3028 | // the transaction restart abnormal edges to be added in the tm_edges pass. | |
3029 | // Solve this by adding a new empty block to receive the abnormal edges. | |
3030 | if (region->restart_block == region->entry_block | |
3031 | && phi_nodes (region->entry_block)) | |
3032 | { | |
3033 | basic_block empty_bb = create_empty_bb (transaction_bb); | |
3034 | region->restart_block = empty_bb; | |
b3083327 | 3035 | add_bb_to_loop (empty_bb, transaction_bb->loop_father); |
0cd02a19 | 3036 | |
3037 | redirect_edge_pred (fallthru_edge, empty_bb); | |
3038 | make_edge (transaction_bb, empty_bb, EDGE_FALLTHRU); | |
3039 | } | |
3040 | ||
3041 | return NULL; | |
3042 | } | |
3043 | ||
3044 | /* Generate the temporary to be used for the return value of | |
3045 | BUILT_IN_TM_START. */ | |
3046 | ||
3047 | static void * | |
3048 | generate_tm_state (struct tm_region *region, void *data ATTRIBUTE_UNUSED) | |
3049 | { | |
3050 | tree tm_start = builtin_decl_explicit (BUILT_IN_TM_START); | |
3051 | region->tm_state = | |
3052 | create_tmp_reg (TREE_TYPE (TREE_TYPE (tm_start)), "tm_state"); | |
3053 | ||
3054 | // Reset the subcode, post optimizations. We'll fill this in | |
3055 | // again as we process blocks. | |
3056 | if (region->exit_blocks) | |
3057 | { | |
1a91d914 | 3058 | gtransaction *transaction_stmt = region->get_transaction_stmt (); |
3059 | unsigned int subcode = gimple_transaction_subcode (transaction_stmt); | |
0cd02a19 | 3060 | |
3061 | if (subcode & GTMA_DOES_GO_IRREVOCABLE) | |
3062 | subcode &= (GTMA_DECLARATION_MASK | GTMA_DOES_GO_IRREVOCABLE | |
1910089e | 3063 | | GTMA_MAY_ENTER_IRREVOCABLE |
3064 | | GTMA_HAS_NO_INSTRUMENTATION); | |
0cd02a19 | 3065 | else |
3066 | subcode &= GTMA_DECLARATION_MASK; | |
1a91d914 | 3067 | gimple_transaction_set_subcode (transaction_stmt, subcode); |
0cd02a19 | 3068 | } |
3069 | ||
3070 | return NULL; | |
3071 | } | |
3072 | ||
3073 | // Propagate flags from inner transactions outwards. | |
3074 | static void | |
3075 | propagate_tm_flags_out (struct tm_region *region) | |
3076 | { | |
3077 | if (region == NULL) | |
3078 | return; | |
3079 | propagate_tm_flags_out (region->inner); | |
3080 | ||
3081 | if (region->outer && region->outer->transaction_stmt) | |
3082 | { | |
1a91d914 | 3083 | unsigned s |
3084 | = gimple_transaction_subcode (region->get_transaction_stmt ()); | |
0cd02a19 | 3085 | s &= (GTMA_HAVE_ABORT | GTMA_HAVE_LOAD | GTMA_HAVE_STORE |
3086 | | GTMA_MAY_ENTER_IRREVOCABLE); | |
1a91d914 | 3087 | s |= gimple_transaction_subcode (region->outer->get_transaction_stmt ()); |
3088 | gimple_transaction_set_subcode (region->outer->get_transaction_stmt (), | |
3089 | s); | |
0cd02a19 | 3090 | } |
3091 | ||
3092 | propagate_tm_flags_out (region->next); | |
3093 | } | |
3094 | ||
4c0315d0 | 3095 | /* Entry point to the MARK phase of TM expansion. Here we replace |
3096 | transactional memory statements with calls to builtins, and function | |
3097 | calls with their transactional clones (if available). But we don't | |
3098 | yet lower GIMPLE_TRANSACTION or add the transaction restart back-edges. */ | |
3099 | ||
3100 | static unsigned int | |
3101 | execute_tm_mark (void) | |
3102 | { | |
4c0315d0 | 3103 | pending_edge_inserts_p = false; |
3104 | ||
00d83cc8 | 3105 | expand_regions (all_tm_regions, generate_tm_state, NULL, |
3106 | /*traverse_clones=*/true); | |
4c0315d0 | 3107 | |
0cd02a19 | 3108 | tm_log_init (); |
4c0315d0 | 3109 | |
04009ada | 3110 | vec<tm_region *> bb_regions |
79f4a793 | 3111 | = get_bb_regions_instrumented (/*traverse_clones=*/true, |
3112 | /*include_uninstrumented_p=*/false); | |
0cd02a19 | 3113 | struct tm_region *r; |
3114 | unsigned i; | |
4c0315d0 | 3115 | |
0cd02a19 | 3116 | // Expand memory operations into calls into the runtime. |
3117 | // This collects log entries as well. | |
f1f41a6c | 3118 | FOR_EACH_VEC_ELT (bb_regions, i, r) |
ded1a556 | 3119 | { |
3120 | if (r != NULL) | |
3121 | { | |
3122 | if (r->transaction_stmt) | |
3123 | { | |
1a91d914 | 3124 | unsigned sub |
3125 | = gimple_transaction_subcode (r->get_transaction_stmt ()); | |
ded1a556 | 3126 | |
3127 | /* If we're sure to go irrevocable, there won't be | |
3128 | anything to expand, since the run-time will go | |
3129 | irrevocable right away. */ | |
3130 | if (sub & GTMA_DOES_GO_IRREVOCABLE | |
3131 | && sub & GTMA_MAY_ENTER_IRREVOCABLE) | |
3132 | continue; | |
3133 | } | |
f5a6b05f | 3134 | expand_block_tm (r, BASIC_BLOCK_FOR_FN (cfun, i)); |
ded1a556 | 3135 | } |
3136 | } | |
0cd02a19 | 3137 | |
4aac6cf8 | 3138 | bb_regions.release (); |
3139 | ||
0cd02a19 | 3140 | // Propagate flags from inner transactions outwards. |
3141 | propagate_tm_flags_out (all_tm_regions); | |
3142 | ||
3143 | // Expand GIMPLE_TRANSACTIONs into calls into the runtime. | |
00d83cc8 | 3144 | expand_regions (all_tm_regions, expand_transaction, NULL, |
3145 | /*traverse_clones=*/false); | |
0cd02a19 | 3146 | |
3147 | tm_log_emit (); | |
3148 | tm_log_delete (); | |
4c0315d0 | 3149 | |
3150 | if (pending_edge_inserts_p) | |
3151 | gsi_commit_edge_inserts (); | |
0cd02a19 | 3152 | free_dominance_info (CDI_DOMINATORS); |
4c0315d0 | 3153 | return 0; |
3154 | } | |
3155 | ||
7620bc82 | 3156 | namespace { |
3157 | ||
3158 | const pass_data pass_data_tm_mark = | |
cbe8bda8 | 3159 | { |
3160 | GIMPLE_PASS, /* type */ | |
3161 | "tmmark", /* name */ | |
3162 | OPTGROUP_NONE, /* optinfo_flags */ | |
cbe8bda8 | 3163 | TV_TRANS_MEM, /* tv_id */ |
3164 | ( PROP_ssa | PROP_cfg ), /* properties_required */ | |
3165 | 0, /* properties_provided */ | |
3166 | 0, /* properties_destroyed */ | |
3167 | 0, /* todo_flags_start */ | |
8b88439e | 3168 | TODO_update_ssa, /* todo_flags_finish */ |
4c0315d0 | 3169 | }; |
cbe8bda8 | 3170 | |
7620bc82 | 3171 | class pass_tm_mark : public gimple_opt_pass |
cbe8bda8 | 3172 | { |
3173 | public: | |
9af5ce0c | 3174 | pass_tm_mark (gcc::context *ctxt) |
3175 | : gimple_opt_pass (pass_data_tm_mark, ctxt) | |
cbe8bda8 | 3176 | {} |
3177 | ||
3178 | /* opt_pass methods: */ | |
65b0537f | 3179 | virtual unsigned int execute (function *) { return execute_tm_mark (); } |
cbe8bda8 | 3180 | |
3181 | }; // class pass_tm_mark | |
3182 | ||
7620bc82 | 3183 | } // anon namespace |
3184 | ||
cbe8bda8 | 3185 | gimple_opt_pass * |
3186 | make_pass_tm_mark (gcc::context *ctxt) | |
3187 | { | |
3188 | return new pass_tm_mark (ctxt); | |
3189 | } | |
4c0315d0 | 3190 | \f |
0cd02a19 | 3191 | |
3192 | /* Create an abnormal edge from STMT at iter, splitting the block | |
3193 | as necessary. Adjust *PNEXT as needed for the split block. */ | |
4c0315d0 | 3194 | |
3195 | static inline void | |
42acab1c | 3196 | split_bb_make_tm_edge (gimple *stmt, basic_block dest_bb, |
0cd02a19 | 3197 | gimple_stmt_iterator iter, gimple_stmt_iterator *pnext) |
4c0315d0 | 3198 | { |
0cd02a19 | 3199 | basic_block bb = gimple_bb (stmt); |
3200 | if (!gsi_one_before_end_p (iter)) | |
3201 | { | |
3202 | edge e = split_block (bb, stmt); | |
3203 | *pnext = gsi_start_bb (e->dest); | |
3204 | } | |
eaa16535 | 3205 | edge e = make_edge (bb, dest_bb, EDGE_ABNORMAL); |
3206 | if (e) | |
ea5d3981 | 3207 | e->probability = profile_probability::guessed_never (); |
4c0315d0 | 3208 | |
0cd02a19 | 3209 | // Record the need for the edge for the benefit of the rtl passes. |
4c0315d0 | 3210 | if (cfun->gimple_df->tm_restart == NULL) |
b7aa58e4 | 3211 | cfun->gimple_df->tm_restart |
3212 | = hash_table<tm_restart_hasher>::create_ggc (31); | |
4c0315d0 | 3213 | |
0cd02a19 | 3214 | struct tm_restart_node dummy; |
4c0315d0 | 3215 | dummy.stmt = stmt; |
0cd02a19 | 3216 | dummy.label_or_list = gimple_block_label (dest_bb); |
3217 | ||
b7aa58e4 | 3218 | tm_restart_node **slot = cfun->gimple_df->tm_restart->find_slot (&dummy, |
3219 | INSERT); | |
3220 | struct tm_restart_node *n = *slot; | |
4c0315d0 | 3221 | if (n == NULL) |
3222 | { | |
25a27413 | 3223 | n = ggc_alloc<tm_restart_node> (); |
4c0315d0 | 3224 | *n = dummy; |
3225 | } | |
3226 | else | |
3227 | { | |
3228 | tree old = n->label_or_list; | |
3229 | if (TREE_CODE (old) == LABEL_DECL) | |
0cd02a19 | 3230 | old = tree_cons (NULL, old, NULL); |
4c0315d0 | 3231 | n->label_or_list = tree_cons (NULL, dummy.label_or_list, old); |
3232 | } | |
4c0315d0 | 3233 | } |
3234 | ||
4c0315d0 | 3235 | /* Split block BB as necessary for every builtin function we added, and |
3236 | wire up the abnormal back edges implied by the transaction restart. */ | |
3237 | ||
3238 | static void | |
0cd02a19 | 3239 | expand_block_edges (struct tm_region *const region, basic_block bb) |
4c0315d0 | 3240 | { |
0cd02a19 | 3241 | gimple_stmt_iterator gsi, next_gsi; |
4c0315d0 | 3242 | |
0cd02a19 | 3243 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi = next_gsi) |
4c0315d0 | 3244 | { |
42acab1c | 3245 | gimple *stmt = gsi_stmt (gsi); |
1a91d914 | 3246 | gcall *call_stmt; |
4c0315d0 | 3247 | |
0cd02a19 | 3248 | next_gsi = gsi; |
3249 | gsi_next (&next_gsi); | |
3250 | ||
3251 | // ??? Shouldn't we split for any non-pure, non-irrevocable function? | |
1a91d914 | 3252 | call_stmt = dyn_cast <gcall *> (stmt); |
3253 | if ((!call_stmt) | |
3254 | || (gimple_call_flags (call_stmt) & ECF_TM_BUILTIN) == 0) | |
0cd02a19 | 3255 | continue; |
3256 | ||
1a91d914 | 3257 | if (DECL_FUNCTION_CODE (gimple_call_fndecl (call_stmt)) |
3258 | == BUILT_IN_TM_ABORT) | |
4c0315d0 | 3259 | { |
0cd02a19 | 3260 | // If we have a ``_transaction_cancel [[outer]]'', there is only |
3261 | // one abnormal edge: to the transaction marked OUTER. | |
3262 | // All compiler-generated instances of BUILT_IN_TM_ABORT have a | |
3263 | // constant argument, which we can examine here. Users invoking | |
3264 | // TM_ABORT directly get what they deserve. | |
1a91d914 | 3265 | tree arg = gimple_call_arg (call_stmt, 0); |
0cd02a19 | 3266 | if (TREE_CODE (arg) == INTEGER_CST |
3267 | && (TREE_INT_CST_LOW (arg) & AR_OUTERABORT) != 0 | |
3268 | && !decl_is_tm_clone (current_function_decl)) | |
4c0315d0 | 3269 | { |
0cd02a19 | 3270 | // Find the GTMA_IS_OUTER transaction. |
3271 | for (struct tm_region *o = region; o; o = o->outer) | |
3272 | if (o->original_transaction_was_outer) | |
3273 | { | |
1a91d914 | 3274 | split_bb_make_tm_edge (call_stmt, o->restart_block, |
0cd02a19 | 3275 | gsi, &next_gsi); |
3276 | break; | |
3277 | } | |
3278 | ||
3279 | // Otherwise, the front-end should have semantically checked | |
3280 | // outer aborts, but in either case the target region is not | |
3281 | // within this function. | |
3282 | continue; | |
4c0315d0 | 3283 | } |
3284 | ||
0cd02a19 | 3285 | // Non-outer, TM aborts have an abnormal edge to the inner-most |
3286 | // transaction, the one being aborted; | |
1a91d914 | 3287 | split_bb_make_tm_edge (call_stmt, region->restart_block, gsi, |
3288 | &next_gsi); | |
4c0315d0 | 3289 | } |
3290 | ||
0cd02a19 | 3291 | // All TM builtins have an abnormal edge to the outer-most transaction. |
3292 | // We never restart inner transactions. For tm clones, we know a-priori | |
3293 | // that the outer-most transaction is outside the function. | |
3294 | if (decl_is_tm_clone (current_function_decl)) | |
3295 | continue; | |
4c0315d0 | 3296 | |
0cd02a19 | 3297 | if (cfun->gimple_df->tm_restart == NULL) |
3298 | cfun->gimple_df->tm_restart | |
b7aa58e4 | 3299 | = hash_table<tm_restart_hasher>::create_ggc (31); |
4c0315d0 | 3300 | |
0cd02a19 | 3301 | // All TM builtins have an abnormal edge to the outer-most transaction. |
3302 | // We never restart inner transactions. | |
3303 | for (struct tm_region *o = region; o; o = o->outer) | |
3304 | if (!o->outer) | |
3305 | { | |
1a91d914 | 3306 | split_bb_make_tm_edge (call_stmt, o->restart_block, gsi, &next_gsi); |
0cd02a19 | 3307 | break; |
3308 | } | |
4c0315d0 | 3309 | |
0cd02a19 | 3310 | // Delete any tail-call annotation that may have been added. |
3311 | // The tail-call pass may have mis-identified the commit as being | |
3312 | // a candidate because we had not yet added this restart edge. | |
1a91d914 | 3313 | gimple_call_set_tail (call_stmt, false); |
4c0315d0 | 3314 | } |
3315 | } | |
3316 | ||
3317 | /* Entry point to the final expansion of transactional nodes. */ | |
3318 | ||
7620bc82 | 3319 | namespace { |
3320 | ||
3321 | const pass_data pass_data_tm_edges = | |
cbe8bda8 | 3322 | { |
3323 | GIMPLE_PASS, /* type */ | |
3324 | "tmedge", /* name */ | |
3325 | OPTGROUP_NONE, /* optinfo_flags */ | |
cbe8bda8 | 3326 | TV_TRANS_MEM, /* tv_id */ |
3327 | ( PROP_ssa | PROP_cfg ), /* properties_required */ | |
3328 | 0, /* properties_provided */ | |
3329 | 0, /* properties_destroyed */ | |
3330 | 0, /* todo_flags_start */ | |
8b88439e | 3331 | TODO_update_ssa, /* todo_flags_finish */ |
4c0315d0 | 3332 | }; |
cbe8bda8 | 3333 | |
7620bc82 | 3334 | class pass_tm_edges : public gimple_opt_pass |
cbe8bda8 | 3335 | { |
3336 | public: | |
9af5ce0c | 3337 | pass_tm_edges (gcc::context *ctxt) |
3338 | : gimple_opt_pass (pass_data_tm_edges, ctxt) | |
cbe8bda8 | 3339 | {} |
3340 | ||
3341 | /* opt_pass methods: */ | |
65b0537f | 3342 | virtual unsigned int execute (function *); |
cbe8bda8 | 3343 | |
3344 | }; // class pass_tm_edges | |
3345 | ||
65b0537f | 3346 | unsigned int |
3347 | pass_tm_edges::execute (function *fun) | |
3348 | { | |
04009ada | 3349 | vec<tm_region *> bb_regions |
65b0537f | 3350 | = get_bb_regions_instrumented (/*traverse_clones=*/false, |
3351 | /*include_uninstrumented_p=*/true); | |
3352 | struct tm_region *r; | |
3353 | unsigned i; | |
3354 | ||
3355 | FOR_EACH_VEC_ELT (bb_regions, i, r) | |
3356 | if (r != NULL) | |
3357 | expand_block_edges (r, BASIC_BLOCK_FOR_FN (fun, i)); | |
3358 | ||
3359 | bb_regions.release (); | |
3360 | ||
3361 | /* We've got to release the dominance info now, to indicate that it | |
3362 | must be rebuilt completely. Otherwise we'll crash trying to update | |
3363 | the SSA web in the TODO section following this pass. */ | |
3364 | free_dominance_info (CDI_DOMINATORS); | |
6d9dcf16 | 3365 | /* We'ge also wrecked loops badly with inserting of abnormal edges. */ |
3366 | loops_state_set (LOOPS_NEED_FIXUP); | |
65b0537f | 3367 | bitmap_obstack_release (&tm_obstack); |
3368 | all_tm_regions = NULL; | |
3369 | ||
3370 | return 0; | |
3371 | } | |
3372 | ||
7620bc82 | 3373 | } // anon namespace |
3374 | ||
cbe8bda8 | 3375 | gimple_opt_pass * |
3376 | make_pass_tm_edges (gcc::context *ctxt) | |
3377 | { | |
3378 | return new pass_tm_edges (ctxt); | |
3379 | } | |
0cd02a19 | 3380 | \f |
3381 | /* Helper function for expand_regions. Expand REGION and recurse to | |
3382 | the inner region. Call CALLBACK on each region. CALLBACK returns | |
3383 | NULL to continue the traversal, otherwise a non-null value which | |
00d83cc8 | 3384 | this function will return as well. TRAVERSE_CLONES is true if we |
3385 | should traverse transactional clones. */ | |
0cd02a19 | 3386 | |
3387 | static void * | |
3388 | expand_regions_1 (struct tm_region *region, | |
3389 | void *(*callback)(struct tm_region *, void *), | |
00d83cc8 | 3390 | void *data, |
3391 | bool traverse_clones) | |
0cd02a19 | 3392 | { |
3393 | void *retval = NULL; | |
00d83cc8 | 3394 | if (region->exit_blocks |
3395 | || (traverse_clones && decl_is_tm_clone (current_function_decl))) | |
0cd02a19 | 3396 | { |
3397 | retval = callback (region, data); | |
3398 | if (retval) | |
3399 | return retval; | |
3400 | } | |
3401 | if (region->inner) | |
3402 | { | |
00d83cc8 | 3403 | retval = expand_regions (region->inner, callback, data, traverse_clones); |
0cd02a19 | 3404 | if (retval) |
3405 | return retval; | |
3406 | } | |
3407 | return retval; | |
3408 | } | |
3409 | ||
3410 | /* Traverse the regions enclosed and including REGION. Execute | |
3411 | CALLBACK for each region, passing DATA. CALLBACK returns NULL to | |
3412 | continue the traversal, otherwise a non-null value which this | |
00d83cc8 | 3413 | function will return as well. TRAVERSE_CLONES is true if we should |
3414 | traverse transactional clones. */ | |
0cd02a19 | 3415 | |
3416 | static void * | |
3417 | expand_regions (struct tm_region *region, | |
3418 | void *(*callback)(struct tm_region *, void *), | |
00d83cc8 | 3419 | void *data, |
3420 | bool traverse_clones) | |
0cd02a19 | 3421 | { |
3422 | void *retval = NULL; | |
3423 | while (region) | |
3424 | { | |
00d83cc8 | 3425 | retval = expand_regions_1 (region, callback, data, traverse_clones); |
0cd02a19 | 3426 | if (retval) |
3427 | return retval; | |
3428 | region = region->next; | |
3429 | } | |
3430 | return retval; | |
3431 | } | |
3432 | ||
4c0315d0 | 3433 | \f |
3434 | /* A unique TM memory operation. */ | |
04009ada | 3435 | struct tm_memop |
4c0315d0 | 3436 | { |
3437 | /* Unique ID that all memory operations to the same location have. */ | |
3438 | unsigned int value_id; | |
3439 | /* Address of load/store. */ | |
3440 | tree addr; | |
04009ada | 3441 | }; |
4c0315d0 | 3442 | |
d9dd21a8 | 3443 | /* TM memory operation hashtable helpers. */ |
3444 | ||
298e7f9a | 3445 | struct tm_memop_hasher : free_ptr_hash <tm_memop> |
d9dd21a8 | 3446 | { |
9969c043 | 3447 | static inline hashval_t hash (const tm_memop *); |
3448 | static inline bool equal (const tm_memop *, const tm_memop *); | |
d9dd21a8 | 3449 | }; |
3450 | ||
3451 | /* Htab support. Return a hash value for a `tm_memop'. */ | |
3452 | inline hashval_t | |
9969c043 | 3453 | tm_memop_hasher::hash (const tm_memop *mem) |
d9dd21a8 | 3454 | { |
3455 | tree addr = mem->addr; | |
3456 | /* We drill down to the SSA_NAME/DECL for the hash, but equality is | |
3457 | actually done with operand_equal_p (see tm_memop_eq). */ | |
3458 | if (TREE_CODE (addr) == ADDR_EXPR) | |
3459 | addr = TREE_OPERAND (addr, 0); | |
3460 | return iterative_hash_expr (addr, 0); | |
3461 | } | |
3462 | ||
3463 | /* Htab support. Return true if two tm_memop's are the same. */ | |
3464 | inline bool | |
9969c043 | 3465 | tm_memop_hasher::equal (const tm_memop *mem1, const tm_memop *mem2) |
d9dd21a8 | 3466 | { |
3467 | return operand_equal_p (mem1->addr, mem2->addr, 0); | |
3468 | } | |
3469 | ||
4c0315d0 | 3470 | /* Sets for solving data flow equations in the memory optimization pass. */ |
3471 | struct tm_memopt_bitmaps | |
3472 | { | |
3473 | /* Stores available to this BB upon entry. Basically, stores that | |
3474 | dominate this BB. */ | |
3475 | bitmap store_avail_in; | |
3476 | /* Stores available at the end of this BB. */ | |
3477 | bitmap store_avail_out; | |
3478 | bitmap store_antic_in; | |
3479 | bitmap store_antic_out; | |
3480 | /* Reads available to this BB upon entry. Basically, reads that | |
3481 | dominate this BB. */ | |
3482 | bitmap read_avail_in; | |
3483 | /* Reads available at the end of this BB. */ | |
3484 | bitmap read_avail_out; | |
3485 | /* Reads performed in this BB. */ | |
3486 | bitmap read_local; | |
3487 | /* Writes performed in this BB. */ | |
3488 | bitmap store_local; | |
3489 | ||
3490 | /* Temporary storage for pass. */ | |
3491 | /* Is the current BB in the worklist? */ | |
3492 | bool avail_in_worklist_p; | |
3493 | /* Have we visited this BB? */ | |
3494 | bool visited_p; | |
3495 | }; | |
3496 | ||
3497 | static bitmap_obstack tm_memopt_obstack; | |
3498 | ||
3499 | /* Unique counter for TM loads and stores. Loads and stores of the | |
3500 | same address get the same ID. */ | |
3501 | static unsigned int tm_memopt_value_id; | |
c1f445d2 | 3502 | static hash_table<tm_memop_hasher> *tm_memopt_value_numbers; |
4c0315d0 | 3503 | |
3504 | #define STORE_AVAIL_IN(BB) \ | |
3505 | ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_avail_in | |
3506 | #define STORE_AVAIL_OUT(BB) \ | |
3507 | ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_avail_out | |
3508 | #define STORE_ANTIC_IN(BB) \ | |
3509 | ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_antic_in | |
3510 | #define STORE_ANTIC_OUT(BB) \ | |
3511 | ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_antic_out | |
3512 | #define READ_AVAIL_IN(BB) \ | |
3513 | ((struct tm_memopt_bitmaps *) ((BB)->aux))->read_avail_in | |
3514 | #define READ_AVAIL_OUT(BB) \ | |
3515 | ((struct tm_memopt_bitmaps *) ((BB)->aux))->read_avail_out | |
3516 | #define READ_LOCAL(BB) \ | |
3517 | ((struct tm_memopt_bitmaps *) ((BB)->aux))->read_local | |
3518 | #define STORE_LOCAL(BB) \ | |
3519 | ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_local | |
3520 | #define AVAIL_IN_WORKLIST_P(BB) \ | |
3521 | ((struct tm_memopt_bitmaps *) ((BB)->aux))->avail_in_worklist_p | |
3522 | #define BB_VISITED_P(BB) \ | |
3523 | ((struct tm_memopt_bitmaps *) ((BB)->aux))->visited_p | |
3524 | ||
4c0315d0 | 3525 | /* Given a TM load/store in STMT, return the value number for the address |
3526 | it accesses. */ | |
3527 | ||
3528 | static unsigned int | |
42acab1c | 3529 | tm_memopt_value_number (gimple *stmt, enum insert_option op) |
4c0315d0 | 3530 | { |
3531 | struct tm_memop tmpmem, *mem; | |
d9dd21a8 | 3532 | tm_memop **slot; |
4c0315d0 | 3533 | |
3534 | gcc_assert (is_tm_load (stmt) || is_tm_store (stmt)); | |
3535 | tmpmem.addr = gimple_call_arg (stmt, 0); | |
c1f445d2 | 3536 | slot = tm_memopt_value_numbers->find_slot (&tmpmem, op); |
4c0315d0 | 3537 | if (*slot) |
d9dd21a8 | 3538 | mem = *slot; |
4c0315d0 | 3539 | else if (op == INSERT) |
3540 | { | |
3541 | mem = XNEW (struct tm_memop); | |
3542 | *slot = mem; | |
3543 | mem->value_id = tm_memopt_value_id++; | |
3544 | mem->addr = tmpmem.addr; | |
3545 | } | |
3546 | else | |
3547 | gcc_unreachable (); | |
3548 | return mem->value_id; | |
3549 | } | |
3550 | ||
3551 | /* Accumulate TM memory operations in BB into STORE_LOCAL and READ_LOCAL. */ | |
3552 | ||
3553 | static void | |
3554 | tm_memopt_accumulate_memops (basic_block bb) | |
3555 | { | |
3556 | gimple_stmt_iterator gsi; | |
3557 | ||
3558 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
3559 | { | |
42acab1c | 3560 | gimple *stmt = gsi_stmt (gsi); |
4c0315d0 | 3561 | bitmap bits; |
3562 | unsigned int loc; | |
3563 | ||
3564 | if (is_tm_store (stmt)) | |
3565 | bits = STORE_LOCAL (bb); | |
3566 | else if (is_tm_load (stmt)) | |
3567 | bits = READ_LOCAL (bb); | |
3568 | else | |
3569 | continue; | |
3570 | ||
3571 | loc = tm_memopt_value_number (stmt, INSERT); | |
3572 | bitmap_set_bit (bits, loc); | |
3573 | if (dump_file) | |
3574 | { | |
3575 | fprintf (dump_file, "TM memopt (%s): value num=%d, BB=%d, addr=", | |
3576 | is_tm_load (stmt) ? "LOAD" : "STORE", loc, | |
3577 | gimple_bb (stmt)->index); | |
1ffa4346 | 3578 | print_generic_expr (dump_file, gimple_call_arg (stmt, 0)); |
4c0315d0 | 3579 | fprintf (dump_file, "\n"); |
3580 | } | |
3581 | } | |
3582 | } | |
3583 | ||
3584 | /* Prettily dump one of the memopt sets. BITS is the bitmap to dump. */ | |
3585 | ||
3586 | static void | |
3587 | dump_tm_memopt_set (const char *set_name, bitmap bits) | |
3588 | { | |
3589 | unsigned i; | |
3590 | bitmap_iterator bi; | |
3591 | const char *comma = ""; | |
3592 | ||
3593 | fprintf (dump_file, "TM memopt: %s: [", set_name); | |
3594 | EXECUTE_IF_SET_IN_BITMAP (bits, 0, i, bi) | |
3595 | { | |
c1f445d2 | 3596 | hash_table<tm_memop_hasher>::iterator hi; |
d9dd21a8 | 3597 | struct tm_memop *mem = NULL; |
4c0315d0 | 3598 | |
3599 | /* Yeah, yeah, yeah. Whatever. This is just for debugging. */ | |
c1f445d2 | 3600 | FOR_EACH_HASH_TABLE_ELEMENT (*tm_memopt_value_numbers, mem, tm_memop_t, hi) |
4c0315d0 | 3601 | if (mem->value_id == i) |
3602 | break; | |
3603 | gcc_assert (mem->value_id == i); | |
3604 | fprintf (dump_file, "%s", comma); | |
3605 | comma = ", "; | |
1ffa4346 | 3606 | print_generic_expr (dump_file, mem->addr); |
4c0315d0 | 3607 | } |
3608 | fprintf (dump_file, "]\n"); | |
3609 | } | |
3610 | ||
3611 | /* Prettily dump all of the memopt sets in BLOCKS. */ | |
3612 | ||
3613 | static void | |
f1f41a6c | 3614 | dump_tm_memopt_sets (vec<basic_block> blocks) |
4c0315d0 | 3615 | { |
3616 | size_t i; | |
3617 | basic_block bb; | |
3618 | ||
f1f41a6c | 3619 | for (i = 0; blocks.iterate (i, &bb); ++i) |
4c0315d0 | 3620 | { |
3621 | fprintf (dump_file, "------------BB %d---------\n", bb->index); | |
3622 | dump_tm_memopt_set ("STORE_LOCAL", STORE_LOCAL (bb)); | |
3623 | dump_tm_memopt_set ("READ_LOCAL", READ_LOCAL (bb)); | |
3624 | dump_tm_memopt_set ("STORE_AVAIL_IN", STORE_AVAIL_IN (bb)); | |
3625 | dump_tm_memopt_set ("STORE_AVAIL_OUT", STORE_AVAIL_OUT (bb)); | |
3626 | dump_tm_memopt_set ("READ_AVAIL_IN", READ_AVAIL_IN (bb)); | |
3627 | dump_tm_memopt_set ("READ_AVAIL_OUT", READ_AVAIL_OUT (bb)); | |
3628 | } | |
3629 | } | |
3630 | ||
3631 | /* Compute {STORE,READ}_AVAIL_IN for the basic block BB. */ | |
3632 | ||
3633 | static void | |
3634 | tm_memopt_compute_avin (basic_block bb) | |
3635 | { | |
3636 | edge e; | |
3637 | unsigned ix; | |
3638 | ||
3639 | /* Seed with the AVOUT of any predecessor. */ | |
3640 | for (ix = 0; ix < EDGE_COUNT (bb->preds); ix++) | |
3641 | { | |
3642 | e = EDGE_PRED (bb, ix); | |
3643 | /* Make sure we have already visited this BB, and is thus | |
3644 | initialized. | |
3645 | ||
3646 | If e->src->aux is NULL, this predecessor is actually on an | |
3647 | enclosing transaction. We only care about the current | |
3648 | transaction, so ignore it. */ | |
3649 | if (e->src->aux && BB_VISITED_P (e->src)) | |
3650 | { | |
3651 | bitmap_copy (STORE_AVAIL_IN (bb), STORE_AVAIL_OUT (e->src)); | |
3652 | bitmap_copy (READ_AVAIL_IN (bb), READ_AVAIL_OUT (e->src)); | |
3653 | break; | |
3654 | } | |
3655 | } | |
3656 | ||
3657 | for (; ix < EDGE_COUNT (bb->preds); ix++) | |
3658 | { | |
3659 | e = EDGE_PRED (bb, ix); | |
3660 | if (e->src->aux && BB_VISITED_P (e->src)) | |
3661 | { | |
3662 | bitmap_and_into (STORE_AVAIL_IN (bb), STORE_AVAIL_OUT (e->src)); | |
3663 | bitmap_and_into (READ_AVAIL_IN (bb), READ_AVAIL_OUT (e->src)); | |
3664 | } | |
3665 | } | |
3666 | ||
3667 | BB_VISITED_P (bb) = true; | |
3668 | } | |
3669 | ||
3670 | /* Compute the STORE_ANTIC_IN for the basic block BB. */ | |
3671 | ||
3672 | static void | |
3673 | tm_memopt_compute_antin (basic_block bb) | |
3674 | { | |
3675 | edge e; | |
3676 | unsigned ix; | |
3677 | ||
3678 | /* Seed with the ANTIC_OUT of any successor. */ | |
3679 | for (ix = 0; ix < EDGE_COUNT (bb->succs); ix++) | |
3680 | { | |
3681 | e = EDGE_SUCC (bb, ix); | |
3682 | /* Make sure we have already visited this BB, and is thus | |
3683 | initialized. */ | |
3684 | if (BB_VISITED_P (e->dest)) | |
3685 | { | |
3686 | bitmap_copy (STORE_ANTIC_IN (bb), STORE_ANTIC_OUT (e->dest)); | |
3687 | break; | |
3688 | } | |
3689 | } | |
3690 | ||
3691 | for (; ix < EDGE_COUNT (bb->succs); ix++) | |
3692 | { | |
3693 | e = EDGE_SUCC (bb, ix); | |
3694 | if (BB_VISITED_P (e->dest)) | |
3695 | bitmap_and_into (STORE_ANTIC_IN (bb), STORE_ANTIC_OUT (e->dest)); | |
3696 | } | |
3697 | ||
3698 | BB_VISITED_P (bb) = true; | |
3699 | } | |
3700 | ||
3701 | /* Compute the AVAIL sets for every basic block in BLOCKS. | |
3702 | ||
3703 | We compute {STORE,READ}_AVAIL_{OUT,IN} as follows: | |
3704 | ||
3705 | AVAIL_OUT[bb] = union (AVAIL_IN[bb], LOCAL[bb]) | |
3706 | AVAIL_IN[bb] = intersect (AVAIL_OUT[predecessors]) | |
3707 | ||
3708 | This is basically what we do in lcm's compute_available(), but here | |
3709 | we calculate two sets of sets (one for STOREs and one for READs), | |
3710 | and we work on a region instead of the entire CFG. | |
3711 | ||
3712 | REGION is the TM region. | |
3713 | BLOCKS are the basic blocks in the region. */ | |
3714 | ||
3715 | static void | |
3716 | tm_memopt_compute_available (struct tm_region *region, | |
f1f41a6c | 3717 | vec<basic_block> blocks) |
4c0315d0 | 3718 | { |
3719 | edge e; | |
3720 | basic_block *worklist, *qin, *qout, *qend, bb; | |
3721 | unsigned int qlen, i; | |
3722 | edge_iterator ei; | |
3723 | bool changed; | |
3724 | ||
3725 | /* Allocate a worklist array/queue. Entries are only added to the | |
3726 | list if they were not already on the list. So the size is | |
3727 | bounded by the number of basic blocks in the region. */ | |
f1f41a6c | 3728 | qlen = blocks.length () - 1; |
4c0315d0 | 3729 | qin = qout = worklist = |
3730 | XNEWVEC (basic_block, qlen); | |
3731 | ||
3732 | /* Put every block in the region on the worklist. */ | |
f1f41a6c | 3733 | for (i = 0; blocks.iterate (i, &bb); ++i) |
4c0315d0 | 3734 | { |
3735 | /* Seed AVAIL_OUT with the LOCAL set. */ | |
3736 | bitmap_ior_into (STORE_AVAIL_OUT (bb), STORE_LOCAL (bb)); | |
3737 | bitmap_ior_into (READ_AVAIL_OUT (bb), READ_LOCAL (bb)); | |
3738 | ||
3739 | AVAIL_IN_WORKLIST_P (bb) = true; | |
3740 | /* No need to insert the entry block, since it has an AVIN of | |
3741 | null, and an AVOUT that has already been seeded in. */ | |
3742 | if (bb != region->entry_block) | |
3743 | *qin++ = bb; | |
3744 | } | |
3745 | ||
3746 | /* The entry block has been initialized with the local sets. */ | |
3747 | BB_VISITED_P (region->entry_block) = true; | |
3748 | ||
3749 | qin = worklist; | |
3750 | qend = &worklist[qlen]; | |
3751 | ||
3752 | /* Iterate until the worklist is empty. */ | |
3753 | while (qlen) | |
3754 | { | |
3755 | /* Take the first entry off the worklist. */ | |
3756 | bb = *qout++; | |
3757 | qlen--; | |
3758 | ||
3759 | if (qout >= qend) | |
3760 | qout = worklist; | |
3761 | ||
3762 | /* This block can be added to the worklist again if necessary. */ | |
3763 | AVAIL_IN_WORKLIST_P (bb) = false; | |
3764 | tm_memopt_compute_avin (bb); | |
3765 | ||
3766 | /* Note: We do not add the LOCAL sets here because we already | |
3767 | seeded the AVAIL_OUT sets with them. */ | |
3768 | changed = bitmap_ior_into (STORE_AVAIL_OUT (bb), STORE_AVAIL_IN (bb)); | |
3769 | changed |= bitmap_ior_into (READ_AVAIL_OUT (bb), READ_AVAIL_IN (bb)); | |
3770 | if (changed | |
3771 | && (region->exit_blocks == NULL | |
3772 | || !bitmap_bit_p (region->exit_blocks, bb->index))) | |
3773 | /* If the out state of this block changed, then we need to add | |
3774 | its successors to the worklist if they are not already in. */ | |
3775 | FOR_EACH_EDGE (e, ei, bb->succs) | |
34154e27 | 3776 | if (!AVAIL_IN_WORKLIST_P (e->dest) |
3777 | && e->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)) | |
4c0315d0 | 3778 | { |
3779 | *qin++ = e->dest; | |
3780 | AVAIL_IN_WORKLIST_P (e->dest) = true; | |
3781 | qlen++; | |
3782 | ||
3783 | if (qin >= qend) | |
3784 | qin = worklist; | |
3785 | } | |
3786 | } | |
3787 | ||
3788 | free (worklist); | |
3789 | ||
3790 | if (dump_file) | |
3791 | dump_tm_memopt_sets (blocks); | |
3792 | } | |
3793 | ||
3794 | /* Compute ANTIC sets for every basic block in BLOCKS. | |
3795 | ||
3796 | We compute STORE_ANTIC_OUT as follows: | |
3797 | ||
3798 | STORE_ANTIC_OUT[bb] = union(STORE_ANTIC_IN[bb], STORE_LOCAL[bb]) | |
3799 | STORE_ANTIC_IN[bb] = intersect(STORE_ANTIC_OUT[successors]) | |
3800 | ||
3801 | REGION is the TM region. | |
3802 | BLOCKS are the basic blocks in the region. */ | |
3803 | ||
3804 | static void | |
3805 | tm_memopt_compute_antic (struct tm_region *region, | |
f1f41a6c | 3806 | vec<basic_block> blocks) |
4c0315d0 | 3807 | { |
3808 | edge e; | |
3809 | basic_block *worklist, *qin, *qout, *qend, bb; | |
3810 | unsigned int qlen; | |
3811 | int i; | |
3812 | edge_iterator ei; | |
3813 | ||
3814 | /* Allocate a worklist array/queue. Entries are only added to the | |
3815 | list if they were not already on the list. So the size is | |
3816 | bounded by the number of basic blocks in the region. */ | |
f1f41a6c | 3817 | qin = qout = worklist = XNEWVEC (basic_block, blocks.length ()); |
4c0315d0 | 3818 | |
f1f41a6c | 3819 | for (qlen = 0, i = blocks.length () - 1; i >= 0; --i) |
4c0315d0 | 3820 | { |
f1f41a6c | 3821 | bb = blocks[i]; |
4c0315d0 | 3822 | |
3823 | /* Seed ANTIC_OUT with the LOCAL set. */ | |
3824 | bitmap_ior_into (STORE_ANTIC_OUT (bb), STORE_LOCAL (bb)); | |
3825 | ||
3826 | /* Put every block in the region on the worklist. */ | |
3827 | AVAIL_IN_WORKLIST_P (bb) = true; | |
3828 | /* No need to insert exit blocks, since their ANTIC_IN is NULL, | |
3829 | and their ANTIC_OUT has already been seeded in. */ | |
3830 | if (region->exit_blocks | |
3831 | && !bitmap_bit_p (region->exit_blocks, bb->index)) | |
3832 | { | |
3833 | qlen++; | |
3834 | *qin++ = bb; | |
3835 | } | |
3836 | } | |
3837 | ||
3838 | /* The exit blocks have been initialized with the local sets. */ | |
3839 | if (region->exit_blocks) | |
3840 | { | |
3841 | unsigned int i; | |
3842 | bitmap_iterator bi; | |
3843 | EXECUTE_IF_SET_IN_BITMAP (region->exit_blocks, 0, i, bi) | |
f5a6b05f | 3844 | BB_VISITED_P (BASIC_BLOCK_FOR_FN (cfun, i)) = true; |
4c0315d0 | 3845 | } |
3846 | ||
3847 | qin = worklist; | |
3848 | qend = &worklist[qlen]; | |
3849 | ||
3850 | /* Iterate until the worklist is empty. */ | |
3851 | while (qlen) | |
3852 | { | |
3853 | /* Take the first entry off the worklist. */ | |
3854 | bb = *qout++; | |
3855 | qlen--; | |
3856 | ||
3857 | if (qout >= qend) | |
3858 | qout = worklist; | |
3859 | ||
3860 | /* This block can be added to the worklist again if necessary. */ | |
3861 | AVAIL_IN_WORKLIST_P (bb) = false; | |
3862 | tm_memopt_compute_antin (bb); | |
3863 | ||
3864 | /* Note: We do not add the LOCAL sets here because we already | |
3865 | seeded the ANTIC_OUT sets with them. */ | |
3866 | if (bitmap_ior_into (STORE_ANTIC_OUT (bb), STORE_ANTIC_IN (bb)) | |
3867 | && bb != region->entry_block) | |
3868 | /* If the out state of this block changed, then we need to add | |
3869 | its predecessors to the worklist if they are not already in. */ | |
3870 | FOR_EACH_EDGE (e, ei, bb->preds) | |
3871 | if (!AVAIL_IN_WORKLIST_P (e->src)) | |
3872 | { | |
3873 | *qin++ = e->src; | |
3874 | AVAIL_IN_WORKLIST_P (e->src) = true; | |
3875 | qlen++; | |
3876 | ||
3877 | if (qin >= qend) | |
3878 | qin = worklist; | |
3879 | } | |
3880 | } | |
3881 | ||
3882 | free (worklist); | |
3883 | ||
3884 | if (dump_file) | |
3885 | dump_tm_memopt_sets (blocks); | |
3886 | } | |
3887 | ||
3888 | /* Offsets of load variants from TM_LOAD. For example, | |
3889 | BUILT_IN_TM_LOAD_RAR* is an offset of 1 from BUILT_IN_TM_LOAD*. | |
3890 | See gtm-builtins.def. */ | |
3891 | #define TRANSFORM_RAR 1 | |
3892 | #define TRANSFORM_RAW 2 | |
3893 | #define TRANSFORM_RFW 3 | |
3894 | /* Offsets of store variants from TM_STORE. */ | |
3895 | #define TRANSFORM_WAR 1 | |
3896 | #define TRANSFORM_WAW 2 | |
3897 | ||
3898 | /* Inform about a load/store optimization. */ | |
3899 | ||
3900 | static void | |
42acab1c | 3901 | dump_tm_memopt_transform (gimple *stmt) |
4c0315d0 | 3902 | { |
3903 | if (dump_file) | |
3904 | { | |
3905 | fprintf (dump_file, "TM memopt: transforming: "); | |
1ffa4346 | 3906 | print_gimple_stmt (dump_file, stmt, 0); |
4c0315d0 | 3907 | fprintf (dump_file, "\n"); |
3908 | } | |
3909 | } | |
3910 | ||
3911 | /* Perform a read/write optimization. Replaces the TM builtin in STMT | |
3912 | by a builtin that is OFFSET entries down in the builtins table in | |
3913 | gtm-builtins.def. */ | |
3914 | ||
3915 | static void | |
3916 | tm_memopt_transform_stmt (unsigned int offset, | |
1a91d914 | 3917 | gcall *stmt, |
4c0315d0 | 3918 | gimple_stmt_iterator *gsi) |
3919 | { | |
3920 | tree fn = gimple_call_fn (stmt); | |
3921 | gcc_assert (TREE_CODE (fn) == ADDR_EXPR); | |
3922 | TREE_OPERAND (fn, 0) | |
3923 | = builtin_decl_explicit ((enum built_in_function) | |
3924 | (DECL_FUNCTION_CODE (TREE_OPERAND (fn, 0)) | |
3925 | + offset)); | |
3926 | gimple_call_set_fn (stmt, fn); | |
3927 | gsi_replace (gsi, stmt, true); | |
3928 | dump_tm_memopt_transform (stmt); | |
3929 | } | |
3930 | ||
3931 | /* Perform the actual TM memory optimization transformations in the | |
3932 | basic blocks in BLOCKS. */ | |
3933 | ||
3934 | static void | |
f1f41a6c | 3935 | tm_memopt_transform_blocks (vec<basic_block> blocks) |
4c0315d0 | 3936 | { |
3937 | size_t i; | |
3938 | basic_block bb; | |
3939 | gimple_stmt_iterator gsi; | |
3940 | ||
f1f41a6c | 3941 | for (i = 0; blocks.iterate (i, &bb); ++i) |
4c0315d0 | 3942 | { |
3943 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
3944 | { | |
42acab1c | 3945 | gimple *stmt = gsi_stmt (gsi); |
4c0315d0 | 3946 | bitmap read_avail = READ_AVAIL_IN (bb); |
3947 | bitmap store_avail = STORE_AVAIL_IN (bb); | |
3948 | bitmap store_antic = STORE_ANTIC_OUT (bb); | |
3949 | unsigned int loc; | |
3950 | ||
3951 | if (is_tm_simple_load (stmt)) | |
3952 | { | |
1a91d914 | 3953 | gcall *call_stmt = as_a <gcall *> (stmt); |
4c0315d0 | 3954 | loc = tm_memopt_value_number (stmt, NO_INSERT); |
3955 | if (store_avail && bitmap_bit_p (store_avail, loc)) | |
1a91d914 | 3956 | tm_memopt_transform_stmt (TRANSFORM_RAW, call_stmt, &gsi); |
4c0315d0 | 3957 | else if (store_antic && bitmap_bit_p (store_antic, loc)) |
3958 | { | |
1a91d914 | 3959 | tm_memopt_transform_stmt (TRANSFORM_RFW, call_stmt, &gsi); |
4c0315d0 | 3960 | bitmap_set_bit (store_avail, loc); |
3961 | } | |
3962 | else if (read_avail && bitmap_bit_p (read_avail, loc)) | |
1a91d914 | 3963 | tm_memopt_transform_stmt (TRANSFORM_RAR, call_stmt, &gsi); |
4c0315d0 | 3964 | else |
3965 | bitmap_set_bit (read_avail, loc); | |
3966 | } | |
3967 | else if (is_tm_simple_store (stmt)) | |
3968 | { | |
1a91d914 | 3969 | gcall *call_stmt = as_a <gcall *> (stmt); |
4c0315d0 | 3970 | loc = tm_memopt_value_number (stmt, NO_INSERT); |
3971 | if (store_avail && bitmap_bit_p (store_avail, loc)) | |
1a91d914 | 3972 | tm_memopt_transform_stmt (TRANSFORM_WAW, call_stmt, &gsi); |
4c0315d0 | 3973 | else |
3974 | { | |
3975 | if (read_avail && bitmap_bit_p (read_avail, loc)) | |
1a91d914 | 3976 | tm_memopt_transform_stmt (TRANSFORM_WAR, call_stmt, &gsi); |
4c0315d0 | 3977 | bitmap_set_bit (store_avail, loc); |
3978 | } | |
3979 | } | |
3980 | } | |
3981 | } | |
3982 | } | |
3983 | ||
3984 | /* Return a new set of bitmaps for a BB. */ | |
3985 | ||
3986 | static struct tm_memopt_bitmaps * | |
3987 | tm_memopt_init_sets (void) | |
3988 | { | |
3989 | struct tm_memopt_bitmaps *b | |
3990 | = XOBNEW (&tm_memopt_obstack.obstack, struct tm_memopt_bitmaps); | |
3991 | b->store_avail_in = BITMAP_ALLOC (&tm_memopt_obstack); | |
3992 | b->store_avail_out = BITMAP_ALLOC (&tm_memopt_obstack); | |
3993 | b->store_antic_in = BITMAP_ALLOC (&tm_memopt_obstack); | |
3994 | b->store_antic_out = BITMAP_ALLOC (&tm_memopt_obstack); | |
3995 | b->store_avail_out = BITMAP_ALLOC (&tm_memopt_obstack); | |
3996 | b->read_avail_in = BITMAP_ALLOC (&tm_memopt_obstack); | |
3997 | b->read_avail_out = BITMAP_ALLOC (&tm_memopt_obstack); | |
3998 | b->read_local = BITMAP_ALLOC (&tm_memopt_obstack); | |
3999 | b->store_local = BITMAP_ALLOC (&tm_memopt_obstack); | |
4000 | return b; | |
4001 | } | |
4002 | ||
4003 | /* Free sets computed for each BB. */ | |
4004 | ||
4005 | static void | |
f1f41a6c | 4006 | tm_memopt_free_sets (vec<basic_block> blocks) |
4c0315d0 | 4007 | { |
4008 | size_t i; | |
4009 | basic_block bb; | |
4010 | ||
f1f41a6c | 4011 | for (i = 0; blocks.iterate (i, &bb); ++i) |
4c0315d0 | 4012 | bb->aux = NULL; |
4013 | } | |
4014 | ||
4015 | /* Clear the visited bit for every basic block in BLOCKS. */ | |
4016 | ||
4017 | static void | |
f1f41a6c | 4018 | tm_memopt_clear_visited (vec<basic_block> blocks) |
4c0315d0 | 4019 | { |
4020 | size_t i; | |
4021 | basic_block bb; | |
4022 | ||
f1f41a6c | 4023 | for (i = 0; blocks.iterate (i, &bb); ++i) |
4c0315d0 | 4024 | BB_VISITED_P (bb) = false; |
4025 | } | |
4026 | ||
4027 | /* Replace TM load/stores with hints for the runtime. We handle | |
4028 | things like read-after-write, write-after-read, read-after-read, | |
4029 | read-for-write, etc. */ | |
4030 | ||
4031 | static unsigned int | |
4032 | execute_tm_memopt (void) | |
4033 | { | |
4034 | struct tm_region *region; | |
f1f41a6c | 4035 | vec<basic_block> bbs; |
4c0315d0 | 4036 | |
4037 | tm_memopt_value_id = 0; | |
c1f445d2 | 4038 | tm_memopt_value_numbers = new hash_table<tm_memop_hasher> (10); |
4c0315d0 | 4039 | |
4040 | for (region = all_tm_regions; region; region = region->next) | |
4041 | { | |
4042 | /* All the TM stores/loads in the current region. */ | |
4043 | size_t i; | |
4044 | basic_block bb; | |
4045 | ||
4046 | bitmap_obstack_initialize (&tm_memopt_obstack); | |
4047 | ||
4048 | /* Save all BBs for the current region. */ | |
4049 | bbs = get_tm_region_blocks (region->entry_block, | |
4050 | region->exit_blocks, | |
4051 | region->irr_blocks, | |
4052 | NULL, | |
4053 | false); | |
4054 | ||
4055 | /* Collect all the memory operations. */ | |
f1f41a6c | 4056 | for (i = 0; bbs.iterate (i, &bb); ++i) |
4c0315d0 | 4057 | { |
4058 | bb->aux = tm_memopt_init_sets (); | |
4059 | tm_memopt_accumulate_memops (bb); | |
4060 | } | |
4061 | ||
4062 | /* Solve data flow equations and transform each block accordingly. */ | |
4063 | tm_memopt_clear_visited (bbs); | |
4064 | tm_memopt_compute_available (region, bbs); | |
4065 | tm_memopt_clear_visited (bbs); | |
4066 | tm_memopt_compute_antic (region, bbs); | |
4067 | tm_memopt_transform_blocks (bbs); | |
4068 | ||
4069 | tm_memopt_free_sets (bbs); | |
f1f41a6c | 4070 | bbs.release (); |
4c0315d0 | 4071 | bitmap_obstack_release (&tm_memopt_obstack); |
c1f445d2 | 4072 | tm_memopt_value_numbers->empty (); |
4c0315d0 | 4073 | } |
4074 | ||
c1f445d2 | 4075 | delete tm_memopt_value_numbers; |
4076 | tm_memopt_value_numbers = NULL; | |
4c0315d0 | 4077 | return 0; |
4078 | } | |
4079 | ||
7620bc82 | 4080 | namespace { |
4081 | ||
4082 | const pass_data pass_data_tm_memopt = | |
cbe8bda8 | 4083 | { |
4084 | GIMPLE_PASS, /* type */ | |
4085 | "tmmemopt", /* name */ | |
4086 | OPTGROUP_NONE, /* optinfo_flags */ | |
cbe8bda8 | 4087 | TV_TRANS_MEM, /* tv_id */ |
4088 | ( PROP_ssa | PROP_cfg ), /* properties_required */ | |
4089 | 0, /* properties_provided */ | |
4090 | 0, /* properties_destroyed */ | |
4091 | 0, /* todo_flags_start */ | |
4092 | 0, /* todo_flags_finish */ | |
4c0315d0 | 4093 | }; |
4094 | ||
7620bc82 | 4095 | class pass_tm_memopt : public gimple_opt_pass |
cbe8bda8 | 4096 | { |
4097 | public: | |
9af5ce0c | 4098 | pass_tm_memopt (gcc::context *ctxt) |
4099 | : gimple_opt_pass (pass_data_tm_memopt, ctxt) | |
cbe8bda8 | 4100 | {} |
4101 | ||
4102 | /* opt_pass methods: */ | |
31315c24 | 4103 | virtual bool gate (function *) { return flag_tm && optimize > 0; } |
65b0537f | 4104 | virtual unsigned int execute (function *) { return execute_tm_memopt (); } |
cbe8bda8 | 4105 | |
4106 | }; // class pass_tm_memopt | |
4107 | ||
7620bc82 | 4108 | } // anon namespace |
4109 | ||
cbe8bda8 | 4110 | gimple_opt_pass * |
4111 | make_pass_tm_memopt (gcc::context *ctxt) | |
4112 | { | |
4113 | return new pass_tm_memopt (ctxt); | |
4114 | } | |
4115 | ||
4c0315d0 | 4116 | \f |
4117 | /* Interprocedual analysis for the creation of transactional clones. | |
4118 | The aim of this pass is to find which functions are referenced in | |
4119 | a non-irrevocable transaction context, and for those over which | |
4120 | we have control (or user directive), create a version of the | |
4121 | function which uses only the transactional interface to reference | |
4122 | protected memories. This analysis proceeds in several steps: | |
4123 | ||
4124 | (1) Collect the set of all possible transactional clones: | |
4125 | ||
4126 | (a) For all local public functions marked tm_callable, push | |
4127 | it onto the tm_callee queue. | |
4128 | ||
4129 | (b) For all local functions, scan for calls in transaction blocks. | |
4130 | Push the caller and callee onto the tm_caller and tm_callee | |
4131 | queues. Count the number of callers for each callee. | |
4132 | ||
4133 | (c) For each local function on the callee list, assume we will | |
4134 | create a transactional clone. Push *all* calls onto the | |
4135 | callee queues; count the number of clone callers separately | |
4136 | to the number of original callers. | |
4137 | ||
4138 | (2) Propagate irrevocable status up the dominator tree: | |
4139 | ||
4140 | (a) Any external function on the callee list that is not marked | |
4141 | tm_callable is irrevocable. Push all callers of such onto | |
4142 | a worklist. | |
4143 | ||
4144 | (b) For each function on the worklist, mark each block that | |
4145 | contains an irrevocable call. Use the AND operator to | |
4146 | propagate that mark up the dominator tree. | |
4147 | ||
4148 | (c) If we reach the entry block for a possible transactional | |
4149 | clone, then the transactional clone is irrevocable, and | |
4150 | we should not create the clone after all. Push all | |
4151 | callers onto the worklist. | |
4152 | ||
4153 | (d) Place tm_irrevocable calls at the beginning of the relevant | |
4154 | blocks. Special case here is the entry block for the entire | |
4155 | transaction region; there we mark it GTMA_DOES_GO_IRREVOCABLE for | |
4156 | the library to begin the region in serial mode. Decrement | |
4157 | the call count for all callees in the irrevocable region. | |
4158 | ||
4159 | (3) Create the transactional clones: | |
4160 | ||
4161 | Any tm_callee that still has a non-zero call count is cloned. | |
4162 | */ | |
4163 | ||
4164 | /* This structure is stored in the AUX field of each cgraph_node. */ | |
4165 | struct tm_ipa_cg_data | |
4166 | { | |
4167 | /* The clone of the function that got created. */ | |
4168 | struct cgraph_node *clone; | |
4169 | ||
4170 | /* The tm regions in the normal function. */ | |
4171 | struct tm_region *all_tm_regions; | |
4172 | ||
4173 | /* The blocks of the normal/clone functions that contain irrevocable | |
4174 | calls, or blocks that are post-dominated by irrevocable calls. */ | |
4175 | bitmap irrevocable_blocks_normal; | |
4176 | bitmap irrevocable_blocks_clone; | |
4177 | ||
4178 | /* The blocks of the normal function that are involved in transactions. */ | |
4179 | bitmap transaction_blocks_normal; | |
4180 | ||
4181 | /* The number of callers to the transactional clone of this function | |
4182 | from normal and transactional clones respectively. */ | |
4183 | unsigned tm_callers_normal; | |
4184 | unsigned tm_callers_clone; | |
4185 | ||
4186 | /* True if all calls to this function's transactional clone | |
4187 | are irrevocable. Also automatically true if the function | |
4188 | has no transactional clone. */ | |
4189 | bool is_irrevocable; | |
4190 | ||
4191 | /* Flags indicating the presence of this function in various queues. */ | |
4192 | bool in_callee_queue; | |
4193 | bool in_worklist; | |
4194 | ||
4195 | /* Flags indicating the kind of scan desired while in the worklist. */ | |
4196 | bool want_irr_scan_normal; | |
4197 | }; | |
4198 | ||
415d1b9a | 4199 | typedef vec<cgraph_node *> cgraph_node_queue; |
4c0315d0 | 4200 | |
4201 | /* Return the ipa data associated with NODE, allocating zeroed memory | |
3e426b86 | 4202 | if necessary. TRAVERSE_ALIASES is true if we must traverse aliases |
4203 | and set *NODE accordingly. */ | |
4c0315d0 | 4204 | |
4205 | static struct tm_ipa_cg_data * | |
3e426b86 | 4206 | get_cg_data (struct cgraph_node **node, bool traverse_aliases) |
4c0315d0 | 4207 | { |
3e426b86 | 4208 | struct tm_ipa_cg_data *d; |
4209 | ||
02774f2d | 4210 | if (traverse_aliases && (*node)->alias) |
415d1b9a | 4211 | *node = (*node)->get_alias_target (); |
3e426b86 | 4212 | |
02774f2d | 4213 | d = (struct tm_ipa_cg_data *) (*node)->aux; |
4c0315d0 | 4214 | |
4215 | if (d == NULL) | |
4216 | { | |
4217 | d = (struct tm_ipa_cg_data *) | |
4218 | obstack_alloc (&tm_obstack.obstack, sizeof (*d)); | |
02774f2d | 4219 | (*node)->aux = (void *) d; |
4c0315d0 | 4220 | memset (d, 0, sizeof (*d)); |
4221 | } | |
4222 | ||
4223 | return d; | |
4224 | } | |
4225 | ||
4226 | /* Add NODE to the end of QUEUE, unless IN_QUEUE_P indicates that | |
4227 | it is already present. */ | |
4228 | ||
4229 | static void | |
4230 | maybe_push_queue (struct cgraph_node *node, | |
4231 | cgraph_node_queue *queue_p, bool *in_queue_p) | |
4232 | { | |
4233 | if (!*in_queue_p) | |
4234 | { | |
4235 | *in_queue_p = true; | |
f1f41a6c | 4236 | queue_p->safe_push (node); |
4c0315d0 | 4237 | } |
4238 | } | |
4239 | ||
4240 | /* A subroutine of ipa_tm_scan_calls_transaction and ipa_tm_scan_calls_clone. | |
4241 | Queue all callees within block BB. */ | |
4242 | ||
4243 | static void | |
4244 | ipa_tm_scan_calls_block (cgraph_node_queue *callees_p, | |
4245 | basic_block bb, bool for_clone) | |
4246 | { | |
4247 | gimple_stmt_iterator gsi; | |
4248 | ||
4249 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
4250 | { | |
42acab1c | 4251 | gimple *stmt = gsi_stmt (gsi); |
4c0315d0 | 4252 | if (is_gimple_call (stmt) && !is_tm_pure_call (stmt)) |
4253 | { | |
4254 | tree fndecl = gimple_call_fndecl (stmt); | |
4255 | if (fndecl) | |
4256 | { | |
4257 | struct tm_ipa_cg_data *d; | |
4258 | unsigned *pcallers; | |
4259 | struct cgraph_node *node; | |
4260 | ||
4261 | if (is_tm_ending_fndecl (fndecl)) | |
4262 | continue; | |
4263 | if (find_tm_replacement_function (fndecl)) | |
4264 | continue; | |
4265 | ||
415d1b9a | 4266 | node = cgraph_node::get (fndecl); |
4c0315d0 | 4267 | gcc_assert (node != NULL); |
3e426b86 | 4268 | d = get_cg_data (&node, true); |
4c0315d0 | 4269 | |
4270 | pcallers = (for_clone ? &d->tm_callers_clone | |
4271 | : &d->tm_callers_normal); | |
4272 | *pcallers += 1; | |
4273 | ||
4274 | maybe_push_queue (node, callees_p, &d->in_callee_queue); | |
4275 | } | |
4276 | } | |
4277 | } | |
4278 | } | |
4279 | ||
4280 | /* Scan all calls in NODE that are within a transaction region, | |
4281 | and push the resulting nodes into the callee queue. */ | |
4282 | ||
4283 | static void | |
4284 | ipa_tm_scan_calls_transaction (struct tm_ipa_cg_data *d, | |
4285 | cgraph_node_queue *callees_p) | |
4286 | { | |
4c0315d0 | 4287 | d->transaction_blocks_normal = BITMAP_ALLOC (&tm_obstack); |
4288 | d->all_tm_regions = all_tm_regions; | |
4289 | ||
a08574d7 | 4290 | for (tm_region *r = all_tm_regions; r; r = r->next) |
4c0315d0 | 4291 | { |
f1f41a6c | 4292 | vec<basic_block> bbs; |
4c0315d0 | 4293 | basic_block bb; |
4294 | unsigned i; | |
4295 | ||
4296 | bbs = get_tm_region_blocks (r->entry_block, r->exit_blocks, NULL, | |
a08574d7 | 4297 | d->transaction_blocks_normal, false, false); |
0cd02a19 | 4298 | |
f1f41a6c | 4299 | FOR_EACH_VEC_ELT (bbs, i, bb) |
4c0315d0 | 4300 | ipa_tm_scan_calls_block (callees_p, bb, false); |
4301 | ||
f1f41a6c | 4302 | bbs.release (); |
4c0315d0 | 4303 | } |
4304 | } | |
4305 | ||
4306 | /* Scan all calls in NODE as if this is the transactional clone, | |
4307 | and push the destinations into the callee queue. */ | |
4308 | ||
4309 | static void | |
4310 | ipa_tm_scan_calls_clone (struct cgraph_node *node, | |
4311 | cgraph_node_queue *callees_p) | |
4312 | { | |
02774f2d | 4313 | struct function *fn = DECL_STRUCT_FUNCTION (node->decl); |
4c0315d0 | 4314 | basic_block bb; |
4315 | ||
4316 | FOR_EACH_BB_FN (bb, fn) | |
4317 | ipa_tm_scan_calls_block (callees_p, bb, true); | |
4318 | } | |
4319 | ||
4320 | /* The function NODE has been detected to be irrevocable. Push all | |
4321 | of its callers onto WORKLIST for the purpose of re-scanning them. */ | |
4322 | ||
4323 | static void | |
4324 | ipa_tm_note_irrevocable (struct cgraph_node *node, | |
4325 | cgraph_node_queue *worklist_p) | |
4326 | { | |
3e426b86 | 4327 | struct tm_ipa_cg_data *d = get_cg_data (&node, true); |
4c0315d0 | 4328 | struct cgraph_edge *e; |
4329 | ||
4330 | d->is_irrevocable = true; | |
4331 | ||
4332 | for (e = node->callers; e ; e = e->next_caller) | |
4333 | { | |
4334 | basic_block bb; | |
3e426b86 | 4335 | struct cgraph_node *caller; |
4c0315d0 | 4336 | |
4337 | /* Don't examine recursive calls. */ | |
4338 | if (e->caller == node) | |
4339 | continue; | |
4340 | /* Even if we think we can go irrevocable, believe the user | |
4341 | above all. */ | |
02774f2d | 4342 | if (is_tm_safe_or_pure (e->caller->decl)) |
4c0315d0 | 4343 | continue; |
4344 | ||
3e426b86 | 4345 | caller = e->caller; |
4346 | d = get_cg_data (&caller, true); | |
4c0315d0 | 4347 | |
4348 | /* Check if the callee is in a transactional region. If so, | |
4349 | schedule the function for normal re-scan as well. */ | |
4350 | bb = gimple_bb (e->call_stmt); | |
4351 | gcc_assert (bb != NULL); | |
4352 | if (d->transaction_blocks_normal | |
4353 | && bitmap_bit_p (d->transaction_blocks_normal, bb->index)) | |
4354 | d->want_irr_scan_normal = true; | |
4355 | ||
3e426b86 | 4356 | maybe_push_queue (caller, worklist_p, &d->in_worklist); |
4c0315d0 | 4357 | } |
4358 | } | |
4359 | ||
4360 | /* A subroutine of ipa_tm_scan_irr_blocks; return true iff any statement | |
4361 | within the block is irrevocable. */ | |
4362 | ||
4363 | static bool | |
4364 | ipa_tm_scan_irr_block (basic_block bb) | |
4365 | { | |
4366 | gimple_stmt_iterator gsi; | |
4367 | tree fn; | |
4368 | ||
4369 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
4370 | { | |
42acab1c | 4371 | gimple *stmt = gsi_stmt (gsi); |
4c0315d0 | 4372 | switch (gimple_code (stmt)) |
4373 | { | |
e153bd50 | 4374 | case GIMPLE_ASSIGN: |
4375 | if (gimple_assign_single_p (stmt)) | |
4376 | { | |
4377 | tree lhs = gimple_assign_lhs (stmt); | |
4378 | tree rhs = gimple_assign_rhs1 (stmt); | |
639b72bd | 4379 | if (volatile_lvalue_p (lhs) || volatile_lvalue_p (rhs)) |
e153bd50 | 4380 | return true; |
4381 | } | |
4382 | break; | |
4383 | ||
4c0315d0 | 4384 | case GIMPLE_CALL: |
e153bd50 | 4385 | { |
4386 | tree lhs = gimple_call_lhs (stmt); | |
639b72bd | 4387 | if (lhs && volatile_lvalue_p (lhs)) |
e153bd50 | 4388 | return true; |
4c0315d0 | 4389 | |
e153bd50 | 4390 | if (is_tm_pure_call (stmt)) |
4391 | break; | |
4c0315d0 | 4392 | |
e153bd50 | 4393 | fn = gimple_call_fn (stmt); |
4c0315d0 | 4394 | |
e153bd50 | 4395 | /* Functions with the attribute are by definition irrevocable. */ |
4396 | if (is_tm_irrevocable (fn)) | |
4397 | return true; | |
4c0315d0 | 4398 | |
e153bd50 | 4399 | /* For direct function calls, go ahead and check for replacement |
4400 | functions, or transitive irrevocable functions. For indirect | |
4401 | functions, we'll ask the runtime. */ | |
4402 | if (TREE_CODE (fn) == ADDR_EXPR) | |
4403 | { | |
4404 | struct tm_ipa_cg_data *d; | |
4405 | struct cgraph_node *node; | |
4c0315d0 | 4406 | |
e153bd50 | 4407 | fn = TREE_OPERAND (fn, 0); |
4408 | if (is_tm_ending_fndecl (fn)) | |
4409 | break; | |
4410 | if (find_tm_replacement_function (fn)) | |
4411 | break; | |
40879ac6 | 4412 | |
415d1b9a | 4413 | node = cgraph_node::get (fn); |
e153bd50 | 4414 | d = get_cg_data (&node, true); |
4415 | ||
4416 | /* Return true if irrevocable, but above all, believe | |
4417 | the user. */ | |
4418 | if (d->is_irrevocable | |
4419 | && !is_tm_safe_or_pure (fn)) | |
4420 | return true; | |
4421 | } | |
4422 | break; | |
4423 | } | |
4c0315d0 | 4424 | |
4425 | case GIMPLE_ASM: | |
4426 | /* ??? The Approved Method of indicating that an inline | |
4427 | assembly statement is not relevant to the transaction | |
4428 | is to wrap it in a __tm_waiver block. This is not | |
4429 | yet implemented, so we can't check for it. */ | |
43156aa3 | 4430 | if (is_tm_safe (current_function_decl)) |
4431 | { | |
4432 | tree t = build1 (NOP_EXPR, void_type_node, size_zero_node); | |
4433 | SET_EXPR_LOCATION (t, gimple_location (stmt)); | |
43156aa3 | 4434 | error ("%Kasm not allowed in %<transaction_safe%> function", t); |
4435 | } | |
4c0315d0 | 4436 | return true; |
4437 | ||
4438 | default: | |
4439 | break; | |
4440 | } | |
4441 | } | |
4442 | ||
4443 | return false; | |
4444 | } | |
4445 | ||
4446 | /* For each of the blocks seeded witin PQUEUE, walk the CFG looking | |
4447 | for new irrevocable blocks, marking them in NEW_IRR. Don't bother | |
4448 | scanning past OLD_IRR or EXIT_BLOCKS. */ | |
4449 | ||
4450 | static bool | |
f1f41a6c | 4451 | ipa_tm_scan_irr_blocks (vec<basic_block> *pqueue, bitmap new_irr, |
4c0315d0 | 4452 | bitmap old_irr, bitmap exit_blocks) |
4453 | { | |
4454 | bool any_new_irr = false; | |
4455 | edge e; | |
4456 | edge_iterator ei; | |
4457 | bitmap visited_blocks = BITMAP_ALLOC (NULL); | |
4458 | ||
4459 | do | |
4460 | { | |
f1f41a6c | 4461 | basic_block bb = pqueue->pop (); |
4c0315d0 | 4462 | |
4463 | /* Don't re-scan blocks we know already are irrevocable. */ | |
4464 | if (old_irr && bitmap_bit_p (old_irr, bb->index)) | |
4465 | continue; | |
4466 | ||
4467 | if (ipa_tm_scan_irr_block (bb)) | |
4468 | { | |
4469 | bitmap_set_bit (new_irr, bb->index); | |
4470 | any_new_irr = true; | |
4471 | } | |
4472 | else if (exit_blocks == NULL || !bitmap_bit_p (exit_blocks, bb->index)) | |
4473 | { | |
4474 | FOR_EACH_EDGE (e, ei, bb->succs) | |
4475 | if (!bitmap_bit_p (visited_blocks, e->dest->index)) | |
4476 | { | |
4477 | bitmap_set_bit (visited_blocks, e->dest->index); | |
f1f41a6c | 4478 | pqueue->safe_push (e->dest); |
4c0315d0 | 4479 | } |
4480 | } | |
4481 | } | |
f1f41a6c | 4482 | while (!pqueue->is_empty ()); |
4c0315d0 | 4483 | |
4484 | BITMAP_FREE (visited_blocks); | |
4485 | ||
4486 | return any_new_irr; | |
4487 | } | |
4488 | ||
4489 | /* Propagate the irrevocable property both up and down the dominator tree. | |
4490 | BB is the current block being scanned; EXIT_BLOCKS are the edges of the | |
4491 | TM regions; OLD_IRR are the results of a previous scan of the dominator | |
4492 | tree which has been fully propagated; NEW_IRR is the set of new blocks | |
4493 | which are gaining the irrevocable property during the current scan. */ | |
4494 | ||
4495 | static void | |
4496 | ipa_tm_propagate_irr (basic_block entry_block, bitmap new_irr, | |
4497 | bitmap old_irr, bitmap exit_blocks) | |
4498 | { | |
f1f41a6c | 4499 | vec<basic_block> bbs; |
4c0315d0 | 4500 | bitmap all_region_blocks; |
4501 | ||
4502 | /* If this block is in the old set, no need to rescan. */ | |
4503 | if (old_irr && bitmap_bit_p (old_irr, entry_block->index)) | |
4504 | return; | |
4505 | ||
4506 | all_region_blocks = BITMAP_ALLOC (&tm_obstack); | |
4507 | bbs = get_tm_region_blocks (entry_block, exit_blocks, NULL, | |
4508 | all_region_blocks, false); | |
4509 | do | |
4510 | { | |
f1f41a6c | 4511 | basic_block bb = bbs.pop (); |
4c0315d0 | 4512 | bool this_irr = bitmap_bit_p (new_irr, bb->index); |
4513 | bool all_son_irr = false; | |
4514 | edge_iterator ei; | |
4515 | edge e; | |
4516 | ||
4517 | /* Propagate up. If my children are, I am too, but we must have | |
4518 | at least one child that is. */ | |
4519 | if (!this_irr) | |
4520 | { | |
4521 | FOR_EACH_EDGE (e, ei, bb->succs) | |
4522 | { | |
4523 | if (!bitmap_bit_p (new_irr, e->dest->index)) | |
4524 | { | |
4525 | all_son_irr = false; | |
4526 | break; | |
4527 | } | |
4528 | else | |
4529 | all_son_irr = true; | |
4530 | } | |
4531 | if (all_son_irr) | |
4532 | { | |
4533 | /* Add block to new_irr if it hasn't already been processed. */ | |
4534 | if (!old_irr || !bitmap_bit_p (old_irr, bb->index)) | |
4535 | { | |
4536 | bitmap_set_bit (new_irr, bb->index); | |
4537 | this_irr = true; | |
4538 | } | |
4539 | } | |
4540 | } | |
4541 | ||
4542 | /* Propagate down to everyone we immediately dominate. */ | |
4543 | if (this_irr) | |
4544 | { | |
4545 | basic_block son; | |
4546 | for (son = first_dom_son (CDI_DOMINATORS, bb); | |
4547 | son; | |
4548 | son = next_dom_son (CDI_DOMINATORS, son)) | |
4549 | { | |
4550 | /* Make sure block is actually in a TM region, and it | |
4551 | isn't already in old_irr. */ | |
4552 | if ((!old_irr || !bitmap_bit_p (old_irr, son->index)) | |
4553 | && bitmap_bit_p (all_region_blocks, son->index)) | |
4554 | bitmap_set_bit (new_irr, son->index); | |
4555 | } | |
4556 | } | |
4557 | } | |
f1f41a6c | 4558 | while (!bbs.is_empty ()); |
4c0315d0 | 4559 | |
4560 | BITMAP_FREE (all_region_blocks); | |
f1f41a6c | 4561 | bbs.release (); |
4c0315d0 | 4562 | } |
4563 | ||
4564 | static void | |
4565 | ipa_tm_decrement_clone_counts (basic_block bb, bool for_clone) | |
4566 | { | |
4567 | gimple_stmt_iterator gsi; | |
4568 | ||
4569 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
4570 | { | |
42acab1c | 4571 | gimple *stmt = gsi_stmt (gsi); |
4c0315d0 | 4572 | if (is_gimple_call (stmt) && !is_tm_pure_call (stmt)) |
4573 | { | |
4574 | tree fndecl = gimple_call_fndecl (stmt); | |
4575 | if (fndecl) | |
4576 | { | |
4577 | struct tm_ipa_cg_data *d; | |
4578 | unsigned *pcallers; | |
3e426b86 | 4579 | struct cgraph_node *tnode; |
4c0315d0 | 4580 | |
4581 | if (is_tm_ending_fndecl (fndecl)) | |
4582 | continue; | |
4583 | if (find_tm_replacement_function (fndecl)) | |
4584 | continue; | |
4585 | ||
415d1b9a | 4586 | tnode = cgraph_node::get (fndecl); |
3e426b86 | 4587 | d = get_cg_data (&tnode, true); |
4588 | ||
4c0315d0 | 4589 | pcallers = (for_clone ? &d->tm_callers_clone |
4590 | : &d->tm_callers_normal); | |
4591 | ||
4592 | gcc_assert (*pcallers > 0); | |
4593 | *pcallers -= 1; | |
4594 | } | |
4595 | } | |
4596 | } | |
4597 | } | |
4598 | ||
4599 | /* (Re-)Scan the transaction blocks in NODE for calls to irrevocable functions, | |
4600 | as well as other irrevocable actions such as inline assembly. Mark all | |
4601 | such blocks as irrevocable and decrement the number of calls to | |
4602 | transactional clones. Return true if, for the transactional clone, the | |
4603 | entire function is irrevocable. */ | |
4604 | ||
4605 | static bool | |
4606 | ipa_tm_scan_irr_function (struct cgraph_node *node, bool for_clone) | |
4607 | { | |
4608 | struct tm_ipa_cg_data *d; | |
4609 | bitmap new_irr, old_irr; | |
4c0315d0 | 4610 | bool ret = false; |
4611 | ||
40879ac6 | 4612 | /* Builtin operators (operator new, and such). */ |
02774f2d | 4613 | if (DECL_STRUCT_FUNCTION (node->decl) == NULL |
4614 | || DECL_STRUCT_FUNCTION (node->decl)->cfg == NULL) | |
40879ac6 | 4615 | return false; |
4616 | ||
02774f2d | 4617 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); |
4c0315d0 | 4618 | calculate_dominance_info (CDI_DOMINATORS); |
4619 | ||
3e426b86 | 4620 | d = get_cg_data (&node, true); |
4997014d | 4621 | auto_vec<basic_block, 10> queue; |
4c0315d0 | 4622 | new_irr = BITMAP_ALLOC (&tm_obstack); |
4623 | ||
4624 | /* Scan each tm region, propagating irrevocable status through the tree. */ | |
4625 | if (for_clone) | |
4626 | { | |
4627 | old_irr = d->irrevocable_blocks_clone; | |
34154e27 | 4628 | queue.quick_push (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun))); |
4c0315d0 | 4629 | if (ipa_tm_scan_irr_blocks (&queue, new_irr, old_irr, NULL)) |
4630 | { | |
34154e27 | 4631 | ipa_tm_propagate_irr (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun)), |
4632 | new_irr, | |
4c0315d0 | 4633 | old_irr, NULL); |
34154e27 | 4634 | ret = bitmap_bit_p (new_irr, |
4635 | single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun))->index); | |
4c0315d0 | 4636 | } |
4637 | } | |
4638 | else | |
4639 | { | |
4640 | struct tm_region *region; | |
4641 | ||
4642 | old_irr = d->irrevocable_blocks_normal; | |
4643 | for (region = d->all_tm_regions; region; region = region->next) | |
4644 | { | |
f1f41a6c | 4645 | queue.quick_push (region->entry_block); |
4c0315d0 | 4646 | if (ipa_tm_scan_irr_blocks (&queue, new_irr, old_irr, |
4647 | region->exit_blocks)) | |
4648 | ipa_tm_propagate_irr (region->entry_block, new_irr, old_irr, | |
4649 | region->exit_blocks); | |
4650 | } | |
4651 | } | |
4652 | ||
4653 | /* If we found any new irrevocable blocks, reduce the call count for | |
4654 | transactional clones within the irrevocable blocks. Save the new | |
4655 | set of irrevocable blocks for next time. */ | |
4656 | if (!bitmap_empty_p (new_irr)) | |
4657 | { | |
4658 | bitmap_iterator bmi; | |
4659 | unsigned i; | |
4660 | ||
4661 | EXECUTE_IF_SET_IN_BITMAP (new_irr, 0, i, bmi) | |
f5a6b05f | 4662 | ipa_tm_decrement_clone_counts (BASIC_BLOCK_FOR_FN (cfun, i), |
4663 | for_clone); | |
4c0315d0 | 4664 | |
4665 | if (old_irr) | |
4666 | { | |
4667 | bitmap_ior_into (old_irr, new_irr); | |
4668 | BITMAP_FREE (new_irr); | |
4669 | } | |
4670 | else if (for_clone) | |
4671 | d->irrevocable_blocks_clone = new_irr; | |
4672 | else | |
4673 | d->irrevocable_blocks_normal = new_irr; | |
4674 | ||
4675 | if (dump_file && new_irr) | |
4676 | { | |
4677 | const char *dname; | |
4678 | bitmap_iterator bmi; | |
4679 | unsigned i; | |
4680 | ||
4681 | dname = lang_hooks.decl_printable_name (current_function_decl, 2); | |
4682 | EXECUTE_IF_SET_IN_BITMAP (new_irr, 0, i, bmi) | |
4683 | fprintf (dump_file, "%s: bb %d goes irrevocable\n", dname, i); | |
4684 | } | |
4685 | } | |
4686 | else | |
4687 | BITMAP_FREE (new_irr); | |
4688 | ||
4c0315d0 | 4689 | pop_cfun (); |
4c0315d0 | 4690 | |
4691 | return ret; | |
4692 | } | |
4693 | ||
4694 | /* Return true if, for the transactional clone of NODE, any call | |
4695 | may enter irrevocable mode. */ | |
4696 | ||
4697 | static bool | |
4698 | ipa_tm_mayenterirr_function (struct cgraph_node *node) | |
4699 | { | |
3e426b86 | 4700 | struct tm_ipa_cg_data *d; |
4701 | tree decl; | |
4702 | unsigned flags; | |
4703 | ||
4704 | d = get_cg_data (&node, true); | |
02774f2d | 4705 | decl = node->decl; |
3e426b86 | 4706 | flags = flags_from_decl_or_type (decl); |
4c0315d0 | 4707 | |
4708 | /* Handle some TM builtins. Ordinarily these aren't actually generated | |
4709 | at this point, but handling these functions when written in by the | |
4710 | user makes it easier to build unit tests. */ | |
4711 | if (flags & ECF_TM_BUILTIN) | |
4712 | return false; | |
4713 | ||
4714 | /* Filter out all functions that are marked. */ | |
4715 | if (flags & ECF_TM_PURE) | |
4716 | return false; | |
4717 | if (is_tm_safe (decl)) | |
4718 | return false; | |
4719 | if (is_tm_irrevocable (decl)) | |
4720 | return true; | |
4721 | if (is_tm_callable (decl)) | |
4722 | return true; | |
4723 | if (find_tm_replacement_function (decl)) | |
4724 | return true; | |
4725 | ||
4726 | /* If we aren't seeing the final version of the function we don't | |
4727 | know what it will contain at runtime. */ | |
415d1b9a | 4728 | if (node->get_availability () < AVAIL_AVAILABLE) |
4c0315d0 | 4729 | return true; |
4730 | ||
4731 | /* If the function must go irrevocable, then of course true. */ | |
4732 | if (d->is_irrevocable) | |
4733 | return true; | |
4734 | ||
4735 | /* If there are any blocks marked irrevocable, then the function | |
4736 | as a whole may enter irrevocable. */ | |
4737 | if (d->irrevocable_blocks_clone) | |
4738 | return true; | |
4739 | ||
4740 | /* We may have previously marked this function as tm_may_enter_irr; | |
4741 | see pass_diagnose_tm_blocks. */ | |
4742 | if (node->local.tm_may_enter_irr) | |
4743 | return true; | |
4744 | ||
4745 | /* Recurse on the main body for aliases. In general, this will | |
4746 | result in one of the bits above being set so that we will not | |
4747 | have to recurse next time. */ | |
02774f2d | 4748 | if (node->alias) |
415d1b9a | 4749 | return ipa_tm_mayenterirr_function (cgraph_node::get (node->thunk.alias)); |
4c0315d0 | 4750 | |
4751 | /* What remains is unmarked local functions without items that force | |
4752 | the function to go irrevocable. */ | |
4753 | return false; | |
4754 | } | |
4755 | ||
4756 | /* Diagnose calls from transaction_safe functions to unmarked | |
4757 | functions that are determined to not be safe. */ | |
4758 | ||
4759 | static void | |
4760 | ipa_tm_diagnose_tm_safe (struct cgraph_node *node) | |
4761 | { | |
4762 | struct cgraph_edge *e; | |
4763 | ||
4764 | for (e = node->callees; e ; e = e->next_callee) | |
02774f2d | 4765 | if (!is_tm_callable (e->callee->decl) |
4c0315d0 | 4766 | && e->callee->local.tm_may_enter_irr) |
4767 | error_at (gimple_location (e->call_stmt), | |
4768 | "unsafe function call %qD within " | |
02774f2d | 4769 | "%<transaction_safe%> function", e->callee->decl); |
4c0315d0 | 4770 | } |
4771 | ||
4772 | /* Diagnose call from atomic transactions to unmarked functions | |
4773 | that are determined to not be safe. */ | |
4774 | ||
4775 | static void | |
4776 | ipa_tm_diagnose_transaction (struct cgraph_node *node, | |
4777 | struct tm_region *all_tm_regions) | |
4778 | { | |
4779 | struct tm_region *r; | |
4780 | ||
4781 | for (r = all_tm_regions; r ; r = r->next) | |
1a91d914 | 4782 | if (gimple_transaction_subcode (r->get_transaction_stmt ()) |
4783 | & GTMA_IS_RELAXED) | |
4c0315d0 | 4784 | { |
4785 | /* Atomic transactions can be nested inside relaxed. */ | |
4786 | if (r->inner) | |
4787 | ipa_tm_diagnose_transaction (node, r->inner); | |
4788 | } | |
4789 | else | |
4790 | { | |
f1f41a6c | 4791 | vec<basic_block> bbs; |
4c0315d0 | 4792 | gimple_stmt_iterator gsi; |
4793 | basic_block bb; | |
4794 | size_t i; | |
4795 | ||
4796 | bbs = get_tm_region_blocks (r->entry_block, r->exit_blocks, | |
4797 | r->irr_blocks, NULL, false); | |
4798 | ||
f1f41a6c | 4799 | for (i = 0; bbs.iterate (i, &bb); ++i) |
4c0315d0 | 4800 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
4801 | { | |
42acab1c | 4802 | gimple *stmt = gsi_stmt (gsi); |
4c0315d0 | 4803 | tree fndecl; |
4804 | ||
4805 | if (gimple_code (stmt) == GIMPLE_ASM) | |
4806 | { | |
4807 | error_at (gimple_location (stmt), | |
4808 | "asm not allowed in atomic transaction"); | |
4809 | continue; | |
4810 | } | |
4811 | ||
4812 | if (!is_gimple_call (stmt)) | |
4813 | continue; | |
4814 | fndecl = gimple_call_fndecl (stmt); | |
4815 | ||
4816 | /* Indirect function calls have been diagnosed already. */ | |
4817 | if (!fndecl) | |
4818 | continue; | |
4819 | ||
4820 | /* Stop at the end of the transaction. */ | |
4821 | if (is_tm_ending_fndecl (fndecl)) | |
4822 | { | |
4823 | if (bitmap_bit_p (r->exit_blocks, bb->index)) | |
4824 | break; | |
4825 | continue; | |
4826 | } | |
4827 | ||
4828 | /* Marked functions have been diagnosed already. */ | |
4829 | if (is_tm_pure_call (stmt)) | |
4830 | continue; | |
4831 | if (is_tm_callable (fndecl)) | |
4832 | continue; | |
4833 | ||
35ee1c66 | 4834 | if (cgraph_node::local_info (fndecl)->tm_may_enter_irr) |
4c0315d0 | 4835 | error_at (gimple_location (stmt), |
4836 | "unsafe function call %qD within " | |
4837 | "atomic transaction", fndecl); | |
4838 | } | |
4839 | ||
f1f41a6c | 4840 | bbs.release (); |
4c0315d0 | 4841 | } |
4842 | } | |
4843 | ||
4844 | /* Return a transactional mangled name for the DECL_ASSEMBLER_NAME in | |
4845 | OLD_DECL. The returned value is a freshly malloced pointer that | |
4846 | should be freed by the caller. */ | |
4847 | ||
4848 | static tree | |
4849 | tm_mangle (tree old_asm_id) | |
4850 | { | |
4851 | const char *old_asm_name; | |
4852 | char *tm_name; | |
4853 | void *alloc = NULL; | |
4854 | struct demangle_component *dc; | |
4855 | tree new_asm_id; | |
4856 | ||
4857 | /* Determine if the symbol is already a valid C++ mangled name. Do this | |
4858 | even for C, which might be interfacing with C++ code via appropriately | |
4859 | ugly identifiers. */ | |
4860 | /* ??? We could probably do just as well checking for "_Z" and be done. */ | |
4861 | old_asm_name = IDENTIFIER_POINTER (old_asm_id); | |
4862 | dc = cplus_demangle_v3_components (old_asm_name, DMGL_NO_OPTS, &alloc); | |
4863 | ||
4864 | if (dc == NULL) | |
4865 | { | |
4866 | char length[8]; | |
4867 | ||
4868 | do_unencoded: | |
4869 | sprintf (length, "%u", IDENTIFIER_LENGTH (old_asm_id)); | |
4870 | tm_name = concat ("_ZGTt", length, old_asm_name, NULL); | |
4871 | } | |
4872 | else | |
4873 | { | |
4874 | old_asm_name += 2; /* Skip _Z */ | |
4875 | ||
4876 | switch (dc->type) | |
4877 | { | |
4878 | case DEMANGLE_COMPONENT_TRANSACTION_CLONE: | |
4879 | case DEMANGLE_COMPONENT_NONTRANSACTION_CLONE: | |
4880 | /* Don't play silly games, you! */ | |
4881 | goto do_unencoded; | |
4882 | ||
4883 | case DEMANGLE_COMPONENT_HIDDEN_ALIAS: | |
4884 | /* I'd really like to know if we can ever be passed one of | |
4885 | these from the C++ front end. The Logical Thing would | |
4886 | seem that hidden-alias should be outer-most, so that we | |
4887 | get hidden-alias of a transaction-clone and not vice-versa. */ | |
4888 | old_asm_name += 2; | |
4889 | break; | |
4890 | ||
4891 | default: | |
4892 | break; | |
4893 | } | |
4894 | ||
4895 | tm_name = concat ("_ZGTt", old_asm_name, NULL); | |
4896 | } | |
4897 | free (alloc); | |
4898 | ||
4899 | new_asm_id = get_identifier (tm_name); | |
4900 | free (tm_name); | |
4901 | ||
4902 | return new_asm_id; | |
4903 | } | |
4904 | ||
4905 | static inline void | |
8efa224a | 4906 | ipa_tm_mark_force_output_node (struct cgraph_node *node) |
4c0315d0 | 4907 | { |
415d1b9a | 4908 | node->mark_force_output (); |
02774f2d | 4909 | node->analyzed = true; |
4c0315d0 | 4910 | } |
4911 | ||
6a1c0403 | 4912 | static inline void |
4913 | ipa_tm_mark_forced_by_abi_node (struct cgraph_node *node) | |
4914 | { | |
02774f2d | 4915 | node->forced_by_abi = true; |
4916 | node->analyzed = true; | |
6a1c0403 | 4917 | } |
4918 | ||
4c0315d0 | 4919 | /* Callback data for ipa_tm_create_version_alias. */ |
4920 | struct create_version_alias_info | |
4921 | { | |
4922 | struct cgraph_node *old_node; | |
4923 | tree new_decl; | |
4924 | }; | |
4925 | ||
caf29404 | 4926 | /* A subroutine of ipa_tm_create_version, called via |
4c0315d0 | 4927 | cgraph_for_node_and_aliases. Create new tm clones for each of |
4928 | the existing aliases. */ | |
4929 | static bool | |
4930 | ipa_tm_create_version_alias (struct cgraph_node *node, void *data) | |
4931 | { | |
4932 | struct create_version_alias_info *info | |
4933 | = (struct create_version_alias_info *)data; | |
4934 | tree old_decl, new_decl, tm_name; | |
4935 | struct cgraph_node *new_node; | |
4936 | ||
02774f2d | 4937 | if (!node->cpp_implicit_alias) |
4c0315d0 | 4938 | return false; |
4939 | ||
02774f2d | 4940 | old_decl = node->decl; |
4c0315d0 | 4941 | tm_name = tm_mangle (DECL_ASSEMBLER_NAME (old_decl)); |
4942 | new_decl = build_decl (DECL_SOURCE_LOCATION (old_decl), | |
4943 | TREE_CODE (old_decl), tm_name, | |
4944 | TREE_TYPE (old_decl)); | |
4945 | ||
4946 | SET_DECL_ASSEMBLER_NAME (new_decl, tm_name); | |
4947 | SET_DECL_RTL (new_decl, NULL); | |
4948 | ||
4949 | /* Based loosely on C++'s make_alias_for(). */ | |
4950 | TREE_PUBLIC (new_decl) = TREE_PUBLIC (old_decl); | |
f7c22b34 | 4951 | DECL_CONTEXT (new_decl) = DECL_CONTEXT (old_decl); |
4952 | DECL_LANG_SPECIFIC (new_decl) = DECL_LANG_SPECIFIC (old_decl); | |
4c0315d0 | 4953 | TREE_READONLY (new_decl) = TREE_READONLY (old_decl); |
4954 | DECL_EXTERNAL (new_decl) = 0; | |
4955 | DECL_ARTIFICIAL (new_decl) = 1; | |
4956 | TREE_ADDRESSABLE (new_decl) = 1; | |
4957 | TREE_USED (new_decl) = 1; | |
4958 | TREE_SYMBOL_REFERENCED (tm_name) = 1; | |
4959 | ||
4960 | /* Perform the same remapping to the comdat group. */ | |
260d0713 | 4961 | if (DECL_ONE_ONLY (new_decl)) |
97221fd7 | 4962 | varpool_node::get (new_decl)->set_comdat_group |
4963 | (tm_mangle (decl_comdat_group_id (old_decl))); | |
4c0315d0 | 4964 | |
415d1b9a | 4965 | new_node = cgraph_node::create_same_body_alias (new_decl, info->new_decl); |
4c0315d0 | 4966 | new_node->tm_clone = true; |
02774f2d | 4967 | new_node->externally_visible = info->old_node->externally_visible; |
6b722052 | 4968 | new_node->no_reorder = info->old_node->no_reorder; |
3e426b86 | 4969 | /* ?? Do not traverse aliases here. */ |
4970 | get_cg_data (&node, false)->clone = new_node; | |
4c0315d0 | 4971 | |
4972 | record_tm_clone_pair (old_decl, new_decl); | |
4973 | ||
02774f2d | 4974 | if (info->old_node->force_output |
51ce5652 | 4975 | || info->old_node->ref_list.first_referring ()) |
8efa224a | 4976 | ipa_tm_mark_force_output_node (new_node); |
02774f2d | 4977 | if (info->old_node->forced_by_abi) |
6a1c0403 | 4978 | ipa_tm_mark_forced_by_abi_node (new_node); |
4c0315d0 | 4979 | return false; |
4980 | } | |
4981 | ||
4982 | /* Create a copy of the function (possibly declaration only) of OLD_NODE, | |
4983 | appropriate for the transactional clone. */ | |
4984 | ||
4985 | static void | |
4986 | ipa_tm_create_version (struct cgraph_node *old_node) | |
4987 | { | |
4988 | tree new_decl, old_decl, tm_name; | |
4989 | struct cgraph_node *new_node; | |
4990 | ||
02774f2d | 4991 | old_decl = old_node->decl; |
4c0315d0 | 4992 | new_decl = copy_node (old_decl); |
4993 | ||
4994 | /* DECL_ASSEMBLER_NAME needs to be set before we call | |
4995 | cgraph_copy_node_for_versioning below, because cgraph_node will | |
4996 | fill the assembler_name_hash. */ | |
4997 | tm_name = tm_mangle (DECL_ASSEMBLER_NAME (old_decl)); | |
4998 | SET_DECL_ASSEMBLER_NAME (new_decl, tm_name); | |
4999 | SET_DECL_RTL (new_decl, NULL); | |
5000 | TREE_SYMBOL_REFERENCED (tm_name) = 1; | |
5001 | ||
5002 | /* Perform the same remapping to the comdat group. */ | |
260d0713 | 5003 | if (DECL_ONE_ONLY (new_decl)) |
97221fd7 | 5004 | varpool_node::get (new_decl)->set_comdat_group |
5005 | (tm_mangle (DECL_COMDAT_GROUP (old_decl))); | |
4c0315d0 | 5006 | |
2cf4c3b3 | 5007 | gcc_assert (!old_node->ipa_transforms_to_apply.exists ()); |
415d1b9a | 5008 | new_node = old_node->create_version_clone (new_decl, vNULL, NULL); |
281dea26 | 5009 | new_node->local.local = false; |
02774f2d | 5010 | new_node->externally_visible = old_node->externally_visible; |
4c0315d0 | 5011 | new_node->lowered = true; |
5012 | new_node->tm_clone = 1; | |
033ab5d3 | 5013 | if (!old_node->implicit_section) |
5014 | new_node->set_section (old_node->get_section ()); | |
3e426b86 | 5015 | get_cg_data (&old_node, true)->clone = new_node; |
4c0315d0 | 5016 | |
415d1b9a | 5017 | if (old_node->get_availability () >= AVAIL_INTERPOSABLE) |
4c0315d0 | 5018 | { |
5019 | /* Remap extern inline to static inline. */ | |
5020 | /* ??? Is it worth trying to use make_decl_one_only? */ | |
5021 | if (DECL_DECLARED_INLINE_P (new_decl) && DECL_EXTERNAL (new_decl)) | |
5022 | { | |
5023 | DECL_EXTERNAL (new_decl) = 0; | |
5024 | TREE_PUBLIC (new_decl) = 0; | |
7a571443 | 5025 | DECL_WEAK (new_decl) = 0; |
4c0315d0 | 5026 | } |
5027 | ||
f1f41a6c | 5028 | tree_function_versioning (old_decl, new_decl, |
5029 | NULL, false, NULL, | |
5030 | false, NULL, NULL); | |
4c0315d0 | 5031 | } |
5032 | ||
5033 | record_tm_clone_pair (old_decl, new_decl); | |
5034 | ||
35ee1c66 | 5035 | symtab->call_cgraph_insertion_hooks (new_node); |
02774f2d | 5036 | if (old_node->force_output |
51ce5652 | 5037 | || old_node->ref_list.first_referring ()) |
8efa224a | 5038 | ipa_tm_mark_force_output_node (new_node); |
02774f2d | 5039 | if (old_node->forced_by_abi) |
6a1c0403 | 5040 | ipa_tm_mark_forced_by_abi_node (new_node); |
4c0315d0 | 5041 | |
5042 | /* Do the same thing, but for any aliases of the original node. */ | |
5043 | { | |
5044 | struct create_version_alias_info data; | |
5045 | data.old_node = old_node; | |
5046 | data.new_decl = new_decl; | |
415d1b9a | 5047 | old_node->call_for_symbol_thunks_and_aliases (ipa_tm_create_version_alias, |
5048 | &data, true); | |
4c0315d0 | 5049 | } |
5050 | } | |
5051 | ||
5052 | /* Construct a call to TM_IRREVOCABLE and insert it at the beginning of BB. */ | |
5053 | ||
5054 | static void | |
5055 | ipa_tm_insert_irr_call (struct cgraph_node *node, struct tm_region *region, | |
5056 | basic_block bb) | |
5057 | { | |
5058 | gimple_stmt_iterator gsi; | |
1a91d914 | 5059 | gcall *g; |
4c0315d0 | 5060 | |
5061 | transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE); | |
5062 | ||
5063 | g = gimple_build_call (builtin_decl_explicit (BUILT_IN_TM_IRREVOCABLE), | |
5064 | 1, build_int_cst (NULL_TREE, MODE_SERIALIRREVOCABLE)); | |
5065 | ||
5066 | split_block_after_labels (bb); | |
5067 | gsi = gsi_after_labels (bb); | |
5068 | gsi_insert_before (&gsi, g, GSI_SAME_STMT); | |
5069 | ||
415d1b9a | 5070 | node->create_edge (cgraph_node::get_create |
5071 | (builtin_decl_explicit (BUILT_IN_TM_IRREVOCABLE)), | |
db9cef39 | 5072 | g, gimple_bb (g)->count, |
415d1b9a | 5073 | compute_call_stmt_bb_frequency (node->decl, |
5074 | gimple_bb (g))); | |
4c0315d0 | 5075 | } |
5076 | ||
5077 | /* Construct a call to TM_GETTMCLONE and insert it before GSI. */ | |
5078 | ||
5079 | static bool | |
5080 | ipa_tm_insert_gettmclone_call (struct cgraph_node *node, | |
5081 | struct tm_region *region, | |
1a91d914 | 5082 | gimple_stmt_iterator *gsi, gcall *stmt) |
4c0315d0 | 5083 | { |
5084 | tree gettm_fn, ret, old_fn, callfn; | |
1a91d914 | 5085 | gcall *g; |
5086 | gassign *g2; | |
4c0315d0 | 5087 | bool safe; |
5088 | ||
5089 | old_fn = gimple_call_fn (stmt); | |
5090 | ||
5091 | if (TREE_CODE (old_fn) == ADDR_EXPR) | |
5092 | { | |
5093 | tree fndecl = TREE_OPERAND (old_fn, 0); | |
5094 | tree clone = get_tm_clone_pair (fndecl); | |
5095 | ||
5096 | /* By transforming the call into a TM_GETTMCLONE, we are | |
5097 | technically taking the address of the original function and | |
5098 | its clone. Explain this so inlining will know this function | |
5099 | is needed. */ | |
415d1b9a | 5100 | cgraph_node::get (fndecl)->mark_address_taken () ; |
4c0315d0 | 5101 | if (clone) |
415d1b9a | 5102 | cgraph_node::get (clone)->mark_address_taken (); |
4c0315d0 | 5103 | } |
5104 | ||
5105 | safe = is_tm_safe (TREE_TYPE (old_fn)); | |
5106 | gettm_fn = builtin_decl_explicit (safe ? BUILT_IN_TM_GETTMCLONE_SAFE | |
5107 | : BUILT_IN_TM_GETTMCLONE_IRR); | |
f9e245b2 | 5108 | ret = create_tmp_var (ptr_type_node); |
4c0315d0 | 5109 | |
5110 | if (!safe) | |
5111 | transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE); | |
5112 | ||
5113 | /* Discard OBJ_TYPE_REF, since we weren't able to fold it. */ | |
5114 | if (TREE_CODE (old_fn) == OBJ_TYPE_REF) | |
5115 | old_fn = OBJ_TYPE_REF_EXPR (old_fn); | |
5116 | ||
5117 | g = gimple_build_call (gettm_fn, 1, old_fn); | |
5118 | ret = make_ssa_name (ret, g); | |
5119 | gimple_call_set_lhs (g, ret); | |
5120 | ||
5121 | gsi_insert_before (gsi, g, GSI_SAME_STMT); | |
5122 | ||
db9cef39 | 5123 | node->create_edge (cgraph_node::get_create (gettm_fn), g, gimple_bb (g)->count, |
415d1b9a | 5124 | compute_call_stmt_bb_frequency (node->decl, |
5125 | gimple_bb (g))); | |
4c0315d0 | 5126 | |
5127 | /* Cast return value from tm_gettmclone* into appropriate function | |
5128 | pointer. */ | |
f9e245b2 | 5129 | callfn = create_tmp_var (TREE_TYPE (old_fn)); |
4c0315d0 | 5130 | g2 = gimple_build_assign (callfn, |
5131 | fold_build1 (NOP_EXPR, TREE_TYPE (callfn), ret)); | |
5132 | callfn = make_ssa_name (callfn, g2); | |
5133 | gimple_assign_set_lhs (g2, callfn); | |
5134 | gsi_insert_before (gsi, g2, GSI_SAME_STMT); | |
5135 | ||
5136 | /* ??? This is a hack to preserve the NOTHROW bit on the call, | |
5137 | which we would have derived from the decl. Failure to save | |
5138 | this bit means we might have to split the basic block. */ | |
5139 | if (gimple_call_nothrow_p (stmt)) | |
5140 | gimple_call_set_nothrow (stmt, true); | |
5141 | ||
5142 | gimple_call_set_fn (stmt, callfn); | |
5143 | ||
5144 | /* Discarding OBJ_TYPE_REF above may produce incompatible LHS and RHS | |
5145 | for a call statement. Fix it. */ | |
5146 | { | |
5147 | tree lhs = gimple_call_lhs (stmt); | |
5148 | tree rettype = TREE_TYPE (gimple_call_fntype (stmt)); | |
5149 | if (lhs | |
5150 | && !useless_type_conversion_p (TREE_TYPE (lhs), rettype)) | |
5151 | { | |
5152 | tree temp; | |
5153 | ||
f9e245b2 | 5154 | temp = create_tmp_reg (rettype); |
4c0315d0 | 5155 | gimple_call_set_lhs (stmt, temp); |
5156 | ||
5157 | g2 = gimple_build_assign (lhs, | |
5158 | fold_build1 (VIEW_CONVERT_EXPR, | |
5159 | TREE_TYPE (lhs), temp)); | |
5160 | gsi_insert_after (gsi, g2, GSI_SAME_STMT); | |
5161 | } | |
5162 | } | |
5163 | ||
5164 | update_stmt (stmt); | |
d8b5abdb | 5165 | cgraph_edge *e = cgraph_node::get (current_function_decl)->get_edge (stmt); |
5166 | if (e && e->indirect_info) | |
5167 | e->indirect_info->polymorphic = false; | |
4c0315d0 | 5168 | |
5169 | return true; | |
5170 | } | |
5171 | ||
5172 | /* Helper function for ipa_tm_transform_calls*. Given a call | |
5173 | statement in GSI which resides inside transaction REGION, redirect | |
5174 | the call to either its wrapper function, or its clone. */ | |
5175 | ||
5176 | static void | |
5177 | ipa_tm_transform_calls_redirect (struct cgraph_node *node, | |
5178 | struct tm_region *region, | |
5179 | gimple_stmt_iterator *gsi, | |
5180 | bool *need_ssa_rename_p) | |
5181 | { | |
1a91d914 | 5182 | gcall *stmt = as_a <gcall *> (gsi_stmt (*gsi)); |
4c0315d0 | 5183 | struct cgraph_node *new_node; |
415d1b9a | 5184 | struct cgraph_edge *e = node->get_edge (stmt); |
4c0315d0 | 5185 | tree fndecl = gimple_call_fndecl (stmt); |
5186 | ||
5187 | /* For indirect calls, pass the address through the runtime. */ | |
5188 | if (fndecl == NULL) | |
5189 | { | |
5190 | *need_ssa_rename_p |= | |
5191 | ipa_tm_insert_gettmclone_call (node, region, gsi, stmt); | |
5192 | return; | |
5193 | } | |
5194 | ||
5195 | /* Handle some TM builtins. Ordinarily these aren't actually generated | |
5196 | at this point, but handling these functions when written in by the | |
5197 | user makes it easier to build unit tests. */ | |
5198 | if (flags_from_decl_or_type (fndecl) & ECF_TM_BUILTIN) | |
5199 | return; | |
5200 | ||
5201 | /* Fixup recursive calls inside clones. */ | |
5202 | /* ??? Why did cgraph_copy_node_for_versioning update the call edges | |
5203 | for recursion but not update the call statements themselves? */ | |
5204 | if (e->caller == e->callee && decl_is_tm_clone (current_function_decl)) | |
5205 | { | |
5206 | gimple_call_set_fndecl (stmt, current_function_decl); | |
5207 | return; | |
5208 | } | |
5209 | ||
5210 | /* If there is a replacement, use it. */ | |
5211 | fndecl = find_tm_replacement_function (fndecl); | |
5212 | if (fndecl) | |
5213 | { | |
415d1b9a | 5214 | new_node = cgraph_node::get_create (fndecl); |
4c0315d0 | 5215 | |
5216 | /* ??? Mark all transaction_wrap functions tm_may_enter_irr. | |
5217 | ||
5218 | We can't do this earlier in record_tm_replacement because | |
5219 | cgraph_remove_unreachable_nodes is called before we inject | |
5220 | references to the node. Further, we can't do this in some | |
5221 | nice central place in ipa_tm_execute because we don't have | |
5222 | the exact list of wrapper functions that would be used. | |
5223 | Marking more wrappers than necessary results in the creation | |
5224 | of unnecessary cgraph_nodes, which can cause some of the | |
5225 | other IPA passes to crash. | |
5226 | ||
5227 | We do need to mark these nodes so that we get the proper | |
5228 | result in expand_call_tm. */ | |
5229 | /* ??? This seems broken. How is it that we're marking the | |
5230 | CALLEE as may_enter_irr? Surely we should be marking the | |
5231 | CALLER. Also note that find_tm_replacement_function also | |
5232 | contains mappings into the TM runtime, e.g. memcpy. These | |
5233 | we know won't go irrevocable. */ | |
5234 | new_node->local.tm_may_enter_irr = 1; | |
5235 | } | |
5236 | else | |
5237 | { | |
3e426b86 | 5238 | struct tm_ipa_cg_data *d; |
5239 | struct cgraph_node *tnode = e->callee; | |
5240 | ||
5241 | d = get_cg_data (&tnode, true); | |
4c0315d0 | 5242 | new_node = d->clone; |
5243 | ||
5244 | /* As we've already skipped pure calls and appropriate builtins, | |
5245 | and we've already marked irrevocable blocks, if we can't come | |
5246 | up with a static replacement, then ask the runtime. */ | |
5247 | if (new_node == NULL) | |
5248 | { | |
5249 | *need_ssa_rename_p |= | |
5250 | ipa_tm_insert_gettmclone_call (node, region, gsi, stmt); | |
4c0315d0 | 5251 | return; |
5252 | } | |
5253 | ||
02774f2d | 5254 | fndecl = new_node->decl; |
4c0315d0 | 5255 | } |
5256 | ||
35ee1c66 | 5257 | e->redirect_callee (new_node); |
4c0315d0 | 5258 | gimple_call_set_fndecl (stmt, fndecl); |
5259 | } | |
5260 | ||
5261 | /* Helper function for ipa_tm_transform_calls. For a given BB, | |
5262 | install calls to tm_irrevocable when IRR_BLOCKS are reached, | |
5263 | redirect other calls to the generated transactional clone. */ | |
5264 | ||
5265 | static bool | |
5266 | ipa_tm_transform_calls_1 (struct cgraph_node *node, struct tm_region *region, | |
5267 | basic_block bb, bitmap irr_blocks) | |
5268 | { | |
5269 | gimple_stmt_iterator gsi; | |
5270 | bool need_ssa_rename = false; | |
5271 | ||
5272 | if (irr_blocks && bitmap_bit_p (irr_blocks, bb->index)) | |
5273 | { | |
5274 | ipa_tm_insert_irr_call (node, region, bb); | |
5275 | return true; | |
5276 | } | |
5277 | ||
5278 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
5279 | { | |
42acab1c | 5280 | gimple *stmt = gsi_stmt (gsi); |
4c0315d0 | 5281 | |
5282 | if (!is_gimple_call (stmt)) | |
5283 | continue; | |
5284 | if (is_tm_pure_call (stmt)) | |
5285 | continue; | |
5286 | ||
5287 | /* Redirect edges to the appropriate replacement or clone. */ | |
5288 | ipa_tm_transform_calls_redirect (node, region, &gsi, &need_ssa_rename); | |
5289 | } | |
5290 | ||
5291 | return need_ssa_rename; | |
5292 | } | |
5293 | ||
5294 | /* Walk the CFG for REGION, beginning at BB. Install calls to | |
5295 | tm_irrevocable when IRR_BLOCKS are reached, redirect other calls to | |
5296 | the generated transactional clone. */ | |
5297 | ||
5298 | static bool | |
5299 | ipa_tm_transform_calls (struct cgraph_node *node, struct tm_region *region, | |
5300 | basic_block bb, bitmap irr_blocks) | |
5301 | { | |
5302 | bool need_ssa_rename = false; | |
5303 | edge e; | |
5304 | edge_iterator ei; | |
c2078b80 | 5305 | auto_vec<basic_block> queue; |
4c0315d0 | 5306 | bitmap visited_blocks = BITMAP_ALLOC (NULL); |
5307 | ||
f1f41a6c | 5308 | queue.safe_push (bb); |
4c0315d0 | 5309 | do |
5310 | { | |
f1f41a6c | 5311 | bb = queue.pop (); |
4c0315d0 | 5312 | |
5313 | need_ssa_rename |= | |
5314 | ipa_tm_transform_calls_1 (node, region, bb, irr_blocks); | |
5315 | ||
5316 | if (irr_blocks && bitmap_bit_p (irr_blocks, bb->index)) | |
5317 | continue; | |
5318 | ||
5319 | if (region && bitmap_bit_p (region->exit_blocks, bb->index)) | |
5320 | continue; | |
5321 | ||
5322 | FOR_EACH_EDGE (e, ei, bb->succs) | |
5323 | if (!bitmap_bit_p (visited_blocks, e->dest->index)) | |
5324 | { | |
5325 | bitmap_set_bit (visited_blocks, e->dest->index); | |
f1f41a6c | 5326 | queue.safe_push (e->dest); |
4c0315d0 | 5327 | } |
5328 | } | |
f1f41a6c | 5329 | while (!queue.is_empty ()); |
4c0315d0 | 5330 | |
4c0315d0 | 5331 | BITMAP_FREE (visited_blocks); |
5332 | ||
5333 | return need_ssa_rename; | |
5334 | } | |
5335 | ||
5336 | /* Transform the calls within the TM regions within NODE. */ | |
5337 | ||
5338 | static void | |
5339 | ipa_tm_transform_transaction (struct cgraph_node *node) | |
5340 | { | |
3e426b86 | 5341 | struct tm_ipa_cg_data *d; |
4c0315d0 | 5342 | struct tm_region *region; |
5343 | bool need_ssa_rename = false; | |
5344 | ||
3e426b86 | 5345 | d = get_cg_data (&node, true); |
5346 | ||
02774f2d | 5347 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); |
4c0315d0 | 5348 | calculate_dominance_info (CDI_DOMINATORS); |
5349 | ||
5350 | for (region = d->all_tm_regions; region; region = region->next) | |
5351 | { | |
5352 | /* If we're sure to go irrevocable, don't transform anything. */ | |
5353 | if (d->irrevocable_blocks_normal | |
5354 | && bitmap_bit_p (d->irrevocable_blocks_normal, | |
5355 | region->entry_block->index)) | |
5356 | { | |
1910089e | 5357 | transaction_subcode_ior (region, GTMA_DOES_GO_IRREVOCABLE |
5358 | | GTMA_MAY_ENTER_IRREVOCABLE | |
5359 | | GTMA_HAS_NO_INSTRUMENTATION); | |
4c0315d0 | 5360 | continue; |
5361 | } | |
5362 | ||
5363 | need_ssa_rename |= | |
5364 | ipa_tm_transform_calls (node, region, region->entry_block, | |
5365 | d->irrevocable_blocks_normal); | |
5366 | } | |
5367 | ||
5368 | if (need_ssa_rename) | |
5369 | update_ssa (TODO_update_ssa_only_virtuals); | |
5370 | ||
5371 | pop_cfun (); | |
4c0315d0 | 5372 | } |
5373 | ||
5374 | /* Transform the calls within the transactional clone of NODE. */ | |
5375 | ||
5376 | static void | |
5377 | ipa_tm_transform_clone (struct cgraph_node *node) | |
5378 | { | |
3e426b86 | 5379 | struct tm_ipa_cg_data *d; |
4c0315d0 | 5380 | bool need_ssa_rename; |
5381 | ||
3e426b86 | 5382 | d = get_cg_data (&node, true); |
5383 | ||
4c0315d0 | 5384 | /* If this function makes no calls and has no irrevocable blocks, |
5385 | then there's nothing to do. */ | |
5386 | /* ??? Remove non-aborting top-level transactions. */ | |
2670559d | 5387 | if (!node->callees && !node->indirect_calls && !d->irrevocable_blocks_clone) |
4c0315d0 | 5388 | return; |
5389 | ||
02774f2d | 5390 | push_cfun (DECL_STRUCT_FUNCTION (d->clone->decl)); |
4c0315d0 | 5391 | calculate_dominance_info (CDI_DOMINATORS); |
5392 | ||
5393 | need_ssa_rename = | |
34154e27 | 5394 | ipa_tm_transform_calls (d->clone, NULL, |
5395 | single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun)), | |
4c0315d0 | 5396 | d->irrevocable_blocks_clone); |
5397 | ||
5398 | if (need_ssa_rename) | |
5399 | update_ssa (TODO_update_ssa_only_virtuals); | |
5400 | ||
5401 | pop_cfun (); | |
4c0315d0 | 5402 | } |
5403 | ||
5404 | /* Main entry point for the transactional memory IPA pass. */ | |
5405 | ||
5406 | static unsigned int | |
5407 | ipa_tm_execute (void) | |
5408 | { | |
9af5ce0c | 5409 | cgraph_node_queue tm_callees = cgraph_node_queue (); |
4c0315d0 | 5410 | /* List of functions that will go irrevocable. */ |
9af5ce0c | 5411 | cgraph_node_queue irr_worklist = cgraph_node_queue (); |
4c0315d0 | 5412 | |
5413 | struct cgraph_node *node; | |
5414 | struct tm_ipa_cg_data *d; | |
5415 | enum availability a; | |
5416 | unsigned int i; | |
5417 | ||
382ecba7 | 5418 | cgraph_node::checking_verify_cgraph_nodes (); |
4c0315d0 | 5419 | |
5420 | bitmap_obstack_initialize (&tm_obstack); | |
0cd02a19 | 5421 | initialize_original_copy_tables (); |
4c0315d0 | 5422 | |
5423 | /* For all local functions marked tm_callable, queue them. */ | |
7c455d87 | 5424 | FOR_EACH_DEFINED_FUNCTION (node) |
02774f2d | 5425 | if (is_tm_callable (node->decl) |
415d1b9a | 5426 | && node->get_availability () >= AVAIL_INTERPOSABLE) |
4c0315d0 | 5427 | { |
3e426b86 | 5428 | d = get_cg_data (&node, true); |
4c0315d0 | 5429 | maybe_push_queue (node, &tm_callees, &d->in_callee_queue); |
5430 | } | |
5431 | ||
5432 | /* For all local reachable functions... */ | |
7c455d87 | 5433 | FOR_EACH_DEFINED_FUNCTION (node) |
da751785 | 5434 | if (node->lowered |
415d1b9a | 5435 | && node->get_availability () >= AVAIL_INTERPOSABLE) |
4c0315d0 | 5436 | { |
5437 | /* ... marked tm_pure, record that fact for the runtime by | |
5438 | indicating that the pure function is its own tm_callable. | |
5439 | No need to do this if the function's address can't be taken. */ | |
02774f2d | 5440 | if (is_tm_pure (node->decl)) |
4c0315d0 | 5441 | { |
5442 | if (!node->local.local) | |
02774f2d | 5443 | record_tm_clone_pair (node->decl, node->decl); |
4c0315d0 | 5444 | continue; |
5445 | } | |
5446 | ||
02774f2d | 5447 | push_cfun (DECL_STRUCT_FUNCTION (node->decl)); |
4c0315d0 | 5448 | calculate_dominance_info (CDI_DOMINATORS); |
5449 | ||
5450 | tm_region_init (NULL); | |
5451 | if (all_tm_regions) | |
5452 | { | |
3e426b86 | 5453 | d = get_cg_data (&node, true); |
4c0315d0 | 5454 | |
0cd02a19 | 5455 | /* Scan for calls that are in each transaction, and |
5456 | generate the uninstrumented code path. */ | |
4c0315d0 | 5457 | ipa_tm_scan_calls_transaction (d, &tm_callees); |
5458 | ||
40879ac6 | 5459 | /* Put it in the worklist so we can scan the function |
5460 | later (ipa_tm_scan_irr_function) and mark the | |
5461 | irrevocable blocks. */ | |
5462 | maybe_push_queue (node, &irr_worklist, &d->in_worklist); | |
5463 | d->want_irr_scan_normal = true; | |
4c0315d0 | 5464 | } |
5465 | ||
5466 | pop_cfun (); | |
4c0315d0 | 5467 | } |
5468 | ||
5469 | /* For every local function on the callee list, scan as if we will be | |
5470 | creating a transactional clone, queueing all new functions we find | |
5471 | along the way. */ | |
f1f41a6c | 5472 | for (i = 0; i < tm_callees.length (); ++i) |
4c0315d0 | 5473 | { |
f1f41a6c | 5474 | node = tm_callees[i]; |
415d1b9a | 5475 | a = node->get_availability (); |
3e426b86 | 5476 | d = get_cg_data (&node, true); |
4c0315d0 | 5477 | |
40879ac6 | 5478 | /* Put it in the worklist so we can scan the function later |
5479 | (ipa_tm_scan_irr_function) and mark the irrevocable | |
5480 | blocks. */ | |
5481 | maybe_push_queue (node, &irr_worklist, &d->in_worklist); | |
4c0315d0 | 5482 | |
5483 | /* Some callees cannot be arbitrarily cloned. These will always be | |
5484 | irrevocable. Mark these now, so that we need not scan them. */ | |
02774f2d | 5485 | if (is_tm_irrevocable (node->decl)) |
4c0315d0 | 5486 | ipa_tm_note_irrevocable (node, &irr_worklist); |
5487 | else if (a <= AVAIL_NOT_AVAILABLE | |
02774f2d | 5488 | && !is_tm_safe_or_pure (node->decl)) |
4c0315d0 | 5489 | ipa_tm_note_irrevocable (node, &irr_worklist); |
415d1b9a | 5490 | else if (a >= AVAIL_INTERPOSABLE) |
4c0315d0 | 5491 | { |
02774f2d | 5492 | if (!tree_versionable_function_p (node->decl)) |
4c0315d0 | 5493 | ipa_tm_note_irrevocable (node, &irr_worklist); |
5494 | else if (!d->is_irrevocable) | |
5495 | { | |
5496 | /* If this is an alias, make sure its base is queued as well. | |
5497 | we need not scan the callees now, as the base will do. */ | |
02774f2d | 5498 | if (node->alias) |
4c0315d0 | 5499 | { |
415d1b9a | 5500 | node = cgraph_node::get (node->thunk.alias); |
3e426b86 | 5501 | d = get_cg_data (&node, true); |
4c0315d0 | 5502 | maybe_push_queue (node, &tm_callees, &d->in_callee_queue); |
5503 | continue; | |
5504 | } | |
5505 | ||
5506 | /* Add all nodes called by this function into | |
5507 | tm_callees as well. */ | |
5508 | ipa_tm_scan_calls_clone (node, &tm_callees); | |
5509 | } | |
5510 | } | |
5511 | } | |
5512 | ||
5513 | /* Iterate scans until no more work to be done. Prefer not to use | |
f1f41a6c | 5514 | vec::pop because the worklist tends to follow a breadth-first |
4c0315d0 | 5515 | search of the callgraph, which should allow convergance with a |
5516 | minimum number of scans. But we also don't want the worklist | |
5517 | array to grow without bound, so we shift the array up periodically. */ | |
f1f41a6c | 5518 | for (i = 0; i < irr_worklist.length (); ++i) |
4c0315d0 | 5519 | { |
f1f41a6c | 5520 | if (i > 256 && i == irr_worklist.length () / 8) |
4c0315d0 | 5521 | { |
f1f41a6c | 5522 | irr_worklist.block_remove (0, i); |
4c0315d0 | 5523 | i = 0; |
5524 | } | |
5525 | ||
f1f41a6c | 5526 | node = irr_worklist[i]; |
3e426b86 | 5527 | d = get_cg_data (&node, true); |
4c0315d0 | 5528 | d->in_worklist = false; |
5529 | ||
5530 | if (d->want_irr_scan_normal) | |
5531 | { | |
5532 | d->want_irr_scan_normal = false; | |
5533 | ipa_tm_scan_irr_function (node, false); | |
5534 | } | |
5535 | if (d->in_callee_queue && ipa_tm_scan_irr_function (node, true)) | |
5536 | ipa_tm_note_irrevocable (node, &irr_worklist); | |
5537 | } | |
5538 | ||
5539 | /* For every function on the callee list, collect the tm_may_enter_irr | |
5540 | bit on the node. */ | |
f1f41a6c | 5541 | irr_worklist.truncate (0); |
5542 | for (i = 0; i < tm_callees.length (); ++i) | |
4c0315d0 | 5543 | { |
f1f41a6c | 5544 | node = tm_callees[i]; |
4c0315d0 | 5545 | if (ipa_tm_mayenterirr_function (node)) |
5546 | { | |
3e426b86 | 5547 | d = get_cg_data (&node, true); |
4c0315d0 | 5548 | gcc_assert (d->in_worklist == false); |
5549 | maybe_push_queue (node, &irr_worklist, &d->in_worklist); | |
5550 | } | |
5551 | } | |
5552 | ||
5553 | /* Propagate the tm_may_enter_irr bit to callers until stable. */ | |
f1f41a6c | 5554 | for (i = 0; i < irr_worklist.length (); ++i) |
4c0315d0 | 5555 | { |
5556 | struct cgraph_node *caller; | |
5557 | struct cgraph_edge *e; | |
e4a2b488 | 5558 | struct ipa_ref *ref; |
4c0315d0 | 5559 | |
f1f41a6c | 5560 | if (i > 256 && i == irr_worklist.length () / 8) |
4c0315d0 | 5561 | { |
f1f41a6c | 5562 | irr_worklist.block_remove (0, i); |
4c0315d0 | 5563 | i = 0; |
5564 | } | |
5565 | ||
f1f41a6c | 5566 | node = irr_worklist[i]; |
3e426b86 | 5567 | d = get_cg_data (&node, true); |
4c0315d0 | 5568 | d->in_worklist = false; |
5569 | node->local.tm_may_enter_irr = true; | |
5570 | ||
5571 | /* Propagate back to normal callers. */ | |
5572 | for (e = node->callers; e ; e = e->next_caller) | |
5573 | { | |
5574 | caller = e->caller; | |
02774f2d | 5575 | if (!is_tm_safe_or_pure (caller->decl) |
4c0315d0 | 5576 | && !caller->local.tm_may_enter_irr) |
5577 | { | |
3e426b86 | 5578 | d = get_cg_data (&caller, true); |
4c0315d0 | 5579 | maybe_push_queue (caller, &irr_worklist, &d->in_worklist); |
5580 | } | |
5581 | } | |
5582 | ||
5583 | /* Propagate back to referring aliases as well. */ | |
e4a2b488 | 5584 | FOR_EACH_ALIAS (node, ref) |
4c0315d0 | 5585 | { |
415d1b9a | 5586 | caller = dyn_cast<cgraph_node *> (ref->referring); |
e4a2b488 | 5587 | if (!caller->local.tm_may_enter_irr) |
4c0315d0 | 5588 | { |
3e426b86 | 5589 | /* ?? Do not traverse aliases here. */ |
5590 | d = get_cg_data (&caller, false); | |
4c0315d0 | 5591 | maybe_push_queue (caller, &irr_worklist, &d->in_worklist); |
5592 | } | |
5593 | } | |
5594 | } | |
5595 | ||
5596 | /* Now validate all tm_safe functions, and all atomic regions in | |
5597 | other functions. */ | |
7c455d87 | 5598 | FOR_EACH_DEFINED_FUNCTION (node) |
da751785 | 5599 | if (node->lowered |
415d1b9a | 5600 | && node->get_availability () >= AVAIL_INTERPOSABLE) |
4c0315d0 | 5601 | { |
3e426b86 | 5602 | d = get_cg_data (&node, true); |
02774f2d | 5603 | if (is_tm_safe (node->decl)) |
4c0315d0 | 5604 | ipa_tm_diagnose_tm_safe (node); |
5605 | else if (d->all_tm_regions) | |
5606 | ipa_tm_diagnose_transaction (node, d->all_tm_regions); | |
5607 | } | |
5608 | ||
5609 | /* Create clones. Do those that are not irrevocable and have a | |
5610 | positive call count. Do those publicly visible functions that | |
5611 | the user directed us to clone. */ | |
f1f41a6c | 5612 | for (i = 0; i < tm_callees.length (); ++i) |
4c0315d0 | 5613 | { |
5614 | bool doit = false; | |
5615 | ||
f1f41a6c | 5616 | node = tm_callees[i]; |
02774f2d | 5617 | if (node->cpp_implicit_alias) |
4c0315d0 | 5618 | continue; |
5619 | ||
415d1b9a | 5620 | a = node->get_availability (); |
3e426b86 | 5621 | d = get_cg_data (&node, true); |
4c0315d0 | 5622 | |
5623 | if (a <= AVAIL_NOT_AVAILABLE) | |
02774f2d | 5624 | doit = is_tm_callable (node->decl); |
5625 | else if (a <= AVAIL_AVAILABLE && is_tm_callable (node->decl)) | |
4c0315d0 | 5626 | doit = true; |
5627 | else if (!d->is_irrevocable | |
5628 | && d->tm_callers_normal + d->tm_callers_clone > 0) | |
5629 | doit = true; | |
5630 | ||
5631 | if (doit) | |
5632 | ipa_tm_create_version (node); | |
5633 | } | |
5634 | ||
5635 | /* Redirect calls to the new clones, and insert irrevocable marks. */ | |
f1f41a6c | 5636 | for (i = 0; i < tm_callees.length (); ++i) |
4c0315d0 | 5637 | { |
f1f41a6c | 5638 | node = tm_callees[i]; |
02774f2d | 5639 | if (node->analyzed) |
4c0315d0 | 5640 | { |
3e426b86 | 5641 | d = get_cg_data (&node, true); |
4c0315d0 | 5642 | if (d->clone) |
5643 | ipa_tm_transform_clone (node); | |
5644 | } | |
5645 | } | |
7c455d87 | 5646 | FOR_EACH_DEFINED_FUNCTION (node) |
da751785 | 5647 | if (node->lowered |
415d1b9a | 5648 | && node->get_availability () >= AVAIL_INTERPOSABLE) |
4c0315d0 | 5649 | { |
3e426b86 | 5650 | d = get_cg_data (&node, true); |
4c0315d0 | 5651 | if (d->all_tm_regions) |
5652 | ipa_tm_transform_transaction (node); | |
5653 | } | |
5654 | ||
5655 | /* Free and clear all data structures. */ | |
f1f41a6c | 5656 | tm_callees.release (); |
5657 | irr_worklist.release (); | |
4c0315d0 | 5658 | bitmap_obstack_release (&tm_obstack); |
0cd02a19 | 5659 | free_original_copy_tables (); |
4c0315d0 | 5660 | |
7c455d87 | 5661 | FOR_EACH_FUNCTION (node) |
02774f2d | 5662 | node->aux = NULL; |
4c0315d0 | 5663 | |
382ecba7 | 5664 | cgraph_node::checking_verify_cgraph_nodes (); |
4c0315d0 | 5665 | |
5666 | return 0; | |
5667 | } | |
5668 | ||
7620bc82 | 5669 | namespace { |
5670 | ||
5671 | const pass_data pass_data_ipa_tm = | |
cbe8bda8 | 5672 | { |
5673 | SIMPLE_IPA_PASS, /* type */ | |
5674 | "tmipa", /* name */ | |
5675 | OPTGROUP_NONE, /* optinfo_flags */ | |
cbe8bda8 | 5676 | TV_TRANS_MEM, /* tv_id */ |
5677 | ( PROP_ssa | PROP_cfg ), /* properties_required */ | |
5678 | 0, /* properties_provided */ | |
5679 | 0, /* properties_destroyed */ | |
5680 | 0, /* todo_flags_start */ | |
5681 | 0, /* todo_flags_finish */ | |
4c0315d0 | 5682 | }; |
5683 | ||
7620bc82 | 5684 | class pass_ipa_tm : public simple_ipa_opt_pass |
cbe8bda8 | 5685 | { |
5686 | public: | |
9af5ce0c | 5687 | pass_ipa_tm (gcc::context *ctxt) |
5688 | : simple_ipa_opt_pass (pass_data_ipa_tm, ctxt) | |
cbe8bda8 | 5689 | {} |
5690 | ||
5691 | /* opt_pass methods: */ | |
31315c24 | 5692 | virtual bool gate (function *) { return flag_tm; } |
65b0537f | 5693 | virtual unsigned int execute (function *) { return ipa_tm_execute (); } |
cbe8bda8 | 5694 | |
5695 | }; // class pass_ipa_tm | |
5696 | ||
7620bc82 | 5697 | } // anon namespace |
5698 | ||
cbe8bda8 | 5699 | simple_ipa_opt_pass * |
5700 | make_pass_ipa_tm (gcc::context *ctxt) | |
5701 | { | |
5702 | return new pass_ipa_tm (ctxt); | |
5703 | } | |
5704 | ||
4c0315d0 | 5705 | #include "gt-trans-mem.h" |