1 /* Passes for transactional memory support.
2 Copyright (C) 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
22 #include "coretypes.h"
25 #include "tree-flow.h"
26 #include "tree-pass.h"
27 #include "tree-inline.h"
28 #include "diagnostic-core.h"
31 #include "trans-mem.h"
34 #include "langhooks.h"
35 #include "tree-pretty-print.h"
36 #include "gimple-pretty-print.h"
39 #define PROB_VERY_UNLIKELY (REG_BR_PROB_BASE / 2000 - 1)
40 #define PROB_ALWAYS (REG_BR_PROB_BASE)
42 #define A_RUNINSTRUMENTEDCODE 0x0001
43 #define A_RUNUNINSTRUMENTEDCODE 0x0002
44 #define A_SAVELIVEVARIABLES 0x0004
45 #define A_RESTORELIVEVARIABLES 0x0008
46 #define A_ABORTTRANSACTION 0x0010
48 #define AR_USERABORT 0x0001
49 #define AR_USERRETRY 0x0002
50 #define AR_TMCONFLICT 0x0004
51 #define AR_EXCEPTIONBLOCKABORT 0x0008
52 #define AR_OUTERABORT 0x0010
54 #define MODE_SERIALIRREVOCABLE 0x0000
57 /* The representation of a transaction changes several times during the
58 lowering process. In the beginning, in the front-end we have the
59 GENERIC tree TRANSACTION_EXPR. For example,
67 During initial gimplification (gimplify.c) the TRANSACTION_EXPR node is
68 trivially replaced with a GIMPLE_TRANSACTION node.
70 During pass_lower_tm, we examine the body of transactions looking
71 for aborts. Transactions that do not contain an abort may be
72 merged into an outer transaction. We also add a TRY-FINALLY node
73 to arrange for the transaction to be committed on any exit.
75 [??? Think about how this arrangement affects throw-with-commit
76 and throw-with-abort operations. In this case we want the TRY to
77 handle gotos, but not to catch any exceptions because the transaction
78 will already be closed.]
80 GIMPLE_TRANSACTION [label=NULL] {
87 __builtin___tm_abort ();
89 __builtin___tm_commit ();
93 During pass_lower_eh, we create EH regions for the transactions,
94 intermixed with the regular EH stuff. This gives us a nice persistent
95 mapping (all the way through rtl) from transactional memory operation
96 back to the transaction, which allows us to get the abnormal edges
97 correct to model transaction aborts and restarts:
99 GIMPLE_TRANSACTION [label=over]
105 __builtin___tm_abort ();
106 __builtin___tm_commit ();
109 This is the end of all_lowering_passes, and so is what is present
110 during the IPA passes, and through all of the optimization passes.
112 During pass_ipa_tm, we examine all GIMPLE_TRANSACTION blocks in all
113 functions and mark functions for cloning.
115 At the end of gimple optimization, before exiting SSA form,
116 pass_tm_edges replaces statements that perform transactional
117 memory operations with the appropriate TM builtins, and swap
118 out function calls with their transactional clones. At this
119 point we introduce the abnormal transaction restart edges and
120 complete lowering of the GIMPLE_TRANSACTION node.
122 x = __builtin___tm_start (MAY_ABORT);
124 if (x & abort_transaction)
127 t0 = __builtin___tm_load (global);
129 __builtin___tm_store (&global, t1);
131 __builtin___tm_abort ();
132 __builtin___tm_commit ();
137 /* Return the attributes we want to examine for X, or NULL if it's not
138 something we examine. We look at function types, but allow pointers
139 to function types and function decls and peek through. */
142 get_attrs_for (const_tree x)
144 switch (TREE_CODE (x))
147 return TYPE_ATTRIBUTES (TREE_TYPE (x));
154 if (TREE_CODE (x) != POINTER_TYPE)
160 if (TREE_CODE (x) != FUNCTION_TYPE && TREE_CODE (x) != METHOD_TYPE)
166 return TYPE_ATTRIBUTES (x);
170 /* Return true if X has been marked TM_PURE. */
173 is_tm_pure (const_tree x)
177 switch (TREE_CODE (x))
188 if (TREE_CODE (x) != POINTER_TYPE)
194 if (TREE_CODE (x) != FUNCTION_TYPE && TREE_CODE (x) != METHOD_TYPE)
199 flags = flags_from_decl_or_type (x);
200 return (flags & ECF_TM_PURE) != 0;
203 /* Return true if X has been marked TM_IRREVOCABLE. */
206 is_tm_irrevocable (tree x)
208 tree attrs = get_attrs_for (x);
210 if (attrs && lookup_attribute ("transaction_unsafe", attrs))
213 /* A call to the irrevocable builtin is by definition,
215 if (TREE_CODE (x) == ADDR_EXPR)
216 x = TREE_OPERAND (x, 0);
217 if (TREE_CODE (x) == FUNCTION_DECL
218 && DECL_BUILT_IN_CLASS (x) == BUILT_IN_NORMAL
219 && DECL_FUNCTION_CODE (x) == BUILT_IN_TM_IRREVOCABLE)
225 /* Return true if X has been marked TM_SAFE. */
228 is_tm_safe (const_tree x)
232 tree attrs = get_attrs_for (x);
235 if (lookup_attribute ("transaction_safe", attrs))
237 if (lookup_attribute ("transaction_may_cancel_outer", attrs))
244 /* Return true if CALL is const, or tm_pure. */
247 is_tm_pure_call (gimple call)
249 tree fn = gimple_call_fn (call);
251 if (TREE_CODE (fn) == ADDR_EXPR)
253 fn = TREE_OPERAND (fn, 0);
254 gcc_assert (TREE_CODE (fn) == FUNCTION_DECL);
259 return is_tm_pure (fn);
262 /* Return true if X has been marked TM_CALLABLE. */
265 is_tm_callable (tree x)
267 tree attrs = get_attrs_for (x);
270 if (lookup_attribute ("transaction_callable", attrs))
272 if (lookup_attribute ("transaction_safe", attrs))
274 if (lookup_attribute ("transaction_may_cancel_outer", attrs))
280 /* Return true if X has been marked TRANSACTION_MAY_CANCEL_OUTER. */
283 is_tm_may_cancel_outer (tree x)
285 tree attrs = get_attrs_for (x);
287 return lookup_attribute ("transaction_may_cancel_outer", attrs) != NULL;
291 /* Return true for built in functions that "end" a transaction. */
294 is_tm_ending_fndecl (tree fndecl)
296 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
297 switch (DECL_FUNCTION_CODE (fndecl))
299 case BUILT_IN_TM_COMMIT:
300 case BUILT_IN_TM_COMMIT_EH:
301 case BUILT_IN_TM_ABORT:
302 case BUILT_IN_TM_IRREVOCABLE:
311 /* Return true if STMT is a TM load. */
314 is_tm_load (gimple stmt)
318 if (gimple_code (stmt) != GIMPLE_CALL)
321 fndecl = gimple_call_fndecl (stmt);
322 return (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
323 && BUILTIN_TM_LOAD_P (DECL_FUNCTION_CODE (fndecl)));
326 /* Same as above, but for simple TM loads, that is, not the
327 after-write, after-read, etc optimized variants. */
330 is_tm_simple_load (gimple stmt)
334 if (gimple_code (stmt) != GIMPLE_CALL)
337 fndecl = gimple_call_fndecl (stmt);
338 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
340 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
341 return (fcode == BUILT_IN_TM_LOAD_1
342 || fcode == BUILT_IN_TM_LOAD_2
343 || fcode == BUILT_IN_TM_LOAD_4
344 || fcode == BUILT_IN_TM_LOAD_8
345 || fcode == BUILT_IN_TM_LOAD_FLOAT
346 || fcode == BUILT_IN_TM_LOAD_DOUBLE
347 || fcode == BUILT_IN_TM_LOAD_LDOUBLE
348 || fcode == BUILT_IN_TM_LOAD_M64
349 || fcode == BUILT_IN_TM_LOAD_M128
350 || fcode == BUILT_IN_TM_LOAD_M256);
355 /* Return true if STMT is a TM store. */
358 is_tm_store (gimple stmt)
362 if (gimple_code (stmt) != GIMPLE_CALL)
365 fndecl = gimple_call_fndecl (stmt);
366 return (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
367 && BUILTIN_TM_STORE_P (DECL_FUNCTION_CODE (fndecl)));
370 /* Same as above, but for simple TM stores, that is, not the
371 after-write, after-read, etc optimized variants. */
374 is_tm_simple_store (gimple stmt)
378 if (gimple_code (stmt) != GIMPLE_CALL)
381 fndecl = gimple_call_fndecl (stmt);
382 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
384 enum built_in_function fcode = DECL_FUNCTION_CODE (fndecl);
385 return (fcode == BUILT_IN_TM_STORE_1
386 || fcode == BUILT_IN_TM_STORE_2
387 || fcode == BUILT_IN_TM_STORE_4
388 || fcode == BUILT_IN_TM_STORE_8
389 || fcode == BUILT_IN_TM_STORE_FLOAT
390 || fcode == BUILT_IN_TM_STORE_DOUBLE
391 || fcode == BUILT_IN_TM_STORE_LDOUBLE
392 || fcode == BUILT_IN_TM_STORE_M64
393 || fcode == BUILT_IN_TM_STORE_M128
394 || fcode == BUILT_IN_TM_STORE_M256);
399 /* Return true if FNDECL is BUILT_IN_TM_ABORT. */
402 is_tm_abort (tree fndecl)
405 && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
406 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_TM_ABORT);
409 /* Build a GENERIC tree for a user abort. This is called by front ends
410 while transforming the __tm_abort statement. */
413 build_tm_abort_call (location_t loc, bool is_outer)
415 return build_call_expr_loc (loc, builtin_decl_explicit (BUILT_IN_TM_ABORT), 1,
416 build_int_cst (integer_type_node,
418 | (is_outer ? AR_OUTERABORT : 0)));
421 /* Common gateing function for several of the TM passes. */
429 /* Map for aribtrary function replacement under TM, as created
430 by the tm_wrap attribute. */
432 static GTY((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
436 record_tm_replacement (tree from, tree to)
438 struct tree_map **slot, *h;
440 /* Do not inline wrapper functions that will get replaced in the TM
443 Suppose you have foo() that will get replaced into tmfoo(). Make
444 sure the inliner doesn't try to outsmart us and inline foo()
445 before we get a chance to do the TM replacement. */
446 DECL_UNINLINABLE (from) = 1;
448 if (tm_wrap_map == NULL)
449 tm_wrap_map = htab_create_ggc (32, tree_map_hash, tree_map_eq, 0);
451 h = ggc_alloc_tree_map ();
452 h->hash = htab_hash_pointer (from);
456 slot = (struct tree_map **)
457 htab_find_slot_with_hash (tm_wrap_map, h, h->hash, INSERT);
461 /* Return a TM-aware replacement function for DECL. */
464 find_tm_replacement_function (tree fndecl)
468 struct tree_map *h, in;
470 in.base.from = fndecl;
471 in.hash = htab_hash_pointer (fndecl);
472 h = (struct tree_map *) htab_find_with_hash (tm_wrap_map, &in, in.hash);
477 /* ??? We may well want TM versions of most of the common <string.h>
478 functions. For now, we've already these two defined. */
479 /* Adjust expand_call_tm() attributes as necessary for the cases
481 if (DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
482 switch (DECL_FUNCTION_CODE (fndecl))
484 case BUILT_IN_MEMCPY:
485 return builtin_decl_explicit (BUILT_IN_TM_MEMCPY);
486 case BUILT_IN_MEMMOVE:
487 return builtin_decl_explicit (BUILT_IN_TM_MEMMOVE);
488 case BUILT_IN_MEMSET:
489 return builtin_decl_explicit (BUILT_IN_TM_MEMSET);
497 /* When appropriate, record TM replacement for memory allocation functions.
499 FROM is the FNDECL to wrap. */
501 tm_malloc_replacement (tree from)
506 if (TREE_CODE (from) != FUNCTION_DECL)
509 /* If we have a previous replacement, the user must be explicitly
510 wrapping malloc/calloc/free. They better know what they're
512 if (find_tm_replacement_function (from))
515 str = IDENTIFIER_POINTER (DECL_NAME (from));
517 if (!strcmp (str, "malloc"))
518 to = builtin_decl_explicit (BUILT_IN_TM_MALLOC);
519 else if (!strcmp (str, "calloc"))
520 to = builtin_decl_explicit (BUILT_IN_TM_CALLOC);
521 else if (!strcmp (str, "free"))
522 to = builtin_decl_explicit (BUILT_IN_TM_FREE);
526 TREE_NOTHROW (to) = 0;
528 record_tm_replacement (from, to);
531 /* Diagnostics for tm_safe functions/regions. Called by the front end
532 once we've lowered the function to high-gimple. */
534 /* Subroutine of diagnose_tm_safe_errors, called through walk_gimple_seq.
535 Process exactly one statement. WI->INFO is set to non-null when in
536 the context of a tm_safe function, and null for a __transaction block. */
538 #define DIAG_TM_OUTER 1
539 #define DIAG_TM_SAFE 2
540 #define DIAG_TM_RELAXED 4
544 unsigned int summary_flags : 8;
545 unsigned int block_flags : 8;
546 unsigned int func_flags : 8;
547 unsigned int saw_volatile : 1;
551 /* Tree callback function for diagnose_tm pass. */
554 diagnose_tm_1_op (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
557 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
558 struct diagnose_tm *d = (struct diagnose_tm *) wi->info;
559 enum tree_code code = TREE_CODE (*tp);
561 if ((code == VAR_DECL
562 || code == RESULT_DECL
563 || code == PARM_DECL)
564 && d->block_flags & (DIAG_TM_SAFE | DIAG_TM_RELAXED)
565 && TREE_THIS_VOLATILE (TREE_TYPE (*tp))
569 error_at (gimple_location (d->stmt),
570 "invalid volatile use of %qD inside transaction",
578 diagnose_tm_1 (gimple_stmt_iterator *gsi, bool *handled_ops_p,
579 struct walk_stmt_info *wi)
581 gimple stmt = gsi_stmt (*gsi);
582 struct diagnose_tm *d = (struct diagnose_tm *) wi->info;
584 /* Save stmt for use in leaf analysis. */
587 switch (gimple_code (stmt))
591 tree fn = gimple_call_fn (stmt);
593 if ((d->summary_flags & DIAG_TM_OUTER) == 0
594 && is_tm_may_cancel_outer (fn))
595 error_at (gimple_location (stmt),
596 "%<transaction_may_cancel_outer%> function call not within"
597 " outer transaction or %<transaction_may_cancel_outer%>");
599 if (d->summary_flags & DIAG_TM_SAFE)
601 bool is_safe, direct_call_p;
604 if (TREE_CODE (fn) == ADDR_EXPR
605 && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL)
607 direct_call_p = true;
608 replacement = TREE_OPERAND (fn, 0);
609 replacement = find_tm_replacement_function (replacement);
615 direct_call_p = false;
616 replacement = NULL_TREE;
619 if (is_tm_safe_or_pure (fn))
621 else if (is_tm_callable (fn) || is_tm_irrevocable (fn))
623 /* A function explicitly marked transaction_callable as
624 opposed to transaction_safe is being defined to be
625 unsafe as part of its ABI, regardless of its contents. */
628 else if (direct_call_p)
630 if (flags_from_decl_or_type (fn) & ECF_TM_BUILTIN)
632 else if (replacement)
634 /* ??? At present we've been considering replacements
635 merely transaction_callable, and therefore might
636 enter irrevocable. The tm_wrap attribute has not
637 yet made it into the new language spec. */
642 /* ??? Diagnostics for unmarked direct calls moved into
643 the IPA pass. Section 3.2 of the spec details how
644 functions not marked should be considered "implicitly
645 safe" based on having examined the function body. */
651 /* An unmarked indirect call. Consider it unsafe even
652 though optimization may yet figure out how to inline. */
658 if (TREE_CODE (fn) == ADDR_EXPR)
659 fn = TREE_OPERAND (fn, 0);
660 if (d->block_flags & DIAG_TM_SAFE)
663 error_at (gimple_location (stmt),
664 "unsafe function call %qD within "
665 "atomic transaction", fn);
668 if (!DECL_P (fn) || DECL_NAME (fn))
669 error_at (gimple_location (stmt),
670 "unsafe function call %qE within "
671 "atomic transaction", fn);
673 error_at (gimple_location (stmt),
674 "unsafe indirect function call within "
675 "atomic transaction");
681 error_at (gimple_location (stmt),
682 "unsafe function call %qD within "
683 "%<transaction_safe%> function", fn);
686 if (!DECL_P (fn) || DECL_NAME (fn))
687 error_at (gimple_location (stmt),
688 "unsafe function call %qE within "
689 "%<transaction_safe%> function", fn);
691 error_at (gimple_location (stmt),
692 "unsafe indirect function call within "
693 "%<transaction_safe%> function");
702 /* ??? We ought to come up with a way to add attributes to
703 asm statements, and then add "transaction_safe" to it.
704 Either that or get the language spec to resurrect __tm_waiver. */
705 if (d->block_flags & DIAG_TM_SAFE)
706 error_at (gimple_location (stmt),
707 "asm not allowed in atomic transaction");
708 else if (d->func_flags & DIAG_TM_SAFE)
709 error_at (gimple_location (stmt),
710 "asm not allowed in %<transaction_safe%> function");
713 case GIMPLE_TRANSACTION:
715 unsigned char inner_flags = DIAG_TM_SAFE;
717 if (gimple_transaction_subcode (stmt) & GTMA_IS_RELAXED)
719 if (d->block_flags & DIAG_TM_SAFE)
720 error_at (gimple_location (stmt),
721 "relaxed transaction in atomic transaction");
722 else if (d->func_flags & DIAG_TM_SAFE)
723 error_at (gimple_location (stmt),
724 "relaxed transaction in %<transaction_safe%> function");
725 inner_flags = DIAG_TM_RELAXED;
727 else if (gimple_transaction_subcode (stmt) & GTMA_IS_OUTER)
730 error_at (gimple_location (stmt),
731 "outer transaction in transaction");
732 else if (d->func_flags & DIAG_TM_OUTER)
733 error_at (gimple_location (stmt),
734 "outer transaction in "
735 "%<transaction_may_cancel_outer%> function");
736 else if (d->func_flags & DIAG_TM_SAFE)
737 error_at (gimple_location (stmt),
738 "outer transaction in %<transaction_safe%> function");
739 inner_flags |= DIAG_TM_OUTER;
742 *handled_ops_p = true;
743 if (gimple_transaction_body (stmt))
745 struct walk_stmt_info wi_inner;
746 struct diagnose_tm d_inner;
748 memset (&d_inner, 0, sizeof (d_inner));
749 d_inner.func_flags = d->func_flags;
750 d_inner.block_flags = d->block_flags | inner_flags;
751 d_inner.summary_flags = d_inner.func_flags | d_inner.block_flags;
753 memset (&wi_inner, 0, sizeof (wi_inner));
754 wi_inner.info = &d_inner;
756 walk_gimple_seq (gimple_transaction_body (stmt),
757 diagnose_tm_1, diagnose_tm_1_op, &wi_inner);
770 diagnose_tm_blocks (void)
772 struct walk_stmt_info wi;
773 struct diagnose_tm d;
775 memset (&d, 0, sizeof (d));
776 if (is_tm_may_cancel_outer (current_function_decl))
777 d.func_flags = DIAG_TM_OUTER | DIAG_TM_SAFE;
778 else if (is_tm_safe (current_function_decl))
779 d.func_flags = DIAG_TM_SAFE;
780 d.summary_flags = d.func_flags;
782 memset (&wi, 0, sizeof (wi));
785 walk_gimple_seq (gimple_body (current_function_decl),
786 diagnose_tm_1, diagnose_tm_1_op, &wi);
791 struct gimple_opt_pass pass_diagnose_tm_blocks =
795 "*diagnose_tm_blocks", /* name */
797 diagnose_tm_blocks, /* execute */
800 0, /* static_pass_number */
801 TV_TRANS_MEM, /* tv_id */
802 PROP_gimple_any, /* properties_required */
803 0, /* properties_provided */
804 0, /* properties_destroyed */
805 0, /* todo_flags_start */
806 0, /* todo_flags_finish */
810 /* Instead of instrumenting thread private memory, we save the
811 addresses in a log which we later use to save/restore the addresses
812 upon transaction start/restart.
814 The log is keyed by address, where each element contains individual
815 statements among different code paths that perform the store.
817 This log is later used to generate either plain save/restore of the
818 addresses upon transaction start/restart, or calls to the ITM_L*
821 So for something like:
823 struct large { int x[1000]; };
824 struct large lala = { 0 };
830 We can either save/restore:
833 trxn = _ITM_startTransaction ();
834 if (trxn & a_saveLiveVariables)
835 tmp_lala1 = lala.x[i];
836 else if (a & a_restoreLiveVariables)
837 lala.x[i] = tmp_lala1;
839 or use the logging functions:
842 trxn = _ITM_startTransaction ();
843 _ITM_LU4 (&lala.x[i]);
845 Obviously, if we use _ITM_L* to log, we prefer to call _ITM_L* as
846 far up the dominator tree to shadow all of the writes to a given
847 location (thus reducing the total number of logging calls), but not
848 so high as to be called on a path that does not perform a
851 /* One individual log entry. We may have multiple statements for the
852 same location if neither dominate each other (on different
854 typedef struct tm_log_entry
856 /* Address to save. */
858 /* Entry block for the transaction this address occurs in. */
859 basic_block entry_block;
860 /* Dominating statements the store occurs in. */
862 /* Initially, while we are building the log, we place a nonzero
863 value here to mean that this address *will* be saved with a
864 save/restore sequence. Later, when generating the save sequence
865 we place the SSA temp generated here. */
869 /* The actual log. */
870 static htab_t tm_log;
872 /* Addresses to log with a save/restore sequence. These should be in
874 static VEC(tree,heap) *tm_log_save_addresses;
876 /* Map for an SSA_NAME originally pointing to a non aliased new piece
877 of memory (malloc, alloc, etc). */
878 static htab_t tm_new_mem_hash;
880 enum thread_memory_type
884 mem_transaction_local,
888 typedef struct tm_new_mem_map
890 /* SSA_NAME being dereferenced. */
892 enum thread_memory_type local_new_memory;
895 /* Htab support. Return hash value for a `tm_log_entry'. */
897 tm_log_hash (const void *p)
899 const struct tm_log_entry *log = (const struct tm_log_entry *) p;
900 return iterative_hash_expr (log->addr, 0);
903 /* Htab support. Return true if two log entries are the same. */
905 tm_log_eq (const void *p1, const void *p2)
907 const struct tm_log_entry *log1 = (const struct tm_log_entry *) p1;
908 const struct tm_log_entry *log2 = (const struct tm_log_entry *) p2;
912 rth: I suggest that we get rid of the component refs etc.
913 I.e. resolve the reference to base + offset.
915 We may need to actually finish a merge with mainline for this,
916 since we'd like to be presented with Richi's MEM_REF_EXPRs more
917 often than not. But in the meantime your tm_log_entry could save
918 the results of get_inner_reference.
920 See: g++.dg/tm/pr46653.C
923 /* Special case plain equality because operand_equal_p() below will
924 return FALSE if the addresses are equal but they have
925 side-effects (e.g. a volatile address). */
926 if (log1->addr == log2->addr)
929 return operand_equal_p (log1->addr, log2->addr, 0);
932 /* Htab support. Free one tm_log_entry. */
934 tm_log_free (void *p)
936 struct tm_log_entry *lp = (struct tm_log_entry *) p;
937 VEC_free (gimple, heap, lp->stmts);
941 /* Initialize logging data structures. */
945 tm_log = htab_create (10, tm_log_hash, tm_log_eq, tm_log_free);
946 tm_new_mem_hash = htab_create (5, struct_ptr_hash, struct_ptr_eq, free);
947 tm_log_save_addresses = VEC_alloc (tree, heap, 5);
950 /* Free logging data structures. */
954 htab_delete (tm_log);
955 htab_delete (tm_new_mem_hash);
956 VEC_free (tree, heap, tm_log_save_addresses);
959 /* Return true if MEM is a transaction invariant memory for the TM
960 region starting at REGION_ENTRY_BLOCK. */
962 transaction_invariant_address_p (const_tree mem, basic_block region_entry_block)
964 if ((TREE_CODE (mem) == INDIRECT_REF || TREE_CODE (mem) == MEM_REF)
965 && TREE_CODE (TREE_OPERAND (mem, 0)) == SSA_NAME)
969 def_bb = gimple_bb (SSA_NAME_DEF_STMT (TREE_OPERAND (mem, 0)));
970 return def_bb != region_entry_block
971 && dominated_by_p (CDI_DOMINATORS, region_entry_block, def_bb);
974 mem = strip_invariant_refs (mem);
975 return mem && (CONSTANT_CLASS_P (mem) || decl_address_invariant_p (mem));
978 /* Given an address ADDR in STMT, find it in the memory log or add it,
979 making sure to keep only the addresses highest in the dominator
982 ENTRY_BLOCK is the entry_block for the transaction.
984 If we find the address in the log, make sure it's either the same
985 address, or an equivalent one that dominates ADDR.
987 If we find the address, but neither ADDR dominates the found
988 address, nor the found one dominates ADDR, we're on different
989 execution paths. Add it.
991 If known, ENTRY_BLOCK is the entry block for the region, otherwise
994 tm_log_add (basic_block entry_block, tree addr, gimple stmt)
997 struct tm_log_entry l, *lp;
1000 slot = htab_find_slot (tm_log, &l, INSERT);
1003 tree type = TREE_TYPE (addr);
1005 lp = XNEW (struct tm_log_entry);
1009 /* Small invariant addresses can be handled as save/restores. */
1011 && transaction_invariant_address_p (lp->addr, entry_block)
1012 && TYPE_SIZE_UNIT (type) != NULL
1013 && host_integerp (TYPE_SIZE_UNIT (type), 1)
1014 && (tree_low_cst (TYPE_SIZE_UNIT (type), 1)
1015 < PARAM_VALUE (PARAM_TM_MAX_AGGREGATE_SIZE))
1016 /* We must be able to copy this type normally. I.e., no
1017 special constructors and the like. */
1018 && !TREE_ADDRESSABLE (type))
1020 lp->save_var = create_tmp_reg (TREE_TYPE (lp->addr), "tm_save");
1021 add_referenced_var (lp->save_var);
1023 lp->entry_block = entry_block;
1024 /* Save addresses separately in dominator order so we don't
1025 get confused by overlapping addresses in the save/restore
1027 VEC_safe_push (tree, heap, tm_log_save_addresses, lp->addr);
1031 /* Use the logging functions. */
1032 lp->stmts = VEC_alloc (gimple, heap, 5);
1033 VEC_quick_push (gimple, lp->stmts, stmt);
1034 lp->save_var = NULL;
1042 lp = (struct tm_log_entry *) *slot;
1044 /* If we're generating a save/restore sequence, we don't care
1045 about statements. */
1049 for (i = 0; VEC_iterate (gimple, lp->stmts, i, oldstmt); ++i)
1051 if (stmt == oldstmt)
1053 /* We already have a store to the same address, higher up the
1054 dominator tree. Nothing to do. */
1055 if (dominated_by_p (CDI_DOMINATORS,
1056 gimple_bb (stmt), gimple_bb (oldstmt)))
1058 /* We should be processing blocks in dominator tree order. */
1059 gcc_assert (!dominated_by_p (CDI_DOMINATORS,
1060 gimple_bb (oldstmt), gimple_bb (stmt)));
1062 /* Store is on a different code path. */
1063 VEC_safe_push (gimple, heap, lp->stmts, stmt);
1067 /* Gimplify the address of a TARGET_MEM_REF. Return the SSA_NAME
1068 result, insert the new statements before GSI. */
1071 gimplify_addr (gimple_stmt_iterator *gsi, tree x)
1073 if (TREE_CODE (x) == TARGET_MEM_REF)
1074 x = tree_mem_ref_addr (build_pointer_type (TREE_TYPE (x)), x);
1076 x = build_fold_addr_expr (x);
1077 return force_gimple_operand_gsi (gsi, x, true, NULL, true, GSI_SAME_STMT);
1080 /* Instrument one address with the logging functions.
1081 ADDR is the address to save.
1082 STMT is the statement before which to place it. */
1084 tm_log_emit_stmt (tree addr, gimple stmt)
1086 tree type = TREE_TYPE (addr);
1087 tree size = TYPE_SIZE_UNIT (type);
1088 gimple_stmt_iterator gsi = gsi_for_stmt (stmt);
1090 enum built_in_function code = BUILT_IN_TM_LOG;
1092 if (type == float_type_node)
1093 code = BUILT_IN_TM_LOG_FLOAT;
1094 else if (type == double_type_node)
1095 code = BUILT_IN_TM_LOG_DOUBLE;
1096 else if (type == long_double_type_node)
1097 code = BUILT_IN_TM_LOG_LDOUBLE;
1098 else if (host_integerp (size, 1))
1100 unsigned int n = tree_low_cst (size, 1);
1104 code = BUILT_IN_TM_LOG_1;
1107 code = BUILT_IN_TM_LOG_2;
1110 code = BUILT_IN_TM_LOG_4;
1113 code = BUILT_IN_TM_LOG_8;
1116 code = BUILT_IN_TM_LOG;
1117 if (TREE_CODE (type) == VECTOR_TYPE)
1119 if (n == 8 && builtin_decl_explicit (BUILT_IN_TM_LOG_M64))
1120 code = BUILT_IN_TM_LOG_M64;
1121 else if (n == 16 && builtin_decl_explicit (BUILT_IN_TM_LOG_M128))
1122 code = BUILT_IN_TM_LOG_M128;
1123 else if (n == 32 && builtin_decl_explicit (BUILT_IN_TM_LOG_M256))
1124 code = BUILT_IN_TM_LOG_M256;
1130 addr = gimplify_addr (&gsi, addr);
1131 if (code == BUILT_IN_TM_LOG)
1132 log = gimple_build_call (builtin_decl_explicit (code), 2, addr, size);
1134 log = gimple_build_call (builtin_decl_explicit (code), 1, addr);
1135 gsi_insert_before (&gsi, log, GSI_SAME_STMT);
1138 /* Go through the log and instrument address that must be instrumented
1139 with the logging functions. Leave the save/restore addresses for
1145 struct tm_log_entry *lp;
1147 FOR_EACH_HTAB_ELEMENT (tm_log, lp, tm_log_entry_t, hi)
1154 fprintf (dump_file, "TM thread private mem logging: ");
1155 print_generic_expr (dump_file, lp->addr, 0);
1156 fprintf (dump_file, "\n");
1162 fprintf (dump_file, "DUMPING to variable\n");
1168 fprintf (dump_file, "DUMPING with logging functions\n");
1169 for (i = 0; VEC_iterate (gimple, lp->stmts, i, stmt); ++i)
1170 tm_log_emit_stmt (lp->addr, stmt);
1175 /* Emit the save sequence for the corresponding addresses in the log.
1176 ENTRY_BLOCK is the entry block for the transaction.
1177 BB is the basic block to insert the code in. */
1179 tm_log_emit_saves (basic_block entry_block, basic_block bb)
1182 gimple_stmt_iterator gsi = gsi_last_bb (bb);
1184 struct tm_log_entry l, *lp;
1186 for (i = 0; i < VEC_length (tree, tm_log_save_addresses); ++i)
1188 l.addr = VEC_index (tree, tm_log_save_addresses, i);
1189 lp = (struct tm_log_entry *) *htab_find_slot (tm_log, &l, NO_INSERT);
1190 gcc_assert (lp->save_var != NULL);
1192 /* We only care about variables in the current transaction. */
1193 if (lp->entry_block != entry_block)
1196 stmt = gimple_build_assign (lp->save_var, unshare_expr (lp->addr));
1198 /* Make sure we can create an SSA_NAME for this type. For
1199 instance, aggregates aren't allowed, in which case the system
1200 will create a VOP for us and everything will just work. */
1201 if (is_gimple_reg_type (TREE_TYPE (lp->save_var)))
1203 lp->save_var = make_ssa_name (lp->save_var, stmt);
1204 gimple_assign_set_lhs (stmt, lp->save_var);
1207 gsi_insert_before (&gsi, stmt, GSI_SAME_STMT);
1211 /* Emit the restore sequence for the corresponding addresses in the log.
1212 ENTRY_BLOCK is the entry block for the transaction.
1213 BB is the basic block to insert the code in. */
1215 tm_log_emit_restores (basic_block entry_block, basic_block bb)
1218 struct tm_log_entry l, *lp;
1219 gimple_stmt_iterator gsi;
1222 for (i = VEC_length (tree, tm_log_save_addresses) - 1; i >= 0; i--)
1224 l.addr = VEC_index (tree, tm_log_save_addresses, i);
1225 lp = (struct tm_log_entry *) *htab_find_slot (tm_log, &l, NO_INSERT);
1226 gcc_assert (lp->save_var != NULL);
1228 /* We only care about variables in the current transaction. */
1229 if (lp->entry_block != entry_block)
1232 /* Restores are in LIFO order from the saves in case we have
1234 gsi = gsi_start_bb (bb);
1236 stmt = gimple_build_assign (unshare_expr (lp->addr), lp->save_var);
1237 gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING);
1241 /* Emit the checks for performing either a save or a restore sequence.
1243 TRXN_PROP is either A_SAVELIVEVARIABLES or A_RESTORELIVEVARIABLES.
1245 The code sequence is inserted in a new basic block created in
1246 END_BB which is inserted between BEFORE_BB and the destination of
1249 STATUS is the return value from _ITM_beginTransaction.
1250 ENTRY_BLOCK is the entry block for the transaction.
1251 EMITF is a callback to emit the actual save/restore code.
1253 The basic block containing the conditional checking for TRXN_PROP
1256 tm_log_emit_save_or_restores (basic_block entry_block,
1259 void (*emitf)(basic_block, basic_block),
1260 basic_block before_bb,
1262 basic_block *end_bb)
1264 basic_block cond_bb, code_bb;
1265 gimple cond_stmt, stmt;
1266 gimple_stmt_iterator gsi;
1268 int old_flags = fallthru_edge->flags;
1270 cond_bb = create_empty_bb (before_bb);
1271 code_bb = create_empty_bb (cond_bb);
1272 *end_bb = create_empty_bb (code_bb);
1273 redirect_edge_pred (fallthru_edge, *end_bb);
1274 fallthru_edge->flags = EDGE_FALLTHRU;
1275 make_edge (before_bb, cond_bb, old_flags);
1277 set_immediate_dominator (CDI_DOMINATORS, cond_bb, before_bb);
1278 set_immediate_dominator (CDI_DOMINATORS, code_bb, cond_bb);
1280 gsi = gsi_last_bb (cond_bb);
1282 /* t1 = status & A_{property}. */
1283 t1 = make_rename_temp (TREE_TYPE (status), NULL);
1284 t2 = build_int_cst (TREE_TYPE (status), trxn_prop);
1285 stmt = gimple_build_assign_with_ops (BIT_AND_EXPR, t1, status, t2);
1286 gsi_insert_after (&gsi, stmt, GSI_CONTINUE_LINKING);
1289 t2 = build_int_cst (TREE_TYPE (status), 0);
1290 cond_stmt = gimple_build_cond (NE_EXPR, t1, t2, NULL, NULL);
1291 gsi_insert_after (&gsi, cond_stmt, GSI_CONTINUE_LINKING);
1293 emitf (entry_block, code_bb);
1295 make_edge (cond_bb, code_bb, EDGE_TRUE_VALUE);
1296 make_edge (cond_bb, *end_bb, EDGE_FALSE_VALUE);
1297 make_edge (code_bb, *end_bb, EDGE_FALLTHRU);
1302 static tree lower_sequence_tm (gimple_stmt_iterator *, bool *,
1303 struct walk_stmt_info *);
1304 static tree lower_sequence_no_tm (gimple_stmt_iterator *, bool *,
1305 struct walk_stmt_info *);
1307 /* Evaluate an address X being dereferenced and determine if it
1308 originally points to a non aliased new chunk of memory (malloc,
1311 Return MEM_THREAD_LOCAL if it points to a thread-local address.
1312 Return MEM_TRANSACTION_LOCAL if it points to a transaction-local address.
1313 Return MEM_NON_LOCAL otherwise.
1315 ENTRY_BLOCK is the entry block to the transaction containing the
1316 dereference of X. */
1317 static enum thread_memory_type
1318 thread_private_new_memory (basic_block entry_block, tree x)
1321 enum tree_code code;
1323 tm_new_mem_map_t elt, *elt_p;
1325 enum thread_memory_type retval = mem_transaction_local;
1328 || TREE_CODE (x) != SSA_NAME
1329 /* Possible uninitialized use, or a function argument. In
1330 either case, we don't care. */
1331 || SSA_NAME_IS_DEFAULT_DEF (x))
1332 return mem_non_local;
1334 /* Look in cache first. */
1336 slot = htab_find_slot (tm_new_mem_hash, &elt, INSERT);
1337 elt_p = (tm_new_mem_map_t *) *slot;
1339 return elt_p->local_new_memory;
1341 /* Optimistically assume the memory is transaction local during
1342 processing. This catches recursion into this variable. */
1343 *slot = elt_p = XNEW (tm_new_mem_map_t);
1345 elt_p->local_new_memory = mem_transaction_local;
1347 /* Search DEF chain to find the original definition of this address. */
1350 if (ptr_deref_may_alias_global_p (x))
1352 /* Address escapes. This is not thread-private. */
1353 retval = mem_non_local;
1354 goto new_memory_ret;
1357 stmt = SSA_NAME_DEF_STMT (x);
1359 /* If the malloc call is outside the transaction, this is
1361 if (retval != mem_thread_local
1362 && !dominated_by_p (CDI_DOMINATORS, gimple_bb (stmt), entry_block))
1363 retval = mem_thread_local;
1365 if (is_gimple_assign (stmt))
1367 code = gimple_assign_rhs_code (stmt);
1368 /* x = foo ==> foo */
1369 if (code == SSA_NAME)
1370 x = gimple_assign_rhs1 (stmt);
1371 /* x = foo + n ==> foo */
1372 else if (code == POINTER_PLUS_EXPR)
1373 x = gimple_assign_rhs1 (stmt);
1374 /* x = (cast*) foo ==> foo */
1375 else if (code == VIEW_CONVERT_EXPR || code == NOP_EXPR)
1376 x = gimple_assign_rhs1 (stmt);
1379 retval = mem_non_local;
1380 goto new_memory_ret;
1385 if (gimple_code (stmt) == GIMPLE_PHI)
1388 enum thread_memory_type mem;
1389 tree phi_result = gimple_phi_result (stmt);
1391 /* If any of the ancestors are non-local, we are sure to
1392 be non-local. Otherwise we can avoid doing anything
1393 and inherit what has already been generated. */
1395 for (i = 0; i < gimple_phi_num_args (stmt); ++i)
1397 tree op = PHI_ARG_DEF (stmt, i);
1399 /* Exclude self-assignment. */
1400 if (phi_result == op)
1403 mem = thread_private_new_memory (entry_block, op);
1404 if (mem == mem_non_local)
1407 goto new_memory_ret;
1409 retval = MIN (retval, mem);
1411 goto new_memory_ret;
1416 while (TREE_CODE (x) == SSA_NAME);
1418 if (stmt && is_gimple_call (stmt) && gimple_call_flags (stmt) & ECF_MALLOC)
1419 /* Thread-local or transaction-local. */
1422 retval = mem_non_local;
1425 elt_p->local_new_memory = retval;
1429 /* Determine whether X has to be instrumented using a read
1432 ENTRY_BLOCK is the entry block for the region where stmt resides
1433 in. NULL if unknown.
1435 STMT is the statement in which X occurs in. It is used for thread
1436 private memory instrumentation. If no TPM instrumentation is
1437 desired, STMT should be null. */
1439 requires_barrier (basic_block entry_block, tree x, gimple stmt)
1442 while (handled_component_p (x))
1443 x = TREE_OPERAND (x, 0);
1445 switch (TREE_CODE (x))
1450 enum thread_memory_type ret;
1452 ret = thread_private_new_memory (entry_block, TREE_OPERAND (x, 0));
1453 if (ret == mem_non_local)
1455 if (stmt && ret == mem_thread_local)
1456 /* ?? Should we pass `orig', or the INDIRECT_REF X. ?? */
1457 tm_log_add (entry_block, orig, stmt);
1459 /* Transaction-locals require nothing at all. For malloc, a
1460 transaction restart frees the memory and we reallocate.
1461 For alloca, the stack pointer gets reset by the retry and
1466 case TARGET_MEM_REF:
1467 if (TREE_CODE (TMR_BASE (x)) != ADDR_EXPR)
1469 x = TREE_OPERAND (TMR_BASE (x), 0);
1470 if (TREE_CODE (x) == PARM_DECL)
1472 gcc_assert (TREE_CODE (x) == VAR_DECL);
1478 if (DECL_BY_REFERENCE (x))
1480 /* ??? This value is a pointer, but aggregate_value_p has been
1481 jigged to return true which confuses needs_to_live_in_memory.
1482 This ought to be cleaned up generically.
1484 FIXME: Verify this still happens after the next mainline
1485 merge. Testcase ie g++.dg/tm/pr47554.C.
1490 if (is_global_var (x))
1491 return !TREE_READONLY (x);
1492 if (/* FIXME: This condition should actually go below in the
1493 tm_log_add() call, however is_call_clobbered() depends on
1494 aliasing info which is not available during
1495 gimplification. Since requires_barrier() gets called
1496 during lower_sequence_tm/gimplification, leave the call
1497 to needs_to_live_in_memory until we eliminate
1498 lower_sequence_tm altogether. */
1499 needs_to_live_in_memory (x))
1503 /* For local memory that doesn't escape (aka thread private
1504 memory), we can either save the value at the beginning of
1505 the transaction and restore on restart, or call a tm
1506 function to dynamically save and restore on restart
1509 tm_log_add (entry_block, orig, stmt);
1518 /* Mark the GIMPLE_ASSIGN statement as appropriate for being inside
1519 a transaction region. */
1522 examine_assign_tm (unsigned *state, gimple_stmt_iterator *gsi)
1524 gimple stmt = gsi_stmt (*gsi);
1526 if (requires_barrier (/*entry_block=*/NULL, gimple_assign_rhs1 (stmt), NULL))
1527 *state |= GTMA_HAVE_LOAD;
1528 if (requires_barrier (/*entry_block=*/NULL, gimple_assign_lhs (stmt), NULL))
1529 *state |= GTMA_HAVE_STORE;
1532 /* Mark a GIMPLE_CALL as appropriate for being inside a transaction. */
1535 examine_call_tm (unsigned *state, gimple_stmt_iterator *gsi)
1537 gimple stmt = gsi_stmt (*gsi);
1540 if (is_tm_pure_call (stmt))
1543 /* Check if this call is a transaction abort. */
1544 fn = gimple_call_fndecl (stmt);
1545 if (is_tm_abort (fn))
1546 *state |= GTMA_HAVE_ABORT;
1548 /* Note that something may happen. */
1549 *state |= GTMA_HAVE_LOAD | GTMA_HAVE_STORE;
1552 /* Lower a GIMPLE_TRANSACTION statement. */
1555 lower_transaction (gimple_stmt_iterator *gsi, struct walk_stmt_info *wi)
1557 gimple g, stmt = gsi_stmt (*gsi);
1558 unsigned int *outer_state = (unsigned int *) wi->info;
1559 unsigned int this_state = 0;
1560 struct walk_stmt_info this_wi;
1562 /* First, lower the body. The scanning that we do inside gives
1563 us some idea of what we're dealing with. */
1564 memset (&this_wi, 0, sizeof (this_wi));
1565 this_wi.info = (void *) &this_state;
1566 walk_gimple_seq (gimple_transaction_body (stmt),
1567 lower_sequence_tm, NULL, &this_wi);
1569 /* If there was absolutely nothing transaction related inside the
1570 transaction, we may elide it. Likewise if this is a nested
1571 transaction and does not contain an abort. */
1573 || (!(this_state & GTMA_HAVE_ABORT) && outer_state != NULL))
1576 *outer_state |= this_state;
1578 gsi_insert_seq_before (gsi, gimple_transaction_body (stmt),
1580 gimple_transaction_set_body (stmt, NULL);
1582 gsi_remove (gsi, true);
1583 wi->removed_stmt = true;
1587 /* Wrap the body of the transaction in a try-finally node so that
1588 the commit call is always properly called. */
1589 g = gimple_build_call (builtin_decl_explicit (BUILT_IN_TM_COMMIT), 0);
1590 if (flag_exceptions)
1593 gimple_seq n_seq, e_seq;
1595 n_seq = gimple_seq_alloc_with_stmt (g);
1596 e_seq = gimple_seq_alloc ();
1598 g = gimple_build_call (builtin_decl_explicit (BUILT_IN_EH_POINTER),
1599 1, integer_zero_node);
1600 ptr = create_tmp_var (ptr_type_node, NULL);
1601 gimple_call_set_lhs (g, ptr);
1602 gimple_seq_add_stmt (&e_seq, g);
1604 g = gimple_build_call (builtin_decl_explicit (BUILT_IN_TM_COMMIT_EH),
1606 gimple_seq_add_stmt (&e_seq, g);
1608 g = gimple_build_eh_else (n_seq, e_seq);
1611 g = gimple_build_try (gimple_transaction_body (stmt),
1612 gimple_seq_alloc_with_stmt (g), GIMPLE_TRY_FINALLY);
1613 gsi_insert_after (gsi, g, GSI_CONTINUE_LINKING);
1615 gimple_transaction_set_body (stmt, NULL);
1617 /* If the transaction calls abort or if this is an outer transaction,
1618 add an "over" label afterwards. */
1619 if ((this_state & (GTMA_HAVE_ABORT))
1620 || (gimple_transaction_subcode(stmt) & GTMA_IS_OUTER))
1622 tree label = create_artificial_label (UNKNOWN_LOCATION);
1623 gimple_transaction_set_label (stmt, label);
1624 gsi_insert_after (gsi, gimple_build_label (label), GSI_CONTINUE_LINKING);
1627 /* Record the set of operations found for use later. */
1628 this_state |= gimple_transaction_subcode (stmt) & GTMA_DECLARATION_MASK;
1629 gimple_transaction_set_subcode (stmt, this_state);
1632 /* Iterate through the statements in the sequence, lowering them all
1633 as appropriate for being in a transaction. */
1636 lower_sequence_tm (gimple_stmt_iterator *gsi, bool *handled_ops_p,
1637 struct walk_stmt_info *wi)
1639 unsigned int *state = (unsigned int *) wi->info;
1640 gimple stmt = gsi_stmt (*gsi);
1642 *handled_ops_p = true;
1643 switch (gimple_code (stmt))
1646 /* Only memory reads/writes need to be instrumented. */
1647 if (gimple_assign_single_p (stmt))
1648 examine_assign_tm (state, gsi);
1652 examine_call_tm (state, gsi);
1656 *state |= GTMA_MAY_ENTER_IRREVOCABLE;
1659 case GIMPLE_TRANSACTION:
1660 lower_transaction (gsi, wi);
1664 *handled_ops_p = !gimple_has_substatements (stmt);
1671 /* Iterate through the statements in the sequence, lowering them all
1672 as appropriate for being outside of a transaction. */
1675 lower_sequence_no_tm (gimple_stmt_iterator *gsi, bool *handled_ops_p,
1676 struct walk_stmt_info * wi)
1678 gimple stmt = gsi_stmt (*gsi);
1680 if (gimple_code (stmt) == GIMPLE_TRANSACTION)
1682 *handled_ops_p = true;
1683 lower_transaction (gsi, wi);
1686 *handled_ops_p = !gimple_has_substatements (stmt);
1691 /* Main entry point for flattening GIMPLE_TRANSACTION constructs. After
1692 this, GIMPLE_TRANSACTION nodes still exist, but the nested body has
1693 been moved out, and all the data required for constructing a proper
1694 CFG has been recorded. */
1697 execute_lower_tm (void)
1699 struct walk_stmt_info wi;
1701 /* Transactional clones aren't created until a later pass. */
1702 gcc_assert (!decl_is_tm_clone (current_function_decl));
1704 memset (&wi, 0, sizeof (wi));
1705 walk_gimple_seq (gimple_body (current_function_decl),
1706 lower_sequence_no_tm, NULL, &wi);
1711 struct gimple_opt_pass pass_lower_tm =
1715 "tmlower", /* name */
1717 execute_lower_tm, /* execute */
1720 0, /* static_pass_number */
1721 TV_TRANS_MEM, /* tv_id */
1722 PROP_gimple_lcf, /* properties_required */
1723 0, /* properties_provided */
1724 0, /* properties_destroyed */
1725 0, /* todo_flags_start */
1726 TODO_dump_func /* todo_flags_finish */
1730 /* Collect region information for each transaction. */
1734 /* Link to the next unnested transaction. */
1735 struct tm_region *next;
1737 /* Link to the next inner transaction. */
1738 struct tm_region *inner;
1740 /* Link to the next outer transaction. */
1741 struct tm_region *outer;
1743 /* The GIMPLE_TRANSACTION statement beginning this transaction. */
1744 gimple transaction_stmt;
1746 /* The entry block to this region. */
1747 basic_block entry_block;
1749 /* The set of all blocks that end the region; NULL if only EXIT_BLOCK.
1750 These blocks are still a part of the region (i.e., the border is
1751 inclusive). Note that this set is only complete for paths in the CFG
1752 starting at ENTRY_BLOCK, and that there is no exit block recorded for
1753 the edge to the "over" label. */
1756 /* The set of all blocks that have an TM_IRREVOCABLE call. */
1760 typedef struct tm_region *tm_region_p;
1761 DEF_VEC_P (tm_region_p);
1762 DEF_VEC_ALLOC_P (tm_region_p, heap);
1764 /* True if there are pending edge statements to be committed for the
1765 current function being scanned in the tmmark pass. */
1766 bool pending_edge_inserts_p;
1768 static struct tm_region *all_tm_regions;
1769 static bitmap_obstack tm_obstack;
1772 /* A subroutine of tm_region_init. Record the existance of the
1773 GIMPLE_TRANSACTION statement in a tree of tm_region elements. */
1775 static struct tm_region *
1776 tm_region_init_0 (struct tm_region *outer, basic_block bb, gimple stmt)
1778 struct tm_region *region;
1780 region = (struct tm_region *)
1781 obstack_alloc (&tm_obstack.obstack, sizeof (struct tm_region));
1785 region->next = outer->inner;
1786 outer->inner = region;
1790 region->next = all_tm_regions;
1791 all_tm_regions = region;
1793 region->inner = NULL;
1794 region->outer = outer;
1796 region->transaction_stmt = stmt;
1798 /* There are either one or two edges out of the block containing
1799 the GIMPLE_TRANSACTION, one to the actual region and one to the
1800 "over" label if the region contains an abort. The former will
1801 always be the one marked FALLTHRU. */
1802 region->entry_block = FALLTHRU_EDGE (bb)->dest;
1804 region->exit_blocks = BITMAP_ALLOC (&tm_obstack);
1805 region->irr_blocks = BITMAP_ALLOC (&tm_obstack);
1810 /* A subroutine of tm_region_init. Record all the exit and
1811 irrevocable blocks in BB into the region's exit_blocks and
1812 irr_blocks bitmaps. Returns the new region being scanned. */
1814 static struct tm_region *
1815 tm_region_init_1 (struct tm_region *region, basic_block bb)
1817 gimple_stmt_iterator gsi;
1821 || (!region->irr_blocks && !region->exit_blocks))
1824 /* Check to see if this is the end of a region by seeing if it
1825 contains a call to __builtin_tm_commit{,_eh}. Note that the
1826 outermost region for DECL_IS_TM_CLONE need not collect this. */
1827 for (gsi = gsi_last_bb (bb); !gsi_end_p (gsi); gsi_prev (&gsi))
1830 if (gimple_code (g) == GIMPLE_CALL)
1832 tree fn = gimple_call_fndecl (g);
1833 if (fn && DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL)
1835 if ((DECL_FUNCTION_CODE (fn) == BUILT_IN_TM_COMMIT
1836 || DECL_FUNCTION_CODE (fn) == BUILT_IN_TM_COMMIT_EH)
1837 && region->exit_blocks)
1839 bitmap_set_bit (region->exit_blocks, bb->index);
1840 region = region->outer;
1843 if (DECL_FUNCTION_CODE (fn) == BUILT_IN_TM_IRREVOCABLE)
1844 bitmap_set_bit (region->irr_blocks, bb->index);
1851 /* Collect all of the transaction regions within the current function
1852 and record them in ALL_TM_REGIONS. The REGION parameter may specify
1853 an "outermost" region for use by tm clones. */
1856 tm_region_init (struct tm_region *region)
1862 VEC(basic_block, heap) *queue = NULL;
1863 bitmap visited_blocks = BITMAP_ALLOC (NULL);
1864 struct tm_region *old_region;
1865 VEC(tm_region_p, heap) *bb_regions = NULL;
1867 all_tm_regions = region;
1868 bb = single_succ (ENTRY_BLOCK_PTR);
1870 /* We could store this information in bb->aux, but we may get called
1871 through get_all_tm_blocks() from another pass that may be already
1873 VEC_safe_grow_cleared (tm_region_p, heap, bb_regions, last_basic_block);
1875 VEC_safe_push (basic_block, heap, queue, bb);
1876 VEC_replace (tm_region_p, bb_regions, bb->index, region);
1879 bb = VEC_pop (basic_block, queue);
1880 region = VEC_index (tm_region_p, bb_regions, bb->index);
1881 VEC_replace (tm_region_p, bb_regions, bb->index, NULL);
1883 /* Record exit and irrevocable blocks. */
1884 region = tm_region_init_1 (region, bb);
1886 /* Check for the last statement in the block beginning a new region. */
1888 old_region = region;
1889 if (g && gimple_code (g) == GIMPLE_TRANSACTION)
1890 region = tm_region_init_0 (region, bb, g);
1892 /* Process subsequent blocks. */
1893 FOR_EACH_EDGE (e, ei, bb->succs)
1894 if (!bitmap_bit_p (visited_blocks, e->dest->index))
1896 bitmap_set_bit (visited_blocks, e->dest->index);
1897 VEC_safe_push (basic_block, heap, queue, e->dest);
1899 /* If the current block started a new region, make sure that only
1900 the entry block of the new region is associated with this region.
1901 Other successors are still part of the old region. */
1902 if (old_region != region && e->dest != region->entry_block)
1903 VEC_replace (tm_region_p, bb_regions, e->dest->index, old_region);
1905 VEC_replace (tm_region_p, bb_regions, e->dest->index, region);
1908 while (!VEC_empty (basic_block, queue));
1909 VEC_free (basic_block, heap, queue);
1910 BITMAP_FREE (visited_blocks);
1911 VEC_free (tm_region_p, heap, bb_regions);
1914 /* The "gate" function for all transactional memory expansion and optimization
1915 passes. We collect region information for each top-level transaction, and
1916 if we don't find any, we skip all of the TM passes. Each region will have
1917 all of the exit blocks recorded, and the originating statement. */
1925 calculate_dominance_info (CDI_DOMINATORS);
1926 bitmap_obstack_initialize (&tm_obstack);
1928 /* If the function is a TM_CLONE, then the entire function is the region. */
1929 if (decl_is_tm_clone (current_function_decl))
1931 struct tm_region *region = (struct tm_region *)
1932 obstack_alloc (&tm_obstack.obstack, sizeof (struct tm_region));
1933 memset (region, 0, sizeof (*region));
1934 region->entry_block = single_succ (ENTRY_BLOCK_PTR);
1935 /* For a clone, the entire function is the region. But even if
1936 we don't need to record any exit blocks, we may need to
1937 record irrevocable blocks. */
1938 region->irr_blocks = BITMAP_ALLOC (&tm_obstack);
1940 tm_region_init (region);
1944 tm_region_init (NULL);
1946 /* If we didn't find any regions, cleanup and skip the whole tree
1947 of tm-related optimizations. */
1948 if (all_tm_regions == NULL)
1950 bitmap_obstack_release (&tm_obstack);
1958 struct gimple_opt_pass pass_tm_init =
1962 "*tminit", /* name */
1963 gate_tm_init, /* gate */
1967 0, /* static_pass_number */
1968 TV_TRANS_MEM, /* tv_id */
1969 PROP_ssa | PROP_cfg, /* properties_required */
1970 0, /* properties_provided */
1971 0, /* properties_destroyed */
1972 0, /* todo_flags_start */
1973 0, /* todo_flags_finish */
1977 /* Add FLAGS to the GIMPLE_TRANSACTION subcode for the transaction region
1978 represented by STATE. */
1981 transaction_subcode_ior (struct tm_region *region, unsigned flags)
1983 if (region && region->transaction_stmt)
1985 flags |= gimple_transaction_subcode (region->transaction_stmt);
1986 gimple_transaction_set_subcode (region->transaction_stmt, flags);
1990 /* Construct a memory load in a transactional context. Return the
1991 gimple statement performing the load, or NULL if there is no
1992 TM_LOAD builtin of the appropriate size to do the load.
1994 LOC is the location to use for the new statement(s). */
1997 build_tm_load (location_t loc, tree lhs, tree rhs, gimple_stmt_iterator *gsi)
1999 enum built_in_function code = END_BUILTINS;
2000 tree t, type = TREE_TYPE (rhs), decl;
2003 if (type == float_type_node)
2004 code = BUILT_IN_TM_LOAD_FLOAT;
2005 else if (type == double_type_node)
2006 code = BUILT_IN_TM_LOAD_DOUBLE;
2007 else if (type == long_double_type_node)
2008 code = BUILT_IN_TM_LOAD_LDOUBLE;
2009 else if (TYPE_SIZE_UNIT (type) != NULL
2010 && host_integerp (TYPE_SIZE_UNIT (type), 1))
2012 switch (tree_low_cst (TYPE_SIZE_UNIT (type), 1))
2015 code = BUILT_IN_TM_LOAD_1;
2018 code = BUILT_IN_TM_LOAD_2;
2021 code = BUILT_IN_TM_LOAD_4;
2024 code = BUILT_IN_TM_LOAD_8;
2029 if (code == END_BUILTINS)
2031 decl = targetm.vectorize.builtin_tm_load (type);
2036 decl = builtin_decl_explicit (code);
2038 t = gimplify_addr (gsi, rhs);
2039 gcall = gimple_build_call (decl, 1, t);
2040 gimple_set_location (gcall, loc);
2042 t = TREE_TYPE (TREE_TYPE (decl));
2043 if (useless_type_conversion_p (type, t))
2045 gimple_call_set_lhs (gcall, lhs);
2046 gsi_insert_before (gsi, gcall, GSI_SAME_STMT);
2053 temp = make_rename_temp (t, NULL);
2054 gimple_call_set_lhs (gcall, temp);
2055 gsi_insert_before (gsi, gcall, GSI_SAME_STMT);
2057 t = fold_build1 (VIEW_CONVERT_EXPR, type, temp);
2058 g = gimple_build_assign (lhs, t);
2059 gsi_insert_before (gsi, g, GSI_SAME_STMT);
2066 /* Similarly for storing TYPE in a transactional context. */
2069 build_tm_store (location_t loc, tree lhs, tree rhs, gimple_stmt_iterator *gsi)
2071 enum built_in_function code = END_BUILTINS;
2072 tree t, fn, type = TREE_TYPE (rhs), simple_type;
2075 if (type == float_type_node)
2076 code = BUILT_IN_TM_STORE_FLOAT;
2077 else if (type == double_type_node)
2078 code = BUILT_IN_TM_STORE_DOUBLE;
2079 else if (type == long_double_type_node)
2080 code = BUILT_IN_TM_STORE_LDOUBLE;
2081 else if (TYPE_SIZE_UNIT (type) != NULL
2082 && host_integerp (TYPE_SIZE_UNIT (type), 1))
2084 switch (tree_low_cst (TYPE_SIZE_UNIT (type), 1))
2087 code = BUILT_IN_TM_STORE_1;
2090 code = BUILT_IN_TM_STORE_2;
2093 code = BUILT_IN_TM_STORE_4;
2096 code = BUILT_IN_TM_STORE_8;
2101 if (code == END_BUILTINS)
2103 fn = targetm.vectorize.builtin_tm_store (type);
2108 fn = builtin_decl_explicit (code);
2110 simple_type = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn))));
2112 if (TREE_CODE (rhs) == CONSTRUCTOR)
2114 /* Handle the easy initialization to zero. */
2115 if (CONSTRUCTOR_ELTS (rhs) == 0)
2116 rhs = build_int_cst (simple_type, 0);
2119 /* ...otherwise punt to the caller and probably use
2120 BUILT_IN_TM_MEMMOVE, because we can't wrap a
2121 VIEW_CONVERT_EXPR around a CONSTRUCTOR (below) and produce
2126 else if (!useless_type_conversion_p (simple_type, type))
2131 temp = make_rename_temp (simple_type, NULL);
2132 t = fold_build1 (VIEW_CONVERT_EXPR, simple_type, rhs);
2133 g = gimple_build_assign (temp, t);
2134 gimple_set_location (g, loc);
2135 gsi_insert_before (gsi, g, GSI_SAME_STMT);
2140 t = gimplify_addr (gsi, lhs);
2141 gcall = gimple_build_call (fn, 2, t, rhs);
2142 gimple_set_location (gcall, loc);
2143 gsi_insert_before (gsi, gcall, GSI_SAME_STMT);
2149 /* Expand an assignment statement into transactional builtins. */
2152 expand_assign_tm (struct tm_region *region, gimple_stmt_iterator *gsi)
2154 gimple stmt = gsi_stmt (*gsi);
2155 location_t loc = gimple_location (stmt);
2156 tree lhs = gimple_assign_lhs (stmt);
2157 tree rhs = gimple_assign_rhs1 (stmt);
2158 bool store_p = requires_barrier (region->entry_block, lhs, NULL);
2159 bool load_p = requires_barrier (region->entry_block, rhs, NULL);
2160 gimple gcall = NULL;
2162 if (!load_p && !store_p)
2164 /* Add thread private addresses to log if applicable. */
2165 requires_barrier (region->entry_block, lhs, stmt);
2170 gsi_remove (gsi, true);
2172 if (load_p && !store_p)
2174 transaction_subcode_ior (region, GTMA_HAVE_LOAD);
2175 gcall = build_tm_load (loc, lhs, rhs, gsi);
2177 else if (store_p && !load_p)
2179 transaction_subcode_ior (region, GTMA_HAVE_STORE);
2180 gcall = build_tm_store (loc, lhs, rhs, gsi);
2184 tree lhs_addr, rhs_addr, tmp;
2187 transaction_subcode_ior (region, GTMA_HAVE_LOAD);
2189 transaction_subcode_ior (region, GTMA_HAVE_STORE);
2191 /* ??? Figure out if there's any possible overlap between the LHS
2192 and the RHS and if not, use MEMCPY. */
2194 if (load_p && is_gimple_reg (lhs))
2196 tmp = create_tmp_var (TREE_TYPE (lhs), NULL);
2197 lhs_addr = build_fold_addr_expr (tmp);
2202 lhs_addr = gimplify_addr (gsi, lhs);
2204 rhs_addr = gimplify_addr (gsi, rhs);
2205 gcall = gimple_build_call (builtin_decl_explicit (BUILT_IN_TM_MEMMOVE),
2206 3, lhs_addr, rhs_addr,
2207 TYPE_SIZE_UNIT (TREE_TYPE (lhs)));
2208 gimple_set_location (gcall, loc);
2209 gsi_insert_before (gsi, gcall, GSI_SAME_STMT);
2213 gcall = gimple_build_assign (lhs, tmp);
2214 gsi_insert_before (gsi, gcall, GSI_SAME_STMT);
2218 /* Now that we have the load/store in its instrumented form, add
2219 thread private addresses to the log if applicable. */
2221 requires_barrier (region->entry_block, lhs, gcall);
2223 /* add_stmt_to_tm_region (region, gcall); */
2227 /* Expand a call statement as appropriate for a transaction. That is,
2228 either verify that the call does not affect the transaction, or
2229 redirect the call to a clone that handles transactions, or change
2230 the transaction state to IRREVOCABLE. Return true if the call is
2231 one of the builtins that end a transaction. */
2234 expand_call_tm (struct tm_region *region,
2235 gimple_stmt_iterator *gsi)
2237 gimple stmt = gsi_stmt (*gsi);
2238 tree lhs = gimple_call_lhs (stmt);
2240 struct cgraph_node *node;
2241 bool retval = false;
2243 fn_decl = gimple_call_fndecl (stmt);
2245 if (fn_decl == builtin_decl_explicit (BUILT_IN_TM_MEMCPY)
2246 || fn_decl == builtin_decl_explicit (BUILT_IN_TM_MEMMOVE))
2247 transaction_subcode_ior (region, GTMA_HAVE_STORE | GTMA_HAVE_LOAD);
2248 if (fn_decl == builtin_decl_explicit (BUILT_IN_TM_MEMSET))
2249 transaction_subcode_ior (region, GTMA_HAVE_STORE);
2251 if (is_tm_pure_call (stmt))
2255 retval = is_tm_ending_fndecl (fn_decl);
2258 /* Assume all non-const/pure calls write to memory, except
2259 transaction ending builtins. */
2260 transaction_subcode_ior (region, GTMA_HAVE_STORE);
2263 /* For indirect calls, we already generated a call into the runtime. */
2266 tree fn = gimple_call_fn (stmt);
2268 /* We are guaranteed never to go irrevocable on a safe or pure
2269 call, and the pure call was handled above. */
2270 if (is_tm_safe (fn))
2273 transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE);
2278 node = cgraph_get_node (fn_decl);
2279 /* All calls should have cgraph here. */
2281 if (node->local.tm_may_enter_irr)
2282 transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE);
2284 if (is_tm_abort (fn_decl))
2286 transaction_subcode_ior (region, GTMA_HAVE_ABORT);
2290 /* Instrument the store if needed.
2292 If the assignment happens inside the function call (return slot
2293 optimization), there is no instrumentation to be done, since
2294 the callee should have done the right thing. */
2295 if (lhs && requires_barrier (region->entry_block, lhs, stmt)
2296 && !gimple_call_return_slot_opt_p (stmt))
2298 tree tmp = make_rename_temp (TREE_TYPE (lhs), NULL);
2299 location_t loc = gimple_location (stmt);
2300 edge fallthru_edge = NULL;
2302 /* Remember if the call was going to throw. */
2303 if (stmt_can_throw_internal (stmt))
2307 basic_block bb = gimple_bb (stmt);
2309 FOR_EACH_EDGE (e, ei, bb->succs)
2310 if (e->flags & EDGE_FALLTHRU)
2317 gimple_call_set_lhs (stmt, tmp);
2319 stmt = gimple_build_assign (lhs, tmp);
2320 gimple_set_location (stmt, loc);
2322 /* We cannot throw in the middle of a BB. If the call was going
2323 to throw, place the instrumentation on the fallthru edge, so
2324 the call remains the last statement in the block. */
2327 gimple_seq fallthru_seq = gimple_seq_alloc_with_stmt (stmt);
2328 gimple_stmt_iterator fallthru_gsi = gsi_start (fallthru_seq);
2329 expand_assign_tm (region, &fallthru_gsi);
2330 gsi_insert_seq_on_edge (fallthru_edge, fallthru_seq);
2331 pending_edge_inserts_p = true;
2335 gsi_insert_after (gsi, stmt, GSI_CONTINUE_LINKING);
2336 expand_assign_tm (region, gsi);
2339 transaction_subcode_ior (region, GTMA_HAVE_STORE);
2346 /* Expand all statements in BB as appropriate for being inside
2350 expand_block_tm (struct tm_region *region, basic_block bb)
2352 gimple_stmt_iterator gsi;
2354 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); )
2356 gimple stmt = gsi_stmt (gsi);
2357 switch (gimple_code (stmt))
2360 /* Only memory reads/writes need to be instrumented. */
2361 if (gimple_assign_single_p (stmt)
2362 && !gimple_clobber_p (stmt))
2364 expand_assign_tm (region, &gsi);
2370 if (expand_call_tm (region, &gsi))
2380 if (!gsi_end_p (gsi))
2385 /* Return the list of basic-blocks in REGION.
2387 STOP_AT_IRREVOCABLE_P is true if caller is uninterested in blocks
2388 following a TM_IRREVOCABLE call. */
2390 static VEC (basic_block, heap) *
2391 get_tm_region_blocks (basic_block entry_block,
2394 bitmap all_region_blocks,
2395 bool stop_at_irrevocable_p)
2397 VEC(basic_block, heap) *bbs = NULL;
2401 bitmap visited_blocks = BITMAP_ALLOC (NULL);
2404 VEC_safe_push (basic_block, heap, bbs, entry_block);
2405 bitmap_set_bit (visited_blocks, entry_block->index);
2409 basic_block bb = VEC_index (basic_block, bbs, i++);
2412 bitmap_bit_p (exit_blocks, bb->index))
2415 if (stop_at_irrevocable_p
2417 && bitmap_bit_p (irr_blocks, bb->index))
2420 FOR_EACH_EDGE (e, ei, bb->succs)
2421 if (!bitmap_bit_p (visited_blocks, e->dest->index))
2423 bitmap_set_bit (visited_blocks, e->dest->index);
2424 VEC_safe_push (basic_block, heap, bbs, e->dest);
2427 while (i < VEC_length (basic_block, bbs));
2429 if (all_region_blocks)
2430 bitmap_ior_into (all_region_blocks, visited_blocks);
2432 BITMAP_FREE (visited_blocks);
2436 /* Set the IN_TRANSACTION for all gimple statements that appear in a
2440 compute_transaction_bits (void)
2442 struct tm_region *region;
2443 VEC (basic_block, heap) *queue;
2445 gimple_stmt_iterator gsi;
2448 /* ?? Perhaps we need to abstract gate_tm_init further, because we
2449 certainly don't need it to calculate CDI_DOMINATOR info. */
2452 for (region = all_tm_regions; region; region = region->next)
2454 queue = get_tm_region_blocks (region->entry_block,
2455 region->exit_blocks,
2458 /*stop_at_irr_p=*/true);
2459 for (i = 0; VEC_iterate (basic_block, queue, i, bb); ++i)
2460 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
2462 gimple stmt = gsi_stmt (gsi);
2463 gimple_set_in_transaction (stmt, true);
2465 VEC_free (basic_block, heap, queue);
2469 bitmap_obstack_release (&tm_obstack);
2472 /* Entry point to the MARK phase of TM expansion. Here we replace
2473 transactional memory statements with calls to builtins, and function
2474 calls with their transactional clones (if available). But we don't
2475 yet lower GIMPLE_TRANSACTION or add the transaction restart back-edges. */
2478 execute_tm_mark (void)
2480 struct tm_region *region;
2482 VEC (basic_block, heap) *queue;
2485 queue = VEC_alloc (basic_block, heap, 10);
2486 pending_edge_inserts_p = false;
2488 for (region = all_tm_regions; region ; region = region->next)
2491 /* If we have a transaction... */
2492 if (region->exit_blocks)
2494 unsigned int subcode
2495 = gimple_transaction_subcode (region->transaction_stmt);
2497 /* Collect a new SUBCODE set, now that optimizations are done... */
2498 if (subcode & GTMA_DOES_GO_IRREVOCABLE)
2499 subcode &= (GTMA_DECLARATION_MASK | GTMA_DOES_GO_IRREVOCABLE
2500 | GTMA_MAY_ENTER_IRREVOCABLE);
2502 subcode &= GTMA_DECLARATION_MASK;
2503 gimple_transaction_set_subcode (region->transaction_stmt, subcode);
2506 queue = get_tm_region_blocks (region->entry_block,
2507 region->exit_blocks,
2510 /*stop_at_irr_p=*/true);
2511 for (i = 0; VEC_iterate (basic_block, queue, i, bb); ++i)
2512 expand_block_tm (region, bb);
2513 VEC_free (basic_block, heap, queue);
2518 if (pending_edge_inserts_p)
2519 gsi_commit_edge_inserts ();
2523 struct gimple_opt_pass pass_tm_mark =
2527 "tmmark", /* name */
2529 execute_tm_mark, /* execute */
2532 0, /* static_pass_number */
2533 TV_TRANS_MEM, /* tv_id */
2534 PROP_ssa | PROP_cfg, /* properties_required */
2535 0, /* properties_provided */
2536 0, /* properties_destroyed */
2537 0, /* todo_flags_start */
2540 | TODO_dump_func, /* todo_flags_finish */
2544 /* Create an abnormal call edge from BB to the first block of the region
2545 represented by STATE. Also record the edge in the TM_RESTART map. */
2548 make_tm_edge (gimple stmt, basic_block bb, struct tm_region *region)
2551 struct tm_restart_node *n, dummy;
2553 if (cfun->gimple_df->tm_restart == NULL)
2554 cfun->gimple_df->tm_restart = htab_create_ggc (31, struct_ptr_hash,
2555 struct_ptr_eq, ggc_free);
2558 dummy.label_or_list = gimple_block_label (region->entry_block);
2559 slot = htab_find_slot (cfun->gimple_df->tm_restart, &dummy, INSERT);
2560 n = (struct tm_restart_node *) *slot;
2563 n = ggc_alloc_tm_restart_node ();
2568 tree old = n->label_or_list;
2569 if (TREE_CODE (old) == LABEL_DECL)
2570 old = tree_cons (NULL, old, NULL);
2571 n->label_or_list = tree_cons (NULL, dummy.label_or_list, old);
2574 make_edge (bb, region->entry_block, EDGE_ABNORMAL | EDGE_ABNORMAL_CALL);
2578 /* Split block BB as necessary for every builtin function we added, and
2579 wire up the abnormal back edges implied by the transaction restart. */
2582 expand_block_edges (struct tm_region *region, basic_block bb)
2584 gimple_stmt_iterator gsi;
2586 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); )
2588 bool do_next = true;
2589 gimple stmt = gsi_stmt (gsi);
2591 /* ??? TM_COMMIT (and any other tm builtin function) in a nested
2592 transaction has an abnormal edge back to the outer-most transaction
2593 (there are no nested retries), while a TM_ABORT also has an abnormal
2594 backedge to the inner-most transaction. We haven't actually saved
2595 the inner-most transaction here. We should be able to get to it
2596 via the region_nr saved on STMT, and read the transaction_stmt from
2597 that, and find the first region block from there. */
2598 /* ??? Shouldn't we split for any non-pure, non-irrevocable function? */
2599 if (gimple_code (stmt) == GIMPLE_CALL
2600 && (gimple_call_flags (stmt) & ECF_TM_BUILTIN) != 0)
2602 if (gsi_one_before_end_p (gsi))
2603 make_tm_edge (stmt, bb, region);
2606 edge e = split_block (bb, stmt);
2607 make_tm_edge (stmt, bb, region);
2609 gsi = gsi_start_bb (bb);
2613 /* Delete any tail-call annotation that may have been added.
2614 The tail-call pass may have mis-identified the commit as being
2615 a candidate because we had not yet added this restart edge. */
2616 gimple_call_set_tail (stmt, false);
2624 /* Expand the GIMPLE_TRANSACTION statement into the STM library call. */
2627 expand_transaction (struct tm_region *region)
2629 tree status, tm_start;
2630 basic_block atomic_bb, slice_bb;
2631 gimple_stmt_iterator gsi;
2636 tm_start = builtin_decl_explicit (BUILT_IN_TM_START);
2637 status = make_rename_temp (TREE_TYPE (TREE_TYPE (tm_start)), "tm_state");
2639 /* ??? There are plenty of bits here we're not computing. */
2640 subcode = gimple_transaction_subcode (region->transaction_stmt);
2641 if (subcode & GTMA_DOES_GO_IRREVOCABLE)
2642 flags = PR_DOESGOIRREVOCABLE | PR_UNINSTRUMENTEDCODE;
2644 flags = PR_INSTRUMENTEDCODE;
2645 if ((subcode & GTMA_MAY_ENTER_IRREVOCABLE) == 0)
2646 flags |= PR_HASNOIRREVOCABLE;
2647 /* If the transaction does not have an abort in lexical scope and is not
2648 marked as an outer transaction, then it will never abort. */
2649 if ((subcode & GTMA_HAVE_ABORT) == 0
2650 && (subcode & GTMA_IS_OUTER) == 0)
2651 flags |= PR_HASNOABORT;
2652 if ((subcode & GTMA_HAVE_STORE) == 0)
2653 flags |= PR_READONLY;
2654 t2 = build_int_cst (TREE_TYPE (status), flags);
2655 g = gimple_build_call (tm_start, 1, t2);
2656 gimple_call_set_lhs (g, status);
2657 gimple_set_location (g, gimple_location (region->transaction_stmt));
2659 atomic_bb = gimple_bb (region->transaction_stmt);
2661 if (!VEC_empty (tree, tm_log_save_addresses))
2662 tm_log_emit_saves (region->entry_block, atomic_bb);
2664 gsi = gsi_last_bb (atomic_bb);
2665 gsi_insert_before (&gsi, g, GSI_SAME_STMT);
2666 gsi_remove (&gsi, true);
2668 if (!VEC_empty (tree, tm_log_save_addresses))
2669 region->entry_block =
2670 tm_log_emit_save_or_restores (region->entry_block,
2671 A_RESTORELIVEVARIABLES,
2673 tm_log_emit_restores,
2675 FALLTHRU_EDGE (atomic_bb),
2678 slice_bb = atomic_bb;
2680 /* If we have an ABORT statement, create a test following the start
2681 call to perform the abort. */
2682 if (gimple_transaction_label (region->transaction_stmt))
2685 basic_block test_bb;
2687 test_bb = create_empty_bb (slice_bb);
2688 if (VEC_empty (tree, tm_log_save_addresses))
2689 region->entry_block = test_bb;
2690 gsi = gsi_last_bb (test_bb);
2692 t1 = make_rename_temp (TREE_TYPE (status), NULL);
2693 t2 = build_int_cst (TREE_TYPE (status), A_ABORTTRANSACTION);
2694 g = gimple_build_assign_with_ops (BIT_AND_EXPR, t1, status, t2);
2695 gsi_insert_after (&gsi, g, GSI_CONTINUE_LINKING);
2697 t2 = build_int_cst (TREE_TYPE (status), 0);
2698 g = gimple_build_cond (NE_EXPR, t1, t2, NULL, NULL);
2699 gsi_insert_after (&gsi, g, GSI_CONTINUE_LINKING);
2701 e = FALLTHRU_EDGE (slice_bb);
2702 redirect_edge_pred (e, test_bb);
2703 e->flags = EDGE_FALSE_VALUE;
2704 e->probability = PROB_ALWAYS - PROB_VERY_UNLIKELY;
2706 e = BRANCH_EDGE (atomic_bb);
2707 redirect_edge_pred (e, test_bb);
2708 e->flags = EDGE_TRUE_VALUE;
2709 e->probability = PROB_VERY_UNLIKELY;
2711 e = make_edge (slice_bb, test_bb, EDGE_FALLTHRU);
2714 /* If we've no abort, but we do have PHIs at the beginning of the atomic
2715 region, that means we've a loop at the beginning of the atomic region
2716 that shares the first block. This can cause problems with the abnormal
2717 edges we're about to add for the transaction restart. Solve this by
2718 adding a new empty block to receive the abnormal edges. */
2719 else if (phi_nodes (region->entry_block))
2722 basic_block empty_bb;
2724 region->entry_block = empty_bb = create_empty_bb (atomic_bb);
2726 e = FALLTHRU_EDGE (atomic_bb);
2727 redirect_edge_pred (e, empty_bb);
2729 e = make_edge (atomic_bb, empty_bb, EDGE_FALLTHRU);
2732 /* The GIMPLE_TRANSACTION statement no longer exists. */
2733 region->transaction_stmt = NULL;
2736 static void expand_regions (struct tm_region *);
2738 /* Helper function for expand_regions. Expand REGION and recurse to
2739 the inner region. */
2742 expand_regions_1 (struct tm_region *region)
2744 if (region->exit_blocks)
2748 VEC (basic_block, heap) *queue;
2750 /* Collect the set of blocks in this region. Do this before
2751 splitting edges, so that we don't have to play with the
2752 dominator tree in the middle. */
2753 queue = get_tm_region_blocks (region->entry_block,
2754 region->exit_blocks,
2757 /*stop_at_irr_p=*/false);
2758 expand_transaction (region);
2759 for (i = 0; VEC_iterate (basic_block, queue, i, bb); ++i)
2760 expand_block_edges (region, bb);
2761 VEC_free (basic_block, heap, queue);
2764 expand_regions (region->inner);
2767 /* Expand regions starting at REGION. */
2770 expand_regions (struct tm_region *region)
2774 expand_regions_1 (region);
2775 region = region->next;
2779 /* Entry point to the final expansion of transactional nodes. */
2782 execute_tm_edges (void)
2784 expand_regions (all_tm_regions);
2787 /* We've got to release the dominance info now, to indicate that it
2788 must be rebuilt completely. Otherwise we'll crash trying to update
2789 the SSA web in the TODO section following this pass. */
2790 free_dominance_info (CDI_DOMINATORS);
2791 bitmap_obstack_release (&tm_obstack);
2792 all_tm_regions = NULL;
2797 struct gimple_opt_pass pass_tm_edges =
2801 "tmedge", /* name */
2803 execute_tm_edges, /* execute */
2806 0, /* static_pass_number */
2807 TV_TRANS_MEM, /* tv_id */
2808 PROP_ssa | PROP_cfg, /* properties_required */
2809 0, /* properties_provided */
2810 0, /* properties_destroyed */
2811 0, /* todo_flags_start */
2814 | TODO_dump_func, /* todo_flags_finish */
2818 /* A unique TM memory operation. */
2819 typedef struct tm_memop
2821 /* Unique ID that all memory operations to the same location have. */
2822 unsigned int value_id;
2823 /* Address of load/store. */
2827 /* Sets for solving data flow equations in the memory optimization pass. */
2828 struct tm_memopt_bitmaps
2830 /* Stores available to this BB upon entry. Basically, stores that
2831 dominate this BB. */
2832 bitmap store_avail_in;
2833 /* Stores available at the end of this BB. */
2834 bitmap store_avail_out;
2835 bitmap store_antic_in;
2836 bitmap store_antic_out;
2837 /* Reads available to this BB upon entry. Basically, reads that
2838 dominate this BB. */
2839 bitmap read_avail_in;
2840 /* Reads available at the end of this BB. */
2841 bitmap read_avail_out;
2842 /* Reads performed in this BB. */
2844 /* Writes performed in this BB. */
2847 /* Temporary storage for pass. */
2848 /* Is the current BB in the worklist? */
2849 bool avail_in_worklist_p;
2850 /* Have we visited this BB? */
2854 static bitmap_obstack tm_memopt_obstack;
2856 /* Unique counter for TM loads and stores. Loads and stores of the
2857 same address get the same ID. */
2858 static unsigned int tm_memopt_value_id;
2859 static htab_t tm_memopt_value_numbers;
2861 #define STORE_AVAIL_IN(BB) \
2862 ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_avail_in
2863 #define STORE_AVAIL_OUT(BB) \
2864 ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_avail_out
2865 #define STORE_ANTIC_IN(BB) \
2866 ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_antic_in
2867 #define STORE_ANTIC_OUT(BB) \
2868 ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_antic_out
2869 #define READ_AVAIL_IN(BB) \
2870 ((struct tm_memopt_bitmaps *) ((BB)->aux))->read_avail_in
2871 #define READ_AVAIL_OUT(BB) \
2872 ((struct tm_memopt_bitmaps *) ((BB)->aux))->read_avail_out
2873 #define READ_LOCAL(BB) \
2874 ((struct tm_memopt_bitmaps *) ((BB)->aux))->read_local
2875 #define STORE_LOCAL(BB) \
2876 ((struct tm_memopt_bitmaps *) ((BB)->aux))->store_local
2877 #define AVAIL_IN_WORKLIST_P(BB) \
2878 ((struct tm_memopt_bitmaps *) ((BB)->aux))->avail_in_worklist_p
2879 #define BB_VISITED_P(BB) \
2880 ((struct tm_memopt_bitmaps *) ((BB)->aux))->visited_p
2882 /* Htab support. Return a hash value for a `tm_memop'. */
2884 tm_memop_hash (const void *p)
2886 const struct tm_memop *mem = (const struct tm_memop *) p;
2887 tree addr = mem->addr;
2888 /* We drill down to the SSA_NAME/DECL for the hash, but equality is
2889 actually done with operand_equal_p (see tm_memop_eq). */
2890 if (TREE_CODE (addr) == ADDR_EXPR)
2891 addr = TREE_OPERAND (addr, 0);
2892 return iterative_hash_expr (addr, 0);
2895 /* Htab support. Return true if two tm_memop's are the same. */
2897 tm_memop_eq (const void *p1, const void *p2)
2899 const struct tm_memop *mem1 = (const struct tm_memop *) p1;
2900 const struct tm_memop *mem2 = (const struct tm_memop *) p2;
2902 return operand_equal_p (mem1->addr, mem2->addr, 0);
2905 /* Given a TM load/store in STMT, return the value number for the address
2909 tm_memopt_value_number (gimple stmt, enum insert_option op)
2911 struct tm_memop tmpmem, *mem;
2914 gcc_assert (is_tm_load (stmt) || is_tm_store (stmt));
2915 tmpmem.addr = gimple_call_arg (stmt, 0);
2916 slot = htab_find_slot (tm_memopt_value_numbers, &tmpmem, op);
2918 mem = (struct tm_memop *) *slot;
2919 else if (op == INSERT)
2921 mem = XNEW (struct tm_memop);
2923 mem->value_id = tm_memopt_value_id++;
2924 mem->addr = tmpmem.addr;
2928 return mem->value_id;
2931 /* Accumulate TM memory operations in BB into STORE_LOCAL and READ_LOCAL. */
2934 tm_memopt_accumulate_memops (basic_block bb)
2936 gimple_stmt_iterator gsi;
2938 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
2940 gimple stmt = gsi_stmt (gsi);
2944 if (is_tm_store (stmt))
2945 bits = STORE_LOCAL (bb);
2946 else if (is_tm_load (stmt))
2947 bits = READ_LOCAL (bb);
2951 loc = tm_memopt_value_number (stmt, INSERT);
2952 bitmap_set_bit (bits, loc);
2955 fprintf (dump_file, "TM memopt (%s): value num=%d, BB=%d, addr=",
2956 is_tm_load (stmt) ? "LOAD" : "STORE", loc,
2957 gimple_bb (stmt)->index);
2958 print_generic_expr (dump_file, gimple_call_arg (stmt, 0), 0);
2959 fprintf (dump_file, "\n");
2964 /* Prettily dump one of the memopt sets. BITS is the bitmap to dump. */
2967 dump_tm_memopt_set (const char *set_name, bitmap bits)
2971 const char *comma = "";
2973 fprintf (dump_file, "TM memopt: %s: [", set_name);
2974 EXECUTE_IF_SET_IN_BITMAP (bits, 0, i, bi)
2977 struct tm_memop *mem;
2979 /* Yeah, yeah, yeah. Whatever. This is just for debugging. */
2980 FOR_EACH_HTAB_ELEMENT (tm_memopt_value_numbers, mem, tm_memop_t, hi)
2981 if (mem->value_id == i)
2983 gcc_assert (mem->value_id == i);
2984 fprintf (dump_file, "%s", comma);
2986 print_generic_expr (dump_file, mem->addr, 0);
2988 fprintf (dump_file, "]\n");
2991 /* Prettily dump all of the memopt sets in BLOCKS. */
2994 dump_tm_memopt_sets (VEC (basic_block, heap) *blocks)
2999 for (i = 0; VEC_iterate (basic_block, blocks, i, bb); ++i)
3001 fprintf (dump_file, "------------BB %d---------\n", bb->index);
3002 dump_tm_memopt_set ("STORE_LOCAL", STORE_LOCAL (bb));
3003 dump_tm_memopt_set ("READ_LOCAL", READ_LOCAL (bb));
3004 dump_tm_memopt_set ("STORE_AVAIL_IN", STORE_AVAIL_IN (bb));
3005 dump_tm_memopt_set ("STORE_AVAIL_OUT", STORE_AVAIL_OUT (bb));
3006 dump_tm_memopt_set ("READ_AVAIL_IN", READ_AVAIL_IN (bb));
3007 dump_tm_memopt_set ("READ_AVAIL_OUT", READ_AVAIL_OUT (bb));
3011 /* Compute {STORE,READ}_AVAIL_IN for the basic block BB. */
3014 tm_memopt_compute_avin (basic_block bb)
3019 /* Seed with the AVOUT of any predecessor. */
3020 for (ix = 0; ix < EDGE_COUNT (bb->preds); ix++)
3022 e = EDGE_PRED (bb, ix);
3023 /* Make sure we have already visited this BB, and is thus
3026 If e->src->aux is NULL, this predecessor is actually on an
3027 enclosing transaction. We only care about the current
3028 transaction, so ignore it. */
3029 if (e->src->aux && BB_VISITED_P (e->src))
3031 bitmap_copy (STORE_AVAIL_IN (bb), STORE_AVAIL_OUT (e->src));
3032 bitmap_copy (READ_AVAIL_IN (bb), READ_AVAIL_OUT (e->src));
3037 for (; ix < EDGE_COUNT (bb->preds); ix++)
3039 e = EDGE_PRED (bb, ix);
3040 if (e->src->aux && BB_VISITED_P (e->src))
3042 bitmap_and_into (STORE_AVAIL_IN (bb), STORE_AVAIL_OUT (e->src));
3043 bitmap_and_into (READ_AVAIL_IN (bb), READ_AVAIL_OUT (e->src));
3047 BB_VISITED_P (bb) = true;
3050 /* Compute the STORE_ANTIC_IN for the basic block BB. */
3053 tm_memopt_compute_antin (basic_block bb)
3058 /* Seed with the ANTIC_OUT of any successor. */
3059 for (ix = 0; ix < EDGE_COUNT (bb->succs); ix++)
3061 e = EDGE_SUCC (bb, ix);
3062 /* Make sure we have already visited this BB, and is thus
3064 if (BB_VISITED_P (e->dest))
3066 bitmap_copy (STORE_ANTIC_IN (bb), STORE_ANTIC_OUT (e->dest));
3071 for (; ix < EDGE_COUNT (bb->succs); ix++)
3073 e = EDGE_SUCC (bb, ix);
3074 if (BB_VISITED_P (e->dest))
3075 bitmap_and_into (STORE_ANTIC_IN (bb), STORE_ANTIC_OUT (e->dest));
3078 BB_VISITED_P (bb) = true;
3081 /* Compute the AVAIL sets for every basic block in BLOCKS.
3083 We compute {STORE,READ}_AVAIL_{OUT,IN} as follows:
3085 AVAIL_OUT[bb] = union (AVAIL_IN[bb], LOCAL[bb])
3086 AVAIL_IN[bb] = intersect (AVAIL_OUT[predecessors])
3088 This is basically what we do in lcm's compute_available(), but here
3089 we calculate two sets of sets (one for STOREs and one for READs),
3090 and we work on a region instead of the entire CFG.
3092 REGION is the TM region.
3093 BLOCKS are the basic blocks in the region. */
3096 tm_memopt_compute_available (struct tm_region *region,
3097 VEC (basic_block, heap) *blocks)
3100 basic_block *worklist, *qin, *qout, *qend, bb;
3101 unsigned int qlen, i;
3105 /* Allocate a worklist array/queue. Entries are only added to the
3106 list if they were not already on the list. So the size is
3107 bounded by the number of basic blocks in the region. */
3108 qlen = VEC_length (basic_block, blocks) - 1;
3109 qin = qout = worklist =
3110 XNEWVEC (basic_block, qlen);
3112 /* Put every block in the region on the worklist. */
3113 for (i = 0; VEC_iterate (basic_block, blocks, i, bb); ++i)
3115 /* Seed AVAIL_OUT with the LOCAL set. */
3116 bitmap_ior_into (STORE_AVAIL_OUT (bb), STORE_LOCAL (bb));
3117 bitmap_ior_into (READ_AVAIL_OUT (bb), READ_LOCAL (bb));
3119 AVAIL_IN_WORKLIST_P (bb) = true;
3120 /* No need to insert the entry block, since it has an AVIN of
3121 null, and an AVOUT that has already been seeded in. */
3122 if (bb != region->entry_block)
3126 /* The entry block has been initialized with the local sets. */
3127 BB_VISITED_P (region->entry_block) = true;
3130 qend = &worklist[qlen];
3132 /* Iterate until the worklist is empty. */
3135 /* Take the first entry off the worklist. */
3142 /* This block can be added to the worklist again if necessary. */
3143 AVAIL_IN_WORKLIST_P (bb) = false;
3144 tm_memopt_compute_avin (bb);
3146 /* Note: We do not add the LOCAL sets here because we already
3147 seeded the AVAIL_OUT sets with them. */
3148 changed = bitmap_ior_into (STORE_AVAIL_OUT (bb), STORE_AVAIL_IN (bb));
3149 changed |= bitmap_ior_into (READ_AVAIL_OUT (bb), READ_AVAIL_IN (bb));
3151 && (region->exit_blocks == NULL
3152 || !bitmap_bit_p (region->exit_blocks, bb->index)))
3153 /* If the out state of this block changed, then we need to add
3154 its successors to the worklist if they are not already in. */
3155 FOR_EACH_EDGE (e, ei, bb->succs)
3156 if (!AVAIL_IN_WORKLIST_P (e->dest) && e->dest != EXIT_BLOCK_PTR)
3159 AVAIL_IN_WORKLIST_P (e->dest) = true;
3170 dump_tm_memopt_sets (blocks);
3173 /* Compute ANTIC sets for every basic block in BLOCKS.
3175 We compute STORE_ANTIC_OUT as follows:
3177 STORE_ANTIC_OUT[bb] = union(STORE_ANTIC_IN[bb], STORE_LOCAL[bb])
3178 STORE_ANTIC_IN[bb] = intersect(STORE_ANTIC_OUT[successors])
3180 REGION is the TM region.
3181 BLOCKS are the basic blocks in the region. */
3184 tm_memopt_compute_antic (struct tm_region *region,
3185 VEC (basic_block, heap) *blocks)
3188 basic_block *worklist, *qin, *qout, *qend, bb;
3193 /* Allocate a worklist array/queue. Entries are only added to the
3194 list if they were not already on the list. So the size is
3195 bounded by the number of basic blocks in the region. */
3196 qin = qout = worklist =
3197 XNEWVEC (basic_block, VEC_length (basic_block, blocks));
3199 for (qlen = 0, i = VEC_length (basic_block, blocks) - 1; i >= 0; --i)
3201 bb = VEC_index (basic_block, blocks, i);
3203 /* Seed ANTIC_OUT with the LOCAL set. */
3204 bitmap_ior_into (STORE_ANTIC_OUT (bb), STORE_LOCAL (bb));
3206 /* Put every block in the region on the worklist. */
3207 AVAIL_IN_WORKLIST_P (bb) = true;
3208 /* No need to insert exit blocks, since their ANTIC_IN is NULL,
3209 and their ANTIC_OUT has already been seeded in. */
3210 if (region->exit_blocks
3211 && !bitmap_bit_p (region->exit_blocks, bb->index))
3218 /* The exit blocks have been initialized with the local sets. */
3219 if (region->exit_blocks)
3223 EXECUTE_IF_SET_IN_BITMAP (region->exit_blocks, 0, i, bi)
3224 BB_VISITED_P (BASIC_BLOCK (i)) = true;
3228 qend = &worklist[qlen];
3230 /* Iterate until the worklist is empty. */
3233 /* Take the first entry off the worklist. */
3240 /* This block can be added to the worklist again if necessary. */
3241 AVAIL_IN_WORKLIST_P (bb) = false;
3242 tm_memopt_compute_antin (bb);
3244 /* Note: We do not add the LOCAL sets here because we already
3245 seeded the ANTIC_OUT sets with them. */
3246 if (bitmap_ior_into (STORE_ANTIC_OUT (bb), STORE_ANTIC_IN (bb))
3247 && bb != region->entry_block)
3248 /* If the out state of this block changed, then we need to add
3249 its predecessors to the worklist if they are not already in. */
3250 FOR_EACH_EDGE (e, ei, bb->preds)
3251 if (!AVAIL_IN_WORKLIST_P (e->src))
3254 AVAIL_IN_WORKLIST_P (e->src) = true;
3265 dump_tm_memopt_sets (blocks);
3268 /* Offsets of load variants from TM_LOAD. For example,
3269 BUILT_IN_TM_LOAD_RAR* is an offset of 1 from BUILT_IN_TM_LOAD*.
3270 See gtm-builtins.def. */
3271 #define TRANSFORM_RAR 1
3272 #define TRANSFORM_RAW 2
3273 #define TRANSFORM_RFW 3
3274 /* Offsets of store variants from TM_STORE. */
3275 #define TRANSFORM_WAR 1
3276 #define TRANSFORM_WAW 2
3278 /* Inform about a load/store optimization. */
3281 dump_tm_memopt_transform (gimple stmt)
3285 fprintf (dump_file, "TM memopt: transforming: ");
3286 print_gimple_stmt (dump_file, stmt, 0, 0);
3287 fprintf (dump_file, "\n");
3291 /* Perform a read/write optimization. Replaces the TM builtin in STMT
3292 by a builtin that is OFFSET entries down in the builtins table in
3293 gtm-builtins.def. */
3296 tm_memopt_transform_stmt (unsigned int offset,
3298 gimple_stmt_iterator *gsi)
3300 tree fn = gimple_call_fn (stmt);
3301 gcc_assert (TREE_CODE (fn) == ADDR_EXPR);
3302 TREE_OPERAND (fn, 0)
3303 = builtin_decl_explicit ((enum built_in_function)
3304 (DECL_FUNCTION_CODE (TREE_OPERAND (fn, 0))
3306 gimple_call_set_fn (stmt, fn);
3307 gsi_replace (gsi, stmt, true);
3308 dump_tm_memopt_transform (stmt);
3311 /* Perform the actual TM memory optimization transformations in the
3312 basic blocks in BLOCKS. */
3315 tm_memopt_transform_blocks (VEC (basic_block, heap) *blocks)
3319 gimple_stmt_iterator gsi;
3321 for (i = 0; VEC_iterate (basic_block, blocks, i, bb); ++i)
3323 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3325 gimple stmt = gsi_stmt (gsi);
3326 bitmap read_avail = READ_AVAIL_IN (bb);
3327 bitmap store_avail = STORE_AVAIL_IN (bb);
3328 bitmap store_antic = STORE_ANTIC_OUT (bb);
3331 if (is_tm_simple_load (stmt))
3333 loc = tm_memopt_value_number (stmt, NO_INSERT);
3334 if (store_avail && bitmap_bit_p (store_avail, loc))
3335 tm_memopt_transform_stmt (TRANSFORM_RAW, stmt, &gsi);
3336 else if (store_antic && bitmap_bit_p (store_antic, loc))
3338 tm_memopt_transform_stmt (TRANSFORM_RFW, stmt, &gsi);
3339 bitmap_set_bit (store_avail, loc);
3341 else if (read_avail && bitmap_bit_p (read_avail, loc))
3342 tm_memopt_transform_stmt (TRANSFORM_RAR, stmt, &gsi);
3344 bitmap_set_bit (read_avail, loc);
3346 else if (is_tm_simple_store (stmt))
3348 loc = tm_memopt_value_number (stmt, NO_INSERT);
3349 if (store_avail && bitmap_bit_p (store_avail, loc))
3350 tm_memopt_transform_stmt (TRANSFORM_WAW, stmt, &gsi);
3353 if (read_avail && bitmap_bit_p (read_avail, loc))
3354 tm_memopt_transform_stmt (TRANSFORM_WAR, stmt, &gsi);
3355 bitmap_set_bit (store_avail, loc);
3362 /* Return a new set of bitmaps for a BB. */
3364 static struct tm_memopt_bitmaps *
3365 tm_memopt_init_sets (void)
3367 struct tm_memopt_bitmaps *b
3368 = XOBNEW (&tm_memopt_obstack.obstack, struct tm_memopt_bitmaps);
3369 b->store_avail_in = BITMAP_ALLOC (&tm_memopt_obstack);
3370 b->store_avail_out = BITMAP_ALLOC (&tm_memopt_obstack);
3371 b->store_antic_in = BITMAP_ALLOC (&tm_memopt_obstack);
3372 b->store_antic_out = BITMAP_ALLOC (&tm_memopt_obstack);
3373 b->store_avail_out = BITMAP_ALLOC (&tm_memopt_obstack);
3374 b->read_avail_in = BITMAP_ALLOC (&tm_memopt_obstack);
3375 b->read_avail_out = BITMAP_ALLOC (&tm_memopt_obstack);
3376 b->read_local = BITMAP_ALLOC (&tm_memopt_obstack);
3377 b->store_local = BITMAP_ALLOC (&tm_memopt_obstack);
3381 /* Free sets computed for each BB. */
3384 tm_memopt_free_sets (VEC (basic_block, heap) *blocks)
3389 for (i = 0; VEC_iterate (basic_block, blocks, i, bb); ++i)
3393 /* Clear the visited bit for every basic block in BLOCKS. */
3396 tm_memopt_clear_visited (VEC (basic_block, heap) *blocks)
3401 for (i = 0; VEC_iterate (basic_block, blocks, i, bb); ++i)
3402 BB_VISITED_P (bb) = false;
3405 /* Replace TM load/stores with hints for the runtime. We handle
3406 things like read-after-write, write-after-read, read-after-read,
3407 read-for-write, etc. */
3410 execute_tm_memopt (void)
3412 struct tm_region *region;
3413 VEC (basic_block, heap) *bbs;
3415 tm_memopt_value_id = 0;
3416 tm_memopt_value_numbers = htab_create (10, tm_memop_hash, tm_memop_eq, free);
3418 for (region = all_tm_regions; region; region = region->next)
3420 /* All the TM stores/loads in the current region. */
3424 bitmap_obstack_initialize (&tm_memopt_obstack);
3426 /* Save all BBs for the current region. */
3427 bbs = get_tm_region_blocks (region->entry_block,
3428 region->exit_blocks,
3433 /* Collect all the memory operations. */
3434 for (i = 0; VEC_iterate (basic_block, bbs, i, bb); ++i)
3436 bb->aux = tm_memopt_init_sets ();
3437 tm_memopt_accumulate_memops (bb);
3440 /* Solve data flow equations and transform each block accordingly. */
3441 tm_memopt_clear_visited (bbs);
3442 tm_memopt_compute_available (region, bbs);
3443 tm_memopt_clear_visited (bbs);
3444 tm_memopt_compute_antic (region, bbs);
3445 tm_memopt_transform_blocks (bbs);
3447 tm_memopt_free_sets (bbs);
3448 VEC_free (basic_block, heap, bbs);
3449 bitmap_obstack_release (&tm_memopt_obstack);
3450 htab_empty (tm_memopt_value_numbers);
3453 htab_delete (tm_memopt_value_numbers);
3458 gate_tm_memopt (void)
3460 return flag_tm && optimize > 0;
3463 struct gimple_opt_pass pass_tm_memopt =
3467 "tmmemopt", /* name */
3468 gate_tm_memopt, /* gate */
3469 execute_tm_memopt, /* execute */
3472 0, /* static_pass_number */
3473 TV_TRANS_MEM, /* tv_id */
3474 PROP_ssa | PROP_cfg, /* properties_required */
3475 0, /* properties_provided */
3476 0, /* properties_destroyed */
3477 0, /* todo_flags_start */
3478 TODO_dump_func, /* todo_flags_finish */
3483 /* Interprocedual analysis for the creation of transactional clones.
3484 The aim of this pass is to find which functions are referenced in
3485 a non-irrevocable transaction context, and for those over which
3486 we have control (or user directive), create a version of the
3487 function which uses only the transactional interface to reference
3488 protected memories. This analysis proceeds in several steps:
3490 (1) Collect the set of all possible transactional clones:
3492 (a) For all local public functions marked tm_callable, push
3493 it onto the tm_callee queue.
3495 (b) For all local functions, scan for calls in transaction blocks.
3496 Push the caller and callee onto the tm_caller and tm_callee
3497 queues. Count the number of callers for each callee.
3499 (c) For each local function on the callee list, assume we will
3500 create a transactional clone. Push *all* calls onto the
3501 callee queues; count the number of clone callers separately
3502 to the number of original callers.
3504 (2) Propagate irrevocable status up the dominator tree:
3506 (a) Any external function on the callee list that is not marked
3507 tm_callable is irrevocable. Push all callers of such onto
3510 (b) For each function on the worklist, mark each block that
3511 contains an irrevocable call. Use the AND operator to
3512 propagate that mark up the dominator tree.
3514 (c) If we reach the entry block for a possible transactional
3515 clone, then the transactional clone is irrevocable, and
3516 we should not create the clone after all. Push all
3517 callers onto the worklist.
3519 (d) Place tm_irrevocable calls at the beginning of the relevant
3520 blocks. Special case here is the entry block for the entire
3521 transaction region; there we mark it GTMA_DOES_GO_IRREVOCABLE for
3522 the library to begin the region in serial mode. Decrement
3523 the call count for all callees in the irrevocable region.
3525 (3) Create the transactional clones:
3527 Any tm_callee that still has a non-zero call count is cloned.
3530 /* This structure is stored in the AUX field of each cgraph_node. */
3531 struct tm_ipa_cg_data
3533 /* The clone of the function that got created. */
3534 struct cgraph_node *clone;
3536 /* The tm regions in the normal function. */
3537 struct tm_region *all_tm_regions;
3539 /* The blocks of the normal/clone functions that contain irrevocable
3540 calls, or blocks that are post-dominated by irrevocable calls. */
3541 bitmap irrevocable_blocks_normal;
3542 bitmap irrevocable_blocks_clone;
3544 /* The blocks of the normal function that are involved in transactions. */
3545 bitmap transaction_blocks_normal;
3547 /* The number of callers to the transactional clone of this function
3548 from normal and transactional clones respectively. */
3549 unsigned tm_callers_normal;
3550 unsigned tm_callers_clone;
3552 /* True if all calls to this function's transactional clone
3553 are irrevocable. Also automatically true if the function
3554 has no transactional clone. */
3555 bool is_irrevocable;
3557 /* Flags indicating the presence of this function in various queues. */
3558 bool in_callee_queue;
3561 /* Flags indicating the kind of scan desired while in the worklist. */
3562 bool want_irr_scan_normal;
3565 typedef struct cgraph_node *cgraph_node_p;
3567 DEF_VEC_P (cgraph_node_p);
3568 DEF_VEC_ALLOC_P (cgraph_node_p, heap);
3570 typedef VEC (cgraph_node_p, heap) *cgraph_node_queue;
3572 /* Return the ipa data associated with NODE, allocating zeroed memory
3573 if necessary. TRAVERSE_ALIASES is true if we must traverse aliases
3574 and set *NODE accordingly. */
3576 static struct tm_ipa_cg_data *
3577 get_cg_data (struct cgraph_node **node, bool traverse_aliases)
3579 struct tm_ipa_cg_data *d;
3581 if (traverse_aliases && (*node)->alias)
3582 *node = cgraph_get_node ((*node)->thunk.alias);
3584 d = (struct tm_ipa_cg_data *) (*node)->aux;
3588 d = (struct tm_ipa_cg_data *)
3589 obstack_alloc (&tm_obstack.obstack, sizeof (*d));
3590 (*node)->aux = (void *) d;
3591 memset (d, 0, sizeof (*d));
3597 /* Add NODE to the end of QUEUE, unless IN_QUEUE_P indicates that
3598 it is already present. */
3601 maybe_push_queue (struct cgraph_node *node,
3602 cgraph_node_queue *queue_p, bool *in_queue_p)
3607 VEC_safe_push (cgraph_node_p, heap, *queue_p, node);
3611 /* A subroutine of ipa_tm_scan_calls_transaction and ipa_tm_scan_calls_clone.
3612 Queue all callees within block BB. */
3615 ipa_tm_scan_calls_block (cgraph_node_queue *callees_p,
3616 basic_block bb, bool for_clone)
3618 gimple_stmt_iterator gsi;
3620 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3622 gimple stmt = gsi_stmt (gsi);
3623 if (is_gimple_call (stmt) && !is_tm_pure_call (stmt))
3625 tree fndecl = gimple_call_fndecl (stmt);
3628 struct tm_ipa_cg_data *d;
3630 struct cgraph_node *node;
3632 if (is_tm_ending_fndecl (fndecl))
3634 if (find_tm_replacement_function (fndecl))
3637 node = cgraph_get_node (fndecl);
3638 gcc_assert (node != NULL);
3639 d = get_cg_data (&node, true);
3641 pcallers = (for_clone ? &d->tm_callers_clone
3642 : &d->tm_callers_normal);
3645 maybe_push_queue (node, callees_p, &d->in_callee_queue);
3651 /* Scan all calls in NODE that are within a transaction region,
3652 and push the resulting nodes into the callee queue. */
3655 ipa_tm_scan_calls_transaction (struct tm_ipa_cg_data *d,
3656 cgraph_node_queue *callees_p)
3658 struct tm_region *r;
3660 d->transaction_blocks_normal = BITMAP_ALLOC (&tm_obstack);
3661 d->all_tm_regions = all_tm_regions;
3663 for (r = all_tm_regions; r; r = r->next)
3665 VEC (basic_block, heap) *bbs;
3669 bbs = get_tm_region_blocks (r->entry_block, r->exit_blocks, NULL,
3670 d->transaction_blocks_normal, false);
3672 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
3673 ipa_tm_scan_calls_block (callees_p, bb, false);
3675 VEC_free (basic_block, heap, bbs);
3679 /* Scan all calls in NODE as if this is the transactional clone,
3680 and push the destinations into the callee queue. */
3683 ipa_tm_scan_calls_clone (struct cgraph_node *node,
3684 cgraph_node_queue *callees_p)
3686 struct function *fn = DECL_STRUCT_FUNCTION (node->decl);
3689 FOR_EACH_BB_FN (bb, fn)
3690 ipa_tm_scan_calls_block (callees_p, bb, true);
3693 /* The function NODE has been detected to be irrevocable. Push all
3694 of its callers onto WORKLIST for the purpose of re-scanning them. */
3697 ipa_tm_note_irrevocable (struct cgraph_node *node,
3698 cgraph_node_queue *worklist_p)
3700 struct tm_ipa_cg_data *d = get_cg_data (&node, true);
3701 struct cgraph_edge *e;
3703 d->is_irrevocable = true;
3705 for (e = node->callers; e ; e = e->next_caller)
3708 struct cgraph_node *caller;
3710 /* Don't examine recursive calls. */
3711 if (e->caller == node)
3713 /* Even if we think we can go irrevocable, believe the user
3715 if (is_tm_safe_or_pure (e->caller->decl))
3719 d = get_cg_data (&caller, true);
3721 /* Check if the callee is in a transactional region. If so,
3722 schedule the function for normal re-scan as well. */
3723 bb = gimple_bb (e->call_stmt);
3724 gcc_assert (bb != NULL);
3725 if (d->transaction_blocks_normal
3726 && bitmap_bit_p (d->transaction_blocks_normal, bb->index))
3727 d->want_irr_scan_normal = true;
3729 maybe_push_queue (caller, worklist_p, &d->in_worklist);
3733 /* A subroutine of ipa_tm_scan_irr_blocks; return true iff any statement
3734 within the block is irrevocable. */
3737 ipa_tm_scan_irr_block (basic_block bb)
3739 gimple_stmt_iterator gsi;
3742 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3744 gimple stmt = gsi_stmt (gsi);
3745 switch (gimple_code (stmt))
3748 if (is_tm_pure_call (stmt))
3751 fn = gimple_call_fn (stmt);
3753 /* Functions with the attribute are by definition irrevocable. */
3754 if (is_tm_irrevocable (fn))
3757 /* For direct function calls, go ahead and check for replacement
3758 functions, or transitive irrevocable functions. For indirect
3759 functions, we'll ask the runtime. */
3760 if (TREE_CODE (fn) == ADDR_EXPR)
3762 struct tm_ipa_cg_data *d;
3763 struct cgraph_node *node;
3765 fn = TREE_OPERAND (fn, 0);
3766 if (is_tm_ending_fndecl (fn))
3768 if (find_tm_replacement_function (fn))
3771 node = cgraph_get_node(fn);
3772 d = get_cg_data (&node, true);
3774 /* Return true if irrevocable, but above all, believe
3776 if (d->is_irrevocable
3777 && !is_tm_safe_or_pure (fn))
3783 /* ??? The Approved Method of indicating that an inline
3784 assembly statement is not relevant to the transaction
3785 is to wrap it in a __tm_waiver block. This is not
3786 yet implemented, so we can't check for it. */
3787 if (is_tm_safe (current_function_decl))
3789 tree t = build1 (NOP_EXPR, void_type_node, size_zero_node);
3790 SET_EXPR_LOCATION (t, gimple_location (stmt));
3791 TREE_BLOCK (t) = gimple_block (stmt);
3792 error ("%Kasm not allowed in %<transaction_safe%> function", t);
3804 /* For each of the blocks seeded witin PQUEUE, walk the CFG looking
3805 for new irrevocable blocks, marking them in NEW_IRR. Don't bother
3806 scanning past OLD_IRR or EXIT_BLOCKS. */
3809 ipa_tm_scan_irr_blocks (VEC (basic_block, heap) **pqueue, bitmap new_irr,
3810 bitmap old_irr, bitmap exit_blocks)
3812 bool any_new_irr = false;
3815 bitmap visited_blocks = BITMAP_ALLOC (NULL);
3819 basic_block bb = VEC_pop (basic_block, *pqueue);
3821 /* Don't re-scan blocks we know already are irrevocable. */
3822 if (old_irr && bitmap_bit_p (old_irr, bb->index))
3825 if (ipa_tm_scan_irr_block (bb))
3827 bitmap_set_bit (new_irr, bb->index);
3830 else if (exit_blocks == NULL || !bitmap_bit_p (exit_blocks, bb->index))
3832 FOR_EACH_EDGE (e, ei, bb->succs)
3833 if (!bitmap_bit_p (visited_blocks, e->dest->index))
3835 bitmap_set_bit (visited_blocks, e->dest->index);
3836 VEC_safe_push (basic_block, heap, *pqueue, e->dest);
3840 while (!VEC_empty (basic_block, *pqueue));
3842 BITMAP_FREE (visited_blocks);
3847 /* Propagate the irrevocable property both up and down the dominator tree.
3848 BB is the current block being scanned; EXIT_BLOCKS are the edges of the
3849 TM regions; OLD_IRR are the results of a previous scan of the dominator
3850 tree which has been fully propagated; NEW_IRR is the set of new blocks
3851 which are gaining the irrevocable property during the current scan. */
3854 ipa_tm_propagate_irr (basic_block entry_block, bitmap new_irr,
3855 bitmap old_irr, bitmap exit_blocks)
3857 VEC (basic_block, heap) *bbs;
3858 bitmap all_region_blocks;
3860 /* If this block is in the old set, no need to rescan. */
3861 if (old_irr && bitmap_bit_p (old_irr, entry_block->index))
3864 all_region_blocks = BITMAP_ALLOC (&tm_obstack);
3865 bbs = get_tm_region_blocks (entry_block, exit_blocks, NULL,
3866 all_region_blocks, false);
3869 basic_block bb = VEC_pop (basic_block, bbs);
3870 bool this_irr = bitmap_bit_p (new_irr, bb->index);
3871 bool all_son_irr = false;
3875 /* Propagate up. If my children are, I am too, but we must have
3876 at least one child that is. */
3879 FOR_EACH_EDGE (e, ei, bb->succs)
3881 if (!bitmap_bit_p (new_irr, e->dest->index))
3883 all_son_irr = false;
3891 /* Add block to new_irr if it hasn't already been processed. */
3892 if (!old_irr || !bitmap_bit_p (old_irr, bb->index))
3894 bitmap_set_bit (new_irr, bb->index);
3900 /* Propagate down to everyone we immediately dominate. */
3904 for (son = first_dom_son (CDI_DOMINATORS, bb);
3906 son = next_dom_son (CDI_DOMINATORS, son))
3908 /* Make sure block is actually in a TM region, and it
3909 isn't already in old_irr. */
3910 if ((!old_irr || !bitmap_bit_p (old_irr, son->index))
3911 && bitmap_bit_p (all_region_blocks, son->index))
3912 bitmap_set_bit (new_irr, son->index);
3916 while (!VEC_empty (basic_block, bbs));
3918 BITMAP_FREE (all_region_blocks);
3919 VEC_free (basic_block, heap, bbs);
3923 ipa_tm_decrement_clone_counts (basic_block bb, bool for_clone)
3925 gimple_stmt_iterator gsi;
3927 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
3929 gimple stmt = gsi_stmt (gsi);
3930 if (is_gimple_call (stmt) && !is_tm_pure_call (stmt))
3932 tree fndecl = gimple_call_fndecl (stmt);
3935 struct tm_ipa_cg_data *d;
3937 struct cgraph_node *tnode;
3939 if (is_tm_ending_fndecl (fndecl))
3941 if (find_tm_replacement_function (fndecl))
3944 tnode = cgraph_get_node (fndecl);
3945 d = get_cg_data (&tnode, true);
3947 pcallers = (for_clone ? &d->tm_callers_clone
3948 : &d->tm_callers_normal);
3950 gcc_assert (*pcallers > 0);
3957 /* (Re-)Scan the transaction blocks in NODE for calls to irrevocable functions,
3958 as well as other irrevocable actions such as inline assembly. Mark all
3959 such blocks as irrevocable and decrement the number of calls to
3960 transactional clones. Return true if, for the transactional clone, the
3961 entire function is irrevocable. */
3964 ipa_tm_scan_irr_function (struct cgraph_node *node, bool for_clone)
3966 struct tm_ipa_cg_data *d;
3967 bitmap new_irr, old_irr;
3968 VEC (basic_block, heap) *queue;
3971 /* Builtin operators (operator new, and such). */
3972 if (DECL_STRUCT_FUNCTION (node->decl) == NULL
3973 || DECL_STRUCT_FUNCTION (node->decl)->cfg == NULL)
3976 current_function_decl = node->decl;
3977 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
3978 calculate_dominance_info (CDI_DOMINATORS);
3980 d = get_cg_data (&node, true);
3981 queue = VEC_alloc (basic_block, heap, 10);
3982 new_irr = BITMAP_ALLOC (&tm_obstack);
3984 /* Scan each tm region, propagating irrevocable status through the tree. */
3987 old_irr = d->irrevocable_blocks_clone;
3988 VEC_quick_push (basic_block, queue, single_succ (ENTRY_BLOCK_PTR));
3989 if (ipa_tm_scan_irr_blocks (&queue, new_irr, old_irr, NULL))
3991 ipa_tm_propagate_irr (single_succ (ENTRY_BLOCK_PTR), new_irr,
3993 ret = bitmap_bit_p (new_irr, single_succ (ENTRY_BLOCK_PTR)->index);
3998 struct tm_region *region;
4000 old_irr = d->irrevocable_blocks_normal;
4001 for (region = d->all_tm_regions; region; region = region->next)
4003 VEC_quick_push (basic_block, queue, region->entry_block);
4004 if (ipa_tm_scan_irr_blocks (&queue, new_irr, old_irr,
4005 region->exit_blocks))
4006 ipa_tm_propagate_irr (region->entry_block, new_irr, old_irr,
4007 region->exit_blocks);
4011 /* If we found any new irrevocable blocks, reduce the call count for
4012 transactional clones within the irrevocable blocks. Save the new
4013 set of irrevocable blocks for next time. */
4014 if (!bitmap_empty_p (new_irr))
4016 bitmap_iterator bmi;
4019 EXECUTE_IF_SET_IN_BITMAP (new_irr, 0, i, bmi)
4020 ipa_tm_decrement_clone_counts (BASIC_BLOCK (i), for_clone);
4024 bitmap_ior_into (old_irr, new_irr);
4025 BITMAP_FREE (new_irr);
4028 d->irrevocable_blocks_clone = new_irr;
4030 d->irrevocable_blocks_normal = new_irr;
4032 if (dump_file && new_irr)
4035 bitmap_iterator bmi;
4038 dname = lang_hooks.decl_printable_name (current_function_decl, 2);
4039 EXECUTE_IF_SET_IN_BITMAP (new_irr, 0, i, bmi)
4040 fprintf (dump_file, "%s: bb %d goes irrevocable\n", dname, i);
4044 BITMAP_FREE (new_irr);
4046 VEC_free (basic_block, heap, queue);
4048 current_function_decl = NULL;
4053 /* Return true if, for the transactional clone of NODE, any call
4054 may enter irrevocable mode. */
4057 ipa_tm_mayenterirr_function (struct cgraph_node *node)
4059 struct tm_ipa_cg_data *d;
4063 d = get_cg_data (&node, true);
4065 flags = flags_from_decl_or_type (decl);
4067 /* Handle some TM builtins. Ordinarily these aren't actually generated
4068 at this point, but handling these functions when written in by the
4069 user makes it easier to build unit tests. */
4070 if (flags & ECF_TM_BUILTIN)
4073 /* Filter out all functions that are marked. */
4074 if (flags & ECF_TM_PURE)
4076 if (is_tm_safe (decl))
4078 if (is_tm_irrevocable (decl))
4080 if (is_tm_callable (decl))
4082 if (find_tm_replacement_function (decl))
4085 /* If we aren't seeing the final version of the function we don't
4086 know what it will contain at runtime. */
4087 if (cgraph_function_body_availability (node) < AVAIL_AVAILABLE)
4090 /* If the function must go irrevocable, then of course true. */
4091 if (d->is_irrevocable)
4094 /* If there are any blocks marked irrevocable, then the function
4095 as a whole may enter irrevocable. */
4096 if (d->irrevocable_blocks_clone)
4099 /* We may have previously marked this function as tm_may_enter_irr;
4100 see pass_diagnose_tm_blocks. */
4101 if (node->local.tm_may_enter_irr)
4104 /* Recurse on the main body for aliases. In general, this will
4105 result in one of the bits above being set so that we will not
4106 have to recurse next time. */
4108 return ipa_tm_mayenterirr_function (cgraph_get_node (node->thunk.alias));
4110 /* What remains is unmarked local functions without items that force
4111 the function to go irrevocable. */
4115 /* Diagnose calls from transaction_safe functions to unmarked
4116 functions that are determined to not be safe. */
4119 ipa_tm_diagnose_tm_safe (struct cgraph_node *node)
4121 struct cgraph_edge *e;
4123 for (e = node->callees; e ; e = e->next_callee)
4124 if (!is_tm_callable (e->callee->decl)
4125 && e->callee->local.tm_may_enter_irr)
4126 error_at (gimple_location (e->call_stmt),
4127 "unsafe function call %qD within "
4128 "%<transaction_safe%> function", e->callee->decl);
4131 /* Diagnose call from atomic transactions to unmarked functions
4132 that are determined to not be safe. */
4135 ipa_tm_diagnose_transaction (struct cgraph_node *node,
4136 struct tm_region *all_tm_regions)
4138 struct tm_region *r;
4140 for (r = all_tm_regions; r ; r = r->next)
4141 if (gimple_transaction_subcode (r->transaction_stmt) & GTMA_IS_RELAXED)
4143 /* Atomic transactions can be nested inside relaxed. */
4145 ipa_tm_diagnose_transaction (node, r->inner);
4149 VEC (basic_block, heap) *bbs;
4150 gimple_stmt_iterator gsi;
4154 bbs = get_tm_region_blocks (r->entry_block, r->exit_blocks,
4155 r->irr_blocks, NULL, false);
4157 for (i = 0; VEC_iterate (basic_block, bbs, i, bb); ++i)
4158 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4160 gimple stmt = gsi_stmt (gsi);
4163 if (gimple_code (stmt) == GIMPLE_ASM)
4165 error_at (gimple_location (stmt),
4166 "asm not allowed in atomic transaction");
4170 if (!is_gimple_call (stmt))
4172 fndecl = gimple_call_fndecl (stmt);
4174 /* Indirect function calls have been diagnosed already. */
4178 /* Stop at the end of the transaction. */
4179 if (is_tm_ending_fndecl (fndecl))
4181 if (bitmap_bit_p (r->exit_blocks, bb->index))
4186 /* Marked functions have been diagnosed already. */
4187 if (is_tm_pure_call (stmt))
4189 if (is_tm_callable (fndecl))
4192 if (cgraph_local_info (fndecl)->tm_may_enter_irr)
4193 error_at (gimple_location (stmt),
4194 "unsafe function call %qD within "
4195 "atomic transaction", fndecl);
4198 VEC_free (basic_block, heap, bbs);
4202 /* Return a transactional mangled name for the DECL_ASSEMBLER_NAME in
4203 OLD_DECL. The returned value is a freshly malloced pointer that
4204 should be freed by the caller. */
4207 tm_mangle (tree old_asm_id)
4209 const char *old_asm_name;
4212 struct demangle_component *dc;
4215 /* Determine if the symbol is already a valid C++ mangled name. Do this
4216 even for C, which might be interfacing with C++ code via appropriately
4217 ugly identifiers. */
4218 /* ??? We could probably do just as well checking for "_Z" and be done. */
4219 old_asm_name = IDENTIFIER_POINTER (old_asm_id);
4220 dc = cplus_demangle_v3_components (old_asm_name, DMGL_NO_OPTS, &alloc);
4227 sprintf (length, "%u", IDENTIFIER_LENGTH (old_asm_id));
4228 tm_name = concat ("_ZGTt", length, old_asm_name, NULL);
4232 old_asm_name += 2; /* Skip _Z */
4236 case DEMANGLE_COMPONENT_TRANSACTION_CLONE:
4237 case DEMANGLE_COMPONENT_NONTRANSACTION_CLONE:
4238 /* Don't play silly games, you! */
4241 case DEMANGLE_COMPONENT_HIDDEN_ALIAS:
4242 /* I'd really like to know if we can ever be passed one of
4243 these from the C++ front end. The Logical Thing would
4244 seem that hidden-alias should be outer-most, so that we
4245 get hidden-alias of a transaction-clone and not vice-versa. */
4253 tm_name = concat ("_ZGTt", old_asm_name, NULL);
4257 new_asm_id = get_identifier (tm_name);
4264 ipa_tm_mark_needed_node (struct cgraph_node *node)
4266 cgraph_mark_needed_node (node);
4267 /* ??? function_and_variable_visibility will reset
4268 the needed bit, without actually checking. */
4272 /* Callback data for ipa_tm_create_version_alias. */
4273 struct create_version_alias_info
4275 struct cgraph_node *old_node;
4279 /* A subroutine of ipa_tm_create_version, called via
4280 cgraph_for_node_and_aliases. Create new tm clones for each of
4281 the existing aliases. */
4283 ipa_tm_create_version_alias (struct cgraph_node *node, void *data)
4285 struct create_version_alias_info *info
4286 = (struct create_version_alias_info *)data;
4287 tree old_decl, new_decl, tm_name;
4288 struct cgraph_node *new_node;
4290 if (!node->same_body_alias)
4293 old_decl = node->decl;
4294 tm_name = tm_mangle (DECL_ASSEMBLER_NAME (old_decl));
4295 new_decl = build_decl (DECL_SOURCE_LOCATION (old_decl),
4296 TREE_CODE (old_decl), tm_name,
4297 TREE_TYPE (old_decl));
4299 SET_DECL_ASSEMBLER_NAME (new_decl, tm_name);
4300 SET_DECL_RTL (new_decl, NULL);
4302 /* Based loosely on C++'s make_alias_for(). */
4303 TREE_PUBLIC (new_decl) = TREE_PUBLIC (old_decl);
4304 DECL_CONTEXT (new_decl) = DECL_CONTEXT (old_decl);
4305 DECL_LANG_SPECIFIC (new_decl) = DECL_LANG_SPECIFIC (old_decl);
4306 TREE_READONLY (new_decl) = TREE_READONLY (old_decl);
4307 DECL_EXTERNAL (new_decl) = 0;
4308 DECL_ARTIFICIAL (new_decl) = 1;
4309 TREE_ADDRESSABLE (new_decl) = 1;
4310 TREE_USED (new_decl) = 1;
4311 TREE_SYMBOL_REFERENCED (tm_name) = 1;
4313 /* Perform the same remapping to the comdat group. */
4314 if (DECL_ONE_ONLY (new_decl))
4315 DECL_COMDAT_GROUP (new_decl) = tm_mangle (DECL_COMDAT_GROUP (old_decl));
4317 new_node = cgraph_same_body_alias (NULL, new_decl, info->new_decl);
4318 new_node->tm_clone = true;
4319 new_node->local.externally_visible = info->old_node->local.externally_visible;
4320 /* ?? Do not traverse aliases here. */
4321 get_cg_data (&node, false)->clone = new_node;
4323 record_tm_clone_pair (old_decl, new_decl);
4325 if (info->old_node->needed
4326 || ipa_ref_list_first_refering (&info->old_node->ref_list))
4327 ipa_tm_mark_needed_node (new_node);
4331 /* Create a copy of the function (possibly declaration only) of OLD_NODE,
4332 appropriate for the transactional clone. */
4335 ipa_tm_create_version (struct cgraph_node *old_node)
4337 tree new_decl, old_decl, tm_name;
4338 struct cgraph_node *new_node;
4340 old_decl = old_node->decl;
4341 new_decl = copy_node (old_decl);
4343 /* DECL_ASSEMBLER_NAME needs to be set before we call
4344 cgraph_copy_node_for_versioning below, because cgraph_node will
4345 fill the assembler_name_hash. */
4346 tm_name = tm_mangle (DECL_ASSEMBLER_NAME (old_decl));
4347 SET_DECL_ASSEMBLER_NAME (new_decl, tm_name);
4348 SET_DECL_RTL (new_decl, NULL);
4349 TREE_SYMBOL_REFERENCED (tm_name) = 1;
4351 /* Perform the same remapping to the comdat group. */
4352 if (DECL_ONE_ONLY (new_decl))
4353 DECL_COMDAT_GROUP (new_decl) = tm_mangle (DECL_COMDAT_GROUP (old_decl));
4355 new_node = cgraph_copy_node_for_versioning (old_node, new_decl, NULL, NULL);
4356 new_node->local.externally_visible = old_node->local.externally_visible;
4357 new_node->lowered = true;
4358 new_node->tm_clone = 1;
4359 get_cg_data (&old_node, true)->clone = new_node;
4361 if (cgraph_function_body_availability (old_node) >= AVAIL_OVERWRITABLE)
4363 /* Remap extern inline to static inline. */
4364 /* ??? Is it worth trying to use make_decl_one_only? */
4365 if (DECL_DECLARED_INLINE_P (new_decl) && DECL_EXTERNAL (new_decl))
4367 DECL_EXTERNAL (new_decl) = 0;
4368 TREE_PUBLIC (new_decl) = 0;
4369 DECL_WEAK (new_decl) = 0;
4372 tree_function_versioning (old_decl, new_decl, NULL, false, NULL, false,
4376 record_tm_clone_pair (old_decl, new_decl);
4378 cgraph_call_function_insertion_hooks (new_node);
4379 if (old_node->needed
4380 || ipa_ref_list_first_refering (&old_node->ref_list))
4381 ipa_tm_mark_needed_node (new_node);
4383 /* Do the same thing, but for any aliases of the original node. */
4385 struct create_version_alias_info data;
4386 data.old_node = old_node;
4387 data.new_decl = new_decl;
4388 cgraph_for_node_and_aliases (old_node, ipa_tm_create_version_alias,
4393 /* Construct a call to TM_IRREVOCABLE and insert it at the beginning of BB. */
4396 ipa_tm_insert_irr_call (struct cgraph_node *node, struct tm_region *region,
4399 gimple_stmt_iterator gsi;
4402 transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE);
4404 g = gimple_build_call (builtin_decl_explicit (BUILT_IN_TM_IRREVOCABLE),
4405 1, build_int_cst (NULL_TREE, MODE_SERIALIRREVOCABLE));
4407 split_block_after_labels (bb);
4408 gsi = gsi_after_labels (bb);
4409 gsi_insert_before (&gsi, g, GSI_SAME_STMT);
4411 cgraph_create_edge (node,
4412 cgraph_get_create_node
4413 (builtin_decl_explicit (BUILT_IN_TM_IRREVOCABLE)),
4415 compute_call_stmt_bb_frequency (node->decl,
4419 /* Construct a call to TM_GETTMCLONE and insert it before GSI. */
4422 ipa_tm_insert_gettmclone_call (struct cgraph_node *node,
4423 struct tm_region *region,
4424 gimple_stmt_iterator *gsi, gimple stmt)
4426 tree gettm_fn, ret, old_fn, callfn;
4430 old_fn = gimple_call_fn (stmt);
4432 if (TREE_CODE (old_fn) == ADDR_EXPR)
4434 tree fndecl = TREE_OPERAND (old_fn, 0);
4435 tree clone = get_tm_clone_pair (fndecl);
4437 /* By transforming the call into a TM_GETTMCLONE, we are
4438 technically taking the address of the original function and
4439 its clone. Explain this so inlining will know this function
4441 cgraph_mark_address_taken_node (cgraph_get_node (fndecl));
4443 cgraph_mark_address_taken_node (cgraph_get_node (clone));
4446 safe = is_tm_safe (TREE_TYPE (old_fn));
4447 gettm_fn = builtin_decl_explicit (safe ? BUILT_IN_TM_GETTMCLONE_SAFE
4448 : BUILT_IN_TM_GETTMCLONE_IRR);
4449 ret = create_tmp_var (ptr_type_node, NULL);
4450 add_referenced_var (ret);
4453 transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE);
4455 /* Discard OBJ_TYPE_REF, since we weren't able to fold it. */
4456 if (TREE_CODE (old_fn) == OBJ_TYPE_REF)
4457 old_fn = OBJ_TYPE_REF_EXPR (old_fn);
4459 g = gimple_build_call (gettm_fn, 1, old_fn);
4460 ret = make_ssa_name (ret, g);
4461 gimple_call_set_lhs (g, ret);
4463 gsi_insert_before (gsi, g, GSI_SAME_STMT);
4465 cgraph_create_edge (node, cgraph_get_create_node (gettm_fn), g, 0,
4466 compute_call_stmt_bb_frequency (node->decl,
4469 /* Cast return value from tm_gettmclone* into appropriate function
4471 callfn = create_tmp_var (TREE_TYPE (old_fn), NULL);
4472 add_referenced_var (callfn);
4473 g2 = gimple_build_assign (callfn,
4474 fold_build1 (NOP_EXPR, TREE_TYPE (callfn), ret));
4475 callfn = make_ssa_name (callfn, g2);
4476 gimple_assign_set_lhs (g2, callfn);
4477 gsi_insert_before (gsi, g2, GSI_SAME_STMT);
4479 /* ??? This is a hack to preserve the NOTHROW bit on the call,
4480 which we would have derived from the decl. Failure to save
4481 this bit means we might have to split the basic block. */
4482 if (gimple_call_nothrow_p (stmt))
4483 gimple_call_set_nothrow (stmt, true);
4485 gimple_call_set_fn (stmt, callfn);
4487 /* Discarding OBJ_TYPE_REF above may produce incompatible LHS and RHS
4488 for a call statement. Fix it. */
4490 tree lhs = gimple_call_lhs (stmt);
4491 tree rettype = TREE_TYPE (gimple_call_fntype (stmt));
4493 && !useless_type_conversion_p (TREE_TYPE (lhs), rettype))
4497 temp = make_rename_temp (rettype, 0);
4498 gimple_call_set_lhs (stmt, temp);
4500 g2 = gimple_build_assign (lhs,
4501 fold_build1 (VIEW_CONVERT_EXPR,
4502 TREE_TYPE (lhs), temp));
4503 gsi_insert_after (gsi, g2, GSI_SAME_STMT);
4512 /* Helper function for ipa_tm_transform_calls*. Given a call
4513 statement in GSI which resides inside transaction REGION, redirect
4514 the call to either its wrapper function, or its clone. */
4517 ipa_tm_transform_calls_redirect (struct cgraph_node *node,
4518 struct tm_region *region,
4519 gimple_stmt_iterator *gsi,
4520 bool *need_ssa_rename_p)
4522 gimple stmt = gsi_stmt (*gsi);
4523 struct cgraph_node *new_node;
4524 struct cgraph_edge *e = cgraph_edge (node, stmt);
4525 tree fndecl = gimple_call_fndecl (stmt);
4527 /* For indirect calls, pass the address through the runtime. */
4530 *need_ssa_rename_p |=
4531 ipa_tm_insert_gettmclone_call (node, region, gsi, stmt);
4535 /* Handle some TM builtins. Ordinarily these aren't actually generated
4536 at this point, but handling these functions when written in by the
4537 user makes it easier to build unit tests. */
4538 if (flags_from_decl_or_type (fndecl) & ECF_TM_BUILTIN)
4541 /* Fixup recursive calls inside clones. */
4542 /* ??? Why did cgraph_copy_node_for_versioning update the call edges
4543 for recursion but not update the call statements themselves? */
4544 if (e->caller == e->callee && decl_is_tm_clone (current_function_decl))
4546 gimple_call_set_fndecl (stmt, current_function_decl);
4550 /* If there is a replacement, use it. */
4551 fndecl = find_tm_replacement_function (fndecl);
4554 new_node = cgraph_get_create_node (fndecl);
4556 /* ??? Mark all transaction_wrap functions tm_may_enter_irr.
4558 We can't do this earlier in record_tm_replacement because
4559 cgraph_remove_unreachable_nodes is called before we inject
4560 references to the node. Further, we can't do this in some
4561 nice central place in ipa_tm_execute because we don't have
4562 the exact list of wrapper functions that would be used.
4563 Marking more wrappers than necessary results in the creation
4564 of unnecessary cgraph_nodes, which can cause some of the
4565 other IPA passes to crash.
4567 We do need to mark these nodes so that we get the proper
4568 result in expand_call_tm. */
4569 /* ??? This seems broken. How is it that we're marking the
4570 CALLEE as may_enter_irr? Surely we should be marking the
4571 CALLER. Also note that find_tm_replacement_function also
4572 contains mappings into the TM runtime, e.g. memcpy. These
4573 we know won't go irrevocable. */
4574 new_node->local.tm_may_enter_irr = 1;
4578 struct tm_ipa_cg_data *d;
4579 struct cgraph_node *tnode = e->callee;
4581 d = get_cg_data (&tnode, true);
4582 new_node = d->clone;
4584 /* As we've already skipped pure calls and appropriate builtins,
4585 and we've already marked irrevocable blocks, if we can't come
4586 up with a static replacement, then ask the runtime. */
4587 if (new_node == NULL)
4589 *need_ssa_rename_p |=
4590 ipa_tm_insert_gettmclone_call (node, region, gsi, stmt);
4594 fndecl = new_node->decl;
4597 cgraph_redirect_edge_callee (e, new_node);
4598 gimple_call_set_fndecl (stmt, fndecl);
4601 /* Helper function for ipa_tm_transform_calls. For a given BB,
4602 install calls to tm_irrevocable when IRR_BLOCKS are reached,
4603 redirect other calls to the generated transactional clone. */
4606 ipa_tm_transform_calls_1 (struct cgraph_node *node, struct tm_region *region,
4607 basic_block bb, bitmap irr_blocks)
4609 gimple_stmt_iterator gsi;
4610 bool need_ssa_rename = false;
4612 if (irr_blocks && bitmap_bit_p (irr_blocks, bb->index))
4614 ipa_tm_insert_irr_call (node, region, bb);
4618 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4620 gimple stmt = gsi_stmt (gsi);
4622 if (!is_gimple_call (stmt))
4624 if (is_tm_pure_call (stmt))
4627 /* Redirect edges to the appropriate replacement or clone. */
4628 ipa_tm_transform_calls_redirect (node, region, &gsi, &need_ssa_rename);
4631 return need_ssa_rename;
4634 /* Walk the CFG for REGION, beginning at BB. Install calls to
4635 tm_irrevocable when IRR_BLOCKS are reached, redirect other calls to
4636 the generated transactional clone. */
4639 ipa_tm_transform_calls (struct cgraph_node *node, struct tm_region *region,
4640 basic_block bb, bitmap irr_blocks)
4642 bool need_ssa_rename = false;
4645 VEC(basic_block, heap) *queue = NULL;
4646 bitmap visited_blocks = BITMAP_ALLOC (NULL);
4648 VEC_safe_push (basic_block, heap, queue, bb);
4651 bb = VEC_pop (basic_block, queue);
4654 ipa_tm_transform_calls_1 (node, region, bb, irr_blocks);
4656 if (irr_blocks && bitmap_bit_p (irr_blocks, bb->index))
4659 if (region && bitmap_bit_p (region->exit_blocks, bb->index))
4662 FOR_EACH_EDGE (e, ei, bb->succs)
4663 if (!bitmap_bit_p (visited_blocks, e->dest->index))
4665 bitmap_set_bit (visited_blocks, e->dest->index);
4666 VEC_safe_push (basic_block, heap, queue, e->dest);
4669 while (!VEC_empty (basic_block, queue));
4671 VEC_free (basic_block, heap, queue);
4672 BITMAP_FREE (visited_blocks);
4674 return need_ssa_rename;
4677 /* Transform the calls within the TM regions within NODE. */
4680 ipa_tm_transform_transaction (struct cgraph_node *node)
4682 struct tm_ipa_cg_data *d;
4683 struct tm_region *region;
4684 bool need_ssa_rename = false;
4686 d = get_cg_data (&node, true);
4688 current_function_decl = node->decl;
4689 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
4690 calculate_dominance_info (CDI_DOMINATORS);
4692 for (region = d->all_tm_regions; region; region = region->next)
4694 /* If we're sure to go irrevocable, don't transform anything. */
4695 if (d->irrevocable_blocks_normal
4696 && bitmap_bit_p (d->irrevocable_blocks_normal,
4697 region->entry_block->index))
4699 transaction_subcode_ior (region, GTMA_DOES_GO_IRREVOCABLE);
4700 transaction_subcode_ior (region, GTMA_MAY_ENTER_IRREVOCABLE);
4705 ipa_tm_transform_calls (node, region, region->entry_block,
4706 d->irrevocable_blocks_normal);
4709 if (need_ssa_rename)
4710 update_ssa (TODO_update_ssa_only_virtuals);
4713 current_function_decl = NULL;
4716 /* Transform the calls within the transactional clone of NODE. */
4719 ipa_tm_transform_clone (struct cgraph_node *node)
4721 struct tm_ipa_cg_data *d;
4722 bool need_ssa_rename;
4724 d = get_cg_data (&node, true);
4726 /* If this function makes no calls and has no irrevocable blocks,
4727 then there's nothing to do. */
4728 /* ??? Remove non-aborting top-level transactions. */
4729 if (!node->callees && !node->indirect_calls && !d->irrevocable_blocks_clone)
4732 current_function_decl = d->clone->decl;
4733 push_cfun (DECL_STRUCT_FUNCTION (current_function_decl));
4734 calculate_dominance_info (CDI_DOMINATORS);
4737 ipa_tm_transform_calls (d->clone, NULL, single_succ (ENTRY_BLOCK_PTR),
4738 d->irrevocable_blocks_clone);
4740 if (need_ssa_rename)
4741 update_ssa (TODO_update_ssa_only_virtuals);
4744 current_function_decl = NULL;
4747 /* Main entry point for the transactional memory IPA pass. */
4750 ipa_tm_execute (void)
4752 cgraph_node_queue tm_callees = NULL;
4753 /* List of functions that will go irrevocable. */
4754 cgraph_node_queue irr_worklist = NULL;
4756 struct cgraph_node *node;
4757 struct tm_ipa_cg_data *d;
4758 enum availability a;
4761 #ifdef ENABLE_CHECKING
4765 bitmap_obstack_initialize (&tm_obstack);
4767 /* For all local functions marked tm_callable, queue them. */
4768 for (node = cgraph_nodes; node; node = node->next)
4769 if (is_tm_callable (node->decl)
4770 && cgraph_function_body_availability (node) >= AVAIL_OVERWRITABLE)
4772 d = get_cg_data (&node, true);
4773 maybe_push_queue (node, &tm_callees, &d->in_callee_queue);
4776 /* For all local reachable functions... */
4777 for (node = cgraph_nodes; node; node = node->next)
4778 if (node->reachable && node->lowered
4779 && cgraph_function_body_availability (node) >= AVAIL_OVERWRITABLE)
4781 /* ... marked tm_pure, record that fact for the runtime by
4782 indicating that the pure function is its own tm_callable.
4783 No need to do this if the function's address can't be taken. */
4784 if (is_tm_pure (node->decl))
4786 if (!node->local.local)
4787 record_tm_clone_pair (node->decl, node->decl);
4791 current_function_decl = node->decl;
4792 push_cfun (DECL_STRUCT_FUNCTION (node->decl));
4793 calculate_dominance_info (CDI_DOMINATORS);
4795 tm_region_init (NULL);
4798 d = get_cg_data (&node, true);
4800 /* Scan for calls that are in each transaction. */
4801 ipa_tm_scan_calls_transaction (d, &tm_callees);
4803 /* Put it in the worklist so we can scan the function
4804 later (ipa_tm_scan_irr_function) and mark the
4805 irrevocable blocks. */
4806 maybe_push_queue (node, &irr_worklist, &d->in_worklist);
4807 d->want_irr_scan_normal = true;
4811 current_function_decl = NULL;
4814 /* For every local function on the callee list, scan as if we will be
4815 creating a transactional clone, queueing all new functions we find
4817 for (i = 0; i < VEC_length (cgraph_node_p, tm_callees); ++i)
4819 node = VEC_index (cgraph_node_p, tm_callees, i);
4820 a = cgraph_function_body_availability (node);
4821 d = get_cg_data (&node, true);
4823 /* Put it in the worklist so we can scan the function later
4824 (ipa_tm_scan_irr_function) and mark the irrevocable
4826 maybe_push_queue (node, &irr_worklist, &d->in_worklist);
4828 /* Some callees cannot be arbitrarily cloned. These will always be
4829 irrevocable. Mark these now, so that we need not scan them. */
4830 if (is_tm_irrevocable (node->decl))
4831 ipa_tm_note_irrevocable (node, &irr_worklist);
4832 else if (a <= AVAIL_NOT_AVAILABLE
4833 && !is_tm_safe_or_pure (node->decl))
4834 ipa_tm_note_irrevocable (node, &irr_worklist);
4835 else if (a >= AVAIL_OVERWRITABLE)
4837 if (!tree_versionable_function_p (node->decl))
4838 ipa_tm_note_irrevocable (node, &irr_worklist);
4839 else if (!d->is_irrevocable)
4841 /* If this is an alias, make sure its base is queued as well.
4842 we need not scan the callees now, as the base will do. */
4845 node = cgraph_get_node (node->thunk.alias);
4846 d = get_cg_data (&node, true);
4847 maybe_push_queue (node, &tm_callees, &d->in_callee_queue);
4851 /* Add all nodes called by this function into
4852 tm_callees as well. */
4853 ipa_tm_scan_calls_clone (node, &tm_callees);
4858 /* Iterate scans until no more work to be done. Prefer not to use
4859 VEC_pop because the worklist tends to follow a breadth-first
4860 search of the callgraph, which should allow convergance with a
4861 minimum number of scans. But we also don't want the worklist
4862 array to grow without bound, so we shift the array up periodically. */
4863 for (i = 0; i < VEC_length (cgraph_node_p, irr_worklist); ++i)
4865 if (i > 256 && i == VEC_length (cgraph_node_p, irr_worklist) / 8)
4867 VEC_block_remove (cgraph_node_p, irr_worklist, 0, i);
4871 node = VEC_index (cgraph_node_p, irr_worklist, i);
4872 d = get_cg_data (&node, true);
4873 d->in_worklist = false;
4875 if (d->want_irr_scan_normal)
4877 d->want_irr_scan_normal = false;
4878 ipa_tm_scan_irr_function (node, false);
4880 if (d->in_callee_queue && ipa_tm_scan_irr_function (node, true))
4881 ipa_tm_note_irrevocable (node, &irr_worklist);
4884 /* For every function on the callee list, collect the tm_may_enter_irr
4886 VEC_truncate (cgraph_node_p, irr_worklist, 0);
4887 for (i = 0; i < VEC_length (cgraph_node_p, tm_callees); ++i)
4889 node = VEC_index (cgraph_node_p, tm_callees, i);
4890 if (ipa_tm_mayenterirr_function (node))
4892 d = get_cg_data (&node, true);
4893 gcc_assert (d->in_worklist == false);
4894 maybe_push_queue (node, &irr_worklist, &d->in_worklist);
4898 /* Propagate the tm_may_enter_irr bit to callers until stable. */
4899 for (i = 0; i < VEC_length (cgraph_node_p, irr_worklist); ++i)
4901 struct cgraph_node *caller;
4902 struct cgraph_edge *e;
4903 struct ipa_ref *ref;
4906 if (i > 256 && i == VEC_length (cgraph_node_p, irr_worklist) / 8)
4908 VEC_block_remove (cgraph_node_p, irr_worklist, 0, i);
4912 node = VEC_index (cgraph_node_p, irr_worklist, i);
4913 d = get_cg_data (&node, true);
4914 d->in_worklist = false;
4915 node->local.tm_may_enter_irr = true;
4917 /* Propagate back to normal callers. */
4918 for (e = node->callers; e ; e = e->next_caller)
4921 if (!is_tm_safe_or_pure (caller->decl)
4922 && !caller->local.tm_may_enter_irr)
4924 d = get_cg_data (&caller, true);
4925 maybe_push_queue (caller, &irr_worklist, &d->in_worklist);
4929 /* Propagate back to referring aliases as well. */
4930 for (j = 0; ipa_ref_list_refering_iterate (&node->ref_list, j, ref); j++)
4932 caller = ref->refering.cgraph_node;
4933 if (ref->use == IPA_REF_ALIAS
4934 && !caller->local.tm_may_enter_irr)
4936 /* ?? Do not traverse aliases here. */
4937 d = get_cg_data (&caller, false);
4938 maybe_push_queue (caller, &irr_worklist, &d->in_worklist);
4943 /* Now validate all tm_safe functions, and all atomic regions in
4945 for (node = cgraph_nodes; node; node = node->next)
4946 if (node->reachable && node->lowered
4947 && cgraph_function_body_availability (node) >= AVAIL_OVERWRITABLE)
4949 d = get_cg_data (&node, true);
4950 if (is_tm_safe (node->decl))
4951 ipa_tm_diagnose_tm_safe (node);
4952 else if (d->all_tm_regions)
4953 ipa_tm_diagnose_transaction (node, d->all_tm_regions);
4956 /* Create clones. Do those that are not irrevocable and have a
4957 positive call count. Do those publicly visible functions that
4958 the user directed us to clone. */
4959 for (i = 0; i < VEC_length (cgraph_node_p, tm_callees); ++i)
4963 node = VEC_index (cgraph_node_p, tm_callees, i);
4964 if (node->same_body_alias)
4967 a = cgraph_function_body_availability (node);
4968 d = get_cg_data (&node, true);
4970 if (a <= AVAIL_NOT_AVAILABLE)
4971 doit = is_tm_callable (node->decl);
4972 else if (a <= AVAIL_AVAILABLE && is_tm_callable (node->decl))
4974 else if (!d->is_irrevocable
4975 && d->tm_callers_normal + d->tm_callers_clone > 0)
4979 ipa_tm_create_version (node);
4982 /* Redirect calls to the new clones, and insert irrevocable marks. */
4983 for (i = 0; i < VEC_length (cgraph_node_p, tm_callees); ++i)
4985 node = VEC_index (cgraph_node_p, tm_callees, i);
4988 d = get_cg_data (&node, true);
4990 ipa_tm_transform_clone (node);
4993 for (node = cgraph_nodes; node; node = node->next)
4994 if (node->reachable && node->lowered
4995 && cgraph_function_body_availability (node) >= AVAIL_OVERWRITABLE)
4997 d = get_cg_data (&node, true);
4998 if (d->all_tm_regions)
4999 ipa_tm_transform_transaction (node);
5002 /* Free and clear all data structures. */
5003 VEC_free (cgraph_node_p, heap, tm_callees);
5004 VEC_free (cgraph_node_p, heap, irr_worklist);
5005 bitmap_obstack_release (&tm_obstack);
5007 for (node = cgraph_nodes; node; node = node->next)
5010 #ifdef ENABLE_CHECKING
5017 struct simple_ipa_opt_pass pass_ipa_tm =
5023 ipa_tm_execute, /* execute */
5026 0, /* static_pass_number */
5027 TV_TRANS_MEM, /* tv_id */
5028 PROP_ssa | PROP_cfg, /* properties_required */
5029 0, /* properties_provided */
5030 0, /* properties_destroyed */
5031 0, /* todo_flags_start */
5032 TODO_dump_func, /* todo_flags_finish */
5036 #include "gt-trans-mem.h"